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 PHC | |
Open Source and information security mailing list archives
| ||
|
Date: Mon, 5 Feb 2007 10:41:39 -0800 (PST)
From: akepner@....com
To: linux@...izon.com
cc: davem@...emloft.net, netdev@...r.kernel.org
Subject: Re: [RFC/TOY]Extensible hashing and RCU
On Sat, 4 Feb 2007 linux@...izon.com wrote:
> I noticed in an LCA talk mention that apprently extensible hashing
> with RCU access is an unsolved problem. Here's an idea for solving it.
>
> I'm assuming the table is a power of 2 in size with open chaining
> for collisions. When the chains get too long, the table is doubled.
> When the chains get too short, the table size is halved.
> .....
For purposes of discussion, I've attached a "toy" implementation
for doing dynamic resizing of a hashtable. It is useless, except
as a proof of concept.
I think this is very similar to what you are describing, no?
--
Arthur
View attachment "nethash.c" of type "TEXT/PLAIN" (18987 bytes)
Powered by blists - more mailing lists