linux-kernel - Re: [rfc][patch] dynamic resizing dentry hash using RCU

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: <5FD7605C-E132-4893-86FA-F76DDFB16389@zabbo.net>
Date:	Fri, 23 Feb 2007 09:25:28 -0800
From:	Zach Brown <zab@...bo.net>
To:	Nick Piggin <npiggin@...e.de>
Cc:	Linux Kernel Mailing List <linux-kernel@...r.kernel.org>,
	Davide Libenzi <davidel@...ilserver.org>,
	"Paul E. McKenney" <paulmck@...ux.vnet.ibm.com>
Subject: Re: [rfc][patch] dynamic resizing dentry hash using RCU


On Feb 23, 2007, at 7:37 AM, Nick Piggin wrote:

>
> The dentry hash uses up 8MB for 1 million entries on my 4GB system  
> is one
> of the biggest wasters of memory for me. Because I rarely have more  
> than one or
> two hundred thousand dentries. And that's with several kernel trees  
> worth of
> entries. Most desktop and probably even many types of servers will  
> only use a
> fraction of that.
>
> So I introduce a new method for resizing hash tables with RCU, and  
> apply
> that to the dentry hash.

Can you compare what you've done to the design that Paul and David  
talked about a year ago?

   http://lkml.org/lkml/2006/1/30/74

I'd love to see a generic implementation of RCU hashing that  
subsystems can then take advantage of.  It's long been on the fun  
side of my todo list.  The side I never get to :/.

- z

-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/