[urcu.git] / tests / test_urcu_wfq.c

/*
 * test_urcu_wfq.c
 *
 * Userspace RCU library - example RCU-based lock-free queue
 *
 * Copyright February 2010 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
 * Copyright February 2010 - Paolo Bonzini <pbonzini@redhat.com>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License along
 * with this program; if not, write to the Free Software Foundation, Inc.,
 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 */

#define _GNU_SOURCE
#include "../config.h"
#include <stdio.h>
#include <pthread.h>
#include <stdlib.h>
#include <stdint.h>
#include <stdbool.h>
#include <string.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <unistd.h>
#include <stdio.h>
#include <assert.h>
#include <sched.h>
#include <errno.h>

#include <urcu/arch.h>
#include <urcu/tls-compat.h>

#ifdef __linux__
#include <syscall.h>
#endif

/* hardcoded number of CPUs */
#define NR_CPUS 16384

#if defined(_syscall0)
_syscall0(pid_t, gettid)
#elif defined(__NR_gettid)
static inline pid_t gettid(void)
{
	return syscall(__NR_gettid);
}
#else
#warning "use pid as tid"
static inline pid_t gettid(void)
{
	return getpid();
}
#endif

#ifndef DYNAMIC_LINK_TEST
#define _LGPL_SOURCE
#endif

/* Remove deprecation warnings from test build. */
#define CDS_WFQ_DEPRECATED

#include <urcu.h>
#include <urcu/wfqueue.h>

static volatile int test_go, test_stop;

static unsigned long rduration;

static unsigned long duration;

/* read-side C.S. duration, in loops */
static unsigned long wdelay;

static inline void loop_sleep(unsigned long loops)
{
	while (loops-- != 0)
		caa_cpu_relax();
}

static int verbose_mode;

#define printf_verbose(fmt, args...)		\
	do {					\
		if (verbose_mode)		\
			printf(fmt, args);	\
	} while (0)

static unsigned int cpu_affinities[NR_CPUS];
static unsigned int next_aff = 0;
static int use_affinity = 0;

pthread_mutex_t affinity_mutex = PTHREAD_MUTEX_INITIALIZER;

#ifndef HAVE_CPU_SET_T
typedef unsigned long cpu_set_t;
# define CPU_ZERO(cpuset) do { *(cpuset) = 0; } while(0)
# define CPU_SET(cpu, cpuset) do { *(cpuset) |= (1UL << (cpu)); } while(0)
#endif

static void set_affinity(void)
{
#if HAVE_SCHED_SETAFFINITY
	cpu_set_t mask;
	int cpu, ret;
#endif /* HAVE_SCHED_SETAFFINITY */

	if (!use_affinity)
		return;

#if HAVE_SCHED_SETAFFINITY
	ret = pthread_mutex_lock(&affinity_mutex);
	if (ret) {
		perror("Error in pthread mutex lock");
		exit(-1);
	}
	cpu = cpu_affinities[next_aff++];
	ret = pthread_mutex_unlock(&affinity_mutex);
	if (ret) {
		perror("Error in pthread mutex unlock");
		exit(-1);
	}

	CPU_ZERO(&mask);
	CPU_SET(cpu, &mask);
#if SCHED_SETAFFINITY_ARGS == 2
	sched_setaffinity(0, &mask);
#else
	sched_setaffinity(0, sizeof(mask), &mask);
#endif
#endif /* HAVE_SCHED_SETAFFINITY */
}

/*
 * returns 0 if test should end.
 */
static int test_duration_dequeue(void)
{
	return !test_stop;
}

static int test_duration_enqueue(void)
{
	return !test_stop;
}

static DEFINE_URCU_TLS(unsigned long long, nr_dequeues);
static DEFINE_URCU_TLS(unsigned long long, nr_enqueues);

static DEFINE_URCU_TLS(unsigned long long, nr_successful_dequeues);
static DEFINE_URCU_TLS(unsigned long long, nr_successful_enqueues);

static unsigned int nr_enqueuers;
static unsigned int nr_dequeuers;

static struct cds_wfq_queue q;

