tree e2f46e4b4270c7403a895339df93d9bbefb7c363
parent d84e0bd7971eb8357c700151ee4e8e4101ee65fa
author David S. Miller <davem@davemloft.net> 1310372892 -0700
committer David S. Miller <davem@davemloft.net> 1310372892 -0700

neigh: Store hash shift instead of mask.

And mask the hash function result by simply shifting
down the "->hash_shift" most significant bits.

Currently which bits we use is arbitrary since jhash
produces entropy evenly across the whole hash function
result.

But soon we'll be using universal hashing functions,
and in those cases more entropy exists in the higher
bits than the lower bits, because they use multiplies.

Signed-off-by: David S. Miller <davem@davemloft.net>