X-Git-Url: http://git.liburcu.org/?p=urcu.git;a=blobdiff_plain;f=test_urcu.c;h=626f238062e1840dffcddcd213cd5e39005506db;hp=39408a0bdd6d7141915b66222a9d64a7f655a7c3;hb=cda3c71d5a0aca557840ae7744fa1c23ba43944e;hpb=1430ee0bdca4cb454d534ef7fc84af3e0692f26b diff --git a/test_urcu.c b/test_urcu.c index 39408a0..626f238 100644 --- a/test_urcu.c +++ b/test_urcu.c @@ -5,9 +5,22 @@ * * Copyright February 2009 - Mathieu Desnoyers * - * Distributed under GPLv2 + * 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 @@ -18,6 +31,9 @@ #include #include #include +#include + +#include "arch.h" #if defined(_syscall0) _syscall0(pid_t, gettid) @@ -34,34 +50,60 @@ static inline pid_t gettid(void) } #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 int wdelay; + static struct test_array *test_rcu_pointer; static unsigned long duration; -static time_t start_time; -static unsigned long __thread duration_interval; -#define DURATION_TEST_DELAY 100 + +/* 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(void) +static int test_duration_write(void) { - if (duration_interval++ >= DURATION_TEST_DELAY) { - duration_interval = 0; - if (time(NULL) - start_time >= duration) - return 0; - } - return 1; + return !test_stop; +} + +static int test_duration_read(void) +{ + return !test_stop; } -#define NR_READ 10 -#define NR_WRITE 9 +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; @@ -86,132 +128,277 @@ void rcu_copy_mutex_unlock(void) } } -void *thr_reader(void *arg) +/* + * malloc/free are reusing memory areas too quickly, which does not let us + * test races appropriately. Use a large circular array for allocations. + * ARRAY_SIZE is larger than nr_writers, which insures we never run over our tail. + */ +#define ARRAY_SIZE (1048576 * nr_writers) +#define ARRAY_POISON 0xDEADBEEF +static int array_index; +static struct test_array *test_array; + +static struct test_array *test_array_alloc(void) { + struct test_array *ret; + int index; + + rcu_copy_mutex_lock(); + index = array_index % ARRAY_SIZE; + assert(test_array[index].a == ARRAY_POISON || + test_array[index].a == 0); + ret = &test_array[index]; + array_index++; + if (array_index == ARRAY_SIZE) + array_index = 0; + rcu_copy_mutex_unlock(); + return ret; +} + +static void test_array_free(struct test_array *ptr) +{ + if (!ptr) + return; + rcu_copy_mutex_lock(); + ptr->a = ARRAY_POISON; + rcu_copy_mutex_unlock(); +} + +void *thr_reader(void *_count) +{ + unsigned long long *count = _count; struct test_array *local_ptr; - printf("thread_begin %s, thread id : %lx, tid %lu\n", + printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n", "reader", pthread_self(), (unsigned long)gettid()); - urcu_register_thread(); + 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(); - if (!test_duration()) + nr_reads++; + if (unlikely(!test_duration_read())) break; } - urcu_unregister_thread(); + rcu_unregister_thread(); - printf("thread_end %s, thread id : %lx, tid %lu\n", + *count = nr_reads; + printf_verbose("thread_end %s, thread id : %lx, tid %lu\n", "reader", pthread_self(), (unsigned long)gettid()); return ((void*)1); } -void *thr_writer(void *arg) +void *thr_writer(void *_count) { + unsigned long long *count = _count; struct test_array *new, *old; - printf("thread_begin %s, thread id : %lx, tid %lu\n", + 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(struct test_array)); + new = test_array_alloc(); rcu_copy_mutex_lock(); old = test_rcu_pointer; if (old) assert(old->a == 8); new->a = 8; - old = urcu_publish_content((void **)&test_rcu_pointer, new); + old = rcu_publish_content(&test_rcu_pointer, new); rcu_copy_mutex_unlock(); /* can be done after unlock */ if (old) old->a = 0; - free(old); - if (!test_duration()) + test_array_free(old); + nr_writes++; + if (unlikely(!test_duration_write())) break; - usleep(1); + if (unlikely(wdelay)) + usleep(wdelay); } - printf("thread_end %s, thread id : %lx, tid %lu\n", + printf_verbose("thread_end %s, thread id : %lx, tid %lu\n", "writer", pthread_self(), (unsigned long)gettid()); + *count = nr_writes; return ((void*)2); } void show_usage(int argc, char **argv) { - printf("Usage : %s duration (s)", argv[0]); + 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[NR_READ], tid_writer[NR_WRITE]; + pthread_t *tid_reader, *tid_writer; void *tret; - int i; + unsigned long long *count_reader, *count_writer; + unsigned long long tot_reads = 0, tot_writes = 0; + int i, a; + int use_affinity = 0; - if (argc < 2) { + if (argc < 4) { show_usage(argc, argv); return -1; } - err = sscanf(argv[1], "%lu", &duration); + err = sscanf(argv[1], "%u", &nr_readers); if (err != 1) { show_usage(argc, argv); return -1; } -#ifdef DEBUG_YIELD - for (i = 2; i < argc; i++) { + 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 'c': + if (argc < i + 2) { + show_usage(argc, argv); + return -1; + } + rduration = atoi(argv[++i]); + break; + case 'd': + if (argc < i + 2) { + show_usage(argc, argv); + return -1; + } + wdelay = atoi(argv[++i]); + break; + case 'v': + verbose_mode = 1; + break; } } -#endif - printf("running test for %lu seconds.\n", duration); - start_time = time(NULL); - printf("thread %-6s, thread id : %lx, tid %lu\n", + printf_verbose("running test for %lu seconds, %u readers, %u writers.\n", + duration, nr_readers, nr_writers); + printf_verbose("Writer delay : %u us.\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()); - for (i = 0; i < NR_READ; i++) { - err = pthread_create(&tid_reader[i], NULL, thr_reader, NULL); + if (use_affinity + && sched_setaffinity(0, sizeof(affinity), &affinity) < 0) { + perror("sched_setaffinity"); + exit(-1); + } + + test_array = malloc(sizeof(*test_array) * ARRAY_SIZE); + tid_reader = malloc(sizeof(*tid_reader) * nr_readers); + tid_writer = malloc(sizeof(*tid_writer) * nr_writers); + count_reader = malloc(sizeof(*count_reader) * nr_readers); + count_writer = malloc(sizeof(*count_writer) * nr_writers); + + 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_WRITE; i++) { - err = pthread_create(&tid_writer[i], NULL, thr_writer, NULL); + for (i = 0; i < nr_writers; i++) { + err = pthread_create(&tid_writer[i], NULL, thr_writer, + &count_writer[i]); if (err != 0) exit(1); } - for (i = 0; i < NR_READ; i++) { + 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_WRITE; i++) { + for (i = 0; i < nr_writers; i++) { err = pthread_join(tid_writer[i], &tret); if (err != 0) exit(1); + tot_writes += count_writer[i]; } - free(test_rcu_pointer); - + + printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads, + tot_writes); + printf("SUMMARY %-15s testdur %4lu nr_readers %3u rdur %6lu " + "nr_writers %3u " + "wdelay %4u 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); + test_array_free(test_rcu_pointer); + free(test_array); + free(tid_reader); + free(tid_writer); + free(count_reader); + free(count_writer); return 0; }