[urcu.git] / tests / test_urcu_assign.c

/*
 * test_urcu_assign.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>
#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
#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 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 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;

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, and we keep the mutex across
 * both alloc and free, 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;

	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;
	return ret;
}

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

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