Page MenuHomeFreeBSD

libalias: Switch to efficient data structure for incoming traffic

Authored by donner on May 28 2021, 9:00 PM.
Referenced Files
Unknown Object (File)
Sun, Apr 7, 12:05 PM
Unknown Object (File)
Sun, Apr 7, 11:17 AM
Unknown Object (File)
Sun, Mar 31, 1:48 PM
Unknown Object (File)
Mar 16 2024, 8:23 AM
Unknown Object (File)
Mar 10 2024, 4:39 AM
Unknown Object (File)
Feb 20 2024, 9:10 PM
Unknown Object (File)
Feb 16 2024, 8:16 AM
Unknown Object (File)
Feb 5 2024, 2:15 PM



Current data structure is using a hash of unordered lists. Those
unordered lists are quite efficient, because the least recently
inserted entries are most likely to used again. In order to avoid
long search times in other cases, the lists are hashed in to many
buckets. Unfortunatly a search for a miss needs an exhaustive
inspection and a careful definition of the hash.

Splay trees offer a similar feature (almost O(1) for access of the
least recently used entries), and amortized O(ln(n)) for almost all
other cases. Get rid of the hash.

Depends on D30516

Diff Detail

rG FreeBSD src repository
Lint Not Applicable
Tests Not Applicable

Event Timeline

This revision was not accepted when it landed; it landed in state Needs Review.Jun 19 2021, 8:29 PM
This revision was automatically updated to reflect the committed changes.