[urcu.git] / test_urcu_gc.c

/*
 * test_urcu_gc.c
 *
 * Userspace RCU library - test program (with baatch reclamation)
 *
 * 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 "arch.h"

/* Make this big enough to include the POWER5+ L3 cacheline size of 256B */
#define CACHE_LINE_SIZE 4096

#if defined(_syscall0)
_syscall0(pid_t, gettid)
#elif defined(__NR_gettid)
static inline pid_t gettid(void)
{
	return syscall(__NR_gettid);
}
#else
#warning "use pid as tid"
static inline pid_t gettid(void)
{
	return getpid();
}
#endif

#ifndef DYNAMIC_LINK_TEST
#define _LGPL_SOURCE
#else
#define debug_yield_read()
#endif
#include "urcu.h"

struct test_array {
	int a;
};

static volatile int test_go, test_stop;

static unsigned long wdelay;

static struct test_array *test_rcu_pointer;

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

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)

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

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

}

/* Using per-thread queue */
static void rcu_gc_reclaim(unsigned long wtidx, void *old)
{
	void **p;

	/* Queue pointer */
	*pending_reclaims[wtidx].head = old;
	pending_reclaims[wtidx].head++;

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

	/* If queue is full, 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;
}

static void rcu_gc_cleanup(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;
}

void *thr_writer(void *data)
{
	unsigned long wtidx = (unsigned long)data;
	struct test_array *new, *old;

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

	while (!test_go)
	{
	}
	smp_mb();

	for (;;) {
		new = malloc(sizeof(*new));
		rcu_copy_mutex_lock();
		old = test_rcu_pointer;
		if (old)
			assert(old->a == 8);
		new->a = 8;
		old = rcu_xchg_pointer(&test_rcu_pointer, new);
		rcu_copy_mutex_unlock();
		rcu_gc_reclaim(wtidx, 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());
	tot_nr_writes[wtidx] = 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");
}

cpu_set_t affinity;

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;
	int use_affinity = 0;

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

	CPU_ZERO(&affinity);

	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_SET(a, &affinity);
			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 '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());

	if (use_affinity
	    && sched_setaffinity(0, sizeof(affinity), &affinity) < 0) {
		perror("sched_setaffinity");
		exit(-1);
	}

	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)
			< CACHE_LINE_SIZE)
		for (i = 0; i < nr_writers; i++)
			pending_reclaims[i].queue = calloc(1, 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;

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

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