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
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
|
/* PSPP - a program for statistical analysis.
Copyright (C) 1997-9, 2000, 2008, 2009, 2010, 2011 Free Software Foundation, Inc.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <config.h>
#include "libpspp/hash-functions.h"
#include <assert.h>
#include <ctype.h>
#include <math.h>
#include <stdint.h>
#include <string.h>
/* Based on http://burtleburtle.net/bob/c/lookup3.c, by Bob
Jenkins <bob_jenkins@burtleburtle.net>, as retrieved on April
8, 2009. The license information there says the following:
"You can use this free for any purpose. It's in the public
domain. It has no warranty." and "You may use this code any
way you wish, private, educational, or commercial. It's
free." */
#define HASH_ROT(x, k) (((x) << (k)) | ((x) >> (32 - (k))))
#define HASH_MIX(a, b, c) \
do \
{ \
a -= c; a ^= HASH_ROT (c, 4); c += b; \
b -= a; b ^= HASH_ROT (a, 6); a += c; \
c -= b; c ^= HASH_ROT (b, 8); b += a; \
a -= c; a ^= HASH_ROT (c, 16); c += b; \
b -= a; b ^= HASH_ROT (a, 19); a += c; \
c -= b; c ^= HASH_ROT (b, 4); b += a; \
} \
while (0)
#define HASH_FINAL(a, b, c) \
do \
{ \
c ^= b; c -= HASH_ROT (b, 14); \
a ^= c; a -= HASH_ROT (c, 11); \
b ^= a; b -= HASH_ROT (a, 25); \
c ^= b; c -= HASH_ROT (b, 16); \
a ^= c; a -= HASH_ROT (c, 4); \
b ^= a; b -= HASH_ROT (a, 14); \
c ^= b; c -= HASH_ROT (b, 24); \
} \
while (0)
/* Returns a hash value for the N bytes starting at P, starting
from BASIS. */
unsigned int
hash_bytes (const void *p_, size_t n, unsigned int basis)
{
const uint8_t *p = p_;
uint32_t a, b, c;
uint32_t tmp[3];
a = b = c = 0xdeadbeef + n + basis;
while (n >= 12)
{
memcpy (tmp, p, 12);
a += tmp[0];
b += tmp[1];
c += tmp[2];
HASH_MIX (a, b, c);
n -= 12;
p += 12;
}
if (n > 0)
{
memset (tmp, 0, 12);
memcpy (tmp, p, n);
a += tmp[0];
b += tmp[1];
c += tmp[2];
}
HASH_FINAL (a, b, c);
return c;
}
/* Returns a hash value for null-terminated string S, starting
from BASIS. */
unsigned int
hash_string (const char *s, unsigned int basis)
{
return hash_bytes (s, strlen (s), basis);
}
/* Returns a hash value for the N bytes at S, with lowercase and uppercase
letters treated as equal, starting from BASIS. */
unsigned int
hash_case_bytes (const void *s_, size_t n, unsigned int basis)
{
const char *s = s_;
uint32_t a, b, c;
uint32_t tmp[3];
int i;
a = b = c = 0xdeadbeef + n + basis;
while (n >= 12)
{
for (i = 0; i < 12; i++)
((unsigned char *)tmp)[i] = toupper ((unsigned char) s[i]);
a += tmp[0];
b += tmp[1];
c += tmp[2];
HASH_MIX (a, b, c);
n -= 12;
s += 12;
}
if (n > 0)
{
memset (tmp, 0, 12);
for (i = 0; i < n; i++)
((unsigned char *)tmp)[i] = toupper ((unsigned char) s[i]);
a += tmp[0];
b += tmp[1];
c += tmp[2];
}
HASH_FINAL (a, b, c);
return c;
}
/* Returns a hash value for null-terminated string S, with
lowercase and uppercase letters treated as equal, starting
from BASIS. */
unsigned int
hash_case_string (const char *s, unsigned int basis)
{
return hash_case_bytes (s, strlen (s), basis);
}
/* Returns a hash value for integer X, starting from BASIS. */
unsigned int
hash_int (int x, unsigned int basis)
{
x -= x << 6;
x ^= x >> 17;
x -= x << 9;
x ^= x << 4;
x -= x << 3;
x ^= x << 10;
x ^= x >> 15;
return x + basis;
}
/* Returns a hash value for double D, starting from BASIS. */
unsigned int
hash_double (double d, unsigned int basis)
{
if (sizeof (double) == 8)
{
uint32_t tmp[2];
uint32_t a, b, c;
a = b = c = 0xdeadbeef + 8 + basis;
memcpy (tmp, &d, 8);
a += tmp[0];
b += tmp[1];
HASH_FINAL (a, b, c);
return c;
}
else
return hash_bytes (&d, sizeof d, basis);
}
/* Returns a hash value for pointer P, starting from BASIS. */
unsigned int
hash_pointer (const void *p, unsigned int basis)
{
/* Casting to uintptr_t before casting to int suppresses a GCC warning about
on 64-bit platforms. */
return hash_int ((int) (uintptr_t) p, basis);
}
|
