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