Skip to content

Conversation

@fredlawl
Copy link
Contributor

No description provided.

Kernel Patches Daemon and others added 3 commits October 31, 2025 09:39
Matching on 1 bit produces a binary tree structure such that when
densely populated for 32bit prefixes, creates a tree with a height
of at most 32.

We have found that this introduces significant cache miss opportunity,
thus slowing down lookup performance. Improve this by cutting the
height of the tree to 8 given the same scenario.

While the memory footprint increases for sparsely populated trees, the
max memory uses for a densely populated trie remains about the same.

Suggested-by: Jesper Dangaard Brouer <[email protected]> (Cloudflare)
Suggested-by: Matt Fleming <[email protected]> (Cloudflare)
Signed-off-by: Frederick Lawler <[email protected]>
Separate documentation from previous commit for separate review
comments. Squash in final merge.

Signed-off-by: Frederick Lawler <[email protected]>
@kernel-patches-daemon-bpf kernel-patches-daemon-bpf bot force-pushed the bpf-next_base branch 6 times, most recently from de0745f to efe6edf Compare November 6, 2025 01:56
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant