j3d1/tinc
1
0
Fork 0
Code Issues 1 Pull requests Releases Wiki Activity

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

Browse source
This commit is contained in:
Guus Sliepen 2012-10-09 17:49:09 +02:00
parent d1ec010660
commit 0ed0cc6f9c
1 changed files with 3 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
src/hash.c
View file

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