From a813abf8d937798b4a1b6e3246e844d75eef5756 Mon Sep 17 00:00:00 2001 From: Mathieu Desnoyers Date: Thu, 18 Jun 2009 09:32:46 -0400 Subject: [PATCH] Add GC tests Signed-off-by: Mathieu Desnoyers --- runall.sh | 18 ++ runtests-batch.sh | 7 + test_qsbr_gc.c | 442 +++++++++++++++++++++++++++++++++++++++++++++ test_urcu_gc.c | 443 ++++++++++++++++++++++++++++++++++++++++++++++ 4 files changed, 910 insertions(+) create mode 100755 runtests-batch.sh create mode 100644 test_qsbr_gc.c create mode 100644 test_urcu_gc.c diff --git a/runall.sh b/runall.sh index 6a1baa2..34b7a5b 100755 --- a/runall.sh +++ b/runall.sh @@ -27,6 +27,24 @@ NUM_CPUS=8 rm -f runall.log rm -fr runall.detail.log + +echo Executing batch RCU test + +DURATION=10 +BATCH_ARRAY="1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768" +NR_WRITERS=$((${NUM_CPUS} / 2)) + +rm -f batch-rcu.log + +NR_READERS=$((${NUM_CPUS} - ${NR_WRITERS})) +for BATCH_SIZE in ${BATCH_ARRAY}; do + echo "./runtests-batch.sh ${NR_READERS} ${NR_WRITERS} ${DURATION} -d 0 -b ${BATCH_SIZE} ${EXTRA_OPTS} | tee -a batch-rcu.log" >> runall.log + ./runtests-batch.sh ${NR_READERS} ${NR_WRITERS} ${DURATION} -d 0 -b ${BATCH_SIZE} ${EXTRA_OPTS} | tee -a batch-rcu.log +done + +#setting gc each 1024 +EXTRA_OPTS+="-b 1024" + echo Executing update fraction test DURATION=10 diff --git a/runtests-batch.sh b/runtests-batch.sh new file mode 100755 index 0000000..a9afed3 --- /dev/null +++ b/runtests-batch.sh @@ -0,0 +1,7 @@ +#!/bin/sh + +for a in test_urcu_gc test_urcu_gc_mb test_qsbr_gc; do + echo "./${a} $*" | tee -a runall.detail.log + /usr/bin/time --append --output runall.detail.log ./${a} $* +done + diff --git a/test_qsbr_gc.c b/test_qsbr_gc.c new file mode 100644 index 0000000..ccdf593 --- /dev/null +++ b/test_qsbr_gc.c @@ -0,0 +1,442 @@ +/* + * test_urcu_gc.c + * + * Userspace RCU library - test program (with baatch reclamation) + * + * Copyright February 2009 - Mathieu Desnoyers + * + * 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 +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +#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 + +#define _LGPL_SOURCE +#include "urcu-qsbr.h" + +struct test_array { + int a; +}; + +static volatile int test_go, test_stop; + +static unsigned long wdelay; + +static struct test_array *test_rcu_pointer; + +static unsigned long duration; + +/* read-side C.S. duration, in loops */ +static unsigned long rduration; +static int reclaim_batch = 1; + +struct reclaim_queue { + void **queue; /* Beginning of queue */ + void **head; /* Insert position */ +}; + +static struct reclaim_queue *pending_reclaims; + + +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 int nr_readers; +static unsigned int nr_writers; + +pthread_mutex_t rcu_copy_mutex = PTHREAD_MUTEX_INITIALIZER; +static +unsigned long long __attribute__((aligned(CACHE_LINE_SIZE))) *tot_nr_writes; + + +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++; + /* QS each 1024 reads */ + if (unlikely((nr_reads & ((1 << 10) - 1)) == 0)) + _rcu_quiescent_state(); + if (unlikely(!test_duration_read())) + break; + } + + rcu_unregister_thread(); + + *count = nr_reads; + printf_verbose("thread_end %s, thread id : %lx, tid %lu\n", + "reader", pthread_self(), (unsigned long)gettid()); + return ((void*)1); + +} + +/* 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; +} diff --git a/test_urcu_gc.c b/test_urcu_gc.c new file mode 100644 index 0000000..328b570 --- /dev/null +++ b/test_urcu_gc.c @@ -0,0 +1,443 @@ +/* + * test_urcu_gc.c + * + * Userspace RCU library - test program (with baatch reclamation) + * + * Copyright February 2009 - Mathieu Desnoyers + * + * 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 +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +#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; +} -- 2.34.1