[urcu.git] / tests / test_urcu_gc.c

/*
 * test_urcu_gc.c
 *
 * Userspace RCU library - test program (with baatch reclamation)
 *
 * Copyright February 2009 - Mathieu Desnoyers <mathieu.desnoyers@efficios.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 <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>

#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
#else
#define debug_yield_read()
#endif
#include <urcu.h>

struct test_array {
	int a;
};

static volatile int test_go, test_stop;

static unsigned long wdelay;

static struct test_array *test_rcu_pointer;

static unsigned int reclaim_batch = 1;

struct reclaim_queue {
	void **queue;	/* Beginning of queue */
	void **head;	/* Insert position */
};

static struct reclaim_queue *pending_reclaims;

static unsigned long duration;

/* read-side C.S. duration, in loops */
static unsigned long rduration;

/* write-side C.S. duration, in loops */
static unsigned long wduration;

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;

#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)
{
	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_write(void)
{
	return !test_stop;
}

static int test_duration_read(void)
{
	return !test_stop;
}

static unsigned long long __thread nr_writes;
static unsigned long long __thread nr_reads;

static
unsigned long long __attribute__((aligned(CAA_CACHE_LINE_SIZE))) *tot_nr_writes;

static unsigned int nr_readers;
static unsigned int nr_writers;

pthread_mutex_t rcu_copy_mutex = PTHREAD_MUTEX_INITIALIZER;

void rcu_copy_mutex_lock(void)
{
	int ret;
	ret = pthread_mutex_lock(&rcu_copy_mutex);
	if (ret) {
		perror("Error in pthread mutex lock");
		exit(-1);
	}
}

void rcu_copy_mutex_unlock(void)
{
	int ret;

	ret = pthread_mutex_unlock(&rcu_copy_mutex);
	if (ret) {
		perror("Error in pthread mutex unlock");
		exit(-1);
	}
}

void *thr_reader(void *_count)
{
	unsigned long long *count = _count;
	struct test_array *local_ptr;

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

	set_affinity();

	rcu_register_thread();

	while (!test_go)
	{
	}
	cmm_smp_mb();

	for (;;) {
		rcu_read_lock();
		local_ptr = rcu_dereference(test_rcu_pointer);
		debug_yield_read();
		if (local_ptr)
			assert(local_ptr->a == 8);
		if (unlikely(rduration))
			loop_sleep(rduration);
		rcu_read_unlock();
		nr_reads++;
		if (unlikely(!test_duration_read()))
			break;
	}

	rcu_unregister_thread();

	*count = nr_reads;
	printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
			"reader", pthread_self(), (unsigned long)gettid());
	return ((void*)1);

}

static void rcu_gc_clear_queue(unsigned long wtidx)
{
	void **p;

	/* Wait for Q.S and empty queue */
	synchronize_rcu();

	for (p = pending_reclaims[wtidx].queue;
			p < pending_reclaims[wtidx].head; p++) {
		/* poison */
		if (*p)
			((struct test_array *)*p)->a = 0;
		free(*p);
	}
	pending_reclaims[wtidx].head = pending_reclaims[wtidx].queue;
}

/* Using per-thread queue */
static void rcu_gc_reclaim(unsigned long wtidx, void *old)
{
	/* Queue pointer */
	*pending_reclaims[wtidx].head = old;
	pending_reclaims[wtidx].head++;

	if (likely(pending_reclaims[wtidx].head - pending_reclaims[wtidx].queue
			< reclaim_batch))
		return;

	rcu_gc_clear_queue(wtidx);
}

void *thr_writer(void *data)
{
	unsigned long wtidx = (unsigned long)data;
#ifdef TEST_LOCAL_GC
	struct test_array *old = NULL;
#else
	struct test_array *new, *old;
#endif

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

	set_affinity();

	while (!test_go)
	{
	}
	cmm_smp_mb();

	for (;;) {
#ifndef TEST_LOCAL_GC
		new = malloc(sizeof(*new));
		new->a = 8;
		old = rcu_xchg_pointer(&test_rcu_pointer, new);
#endif
		if (unlikely(wduration))
			loop_sleep(wduration);
		rcu_gc_reclaim(wtidx, old);
		nr_writes++;
		if (unlikely(!test_duration_write()))
			break;
		if (unlikely(wdelay))
			loop_sleep(wdelay);
	}

	printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
			"writer", pthread_self(), (unsigned long)gettid());
	tot_nr_writes[wtidx] = nr_writes;
	return ((void*)2);
}

