netdev - [PATCH net-next 0/2] rhashtable: Quick initial table growth

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

Date:	Thu, 30 Apr 2015 22:46:43 +0000
From:	Thomas Graf <tgraf@...g.ch>
To:	davem@...emloft.net
Cc:	netdev@...r.kernel.org, herbert@...dor.apana.org.au,
	kaber@...sh.net
Subject: [PATCH net-next 0/2] rhashtable: Quick initial table growth

Besides a trivial cleanup. This proposes to introduce a quicker growth
algorithm for very small table sizes to avoid a large number of resize
cycles to go through. I experienced up to 15 chained resizes when
growing from small table sizes. A typical use case where this matters
is the nft set restore if no hint for the table size is given.

Thomas Graf (2):
  rhashtable: Simplify iterator code
  rhashtable: Quick initial growth of tables

 lib/rhashtable.c | 45 +++++++++++++++++++++++++++++++++++++--------
 1 file changed, 37 insertions(+), 8 deletions(-)

-- 
1.9.3

--
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