void *thr_enqueuer(void *_count)
{
	unsigned long long *count = _count;

	printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
			"enqueuer", (unsigned long) pthread_self(),
			(unsigned long) gettid());

	set_affinity();

	while (!test_go)
	{
	}
	cmm_smp_mb();

	for (;;) {
		struct cds_wfq_node *node = malloc(sizeof(*node));
		if (!node)
			goto fail;
		cds_wfq_node_init(node);
		cds_wfq_enqueue(&q, node);
		URCU_TLS(nr_successful_enqueues)++;

		if (caa_unlikely(wdelay))
			loop_sleep(wdelay);
fail:
		URCU_TLS(nr_enqueues)++;
		if (caa_unlikely(!test_duration_enqueue()))
			break;
	}

	count[0] = URCU_TLS(nr_enqueues);
	count[1] = URCU_TLS(nr_successful_enqueues);
	printf_verbose("enqueuer thread_end, thread id : %lx, tid %lu, "
		       "enqueues %llu successful_enqueues %llu\n",
		       pthread_self(),
			(unsigned long) gettid(),
		       URCU_TLS(nr_enqueues), URCU_TLS(nr_successful_enqueues));
	return ((void*)1);

}

void *thr_dequeuer(void *_count)
{
	unsigned long long *count = _count;

	printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
			"dequeuer", (unsigned long) pthread_self(),
			(unsigned long) gettid());

	set_affinity();

	while (!test_go)
	{
	}
	cmm_smp_mb();

	for (;;) {
		struct cds_wfq_node *node = cds_wfq_dequeue_blocking(&q);

		if (node) {
			free(node);
			URCU_TLS(nr_successful_dequeues)++;
		}

		URCU_TLS(nr_dequeues)++;
		if (caa_unlikely(!test_duration_dequeue()))
			break;
		if (caa_unlikely(rduration))
			loop_sleep(rduration);
	}

	printf_verbose("dequeuer thread_end, thread id : %lx, tid %lu, "
		       "dequeues %llu, successful_dequeues %llu\n",
		       pthread_self(),
			(unsigned long) gettid(),
		       URCU_TLS(nr_dequeues), URCU_TLS(nr_successful_dequeues));
	count[0] = URCU_TLS(nr_dequeues);
	count[1] = URCU_TLS(nr_successful_dequeues);
	return ((void*)2);
}

void test_end(struct cds_wfq_queue *q, unsigned long long *nr_dequeues)
{
	struct cds_wfq_node *node;

	do {
		node = cds_wfq_dequeue_blocking(q);
		if (node) {
			free(node);
			(*nr_dequeues)++;
		}
	} while (node);
}

void show_usage(int argc, char **argv)
{
	printf("Usage : %s nr_dequeuers nr_enqueuers duration (s)", argv[0]);
	printf(" [-d delay] (enqueuer period (in loops))");
	printf(" [-c duration] (dequeuer period (in loops))");
	printf(" [-v] (verbose output)");
	printf(" [-a cpu#] [-a cpu#]... (affinity)");
	printf("\n");
}

