Commit | Line | Data |
---|---|---|
5d82d004 MD |
1 | /* |
2 | * test_glib_hash.c | |
3 | * | |
4 | * Userspace RCU library - test program | |
5 | * | |
6 | * Copyright February 2009 - Mathieu Desnoyers <mathieu.desnoyers@polymtl.ca> | |
7 | * | |
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. | |
12 | * | |
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. | |
17 | * | |
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. | |
21 | */ | |
22 | ||
23 | #define _GNU_SOURCE | |
24 | #include <stdio.h> | |
25 | #include <pthread.h> | |
26 | #include <stdlib.h> | |
27 | #include <string.h> | |
28 | #include <sys/types.h> | |
29 | #include <sys/wait.h> | |
30 | #include <unistd.h> | |
31 | #include <stdio.h> | |
32 | #include <assert.h> | |
33 | #include <sched.h> | |
34 | #include <errno.h> | |
35 | #include <glib.h> | |
36 | ||
37 | #ifdef __linux__ | |
38 | #include <syscall.h> | |
39 | #endif | |
40 | ||
41 | #define DEFAULT_HASH_SIZE 32 | |
42 | #define DEFAULT_RAND_POOL 1000000 | |
43 | ||
44 | /* Make this big enough to include the POWER5+ L3 cacheline size of 256B */ | |
45 | #define CACHE_LINE_SIZE 4096 | |
46 | ||
47 | /* hardcoded number of CPUs */ | |
48 | #define NR_CPUS 16384 | |
49 | ||
50 | #if defined(_syscall0) | |
51 | _syscall0(pid_t, gettid) | |
52 | #elif defined(__NR_gettid) | |
53 | static inline pid_t gettid(void) | |
54 | { | |
55 | return syscall(__NR_gettid); | |
56 | } | |
57 | #else | |
58 | #warning "use pid as tid" | |
59 | static inline pid_t gettid(void) | |
60 | { | |
61 | return getpid(); | |
62 | } | |
63 | #endif | |
64 | ||
65 | #ifndef DYNAMIC_LINK_TEST | |
66 | #define _LGPL_SOURCE | |
67 | #else | |
68 | #define debug_yield_read() | |
69 | #endif | |
70 | #include <urcu.h> | |
71 | #include <urcu-call-rcu.h> | |
72 | ||
73 | struct wr_count { | |
74 | unsigned long update_ops; | |
75 | unsigned long add; | |
817db23f | 76 | unsigned long add_exist; |
5d82d004 MD |
77 | unsigned long remove; |
78 | }; | |
79 | ||
80 | static unsigned int __thread rand_lookup; | |
81 | static unsigned long __thread nr_add; | |
82 | static unsigned long __thread nr_addexist; | |
83 | static unsigned long __thread nr_del; | |
84 | static unsigned long __thread nr_delnoent; | |
85 | static unsigned long __thread lookup_fail; | |
86 | static unsigned long __thread lookup_ok; | |
87 | ||
88 | static GHashTable *test_ht; | |
89 | ||
90 | struct test_data { | |
91 | int a; | |
92 | int b; | |
93 | }; | |
94 | ||
95 | static volatile int test_go, test_stop; | |
96 | ||
97 | static unsigned long wdelay; | |
98 | ||
99 | static unsigned long duration; | |
100 | ||
101 | /* read-side C.S. duration, in loops */ | |
102 | static unsigned long rduration; | |
103 | ||
104 | static unsigned long init_hash_size = DEFAULT_HASH_SIZE; | |
105 | static unsigned long rand_pool = DEFAULT_RAND_POOL; | |
106 | static int add_only, add_unique; | |
107 | ||
108 | static inline void loop_sleep(unsigned long l) | |
109 | { | |
110 | while(l-- != 0) | |
111 | caa_cpu_relax(); | |
112 | } | |
113 | ||
114 | static int verbose_mode; | |
115 | ||
116 | #define printf_verbose(fmt, args...) \ | |
117 | do { \ | |
118 | if (verbose_mode) \ | |
119 | printf(fmt, ## args); \ | |
120 | } while (0) | |
121 | ||
122 | static unsigned int cpu_affinities[NR_CPUS]; | |
123 | static unsigned int next_aff = 0; | |
124 | static int use_affinity = 0; | |
125 | ||
126 | pthread_mutex_t affinity_mutex = PTHREAD_MUTEX_INITIALIZER; | |
127 | ||
128 | static void set_affinity(void) | |
129 | { | |
130 | cpu_set_t mask; | |
131 | int cpu; | |
132 | int ret; | |
133 | ||
134 | if (!use_affinity) | |
135 | return; | |
136 | ||
137 | ret = pthread_mutex_lock(&affinity_mutex); | |
138 | if (ret) { | |
139 | perror("Error in pthread mutex lock"); | |
140 | exit(-1); | |
141 | } | |
142 | cpu = cpu_affinities[next_aff++]; | |
143 | ret = pthread_mutex_unlock(&affinity_mutex); | |
144 | if (ret) { | |
145 | perror("Error in pthread mutex unlock"); | |
146 | exit(-1); | |
147 | } | |
148 | CPU_ZERO(&mask); | |
149 | CPU_SET(cpu, &mask); | |
150 | sched_setaffinity(0, sizeof(mask), &mask); | |
151 | } | |
152 | ||
153 | /* | |
154 | * returns 0 if test should end. | |
155 | */ | |
156 | static int test_duration_write(void) | |
157 | { | |
158 | return !test_stop; | |
159 | } | |
160 | ||
161 | static int test_duration_read(void) | |
162 | { | |
163 | return !test_stop; | |
164 | } | |
165 | ||
166 | static unsigned long long __thread nr_writes; | |
167 | static unsigned long long __thread nr_reads; | |
168 | ||
169 | static unsigned int nr_readers; | |
170 | static unsigned int nr_writers; | |
171 | ||
172 | pthread_mutex_t rcu_copy_mutex = PTHREAD_MUTEX_INITIALIZER; | |
173 | ||
174 | void rcu_copy_mutex_lock(void) | |
175 | { | |
176 | int ret; | |
177 | ret = pthread_mutex_lock(&rcu_copy_mutex); | |
178 | if (ret) { | |
179 | perror("Error in pthread mutex lock"); | |
180 | exit(-1); | |
181 | } | |
182 | } | |
183 | ||
184 | void rcu_copy_mutex_unlock(void) | |
185 | { | |
186 | int ret; | |
187 | ||
188 | ret = pthread_mutex_unlock(&rcu_copy_mutex); | |
189 | if (ret) { | |
190 | perror("Error in pthread mutex unlock"); | |
191 | exit(-1); | |
192 | } | |
193 | } | |
194 | ||
195 | /* | |
196 | * Hash function | |
197 | * Source: http://burtleburtle.net/bob/c/lookup3.c | |
198 | * Originally Public Domain | |
199 | */ | |
200 | ||
201 | #define rot(x, k) (((x) << (k)) | ((x) >> (32 - (k)))) | |
202 | ||
203 | #define mix(a, b, c) \ | |
204 | do { \ | |
205 | a -= c; a ^= rot(c, 4); c += b; \ | |
206 | b -= a; b ^= rot(a, 6); a += c; \ | |
207 | c -= b; c ^= rot(b, 8); b += a; \ | |
208 | a -= c; a ^= rot(c, 16); c += b; \ | |
209 | b -= a; b ^= rot(a, 19); a += c; \ | |
210 | c -= b; c ^= rot(b, 4); b += a; \ | |
211 | } while (0) | |
212 | ||
213 | #define final(a, b, c) \ | |
214 | { \ | |
215 | c ^= b; c -= rot(b, 14); \ | |
216 | a ^= c; a -= rot(c, 11); \ | |
217 | b ^= a; b -= rot(a, 25); \ | |
218 | c ^= b; c -= rot(b, 16); \ | |
219 | a ^= c; a -= rot(c, 4);\ | |
220 | b ^= a; b -= rot(a, 14); \ | |
221 | c ^= b; c -= rot(b, 24); \ | |
222 | } | |
223 | ||
224 | static __attribute__((unused)) | |
225 | uint32_t hash_u32( | |
226 | const uint32_t *k, /* the key, an array of uint32_t values */ | |
227 | size_t length, /* the length of the key, in uint32_ts */ | |
228 | uint32_t initval) /* the previous hash, or an arbitrary value */ | |
229 | { | |
230 | uint32_t a, b, c; | |
231 | ||
232 | /* Set up the internal state */ | |
233 | a = b = c = 0xdeadbeef + (((uint32_t) length) << 2) + initval; | |
234 | ||
235 | /*----------------------------------------- handle most of the key */ | |
236 | while (length > 3) { | |
237 | a += k[0]; | |
238 | b += k[1]; | |
239 | c += k[2]; | |
240 | mix(a, b, c); | |
241 | length -= 3; | |
242 | k += 3; | |
243 | } | |
244 | ||
245 | /*----------------------------------- handle the last 3 uint32_t's */ | |
246 | switch (length) { /* all the case statements fall through */ | |
247 | case 3: c += k[2]; | |
248 | case 2: b += k[1]; | |
249 | case 1: a += k[0]; | |
250 | final(a, b, c); | |
251 | case 0: /* case 0: nothing left to add */ | |
252 | break; | |
253 | } | |
254 | /*---------------------------------------------- report the result */ | |
255 | return c; | |
256 | } | |
257 | ||
258 | static | |
259 | void hashword2( | |
260 | const uint32_t *k, /* the key, an array of uint32_t values */ | |
261 | size_t length, /* the length of the key, in uint32_ts */ | |
262 | uint32_t *pc, /* IN: seed OUT: primary hash value */ | |
263 | uint32_t *pb) /* IN: more seed OUT: secondary hash value */ | |
264 | { | |
265 | uint32_t a, b, c; | |
266 | ||
267 | /* Set up the internal state */ | |
268 | a = b = c = 0xdeadbeef + ((uint32_t) (length << 2)) + *pc; | |
269 | c += *pb; | |
270 | ||
271 | /*----------------------------------------- handle most of the key */ | |
272 | while (length > 3) { | |
273 | a += k[0]; | |
274 | b += k[1]; | |
275 | c += k[2]; | |
276 | mix(a, b, c); | |
277 | length -= 3; | |
278 | k += 3; | |
279 | } | |
280 | ||
281 | /*----------------------------------- handle the last 3 uint32_t's */ | |
282 | switch (length) { /* all the case statements fall through */ | |
283 | case 3: c += k[2]; | |
284 | case 2: b += k[1]; | |
285 | case 1: a += k[0]; | |
286 | final(a, b, c); | |
287 | case 0: /* case 0: nothing left to add */ | |
288 | break; | |
289 | } | |
290 | /*---------------------------------------------- report the result */ | |
291 | *pc = c; | |
292 | *pb = b; | |
293 | } | |
294 | ||
295 | #if (CAA_BITS_PER_LONG == 32) | |
296 | static | |
297 | unsigned long test_hash(const void *_key, size_t length, unsigned long seed) | |
298 | { | |
299 | unsigned long key = (unsigned long) _key; | |
300 | unsigned long v; | |
301 | ||
302 | assert(length == sizeof(unsigned long)); | |
303 | return hash_u32(&v, 1, seed); | |
304 | } | |
305 | #else | |
306 | static | |
307 | unsigned long test_hash(const void *_key, size_t length, unsigned long seed) | |
308 | { | |
309 | union { | |
310 | uint64_t v64; | |
311 | uint32_t v32[2]; | |
312 | } v; | |
313 | union { | |
314 | uint64_t v64; | |
315 | uint32_t v32[2]; | |
316 | } key; | |
317 | ||
318 | assert(length == sizeof(unsigned long)); | |
319 | v.v64 = (uint64_t) seed; | |
320 | key.v64 = (uint64_t) _key; | |
321 | hashword2(key.v32, 2, &v.v32[0], &v.v32[1]); | |
322 | return v.v64; | |
323 | } | |
324 | #endif | |
325 | ||
326 | static | |
327 | unsigned long test_compare(const void *key1, size_t key1_len, | |
328 | const void *key2, size_t key2_len) | |
329 | { | |
330 | if (unlikely(key1_len != key2_len)) | |
331 | return -1; | |
332 | assert(key1_len == sizeof(unsigned long)); | |
333 | if (key1 == key2) | |
334 | return 0; | |
335 | else | |
336 | return 1; | |
337 | } | |
338 | ||
339 | static | |
340 | guint test_hash_fct(const void *key) | |
341 | { | |
342 | return test_hash(key, sizeof(void *), 0x42); | |
343 | } | |
344 | ||
345 | static | |
346 | gboolean test_compare_fct(const void *a, const void *b) | |
347 | { | |
348 | return !test_compare(a, sizeof(void *), b, sizeof(void *)); | |
349 | } | |
350 | ||
351 | void *thr_reader(void *_count) | |
352 | { | |
353 | unsigned long long *count = _count; | |
354 | void *node; | |
355 | ||
356 | printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n", | |
357 | "reader", pthread_self(), (unsigned long)gettid()); | |
358 | ||
359 | set_affinity(); | |
360 | ||
361 | rcu_register_thread(); | |
362 | ||
363 | while (!test_go) | |
364 | { | |
365 | } | |
366 | cmm_smp_mb(); | |
367 | ||
368 | for (;;) { | |
369 | rcu_copy_mutex_lock(); | |
370 | node = g_hash_table_lookup(test_ht, | |
371 | (void *)(unsigned long)(rand_r(&rand_lookup) % rand_pool)); | |
372 | if (node == NULL) | |
373 | lookup_fail++; | |
374 | else | |
375 | lookup_ok++; | |
376 | debug_yield_read(); | |
377 | if (unlikely(rduration)) | |
378 | loop_sleep(rduration); | |
379 | rcu_copy_mutex_unlock(); | |
380 | nr_reads++; | |
381 | if (unlikely(!test_duration_read())) | |
382 | break; | |
383 | } | |
384 | ||
385 | rcu_unregister_thread(); | |
386 | ||
387 | *count = nr_reads; | |
388 | printf_verbose("thread_end %s, thread id : %lx, tid %lu\n", | |
389 | "reader", pthread_self(), (unsigned long)gettid()); | |
390 | printf_verbose("readid : %lx, lookupfail %lu, lookupok %lu\n", | |
391 | pthread_self(), lookup_fail, lookup_ok); | |
392 | return ((void*)1); | |
393 | ||
394 | } | |
395 | ||
396 | void *thr_writer(void *_count) | |
397 | { | |
817db23f | 398 | void *node, *ret_node, *key; |
5d82d004 MD |
399 | struct wr_count *count = _count; |
400 | int ret; | |
401 | ||
402 | printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n", | |
403 | "writer", pthread_self(), (unsigned long)gettid()); | |
404 | ||
405 | set_affinity(); | |
406 | ||
407 | rcu_register_thread(); | |
408 | ||
409 | while (!test_go) | |
410 | { | |
411 | } | |
412 | cmm_smp_mb(); | |
413 | ||
414 | for (;;) { | |
415 | if (add_only || rand_r(&rand_lookup) & 1) { | |
817db23f MD |
416 | void *lookup_node; |
417 | ||
5d82d004 | 418 | node = malloc(1); |
817db23f | 419 | |
5d82d004 | 420 | rcu_copy_mutex_lock(); |
7e7fc09a MD |
421 | /* Glib hash table only supports replacement. */ |
422 | if (!add_unique) { | |
423 | add_unique = 1; /* force add_unique */ | |
424 | printf("glib hash tables only supports " | |
425 | "replacing values (and keys in addition) when the key to insert is already " | |
426 | "present. Make sure you compare with the \"add_unique\" (-u) RCU hash table " | |
427 | "behavior, which is the closest match.\n"); | |
428 | } | |
817db23f MD |
429 | /* Uniquify behavior: lookup and add if not found */ |
430 | key = (void *)(unsigned long)(rand_r(&rand_lookup) % rand_pool); | |
431 | lookup_node = g_hash_table_lookup(test_ht, key); | |
432 | if (lookup_node == NULL) { | |
433 | g_hash_table_insert(test_ht, key, node); | |
434 | rcu_copy_mutex_unlock(); | |
435 | nr_add++; | |
436 | } else { | |
437 | rcu_copy_mutex_unlock(); | |
438 | free(node); | |
439 | nr_addexist++; | |
440 | } | |
5d82d004 MD |
441 | } else { |
442 | /* May delete */ | |
443 | rcu_copy_mutex_lock(); | |
444 | ret = g_hash_table_remove(test_ht, | |
445 | (void *)(unsigned long)(rand_r(&rand_lookup) % rand_pool)); | |
446 | rcu_copy_mutex_unlock(); | |
447 | if (ret) { | |
448 | nr_del++; | |
449 | } else | |
450 | nr_delnoent++; | |
451 | } | |
452 | #if 0 | |
453 | //if (nr_writes % 100000 == 0) { | |
454 | if (nr_writes % 1000 == 0) { | |
455 | rcu_read_lock(); | |
456 | if (rand_r(&rand_lookup) & 1) { | |
457 | ht_resize(test_ht, 1); | |
458 | } else { | |
459 | ht_resize(test_ht, -1); | |
460 | } | |
461 | rcu_read_unlock(); | |
462 | } | |
463 | #endif //0 | |
464 | nr_writes++; | |
465 | if (unlikely(!test_duration_write())) | |
466 | break; | |
467 | if (unlikely(wdelay)) | |
468 | loop_sleep(wdelay); | |
469 | } | |
470 | ||
471 | rcu_unregister_thread(); | |
472 | ||
473 | printf_verbose("thread_end %s, thread id : %lx, tid %lu\n", | |
474 | "writer", pthread_self(), (unsigned long)gettid()); | |
475 | printf_verbose("info id %lx: nr_add %lu, nr_addexist %lu, nr_del %lu, " | |
476 | "nr_delnoent %lu\n", pthread_self(), nr_add, | |
477 | nr_addexist, nr_del, nr_delnoent); | |
478 | count->update_ops = nr_writes; | |
479 | count->add = nr_add; | |
817db23f | 480 | count->add_exist = nr_addexist; |
5d82d004 MD |
481 | count->remove = nr_del; |
482 | return ((void*)2); | |
483 | } | |
484 | ||
817db23f MD |
485 | static |
486 | void count_nodes(gpointer key, gpointer value, gpointer user_data) | |
487 | { | |
488 | unsigned long *count = user_data; | |
489 | (*count)++; | |
490 | } | |
491 | ||
5d82d004 MD |
492 | void show_usage(int argc, char **argv) |
493 | { | |
494 | printf("Usage : %s nr_readers nr_writers duration (s)", argv[0]); | |
495 | #ifdef DEBUG_YIELD | |
496 | printf(" [-r] [-w] (yield reader and/or writer)"); | |
497 | #endif | |
498 | printf(" [-d delay] (writer period (us))"); | |
499 | printf(" [-c duration] (reader C.S. duration (in loops))"); | |
500 | printf(" [-v] (verbose output)"); | |
501 | printf(" [-a cpu#] [-a cpu#]... (affinity)"); | |
502 | printf(" [-p size] (random key value pool size)"); | |
503 | printf(" [-h size] (initial hash table size)"); | |
504 | printf(" [-u] Uniquify add."); | |
505 | printf(" [-i] Add only (no removal)."); | |
506 | printf("\n"); | |
507 | } | |
508 | ||
509 | int main(int argc, char **argv) | |
510 | { | |
511 | int err; | |
512 | pthread_t *tid_reader, *tid_writer; | |
513 | void *tret; | |
514 | unsigned long long *count_reader; | |
515 | struct wr_count *count_writer; | |
516 | unsigned long long tot_reads = 0, tot_writes = 0, | |
817db23f MD |
517 | tot_add = 0, tot_add_exist = 0, tot_remove = 0; |
518 | unsigned long count; | |
5d82d004 MD |
519 | int i, a, ret; |
520 | ||
521 | if (argc < 4) { | |
522 | show_usage(argc, argv); | |
523 | return -1; | |
524 | } | |
525 | ||
526 | err = sscanf(argv[1], "%u", &nr_readers); | |
527 | if (err != 1) { | |
528 | show_usage(argc, argv); | |
529 | return -1; | |
530 | } | |
531 | ||
532 | err = sscanf(argv[2], "%u", &nr_writers); | |
533 | if (err != 1) { | |
534 | show_usage(argc, argv); | |
535 | return -1; | |
536 | } | |
537 | ||
538 | err = sscanf(argv[3], "%lu", &duration); | |
539 | if (err != 1) { | |
540 | show_usage(argc, argv); | |
541 | return -1; | |
542 | } | |
543 | ||
544 | for (i = 4; i < argc; i++) { | |
545 | if (argv[i][0] != '-') | |
546 | continue; | |
547 | switch (argv[i][1]) { | |
548 | #ifdef DEBUG_YIELD | |
549 | case 'r': | |
550 | yield_active |= YIELD_READ; | |
551 | break; | |
552 | case 'w': | |
553 | yield_active |= YIELD_WRITE; | |
554 | break; | |
555 | #endif | |
556 | case 'a': | |
557 | if (argc < i + 2) { | |
558 | show_usage(argc, argv); | |
559 | return -1; | |
560 | } | |
561 | a = atoi(argv[++i]); | |
562 | cpu_affinities[next_aff++] = a; | |
563 | use_affinity = 1; | |
564 | printf_verbose("Adding CPU %d affinity\n", a); | |
565 | break; | |
566 | case 'c': | |
567 | if (argc < i + 2) { | |
568 | show_usage(argc, argv); | |
569 | return -1; | |
570 | } | |
571 | rduration = atol(argv[++i]); | |
572 | break; | |
573 | case 'd': | |
574 | if (argc < i + 2) { | |
575 | show_usage(argc, argv); | |
576 | return -1; | |
577 | } | |
578 | wdelay = atol(argv[++i]); | |
579 | break; | |
580 | case 'v': | |
581 | verbose_mode = 1; | |
582 | break; | |
583 | case 'p': | |
584 | if (argc < i + 2) { | |
585 | show_usage(argc, argv); | |
586 | return -1; | |
587 | } | |
588 | rand_pool = atol(argv[++i]); | |
589 | break; | |
590 | case 'h': | |
591 | if (argc < i + 2) { | |
592 | show_usage(argc, argv); | |
593 | return -1; | |
594 | } | |
595 | init_hash_size = atol(argv[++i]); | |
596 | break; | |
597 | case 'u': | |
598 | add_unique = 1; | |
599 | break; | |
600 | case 'i': | |
601 | add_only = 1; | |
602 | break; | |
603 | } | |
604 | } | |
605 | ||
606 | /* Check if hash size is power of 2 */ | |
607 | if (init_hash_size && init_hash_size & (init_hash_size - 1)) { | |
608 | printf("Error: Hash table size %lu is not a power of 2.\n", | |
609 | init_hash_size); | |
610 | return -1; | |
611 | } | |
612 | ||
613 | printf_verbose("running test for %lu seconds, %u readers, %u writers.\n", | |
614 | duration, nr_readers, nr_writers); | |
615 | printf_verbose("Writer delay : %lu loops.\n", wdelay); | |
616 | printf_verbose("Reader duration : %lu loops.\n", rduration); | |
617 | printf_verbose("Random pool size : %lu.\n", rand_pool); | |
618 | printf_verbose("Mode:%s%s.\n", | |
619 | add_only ? " add only" : " add/remove", | |
620 | add_unique ? " uniquify" : ""); | |
621 | printf_verbose("Initial hash table size: %lu buckets.\n", init_hash_size); | |
622 | printf_verbose("thread %-6s, thread id : %lx, tid %lu\n", | |
623 | "main", pthread_self(), (unsigned long)gettid()); | |
624 | ||
625 | tid_reader = malloc(sizeof(*tid_reader) * nr_readers); | |
626 | tid_writer = malloc(sizeof(*tid_writer) * nr_writers); | |
627 | count_reader = malloc(sizeof(*count_reader) * nr_readers); | |
628 | count_writer = malloc(sizeof(*count_writer) * nr_writers); | |
5d82d004 MD |
629 | test_ht = g_hash_table_new_full(test_hash_fct, test_compare_fct, |
630 | NULL, free); | |
631 | ||
632 | err = create_all_cpu_call_rcu_data(0); | |
633 | assert(!err); | |
634 | ||
635 | next_aff = 0; | |
636 | ||
637 | for (i = 0; i < nr_readers; i++) { | |
638 | err = pthread_create(&tid_reader[i], NULL, thr_reader, | |
639 | &count_reader[i]); | |
640 | if (err != 0) | |
641 | exit(1); | |
642 | } | |
643 | for (i = 0; i < nr_writers; i++) { | |
644 | err = pthread_create(&tid_writer[i], NULL, thr_writer, | |
645 | &count_writer[i]); | |
646 | if (err != 0) | |
647 | exit(1); | |
648 | } | |
649 | ||
650 | cmm_smp_mb(); | |
651 | ||
652 | test_go = 1; | |
653 | ||
654 | sleep(duration); | |
655 | ||
656 | test_stop = 1; | |
657 | ||
658 | for (i = 0; i < nr_readers; i++) { | |
659 | err = pthread_join(tid_reader[i], &tret); | |
660 | if (err != 0) | |
661 | exit(1); | |
662 | tot_reads += count_reader[i]; | |
663 | } | |
664 | for (i = 0; i < nr_writers; i++) { | |
665 | err = pthread_join(tid_writer[i], &tret); | |
666 | if (err != 0) | |
667 | exit(1); | |
668 | tot_writes += count_writer[i].update_ops; | |
669 | tot_add += count_writer[i].add; | |
817db23f | 670 | tot_add_exist += count_writer[i].add_exist; |
5d82d004 MD |
671 | tot_remove += count_writer[i].remove; |
672 | } | |
5d82d004 MD |
673 | printf("Counting nodes... "); |
674 | fflush(stdout); | |
817db23f MD |
675 | count = 0; |
676 | g_hash_table_foreach(test_ht, count_nodes, &count); | |
5d82d004 | 677 | printf("done.\n"); |
817db23f | 678 | if (count) |
5d82d004 | 679 | printf("WARNING: nodes left in the hash table upon destroy: " |
817db23f | 680 | "%lu nodes.\n", count); |
5d82d004 MD |
681 | g_hash_table_destroy(test_ht); |
682 | ||
683 | if (ret) | |
684 | printf_verbose("final delete aborted\n"); | |
685 | else | |
686 | printf_verbose("final delete success\n"); | |
687 | printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads, | |
688 | tot_writes); | |
689 | printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu " | |
690 | "nr_writers %3u " | |
691 | "wdelay %6lu rand_pool %12llu nr_reads %12llu nr_writes %12llu nr_ops %12llu " | |
817db23f | 692 | "nr_add %12llu nr_add_fail %12llu nr_remove %12llu nr_leaked %12llu\n", |
5d82d004 MD |
693 | argv[0], duration, nr_readers, rduration, |
694 | nr_writers, wdelay, rand_pool, tot_reads, tot_writes, | |
817db23f | 695 | tot_reads + tot_writes, tot_add, tot_add_exist, tot_remove, |
5d82d004 MD |
696 | tot_add - tot_remove - count); |
697 | free(tid_reader); | |
698 | free(tid_writer); | |
699 | free(count_reader); | |
700 | free(count_writer); | |
701 | return 0; | |
702 | } |