Maintain list of struct call_rcu_data to keep valgrind happy.
[urcu.git] / tests / test_urcu_lfs.c
1 /*
2 * test_urcu_lfs.c
3 *
4 * Userspace RCU library - example RCU-based lock-free stack
5 *
6 * Copyright February 2010 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
7 * Copyright February 2010 - Paolo Bonzini <pbonzini@redhat.com>
8 *
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 2 of the License, or
12 * (at your option) any later version.
13 *
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
18 *
19 * You should have received a copy of the GNU General Public License along
20 * with this program; if not, write to the Free Software Foundation, Inc.,
21 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
22 */
23
24 #define _GNU_SOURCE
25 #include "../config.h"
26 #include <stdio.h>
27 #include <pthread.h>
28 #include <stdlib.h>
29 #include <stdint.h>
30 #include <stdbool.h>
31 #include <string.h>
32 #include <sys/types.h>
33 #include <sys/wait.h>
34 #include <unistd.h>
35 #include <stdio.h>
36 #include <assert.h>
37 #include <sys/syscall.h>
38 #include <sched.h>
39 #include <errno.h>
40
41 #include <urcu/arch.h>
42
43 /* hardcoded number of CPUs */
44 #define NR_CPUS 16384
45
46 #if defined(_syscall0)
47 _syscall0(pid_t, gettid)
48 #elif defined(__NR_gettid)
49 static inline pid_t gettid(void)
50 {
51 return syscall(__NR_gettid);
52 }
53 #else
54 #warning "use pid as tid"
55 static inline pid_t gettid(void)
56 {
57 return getpid();
58 }
59 #endif
60
61 #ifndef DYNAMIC_LINK_TEST
62 #define _LGPL_SOURCE
63 #endif
64 #include <urcu.h>
65 #include <urcu/rculfstack.h>
66 #include <urcu-defer.h>
67
68 static volatile int test_go, test_stop;
69
70 static unsigned long rduration;
71
72 static unsigned long duration;
73
74 /* read-side C.S. duration, in loops */
75 static unsigned long wdelay;
76
77 static inline void loop_sleep(unsigned long l)
78 {
79 while(l-- != 0)
80 caa_cpu_relax();
81 }
82
83 static int verbose_mode;
84
85 #define printf_verbose(fmt, args...) \
86 do { \
87 if (verbose_mode) \
88 printf(fmt, args); \
89 } while (0)
90
91 static unsigned int cpu_affinities[NR_CPUS];
92 static unsigned int next_aff = 0;
93 static int use_affinity = 0;
94
95 pthread_mutex_t affinity_mutex = PTHREAD_MUTEX_INITIALIZER;
96
97 #ifndef HAVE_CPU_SET_T
98 typedef unsigned long cpu_set_t;
99 # define CPU_ZERO(cpuset) do { *(cpuset) = 0; } while(0)
100 # define CPU_SET(cpu, cpuset) do { *(cpuset) |= (1UL << (cpu)); } while(0)
101 #endif
102
103 static void set_affinity(void)
104 {
105 cpu_set_t mask;
106 int cpu;
107 int ret;
108
109 if (!use_affinity)
110 return;
111
112 #if HAVE_SCHED_SETAFFINITY
113 ret = pthread_mutex_lock(&affinity_mutex);
114 if (ret) {
115 perror("Error in pthread mutex lock");
116 exit(-1);
117 }
118 cpu = cpu_affinities[next_aff++];
119 ret = pthread_mutex_unlock(&affinity_mutex);
120 if (ret) {
121 perror("Error in pthread mutex unlock");
122 exit(-1);
123 }
124
125 CPU_ZERO(&mask);
126 CPU_SET(cpu, &mask);
127 #if SCHED_SETAFFINITY_ARGS == 2
128 sched_setaffinity(0, &mask);
129 #else
130 sched_setaffinity(0, sizeof(mask), &mask);
131 #endif
132 #endif /* HAVE_SCHED_SETAFFINITY */
133 }
134
135 /*
136 * returns 0 if test should end.
137 */
138 static int test_duration_dequeue(void)
139 {
140 return !test_stop;
141 }
142
143 static int test_duration_enqueue(void)
144 {
145 return !test_stop;
146 }
147
148 static unsigned long long __thread nr_dequeues;
149 static unsigned long long __thread nr_enqueues;
150
151 static unsigned long long __thread nr_successful_dequeues;
152 static unsigned long long __thread nr_successful_enqueues;
153
154 static unsigned int nr_enqueuers;
155 static unsigned int nr_dequeuers;
156
157 static struct cds_lfs_stack_rcu s;
158
159 void *thr_enqueuer(void *_count)
160 {
161 unsigned long long *count = _count;
162
163 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
164 "enqueuer", pthread_self(), (unsigned long)gettid());
165
166 set_affinity();
167
168 rcu_register_thread();
169
170 while (!test_go)
171 {
172 }
173 cmm_smp_mb();
174
175 for (;;) {
176 struct cds_lfs_node_rcu *node = malloc(sizeof(*node));
177 if (!node)
178 goto fail;
179 cds_lfs_node_init_rcu(node);
180 cds_lfs_push_rcu(&s, node);
181 nr_successful_enqueues++;
182
183 if (unlikely(wdelay))
184 loop_sleep(wdelay);
185 fail:
186 nr_enqueues++;
187 if (unlikely(!test_duration_enqueue()))
188 break;
189 }
190
191 rcu_unregister_thread();
192
193 count[0] = nr_enqueues;
194 count[1] = nr_successful_enqueues;
195 printf_verbose("enqueuer thread_end, thread id : %lx, tid %lu, "
196 "enqueues %llu successful_enqueues %llu\n",
197 pthread_self(), (unsigned long)gettid(), nr_enqueues,
198 nr_successful_enqueues);
199 return ((void*)1);
200
201 }
202
203 void *thr_dequeuer(void *_count)
204 {
205 unsigned long long *count = _count;
206 int ret;
207
208 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
209 "dequeuer", pthread_self(), (unsigned long)gettid());
210
211 set_affinity();
212
213 ret = rcu_defer_register_thread();
214 if (ret) {
215 printf("Error in rcu_defer_register_thread\n");
216 exit(-1);
217 }
218 rcu_register_thread();
219
220 while (!test_go)
221 {
222 }
223 cmm_smp_mb();
224
225 for (;;) {
226 struct cds_lfs_node_rcu *node = cds_lfs_pop_rcu(&s);
227
228 if (node) {
229 defer_rcu(free, node);
230 nr_successful_dequeues++;
231 }
232
233 nr_dequeues++;
234 if (unlikely(!test_duration_dequeue()))
235 break;
236 if (unlikely(rduration))
237 loop_sleep(rduration);
238 }
239
240 rcu_unregister_thread();
241 rcu_defer_unregister_thread();
242
243 printf_verbose("dequeuer thread_end, thread id : %lx, tid %lu, "
244 "dequeues %llu, successful_dequeues %llu\n",
245 pthread_self(), (unsigned long)gettid(), nr_dequeues,
246 nr_successful_dequeues);
247 count[0] = nr_dequeues;
248 count[1] = nr_successful_dequeues;
249 return ((void*)2);
250 }
251
252 void test_end(struct cds_lfs_stack_rcu *s, unsigned long long *nr_dequeues)
253 {
254 struct cds_lfs_node_rcu *node;
255
256 do {
257 node = cds_lfs_pop_rcu(s);
258 if (node) {
259 free(node);
260 (*nr_dequeues)++;
261 }
262 } while (node);
263 }
264
265 void show_usage(int argc, char **argv)
266 {
267 printf("Usage : %s nr_dequeuers nr_enqueuers duration (s)", argv[0]);
268 printf(" [-d delay] (enqueuer period (in loops))");
269 printf(" [-c duration] (dequeuer period (in loops))");
270 printf(" [-v] (verbose output)");
271 printf(" [-a cpu#] [-a cpu#]... (affinity)");
272 printf("\n");
273 }
274
275 int main(int argc, char **argv)
276 {
277 int err;
278 pthread_t *tid_enqueuer, *tid_dequeuer;
279 void *tret;
280 unsigned long long *count_enqueuer, *count_dequeuer;
281 unsigned long long tot_enqueues = 0, tot_dequeues = 0;
282 unsigned long long tot_successful_enqueues = 0,
283 tot_successful_dequeues = 0;
284 unsigned long long end_dequeues = 0;
285 int i, a;
286
287 if (argc < 4) {
288 show_usage(argc, argv);
289 return -1;
290 }
291
292 err = sscanf(argv[1], "%u", &nr_dequeuers);
293 if (err != 1) {
294 show_usage(argc, argv);
295 return -1;
296 }
297
298 err = sscanf(argv[2], "%u", &nr_enqueuers);
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 case 'a':
315 if (argc < i + 2) {
316 show_usage(argc, argv);
317 return -1;
318 }
319 a = atoi(argv[++i]);
320 cpu_affinities[next_aff++] = a;
321 use_affinity = 1;
322 printf_verbose("Adding CPU %d affinity\n", a);
323 break;
324 case 'c':
325 if (argc < i + 2) {
326 show_usage(argc, argv);
327 return -1;
328 }
329 rduration = atol(argv[++i]);
330 break;
331 case 'd':
332 if (argc < i + 2) {
333 show_usage(argc, argv);
334 return -1;
335 }
336 wdelay = atol(argv[++i]);
337 break;
338 case 'v':
339 verbose_mode = 1;
340 break;
341 }
342 }
343
344 printf_verbose("running test for %lu seconds, %u enqueuers, "
345 "%u dequeuers.\n",
346 duration, nr_enqueuers, nr_dequeuers);
347 printf_verbose("Writer delay : %lu loops.\n", rduration);
348 printf_verbose("Reader duration : %lu loops.\n", wdelay);
349 printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
350 "main", pthread_self(), (unsigned long)gettid());
351
352 tid_enqueuer = malloc(sizeof(*tid_enqueuer) * nr_enqueuers);
353 tid_dequeuer = malloc(sizeof(*tid_dequeuer) * nr_dequeuers);
354 count_enqueuer = malloc(2 * sizeof(*count_enqueuer) * nr_enqueuers);
355 count_dequeuer = malloc(2 * sizeof(*count_dequeuer) * nr_dequeuers);
356 cds_lfs_init_rcu(&s);
357
358 next_aff = 0;
359
360 for (i = 0; i < nr_enqueuers; i++) {
361 err = pthread_create(&tid_enqueuer[i], NULL, thr_enqueuer,
362 &count_enqueuer[2 * i]);
363 if (err != 0)
364 exit(1);
365 }
366 for (i = 0; i < nr_dequeuers; i++) {
367 err = pthread_create(&tid_dequeuer[i], NULL, thr_dequeuer,
368 &count_dequeuer[2 * i]);
369 if (err != 0)
370 exit(1);
371 }
372
373 cmm_smp_mb();
374
375 test_go = 1;
376
377 for (i = 0; i < duration; i++) {
378 sleep(1);
379 if (verbose_mode)
380 write (1, ".", 1);
381 }
382
383 test_stop = 1;
384
385 for (i = 0; i < nr_enqueuers; i++) {
386 err = pthread_join(tid_enqueuer[i], &tret);
387 if (err != 0)
388 exit(1);
389 tot_enqueues += count_enqueuer[2 * i];
390 tot_successful_enqueues += count_enqueuer[2 * i + 1];
391 }
392 for (i = 0; i < nr_dequeuers; i++) {
393 err = pthread_join(tid_dequeuer[i], &tret);
394 if (err != 0)
395 exit(1);
396 tot_dequeues += count_dequeuer[2 * i];
397 tot_successful_dequeues += count_dequeuer[2 * i + 1];
398 }
399
400 test_end(&s, &end_dequeues);
401
402 printf_verbose("total number of enqueues : %llu, dequeues %llu\n",
403 tot_enqueues, tot_dequeues);
404 printf_verbose("total number of successful enqueues : %llu, "
405 "successful dequeues %llu\n",
406 tot_successful_enqueues, tot_successful_dequeues);
407 printf("SUMMARY %-25s testdur %4lu nr_enqueuers %3u wdelay %6lu "
408 "nr_dequeuers %3u "
409 "rdur %6lu nr_enqueues %12llu nr_dequeues %12llu "
410 "successful enqueues %12llu successful dequeues %12llu "
411 "end_dequeues %llu nr_ops %12llu\n",
412 argv[0], duration, nr_enqueuers, wdelay,
413 nr_dequeuers, rduration, tot_enqueues, tot_dequeues,
414 tot_successful_enqueues,
415 tot_successful_dequeues, end_dequeues,
416 tot_enqueues + tot_dequeues);
417 if (tot_successful_enqueues != tot_successful_dequeues + end_dequeues)
418 printf("WARNING! Discrepancy between nr succ. enqueues %llu vs "
419 "succ. dequeues + end dequeues %llu.\n",
420 tot_successful_enqueues,
421 tot_successful_dequeues + end_dequeues);
422
423 free(count_enqueuer);
424 free(count_dequeuer);
425 free(tid_enqueuer);
426 free(tid_dequeuer);
427 return 0;
428 }
This page took 0.041103 seconds and 4 git commands to generate.