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
68 #include <urcu/wfstack.h>
70 static volatile int test_go
, test_stop
;
72 static unsigned long rduration
;
74 static unsigned long duration
;
76 /* read-side C.S. duration, in loops */
77 static unsigned long wdelay
;
79 static inline void loop_sleep(unsigned long l
)
85 static int verbose_mode
;
87 #define printf_verbose(fmt, args...) \
93 static unsigned int cpu_affinities
[NR_CPUS
];
94 static unsigned int next_aff
= 0;
95 static int use_affinity
= 0;
97 pthread_mutex_t affinity_mutex
= PTHREAD_MUTEX_INITIALIZER
;
99 #ifndef HAVE_CPU_SET_T
100 typedef unsigned long cpu_set_t
;
101 # define CPU_ZERO(cpuset) do { *(cpuset) = 0; } while(0)
102 # define CPU_SET(cpu, cpuset) do { *(cpuset) |= (1UL << (cpu)); } while(0)
105 static void set_affinity(void)
114 #if HAVE_SCHED_SETAFFINITY
115 ret
= pthread_mutex_lock(&affinity_mutex
);
117 perror("Error in pthread mutex lock");
120 cpu
= cpu_affinities
[next_aff
++];
121 ret
= pthread_mutex_unlock(&affinity_mutex
);
123 perror("Error in pthread mutex unlock");
129 #if SCHED_SETAFFINITY_ARGS == 2
130 sched_setaffinity(0, &mask
);
132 sched_setaffinity(0, sizeof(mask
), &mask
);
134 #endif /* HAVE_SCHED_SETAFFINITY */
138 * returns 0 if test should end.
140 static int test_duration_dequeue(void)
145 static int test_duration_enqueue(void)
150 static unsigned long long __thread nr_dequeues
;
151 static unsigned long long __thread nr_enqueues
;
153 static unsigned long long __thread nr_successful_dequeues
;
154 static unsigned long long __thread nr_successful_enqueues
;
156 static unsigned int nr_enqueuers
;
157 static unsigned int nr_dequeuers
;
159 static struct cds_wfs_stack s
;
161 void *thr_enqueuer(void *_count
)
163 unsigned long long *count
= _count
;
165 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
166 "enqueuer", pthread_self(), (unsigned long)gettid());
176 struct cds_wfs_node
*node
= malloc(sizeof(*node
));
179 cds_wfs_node_init(node
);
180 cds_wfs_push(&s
, node
);
181 nr_successful_enqueues
++;
183 if (caa_unlikely(wdelay
))
187 if (caa_unlikely(!test_duration_enqueue()))
191 count
[0] = nr_enqueues
;
192 count
[1] = nr_successful_enqueues
;
193 printf_verbose("enqueuer thread_end, thread id : %lx, tid %lu, "
194 "enqueues %llu successful_enqueues %llu\n",
195 pthread_self(), (unsigned long)gettid(), nr_enqueues
,
196 nr_successful_enqueues
);
201 void *thr_dequeuer(void *_count
)
203 unsigned long long *count
= _count
;
205 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
206 "dequeuer", pthread_self(), (unsigned long)gettid());
216 struct cds_wfs_node
*node
= cds_wfs_pop_blocking(&s
);
220 nr_successful_dequeues
++;
224 if (caa_unlikely(!test_duration_dequeue()))
226 if (caa_unlikely(rduration
))
227 loop_sleep(rduration
);
230 printf_verbose("dequeuer thread_end, thread id : %lx, tid %lu, "
231 "dequeues %llu, successful_dequeues %llu\n",
232 pthread_self(), (unsigned long)gettid(), nr_dequeues
,
233 nr_successful_dequeues
);
234 count
[0] = nr_dequeues
;
235 count
[1] = nr_successful_dequeues
;
239 void test_end(struct cds_wfs_stack
*s
, unsigned long long *nr_dequeues
)
241 struct cds_wfs_node
*node
;
244 node
= cds_wfs_pop_blocking(s
);
252 void show_usage(int argc
, char **argv
)
254 printf("Usage : %s nr_dequeuers nr_enqueuers duration (s)", argv
[0]);
255 printf(" [-d delay] (enqueuer period (in loops))");
256 printf(" [-c duration] (dequeuer period (in loops))");
257 printf(" [-v] (verbose output)");
258 printf(" [-a cpu#] [-a cpu#]... (affinity)");
262 int main(int argc
, char **argv
)
265 pthread_t
*tid_enqueuer
, *tid_dequeuer
;
267 unsigned long long *count_enqueuer
, *count_dequeuer
;
268 unsigned long long tot_enqueues
= 0, tot_dequeues
= 0;
269 unsigned long long tot_successful_enqueues
= 0,
270 tot_successful_dequeues
= 0;
271 unsigned long long end_dequeues
= 0;
275 show_usage(argc
, argv
);
279 err
= sscanf(argv
[1], "%u", &nr_dequeuers
);
281 show_usage(argc
, argv
);
285 err
= sscanf(argv
[2], "%u", &nr_enqueuers
);
287 show_usage(argc
, argv
);
291 err
= sscanf(argv
[3], "%lu", &duration
);
293 show_usage(argc
, argv
);
297 for (i
= 4; i
< argc
; i
++) {
298 if (argv
[i
][0] != '-')
300 switch (argv
[i
][1]) {
303 show_usage(argc
, argv
);
307 cpu_affinities
[next_aff
++] = a
;
309 printf_verbose("Adding CPU %d affinity\n", a
);
313 show_usage(argc
, argv
);
316 rduration
= atol(argv
[++i
]);
320 show_usage(argc
, argv
);
323 wdelay
= atol(argv
[++i
]);
331 printf_verbose("running test for %lu seconds, %u enqueuers, "
333 duration
, nr_enqueuers
, nr_dequeuers
);
334 printf_verbose("Writer delay : %lu loops.\n", rduration
);
335 printf_verbose("Reader duration : %lu loops.\n", wdelay
);
336 printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
337 "main", pthread_self(), (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
);