void show_usage(int argc, char **argv)
{
	printf("Usage : %s nr_readers nr_writers duration (s)", argv[0]);
#ifdef DEBUG_YIELD
	printf(" [-r] [-w] (yield reader and/or writer)");
#endif
	printf(" [-d delay] (writer period (us))");
	printf(" [-c duration] (reader C.S. duration (in loops))");
	printf(" [-e duration] (writer C.S. duration (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_reader, *tid_writer;
	void *tret;
	unsigned long long *count_reader;
	unsigned long long tot_reads = 0, tot_writes = 0;
	int i, a;

	if (argc < 4) {
		show_usage(argc, argv);
		return -1;
	}

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

	err = sscanf(argv[2], "%u", &nr_writers);
	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]) {
#ifdef DEBUG_YIELD
		case 'r':
			yield_active |= YIELD_READ;
			break;
		case 'w':
			yield_active |= YIELD_WRITE;
			break;
#endif
		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 'b':
			if (argc < i + 2) {
				show_usage(argc, argv);
				return -1;
			}
			reclaim_batch = atol(argv[++i]);
			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 'e':
			if (argc < i + 2) {
				show_usage(argc, argv);
				return -1;
			}
			wduration = atol(argv[++i]);
			break;
		case 'v':
			verbose_mode = 1;
			break;
		}
	}

	printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
		duration, nr_readers, nr_writers);
	printf_verbose("Writer delay : %lu loops.\n", wdelay);
	printf_verbose("Reader duration : %lu loops.\n", rduration);
	printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
			"main", pthread_self(), (unsigned long)gettid());

	tid_reader = malloc(sizeof(*tid_reader) * nr_readers);
	tid_writer = malloc(sizeof(*tid_writer) * nr_writers);
	count_reader = malloc(sizeof(*count_reader) * nr_readers);
	tot_nr_writes = malloc(sizeof(*tot_nr_writes) * nr_writers);
	pending_reclaims = malloc(sizeof(*pending_reclaims) * nr_writers);
	if (reclaim_batch * sizeof(*pending_reclaims[i].queue)
			< CAA_CACHE_LINE_SIZE)
		for (i = 0; i < nr_writers; i++)
			pending_reclaims[i].queue = calloc(1, CAA_CACHE_LINE_SIZE);
	else
		for (i = 0; i < nr_writers; i++)
			pending_reclaims[i].queue = calloc(reclaim_batch,
					sizeof(*pending_reclaims[i].queue));
	for (i = 0; i < nr_writers; i++)
		pending_reclaims[i].head = pending_reclaims[i].queue;

	next_aff = 0;

	for (i = 0; i < nr_readers; i++) {
		err = pthread_create(&tid_reader[i], NULL, thr_reader,
				     &count_reader[i]);
		if (err != 0)
			exit(1);
	}
	for (i = 0; i < nr_writers; i++) {
		err = pthread_create(&tid_writer[i], NULL, thr_writer,
				     (void *)(long)i);
		if (err != 0)
			exit(1);
	}

	cmm_smp_mb();

	test_go = 1;

	sleep(duration);

	test_stop = 1;

	for (i = 0; i < nr_readers; i++) {
		err = pthread_join(tid_reader[i], &tret);
		if (err != 0)
			exit(1);
		tot_reads += count_reader[i];
	}
	for (i = 0; i < nr_writers; i++) {
		err = pthread_join(tid_writer[i], &tret);
		if (err != 0)
			exit(1);
		tot_writes += tot_nr_writes[i];
		rcu_gc_clear_queue(i);
	}
	
	printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads,
	       tot_writes);
	printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu wdur %6lu "
		"nr_writers %3u "
		"wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu "
		"batch %u\n",
		argv[0], duration, nr_readers, rduration, wduration,
		nr_writers, wdelay, tot_reads, tot_writes,
		tot_reads + tot_writes, reclaim_batch);
	free(tid_reader);
	free(tid_writer);
	free(count_reader);
	free(tot_nr_writes);
	for (i = 0; i < nr_writers; i++)
		free(pending_reclaims[i].queue);
	free(pending_reclaims);

	return 0;
}
Commit	Line	Data
a813abf8 MD	1	/*
	2	* test_urcu_gc.c
	3	*
	4	* Userspace RCU library - test program (with baatch reclamation)
	5	*
6982d6d7	6	* Copyright February 2009 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
a813abf8 MD	7	*
	8	* This program is free software; you can redistribute it and/or modify
	9	* it under the terms of the GNU General Public License as published by
	10	* the Free Software Foundation; either version 2 of the License, or
	11	* (at your option) any later version.
	12	*
	13	* This program is distributed in the hope that it will be useful,
	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	16	* GNU General Public License for more details.
	17	*
	18	* You should have received a copy of the GNU General Public License along
	19	* with this program; if not, write to the Free Software Foundation, Inc.,
	20	* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
	21	*/
	22
	23	#define _GNU_SOURCE
