[urcu.git] / tests / test_urcu_lfs.c

/*
 * test_urcu_lfs.c
 *
 * Userspace RCU library - example lock-free stack
 *
 * Copyright 2010-2012 - 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
#include <urcu.h>
#include <urcu/cds.h>

/*
 * External synchronization used.
 */
enum test_sync {
	TEST_SYNC_NONE = 0,
	TEST_SYNC_RCU,
};

static enum test_sync test_sync;

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;

static int test_pop, test_pop_all;

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

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

static struct cds_lfs_stack s;

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

	printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
			"enqueuer", 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(&node->list);
		cds_lfs_push(&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",
		       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);
}

static
void do_test_pop(enum test_sync sync)
{
	struct cds_lfs_node *snode;

	if (sync == TEST_SYNC_RCU)
		rcu_read_lock();
	snode = __cds_lfs_pop(&s);
	if (sync == TEST_SYNC_RCU)
		rcu_read_unlock();
	if (snode) {
		struct test *node;

		node = caa_container_of(snode,
			struct test, list);
		if (sync == TEST_SYNC_RCU)
			call_rcu(&node->rcu, free_node_cb);
		else
			free(node);
		URCU_TLS(nr_successful_dequeues)++;
	}
	URCU_TLS(nr_dequeues)++;
}

static
void do_test_pop_all(enum test_sync sync)
{
	struct cds_lfs_node *snode;
	struct cds_lfs_head *head;
	struct cds_lfs_node *n;

	head = __cds_lfs_pop_all(&s);
	cds_lfs_for_each_safe(head, snode, n) {
		struct test *node;

		node = caa_container_of(snode, struct test, list);
		if (sync == TEST_SYNC_RCU)
			call_rcu(&node->rcu, free_node_cb);
		else
			free(node);
		URCU_TLS(nr_successful_dequeues)++;
		URCU_TLS(nr_dequeues)++;
	}

}

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

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

	set_affinity();

	rcu_register_thread();

	while (!test_go)
	{
	}
	cmm_smp_mb();

	assert(test_pop || test_pop_all);

	for (;;) {
		unsigned int counter = 0;

		if (test_pop && test_pop_all) {
			/* both pop and pop all */
			if (counter & 1)
				do_test_pop(test_sync);
			else
				do_test_pop_all(test_sync);
			counter++;
		} else {
			if (test_pop)
				do_test_pop(test_sync);
			else
				do_test_pop_all(test_sync);
		}

		if (caa_unlikely(!test_duration_dequeue()))
			break;
		if (caa_unlikely(rduration))
			loop_sleep(rduration);
	}

	rcu_unregister_thread();

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

	do {
		snode = __cds_lfs_pop(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(" [-p] (test pop)");
	printf(" [-P] (test pop_all, enabled by default)");
	printf(" [-R] (use RCU external synchronization)");
	printf("      Note: default: no external synchronization used.");
	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;
		case 'p':
			test_pop = 1;
			break;
		case 'P':
			test_pop_all = 1;
			break;
		case 'R':
			test_sync = TEST_SYNC_RCU;
			break;
		}
	}

	/* activate pop_all test by default */
	if (!test_pop && !test_pop_all)
		test_pop_all = 1;

	printf_verbose("running test for %lu seconds, %u enqueuers, "
		       "%u dequeuers.\n",
		       duration, nr_enqueuers, nr_dequeuers);
	if (test_pop)
		printf_verbose("pop test activated.\n");
	if (test_pop_all)
		printf_verbose("pop_all test activated.\n");
	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", 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_lfs_init(&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	*
cb8818f0	4	* Userspace RCU library - example lock-free stack
453629a9	5	*
cb8818f0	6	* Copyright 2010-2012 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
453629a9 MD	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 <sched.h>
	38	#include <errno.h>
	39
	40	#include <urcu/arch.h>
bd252a04	41	#include <urcu/tls-compat.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	70
111ce0c3 MD	71	/*
	72	* External synchronization used.
	73	*/
	74	enum test_sync {
	75	TEST_SYNC_NONE = 0,
	76	TEST_SYNC_RCU,
	77	};
	78
	79	static enum test_sync test_sync;
	80
453629a9 MD	81	static volatile int test_go, test_stop;
	82
	83	static unsigned long rduration;
	84
	85	static unsigned long duration;
	86
	87	/* read-side C.S. duration, in loops */
	88	static unsigned long wdelay;
	89
