netdev - Re: [PATCH net 2/3] rhashtable: better high order allocation attempts

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] [thread-next>] [day] [month] [year] [list]

Message-ID: <54E70B16.70402@iogearbox.net>
Date:	Fri, 20 Feb 2015 11:23:18 +0100
From:	Daniel Borkmann <daniel@...earbox.net>
To:	David Laight <David.Laight@...LAB.COM>,
	"davem@...emloft.net" <davem@...emloft.net>
CC:	"tgraf@...g.ch" <tgraf@...g.ch>,
	"johunt@...mai.com" <johunt@...mai.com>,
	"netdev@...r.kernel.org" <netdev@...r.kernel.org>
Subject: Re: [PATCH net 2/3] rhashtable: better high order allocation attempts

On 02/20/2015 11:11 AM, David Laight wrote:
...
> How about a two-level array for large tables?
> Then you don't need to allocate more than 1 page at a time?

Sorry, I currently don't see how this fits into the rhashtable
algorithm i.e. with regards to the expansion and shrink logic?
--
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