1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
|
#include <string.h>
#include <ctype.h>
/* assumes sizeof(unsigned)==4 */
#define rot(x, k) (((x)<<(k)) ^ ((x)>>(32-(k))))
/* mix 3 32 bit values reversibly */
#define mix(a, b, c) { \
a -= c; a ^= rot(c, 4); c += b; \
b -= a; b ^= rot(a, 6); a += c; \
c -= b; c ^= rot(b, 8); b += a; \
a -= c; a ^= rot(c, 16); c += b; \
b -= a; b ^= rot(a, 19); a += c; \
c -= b; c ^= rot(b, 4); b += a; \
}
/* final mixing of 3 32-bit values (a, b, c) into c */
#define final(a, b, c) { \
c ^= b; c -= rot(b, 14); \
a ^= c; a -= rot(c, 11); \
b ^= a; b -= rot(a, 25); \
c ^= b; c -= rot(b, 16); \
a ^= c; a -= rot(c, 4); \
b ^= a; b -= rot(a, 14); \
c ^= b; c -= rot(b, 24); \
}
#define SEED 0x9e3779b9
int genht_strcasecmp(const char *s1, const char *s2)
{
for(; (*s1 != '\0') && (*s2 != '\0') && ((*s1 == *s2) || (tolower(*s1) == tolower(*s2))); s1++, s2++);
return tolower(*s1) - tolower(*s2);
}
/* not for strings: does unaligned access and reads past the end of key */
/* bob jenkins: lookup 3 */
unsigned jenhash(const void *key, unsigned len) {
unsigned a, b, c;
const unsigned *k = (const unsigned *)key;
a = b = c = SEED;
while (len > 12) {
a += *k++;
b += *k++;
c += *k++;
mix(a, b, c)
len -= 12;
}
switch (len) {
case 12: c+=k[2]; b+=k[1]; a+=k[0]; break;
case 11: c+=k[2]&0xffffff; b+=k[1]; a+=k[0]; break;
case 10: c+=k[2]&0xffff; b+=k[1]; a+=k[0]; break;
case 9 : c+=k[2]&0xff; b+=k[1]; a+=k[0]; break;
case 8 : b+=k[1]; a+=k[0]; break;
case 7 : b+=k[1]&0xffffff; a+=k[0]; break;
case 6 : b+=k[1]&0xffff; a+=k[0]; break;
case 5 : b+=k[1]&0xff; a+=k[0]; break;
case 4 : a+=k[0]; break;
case 3 : a+=k[0]&0xffffff; break;
case 2 : a+=k[0]&0xffff; break;
case 1 : a+=k[0]&0xff; break;
}
final(a, b, c)
return c;
}
unsigned jenhash32(unsigned k) {
unsigned a, b, c;
a = b = c = SEED;
a += k;
final(a, b, c)
return c;
}
/* austin appleby: murmur 2 */
unsigned murmurhash(const void *key, unsigned len) {
enum { m = 0x5bd1e995, r = 24 };
unsigned h = SEED ^ len;
const unsigned char *data = (const unsigned char *)key;
while(len >= 4) {
unsigned k = *(unsigned *)data;
k *= m;
k ^= k >> r;
k *= m;
h *= m;
h ^= k;
data += 4;
len -= 4;
}
switch(len) {
case 3: h ^= data[2] << 16;
case 2: h ^= data[1] << 8;
case 1: h ^= data[0];
h *= m;
}
h ^= h >> 13;
h *= m;
h ^= h >> 15;
return h;
}
unsigned murmurhash32(unsigned k) {
return murmurhash(&k, 4);
}
/* simple hash for aligned pointers */
unsigned ptrhash(const void *k) {
const unsigned long n = (const unsigned long)k;
return (n >> 2) ^ (n >> 12);
}
/* simple string hash */
unsigned strhash(const char *key) {
const unsigned char *p = (const unsigned char *)key;
unsigned h = SEED;
while (*p)
h += (h << 2) + *p++;
return h;
}
/* simple string hash, case-insensitive */
unsigned strhash_case(const char *key) {
const unsigned char *p = (const unsigned char *)key;
unsigned h = SEED;
while (*p)
h += (h << 2) + tolower(*p++);
return h;
}
/* case sensitive string keyeq */
int strkeyeq(const char *a, const char *b)
{
return !strcmp(a, b);
}
/* case insensitive string keyeq */
int strkeyeq_case(const char *a, const char *b)
{
return !genht_strcasecmp(a, b);
}
/* pointer match for htp*_t */
int ptrkeyeq(const void *a, const void *b)
{
return a == b;
}
unsigned longhash(long int l)
{
return l;
}
int longkeyeq(long a, long b)
{
return a == b;
}
|
