1. 11 7月, 2011 1 次提交
    • D
      neigh: Store hash shift instead of mask. · cd089336
      David S. Miller 提交于
      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: NDavid S. Miller <davem@davemloft.net>
      cd089336
  2. 10 7月, 2011 1 次提交
  3. 09 7月, 2011 7 次提交
  4. 08 7月, 2011 18 次提交
  5. 07 7月, 2011 13 次提交