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