[userspace-rcu.git] / tests / test_urcu_rbtree.c

/*
 * test_urcu_rbtree.c
 *
 * Userspace RCU library - test program for RB tree
 *
 * Copyright February 2010 - 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 <sys/syscall.h>
#include <sched.h>
#include <errno.h>
#include <time.h>

#include <urcu/arch.h>

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

/* number of insert/delete */
#define NR_RAND 4

#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>
#include <urcu-rbtree.h>
#include <urcu-defer.h>

static struct rcu_rbtree_node *rbtree_root = &rcu_rbtree_nil;

/* TODO: error handling testing for -ENOMEM */
struct rcu_rbtree_node *rbtree_alloc(void)
{
	return malloc(sizeof(struct rcu_rbtree_node));
}

void rbtree_free(struct rcu_rbtree_node *node)
{
	free(node);
}

int tree_comp(void *a, void *b)
{
	if ((unsigned long)a < (unsigned long)b)
		return -1;
	else if ((unsigned long)a > (unsigned long)b)
		return 1;
	else
		return 0;
}

static volatile int test_go, test_stop;

static unsigned long wdelay;

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

void *thr_reader(void *_count)
{
	unsigned long long *count = _count;

	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)
	{
	}
	smp_mb();

	for (;;) {
		rcu_read_lock();

		debug_yield_read();
		if (unlikely(rduration))
			loop_sleep(rduration);
		rcu_read_unlock();
		nr_reads++;
		if (unlikely(!test_duration_read()))
			break;
	}

	rcu_unregister_thread();

	/* test extra thread registration */
	rcu_register_thread();
	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 rcu_rbtree_node *node;
	void *key[NR_RAND];
	int i;

	printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
			"writer", pthread_self(), (unsigned long)gettid());

	set_affinity();

	rcu_defer_register_thread();

	while (!test_go)
	{
	}
	smp_mb();

	for (;;) {
		rcu_copy_mutex_lock();

		for (i = 0; i < NR_RAND; i++) {
			node = rbtree_alloc();
			key[i] = (void *)(unsigned long)(rand() % 2048);
			node->key = key[i];
			rcu_rbtree_insert(&rbtree_root, node, tree_comp,
					  rbtree_alloc, rbtree_free);
		}

		if (unlikely(wduration))
			loop_sleep(wduration);

		node = rcu_rbtree_min(rbtree_root, tree_comp);
		while (node != &rcu_rbtree_nil) {
			printf("0x%lX ", (unsigned long)node->key);
			node = rcu_rbtree_next(node, tree_comp);
		}
		printf("\n");

		for (i = 0; i < NR_RAND; i++) {
			node = rcu_rbtree_search(rbtree_root, key[i],
						 tree_comp);
			assert(node != &rcu_rbtree_nil);
			rcu_rbtree_remove(&rbtree_root, node, tree_comp,
					  rbtree_alloc, rbtree_free);
			defer_rcu((void (*)(void *))rbtree_free, node);
		}

		rcu_copy_mutex_unlock();
		nr_writes++;
		if (unlikely(!test_duration_write()))
			break;
		if (unlikely(wdelay))
			loop_sleep(wdelay);
	}

	rcu_defer_unregister_thread();

	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());

	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);

	srand(time(NULL));

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

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