4 * Userspace RCU library - example RCU-based lock-free queue
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>
37 #include <sys/syscall.h>
41 #include <urcu/arch.h>
43 /* hardcoded number of CPUs */
46 #if defined(_syscall0)
47 _syscall0(pid_t
, gettid
)
48 #elif defined(__NR_gettid)
49 static inline pid_t
gettid(void)
51 return syscall(__NR_gettid
);
54 #warning "use pid as tid"
55 static inline pid_t
gettid(void)
61 #ifndef DYNAMIC_LINK_TEST
65 #include <urcu/wfqueue.h>
67 static volatile int test_go
, test_stop
;
69 static unsigned long rduration
;
71 static unsigned long duration
;
73 /* read-side C.S. duration, in loops */
74 static unsigned long wdelay
;
76 static inline void loop_sleep(unsigned long l
)
82 static int verbose_mode
;
84 #define printf_verbose(fmt, args...) \
90 static unsigned int cpu_affinities
[NR_CPUS
];
91 static unsigned int next_aff
= 0;
92 static int use_affinity
= 0;
94 pthread_mutex_t affinity_mutex
= PTHREAD_MUTEX_INITIALIZER
;
96 #ifndef HAVE_CPU_SET_T
97 typedef unsigned long cpu_set_t
;
98 # define CPU_ZERO(cpuset) do { *(cpuset) = 0; } while(0)
99 # define CPU_SET(cpu, cpuset) do { *(cpuset) |= (1UL << (cpu)); } while(0)
102 static void set_affinity(void)
111 #if HAVE_SCHED_SETAFFINITY
112 ret
= pthread_mutex_lock(&affinity_mutex
);
114 perror("Error in pthread mutex lock");
117 cpu
= cpu_affinities
[next_aff
++];
118 ret
= pthread_mutex_unlock(&affinity_mutex
);
120 perror("Error in pthread mutex unlock");
126 #if SCHED_SETAFFINITY_ARGS == 2
127 sched_setaffinity(0, &mask
);
129 sched_setaffinity(0, sizeof(mask
), &mask
);
131 #endif /* HAVE_SCHED_SETAFFINITY */
135 * returns 0 if test should end.
137 static int test_duration_dequeue(void)
142 static int test_duration_enqueue(void)
147 static unsigned long long __thread nr_dequeues
;
148 static unsigned long long __thread nr_enqueues
;
150 static unsigned long long __thread nr_successful_dequeues
;
151 static unsigned long long __thread nr_successful_enqueues
;
153 static unsigned int nr_enqueuers
;
154 static unsigned int nr_dequeuers
;
156 static struct cds_wfq_queue q
;
158 void *thr_enqueuer(void *_count
)
160 unsigned long long *count
= _count
;
162 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
163 "enqueuer", pthread_self(), (unsigned long)gettid());
173 struct cds_wfq_node
*node
= malloc(sizeof(*node
));
176 cds_wfq_node_init(node
);
177 cds_wfq_enqueue(&q
, node
);
178 nr_successful_enqueues
++;
180 if (unlikely(wdelay
))
184 if (unlikely(!test_duration_enqueue()))
188 count
[0] = nr_enqueues
;
189 count
[1] = nr_successful_enqueues
;
190 printf_verbose("enqueuer thread_end, thread id : %lx, tid %lu, "
191 "enqueues %llu successful_enqueues %llu\n",
192 pthread_self(), (unsigned long)gettid(), nr_enqueues
,
193 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", pthread_self(), (unsigned long)gettid());
213 struct cds_wfq_node
*node
= cds_wfq_dequeue_blocking(&q
);
217 nr_successful_dequeues
++;
221 if (unlikely(!test_duration_dequeue()))
223 if (unlikely(rduration
))
224 loop_sleep(rduration
);
227 printf_verbose("dequeuer thread_end, thread id : %lx, tid %lu, "
228 "dequeues %llu, successful_dequeues %llu\n",
229 pthread_self(), (unsigned long)gettid(), nr_dequeues
,
230 nr_successful_dequeues
);
231 count
[0] = nr_dequeues
;
232 count
[1] = nr_successful_dequeues
;
236 void test_end(struct cds_wfq_queue
*q
, unsigned long long *nr_dequeues
)
238 struct cds_wfq_node
*node
;
241 node
= cds_wfq_dequeue_blocking(q
);
249 void show_usage(int argc
, char **argv
)
251 printf("Usage : %s nr_dequeuers nr_enqueuers duration (s)", argv
[0]);
252 printf(" [-d delay] (enqueuer period (in loops))");
253 printf(" [-c duration] (dequeuer period (in loops))");
254 printf(" [-v] (verbose output)");
255 printf(" [-a cpu#] [-a cpu#]... (affinity)");
259 int main(int argc
, char **argv
)
262 pthread_t
*tid_enqueuer
, *tid_dequeuer
;
264 unsigned long long *count_enqueuer
, *count_dequeuer
;
265 unsigned long long tot_enqueues
= 0, tot_dequeues
= 0;
266 unsigned long long tot_successful_enqueues
= 0,
267 tot_successful_dequeues
= 0;
268 unsigned long long end_dequeues
= 0;
272 show_usage(argc
, argv
);
276 err
= sscanf(argv
[1], "%u", &nr_dequeuers
);
278 show_usage(argc
, argv
);
282 err
= sscanf(argv
[2], "%u", &nr_enqueuers
);
284 show_usage(argc
, argv
);
288 err
= sscanf(argv
[3], "%lu", &duration
);
290 show_usage(argc
, argv
);
294 for (i
= 4; i
< argc
; i
++) {
295 if (argv
[i
][0] != '-')
297 switch (argv
[i
][1]) {
300 show_usage(argc
, argv
);
304 cpu_affinities
[next_aff
++] = a
;
306 printf_verbose("Adding CPU %d affinity\n", a
);
310 show_usage(argc
, argv
);
313 rduration
= atol(argv
[++i
]);
317 show_usage(argc
, argv
);
320 wdelay
= atol(argv
[++i
]);
328 printf_verbose("running test for %lu seconds, %u enqueuers, "
330 duration
, nr_enqueuers
, nr_dequeuers
);
331 printf_verbose("Writer delay : %lu loops.\n", rduration
);
332 printf_verbose("Reader duration : %lu loops.\n", wdelay
);
333 printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
334 "main", pthread_self(), (unsigned long)gettid());
336 tid_enqueuer
= malloc(sizeof(*tid_enqueuer
) * nr_enqueuers
);
337 tid_dequeuer
= malloc(sizeof(*tid_dequeuer
) * nr_dequeuers
);
338 count_enqueuer
= malloc(2 * sizeof(*count_enqueuer
) * nr_enqueuers
);
339 count_dequeuer
= malloc(2 * sizeof(*count_dequeuer
) * nr_dequeuers
);
344 for (i
= 0; i
< nr_enqueuers
; i
++) {
345 err
= pthread_create(&tid_enqueuer
[i
], NULL
, thr_enqueuer
,
346 &count_enqueuer
[2 * i
]);
350 for (i
= 0; i
< nr_dequeuers
; i
++) {
351 err
= pthread_create(&tid_dequeuer
[i
], NULL
, thr_dequeuer
,
352 &count_dequeuer
[2 * i
]);
361 for (i
= 0; i
< duration
; i
++) {
369 for (i
= 0; i
< nr_enqueuers
; i
++) {
370 err
= pthread_join(tid_enqueuer
[i
], &tret
);
373 tot_enqueues
+= count_enqueuer
[2 * i
];
374 tot_successful_enqueues
+= count_enqueuer
[2 * i
+ 1];
376 for (i
= 0; i
< nr_dequeuers
; i
++) {
377 err
= pthread_join(tid_dequeuer
[i
], &tret
);
380 tot_dequeues
+= count_dequeuer
[2 * i
];
381 tot_successful_dequeues
+= count_dequeuer
[2 * i
+ 1];
384 test_end(&q
, &end_dequeues
);
386 printf_verbose("total number of enqueues : %llu, dequeues %llu\n",
387 tot_enqueues
, tot_dequeues
);
388 printf_verbose("total number of successful enqueues : %llu, "
389 "successful dequeues %llu\n",
390 tot_successful_enqueues
, tot_successful_dequeues
);
391 printf("SUMMARY %-25s testdur %4lu nr_enqueuers %3u wdelay %6lu "
393 "rdur %6lu nr_enqueues %12llu nr_dequeues %12llu "
394 "successful enqueues %12llu successful dequeues %12llu "
395 "end_dequeues %llu nr_ops %12llu\n",
396 argv
[0], duration
, nr_enqueuers
, wdelay
,
397 nr_dequeuers
, rduration
, tot_enqueues
, tot_dequeues
,
398 tot_successful_enqueues
,
399 tot_successful_dequeues
, end_dequeues
,
400 tot_enqueues
+ tot_dequeues
);
401 if (tot_successful_enqueues
!= tot_successful_dequeues
+ end_dequeues
)
402 printf("WARNING! Discrepancy between nr succ. enqueues %llu vs "
403 "succ. dequeues + end dequeues %llu.\n",
404 tot_successful_enqueues
,
405 tot_successful_dequeues
+ end_dequeues
);
407 free(count_enqueuer
);
408 free(count_dequeuer
);