d8540fc5	24	#include "../config.h"
a813abf8 MD	25	#include <stdio.h>
	26	#include <pthread.h>
	27	#include <stdlib.h>
	28	#include <string.h>
	29	#include <sys/types.h>
	30	#include <sys/wait.h>
	31	#include <unistd.h>
	32	#include <stdio.h>
	33	#include <assert.h>
a813abf8	34	#include <sched.h>
94b343fd	35	#include <errno.h>
a813abf8	36
ec4e58a3	37	#include <urcu/arch.h>
a813abf8	38
65fcc7e9 MD	39	#ifdef __linux__
	40	#include <syscall.h>
	41	#endif
	42
2a7ac59d MD	43	/* hardcoded number of CPUs */
	44	#define NR_CPUS 16384
	45
a813abf8 MD	46	#if defined(_syscall0)
	47	_syscall0(pid_t, gettid)
	48	#elif defined(__NR_gettid)
	49	static inline pid_t gettid(void)
	50	{
	51	return syscall(__NR_gettid);
	52	}
	53	#else
	54	#warning "use pid as tid"
	55	static inline pid_t gettid(void)
	56	{
	57	return getpid();
	58	}
	59	#endif
	60
	61	#ifndef DYNAMIC_LINK_TEST
	62	#define _LGPL_SOURCE
	63	#else
	64	#define debug_yield_read()
	65	#endif
ec4e58a3	66	#include <urcu.h>
a813abf8 MD	67
	68	struct test_array {
	69	int a;
	70	};
	71
	72	static volatile int test_go, test_stop;
	73
	74	static unsigned long wdelay;
	75
	76	static struct test_array *test_rcu_pointer;
	77
4a3e0004	78	static unsigned int reclaim_batch = 1;
a813abf8 MD	79
	80	struct reclaim_queue {
	81	void *queue; / Beginning of queue */
	82	void *head; / Insert position */
	83	};
	84
	85	static struct reclaim_queue *pending_reclaims;
	86
	87	static unsigned long duration;
	88
	89	/* read-side C.S. duration, in loops */
	90	static unsigned long rduration;
	91
31b598e0 MD	92	/* write-side C.S. duration, in loops */
	93	static unsigned long wduration;
	94
a813abf8 MD	95	static inline void loop_sleep(unsigned long l)
	96	{
	97	while(l-- != 0)
06f22bdb	98	caa_cpu_relax();
a813abf8 MD	99	}
	100
	101	static int verbose_mode;
	102
	103	#define printf_verbose(fmt, args...) \
	104	do { \
	105	if (verbose_mode) \
	106	printf(fmt, args); \
	107	} while (0)
	108
2a7ac59d MD	109	static unsigned int cpu_affinities[NR_CPUS];
	110	static unsigned int next_aff = 0;
	111	static int use_affinity = 0;
	112
6af882ba MD	113	pthread_mutex_t affinity_mutex = PTHREAD_MUTEX_INITIALIZER;
6af882ba MD	114
d8540fc5 PA	115	#ifndef HAVE_CPU_SET_T
	116	typedef unsigned long cpu_set_t;
	117	# define CPU_ZERO(cpuset) do { *(cpuset) = 0; } while(0)
	118	# define CPU_SET(cpu, cpuset) do { *(cpuset) \|= (1UL << (cpu)); } while(0)
	119	#endif
	120
