[userspace-rcu.git] / tests / test_urcu_lfs.c

/*
 * test_urcu_lfs.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.
 */

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

#include <urcu/arch.h>
#include <urcu/tls-compat.h>
#include "cpuset.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
#include <urcu.h>
#include <urcu/cds.h>
#include <urcu-defer.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 l)
{
	while(l-- != 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)
{
	cpu_set_t mask;
	int cpu;
	int ret;

	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, thread id : %lx, tid %lu\n",
			"enqueuer", (unsigned long) pthread_self(),
			(unsigned long) gettid());

	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, thread id : %lx, tid %lu, "
		       "enqueues %llu successful_enqueues %llu\n",
		       (unsigned long) pthread_self(),
			(unsigned long) gettid(),
		       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;
	int ret;

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

	set_affinity();

	ret = rcu_defer_register_thread();
	if (ret) {
		printf("Error in rcu_defer_register_thread\n");
		exit(-1);
	}
	rcu_register_thread();

	while (!test_go)
	{
	}
	cmm_smp_mb();

	for (;;) {
		struct cds_lfs_node_rcu *snode;
		struct test *node;

		rcu_read_lock();
		snode = cds_lfs_pop_rcu(&s);
		node = caa_container_of(snode, struct test, list);
		rcu_read_unlock();
		if (node) {
			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();
	rcu_defer_unregister_thread();

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