[urcu.git] / tests / test_qsbr.c

/*
 * test_urcu.c
 *
 * Userspace RCU library - test program
 *
 * 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-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;

/* 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 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);
	}
}

/*
 * malloc/free are reusing memory areas too quickly, which does not let us
 * test races appropriately. Use a large circular array for allocations.
 * ARRAY_SIZE is larger than nr_writers, which insures we never run over our tail.
 */
#define ARRAY_SIZE (1048576 * nr_writers)
#define ARRAY_POISON 0xDEADBEEF
static int array_index;
static struct test_array *test_array;

static struct test_array *test_array_alloc(void)
{
	struct test_array *ret;
	int index;

	rcu_copy_mutex_lock();
	index = array_index % ARRAY_SIZE;
	assert(test_array[index].a == ARRAY_POISON ||
		test_array[index].a == 0);
	ret = &test_array[index];
	array_index++;
	if (array_index == ARRAY_SIZE)
		array_index = 0;
	rcu_copy_mutex_unlock();
	return ret;
}

static void test_array_free(struct test_array *ptr)
{
	if (!ptr)
		return;
	rcu_copy_mutex_lock();
	ptr->a = ARRAY_POISON;
	rcu_copy_mutex_unlock();
}

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++;
		/* QS each 1024 reads */
		if (unlikely((nr_reads & ((1 << 10) - 1)) == 0))
			rcu_quiescent_state();
		if (unlikely(!test_duration_read()))
			break;
	}

	rcu_unregister_thread();

	/* test extra thread registration */
	rcu_register_thread();
	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);

}