2a7ac59d MD	121	static void set_affinity(void)
	122	{
	123	cpu_set_t mask;
	124	int cpu;
6af882ba	125	int ret;
2a7ac59d MD	126
	127	if (!use_affinity)
	128	return;
	129
d8540fc5	130	#if HAVE_SCHED_SETAFFINITY
6af882ba MD	131	ret = pthread_mutex_lock(&affinity_mutex);
	132	if (ret) {
	133	perror("Error in pthread mutex lock");
	134	exit(-1);
	135	}
2a7ac59d	136	cpu = cpu_affinities[next_aff++];
6af882ba MD	137	ret = pthread_mutex_unlock(&affinity_mutex);
	138	if (ret) {
	139	perror("Error in pthread mutex unlock");
	140	exit(-1);
	141	}
d8540fc5	142
2a7ac59d MD	143	CPU_ZERO(&mask);
2a7ac59d MD	144	CPU_SET(cpu, &mask);
d8540fc5 PA	145	#if SCHED_SETAFFINITY_ARGS == 2
	146	sched_setaffinity(0, &mask);
	147	#else
2a7ac59d	148	sched_setaffinity(0, sizeof(mask), &mask);
d8540fc5 PA	149	#endif
d8540fc5 PA	150	#endif /* HAVE_SCHED_SETAFFINITY */
2a7ac59d MD	151	}
2a7ac59d MD	152
a813abf8 MD	153	/*
	154	* returns 0 if test should end.
	155	*/
	156	static int test_duration_write(void)
	157	{
	158	return !test_stop;
	159	}
	160
	161	static int test_duration_read(void)
	162	{
	163	return !test_stop;
	164	}
	165
	166	static unsigned long long __thread nr_writes;
	167	static unsigned long long __thread nr_reads;
	168
	169	static
06f22bdb	170	unsigned long long __attribute__((aligned(CAA_CACHE_LINE_SIZE))) *tot_nr_writes;
a813abf8 MD	171
	172	static unsigned int nr_readers;
	173	static unsigned int nr_writers;
	174
	175	pthread_mutex_t rcu_copy_mutex = PTHREAD_MUTEX_INITIALIZER;
	176
	177	void rcu_copy_mutex_lock(void)
	178	{
	179	int ret;
	180	ret = pthread_mutex_lock(&rcu_copy_mutex);
	181	if (ret) {
	182	perror("Error in pthread mutex lock");
	183	exit(-1);
	184	}
	185	}
	186
	187	void rcu_copy_mutex_unlock(void)
	188	{
	189	int ret;
	190
	191	ret = pthread_mutex_unlock(&rcu_copy_mutex);
	192	if (ret) {
	193	perror("Error in pthread mutex unlock");
	194	exit(-1);
	195	}
	196	}
	197
	198	void thr_reader(void _count)
	199	{
	200	unsigned long long *count = _count;
	201	struct test_array *local_ptr;
	202
	203	printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
	204	"reader", pthread_self(), (unsigned long)gettid());
	205
2a7ac59d MD	206	set_affinity();
2a7ac59d MD	207
a813abf8 MD	208	rcu_register_thread();
	209
	210	while (!test_go)
	211	{
	212	}
5481ddb3	213	cmm_smp_mb();
a813abf8 MD	214
	215	for (;;) {
	216	rcu_read_lock();
	217	local_ptr = rcu_dereference(test_rcu_pointer);
	218	debug_yield_read();
	219	if (local_ptr)
	220	assert(local_ptr->a == 8);
	221	if (unlikely(rduration))
	222	loop_sleep(rduration);
	223	rcu_read_unlock();
	224	nr_reads++;
	225	if (unlikely(!test_duration_read()))
	226	break;
	227	}
	228
	229	rcu_unregister_thread();
	230
	231	*count = nr_reads;
	232	printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
	233	"reader", pthread_self(), (unsigned long)gettid());
	234	return ((void*)1);
	235
	236	}
	237
53091fe5	238	static void rcu_gc_clear_queue(unsigned long wtidx)
a813abf8 MD	239	{
	240	void **p;
	241
53091fe5	242	/* Wait for Q.S and empty queue */
a813abf8 MD	243	synchronize_rcu();
	244
	245	for (p = pending_reclaims[wtidx].queue;
	246	p < pending_reclaims[wtidx].head; p++) {
	247	/* poison */
	248	if (*p)
	249	((struct test_array )p)->a = 0;
	250	free(*p);
	251	}
	252	pending_reclaims[wtidx].head = pending_reclaims[wtidx].queue;
	253	}
	254
