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
| ||
|
Message-ID: <20150220120120.GC4586@casper.infradead.org> Date: Fri, 20 Feb 2015 12:01:20 +0000 From: Thomas Graf <tgraf@...g.ch> To: Daniel Borkmann <daniel@...earbox.net> Cc: davem@...emloft.net, johunt@...mai.com, netdev@...r.kernel.org Subject: Re: [PATCH net 2/3] rhashtable: better high order allocation attempts On 02/20/15 at 12:53am, Daniel Borkmann wrote: > When trying to allocate future tables via bucket_table_alloc(), it seems > overkill on large table shifts that we probe for kzalloc() unconditionally > first, as it's likely to fail. > > Only probe with kzalloc() for more reasonable table sizes and use vzalloc() > either as a fallback on failure or directly in case of large table sizes. > > Fixes: 7e1e77636e36 ("lib: Resizable, Scalable, Concurrent Hash Table") > Signed-off-by: Daniel Borkmann <daniel@...earbox.net> Acked-by: Thomas Graf <tgraf@...g.ch> -- 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
Powered by blists - more mailing lists