[urcu.git] / tests / test_urcu_qsbr_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>
#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

#define _LGPL_SOURCE
#include <urcu-qsbr.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 long duration;

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

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

static struct reclaim_queue *pending_reclaims;


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

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;

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

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

static DEFINE_URCU_TLS(unsigned long long, nr_writes);
static DEFINE_URCU_TLS(unsigned long long, nr_reads);

static unsigned int nr_readers;
static unsigned int nr_writers;

pthread_mutex_t rcu_copy_mutex = PTHREAD_MUTEX_INITIALIZER;
static
unsigned long long __attribute__((aligned(CAA_CACHE_LINE_SIZE))) *tot_nr_writes;


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", (unsigned long) 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);
		rcu_debug_yield_read();
		if (local_ptr)
			assert(local_ptr->a == 8);
		if (caa_unlikely(rduration))
			loop_sleep(rduration);
		_rcu_read_unlock();
		URCU_TLS(nr_reads)++;
		/* QS each 1024 reads */
		if (caa_unlikely((URCU_TLS(nr_reads) & ((1 << 10) - 1)) == 0))
			_rcu_quiescent_state();
		if (caa_unlikely(!test_duration_read()))
			break;
	}

	rcu_unregister_thread();

	*count = URCU_TLS(nr_reads);
	printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
			"reader", (unsigned long) 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 (caa_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", (unsigned long) 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 (caa_unlikely(wduration))
			loop_sleep(wduration);
		rcu_gc_reclaim(wtidx, old);
		URCU_TLS(nr_writes)++;
		if (caa_unlikely(!test_duration_write()))
			break;
		if (caa_unlikely(wdelay))
			loop_sleep(wdelay);
	}

	printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
			"writer", (unsigned long) pthread_self(),
			(unsigned long) gettid());
	tot_nr_writes[wtidx] = URCU_TLS(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(" [-b batch] (batch reclaim)");
	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':
			rcu_yield_active |= RCU_YIELD_READ;
			break;
		case 'w':
			rcu_yield_active |= RCU_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", (unsigned long) 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
de10a585 MD	1	/*
	2	* test_urcu_gc.c
	3	*
	4	* Userspace RCU library - test program (with baatch reclamation)
	5	*
	6	* Copyright February 2009 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
	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
	24	#include "../config.h"
	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>
	34	#include <sched.h>
	35	#include <errno.h>
	36
	37	#include <urcu/arch.h>
bd252a04	38	#include <urcu/tls-compat.h>
de10a585 MD	39
	40	#ifdef __linux__
	41	#include <syscall.h>
	42	#endif
	43
	44	/* hardcoded number of CPUs */
	45	#define NR_CPUS 16384
	46
	47	#if defined(_syscall0)
	48	_syscall0(pid_t, gettid)
	49	#elif defined(__NR_gettid)
	50	static inline pid_t gettid(void)
	51	{
	52	return syscall(__NR_gettid);
	53	}
	54	#else
	55	#warning "use pid as tid"
	56	static inline pid_t gettid(void)
	57	{
	58	return getpid();
	59	}
	60	#endif
	61
	62	#define _LGPL_SOURCE
	63	#include <urcu-qsbr.h>
	64
	65	struct test_array {
	66	int a;
	67	};
	68
	69	static volatile int test_go, test_stop;
	70
	71	static unsigned long wdelay;
	72
	73	static struct test_array *test_rcu_pointer;
	74
	75	static unsigned long duration;
	76
	77	/* read-side C.S. duration, in loops */
	78	static unsigned long rduration;
	79	static unsigned int reclaim_batch = 1;
	80
	81	struct reclaim_queue {
	82	void *queue; / Beginning of queue */
	83	void *head; / Insert position */
	84	};
	85
	86	static struct reclaim_queue *pending_reclaims;
	87
	88
	89	/* write-side C.S. duration, in loops */
	90	static unsigned long wduration;
	91
ab0aacbe	92	static inline void loop_sleep(unsigned long loops)
de10a585	93	{
ab0aacbe	94	while (loops-- != 0)
de10a585 MD	95	caa_cpu_relax();
	96	}
	97
	98	static int verbose_mode;
	99
	100	#define printf_verbose(fmt, args...) \
	101	do { \
	102	if (verbose_mode) \
	103	printf(fmt, args); \
	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
de10a585	121	cpu_set_t mask;
95bc7fb9 MD	122	int cpu, ret;
95bc7fb9 MD	123	#endif /* HAVE_SCHED_SETAFFINITY */
de10a585 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_write(void)
	155	{
	156	return !test_stop;
	157	}
	158
	159	static int test_duration_read(void)
	160	{
	161	return !test_stop;
	162	}
	163
bd252a04 MD	164	static DEFINE_URCU_TLS(unsigned long long, nr_writes);
bd252a04 MD	165	static DEFINE_URCU_TLS(unsigned long long, nr_reads);
de10a585 MD	166
	167	static unsigned int nr_readers;
	168	static unsigned int nr_writers;
	169
	170	pthread_mutex_t rcu_copy_mutex = PTHREAD_MUTEX_INITIALIZER;
	171	static
	172	unsigned long long __attribute__((aligned(CAA_CACHE_LINE_SIZE))) *tot_nr_writes;
	173
	174
	175	void rcu_copy_mutex_lock(void)
	176	{
	177	int ret;
	178	ret = pthread_mutex_lock(&rcu_copy_mutex);
	179	if (ret) {
	180	perror("Error in pthread mutex lock");
	181	exit(-1);
	182	}
	183	}
	184
	185	void rcu_copy_mutex_unlock(void)
	186	{
	187	int ret;
	188
	189	ret = pthread_mutex_unlock(&rcu_copy_mutex);
	190	if (ret) {
	191	perror("Error in pthread mutex unlock");
	192	exit(-1);
	193	}
	194	}
	195
	196	void thr_reader(void _count)
	197	{
	198	unsigned long long *count = _count;
	199	struct test_array *local_ptr;
	200
	201	printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
6ff854ac MD	202	"reader", (unsigned long) pthread_self(),
6ff854ac MD	203	(unsigned long) gettid());
de10a585 MD	204
	205	set_affinity();
	206
	207	rcu_register_thread();
	208
	209	while (!test_go)
	210	{
	211	}
	212	cmm_smp_mb();
	213
	214	for (;;) {
	215	_rcu_read_lock();
	216	local_ptr = _rcu_dereference(test_rcu_pointer);
1de4df4b	217	rcu_debug_yield_read();
de10a585 MD	218	if (local_ptr)
de10a585 MD	219	assert(local_ptr->a == 8);
a0b7f7ea	220	if (caa_unlikely(rduration))
de10a585 MD	221	loop_sleep(rduration);
de10a585 MD	222	_rcu_read_unlock();
bd252a04	223	URCU_TLS(nr_reads)++;
de10a585	224	/* QS each 1024 reads */
bd252a04	225	if (caa_unlikely((URCU_TLS(nr_reads) & ((1 << 10) - 1)) == 0))
de10a585	226	_rcu_quiescent_state();
a0b7f7ea	227	if (caa_unlikely(!test_duration_read()))
de10a585 MD	228	break;
	229	}
	230
	231	rcu_unregister_thread();
	232
bd252a04	233	*count = URCU_TLS(nr_reads);
de10a585	234	printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
6ff854ac MD	235	"reader", (unsigned long) pthread_self(),
6ff854ac MD	236	(unsigned long) gettid());
de10a585 MD	237	return ((void*)1);
	238
	239	}
	240
	241	static void rcu_gc_clear_queue(unsigned long wtidx)
	242	{
	243	void **p;
	244
	245	/* Wait for Q.S and empty queue */
	246	synchronize_rcu();
	247
	248	for (p = pending_reclaims[wtidx].queue;
	249	p < pending_reclaims[wtidx].head; p++) {
	250	/* poison */
	251	if (*p)
	252	((struct test_array )p)->a = 0;
	253	free(*p);
	254	}
	255	pending_reclaims[wtidx].head = pending_reclaims[wtidx].queue;
	256	}
	257
	258	/* Using per-thread queue */
	259	static void rcu_gc_reclaim(unsigned long wtidx, void *old)
	260	{
	261	/* Queue pointer */
	262	*pending_reclaims[wtidx].head = old;
	263	pending_reclaims[wtidx].head++;
	264
a0b7f7ea	265	if (caa_likely(pending_reclaims[wtidx].head - pending_reclaims[wtidx].queue
de10a585 MD	266	< reclaim_batch))
	267	return;
	268
	269	rcu_gc_clear_queue(wtidx);
	270	}
	271
	272	void thr_writer(void data)
	273	{
	274	unsigned long wtidx = (unsigned long)data;
	275	#ifdef TEST_LOCAL_GC
	276	struct test_array *old = NULL;
	277	#else
	278	struct test_array new, old;
	279	#endif
	280
	281	printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
6ff854ac MD	282	"writer", (unsigned long) pthread_self(),
6ff854ac MD	283	(unsigned long) gettid());
de10a585 MD	284
	285	set_affinity();
	286
	287	while (!test_go)
	288	{
	289	}
	290	cmm_smp_mb();
	291
	292	for (;;) {
	293	#ifndef TEST_LOCAL_GC
	294	new = malloc(sizeof(*new));
	295	new->a = 8;
	296	old = _rcu_xchg_pointer(&test_rcu_pointer, new);
	297	#endif
a0b7f7ea	298	if (caa_unlikely(wduration))
de10a585 MD	299	loop_sleep(wduration);
de10a585 MD	300	rcu_gc_reclaim(wtidx, old);
bd252a04	301	URCU_TLS(nr_writes)++;
a0b7f7ea	302	if (caa_unlikely(!test_duration_write()))
de10a585	303	break;
a0b7f7ea	304	if (caa_unlikely(wdelay))
de10a585 MD	305	loop_sleep(wdelay);
	306	}
	307
	308	printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
