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
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
|
/*
* Copyright (C) Igor Sysoev
* Copyright (C) NGINX, Inc.
*/
#include <nxt_main.h>
#include "nxt_tests.h"
static nxt_int_t
nxt_lvlhsh_test_key_test(nxt_lvlhsh_query_t *lhq, void *data)
{
if (*(uintptr_t *) lhq->key.start == (uintptr_t) data) {
return NXT_OK;
}
return NXT_DECLINED;
}
static const nxt_lvlhsh_proto_t malloc_proto nxt_aligned(64) = {
//NXT_LVLHSH_LARGE_MEMALIGN,
NXT_LVLHSH_DEFAULT,
nxt_lvlhsh_test_key_test,
nxt_lvlhsh_alloc,
nxt_lvlhsh_free,
};
static const nxt_lvlhsh_proto_t pool_proto nxt_aligned(64) = {
NXT_LVLHSH_LARGE_SLAB,
nxt_lvlhsh_test_key_test,
nxt_mp_lvlhsh_alloc,
nxt_mp_lvlhsh_free,
};
static nxt_int_t
nxt_lvlhsh_test_add(nxt_lvlhsh_t *lh, const nxt_lvlhsh_proto_t *proto,
void *pool, uintptr_t key)
{
nxt_lvlhsh_query_t lhq;
lhq.key_hash = key;
lhq.replace = 0;
lhq.key.length = sizeof(uintptr_t);
lhq.key.start = (u_char *) &key;
lhq.value = (void *) key;
lhq.proto = proto;
lhq.pool = pool;
switch (nxt_lvlhsh_insert(lh, &lhq)) {
case NXT_OK:
return NXT_OK;
case NXT_DECLINED:
nxt_thread_log_alert("lvlhsh test failed: "
"key %p is already in hash", key);
/* Fall through. */
default:
return NXT_ERROR;
}
}
static nxt_int_t
nxt_lvlhsh_test_get(nxt_lvlhsh_t *lh, const nxt_lvlhsh_proto_t *proto,
uintptr_t key)
{
nxt_lvlhsh_query_t lhq;
lhq.key_hash = key;
lhq.key.length = sizeof(uintptr_t);
lhq.key.start = (u_char *) &key;
lhq.proto = proto;
if (nxt_lvlhsh_find(lh, &lhq) == NXT_OK) {
if (key == (uintptr_t) lhq.value) {
return NXT_OK;
}
}
nxt_thread_log_alert("lvlhsh test failed: "
"key %p not found in hash", key);
return NXT_ERROR;
}
static nxt_int_t
nxt_lvlhsh_test_delete(nxt_lvlhsh_t *lh, const nxt_lvlhsh_proto_t *proto,
void *pool, uintptr_t key)
{
nxt_int_t ret;
nxt_lvlhsh_query_t lhq;
lhq.key_hash = key;
lhq.key.length = sizeof(uintptr_t);
lhq.key.start = (u_char *) &key;
lhq.proto = proto;
lhq.pool = pool;
ret = nxt_lvlhsh_delete(lh, &lhq);
if (ret != NXT_OK) {
nxt_thread_log_alert("lvlhsh test failed: "
"key %p not found in hash", key);
}
return ret;
}
nxt_int_t
nxt_lvlhsh_test(nxt_thread_t *thr, nxt_uint_t n, nxt_bool_t use_pool)
{
void *value;
uint32_t key;
nxt_mp_t *mp;
nxt_nsec_t start, end;
nxt_uint_t i;
nxt_lvlhsh_t lh;
nxt_lvlhsh_each_t lhe;
const nxt_lvlhsh_proto_t *proto;
const size_t min_chunk_size = 32;
const size_t page_size = 1024;
const size_t page_alignment = 128;
const size_t cluster_size = 4096;
nxt_thread_time_update(thr);
start = nxt_thread_monotonic_time(thr);
if (use_pool) {
mp = nxt_mp_create(cluster_size, page_alignment, page_size,
min_chunk_size);
if (mp == NULL) {
return NXT_ERROR;
}
nxt_log_error(NXT_LOG_NOTICE, thr->log,
"lvlhsh test started: %uD pool", n);
proto = &pool_proto;
} else {
nxt_log_error(NXT_LOG_NOTICE, thr->log,
"lvlhsh test started: %uD malloc", n);
proto = &malloc_proto;
mp = NULL;
}
nxt_memzero(&lh, sizeof(nxt_lvlhsh_t));
key = 0;
for (i = 0; i < n; i++) {
key = nxt_murmur_hash2(&key, sizeof(uint32_t));
if (nxt_lvlhsh_test_add(&lh, proto, mp, key) != NXT_OK) {
nxt_log_error(NXT_LOG_NOTICE, thr->log,
"lvlhsh add test failed at %ui", i);
return NXT_ERROR;
}
}
key = 0;
for (i = 0; i < n; i++) {
key = nxt_murmur_hash2(&key, sizeof(uint32_t));
if (nxt_lvlhsh_test_get(&lh, proto, key) != NXT_OK) {
return NXT_ERROR;
}
}
nxt_lvlhsh_each_init(&lhe, proto);
for (i = 0; i < n + 1; i++) {
if (nxt_lvlhsh_each(&lh, &lhe) == NULL) {
break;
}
}
if (i != n) {
nxt_log_error(NXT_LOG_NOTICE, thr->log,
"lvlhsh each test failed at %ui of %ui", i, n);
return NXT_ERROR;
}
for (i = 0; i < n; i++) {
value = nxt_lvlhsh_peek(&lh, proto);
if (value == NULL) {
break;
}
key = (uintptr_t) value;
if (nxt_lvlhsh_test_delete(&lh, proto, mp, key) != NXT_OK) {
return NXT_ERROR;
}
}
if (i != n) {
nxt_log_error(NXT_LOG_NOTICE, thr->log,
"lvlhsh peek test failed at %ui of %ui", i, n);
return NXT_ERROR;
}
if (!nxt_lvlhsh_is_empty(&lh)) {
nxt_log_error(NXT_LOG_NOTICE, thr->log,
"lvlhsh is not empty after deletion");
return NXT_ERROR;
}
key = 0;
for (i = 0; i < n; i++) {
key = nxt_murmur_hash2(&key, sizeof(uint32_t));
if (nxt_lvlhsh_test_add(&lh, proto, mp, key) != NXT_OK) {
nxt_log_error(NXT_LOG_NOTICE, thr->log,
"lvlhsh add test failed at %ui", i);
return NXT_ERROR;
}
}
for (i = 0; i < n; i++) {
value = nxt_lvlhsh_retrieve(&lh, proto, mp);
if (value == NULL) {
break;
}
}
if (i != n) {
nxt_log_error(NXT_LOG_NOTICE, thr->log,
"lvlhsh retrieve test failed at %ui of %ui", i, n);
return NXT_ERROR;
}
if (!nxt_lvlhsh_is_empty(&lh)) {
nxt_log_error(NXT_LOG_NOTICE, thr->log,
"lvlhsh is not empty after retrieving");
return NXT_ERROR;
}
if (mp != NULL) {
if (!nxt_mp_is_empty(mp)) {
nxt_log_error(NXT_LOG_NOTICE, thr->log, "mem pool is not empty");
return NXT_ERROR;
}
nxt_mp_destroy(mp);
}
nxt_thread_time_update(thr);
end = nxt_thread_monotonic_time(thr);
nxt_log_error(NXT_LOG_NOTICE, thr->log, "lvlhsh test passed: %0.3fs",
(end - start) / 1000000000.0);
return NXT_OK;
}
|
