[urcu.git] / tests / test_qsbr.c

/*
 * test_urcu.c
 *
 * Userspace RCU library - test program
 *
 * Copyright February 2009 - Mathieu Desnoyers <mathieu.desnoyers@polymtl.ca>
 *
 * 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 <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 <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-qsbr.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;

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;

static void set_affinity(void)
{
	cpu_set_t mask;
	int cpu;
	int ret;

	if (!use_affinity)
		return;

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

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

/*
 * 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, 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;

	rcu_copy_mutex_lock();
	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;
	rcu_copy_mutex_unlock();
	return ret;
}

static void test_array_free(struct test_array *ptr)
{
	if (!ptr)
		return;
	rcu_copy_mutex_lock();
	ptr->a = ARRAY_POISON;
	rcu_copy_mutex_unlock();
}

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", pthread_self(), (unsigned long)gettid());

	set_affinity();

	rcu_register_thread();

	while (!test_go)
	{
	}
	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 (unlikely(rduration))
			loop_sleep(rduration);
		rcu_read_unlock();
		nr_reads++;
		/* QS each 1024 reads */
		if (unlikely((nr_reads & ((1 << 10) - 1)) == 0))
			rcu_quiescent_state();
		if (unlikely(!test_duration_read()))
			break;
	}

	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 test_array *new, *old;

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

	set_affinity();

	while (!test_go)
	{
	}
	smp_mb();

	for (;;) {
		new = test_array_alloc();
		new->a = 8;
		old = rcu_xchg_pointer(&test_rcu_pointer, new);
		synchronize_rcu();
		/* can be done after unlock */
		if (old)
			old->a = 0;
		test_array_free(old);
		nr_writes++;
		if (unlikely(!test_duration_write()))
			break;
		if (unlikely(wdelay))
			loop_sleep(wdelay);
	}

	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(" [-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 '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());

	test_array = malloc(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);
	}

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