X-Git-Url: https://git.liburcu.org/?p=urcu.git;a=blobdiff_plain;f=tests%2Ftest_urcu_lfs.c;h=252454d29aeb46d4758e30b2a7f6b864cc8e3b65;hp=8249ebaeb05295cb43435cf3869a6ebfc74d9457;hb=6e5f88cf94a225b155719046d87bfd32ba47e06a;hpb=5481ddb381061bda64aebc039900d21cac6a6caf diff --git a/tests/test_urcu_lfs.c b/tests/test_urcu_lfs.c index 8249eba..252454d 100644 --- a/tests/test_urcu_lfs.c +++ b/tests/test_urcu_lfs.c @@ -34,12 +34,15 @@ #include #include #include -#include #include #include #include +#ifdef __linux__ +#include +#endif + /* hardcoded number of CPUs */ #define NR_CPUS 16384 @@ -62,7 +65,7 @@ static inline pid_t gettid(void) #define _LGPL_SOURCE #endif #include -#include +#include #include static volatile int test_go, test_stop; @@ -77,7 +80,7 @@ static unsigned long wdelay; static inline void loop_sleep(unsigned long l) { while(l-- != 0) - cpu_relax(); + caa_cpu_relax(); } static int verbose_mode; @@ -154,7 +157,7 @@ static unsigned long long __thread nr_successful_enqueues; static unsigned int nr_enqueuers; static unsigned int nr_dequeuers; -static struct rcu_lfs_stack s; +static struct cds_lfs_stack_rcu s; void *thr_enqueuer(void *_count) { @@ -173,11 +176,12 @@ void *thr_enqueuer(void *_count) cmm_smp_mb(); for (;;) { - struct rcu_lfs_node *node = malloc(sizeof(*node)); + struct cds_lfs_node_rcu *node = malloc(sizeof(*node)); if (!node) goto fail; - rcu_lfs_node_init(node); - rcu_lfs_push(&s, node); + cds_lfs_node_init_rcu(node); + /* No rcu read-side is needed for push */ + cds_lfs_push_rcu(&s, node); nr_successful_enqueues++; if (unlikely(wdelay)) @@ -203,13 +207,18 @@ fail: void *thr_dequeuer(void *_count) { unsigned long long *count = _count; + int ret; printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n", "dequeuer", pthread_self(), (unsigned long)gettid()); set_affinity(); - rcu_defer_register_thread(); + ret = rcu_defer_register_thread(); + if (ret) { + printf("Error in rcu_defer_register_thread\n"); + exit(-1); + } rcu_register_thread(); while (!test_go) @@ -218,13 +227,15 @@ void *thr_dequeuer(void *_count) cmm_smp_mb(); for (;;) { - struct rcu_lfs_node *node = rcu_lfs_pop(&s); + struct cds_lfs_node_rcu *node; + rcu_read_lock(); + node = cds_lfs_pop_rcu(&s); + rcu_read_unlock(); if (node) { defer_rcu(free, node); nr_successful_dequeues++; } - nr_dequeues++; if (unlikely(!test_duration_dequeue())) break; @@ -244,12 +255,12 @@ void *thr_dequeuer(void *_count) return ((void*)2); } -void test_end(struct rcu_lfs_stack *s, unsigned long long *nr_dequeues) +void test_end(struct cds_lfs_stack_rcu *s, unsigned long long *nr_dequeues) { - struct rcu_lfs_node *node; + struct cds_lfs_node_rcu *node; do { - node = rcu_lfs_pop(s); + node = cds_lfs_pop_rcu(s); if (node) { free(node); (*nr_dequeues)++; @@ -348,7 +359,7 @@ int main(int argc, char **argv) tid_dequeuer = malloc(sizeof(*tid_dequeuer) * nr_dequeuers); count_enqueuer = malloc(2 * sizeof(*count_enqueuer) * nr_enqueuers); count_dequeuer = malloc(2 * sizeof(*count_dequeuer) * nr_dequeuers); - rcu_lfs_init(&s); + cds_lfs_init_rcu(&s); next_aff = 0;