hash.h 2.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081
  1. #ifndef _LINUX_HASH_H
  2. #define _LINUX_HASH_H
  3. /* Fast hashing routine for ints, longs and pointers.
  4. (C) 2002 Nadia Yvette Chambers, IBM */
  5. /*
  6. * Knuth recommends primes in approximately golden ratio to the maximum
  7. * integer representable by a machine word for multiplicative hashing.
  8. * Chuck Lever verified the effectiveness of this technique:
  9. * http://www.citi.umich.edu/techreports/reports/citi-tr-00-1.pdf
  10. *
  11. * These primes are chosen to be bit-sparse, that is operations on
  12. * them can use shifts and additions instead of multiplications for
  13. * machines where multiplications are slow.
  14. */
  15. #include <asm/types.h>
  16. #include <linux/compiler.h>
  17. /* 2^31 + 2^29 - 2^25 + 2^22 - 2^19 - 2^16 + 1 */
  18. #define GOLDEN_RATIO_PRIME_32 0x9e370001UL
  19. /* 2^63 + 2^61 - 2^57 + 2^54 - 2^51 - 2^18 + 1 */
  20. #define GOLDEN_RATIO_PRIME_64 0x9e37fffffffc0001UL
  21. #if BITS_PER_LONG == 32
  22. #define GOLDEN_RATIO_PRIME GOLDEN_RATIO_PRIME_32
  23. #define hash_long(val, bits) hash_32(val, bits)
  24. #elif BITS_PER_LONG == 64
  25. #define hash_long(val, bits) hash_64(val, bits)
  26. #define GOLDEN_RATIO_PRIME GOLDEN_RATIO_PRIME_64
  27. #else
  28. #error Wordsize not 32 or 64
  29. #endif
  30. static __always_inline u64 hash_64(u64 val, unsigned int bits)
  31. {
  32. u64 hash = val;
  33. /* Sigh, gcc can't optimise this alone like it does for 32 bits. */
  34. u64 n = hash;
  35. n <<= 18;
  36. hash -= n;
  37. n <<= 33;
  38. hash -= n;
  39. n <<= 3;
  40. hash += n;
  41. n <<= 3;
  42. hash -= n;
  43. n <<= 4;
  44. hash += n;
  45. n <<= 2;
  46. hash += n;
  47. /* High bits are more random, so use them. */
  48. return hash >> (64 - bits);
  49. }
  50. static inline u32 hash_32(u32 val, unsigned int bits)
  51. {
  52. /* On some cpus multiply is faster, on others gcc will do shifts */
  53. u32 hash = val * GOLDEN_RATIO_PRIME_32;
  54. /* High bits are more random, so use them. */
  55. return hash >> (32 - bits);
  56. }
  57. static inline unsigned long hash_ptr(const void *ptr, unsigned int bits)
  58. {
  59. return hash_long((unsigned long)ptr, bits);
  60. }
  61. static inline u32 hash32_ptr(const void *ptr)
  62. {
  63. unsigned long val = (unsigned long)ptr;
  64. #if BITS_PER_LONG == 64
  65. val ^= (val >> 32);
  66. #endif
  67. return (u32)val;
  68. }
  69. #endif /* _LINUX_HASH_H */