Commit | Line | Data |
---|---|---|
a813abf8 MD |
1 | /* |
2 | * test_urcu_gc.c | |
3 | * | |
4 | * Userspace RCU library - test program (with baatch reclamation) | |
5 | * | |
6982d6d7 | 6 | * Copyright February 2009 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com> |
a813abf8 MD |
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 | |
d8540fc5 | 24 | #include "../config.h" |
a813abf8 MD |
25 | #include <stdio.h> |
26 | #include <pthread.h> | |
27 | #include <stdlib.h> | |
28 | #include <string.h> | |
29 | #include <sys/types.h> | |
30 | #include <sys/wait.h> | |
31 | #include <unistd.h> | |
32 | #include <stdio.h> | |
33 | #include <assert.h> | |
a813abf8 | 34 | #include <sched.h> |
94b343fd | 35 | #include <errno.h> |
a813abf8 | 36 | |
ec4e58a3 | 37 | #include <urcu/arch.h> |
bd252a04 | 38 | #include <urcu/tls-compat.h> |
a813abf8 | 39 | |
65fcc7e9 MD |
40 | #ifdef __linux__ |
41 | #include <syscall.h> | |
42 | #endif | |
43 | ||
2a7ac59d MD |
44 | /* hardcoded number of CPUs */ |
45 | #define NR_CPUS 16384 | |
46 | ||
a813abf8 MD |
47 | #if defined(_syscall0) |
48 | _syscall0(pid_t, gettid) | |
49 | #elif defined(__NR_gettid) | |
50 | static inline pid_t gettid(void) | |
51 | { | |
52 | return syscall(__NR_gettid); | |
53 | } | |
54 | #else | |
55 | #warning "use pid as tid" | |
56 | static inline pid_t gettid(void) | |
57 | { | |
58 | return getpid(); | |
59 | } | |
60 | #endif | |
61 | ||
62 | #ifndef DYNAMIC_LINK_TEST | |
63 | #define _LGPL_SOURCE | |
64 | #else | |
65 | #define debug_yield_read() | |
66 | #endif | |
ec4e58a3 | 67 | #include <urcu.h> |
a813abf8 MD |
68 | |
69 | struct test_array { | |
70 | int a; | |
71 | }; | |
72 | ||
73 | static volatile int test_go, test_stop; | |
74 | ||
75 | static unsigned long wdelay; | |
76 | ||
77 | static struct test_array *test_rcu_pointer; | |
78 | ||
4a3e0004 | 79 | static unsigned int reclaim_batch = 1; |
a813abf8 MD |
80 | |
81 | struct reclaim_queue { | |
82 | void **queue; /* Beginning of queue */ | |
83 | void **head; /* Insert position */ | |
84 | }; | |
85 | ||
86 | static struct reclaim_queue *pending_reclaims; | |
87 | ||
88 | static unsigned long duration; | |
89 | ||
90 | /* read-side C.S. duration, in loops */ | |
91 | static unsigned long rduration; | |
92 | ||
31b598e0 MD |
93 | /* write-side C.S. duration, in loops */ |
94 | static unsigned long wduration; | |
95 | ||
a813abf8 MD |
96 | static inline void loop_sleep(unsigned long l) |
97 | { | |
98 | while(l-- != 0) | |
06f22bdb | 99 | caa_cpu_relax(); |
a813abf8 MD |
100 | } |
101 | ||
102 | static int verbose_mode; | |
103 | ||
104 | #define printf_verbose(fmt, args...) \ | |
105 | do { \ | |
106 | if (verbose_mode) \ | |
107 | printf(fmt, args); \ | |
108 | } while (0) | |
109 | ||
2a7ac59d MD |
110 | static unsigned int cpu_affinities[NR_CPUS]; |
111 | static unsigned int next_aff = 0; | |
112 | static int use_affinity = 0; | |
113 | ||
6af882ba MD |
114 | pthread_mutex_t affinity_mutex = PTHREAD_MUTEX_INITIALIZER; |
115 | ||
d8540fc5 PA |
116 | #ifndef HAVE_CPU_SET_T |
117 | typedef unsigned long cpu_set_t; | |
118 | # define CPU_ZERO(cpuset) do { *(cpuset) = 0; } while(0) | |
119 | # define CPU_SET(cpu, cpuset) do { *(cpuset) |= (1UL << (cpu)); } while(0) | |
120 | #endif | |
121 | ||
2a7ac59d MD |
122 | static void set_affinity(void) |
123 | { | |
124 | cpu_set_t mask; | |
125 | int cpu; | |
6af882ba | 126 | int ret; |
2a7ac59d MD |
127 | |
128 | if (!use_affinity) | |
129 | return; | |
130 | ||
d8540fc5 | 131 | #if HAVE_SCHED_SETAFFINITY |
6af882ba MD |
132 | ret = pthread_mutex_lock(&affinity_mutex); |
133 | if (ret) { | |
134 | perror("Error in pthread mutex lock"); | |
135 | exit(-1); | |
136 | } | |
2a7ac59d | 137 | cpu = cpu_affinities[next_aff++]; |
6af882ba MD |
138 | ret = pthread_mutex_unlock(&affinity_mutex); |
139 | if (ret) { | |
140 | perror("Error in pthread mutex unlock"); | |
141 | exit(-1); | |
142 | } | |
d8540fc5 | 143 | |
2a7ac59d MD |
144 | CPU_ZERO(&mask); |
145 | CPU_SET(cpu, &mask); | |
d8540fc5 PA |
146 | #if SCHED_SETAFFINITY_ARGS == 2 |
147 | sched_setaffinity(0, &mask); | |
148 | #else | |
2a7ac59d | 149 | sched_setaffinity(0, sizeof(mask), &mask); |
d8540fc5 PA |
150 | #endif |
151 | #endif /* HAVE_SCHED_SETAFFINITY */ | |
2a7ac59d MD |
152 | } |
153 | ||
a813abf8 MD |
154 | /* |
155 | * returns 0 if test should end. | |
156 | */ | |
157 | static int test_duration_write(void) | |
158 | { | |
159 | return !test_stop; | |
160 | } | |
161 | ||
162 | static int test_duration_read(void) | |
163 | { | |
164 | return !test_stop; | |
165 | } | |
166 | ||
bd252a04 MD |
167 | static DEFINE_URCU_TLS(unsigned long long, nr_writes); |
168 | static DEFINE_URCU_TLS(unsigned long long, nr_reads); | |
a813abf8 MD |
169 | |
170 | static | |
06f22bdb | 171 | unsigned long long __attribute__((aligned(CAA_CACHE_LINE_SIZE))) *tot_nr_writes; |
a813abf8 MD |
172 | |
173 | static unsigned int nr_readers; | |
174 | static unsigned int nr_writers; | |
175 | ||
176 | pthread_mutex_t rcu_copy_mutex = PTHREAD_MUTEX_INITIALIZER; | |
177 | ||
178 | void rcu_copy_mutex_lock(void) | |
179 | { | |
180 | int ret; | |
181 | ret = pthread_mutex_lock(&rcu_copy_mutex); | |
182 | if (ret) { | |
183 | perror("Error in pthread mutex lock"); | |
184 | exit(-1); | |
185 | } | |
186 | } | |
187 | ||
188 | void rcu_copy_mutex_unlock(void) | |
189 | { | |
190 | int ret; | |
191 | ||
192 | ret = pthread_mutex_unlock(&rcu_copy_mutex); | |
193 | if (ret) { | |
194 | perror("Error in pthread mutex unlock"); | |
195 | exit(-1); | |
196 | } | |
197 | } | |
198 | ||
199 | void *thr_reader(void *_count) | |
200 | { | |
201 | unsigned long long *count = _count; | |
202 | struct test_array *local_ptr; | |
203 | ||
204 | printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n", | |
2d72fae2 MD |
205 | "reader", (unsigned long) pthread_self(), |
206 | (unsigned long) gettid()); | |
a813abf8 | 207 | |
2a7ac59d MD |
208 | set_affinity(); |
209 | ||
a813abf8 MD |
210 | rcu_register_thread(); |
211 | ||
212 | while (!test_go) | |
213 | { | |
214 | } | |
5481ddb3 | 215 | cmm_smp_mb(); |
a813abf8 MD |
216 | |
217 | for (;;) { | |
218 | rcu_read_lock(); | |
219 | local_ptr = rcu_dereference(test_rcu_pointer); | |
220 | debug_yield_read(); | |
221 | if (local_ptr) | |
222 | assert(local_ptr->a == 8); | |
a0b7f7ea | 223 | if (caa_unlikely(rduration)) |
a813abf8 MD |
224 | loop_sleep(rduration); |
225 | rcu_read_unlock(); | |
bd252a04 | 226 | URCU_TLS(nr_reads)++; |
a0b7f7ea | 227 | if (caa_unlikely(!test_duration_read())) |
a813abf8 MD |
228 | break; |
229 | } | |
230 | ||
231 | rcu_unregister_thread(); | |
232 | ||
bd252a04 | 233 | *count = URCU_TLS(nr_reads); |
a813abf8 | 234 | printf_verbose("thread_end %s, thread id : %lx, tid %lu\n", |
2d72fae2 MD |
235 | "reader", (unsigned long) pthread_self(), |
236 | (unsigned long) gettid()); | |
a813abf8 MD |
237 | return ((void*)1); |
238 | ||
239 | } | |
240 | ||
53091fe5 | 241 | static void rcu_gc_clear_queue(unsigned long wtidx) |
a813abf8 MD |
242 | { |
243 | void **p; | |
244 | ||
53091fe5 | 245 | /* Wait for Q.S and empty queue */ |
a813abf8 MD |
246 | synchronize_rcu(); |
247 | ||
248 | for (p = pending_reclaims[wtidx].queue; | |
249 | p < pending_reclaims[wtidx].head; p++) { | |
250 | /* poison */ | |
251 | if (*p) | |
252 | ((struct test_array *)*p)->a = 0; | |
253 | free(*p); | |
254 | } | |
255 | pending_reclaims[wtidx].head = pending_reclaims[wtidx].queue; | |
256 | } | |
257 | ||
53091fe5 MD |
258 | /* Using per-thread queue */ |
259 | static void rcu_gc_reclaim(unsigned long wtidx, void *old) | |
a813abf8 | 260 | { |
53091fe5 MD |
261 | /* Queue pointer */ |
262 | *pending_reclaims[wtidx].head = old; | |
263 | pending_reclaims[wtidx].head++; | |
a813abf8 | 264 | |
a0b7f7ea | 265 | if (caa_likely(pending_reclaims[wtidx].head - pending_reclaims[wtidx].queue |
53091fe5 MD |
266 | < reclaim_batch)) |
267 | return; | |
a813abf8 | 268 | |
53091fe5 | 269 | rcu_gc_clear_queue(wtidx); |
a813abf8 MD |
270 | } |
271 | ||
272 | void *thr_writer(void *data) | |
273 | { | |
274 | unsigned long wtidx = (unsigned long)data; | |
321e29d9 MD |
275 | #ifdef TEST_LOCAL_GC |
276 | struct test_array *old = NULL; | |
277 | #else | |
a813abf8 | 278 | struct test_array *new, *old; |
321e29d9 | 279 | #endif |
a813abf8 MD |
280 | |
281 | printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n", | |
2d72fae2 MD |
282 | "writer", (unsigned long) pthread_self(), |
283 | (unsigned long) gettid()); | |
a813abf8 | 284 | |
2a7ac59d MD |
285 | set_affinity(); |
286 | ||
a813abf8 MD |
287 | while (!test_go) |
288 | { | |
289 | } | |
5481ddb3 | 290 | cmm_smp_mb(); |
a813abf8 MD |
291 | |
292 | for (;;) { | |
321e29d9 | 293 | #ifndef TEST_LOCAL_GC |
a813abf8 | 294 | new = malloc(sizeof(*new)); |
a813abf8 MD |
295 | new->a = 8; |
296 | old = rcu_xchg_pointer(&test_rcu_pointer, new); | |
321e29d9 | 297 | #endif |
a0b7f7ea | 298 | if (caa_unlikely(wduration)) |
31b598e0 | 299 | loop_sleep(wduration); |
a813abf8 | 300 | rcu_gc_reclaim(wtidx, old); |
bd252a04 | 301 | URCU_TLS(nr_writes)++; |
a0b7f7ea | 302 | if (caa_unlikely(!test_duration_write())) |
a813abf8 | 303 | break; |
a0b7f7ea | 304 | if (caa_unlikely(wdelay)) |
a813abf8 MD |
305 | loop_sleep(wdelay); |
306 | } | |
307 | ||
308 | printf_verbose("thread_end %s, thread id : %lx, tid %lu\n", | |
2d72fae2 MD |
309 | "writer", (unsigned long) pthread_self(), |
310 | (unsigned long) gettid()); | |
bd252a04 | 311 | tot_nr_writes[wtidx] = URCU_TLS(nr_writes); |
a813abf8 MD |
312 | return ((void*)2); |
313 | } | |
314 | ||
315 | void show_usage(int argc, char **argv) | |
316 | { | |
317 | printf("Usage : %s nr_readers nr_writers duration (s)", argv[0]); | |
318 | #ifdef DEBUG_YIELD | |
319 | printf(" [-r] [-w] (yield reader and/or writer)"); | |
320 | #endif | |
321 | printf(" [-d delay] (writer period (us))"); | |
322 | printf(" [-c duration] (reader C.S. duration (in loops))"); | |
31b598e0 | 323 | printf(" [-e duration] (writer C.S. duration (in loops))"); |
a813abf8 MD |
324 | printf(" [-v] (verbose output)"); |
325 | printf(" [-a cpu#] [-a cpu#]... (affinity)"); | |
326 | printf("\n"); | |
327 | } | |
328 | ||
a813abf8 MD |
329 | int main(int argc, char **argv) |
330 | { | |
331 | int err; | |
332 | pthread_t *tid_reader, *tid_writer; | |
333 | void *tret; | |
334 | unsigned long long *count_reader; | |
335 | unsigned long long tot_reads = 0, tot_writes = 0; | |
336 | int i, a; | |
a813abf8 MD |
337 | |
338 | if (argc < 4) { | |
339 | show_usage(argc, argv); | |
340 | return -1; | |
341 | } | |
342 | ||
343 | err = sscanf(argv[1], "%u", &nr_readers); | |
344 | if (err != 1) { | |
345 | show_usage(argc, argv); | |
346 | return -1; | |
347 | } | |
348 | ||
349 | err = sscanf(argv[2], "%u", &nr_writers); | |
350 | if (err != 1) { | |
351 | show_usage(argc, argv); | |
352 | return -1; | |
353 | } | |
354 | ||
355 | err = sscanf(argv[3], "%lu", &duration); | |
356 | if (err != 1) { | |
357 | show_usage(argc, argv); | |
358 | return -1; | |
359 | } | |
360 | ||
a813abf8 MD |
361 | for (i = 4; i < argc; i++) { |
362 | if (argv[i][0] != '-') | |
363 | continue; | |
364 | switch (argv[i][1]) { | |
365 | #ifdef DEBUG_YIELD | |
366 | case 'r': | |
367 | yield_active |= YIELD_READ; | |
368 | break; | |
369 | case 'w': | |
370 | yield_active |= YIELD_WRITE; | |
371 | break; | |
372 | #endif | |
373 | case 'a': | |
374 | if (argc < i + 2) { | |
375 | show_usage(argc, argv); | |
376 | return -1; | |
377 | } | |
378 | a = atoi(argv[++i]); | |
2a7ac59d | 379 | cpu_affinities[next_aff++] = a; |
a813abf8 MD |
380 | use_affinity = 1; |
381 | printf_verbose("Adding CPU %d affinity\n", a); | |
382 | break; | |
383 | case 'b': | |
384 | if (argc < i + 2) { | |
385 | show_usage(argc, argv); | |
386 | return -1; | |
387 | } | |
388 | reclaim_batch = atol(argv[++i]); | |
389 | break; | |
390 | case 'c': | |
391 | if (argc < i + 2) { | |
392 | show_usage(argc, argv); | |
393 | return -1; | |
394 | } | |
395 | rduration = atol(argv[++i]); | |
396 | break; | |
397 | case 'd': | |
398 | if (argc < i + 2) { | |
399 | show_usage(argc, argv); | |
400 | return -1; | |
401 | } | |
402 | wdelay = atol(argv[++i]); | |
403 | break; | |
31b598e0 MD |
404 | case 'e': |
405 | if (argc < i + 2) { | |
406 | show_usage(argc, argv); | |
407 | return -1; | |
408 | } | |
409 | wduration = atol(argv[++i]); | |
410 | break; | |
a813abf8 MD |
411 | case 'v': |
412 | verbose_mode = 1; | |
413 | break; | |
414 | } | |
415 | } | |
416 | ||
417 | printf_verbose("running test for %lu seconds, %u readers, %u writers.\n", | |
418 | duration, nr_readers, nr_writers); | |
419 | printf_verbose("Writer delay : %lu loops.\n", wdelay); | |
420 | printf_verbose("Reader duration : %lu loops.\n", rduration); | |
421 | printf_verbose("thread %-6s, thread id : %lx, tid %lu\n", | |
2d72fae2 MD |
422 | "main", (unsigned long) pthread_self(), |
423 | (unsigned long) gettid()); | |
a813abf8 | 424 | |
a813abf8 MD |
425 | tid_reader = malloc(sizeof(*tid_reader) * nr_readers); |
426 | tid_writer = malloc(sizeof(*tid_writer) * nr_writers); | |
427 | count_reader = malloc(sizeof(*count_reader) * nr_readers); | |
428 | tot_nr_writes = malloc(sizeof(*tot_nr_writes) * nr_writers); | |
429 | pending_reclaims = malloc(sizeof(*pending_reclaims) * nr_writers); | |
430 | if (reclaim_batch * sizeof(*pending_reclaims[i].queue) | |
06f22bdb | 431 | < CAA_CACHE_LINE_SIZE) |
a813abf8 | 432 | for (i = 0; i < nr_writers; i++) |
06f22bdb | 433 | pending_reclaims[i].queue = calloc(1, CAA_CACHE_LINE_SIZE); |
a813abf8 MD |
434 | else |
435 | for (i = 0; i < nr_writers; i++) | |
436 | pending_reclaims[i].queue = calloc(reclaim_batch, | |
437 | sizeof(*pending_reclaims[i].queue)); | |
438 | for (i = 0; i < nr_writers; i++) | |
439 | pending_reclaims[i].head = pending_reclaims[i].queue; | |
440 | ||
2a7ac59d MD |
441 | next_aff = 0; |
442 | ||
a813abf8 MD |
443 | for (i = 0; i < nr_readers; i++) { |
444 | err = pthread_create(&tid_reader[i], NULL, thr_reader, | |
445 | &count_reader[i]); | |
446 | if (err != 0) | |
447 | exit(1); | |
448 | } | |
449 | for (i = 0; i < nr_writers; i++) { | |
450 | err = pthread_create(&tid_writer[i], NULL, thr_writer, | |
451 | (void *)(long)i); | |
452 | if (err != 0) | |
453 | exit(1); | |
454 | } | |
455 | ||
5481ddb3 | 456 | cmm_smp_mb(); |
a813abf8 MD |
457 | |
458 | test_go = 1; | |
459 | ||
460 | sleep(duration); | |
461 | ||
462 | test_stop = 1; | |
463 | ||
464 | for (i = 0; i < nr_readers; i++) { | |
465 | err = pthread_join(tid_reader[i], &tret); | |
466 | if (err != 0) | |
467 | exit(1); | |
468 | tot_reads += count_reader[i]; | |
469 | } | |
470 | for (i = 0; i < nr_writers; i++) { | |
471 | err = pthread_join(tid_writer[i], &tret); | |
472 | if (err != 0) | |
473 | exit(1); | |
474 | tot_writes += tot_nr_writes[i]; | |
53091fe5 | 475 | rcu_gc_clear_queue(i); |
a813abf8 MD |
476 | } |
477 | ||
478 | printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads, | |
479 | tot_writes); | |
a50a7b43 | 480 | printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu wdur %6lu " |
a813abf8 | 481 | "nr_writers %3u " |
4a3e0004 MD |
482 | "wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu " |
483 | "batch %u\n", | |
a50a7b43 | 484 | argv[0], duration, nr_readers, rduration, wduration, |
a813abf8 | 485 | nr_writers, wdelay, tot_reads, tot_writes, |
4a3e0004 | 486 | tot_reads + tot_writes, reclaim_batch); |
a813abf8 MD |
487 | free(tid_reader); |
488 | free(tid_writer); | |
489 | free(count_reader); | |
490 | free(tot_nr_writes); | |
491 | for (i = 0; i < nr_writers; i++) | |
492 | free(pending_reclaims[i].queue); | |
493 | free(pending_reclaims); | |
494 | ||
495 | return 0; | |
496 | } |