[userspace-rcu.git] / tests / test_urcu_bp.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-bp.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, 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();
		nr_reads++;
		if (caa_unlikely(!test_duration_read()))
			break;
	}

	rcu_unregister_thread();

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

}

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