summaryrefslogtreecommitdiff
path: root/include/linux
diff options
context:
space:
mode:
authorJakub Kicinski <kuba@kernel.org>2026-03-05 03:54:12 +0300
committerJakub Kicinski <kuba@kernel.org>2026-03-05 03:54:13 +0300
commitdb739ff277b4ba8713224a334d7e388d04473725 (patch)
tree40ce3bd11cefc6f440d0664f68a0d62853630243 /include/linux
parentc26b8c4e291c55c7b2138d7bcb27348ca3a5ae59 (diff)
parenta435163d3100b044d620990772a5ce1684ff02ca (diff)
downloadlinux-db739ff277b4ba8713224a334d7e388d04473725.tar.xz
Merge branch 'rfs-use-high-order-allocations-for-hash-tables'
Eric Dumazet says: ==================== rfs: use high-order allocations for hash tables This series adds rps_tag_ptr which encodes both a pointer and a size of a power-of-two hash table in a single long word. RFS hash tables (global and per rx-queue) are converted to rps_tag_ptr. This removes a cache line miss, and allows high-order allocations. The global hash table can benefit from huge pages. ==================== Link: https://patch.msgid.link/20260302181432.1836150-1-edumazet@google.com Signed-off-by: Jakub Kicinski <kuba@kernel.org>
Diffstat (limited to 'include/linux')
0 files changed, 0 insertions, 0 deletions