diff options
| author | David S. Miller <davem@davemloft.net> | 2011-12-28 21:06:58 +0100 |
|---|---|---|
| committer | David S. Miller <davem@davemloft.net> | 2011-12-28 21:06:58 +0100 |
| commit | 2c2aba6c561ac425602f4a0be61422224cb87151 (patch) | |
| tree | 30b5f2c40b823ca61e2e0930d5e98a89a83222bb /net/decnet | |
| parent | netrom: avoid overflows in nr_setsockopt() (diff) | |
| download | linux-2c2aba6c561ac425602f4a0be61422224cb87151.tar.xz linux-2c2aba6c561ac425602f4a0be61422224cb87151.zip | |
ipv6: Use universal hash for NDISC.
In order to perform a proper universal hash on a vector of integers,
we have to use different universal hashes on each vector element.
Which means we need 4 different hash randoms for ipv6.
Signed-off-by: David S. Miller <davem@davemloft.net>
Diffstat (limited to 'net/decnet')
| -rw-r--r-- | net/decnet/dn_neigh.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/net/decnet/dn_neigh.c b/net/decnet/dn_neigh.c index 7d2fff29380f..befe426491ba 100644 --- a/net/decnet/dn_neigh.c +++ b/net/decnet/dn_neigh.c @@ -88,9 +88,9 @@ static const struct neigh_ops dn_phase3_ops = { static u32 dn_neigh_hash(const void *pkey, const struct net_device *dev, - __u32 hash_rnd) + __u32 *hash_rnd) { - return jhash_2words(*(__u16 *)pkey, 0, hash_rnd); + return jhash_2words(*(__u16 *)pkey, 0, hash_rnd[0]); } struct neigh_table dn_neigh_table = { |