lkml.org 
[lkml]   [2012]   [Mar]   [3]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: Word-at-a-time dcache name accesses (was Re: .. anybody know ofany filesystems that depend on the exact VFS 'namehash' implementation?)
On Sun, Mar 04, 2012 at 11:27:01AM +0900, Tetsuo Handa wrote:
> A passer-by's mumble.
>
> We are discussing about systems with huge "struct dentry" instances where
> selecting a hash list based on "struct qstr"->hash cannot effectively narrow
> down candidates to compare, aren't we?

This is effectively a simple bloom filter.

Would be only worth it if longer hash chains are common. And if that's the case
we should probably have either a larger table or a better hash (or both)

-Andi


\
 
 \ /
  Last update: 2012-03-04 05:33    [W:0.131 / U:0.052 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site