diff options
| author | Scott Mitchell <scott.k.mitch1@gmail.com> | 2026-01-24 01:09:30 +0300 |
|---|---|---|
| committer | Florian Westphal <fw@strlen.de> | 2026-01-29 11:52:07 +0300 |
| commit | e19079adcd26a25d7d3e586b1837493361fdf8b6 (patch) | |
| tree | db0169206b20d0b70c66cbd47bb70f1cc3ac280b /include/linux | |
| parent | 77fd1b4c6e084619beff1a55cb66e65c6a66615c (diff) | |
| download | linux-e19079adcd26a25d7d3e586b1837493361fdf8b6.tar.xz | |
netfilter: nfnetlink_queue: optimize verdict lookup with hash table
The current implementation uses a linear list to find queued packets by
ID when processing verdicts from userspace. With large queue depths and
out-of-order verdicting, this O(n) lookup becomes a significant
bottleneck, causing userspace verdict processing to dominate CPU time.
Replace the linear search with a hash table for O(1) average-case
packet lookup by ID. A global rhashtable spanning all network
namespaces attributes hash bucket memory to kernel but is subject to
fixed upper bound.
Signed-off-by: Scott Mitchell <scott.k.mitch1@gmail.com>
Signed-off-by: Florian Westphal <fw@strlen.de>
Diffstat (limited to 'include/linux')
0 files changed, 0 insertions, 0 deletions