--- /dev/null
+/*
+ * test_wfstack.c
+ *
+ * Userspace RCU library - test wftack race conditions
+ *
+ * Copyright 2023 - Olivier Dion <odion@efficios.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 _LGPL_SOURCE
+
+#include <stdlib.h>
+
+#include <pthread.h>
+
+#include <urcu/wfstack.h>
+
+#include "tap.h"
+
+#define NR_TESTS 1
+#define NR_PRODUCERS 4
+#define LOOP 100
+
+static void async_run(struct cds_wfs_stack *queue)
+{
+ struct cds_wfs_node *node = malloc(sizeof(*node));
+
+ cds_wfs_node_init(node);
+
+ cds_wfs_push(queue, node);
+}
+
+static void *async_loop(void *queue)
+{
+ size_t k = 0;
+
+ while (k < LOOP * NR_PRODUCERS) {
+ free(cds_wfs_pop_blocking(queue));
+ ++k;
+ }
+
+ return NULL;
+}
+
+static void *spawn_jobs(void *queue)
+{
+ for (size_t k = 0; k < LOOP; ++k) {
+ async_run(queue);
+ }
+
+ return 0;
+}
+
+int main(void)
+{
+ pthread_t consumer;
+ pthread_t producers[NR_PRODUCERS];
+ struct cds_wfs_stack queue;
+
+ plan_tests(NR_TESTS);
+
+ cds_wfs_init(&queue);
+ pthread_create(&consumer, NULL, async_loop, &queue);
+
+ for (size_t k = 0; k < NR_PRODUCERS; ++k) {
+ pthread_create(&producers[k], NULL, spawn_jobs, &queue);
+ }
+
+ pthread_join(consumer, NULL);
+ for (size_t k = 0; k < NR_PRODUCERS; ++k) {
+ pthread_join(producers[k], NULL);
+ }
+
+ ok1("No race conditions");
+
+ return exit_status();
+}