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
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
|
/*
* Copyright (c) 2009, Rambler media
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY Rambler media ''AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL Rambler BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include "bloom.h"
/* 4 bits are used for counting (implementing delete operation) */
#define SIZE_BIT 4
/* These macroes are for 4 bits for counting element */
#define INCBIT(a, n, acc) do { \
acc = a[n * SIZE_BIT / CHAR_BIT] & (0xF << (n % (CHAR_BIT / SIZE_BIT) * SIZE_BIT)); \
acc ++; \
acc &= 0xF; \
\
a[n * SIZE_BIT / CHAR_BIT] &= (0xF << (4 - (n % (CHAR_BIT/SIZE_BIT) * SIZE_BIT))); \
a[n * SIZE_BIT / CHAR_BIT] |= (acc << (n % (CHAR_BIT/SIZE_BIT) * SIZE_BIT)); \
} while (0);
#define DECBIT(a, n, acc) do { \
acc = a[n * SIZE_BIT / CHAR_BIT] & (0xF << (n % (CHAR_BIT / SIZE_BIT) * SIZE_BIT)); \
acc --; \
acc &= 0xF; \
\
a[n * SIZE_BIT / CHAR_BIT] &= (0xF << (4 - (n % (CHAR_BIT/SIZE_BIT) * SIZE_BIT))); \
a[n * SIZE_BIT / CHAR_BIT] |= (acc << (n % (CHAR_BIT/SIZE_BIT) * SIZE_BIT)); \
} while (0);
#define GETBIT(a, n) (a[n * SIZE_BIT / CHAR_BIT] & (0xF << (n % (CHAR_BIT/SIZE_BIT) * SIZE_BIT)))
/* Common hash functions */
unsigned int
bloom_sax_hash(const char *key)
{
unsigned int h = 0;
while(*key) h ^= (h<<5) + (h>>2) + (unsigned char)*key++;
return h;
}
unsigned int
bloom_sdbm_hash(const char *key)
{
unsigned int h = 0;
while(*key) h = (unsigned char)*key++ + (h<<6) + (h<<16) - h;
return h;
}
unsigned int
bloom_fnv_hash (const char *key)
{
unsigned int h = 0;
while (*key) {
h ^= (unsigned char)*key++;
h += (h<<1) + (h<<4) + (h<<7) + (h<<8) + (h<<24);
}
return h;
}
unsigned int
bloom_rs_hash (const char *key)
{
unsigned int b = 378551;
unsigned int a = 63689;
unsigned int hash = 0;
while (*key) {
hash = hash * a + (unsigned char)*key++;
a = a * b;
}
return hash;
}
unsigned int
bloom_js_hash (const char *key)
{
unsigned int hash = 1315423911;
while (*key) {
hash ^= ((hash << 5) + (unsigned char)*key++ + (hash >> 2));
}
return hash;
}
unsigned int
bloom_elf_hash (const char *key)
{
unsigned int hash = 0;
unsigned int x = 0;
while (*key) {
hash = (hash << 4) + (unsigned char)*key++;
if((x = hash & 0xF0000000L) != 0) {
hash ^= (x >> 24);
}
hash &= ~x;
}
return hash;
}
unsigned int
bloom_bkdr_hash (const char *key)
{
unsigned int seed = 131; /* 31 131 1313 13131 131313 etc.. */
unsigned int hash = 0;
while (*key) {
hash = (hash * seed) + (unsigned char)*key ++;
}
return hash;
}
unsigned int
bloom_ap_hash (const char *key)
{
unsigned int hash = 0xAAAAAAAA;
unsigned int i = 0;
while (*key) {
hash ^= ((i & 1) == 0) ? ((hash << 7) ^ ((unsigned char)*key) * (hash >> 3)) :
(~((hash << 11) + (((unsigned char)*key) ^ (hash >> 5))));
key++;
}
return hash;
}
bloom_filter_t *
bloom_create (size_t size, size_t nfuncs, ...)
{
bloom_filter_t *bloom;
va_list l;
int n;
if (!(bloom = g_malloc (sizeof (bloom_filter_t)))) {
return NULL;
}
if (!(bloom->a = g_new (char, (size + CHAR_BIT - 1) / CHAR_BIT * SIZE_BIT))) {
g_free (bloom);
return NULL;
}
if (!(bloom->funcs = (hashfunc_t *) g_malloc (nfuncs * sizeof (hashfunc_t)))) {
g_free (bloom->a);
g_free (bloom);
return NULL;
}
va_start (l, nfuncs);
for (n = 0; n < nfuncs; ++n) {
bloom->funcs[n] = va_arg (l, hashfunc_t);
}
va_end (l);
bloom->nfuncs = nfuncs;
bloom->asize = size;
return bloom;
}
void
bloom_destroy (bloom_filter_t *bloom)
{
g_free (bloom->a);
g_free (bloom->funcs);
g_free (bloom);
}
gboolean
bloom_add (bloom_filter_t *bloom, const char *s)
{
size_t n;
u_char t;
for (n = 0; n < bloom->nfuncs; ++n) {
INCBIT (bloom->a, bloom->funcs[n] (s) % bloom->asize, t);
}
return TRUE;
}
gboolean
bloom_del (bloom_filter_t *bloom, const char *s)
{
size_t n;
u_char t;
for (n = 0; n < bloom->nfuncs; ++n) {
DECBIT (bloom->a, bloom->funcs[n] (s) % bloom->asize, t);
}
return TRUE;
}
gboolean
bloom_check (bloom_filter_t * bloom, const char *s)
{
size_t n;
for (n = 0; n < bloom->nfuncs; ++n) {
if (!(GETBIT (bloom->a, bloom->funcs[n] (s) % bloom->asize)))
return FALSE;
}
return TRUE;
}
|
