4 * Userspace RCU library - example RCU-based lock-free stack
6 * Copyright February 2010 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
7 * Copyright February 2010 - Paolo Bonzini <pbonzini@redhat.com>
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.
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.
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.
25 #include "../config.h"
32 #include <sys/types.h>
40 #include <urcu/arch.h>
41 #include <urcu/tls-compat.h>
47 /* hardcoded number of CPUs */
50 #if defined(_syscall0)
51 _syscall0(pid_t
, gettid
)
52 #elif defined(__NR_gettid)
53 static inline pid_t
gettid(void)
55 return syscall(__NR_gettid
);
58 #warning "use pid as tid"
59 static inline pid_t
gettid(void)
65 #ifndef DYNAMIC_LINK_TEST
69 #include <urcu/wfstack.h>
71 static volatile int test_go
, test_stop
;
73 static unsigned long rduration
;
75 static unsigned long duration
;
77 /* read-side C.S. duration, in loops */
78 static unsigned long wdelay
;
80 static inline void loop_sleep(unsigned long loops
)
86 static int verbose_mode
;
88 #define printf_verbose(fmt, args...) \
94 static unsigned int cpu_affinities
[NR_CPUS
];
95 static unsigned int next_aff
= 0;
96 static int use_affinity
= 0;
98 pthread_mutex_t affinity_mutex
= PTHREAD_MUTEX_INITIALIZER
;
100 #ifndef HAVE_CPU_SET_T
101 typedef unsigned long cpu_set_t
;
102 # define CPU_ZERO(cpuset) do { *(cpuset) = 0; } while(0)
103 # define CPU_SET(cpu, cpuset) do { *(cpuset) |= (1UL << (cpu)); } while(0)
106 static void set_affinity(void)
108 #if HAVE_SCHED_SETAFFINITY
111 #endif /* HAVE_SCHED_SETAFFINITY */
116 #if HAVE_SCHED_SETAFFINITY
117 ret
= pthread_mutex_lock(&affinity_mutex
);
119 perror("Error in pthread mutex lock");
122 cpu
= cpu_affinities
[next_aff
++];
123 ret
= pthread_mutex_unlock(&affinity_mutex
);
125 perror("Error in pthread mutex unlock");
131 #if SCHED_SETAFFINITY_ARGS == 2
132 sched_setaffinity(0, &mask
);
134 sched_setaffinity(0, sizeof(mask
), &mask
);
136 #endif /* HAVE_SCHED_SETAFFINITY */
140 * returns 0 if test should end.
142 static int test_duration_dequeue(void)
147 static int test_duration_enqueue(void)
152 static DEFINE_URCU_TLS(unsigned long long, nr_dequeues
);
153 static DEFINE_URCU_TLS(unsigned long long, nr_enqueues
);
155 static DEFINE_URCU_TLS(unsigned long long, nr_successful_dequeues
);
156 static DEFINE_URCU_TLS(unsigned long long, nr_successful_enqueues
);
158 static unsigned int nr_enqueuers
;
159 static unsigned int nr_dequeuers
;
161 static struct cds_wfs_stack s
;
163 void *thr_enqueuer(void *_count
)
165 unsigned long long *count
= _count
;
167 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
168 "enqueuer", pthread_self(), (unsigned long)gettid());
178 struct cds_wfs_node
*node
= malloc(sizeof(*node
));
181 cds_wfs_node_init(node
);
182 cds_wfs_push(&s
, node
);
183 URCU_TLS(nr_successful_enqueues
)++;
185 if (caa_unlikely(wdelay
))
188 URCU_TLS(nr_enqueues
)++;
189 if (caa_unlikely(!test_duration_enqueue()))
193 count
[0] = URCU_TLS(nr_enqueues
);
194 count
[1] = URCU_TLS(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(),
198 URCU_TLS(nr_enqueues
), URCU_TLS(nr_successful_enqueues
));
203 void *thr_dequeuer(void *_count
)
205 unsigned long long *count
= _count
;
207 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
208 "dequeuer", pthread_self(), (unsigned long)gettid());
218 struct cds_wfs_node
*node
= cds_wfs_pop_blocking(&s
);
222 URCU_TLS(nr_successful_dequeues
)++;
225 URCU_TLS(nr_dequeues
)++;
226 if (caa_unlikely(!test_duration_dequeue()))
228 if (caa_unlikely(rduration
))
229 loop_sleep(rduration
);
232 printf_verbose("dequeuer thread_end, thread id : %lx, tid %lu, "
233 "dequeues %llu, successful_dequeues %llu\n",
234 pthread_self(), (unsigned long)gettid(),
235 URCU_TLS(nr_dequeues
), URCU_TLS(nr_successful_dequeues
));
236 count
[0] = URCU_TLS(nr_dequeues
);
237 count
[1] = URCU_TLS(nr_successful_dequeues
);
241 void test_end(struct cds_wfs_stack
*s
, unsigned long long *nr_dequeues
)
243 struct cds_wfs_node
*node
;
246 node
= cds_wfs_pop_blocking(s
);
254 void show_usage(int argc
, char **argv
)
256 printf("Usage : %s nr_dequeuers nr_enqueuers duration (s)", argv
[0]);
257 printf(" [-d delay] (enqueuer period (in loops))");
258 printf(" [-c duration] (dequeuer period (in loops))");
259 printf(" [-v] (verbose output)");
260 printf(" [-a cpu#] [-a cpu#]... (affinity)");
264 int main(int argc
, char **argv
)
267 pthread_t
*tid_enqueuer
, *tid_dequeuer
;
269 unsigned long long *count_enqueuer
, *count_dequeuer
;
270 unsigned long long tot_enqueues
= 0, tot_dequeues
= 0;
271 unsigned long long tot_successful_enqueues
= 0,
272 tot_successful_dequeues
= 0;
273 unsigned long long end_dequeues
= 0;
277 show_usage(argc
, argv
);
281 err
= sscanf(argv
[1], "%u", &nr_dequeuers
);
283 show_usage(argc
, argv
);
287 err
= sscanf(argv
[2], "%u", &nr_enqueuers
);
289 show_usage(argc
, argv
);
293 err
= sscanf(argv
[3], "%lu", &duration
);
295 show_usage(argc
, argv
);
299 for (i
= 4; i
< argc
; i
++) {
300 if (argv
[i
][0] != '-')
302 switch (argv
[i
][1]) {
305 show_usage(argc
, argv
);
309 cpu_affinities
[next_aff
++] = a
;
311 printf_verbose("Adding CPU %d affinity\n", a
);
315 show_usage(argc
, argv
);
318 rduration
= atol(argv
[++i
]);
322 show_usage(argc
, argv
);
325 wdelay
= atol(argv
[++i
]);
333 printf_verbose("running test for %lu seconds, %u enqueuers, "
335 duration
, nr_enqueuers
, nr_dequeuers
);
336 printf_verbose("Writer delay : %lu loops.\n", rduration
);
337 printf_verbose("Reader duration : %lu loops.\n", wdelay
);
338 printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
339 "main", pthread_self(), (unsigned long)gettid());
341 tid_enqueuer
= malloc(sizeof(*tid_enqueuer
) * nr_enqueuers
);
342 tid_dequeuer
= malloc(sizeof(*tid_dequeuer
) * nr_dequeuers
);
343 count_enqueuer
= malloc(2 * sizeof(*count_enqueuer
) * nr_enqueuers
);
344 count_dequeuer
= malloc(2 * sizeof(*count_dequeuer
) * nr_dequeuers
);
349 for (i
= 0; i
< nr_enqueuers
; i
++) {
350 err
= pthread_create(&tid_enqueuer
[i
], NULL
, thr_enqueuer
,
351 &count_enqueuer
[2 * i
]);
355 for (i
= 0; i
< nr_dequeuers
; i
++) {
356 err
= pthread_create(&tid_dequeuer
[i
], NULL
, thr_dequeuer
,
357 &count_dequeuer
[2 * i
]);
366 for (i
= 0; i
< duration
; i
++) {
374 for (i
= 0; i
< nr_enqueuers
; i
++) {
375 err
= pthread_join(tid_enqueuer
[i
], &tret
);
378 tot_enqueues
+= count_enqueuer
[2 * i
];
379 tot_successful_enqueues
+= count_enqueuer
[2 * i
+ 1];
381 for (i
= 0; i
< nr_dequeuers
; i
++) {
382 err
= pthread_join(tid_dequeuer
[i
], &tret
);
385 tot_dequeues
+= count_dequeuer
[2 * i
];
386 tot_successful_dequeues
+= count_dequeuer
[2 * i
+ 1];
389 test_end(&s
, &end_dequeues
);
391 printf_verbose("total number of enqueues : %llu, dequeues %llu\n",
392 tot_enqueues
, tot_dequeues
);
393 printf_verbose("total number of successful enqueues : %llu, "
394 "successful dequeues %llu\n",
395 tot_successful_enqueues
, tot_successful_dequeues
);
396 printf("SUMMARY %-25s testdur %4lu nr_enqueuers %3u wdelay %6lu "
398 "rdur %6lu nr_enqueues %12llu nr_dequeues %12llu "
399 "successful enqueues %12llu successful dequeues %12llu "
400 "end_dequeues %llu nr_ops %12llu\n",
401 argv
[0], duration
, nr_enqueuers
, wdelay
,
402 nr_dequeuers
, rduration
, tot_enqueues
, tot_dequeues
,
403 tot_successful_enqueues
,
404 tot_successful_dequeues
, end_dequeues
,
405 tot_enqueues
+ tot_dequeues
);
406 if (tot_successful_enqueues
!= tot_successful_dequeues
+ end_dequeues
)
407 printf("WARNING! Discrepancy between nr succ. enqueues %llu vs "
408 "succ. dequeues + end dequeues %llu.\n",
409 tot_successful_enqueues
,
410 tot_successful_dequeues
+ end_dequeues
);
412 free(count_enqueuer
);
413 free(count_dequeuer
);