ab0aacbe	90	static inline void loop_sleep(unsigned long loops)
453629a9	91	{
ab0aacbe	92	while (loops-- != 0)
06f22bdb	93	caa_cpu_relax();
453629a9 MD	94	}
	95
	96	static int verbose_mode;
	97
111ce0c3 MD	98	static int test_pop, test_pop_all;
111ce0c3 MD	99
453629a9 MD	100	#define printf_verbose(fmt, args...) \
	101	do { \
	102	if (verbose_mode) \
111ce0c3	103	printf(fmt, ## args); \
453629a9 MD	104	} while (0)
	105
	106	static unsigned int cpu_affinities[NR_CPUS];
	107	static unsigned int next_aff = 0;
	108	static int use_affinity = 0;
	109
	110	pthread_mutex_t affinity_mutex = PTHREAD_MUTEX_INITIALIZER;
	111
	112	#ifndef HAVE_CPU_SET_T
	113	typedef unsigned long cpu_set_t;
	114	# define CPU_ZERO(cpuset) do { *(cpuset) = 0; } while(0)
	115	# define CPU_SET(cpu, cpuset) do { *(cpuset) \|= (1UL << (cpu)); } while(0)
	116	#endif
	117
	118	static void set_affinity(void)
	119	{
95bc7fb9	120	#if HAVE_SCHED_SETAFFINITY
453629a9	121	cpu_set_t mask;
95bc7fb9 MD	122	int cpu, ret;
95bc7fb9 MD	123	#endif /* HAVE_SCHED_SETAFFINITY */
453629a9 MD	124
	125	if (!use_affinity)
	126	return;
	127
	128	#if HAVE_SCHED_SETAFFINITY
	129	ret = pthread_mutex_lock(&affinity_mutex);
	130	if (ret) {
	131	perror("Error in pthread mutex lock");
	132	exit(-1);
	133	}
	134	cpu = cpu_affinities[next_aff++];
	135	ret = pthread_mutex_unlock(&affinity_mutex);
	136	if (ret) {
	137	perror("Error in pthread mutex unlock");
	138	exit(-1);
	139	}
	140
	141	CPU_ZERO(&mask);
	142	CPU_SET(cpu, &mask);
	143	#if SCHED_SETAFFINITY_ARGS == 2
	144	sched_setaffinity(0, &mask);
	145	#else
	146	sched_setaffinity(0, sizeof(mask), &mask);
	147	#endif
	148	#endif /* HAVE_SCHED_SETAFFINITY */
	149	}
	150
	151	/*
	152	* returns 0 if test should end.
	153	*/
	154	static int test_duration_dequeue(void)
	155	{
	156	return !test_stop;
	157	}
	158
	159	static int test_duration_enqueue(void)
	160	{
	161	return !test_stop;
	162	}
	163
bd252a04 MD	164	static DEFINE_URCU_TLS(unsigned long long, nr_dequeues);
bd252a04 MD	165	static DEFINE_URCU_TLS(unsigned long long, nr_enqueues);
453629a9	166
bd252a04 MD	167	static DEFINE_URCU_TLS(unsigned long long, nr_successful_dequeues);
bd252a04 MD	168	static DEFINE_URCU_TLS(unsigned long long, nr_successful_enqueues);
453629a9 MD	169
	170	static unsigned int nr_enqueuers;
	171	static unsigned int nr_dequeuers;
	172
94aec122	173	struct test {
cb8818f0	174	struct cds_lfs_node list;
94aec122 MD	175	struct rcu_head rcu;
	176	};
	177
cb8818f0	178	static struct cds_lfs_stack s;
453629a9 MD	179
	180	void thr_enqueuer(void _count)
	181	{
	182	unsigned long long *count = _count;
	183
	184	printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
	185	"enqueuer", pthread_self(), (unsigned long)gettid());
	186
	187	set_affinity();
	188
	189	rcu_register_thread();
	190
	191	while (!test_go)
	192	{
	193	}
5481ddb3	194	cmm_smp_mb();
453629a9 MD	195
453629a9 MD	196	for (;;) {
94aec122	197	struct test node = malloc(sizeof(node));
453629a9 MD	198	if (!node)
453629a9 MD	199	goto fail;
cb8818f0 MD	200	cds_lfs_node_init(&node->list);
cb8818f0 MD	201	cds_lfs_push(&s, &node->list);
bd252a04	202	URCU_TLS(nr_successful_enqueues)++;
453629a9	203
a0b7f7ea	204	if (caa_unlikely(wdelay))
453629a9 MD	205	loop_sleep(wdelay);
453629a9 MD	206	fail:
bd252a04	207	URCU_TLS(nr_enqueues)++;
a0b7f7ea	208	if (caa_unlikely(!test_duration_enqueue()))
453629a9 MD	209	break;
	210	}
	211
	212	rcu_unregister_thread();
	213
bd252a04 MD	214	count[0] = URCU_TLS(nr_enqueues);
bd252a04 MD	215	count[1] = URCU_TLS(nr_successful_enqueues);
453629a9 MD	216	printf_verbose("enqueuer thread_end, thread id : %lx, tid %lu, "
453629a9 MD	217	"enqueues %llu successful_enqueues %llu\n",
bd252a04 MD	218	pthread_self(), (unsigned long)gettid(),
bd252a04 MD	219	URCU_TLS(nr_enqueues), URCU_TLS(nr_successful_enqueues));
453629a9 MD	220	return ((void*)1);
	221
	222	}
	223
