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>
39 #include <urcu/arch.h>
40 #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 l
)
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 static void set_affinity(void)
109 #if HAVE_SCHED_SETAFFINITY
110 ret
= pthread_mutex_lock(&affinity_mutex
);
112 perror("Error in pthread mutex lock");
115 cpu
= cpu_affinities
[next_aff
++];
116 ret
= pthread_mutex_unlock(&affinity_mutex
);
118 perror("Error in pthread mutex unlock");
124 #if SCHED_SETAFFINITY_ARGS == 2
125 sched_setaffinity(0, &mask
);
127 sched_setaffinity(0, sizeof(mask
), &mask
);
129 #endif /* HAVE_SCHED_SETAFFINITY */
133 * returns 0 if test should end.
135 static int test_duration_dequeue(void)
140 static int test_duration_enqueue(void)
145 static DEFINE_URCU_TLS(unsigned long long, nr_dequeues
);
146 static DEFINE_URCU_TLS(unsigned long long, nr_enqueues
);
148 static DEFINE_URCU_TLS(unsigned long long, nr_successful_dequeues
);
149 static DEFINE_URCU_TLS(unsigned long long, nr_successful_enqueues
);
151 static unsigned int nr_enqueuers
;
152 static unsigned int nr_dequeuers
;
154 static struct cds_wfs_stack s
;
156 void *thr_enqueuer(void *_count
)
158 unsigned long long *count
= _count
;
160 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
161 "enqueuer", (unsigned long) pthread_self(),
162 (unsigned long) gettid());
172 struct cds_wfs_node
*node
= malloc(sizeof(*node
));
175 cds_wfs_node_init(node
);
176 cds_wfs_push(&s
, node
);
177 URCU_TLS(nr_successful_enqueues
)++;
179 if (caa_unlikely(wdelay
))
182 URCU_TLS(nr_enqueues
)++;
183 if (caa_unlikely(!test_duration_enqueue()))
187 count
[0] = URCU_TLS(nr_enqueues
);
188 count
[1] = URCU_TLS(nr_successful_enqueues
);
189 printf_verbose("enqueuer thread_end, thread id : %lx, tid %lu, "
190 "enqueues %llu successful_enqueues %llu\n",
192 (unsigned long) gettid(),
193 URCU_TLS(nr_enqueues
), URCU_TLS(nr_successful_enqueues
));
198 void *thr_dequeuer(void *_count
)
200 unsigned long long *count
= _count
;
202 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
203 "dequeuer", (unsigned long) pthread_self(),
204 (unsigned long) gettid());
214 struct cds_wfs_node
*node
= cds_wfs_pop_blocking(&s
);
218 URCU_TLS(nr_successful_dequeues
)++;
221 URCU_TLS(nr_dequeues
)++;
222 if (caa_unlikely(!test_duration_dequeue()))
224 if (caa_unlikely(rduration
))
225 loop_sleep(rduration
);
228 printf_verbose("dequeuer thread_end, thread id : %lx, tid %lu, "
229 "dequeues %llu, successful_dequeues %llu\n",
231 (unsigned long) gettid(),
232 URCU_TLS(nr_dequeues
), URCU_TLS(nr_successful_dequeues
));
233 count
[0] = URCU_TLS(nr_dequeues
);
234 count
[1] = URCU_TLS(nr_successful_dequeues
);
238 void test_end(struct cds_wfs_stack
*s
, unsigned long long *nr_dequeues
)
240 struct cds_wfs_node
*node
;
243 node
= cds_wfs_pop_blocking(s
);
251 void show_usage(int argc
, char **argv
)
253 printf("Usage : %s nr_dequeuers nr_enqueuers duration (s)", argv
[0]);
254 printf(" [-d delay] (enqueuer period (in loops))");
255 printf(" [-c duration] (dequeuer period (in loops))");
256 printf(" [-v] (verbose output)");
257 printf(" [-a cpu#] [-a cpu#]... (affinity)");
261 int main(int argc
, char **argv
)
264 pthread_t
*tid_enqueuer
, *tid_dequeuer
;
266 unsigned long long *count_enqueuer
, *count_dequeuer
;
267 unsigned long long tot_enqueues
= 0, tot_dequeues
= 0;
268 unsigned long long tot_successful_enqueues
= 0,
269 tot_successful_dequeues
= 0;
270 unsigned long long end_dequeues
= 0;
274 show_usage(argc
, argv
);
278 err
= sscanf(argv
[1], "%u", &nr_dequeuers
);
280 show_usage(argc
, argv
);
284 err
= sscanf(argv
[2], "%u", &nr_enqueuers
);
286 show_usage(argc
, argv
);
290 err
= sscanf(argv
[3], "%lu", &duration
);
292 show_usage(argc
, argv
);
296 for (i
= 4; i
< argc
; i
++) {
297 if (argv
[i
][0] != '-')
299 switch (argv
[i
][1]) {
302 show_usage(argc
, argv
);
306 cpu_affinities
[next_aff
++] = a
;
308 printf_verbose("Adding CPU %d affinity\n", a
);
312 show_usage(argc
, argv
);
315 rduration
= atol(argv
[++i
]);
319 show_usage(argc
, argv
);
322 wdelay
= atol(argv
[++i
]);
330 printf_verbose("running test for %lu seconds, %u enqueuers, "
332 duration
, nr_enqueuers
, nr_dequeuers
);
333 printf_verbose("Writer delay : %lu loops.\n", rduration
);
334 printf_verbose("Reader duration : %lu loops.\n", wdelay
);
335 printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
336 "main", (unsigned long) pthread_self(),
337 (unsigned long) gettid());
339 tid_enqueuer
= malloc(sizeof(*tid_enqueuer
) * nr_enqueuers
);
340 tid_dequeuer
= malloc(sizeof(*tid_dequeuer
) * nr_dequeuers
);
341 count_enqueuer
= malloc(2 * sizeof(*count_enqueuer
) * nr_enqueuers
);
342 count_dequeuer
= malloc(2 * sizeof(*count_dequeuer
) * nr_dequeuers
);
347 for (i
= 0; i
< nr_enqueuers
; i
++) {
348 err
= pthread_create(&tid_enqueuer
[i
], NULL
, thr_enqueuer
,
349 &count_enqueuer
[2 * i
]);
353 for (i
= 0; i
< nr_dequeuers
; i
++) {
354 err
= pthread_create(&tid_dequeuer
[i
], NULL
, thr_dequeuer
,
355 &count_dequeuer
[2 * i
]);
364 for (i
= 0; i
< duration
; i
++) {
372 for (i
= 0; i
< nr_enqueuers
; i
++) {
373 err
= pthread_join(tid_enqueuer
[i
], &tret
);
376 tot_enqueues
+= count_enqueuer
[2 * i
];
377 tot_successful_enqueues
+= count_enqueuer
[2 * i
+ 1];
379 for (i
= 0; i
< nr_dequeuers
; i
++) {
380 err
= pthread_join(tid_dequeuer
[i
], &tret
);
383 tot_dequeues
+= count_dequeuer
[2 * i
];
384 tot_successful_dequeues
+= count_dequeuer
[2 * i
+ 1];
387 test_end(&s
, &end_dequeues
);
389 printf_verbose("total number of enqueues : %llu, dequeues %llu\n",
390 tot_enqueues
, tot_dequeues
);
391 printf_verbose("total number of successful enqueues : %llu, "
392 "successful dequeues %llu\n",
393 tot_successful_enqueues
, tot_successful_dequeues
);
394 printf("SUMMARY %-25s testdur %4lu nr_enqueuers %3u wdelay %6lu "
396 "rdur %6lu nr_enqueues %12llu nr_dequeues %12llu "
397 "successful enqueues %12llu successful dequeues %12llu "
398 "end_dequeues %llu nr_ops %12llu\n",
399 argv
[0], duration
, nr_enqueuers
, wdelay
,
400 nr_dequeuers
, rduration
, tot_enqueues
, tot_dequeues
,
401 tot_successful_enqueues
,
402 tot_successful_dequeues
, end_dequeues
,
403 tot_enqueues
+ tot_dequeues
);
404 if (tot_successful_enqueues
!= tot_successful_dequeues
+ end_dequeues
)
405 printf("WARNING! Discrepancy between nr succ. enqueues %llu vs "
406 "succ. dequeues + end dequeues %llu.\n",
407 tot_successful_enqueues
,
408 tot_successful_dequeues
+ end_dequeues
);
410 free(count_enqueuer
);
411 free(count_dequeuer
);