53091fe5 MD	255	/* Using per-thread queue */
53091fe5 MD	256	static void rcu_gc_reclaim(unsigned long wtidx, void *old)
a813abf8	257	{
53091fe5 MD	258	/* Queue pointer */
	259	*pending_reclaims[wtidx].head = old;
	260	pending_reclaims[wtidx].head++;
a813abf8	261
53091fe5 MD	262	if (likely(pending_reclaims[wtidx].head - pending_reclaims[wtidx].queue
	263	< reclaim_batch))
	264	return;
a813abf8	265
53091fe5	266	rcu_gc_clear_queue(wtidx);
a813abf8 MD	267	}
	268
	269	void thr_writer(void data)
	270	{
	271	unsigned long wtidx = (unsigned long)data;
321e29d9 MD	272	#ifdef TEST_LOCAL_GC
	273	struct test_array *old = NULL;
	274	#else
a813abf8	275	struct test_array new, old;
321e29d9	276	#endif
a813abf8 MD	277
	278	printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
	279	"writer", pthread_self(), (unsigned long)gettid());
	280
2a7ac59d MD	281	set_affinity();
2a7ac59d MD	282
a813abf8 MD	283	while (!test_go)
	284	{
	285	}
5481ddb3	286	cmm_smp_mb();
a813abf8 MD	287
a813abf8 MD	288	for (;;) {
321e29d9	289	#ifndef TEST_LOCAL_GC
a813abf8	290	new = malloc(sizeof(*new));
a813abf8 MD	291	new->a = 8;
a813abf8 MD	292	old = rcu_xchg_pointer(&test_rcu_pointer, new);
321e29d9	293	#endif
31b598e0 MD	294	if (unlikely(wduration))
31b598e0 MD	295	loop_sleep(wduration);
a813abf8 MD	296	rcu_gc_reclaim(wtidx, old);
	297	nr_writes++;
	298	if (unlikely(!test_duration_write()))
	299	break;
	300	if (unlikely(wdelay))
	301	loop_sleep(wdelay);
	302	}
	303
	304	printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
	305	"writer", pthread_self(), (unsigned long)gettid());
	306	tot_nr_writes[wtidx] = nr_writes;
	307	return ((void*)2);
	308	}
	309
	310	void show_usage(int argc, char **argv)
	311	{
	312	printf("Usage : %s nr_readers nr_writers duration (s)", argv[0]);
	313	#ifdef DEBUG_YIELD
	314	printf(" [-r] [-w] (yield reader and/or writer)");
	315	#endif
	316	printf(" [-d delay] (writer period (us))");
	317	printf(" [-c duration] (reader C.S. duration (in loops))");
31b598e0	318	printf(" [-e duration] (writer C.S. duration (in loops))");
a813abf8 MD	319	printf(" [-v] (verbose output)");
	320	printf(" [-a cpu#] [-a cpu#]... (affinity)");
	321	printf("\n");
	322	}
	323
a813abf8 MD	324	int main(int argc, char **argv)
	325	{
	326	int err;
	327	pthread_t tid_reader, tid_writer;
	328	void *tret;
	329	unsigned long long *count_reader;
	330	unsigned long long tot_reads = 0, tot_writes = 0;
	331	int i, a;
a813abf8 MD	332
	333	if (argc < 4) {
	334	show_usage(argc, argv);
	335	return -1;
	336	}
	337
	338	err = sscanf(argv[1], "%u", &nr_readers);
	339	if (err != 1) {
	340	show_usage(argc, argv);
	341	return -1;
	342	}
	343
	344	err = sscanf(argv[2], "%u", &nr_writers);
	345	if (err != 1) {
	346	show_usage(argc, argv);
	347	return -1;
	348	}
	349
	350	err = sscanf(argv[3], "%lu", &duration);
	351	if (err != 1) {
	352	show_usage(argc, argv);
	353	return -1;
	354	}
	355
a813abf8 MD	356	for (i = 4; i < argc; i++) {
	357	if (argv[i][0] != '-')
	358	continue;
	359	switch (argv[i][1]) {
	360	#ifdef DEBUG_YIELD
	361	case 'r':
	362	yield_active \|= YIELD_READ;
	363	break;
	364	case 'w':
	365	yield_active \|= YIELD_WRITE;
	366	break;
	367	#endif
	368	case 'a':
	369	if (argc < i + 2) {
	370	show_usage(argc, argv);
	371	return -1;
	372	}
	373	a = atoi(argv[++i]);
2a7ac59d	374	cpu_affinities[next_aff++] = a;
a813abf8 MD	375	use_affinity = 1;
	376	printf_verbose("Adding CPU %d affinity\n", a);
	377	break;
	378	case 'b':
	379	if (argc < i + 2) {
	380	show_usage(argc, argv);
	381	return -1;
	382	}
	383	reclaim_batch = atol(argv[++i]);
	384	break;
	385	case 'c':
	386	if (argc < i + 2) {
	387	show_usage(argc, argv);
	388	return -1;
	389	}
	390	rduration = atol(argv[++i]);
	391	break;
	392	case 'd':
	393	if (argc < i + 2) {
	394	show_usage(argc, argv);
	395	return -1;
	396	}
	397	wdelay = atol(argv[++i]);
	398	break;
31b598e0 MD	399	case 'e':
	400	if (argc < i + 2) {
	401	show_usage(argc, argv);
	402	return -1;
	403	}
	404	wduration = atol(argv[++i]);
	405	break;
a813abf8 MD	406	case 'v':
	407	verbose_mode = 1;
	408	break;
	409	}
	410	}
	411
	412	printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
	413	duration, nr_readers, nr_writers);
	414	printf_verbose("Writer delay : %lu loops.\n", wdelay);
	415	printf_verbose("Reader duration : %lu loops.\n", rduration);
	416	printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
	417	"main", pthread_self(), (unsigned long)gettid());
	418
