4 * Userspace RCU library - test program
6 * Copyright 2009-2012 - Mathieu Desnoyers <mathieu.desnoyers@polymtl.ca>
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.
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.
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.
24 #include "test_urcu_ja.h"
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
);
36 struct cds_ja
*test_ja
;
38 volatile int test_go
, test_stop
;
42 unsigned long duration
;
44 /* read-side C.S. duration, in loops */
45 unsigned long rduration
;
47 unsigned long init_populate
;
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
;
56 unsigned int key_bits
= 32;
62 unsigned int cpu_affinities
[NR_CPUS
];
63 unsigned int next_aff
= 0;
66 pthread_mutex_t affinity_mutex
= PTHREAD_MUTEX_INITIALIZER
;
68 DEFINE_URCU_TLS(unsigned long long, nr_writes
);
69 DEFINE_URCU_TLS(unsigned long long, nr_reads
);
71 unsigned int nr_readers
;
72 unsigned int nr_writers
;
74 static unsigned int add_ratio
= 50;
75 static uint64_t key_mul
= 1ULL;
77 static int add_unique
, add_replace
;
79 static pthread_mutex_t rcu_copy_mutex
= PTHREAD_MUTEX_INITIALIZER
;
81 static int leak_detection
;
82 static unsigned long test_nodes_allocated
, test_nodes_freed
;
84 void set_affinity(void)
93 #if HAVE_SCHED_SETAFFINITY
94 ret
= pthread_mutex_lock(&affinity_mutex
);
96 perror("Error in pthread mutex lock");
99 cpu
= cpu_affinities
[next_aff
++];
100 ret
= pthread_mutex_unlock(&affinity_mutex
);
102 perror("Error in pthread mutex unlock");
107 #if SCHED_SETAFFINITY_ARGS == 2
108 sched_setaffinity(0, &mask
);
110 sched_setaffinity(0, sizeof(mask
), &mask
);
112 #endif /* HAVE_SCHED_SETAFFINITY */
115 void rcu_copy_mutex_lock(void)
118 ret
= pthread_mutex_lock(&rcu_copy_mutex
);
120 perror("Error in pthread mutex lock");
125 void rcu_copy_mutex_unlock(void)
129 ret
= pthread_mutex_unlock(&rcu_copy_mutex
);
131 perror("Error in pthread mutex unlock");
137 struct ja_test_node
*node_alloc(void)
139 struct ja_test_node
*node
;
141 node
= calloc(sizeof(*node
), 1);
142 if (leak_detection
&& node
)
143 uatomic_inc(&test_nodes_allocated
);
148 void free_test_node(struct ja_test_node
*node
)
152 uatomic_inc(&test_nodes_freed
);
156 void free_test_node_cb(struct rcu_head
*head
)
158 struct ja_test_node
*node
=
159 caa_container_of(head
, struct ja_test_node
, head
);
160 free_test_node(node
);
164 void rcu_free_test_node(struct ja_test_node
*test_node
)
166 call_rcu(&test_node
->head
, free_test_node_cb
);
170 void free_node(struct cds_ja_node
*node
)
172 struct ja_test_node
*test_node
= to_test_node(node
);
174 free_test_node(test_node
);
179 void test_delete_all_nodes(struct cds_lfht
*ht
)
181 struct cds_lfht_iter iter
;
182 struct lfht_test_node
*node
;
183 unsigned long count
= 0;
185 cds_lfht_for_each_entry(ht
, &iter
, node
, node
) {
188 ret
= cds_lfht_del(test_ht
, cds_lfht_iter_get_node(&iter
));
190 call_rcu(&node
->head
, free_node_cb
);
193 printf("deleted %lu nodes.\n", count
);
197 void show_usage(int argc
, char **argv
)
199 printf("Usage : %s nr_readers nr_writers duration (s)\n", argv
[0]);
201 printf(" [-r] [-w] (yield reader and/or writer)\n");
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");
207 printf(" [-u] Add unique keys.\n");
208 printf(" [-s] Replace existing keys.\n");
209 printf(" [not -u nor -s] Add entries (supports redundant keys).\n");
210 printf(" [-r ratio] Add ratio (in %% of add+removal).\n");
211 printf(" [-k] Populate init nodes.\n");
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");
219 printf(" [-t] Do sanity test.\n");
220 printf(" [-B] Key bits for multithread test (default: 32).\n");
221 printf(" [-m factor] Key multiplication factor.\n");
222 printf(" [-l] Memory leak detection.\n");
227 int test_8bit_key(void)
231 uint64_t ka
[] = { 5, 17, 100, 222 };
232 uint64_t ka_test_offset
= 5;
234 /* Test with 8-bit key */
235 test_ja
= cds_ja_new(8);
237 printf("Error allocating judy array.\n");
242 printf("Test #1: add keys (8-bit).\n");
243 for (key
= 0; key
< 200; key
++) {
244 struct ja_test_node
*node
= node_alloc();
246 ja_test_node_init(node
, key
);
248 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
251 fprintf(stderr
, "Error (%d) adding node %" PRIu64
"\n",
258 printf("Test #2: successful key lookup (8-bit).\n");
259 for (key
= 0; key
< 200; key
++) {
260 struct cds_ja_node
*node
;
263 node
= cds_ja_lookup(test_ja
, key
);
265 fprintf(stderr
, "Error lookup node %" PRIu64
"\n", key
);
271 printf("Test #3: unsuccessful key lookup (8-bit).\n");
272 for (key
= 200; key
< 240; key
++) {
273 struct cds_ja_node
*node
;
276 node
= cds_ja_lookup(test_ja
, key
);
279 "Error unexpected lookup node %" PRIu64
"\n",
286 printf("Test #4: remove keys (8-bit).\n");
287 for (key
= 0; key
< 200; key
++) {
288 struct cds_ja_node
*ja_node
;
289 struct ja_test_node
*node
;
292 ja_node
= cds_ja_lookup(test_ja
, key
);
294 fprintf(stderr
, "Error lookup node %" PRIu64
"\n", key
);
297 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
298 ret
= cds_ja_del(test_ja
, key
, &node
->node
);
300 fprintf(stderr
, "Error (%d) removing node %" PRIu64
"\n", ret
, key
);
303 rcu_free_test_node(node
);
304 ja_node
= cds_ja_lookup(test_ja
, key
);
306 fprintf(stderr
, "Error lookup %" PRIu64
": %p (after delete) failed. Node is not expected.\n", key
, ja_node
);
313 printf("Test #5: lookup below/above equal (8-bit).\n");
315 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
316 struct ja_test_node
*node
= node_alloc();
319 ja_test_node_init(node
, key
);
321 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
324 fprintf(stderr
, "Error (%d) adding node %" PRIu64
"\n",
330 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
331 struct cds_ja_node
*ja_node
;
332 struct ja_test_node
*node
;
335 key
= ka
[i
] + ka_test_offset
;
337 ja_node
= cds_ja_lookup_below_equal(test_ja
, key
, &result_key
);
339 fprintf(stderr
, "Error lookup below equal. Cannot find expected key %" PRIu64
" below or equal to %" PRIu64
".\n",
343 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
344 if (node
->key
!= ka
[i
] || result_key
!= ka
[i
]) {
345 fprintf(stderr
, "Error lookup below equal. Expecting key %" PRIu64
" below or equal to %" PRIu64
", but found %" PRIu64
"/%" PRIu64
" instead.\n",
346 ka
[i
], key
, node
->key
, result_key
);
352 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
353 struct cds_ja_node
*ja_node
;
354 struct ja_test_node
*node
;
357 key
= ka
[i
] - ka_test_offset
;
359 ja_node
= cds_ja_lookup_above_equal(test_ja
, key
, &result_key
);
361 fprintf(stderr
, "Error lookup above equal. Cannot find expected key %" PRIu64
" below or equal to %" PRIu64
".\n",
365 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
366 if (node
->key
!= ka
[i
] || result_key
!= ka
[i
]) {
367 fprintf(stderr
, "Error lookup above equal. Expecting key %" PRIu64
" below or equal to %" PRIu64
", but found %" PRIu64
"/%" PRIu64
" instead.\n",
368 ka
[i
], key
, node
->key
, result_key
);
374 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
375 struct cds_ja_node
*ja_node
;
376 struct ja_test_node
*node
;
379 key
= ka
[i
]; /* without offset */
381 ja_node
= cds_ja_lookup_below_equal(test_ja
, key
, &result_key
);
383 fprintf(stderr
, "Error lookup below equal. Cannot find expected key %" PRIu64
" below or equal to %" PRIu64
".\n",
387 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
388 if (node
->key
!= ka
[i
] || result_key
!= ka
[i
]) {
389 fprintf(stderr
, "Error lookup below equal. Expecting key %" PRIu64
" below or equal to %" PRIu64
", but found %" PRIu64
"/%" PRIu64
" instead.\n",
390 ka
[i
], key
, node
->key
, result_key
);
394 ja_node
= cds_ja_lookup_above_equal(test_ja
, key
, &result_key
);
396 fprintf(stderr
, "Error lookup above equal. Cannot find expected key %" PRIu64
" below or equal to %" PRIu64
".\n",
400 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
401 if (node
->key
!= ka
[i
] || result_key
!= ka
[i
]) {
402 fprintf(stderr
, "Error lookup above equal. Expecting key %" PRIu64
" below or equal to %" PRIu64
", but found %" PRIu64
"/%" PRIu64
" instead.\n",
403 ka
[i
], key
, node
->key
, result_key
);
411 ret
= cds_ja_destroy(test_ja
, free_node
);
413 fprintf(stderr
, "Error destroying judy array\n");
420 int test_16bit_key(void)
424 uint64_t ka
[] = { 105, 206, 4000, 4111, 59990, 65435 };
425 uint64_t ka_test_offset
= 100;
427 /* Test with 16-bit key */
428 test_ja
= cds_ja_new(16);
430 printf("Error allocating judy array.\n");
435 printf("Test #1: add keys (16-bit).\n");
436 for (key
= 0; key
< 10000; key
++) {
437 //for (key = 0; key < 65536; key+=256) {
438 struct ja_test_node
*node
= node_alloc();
440 ja_test_node_init(node
, key
);
442 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
445 fprintf(stderr
, "Error (%d) adding node %" PRIu64
"\n",
452 printf("Test #2: successful key lookup (16-bit).\n");
453 for (key
= 0; key
< 10000; key
++) {
454 //for (key = 0; key < 65536; key+=256) {
455 struct cds_ja_node
*node
;
458 node
= cds_ja_lookup(test_ja
, key
);
460 fprintf(stderr
, "Error lookup node %" PRIu64
"\n", key
);
466 printf("Test #3: unsuccessful key lookup (16-bit).\n");
467 for (key
= 11000; key
<= 11002; key
++) {
468 struct cds_ja_node
*node
;
471 node
= cds_ja_lookup(test_ja
, key
);
474 "Error unexpected lookup node %" PRIu64
"\n",
481 printf("Test #4: remove keys (16-bit).\n");
482 for (key
= 0; key
< 10000; key
++) {
483 //for (key = 0; key < 65536; key+=256) {
484 struct cds_ja_node
*ja_node
;
485 struct ja_test_node
*node
;
488 ja_node
= cds_ja_lookup(test_ja
, key
);
490 fprintf(stderr
, "Error lookup node %" PRIu64
"\n", key
);
493 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
494 ret
= cds_ja_del(test_ja
, key
, &node
->node
);
496 fprintf(stderr
, "Error (%d) removing node %" PRIu64
"\n", ret
, key
);
499 rcu_free_test_node(node
);
500 ja_node
= cds_ja_lookup(test_ja
, key
);
502 fprintf(stderr
, "Error lookup %" PRIu64
": %p (after delete) failed. Node is not expected.\n", key
, ja_node
);
509 printf("Test #5: lookup below/above equal (16-bit).\n");
511 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
512 struct ja_test_node
*node
= node_alloc();
515 ja_test_node_init(node
, key
);
517 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
520 fprintf(stderr
, "Error (%d) adding node %" PRIu64
"\n",
526 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
527 struct cds_ja_node
*ja_node
;
528 struct ja_test_node
*node
;
531 key
= ka
[i
] + ka_test_offset
;
533 ja_node
= cds_ja_lookup_below_equal(test_ja
, key
, &result_key
);
535 fprintf(stderr
, "Error lookup below equal. Cannot find expected key %" PRIu64
" below or equal to %" PRIu64
".\n",
539 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
540 if (node
->key
!= ka
[i
] || result_key
!= ka
[i
]) {
541 fprintf(stderr
, "Error lookup below equal. Expecting key %" PRIu64
" below or equal to %" PRIu64
", but found %" PRIu64
"/%" PRIu64
" instead.\n",
542 ka
[i
], key
, node
->key
, result_key
);
548 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
549 struct cds_ja_node
*ja_node
;
550 struct ja_test_node
*node
;
553 key
= ka
[i
] - ka_test_offset
;
555 ja_node
= cds_ja_lookup_above_equal(test_ja
, key
, &result_key
);
557 fprintf(stderr
, "Error lookup above equal. Cannot find expected key %" PRIu64
" above or equal to %" PRIu64
".\n",
561 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
562 if (node
->key
!= ka
[i
] || result_key
!= ka
[i
]) {
563 fprintf(stderr
, "Error lookup above equal. Expecting key %" PRIu64
" above or equal to %" PRIu64
", but found %" PRIu64
"/%" PRIu64
" instead.\n",
564 ka
[i
], key
, node
->key
, result_key
);
570 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
571 struct cds_ja_node
*ja_node
;
572 struct ja_test_node
*node
;
575 key
= ka
[i
]; /* without offset */
577 ja_node
= cds_ja_lookup_below_equal(test_ja
, key
, &result_key
);
579 fprintf(stderr
, "Error lookup below equal. Cannot find expected key %" PRIu64
" below or equal to %" PRIu64
".\n",
583 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
584 if (node
->key
!= ka
[i
] || result_key
!= ka
[i
]) {
585 fprintf(stderr
, "Error lookup below equal. Expecting key %" PRIu64
" below or equal to %" PRIu64
", but found %" PRIu64
"/%" PRIu64
" instead.\n",
586 ka
[i
], key
, node
->key
, result_key
);
590 ja_node
= cds_ja_lookup_above_equal(test_ja
, key
, &result_key
);
592 fprintf(stderr
, "Error lookup above equal. Cannot find expected key %" PRIu64
" above or equal to %" PRIu64
".\n",
596 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
597 if (node
->key
!= ka
[i
] || result_key
!= ka
[i
]) {
598 fprintf(stderr
, "Error lookup above equal. Expecting key %" PRIu64
" above or equal to %" PRIu64
", but found %" PRIu64
"/%" PRIu64
" instead.\n",
599 ka
[i
], key
, node
->key
, result_key
);
607 ret
= cds_ja_destroy(test_ja
, free_node
);
609 fprintf(stderr
, "Error destroying judy array\n");
616 * nr_dup is number of nodes per key.
619 int test_sparse_key(unsigned int bits
, int nr_dup
)
621 uint64_t key
, max_key
;
622 int zerocount
, i
, ret
;
625 max_key
= UINT64_MAX
;
627 max_key
= (1ULL << bits
) - 1;
629 printf("Sparse key test begins for %u-bit keys\n", bits
);
630 /* Test with 16-bit key */
631 test_ja
= cds_ja_new(bits
);
633 printf("Error allocating judy array.\n");
638 printf("Test #1: add keys (%u-bit).\n", bits
);
639 for (i
= 0; i
< nr_dup
; i
++) {
641 for (key
= 0; key
<= max_key
&& (key
!= 0 || zerocount
< 1); key
+= 1ULL << (bits
- 8)) {
642 struct ja_test_node
*node
= node_alloc();
644 ja_test_node_init(node
, key
);
646 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
649 fprintf(stderr
, "Error (%d) adding node %" PRIu64
"\n",
659 printf("Test #2: successful key lookup (%u-bit).\n", bits
);
661 for (key
= 0; key
<= max_key
&& (key
!= 0 || zerocount
< 1); key
+= 1ULL << (bits
- 8)) {
662 struct cds_ja_node
*ja_node
;
663 struct ja_test_node
*node
;
667 ja_node
= cds_ja_lookup(test_ja
, key
);
669 fprintf(stderr
, "Error lookup node %" PRIu64
"\n", key
);
672 cds_ja_for_each_duplicate_rcu(ja_node
) {
675 if (count
!= nr_dup
) {
676 fprintf(stderr
, "Unexpected number of match for key %" PRIu64
", expected %d, got %d.\n", key
, nr_dup
, count
);
684 printf("Test #3: unsuccessful key lookup (%u-bit).\n", bits
);
686 for (key
= 0; key
<= max_key
&& (key
!= 0 || zerocount
< 1); key
+= 1ULL << (bits
- 8)) {
687 struct cds_ja_node
*ja_node
;
690 ja_node
= cds_ja_lookup(test_ja
, key
+ 42);
693 "Error unexpected lookup node %" PRIu64
"\n",
703 printf("Test #4: remove keys (%u-bit).\n", bits
);
705 for (key
= 0; key
<= max_key
&& (key
!= 0 || zerocount
< 1); key
+= 1ULL << (bits
- 8)) {
706 struct cds_ja_node
*ja_node
;
710 ja_node
= cds_ja_lookup(test_ja
, key
);
712 cds_ja_for_each_duplicate_rcu(ja_node
) {
713 struct cds_ja_node
*test_ja_node
;
714 struct ja_test_node
*node
;
717 node
= caa_container_of(ja_node
,
718 struct ja_test_node
, node
);
719 ret
= cds_ja_del(test_ja
, key
, &node
->node
);
721 fprintf(stderr
, "Error (%d) removing node %" PRIu64
"\n", ret
, key
);
724 rcu_free_test_node(node
);
725 test_ja_node
= cds_ja_lookup(test_ja
, key
);
726 if (count
< nr_dup
&& !test_ja_node
) {
727 fprintf(stderr
, "Error: no node found after deletion of some nodes of a key\n");
731 ja_node
= cds_ja_lookup(test_ja
, key
);
733 fprintf(stderr
, "Error lookup %" PRIu64
": %p (after delete) failed. Node is not expected.\n", key
, ja_node
);
742 ret
= cds_ja_destroy(test_ja
, free_node
);
744 fprintf(stderr
, "Error destroying judy array\n");
747 printf("Test ends\n");
753 int do_sanity_test(void)
757 printf("Sanity test start.\n");
759 for (i
= 0; i
< 3; i
++) {
760 ret
= test_8bit_key();
764 rcu_quiescent_state();
766 ret
= test_16bit_key();
770 rcu_quiescent_state();
773 for (i
= 8; i
<= 64; i
*= 2) {
774 /* nr of nodes per key */
775 for (j
= 1; j
< 4; j
++) {
776 ret
= test_sparse_key(i
, j
);
780 rcu_quiescent_state();
783 printf("Sanity test end.\n");
788 enum urcu_ja_addremove
{
792 }; /* 1: add, -1 remove, 0: random */
794 static enum urcu_ja_addremove addremove
; /* 1: add, -1 remove, 0: random */
797 void test_ja_rw_sigusr1_handler(int signo
)
801 printf("Add/Remove: random.\n");
802 addremove
= AR_RANDOM
;
805 printf("Add/Remove: remove only.\n");
806 addremove
= AR_REMOVE
;
809 printf("Add/Remove: add only.\n");
816 void *test_ja_rw_thr_reader(void *_count
)
818 unsigned long long *count
= _count
;
819 struct cds_ja_node
*ja_node
;
822 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
823 "reader", pthread_self(), (unsigned long) gettid());
827 rcu_register_thread();
837 /* note: only looking up ulong keys */
838 key
= ((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % lookup_pool_size
) + lookup_pool_offset
;
840 ja_node
= cds_ja_lookup(test_ja
, key
);
842 if (validate_lookup
) {
843 printf("[ERROR] Lookup cannot find initial node.\n");
846 URCU_TLS(lookup_fail
)++;
848 URCU_TLS(lookup_ok
)++;
850 rcu_debug_yield_read();
851 if (caa_unlikely(rduration
))
852 loop_sleep(rduration
);
854 URCU_TLS(nr_reads
)++;
855 if (caa_unlikely(!test_duration_read()))
857 if (caa_unlikely((URCU_TLS(nr_reads
) & ((1 << 10) - 1)) == 0))
858 rcu_quiescent_state();
861 rcu_unregister_thread();
863 *count
= URCU_TLS(nr_reads
);
864 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
865 "reader", pthread_self(), (unsigned long) gettid());
866 printf_verbose("readid : %lx, lookupfail %lu, lookupok %lu\n",
867 pthread_self(), URCU_TLS(lookup_fail
),
868 URCU_TLS(lookup_ok
));
875 return ((unsigned int) rand_r(&URCU_TLS(rand_lookup
)) % 100) < add_ratio
;
879 void *test_ja_rw_thr_writer(void *_count
)
881 struct wr_count
*count
= _count
;
885 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
886 "writer", pthread_self(), (unsigned long) gettid());
890 rcu_register_thread();
898 if ((addremove
== AR_ADD
)
899 || (addremove
== AR_RANDOM
&& is_add())) {
900 struct ja_test_node
*node
= node_alloc();
901 struct cds_ja_node
*ret_node
;
903 /* note: only inserting ulong keys */
904 key
= ((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % write_pool_size
) + write_pool_offset
;
906 ja_test_node_init(node
, key
);
909 ret_node
= cds_ja_add_unique(test_ja
, key
, &node
->node
);
910 if (ret_node
!= &node
->node
) {
911 free_test_node(node
);
912 URCU_TLS(nr_addexist
)++;
916 } else if (add_replace
) {
917 assert(0); /* not implemented yet. */
919 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
921 fprintf(stderr
, "Error in cds_ja_add: %d\n", ret
);
922 free_test_node(node
);
929 struct cds_ja_node
*ja_node
;
930 struct ja_test_node
*node
;
933 /* note: only deleting ulong keys */
934 key
= ((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % write_pool_size
) + write_pool_offset
;
939 ja_node
= cds_ja_lookup(test_ja
, key
);
940 /* Remove first entry */
942 node
= caa_container_of(ja_node
,
943 struct ja_test_node
, node
);
944 ret
= cds_ja_del(test_ja
, key
, &node
->node
);
946 rcu_free_test_node(node
);
949 URCU_TLS(nr_delnoent
)++;
952 URCU_TLS(nr_delnoent
)++;
957 URCU_TLS(nr_writes
)++;
958 if (caa_unlikely(!test_duration_write()))
960 if (caa_unlikely(wdelay
))
962 if (caa_unlikely((URCU_TLS(nr_writes
) & ((1 << 10) - 1)) == 0))
963 rcu_quiescent_state();
966 rcu_unregister_thread();
968 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
969 "writer", pthread_self(), (unsigned long) gettid());
970 printf_verbose("info id %lx: nr_add %lu, nr_addexist %lu, nr_del %lu, "
971 "nr_delnoent %lu\n", pthread_self(), URCU_TLS(nr_add
),
972 URCU_TLS(nr_addexist
), URCU_TLS(nr_del
),
973 URCU_TLS(nr_delnoent
));
974 count
->update_ops
= URCU_TLS(nr_writes
);
975 count
->add
= URCU_TLS(nr_add
);
976 count
->add_exist
= URCU_TLS(nr_addexist
);
977 count
->remove
= URCU_TLS(nr_del
);
982 int do_mt_populate_ja(void)
990 printf("Starting rw test\n");
992 for (iter
= init_pool_offset
; iter
< init_pool_offset
+ init_pool_size
; iter
++) {
993 struct ja_test_node
*node
= node_alloc();
996 /* note: only inserting ulong keys */
997 key
= (unsigned long) iter
;
999 ja_test_node_init(node
, key
);
1001 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
1003 URCU_TLS(nr_writes
)++;
1006 fprintf(stderr
, "Error (%d) adding node %" PRIu64
"\n",
1015 int do_mt_test(void)
1017 pthread_t
*tid_reader
, *tid_writer
;
1020 unsigned long long *count_reader
;
1021 struct wr_count
*count_writer
;
1022 unsigned long long tot_reads
= 0, tot_writes
= 0,
1023 tot_add
= 0, tot_add_exist
= 0, tot_remove
= 0;
1024 unsigned int remain
;
1026 tid_reader
= malloc(sizeof(*tid_reader
) * nr_readers
);
1027 tid_writer
= malloc(sizeof(*tid_writer
) * nr_writers
);
1028 count_reader
= malloc(sizeof(*count_reader
) * nr_readers
);
1029 count_writer
= malloc(sizeof(*count_writer
) * nr_writers
);
1031 printf("Allocating Judy Array for %u-bit keys\n", key_bits
);
1032 test_ja
= cds_ja_new(key_bits
);
1034 printf("Error allocating judy array.\n");
1039 do_mt_populate_ja();
1043 for (i
= 0; i
< nr_readers
; i
++) {
1044 err
= pthread_create(&tid_reader
[i
],
1045 NULL
, test_ja_rw_thr_reader
,
1050 for (i
= 0; i
< nr_writers
; i
++) {
1051 err
= pthread_create(&tid_writer
[i
],
1052 NULL
, test_ja_rw_thr_writer
,
1062 rcu_thread_offline_qsbr();
1066 remain
= sleep(remain
);
1067 } while (remain
> 0);
1071 for (i
= 0; i
< nr_readers
; i
++) {
1072 err
= pthread_join(tid_reader
[i
], &tret
);
1075 tot_reads
+= count_reader
[i
];
1077 for (i
= 0; i
< nr_writers
; i
++) {
1078 err
= pthread_join(tid_writer
[i
], &tret
);
1081 tot_writes
+= count_writer
[i
].update_ops
;
1082 tot_add
+= count_writer
[i
].add
;
1083 tot_add_exist
+= count_writer
[i
].add_exist
;
1084 tot_remove
+= count_writer
[i
].remove
;
1086 rcu_thread_online_qsbr();
1088 ret
= cds_ja_destroy(test_ja
, free_node
);
1090 fprintf(stderr
, "Error destroying judy array\n");
1104 int check_memory_leaks(void)
1106 unsigned long na
, nf
;
1108 na
= uatomic_read(&test_nodes_allocated
);
1109 nf
= uatomic_read(&test_nodes_freed
);
1111 fprintf(stderr
, "Memory leak of %ld test nodes detected. Allocated: %lu, freed: %lu\n",
1118 int main(int argc
, char **argv
)
1120 int i
, j
, a
, ret
, err
;
1122 struct sigaction act
;
1125 show_usage(argc
, argv
);
1129 err
= sscanf(argv
[1], "%u", &nr_readers
);
1131 show_usage(argc
, argv
);
1135 err
= sscanf(argv
[2], "%u", &nr_writers
);
1137 show_usage(argc
, argv
);
1141 err
= sscanf(argv
[3], "%lu", &duration
);
1143 show_usage(argc
, argv
);
1147 for (i
= 4; i
< argc
; i
++) {
1148 if (argv
[i
][0] != '-')
1150 switch (argv
[i
][1]) {
1153 yield_active
|= YIELD_READ
;
1156 yield_active
|= YIELD_WRITE
;
1161 show_usage(argc
, argv
);
1164 a
= atoi(argv
[++i
]);
1165 cpu_affinities
[next_aff
++] = a
;
1167 printf_verbose("Adding CPU %d affinity\n", a
);
1171 show_usage(argc
, argv
);
1174 rduration
= atol(argv
[++i
]);
1178 show_usage(argc
, argv
);
1181 wdelay
= atol(argv
[++i
]);
1187 add_ratio
= atoi(argv
[++i
]);
1193 lookup_pool_offset
= atol(argv
[++i
]);
1196 write_pool_offset
= atol(argv
[++i
]);
1199 init_pool_offset
= atol(argv
[++i
]);
1202 lookup_pool_size
= atol(argv
[++i
]);
1205 write_pool_size
= atol(argv
[++i
]);
1208 init_pool_size
= atol(argv
[++i
]);
1211 validate_lookup
= 1;
1217 key_bits
= atol(argv
[++i
]);
1220 key_mul
= atoll(argv
[++i
]);
1234 printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
1235 duration
, nr_readers
, nr_writers
);
1236 printf_verbose("Writer delay : %lu loops.\n", wdelay
);
1237 printf_verbose("Reader duration : %lu loops.\n", rduration
);
1238 printf_verbose("Add ratio: %u%%.\n", add_ratio
);
1239 printf_verbose("Mode:%s%s.\n",
1241 add_unique
? " uniquify" : ( add_replace
? " replace" : " insert"));
1242 printf_verbose("Key multiplication factor: %" PRIu64
".\n", key_mul
);
1243 printf_verbose("Init pool size offset %lu size %lu.\n",
1244 init_pool_offset
, init_pool_size
);
1245 printf_verbose("Lookup pool size offset %lu size %lu.\n",
1246 lookup_pool_offset
, lookup_pool_size
);
1247 printf_verbose("Update pool size offset %lu size %lu.\n",
1248 write_pool_offset
, write_pool_size
);
1249 if (validate_lookup
)
1250 printf_verbose("Validating lookups.\n");
1252 printf_verbose("Memory leak dection activated.\n");
1253 printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
1254 "main", pthread_self(), (unsigned long)gettid());
1256 memset(&act
, 0, sizeof(act
));
1257 ret
= sigemptyset(&act
.sa_mask
);
1259 perror("sigemptyset");
1262 act
.sa_handler
= test_ja_rw_sigusr1_handler
;
1263 act
.sa_flags
= SA_RESTART
;
1264 ret
= sigaction(SIGUSR1
, &act
, NULL
);
1266 perror("sigaction");
1270 err
= create_all_cpu_call_rcu_data(0);
1272 printf("Per-CPU call_rcu() worker threads unavailable. Using default global worker thread.\n");
1275 rcu_register_thread();
1278 ret
= do_sanity_test();
1283 /* Wait for in-flight call_rcu free to complete for leak detection */
1286 ret
|= check_memory_leaks();
1288 rcu_unregister_thread();
1289 free_all_cpu_call_rcu_data();
1292 printf("Test ended with error: %d\n", ret
);