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.
23 #include "test_urcu_hash.h"
31 void (*sigusr1
)(int signo
);
32 void (*sigusr2
)(int signo
);
33 void *(*thr_reader
)(void *_count
);
34 void *(*thr_writer
)(void *_count
);
35 int (*populate_hash
)(void);
39 struct test_hash_cb test_hash_cb
[] = {
41 test_hash_rw_sigusr1_handler
,
42 test_hash_rw_sigusr2_handler
,
43 test_hash_rw_thr_reader
,
44 test_hash_rw_thr_writer
,
45 test_hash_rw_populate_hash
,
47 [TEST_HASH_UNIQUE
] = {
48 test_hash_unique_sigusr1_handler
,
49 test_hash_unique_sigusr2_handler
,
50 test_hash_unique_thr_reader
,
51 test_hash_unique_thr_writer
,
52 test_hash_unique_populate_hash
,
57 static enum test_hash test_choice
= TEST_HASH_RW
;
59 void (*get_sigusr1_cb(void))(int)
61 return test_hash_cb
[test_choice
].sigusr1
;
64 void (*get_sigusr2_cb(void))(int)
66 return test_hash_cb
[test_choice
].sigusr2
;
69 void *(*get_thr_reader_cb(void))(void *)
71 return test_hash_cb
[test_choice
].thr_reader
;
74 void *(*get_thr_writer_cb(void))(void *)
76 return test_hash_cb
[test_choice
].thr_writer
;
79 int (*get_populate_hash_cb(void))(void)
81 return test_hash_cb
[test_choice
].populate_hash
;
84 DEFINE_URCU_TLS(unsigned int, rand_lookup
);
85 DEFINE_URCU_TLS(unsigned long, nr_add
);
86 DEFINE_URCU_TLS(unsigned long, nr_addexist
);
87 DEFINE_URCU_TLS(unsigned long, nr_del
);
88 DEFINE_URCU_TLS(unsigned long, nr_delnoent
);
89 DEFINE_URCU_TLS(unsigned long, lookup_fail
);
90 DEFINE_URCU_TLS(unsigned long, lookup_ok
);
92 struct cds_lfht
*test_ht
;
94 volatile int test_go
, test_stop
;
98 unsigned long duration
;
100 /* read-side C.S. duration, in loops */
101 unsigned long rduration
;
103 unsigned long init_hash_size
= DEFAULT_HASH_SIZE
;
104 unsigned long min_hash_alloc_size
= DEFAULT_MIN_ALLOC_SIZE
;
105 unsigned long max_hash_buckets_size
= (1UL << 20);
106 unsigned long init_populate
;
108 int add_only
, add_unique
, add_replace
;
109 const struct cds_lfht_mm_type
*memory_backend
;
111 unsigned long init_pool_offset
, lookup_pool_offset
, write_pool_offset
;
112 unsigned long init_pool_size
= DEFAULT_RAND_POOL
,
113 lookup_pool_size
= DEFAULT_RAND_POOL
,
114 write_pool_size
= DEFAULT_RAND_POOL
;
116 unsigned long nr_hash_chains
; /* 0: normal table, other: number of hash chains */
122 unsigned int cpu_affinities
[NR_CPUS
];
123 unsigned int next_aff
= 0;
124 int use_affinity
= 0;
126 pthread_mutex_t affinity_mutex
= PTHREAD_MUTEX_INITIALIZER
;
128 DEFINE_URCU_TLS(unsigned long long, nr_writes
);
129 DEFINE_URCU_TLS(unsigned long long, nr_reads
);
131 unsigned int nr_readers
;
132 unsigned int nr_writers
;
134 static pthread_mutex_t rcu_copy_mutex
= PTHREAD_MUTEX_INITIALIZER
;
136 void set_affinity(void)
138 #if HAVE_SCHED_SETAFFINITY
141 #endif /* HAVE_SCHED_SETAFFINITY */
146 #if HAVE_SCHED_SETAFFINITY
147 ret
= pthread_mutex_lock(&affinity_mutex
);
149 perror("Error in pthread mutex lock");
152 cpu
= cpu_affinities
[next_aff
++];
153 ret
= pthread_mutex_unlock(&affinity_mutex
);
155 perror("Error in pthread mutex unlock");
160 #if SCHED_SETAFFINITY_ARGS == 2
161 sched_setaffinity(0, &mask
);
163 sched_setaffinity(0, sizeof(mask
), &mask
);
165 #endif /* HAVE_SCHED_SETAFFINITY */
168 void rcu_copy_mutex_lock(void)
171 ret
= pthread_mutex_lock(&rcu_copy_mutex
);
173 perror("Error in pthread mutex lock");
178 void rcu_copy_mutex_unlock(void)
182 ret
= pthread_mutex_unlock(&rcu_copy_mutex
);
184 perror("Error in pthread mutex unlock");
189 unsigned long test_compare(const void *key1
, size_t key1_len
,
190 const void *key2
, size_t key2_len
)
192 if (caa_unlikely(key1_len
!= key2_len
))
194 assert(key1_len
== sizeof(unsigned long));
201 void *thr_count(void *arg
)
203 printf_verbose("thread_begin %s, tid %lu\n",
204 "counter", urcu_get_thread_id());
206 rcu_register_thread();
210 long approx_before
, approx_after
;
214 rcu_thread_offline();
215 len
= read(count_pipe
[0], buf
, 1);
217 if (caa_unlikely(!test_duration_read()))
222 printf("Counting nodes... ");
225 cds_lfht_count_nodes(test_ht
, &approx_before
, &count
,
229 printf("Approximation before node accounting: %ld nodes.\n",
231 printf("Accounting of nodes in the hash table: "
234 printf("Approximation after node accounting: %ld nodes.\n",
237 rcu_unregister_thread();
241 void free_node_cb(struct rcu_head
*head
)
243 struct lfht_test_node
*node
=
244 caa_container_of(head
, struct lfht_test_node
, head
);
249 void test_delete_all_nodes(struct cds_lfht
*ht
)
251 struct cds_lfht_iter iter
;
252 struct lfht_test_node
*node
;
253 unsigned long count
= 0;
255 cds_lfht_for_each_entry(ht
, &iter
, node
, node
) {
258 ret
= cds_lfht_del(test_ht
, cds_lfht_iter_get_node(&iter
));
260 call_rcu(&node
->head
, free_node_cb
);
263 printf("deleted %lu nodes.\n", count
);
266 void show_usage(int argc
, char **argv
)
268 printf("Usage : %s nr_readers nr_writers duration (s) <OPTIONS>\n",
270 printf("OPTIONS:\n");
271 printf(" [-r] [-w] (yield reader and/or writer)\n");
272 printf(" [-d delay] (writer period (us))\n");
273 printf(" [-c duration] (reader C.S. duration (in loops))\n");
274 printf(" [-v] (verbose output)\n");
275 printf(" [-a cpu#] [-a cpu#]... (affinity)\n");
276 printf(" [-h size] (initial number of buckets)\n");
277 printf(" [-m size] (minimum number of allocated buckets)\n");
278 printf(" [-n size] (maximum number of buckets)\n");
279 printf(" [not -u nor -s] Add entries (supports redundant keys).\n");
280 printf(" [-u] Uniquify add (no redundant keys).\n");
281 printf(" [-s] Replace (swap) entries.\n");
282 printf(" [-i] Add only (no removal).\n");
283 printf(" [-k nr_nodes] Number of nodes to insert initially.\n");
284 printf(" [-A] Automatically resize hash table.\n");
285 printf(" [-B order|chunk|mmap] Specify the memory backend.\n");
286 printf(" [-R offset] Lookup pool offset.\n");
287 printf(" [-S offset] Write pool offset.\n");
288 printf(" [-T offset] Init pool offset.\n");
289 printf(" [-M size] Lookup pool size.\n");
290 printf(" [-N size] Write pool size.\n");
291 printf(" [-O size] Init pool size.\n");
292 printf(" [-V] Validate lookups of init values.\n");
293 printf(" (use with filled init pool, same lookup range,\n");
294 printf(" with different write range)\n");
295 printf(" [-U] Uniqueness test.\n");
296 printf(" [-C] Number of hash chains.\n");
300 int main(int argc
, char **argv
)
302 pthread_t
*tid_reader
, *tid_writer
;
305 unsigned long long *count_reader
;
306 struct wr_count
*count_writer
;
307 unsigned long long tot_reads
= 0, tot_writes
= 0,
308 tot_add
= 0, tot_add_exist
= 0, tot_remove
= 0;
310 long approx_before
, approx_after
;
311 int i
, a
, ret
, err
, mainret
= 0;
312 struct sigaction act
;
314 unsigned int nr_readers_created
= 0, nr_writers_created
= 0;
318 show_usage(argc
, argv
);
323 err
= sscanf(argv
[1], "%u", &nr_readers
);
325 show_usage(argc
, argv
);
330 err
= sscanf(argv
[2], "%u", &nr_writers
);
332 show_usage(argc
, argv
);
337 err
= sscanf(argv
[3], "%lu", &duration
);
339 show_usage(argc
, argv
);
344 for (i
= 4; i
< argc
; i
++) {
345 if (argv
[i
][0] != '-')
347 switch (argv
[i
][1]) {
349 rcu_debug_yield_enable(RCU_YIELD_READ
);
352 rcu_debug_yield_enable(RCU_YIELD_WRITE
);
356 show_usage(argc
, argv
);
361 cpu_affinities
[next_aff
++] = a
;
363 printf_verbose("Adding CPU %d affinity\n", a
);
367 show_usage(argc
, argv
);
371 rduration
= atol(argv
[++i
]);
375 show_usage(argc
, argv
);
379 wdelay
= atol(argv
[++i
]);
386 show_usage(argc
, argv
);
390 init_hash_size
= atol(argv
[++i
]);
394 show_usage(argc
, argv
);
398 min_hash_alloc_size
= atol(argv
[++i
]);
402 show_usage(argc
, argv
);
406 max_hash_buckets_size
= atol(argv
[++i
]);
410 printf("Please specify at most one of -s or -u.\n");
417 printf("Please specify at most one of -s or -u.\n");
426 init_populate
= atol(argv
[++i
]);
433 show_usage(argc
, argv
);
438 if (!strcmp("order", argv
[i
]))
439 memory_backend
= &cds_lfht_mm_order
;
440 else if (!strcmp("chunk", argv
[i
]))
441 memory_backend
= &cds_lfht_mm_chunk
;
442 else if (!strcmp("mmap", argv
[i
]))
443 memory_backend
= &cds_lfht_mm_mmap
;
445 printf("Please specify memory backend with order|chunk|mmap.\n");
451 lookup_pool_offset
= atol(argv
[++i
]);
454 write_pool_offset
= atol(argv
[++i
]);
457 init_pool_offset
= atol(argv
[++i
]);
460 lookup_pool_size
= atol(argv
[++i
]);
463 write_pool_size
= atol(argv
[++i
]);
466 init_pool_size
= atol(argv
[++i
]);
472 test_choice
= TEST_HASH_UNIQUE
;
475 nr_hash_chains
= atol(argv
[++i
]);
480 /* Check if hash size is power of 2 */
481 if (init_hash_size
&& init_hash_size
& (init_hash_size
- 1)) {
482 printf("Error: Initial number of buckets (%lu) is not a power of 2.\n",
488 if (min_hash_alloc_size
&& min_hash_alloc_size
& (min_hash_alloc_size
- 1)) {
489 printf("Error: Minimum number of allocated buckets (%lu) is not a power of 2.\n",
490 min_hash_alloc_size
);
495 if (max_hash_buckets_size
&& max_hash_buckets_size
& (max_hash_buckets_size
- 1)) {
496 printf("Error: Maximum number of buckets (%lu) is not a power of 2.\n",
497 max_hash_buckets_size
);
502 memset(&act
, 0, sizeof(act
));
503 ret
= sigemptyset(&act
.sa_mask
);
505 perror("sigemptyset");
509 act
.sa_handler
= get_sigusr1_cb();
510 act
.sa_flags
= SA_RESTART
;
511 ret
= sigaction(SIGUSR1
, &act
, NULL
);
518 act
.sa_handler
= get_sigusr2_cb();
519 act
.sa_flags
= SA_RESTART
;
520 ret
= sigaction(SIGUSR2
, &act
, NULL
);
527 printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
528 duration
, nr_readers
, nr_writers
);
529 printf_verbose("Writer delay : %lu loops.\n", wdelay
);
530 printf_verbose("Reader duration : %lu loops.\n", rduration
);
531 printf_verbose("Mode:%s%s.\n",
532 add_only
? " add only" : " add/remove",
533 add_unique
? " uniquify" : ( add_replace
? " replace" : " insert"));
534 printf_verbose("Initial number of buckets: %lu buckets.\n", init_hash_size
);
535 printf_verbose("Minimum number of allocated buckets: %lu buckets.\n", min_hash_alloc_size
);
536 printf_verbose("Maximum number of buckets: %lu buckets.\n", max_hash_buckets_size
);
537 printf_verbose("Init pool size offset %lu size %lu.\n",
538 init_pool_offset
, init_pool_size
);
539 printf_verbose("Lookup pool size offset %lu size %lu.\n",
540 lookup_pool_offset
, lookup_pool_size
);
541 printf_verbose("Update pool size offset %lu size %lu.\n",
542 write_pool_offset
, write_pool_size
);
543 printf_verbose("Number of hash chains: %lu.\n",
545 printf_verbose("thread %-6s, tid %lu\n",
546 "main", urcu_get_thread_id());
548 tid_reader
= calloc(nr_readers
, sizeof(*tid_reader
));
553 tid_writer
= calloc(nr_writers
, sizeof(*tid_writer
));
556 goto end_free_tid_reader
;
558 count_reader
= calloc(nr_readers
, sizeof(*count_reader
));
561 goto end_free_tid_writer
;
563 count_writer
= calloc(nr_writers
, sizeof(*count_writer
));
566 goto end_free_count_reader
;
569 err
= create_all_cpu_call_rcu_data(0);
571 printf("Per-CPU call_rcu() worker threads unavailable. Using default global worker thread.\n");
574 if (memory_backend
) {
575 test_ht
= _cds_lfht_new(init_hash_size
, min_hash_alloc_size
,
576 max_hash_buckets_size
,
577 (opt_auto_resize
? CDS_LFHT_AUTO_RESIZE
: 0) |
578 CDS_LFHT_ACCOUNTING
, memory_backend
,
581 test_ht
= cds_lfht_new(init_hash_size
, min_hash_alloc_size
,
582 max_hash_buckets_size
,
583 (opt_auto_resize
? CDS_LFHT_AUTO_RESIZE
: 0) |
584 CDS_LFHT_ACCOUNTING
, NULL
);
587 printf("Error allocating hash table.\n");
589 goto end_free_call_rcu_data
;
593 * Hash Population needs to be seen as a RCU reader
594 * thread from the point of view of resize.
596 rcu_register_thread();
597 ret
= (get_populate_hash_cb())();
600 rcu_thread_offline();
604 ret
= pipe(count_pipe
);
611 /* spawn counter thread */
612 err
= pthread_create(&tid_count
, NULL
, thr_count
,
617 perror("pthread_create");
621 for (i
= 0; i
< nr_readers
; i
++) {
622 err
= pthread_create(&tid_reader
[i
],
623 NULL
, get_thr_reader_cb(),
628 perror("pthread_create");
629 goto end_pthread_join
;
631 nr_readers_created
++;
633 for (i
= 0; i
< nr_writers
; i
++) {
634 err
= pthread_create(&tid_writer
[i
],
635 NULL
, get_thr_writer_cb(),
640 perror("pthread_create");
641 goto end_pthread_join
;
643 nr_writers_created
++;
652 remain
= sleep(remain
);
653 } while (remain
> 0);
658 for (i
= 0; i
< nr_readers_created
; i
++) {
659 err
= pthread_join(tid_reader
[i
], &tret
);
663 perror("pthread_join");
665 tot_reads
+= count_reader
[i
];
667 for (i
= 0; i
< nr_writers_created
; i
++) {
668 err
= pthread_join(tid_writer
[i
], &tret
);
672 perror("pthread_join");
674 tot_writes
+= count_writer
[i
].update_ops
;
675 tot_add
+= count_writer
[i
].add
;
676 tot_add_exist
+= count_writer
[i
].add_exist
;
677 tot_remove
+= count_writer
[i
].remove
;
680 /* teardown counter thread */
681 act
.sa_handler
= SIG_IGN
;
682 act
.sa_flags
= SA_RESTART
;
683 ret
= sigaction(SIGUSR2
, &act
, NULL
);
689 char msg
[1] = { 0x42 };
693 ret
= write(count_pipe
[1], msg
, 1); /* wakeup thread */
694 } while (ret
== -1L && errno
== EINTR
);
696 err
= pthread_join(tid_count
, &tret
);
700 perror("pthread_join");
704 for (i
= 0; i
< 2; i
++) {
705 err
= close(count_pipe
[i
]);
708 perror("close pipe");
715 printf("Counting nodes... ");
716 cds_lfht_count_nodes(test_ht
, &approx_before
, &count
, &approx_after
);
718 test_delete_all_nodes(test_ht
);
720 rcu_thread_offline();
722 printf("Approximation before node accounting: %ld nodes.\n",
724 printf("Nodes deleted from hash table before destroy: "
727 printf("Approximation after node accounting: %ld nodes.\n",
731 ret
= cds_lfht_destroy(test_ht
, NULL
);
733 printf_verbose("final delete aborted\n");
736 printf_verbose("final delete success\n");
738 printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads
,
740 nr_leaked
= (long long) tot_add
+ init_populate
- tot_remove
- count
;
741 printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu "
743 "wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu "
744 "nr_add %12llu nr_add_fail %12llu nr_remove %12llu nr_leaked %12lld\n",
745 argv
[0], duration
, nr_readers
, rduration
,
746 nr_writers
, wdelay
, tot_reads
, tot_writes
,
747 tot_reads
+ tot_writes
, tot_add
, tot_add_exist
, tot_remove
,
749 if (nr_leaked
!= 0) {
751 printf("WARNING: %lld nodes were leaked!\n", nr_leaked
);
754 rcu_unregister_thread();
755 end_free_call_rcu_data
:
756 free_all_cpu_call_rcu_data();
758 end_free_count_reader
: