[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

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

	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 (;;) {
		node = rbtree_alloc();
		rcu_copy_mutex_lock();
		node->key = (void *)(unsigned long)(rand() % 2048);
		rcu_rbtree_insert(&rbtree_root, node, tree_comp, rbtree_alloc,
				  rbtree_free);
		if (unlikely(wduration))
			loop_sleep(wduration);

		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
	44	#if defined(_syscall0)
	45	_syscall0(pid_t, gettid)
	46	#elif defined(__NR_gettid)
	47	static inline pid_t gettid(void)
	48	{
	49	return syscall(__NR_gettid);
	50	}
	51	#else
	52	#warning "use pid as tid"
	53	static inline pid_t gettid(void)
	54	{
	55	return getpid();
	56	}
	57	#endif
	58
	59	#ifndef DYNAMIC_LINK_TEST
	60	#define _LGPL_SOURCE
	61	#else
	62	#define debug_yield_read()
	63	#endif
	64	#include <urcu.h>
	65	#include <urcu-rbtree.h>
472d3f7c	66	#include <urcu-defer.h>
00131368	67
472d3f7c	68	static struct rcu_rbtree_node *rbtree_root = &rcu_rbtree_nil;
00131368 MD	69
	70	/* TODO: error handling testing for -ENOMEM */
	71	struct rcu_rbtree_node *rbtree_alloc(void)
	72	{
	73	return malloc(sizeof(struct rcu_rbtree_node));
	74	}
	75
472d3f7c	76	void rbtree_free(struct rcu_rbtree_node *node)
00131368	77	{
472d3f7c MD	78	free(node);
	79	}
	80
	81	int tree_comp(void a, void b)
	82	{
	83	if ((unsigned long)a < (unsigned long)b)
	84	return -1;
	85	else if ((unsigned long)a > (unsigned long)b)
	86	return 1;
	87	else
	88	return 0;
00131368 MD	89	}
	90
	91	static volatile int test_go, test_stop;
	92
	93	static unsigned long wdelay;
	94
	95	static unsigned long duration;
	96
	97	/* read-side C.S. duration, in loops */
	98	static unsigned long rduration;
	99
	100	/* write-side C.S. duration, in loops */
	101	static unsigned long wduration;
	102
	103	static inline void loop_sleep(unsigned long l)
	104	{
	105	while(l-- != 0)
	106	cpu_relax();
	107	}
	108
	109	static int verbose_mode;
	110
	111	#define printf_verbose(fmt, args...) \
	112	do { \
	113	if (verbose_mode) \
	114	printf(fmt, args); \
	115	} while (0)
	116
	117	static unsigned int cpu_affinities[NR_CPUS];
	118	static unsigned int next_aff = 0;
	119	static int use_affinity = 0;
	120
	121	pthread_mutex_t affinity_mutex = PTHREAD_MUTEX_INITIALIZER;
	122
	123	#ifndef HAVE_CPU_SET_T
	124	typedef unsigned long cpu_set_t;
	125	# define CPU_ZERO(cpuset) do { *(cpuset) = 0; } while(0)
	126	# define CPU_SET(cpu, cpuset) do { *(cpuset) \|= (1UL << (cpu)); } while(0)
	127	#endif
	128
	129	static void set_affinity(void)
	130	{
	131	cpu_set_t mask;
	132	int cpu;
	133	int ret;
	134
	135	if (!use_affinity)
	136	return;
	137
	138	#if HAVE_SCHED_SETAFFINITY
	139	ret = pthread_mutex_lock(&affinity_mutex);
	140	if (ret) {
	141	perror("Error in pthread mutex lock");
	142	exit(-1);
	143	}
	144	cpu = cpu_affinities[next_aff++];
	145	ret = pthread_mutex_unlock(&affinity_mutex);
	146	if (ret) {
	147	perror("Error in pthread mutex unlock");
	148	exit(-1);
	149	}
	150
	151	CPU_ZERO(&mask);
	152	CPU_SET(cpu, &mask);
153	#if SCHED_SETAFFINITY_ARGS == 2
154	sched_setaffinity(0, &mask);
155	#else
156	sched_setaffinity(0, sizeof(mask), &mask);
157	#endif
158	#endif /* HAVE_SCHED_SETAFFINITY */
159	}
160
161	/*
162	* returns 0 if test should end.
163	*/
164	static int test_duration_write(void)
165	{
166	return !test_stop;
167	}
168
169	static int test_duration_read(void)
170	{
171	return !test_stop;
172	}
173
174	static unsigned long long __thread nr_writes;
175	static unsigned long long __thread nr_reads;
176
177	static unsigned int nr_readers;
178	static unsigned int nr_writers;
179
180	pthread_mutex_t rcu_copy_mutex = PTHREAD_MUTEX_INITIALIZER;
181
182	void rcu_copy_mutex_lock(void)
183	{
184	int ret;
185	ret = pthread_mutex_lock(&rcu_copy_mutex);
186	if (ret) {
187	perror("Error in pthread mutex lock");
188	exit(-1);
189	}
190	}
191
192	void rcu_copy_mutex_unlock(void)
193	{
194	int ret;
195
196	ret = pthread_mutex_unlock(&rcu_copy_mutex);
197	if (ret) {
198	perror("Error in pthread mutex unlock");
199	exit(-1);
200	}
201	}
202
203	void thr_reader(void _count)
204	{
205	unsigned long long *count = _count;
206
207	printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
208	"reader", pthread_self(), (unsigned long)gettid());
209
210	set_affinity();
211
212	rcu_register_thread();
213
214	while (!test_go)
215	{
216	}
217	smp_mb();
218
219	for (;;) {
220	rcu_read_lock();
221
222	debug_yield_read();
223	if (unlikely(rduration))
224	loop_sleep(rduration);
225	rcu_read_unlock();
226	nr_reads++;
227	if (unlikely(!test_duration_read()))
228	break;
229	}
230
231	rcu_unregister_thread();
232
233	/* test extra thread registration */
234	rcu_register_thread();
235	rcu_unregister_thread();
236
237	*count = nr_reads;
238	printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
239	"reader", pthread_self(), (unsigned long)gettid());
240	return ((void*)1);
241
242	}
243
244	void thr_writer(void _count)
245	{
246	unsigned long long *count = _count;
472d3f7c	247	struct rcu_rbtree_node *node;
00131368 MD	248
	249	printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
	250	"writer", pthread_self(), (unsigned long)gettid());
	251
	252	set_affinity();
	253
