2 * test_urcu_hash_unique.c
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_unique_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_unique_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_unique_thr_reader(void *_count
)
64 unsigned long long *count
= _count
;
66 printf_verbose("thread_begin %s, tid %lu\n",
67 "reader", urcu_get_thread_id());
69 URCU_TLS(rand_lookup
) = urcu_get_thread_id() ^ time(NULL
);
73 rcu_register_thread();
81 struct lfht_test_node
*node
;
82 struct cds_lfht_iter iter
;
84 * iterate on whole table, ensuring that no duplicate is
88 cds_lfht_for_each_entry(test_ht
, &iter
, node
, node
) {
89 struct cds_lfht_iter dup_iter
;
92 cds_lfht_next_duplicate(test_ht
, test_match
,
93 node
->key
, &dup_iter
);
94 if (dup_iter
.node
!= NULL
) {
95 printf("[ERROR] Duplicate key %p found\n", node
->key
);
100 rcu_debug_yield_read();
101 if (caa_unlikely(rduration
))
102 loop_sleep(rduration
);
103 URCU_TLS(nr_reads
)++;
104 if (caa_unlikely(!test_duration_read()))
106 if (caa_unlikely((URCU_TLS(nr_reads
) & ((1 << 10) - 1)) == 0))
107 rcu_quiescent_state();
110 rcu_unregister_thread();
112 *count
= URCU_TLS(nr_reads
);
113 printf_verbose("thread_end %s, tid %lu\n",
114 "reader", urcu_get_thread_id());
115 printf_verbose("read tid : %lu, lookupfail %lu, lookupok %lu\n",
116 urcu_get_thread_id(), URCU_TLS(lookup_fail
),
117 URCU_TLS(lookup_ok
));
122 void *test_hash_unique_thr_writer(void *_count
)
124 struct lfht_test_node
*node
;
125 struct cds_lfht_node
*ret_node
;
126 struct cds_lfht_iter iter
;
127 struct wr_count
*count
= _count
;
131 printf_verbose("thread_begin %s, tid %lu\n",
132 "writer", urcu_get_thread_id());
134 URCU_TLS(rand_lookup
) = urcu_get_thread_id() ^ time(NULL
);
138 rcu_register_thread();
147 * add unique/add replace with new node key from range.
149 if (1 || (addremove
== AR_ADD
|| add_only
)
150 || (addremove
== AR_RANDOM
&& rand_r(&URCU_TLS(rand_lookup
)) & 1)) {
151 node
= malloc(sizeof(struct lfht_test_node
));
152 lfht_test_node_init(node
,
153 (void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % write_pool_size
) + write_pool_offset
),
156 loc_add_unique
= rand_r(&URCU_TLS(rand_lookup
)) & 1;
157 if (loc_add_unique
) {
158 ret_node
= cds_lfht_add_unique(test_ht
,
159 test_hash(node
->key
, node
->key_len
, TEST_HASH_SEED
),
160 test_match
, node
->key
, &node
->node
);
162 ret_node
= cds_lfht_add_replace(test_ht
,
163 test_hash(node
->key
, node
->key_len
, TEST_HASH_SEED
),
164 test_match
, node
->key
, &node
->node
);
165 #if 0 //generate an error on purpose
166 cds_lfht_add(test_ht
,
167 test_hash(node
->key
, node
->key_len
, TEST_HASH_SEED
),
173 if (loc_add_unique
) {
174 if (ret_node
!= &node
->node
) {
176 URCU_TLS(nr_addexist
)++;
182 call_rcu(&to_test_node(ret_node
)->head
,
184 URCU_TLS(nr_addexist
)++;
192 cds_lfht_test_lookup(test_ht
,
193 (void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % write_pool_size
) + write_pool_offset
),
194 sizeof(void *), &iter
);
195 ret
= cds_lfht_del(test_ht
, cds_lfht_iter_get_node(&iter
));
198 node
= cds_lfht_iter_get_test_node(&iter
);
199 call_rcu(&node
->head
, free_node_cb
);
202 URCU_TLS(nr_delnoent
)++;
205 //if (URCU_TLS(nr_writes) % 100000 == 0) {
206 if (URCU_TLS(nr_writes
) % 1000 == 0) {
208 if (rand_r(&URCU_TLS(rand_lookup
)) & 1) {
209 ht_resize(test_ht
, 1);
211 ht_resize(test_ht
, -1);
216 URCU_TLS(nr_writes
)++;
217 if (caa_unlikely(!test_duration_write()))
219 if (caa_unlikely(wdelay
))
221 if (caa_unlikely((URCU_TLS(nr_writes
) & ((1 << 10) - 1)) == 0))
222 rcu_quiescent_state();
225 rcu_unregister_thread();
227 printf_verbose("thread_end %s, tid %lu\n",
228 "writer", urcu_get_thread_id());
229 printf_verbose("info tid %lu: nr_add %lu, nr_addexist %lu, nr_del %lu, "
230 "nr_delnoent %lu\n", urcu_get_thread_id(),
232 URCU_TLS(nr_addexist
),
234 URCU_TLS(nr_delnoent
));
235 count
->update_ops
= URCU_TLS(nr_writes
);
236 count
->add
= URCU_TLS(nr_add
);
237 count
->add_exist
= URCU_TLS(nr_addexist
);
238 count
->remove
= URCU_TLS(nr_del
);
242 int test_hash_unique_populate_hash(void)
244 struct lfht_test_node
*node
;
245 struct cds_lfht_node
*ret_node
;
247 printf("Starting uniqueness test.\n");
249 URCU_TLS(rand_lookup
) = urcu_get_thread_id() ^ time(NULL
);
254 if (init_populate
* 10 > init_pool_size
) {
255 printf("WARNING: required to populate %lu nodes (-k), but random "
256 "pool is quite small (%lu values) and we are in add_unique (-u) or add_replace (-s) mode. Try with a "
257 "larger random pool (-p option). This may take a while...\n", init_populate
, init_pool_size
);
260 while (URCU_TLS(nr_add
) < init_populate
) {
261 node
= malloc(sizeof(struct lfht_test_node
));
262 lfht_test_node_init(node
,
263 (void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup
)) % init_pool_size
) + init_pool_offset
),
266 ret_node
= cds_lfht_add_replace(test_ht
,
267 test_hash(node
->key
, node
->key_len
, TEST_HASH_SEED
),
268 test_match
, node
->key
, &node
->node
);
271 call_rcu(&to_test_node(ret_node
)->head
, free_node_cb
);
272 URCU_TLS(nr_addexist
)++;
276 URCU_TLS(nr_writes
)++;