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>

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 *);