94aec122 MD	224	static
	225	void free_node_cb(struct rcu_head *head)
	226	{
	227	struct test *node =
	228	caa_container_of(head, struct test, rcu);
	229	free(node);
	230	}
	231
111ce0c3 MD	232	static
	233	void do_test_pop(enum test_sync sync)
	234	{
	235	struct cds_lfs_node *snode;
	236
	237	if (sync == TEST_SYNC_RCU)
	238	rcu_read_lock();
	239	snode = __cds_lfs_pop(&s);
	240	if (sync == TEST_SYNC_RCU)
	241	rcu_read_unlock();
	242	if (snode) {
	243	struct test *node;
	244
	245	node = caa_container_of(snode,
	246	struct test, list);
	247	if (sync == TEST_SYNC_RCU)
	248	call_rcu(&node->rcu, free_node_cb);
	249	else
	250	free(node);
	251	URCU_TLS(nr_successful_dequeues)++;
	252	}
	253	URCU_TLS(nr_dequeues)++;
	254	}
	255
	256	static
	257	void do_test_pop_all(enum test_sync sync)
	258	{
	259	struct cds_lfs_node *snode;
	260	struct cds_lfs_head *head;
	261	struct cds_lfs_node *n;
	262
	263	head = __cds_lfs_pop_all(&s);
	264	cds_lfs_for_each_safe(head, snode, n) {
	265	struct test *node;
	266
	267	node = caa_container_of(snode, struct test, list);
	268	if (sync == TEST_SYNC_RCU)
	269	call_rcu(&node->rcu, free_node_cb);
	270	else
	271	free(node);
	272	URCU_TLS(nr_successful_dequeues)++;
	273	URCU_TLS(nr_dequeues)++;
	274	}
	275
	276	}
	277
453629a9 MD	278	void thr_dequeuer(void _count)
	279	{
	280	unsigned long long *count = _count;
	281
	282	printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
	283	"dequeuer", pthread_self(), (unsigned long)gettid());
	284
	285	set_affinity();
	286
453629a9 MD	287	rcu_register_thread();
	288
	289	while (!test_go)
	290	{
	291	}
5481ddb3	292	cmm_smp_mb();
453629a9	293
111ce0c3	294	assert(test_pop \|\| test_pop_all);
f3eb6ef1	295
111ce0c3 MD	296	for (;;) {
	297	unsigned int counter = 0;
	298
	299	if (test_pop && test_pop_all) {
	300	/* both pop and pop all */
	301	if (counter & 1)
	302	do_test_pop(test_sync);
	303	else
	304	do_test_pop_all(test_sync);
	305	counter++;
	306	} else {
	307	if (test_pop)
	308	do_test_pop(test_sync);
	309	else
	310	do_test_pop_all(test_sync);
453629a9	311	}
111ce0c3	312
a0b7f7ea	313	if (caa_unlikely(!test_duration_dequeue()))
453629a9	314	break;
a0b7f7ea	315	if (caa_unlikely(rduration))
453629a9 MD	316	loop_sleep(rduration);
	317	}
	318
	319	rcu_unregister_thread();
