lkml.org 
[lkml]   [1999]   [Jun]   [17]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: dynamic hash table allocation
On Thu, 17 Jun 1999, Chuck Lever wrote:

>i've included a simple shift-add replacement for the current buffer hash
>function. the buffer hash logic is now like the other hashes; there

According to me the right thing would be to alloc all the memory without
using GFP. Please take a look at:

ftp://ftp.suse.com/pub/people/andrea/kernel-patches/2.2.10_andrea-VM6.gz

I also rewrote from scratch the buffer dynamic allocation. With my code
you can choose at compile time (not a config option but a #define in
buffer.c) the number of buffers you want to take hashed in the same bucket
supposing the hashfn is perfect and all the memory is alloced in buffers.

Andrea Arcangeli


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

\
 
 \ /
  Last update: 2005-03-22 13:52    [W:0.690 / U:0.020 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site