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_node(struct ja_test_node
*node
)
152 uatomic_inc(&test_nodes_freed
);
156 void free_node_cb(struct rcu_head
*head
)
158 struct ja_test_node
*node
=
159 caa_container_of(head
, struct ja_test_node
, head
);
164 void rcu_free_test_node(struct ja_test_node
*test_node
)
166 call_rcu(&test_node
->head
, free_node_cb
);
170 void rcu_free_node(struct cds_ja_node
*node
)
172 struct ja_test_node
*test_node
= to_test_node(node
);
174 rcu_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
[] = { 4, 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_hlist_head head
;
263 head
= cds_ja_lookup(test_ja
, key
);
264 if (cds_hlist_empty(&head
)) {
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_hlist_head head
;
276 head
= cds_ja_lookup(test_ja
, key
);
277 if (!cds_hlist_empty(&head
)) {
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_hlist_head head
;
289 struct ja_test_node
*node
;
292 head
= cds_ja_lookup(test_ja
, key
);
293 node
= cds_hlist_first_entry_rcu(&head
, struct ja_test_node
, node
.list
);
295 fprintf(stderr
, "Error lookup node %" PRIu64
"\n", key
);
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 head
= cds_ja_lookup(test_ja
, key
);
305 if (!cds_hlist_empty(&head
)) {
306 fprintf(stderr
, "Error lookup %" PRIu64
": %p (after delete) failed. Node is not expected.\n", key
, head
.next
);
313 printf("Test #5: lookup lower 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_hlist_head head
;
332 struct ja_test_node
*node
;
334 key
= ka
[i
] + ka_test_offset
;
336 head
= cds_ja_lookup_lower_equal(test_ja
, key
);
337 if (cds_hlist_empty(&head
)) {
338 fprintf(stderr
, "Error lookup lower equal. Cannot find expected key %" PRIu64
" below or equal to %" PRIu64
".\n",
342 node
= cds_hlist_first_entry_rcu(&head
, struct ja_test_node
, node
.list
);
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
);
351 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
352 struct cds_hlist_head head
;
353 struct ja_test_node
*node
;
355 key
= ka
[i
]; /* without offset */
357 head
= cds_ja_lookup_lower_equal(test_ja
, key
);
358 if (cds_hlist_empty(&head
)) {
359 fprintf(stderr
, "Error lookup lower equal. Cannot find expected key %" PRIu64
" below or equal to %" PRIu64
".\n",
363 node
= cds_hlist_first_entry_rcu(&head
, struct ja_test_node
, node
.list
);
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
);
374 ret
= cds_ja_destroy(test_ja
, rcu_free_node
);
376 fprintf(stderr
, "Error destroying judy array\n");
383 int test_16bit_key(void)
387 uint64_t ka
[] = { 4, 105, 222, 4000, 4111, 59990, 65435 };
388 uint64_t ka_test_offset
= 100;
390 /* Test with 16-bit key */
391 test_ja
= cds_ja_new(16);
393 printf("Error allocating judy array.\n");
398 printf("Test #1: add keys (16-bit).\n");
399 for (key
= 0; key
< 10000; key
++) {
400 //for (key = 0; key < 65536; key+=256) {
401 struct ja_test_node
*node
= node_alloc();
403 ja_test_node_init(node
, key
);
405 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
408 fprintf(stderr
, "Error (%d) adding node %" PRIu64
"\n",
415 printf("Test #2: successful key lookup (16-bit).\n");
416 for (key
= 0; key
< 10000; key
++) {
417 //for (key = 0; key < 65536; key+=256) {
418 struct cds_hlist_head head
;
421 head
= cds_ja_lookup(test_ja
, key
);
422 if (cds_hlist_empty(&head
)) {
423 fprintf(stderr
, "Error lookup node %" PRIu64
"\n", key
);
429 printf("Test #3: unsuccessful key lookup (16-bit).\n");
430 for (key
= 11000; key
<= 11002; key
++) {
431 struct cds_hlist_head head
;
434 head
= cds_ja_lookup(test_ja
, key
);
435 if (!cds_hlist_empty(&head
)) {
437 "Error unexpected lookup node %" PRIu64
"\n",
444 printf("Test #4: remove keys (16-bit).\n");
445 for (key
= 0; key
< 10000; key
++) {
446 //for (key = 0; key < 65536; key+=256) {
447 struct cds_hlist_head head
;
448 struct ja_test_node
*node
;
451 head
= cds_ja_lookup(test_ja
, key
);
452 node
= cds_hlist_first_entry_rcu(&head
, struct ja_test_node
, node
.list
);
454 fprintf(stderr
, "Error lookup node %" PRIu64
"\n", key
);
457 ret
= cds_ja_del(test_ja
, key
, &node
->node
);
459 fprintf(stderr
, "Error (%d) removing node %" PRIu64
"\n", ret
, key
);
462 rcu_free_test_node(node
);
463 head
= cds_ja_lookup(test_ja
, key
);
464 if (!cds_hlist_empty(&head
)) {
465 fprintf(stderr
, "Error lookup %" PRIu64
": %p (after delete) failed. Node is not expected.\n", key
, head
.next
);
472 printf("Test #5: lookup lower equal (16-bit).\n");
474 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
475 struct ja_test_node
*node
= node_alloc();
478 ja_test_node_init(node
, key
);
480 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
483 fprintf(stderr
, "Error (%d) adding node %" PRIu64
"\n",
489 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
490 struct cds_hlist_head head
;
491 struct ja_test_node
*node
;
493 key
= ka
[i
] + ka_test_offset
;
495 head
= cds_ja_lookup_lower_equal(test_ja
, key
);
496 if (cds_hlist_empty(&head
)) {
497 fprintf(stderr
, "Error lookup lower equal. Cannot find expected key %" PRIu64
" below or equal to %" PRIu64
".\n",
501 node
= cds_hlist_first_entry_rcu(&head
, struct ja_test_node
, node
.list
);
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
);
510 for (i
= 0; i
< CAA_ARRAY_SIZE(ka
); i
++) {
511 struct cds_hlist_head head
;
512 struct ja_test_node
*node
;
514 key
= ka
[i
]; /* without offset */
516 head
= cds_ja_lookup_lower_equal(test_ja
, key
);
517 if (cds_hlist_empty(&head
)) {
518 fprintf(stderr
, "Error lookup lower equal. Cannot find expected key %" PRIu64
" below or equal to %" PRIu64
".\n",
522 node
= cds_hlist_first_entry_rcu(&head
, struct ja_test_node
, node
.list
);
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
);
533 ret
= cds_ja_destroy(test_ja
, rcu_free_node
);
535 fprintf(stderr
, "Error destroying judy array\n");
542 * nr_dup is number of nodes per key.
545 int test_sparse_key(unsigned int bits
, int nr_dup
)
547 uint64_t key
, max_key
;
548 int zerocount
, i
, ret
;
551 max_key
= UINT64_MAX
;
553 max_key
= (1ULL << bits
) - 1;
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
);
559 printf("Error allocating judy array.\n");
564 printf("Test #1: add keys (%u-bit).\n", bits
);
565 for (i
= 0; i
< nr_dup
; i
++) {
567 for (key
= 0; key
<= max_key
&& (key
!= 0 || zerocount
< 1); key
+= 1ULL << (bits
- 8)) {
568 struct ja_test_node
*node
= node_alloc();
570 ja_test_node_init(node
, key
);
572 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
575 fprintf(stderr
, "Error (%d) adding node %" PRIu64
"\n",
585 printf("Test #2: successful key lookup (%u-bit).\n", bits
);
587 for (key
= 0; key
<= max_key
&& (key
!= 0 || zerocount
< 1); key
+= 1ULL << (bits
- 8)) {
588 struct cds_hlist_head head
;
589 struct ja_test_node
*node
;
590 struct cds_hlist_node
*pos
;
594 head
= cds_ja_lookup(test_ja
, key
);
595 if (cds_hlist_empty(&head
)) {
596 fprintf(stderr
, "Error lookup node %" PRIu64
"\n", key
);
599 cds_hlist_for_each_entry_rcu(node
, pos
, &head
, node
.list
) {
602 if (count
!= nr_dup
) {
603 fprintf(stderr
, "Unexpected number of match for key %" PRIu64
", expected %d, got %d.\n", key
, nr_dup
, count
);
611 printf("Test #3: unsuccessful key lookup (%u-bit).\n", bits
);
613 for (key
= 0; key
<= max_key
&& (key
!= 0 || zerocount
< 1); key
+= 1ULL << (bits
- 8)) {
614 struct cds_hlist_head head
;
617 head
= cds_ja_lookup(test_ja
, key
+ 42);
618 if (!cds_hlist_empty(&head
)) {
620 "Error unexpected lookup node %" PRIu64
"\n",
630 printf("Test #4: remove keys (%u-bit).\n", bits
);
632 for (key
= 0; key
<= max_key
&& (key
!= 0 || zerocount
< 1); key
+= 1ULL << (bits
- 8)) {
633 struct cds_hlist_head head
;
634 struct ja_test_node
*node
;
635 struct cds_hlist_node
*pos
;
639 head
= cds_ja_lookup(test_ja
, key
);
642 cds_hlist_for_each_entry_rcu(node
, pos
, &head
, node
.list
) {
643 struct cds_hlist_head testhead
;
647 fprintf(stderr
, "Error lookup node %" PRIu64
"\n", key
);
650 ret
= cds_ja_del(test_ja
, key
, &node
->node
);
652 fprintf(stderr
, "Error (%d) removing node %" PRIu64
"\n", ret
, key
);
655 rcu_free_test_node(node
);
656 testhead
= cds_ja_lookup(test_ja
, key
);
657 if (count
< nr_dup
&& cds_hlist_empty(&testhead
)) {
658 fprintf(stderr
, "Error: no node found after deletion of some nodes of a key\n");
662 head
= cds_ja_lookup(test_ja
, key
);
663 if (!cds_hlist_empty(&head
)) {
664 fprintf(stderr
, "Error lookup %" PRIu64
": %p (after delete) failed. Node is not expected.\n", key
, head
.next
);
673 ret
= cds_ja_destroy(test_ja
, rcu_free_node
);
675 fprintf(stderr
, "Error destroying judy array\n");
678 printf("Test ends\n");
684 int do_sanity_test(void)
688 printf("Sanity test start.\n");
690 for (i
= 0; i
< 3; i
++) {
691 ret
= test_8bit_key();
695 rcu_quiescent_state();
697 ret
= test_16bit_key();
701 rcu_quiescent_state();
704 for (i
= 8; i
<= 64; i
*= 2) {
705 /* nr of nodes per key */
706 for (j
= 1; j
< 4; j
++) {
707 ret
= test_sparse_key(i
, j
);
711 rcu_quiescent_state();
714 printf("Sanity test end.\n");
719 enum urcu_ja_addremove
{
723 }; /* 1: add, -1 remove, 0: random */
725 static enum urcu_ja_addremove addremove
; /* 1: add, -1 remove, 0: random */
728 void test_ja_rw_sigusr1_handler(int signo
)
732 printf("Add/Remove: random.\n");
733 addremove
= AR_RANDOM
;
736 printf("Add/Remove: remove only.\n");
737 addremove
= AR_REMOVE
;
740 printf("Add/Remove: add only.\n");
747 void *test_ja_rw_thr_reader(void *_count
)
749 unsigned long long *count
= _count
;
750 struct cds_hlist_head head
;
753 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
754 "reader", pthread_self(), (unsigned long) gettid());
758 rcu_register_thread();
768 /* note: only looking up ulong keys */
769 key
= ((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % lookup_pool_size
) + lookup_pool_offset
;
771 head
= cds_ja_lookup(test_ja
, key
);
772 if (cds_hlist_empty(&head
)) {
773 if (validate_lookup
) {
774 printf("[ERROR] Lookup cannot find initial node.\n");
777 URCU_TLS(lookup_fail
)++;
779 URCU_TLS(lookup_ok
)++;
781 rcu_debug_yield_read();
782 if (caa_unlikely(rduration
))
783 loop_sleep(rduration
);
785 URCU_TLS(nr_reads
)++;
786 if (caa_unlikely(!test_duration_read()))
788 if (caa_unlikely((URCU_TLS(nr_reads
) & ((1 << 10) - 1)) == 0))
789 rcu_quiescent_state();
792 rcu_unregister_thread();
794 *count
= URCU_TLS(nr_reads
);
795 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
796 "reader", pthread_self(), (unsigned long) gettid());
797 printf_verbose("readid : %lx, lookupfail %lu, lookupok %lu\n",
798 pthread_self(), URCU_TLS(lookup_fail
),
799 URCU_TLS(lookup_ok
));
806 return ((unsigned int) rand_r(&URCU_TLS(rand_lookup
)) % 100) < add_ratio
;
810 void *test_ja_rw_thr_writer(void *_count
)
812 struct wr_count
*count
= _count
;
813 struct cds_hlist_head head
;
817 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
818 "writer", pthread_self(), (unsigned long) gettid());
822 rcu_register_thread();
830 if ((addremove
== AR_ADD
)
831 || (addremove
== AR_RANDOM
&& is_add())) {
832 struct ja_test_node
*node
= node_alloc();
833 struct cds_ja_node
*ret_node
;
835 /* note: only inserting ulong keys */
836 key
= ((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % write_pool_size
) + write_pool_offset
;
838 ja_test_node_init(node
, key
);
841 ret_node
= cds_ja_add_unique(test_ja
, key
, &node
->node
);
842 if (ret_node
!= &node
->node
) {
844 URCU_TLS(nr_addexist
)++;
848 } else if (add_replace
) {
849 assert(0); /* not implemented yet. */
851 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
853 fprintf(stderr
, "Error in cds_ja_add: %d\n", ret
);
861 struct ja_test_node
*node
;
864 /* note: only deleting ulong keys */
865 key
= ((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % write_pool_size
) + write_pool_offset
;
870 head
= cds_ja_lookup(test_ja
, key
);
871 node
= cds_hlist_first_entry_rcu(&head
, struct ja_test_node
, node
.list
);
873 ret
= cds_ja_del(test_ja
, key
, &node
->node
);
875 rcu_free_test_node(node
);
878 URCU_TLS(nr_delnoent
)++;
881 URCU_TLS(nr_delnoent
)++;
886 URCU_TLS(nr_writes
)++;
887 if (caa_unlikely(!test_duration_write()))
889 if (caa_unlikely(wdelay
))
891 if (caa_unlikely((URCU_TLS(nr_writes
) & ((1 << 10) - 1)) == 0))
892 rcu_quiescent_state();
895 rcu_unregister_thread();
897 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
898 "writer", pthread_self(), (unsigned long) gettid());
899 printf_verbose("info id %lx: nr_add %lu, nr_addexist %lu, nr_del %lu, "
900 "nr_delnoent %lu\n", pthread_self(), URCU_TLS(nr_add
),
901 URCU_TLS(nr_addexist
), URCU_TLS(nr_del
),
902 URCU_TLS(nr_delnoent
));
903 count
->update_ops
= URCU_TLS(nr_writes
);
904 count
->add
= URCU_TLS(nr_add
);
905 count
->add_exist
= URCU_TLS(nr_addexist
);
906 count
->remove
= URCU_TLS(nr_del
);
911 int do_mt_populate_ja(void)
913 struct cds_hlist_head head
;
920 printf("Starting rw test\n");
922 for (iter
= init_pool_offset
; iter
< init_pool_offset
+ init_pool_size
; iter
++) {
923 struct ja_test_node
*node
= node_alloc();
926 /* note: only inserting ulong keys */
927 key
= (unsigned long) iter
;
929 ja_test_node_init(node
, key
);
931 ret
= cds_ja_add(test_ja
, key
, &node
->node
);
933 URCU_TLS(nr_writes
)++;
936 fprintf(stderr
, "Error (%d) adding node %" PRIu64
"\n",
947 pthread_t
*tid_reader
, *tid_writer
;
950 unsigned long long *count_reader
;
951 struct wr_count
*count_writer
;
952 unsigned long long tot_reads
= 0, tot_writes
= 0,
953 tot_add
= 0, tot_add_exist
= 0, tot_remove
= 0;
956 tid_reader
= malloc(sizeof(*tid_reader
) * nr_readers
);
957 tid_writer
= malloc(sizeof(*tid_writer
) * nr_writers
);
958 count_reader
= malloc(sizeof(*count_reader
) * nr_readers
);
959 count_writer
= malloc(sizeof(*count_writer
) * nr_writers
);
961 printf("Allocating Judy Array for %u-bit keys\n", key_bits
);
962 test_ja
= cds_ja_new(key_bits
);
964 printf("Error allocating judy array.\n");
973 for (i
= 0; i
< nr_readers
; i
++) {
974 err
= pthread_create(&tid_reader
[i
],
975 NULL
, test_ja_rw_thr_reader
,
980 for (i
= 0; i
< nr_writers
; i
++) {
981 err
= pthread_create(&tid_writer
[i
],
982 NULL
, test_ja_rw_thr_writer
,
992 rcu_thread_offline_qsbr();
996 remain
= sleep(remain
);
997 } while (remain
> 0);
1001 for (i
= 0; i
< nr_readers
; i
++) {
1002 err
= pthread_join(tid_reader
[i
], &tret
);
1005 tot_reads
+= count_reader
[i
];
1007 for (i
= 0; i
< nr_writers
; i
++) {
1008 err
= pthread_join(tid_writer
[i
], &tret
);
1011 tot_writes
+= count_writer
[i
].update_ops
;
1012 tot_add
+= count_writer
[i
].add
;
1013 tot_add_exist
+= count_writer
[i
].add_exist
;
1014 tot_remove
+= count_writer
[i
].remove
;
1016 rcu_thread_online_qsbr();
1018 ret
= cds_ja_destroy(test_ja
, rcu_free_node
);
1020 fprintf(stderr
, "Error destroying judy array\n");
1034 int check_memory_leaks(void)
1036 unsigned long na
, nf
;
1038 na
= uatomic_read(&test_nodes_allocated
);
1039 nf
= uatomic_read(&test_nodes_freed
);
1041 fprintf(stderr
, "Memory leak of %ld test nodes detected. Allocated: %lu, freed: %lu\n",
1048 int main(int argc
, char **argv
)
1050 int i
, j
, a
, ret
, err
;
1052 struct sigaction act
;
1055 show_usage(argc
, argv
);
1059 err
= sscanf(argv
[1], "%u", &nr_readers
);
1061 show_usage(argc
, argv
);
1065 err
= sscanf(argv
[2], "%u", &nr_writers
);
1067 show_usage(argc
, argv
);
1071 err
= sscanf(argv
[3], "%lu", &duration
);
1073 show_usage(argc
, argv
);
1077 for (i
= 4; i
< argc
; i
++) {
1078 if (argv
[i
][0] != '-')
1080 switch (argv
[i
][1]) {
1083 yield_active
|= YIELD_READ
;
1086 yield_active
|= YIELD_WRITE
;
1091 show_usage(argc
, argv
);
1094 a
= atoi(argv
[++i
]);
1095 cpu_affinities
[next_aff
++] = a
;
1097 printf_verbose("Adding CPU %d affinity\n", a
);
1101 show_usage(argc
, argv
);
1104 rduration
= atol(argv
[++i
]);
1108 show_usage(argc
, argv
);
1111 wdelay
= atol(argv
[++i
]);
1117 add_ratio
= atoi(argv
[++i
]);
1123 lookup_pool_offset
= atol(argv
[++i
]);
1126 write_pool_offset
= atol(argv
[++i
]);
1129 init_pool_offset
= atol(argv
[++i
]);
1132 lookup_pool_size
= atol(argv
[++i
]);
1135 write_pool_size
= atol(argv
[++i
]);
1138 init_pool_size
= atol(argv
[++i
]);
1141 validate_lookup
= 1;
1147 key_bits
= atol(argv
[++i
]);
1150 key_mul
= atoll(argv
[++i
]);
1164 printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
1165 duration
, nr_readers
, nr_writers
);
1166 printf_verbose("Writer delay : %lu loops.\n", wdelay
);
1167 printf_verbose("Reader duration : %lu loops.\n", rduration
);
1168 printf_verbose("Add ratio: %u%%.\n", add_ratio
);
1169 printf_verbose("Mode:%s%s.\n",
1171 add_unique
? " uniquify" : ( add_replace
? " replace" : " insert"));
1172 printf_verbose("Key multiplication factor: %" PRIu64
".\n", key_mul
);
1173 printf_verbose("Init pool size offset %lu size %lu.\n",
1174 init_pool_offset
, init_pool_size
);
1175 printf_verbose("Lookup pool size offset %lu size %lu.\n",
1176 lookup_pool_offset
, lookup_pool_size
);
1177 printf_verbose("Update pool size offset %lu size %lu.\n",
1178 write_pool_offset
, write_pool_size
);
1179 if (validate_lookup
)
1180 printf_verbose("Validating lookups.\n");
1182 printf_verbose("Memory leak dection activated.\n");
1183 printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
1184 "main", pthread_self(), (unsigned long)gettid());
1186 memset(&act
, 0, sizeof(act
));
1187 ret
= sigemptyset(&act
.sa_mask
);
1189 perror("sigemptyset");
1192 act
.sa_handler
= test_ja_rw_sigusr1_handler
;
1193 act
.sa_flags
= SA_RESTART
;
1194 ret
= sigaction(SIGUSR1
, &act
, NULL
);
1196 perror("sigaction");
1200 err
= create_all_cpu_call_rcu_data(0);
1202 printf("Per-CPU call_rcu() worker threads unavailable. Using default global worker thread.\n");
1205 rcu_register_thread();
1208 ret
= do_sanity_test();
1213 /* Wait for in-flight call_rcu free to complete for leak detection */
1216 ret
|= check_memory_leaks();
1218 rcu_unregister_thread();
1219 free_all_cpu_call_rcu_data();
1222 printf("Test ended with error: %d\n", ret
);