472d3f7c MD	254	rcu_defer_register_thread();
472d3f7c MD	255
00131368 MD	256	while (!test_go)
	257	{
	258	}
	259	smp_mb();
	260
	261	for (;;) {
472d3f7c MD	262	node = rbtree_alloc();
	263	rcu_copy_mutex_lock();
	264	node->key = (void *)(unsigned long)(rand() % 2048);
	265	rcu_rbtree_insert(&rbtree_root, node, tree_comp, rbtree_alloc,
	266	rbtree_free);
00131368 MD	267	if (unlikely(wduration))
	268	loop_sleep(wduration);
	269
364e4a13 MD	270	rcu_rbtree_remove(&rbtree_root, node, tree_comp, rbtree_alloc,
	271	rbtree_free);
	272	defer_rcu((void ()(void ))rbtree_free, node);
	273
472d3f7c	274	rcu_copy_mutex_unlock();
00131368 MD	275	nr_writes++;
	276	if (unlikely(!test_duration_write()))
	277	break;
	278	if (unlikely(wdelay))
	279	loop_sleep(wdelay);
	280	}
	281
472d3f7c MD	282	rcu_defer_unregister_thread();
472d3f7c MD	283
00131368 MD	284	printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
	285	"writer", pthread_self(), (unsigned long)gettid());
	286	*count = nr_writes;
	287	return ((void*)2);
	288	}
	289
	290	void show_usage(int argc, char **argv)
	291	{
	292	printf("Usage : %s nr_readers nr_writers duration (s)", argv[0]);
	293	#ifdef DEBUG_YIELD
	294	printf(" [-r] [-w] (yield reader and/or writer)");
	295	#endif
	296	printf(" [-d delay] (writer period (us))");
	297	printf(" [-c duration] (reader C.S. duration (in loops))");
	298	printf(" [-e duration] (writer C.S. duration (in loops))");
	299	printf(" [-v] (verbose output)");
	300	printf(" [-a cpu#] [-a cpu#]... (affinity)");
	301	printf("\n");
	302	}
	303
	304	int main(int argc, char **argv)
	305	{
	306	int err;
	307	pthread_t tid_reader, tid_writer;
	308	void *tret;
	309	unsigned long long count_reader, count_writer;
	310	unsigned long long tot_reads = 0, tot_writes = 0;
	311	int i, a;
	312
	313	if (argc < 4) {
	314	show_usage(argc, argv);
	315	return -1;
	316	}
	317
	318	err = sscanf(argv[1], "%u", &nr_readers);
	319	if (err != 1) {
	320	show_usage(argc, argv);
	321	return -1;
	322	}
	323
	324	err = sscanf(argv[2], "%u", &nr_writers);
	325	if (err != 1) {
	326	show_usage(argc, argv);
	327	return -1;
	328	}
	329
	330	err = sscanf(argv[3], "%lu", &duration);
	331	if (err != 1) {
	332	show_usage(argc, argv);
	333	return -1;
	334	}
	335
	336	for (i = 4; i < argc; i++) {
	337	if (argv[i][0] != '-')
	338	continue;
	339	switch (argv[i][1]) {
	340	#ifdef DEBUG_YIELD
	341	case 'r':
	342	yield_active \|= YIELD_READ;
	343	break;
	344	case 'w':
	345	yield_active \|= YIELD_WRITE;
	346	break;
	347	#endif
348	case 'a':
349	if (argc < i + 2) {
350	show_usage(argc, argv);
351	return -1;
352	}
353	a = atoi(argv[++i]);
354	cpu_affinities[next_aff++] = a;
355	use_affinity = 1;
356	printf_verbose("Adding CPU %d affinity\n", a);
357	break;
358	case 'c':
359	if (argc < i + 2) {
360	show_usage(argc, argv);
361	return -1;
362	}
363	rduration = atol(argv[++i]);
364	break;
365	case 'd':
366	if (argc < i + 2) {
367	show_usage(argc, argv);
368	return -1;
369	}
370	wdelay = atol(argv[++i]);
371	break;
372	case 'e':
373	if (argc < i + 2) {
374	show_usage(argc, argv);
375	return -1;
376	}
377	wduration = atol(argv[++i]);
378	break;
379	case 'v':
380	verbose_mode = 1;
381	break;
382	}
383	}
384
385	printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
386	duration, nr_readers, nr_writers);
387	printf_verbose("Writer delay : %lu loops.\n", wdelay);
388	printf_verbose("Reader duration : %lu loops.\n", rduration);
389	printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
390	"main", pthread_self(), (unsigned long)gettid());
391
392	tid_reader = malloc(sizeof(tid_reader) nr_readers);
393	tid_writer = malloc(sizeof(tid_writer) nr_writers);
394	count_reader = malloc(sizeof(count_reader) nr_readers);
395	count_writer = malloc(sizeof(count_writer) nr_writers);
396
472d3f7c MD	397	srand(time(NULL));
472d3f7c MD	398
00131368 MD	399	next_aff = 0;
	400
	401	for (i = 0; i < nr_readers; i++) {
	402	err = pthread_create(&tid_reader[i], NULL, thr_reader,
	403	&count_reader[i]);
	404	if (err != 0)
	405	exit(1);
	406	}
	407	for (i = 0; i < nr_writers; i++) {
	408	err = pthread_create(&tid_writer[i], NULL, thr_writer,
	409	&count_writer[i]);
	410	if (err != 0)
	411	exit(1);
	412	}
	413
	414	smp_mb();
	415
	416	test_go = 1;
	417
	418	sleep(duration);
	419
	420	test_stop = 1;
	421
	422	for (i = 0; i < nr_readers; i++) {
	423	err = pthread_join(tid_reader[i], &tret);
	424	if (err != 0)
	425	exit(1);
	426	tot_reads += count_reader[i];
	427	}
	428	for (i = 0; i < nr_writers; i++) {
	429	err = pthread_join(tid_writer[i], &tret);
	430	if (err != 0)
	431	exit(1);
	432	tot_writes += count_writer[i];
	433	}
	434
	435	printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads,
	436	tot_writes);
	437	printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu wdur %6lu "
	438	"nr_writers %3u "
	439	"wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu\n",
	440	argv[0], duration, nr_readers, rduration, wduration,
	441	nr_writers, wdelay, tot_reads, tot_writes,
	442	tot_reads + tot_writes);
	443	free(tid_reader);
	444	free(tid_writer);
	445	free(count_reader);
	446	free(count_writer);
	447	return 0;
	448	}