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
|
#include <ccan/invbloom/invbloom.h>
/* Include the C files directly. */
#include <ccan/invbloom/invbloom.c>
#include <ccan/tap/tap.h>
int main(void)
{
struct invbloom *ib;
const tal_t *ctx = tal(NULL, char);
int val, val2, *ip, *ip2, i;
/* This is how many tests you plan to run */
plan_tests(127);
ib = invbloom_new(ctx, int, 1, 100);
ok1(tal_parent(ib) == ctx);
ok1(ib->id_size == sizeof(int));
ok1(ib->salt == 100);
ok1(ib->n_elems == 1);
ok1(invbloom_empty(ib));
val = 0;
invbloom_insert(ib, &val);
ok1(ib->count[0] == NUM_HASHES);
ok1(!invbloom_empty(ib));
invbloom_delete(ib, &val);
ok1(invbloom_empty(ib));
val2 = 2;
invbloom_insert(ib, &val);
invbloom_insert(ib, &val2);
ok1(!invbloom_empty(ib));
invbloom_delete(ib, &val);
ok1(!invbloom_empty(ib));
invbloom_delete(ib, &val2);
ok1(invbloom_empty(ib));
tal_free(ib);
ib = invbloom_new(ctx, int, 1, 100);
ok1(tal_parent(ib) == ctx);
ok1(ib->id_size == sizeof(int));
ok1(ib->salt == 100);
ok1(ib->n_elems == 1);
ok1(invbloom_empty(ib));
val = 0;
invbloom_insert(ib, &val);
ok1(ib->count[0] == NUM_HASHES);
ok1(!invbloom_empty(ib));
invbloom_delete(ib, &val);
ok1(invbloom_empty(ib));
val2 = 2;
invbloom_insert(ib, &val);
invbloom_insert(ib, &val2);
ok1(!invbloom_empty(ib));
invbloom_delete(ib, &val);
ok1(!invbloom_empty(ib));
invbloom_delete(ib, &val2);
ok1(invbloom_empty(ib));
tal_free(ib);
/* Now, a more realistic test. */
for (i = 0; i < 5; i++) {
ib = invbloom_new(ctx, int, 1024, i);
invbloom_insert(ib, &val);
invbloom_insert(ib, &val2);
ok1(invbloom_get(ib, &val));
ok1(invbloom_get(ib, &val2));
ip = invbloom_extract_negative(ctx, ib);
ok1(!ip);
ip = invbloom_extract(ctx, ib);
ok1(ip);
ok1(tal_parent(ip) == ctx);
ok1(*ip == val || *ip == val2);
ip2 = invbloom_extract(ctx, ib);
ok1(ip2);
ok1(tal_parent(ip2) == ctx);
ok1(*ip2 == val || *ip2 == val2);
ok1(*ip2 != *ip);
ok1(invbloom_extract(ctx, ib) == NULL);
invbloom_delete(ib, &val);
invbloom_delete(ib, &val2);
ip = invbloom_extract(ctx, ib);
ok1(!ip);
ip = invbloom_extract_negative(ctx, ib);
ok1(ip);
ok1(tal_parent(ip) == ctx);
ok1(*ip == val || *ip == val2);
ip2 = invbloom_extract_negative(ctx, ib);
ok1(ip2);
ok1(tal_parent(ip2) == ctx);
ok1(*ip2 == val || *ip2 == val2);
ok1(*ip2 != *ip);
ok1(invbloom_extract_negative(ctx, ib) == NULL);
ok1(invbloom_empty(ib));
tal_free(ib);
}
tal_free(ctx);
/* This exits depending on whether all tests passed */
return exit_status();
}
|
