[urcu.git] / tests / benchmark / 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.
 */

#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"
#include "thread-id.h"
#include "../common/debug-yield.h"

/* hardcoded number of CPUs */
#define NR_CPUS 16384

#ifndef DYNAMIC_LINK_TEST
#define _LGPL_SOURCE
#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)
{
#ifdef HAVE_SCHED_SETAFFINITY
	cpu_set_t mask;
	int cpu, ret;
#endif /* HAVE_SCHED_SETAFFINITY */

	if (!use_affinity)
		return;

#ifdef 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
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);
	}
}

static
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 (int) 0xDEADBEEF
static unsigned 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;
}

static
void *thr_reader(void *_count)
{
	unsigned long long *count = _count;
	struct test_array *local_ptr;

	printf_verbose("thread_begin %s, tid %lu\n",
			"reader", urcu_get_thread_id());

	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, tid %lu\n",
			"reader", urcu_get_thread_id());
	return ((void*)1);

}

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

	printf_verbose("thread_begin %s, tid %lu\n",
			"writer", urcu_get_thread_id());

	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, tid %lu\n",
			"writer", urcu_get_thread_id());
	*count = URCU_TLS(nr_writes);
	return ((void*)2);
}

static
void show_usage(char **argv)
{
	printf("Usage : %s nr_readers nr_writers duration (s) <OPTIONS>\n",
		argv[0]);
	printf("OPTIONS:\n");
	printf("	[-r] [-w] (yield reader and/or writer)\n");
	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;
	unsigned int i_thr;

	if (argc < 4) {
		show_usage(argv);
		return -1;
	}

	err = sscanf(argv[1], "%u", &nr_readers);
	if (err != 1) {
		show_usage(argv);
		return -1;
	}

	err = sscanf(argv[2], "%u", &nr_writers);
	if (err != 1) {
		show_usage(argv);
		return -1;
	}

	err = sscanf(argv[3], "%lu", &duration);
	if (err != 1) {
		show_usage(argv);
		return -1;
	}

	for (i = 4; i < argc; i++) {
		if (argv[i][0] != '-')
			continue;
		switch (argv[i][1]) {
		case 'r':
			rcu_debug_yield_enable(RCU_YIELD_READ);
			break;
		case 'w':
			rcu_debug_yield_enable(RCU_YIELD_WRITE);
			break;
		case 'a':
			if (argc < i + 2) {
				show_usage(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(argv);
				return -1;
			}
			rduration = atol(argv[++i]);
			break;
		case 'd':
			if (argc < i + 2) {
				show_usage(argv);
				return -1;
			}
			wdelay = atol(argv[++i]);
			break;
		case 'e':
			if (argc < i + 2) {
				show_usage(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, tid %lu\n",
			"main", urcu_get_thread_id());

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

	next_aff = 0;

	for (i_thr = 0; i_thr < nr_readers; i_thr++) {
		err = pthread_create(&tid_reader[i_thr], NULL, thr_reader,
				     &count_reader[i_thr]);
		if (err != 0)
			exit(1);
	}
	for (i_thr = 0; i_thr < nr_writers; i_thr++) {
		err = pthread_create(&tid_writer[i_thr], NULL, thr_writer,
				     &count_writer[i_thr]);
		if (err != 0)
			exit(1);
	}

	cmm_smp_mb();

	test_go = 1;

	sleep(duration);

	test_stop = 1;

	for (i_thr = 0; i_thr < nr_readers; i_thr++) {
		err = pthread_join(tid_reader[i_thr], &tret);
		if (err != 0)
			exit(1);
		tot_reads += count_reader[i_thr];
	}
	for (i_thr = 0; i_thr < nr_writers; i_thr++) {
		err = pthread_join(tid_writer[i_thr], &tret);
		if (err != 0)
			exit(1);
		tot_writes += count_writer[i_thr];
	}

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