2017-08-23 00:36:49 +02:00
|
|
|
/*
|
|
|
|
* Utilities for working with hash values.
|
|
|
|
*
|
2019-01-02 18:44:25 +01:00
|
|
|
* Portions Copyright (c) 2017-2019, PostgreSQL Global Development Group
|
2017-08-23 00:36:49 +02:00
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef HASHUTILS_H
|
|
|
|
#define HASHUTILS_H
|
|
|
|
|
|
|
|
/*
|
2017-10-29 08:11:43 +01:00
|
|
|
* Combine two 32-bit hash values, resulting in another hash value, with
|
|
|
|
* decent bit mixing.
|
2017-08-23 00:36:49 +02:00
|
|
|
*
|
|
|
|
* Similar to boost's hash_combine().
|
|
|
|
*/
|
|
|
|
static inline uint32
|
|
|
|
hash_combine(uint32 a, uint32 b)
|
|
|
|
{
|
|
|
|
a ^= b + 0x9e3779b9 + (a << 6) + (a >> 2);
|
|
|
|
return a;
|
|
|
|
}
|
|
|
|
|
2017-10-29 08:11:43 +01:00
|
|
|
/*
|
|
|
|
* Combine two 64-bit hash values, resulting in another hash value, using the
|
|
|
|
* same kind of technique as hash_combine(). Testing shows that this also
|
|
|
|
* produces good bit mixing.
|
|
|
|
*/
|
|
|
|
static inline uint64
|
|
|
|
hash_combine64(uint64 a, uint64 b)
|
|
|
|
{
|
|
|
|
/* 0x49a0f4dd15e5a8e3 is 64bit random data */
|
2017-11-07 19:54:36 +01:00
|
|
|
a ^= b + UINT64CONST(0x49a0f4dd15e5a8e3) + (a << 54) + (a >> 7);
|
2017-10-29 08:11:43 +01:00
|
|
|
return a;
|
|
|
|
}
|
2017-09-22 22:38:42 +02:00
|
|
|
|
|
|
|
/*
|
2017-09-30 00:52:55 +02:00
|
|
|
* Simple inline murmur hash implementation hashing a 32 bit integer, for
|
2017-09-22 22:38:42 +02:00
|
|
|
* performance.
|
|
|
|
*/
|
|
|
|
static inline uint32
|
|
|
|
murmurhash32(uint32 data)
|
|
|
|
{
|
|
|
|
uint32 h = data;
|
|
|
|
|
|
|
|
h ^= h >> 16;
|
|
|
|
h *= 0x85ebca6b;
|
|
|
|
h ^= h >> 13;
|
|
|
|
h *= 0xc2b2ae35;
|
|
|
|
h ^= h >> 16;
|
|
|
|
return h;
|
|
|
|
}
|
|
|
|
|
2017-08-23 00:36:49 +02:00
|
|
|
#endif /* HASHUTILS_H */
|