int main(int argc, char **argv)
{
	int err;
	pthread_t *tid_enqueuer, *tid_dequeuer;
	void *tret;
	unsigned long long *count_enqueuer, *count_dequeuer;
	unsigned long long tot_enqueues = 0, tot_dequeues = 0;
	unsigned long long tot_successful_enqueues = 0,
			   tot_successful_dequeues = 0;
	unsigned long long end_dequeues = 0;
	int i, a;

	if (argc < 4) {
		show_usage(argc, argv);
		return -1;
	}

	err = sscanf(argv[1], "%u", &nr_dequeuers);
	if (err != 1) {
		show_usage(argc, argv);
		return -1;
	}

	err = sscanf(argv[2], "%u", &nr_enqueuers);
	if (err != 1) {
		show_usage(argc, argv);
		return -1;
	}
	
	err = sscanf(argv[3], "%lu", &duration);
	if (err != 1) {
		show_usage(argc, argv);
		return -1;
	}

	for (i = 4; i < argc; i++) {
		if (argv[i][0] != '-')
			continue;
		switch (argv[i][1]) {
		case 'a':
			if (argc < i + 2) {
				show_usage(argc, argv);
				return -1;
			}
			a = atoi(argv[++i]);
			cpu_affinities[next_aff++] = a;
			use_affinity = 1;
			printf_verbose("Adding CPU %d affinity\n", a);
			break;
		case 'c':
			if (argc < i + 2) {
				show_usage(argc, argv);
				return -1;
			}
			rduration = atol(argv[++i]);
			break;
		case 'd':
			if (argc < i + 2) {
				show_usage(argc, argv);
				return -1;
			}
			wdelay = atol(argv[++i]);
			break;
		case 'v':
			verbose_mode = 1;
			break;
		}
	}

	printf_verbose("running test for %lu seconds, %u enqueuers, "
		       "%u dequeuers.\n",
		       duration, nr_enqueuers, nr_dequeuers);
	printf_verbose("Writer delay : %lu loops.\n", rduration);
	printf_verbose("Reader duration : %lu loops.\n", wdelay);
	printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
			"main", (unsigned long) pthread_self(),
			(unsigned long) gettid());

	tid_enqueuer = malloc(sizeof(*tid_enqueuer) * nr_enqueuers);
	tid_dequeuer = malloc(sizeof(*tid_dequeuer) * nr_dequeuers);
	count_enqueuer = malloc(2 * sizeof(*count_enqueuer) * nr_enqueuers);
	count_dequeuer = malloc(2 * sizeof(*count_dequeuer) * nr_dequeuers);
	cds_wfq_init(&q);

	next_aff = 0;

	for (i = 0; i < nr_enqueuers; i++) {
		err = pthread_create(&tid_enqueuer[i], NULL, thr_enqueuer,
				     &count_enqueuer[2 * i]);
		if (err != 0)
			exit(1);
	}
	for (i = 0; i < nr_dequeuers; i++) {
		err = pthread_create(&tid_dequeuer[i], NULL, thr_dequeuer,
				     &count_dequeuer[2 * i]);
		if (err != 0)
			exit(1);
	}

	cmm_smp_mb();

	test_go = 1;

	for (i = 0; i < duration; i++) {
		sleep(1);
		if (verbose_mode)
			write (1, ".", 1);
	}

	test_stop = 1;

	for (i = 0; i < nr_enqueuers; i++) {
		err = pthread_join(tid_enqueuer[i], &tret);
		if (err != 0)
			exit(1);
		tot_enqueues += count_enqueuer[2 * i];
		tot_successful_enqueues += count_enqueuer[2 * i + 1];
	}
	for (i = 0; i < nr_dequeuers; i++) {
		err = pthread_join(tid_dequeuer[i], &tret);
		if (err != 0)
			exit(1);
		tot_dequeues += count_dequeuer[2 * i];
		tot_successful_dequeues += count_dequeuer[2 * i + 1];
	}
	
	test_end(&q, &end_dequeues);

	printf_verbose("total number of enqueues : %llu, dequeues %llu\n",
		       tot_enqueues, tot_dequeues);
	printf_verbose("total number of successful enqueues : %llu, "
		       "successful dequeues %llu\n",
		       tot_successful_enqueues, tot_successful_dequeues);
	printf("SUMMARY %-25s testdur %4lu nr_enqueuers %3u wdelay %6lu "
		"nr_dequeuers %3u "
		"rdur %6lu nr_enqueues %12llu nr_dequeues %12llu "
		"successful enqueues %12llu successful dequeues %12llu "
		"end_dequeues %llu nr_ops %12llu\n",
		argv[0], duration, nr_enqueuers, wdelay,
		nr_dequeuers, rduration, tot_enqueues, tot_dequeues,
		tot_successful_enqueues,
		tot_successful_dequeues, end_dequeues,
		tot_enqueues + tot_dequeues);
	if (tot_successful_enqueues != tot_successful_dequeues + end_dequeues)
		printf("WARNING! Discrepancy between nr succ. enqueues %llu vs "
		       "succ. dequeues + end dequeues %llu.\n",
		       tot_successful_enqueues,
		       tot_successful_dequeues + end_dequeues);

	free(count_enqueuer);
	free(count_dequeuer);
	free(tid_enqueuer);
	free(tid_dequeuer);
	return 0;
}
Commit	Line	Data
ee566d46 MD	1	/*
	2	* test_urcu_wfq.c
	3	*
	4	* Userspace RCU library - example RCU-based lock-free queue
	5	*
	6	* Copyright February 2010 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
	7	* Copyright February 2010 - Paolo Bonzini <pbonzini@redhat.com>
	8	*
	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.
	13	*
	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.
	18	*
	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.
	22	*/
	23
	24	#define _GNU_SOURCE
	25	#include "../config.h"
	26	#include <stdio.h>
	27	#include <pthread.h>
	28	#include <stdlib.h>
	29	#include <stdint.h>
	30	#include <stdbool.h>
	31	#include <string.h>
	32	#include <sys/types.h>
	33	#include <sys/wait.h>
	34	#include <unistd.h>
	35	#include <stdio.h>
	36	#include <assert.h>
