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