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