ee566d46 MD	37	#include <sched.h>
	38	#include <errno.h>
	39
	40	#include <urcu/arch.h>
bd252a04	41	#include <urcu/tls-compat.h>
ee566d46	42
65fcc7e9 MD	43	#ifdef __linux__
	44	#include <syscall.h>
	45	#endif
	46
ee566d46 MD	47	/* hardcoded number of CPUs */
	48	#define NR_CPUS 16384
	49
	50	#if defined(_syscall0)
	51	_syscall0(pid_t, gettid)
	52	#elif defined(__NR_gettid)
	53	static inline pid_t gettid(void)
	54	{
	55	return syscall(__NR_gettid);
	56	}
	57	#else
	58	#warning "use pid as tid"
	59	static inline pid_t gettid(void)
	60	{
	61	return getpid();
	62	}
	63	#endif
	64
	65	#ifndef DYNAMIC_LINK_TEST
	66	#define _LGPL_SOURCE
	67	#endif
14748510 MD	68
	69	/* Remove deprecation warnings from test build. */
	70	#define CDS_WFQ_DEPRECATED
	71
ee566d46	72	#include <urcu.h>
4afee0a7	73	#include <urcu/wfqueue.h>
ee566d46 MD	74
	75	static volatile int test_go, test_stop;
	76
	77	static unsigned long rduration;
	78
	79	static unsigned long duration;
	80
	81	/* read-side C.S. duration, in loops */
	82	static unsigned long wdelay;
	83
ab0aacbe	84	static inline void loop_sleep(unsigned long loops)
ee566d46	85	{
ab0aacbe	86	while (loops-- != 0)
06f22bdb	87	caa_cpu_relax();
ee566d46 MD	88	}
	89
	90	static int verbose_mode;
	91
	92	#define printf_verbose(fmt, args...) \
	93	do { \
	94	if (verbose_mode) \
	95	printf(fmt, args); \
	96	} while (0)
	97
	98	static unsigned int cpu_affinities[NR_CPUS];
	99	static unsigned int next_aff = 0;
	100	static int use_affinity = 0;
	101
	102	pthread_mutex_t affinity_mutex = PTHREAD_MUTEX_INITIALIZER;
	103
	104	#ifndef HAVE_CPU_SET_T
	105	typedef unsigned long cpu_set_t;
	106	# define CPU_ZERO(cpuset) do { *(cpuset) = 0; } while(0)
	107	# define CPU_SET(cpu, cpuset) do { *(cpuset) \|= (1UL << (cpu)); } while(0)
	108	#endif
	109
	110	static void set_affinity(void)
	111	{
95bc7fb9	112	#if HAVE_SCHED_SETAFFINITY
ee566d46	113	cpu_set_t mask;
95bc7fb9 MD	114	int cpu, ret;
95bc7fb9 MD	115	#endif /* HAVE_SCHED_SETAFFINITY */
ee566d46 MD	116
	117	if (!use_affinity)
	118	return;
	119
	120	#if HAVE_SCHED_SETAFFINITY
	121	ret = pthread_mutex_lock(&affinity_mutex);
	122	if (ret) {
	123	perror("Error in pthread mutex lock");
	124	exit(-1);
	125	}
	126	cpu = cpu_affinities[next_aff++];
	127	ret = pthread_mutex_unlock(&affinity_mutex);
	128	if (ret) {
	129	perror("Error in pthread mutex unlock");
	130	exit(-1);
	131	}
	132
	133	CPU_ZERO(&mask);
	134	CPU_SET(cpu, &mask);
	135	#if SCHED_SETAFFINITY_ARGS == 2
	136	sched_setaffinity(0, &mask);
	137	#else
	138	sched_setaffinity(0, sizeof(mask), &mask);
	139	#endif
	140	#endif /* HAVE_SCHED_SETAFFINITY */
	141	}
	142
	143	/*
	144	* returns 0 if test should end.
	145	*/
	146	static int test_duration_dequeue(void)
	147	{
	148	return !test_stop;
	149	}
	150
	151	static int test_duration_enqueue(void)
	152	{
	153	return !test_stop;
	154	}
	155
