mirror of
https://github.com/MariaDB/server.git
synced 2025-01-22 14:54:20 +01:00
29 lines
986 B
C
29 lines
986 B
C
// FNV Hash: From an idea sent by Glenn Fowler and Phong Vo to the IEEE POSIX 1003.2 committee. Landon Curt Noll improved it.
|
|
// See: http://isthe.com/chongo/tech/comp/fnv/
|
|
static inline unsigned int hash_key (const unsigned char *key, unsigned long keylen) {
|
|
unsigned long i;
|
|
unsigned int hash=0;
|
|
for (i=0; i<keylen; i++, key++) {
|
|
hash *= 16777619;
|
|
// GCC 4.1.2 -O2 and -O3 translates the following shifts back into the multiply shown on the line above here.
|
|
// So much for optimizing this multiplication...
|
|
//hash += (hash<<1) + (hash<<4) + (hash<<7) + (hash<<8) + (hash<<24);
|
|
hash ^= *key;
|
|
}
|
|
return hash;
|
|
}
|
|
|
|
#if 0
|
|
static unsigned int hash_key (const char *key, ITEMLEN keylen) {
|
|
/* From Sedgewick. There are probably better hash functions. */
|
|
unsigned int b = 378551;
|
|
unsigned int a = 63689;
|
|
unsigned int hash = 0;
|
|
ITEMLEN i;
|
|
for (i = 0; i < keylen; i++ ) {
|
|
hash = hash * a + key[i];
|
|
a *= b;
|
|
}
|
|
return hash;
|
|
}
|
|
#endif
|