Commit | Line | Data |
---|---|---|
18ca7a5b MD |
1 | #ifndef _TEST_URCU_HASH_H |
2 | #define _TEST_URCU_HASH_H | |
3 | ||
4 | /* | |
5 | * test_urcu_hash.h | |
6 | * | |
7 | * Userspace RCU library - test program | |
8 | * | |
9 | * Copyright 2009-2012 - Mathieu Desnoyers <mathieu.desnoyers@polymtl.ca> | |
10 | * | |
11 | * This program is free software; you can redistribute it and/or modify | |
12 | * it under the terms of the GNU General Public License as published by | |
13 | * the Free Software Foundation; either version 2 of the License, or | |
14 | * (at your option) any later version. | |
15 | * | |
16 | * This program is distributed in the hope that it will be useful, | |
17 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
18 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
19 | * GNU General Public License for more details. | |
20 | * | |
21 | * You should have received a copy of the GNU General Public License along | |
22 | * with this program; if not, write to the Free Software Foundation, Inc., | |
23 | * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. | |
24 | */ | |
25 | ||
18ca7a5b MD |
26 | #include <stdio.h> |
27 | #include <pthread.h> | |
28 | #include <stdlib.h> | |
29 | #include <string.h> | |
30 | #include <sys/types.h> | |
31 | #include <sys/wait.h> | |
32 | #include <unistd.h> | |
33 | #include <stdio.h> | |
18ca7a5b MD |
34 | #include <errno.h> |
35 | #include <signal.h> | |
36 | ||
01477510 | 37 | #include <urcu/assert.h> |
bd252a04 | 38 | #include <urcu/tls-compat.h> |
094c8c59 | 39 | #include <compat-rand.h> |
94df6318 | 40 | #include "thread-id.h" |
2650042a | 41 | #include "../common/debug-yield.h" |
18ca7a5b MD |
42 | |
43 | #define DEFAULT_HASH_SIZE 32 | |
44 | #define DEFAULT_MIN_ALLOC_SIZE 1 | |
45 | #define DEFAULT_RAND_POOL 1000000 | |
46 | ||
47 | /* | |
48 | * Note: the hash seed should be a random value for hash tables | |
49 | * targeting production environments to provide protection against | |
50 | * denial of service attacks. We keep it a static value within this test | |
51 | * program to compare identical benchmark runs. | |
52 | */ | |
53 | #define TEST_HASH_SEED 0x42UL | |
54 | ||
18ca7a5b MD |
55 | /* hardcoded number of CPUs */ |
56 | #define NR_CPUS 16384 | |
57 | ||
58 | #ifdef POISON_FREE | |
59 | #define poison_free(ptr) \ | |
60 | do { \ | |
61 | memset(ptr, 0x42, sizeof(*(ptr))); \ | |
62 | free(ptr); \ | |
63 | } while (0) | |
64 | #else | |
65 | #define poison_free(ptr) free(ptr) | |
66 | #endif | |
67 | ||
18ca7a5b MD |
68 | #ifndef DYNAMIC_LINK_TEST |
69 | #define _LGPL_SOURCE | |
70 | #else | |
71 | #define debug_yield_read() | |
72 | #endif | |
73 | #include <urcu-qsbr.h> | |
74 | #include <urcu/rculfhash.h> | |
75 | #include <urcu-call-rcu.h> | |
76 | ||
77 | struct wr_count { | |
78 | unsigned long update_ops; | |
79 | unsigned long add; | |
80 | unsigned long add_exist; | |
81 | unsigned long remove; | |
82 | }; | |
83 | ||
bd252a04 MD |
84 | extern DECLARE_URCU_TLS(unsigned int, rand_lookup); |
85 | extern DECLARE_URCU_TLS(unsigned long, nr_add); | |
86 | extern DECLARE_URCU_TLS(unsigned long, nr_addexist); | |
87 | extern DECLARE_URCU_TLS(unsigned long, nr_del); | |
88 | extern DECLARE_URCU_TLS(unsigned long, nr_delnoent); | |
89 | extern DECLARE_URCU_TLS(unsigned long, lookup_fail); | |
90 | extern DECLARE_URCU_TLS(unsigned long, lookup_ok); | |
18ca7a5b MD |
91 | |
92 | extern struct cds_lfht *test_ht; | |
93 | ||
94 | struct test_data { | |
95 | int a; | |
96 | int b; | |
97 | }; | |
98 | ||
99 | struct lfht_test_node { | |
100 | struct cds_lfht_node node; | |
101 | void *key; | |
102 | unsigned int key_len; | |
103 | /* cache-cold for iteration */ | |
104 | struct rcu_head head; | |
105 | }; | |
106 | ||
107 | static inline struct lfht_test_node * | |
108 | to_test_node(struct cds_lfht_node *node) | |
109 | { | |
110 | return caa_container_of(node, struct lfht_test_node, node); | |
111 | } | |
112 | ||
113 | static inline | |
114 | void lfht_test_node_init(struct lfht_test_node *node, void *key, | |
115 | size_t key_len) | |
116 | { | |
117 | cds_lfht_node_init(&node->node); | |
118 | node->key = key; | |
119 | node->key_len = key_len; | |
120 | } | |
121 | ||
122 | static inline struct lfht_test_node * | |
123 | cds_lfht_iter_get_test_node(struct cds_lfht_iter *iter) | |
124 | { | |
125 | return to_test_node(cds_lfht_iter_get_node(iter)); | |
126 | } | |
127 | ||
128 | extern volatile int test_go, test_stop; | |
129 | ||
130 | extern unsigned long wdelay; | |
131 | ||
132 | extern unsigned long duration; | |
133 | ||
134 | /* read-side C.S. duration, in loops */ | |
135 | extern unsigned long rduration; | |
136 | ||
137 | extern unsigned long init_hash_size; | |
138 | extern unsigned long min_hash_alloc_size; | |
139 | extern unsigned long max_hash_buckets_size; | |
140 | extern unsigned long init_populate; | |
141 | extern int opt_auto_resize; | |
142 | extern int add_only, add_unique, add_replace; | |
143 | extern const struct cds_lfht_mm_type *memory_backend; | |
144 | ||
145 | extern unsigned long init_pool_offset, lookup_pool_offset, write_pool_offset; | |
146 | extern unsigned long init_pool_size, | |
147 | lookup_pool_size, | |
148 | write_pool_size; | |
149 | extern int validate_lookup; | |
150 | ||
495913bf MD |
151 | extern unsigned long nr_hash_chains; |
152 | ||
18ca7a5b MD |
153 | extern int count_pipe[2]; |
154 | ||
ab0aacbe | 155 | static inline void loop_sleep(unsigned long loops) |
18ca7a5b | 156 | { |
ab0aacbe | 157 | while (loops-- != 0) |
18ca7a5b MD |
158 | caa_cpu_relax(); |
159 | } | |
160 | ||
161 | extern int verbose_mode; | |
162 | ||
163 | #define printf_verbose(fmt, args...) \ | |
164 | do { \ | |
165 | if (verbose_mode) \ | |
166 | printf(fmt, ## args); \ | |
167 | } while (0) | |
168 | ||
169 | extern unsigned int cpu_affinities[NR_CPUS]; | |
170 | extern unsigned int next_aff; | |
171 | extern int use_affinity; | |
172 | ||
173 | extern pthread_mutex_t affinity_mutex; | |
174 | ||
18ca7a5b MD |
175 | void set_affinity(void); |
176 | ||
18ca7a5b MD |
177 | /* |
178 | * returns 0 if test should end. | |
179 | */ | |
180 | static inline int test_duration_write(void) | |
181 | { | |
182 | return !test_stop; | |
183 | } | |
184 | ||
185 | static inline int test_duration_read(void) | |
186 | { | |
187 | return !test_stop; | |
188 | } | |
189 | ||
bd252a04 MD |
190 | extern DECLARE_URCU_TLS(unsigned long long, nr_writes); |
191 | extern DECLARE_URCU_TLS(unsigned long long, nr_reads); | |
18ca7a5b MD |
192 | |
193 | extern unsigned int nr_readers; | |
194 | extern unsigned int nr_writers; | |
195 | ||
196 | void rcu_copy_mutex_lock(void); | |
197 | void rcu_copy_mutex_unlock(void); | |
198 | ||
199 | /* | |
200 | * Hash function | |
201 | * Source: http://burtleburtle.net/bob/c/lookup3.c | |
202 | * Originally Public Domain | |
203 | */ | |
204 | ||
205 | #define rot(x, k) (((x) << (k)) | ((x) >> (32 - (k)))) | |
206 | ||
207 | #define mix(a, b, c) \ | |
208 | do { \ | |
209 | a -= c; a ^= rot(c, 4); c += b; \ | |
210 | b -= a; b ^= rot(a, 6); a += c; \ | |
211 | c -= b; c ^= rot(b, 8); b += a; \ | |
212 | a -= c; a ^= rot(c, 16); c += b; \ | |
213 | b -= a; b ^= rot(a, 19); a += c; \ | |
214 | c -= b; c ^= rot(b, 4); b += a; \ | |
215 | } while (0) | |
216 | ||
217 | #define final(a, b, c) \ | |
218 | { \ | |
219 | c ^= b; c -= rot(b, 14); \ | |
220 | a ^= c; a -= rot(c, 11); \ | |
221 | b ^= a; b -= rot(a, 25); \ | |
222 | c ^= b; c -= rot(b, 16); \ | |
223 | a ^= c; a -= rot(c, 4);\ | |
224 | b ^= a; b -= rot(a, 14); \ | |
225 | c ^= b; c -= rot(b, 24); \ | |
226 | } | |
227 | ||
228 | static inline __attribute__((unused)) | |
229 | uint32_t hash_u32( | |
230 | const uint32_t *k, /* the key, an array of uint32_t values */ | |
231 | size_t length, /* the length of the key, in uint32_ts */ | |
232 | uint32_t initval) /* the previous hash, or an arbitrary value */ | |
233 | { | |
234 | uint32_t a, b, c; | |
235 | ||
236 | /* Set up the internal state */ | |
237 | a = b = c = 0xdeadbeef + (((uint32_t) length) << 2) + initval; | |
238 | ||
239 | /*----------------------------------------- handle most of the key */ | |
240 | while (length > 3) { | |
241 | a += k[0]; | |
242 | b += k[1]; | |
243 | c += k[2]; | |
244 | mix(a, b, c); | |
245 | length -= 3; | |
246 | k += 3; | |
247 | } | |
248 | ||
249 | /*----------------------------------- handle the last 3 uint32_t's */ | |
250 | switch (length) { /* all the case statements fall through */ | |
8771d88d MJ |
251 | case 3: c += k[2]; /* fall through */ |
252 | case 2: b += k[1]; /* fall through */ | |
18ca7a5b MD |
253 | case 1: a += k[0]; |
254 | final(a, b, c); | |
8771d88d | 255 | /* fall through */ |
18ca7a5b MD |
256 | case 0: /* case 0: nothing left to add */ |
257 | break; | |
258 | } | |
259 | /*---------------------------------------------- report the result */ | |
260 | return c; | |
261 | } | |
262 | ||
263 | static inline | |
264 | void hashword2( | |
265 | const uint32_t *k, /* the key, an array of uint32_t values */ | |
266 | size_t length, /* the length of the key, in uint32_ts */ | |
267 | uint32_t *pc, /* IN: seed OUT: primary hash value */ | |
268 | uint32_t *pb) /* IN: more seed OUT: secondary hash value */ | |
269 | { | |
270 | uint32_t a, b, c; | |
271 | ||
272 | /* Set up the internal state */ | |
273 | a = b = c = 0xdeadbeef + ((uint32_t) (length << 2)) + *pc; | |
274 | c += *pb; | |
275 | ||
276 | /*----------------------------------------- handle most of the key */ | |
277 | while (length > 3) { | |
278 | a += k[0]; | |
279 | b += k[1]; | |
280 | c += k[2]; | |
281 | mix(a, b, c); | |
282 | length -= 3; | |
283 | k += 3; | |
284 | } | |
285 | ||
286 | /*----------------------------------- handle the last 3 uint32_t's */ | |
287 | switch (length) { /* all the case statements fall through */ | |
447c9339 MJ |
288 | case 3: c += k[2]; /* fall through */ |
289 | case 2: b += k[1]; /* fall through */ | |
18ca7a5b MD |
290 | case 1: a += k[0]; |
291 | final(a, b, c); | |
447c9339 | 292 | /* fall through */ |
18ca7a5b MD |
293 | case 0: /* case 0: nothing left to add */ |
294 | break; | |
295 | } | |
296 | /*---------------------------------------------- report the result */ | |
297 | *pc = c; | |
298 | *pb = b; | |
299 | } | |
300 | ||
301 | #if (CAA_BITS_PER_LONG == 32) | |
302 | static inline | |
495913bf | 303 | unsigned long test_hash_mix(const void *_key, size_t length, unsigned long seed) |
18ca7a5b MD |
304 | { |
305 | unsigned int key = (unsigned int) _key; | |
306 | ||
01477510 | 307 | urcu_posix_assert(length == sizeof(unsigned int)); |
18ca7a5b MD |
308 | return hash_u32(&key, 1, seed); |
309 | } | |
310 | #else | |
311 | static inline | |
495913bf | 312 | unsigned long test_hash_mix(const void *_key, size_t length, unsigned long seed) |
18ca7a5b MD |
313 | { |
314 | union { | |
315 | uint64_t v64; | |
316 | uint32_t v32[2]; | |
317 | } v; | |
318 | union { | |
319 | uint64_t v64; | |
320 | uint32_t v32[2]; | |
321 | } key; | |
322 | ||
01477510 | 323 | urcu_posix_assert(length == sizeof(unsigned long)); |
18ca7a5b MD |
324 | v.v64 = (uint64_t) seed; |
325 | key.v64 = (uint64_t) _key; | |
326 | hashword2(key.v32, 2, &v.v32[0], &v.v32[1]); | |
327 | return v.v64; | |
328 | } | |
329 | #endif | |
330 | ||
495913bf MD |
331 | /* |
332 | * Hash function with nr_hash_chains != 0 for testing purpose only! | |
333 | * Creates very long hash chains, deteriorating the hash table into a | |
334 | * few linked lists, depending on the nr_hash_chains value. The purpose | |
335 | * of this test is to check how the hash table behaves with hash chains | |
336 | * containing different values, which is a rare case in a normal hash | |
337 | * table. | |
338 | */ | |
339 | static inline | |
340 | unsigned long test_hash(const void *_key, size_t length, | |
341 | unsigned long seed) | |
342 | { | |
343 | if (nr_hash_chains == 0) { | |
344 | return test_hash_mix(_key, length, seed); | |
345 | } else { | |
346 | unsigned long v; | |
347 | ||
01477510 | 348 | urcu_posix_assert(length == sizeof(unsigned long)); |
495913bf MD |
349 | v = (unsigned long) _key; |
350 | return v % nr_hash_chains; | |
351 | } | |
352 | } | |
353 | ||
18ca7a5b MD |
354 | unsigned long test_compare(const void *key1, size_t key1_len, |
355 | const void *key2, size_t key2_len); | |
356 | ||
357 | static inline | |
358 | int test_match(struct cds_lfht_node *node, const void *key) | |
359 | { | |
360 | struct lfht_test_node *test_node = to_test_node(node); | |
361 | ||
362 | return !test_compare(test_node->key, test_node->key_len, | |
363 | key, sizeof(unsigned long)); | |
364 | } | |
365 | ||
366 | static inline | |
367 | void cds_lfht_test_lookup(struct cds_lfht *ht, void *key, size_t key_len, | |
368 | struct cds_lfht_iter *iter) | |
369 | { | |
01477510 | 370 | urcu_posix_assert(key_len == sizeof(unsigned long)); |
18ca7a5b MD |
371 | |
372 | cds_lfht_lookup(ht, test_hash(key, key_len, TEST_HASH_SEED), | |
373 | test_match, key, iter); | |
374 | } | |
375 | ||
376 | void free_node_cb(struct rcu_head *head); | |
377 | ||
f52c1ef7 MD |
378 | /* rw test */ |
379 | void test_hash_rw_sigusr1_handler(int signo); | |
380 | void test_hash_rw_sigusr2_handler(int signo); | |
381 | void *test_hash_rw_thr_reader(void *_count); | |
382 | void *test_hash_rw_thr_writer(void *_count); | |
383 | int test_hash_rw_populate_hash(void); | |
384 | ||
20adf780 MD |
385 | /* unique test */ |
386 | void test_hash_unique_sigusr1_handler(int signo); | |
387 | void test_hash_unique_sigusr2_handler(int signo); | |
388 | void *test_hash_unique_thr_reader(void *_count); | |
389 | void *test_hash_unique_thr_writer(void *_count); | |
390 | int test_hash_unique_populate_hash(void); | |
391 | ||
18ca7a5b | 392 | #endif /* _TEST_URCU_HASH_H */ |