bd252a04 MD	156	static DEFINE_URCU_TLS(unsigned long long, nr_dequeues);
bd252a04 MD	157	static DEFINE_URCU_TLS(unsigned long long, nr_enqueues);
ee566d46	158
bd252a04 MD	159	static DEFINE_URCU_TLS(unsigned long long, nr_successful_dequeues);
bd252a04 MD	160	static DEFINE_URCU_TLS(unsigned long long, nr_successful_enqueues);
ee566d46 MD	161
	162	static unsigned int nr_enqueuers;
	163	static unsigned int nr_dequeuers;
	164
16aa9ee8	165	static struct cds_wfq_queue q;
ee566d46 MD	166
	167	void thr_enqueuer(void _count)
	168	{
	169	unsigned long long *count = _count;
	170
	171	printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
6ff854ac MD	172	"enqueuer", (unsigned long) pthread_self(),
6ff854ac MD	173	(unsigned long) gettid());
ee566d46 MD	174
	175	set_affinity();
	176
ee566d46 MD	177	while (!test_go)
	178	{
	179	}
5481ddb3	180	cmm_smp_mb();
ee566d46 MD	181
ee566d46 MD	182	for (;;) {
16aa9ee8	183	struct cds_wfq_node node = malloc(sizeof(node));
ee566d46 MD	184	if (!node)
ee566d46 MD	185	goto fail;
16aa9ee8 DG	186	cds_wfq_node_init(node);
16aa9ee8 DG	187	cds_wfq_enqueue(&q, node);
bd252a04	188	URCU_TLS(nr_successful_enqueues)++;
ee566d46	189
a0b7f7ea	190	if (caa_unlikely(wdelay))
ee566d46 MD	191	loop_sleep(wdelay);
ee566d46 MD	192	fail:
bd252a04	193	URCU_TLS(nr_enqueues)++;
a0b7f7ea	194	if (caa_unlikely(!test_duration_enqueue()))
ee566d46 MD	195	break;
	196	}
	197
bd252a04 MD	198	count[0] = URCU_TLS(nr_enqueues);
bd252a04 MD	199	count[1] = URCU_TLS(nr_successful_enqueues);
ee566d46 MD	200	printf_verbose("enqueuer thread_end, thread id : %lx, tid %lu, "
ee566d46 MD	201	"enqueues %llu successful_enqueues %llu\n",
6ff854ac MD	202	pthread_self(),
6ff854ac MD	203	(unsigned long) gettid(),
bd252a04	204	URCU_TLS(nr_enqueues), URCU_TLS(nr_successful_enqueues));
ee566d46 MD	205	return ((void*)1);
	206
	207	}
	208
ee566d46 MD	209	void thr_dequeuer(void _count)
	210	{
	211	unsigned long long *count = _count;
	212
	213	printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
6ff854ac MD	214	"dequeuer", (unsigned long) pthread_self(),
6ff854ac MD	215	(unsigned long) gettid());
ee566d46 MD	216
	217	set_affinity();
	218
ee566d46 MD	219	while (!test_go)
	220	{
	221	}