void *thr_writer(void *_count)
{
	unsigned long long *count = _count;
	struct test_array *new, *old;

	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 (;;) {
		new = test_array_alloc();
		new->a = 8;
		old = rcu_xchg_pointer(&test_rcu_pointer, new);
		if (unlikely(wduration))
			loop_sleep(wduration);
		synchronize_rcu();
		/* can be done after unlock */
		if (old)
			old->a = 0;
		test_array_free(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());
	*count = 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, *count_writer;
	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 '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());

	test_array = calloc(1, sizeof(*test_array) * ARRAY_SIZE);
	tid_reader = malloc(sizeof(*tid_reader) * nr_readers);
	tid_writer = malloc(sizeof(*tid_writer) * nr_writers);
	count_reader = malloc(sizeof(*count_reader) * nr_readers);
	count_writer = malloc(sizeof(*count_writer) * nr_writers);

	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,
				     &count_writer[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 += count_writer[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\n",
		argv[0], duration, nr_readers, rduration, wduration,
		nr_writers, wdelay, tot_reads, tot_writes,
		tot_reads + tot_writes);
	test_array_free(test_rcu_pointer);
	free(test_array);
	free(tid_reader);
	free(tid_writer);
	free(count_reader);
	free(count_writer);
	return 0;
}
Commit	Line	Data
061159a0 MD	1	/*
	2	* test_urcu.c
	3	*
	4	* Userspace RCU library - test program
	5	*
6982d6d7	6	* Copyright February 2009 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
061159a0 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
9e97e478	23	#define _GNU_SOURCE
d8540fc5	24	#include "../config.h"
061159a0 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>
9e97e478	34	#include <sched.h>
94b343fd	35	#include <errno.h>
061159a0	36
ec4e58a3	37	#include <urcu/arch.h>
7685d963	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
061159a0 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
7ac06cef	61	#ifndef DYNAMIC_LINK_TEST
061159a0	62	#define _LGPL_SOURCE
7ac06cef MD	63	#else
	64	#define debug_yield_read()
	65	#endif
ec4e58a3	66	#include "urcu-qsbr.h"
061159a0 MD	67
	68	struct test_array {
	69	int a;
	70	};
	71
78efb485	72	static volatile int test_go, test_stop;
061159a0	73
9e31d0f0	74	static unsigned long wdelay;
061159a0 MD	75
	76	static struct test_array *test_rcu_pointer;
	77
	78	static unsigned long duration;
061159a0	79
daddf5b0	80	/* read-side C.S. duration, in loops */
8b632bab MD	81	static unsigned long rduration;
8b632bab MD	82
31b598e0 MD	83	/* write-side C.S. duration, in loops */
	84	static unsigned long wduration;
	85
daddf5b0 MD	86	static inline void loop_sleep(unsigned long l)
	87	{
	88	while(l-- != 0)
06f22bdb	89	caa_cpu_relax();
daddf5b0 MD	90	}
daddf5b0 MD	91
4bad7d45 MD	92	static int verbose_mode;
	93
	94	#define printf_verbose(fmt, args...) \
	95	do { \
	96	if (verbose_mode) \
	97	printf(fmt, args); \
	98	} while (0)
	99
2a7ac59d MD	100	static unsigned int cpu_affinities[NR_CPUS];
	101	static unsigned int next_aff = 0;
	102	static int use_affinity = 0;
	103
6af882ba MD	104	pthread_mutex_t affinity_mutex = PTHREAD_MUTEX_INITIALIZER;
6af882ba MD	105
d8540fc5 PA	106	#ifndef HAVE_CPU_SET_T
	107	typedef unsigned long cpu_set_t;
	108	# define CPU_ZERO(cpuset) do { *(cpuset) = 0; } while(0)
	109	# define CPU_SET(cpu, cpuset) do { *(cpuset) \|= (1UL << (cpu)); } while(0)
	110	#endif
	111
2a7ac59d MD	112	static void set_affinity(void)
	113	{
	114	cpu_set_t mask;
	115	int cpu;
6af882ba	116	int ret;
2a7ac59d MD	117
	118	if (!use_affinity)
	119	return;
	120
d8540fc5	121	#if HAVE_SCHED_SETAFFINITY
6af882ba MD	122	ret = pthread_mutex_lock(&affinity_mutex);
	123	if (ret) {
	124	perror("Error in pthread mutex lock");
	125	exit(-1);
	126	}
2a7ac59d	127	cpu = cpu_affinities[next_aff++];
6af882ba MD	128	ret = pthread_mutex_unlock(&affinity_mutex);
	129	if (ret) {
	130	perror("Error in pthread mutex unlock");
	131	exit(-1);
	132	}
2a7ac59d MD	133	CPU_ZERO(&mask);
2a7ac59d MD	134	CPU_SET(cpu, &mask);
d8540fc5 PA	135	#if SCHED_SETAFFINITY_ARGS == 2
	136	sched_setaffinity(0, &mask);
	137	#else
2a7ac59d	138	sched_setaffinity(0, sizeof(mask), &mask);
d8540fc5 PA	139	#endif
d8540fc5 PA	140	#endif /* HAVE_SCHED_SETAFFINITY */
2a7ac59d MD	141	}
2a7ac59d MD	142
061159a0 MD	143	/*
	144	* returns 0 if test should end.
	145	*/
	146	static int test_duration_write(void)
	147	{
78efb485	148	return !test_stop;
061159a0 MD	149	}
	150
	151	static int test_duration_read(void)
	152	{
78efb485	153	return !test_stop;
061159a0 MD	154	}
	155
	156	static unsigned long long __thread nr_writes;
	157	static unsigned long long __thread nr_reads;
	158
	159	static unsigned int nr_readers;
	160	static unsigned int nr_writers;
	161
	162	pthread_mutex_t rcu_copy_mutex = PTHREAD_MUTEX_INITIALIZER;
	163
	164	void rcu_copy_mutex_lock(void)
	165	{
	166	int ret;
	167	ret = pthread_mutex_lock(&rcu_copy_mutex);
	168	if (ret) {
	169	perror("Error in pthread mutex lock");
	170	exit(-1);
	171	}
	172	}
	173
	174	void rcu_copy_mutex_unlock(void)
	175	{
	176	int ret;
	177
	178	ret = pthread_mutex_unlock(&rcu_copy_mutex);
	179	if (ret) {
	180	perror("Error in pthread mutex unlock");
	181	exit(-1);
	182	}
	183	}
	184
	185	/*
	186	* malloc/free are reusing memory areas too quickly, which does not let us
	187	* test races appropriately. Use a large circular array for allocations.
	188	* ARRAY_SIZE is larger than nr_writers, which insures we never run over our tail.
	189	*/
	190	#define ARRAY_SIZE (1048576 * nr_writers)
	191	#define ARRAY_POISON 0xDEADBEEF
	192	static int array_index;
	193	static struct test_array *test_array;
	194
	195	static struct test_array *test_array_alloc(void)
	196	{
	197	struct test_array *ret;
	198	int index;
	199
	200	rcu_copy_mutex_lock();
	201	index = array_index % ARRAY_SIZE;
	202	assert(test_array[index].a == ARRAY_POISON \|\|
	203	test_array[index].a == 0);
	204	ret = &test_array[index];
	205	array_index++;
	206	if (array_index == ARRAY_SIZE)
	207	array_index = 0;
	208	rcu_copy_mutex_unlock();
	209	return ret;
	210	}
	211
	212	static void test_array_free(struct test_array *ptr)
	213	{
	214	if (!ptr)
	215	return;
	216	rcu_copy_mutex_lock();
	217	ptr->a = ARRAY_POISON;
218	rcu_copy_mutex_unlock();
219	}
220
221	void thr_reader(void _count)
222	{
223	unsigned long long *count = _count;
224	struct test_array *local_ptr;
225
4bad7d45	226	printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
061159a0 MD	227	"reader", pthread_self(), (unsigned long)gettid());
061159a0 MD	228
2a7ac59d MD	229	set_affinity();
2a7ac59d MD	230
061159a0 MD	231	rcu_register_thread();
	232
	233	while (!test_go)
	234	{
	235	}
5481ddb3	236	cmm_smp_mb();
061159a0 MD	237
061159a0 MD	238	for (;;) {
7ac06cef MD	239	rcu_read_lock();
7ac06cef MD	240	local_ptr = rcu_dereference(test_rcu_pointer);
061159a0 MD	241	debug_yield_read();
	242	if (local_ptr)
	243	assert(local_ptr->a == 8);
8b632bab	244	if (unlikely(rduration))
daddf5b0	245	loop_sleep(rduration);
7ac06cef	246	rcu_read_unlock();
061159a0	247	nr_reads++;
78efb485	248	/* QS each 1024 reads */
59d5a406	249	if (unlikely((nr_reads & ((1 << 10) - 1)) == 0))
7ac06cef	250	rcu_quiescent_state();
59d5a406	251	if (unlikely(!test_duration_read()))
061159a0 MD	252	break;
	253	}
	254
	255	rcu_unregister_thread();
	256
2b514ae2 MD	257	/* test extra thread registration */
	258	rcu_register_thread();
	259	rcu_unregister_thread();
	260
061159a0	261	*count = nr_reads;
4bad7d45	262	printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
061159a0 MD	263	"reader", pthread_self(), (unsigned long)gettid());
	264	return ((void*)1);
	265
	266	}
	267
	268	void thr_writer(void _count)
	269	{
	270	unsigned long long *count = _count;
	271	struct test_array new, old;
	272
4bad7d45	273	printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
061159a0 MD	274	"writer", pthread_self(), (unsigned long)gettid());
061159a0 MD	275
2a7ac59d MD	276	set_affinity();
2a7ac59d MD	277
061159a0 MD	278	while (!test_go)
	279	{
	280	}
