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

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