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_hash.h"
26 enum urcu_hash_addremove
{
30 }; /* 1: add, -1 remove, 0: random */
32 static enum urcu_hash_addremove addremove
; /* 1: add, -1 remove, 0: random */
34 void test_hash_rw_sigusr1_handler(int signo
)
38 printf("Add/Remove: random.\n");
39 addremove
= AR_RANDOM
;
42 printf("Add/Remove: remove only.\n");
43 addremove
= AR_REMOVE
;
46 printf("Add/Remove: add only.\n");
52 void test_hash_rw_sigusr2_handler(int signo
)
54 char msg
[1] = { 0x42 };
58 ret
= write(count_pipe
[1], msg
, 1); /* wakeup thread */
59 } while (ret
== -1L && errno
== EINTR
);
62 void *test_hash_rw_thr_reader(void *_count
)
64 unsigned long long *count
= _count
;
65 struct lfht_test_node
*node
;
66 struct cds_lfht_iter iter
;
68 printf_verbose("thread_begin %s, tid %lu\n",
69 "reader", urcu_get_thread_id());
71 URCU_TLS(rand_lookup
) = urcu_get_thread_id() ^ time(NULL
);
75 rcu_register_thread();
84 cds_lfht_test_lookup(test_ht
,
85 (void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % lookup_pool_size
) + lookup_pool_offset
),
86 sizeof(void *), &iter
);
87 node
= cds_lfht_iter_get_test_node(&iter
);
89 if (validate_lookup
) {
90 printf("[ERROR] Lookup cannot find initial node.\n");
93 URCU_TLS(lookup_fail
)++;
95 URCU_TLS(lookup_ok
)++;
97 rcu_debug_yield_read();
98 if (caa_unlikely(rduration
))
99 loop_sleep(rduration
);
101 URCU_TLS(nr_reads
)++;
102 if (caa_unlikely(!test_duration_read()))
104 if (caa_unlikely((URCU_TLS(nr_reads
) & ((1 << 10) - 1)) == 0))
105 rcu_quiescent_state();
108 rcu_unregister_thread();
110 *count
= URCU_TLS(nr_reads
);
111 printf_verbose("thread_end %s, tid %lu\n",
112 "reader", urcu_get_thread_id());
113 printf_verbose("read tid : %lx, lookupfail %lu, lookupok %lu\n",
114 urcu_get_thread_id(),
115 URCU_TLS(lookup_fail
),
116 URCU_TLS(lookup_ok
));
121 void *test_hash_rw_thr_writer(void *_count
)
123 struct lfht_test_node
*node
;
124 struct cds_lfht_iter iter
;
125 struct wr_count
*count
= _count
;
128 printf_verbose("thread_begin %s, tid %lu\n",
129 "writer", urcu_get_thread_id());
131 URCU_TLS(rand_lookup
) = urcu_get_thread_id() ^ time(NULL
);
135 rcu_register_thread();
143 struct cds_lfht_node
*ret_node
= NULL
;
145 if ((addremove
== AR_ADD
|| add_only
)
146 || (addremove
== AR_RANDOM
&& rand_r(&URCU_TLS(rand_lookup
)) & 1)) {
147 node
= malloc(sizeof(struct lfht_test_node
));
148 lfht_test_node_init(node
,
149 (void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % write_pool_size
) + write_pool_offset
),
153 ret_node
= cds_lfht_add_unique(test_ht
,
154 test_hash(node
->key
, node
->key_len
, TEST_HASH_SEED
),
155 test_match
, node
->key
, &node
->node
);
158 ret_node
= cds_lfht_add_replace(test_ht
,
159 test_hash(node
->key
, node
->key_len
, TEST_HASH_SEED
),
160 test_match
, node
->key
, &node
->node
);
162 cds_lfht_add(test_ht
,
163 test_hash(node
->key
, node
->key_len
, TEST_HASH_SEED
),
167 if (add_unique
&& ret_node
!= &node
->node
) {
169 URCU_TLS(nr_addexist
)++;
171 if (add_replace
&& ret_node
) {
172 call_rcu(&to_test_node(ret_node
)->head
,
174 URCU_TLS(nr_addexist
)++;
182 cds_lfht_test_lookup(test_ht
,
183 (void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % write_pool_size
) + write_pool_offset
),
184 sizeof(void *), &iter
);
185 ret
= cds_lfht_del(test_ht
, cds_lfht_iter_get_node(&iter
));
188 node
= cds_lfht_iter_get_test_node(&iter
);
189 call_rcu(&node
->head
, free_node_cb
);
192 URCU_TLS(nr_delnoent
)++;
195 //if (URCU_TLS(nr_writes) % 100000 == 0) {
196 if (URCU_TLS(nr_writes
) % 1000 == 0) {
198 if (rand_r(&URCU_TLS(rand_lookup
)) & 1) {
199 ht_resize(test_ht
, 1);
201 ht_resize(test_ht
, -1);
206 URCU_TLS(nr_writes
)++;
207 if (caa_unlikely(!test_duration_write()))
209 if (caa_unlikely(wdelay
))
211 if (caa_unlikely((URCU_TLS(nr_writes
) & ((1 << 10) - 1)) == 0))
212 rcu_quiescent_state();
215 rcu_unregister_thread();
217 printf_verbose("thread_end %s, tid %lu\n",
218 "writer", urcu_get_thread_id());
219 printf_verbose("info tid %lu: nr_add %lu, nr_addexist %lu, nr_del %lu, "
220 "nr_delnoent %lu\n", urcu_get_thread_id(),
222 URCU_TLS(nr_addexist
),
224 URCU_TLS(nr_delnoent
));
225 count
->update_ops
= URCU_TLS(nr_writes
);
226 count
->add
= URCU_TLS(nr_add
);
227 count
->add_exist
= URCU_TLS(nr_addexist
);
228 count
->remove
= URCU_TLS(nr_del
);
232 int test_hash_rw_populate_hash(void)
234 struct lfht_test_node
*node
;
239 printf("Starting rw test\n");
241 URCU_TLS(rand_lookup
) = urcu_get_thread_id() ^ time(NULL
);
243 if ((add_unique
|| add_replace
) && init_populate
* 10 > init_pool_size
) {
244 printf("WARNING: required to populate %lu nodes (-k), but random "
245 "pool is quite small (%lu values) and we are in add_unique (-u) or add_replace (-s) mode. Try with a "
246 "larger random pool (-p option). This may take a while...\n", init_populate
, init_pool_size
);
249 while (URCU_TLS(nr_add
) < init_populate
) {
250 struct cds_lfht_node
*ret_node
= NULL
;
252 node
= malloc(sizeof(struct lfht_test_node
));
253 lfht_test_node_init(node
,
254 (void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % init_pool_size
) + init_pool_offset
),
258 ret_node
= cds_lfht_add_unique(test_ht
,
259 test_hash(node
->key
, node
->key_len
, TEST_HASH_SEED
),
260 test_match
, node
->key
, &node
->node
);
263 ret_node
= cds_lfht_add_replace(test_ht
,
264 test_hash(node
->key
, node
->key_len
, TEST_HASH_SEED
),
265 test_match
, node
->key
, &node
->node
);
267 cds_lfht_add(test_ht
,
268 test_hash(node
->key
, node
->key_len
, TEST_HASH_SEED
),
272 if (add_unique
&& ret_node
!= &node
->node
) {
274 URCU_TLS(nr_addexist
)++;
276 if (add_replace
&& ret_node
) {
277 call_rcu(&to_test_node(ret_node
)->head
, free_node_cb
);
278 URCU_TLS(nr_addexist
)++;
283 URCU_TLS(nr_writes
)++;