4 * Userspace RCU library - test program
6 * Copyright February 2009 - 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.
28 #include <sys/types.h>
40 #define DEFAULT_HASH_SIZE 32
41 #define DEFAULT_MIN_ALLOC_SIZE 1
42 #define DEFAULT_RAND_POOL 1000000
44 #define TEST_HASH_SEED 0x42UL
46 /* Make this big enough to include the POWER5+ L3 cacheline size of 256B */
47 #define CACHE_LINE_SIZE 4096
49 /* hardcoded number of CPUs */
53 #define poison_free(ptr) \
55 memset(ptr, 0x42, sizeof(*(ptr))); \
59 #define poison_free(ptr) free(ptr)
64 #if defined(_syscall0)
65 _syscall0(pid_t
, gettid
)
66 #elif defined(__NR_gettid)
67 static inline pid_t
gettid(void)
69 return syscall(__NR_gettid
);
72 #warning "use pid as tid"
73 static inline pid_t
gettid(void)
79 #ifndef DYNAMIC_LINK_TEST
82 #define debug_yield_read()
84 #include <urcu-qsbr.h>
85 #include <urcu/rculfhash.h>
86 #include <urcu-call-rcu.h>
89 unsigned long update_ops
;
91 unsigned long add_exist
;
95 static unsigned int __thread rand_lookup
;
96 static unsigned long __thread nr_add
;
97 static unsigned long __thread nr_addexist
;
98 static unsigned long __thread nr_del
;
99 static unsigned long __thread nr_delnoent
;
100 static unsigned long __thread lookup_fail
;
101 static unsigned long __thread lookup_ok
;
103 static struct cds_lfht
*test_ht
;
110 struct lfht_test_node
{
111 struct cds_lfht_node node
;
112 /* cache-cold for iteration */
113 struct rcu_head head
;
116 static inline struct lfht_test_node
*
117 to_test_node(struct cds_lfht_node
*node
)
119 return caa_container_of(node
, struct lfht_test_node
, node
);
123 void lfht_test_node_init(struct lfht_test_node
*node
, void *key
,
126 cds_lfht_node_init(&node
->node
, key
, key_len
);
129 static inline struct lfht_test_node
*
130 cds_lfht_iter_get_test_node(struct cds_lfht_iter
*iter
)
132 return to_test_node(cds_lfht_iter_get_node(iter
));
135 static volatile int test_go
, test_stop
;
137 static unsigned long wdelay
;
139 static unsigned long duration
;
141 /* read-side C.S. duration, in loops */
142 static unsigned long rduration
;
144 static unsigned long init_hash_size
= DEFAULT_HASH_SIZE
;
145 static unsigned long min_hash_alloc_size
= DEFAULT_MIN_ALLOC_SIZE
;
146 static unsigned long init_populate
;
147 static int opt_auto_resize
;
148 static int add_only
, add_unique
, add_replace
;
150 static unsigned long init_pool_offset
, lookup_pool_offset
, write_pool_offset
;
151 static unsigned long init_pool_size
= DEFAULT_RAND_POOL
,
152 lookup_pool_size
= DEFAULT_RAND_POOL
,
153 write_pool_size
= DEFAULT_RAND_POOL
;
154 static int validate_lookup
;
156 static int count_pipe
[2];
158 static inline void loop_sleep(unsigned long l
)
164 static int verbose_mode
;
166 #define printf_verbose(fmt, args...) \
169 printf(fmt, ## args); \
172 static unsigned int cpu_affinities
[NR_CPUS
];
173 static unsigned int next_aff
= 0;
174 static int use_affinity
= 0;
176 pthread_mutex_t affinity_mutex
= PTHREAD_MUTEX_INITIALIZER
;
178 static void set_affinity(void)
187 ret
= pthread_mutex_lock(&affinity_mutex
);
189 perror("Error in pthread mutex lock");
192 cpu
= cpu_affinities
[next_aff
++];
193 ret
= pthread_mutex_unlock(&affinity_mutex
);
195 perror("Error in pthread mutex unlock");
200 sched_setaffinity(0, sizeof(mask
), &mask
);
207 } addremove
; /* 1: add, -1 remove, 0: random */
210 void sigusr1_handler(int signo
)
214 printf("Add/Remove: random.\n");
215 addremove
= AR_RANDOM
;
218 printf("Add/Remove: remove only.\n");
219 addremove
= AR_REMOVE
;
222 printf("Add/Remove: add only.\n");
229 void sigusr2_handler(int signo
)
231 char msg
[1] = { 0x42 };
235 ret
= write(count_pipe
[1], msg
, 1); /* wakeup thread */
236 } while (ret
== -1L && errno
== EINTR
);
240 * returns 0 if test should end.
242 static int test_duration_write(void)
247 static int test_duration_read(void)
252 static unsigned long long __thread nr_writes
;
253 static unsigned long long __thread nr_reads
;
255 static unsigned int nr_readers
;
256 static unsigned int nr_writers
;
258 pthread_mutex_t rcu_copy_mutex
= PTHREAD_MUTEX_INITIALIZER
;
260 void rcu_copy_mutex_lock(void)
263 ret
= pthread_mutex_lock(&rcu_copy_mutex
);
265 perror("Error in pthread mutex lock");
270 void rcu_copy_mutex_unlock(void)
274 ret
= pthread_mutex_unlock(&rcu_copy_mutex
);
276 perror("Error in pthread mutex unlock");
283 * Source: http://burtleburtle.net/bob/c/lookup3.c
284 * Originally Public Domain
287 #define rot(x, k) (((x) << (k)) | ((x) >> (32 - (k))))
289 #define mix(a, b, c) \
291 a -= c; a ^= rot(c, 4); c += b; \
292 b -= a; b ^= rot(a, 6); a += c; \
293 c -= b; c ^= rot(b, 8); b += a; \
294 a -= c; a ^= rot(c, 16); c += b; \
295 b -= a; b ^= rot(a, 19); a += c; \
296 c -= b; c ^= rot(b, 4); b += a; \
299 #define final(a, b, c) \
301 c ^= b; c -= rot(b, 14); \
302 a ^= c; a -= rot(c, 11); \
303 b ^= a; b -= rot(a, 25); \
304 c ^= b; c -= rot(b, 16); \
305 a ^= c; a -= rot(c, 4);\
306 b ^= a; b -= rot(a, 14); \
307 c ^= b; c -= rot(b, 24); \
310 static __attribute__((unused
))
312 const uint32_t *k
, /* the key, an array of uint32_t values */
313 size_t length
, /* the length of the key, in uint32_ts */
314 uint32_t initval
) /* the previous hash, or an arbitrary value */
318 /* Set up the internal state */
319 a
= b
= c
= 0xdeadbeef + (((uint32_t) length
) << 2) + initval
;
321 /*----------------------------------------- handle most of the key */
331 /*----------------------------------- handle the last 3 uint32_t's */
332 switch (length
) { /* all the case statements fall through */
337 case 0: /* case 0: nothing left to add */
340 /*---------------------------------------------- report the result */
346 const uint32_t *k
, /* the key, an array of uint32_t values */
347 size_t length
, /* the length of the key, in uint32_ts */
348 uint32_t *pc
, /* IN: seed OUT: primary hash value */
349 uint32_t *pb
) /* IN: more seed OUT: secondary hash value */
353 /* Set up the internal state */
354 a
= b
= c
= 0xdeadbeef + ((uint32_t) (length
<< 2)) + *pc
;
357 /*----------------------------------------- handle most of the key */
367 /*----------------------------------- handle the last 3 uint32_t's */
368 switch (length
) { /* all the case statements fall through */
373 case 0: /* case 0: nothing left to add */
376 /*---------------------------------------------- report the result */
381 #if (CAA_BITS_PER_LONG == 32)
383 unsigned long test_hash(void *_key
, size_t length
, unsigned long seed
)
385 unsigned int key
= (unsigned int) _key
;
387 assert(length
== sizeof(unsigned int));
388 return hash_u32(&key
, 1, seed
);
392 unsigned long test_hash(void *_key
, size_t length
, unsigned long seed
)
403 assert(length
== sizeof(unsigned long));
404 v
.v64
= (uint64_t) seed
;
405 key
.v64
= (uint64_t) _key
;
406 hashword2(key
.v32
, 2, &v
.v32
[0], &v
.v32
[1]);
412 unsigned long test_compare(void *key1
, size_t key1_len
,
413 void *key2
, size_t key2_len
)
415 if (caa_unlikely(key1_len
!= key2_len
))
417 assert(key1_len
== sizeof(unsigned long));
425 int test_match(struct cds_lfht_node
*node
, void *arg
)
427 return !test_compare(node
->key
, node
->key_len
,
428 arg
, sizeof(unsigned long));
432 void cds_lfht_test_lookup(struct cds_lfht
*ht
, void *key
, size_t key_len
,
433 struct cds_lfht_iter
*iter
)
435 assert(key_len
== sizeof(unsigned long));
437 cds_lfht_lookup(ht
, test_match
,
438 test_hash(key
, key_len
, TEST_HASH_SEED
),
442 void *thr_count(void *arg
)
444 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
445 "counter", pthread_self(), (unsigned long)gettid());
447 rcu_register_thread();
450 unsigned long count
, removed
;
451 long approx_before
, approx_after
;
455 rcu_thread_offline();
456 len
= read(count_pipe
[0], buf
, 1);
458 if (caa_unlikely(!test_duration_read()))
463 printf("Counting nodes... ");
466 cds_lfht_count_nodes(test_ht
, &approx_before
, &count
, &removed
,
470 printf("Approximation before node accounting: %ld nodes.\n",
472 printf("Accounting of nodes in the hash table: "
473 "%lu nodes + %lu logically removed.\n",
475 printf("Approximation after node accounting: %ld nodes.\n",
478 rcu_unregister_thread();
482 void *thr_reader(void *_count
)
484 unsigned long long *count
= _count
;
485 struct lfht_test_node
*node
;
486 struct cds_lfht_iter iter
;
488 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
489 "reader", pthread_self(), (unsigned long)gettid());
493 rcu_register_thread();
502 cds_lfht_test_lookup(test_ht
,
503 (void *)(((unsigned long) rand_r(&rand_lookup
) % lookup_pool_size
) + lookup_pool_offset
),
504 sizeof(void *), &iter
);
505 node
= cds_lfht_iter_get_test_node(&iter
);
507 if (validate_lookup
) {
508 printf("[ERROR] Lookup cannot find initial node.\n");
516 if (caa_unlikely(rduration
))
517 loop_sleep(rduration
);
520 if (caa_unlikely(!test_duration_read()))
522 if (caa_unlikely((nr_reads
& ((1 << 10) - 1)) == 0))
523 rcu_quiescent_state();
526 rcu_unregister_thread();
529 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
530 "reader", pthread_self(), (unsigned long)gettid());
531 printf_verbose("readid : %lx, lookupfail %lu, lookupok %lu\n",
532 pthread_self(), lookup_fail
, lookup_ok
);
538 void free_node_cb(struct rcu_head
*head
)
540 struct lfht_test_node
*node
=
541 caa_container_of(head
, struct lfht_test_node
, head
);
545 void *thr_writer(void *_count
)
547 struct lfht_test_node
*node
;
548 struct cds_lfht_node
*ret_node
;
549 struct cds_lfht_iter iter
;
550 struct wr_count
*count
= _count
;
553 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
554 "writer", pthread_self(), (unsigned long)gettid());
558 rcu_register_thread();
566 if ((addremove
== AR_ADD
|| add_only
)
567 || (addremove
== AR_RANDOM
&& rand_r(&rand_lookup
) & 1)) {
568 node
= malloc(sizeof(struct lfht_test_node
));
569 lfht_test_node_init(node
,
570 (void *)(((unsigned long) rand_r(&rand_lookup
) % write_pool_size
) + write_pool_offset
),
574 ret_node
= cds_lfht_add_unique(test_ht
, test_match
,
575 test_hash(node
->node
.key
, node
->node
.key_len
, TEST_HASH_SEED
),
579 ret_node
= cds_lfht_add_replace(test_ht
, test_match
,
580 test_hash(node
->node
.key
, node
->node
.key_len
, TEST_HASH_SEED
),
583 cds_lfht_add(test_ht
,
584 test_hash(node
->node
.key
, node
->node
.key_len
, TEST_HASH_SEED
),
588 if (add_unique
&& ret_node
!= &node
->node
) {
592 if (add_replace
&& ret_node
) {
593 call_rcu(&to_test_node(ret_node
)->head
,
603 cds_lfht_test_lookup(test_ht
,
604 (void *)(((unsigned long) rand_r(&rand_lookup
) % write_pool_size
) + write_pool_offset
),
605 sizeof(void *), &iter
);
606 ret
= cds_lfht_del(test_ht
, &iter
);
609 node
= cds_lfht_iter_get_test_node(&iter
);
610 call_rcu(&node
->head
, free_node_cb
);
616 //if (nr_writes % 100000 == 0) {
617 if (nr_writes
% 1000 == 0) {
619 if (rand_r(&rand_lookup
) & 1) {
620 ht_resize(test_ht
, 1);
622 ht_resize(test_ht
, -1);
628 if (caa_unlikely(!test_duration_write()))
630 if (caa_unlikely(wdelay
))
632 if (caa_unlikely((nr_writes
& ((1 << 10) - 1)) == 0))
633 rcu_quiescent_state();
636 rcu_unregister_thread();
638 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
639 "writer", pthread_self(), (unsigned long)gettid());
640 printf_verbose("info id %lx: nr_add %lu, nr_addexist %lu, nr_del %lu, "
641 "nr_delnoent %lu\n", pthread_self(), nr_add
,
642 nr_addexist
, nr_del
, nr_delnoent
);
643 count
->update_ops
= nr_writes
;
645 count
->add_exist
= nr_addexist
;
646 count
->remove
= nr_del
;
650 static int populate_hash(void)
652 struct lfht_test_node
*node
;
653 struct cds_lfht_node
*ret_node
;
658 if ((add_unique
|| add_replace
) && init_populate
* 10 > init_pool_size
) {
659 printf("WARNING: required to populate %lu nodes (-k), but random "
660 "pool is quite small (%lu values) and we are in add_unique (-u) or add_replace (-s) mode. Try with a "
661 "larger random pool (-p option). This may take a while...\n", init_populate
, init_pool_size
);
664 while (nr_add
< init_populate
) {
665 node
= malloc(sizeof(struct lfht_test_node
));
666 lfht_test_node_init(node
,
667 (void *)(((unsigned long) rand_r(&rand_lookup
) % init_pool_size
) + init_pool_offset
),
671 ret_node
= cds_lfht_add_unique(test_ht
, test_match
,
672 test_hash(node
->node
.key
, node
->node
.key_len
, TEST_HASH_SEED
),
676 ret_node
= cds_lfht_add_replace(test_ht
, test_match
,
677 test_hash(node
->node
.key
, node
->node
.key_len
, TEST_HASH_SEED
),
680 cds_lfht_add(test_ht
,
681 test_hash(node
->node
.key
, node
->node
.key_len
, TEST_HASH_SEED
),
685 if (add_unique
&& ret_node
!= &node
->node
) {
689 if (add_replace
&& ret_node
) {
690 call_rcu(&to_test_node(ret_node
)->head
, free_node_cb
);
702 void test_delete_all_nodes(struct cds_lfht
*ht
)
704 struct cds_lfht_iter iter
;
705 struct lfht_test_node
*node
;
706 unsigned long count
= 0;
708 cds_lfht_first(ht
, &iter
);
709 while ((node
= cds_lfht_iter_get_test_node(&iter
)) != NULL
) {
712 ret
= cds_lfht_del(test_ht
, &iter
);
714 call_rcu(&node
->head
, free_node_cb
);
715 cds_lfht_next(ht
, &iter
);
718 printf("deleted %lu nodes.\n", count
);
721 void show_usage(int argc
, char **argv
)
723 printf("Usage : %s nr_readers nr_writers duration (s)\n", argv
[0]);
725 printf(" [-r] [-w] (yield reader and/or writer)\n");
727 printf(" [-d delay] (writer period (us))\n");
728 printf(" [-c duration] (reader C.S. duration (in loops))\n");
729 printf(" [-v] (verbose output)\n");
730 printf(" [-a cpu#] [-a cpu#]... (affinity)\n");
731 printf(" [-h size] (initial hash table size)\n");
732 printf(" [-m size] (minimum hash alloc size)\n");
733 printf(" [not -u nor -s] Add entries (supports redundant keys).\n");
734 printf(" [-u] Uniquify add (no redundant keys).\n");
735 printf(" [-s] Replace (swap) entries.\n");
736 printf(" [-i] Add only (no removal).\n");
737 printf(" [-k nr_nodes] Number of nodes to insert initially.\n");
738 printf(" [-A] Automatically resize hash table.\n");
739 printf(" [-R offset] Lookup pool offset.\n");
740 printf(" [-S offset] Write pool offset.\n");
741 printf(" [-T offset] Init pool offset.\n");
742 printf(" [-M size] Lookup pool size.\n");
743 printf(" [-N size] Write pool size.\n");
744 printf(" [-O size] Init pool size.\n");
745 printf(" [-V] Validate lookups of init values (use with filled init pool, same lookup range, with different write range).\n");
749 int main(int argc
, char **argv
)
752 pthread_t
*tid_reader
, *tid_writer
;
755 unsigned long long *count_reader
;
756 struct wr_count
*count_writer
;
757 unsigned long long tot_reads
= 0, tot_writes
= 0,
758 tot_add
= 0, tot_add_exist
= 0, tot_remove
= 0;
759 unsigned long count
, removed
;
760 long approx_before
, approx_after
;
762 struct sigaction act
;
766 show_usage(argc
, argv
);
770 err
= sscanf(argv
[1], "%u", &nr_readers
);
772 show_usage(argc
, argv
);
776 err
= sscanf(argv
[2], "%u", &nr_writers
);
778 show_usage(argc
, argv
);
782 err
= sscanf(argv
[3], "%lu", &duration
);
784 show_usage(argc
, argv
);
788 for (i
= 4; i
< argc
; i
++) {
789 if (argv
[i
][0] != '-')
791 switch (argv
[i
][1]) {
794 yield_active
|= YIELD_READ
;
797 yield_active
|= YIELD_WRITE
;
802 show_usage(argc
, argv
);
806 cpu_affinities
[next_aff
++] = a
;
808 printf_verbose("Adding CPU %d affinity\n", a
);
812 show_usage(argc
, argv
);
815 rduration
= atol(argv
[++i
]);
819 show_usage(argc
, argv
);
822 wdelay
= atol(argv
[++i
]);
829 show_usage(argc
, argv
);
832 init_hash_size
= atol(argv
[++i
]);
836 show_usage(argc
, argv
);
839 min_hash_alloc_size
= atol(argv
[++i
]);
843 printf("Please specify at most one of -s or -u.\n");
850 printf("Please specify at most one of -s or -u.\n");
859 init_populate
= atol(argv
[++i
]);
865 lookup_pool_offset
= atol(argv
[++i
]);
868 write_pool_offset
= atol(argv
[++i
]);
871 init_pool_offset
= atol(argv
[++i
]);
874 lookup_pool_size
= atol(argv
[++i
]);
877 write_pool_size
= atol(argv
[++i
]);
880 init_pool_size
= atol(argv
[++i
]);
889 /* Check if hash size is power of 2 */
890 if (init_hash_size
&& init_hash_size
& (init_hash_size
- 1)) {
891 printf("Error: Hash table size %lu is not a power of 2.\n",
896 if (min_hash_alloc_size
&& min_hash_alloc_size
* (min_hash_alloc_size
- 1)) {
897 printf("Error: Min hash alloc size %lu is not a power of 2.\n",
898 min_hash_alloc_size
);
902 memset(&act
, 0, sizeof(act
));
903 ret
= sigemptyset(&act
.sa_mask
);
905 perror("sigemptyset");
908 act
.sa_handler
= sigusr1_handler
;
909 act
.sa_flags
= SA_RESTART
;
910 ret
= sigaction(SIGUSR1
, &act
, NULL
);
916 ret
= pipe(count_pipe
);
922 /* spawn counter thread */
923 err
= pthread_create(&tid_count
, NULL
, thr_count
,
928 act
.sa_handler
= sigusr2_handler
;
929 act
.sa_flags
= SA_RESTART
;
930 ret
= sigaction(SIGUSR2
, &act
, NULL
);
936 printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
937 duration
, nr_readers
, nr_writers
);
938 printf_verbose("Writer delay : %lu loops.\n", wdelay
);
939 printf_verbose("Reader duration : %lu loops.\n", rduration
);
940 printf_verbose("Mode:%s%s.\n",
941 add_only
? " add only" : " add/remove",
942 add_unique
? " uniquify" : ( add_replace
? " replace" : " insert"));
943 printf_verbose("Initial hash table size: %lu buckets.\n", init_hash_size
);
944 printf_verbose("Minimum hash alloc size: %lu buckets.\n", min_hash_alloc_size
);
945 printf_verbose("Init pool size offset %lu size %lu.\n",
946 init_pool_offset
, init_pool_size
);
947 printf_verbose("Lookup pool size offset %lu size %lu.\n",
948 lookup_pool_offset
, lookup_pool_size
);
949 printf_verbose("Update pool size offset %lu size %lu.\n",
950 write_pool_offset
, write_pool_size
);
951 printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
952 "main", pthread_self(), (unsigned long)gettid());
954 tid_reader
= malloc(sizeof(*tid_reader
) * nr_readers
);
955 tid_writer
= malloc(sizeof(*tid_writer
) * nr_writers
);
956 count_reader
= malloc(sizeof(*count_reader
) * nr_readers
);
957 count_writer
= malloc(sizeof(*count_writer
) * nr_writers
);
959 err
= create_all_cpu_call_rcu_data(0);
963 * Hash creation and population needs to be seen as a RCU reader
964 * thread from the point of view of resize.
966 rcu_register_thread();
967 test_ht
= cds_lfht_new(init_hash_size
, min_hash_alloc_size
,
968 (opt_auto_resize
? CDS_LFHT_AUTO_RESIZE
: 0) |
969 CDS_LFHT_ACCOUNTING
, NULL
);
970 ret
= populate_hash();
973 rcu_thread_offline();
977 for (i
= 0; i
< nr_readers
; i
++) {
978 err
= pthread_create(&tid_reader
[i
], NULL
, thr_reader
,
983 for (i
= 0; i
< nr_writers
; i
++) {
984 err
= pthread_create(&tid_writer
[i
], NULL
, thr_writer
,
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
;
1017 /* teardown counter thread */
1018 act
.sa_handler
= SIG_IGN
;
1019 act
.sa_flags
= SA_RESTART
;
1020 ret
= sigaction(SIGUSR2
, &act
, NULL
);
1022 perror("sigaction");
1026 char msg
[1] = { 0x42 };
1030 ret
= write(count_pipe
[1], msg
, 1); /* wakeup thread */
1031 } while (ret
== -1L && errno
== EINTR
);
1033 err
= pthread_join(tid_count
, &tret
);
1038 rcu_thread_online();
1040 printf("Counting nodes... ");
1041 cds_lfht_count_nodes(test_ht
, &approx_before
, &count
, &removed
,
1044 test_delete_all_nodes(test_ht
);
1046 rcu_thread_offline();
1047 if (count
|| removed
) {
1048 printf("Approximation before node accounting: %ld nodes.\n",
1050 printf("Nodes deleted from hash table before destroy: "
1051 "%lu nodes + %lu logically removed.\n",
1053 printf("Approximation after node accounting: %ld nodes.\n",
1056 ret
= cds_lfht_destroy(test_ht
, NULL
);
1058 printf_verbose("final delete aborted\n");
1060 printf_verbose("final delete success\n");
1061 printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads
,
1063 printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu "
1065 "wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu "
1066 "nr_add %12llu nr_add_fail %12llu nr_remove %12llu nr_leaked %12lld\n",
1067 argv
[0], duration
, nr_readers
, rduration
,
1068 nr_writers
, wdelay
, tot_reads
, tot_writes
,
1069 tot_reads
+ tot_writes
, tot_add
, tot_add_exist
, tot_remove
,
1070 (long long) tot_add
+ init_populate
- tot_remove
- count
);
1071 rcu_unregister_thread();
1072 free_all_cpu_call_rcu_data();