[urcu.git] / tests / benchmark / test_urcu_lfs_rcu.c

/*
 * test_urcu_lfs_rcu.c
 *
 * Userspace RCU library - example RCU-based lock-free stack
 *
 * 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 "cpuset.h"
#include "thread-id.h"

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

#ifndef DYNAMIC_LINK_TEST
#define _LGPL_SOURCE
#endif
#include <urcu.h>

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

#include <urcu/cds.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);
#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;

struct test {
	struct cds_lfs_node_rcu list;
	struct rcu_head rcu;
};

static struct cds_lfs_stack_rcu s;

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();

	rcu_register_thread();

	while (!test_go)
	{
	}
	cmm_smp_mb();

	for (;;) {
		struct test *node = malloc(sizeof(*node));
		if (!node)
			goto fail;
		cds_lfs_node_init_rcu(&node->list);
		/* No rcu read-side is needed for push */
		cds_lfs_push_rcu(&s, &node->list);
		URCU_TLS(nr_successful_enqueues)++;

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

	rcu_unregister_thread();

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

}

static
void free_node_cb(struct rcu_head *head)
{
	struct test *node =
		caa_container_of(head, struct test, rcu);
	free(node);
}

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();

	rcu_register_thread();

	while (!test_go)
	{
	}
	cmm_smp_mb();

	for (;;) {
		struct cds_lfs_node_rcu *snode;

		rcu_read_lock();
		snode = cds_lfs_pop_rcu(&s);
		rcu_read_unlock();
		if (snode) {
			struct test *node;

			node = caa_container_of(snode, struct test, list);
			call_rcu(&node->rcu, free_node_cb);
			URCU_TLS(nr_successful_dequeues)++;
		}
		URCU_TLS(nr_dequeues)++;
		if (caa_unlikely(!test_duration_dequeue()))
			break;
		if (caa_unlikely(rduration))
			loop_sleep(rduration);
	}

	rcu_unregister_thread();

	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_lfs_stack_rcu *s, unsigned long long *nr_dequeues)
{
	struct cds_lfs_node_rcu *snode;

	do {
		snode = cds_lfs_pop_rcu(s);
		if (snode) {
			struct test *node;

			node = caa_container_of(snode, struct test, list);
			free(node);
			(*nr_dequeues)++;
		}
	} while (snode);
}

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_lfs_init_rcu(&s);
	err = create_all_cpu_call_rcu_data(0);
	if (err) {
		printf("Per-CPU call_rcu() worker threads unavailable. Using default global worker thread.\n");
	}

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