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