6ff854ac MD	309	"writer", (unsigned long) pthread_self(),
6ff854ac MD	310	(unsigned long) gettid());
bd252a04	311	tot_nr_writes[wtidx] = URCU_TLS(nr_writes);
de10a585 MD	312	return ((void*)2);
	313	}
	314
	315	void show_usage(int argc, char **argv)
	316	{
	317	printf("Usage : %s nr_readers nr_writers duration (s)", argv[0]);
	318	#ifdef DEBUG_YIELD
	319	printf(" [-r] [-w] (yield reader and/or writer)");
	320	#endif
	321	printf(" [-b batch] (batch reclaim)");
	322	printf(" [-d delay] (writer period (us))");
	323	printf(" [-c duration] (reader C.S. duration (in loops))");
	324	printf(" [-e duration] (writer C.S. duration (in loops))");
	325	printf(" [-v] (verbose output)");
	326	printf(" [-a cpu#] [-a cpu#]... (affinity)");
	327	printf("\n");
	328	}
	329
	330	int main(int argc, char **argv)
	331	{
	332	int err;
	333	pthread_t tid_reader, tid_writer;
	334	void *tret;
	335	unsigned long long *count_reader;
	336	unsigned long long tot_reads = 0, tot_writes = 0;
	337	int i, a;
	338
	339	if (argc < 4) {
	340	show_usage(argc, argv);
	341	return -1;
	342	}
	343
	344	err = sscanf(argv[1], "%u", &nr_readers);
	345	if (err != 1) {
	346	show_usage(argc, argv);
	347	return -1;
	348	}
	349
	350	err = sscanf(argv[2], "%u", &nr_writers);
	351	if (err != 1) {
	352	show_usage(argc, argv);
	353	return -1;
	354	}
	355
	356	err = sscanf(argv[3], "%lu", &duration);
	357	if (err != 1) {
	358	show_usage(argc, argv);
	359	return -1;
	360	}
	361
	362	for (i = 4; i < argc; i++) {
	363	if (argv[i][0] != '-')
	364	continue;
	365	switch (argv[i][1]) {
	366	#ifdef DEBUG_YIELD
	367	case 'r':
1de4df4b	368	rcu_yield_active \|= RCU_YIELD_READ;
de10a585 MD	369	break;
de10a585 MD	370	case 'w':
1de4df4b	371	rcu_yield_active \|= RCU_YIELD_WRITE;
de10a585 MD	372	break;
	373	#endif
	374	case 'a':
	375	if (argc < i + 2) {
	376	show_usage(argc, argv);
	377	return -1;
	378	}
	379	a = atoi(argv[++i]);
	380	cpu_affinities[next_aff++] = a;
	381	use_affinity = 1;
	382	printf_verbose("Adding CPU %d affinity\n", a);
	383	break;
	384	case 'b':
	385	if (argc < i + 2) {
	386	show_usage(argc, argv);
	387	return -1;
	388	}
	389	reclaim_batch = atol(argv[++i]);
	390	break;
	391	case 'c':
	392	if (argc < i + 2) {
	393	show_usage(argc, argv);
	394	return -1;
	395	}
	396	rduration = atol(argv[++i]);
	397	break;
	398	case 'd':
	399	if (argc < i + 2) {
	400	show_usage(argc, argv);
	401	return -1;
	402	}
	403	wdelay = atol(argv[++i]);
	404	break;
	405	case 'e':
	406	if (argc < i + 2) {
	407	show_usage(argc, argv);
	408	return -1;
	409	}
	410	wduration = atol(argv[++i]);
	411	break;
	412	case 'v':
	413	verbose_mode = 1;
	414	break;
	415	}
	416	}
	417
	418	printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
	419	duration, nr_readers, nr_writers);
	420	printf_verbose("Writer delay : %lu loops.\n", wdelay);
	421	printf_verbose("Reader duration : %lu loops.\n", rduration);
	422	printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