a813abf8 MD	419	tid_reader = malloc(sizeof(tid_reader) nr_readers);
	420	tid_writer = malloc(sizeof(tid_writer) nr_writers);
	421	count_reader = malloc(sizeof(count_reader) nr_readers);
	422	tot_nr_writes = malloc(sizeof(tot_nr_writes) nr_writers);
	423	pending_reclaims = malloc(sizeof(pending_reclaims) nr_writers);
	424	if (reclaim_batch * sizeof(*pending_reclaims[i].queue)
06f22bdb	425	< CAA_CACHE_LINE_SIZE)
a813abf8	426	for (i = 0; i < nr_writers; i++)
06f22bdb	427	pending_reclaims[i].queue = calloc(1, CAA_CACHE_LINE_SIZE);
a813abf8 MD	428	else
	429	for (i = 0; i < nr_writers; i++)
	430	pending_reclaims[i].queue = calloc(reclaim_batch,
	431	sizeof(*pending_reclaims[i].queue));
	432	for (i = 0; i < nr_writers; i++)
	433	pending_reclaims[i].head = pending_reclaims[i].queue;
	434
2a7ac59d MD	435	next_aff = 0;
2a7ac59d MD	436
a813abf8 MD	437	for (i = 0; i < nr_readers; i++) {
	438	err = pthread_create(&tid_reader[i], NULL, thr_reader,
	439	&count_reader[i]);
	440	if (err != 0)
	441	exit(1);
	442	}
	443	for (i = 0; i < nr_writers; i++) {
	444	err = pthread_create(&tid_writer[i], NULL, thr_writer,
	445	(void *)(long)i);
	446	if (err != 0)
	447	exit(1);
	448	}
	449
5481ddb3	450	cmm_smp_mb();
a813abf8 MD	451
	452	test_go = 1;
	453
	454	sleep(duration);
	455
	456	test_stop = 1;
	457
	458	for (i = 0; i < nr_readers; i++) {
	459	err = pthread_join(tid_reader[i], &tret);
	460	if (err != 0)
	461	exit(1);
	462	tot_reads += count_reader[i];
	463	}
	464	for (i = 0; i < nr_writers; i++) {
	465	err = pthread_join(tid_writer[i], &tret);
	466	if (err != 0)
	467	exit(1);
	468	tot_writes += tot_nr_writes[i];
53091fe5	469	rcu_gc_clear_queue(i);
a813abf8 MD	470	}
	471
	472	printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads,
	473	tot_writes);
a50a7b43	474	printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu wdur %6lu "
a813abf8	475	"nr_writers %3u "
4a3e0004 MD	476	"wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu "
4a3e0004 MD	477	"batch %u\n",
a50a7b43	478	argv[0], duration, nr_readers, rduration, wduration,
a813abf8	479	nr_writers, wdelay, tot_reads, tot_writes,
4a3e0004	480	tot_reads + tot_writes, reclaim_batch);
a813abf8 MD	481	free(tid_reader);
	482	free(tid_writer);
	483	free(count_reader);
	484	free(tot_nr_writes);
	485	for (i = 0; i < nr_writers; i++)
	486	free(pending_reclaims[i].queue);
	487	free(pending_reclaims);
	488
	489	return 0;
	490	}