Fix hash functions for keys whose size is not divisible by 4.

This commit is contained in:
Guus Sliepen 2012-10-09 17:49:09 +02:00
parent d1ec010660
commit 0ed0cc6f9c

View file

@ -27,10 +27,12 @@
static uint32_t hash_function(const void *p, size_t len) {
const uint8_t *q = p;
uint32_t hash = 0;
while(len > 0) {
while(true) {
for(int i = len > 4 ? 4 : len; --i;)
hash += q[i] << (8 * i);
hash *= 0x9e370001UL; // Golden ratio prime.
if(len <= 4)
break;
len -= 4;
}
return hash;