[urcu.git] / tests / benchmark / test_urcu_gc.c

/*
 * test_urcu_gc.c
 *
 * Userspace RCU library - test program (with batch reclamation)
 *
 * 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 "cpuset.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 long reclaim_batch = 1;

struct reclaim_queue {
	void **queue;	/* Beginning of queue */
	void **head;	/* Insert position */
};

static struct reclaim_queue *pending_reclaims;

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)
{
#ifdef HAVE_SCHED_SETAFFINITY
	cpu_set_t mask;
	int cpu, ret;
#endif /* HAVE_SCHED_SETAFFINITY */

	if (!use_affinity)
		return;

#ifdef 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 long long __attribute__((aligned(CAA_CACHE_LINE_SIZE))) *tot_nr_writes;

static unsigned int nr_readers;
static unsigned int nr_writers;

pthread_mutex_t rcu_copy_mutex = PTHREAD_MUTEX_INITIALIZER;

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 rcu_gc_clear_queue(unsigned long wtidx)
{
	void **p;

	/* Wait for Q.S and empty queue */
	synchronize_rcu();

	for (p = pending_reclaims[wtidx].queue;
			p < pending_reclaims[wtidx].head; p++) {
		/* poison */
		if (*p)
			((struct test_array *)*p)->a = 0;
		free(*p);
	}
	pending_reclaims[wtidx].head = pending_reclaims[wtidx].queue;
}

/* Using per-thread queue */
static void rcu_gc_reclaim(unsigned long wtidx, void *old)
{
	/* Queue pointer */
	*pending_reclaims[wtidx].head = old;
	pending_reclaims[wtidx].head++;

	if (caa_likely(pending_reclaims[wtidx].head - pending_reclaims[wtidx].queue
			< reclaim_batch))
		return;

	rcu_gc_clear_queue(wtidx);
}

static
void *thr_writer(void *data)
{
	unsigned long wtidx = (unsigned long)data;
#ifdef TEST_LOCAL_GC
	struct test_array *old = NULL;
#else
	struct test_array *new, *old;
#endif

	printf_verbose("thread_begin %s, tid %lu\n",
			"writer", urcu_get_thread_id());

	set_affinity();

	while (!test_go)
	{
	}
	cmm_smp_mb();

	for (;;) {
#ifndef TEST_LOCAL_GC
		new = malloc(sizeof(*new));
		new->a = 8;
		old = rcu_xchg_pointer(&test_rcu_pointer, new);
#endif
		if (caa_unlikely(wduration))
			loop_sleep(wduration);
		rcu_gc_reclaim(wtidx, old);
		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());
	tot_nr_writes[wtidx] = 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;
	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 'b':
			if (argc < i + 2) {
				show_usage(argv);
				return -1;
			}
			reclaim_batch = atol(argv[++i]);
			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());

	tid_reader = calloc(nr_readers, sizeof(*tid_reader));
	tid_writer = calloc(nr_writers, sizeof(*tid_writer));
	count_reader = calloc(nr_readers, sizeof(*count_reader));
	tot_nr_writes = calloc(nr_writers, sizeof(*tot_nr_writes));
	pending_reclaims = calloc(nr_writers, sizeof(*pending_reclaims));

	if (reclaim_batch * sizeof(*pending_reclaims[0].queue)
			< CAA_CACHE_LINE_SIZE)
		for (i_thr = 0; i_thr < nr_writers; i_thr++)
			pending_reclaims[i_thr].queue = calloc(1, CAA_CACHE_LINE_SIZE);
	else
		for (i_thr = 0; i_thr < nr_writers; i_thr++)
			pending_reclaims[i_thr].queue = calloc(reclaim_batch,
					sizeof(*pending_reclaims[i_thr].queue));
	for (i_thr = 0; i_thr < nr_writers; i_thr++)
		pending_reclaims[i_thr].head = pending_reclaims[i_thr].queue;

	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,
				     (void *)(long)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 += tot_nr_writes[i_thr];
		rcu_gc_clear_queue(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 "
		"batch %ld\n",
		argv[0], duration, nr_readers, rduration, wduration,
		nr_writers, wdelay, tot_reads, tot_writes,
		tot_reads + tot_writes, reclaim_batch);

	free(tid_reader);
	free(tid_writer);
	free(count_reader);
	free(tot_nr_writes);

	for (i_thr = 0; i_thr < nr_writers; i_thr++)
		free(pending_reclaims[i_thr].queue);
	free(pending_reclaims);

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