|From:||ebiederm-AT-xmission.com (Eric W. Biederman)|
|To:||Sasha Levin <levinsasha928-AT-gmail.com>|
|Subject:||Re: [RFC 1/4] hashtable: introduce a small and naive hashtable|
|Date:||Thu, 02 Aug 2012 09:40:38 -0700|
|Cc:||Josh Triplett <josh-AT-joshtriplett.org>, Tejun Heo <tj-AT-kernel.org>, torvalds-AT-linux-foundation.org, akpm-AT-linux-foundation.org, linux-kernel-AT-vger.kernel.org, linux-mm-AT-kvack.org, paul.gortmaker-AT-windriver.com|
Sasha Levin <email@example.com> writes: > Heh, I've started working on it in April, and just returned to this. Didn't think about rebasing to something new. > > will fix - Thanks! You might want to look at some of the work that Eric Dumazet has done in the networking stack with rcu hashtables that can be resized. For a trivial hash table I don't know if the abstraction is worth it. For a hash table that starts off small and grows as big as you need it the incent to use a hash table abstraction seems a lot stronger. Eric -- To unsubscribe, send a message with 'unsubscribe linux-mm' in the body to firstname.lastname@example.org. For more info on Linux MM, see: http://www.linux-mm.org/ . Don't email: <a href=mailto:"email@example.com"> firstname.lastname@example.org </a>
Copyright © 2012, Eklektix, Inc.
Comments and public postings are copyrighted by their creators.
Linux is a registered trademark of Linus Torvalds