Commit | Line | Data |
---|---|---|
44151f89 MD |
1 | /* |
2 | * test_urcu_ja.c | |
3 | * | |
4 | * Userspace RCU library - test program | |
5 | * | |
6 | * Copyright 2009-2012 - Mathieu Desnoyers <mathieu.desnoyers@polymtl.ca> | |
7 | * | |
8 | * This program is free software; you can redistribute it and/or modify | |
9 | * it under the terms of the GNU General Public License as published by | |
10 | * the Free Software Foundation; either version 2 of the License, or | |
11 | * (at your option) any later version. | |
12 | * | |
13 | * This program is distributed in the hope that it will be useful, | |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | * GNU General Public License for more details. | |
17 | * | |
18 | * You should have received a copy of the GNU General Public License along | |
19 | * with this program; if not, write to the Free Software Foundation, Inc., | |
20 | * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. | |
21 | */ | |
22 | ||
23 | #define _GNU_SOURCE | |
24 | #include "test_urcu_ja.h" | |
a2a7ff59 | 25 | #include <inttypes.h> |
582a6ade | 26 | #include <stdint.h> |
44151f89 MD |
27 | |
28 | DEFINE_URCU_TLS(unsigned int, rand_lookup); | |
29 | DEFINE_URCU_TLS(unsigned long, nr_add); | |
30 | DEFINE_URCU_TLS(unsigned long, nr_addexist); | |
31 | DEFINE_URCU_TLS(unsigned long, nr_del); | |
32 | DEFINE_URCU_TLS(unsigned long, nr_delnoent); | |
33 | DEFINE_URCU_TLS(unsigned long, lookup_fail); | |
34 | DEFINE_URCU_TLS(unsigned long, lookup_ok); | |
35 | ||
36 | struct cds_ja *test_ja; | |
37 | ||
38 | volatile int test_go, test_stop; | |
39 | ||
40 | unsigned long wdelay; | |
41 | ||
42 | unsigned long duration; | |
43 | ||
44 | /* read-side C.S. duration, in loops */ | |
45 | unsigned long rduration; | |
46 | ||
47 | unsigned long init_populate; | |
48 | int add_only; | |
49 | ||
50 | unsigned long init_pool_offset, lookup_pool_offset, write_pool_offset; | |
51 | unsigned long init_pool_size = DEFAULT_RAND_POOL, | |
52 | lookup_pool_size = DEFAULT_RAND_POOL, | |
53 | write_pool_size = DEFAULT_RAND_POOL; | |
54 | int validate_lookup; | |
1a0c0717 MD |
55 | int sanity_test; |
56 | unsigned int key_bits = 32; | |
44151f89 MD |
57 | |
58 | int count_pipe[2]; | |
59 | ||
60 | int verbose_mode; | |
61 | ||
62 | unsigned int cpu_affinities[NR_CPUS]; | |
63 | unsigned int next_aff = 0; | |
64 | int use_affinity = 0; | |
65 | ||
66 | pthread_mutex_t affinity_mutex = PTHREAD_MUTEX_INITIALIZER; | |
67 | ||
68 | DEFINE_URCU_TLS(unsigned long long, nr_writes); | |
69 | DEFINE_URCU_TLS(unsigned long long, nr_reads); | |
70 | ||
71 | unsigned int nr_readers; | |
72 | unsigned int nr_writers; | |
73 | ||
34ffee3e | 74 | static unsigned int add_ratio = 50; |
4df4328c | 75 | static uint64_t key_mul = 1ULL; |
34ffee3e | 76 | |
04c48ddf MD |
77 | static int add_unique, add_replace; |
78 | ||
44151f89 MD |
79 | static pthread_mutex_t rcu_copy_mutex = PTHREAD_MUTEX_INITIALIZER; |
80 | ||
026545d3 MD |
81 | static int leak_detection; |
82 | static unsigned long test_nodes_allocated, test_nodes_freed; | |
83 | ||
44151f89 MD |
84 | void set_affinity(void) |
85 | { | |
86 | cpu_set_t mask; | |
87 | int cpu; | |
88 | int ret; | |
89 | ||
90 | if (!use_affinity) | |
91 | return; | |
92 | ||
93 | #if HAVE_SCHED_SETAFFINITY | |
94 | ret = pthread_mutex_lock(&affinity_mutex); | |
95 | if (ret) { | |
96 | perror("Error in pthread mutex lock"); | |
97 | exit(-1); | |
98 | } | |
99 | cpu = cpu_affinities[next_aff++]; | |
100 | ret = pthread_mutex_unlock(&affinity_mutex); | |
101 | if (ret) { | |
102 | perror("Error in pthread mutex unlock"); | |
103 | exit(-1); | |
104 | } | |
105 | CPU_ZERO(&mask); | |
106 | CPU_SET(cpu, &mask); | |
107 | #if SCHED_SETAFFINITY_ARGS == 2 | |
108 | sched_setaffinity(0, &mask); | |
109 | #else | |
110 | sched_setaffinity(0, sizeof(mask), &mask); | |
111 | #endif | |
112 | #endif /* HAVE_SCHED_SETAFFINITY */ | |
113 | } | |
114 | ||
115 | void rcu_copy_mutex_lock(void) | |
116 | { | |
117 | int ret; | |
118 | ret = pthread_mutex_lock(&rcu_copy_mutex); | |
119 | if (ret) { | |
120 | perror("Error in pthread mutex lock"); | |
121 | exit(-1); | |
122 | } | |
123 | } | |
124 | ||
125 | void rcu_copy_mutex_unlock(void) | |
126 | { | |
127 | int ret; | |
128 | ||
129 | ret = pthread_mutex_unlock(&rcu_copy_mutex); | |
130 | if (ret) { | |
131 | perror("Error in pthread mutex unlock"); | |
132 | exit(-1); | |
133 | } | |
134 | } | |
135 | ||
026545d3 MD |
136 | static |
137 | struct ja_test_node *node_alloc(void) | |
138 | { | |
139 | struct ja_test_node *node; | |
140 | ||
141 | node = calloc(sizeof(*node), 1); | |
142 | if (leak_detection && node) | |
143 | uatomic_inc(&test_nodes_allocated); | |
144 | return node; | |
145 | } | |
146 | ||
147 | static | |
9d5c85c8 | 148 | void free_node(struct ja_test_node *node) |
44151f89 | 149 | { |
a7542b7f | 150 | poison_free(node); |
026545d3 MD |
151 | if (leak_detection) |
152 | uatomic_inc(&test_nodes_freed); | |
44151f89 MD |
153 | } |
154 | ||
9d5c85c8 MD |
155 | static |
156 | void free_node_cb(struct rcu_head *head) | |
157 | { | |
158 | struct ja_test_node *node = | |
21ac4c56 | 159 | caa_container_of(head, struct ja_test_node, head); |
9d5c85c8 MD |
160 | free_node(node); |
161 | } | |
162 | ||
21ac4c56 MD |
163 | static |
164 | void rcu_free_test_node(struct ja_test_node *test_node) | |
165 | { | |
166 | call_rcu(&test_node->head, free_node_cb); | |
167 | } | |
168 | ||
169 | static | |
170 | void rcu_free_node(struct cds_ja_node *node) | |
171 | { | |
172 | struct ja_test_node *test_node = to_test_node(node); | |
173 | ||
174 | rcu_free_test_node(test_node); | |
175 | } | |
176 | ||
3d8fe307 | 177 | #if 0 |
44151f89 MD |
178 | static |
179 | void test_delete_all_nodes(struct cds_lfht *ht) | |
180 | { | |
181 | struct cds_lfht_iter iter; | |
182 | struct lfht_test_node *node; | |
183 | unsigned long count = 0; | |
184 | ||
185 | cds_lfht_for_each_entry(ht, &iter, node, node) { | |
186 | int ret; | |
187 | ||
188 | ret = cds_lfht_del(test_ht, cds_lfht_iter_get_node(&iter)); | |
189 | assert(!ret); | |
190 | call_rcu(&node->head, free_node_cb); | |
191 | count++; | |
192 | } | |
193 | printf("deleted %lu nodes.\n", count); | |
194 | } | |
195 | #endif | |
196 | ||
197 | void show_usage(int argc, char **argv) | |
198 | { | |
199 | printf("Usage : %s nr_readers nr_writers duration (s)\n", argv[0]); | |
200 | #ifdef DEBUG_YIELD | |
201 | printf(" [-r] [-w] (yield reader and/or writer)\n"); | |
202 | #endif | |
203 | printf(" [-d delay] (writer period (us))\n"); | |
204 | printf(" [-c duration] (reader C.S. duration (in loops))\n"); | |
205 | printf(" [-v] (verbose output)\n"); | |
206 | printf(" [-a cpu#] [-a cpu#]... (affinity)\n"); | |
04c48ddf MD |
207 | printf(" [-u] Add unique keys.\n"); |
208 | printf(" [-s] Replace existing keys.\n"); | |
44151f89 | 209 | printf(" [not -u nor -s] Add entries (supports redundant keys).\n"); |
4df4328c | 210 | printf(" [-r ratio] Add ratio (in %% of add+removal).\n"); |
46f373a6 | 211 | printf(" [-k] Populate init nodes.\n"); |
44151f89 MD |
212 | printf(" [-R offset] Lookup pool offset.\n"); |
213 | printf(" [-S offset] Write pool offset.\n"); | |
214 | printf(" [-T offset] Init pool offset.\n"); | |
215 | printf(" [-M size] Lookup pool size.\n"); | |
216 | printf(" [-N size] Write pool size.\n"); | |
217 | printf(" [-O size] Init pool size.\n"); | |
218 | printf(" [-V] Validate lookups of init values (use with filled init pool, same lookup range, with different write range).\n"); | |
04c48ddf | 219 | printf(" [-t] Do sanity test.\n"); |
1a0c0717 | 220 | printf(" [-B] Key bits for multithread test (default: 32).\n"); |
4df4328c | 221 | printf(" [-m factor] Key multiplication factor.\n"); |
026545d3 | 222 | printf(" [-l] Memory leak detection.\n"); |
44151f89 MD |
223 | printf("\n\n"); |
224 | } | |
225 | ||
582a6ade MD |
226 | static |
227 | int test_8bit_key(void) | |
228 | { | |
c6cd5af3 | 229 | int ret, i; |
582a6ade | 230 | uint64_t key; |
c6cd5af3 MD |
231 | uint64_t ka[] = { 4, 17, 100, 222 }; |
232 | uint64_t ka_test_offset = 5; | |
582a6ade MD |
233 | |
234 | /* Test with 8-bit key */ | |
235 | test_ja = cds_ja_new(8); | |
236 | if (!test_ja) { | |
237 | printf("Error allocating judy array.\n"); | |
238 | return -1; | |
239 | } | |
240 | ||
241 | /* Add keys */ | |
242 | printf("Test #1: add keys (8-bit).\n"); | |
243 | for (key = 0; key < 200; key++) { | |
026545d3 | 244 | struct ja_test_node *node = node_alloc(); |
582a6ade MD |
245 | |
246 | ja_test_node_init(node, key); | |
247 | rcu_read_lock(); | |
248 | ret = cds_ja_add(test_ja, key, &node->node); | |
249 | rcu_read_unlock(); | |
250 | if (ret) { | |
251 | fprintf(stderr, "Error (%d) adding node %" PRIu64 "\n", | |
252 | ret, key); | |
253 | assert(0); | |
254 | } | |
255 | } | |
256 | printf("OK\n"); | |
257 | ||
258 | printf("Test #2: successful key lookup (8-bit).\n"); | |
259 | for (key = 0; key < 200; key++) { | |
03ec1aeb | 260 | struct cds_ja_node *node; |
582a6ade MD |
261 | |
262 | rcu_read_lock(); | |
03ec1aeb MD |
263 | node = cds_ja_lookup(test_ja, key); |
264 | if (!node) { | |
582a6ade MD |
265 | fprintf(stderr, "Error lookup node %" PRIu64 "\n", key); |
266 | assert(0); | |
267 | } | |
268 | rcu_read_unlock(); | |
269 | } | |
270 | printf("OK\n"); | |
271 | printf("Test #3: unsuccessful key lookup (8-bit).\n"); | |
272 | for (key = 200; key < 240; key++) { | |
03ec1aeb | 273 | struct cds_ja_node *node; |
582a6ade MD |
274 | |
275 | rcu_read_lock(); | |
03ec1aeb MD |
276 | node = cds_ja_lookup(test_ja, key); |
277 | if (node) { | |
582a6ade MD |
278 | fprintf(stderr, |
279 | "Error unexpected lookup node %" PRIu64 "\n", | |
280 | key); | |
281 | assert(0); | |
282 | } | |
283 | rcu_read_unlock(); | |
284 | } | |
285 | printf("OK\n"); | |
3d8fe307 MD |
286 | printf("Test #4: remove keys (8-bit).\n"); |
287 | for (key = 0; key < 200; key++) { | |
03ec1aeb | 288 | struct cds_ja_node *ja_node; |
3d8fe307 MD |
289 | struct ja_test_node *node; |
290 | ||
291 | rcu_read_lock(); | |
03ec1aeb MD |
292 | ja_node = cds_ja_lookup(test_ja, key); |
293 | if (!ja_node) { | |
3d8fe307 MD |
294 | fprintf(stderr, "Error lookup node %" PRIu64 "\n", key); |
295 | assert(0); | |
296 | } | |
03ec1aeb | 297 | node = caa_container_of(ja_node, struct ja_test_node, node); |
3d8fe307 MD |
298 | ret = cds_ja_del(test_ja, key, &node->node); |
299 | if (ret) { | |
300 | fprintf(stderr, "Error (%d) removing node %" PRIu64 "\n", ret, key); | |
301 | assert(0); | |
302 | } | |
21ac4c56 | 303 | rcu_free_test_node(node); |
03ec1aeb MD |
304 | ja_node = cds_ja_lookup(test_ja, key); |
305 | if (ja_node) { | |
306 | fprintf(stderr, "Error lookup %" PRIu64 ": %p (after delete) failed. Node is not expected.\n", key, ja_node); | |
4d6ef45e MD |
307 | assert(0); |
308 | } | |
3d8fe307 MD |
309 | rcu_read_unlock(); |
310 | } | |
311 | printf("OK\n"); | |
582a6ade | 312 | |
c6cd5af3 MD |
313 | printf("Test #5: lookup lower equal (8-bit).\n"); |
314 | ||
315 | for (i = 0; i < CAA_ARRAY_SIZE(ka); i++) { | |
316 | struct ja_test_node *node = node_alloc(); | |
317 | ||
318 | key = ka[i]; | |
319 | ja_test_node_init(node, key); | |
320 | rcu_read_lock(); | |
321 | ret = cds_ja_add(test_ja, key, &node->node); | |
322 | rcu_read_unlock(); | |
323 | if (ret) { | |
324 | fprintf(stderr, "Error (%d) adding node %" PRIu64 "\n", | |
325 | ret, key); | |
326 | assert(0); | |
327 | } | |
328 | } | |
329 | ||
330 | for (i = 0; i < CAA_ARRAY_SIZE(ka); i++) { | |
03ec1aeb | 331 | struct cds_ja_node *ja_node; |
c6cd5af3 MD |
332 | struct ja_test_node *node; |
333 | ||
334 | key = ka[i] + ka_test_offset; | |
335 | rcu_read_lock(); | |
03ec1aeb MD |
336 | ja_node = cds_ja_lookup_lower_equal(test_ja, key); |
337 | if (!ja_node) { | |
c6cd5af3 MD |
338 | fprintf(stderr, "Error lookup lower equal. Cannot find expected key %" PRIu64" below or equal to %" PRIu64 ".\n", |
339 | ka[i], key); | |
340 | assert(0); | |
341 | } | |
03ec1aeb | 342 | node = caa_container_of(ja_node, struct ja_test_node, node); |
c6cd5af3 MD |
343 | if (node->key != ka[i]) { |
344 | fprintf(stderr, "Error lookup lower equal. Expecting key %" PRIu64 " below or equal to %" PRIu64 ", but found %" PRIu64 " instead.\n", | |
345 | ka[i], key, node->key); | |
346 | assert(0); | |
347 | } | |
348 | rcu_read_unlock(); | |
349 | } | |
350 | ||
351 | for (i = 0; i < CAA_ARRAY_SIZE(ka); i++) { | |
03ec1aeb | 352 | struct cds_ja_node *ja_node; |
c6cd5af3 MD |
353 | struct ja_test_node *node; |
354 | ||
355 | key = ka[i]; /* without offset */ | |
356 | rcu_read_lock(); | |
03ec1aeb MD |
357 | ja_node = cds_ja_lookup_lower_equal(test_ja, key); |
358 | if (!ja_node) { | |
c6cd5af3 MD |
359 | fprintf(stderr, "Error lookup lower equal. Cannot find expected key %" PRIu64" below or equal to %" PRIu64 ".\n", |
360 | ka[i], key); | |
361 | assert(0); | |
362 | } | |
03ec1aeb | 363 | node = caa_container_of(ja_node, struct ja_test_node, node); |
c6cd5af3 MD |
364 | if (node->key != ka[i]) { |
365 | fprintf(stderr, "Error lookup lower equal. Expecting key %" PRIu64 " below or equal to %" PRIu64 ", but found %" PRIu64 " instead.\n", | |
366 | ka[i], key, node->key); | |
367 | assert(0); | |
368 | } | |
369 | rcu_read_unlock(); | |
370 | } | |
371 | ||
372 | printf("OK\n"); | |
373 | ||
21ac4c56 | 374 | ret = cds_ja_destroy(test_ja, rcu_free_node); |
582a6ade MD |
375 | if (ret) { |
376 | fprintf(stderr, "Error destroying judy array\n"); | |
377 | return -1; | |
378 | } | |
379 | return 0; | |
380 | } | |
381 | ||
382 | static | |
383 | int test_16bit_key(void) | |
384 | { | |
c6cd5af3 | 385 | int ret, i; |
582a6ade | 386 | uint64_t key; |
c6cd5af3 MD |
387 | uint64_t ka[] = { 4, 105, 222, 4000, 4111, 59990, 65435 }; |
388 | uint64_t ka_test_offset = 100; | |
582a6ade MD |
389 | |
390 | /* Test with 16-bit key */ | |
391 | test_ja = cds_ja_new(16); | |
392 | if (!test_ja) { | |
393 | printf("Error allocating judy array.\n"); | |
394 | return -1; | |
395 | } | |
396 | ||
397 | /* Add keys */ | |
398 | printf("Test #1: add keys (16-bit).\n"); | |
4d6ef45e MD |
399 | for (key = 0; key < 10000; key++) { |
400 | //for (key = 0; key < 65536; key+=256) { | |
026545d3 | 401 | struct ja_test_node *node = node_alloc(); |
582a6ade MD |
402 | |
403 | ja_test_node_init(node, key); | |
404 | rcu_read_lock(); | |
405 | ret = cds_ja_add(test_ja, key, &node->node); | |
406 | rcu_read_unlock(); | |
407 | if (ret) { | |
408 | fprintf(stderr, "Error (%d) adding node %" PRIu64 "\n", | |
409 | ret, key); | |
410 | assert(0); | |
411 | } | |
412 | } | |
413 | printf("OK\n"); | |
414 | ||
415 | printf("Test #2: successful key lookup (16-bit).\n"); | |
4d6ef45e MD |
416 | for (key = 0; key < 10000; key++) { |
417 | //for (key = 0; key < 65536; key+=256) { | |
03ec1aeb | 418 | struct cds_ja_node *node; |
582a6ade MD |
419 | |
420 | rcu_read_lock(); | |
03ec1aeb MD |
421 | node = cds_ja_lookup(test_ja, key); |
422 | if (!node) { | |
582a6ade MD |
423 | fprintf(stderr, "Error lookup node %" PRIu64 "\n", key); |
424 | assert(0); | |
425 | } | |
426 | rcu_read_unlock(); | |
427 | } | |
428 | printf("OK\n"); | |
429 | printf("Test #3: unsuccessful key lookup (16-bit).\n"); | |
430 | for (key = 11000; key <= 11002; key++) { | |
03ec1aeb | 431 | struct cds_ja_node *node; |
582a6ade MD |
432 | |
433 | rcu_read_lock(); | |
03ec1aeb MD |
434 | node = cds_ja_lookup(test_ja, key); |
435 | if (node) { | |
582a6ade MD |
436 | fprintf(stderr, |
437 | "Error unexpected lookup node %" PRIu64 "\n", | |
438 | key); | |
439 | assert(0); | |
440 | } | |
441 | rcu_read_unlock(); | |
442 | } | |
443 | printf("OK\n"); | |
4d6ef45e MD |
444 | printf("Test #4: remove keys (16-bit).\n"); |
445 | for (key = 0; key < 10000; key++) { | |
446 | //for (key = 0; key < 65536; key+=256) { | |
03ec1aeb | 447 | struct cds_ja_node *ja_node; |
4d6ef45e MD |
448 | struct ja_test_node *node; |
449 | ||
450 | rcu_read_lock(); | |
03ec1aeb MD |
451 | ja_node = cds_ja_lookup(test_ja, key); |
452 | if (!ja_node) { | |
4d6ef45e MD |
453 | fprintf(stderr, "Error lookup node %" PRIu64 "\n", key); |
454 | assert(0); | |
455 | } | |
03ec1aeb | 456 | node = caa_container_of(ja_node, struct ja_test_node, node); |
4d6ef45e MD |
457 | ret = cds_ja_del(test_ja, key, &node->node); |
458 | if (ret) { | |
459 | fprintf(stderr, "Error (%d) removing node %" PRIu64 "\n", ret, key); | |
460 | assert(0); | |
461 | } | |
21ac4c56 | 462 | rcu_free_test_node(node); |
03ec1aeb MD |
463 | ja_node = cds_ja_lookup(test_ja, key); |
464 | if (ja_node) { | |
465 | fprintf(stderr, "Error lookup %" PRIu64 ": %p (after delete) failed. Node is not expected.\n", key, ja_node); | |
4d6ef45e MD |
466 | assert(0); |
467 | } | |
468 | rcu_read_unlock(); | |
469 | } | |
470 | printf("OK\n"); | |
582a6ade | 471 | |
c6cd5af3 MD |
472 | printf("Test #5: lookup lower equal (16-bit).\n"); |
473 | ||
474 | for (i = 0; i < CAA_ARRAY_SIZE(ka); i++) { | |
475 | struct ja_test_node *node = node_alloc(); | |
476 | ||
477 | key = ka[i]; | |
478 | ja_test_node_init(node, key); | |
479 | rcu_read_lock(); | |
480 | ret = cds_ja_add(test_ja, key, &node->node); | |
481 | rcu_read_unlock(); | |
482 | if (ret) { | |
483 | fprintf(stderr, "Error (%d) adding node %" PRIu64 "\n", | |
484 | ret, key); | |
485 | assert(0); | |
486 | } | |
487 | } | |
488 | ||
489 | for (i = 0; i < CAA_ARRAY_SIZE(ka); i++) { | |
03ec1aeb | 490 | struct cds_ja_node *ja_node; |
c6cd5af3 MD |
491 | struct ja_test_node *node; |
492 | ||
493 | key = ka[i] + ka_test_offset; | |
494 | rcu_read_lock(); | |
03ec1aeb MD |
495 | ja_node = cds_ja_lookup_lower_equal(test_ja, key); |
496 | if (!ja_node) { | |
c6cd5af3 MD |
497 | fprintf(stderr, "Error lookup lower equal. Cannot find expected key %" PRIu64" below or equal to %" PRIu64 ".\n", |
498 | ka[i], key); | |
499 | assert(0); | |
500 | } | |
03ec1aeb | 501 | node = caa_container_of(ja_node, struct ja_test_node, node); |
c6cd5af3 MD |
502 | if (node->key != ka[i]) { |
503 | fprintf(stderr, "Error lookup lower equal. Expecting key %" PRIu64 " below or equal to %" PRIu64 ", but found %" PRIu64 " instead.\n", | |
504 | ka[i], key, node->key); | |
505 | assert(0); | |
506 | } | |
507 | rcu_read_unlock(); | |
508 | } | |
509 | ||
510 | for (i = 0; i < CAA_ARRAY_SIZE(ka); i++) { | |
03ec1aeb | 511 | struct cds_ja_node *ja_node; |
c6cd5af3 MD |
512 | struct ja_test_node *node; |
513 | ||
514 | key = ka[i]; /* without offset */ | |
515 | rcu_read_lock(); | |
03ec1aeb MD |
516 | ja_node = cds_ja_lookup_lower_equal(test_ja, key); |
517 | if (!ja_node) { | |
c6cd5af3 MD |
518 | fprintf(stderr, "Error lookup lower equal. Cannot find expected key %" PRIu64" below or equal to %" PRIu64 ".\n", |
519 | ka[i], key); | |
520 | assert(0); | |
521 | } | |
03ec1aeb | 522 | node = caa_container_of(ja_node, struct ja_test_node, node); |
c6cd5af3 MD |
523 | if (node->key != ka[i]) { |
524 | fprintf(stderr, "Error lookup lower equal. Expecting key %" PRIu64 " below or equal to %" PRIu64 ", but found %" PRIu64 " instead.\n", | |
525 | ka[i], key, node->key); | |
526 | assert(0); | |
527 | } | |
528 | rcu_read_unlock(); | |
529 | } | |
530 | ||
531 | printf("OK\n"); | |
532 | ||
21ac4c56 | 533 | ret = cds_ja_destroy(test_ja, rcu_free_node); |
582a6ade MD |
534 | if (ret) { |
535 | fprintf(stderr, "Error destroying judy array\n"); | |
536 | return -1; | |
537 | } | |
538 | return 0; | |
539 | } | |
540 | ||
6fdf58e8 MD |
541 | /* |
542 | * nr_dup is number of nodes per key. | |
543 | */ | |
582a6ade | 544 | static |
6fdf58e8 | 545 | int test_sparse_key(unsigned int bits, int nr_dup) |
582a6ade | 546 | { |
582a6ade | 547 | uint64_t key, max_key; |
6fdf58e8 | 548 | int zerocount, i, ret; |
582a6ade MD |
549 | |
550 | if (bits == 64) | |
551 | max_key = UINT64_MAX; | |
552 | else | |
553 | max_key = (1ULL << bits) - 1; | |
554 | ||
555 | printf("Sparse key test begins for %u-bit keys\n", bits); | |
556 | /* Test with 16-bit key */ | |
557 | test_ja = cds_ja_new(bits); | |
558 | if (!test_ja) { | |
559 | printf("Error allocating judy array.\n"); | |
560 | return -1; | |
561 | } | |
562 | ||
563 | /* Add keys */ | |
564 | printf("Test #1: add keys (%u-bit).\n", bits); | |
6fdf58e8 MD |
565 | for (i = 0; i < nr_dup; i++) { |
566 | zerocount = 0; | |
567 | for (key = 0; key <= max_key && (key != 0 || zerocount < 1); key += 1ULL << (bits - 8)) { | |
026545d3 | 568 | struct ja_test_node *node = node_alloc(); |
582a6ade | 569 | |
6fdf58e8 MD |
570 | ja_test_node_init(node, key); |
571 | rcu_read_lock(); | |
572 | ret = cds_ja_add(test_ja, key, &node->node); | |
573 | rcu_read_unlock(); | |
574 | if (ret) { | |
575 | fprintf(stderr, "Error (%d) adding node %" PRIu64 "\n", | |
576 | ret, key); | |
577 | assert(0); | |
578 | } | |
579 | if (key == 0) | |
580 | zerocount++; | |
582a6ade | 581 | } |
582a6ade MD |
582 | } |
583 | printf("OK\n"); | |
584 | ||
585 | printf("Test #2: successful key lookup (%u-bit).\n", bits); | |
586 | zerocount = 0; | |
587 | for (key = 0; key <= max_key && (key != 0 || zerocount < 1); key += 1ULL << (bits - 8)) { | |
03ec1aeb | 588 | struct cds_ja_node *ja_node; |
6fdf58e8 | 589 | struct ja_test_node *node; |
6fdf58e8 | 590 | int count = 0; |
582a6ade MD |
591 | |
592 | rcu_read_lock(); | |
03ec1aeb MD |
593 | ja_node = cds_ja_lookup(test_ja, key); |
594 | if (!ja_node) { | |
582a6ade MD |
595 | fprintf(stderr, "Error lookup node %" PRIu64 "\n", key); |
596 | assert(0); | |
597 | } | |
03ec1aeb | 598 | cds_ja_for_each_duplicate_rcu(ja_node) { |
6fdf58e8 MD |
599 | count++; |
600 | } | |
601 | if (count != nr_dup) { | |
602 | fprintf(stderr, "Unexpected number of match for key %" PRIu64 ", expected %d, got %d.\n", key, nr_dup, count); | |
603 | } | |
582a6ade MD |
604 | rcu_read_unlock(); |
605 | if (key == 0) | |
606 | zerocount++; | |
607 | } | |
608 | printf("OK\n"); | |
609 | if (bits > 8) { | |
610 | printf("Test #3: unsuccessful key lookup (%u-bit).\n", bits); | |
611 | zerocount = 0; | |
612 | for (key = 0; key <= max_key && (key != 0 || zerocount < 1); key += 1ULL << (bits - 8)) { | |
03ec1aeb | 613 | struct cds_ja_node *ja_node; |
582a6ade MD |
614 | |
615 | rcu_read_lock(); | |
03ec1aeb MD |
616 | ja_node = cds_ja_lookup(test_ja, key + 42); |
617 | if (ja_node) { | |
582a6ade MD |
618 | fprintf(stderr, |
619 | "Error unexpected lookup node %" PRIu64 "\n", | |
620 | key + 42); | |
621 | assert(0); | |
622 | } | |
623 | rcu_read_unlock(); | |
624 | if (key == 0) | |
625 | zerocount++; | |
626 | } | |
627 | printf("OK\n"); | |
628 | } | |
81c18eb9 | 629 | printf("Test #4: remove keys (%u-bit).\n", bits); |
4d6ef45e MD |
630 | zerocount = 0; |
631 | for (key = 0; key <= max_key && (key != 0 || zerocount < 1); key += 1ULL << (bits - 8)) { | |
03ec1aeb | 632 | struct cds_ja_node *ja_node; |
6fdf58e8 | 633 | int count = 0; |
4d6ef45e MD |
634 | |
635 | rcu_read_lock(); | |
03ec1aeb | 636 | ja_node = cds_ja_lookup(test_ja, key); |
6fdf58e8 | 637 | |
03ec1aeb MD |
638 | cds_ja_for_each_duplicate_rcu(ja_node) { |
639 | struct cds_ja_node *test_ja_node; | |
640 | struct ja_test_node *node; | |
6fdf58e8 MD |
641 | |
642 | count++; | |
03ec1aeb MD |
643 | node = caa_container_of(ja_node, |
644 | struct ja_test_node, node); | |
6fdf58e8 MD |
645 | ret = cds_ja_del(test_ja, key, &node->node); |
646 | if (ret) { | |
647 | fprintf(stderr, "Error (%d) removing node %" PRIu64 "\n", ret, key); | |
648 | assert(0); | |
649 | } | |
21ac4c56 | 650 | rcu_free_test_node(node); |
03ec1aeb MD |
651 | test_ja_node = cds_ja_lookup(test_ja, key); |
652 | if (count < nr_dup && !test_ja_node) { | |
6fdf58e8 MD |
653 | fprintf(stderr, "Error: no node found after deletion of some nodes of a key\n"); |
654 | assert(0); | |
655 | } | |
4d6ef45e | 656 | } |
03ec1aeb MD |
657 | ja_node = cds_ja_lookup(test_ja, key); |
658 | if (ja_node) { | |
659 | fprintf(stderr, "Error lookup %" PRIu64 ": %p (after delete) failed. Node is not expected.\n", key, ja_node); | |
4d6ef45e MD |
660 | assert(0); |
661 | } | |
662 | rcu_read_unlock(); | |
663 | if (key == 0) | |
664 | zerocount++; | |
665 | } | |
666 | printf("OK\n"); | |
582a6ade | 667 | |
21ac4c56 | 668 | ret = cds_ja_destroy(test_ja, rcu_free_node); |
582a6ade MD |
669 | if (ret) { |
670 | fprintf(stderr, "Error destroying judy array\n"); | |
671 | return -1; | |
672 | } | |
673 | printf("Test ends\n"); | |
674 | ||
675 | return 0; | |
676 | } | |
677 | ||
1a0c0717 MD |
678 | static |
679 | int do_sanity_test(void) | |
680 | { | |
681 | int i, j, ret; | |
582a6ade | 682 | |
1a0c0717 MD |
683 | printf("Sanity test start.\n"); |
684 | ||
685 | for (i = 0; i < 3; i++) { | |
686 | ret = test_8bit_key(); | |
687 | if (ret) { | |
688 | return ret; | |
689 | } | |
690 | rcu_quiescent_state(); | |
691 | } | |
692 | ret = test_16bit_key(); | |
693 | if (ret) { | |
694 | return ret; | |
695 | } | |
696 | rcu_quiescent_state(); | |
697 | ||
698 | /* key bits */ | |
699 | for (i = 8; i <= 64; i *= 2) { | |
700 | /* nr of nodes per key */ | |
701 | for (j = 1; j < 4; j++) { | |
702 | ret = test_sparse_key(i, j); | |
703 | if (ret) { | |
704 | return ret; | |
705 | } | |
706 | rcu_quiescent_state(); | |
707 | } | |
708 | } | |
709 | printf("Sanity test end.\n"); | |
710 | ||
711 | return 0; | |
712 | } | |
713 | ||
714 | enum urcu_ja_addremove { | |
715 | AR_RANDOM = 0, | |
716 | AR_ADD = 1, | |
717 | AR_REMOVE = -1, | |
718 | }; /* 1: add, -1 remove, 0: random */ | |
719 | ||
720 | static enum urcu_ja_addremove addremove; /* 1: add, -1 remove, 0: random */ | |
721 | ||
722 | static | |
723 | void test_ja_rw_sigusr1_handler(int signo) | |
724 | { | |
725 | switch (addremove) { | |
726 | case AR_ADD: | |
727 | printf("Add/Remove: random.\n"); | |
728 | addremove = AR_RANDOM; | |
729 | break; | |
730 | case AR_RANDOM: | |
731 | printf("Add/Remove: remove only.\n"); | |
732 | addremove = AR_REMOVE; | |
733 | break; | |
734 | case AR_REMOVE: | |
735 | printf("Add/Remove: add only.\n"); | |
736 | addremove = AR_ADD; | |
737 | break; | |
738 | } | |
739 | } | |
740 | ||
741 | static | |
742 | void *test_ja_rw_thr_reader(void *_count) | |
743 | { | |
744 | unsigned long long *count = _count; | |
03ec1aeb | 745 | struct cds_ja_node *ja_node; |
1a0c0717 MD |
746 | uint64_t key; |
747 | ||
748 | printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n", | |
749 | "reader", pthread_self(), (unsigned long) gettid()); | |
750 | ||
751 | set_affinity(); | |
752 | ||
753 | rcu_register_thread(); | |
754 | ||
755 | while (!test_go) | |
756 | { | |
757 | } | |
758 | cmm_smp_mb(); | |
759 | ||
760 | for (;;) { | |
761 | rcu_read_lock(); | |
762 | ||
763 | /* note: only looking up ulong keys */ | |
764 | key = ((unsigned long) rand_r(&URCU_TLS(rand_lookup)) % lookup_pool_size) + lookup_pool_offset; | |
4df4328c | 765 | key *= key_mul; |
03ec1aeb MD |
766 | ja_node = cds_ja_lookup(test_ja, key); |
767 | if (!ja_node) { | |
1a0c0717 MD |
768 | if (validate_lookup) { |
769 | printf("[ERROR] Lookup cannot find initial node.\n"); | |
770 | exit(-1); | |
771 | } | |
772 | URCU_TLS(lookup_fail)++; | |
773 | } else { | |
774 | URCU_TLS(lookup_ok)++; | |
775 | } | |
756c692d | 776 | rcu_debug_yield_read(); |
1a0c0717 MD |
777 | if (caa_unlikely(rduration)) |
778 | loop_sleep(rduration); | |
779 | rcu_read_unlock(); | |
780 | URCU_TLS(nr_reads)++; | |
781 | if (caa_unlikely(!test_duration_read())) | |
782 | break; | |
783 | if (caa_unlikely((URCU_TLS(nr_reads) & ((1 << 10) - 1)) == 0)) | |
784 | rcu_quiescent_state(); | |
785 | } | |
786 | ||
787 | rcu_unregister_thread(); | |
788 | ||
789 | *count = URCU_TLS(nr_reads); | |
790 | printf_verbose("thread_end %s, thread id : %lx, tid %lu\n", | |
791 | "reader", pthread_self(), (unsigned long) gettid()); | |
792 | printf_verbose("readid : %lx, lookupfail %lu, lookupok %lu\n", | |
793 | pthread_self(), URCU_TLS(lookup_fail), | |
794 | URCU_TLS(lookup_ok)); | |
795 | return ((void*)1); | |
796 | } | |
797 | ||
34ffee3e MD |
798 | static |
799 | int is_add(void) | |
800 | { | |
801 | return ((unsigned int) rand_r(&URCU_TLS(rand_lookup)) % 100) < add_ratio; | |
802 | } | |
803 | ||
1a0c0717 MD |
804 | static |
805 | void *test_ja_rw_thr_writer(void *_count) | |
806 | { | |
807 | struct wr_count *count = _count; | |
1a0c0717 MD |
808 | uint64_t key; |
809 | int ret; | |
810 | ||
811 | printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n", | |
812 | "writer", pthread_self(), (unsigned long) gettid()); | |
813 | ||
814 | set_affinity(); | |
815 | ||
816 | rcu_register_thread(); | |
817 | ||
818 | while (!test_go) | |
819 | { | |
820 | } | |
821 | cmm_smp_mb(); | |
822 | ||
823 | for (;;) { | |
34ffee3e MD |
824 | if ((addremove == AR_ADD) |
825 | || (addremove == AR_RANDOM && is_add())) { | |
026545d3 | 826 | struct ja_test_node *node = node_alloc(); |
75d573aa | 827 | struct cds_ja_node *ret_node; |
1a0c0717 MD |
828 | |
829 | /* note: only inserting ulong keys */ | |
830 | key = ((unsigned long) rand_r(&URCU_TLS(rand_lookup)) % write_pool_size) + write_pool_offset; | |
4df4328c | 831 | key *= key_mul; |
1a0c0717 MD |
832 | ja_test_node_init(node, key); |
833 | rcu_read_lock(); | |
04c48ddf MD |
834 | if (add_unique) { |
835 | ret_node = cds_ja_add_unique(test_ja, key, &node->node); | |
836 | if (ret_node != &node->node) { | |
9d5c85c8 | 837 | free_node(node); |
04c48ddf MD |
838 | URCU_TLS(nr_addexist)++; |
839 | } else { | |
840 | URCU_TLS(nr_add)++; | |
841 | } | |
842 | } else if (add_replace) { | |
843 | assert(0); /* not implemented yet. */ | |
75d573aa | 844 | } else { |
04c48ddf MD |
845 | ret = cds_ja_add(test_ja, key, &node->node); |
846 | if (ret) { | |
847 | fprintf(stderr, "Error in cds_ja_add: %d\n", ret); | |
9d5c85c8 | 848 | free_node(node); |
04c48ddf MD |
849 | } else { |
850 | URCU_TLS(nr_add)++; | |
851 | } | |
1a0c0717 | 852 | } |
04c48ddf | 853 | rcu_read_unlock(); |
1a0c0717 | 854 | } else { |
03ec1aeb | 855 | struct cds_ja_node *ja_node; |
1a0c0717 MD |
856 | struct ja_test_node *node; |
857 | ||
858 | /* May delete */ | |
859 | /* note: only deleting ulong keys */ | |
860 | key = ((unsigned long) rand_r(&URCU_TLS(rand_lookup)) % write_pool_size) + write_pool_offset; | |
4df4328c | 861 | key *= key_mul; |
1a0c0717 MD |
862 | |
863 | rcu_read_lock(); | |
864 | ||
03ec1aeb MD |
865 | ja_node = cds_ja_lookup(test_ja, key); |
866 | /* Remove first entry */ | |
867 | if (ja_node) { | |
868 | node = caa_container_of(ja_node, | |
869 | struct ja_test_node, node); | |
1a0c0717 | 870 | ret = cds_ja_del(test_ja, key, &node->node); |
d7069878 | 871 | if (!ret) { |
21ac4c56 | 872 | rcu_free_test_node(node); |
1a0c0717 | 873 | URCU_TLS(nr_del)++; |
d7069878 MD |
874 | } else { |
875 | URCU_TLS(nr_delnoent)++; | |
1a0c0717 MD |
876 | } |
877 | } else { | |
878 | URCU_TLS(nr_delnoent)++; | |
879 | } | |
6da38aec | 880 | rcu_read_unlock(); |
1a0c0717 MD |
881 | } |
882 | ||
883 | URCU_TLS(nr_writes)++; | |
884 | if (caa_unlikely(!test_duration_write())) | |
885 | break; | |
886 | if (caa_unlikely(wdelay)) | |
887 | loop_sleep(wdelay); | |
888 | if (caa_unlikely((URCU_TLS(nr_writes) & ((1 << 10) - 1)) == 0)) | |
889 | rcu_quiescent_state(); | |
890 | } | |
891 | ||
892 | rcu_unregister_thread(); | |
893 | ||
894 | printf_verbose("thread_end %s, thread id : %lx, tid %lu\n", | |
895 | "writer", pthread_self(), (unsigned long) gettid()); | |
896 | printf_verbose("info id %lx: nr_add %lu, nr_addexist %lu, nr_del %lu, " | |
897 | "nr_delnoent %lu\n", pthread_self(), URCU_TLS(nr_add), | |
898 | URCU_TLS(nr_addexist), URCU_TLS(nr_del), | |
899 | URCU_TLS(nr_delnoent)); | |
900 | count->update_ops = URCU_TLS(nr_writes); | |
901 | count->add = URCU_TLS(nr_add); | |
902 | count->add_exist = URCU_TLS(nr_addexist); | |
903 | count->remove = URCU_TLS(nr_del); | |
904 | return ((void*)2); | |
905 | } | |
906 | ||
907 | static | |
908 | int do_mt_populate_ja(void) | |
909 | { | |
4df4328c | 910 | uint64_t iter; |
1a0c0717 MD |
911 | int ret; |
912 | ||
913 | if (!init_populate) | |
914 | return 0; | |
915 | ||
916 | printf("Starting rw test\n"); | |
917 | ||
4df4328c | 918 | for (iter = init_pool_offset; iter < init_pool_offset + init_pool_size; iter++) { |
026545d3 | 919 | struct ja_test_node *node = node_alloc(); |
4df4328c | 920 | uint64_t key; |
1a0c0717 MD |
921 | |
922 | /* note: only inserting ulong keys */ | |
4df4328c MD |
923 | key = (unsigned long) iter; |
924 | key *= key_mul; | |
1a0c0717 MD |
925 | ja_test_node_init(node, key); |
926 | rcu_read_lock(); | |
927 | ret = cds_ja_add(test_ja, key, &node->node); | |
928 | URCU_TLS(nr_add)++; | |
929 | URCU_TLS(nr_writes)++; | |
930 | rcu_read_unlock(); | |
931 | if (ret) { | |
932 | fprintf(stderr, "Error (%d) adding node %" PRIu64 "\n", | |
933 | ret, key); | |
934 | assert(0); | |
935 | } | |
936 | } | |
937 | return 0; | |
938 | } | |
939 | ||
940 | static | |
941 | int do_mt_test(void) | |
44151f89 | 942 | { |
44151f89 MD |
943 | pthread_t *tid_reader, *tid_writer; |
944 | void *tret; | |
1a0c0717 | 945 | int ret, i, err; |
44151f89 MD |
946 | unsigned long long *count_reader; |
947 | struct wr_count *count_writer; | |
948 | unsigned long long tot_reads = 0, tot_writes = 0, | |
949 | tot_add = 0, tot_add_exist = 0, tot_remove = 0; | |
44151f89 | 950 | unsigned int remain; |
1a0c0717 MD |
951 | |
952 | tid_reader = malloc(sizeof(*tid_reader) * nr_readers); | |
953 | tid_writer = malloc(sizeof(*tid_writer) * nr_writers); | |
954 | count_reader = malloc(sizeof(*count_reader) * nr_readers); | |
955 | count_writer = malloc(sizeof(*count_writer) * nr_writers); | |
956 | ||
957 | printf("Allocating Judy Array for %u-bit keys\n", key_bits); | |
958 | test_ja = cds_ja_new(key_bits); | |
959 | if (!test_ja) { | |
960 | printf("Error allocating judy array.\n"); | |
961 | ret = -1; | |
962 | goto end; | |
963 | } | |
964 | ||
965 | do_mt_populate_ja(); | |
966 | ||
967 | next_aff = 0; | |
968 | ||
969 | for (i = 0; i < nr_readers; i++) { | |
970 | err = pthread_create(&tid_reader[i], | |
971 | NULL, test_ja_rw_thr_reader, | |
972 | &count_reader[i]); | |
973 | if (err != 0) | |
974 | exit(1); | |
975 | } | |
976 | for (i = 0; i < nr_writers; i++) { | |
977 | err = pthread_create(&tid_writer[i], | |
978 | NULL, test_ja_rw_thr_writer, | |
979 | &count_writer[i]); | |
980 | if (err != 0) | |
981 | exit(1); | |
982 | } | |
983 | ||
984 | cmm_smp_mb(); | |
985 | ||
986 | test_go = 1; | |
987 | ||
988 | rcu_thread_offline_qsbr(); | |
989 | ||
990 | remain = duration; | |
991 | do { | |
992 | remain = sleep(remain); | |
993 | } while (remain > 0); | |
994 | ||
995 | test_stop = 1; | |
996 | ||
997 | for (i = 0; i < nr_readers; i++) { | |
998 | err = pthread_join(tid_reader[i], &tret); | |
999 | if (err != 0) | |
1000 | exit(1); | |
1001 | tot_reads += count_reader[i]; | |
1002 | } | |
1003 | for (i = 0; i < nr_writers; i++) { | |
1004 | err = pthread_join(tid_writer[i], &tret); | |
1005 | if (err != 0) | |
1006 | exit(1); | |
1007 | tot_writes += count_writer[i].update_ops; | |
1008 | tot_add += count_writer[i].add; | |
1009 | tot_add_exist += count_writer[i].add_exist; | |
1010 | tot_remove += count_writer[i].remove; | |
1011 | } | |
88e115c3 | 1012 | rcu_thread_online_qsbr(); |
1a0c0717 | 1013 | |
21ac4c56 | 1014 | ret = cds_ja_destroy(test_ja, rcu_free_node); |
1a0c0717 MD |
1015 | if (ret) { |
1016 | fprintf(stderr, "Error destroying judy array\n"); | |
1017 | goto end; | |
1018 | } | |
1a0c0717 MD |
1019 | |
1020 | free(tid_reader); | |
1021 | free(tid_writer); | |
1022 | free(count_reader); | |
1023 | free(count_writer); | |
1024 | ret = 0; | |
1025 | end: | |
1026 | return ret; | |
1027 | } | |
1028 | ||
026545d3 MD |
1029 | static |
1030 | int check_memory_leaks(void) | |
1031 | { | |
1032 | unsigned long na, nf; | |
1033 | ||
1034 | na = uatomic_read(&test_nodes_allocated); | |
1035 | nf = uatomic_read(&test_nodes_freed); | |
1036 | if (na != nf) { | |
1037 | fprintf(stderr, "Memory leak of %ld test nodes detected. Allocated: %lu, freed: %lu\n", | |
1038 | na - nf, na, nf); | |
1039 | return -1; | |
1040 | } | |
1041 | return 0; | |
1042 | } | |
1043 | ||
1a0c0717 MD |
1044 | int main(int argc, char **argv) |
1045 | { | |
1046 | int i, j, a, ret, err; | |
a2a7ff59 | 1047 | uint64_t key; |
1a0c0717 | 1048 | struct sigaction act; |
44151f89 MD |
1049 | |
1050 | if (argc < 4) { | |
1051 | show_usage(argc, argv); | |
1052 | return -1; | |
1053 | } | |
1054 | ||
1055 | err = sscanf(argv[1], "%u", &nr_readers); | |
1056 | if (err != 1) { | |
1057 | show_usage(argc, argv); | |
1058 | return -1; | |
1059 | } | |
1060 | ||
1061 | err = sscanf(argv[2], "%u", &nr_writers); | |
1062 | if (err != 1) { | |
1063 | show_usage(argc, argv); | |
1064 | return -1; | |
1065 | } | |
1066 | ||
1067 | err = sscanf(argv[3], "%lu", &duration); | |
1068 | if (err != 1) { | |
1069 | show_usage(argc, argv); | |
1070 | return -1; | |
1071 | } | |
1072 | ||
1073 | for (i = 4; i < argc; i++) { | |
1074 | if (argv[i][0] != '-') | |
1075 | continue; | |
1076 | switch (argv[i][1]) { | |
1077 | #ifdef DEBUG_YIELD | |
1078 | case 'r': | |
1079 | yield_active |= YIELD_READ; | |
1080 | break; | |
1081 | case 'w': | |
1082 | yield_active |= YIELD_WRITE; | |
1083 | break; | |
1084 | #endif | |
1085 | case 'a': | |
1086 | if (argc < i + 2) { | |
1087 | show_usage(argc, argv); | |
1088 | return -1; | |
1089 | } | |
1090 | a = atoi(argv[++i]); | |
1091 | cpu_affinities[next_aff++] = a; | |
1092 | use_affinity = 1; | |
1093 | printf_verbose("Adding CPU %d affinity\n", a); | |
1094 | break; | |
1095 | case 'c': | |
1096 | if (argc < i + 2) { | |
1097 | show_usage(argc, argv); | |
1098 | return -1; | |
1099 | } | |
1100 | rduration = atol(argv[++i]); | |
1101 | break; | |
1102 | case 'd': | |
1103 | if (argc < i + 2) { | |
1104 | show_usage(argc, argv); | |
1105 | return -1; | |
1106 | } | |
1107 | wdelay = atol(argv[++i]); | |
1108 | break; | |
1109 | case 'v': | |
1110 | verbose_mode = 1; | |
1111 | break; | |
34ffee3e MD |
1112 | case 'r': |
1113 | add_ratio = atoi(argv[++i]); | |
44151f89 MD |
1114 | break; |
1115 | case 'k': | |
46f373a6 | 1116 | init_populate = 1; |
44151f89 MD |
1117 | break; |
1118 | case 'R': | |
1119 | lookup_pool_offset = atol(argv[++i]); | |
1120 | break; | |
1121 | case 'S': | |
1122 | write_pool_offset = atol(argv[++i]); | |
1123 | break; | |
1124 | case 'T': | |
1125 | init_pool_offset = atol(argv[++i]); | |
1126 | break; | |
1127 | case 'M': | |
1128 | lookup_pool_size = atol(argv[++i]); | |
1129 | break; | |
1130 | case 'N': | |
1131 | write_pool_size = atol(argv[++i]); | |
1132 | break; | |
1133 | case 'O': | |
1134 | init_pool_size = atol(argv[++i]); | |
1135 | break; | |
1136 | case 'V': | |
1137 | validate_lookup = 1; | |
1138 | break; | |
04c48ddf | 1139 | case 't': |
1a0c0717 MD |
1140 | sanity_test = 1; |
1141 | break; | |
1142 | case 'B': | |
1143 | key_bits = atol(argv[++i]); | |
1144 | break; | |
4df4328c MD |
1145 | case 'm': |
1146 | key_mul = atoll(argv[++i]); | |
1147 | break; | |
04c48ddf MD |
1148 | case 'u': |
1149 | add_unique = 1; | |
1150 | break; | |
1151 | case 's': | |
1152 | add_replace = 1; | |
1153 | break; | |
026545d3 MD |
1154 | case 'l': |
1155 | leak_detection = 1; | |
1156 | break; | |
44151f89 MD |
1157 | } |
1158 | } | |
1159 | ||
1160 | printf_verbose("running test for %lu seconds, %u readers, %u writers.\n", | |
1161 | duration, nr_readers, nr_writers); | |
1162 | printf_verbose("Writer delay : %lu loops.\n", wdelay); | |
1163 | printf_verbose("Reader duration : %lu loops.\n", rduration); | |
34ffee3e | 1164 | printf_verbose("Add ratio: %u%%.\n", add_ratio); |
04c48ddf MD |
1165 | printf_verbose("Mode:%s%s.\n", |
1166 | " add/remove", | |
1167 | add_unique ? " uniquify" : ( add_replace ? " replace" : " insert")); | |
b31cb285 | 1168 | printf_verbose("Key multiplication factor: %" PRIu64 ".\n", key_mul); |
44151f89 MD |
1169 | printf_verbose("Init pool size offset %lu size %lu.\n", |
1170 | init_pool_offset, init_pool_size); | |
1171 | printf_verbose("Lookup pool size offset %lu size %lu.\n", | |
1172 | lookup_pool_offset, lookup_pool_size); | |
1173 | printf_verbose("Update pool size offset %lu size %lu.\n", | |
1174 | write_pool_offset, write_pool_size); | |
46fc422b MD |
1175 | if (validate_lookup) |
1176 | printf_verbose("Validating lookups.\n"); | |
026545d3 MD |
1177 | if (leak_detection) |
1178 | printf_verbose("Memory leak dection activated.\n"); | |
44151f89 MD |
1179 | printf_verbose("thread %-6s, thread id : %lx, tid %lu\n", |
1180 | "main", pthread_self(), (unsigned long)gettid()); | |
1181 | ||
1a0c0717 MD |
1182 | memset(&act, 0, sizeof(act)); |
1183 | ret = sigemptyset(&act.sa_mask); | |
1184 | if (ret == -1) { | |
1185 | perror("sigemptyset"); | |
1186 | return -1; | |
1187 | } | |
1188 | act.sa_handler = test_ja_rw_sigusr1_handler; | |
1189 | act.sa_flags = SA_RESTART; | |
1190 | ret = sigaction(SIGUSR1, &act, NULL); | |
1191 | if (ret == -1) { | |
1192 | perror("sigaction"); | |
1193 | return -1; | |
1194 | } | |
44151f89 MD |
1195 | |
1196 | err = create_all_cpu_call_rcu_data(0); | |
1197 | if (err) { | |
1198 | printf("Per-CPU call_rcu() worker threads unavailable. Using default global worker thread.\n"); | |
1199 | } | |
1200 | ||
582a6ade | 1201 | rcu_register_thread(); |
44151f89 | 1202 | |
1a0c0717 MD |
1203 | if (sanity_test) { |
1204 | ret = do_sanity_test(); | |
1a0c0717 | 1205 | } else { |
4bea9b8d | 1206 | ret = do_mt_test(); |
44151f89 | 1207 | } |
a2a7ff59 | 1208 | |
026545d3 MD |
1209 | /* Wait for in-flight call_rcu free to complete for leak detection */ |
1210 | rcu_barrier(); | |
1211 | ||
1212 | ret |= check_memory_leaks(); | |
1213 | ||
582a6ade | 1214 | rcu_unregister_thread(); |
1a0c0717 | 1215 | free_all_cpu_call_rcu_data(); |
4bea9b8d MD |
1216 | |
1217 | if (ret) { | |
1218 | printf("Test ended with error: %d\n", ret); | |
1219 | } | |
1220 | return ret; | |
44151f89 | 1221 | } |