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"
25 enum urcu_hash_addremove
{
29 }; /* 1: add, -1 remove, 0: random */
31 static enum urcu_hash_addremove addremove
; /* 1: add, -1 remove, 0: random */
33 void test_hash_rw_sigusr1_handler(int signo
__attribute__((unused
)))
37 printf("Add/Remove: random.\n");
38 addremove
= AR_RANDOM
;
41 printf("Add/Remove: remove only.\n");
42 addremove
= AR_REMOVE
;
45 printf("Add/Remove: add only.\n");
51 void test_hash_rw_sigusr2_handler(int signo
__attribute__((unused
)))
53 char msg
[1] = { 0x42 };
57 ret
= write(count_pipe
[1], msg
, 1); /* wakeup thread */
58 } while (ret
== -1L && errno
== EINTR
);
61 void *test_hash_rw_thr_reader(void *_count
)
63 unsigned long long *count
= _count
;
64 struct lfht_test_node
*node
;
65 struct cds_lfht_iter iter
;
67 printf_verbose("thread_begin %s, tid %lu\n",
68 "reader", urcu_get_thread_id());
70 URCU_TLS(rand_lookup
) = urcu_get_thread_id() ^ time(NULL
);
74 rcu_register_thread();
83 cds_lfht_test_lookup(test_ht
,
84 (void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % lookup_pool_size
) + lookup_pool_offset
),
85 sizeof(void *), &iter
);
86 node
= cds_lfht_iter_get_test_node(&iter
);
88 if (validate_lookup
) {
89 printf("[ERROR] Lookup cannot find initial node.\n");
92 URCU_TLS(lookup_fail
)++;
94 URCU_TLS(lookup_ok
)++;
96 rcu_debug_yield_read();
97 if (caa_unlikely(rduration
))
98 loop_sleep(rduration
);
100 URCU_TLS(nr_reads
)++;
101 if (caa_unlikely(!test_duration_read()))
103 if (caa_unlikely((URCU_TLS(nr_reads
) & ((1 << 10) - 1)) == 0))
104 rcu_quiescent_state();
107 rcu_unregister_thread();
109 *count
= URCU_TLS(nr_reads
);
110 printf_verbose("thread_end %s, tid %lu\n",
111 "reader", urcu_get_thread_id());
112 printf_verbose("read tid : %lx, lookupfail %lu, lookupok %lu\n",
113 urcu_get_thread_id(),
114 URCU_TLS(lookup_fail
),
115 URCU_TLS(lookup_ok
));
120 void *test_hash_rw_thr_writer(void *_count
)
122 struct lfht_test_node
*node
;
123 struct cds_lfht_iter iter
;
124 struct wr_count
*count
= _count
;
127 printf_verbose("thread_begin %s, tid %lu\n",
128 "writer", urcu_get_thread_id());
130 URCU_TLS(rand_lookup
) = urcu_get_thread_id() ^ time(NULL
);
134 rcu_register_thread();
142 struct cds_lfht_node
*ret_node
= NULL
;
144 if ((addremove
== AR_ADD
|| add_only
)
145 || (addremove
== AR_RANDOM
&& rand_r(&URCU_TLS(rand_lookup
)) & 1)) {
146 node
= malloc(sizeof(struct lfht_test_node
));
147 lfht_test_node_init(node
,
148 (void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % write_pool_size
) + write_pool_offset
),
152 ret_node
= cds_lfht_add_unique(test_ht
,
153 test_hash(node
->key
, node
->key_len
, TEST_HASH_SEED
),
154 test_match
, node
->key
, &node
->node
);
157 ret_node
= cds_lfht_add_replace(test_ht
,
158 test_hash(node
->key
, node
->key_len
, TEST_HASH_SEED
),
159 test_match
, node
->key
, &node
->node
);
161 cds_lfht_add(test_ht
,
162 test_hash(node
->key
, node
->key_len
, TEST_HASH_SEED
),
166 if (add_unique
&& ret_node
!= &node
->node
) {
168 URCU_TLS(nr_addexist
)++;
170 if (add_replace
&& ret_node
) {
171 call_rcu(&to_test_node(ret_node
)->head
,
173 URCU_TLS(nr_addexist
)++;
181 cds_lfht_test_lookup(test_ht
,
182 (void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % write_pool_size
) + write_pool_offset
),
183 sizeof(void *), &iter
);
184 ret
= cds_lfht_del(test_ht
, cds_lfht_iter_get_node(&iter
));
187 node
= cds_lfht_iter_get_test_node(&iter
);
188 call_rcu(&node
->head
, free_node_cb
);
191 URCU_TLS(nr_delnoent
)++;
194 //if (URCU_TLS(nr_writes) % 100000 == 0) {
195 if (URCU_TLS(nr_writes
) % 1000 == 0) {
197 if (rand_r(&URCU_TLS(rand_lookup
)) & 1) {
198 ht_resize(test_ht
, 1);
200 ht_resize(test_ht
, -1);
205 URCU_TLS(nr_writes
)++;
206 if (caa_unlikely(!test_duration_write()))
208 if (caa_unlikely(wdelay
))
210 if (caa_unlikely((URCU_TLS(nr_writes
) & ((1 << 10) - 1)) == 0))
211 rcu_quiescent_state();
214 rcu_unregister_thread();
216 printf_verbose("thread_end %s, tid %lu\n",
217 "writer", urcu_get_thread_id());
218 printf_verbose("info tid %lu: nr_add %lu, nr_addexist %lu, nr_del %lu, "
219 "nr_delnoent %lu\n", urcu_get_thread_id(),
221 URCU_TLS(nr_addexist
),
223 URCU_TLS(nr_delnoent
));
224 count
->update_ops
= URCU_TLS(nr_writes
);
225 count
->add
= URCU_TLS(nr_add
);
226 count
->add_exist
= URCU_TLS(nr_addexist
);
227 count
->remove
= URCU_TLS(nr_del
);
231 int test_hash_rw_populate_hash(void)
233 struct lfht_test_node
*node
;
238 printf("Starting rw test\n");
240 URCU_TLS(rand_lookup
) = urcu_get_thread_id() ^ time(NULL
);
242 if ((add_unique
|| add_replace
) && init_populate
* 10 > init_pool_size
) {
243 printf("WARNING: required to populate %lu nodes (-k), but random "
244 "pool is quite small (%lu values) and we are in add_unique (-u) or add_replace (-s) mode. Try with a "
245 "larger random pool (-p option). This may take a while...\n", init_populate
, init_pool_size
);
248 while (URCU_TLS(nr_add
) < init_populate
) {
249 struct cds_lfht_node
*ret_node
= NULL
;
251 node
= malloc(sizeof(struct lfht_test_node
));
252 lfht_test_node_init(node
,
253 (void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % init_pool_size
) + init_pool_offset
),
257 ret_node
= cds_lfht_add_unique(test_ht
,
258 test_hash(node
->key
, node
->key_len
, TEST_HASH_SEED
),
259 test_match
, node
->key
, &node
->node
);
262 ret_node
= cds_lfht_add_replace(test_ht
,
263 test_hash(node
->key
, node
->key_len
, TEST_HASH_SEED
),
264 test_match
, node
->key
, &node
->node
);
266 cds_lfht_add(test_ht
,
267 test_hash(node
->key
, node
->key_len
, TEST_HASH_SEED
),
271 if (add_unique
&& ret_node
!= &node
->node
) {
273 URCU_TLS(nr_addexist
)++;
275 if (add_replace
&& ret_node
) {
276 call_rcu(&to_test_node(ret_node
)->head
, free_node_cb
);
277 URCU_TLS(nr_addexist
)++;
282 URCU_TLS(nr_writes
)++;