Zach Brown 4163236fc1 scoutfs: dirent hashes use linear probing ...

The current mechanism for dealing with dirent name hash collisions is to
use multiple hash functions.  This won't work great with the btree where
it's expensive to search multiple distant items for a given entry.

Instead of having multiple full precision functions we linearly probe a
given number of hash values after the initial name hash.  Now the slow
colliding path walks adjacent items in the tree instead of bouncing
around the tree.

Signed-off-by: Zach Brown <zab@versity.com>

2016-05-02 21:55:39 -07:00

kmod

scoutfs: dirent hashes use linear probing

2016-05-02 21:55:39 -07:00

Description

No description provided

6.7 MiB

Languages

C 87.2%

Shell 9.1%

Roff 2.5%

TeX 0.9%

Makefile 0.3%