5481ddb3	222	cmm_smp_mb();
ee566d46 MD	223
ee566d46 MD	224	for (;;) {
16aa9ee8	225	struct cds_wfq_node *node = cds_wfq_dequeue_blocking(&q);
ee566d46 MD	226
ee566d46 MD	227	if (node) {
4afee0a7	228	free(node);
bd252a04	229	URCU_TLS(nr_successful_dequeues)++;
ee566d46 MD	230	}
ee566d46 MD	231
bd252a04	232	URCU_TLS(nr_dequeues)++;
a0b7f7ea	233	if (caa_unlikely(!test_duration_dequeue()))
ee566d46	234	break;
a0b7f7ea	235	if (caa_unlikely(rduration))
ee566d46 MD	236	loop_sleep(rduration);
	237	}
	238
ee566d46 MD	239	printf_verbose("dequeuer thread_end, thread id : %lx, tid %lu, "
ee566d46 MD	240	"dequeues %llu, successful_dequeues %llu\n",
6ff854ac MD	241	pthread_self(),
6ff854ac MD	242	(unsigned long) gettid(),
bd252a04 MD	243	URCU_TLS(nr_dequeues), URCU_TLS(nr_successful_dequeues));
	244	count[0] = URCU_TLS(nr_dequeues);
	245	count[1] = URCU_TLS(nr_successful_dequeues);
ee566d46 MD	246	return ((void*)2);
	247	}
	248
16aa9ee8	249	void test_end(struct cds_wfq_queue q, unsigned long long nr_dequeues)
ee566d46	250	{
16aa9ee8	251	struct cds_wfq_node *node;
ee566d46 MD	252
ee566d46 MD	253	do {
16aa9ee8	254	node = cds_wfq_dequeue_blocking(q);
ee566d46	255	if (node) {
4afee0a7	256	free(node);
ee566d46 MD	257	(*nr_dequeues)++;
	258	}
	259	} while (node);
	260	}
	261
	262	void show_usage(int argc, char **argv)
	263	{
	264	printf("Usage : %s nr_dequeuers nr_enqueuers duration (s)", argv[0]);
	265	printf(" [-d delay] (enqueuer period (in loops))");
	266	printf(" [-c duration] (dequeuer period (in loops))");
	267	printf(" [-v] (verbose output)");
	268	printf(" [-a cpu#] [-a cpu#]... (affinity)");
	269	printf("\n");
	270	}
	271
	272	int main(int argc, char **argv)
	273	{
	274	int err;
	275	pthread_t tid_enqueuer, tid_dequeuer;
	276	void *tret;
	277	unsigned long long count_enqueuer, count_dequeuer;
	278	unsigned long long tot_enqueues = 0, tot_dequeues = 0;
	279	unsigned long long tot_successful_enqueues = 0,
	280	tot_successful_dequeues = 0;
	281	unsigned long long end_dequeues = 0;
	282	int i, a;
	283
	284	if (argc < 4) {
	285	show_usage(argc, argv);
	286	return -1;
	287	}
	288
	289	err = sscanf(argv[1], "%u", &nr_dequeuers);
	290	if (err != 1) {
	291	show_usage(argc, argv);
	292	return -1;
	293	}
	294
	295	err = sscanf(argv[2], "%u", &nr_enqueuers);
	296	if (err != 1) {
	297	show_usage(argc, argv);
	298	return -1;
	299	}
	300
	301	err = sscanf(argv[3], "%lu", &duration);
	302	if (err != 1) {
	303	show_usage(argc, argv);
	304	return -1;
	305	}
	306
	307	for (i = 4; i < argc; i++) {
	308	if (argv[i][0] != '-')
	309	continue;
	310	switch (argv[i][1]) {
	311	case 'a':
	312	if (argc < i + 2) {
	313	show_usage(argc, argv);
	314	return -1;
	315	}
	316	a = atoi(argv[++i]);
	317	cpu_affinities[next_aff++] = a;
	318	use_affinity = 1;
	319	printf_verbose("Adding CPU %d affinity\n", a);
	320	break;
321	case 'c':
322	if (argc < i + 2) {
323	show_usage(argc, argv);
324	return -1;
325	}
326	rduration = atol(argv[++i]);
327	break;
328	case 'd':
329	if (argc < i + 2) {
330	show_usage(argc, argv);
331	return -1;
332	}
333	wdelay = atol(argv[++i]);
334	break;
335	case 'v':
336	verbose_mode = 1;
337	break;
338	}
339	}
340
341	printf_verbose("running test for %lu seconds, %u enqueuers, "
342	"%u dequeuers.\n",
343	duration, nr_enqueuers, nr_dequeuers);
344	printf_verbose("Writer delay : %lu loops.\n", rduration);
345	printf_verbose("Reader duration : %lu loops.\n", wdelay);
346	printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
6ff854ac MD	347	"main", (unsigned long) pthread_self(),
6ff854ac MD	348	(unsigned long) gettid());
ee566d46 MD	349
	350	tid_enqueuer = malloc(sizeof(tid_enqueuer) nr_enqueuers);
	351	tid_dequeuer = malloc(sizeof(tid_dequeuer) nr_dequeuers);
	352	count_enqueuer = malloc(2 * sizeof(count_enqueuer) nr_enqueuers);
	353	count_dequeuer = malloc(2 * sizeof(count_dequeuer) nr_dequeuers);
