[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <20251113194029.5d4cf9d7@pumpkin>
Date: Thu, 13 Nov 2025 19:40:29 +0000
From: David Laight <david.laight.linux@...il.com>
To: Eric Dumazet <edumazet@...gle.com>
Cc: Scott Mitchell <scott.k.mitch1@...il.com>, pablo@...filter.org,
kadlec@...filter.org, fw@...len.de, phil@....cc, davem@...emloft.net,
kuba@...nel.org, pabeni@...hat.com, horms@...nel.org,
netfilter-devel@...r.kernel.org, coreteam@...filter.org,
netdev@...r.kernel.org, linux-kernel@...r.kernel.org, Scott Mitchell
<scott_mitchell@...le.com>
Subject: Re: [PATCH v2] netfilter: nfnetlink_queue: optimize verdict lookup
with hash table
On Thu, 13 Nov 2025 02:25:24 -0800
Eric Dumazet <edumazet@...gle.com> wrote:
> On Thu, Nov 13, 2025 at 1:26 AM Scott Mitchell <scott.k.mitch1@...il.com> wrote:
....
> I do not think this is an efficient hash function.
>
> queue->id_sequence is monotonically increasing (controlled by the
> kernel : __nfqnl_enqueue_packet(), not user space).
If id_sequence is allocated by the kernel, is there any requirement
that the values be sequential rather than just unique?
If they don't need to be sequential then the kernel can pick an 'id' value
such that 'id & mask' is unique for all 'live' id values.
Then the hash becomes 'perfect' and degenerates into a simple array lookup.
Just needs a bit of housekeeping...
David
Powered by blists - more mailing lists