[userspace-rcu.git] / tests / test_urcu.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>
#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 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 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);
		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();

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