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
;
334 key
= ka
[i
] + ka_test_offset
;
336 ja_node
= cds_ja_lookup_below_equal(test_ja
, key
);
338 fprintf(stderr
, "Error lookup below equal. Cannot find expected key %" PRIu64
" below or equal to %" PRIu64
".\n",
342 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
343 if (node
->key
!= ka
[i
]) {
344 fprintf(stderr
, "Error lookup below equal. Expecting key %" PRIu64
" below or equal to %" PRIu64
", but found %" PRIu64
" instead.\n",
345 ka
[i
], key
, node
->key
);
351 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
352 struct cds_ja_node
*ja_node
;
353 struct ja_test_node
*node
;
355 key
= ka
[i
] - ka_test_offset
;
357 ja_node
= cds_ja_lookup_above_equal(test_ja
, key
);
359 fprintf(stderr
, "Error lookup above equal. Cannot find expected key %" PRIu64
" below or equal to %" PRIu64
".\n",
363 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
364 if (node
->key
!= ka
[i
]) {
365 fprintf(stderr
, "Error lookup above equal. Expecting key %" PRIu64
" below or equal to %" PRIu64
", but found %" PRIu64
" instead.\n",
366 ka
[i
], key
, node
->key
);
372 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
373 struct cds_ja_node
*ja_node
;
374 struct ja_test_node
*node
;
376 key
= ka
[i
]; /* without offset */
378 ja_node
= cds_ja_lookup_below_equal(test_ja
, key
);
380 fprintf(stderr
, "Error lookup below equal. Cannot find expected key %" PRIu64
" below or equal to %" PRIu64
".\n",
384 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
385 if (node
->key
!= ka
[i
]) {
386 fprintf(stderr
, "Error lookup below equal. Expecting key %" PRIu64
" below or equal to %" PRIu64
", but found %" PRIu64
" instead.\n",
387 ka
[i
], key
, node
->key
);
391 ja_node
= cds_ja_lookup_above_equal(test_ja
, key
);
393 fprintf(stderr
, "Error lookup above equal. Cannot find expected key %" PRIu64
" below or equal to %" PRIu64
".\n",
397 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
398 if (node
->key
!= ka
[i
]) {
399 fprintf(stderr
, "Error lookup above equal. Expecting key %" PRIu64
" below or equal to %" PRIu64
", but found %" PRIu64
" instead.\n",
400 ka
[i
], key
, node
->key
);
408 ret
= cds_ja_destroy(test_ja
, free_node
);
410 fprintf(stderr
, "Error destroying judy array\n");
417 int test_16bit_key(void)
421 uint64_t ka
[] = { 105, 206, 4000, 4111, 59990, 65435 };
422 uint64_t ka_test_offset
= 100;
424 /* Test with 16-bit key */
425 test_ja
= cds_ja_new(16);
427 printf("Error allocating judy array.\n");
432 printf("Test #1: add keys (16-bit).\n");
433 for (key
= 0; key
< 10000; key
++) {
434 //for (key = 0; key < 65536; key+=256) {
435 struct ja_test_node
*node
= node_alloc();
437 ja_test_node_init(node
, key
);
439 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
442 fprintf(stderr
, "Error (%d) adding node %" PRIu64
"\n",
449 printf("Test #2: successful key lookup (16-bit).\n");
450 for (key
= 0; key
< 10000; key
++) {
451 //for (key = 0; key < 65536; key+=256) {
452 struct cds_ja_node
*node
;
455 node
= cds_ja_lookup(test_ja
, key
);
457 fprintf(stderr
, "Error lookup node %" PRIu64
"\n", key
);
463 printf("Test #3: unsuccessful key lookup (16-bit).\n");
464 for (key
= 11000; key
<= 11002; key
++) {
465 struct cds_ja_node
*node
;
468 node
= cds_ja_lookup(test_ja
, key
);
471 "Error unexpected lookup node %" PRIu64
"\n",
478 printf("Test #4: remove keys (16-bit).\n");
479 for (key
= 0; key
< 10000; key
++) {
480 //for (key = 0; key < 65536; key+=256) {
481 struct cds_ja_node
*ja_node
;
482 struct ja_test_node
*node
;
485 ja_node
= cds_ja_lookup(test_ja
, key
);
487 fprintf(stderr
, "Error lookup node %" PRIu64
"\n", key
);
490 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
491 ret
= cds_ja_del(test_ja
, key
, &node
->node
);
493 fprintf(stderr
, "Error (%d) removing node %" PRIu64
"\n", ret
, key
);
496 rcu_free_test_node(node
);
497 ja_node
= cds_ja_lookup(test_ja
, key
);
499 fprintf(stderr
, "Error lookup %" PRIu64
": %p (after delete) failed. Node is not expected.\n", key
, ja_node
);
506 printf("Test #5: lookup below equal (16-bit).\n");
508 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
509 struct ja_test_node
*node
= node_alloc();
512 ja_test_node_init(node
, key
);
514 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
517 fprintf(stderr
, "Error (%d) adding node %" PRIu64
"\n",
523 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
524 struct cds_ja_node
*ja_node
;
525 struct ja_test_node
*node
;
527 key
= ka
[i
] + ka_test_offset
;
529 ja_node
= cds_ja_lookup_below_equal(test_ja
, key
);
531 fprintf(stderr
, "Error lookup below equal. Cannot find expected key %" PRIu64
" below or equal to %" PRIu64
".\n",
535 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
536 if (node
->key
!= ka
[i
]) {
537 fprintf(stderr
, "Error lookup below equal. Expecting key %" PRIu64
" below or equal to %" PRIu64
", but found %" PRIu64
" instead.\n",
538 ka
[i
], key
, node
->key
);
544 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
545 struct cds_ja_node
*ja_node
;
546 struct ja_test_node
*node
;
548 key
= ka
[i
] - ka_test_offset
;
550 ja_node
= cds_ja_lookup_above_equal(test_ja
, key
);
552 fprintf(stderr
, "Error lookup above equal. Cannot find expected key %" PRIu64
" above or equal to %" PRIu64
".\n",
556 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
557 if (node
->key
!= ka
[i
]) {
558 fprintf(stderr
, "Error lookup above equal. Expecting key %" PRIu64
" above or equal to %" PRIu64
", but found %" PRIu64
" instead.\n",
559 ka
[i
], key
, node
->key
);
565 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
566 struct cds_ja_node
*ja_node
;
567 struct ja_test_node
*node
;
569 key
= ka
[i
]; /* without offset */
571 ja_node
= cds_ja_lookup_below_equal(test_ja
, key
);
573 fprintf(stderr
, "Error lookup below equal. Cannot find expected key %" PRIu64
" below or equal to %" PRIu64
".\n",
577 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
578 if (node
->key
!= ka
[i
]) {
579 fprintf(stderr
, "Error lookup below equal. Expecting key %" PRIu64
" below or equal to %" PRIu64
", but found %" PRIu64
" instead.\n",
580 ka
[i
], key
, node
->key
);
584 ja_node
= cds_ja_lookup_above_equal(test_ja
, key
);
586 fprintf(stderr
, "Error lookup above equal. Cannot find expected key %" PRIu64
" above or equal to %" PRIu64
".\n",
590 node
= caa_container_of(ja_node
, struct ja_test_node
, node
);
591 if (node
->key
!= ka
[i
]) {
592 fprintf(stderr
, "Error lookup above equal. Expecting key %" PRIu64
" above or equal to %" PRIu64
", but found %" PRIu64
" instead.\n",
593 ka
[i
], key
, node
->key
);
601 ret
= cds_ja_destroy(test_ja
, free_node
);
603 fprintf(stderr
, "Error destroying judy array\n");
610 * nr_dup is number of nodes per key.
613 int test_sparse_key(unsigned int bits
, int nr_dup
)
615 uint64_t key
, max_key
;
616 int zerocount
, i
, ret
;
619 max_key
= UINT64_MAX
;
621 max_key
= (1ULL << bits
) - 1;
623 printf("Sparse key test begins for %u-bit keys\n", bits
);
624 /* Test with 16-bit key */
625 test_ja
= cds_ja_new(bits
);
627 printf("Error allocating judy array.\n");
632 printf("Test #1: add keys (%u-bit).\n", bits
);
633 for (i
= 0; i
< nr_dup
; i
++) {
635 for (key
= 0; key
<= max_key
&& (key
!= 0 || zerocount
< 1); key
+= 1ULL << (bits
- 8)) {
636 struct ja_test_node
*node
= node_alloc();
638 ja_test_node_init(node
, key
);
640 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
643 fprintf(stderr
, "Error (%d) adding node %" PRIu64
"\n",
653 printf("Test #2: successful key lookup (%u-bit).\n", bits
);
655 for (key
= 0; key
<= max_key
&& (key
!= 0 || zerocount
< 1); key
+= 1ULL << (bits
- 8)) {
656 struct cds_ja_node
*ja_node
;
657 struct ja_test_node
*node
;
661 ja_node
= cds_ja_lookup(test_ja
, key
);
663 fprintf(stderr
, "Error lookup node %" PRIu64
"\n", key
);
666 cds_ja_for_each_duplicate_rcu(ja_node
) {
669 if (count
!= nr_dup
) {
670 fprintf(stderr
, "Unexpected number of match for key %" PRIu64
", expected %d, got %d.\n", key
, nr_dup
, count
);
678 printf("Test #3: unsuccessful key lookup (%u-bit).\n", bits
);
680 for (key
= 0; key
<= max_key
&& (key
!= 0 || zerocount
< 1); key
+= 1ULL << (bits
- 8)) {
681 struct cds_ja_node
*ja_node
;
684 ja_node
= cds_ja_lookup(test_ja
, key
+ 42);
687 "Error unexpected lookup node %" PRIu64
"\n",
697 printf("Test #4: remove keys (%u-bit).\n", bits
);
699 for (key
= 0; key
<= max_key
&& (key
!= 0 || zerocount
< 1); key
+= 1ULL << (bits
- 8)) {
700 struct cds_ja_node
*ja_node
;
704 ja_node
= cds_ja_lookup(test_ja
, key
);
706 cds_ja_for_each_duplicate_rcu(ja_node
) {
707 struct cds_ja_node
*test_ja_node
;
708 struct ja_test_node
*node
;
711 node
= caa_container_of(ja_node
,
712 struct ja_test_node
, node
);
713 ret
= cds_ja_del(test_ja
, key
, &node
->node
);
715 fprintf(stderr
, "Error (%d) removing node %" PRIu64
"\n", ret
, key
);
718 rcu_free_test_node(node
);
719 test_ja_node
= cds_ja_lookup(test_ja
, key
);
720 if (count
< nr_dup
&& !test_ja_node
) {
721 fprintf(stderr
, "Error: no node found after deletion of some nodes of a key\n");
725 ja_node
= cds_ja_lookup(test_ja
, key
);
727 fprintf(stderr
, "Error lookup %" PRIu64
": %p (after delete) failed. Node is not expected.\n", key
, ja_node
);
736 ret
= cds_ja_destroy(test_ja
, free_node
);
738 fprintf(stderr
, "Error destroying judy array\n");
741 printf("Test ends\n");
747 int do_sanity_test(void)
751 printf("Sanity test start.\n");
753 for (i
= 0; i
< 3; i
++) {
754 ret
= test_8bit_key();
758 rcu_quiescent_state();
760 ret
= test_16bit_key();
764 rcu_quiescent_state();
767 for (i
= 8; i
<= 64; i
*= 2) {
768 /* nr of nodes per key */
769 for (j
= 1; j
< 4; j
++) {
770 ret
= test_sparse_key(i
, j
);
774 rcu_quiescent_state();
777 printf("Sanity test end.\n");
782 enum urcu_ja_addremove
{
786 }; /* 1: add, -1 remove, 0: random */
788 static enum urcu_ja_addremove addremove
; /* 1: add, -1 remove, 0: random */
791 void test_ja_rw_sigusr1_handler(int signo
)
795 printf("Add/Remove: random.\n");
796 addremove
= AR_RANDOM
;
799 printf("Add/Remove: remove only.\n");
800 addremove
= AR_REMOVE
;
803 printf("Add/Remove: add only.\n");
810 void *test_ja_rw_thr_reader(void *_count
)
812 unsigned long long *count
= _count
;
813 struct cds_ja_node
*ja_node
;
816 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
817 "reader", pthread_self(), (unsigned long) gettid());
821 rcu_register_thread();
831 /* note: only looking up ulong keys */
832 key
= ((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % lookup_pool_size
) + lookup_pool_offset
;
834 ja_node
= cds_ja_lookup(test_ja
, key
);
836 if (validate_lookup
) {
837 printf("[ERROR] Lookup cannot find initial node.\n");
840 URCU_TLS(lookup_fail
)++;
842 URCU_TLS(lookup_ok
)++;
844 rcu_debug_yield_read();
845 if (caa_unlikely(rduration
))
846 loop_sleep(rduration
);
848 URCU_TLS(nr_reads
)++;
849 if (caa_unlikely(!test_duration_read()))
851 if (caa_unlikely((URCU_TLS(nr_reads
) & ((1 << 10) - 1)) == 0))
852 rcu_quiescent_state();
855 rcu_unregister_thread();
857 *count
= URCU_TLS(nr_reads
);
858 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
859 "reader", pthread_self(), (unsigned long) gettid());
860 printf_verbose("readid : %lx, lookupfail %lu, lookupok %lu\n",
861 pthread_self(), URCU_TLS(lookup_fail
),
862 URCU_TLS(lookup_ok
));
869 return ((unsigned int) rand_r(&URCU_TLS(rand_lookup
)) % 100) < add_ratio
;
873 void *test_ja_rw_thr_writer(void *_count
)
875 struct wr_count
*count
= _count
;
879 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
880 "writer", pthread_self(), (unsigned long) gettid());
884 rcu_register_thread();
892 if ((addremove
== AR_ADD
)
893 || (addremove
== AR_RANDOM
&& is_add())) {
894 struct ja_test_node
*node
= node_alloc();
895 struct cds_ja_node
*ret_node
;
897 /* note: only inserting ulong keys */
898 key
= ((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % write_pool_size
) + write_pool_offset
;
900 ja_test_node_init(node
, key
);
903 ret_node
= cds_ja_add_unique(test_ja
, key
, &node
->node
);
904 if (ret_node
!= &node
->node
) {
905 free_test_node(node
);
906 URCU_TLS(nr_addexist
)++;
910 } else if (add_replace
) {
911 assert(0); /* not implemented yet. */
913 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
915 fprintf(stderr
, "Error in cds_ja_add: %d\n", ret
);
916 free_test_node(node
);
923 struct cds_ja_node
*ja_node
;
924 struct ja_test_node
*node
;
927 /* note: only deleting ulong keys */
928 key
= ((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % write_pool_size
) + write_pool_offset
;
933 ja_node
= cds_ja_lookup(test_ja
, key
);
934 /* Remove first entry */
936 node
= caa_container_of(ja_node
,
937 struct ja_test_node
, node
);
938 ret
= cds_ja_del(test_ja
, key
, &node
->node
);
940 rcu_free_test_node(node
);
943 URCU_TLS(nr_delnoent
)++;
946 URCU_TLS(nr_delnoent
)++;
951 URCU_TLS(nr_writes
)++;
952 if (caa_unlikely(!test_duration_write()))
954 if (caa_unlikely(wdelay
))
956 if (caa_unlikely((URCU_TLS(nr_writes
) & ((1 << 10) - 1)) == 0))
957 rcu_quiescent_state();
960 rcu_unregister_thread();
962 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
963 "writer", pthread_self(), (unsigned long) gettid());
964 printf_verbose("info id %lx: nr_add %lu, nr_addexist %lu, nr_del %lu, "
965 "nr_delnoent %lu\n", pthread_self(), URCU_TLS(nr_add
),
966 URCU_TLS(nr_addexist
), URCU_TLS(nr_del
),
967 URCU_TLS(nr_delnoent
));
968 count
->update_ops
= URCU_TLS(nr_writes
);
969 count
->add
= URCU_TLS(nr_add
);
970 count
->add_exist
= URCU_TLS(nr_addexist
);
971 count
->remove
= URCU_TLS(nr_del
);
976 int do_mt_populate_ja(void)
984 printf("Starting rw test\n");
986 for (iter
= init_pool_offset
; iter
< init_pool_offset
+ init_pool_size
; iter
++) {
987 struct ja_test_node
*node
= node_alloc();
990 /* note: only inserting ulong keys */
991 key
= (unsigned long) iter
;
993 ja_test_node_init(node
, key
);
995 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
997 URCU_TLS(nr_writes
)++;
1000 fprintf(stderr
, "Error (%d) adding node %" PRIu64
"\n",
1009 int do_mt_test(void)
1011 pthread_t
*tid_reader
, *tid_writer
;
1014 unsigned long long *count_reader
;
1015 struct wr_count
*count_writer
;
1016 unsigned long long tot_reads
= 0, tot_writes
= 0,
1017 tot_add
= 0, tot_add_exist
= 0, tot_remove
= 0;
1018 unsigned int remain
;
1020 tid_reader
= malloc(sizeof(*tid_reader
) * nr_readers
);
1021 tid_writer
= malloc(sizeof(*tid_writer
) * nr_writers
);
1022 count_reader
= malloc(sizeof(*count_reader
) * nr_readers
);
1023 count_writer
= malloc(sizeof(*count_writer
) * nr_writers
);
1025 printf("Allocating Judy Array for %u-bit keys\n", key_bits
);
1026 test_ja
= cds_ja_new(key_bits
);
1028 printf("Error allocating judy array.\n");
1033 do_mt_populate_ja();
1037 for (i
= 0; i
< nr_readers
; i
++) {
1038 err
= pthread_create(&tid_reader
[i
],
1039 NULL
, test_ja_rw_thr_reader
,
1044 for (i
= 0; i
< nr_writers
; i
++) {
1045 err
= pthread_create(&tid_writer
[i
],
1046 NULL
, test_ja_rw_thr_writer
,
1056 rcu_thread_offline_qsbr();
1060 remain
= sleep(remain
);
1061 } while (remain
> 0);
1065 for (i
= 0; i
< nr_readers
; i
++) {
1066 err
= pthread_join(tid_reader
[i
], &tret
);
1069 tot_reads
+= count_reader
[i
];
1071 for (i
= 0; i
< nr_writers
; i
++) {
1072 err
= pthread_join(tid_writer
[i
], &tret
);
1075 tot_writes
+= count_writer
[i
].update_ops
;
1076 tot_add
+= count_writer
[i
].add
;
1077 tot_add_exist
+= count_writer
[i
].add_exist
;
1078 tot_remove
+= count_writer
[i
].remove
;
1080 rcu_thread_online_qsbr();
1082 ret
= cds_ja_destroy(test_ja
, free_node
);
1084 fprintf(stderr
, "Error destroying judy array\n");
1098 int check_memory_leaks(void)
1100 unsigned long na
, nf
;
1102 na
= uatomic_read(&test_nodes_allocated
);
1103 nf
= uatomic_read(&test_nodes_freed
);
1105 fprintf(stderr
, "Memory leak of %ld test nodes detected. Allocated: %lu, freed: %lu\n",
1112 int main(int argc
, char **argv
)
1114 int i
, j
, a
, ret
, err
;
1116 struct sigaction act
;
1119 show_usage(argc
, argv
);
1123 err
= sscanf(argv
[1], "%u", &nr_readers
);
1125 show_usage(argc
, argv
);
1129 err
= sscanf(argv
[2], "%u", &nr_writers
);
1131 show_usage(argc
, argv
);
1135 err
= sscanf(argv
[3], "%lu", &duration
);
1137 show_usage(argc
, argv
);
1141 for (i
= 4; i
< argc
; i
++) {
1142 if (argv
[i
][0] != '-')
1144 switch (argv
[i
][1]) {
1147 yield_active
|= YIELD_READ
;
1150 yield_active
|= YIELD_WRITE
;
1155 show_usage(argc
, argv
);
1158 a
= atoi(argv
[++i
]);
1159 cpu_affinities
[next_aff
++] = a
;
1161 printf_verbose("Adding CPU %d affinity\n", a
);
1165 show_usage(argc
, argv
);
1168 rduration
= atol(argv
[++i
]);
1172 show_usage(argc
, argv
);
1175 wdelay
= atol(argv
[++i
]);
1181 add_ratio
= atoi(argv
[++i
]);
1187 lookup_pool_offset
= atol(argv
[++i
]);
1190 write_pool_offset
= atol(argv
[++i
]);
1193 init_pool_offset
= atol(argv
[++i
]);
1196 lookup_pool_size
= atol(argv
[++i
]);
1199 write_pool_size
= atol(argv
[++i
]);
1202 init_pool_size
= atol(argv
[++i
]);
1205 validate_lookup
= 1;
1211 key_bits
= atol(argv
[++i
]);
1214 key_mul
= atoll(argv
[++i
]);
1228 printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
1229 duration
, nr_readers
, nr_writers
);
1230 printf_verbose("Writer delay : %lu loops.\n", wdelay
);
1231 printf_verbose("Reader duration : %lu loops.\n", rduration
);
1232 printf_verbose("Add ratio: %u%%.\n", add_ratio
);
1233 printf_verbose("Mode:%s%s.\n",
1235 add_unique
? " uniquify" : ( add_replace
? " replace" : " insert"));
1236 printf_verbose("Key multiplication factor: %" PRIu64
".\n", key_mul
);
1237 printf_verbose("Init pool size offset %lu size %lu.\n",
1238 init_pool_offset
, init_pool_size
);
1239 printf_verbose("Lookup pool size offset %lu size %lu.\n",
1240 lookup_pool_offset
, lookup_pool_size
);
1241 printf_verbose("Update pool size offset %lu size %lu.\n",
1242 write_pool_offset
, write_pool_size
);
1243 if (validate_lookup
)
1244 printf_verbose("Validating lookups.\n");
1246 printf_verbose("Memory leak dection activated.\n");
1247 printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
1248 "main", pthread_self(), (unsigned long)gettid());
1250 memset(&act
, 0, sizeof(act
));
1251 ret
= sigemptyset(&act
.sa_mask
);
1253 perror("sigemptyset");
1256 act
.sa_handler
= test_ja_rw_sigusr1_handler
;
1257 act
.sa_flags
= SA_RESTART
;
1258 ret
= sigaction(SIGUSR1
, &act
, NULL
);
1260 perror("sigaction");
1264 err
= create_all_cpu_call_rcu_data(0);
1266 printf("Per-CPU call_rcu() worker threads unavailable. Using default global worker thread.\n");
1269 rcu_register_thread();
1272 ret
= do_sanity_test();
1277 /* Wait for in-flight call_rcu free to complete for leak detection */
1280 ret
|= check_memory_leaks();
1282 rcu_unregister_thread();
1283 free_all_cpu_call_rcu_data();
1286 printf("Test ended with error: %d\n", ret
);