[urcu.git] / tests / benchmark / 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.
 */

#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 <errno.h>

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

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

#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;

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);
	sched_setaffinity(0, sizeof(mask), &mask);
#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, tid %lu\n",
			"enqueuer", urcu_get_thread_id());

	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, tid %lu, "
			"enqueues %llu successful_enqueues %llu\n",
			urcu_get_thread_id(),
			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, tid %lu\n",
			"dequeuer", urcu_get_thread_id());

	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, tid %lu, "
			"dequeues %llu, successful_dequeues %llu\n",
			urcu_get_thread_id(),
			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) <OPTIONS>\n",
		argv[0]);
	printf("OPTIONS:\n");
	printf("	[-d delay] (enqueuer period (in loops))\n");
	printf("	[-c duration] (dequeuer period (in loops))\n");
	printf("	[-v] (verbose output)\n");
	printf("	[-a cpu#] [-a cpu#]... (affinity)\n");
	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;
	unsigned int i_thr;

	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, tid %lu\n",
			"main", urcu_get_thread_id());

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

	next_aff = 0;

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

	cmm_smp_mb();

	test_go = 1;

	for (i_thr = 0; i_thr < duration; i_thr++) {
		sleep(1);
		if (verbose_mode) {
			fwrite(".", sizeof(char), 1, stdout);
			fflush(stdout);
		}
	}

	test_stop = 1;

	for (i_thr = 0; i_thr < nr_enqueuers; i_thr++) {
		err = pthread_join(tid_enqueuer[i_thr], &tret);
		if (err != 0)
			exit(1);
		tot_enqueues += count_enqueuer[2 * i_thr];
		tot_successful_enqueues += count_enqueuer[2 * i_thr + 1];
	}
	for (i_thr = 0; i_thr < nr_dequeuers; i_thr++) {
		err = pthread_join(tid_dequeuer[i_thr], &tret);
		if (err != 0)
			exit(1);
		tot_dequeues += count_dequeuer[2 * i_thr];
		tot_successful_dequeues += count_dequeuer[2 * i_thr + 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);

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