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>
46 /* hardcoded number of CPUs */
49 #if defined(_syscall0)
50 _syscall0(pid_t
, gettid
)
51 #elif defined(__NR_gettid)
52 static inline pid_t
gettid(void)
54 return syscall(__NR_gettid
);
57 #warning "use pid as tid"
58 static inline pid_t
gettid(void)
64 #ifndef DYNAMIC_LINK_TEST
69 #include <urcu-defer.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 #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)
115 #if HAVE_SCHED_SETAFFINITY
116 ret
= pthread_mutex_lock(&affinity_mutex
);
118 perror("Error in pthread mutex lock");
121 cpu
= cpu_affinities
[next_aff
++];
122 ret
= pthread_mutex_unlock(&affinity_mutex
);
124 perror("Error in pthread mutex unlock");
130 #if SCHED_SETAFFINITY_ARGS == 2
131 sched_setaffinity(0, &mask
);
133 sched_setaffinity(0, sizeof(mask
), &mask
);
135 #endif /* HAVE_SCHED_SETAFFINITY */
139 * returns 0 if test should end.
141 static int test_duration_dequeue(void)
146 static int test_duration_enqueue(void)
151 static unsigned long long __thread nr_dequeues
;
152 static unsigned long long __thread nr_enqueues
;
154 static unsigned long long __thread nr_successful_dequeues
;
155 static unsigned long long __thread nr_successful_enqueues
;
157 static unsigned int nr_enqueuers
;
158 static unsigned int nr_dequeuers
;
160 static struct cds_lfs_stack_rcu s
;
162 void *thr_enqueuer(void *_count
)
164 unsigned long long *count
= _count
;
166 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
167 "enqueuer", pthread_self(), (unsigned long)gettid());
171 rcu_register_thread();
179 struct cds_lfs_node_rcu
*node
= malloc(sizeof(*node
));
182 cds_lfs_node_init_rcu(node
);
183 /* No rcu read-side is needed for push */
184 cds_lfs_push_rcu(&s
, node
);
185 nr_successful_enqueues
++;
187 if (unlikely(wdelay
))
191 if (unlikely(!test_duration_enqueue()))
195 rcu_unregister_thread();
197 count
[0] = nr_enqueues
;
198 count
[1] = nr_successful_enqueues
;
199 printf_verbose("enqueuer thread_end, thread id : %lx, tid %lu, "
200 "enqueues %llu successful_enqueues %llu\n",
201 pthread_self(), (unsigned long)gettid(), nr_enqueues
,
202 nr_successful_enqueues
);
207 void *thr_dequeuer(void *_count
)
209 unsigned long long *count
= _count
;
212 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
213 "dequeuer", pthread_self(), (unsigned long)gettid());
217 ret
= rcu_defer_register_thread();
219 printf("Error in rcu_defer_register_thread\n");
222 rcu_register_thread();
230 struct cds_lfs_node_rcu
*node
;
233 node
= cds_lfs_pop_rcu(&s
);
236 defer_rcu(free
, node
);
237 nr_successful_dequeues
++;
240 if (unlikely(!test_duration_dequeue()))
242 if (unlikely(rduration
))
243 loop_sleep(rduration
);
246 rcu_unregister_thread();
247 rcu_defer_unregister_thread();
249 printf_verbose("dequeuer thread_end, thread id : %lx, tid %lu, "
250 "dequeues %llu, successful_dequeues %llu\n",
251 pthread_self(), (unsigned long)gettid(), nr_dequeues
,
252 nr_successful_dequeues
);
253 count
[0] = nr_dequeues
;
254 count
[1] = nr_successful_dequeues
;
258 void test_end(struct cds_lfs_stack_rcu
*s
, unsigned long long *nr_dequeues
)
260 struct cds_lfs_node_rcu
*node
;
263 node
= cds_lfs_pop_rcu(s
);
271 void show_usage(int argc
, char **argv
)
273 printf("Usage : %s nr_dequeuers nr_enqueuers duration (s)", argv
[0]);
274 printf(" [-d delay] (enqueuer period (in loops))");
275 printf(" [-c duration] (dequeuer period (in loops))");
276 printf(" [-v] (verbose output)");
277 printf(" [-a cpu#] [-a cpu#]... (affinity)");
281 int main(int argc
, char **argv
)
284 pthread_t
*tid_enqueuer
, *tid_dequeuer
;
286 unsigned long long *count_enqueuer
, *count_dequeuer
;
287 unsigned long long tot_enqueues
= 0, tot_dequeues
= 0;
288 unsigned long long tot_successful_enqueues
= 0,
289 tot_successful_dequeues
= 0;
290 unsigned long long end_dequeues
= 0;
294 show_usage(argc
, argv
);
298 err
= sscanf(argv
[1], "%u", &nr_dequeuers
);
300 show_usage(argc
, argv
);
304 err
= sscanf(argv
[2], "%u", &nr_enqueuers
);
306 show_usage(argc
, argv
);
310 err
= sscanf(argv
[3], "%lu", &duration
);
312 show_usage(argc
, argv
);
316 for (i
= 4; i
< argc
; i
++) {
317 if (argv
[i
][0] != '-')
319 switch (argv
[i
][1]) {
322 show_usage(argc
, argv
);
326 cpu_affinities
[next_aff
++] = a
;
328 printf_verbose("Adding CPU %d affinity\n", a
);
332 show_usage(argc
, argv
);
335 rduration
= atol(argv
[++i
]);
339 show_usage(argc
, argv
);
342 wdelay
= atol(argv
[++i
]);
350 printf_verbose("running test for %lu seconds, %u enqueuers, "
352 duration
, nr_enqueuers
, nr_dequeuers
);
353 printf_verbose("Writer delay : %lu loops.\n", rduration
);
354 printf_verbose("Reader duration : %lu loops.\n", wdelay
);
355 printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
356 "main", pthread_self(), (unsigned long)gettid());
358 tid_enqueuer
= malloc(sizeof(*tid_enqueuer
) * nr_enqueuers
);
359 tid_dequeuer
= malloc(sizeof(*tid_dequeuer
) * nr_dequeuers
);
360 count_enqueuer
= malloc(2 * sizeof(*count_enqueuer
) * nr_enqueuers
);
361 count_dequeuer
= malloc(2 * sizeof(*count_dequeuer
) * nr_dequeuers
);
362 cds_lfs_init_rcu(&s
);
366 for (i
= 0; i
< nr_enqueuers
; i
++) {
367 err
= pthread_create(&tid_enqueuer
[i
], NULL
, thr_enqueuer
,
368 &count_enqueuer
[2 * i
]);
372 for (i
= 0; i
< nr_dequeuers
; i
++) {
373 err
= pthread_create(&tid_dequeuer
[i
], NULL
, thr_dequeuer
,
374 &count_dequeuer
[2 * i
]);
383 for (i
= 0; i
< duration
; i
++) {
391 for (i
= 0; i
< nr_enqueuers
; i
++) {
392 err
= pthread_join(tid_enqueuer
[i
], &tret
);
395 tot_enqueues
+= count_enqueuer
[2 * i
];
396 tot_successful_enqueues
+= count_enqueuer
[2 * i
+ 1];
398 for (i
= 0; i
< nr_dequeuers
; i
++) {
399 err
= pthread_join(tid_dequeuer
[i
], &tret
);
402 tot_dequeues
+= count_dequeuer
[2 * i
];
403 tot_successful_dequeues
+= count_dequeuer
[2 * i
+ 1];
406 test_end(&s
, &end_dequeues
);
408 printf_verbose("total number of enqueues : %llu, dequeues %llu\n",
409 tot_enqueues
, tot_dequeues
);
410 printf_verbose("total number of successful enqueues : %llu, "
411 "successful dequeues %llu\n",
412 tot_successful_enqueues
, tot_successful_dequeues
);
413 printf("SUMMARY %-25s testdur %4lu nr_enqueuers %3u wdelay %6lu "
415 "rdur %6lu nr_enqueues %12llu nr_dequeues %12llu "
416 "successful enqueues %12llu successful dequeues %12llu "
417 "end_dequeues %llu nr_ops %12llu\n",
418 argv
[0], duration
, nr_enqueuers
, wdelay
,
419 nr_dequeuers
, rduration
, tot_enqueues
, tot_dequeues
,
420 tot_successful_enqueues
,
421 tot_successful_dequeues
, end_dequeues
,
422 tot_enqueues
+ tot_dequeues
);
423 if (tot_successful_enqueues
!= tot_successful_dequeues
+ end_dequeues
)
424 printf("WARNING! Discrepancy between nr succ. enqueues %llu vs "
425 "succ. dequeues + end dequeues %llu.\n",
426 tot_successful_enqueues
,
427 tot_successful_dequeues
+ end_dequeues
);
429 free(count_enqueuer
);
430 free(count_dequeuer
);