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"
25 #include "../common/debug-yield.h"
29 DEFINE_URCU_TLS(unsigned int, rand_lookup
);
30 DEFINE_URCU_TLS(unsigned long, nr_add
);
31 DEFINE_URCU_TLS(unsigned long, nr_addexist
);
32 DEFINE_URCU_TLS(unsigned long, nr_del
);
33 DEFINE_URCU_TLS(unsigned long, nr_delnoent
);
34 DEFINE_URCU_TLS(unsigned long, lookup_fail
);
35 DEFINE_URCU_TLS(unsigned long, lookup_ok
);
37 struct cds_ja
*test_ja
;
39 volatile int test_go
, test_stop
;
43 unsigned long duration
;
45 /* read-side C.S. duration, in loops */
46 unsigned long rduration
;
48 unsigned long init_populate
;
51 unsigned long init_pool_offset
, lookup_pool_offset
, write_pool_offset
;
52 unsigned long init_pool_size
= DEFAULT_RAND_POOL
,
53 lookup_pool_size
= DEFAULT_RAND_POOL
,
54 write_pool_size
= DEFAULT_RAND_POOL
;
57 unsigned int key_bits
= 32;
63 unsigned int cpu_affinities
[NR_CPUS
];
64 unsigned int next_aff
= 0;
67 pthread_mutex_t affinity_mutex
= PTHREAD_MUTEX_INITIALIZER
;
69 DEFINE_URCU_TLS(unsigned long long, nr_writes
);
70 DEFINE_URCU_TLS(unsigned long long, nr_reads
);
72 unsigned int nr_readers
;
73 unsigned int nr_writers
;
75 static unsigned int add_ratio
= 50;
76 static uint64_t key_mul
= 1ULL;
78 static int add_unique
, add_replace
;
80 static pthread_mutex_t rcu_copy_mutex
= PTHREAD_MUTEX_INITIALIZER
;
82 static int leak_detection
;
83 static unsigned long test_nodes_allocated
, test_nodes_freed
;
85 void set_affinity(void)
94 #if HAVE_SCHED_SETAFFINITY
95 ret
= pthread_mutex_lock(&affinity_mutex
);
97 perror("Error in pthread mutex lock");
100 cpu
= cpu_affinities
[next_aff
++];
101 ret
= pthread_mutex_unlock(&affinity_mutex
);
103 perror("Error in pthread mutex unlock");
108 #if SCHED_SETAFFINITY_ARGS == 2
109 sched_setaffinity(0, &mask
);
111 sched_setaffinity(0, sizeof(mask
), &mask
);
113 #endif /* HAVE_SCHED_SETAFFINITY */
116 void rcu_copy_mutex_lock(void)
119 ret
= pthread_mutex_lock(&rcu_copy_mutex
);
121 perror("Error in pthread mutex lock");
126 void rcu_copy_mutex_unlock(void)
130 ret
= pthread_mutex_unlock(&rcu_copy_mutex
);
132 perror("Error in pthread mutex unlock");
138 struct ja_test_node
*node_alloc(void)
140 struct ja_test_node
*node
;
142 node
= calloc(sizeof(*node
), 1);
143 if (leak_detection
&& node
)
144 uatomic_inc(&test_nodes_allocated
);
149 void free_test_node(struct ja_test_node
*node
)
153 uatomic_inc(&test_nodes_freed
);
157 void free_test_node_cb(struct rcu_head
*head
)
159 struct ja_test_node
*node
=
160 caa_container_of(head
, struct ja_test_node
, head
);
161 free_test_node(node
);
165 void rcu_free_test_node(struct ja_test_node
*test_node
)
167 call_rcu(&test_node
->head
, free_test_node_cb
);
171 void free_node(struct cds_ja_node
*node
)
173 struct ja_test_node
*test_node
= to_test_node(node
);
175 free_test_node(test_node
);
180 void test_delete_all_nodes(struct cds_lfht
*ht
)
182 struct cds_lfht_iter iter
;
183 struct lfht_test_node
*node
;
184 unsigned long count
= 0;
186 cds_lfht_for_each_entry(ht
, &iter
, node
, node
) {
189 ret
= cds_lfht_del(test_ht
, cds_lfht_iter_get_node(&iter
));
191 call_rcu(&node
->head
, free_node_cb
);
194 printf("deleted %lu nodes.\n", count
);
198 void show_usage(int argc
, char **argv
)
200 printf("Usage : %s nr_readers nr_writers duration (s)\n", argv
[0]);
202 printf(" [-r] [-w] (yield reader and/or writer)\n");
204 printf(" [-d delay] (writer period (us))\n");
205 printf(" [-c duration] (reader C.S. duration (in loops))\n");
206 printf(" [-v] (verbose output)\n");
207 printf(" [-a cpu#] [-a cpu#]... (affinity)\n");
208 printf(" [-u] Add unique keys.\n");
209 printf(" [-s] Replace existing keys.\n");
210 printf(" [not -u nor -s] Add entries (supports redundant keys).\n");
211 printf(" [-r ratio] Add ratio (in %% of add+removal).\n");
212 printf(" [-k] Populate init nodes.\n");
213 printf(" [-R offset] Lookup pool offset.\n");
214 printf(" [-S offset] Write pool offset.\n");
215 printf(" [-T offset] Init pool offset.\n");
216 printf(" [-M size] Lookup pool size.\n");
217 printf(" [-N size] Write pool size.\n");
218 printf(" [-O size] Init pool size.\n");
219 printf(" [-V] Validate lookups of init values (use with filled init pool, same lookup range, with different write range).\n");
220 printf(" [-t] Do sanity test.\n");
221 printf(" [-B] Key bits for multithread test (default: 32).\n");
222 printf(" [-m factor] Key multiplication factor.\n");
223 printf(" [-l] Memory leak detection.\n");
228 int test_free_all_nodes(struct cds_ja
*ja
)
231 struct cds_ja_node
*ja_node
;
235 cds_ja_for_each_key_rcu(test_ja
, key
, ja_node
) {
236 struct cds_ja_node
*tmp_node
;
238 cds_ja_for_each_duplicate_safe_rcu(ja_node
, tmp_node
) {
239 ret
= cds_ja_del(test_ja
, key
, ja_node
);
241 fprintf(stderr
, "Error (%d) removing node %" PRIu64
"\n", ret
, key
);
244 /* Alone using Judy array, OK to free now */
254 int test_8bit_key(void)
258 uint64_t ka
[] = { 5, 17, 100, 222 };
259 uint64_t ka_test_offset
= 5;
260 struct cds_ja_node
*ja_node
;
262 /* Test with 8-bit key */
263 test_ja
= cds_ja_new(8);
265 printf("Error allocating judy array.\n");
270 printf("Test #1: add keys (8-bit).\n");
271 for (key
= 0; key
< 200; key
++) {
272 struct ja_test_node
*node
= node_alloc();
274 ja_test_node_init(node
, key
);
276 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
279 fprintf(stderr
, "Error (%d) adding node %" PRIu64
"\n",
286 printf("Test #2: successful key lookup (8-bit).\n");
287 for (key
= 0; key
< 200; key
++) {
289 ja_node
= cds_ja_lookup(test_ja
, key
);
291 fprintf(stderr
, "Error lookup node %" PRIu64
"\n", key
);
297 printf("Test #3: unsuccessful key lookup (8-bit).\n");
298 for (key
= 200; key
< 240; key
++) {
300 ja_node
= cds_ja_lookup(test_ja
, key
);
303 "Error unexpected lookup node %" PRIu64
"\n",
310 printf("Test #4: remove keys (8-bit).\n");
311 for (key
= 0; key
< 200; key
++) {
312 struct ja_test_node
*node
;
315 ja_node
= cds_ja_lookup(test_ja
, key
);
317 fprintf(stderr
, "Error lookup node %" PRIu64
"\n", key
);
320 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
321 ret
= cds_ja_del(test_ja
, key
, &node
->node
);
323 fprintf(stderr
, "Error (%d) removing node %" PRIu64
"\n", ret
, key
);
326 rcu_free_test_node(node
);
327 ja_node
= cds_ja_lookup(test_ja
, key
);
329 fprintf(stderr
, "Error lookup %" PRIu64
": %p (after delete) failed. Node is not expected.\n", key
, ja_node
);
336 printf("Test #5: lookup below/above equal (8-bit).\n");
338 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
339 struct ja_test_node
*node
= node_alloc();
342 ja_test_node_init(node
, key
);
344 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
347 fprintf(stderr
, "Error (%d) adding node %" PRIu64
"\n",
353 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
354 struct ja_test_node
*node
;
357 key
= ka
[i
] + ka_test_offset
;
359 ja_node
= cds_ja_lookup_below_equal(test_ja
, key
, &result_key
);
361 fprintf(stderr
, "Error lookup below 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 below 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 ja_test_node
*node
;
378 key
= ka
[i
] - ka_test_offset
;
380 ja_node
= cds_ja_lookup_above_equal(test_ja
, key
, &result_key
);
382 fprintf(stderr
, "Error lookup above equal. Cannot find expected key %" PRIu64
" below or equal to %" PRIu64
".\n",
386 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
387 if (node
->key
!= ka
[i
] || result_key
!= ka
[i
]) {
388 fprintf(stderr
, "Error lookup above equal. Expecting key %" PRIu64
" below or equal to %" PRIu64
", but found %" PRIu64
"/%" PRIu64
" instead.\n",
389 ka
[i
], key
, node
->key
, result_key
);
395 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
396 struct ja_test_node
*node
;
399 key
= ka
[i
]; /* without offset */
401 ja_node
= cds_ja_lookup_below_equal(test_ja
, key
, &result_key
);
403 fprintf(stderr
, "Error lookup below equal. Cannot find expected key %" PRIu64
" below or equal to %" PRIu64
".\n",
407 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
408 if (node
->key
!= ka
[i
] || result_key
!= ka
[i
]) {
409 fprintf(stderr
, "Error lookup below equal. Expecting key %" PRIu64
" below or equal to %" PRIu64
", but found %" PRIu64
"/%" PRIu64
" instead.\n",
410 ka
[i
], key
, node
->key
, result_key
);
414 ja_node
= cds_ja_lookup_above_equal(test_ja
, key
, &result_key
);
416 fprintf(stderr
, "Error lookup above equal. Cannot find expected key %" PRIu64
" below or equal to %" PRIu64
".\n",
420 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
421 if (node
->key
!= ka
[i
] || result_key
!= ka
[i
]) {
422 fprintf(stderr
, "Error lookup above equal. Expecting key %" PRIu64
" below or equal to %" PRIu64
", but found %" PRIu64
"/%" PRIu64
" instead.\n",
423 ka
[i
], key
, node
->key
, result_key
);
431 ret
= test_free_all_nodes(test_ja
);
433 fprintf(stderr
, "Error freeing all nodes\n");
437 ret
= cds_ja_destroy(test_ja
);
439 fprintf(stderr
, "Error destroying judy array\n");
446 int test_16bit_key(void)
450 uint64_t ka
[] = { 105, 206, 4000, 4111, 59990, 65435 };
451 uint64_t ka_test_offset
= 100;
452 struct cds_ja_node
*ja_node
;
454 /* Test with 16-bit key */
455 test_ja
= cds_ja_new(16);
457 printf("Error allocating judy array.\n");
462 printf("Test #1: add keys (16-bit).\n");
463 for (key
= 0; key
< 10000; key
++) {
464 //for (key = 0; key < 65536; key+=256) {
465 struct ja_test_node
*node
= node_alloc();
467 ja_test_node_init(node
, key
);
469 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
472 fprintf(stderr
, "Error (%d) adding node %" PRIu64
"\n",
479 printf("Test #2: successful key lookup (16-bit).\n");
480 for (key
= 0; key
< 10000; key
++) {
481 //for (key = 0; key < 65536; key+=256) {
482 struct cds_ja_node
*ja_node
;
485 ja_node
= cds_ja_lookup(test_ja
, key
);
487 fprintf(stderr
, "Error lookup node %" PRIu64
"\n", key
);
493 printf("Test #3: unsuccessful key lookup (16-bit).\n");
494 for (key
= 11000; key
<= 11002; key
++) {
495 struct cds_ja_node
*ja_node
;
498 ja_node
= cds_ja_lookup(test_ja
, key
);
501 "Error unexpected lookup node %" PRIu64
"\n",
508 printf("Test #4: remove keys (16-bit).\n");
509 for (key
= 0; key
< 10000; key
++) {
510 //for (key = 0; key < 65536; key+=256) {
511 struct ja_test_node
*node
;
514 ja_node
= cds_ja_lookup(test_ja
, key
);
516 fprintf(stderr
, "Error lookup node %" PRIu64
"\n", key
);
519 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
520 ret
= cds_ja_del(test_ja
, key
, &node
->node
);
522 fprintf(stderr
, "Error (%d) removing node %" PRIu64
"\n", ret
, key
);
525 rcu_free_test_node(node
);
526 ja_node
= cds_ja_lookup(test_ja
, key
);
528 fprintf(stderr
, "Error lookup %" PRIu64
": %p (after delete) failed. Node is not expected.\n", key
, ja_node
);
535 printf("Test #5: lookup below/above equal (16-bit).\n");
537 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
538 struct ja_test_node
*node
= node_alloc();
541 ja_test_node_init(node
, key
);
543 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
546 fprintf(stderr
, "Error (%d) adding node %" PRIu64
"\n",
552 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
553 struct ja_test_node
*node
;
556 key
= ka
[i
] + ka_test_offset
;
558 ja_node
= cds_ja_lookup_below_equal(test_ja
, key
, &result_key
);
560 fprintf(stderr
, "Error lookup below equal. Cannot find expected key %" PRIu64
" below or equal to %" PRIu64
".\n",
564 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
565 if (node
->key
!= ka
[i
] || result_key
!= ka
[i
]) {
566 fprintf(stderr
, "Error lookup below equal. Expecting key %" PRIu64
" below or equal to %" PRIu64
", but found %" PRIu64
"/%" PRIu64
" instead.\n",
567 ka
[i
], key
, node
->key
, result_key
);
573 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
574 struct ja_test_node
*node
;
577 key
= ka
[i
] - ka_test_offset
;
579 ja_node
= cds_ja_lookup_above_equal(test_ja
, key
, &result_key
);
581 fprintf(stderr
, "Error lookup above equal. Cannot find expected key %" PRIu64
" above or equal to %" PRIu64
".\n",
585 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
586 if (node
->key
!= ka
[i
] || result_key
!= ka
[i
]) {
587 fprintf(stderr
, "Error lookup above equal. Expecting key %" PRIu64
" above or equal to %" PRIu64
", but found %" PRIu64
"/%" PRIu64
" instead.\n",
588 ka
[i
], key
, node
->key
, result_key
);
594 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
595 struct ja_test_node
*node
;
598 key
= ka
[i
]; /* without offset */
600 ja_node
= cds_ja_lookup_below_equal(test_ja
, key
, &result_key
);
602 fprintf(stderr
, "Error lookup below equal. Cannot find expected key %" PRIu64
" below or equal to %" PRIu64
".\n",
606 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
607 if (node
->key
!= ka
[i
] || result_key
!= ka
[i
]) {
608 fprintf(stderr
, "Error lookup below equal. Expecting key %" PRIu64
" below or equal to %" PRIu64
", but found %" PRIu64
"/%" PRIu64
" instead.\n",
609 ka
[i
], key
, node
->key
, result_key
);
613 ja_node
= cds_ja_lookup_above_equal(test_ja
, key
, &result_key
);
615 fprintf(stderr
, "Error lookup above equal. Cannot find expected key %" PRIu64
" above or equal to %" PRIu64
".\n",
619 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
620 if (node
->key
!= ka
[i
] || result_key
!= ka
[i
]) {
621 fprintf(stderr
, "Error lookup above equal. Expecting key %" PRIu64
" above or equal to %" PRIu64
", but found %" PRIu64
"/%" PRIu64
" instead.\n",
622 ka
[i
], key
, node
->key
, result_key
);
630 ret
= test_free_all_nodes(test_ja
);
632 fprintf(stderr
, "Error freeing all nodes\n");
636 ret
= cds_ja_destroy(test_ja
);
638 fprintf(stderr
, "Error destroying judy array\n");
645 * nr_dup is number of nodes per key.
648 int test_sparse_key(unsigned int bits
, int nr_dup
)
650 uint64_t key
, max_key
;
651 int zerocount
, i
, ret
;
652 struct cds_ja_node
*ja_node
;
655 max_key
= UINT64_MAX
;
657 max_key
= (1ULL << bits
) - 1;
659 printf("Sparse key test begins for %u-bit keys\n", bits
);
660 /* Test with 16-bit key */
661 test_ja
= cds_ja_new(bits
);
663 printf("Error allocating judy array.\n");
668 printf("Test #1: add keys (%u-bit).\n", bits
);
669 for (i
= 0; i
< nr_dup
; i
++) {
671 for (key
= 0; key
<= max_key
&& (key
!= 0 || zerocount
< 1); key
+= 1ULL << (bits
- 8)) {
672 struct ja_test_node
*node
= node_alloc();
674 ja_test_node_init(node
, key
);
676 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
679 fprintf(stderr
, "Error (%d) adding node %" PRIu64
"\n",
689 printf("Test #2: successful key lookup (%u-bit).\n", bits
);
691 for (key
= 0; key
<= max_key
&& (key
!= 0 || zerocount
< 1); key
+= 1ULL << (bits
- 8)) {
692 struct ja_test_node
*node
;
696 ja_node
= cds_ja_lookup(test_ja
, key
);
698 fprintf(stderr
, "Error lookup node %" PRIu64
"\n", key
);
701 cds_ja_for_each_duplicate_rcu(ja_node
) {
704 if (count
!= nr_dup
) {
705 fprintf(stderr
, "Unexpected number of match for key %" PRIu64
", expected %d, got %d.\n", key
, nr_dup
, count
);
713 printf("Test #3: unsuccessful key lookup (%u-bit).\n", bits
);
715 for (key
= 0; key
<= max_key
&& (key
!= 0 || zerocount
< 1); key
+= 1ULL << (bits
- 8)) {
717 ja_node
= cds_ja_lookup(test_ja
, key
+ 42);
720 "Error unexpected lookup node %" PRIu64
"\n",
730 printf("Test #4: remove keys (%u-bit).\n", bits
);
732 for (key
= 0; key
<= max_key
&& (key
!= 0 || zerocount
< 1); key
+= 1ULL << (bits
- 8)) {
736 ja_node
= cds_ja_lookup(test_ja
, key
);
738 cds_ja_for_each_duplicate_rcu(ja_node
) {
739 struct cds_ja_node
*test_ja_node
;
740 struct ja_test_node
*node
;
743 node
= caa_container_of(ja_node
,
744 struct ja_test_node
, node
);
745 ret
= cds_ja_del(test_ja
, key
, &node
->node
);
747 fprintf(stderr
, "Error (%d) removing node %" PRIu64
"\n", ret
, key
);
750 rcu_free_test_node(node
);
751 test_ja_node
= cds_ja_lookup(test_ja
, key
);
752 if (count
< nr_dup
&& !test_ja_node
) {
753 fprintf(stderr
, "Error: no node found after deletion of some nodes of a key\n");
757 ja_node
= cds_ja_lookup(test_ja
, key
);
759 fprintf(stderr
, "Error lookup %" PRIu64
": %p (after delete) failed. Node is not expected.\n", key
, ja_node
);
768 ret
= test_free_all_nodes(test_ja
);
770 fprintf(stderr
, "Error freeing all nodes\n");
774 ret
= cds_ja_destroy(test_ja
);
776 fprintf(stderr
, "Error destroying judy array\n");
779 printf("Test ends\n");
785 int do_sanity_test(void)
789 printf("Sanity test start.\n");
791 for (i
= 0; i
< 3; i
++) {
792 ret
= test_8bit_key();
796 rcu_quiescent_state();
798 ret
= test_16bit_key();
802 rcu_quiescent_state();
805 for (i
= 8; i
<= 64; i
*= 2) {
806 /* nr of nodes per key */
807 for (j
= 1; j
< 4; j
++) {
808 ret
= test_sparse_key(i
, j
);
812 rcu_quiescent_state();
815 printf("Sanity test end.\n");
820 enum urcu_ja_addremove
{
824 }; /* 1: add, -1 remove, 0: random */
826 static enum urcu_ja_addremove addremove
; /* 1: add, -1 remove, 0: random */
829 void test_ja_rw_sigusr1_handler(int signo
)
833 printf("Add/Remove: random.\n");
834 addremove
= AR_RANDOM
;
837 printf("Add/Remove: remove only.\n");
838 addremove
= AR_REMOVE
;
841 printf("Add/Remove: add only.\n");
848 void *test_ja_rw_thr_reader(void *_count
)
850 unsigned long long *count
= _count
;
851 struct cds_ja_node
*ja_node
;
854 printf_verbose("thread_begin %s, tid %lu\n",
855 "reader", urcu_get_thread_id());
857 URCU_TLS(rand_lookup
) = urcu_get_thread_id() ^ time(NULL
);
861 rcu_register_thread();
871 /* note: only looking up ulong keys */
872 key
= ((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % lookup_pool_size
) + lookup_pool_offset
;
874 ja_node
= cds_ja_lookup(test_ja
, key
);
876 if (validate_lookup
) {
877 printf("[ERROR] Lookup cannot find initial node.\n");
880 URCU_TLS(lookup_fail
)++;
882 URCU_TLS(lookup_ok
)++;
884 rcu_debug_yield_read();
885 if (caa_unlikely(rduration
))
886 loop_sleep(rduration
);
888 URCU_TLS(nr_reads
)++;
889 if (caa_unlikely(!test_duration_read()))
891 if (caa_unlikely((URCU_TLS(nr_reads
) & ((1 << 10) - 1)) == 0))
892 rcu_quiescent_state();
895 rcu_unregister_thread();
897 *count
= URCU_TLS(nr_reads
);
898 printf_verbose("thread_end %s, tid %lu\n",
899 "reader", urcu_get_thread_id());
900 printf_verbose("readid : %lx, lookupfail %lu, lookupok %lu\n",
901 pthread_self(), URCU_TLS(lookup_fail
),
902 URCU_TLS(lookup_ok
));
909 return ((unsigned int) rand_r(&URCU_TLS(rand_lookup
)) % 100) < add_ratio
;
913 void *test_ja_rw_thr_writer(void *_count
)
915 struct wr_count
*count
= _count
;
919 printf_verbose("thread_begin %s, tid %lu\n",
920 "writer", urcu_get_thread_id());
922 URCU_TLS(rand_lookup
) = urcu_get_thread_id() ^ time(NULL
);
926 rcu_register_thread();
934 if ((addremove
== AR_ADD
)
935 || (addremove
== AR_RANDOM
&& is_add())) {
936 struct ja_test_node
*node
= node_alloc();
937 struct cds_ja_node
*ret_node
;
939 /* note: only inserting ulong keys */
940 key
= ((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % write_pool_size
) + write_pool_offset
;
942 ja_test_node_init(node
, key
);
945 ret_node
= cds_ja_add_unique(test_ja
, key
, &node
->node
);
946 if (ret_node
!= &node
->node
) {
947 free_test_node(node
);
948 URCU_TLS(nr_addexist
)++;
952 } else if (add_replace
) {
953 assert(0); /* not implemented yet. */
955 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
957 fprintf(stderr
, "Error in cds_ja_add: %d\n", ret
);
958 free_test_node(node
);
965 struct cds_ja_node
*ja_node
;
966 struct ja_test_node
*node
;
969 /* note: only deleting ulong keys */
970 key
= ((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % write_pool_size
) + write_pool_offset
;
975 ja_node
= cds_ja_lookup(test_ja
, key
);
976 /* Remove first entry */
978 node
= caa_container_of(ja_node
,
979 struct ja_test_node
, node
);
980 ret
= cds_ja_del(test_ja
, key
, &node
->node
);
982 rcu_free_test_node(node
);
985 URCU_TLS(nr_delnoent
)++;
988 URCU_TLS(nr_delnoent
)++;
993 URCU_TLS(nr_writes
)++;
994 if (caa_unlikely(!test_duration_write()))
996 if (caa_unlikely(wdelay
))
998 if (caa_unlikely((URCU_TLS(nr_writes
) & ((1 << 10) - 1)) == 0))
999 rcu_quiescent_state();
1002 rcu_unregister_thread();
1004 printf_verbose("thread_end %s, tid %lu\n",
1005 "writer", urcu_get_thread_id());
1006 printf_verbose("info id %lx: nr_add %lu, nr_addexist %lu, nr_del %lu, "
1007 "nr_delnoent %lu\n", pthread_self(), URCU_TLS(nr_add
),
1008 URCU_TLS(nr_addexist
), URCU_TLS(nr_del
),
1009 URCU_TLS(nr_delnoent
));
1010 count
->update_ops
= URCU_TLS(nr_writes
);
1011 count
->add
= URCU_TLS(nr_add
);
1012 count
->add_exist
= URCU_TLS(nr_addexist
);
1013 count
->remove
= URCU_TLS(nr_del
);
1018 int do_mt_populate_ja(void)
1026 printf("Starting rw test\n");
1028 for (iter
= init_pool_offset
; iter
< init_pool_offset
+ init_pool_size
; iter
++) {
1029 struct ja_test_node
*node
= node_alloc();
1032 /* note: only inserting ulong keys */
1033 key
= (unsigned long) iter
;
1035 ja_test_node_init(node
, key
);
1037 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
1039 URCU_TLS(nr_writes
)++;
1041 /* Hash table resize only occurs in call_rcu thread */
1043 rcu_quiescent_state();
1045 fprintf(stderr
, "Error (%d) adding node %" PRIu64
"\n",
1054 int do_mt_test(void)
1056 pthread_t
*tid_reader
, *tid_writer
;
1059 unsigned long long *count_reader
;
1060 struct wr_count
*count_writer
;
1061 unsigned long long tot_reads
= 0, tot_writes
= 0,
1062 tot_add
= 0, tot_add_exist
= 0, tot_remove
= 0;
1063 unsigned int remain
;
1065 tid_reader
= malloc(sizeof(*tid_reader
) * nr_readers
);
1066 tid_writer
= malloc(sizeof(*tid_writer
) * nr_writers
);
1067 count_reader
= malloc(sizeof(*count_reader
) * nr_readers
);
1068 count_writer
= malloc(sizeof(*count_writer
) * nr_writers
);
1070 printf("Allocating Judy Array for %u-bit keys\n", key_bits
);
1071 test_ja
= cds_ja_new(key_bits
);
1073 printf("Error allocating judy array.\n");
1078 do_mt_populate_ja();
1082 for (i
= 0; i
< nr_readers
; i
++) {
1083 err
= pthread_create(&tid_reader
[i
],
1084 NULL
, test_ja_rw_thr_reader
,
1089 for (i
= 0; i
< nr_writers
; i
++) {
1090 err
= pthread_create(&tid_writer
[i
],
1091 NULL
, test_ja_rw_thr_writer
,
1101 rcu_thread_offline_qsbr();
1105 remain
= sleep(remain
);
1106 } while (remain
> 0);
1110 for (i
= 0; i
< nr_readers
; i
++) {
1111 err
= pthread_join(tid_reader
[i
], &tret
);
1114 tot_reads
+= count_reader
[i
];
1116 for (i
= 0; i
< nr_writers
; i
++) {
1117 err
= pthread_join(tid_writer
[i
], &tret
);
1120 tot_writes
+= count_writer
[i
].update_ops
;
1121 tot_add
+= count_writer
[i
].add
;
1122 tot_add_exist
+= count_writer
[i
].add_exist
;
1123 tot_remove
+= count_writer
[i
].remove
;
1125 rcu_thread_online_qsbr();
1127 ret
= test_free_all_nodes(test_ja
);
1129 fprintf(stderr
, "Error freeing all nodes\n");
1133 ret
= cds_ja_destroy(test_ja
);
1135 fprintf(stderr
, "Error destroying judy array\n");
1149 int check_memory_leaks(void)
1151 unsigned long na
, nf
;
1153 na
= uatomic_read(&test_nodes_allocated
);
1154 nf
= uatomic_read(&test_nodes_freed
);
1156 fprintf(stderr
, "Memory leak of %ld test nodes detected. Allocated: %lu, freed: %lu\n",
1163 int main(int argc
, char **argv
)
1165 int i
, j
, a
, ret
, err
;
1167 struct sigaction act
;
1170 show_usage(argc
, argv
);
1174 err
= sscanf(argv
[1], "%u", &nr_readers
);
1176 show_usage(argc
, argv
);
1180 err
= sscanf(argv
[2], "%u", &nr_writers
);
1182 show_usage(argc
, argv
);
1186 err
= sscanf(argv
[3], "%lu", &duration
);
1188 show_usage(argc
, argv
);
1192 for (i
= 4; i
< argc
; i
++) {
1193 if (argv
[i
][0] != '-')
1195 switch (argv
[i
][1]) {
1198 yield_active
|= YIELD_READ
;
1201 yield_active
|= YIELD_WRITE
;
1206 show_usage(argc
, argv
);
1209 a
= atoi(argv
[++i
]);
1210 cpu_affinities
[next_aff
++] = a
;
1212 printf_verbose("Adding CPU %d affinity\n", a
);
1216 show_usage(argc
, argv
);
1219 rduration
= atol(argv
[++i
]);
1223 show_usage(argc
, argv
);
1226 wdelay
= atol(argv
[++i
]);
1232 add_ratio
= atoi(argv
[++i
]);
1238 lookup_pool_offset
= atol(argv
[++i
]);
1241 write_pool_offset
= atol(argv
[++i
]);
1244 init_pool_offset
= atol(argv
[++i
]);
1247 lookup_pool_size
= atol(argv
[++i
]);
1250 write_pool_size
= atol(argv
[++i
]);
1253 init_pool_size
= atol(argv
[++i
]);
1256 validate_lookup
= 1;
1262 key_bits
= atol(argv
[++i
]);
1265 key_mul
= atoll(argv
[++i
]);
1279 printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
1280 duration
, nr_readers
, nr_writers
);
1281 printf_verbose("Writer delay : %lu loops.\n", wdelay
);
1282 printf_verbose("Reader duration : %lu loops.\n", rduration
);
1283 printf_verbose("Add ratio: %u%%.\n", add_ratio
);
1284 printf_verbose("Mode:%s%s.\n",
1286 add_unique
? " uniquify" : ( add_replace
? " replace" : " insert"));
1287 printf_verbose("Key multiplication factor: %" PRIu64
".\n", key_mul
);
1288 printf_verbose("Init pool size offset %lu size %lu.\n",
1289 init_pool_offset
, init_pool_size
);
1290 printf_verbose("Lookup pool size offset %lu size %lu.\n",
1291 lookup_pool_offset
, lookup_pool_size
);
1292 printf_verbose("Update pool size offset %lu size %lu.\n",
1293 write_pool_offset
, write_pool_size
);
1294 if (validate_lookup
)
1295 printf_verbose("Validating lookups.\n");
1297 printf_verbose("Memory leak dection activated.\n");
1298 printf_verbose("thread %-6s, tid %lu\n",
1299 "main", urcu_get_thread_id());
1301 memset(&act
, 0, sizeof(act
));
1302 ret
= sigemptyset(&act
.sa_mask
);
1304 perror("sigemptyset");
1307 act
.sa_handler
= test_ja_rw_sigusr1_handler
;
1308 act
.sa_flags
= SA_RESTART
;
1309 ret
= sigaction(SIGUSR1
, &act
, NULL
);
1311 perror("sigaction");
1315 err
= create_all_cpu_call_rcu_data(0);
1317 printf("Per-CPU call_rcu() worker threads unavailable. Using default global worker thread.\n");
1320 rcu_register_thread();
1323 ret
= do_sanity_test();
1328 /* Wait for in-flight call_rcu free to complete for leak detection */
1331 ret
|= check_memory_leaks();
1333 rcu_unregister_thread();
1334 free_all_cpu_call_rcu_data();
1337 printf("Test ended with error: %d\n", ret
);