[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 <errno.h>

#include <urcu/arch.h>
#include <urcu/tls-compat.h>
#include "cpuset.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 rcu_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;

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", (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)++;
		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);

}

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", (unsigned long) 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", (unsigned long) 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) <OPTIONS>\n",
		argv[0]);
	printf("OPTIONS:\n");
#ifdef DEBUG_YIELD
	printf("	[-r] [-w] (yield reader and/or writer)\n");
#endif
	printf("	[-d delay] (writer period (us))\n");
	printf("	[-c duration] (reader C.S. duration (in loops))\n");
	printf("	[-e duration] (writer C.S. duration (in loops))\n");
	printf("	[-v] (verbose output)\n");
	printf("	[-a cpu#] [-a cpu#]... (affinity)\n");
	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':
			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 '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());

	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 <errno.h>
	35
	36	#include <urcu/arch.h>
	37	#include <urcu/tls-compat.h>
	38	#include "cpuset.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 rcu_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	static void set_affinity(void)
	108	{
	109	#if HAVE_SCHED_SETAFFINITY
	110	cpu_set_t mask;
	111	int cpu, ret;
	112	#endif /* HAVE_SCHED_SETAFFINITY */
	113
	114	if (!use_affinity)
	115	return;
	116
	117	#if HAVE_SCHED_SETAFFINITY
	118	ret = pthread_mutex_lock(&affinity_mutex);
	119	if (ret) {
	120	perror("Error in pthread mutex lock");
	121	exit(-1);
	122	}
	123	cpu = cpu_affinities[next_aff++];
	124	ret = pthread_mutex_unlock(&affinity_mutex);
	125	if (ret) {
	126	perror("Error in pthread mutex unlock");
	127	exit(-1);
	128	}
	129
	130	CPU_ZERO(&mask);
	131	CPU_SET(cpu, &mask);
	132	#if SCHED_SETAFFINITY_ARGS == 2
	133	sched_setaffinity(0, &mask);
	134	#else
	135	sched_setaffinity(0, sizeof(mask), &mask);
	136	#endif
	137	#endif /* HAVE_SCHED_SETAFFINITY */
	138	}
	139
	140	/*
	141	* returns 0 if test should end.
	142	*/
	143	static int test_duration_write(void)
	144	{
	145	return !test_stop;
	146	}
	147
	148	static int test_duration_read(void)
	149	{
	150	return !test_stop;
	151	}
	152
	153	static DEFINE_URCU_TLS(unsigned long long, nr_writes);
	154	static DEFINE_URCU_TLS(unsigned long long, nr_reads);
	155
	156	static unsigned int nr_readers;
	157	static unsigned int nr_writers;
	158
	159	pthread_mutex_t rcu_copy_mutex = PTHREAD_MUTEX_INITIALIZER;
	160
	161	void rcu_copy_mutex_lock(void)
	162	{
	163	int ret;
	164	ret = pthread_mutex_lock(&rcu_copy_mutex);
	165	if (ret) {
	166	perror("Error in pthread mutex lock");
	167	exit(-1);
	168	}
	169	}
	170
	171	void rcu_copy_mutex_unlock(void)
	172	{
	173	int ret;
	174
	175	ret = pthread_mutex_unlock(&rcu_copy_mutex);
	176	if (ret) {
	177	perror("Error in pthread mutex unlock");
	178	exit(-1);
	179	}
	180	}
	181
	182	/*
	183	* malloc/free are reusing memory areas too quickly, which does not let us
	184	* test races appropriately. Use a large circular array for allocations.
	185	* ARRAY_SIZE is larger than nr_writers, and we keep the mutex across
	186	* both alloc and free, which insures we never run over our tail.
	187	*/
	188	#define ARRAY_SIZE (1048576 * nr_writers)
	189	#define ARRAY_POISON 0xDEADBEEF
	190	static int array_index;
	191	static struct test_array *test_array;
	192
	193	static struct test_array *test_array_alloc(void)
	194	{
	195	struct test_array *ret;
	196	int index;
	197
	198	index = array_index % ARRAY_SIZE;
	199	assert(test_array[index].a == ARRAY_POISON \|\|
	200	test_array[index].a == 0);
	201	ret = &test_array[index];
	202	array_index++;
	203	if (array_index == ARRAY_SIZE)
	204	array_index = 0;
	205	return ret;
	206	}
	207
	208	static void test_array_free(struct test_array *ptr)
	209	{
	210	if (!ptr)
	211	return;
	212	ptr->a = ARRAY_POISON;
	213	}
	214
	215	void thr_reader(void _count)
	216	{
	217	unsigned long long *count = _count;
	218	struct test_array *local_ptr;
	219
	220	printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
	221	"reader", (unsigned long) pthread_self(),
	222	(unsigned long) gettid());
	223
	224	set_affinity();
	225
	226	rcu_register_thread();
	227
	228	while (!test_go)
	229	{
	230	}
	231	cmm_smp_mb();
	232
	233	for (;;) {
	234	rcu_read_lock();
	235	local_ptr = rcu_dereference(test_rcu_pointer);
	236	rcu_debug_yield_read();
	237	if (local_ptr)
	238	assert(local_ptr->a == 8);
	239	if (caa_unlikely(rduration))
	240	loop_sleep(rduration);
	241	rcu_read_unlock();
	242	URCU_TLS(nr_reads)++;
	243	if (caa_unlikely(!test_duration_read()))
	244	break;
	245	}
	246
	247	rcu_unregister_thread();
	248
	249	*count = URCU_TLS(nr_reads);
	250	printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
	251	"reader", (unsigned long) pthread_self(),
	252	(unsigned long) gettid());
	253	return ((void*)1);
	254
	255	}
	256
	257	void thr_writer(void _count)
	258	{
	259	unsigned long long *count = _count;
	260	struct test_array new, old;
	261
	262	printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
	263	"writer", (unsigned long) pthread_self(),
	264	(unsigned long) gettid());
	265
	266	set_affinity();
	267
	268	while (!test_go)
	269	{
	270	}
	271	cmm_smp_mb();
	272
	273	for (;;) {
	274	rcu_copy_mutex_lock();
	275	new = test_array_alloc();
	276	new->a = 8;
	277	old = test_rcu_pointer;
	278	rcu_assign_pointer(test_rcu_pointer, new);
	279	if (caa_unlikely(wduration))
	280	loop_sleep(wduration);
	281	synchronize_rcu();
	282	if (old)
	283	old->a = 0;
	284	test_array_free(old);
	285	rcu_copy_mutex_unlock();
	286	URCU_TLS(nr_writes)++;
	287	if (caa_unlikely(!test_duration_write()))
	288	break;
	289	if (caa_unlikely(wdelay))
	290	loop_sleep(wdelay);
	291	}
	292
	293	printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
	294	"writer", (unsigned long) pthread_self(),
	295	(unsigned long) gettid());
	296	*count = URCU_TLS(nr_writes);
	297	return ((void*)2);
	298	}
	299
	300	void show_usage(int argc, char **argv)
	301	{
	302	printf("Usage : %s nr_readers nr_writers duration (s) <OPTIONS>\n",
	303	argv[0]);
	304	printf("OPTIONS:\n");
	305	#ifdef DEBUG_YIELD
	306	printf(" [-r] [-w] (yield reader and/or writer)\n");
	307	#endif
	308	printf(" [-d delay] (writer period (us))\n");
	309	printf(" [-c duration] (reader C.S. duration (in loops))\n");
	310	printf(" [-e duration] (writer C.S. duration (in loops))\n");
	311	printf(" [-v] (verbose output)\n");
	312	printf(" [-a cpu#] [-a cpu#]... (affinity)\n");
	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	rcu_yield_active \|= RCU_YIELD_READ;
	355	break;
	356	case 'w':
	357	rcu_yield_active \|= RCU_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", (unsigned long) pthread_self(),
	403	(unsigned long) gettid());
	404
	405	test_array = calloc(1, sizeof(test_array) ARRAY_SIZE);
	406	tid_reader = malloc(sizeof(tid_reader) nr_readers);
	407	tid_writer = malloc(sizeof(tid_writer) nr_writers);
	408	count_reader = malloc(sizeof(count_reader) nr_readers);
	409	count_writer = malloc(sizeof(count_writer) nr_writers);
	410
	411	next_aff = 0;
	412
	413	for (i = 0; i < nr_readers; i++) {
	414	err = pthread_create(&tid_reader[i], NULL, thr_reader,
	415	&count_reader[i]);
	416	if (err != 0)
	417	exit(1);
	418	}
	419	for (i = 0; i < nr_writers; i++) {
	420	err = pthread_create(&tid_writer[i], NULL, thr_writer,
	421	&count_writer[i]);
	422	if (err != 0)
	423	exit(1);
	424	}
	425
	426	cmm_smp_mb();
	427
	428	test_go = 1;
	429
	430	sleep(duration);
	431
	432	test_stop = 1;
	433
	434	for (i = 0; i < nr_readers; i++) {
	435	err = pthread_join(tid_reader[i], &tret);
	436	if (err != 0)
	437	exit(1);
	438	tot_reads += count_reader[i];
	439	}
	440	for (i = 0; i < nr_writers; i++) {
	441	err = pthread_join(tid_writer[i], &tret);
	442	if (err != 0)
	443	exit(1);
	444	tot_writes += count_writer[i];
	445	}
	446
	447	printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads,
	448	tot_writes);
	449	printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu wdur %6lu "
	450	"nr_writers %3u "
	451	"wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu\n",
	452	argv[0], duration, nr_readers, rduration, wduration,
	453	nr_writers, wdelay, tot_reads, tot_writes,
	454	tot_reads + tot_writes);
	455	test_array_free(test_rcu_pointer);
	456	free(test_array);
	457	free(tid_reader);
	458	free(tid_writer);
	459	free(count_reader);
	460	free(count_writer);
	461	return 0;
	462	}