-
Notifications
You must be signed in to change notification settings - Fork 740
/
Copy pathtest-bloom-filter.c
241 lines (174 loc) · 6.04 KB
/
test-bloom-filter.c
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
240
241
/*
Copyright (c) 2005-2008, Simon Howard
Permission to use, copy, modify, and/or distribute this software
for any purpose with or without fee is hereby granted, provided
that the above copyright notice and this permission notice appear
in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR
CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT,
NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include "alloc-testing.h"
#include "framework.h"
#include "bloom-filter.h"
#include "hash-string.h"
void test_bloom_filter_new_free(void)
{
BloomFilter *filter;
/* One salt */
filter = bloom_filter_new(128, string_hash, 1);
assert(filter != NULL);
bloom_filter_free(filter);
/* Maximum number of salts */
filter = bloom_filter_new(128, string_hash, 64);
assert(filter != NULL);
bloom_filter_free(filter);
/* Test creation with too many salts */
filter = bloom_filter_new(128, string_hash, 50000);
assert(filter == NULL);
/* Test out of memory scenario */
alloc_test_set_limit(0);
filter = bloom_filter_new(128, string_hash, 1);
assert(filter == NULL);
alloc_test_set_limit(1);
filter = bloom_filter_new(128, string_hash, 1);
assert(filter == NULL);
}
void test_bloom_filter_insert_query(void)
{
BloomFilter *filter;
/* Create a filter */
filter = bloom_filter_new(128, string_hash, 4);
/* Check values are not present at the start */
assert(bloom_filter_query(filter, "test 1") == 0);
assert(bloom_filter_query(filter, "test 2") == 0);
/* Insert some values */
bloom_filter_insert(filter, "test 1");
bloom_filter_insert(filter, "test 2");
/* Check they are set */
assert(bloom_filter_query(filter, "test 1") != 0);
assert(bloom_filter_query(filter, "test 2") != 0);
bloom_filter_free(filter);
}
void test_bloom_filter_read_load(void)
{
BloomFilter *filter1;
BloomFilter *filter2;
unsigned char state[16];
/* Create a filter with some values set */
filter1 = bloom_filter_new(128, string_hash, 4);
bloom_filter_insert(filter1, "test 1");
bloom_filter_insert(filter1, "test 2");
/* Read the current state into an array */
bloom_filter_read(filter1, state);
bloom_filter_free(filter1);
/* Create a new filter and load the state */
filter2 = bloom_filter_new(128, string_hash, 4);
bloom_filter_load(filter2, state);
/* Check the values are set in the new filter */
assert(bloom_filter_query(filter2, "test 1") != 0);
assert(bloom_filter_query(filter2, "test 2") != 0);
bloom_filter_free(filter2);
}
void test_bloom_filter_intersection(void)
{
BloomFilter *filter1;
BloomFilter *filter2;
BloomFilter *result;
/* Create one filter with both values set */
filter1 = bloom_filter_new(128, string_hash, 4);
bloom_filter_insert(filter1, "test 1");
bloom_filter_insert(filter1, "test 2");
/* Create second filter with only one value set */
filter2 = bloom_filter_new(128, string_hash, 4);
bloom_filter_insert(filter2, "test 1");
/* For this test, we need this to be definitely not present.
* Note that this could theoretically return non-zero here,
* depending on the hash function. */
assert(bloom_filter_query(filter2, "test 2") == 0);
/* Intersection */
result = bloom_filter_intersection(filter1, filter2);
/* test 1 should be set, as it is in both
* test 2 should not be set, as it is not present in both */
assert(bloom_filter_query(result, "test 1") != 0);
assert(bloom_filter_query(result, "test 2") == 0);
bloom_filter_free(result);
/* Test out of memory scenario */
alloc_test_set_limit(0);
result = bloom_filter_intersection(filter1, filter2);
assert(result == NULL);
bloom_filter_free(filter1);
bloom_filter_free(filter2);
}
void test_bloom_filter_union(void)
{
BloomFilter *filter1;
BloomFilter *filter2;
BloomFilter *result;
/* Create one filter with both values set */
filter1 = bloom_filter_new(128, string_hash, 4);
bloom_filter_insert(filter1, "test 1");
/* Create second filter with only one value set */
filter2 = bloom_filter_new(128, string_hash, 4);
bloom_filter_insert(filter2, "test 2");
/* Union */
result = bloom_filter_union(filter1, filter2);
/* Both should be present */
assert(bloom_filter_query(result, "test 1") != 0);
assert(bloom_filter_query(result, "test 2") != 0);
bloom_filter_free(result);
/* Test out of memory scenario */
alloc_test_set_limit(0);
result = bloom_filter_union(filter1, filter2);
assert(result == NULL);
bloom_filter_free(filter1);
bloom_filter_free(filter2);
}
/* Test attempts to do union/intersection of mismatched filters */
void test_bloom_filter_mismatch(void)
{
BloomFilter *filter1;
BloomFilter *filter2;
/* Create one filter with both values set */
filter1 = bloom_filter_new(128, string_hash, 4);
/* Different buffer size. */
filter2 = bloom_filter_new(64, string_hash, 4);
assert(bloom_filter_intersection(filter1, filter2) == NULL);
assert(bloom_filter_union(filter1, filter2) == NULL);
bloom_filter_free(filter2);
/* Different hash function */
filter2 = bloom_filter_new(128, string_nocase_hash, 4);
assert(bloom_filter_intersection(filter1, filter2) == NULL);
assert(bloom_filter_union(filter1, filter2) == NULL);
bloom_filter_free(filter2);
/* Different number of salts */
filter2 = bloom_filter_new(128, string_hash, 32);
assert(bloom_filter_intersection(filter1, filter2) == NULL);
assert(bloom_filter_union(filter1, filter2) == NULL);
bloom_filter_free(filter2);
bloom_filter_free(filter1);
}
/* clang-format off */
static UnitTestFunction tests[] = {
test_bloom_filter_new_free,
test_bloom_filter_insert_query,
test_bloom_filter_read_load,
test_bloom_filter_intersection,
test_bloom_filter_union,
test_bloom_filter_mismatch,
NULL
};
/* clang-format on */
int main(int argc, char *argv[])
{
run_tests(tests);
return 0;
}