5481ddb3	281	cmm_smp_mb();
061159a0 MD	282
	283	for (;;) {
	284	new = test_array_alloc();
061159a0	285	new->a = 8;
d2835e6f	286	old = rcu_xchg_pointer(&test_rcu_pointer, new);
31b598e0 MD	287	if (unlikely(wduration))
31b598e0 MD	288	loop_sleep(wduration);
d2835e6f	289	synchronize_rcu();
061159a0 MD	290	/* can be done after unlock */
	291	if (old)
	292	old->a = 0;
	293	test_array_free(old);
	294	nr_writes++;
59d5a406	295	if (unlikely(!test_duration_write()))
061159a0	296	break;
59d5a406	297	if (unlikely(wdelay))
9e31d0f0	298	loop_sleep(wdelay);
061159a0 MD	299	}
061159a0 MD	300
4bad7d45	301	printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
061159a0 MD	302	"writer", pthread_self(), (unsigned long)gettid());
	303	*count = nr_writes;
	304	return ((void*)2);
	305	}
	306
	307	void show_usage(int argc, char **argv)
	308	{
	309	printf("Usage : %s nr_readers nr_writers duration (s)", argv[0]);
	310	#ifdef DEBUG_YIELD
	311	printf(" [-r] [-w] (yield reader and/or writer)");
	312	#endif
7685d963	313	printf(" [-d delay] (writer period (us))");
daddf5b0	314	printf(" [-c duration] (reader C.S. duration (in loops))");
31b598e0	315	printf(" [-e duration] (writer C.S. duration (in loops))");
4bad7d45	316	printf(" [-v] (verbose output)");
9e97e478	317	printf(" [-a cpu#] [-a cpu#]... (affinity)");
061159a0 MD	318	printf("\n");
	319	}
	320
	321	int main(int argc, char **argv)
	322	{
	323	int err;
	324	pthread_t tid_reader, tid_writer;
	325	void *tret;
	326	unsigned long long count_reader, count_writer;
	327	unsigned long long tot_reads = 0, tot_writes = 0;
9e97e478	328	int i, a;
061159a0 MD	329
	330	if (argc < 4) {
	331	show_usage(argc, argv);
	332	return -1;
	333	}
	334
	335	err = sscanf(argv[1], "%u", &nr_readers);
	336	if (err != 1) {
	337	show_usage(argc, argv);
	338	return -1;
	339	}
	340
	341	err = sscanf(argv[2], "%u", &nr_writers);
	342	if (err != 1) {
	343	show_usage(argc, argv);
	344	return -1;
	345	}
	346
	347	err = sscanf(argv[3], "%lu", &duration);
	348	if (err != 1) {
	349	show_usage(argc, argv);
	350	return -1;
	351	}
	352
	353	for (i = 4; i < argc; i++) {
	354	if (argv[i][0] != '-')
	355	continue;
	356	switch (argv[i][1]) {
	357	#ifdef DEBUG_YIELD
	358	case 'r':
	359	yield_active \|= YIELD_READ;
	360	break;
	361	case 'w':
	362	yield_active \|= YIELD_WRITE;
	363	break;
	364	#endif
9e97e478 MD	365	case 'a':
	366	if (argc < i + 2) {
	367	show_usage(argc, argv);
	368	return -1;
	369	}
	370	a = atoi(argv[++i]);
2a7ac59d	371	cpu_affinities[next_aff++] = a;
9e97e478	372	use_affinity = 1;
4bad7d45	373	printf_verbose("Adding CPU %d affinity\n", a);
9e97e478	374	break;
8b632bab MD	375	case 'c':
	376	if (argc < i + 2) {
	377	show_usage(argc, argv);
	378	return -1;
	379	}
9e31d0f0	380	rduration = atol(argv[++i]);
8b632bab	381	break;
061159a0 MD	382	case 'd':
	383	if (argc < i + 2) {
	384	show_usage(argc, argv);
	385	return -1;
	386	}
9e31d0f0	387	wdelay = atol(argv[++i]);
061159a0	388	break;
31b598e0 MD	389	case 'e':
	390	if (argc < i + 2) {
	391	show_usage(argc, argv);
	392	return -1;
	393	}
	394	wduration = atol(argv[++i]);
	395	break;
4bad7d45 MD	396	case 'v':
	397	verbose_mode = 1;
	398	break;
061159a0 MD	399	}
	400	}
	401
4bad7d45	402	printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
061159a0	403	duration, nr_readers, nr_writers);
9e31d0f0	404	printf_verbose("Writer delay : %lu loops.\n", wdelay);
4bad7d45 MD	405	printf_verbose("Reader duration : %lu loops.\n", rduration);
4bad7d45 MD	406	printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
061159a0 MD	407	"main", pthread_self(), (unsigned long)gettid());
061159a0 MD	408
92e8d9d6	409	test_array = calloc(1, sizeof(test_array) ARRAY_SIZE);
061159a0 MD	410	tid_reader = malloc(sizeof(tid_reader) nr_readers);
	411	tid_writer = malloc(sizeof(tid_writer) nr_writers);
	412	count_reader = malloc(sizeof(count_reader) nr_readers);
	413	count_writer = malloc(sizeof(count_writer) nr_writers);
	414
