diff options
| author | David S. Miller <davem@davemloft.net> | 2011-12-29 00:06:58 +0400 |
|---|---|---|
| committer | David S. Miller <davem@davemloft.net> | 2011-12-29 00:06:58 +0400 |
| commit | 2c2aba6c561ac425602f4a0be61422224cb87151 (patch) | |
| tree | 30b5f2c40b823ca61e2e0930d5e98a89a83222bb /include/net/neighbour.h | |
| parent | 32288eb4d940b10e40c6d4178fe3a40d1437d2f8 (diff) | |
| download | linux-2c2aba6c561ac425602f4a0be61422224cb87151.tar.xz | |
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 'include/net/neighbour.h')
| -rw-r--r-- | include/net/neighbour.h | 6 |
1 files changed, 4 insertions, 2 deletions
diff --git a/include/net/neighbour.h b/include/net/neighbour.h index e31f0a86f9b7..34c996f46181 100644 --- a/include/net/neighbour.h +++ b/include/net/neighbour.h @@ -139,10 +139,12 @@ struct pneigh_entry { * neighbour table manipulation */ +#define NEIGH_NUM_HASH_RND 4 + struct neigh_hash_table { struct neighbour __rcu **hash_buckets; unsigned int hash_shift; - __u32 hash_rnd; + __u32 hash_rnd[NEIGH_NUM_HASH_RND]; struct rcu_head rcu; }; @@ -154,7 +156,7 @@ struct neigh_table { int key_len; __u32 (*hash)(const void *pkey, const struct net_device *dev, - __u32 hash_rnd); + __u32 *hash_rnd); int (*constructor)(struct neighbour *); int (*pconstructor)(struct pneigh_entry *); void (*pdestructor)(struct pneigh_entry *); |