453629a9 MD	320
	321	printf_verbose("dequeuer thread_end, thread id : %lx, tid %lu, "
	322	"dequeues %llu, successful_dequeues %llu\n",
bd252a04 MD	323	pthread_self(), (unsigned long)gettid(),
	324	URCU_TLS(nr_dequeues), URCU_TLS(nr_successful_dequeues));
	325	count[0] = URCU_TLS(nr_dequeues);
	326	count[1] = URCU_TLS(nr_successful_dequeues);
453629a9 MD	327	return ((void*)2);
	328	}
	329
cb8818f0	330	void test_end(struct cds_lfs_stack s, unsigned long long nr_dequeues)
453629a9	331	{
cb8818f0	332	struct cds_lfs_node *snode;
453629a9 MD	333
453629a9 MD	334	do {
7294103b	335	snode = __cds_lfs_pop(s);
94aec122 MD	336	if (snode) {
	337	struct test *node;
	338
	339	node = caa_container_of(snode, struct test, list);
453629a9 MD	340	free(node);
	341	(*nr_dequeues)++;
	342	}
94aec122	343	} while (snode);
453629a9 MD	344	}
	345
	346	void show_usage(int argc, char **argv)
	347	{
	348	printf("Usage : %s nr_dequeuers nr_enqueuers duration (s)", argv[0]);
	349	printf(" [-d delay] (enqueuer period (in loops))");
	350	printf(" [-c duration] (dequeuer period (in loops))");
	351	printf(" [-v] (verbose output)");
	352	printf(" [-a cpu#] [-a cpu#]... (affinity)");
111ce0c3 MD	353	printf(" [-p] (test pop)");
	354	printf(" [-P] (test pop_all, enabled by default)");
	355	printf(" [-R] (use RCU external synchronization)");
	356	printf(" Note: default: no external synchronization used.");
453629a9 MD	357	printf("\n");
	358	}
	359
	360	int main(int argc, char **argv)
	361	{
	362	int err;
	363	pthread_t tid_enqueuer, tid_dequeuer;
	364	void *tret;
	365	unsigned long long count_enqueuer, count_dequeuer;
	366	unsigned long long tot_enqueues = 0, tot_dequeues = 0;
	367	unsigned long long tot_successful_enqueues = 0,
	368	tot_successful_dequeues = 0;
	369	unsigned long long end_dequeues = 0;
	370	int i, a;
	371
	372	if (argc < 4) {
	373	show_usage(argc, argv);
	374	return -1;
	375	}
	376
	377	err = sscanf(argv[1], "%u", &nr_dequeuers);
	378	if (err != 1) {
	379	show_usage(argc, argv);
	380	return -1;
	381	}
	382
	383	err = sscanf(argv[2], "%u", &nr_enqueuers);
	384	if (err != 1) {
	385	show_usage(argc, argv);
	386	return -1;
	387	}
	388
	389	err = sscanf(argv[3], "%lu", &duration);
	390	if (err != 1) {
	391	show_usage(argc, argv);
	392	return -1;
	393	}
	394
	395	for (i = 4; i < argc; i++) {
	396	if (argv[i][0] != '-')
	397	continue;
	398	switch (argv[i][1]) {
	399	case 'a':
	400	if (argc < i + 2) {
	401	show_usage(argc, argv);
	402	return -1;
	403	}
	404	a = atoi(argv[++i]);
	405	cpu_affinities[next_aff++] = a;
	406	use_affinity = 1;
	407	printf_verbose("Adding CPU %d affinity\n", a);
	408	break;
	409	case 'c':
	410	if (argc < i + 2) {
	411	show_usage(argc, argv);
	412	return -1;
	413	}
	414	rduration = atol(argv[++i]);
	415	break;
	416	case 'd':
	417	if (argc < i + 2) {
	418	show_usage(argc, argv);
	419	return -1;
	420	}
421	wdelay = atol(argv[++i]);
422	break;
423	case 'v':
424	verbose_mode = 1;
425	break;
111ce0c3 MD	426	case 'p':
	427	test_pop = 1;
	428	break;
	429	case 'P':
	430	test_pop_all = 1;
	431	break;
	432	case 'R':
	433	test_sync = TEST_SYNC_RCU;
	434	break;
453629a9 MD	435	}
	436	}
	437
111ce0c3 MD	438	/* activate pop_all test by default */
	439	if (!test_pop && !test_pop_all)
	440	test_pop_all = 1;
	441
453629a9 MD	442	printf_verbose("running test for %lu seconds, %u enqueuers, "
	443	"%u dequeuers.\n",
	444	duration, nr_enqueuers, nr_dequeuers);
111ce0c3 MD	445	if (test_pop)
	446	printf_verbose("pop test activated.\n");
	447	if (test_pop_all)
	448	printf_verbose("pop_all test activated.\n");
453629a9 MD	449	printf_verbose("Writer delay : %lu loops.\n", rduration);
	450	printf_verbose("Reader duration : %lu loops.\n", wdelay);
	451	printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
	452	"main", pthread_self(), (unsigned long)gettid());
	453
	454	tid_enqueuer = malloc(sizeof(tid_enqueuer) nr_enqueuers);
	455	tid_dequeuer = malloc(sizeof(tid_dequeuer) nr_dequeuers);
	456	count_enqueuer = malloc(2 * sizeof(count_enqueuer) nr_enqueuers);
	457	count_dequeuer = malloc(2 * sizeof(count_dequeuer) nr_dequeuers);
