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
|
//
// Copyright 2018 Staysail Systems, Inc. <info@staysail.tech>
// Copyright 2018 Capitar IT Group BV <info@capitar.com>
//
// This software is supplied under the terms of the MIT License, a
// copy of which should be located in the distribution where this
// file was obtained (LICENSE.txt). A copy of the license may also be
// found online at https://opensource.org/licenses/MIT.
//
#include "core/idhash.c"
#include "convey.h"
#include "core/nng_impl.h"
Main({
nni_init();
atexit(nni_fini);
Test("General ID Hash", {
int rv;
Convey("Given an id hash", {
nni_idhash *h = NULL;
So(nni_idhash_init(&h) == 0);
So(h != NULL);
So(nni_idhash_count(h) == 0);
Reset({ nni_idhash_fini(h); });
Convey("We can insert an element", {
char *five = "five";
char *four = "four";
rv = nni_idhash_insert(h, 5, five);
So(nni_idhash_count(h) == 1);
So(rv == 0);
Convey("And we can find it", {
void *ptr;
rv = nni_idhash_find(h, 5, &ptr);
So(rv == 0);
So(ptr == five);
});
Convey("We can delete it", {
void *ptr;
rv = nni_idhash_remove(h, 5);
So(rv == 0);
rv = nni_idhash_find(h, 5, &ptr);
So(rv == NNG_ENOENT);
});
Convey("We can change the value", {
void *ptr;
So(nni_idhash_insert(h, 5, four) == 0);
So(nni_idhash_count(h) == 1);
So(nni_idhash_find(h, 5, &ptr) == 0);
So(ptr == four);
});
Convey("We can insert a hash collision", {
void *ptr;
So(nni_idhash_insert(h, 13, four) ==
0);
So(nni_idhash_count(h) == 2);
So(nni_idhash_find(h, 5, &ptr) == 0);
So(ptr == five);
So(nni_idhash_find(h, 13, &ptr) == 0);
So(ptr == four);
Convey("And delete intermediate", {
So(nni_idhash_remove(h, 5) ==
0);
ptr = NULL;
So(nni_idhash_find(
h, 13, &ptr) == 0);
So(ptr == four);
});
});
});
Convey("We cannot find bogus values", {
void *ptr;
ptr = NULL;
rv = nni_idhash_find(h, 42, &ptr);
So(rv == NNG_ENOENT);
So(ptr == NULL);
});
Convey("64-bit hash values work", {
char * huge = "huge";
void * ptr = NULL;
uint64_t hugenum = 0x1234567890ULL;
nni_idhash_set_limits(h, 1, 1ULL << 63, 1);
So(nni_idhash_insert(h, hugenum, huge) == 0);
So(nni_idhash_find(h, hugenum, &ptr) == 0);
So((char *) ptr == huge);
});
Convey("64-bit dynvals work", {
char * huge = "dynhuge";
void * ptr = NULL;
uint64_t id;
nni_idhash_set_limits(
h, 1ULL << 32, 1ULL << 63, 1);
So(nni_idhash_alloc(h, &id, huge) == 0);
So(id > 0xffffffff);
So(nni_idhash_find(h, id, &ptr) == 0);
So((char *) ptr == huge);
});
});
});
Test("Resize ID Hash", {
int expect[1024];
int i;
for (i = 0; i < 1024; i++) {
expect[i] = i;
}
Convey("Given an id hash", {
nni_idhash *h;
So(nni_idhash_init(&h) == 0);
So(nni_idhash_count(h) == 0);
Reset({ nni_idhash_fini(h); });
Convey("We can insert 1024 items", {
for (i = 0; i < 1024; i++) {
nni_idhash_insert(h, i, &expect[i]);
}
So(nni_idhash_count(h) == 1024);
Convey("We can remove them", {
for (i = 0; i < 1024; i++) {
nni_idhash_remove(h, i);
}
So(nni_idhash_count(h) == 0);
});
});
});
});
Test("Dynamic ID generation", {
Convey("Given a small ID hash", {
nni_idhash *h;
int expect[5];
uint64_t id;
So(nni_idhash_init(&h) == 0);
Reset({ nni_idhash_fini(h); });
nni_idhash_set_limits(h, 10, 13, 10);
So(1);
Convey("We can fill the table", {
for (uint64_t i = 0; i < 4; i++) {
So(nni_idhash_alloc(
h, &id, &expect[i]) == 0);
So(id == (i + 10));
}
Convey("Adding another fails", {
So(nni_idhash_alloc(h, &id,
&expect[5]) == NNG_ENOMEM);
});
Convey("Deleting one lets us reinsert", {
nni_idhash_remove(h, 11);
So(nni_idhash_alloc(
h, &id, &expect[5]) == 0);
So(id == 11);
});
});
Convey("We can insert outside range forcibly", {
So(nni_idhash_insert(h, 1, &expect[0]) == 0);
So(nni_idhash_insert(h, 100, &expect[0]) == 0);
So(nni_idhash_alloc(h, &id, &expect[1]) == 0);
So(id >= 10);
So(id <= 13);
});
});
});
});
|
