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