2a7ac59d MD	415	next_aff = 0;
2a7ac59d MD	416
061159a0 MD	417	for (i = 0; i < nr_readers; i++) {
	418	err = pthread_create(&tid_reader[i], NULL, thr_reader,
	419	&count_reader[i]);
	420	if (err != 0)
	421	exit(1);
	422	}
	423	for (i = 0; i < nr_writers; i++) {
	424	err = pthread_create(&tid_writer[i], NULL, thr_writer,
	425	&count_writer[i]);
	426	if (err != 0)
	427	exit(1);
	428	}
	429
5481ddb3	430	cmm_smp_mb();
061159a0	431
78efb485 MD	432	test_go = 1;
	433
	434	sleep(duration);
	435
	436	test_stop = 1;
	437
061159a0 MD	438	for (i = 0; i < nr_readers; i++) {
	439	err = pthread_join(tid_reader[i], &tret);
	440	if (err != 0)
	441	exit(1);
	442	tot_reads += count_reader[i];
	443	}
	444	for (i = 0; i < nr_writers; i++) {
	445	err = pthread_join(tid_writer[i], &tret);
	446	if (err != 0)
	447	exit(1);
	448	tot_writes += count_writer[i];
	449	}
	450
4bad7d45	451	printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads,
061159a0	452	tot_writes);
a50a7b43	453	printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu wdur %6lu "
cda3c71d	454	"nr_writers %3u "
9e31d0f0	455	"wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu\n",
a50a7b43	456	argv[0], duration, nr_readers, rduration, wduration,
4bad7d45 MD	457	nr_writers, wdelay, tot_reads, tot_writes,
4bad7d45 MD	458	tot_reads + tot_writes);
061159a0 MD	459	test_array_free(test_rcu_pointer);
	460	free(test_array);
	461	free(tid_reader);
	462	free(tid_writer);
	463	free(count_reader);
	464	free(count_writer);
	465	return 0;
	466	}