16aa9ee8	354	cds_wfq_init(&q);
ee566d46 MD	355
	356	next_aff = 0;
	357
	358	for (i = 0; i < nr_enqueuers; i++) {
	359	err = pthread_create(&tid_enqueuer[i], NULL, thr_enqueuer,
	360	&count_enqueuer[2 * i]);
	361	if (err != 0)
	362	exit(1);
	363	}
	364	for (i = 0; i < nr_dequeuers; i++) {
	365	err = pthread_create(&tid_dequeuer[i], NULL, thr_dequeuer,
	366	&count_dequeuer[2 * i]);
	367	if (err != 0)
	368	exit(1);
	369	}
	370
5481ddb3	371	cmm_smp_mb();
ee566d46 MD	372
	373	test_go = 1;
	374
	375	for (i = 0; i < duration; i++) {
	376	sleep(1);
	377	if (verbose_mode)
	378	write (1, ".", 1);
	379	}
	380
	381	test_stop = 1;
	382
	383	for (i = 0; i < nr_enqueuers; i++) {
	384	err = pthread_join(tid_enqueuer[i], &tret);
	385	if (err != 0)
	386	exit(1);
	387	tot_enqueues += count_enqueuer[2 * i];
	388	tot_successful_enqueues += count_enqueuer[2 * i + 1];
	389	}
	390	for (i = 0; i < nr_dequeuers; i++) {
	391	err = pthread_join(tid_dequeuer[i], &tret);
	392	if (err != 0)
	393	exit(1);
	394	tot_dequeues += count_dequeuer[2 * i];
	395	tot_successful_dequeues += count_dequeuer[2 * i + 1];
	396	}
	397
	398	test_end(&q, &end_dequeues);
	399
	400	printf_verbose("total number of enqueues : %llu, dequeues %llu\n",
	401	tot_enqueues, tot_dequeues);
	402	printf_verbose("total number of successful enqueues : %llu, "
	403	"successful dequeues %llu\n",
	404	tot_successful_enqueues, tot_successful_dequeues);
	405	printf("SUMMARY %-25s testdur %4lu nr_enqueuers %3u wdelay %6lu "
	406	"nr_dequeuers %3u "
	407	"rdur %6lu nr_enqueues %12llu nr_dequeues %12llu "
	408	"successful enqueues %12llu successful dequeues %12llu "
	409	"end_dequeues %llu nr_ops %12llu\n",
	410	argv[0], duration, nr_enqueuers, wdelay,
	411	nr_dequeuers, rduration, tot_enqueues, tot_dequeues,
	412	tot_successful_enqueues,
	413	tot_successful_dequeues, end_dequeues,
	414	tot_enqueues + tot_dequeues);
	415	if (tot_successful_enqueues != tot_successful_dequeues + end_dequeues)
	416	printf("WARNING! Discrepancy between nr succ. enqueues %llu vs "
	417	"succ. dequeues + end dequeues %llu.\n",
	418	tot_successful_enqueues,
	419	tot_successful_dequeues + end_dequeues);
	420
	421	free(count_enqueuer);
	422	free(count_dequeuer);
	423	free(tid_enqueuer);
	424	free(tid_dequeuer);
	425	return 0;
	426	}