+// SPDX-FileCopyrightText: 2010 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
+// SPDX-FileCopyrightText: 2010 Paolo Bonzini <pbonzini@redhat.com>
+//
+// SPDX-License-Identifier: GPL-2.0-or-later
+
/*
- * test_urcu_lfq.c
- *
* Userspace RCU library - example RCU-based lock-free queue
- *
- * Copyright February 2010 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
- * Copyright February 2010 - Paolo Bonzini <pbonzini@redhat.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 <sys/wait.h>
#include <unistd.h>
#include <stdio.h>
-#include <assert.h>
#include <errno.h>
#include <urcu/arch.h>
+#include <urcu/assert.h>
#include <urcu/tls-compat.h>
-#include "cpuset.h"
#include "thread-id.h"
/* hardcoded number of CPUs */
#include <urcu.h>
#include <urcu/cds.h>
-static volatile int test_go, test_stop;
-
static unsigned long rduration;
static unsigned long duration;
static void set_affinity(void)
{
-#if HAVE_SCHED_SETAFFINITY
+#ifdef HAVE_SCHED_SETAFFINITY
cpu_set_t mask;
int cpu, ret;
#endif /* HAVE_SCHED_SETAFFINITY */
if (!use_affinity)
return;
-#if HAVE_SCHED_SETAFFINITY
+#ifdef HAVE_SCHED_SETAFFINITY
ret = pthread_mutex_lock(&affinity_mutex);
if (ret) {
perror("Error in pthread mutex lock");
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 */
}
*/
static int test_duration_dequeue(void)
{
- return !test_stop;
+ return test_duration_read();
}
static int test_duration_enqueue(void)
{
- return !test_stop;
+ return test_duration_write();
}
static DEFINE_URCU_TLS(unsigned long long, nr_dequeues);
static struct cds_lfq_queue_rcu q;
+static
void *thr_enqueuer(void *_count)
{
unsigned long long *count = _count;
rcu_register_thread();
- while (!test_go)
- {
- }
- cmm_smp_mb();
+ wait_until_go();
for (;;) {
struct test *node = malloc(sizeof(*node));
free(node);
}
+static
void *thr_dequeuer(void *_count)
{
unsigned long long *count = _count;
rcu_register_thread();
- while (!test_go)
- {
- }
- cmm_smp_mb();
+ wait_until_go();
for (;;) {
struct cds_lfq_node_rcu *qnode;
return ((void*)2);
}
-void test_end(struct cds_lfq_queue_rcu *q, unsigned long long *nr_dequeues)
+static
+void test_end(unsigned long long *nr_dequeues_l)
{
struct cds_lfq_node_rcu *snode;
do {
- snode = cds_lfq_dequeue_rcu(q);
+ snode = cds_lfq_dequeue_rcu(&q);
if (snode) {
struct test *node;
node = caa_container_of(snode, struct test, list);
free(node); /* no more concurrent access */
- (*nr_dequeues)++;
+ (*nr_dequeues_l)++;
}
} while (snode);
}
-void show_usage(int argc, char **argv)
+static
+void show_usage(char **argv)
{
printf("Usage : %s nr_dequeuers nr_enqueuers duration (s) <OPTIONS>\n",
argv[0]);
tot_successful_dequeues = 0;
unsigned long long end_dequeues = 0;
int i, a;
+ unsigned int i_thr;
if (argc < 4) {
- show_usage(argc, argv);
+ show_usage(argv);
return -1;
}
err = sscanf(argv[1], "%u", &nr_dequeuers);
if (err != 1) {
- show_usage(argc, argv);
+ show_usage(argv);
return -1;
}
err = sscanf(argv[2], "%u", &nr_enqueuers);
if (err != 1) {
- show_usage(argc, argv);
+ show_usage(argv);
return -1;
}
-
+
err = sscanf(argv[3], "%lu", &duration);
if (err != 1) {
- show_usage(argc, argv);
+ show_usage(argv);
return -1;
}
switch (argv[i][1]) {
case 'a':
if (argc < i + 2) {
- show_usage(argc, argv);
+ show_usage(argv);
return -1;
}
a = atoi(argv[++i]);
break;
case 'c':
if (argc < i + 2) {
- show_usage(argc, argv);
+ show_usage(argv);
return -1;
}
rduration = atol(argv[++i]);
break;
case 'd':
if (argc < i + 2) {
- show_usage(argc, argv);
+ show_usage(argv);
return -1;
}
wdelay = atol(argv[++i]);
next_aff = 0;
- for (i = 0; i < nr_enqueuers; i++) {
- err = pthread_create(&tid_enqueuer[i], NULL, thr_enqueuer,
- &count_enqueuer[2 * i]);
+ for (i_thr = 0; i_thr < nr_enqueuers; i_thr++) {
+ err = pthread_create(&tid_enqueuer[i_thr], NULL, thr_enqueuer,
+ &count_enqueuer[2 * i_thr]);
if (err != 0)
exit(1);
}
- for (i = 0; i < nr_dequeuers; i++) {
- err = pthread_create(&tid_dequeuer[i], NULL, thr_dequeuer,
- &count_dequeuer[2 * i]);
+ for (i_thr = 0; i_thr < nr_dequeuers; i_thr++) {
+ err = pthread_create(&tid_dequeuer[i_thr], NULL, thr_dequeuer,
+ &count_dequeuer[2 * i_thr]);
if (err != 0)
exit(1);
}
cmm_smp_mb();
- test_go = 1;
+ begin_test();
- for (i = 0; i < duration; i++) {
+ for (i_thr = 0; i_thr < duration; i_thr++) {
sleep(1);
- if (verbose_mode)
- write (1, ".", 1);
+ if (verbose_mode) {
+ fwrite(".", sizeof(char), 1, stdout);
+ fflush(stdout);
+ }
}
- test_stop = 1;
+ end_test();
- for (i = 0; i < nr_enqueuers; i++) {
- err = pthread_join(tid_enqueuer[i], &tret);
+ for (i_thr = 0; i_thr < nr_enqueuers; i_thr++) {
+ err = pthread_join(tid_enqueuer[i_thr], &tret);
if (err != 0)
exit(1);
- tot_enqueues += count_enqueuer[2 * i];
- tot_successful_enqueues += count_enqueuer[2 * i + 1];
+ tot_enqueues += count_enqueuer[2 * i_thr];
+ tot_successful_enqueues += count_enqueuer[2 * i_thr + 1];
}
- for (i = 0; i < nr_dequeuers; i++) {
- err = pthread_join(tid_dequeuer[i], &tret);
+ for (i_thr = 0; i_thr < nr_dequeuers; i_thr++) {
+ err = pthread_join(tid_dequeuer[i_thr], &tret);
if (err != 0)
exit(1);
- tot_dequeues += count_dequeuer[2 * i];
- tot_successful_dequeues += count_dequeuer[2 * i + 1];
+ tot_dequeues += count_dequeuer[2 * i_thr];
+ tot_successful_dequeues += count_dequeuer[2 * i_thr + 1];
}
-
- test_end(&q, &end_dequeues);
+
+ test_end(&end_dequeues);
err = cds_lfq_destroy_rcu(&q);
- assert(!err);
+ urcu_posix_assert(!err);
printf_verbose("total number of enqueues : %llu, dequeues %llu\n",
tot_enqueues, tot_dequeues);
free(count_dequeuer);
free(tid_enqueuer);
free(tid_dequeuer);
+
return 0;
}
projects / urcu.git / blobdiff