1 // SPDX-FileCopyrightText: 2009-2012 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
3 // SPDX-License-Identifier: GPL-2.0-or-later
6 * Userspace RCU library - test program
9 #include "test_urcu_hash.h"
11 enum urcu_hash_addremove
{
15 }; /* 1: add, -1 remove, 0: random */
17 static enum urcu_hash_addremove addremove
; /* 1: add, -1 remove, 0: random */
19 void test_hash_unique_sigusr1_handler(int signo
__attribute__((unused
)))
23 printf("Add/Remove: random.\n");
24 addremove
= AR_RANDOM
;
27 printf("Add/Remove: remove only.\n");
28 addremove
= AR_REMOVE
;
31 printf("Add/Remove: add only.\n");
37 void test_hash_unique_sigusr2_handler(int signo
__attribute__((unused
)))
39 char msg
[1] = { 0x42 };
43 ret
= write(count_pipe
[1], msg
, 1); /* wakeup thread */
44 } while (ret
== -1L && errno
== EINTR
);
47 void *test_hash_unique_thr_reader(void *_count
)
49 unsigned long long *count
= _count
;
51 printf_verbose("thread_begin %s, tid %lu\n",
52 "reader", urcu_get_thread_id());
54 URCU_TLS(rand_lookup
) = urcu_get_thread_id() ^ time(NULL
);
58 rcu_register_thread();
66 struct lfht_test_node
*node
;
67 struct cds_lfht_iter iter
;
69 * iterate on whole table, ensuring that no duplicate is
73 cds_lfht_for_each_entry(test_ht
, &iter
, node
, node
) {
74 struct cds_lfht_iter dup_iter
;
77 cds_lfht_next_duplicate(test_ht
, test_match
,
78 node
->key
, &dup_iter
);
79 if (dup_iter
.node
!= NULL
) {
80 printf("[ERROR] Duplicate key %p found\n", node
->key
);
85 rcu_debug_yield_read();
86 if (caa_unlikely(rduration
))
87 loop_sleep(rduration
);
89 if (caa_unlikely(!test_duration_read()))
91 if (caa_unlikely((URCU_TLS(nr_reads
) & ((1 << 10) - 1)) == 0))
92 rcu_quiescent_state();
95 rcu_unregister_thread();
97 *count
= URCU_TLS(nr_reads
);
98 printf_verbose("thread_end %s, tid %lu\n",
99 "reader", urcu_get_thread_id());
100 printf_verbose("read tid : %lu, lookupfail %lu, lookupok %lu\n",
101 urcu_get_thread_id(), URCU_TLS(lookup_fail
),
102 URCU_TLS(lookup_ok
));
107 void *test_hash_unique_thr_writer(void *_count
)
109 struct lfht_test_node
*node
;
110 struct cds_lfht_node
*ret_node
;
111 struct cds_lfht_iter iter
;
112 struct wr_count
*count
= _count
;
116 printf_verbose("thread_begin %s, tid %lu\n",
117 "writer", urcu_get_thread_id());
119 URCU_TLS(rand_lookup
) = urcu_get_thread_id() ^ time(NULL
);
123 rcu_register_thread();
132 * add unique/add replace with new node key from range.
134 if (1 || (addremove
== AR_ADD
|| add_only
)
135 || (addremove
== AR_RANDOM
&& rand_r(&URCU_TLS(rand_lookup
)) & 1)) {
136 node
= malloc(sizeof(struct lfht_test_node
));
137 lfht_test_node_init(node
,
138 (void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % write_pool_size
) + write_pool_offset
),
141 loc_add_unique
= rand_r(&URCU_TLS(rand_lookup
)) & 1;
142 if (loc_add_unique
) {
143 ret_node
= cds_lfht_add_unique(test_ht
,
144 test_hash(node
->key
, node
->key_len
, TEST_HASH_SEED
),
145 test_match
, node
->key
, &node
->node
);
147 ret_node
= cds_lfht_add_replace(test_ht
,
148 test_hash(node
->key
, node
->key_len
, TEST_HASH_SEED
),
149 test_match
, node
->key
, &node
->node
);
150 #if 0 //generate an error on purpose
151 cds_lfht_add(test_ht
,
152 test_hash(node
->key
, node
->key_len
, TEST_HASH_SEED
),
158 if (loc_add_unique
) {
159 if (ret_node
!= &node
->node
) {
161 URCU_TLS(nr_addexist
)++;
167 call_rcu(&to_test_node(ret_node
)->head
,
169 URCU_TLS(nr_addexist
)++;
177 cds_lfht_test_lookup(test_ht
,
178 (void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % write_pool_size
) + write_pool_offset
),
179 sizeof(void *), &iter
);
180 ret
= cds_lfht_del(test_ht
, cds_lfht_iter_get_node(&iter
));
183 node
= cds_lfht_iter_get_test_node(&iter
);
184 call_rcu(&node
->head
, free_node_cb
);
187 URCU_TLS(nr_delnoent
)++;
190 //if (URCU_TLS(nr_writes) % 100000 == 0) {
191 if (URCU_TLS(nr_writes
) % 1000 == 0) {
193 if (rand_r(&URCU_TLS(rand_lookup
)) & 1) {
194 ht_resize(test_ht
, 1);
196 ht_resize(test_ht
, -1);
201 URCU_TLS(nr_writes
)++;
202 if (caa_unlikely(!test_duration_write()))
204 if (caa_unlikely(wdelay
))
206 if (caa_unlikely((URCU_TLS(nr_writes
) & ((1 << 10) - 1)) == 0))
207 rcu_quiescent_state();
210 rcu_unregister_thread();
212 printf_verbose("thread_end %s, tid %lu\n",
213 "writer", urcu_get_thread_id());
214 printf_verbose("info tid %lu: nr_add %lu, nr_addexist %lu, nr_del %lu, "
215 "nr_delnoent %lu\n", urcu_get_thread_id(),
217 URCU_TLS(nr_addexist
),
219 URCU_TLS(nr_delnoent
));
220 count
->update_ops
= URCU_TLS(nr_writes
);
221 count
->add
= URCU_TLS(nr_add
);
222 count
->add_exist
= URCU_TLS(nr_addexist
);
223 count
->remove
= URCU_TLS(nr_del
);
227 int test_hash_unique_populate_hash(void)
229 struct lfht_test_node
*node
;
230 struct cds_lfht_node
*ret_node
;
232 printf("Starting uniqueness test.\n");
234 URCU_TLS(rand_lookup
) = urcu_get_thread_id() ^ time(NULL
);
239 if (init_populate
* 10 > init_pool_size
) {
240 printf("WARNING: required to populate %lu nodes (-k), but random "
241 "pool is quite small (%lu values) and we are in add_unique (-u) or add_replace (-s) mode. Try with a "
242 "larger random pool (-p option). This may take a while...\n", init_populate
, init_pool_size
);
245 while (URCU_TLS(nr_add
) < init_populate
) {
246 node
= malloc(sizeof(struct lfht_test_node
));
247 lfht_test_node_init(node
,
248 (void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % init_pool_size
) + init_pool_offset
),
251 ret_node
= cds_lfht_add_replace(test_ht
,
252 test_hash(node
->key
, node
->key_len
, TEST_HASH_SEED
),
253 test_match
, node
->key
, &node
->node
);
256 call_rcu(&to_test_node(ret_node
)->head
, free_node_cb
);
257 URCU_TLS(nr_addexist
)++;
261 URCU_TLS(nr_writes
)++;