[urcu.git] / tests / 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.
 */

#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 <sched.h>
#include <errno.h>

#include <urcu/arch.h>
#include <urcu/tls-compat.h>

#ifdef __linux__
#include <syscall.h>
#endif

/* 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 rcu_debug_yield_read()
#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 unsigned int 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;

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

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;
	struct test_array *local_ptr;

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

	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, thread id : %lx, tid %lu\n",
			"reader", (unsigned long) pthread_self(),
			(unsigned long) gettid());
	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);
}

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, thread id : %lx, tid %lu\n",
			"writer", (unsigned long) pthread_self(),
			(unsigned long) gettid());

	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, thread id : %lx, tid %lu\n",
			"writer", (unsigned long) pthread_self(),
			(unsigned long) gettid());
	tot_nr_writes[wtidx] = URCU_TLS(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;
	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':
			rcu_yield_active |= RCU_YIELD_READ;
			break;
		case 'w':
			rcu_yield_active |= RCU_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 'b':
			if (argc < i + 2) {
				show_usage(argc, argv);
				return -1;
			}
			reclaim_batch = atol(argv[++i]);
			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", (unsigned long) 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);
	tot_nr_writes = malloc(sizeof(*tot_nr_writes) * nr_writers);
	pending_reclaims = malloc(sizeof(*pending_reclaims) * nr_writers);
	if (reclaim_batch * sizeof(*pending_reclaims[i].queue)
			< CAA_CACHE_LINE_SIZE)
		for (i = 0; i < nr_writers; i++)
			pending_reclaims[i].queue = calloc(1, CAA_CACHE_LINE_SIZE);
	else
		for (i = 0; i < nr_writers; i++)
			pending_reclaims[i].queue = calloc(reclaim_batch,
					sizeof(*pending_reclaims[i].queue));
	for (i = 0; i < nr_writers; i++)
		pending_reclaims[i].head = pending_reclaims[i].queue;

	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,
				     (void *)(long)i);
		if (err != 0)
			exit(1);
	}

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