cb8818f0	458	cds_lfs_init(&s);
94aec122	459	err = create_all_cpu_call_rcu_data(0);
8bcbd94a MD	460	if (err) {
	461	printf("Per-CPU call_rcu() worker threads unavailable. Using default global worker thread.\n");
	462	}
453629a9 MD	463
	464	next_aff = 0;
	465
	466	for (i = 0; i < nr_enqueuers; i++) {
	467	err = pthread_create(&tid_enqueuer[i], NULL, thr_enqueuer,
	468	&count_enqueuer[2 * i]);
	469	if (err != 0)
	470	exit(1);
	471	}
	472	for (i = 0; i < nr_dequeuers; i++) {
	473	err = pthread_create(&tid_dequeuer[i], NULL, thr_dequeuer,
	474	&count_dequeuer[2 * i]);
	475	if (err != 0)
	476	exit(1);
	477	}
	478
5481ddb3	479	cmm_smp_mb();
453629a9 MD	480
	481	test_go = 1;
	482
	483	for (i = 0; i < duration; i++) {
	484	sleep(1);
	485	if (verbose_mode)
	486	write (1, ".", 1);
	487	}
	488
	489	test_stop = 1;
	490
	491	for (i = 0; i < nr_enqueuers; i++) {
	492	err = pthread_join(tid_enqueuer[i], &tret);
	493	if (err != 0)
	494	exit(1);
	495	tot_enqueues += count_enqueuer[2 * i];
	496	tot_successful_enqueues += count_enqueuer[2 * i + 1];
	497	}
	498	for (i = 0; i < nr_dequeuers; i++) {
	499	err = pthread_join(tid_dequeuer[i], &tret);
	500	if (err != 0)
	501	exit(1);
	502	tot_dequeues += count_dequeuer[2 * i];
	503	tot_successful_dequeues += count_dequeuer[2 * i + 1];
	504	}
	505
	506	test_end(&s, &end_dequeues);
	507
	508	printf_verbose("total number of enqueues : %llu, dequeues %llu\n",
	509	tot_enqueues, tot_dequeues);
	510	printf_verbose("total number of successful enqueues : %llu, "
	511	"successful dequeues %llu\n",
	512	tot_successful_enqueues, tot_successful_dequeues);
	513	printf("SUMMARY %-25s testdur %4lu nr_enqueuers %3u wdelay %6lu "
	514	"nr_dequeuers %3u "
	515	"rdur %6lu nr_enqueues %12llu nr_dequeues %12llu "
	516	"successful enqueues %12llu successful dequeues %12llu "
	517	"end_dequeues %llu nr_ops %12llu\n",
	518	argv[0], duration, nr_enqueuers, wdelay,
	519	nr_dequeuers, rduration, tot_enqueues, tot_dequeues,
	520	tot_successful_enqueues,
	521	tot_successful_dequeues, end_dequeues,
	522	tot_enqueues + tot_dequeues);
	523	if (tot_successful_enqueues != tot_successful_dequeues + end_dequeues)
	524	printf("WARNING! Discrepancy between nr succ. enqueues %llu vs "
	525	"succ. dequeues + end dequeues %llu.\n",
	526	tot_successful_enqueues,
	527	tot_successful_dequeues + end_dequeues);
	528
0938c541	529	free_all_cpu_call_rcu_data();
453629a9 MD	530	free(count_enqueuer);
	531	free(count_dequeuer);
	532	free(tid_enqueuer);
	533	free(tid_dequeuer);
	534	return 0;
	535	}