6ff854ac MD	423	"main", (unsigned long) pthread_self(),
6ff854ac MD	424	(unsigned long) gettid());
de10a585 MD	425
	426	tid_reader = malloc(sizeof(tid_reader) nr_readers);
	427	tid_writer = malloc(sizeof(tid_writer) nr_writers);
	428	count_reader = malloc(sizeof(count_reader) nr_readers);
	429	tot_nr_writes = malloc(sizeof(tot_nr_writes) nr_writers);
	430	pending_reclaims = malloc(sizeof(pending_reclaims) nr_writers);
	431	if (reclaim_batch * sizeof(*pending_reclaims[i].queue)
	432	< CAA_CACHE_LINE_SIZE)
	433	for (i = 0; i < nr_writers; i++)
	434	pending_reclaims[i].queue = calloc(1, CAA_CACHE_LINE_SIZE);
	435	else
	436	for (i = 0; i < nr_writers; i++)
	437	pending_reclaims[i].queue = calloc(reclaim_batch,
	438	sizeof(*pending_reclaims[i].queue));
	439	for (i = 0; i < nr_writers; i++)
	440	pending_reclaims[i].head = pending_reclaims[i].queue;
	441
	442	next_aff = 0;
	443
	444	for (i = 0; i < nr_readers; i++) {
	445	err = pthread_create(&tid_reader[i], NULL, thr_reader,
	446	&count_reader[i]);
	447	if (err != 0)
	448	exit(1);
	449	}
	450	for (i = 0; i < nr_writers; i++) {
	451	err = pthread_create(&tid_writer[i], NULL, thr_writer,
	452	(void *)(long)i);
	453	if (err != 0)
	454	exit(1);
	455	}
	456
	457	cmm_smp_mb();
	458
	459	test_go = 1;
	460
	461	sleep(duration);
	462
	463	test_stop = 1;
	464
	465	for (i = 0; i < nr_readers; i++) {
	466	err = pthread_join(tid_reader[i], &tret);
	467	if (err != 0)
	468	exit(1);
	469	tot_reads += count_reader[i];
	470	}
	471	for (i = 0; i < nr_writers; i++) {
	472	err = pthread_join(tid_writer[i], &tret);
	473	if (err != 0)
	474	exit(1);
	475	tot_writes += tot_nr_writes[i];
	476	rcu_gc_clear_queue(i);
	477	}
	478
	479	printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads,
	480	tot_writes);
	481	printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu wdur %6lu "
	482	"nr_writers %3u "
	483	"wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu "
	484	"batch %u\n",
	485	argv[0], duration, nr_readers, rduration, wduration,
	486	nr_writers, wdelay, tot_reads, tot_writes,
	487	tot_reads + tot_writes, reclaim_batch);
	488	free(tid_reader);
489	free(tid_writer);
490	free(count_reader);
491	free(tot_nr_writes);
492	for (i = 0; i < nr_writers; i++)
493	free(pending_reclaims[i].queue);
494	free(pending_reclaims);
495
496	return 0;
497	}