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

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

static struct cds_lfs_stack_rcu s;

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

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

static
void test_end(unsigned long long *nr_dequeues_l)
{
	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_l)++;
		}
	} while (snode);
}

static
void show_usage(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(argv);
		return -1;
	}

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

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

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