netdev - Re: [ANNOUNCE]: First release of nftables

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [day] [month] [year] [list]

Date:	Wed, 18 Mar 2009 15:58:55 +0100
From:	Patrick McHardy <kaber@...sh.net>
To:	Denys Fedoryschenko <denys@...p.net.lb>
CC:	Meelis Roos <mroos@...ux.ee>, netdev@...r.kernel.org
Subject: Re: [ANNOUNCE]: First release of nftables

Denys Fedoryschenko wrote:
> On Wednesday 18 March 2009 16:39:39 Patrick McHardy wrote:
>> On top it has far smaller code and less memory usage as soon as
>> you have more than one CPU, its lockless, no default counters,
>> no overhead for unused chains, etc etc.
>>
>> When the time has come, I will of course post benchmarks.
>>
> Thanks a lot for your code Patrick.
> I will try as soon as i can.
> 
> I dont think hash and rbtrees is suboptimal.
> I have really a lot of situations where i need large set of ip's or ports to 
> be added in similar rule, which is forced to be linear. And if i even build 
> tree manually - it will be really headache to add new hosts.
> 
> nftables looks very promissing in this case

Yes, but we can easily decrease the overhead per data item using
something different. A bigger fanout factor would additionally
decrease lookup times.
--
To unsubscribe from this list: send the line "unsubscribe netdev" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html