Cleanup: cast pthread_self() return value to unsigned long
[urcu.git] / tests / test_urcu_qsbr.c
... / ...
CommitLineData
1/*
2 * test_urcu.c
3 *
4 * Userspace RCU library - test program
5 *
6 * Copyright February 2009 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
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 "../config.h"
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>
34#include <sched.h>
35#include <errno.h>
36
37#include <urcu/arch.h>
38#include <urcu/tls-compat.h>
39
40#ifdef __linux__
41#include <syscall.h>
42#endif
43
44/* hardcoded number of CPUs */
45#define NR_CPUS 16384
46
47#if defined(_syscall0)
48_syscall0(pid_t, gettid)
49#elif defined(__NR_gettid)
50static inline pid_t gettid(void)
51{
52 return syscall(__NR_gettid);
53}
54#else
55#warning "use pid as tid"
56static 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 rcu_debug_yield_read()
66#endif
67#include "urcu-qsbr.h"
68
69struct test_array {
70 int a;
71};
72
73static volatile int test_go, test_stop;
74
75static unsigned long wdelay;
76
77static struct test_array *test_rcu_pointer;
78
79static unsigned long duration;
80
81/* read-side C.S. duration, in loops */
82static unsigned long rduration;
83
84/* write-side C.S. duration, in loops */
85static unsigned long wduration;
86
87static inline void loop_sleep(unsigned long loops)
88{
89 while (loops-- != 0)
90 caa_cpu_relax();
91}
92
93static int verbose_mode;
94
95#define printf_verbose(fmt, args...) \
96 do { \
97 if (verbose_mode) \
98 printf(fmt, args); \
99 } while (0)
100
101static unsigned int cpu_affinities[NR_CPUS];
102static unsigned int next_aff = 0;
103static int use_affinity = 0;
104
105pthread_mutex_t affinity_mutex = PTHREAD_MUTEX_INITIALIZER;
106
107#ifndef HAVE_CPU_SET_T
108typedef unsigned long cpu_set_t;
109# define CPU_ZERO(cpuset) do { *(cpuset) = 0; } while(0)
110# define CPU_SET(cpu, cpuset) do { *(cpuset) |= (1UL << (cpu)); } while(0)
111#endif
112
113static void set_affinity(void)
114{
115#if HAVE_SCHED_SETAFFINITY
116 cpu_set_t mask;
117 int cpu, ret;
118#endif /* HAVE_SCHED_SETAFFINITY */
119
120 if (!use_affinity)
121 return;
122
123#if HAVE_SCHED_SETAFFINITY
124 ret = pthread_mutex_lock(&affinity_mutex);
125 if (ret) {
126 perror("Error in pthread mutex lock");
127 exit(-1);
128 }
129 cpu = cpu_affinities[next_aff++];
130 ret = pthread_mutex_unlock(&affinity_mutex);
131 if (ret) {
132 perror("Error in pthread mutex unlock");
133 exit(-1);
134 }
135 CPU_ZERO(&mask);
136 CPU_SET(cpu, &mask);
137#if SCHED_SETAFFINITY_ARGS == 2
138 sched_setaffinity(0, &mask);
139#else
140 sched_setaffinity(0, sizeof(mask), &mask);
141#endif
142#endif /* HAVE_SCHED_SETAFFINITY */
143}
144
145/*
146 * returns 0 if test should end.
147 */
148static int test_duration_write(void)
149{
150 return !test_stop;
151}
152
153static int test_duration_read(void)
154{
155 return !test_stop;
156}
157
158static DEFINE_URCU_TLS(unsigned long long, nr_writes);
159static DEFINE_URCU_TLS(unsigned long long, nr_reads);
160
161static unsigned int nr_readers;
162static unsigned int nr_writers;
163
164pthread_mutex_t rcu_copy_mutex = PTHREAD_MUTEX_INITIALIZER;
165
166void rcu_copy_mutex_lock(void)
167{
168 int ret;
169 ret = pthread_mutex_lock(&rcu_copy_mutex);
170 if (ret) {
171 perror("Error in pthread mutex lock");
172 exit(-1);
173 }
174}
175
176void rcu_copy_mutex_unlock(void)
177{
178 int ret;
179
180 ret = pthread_mutex_unlock(&rcu_copy_mutex);
181 if (ret) {
182 perror("Error in pthread mutex unlock");
183 exit(-1);
184 }
185}
186
187/*
188 * malloc/free are reusing memory areas too quickly, which does not let us
189 * test races appropriately. Use a large circular array for allocations.
190 * ARRAY_SIZE is larger than nr_writers, and we keep the mutex across
191 * both alloc and free, which insures we never run over our tail.
192 */
193#define ARRAY_SIZE (1048576 * nr_writers)
194#define ARRAY_POISON 0xDEADBEEF
195static int array_index;
196static struct test_array *test_array;
197
198static struct test_array *test_array_alloc(void)
199{
200 struct test_array *ret;
201 int index;
202
203 index = array_index % ARRAY_SIZE;
204 assert(test_array[index].a == ARRAY_POISON ||
205 test_array[index].a == 0);
206 ret = &test_array[index];
207 array_index++;
208 if (array_index == ARRAY_SIZE)
209 array_index = 0;
210 return ret;
211}
212
213static void test_array_free(struct test_array *ptr)
214{
215 if (!ptr)
216 return;
217 ptr->a = ARRAY_POISON;
218}
219
220void *thr_reader(void *_count)
221{
222 unsigned long long *count = _count;
223 struct test_array *local_ptr;
224
225 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
226 "reader", (unsigned long) pthread_self(),
227 (unsigned long) gettid());
228
229 set_affinity();
230
231 rcu_register_thread();
232
233 while (!test_go)
234 {
235 }
236 cmm_smp_mb();
237
238 for (;;) {
239 rcu_read_lock();
240 local_ptr = rcu_dereference(test_rcu_pointer);
241 rcu_debug_yield_read();
242 if (local_ptr)
243 assert(local_ptr->a == 8);
244 if (caa_unlikely(rduration))
245 loop_sleep(rduration);
246 rcu_read_unlock();
247 URCU_TLS(nr_reads)++;
248 /* QS each 1024 reads */
249 if (caa_unlikely((URCU_TLS(nr_reads) & ((1 << 10) - 1)) == 0))
250 rcu_quiescent_state();
251 if (caa_unlikely(!test_duration_read()))
252 break;
253 }
254
255 rcu_unregister_thread();
256
257 /* test extra thread registration */
258 rcu_register_thread();
259 rcu_unregister_thread();
260
261 *count = URCU_TLS(nr_reads);
262 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
263 "reader", (unsigned long) pthread_self(),
264 (unsigned long) gettid());
265 return ((void*)1);
266
267}
268
269void *thr_writer(void *_count)
270{
271 unsigned long long *count = _count;
272 struct test_array *new, *old;
273
274 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
275 "writer", (unsigned long) pthread_self(),
276 (unsigned long) gettid());
277
278 set_affinity();
279
280 while (!test_go)
281 {
282 }
283 cmm_smp_mb();
284
285 for (;;) {
286 rcu_copy_mutex_lock();
287 new = test_array_alloc();
288 new->a = 8;
289 old = rcu_xchg_pointer(&test_rcu_pointer, new);
290 if (caa_unlikely(wduration))
291 loop_sleep(wduration);
292 synchronize_rcu();
293 /* can be done after unlock */
294 if (old)
295 old->a = 0;
296 test_array_free(old);
297 rcu_copy_mutex_unlock();
298 URCU_TLS(nr_writes)++;
299 if (caa_unlikely(!test_duration_write()))
300 break;
301 if (caa_unlikely(wdelay))
302 loop_sleep(wdelay);
303 }
304
305 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
306 "writer", (unsigned long) pthread_self(),
307 (unsigned long) gettid());
308 *count = URCU_TLS(nr_writes);
309 return ((void*)2);
310}
311
312void show_usage(int argc, char **argv)
313{
314 printf("Usage : %s nr_readers nr_writers duration (s)", argv[0]);
315#ifdef DEBUG_YIELD
316 printf(" [-r] [-w] (yield reader and/or writer)");
317#endif
318 printf(" [-d delay] (writer period (us))");
319 printf(" [-c duration] (reader C.S. duration (in loops))");
320 printf(" [-e duration] (writer C.S. duration (in loops))");
321 printf(" [-v] (verbose output)");
322 printf(" [-a cpu#] [-a cpu#]... (affinity)");
323 printf("\n");
324}
325
326int main(int argc, char **argv)
327{
328 int err;
329 pthread_t *tid_reader, *tid_writer;
330 void *tret;
331 unsigned long long *count_reader, *count_writer;
332 unsigned long long tot_reads = 0, tot_writes = 0;
333 int i, a;
334
335 if (argc < 4) {
336 show_usage(argc, argv);
337 return -1;
338 }
339
340 err = sscanf(argv[1], "%u", &nr_readers);
341 if (err != 1) {
342 show_usage(argc, argv);
343 return -1;
344 }
345
346 err = sscanf(argv[2], "%u", &nr_writers);
347 if (err != 1) {
348 show_usage(argc, argv);
349 return -1;
350 }
351
352 err = sscanf(argv[3], "%lu", &duration);
353 if (err != 1) {
354 show_usage(argc, argv);
355 return -1;
356 }
357
358 for (i = 4; i < argc; i++) {
359 if (argv[i][0] != '-')
360 continue;
361 switch (argv[i][1]) {
362#ifdef DEBUG_YIELD
363 case 'r':
364 rcu_yield_active |= RCU_RCU_YIELD_READ;
365 break;
366 case 'w':
367 rcu_yield_active |= RCU_RCU_YIELD_WRITE;
368 break;
369#endif
370 case 'a':
371 if (argc < i + 2) {
372 show_usage(argc, argv);
373 return -1;
374 }
375 a = atoi(argv[++i]);
376 cpu_affinities[next_aff++] = a;
377 use_affinity = 1;
378 printf_verbose("Adding CPU %d affinity\n", a);
379 break;
380 case 'c':
381 if (argc < i + 2) {
382 show_usage(argc, argv);
383 return -1;
384 }
385 rduration = atol(argv[++i]);
386 break;
387 case 'd':
388 if (argc < i + 2) {
389 show_usage(argc, argv);
390 return -1;
391 }
392 wdelay = atol(argv[++i]);
393 break;
394 case 'e':
395 if (argc < i + 2) {
396 show_usage(argc, argv);
397 return -1;
398 }
399 wduration = atol(argv[++i]);
400 break;
401 case 'v':
402 verbose_mode = 1;
403 break;
404 }
405 }
406
407 printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
408 duration, nr_readers, nr_writers);
409 printf_verbose("Writer delay : %lu loops.\n", wdelay);
410 printf_verbose("Reader duration : %lu loops.\n", rduration);
411 printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
412 "main", (unsigned long) pthread_self(),
413 (unsigned long) gettid());
414
415 test_array = calloc(1, sizeof(*test_array) * ARRAY_SIZE);
416 tid_reader = malloc(sizeof(*tid_reader) * nr_readers);
417 tid_writer = malloc(sizeof(*tid_writer) * nr_writers);
418 count_reader = malloc(sizeof(*count_reader) * nr_readers);
419 count_writer = malloc(sizeof(*count_writer) * nr_writers);
420
421 next_aff = 0;
422
423 for (i = 0; i < nr_readers; i++) {
424 err = pthread_create(&tid_reader[i], NULL, thr_reader,
425 &count_reader[i]);
426 if (err != 0)
427 exit(1);
428 }
429 for (i = 0; i < nr_writers; i++) {
430 err = pthread_create(&tid_writer[i], NULL, thr_writer,
431 &count_writer[i]);
432 if (err != 0)
433 exit(1);
434 }
435
436 cmm_smp_mb();
437
438 test_go = 1;
439
440 sleep(duration);
441
442 test_stop = 1;
443
444 for (i = 0; i < nr_readers; i++) {
445 err = pthread_join(tid_reader[i], &tret);
446 if (err != 0)
447 exit(1);
448 tot_reads += count_reader[i];
449 }
450 for (i = 0; i < nr_writers; i++) {
451 err = pthread_join(tid_writer[i], &tret);
452 if (err != 0)
453 exit(1);
454 tot_writes += count_writer[i];
455 }
456
457 printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads,
458 tot_writes);
459 printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu wdur %6lu "
460 "nr_writers %3u "
461 "wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu\n",
462 argv[0], duration, nr_readers, rduration, wduration,
463 nr_writers, wdelay, tot_reads, tot_writes,
464 tot_reads + tot_writes);
465 test_array_free(test_rcu_pointer);
466 free(test_array);
467 free(tid_reader);
468 free(tid_writer);
469 free(count_reader);
470 free(count_writer);
471 return 0;
472}
This page took 0.024465 seconds and 4 git commands to generate.