1 files changed, 269 insertions, 0 deletions
diff --git a/regressions/ck_stack/validate/pop.c b/regressions/ck_stack/validate/pop.c
new file mode 100644
index 000000000000..0d69d42a8415
--- /dev/null
+++ b/regressions/ck_stack/validate/pop.c
@@ -0,0 +1,269 @@
+/*
+ * Copyright 2009-2015 Samy Al Bahra.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ */
+
+#include <assert.h>
+#include <ck_cc.h>
+#include <ck_pr.h>
+#ifdef SPINLOCK
+#include <ck_spinlock.h>
+#endif
+#include <ck_stack.h>
+#include <errno.h>
+#include <limits.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdint.h>
+#include <pthread.h>
+#include <sys/time.h>
+#include <unistd.h>
+
+#include "../../common.h"
+
+#ifndef ITEMS
+#define ITEMS (5765760 * 2)
+#endif
+
+#define TVTOD(tv) ((tv).tv_sec+((tv).tv_usec / (double)1000000))
+
+struct entry {
+	int value;
+#ifdef SPINLOCK
+	struct entry *next;
+#else
+	ck_stack_entry_t next;
+#endif
+};
+
+#ifdef SPINLOCK
+static struct entry *stack CK_CC_CACHELINE;
+ck_spinlock_fas_t stack_spinlock = CK_SPINLOCK_FAS_INITIALIZER;
+#define UNLOCK ck_spinlock_fas_unlock
+#if defined(EB)
+#define LOCK ck_spinlock_fas_lock_eb
+#else
+#define LOCK ck_spinlock_fas_lock
+#endif
+#else
+static ck_stack_t stack CK_CC_CACHELINE;
+CK_STACK_CONTAINER(struct entry, next, getvalue)
+#endif
+
+static struct affinity affinerator = AFFINITY_INITIALIZER;
+static unsigned long long nthr;
+static volatile unsigned int barrier = 0;
+static unsigned int critical;
+
+static void *
+stack_thread(void *unused CK_CC_UNUSED)
+{
+#if (defined(MPMC) && defined(CK_F_STACK_POP_MPMC)) || (defined(UPMC) && defined(CK_F_STACK_POP_UPMC)) || (defined(TRYMPMC) && defined(CK_F_STACK_TRYPOP_MPMC)) || (defined(TRYUPMC) && defined(CK_F_STACK_TRYPOP_UPMC))
+	ck_stack_entry_t *ref;
+#endif
+	struct entry *entry = NULL;
+	unsigned long long i, n = ITEMS / nthr;
+	unsigned int seed;
+	int j, previous = INT_MAX;
+
+	if (aff_iterate(&affinerator)) {
+		perror("ERROR: failed to affine thread");
+		exit(EXIT_FAILURE);
+	}
+
+	while (barrier == 0);
+
+	for (i = 0; i < n; i++) {
+#ifdef MPMC
+#ifdef CK_F_STACK_POP_MPMC
+		ref = ck_stack_pop_mpmc(&stack);
+		assert(ref);
+		entry = getvalue(ref);
+#endif /* CK_F_STACK_POP_MPMC */
+#elif defined(TRYMPMC)
+#ifdef CK_F_STACK_TRYPOP_MPMC
+		while (ck_stack_trypop_mpmc(&stack, &ref) == false)
+			ck_pr_stall();
+		assert(ref);
+		entry = getvalue(ref);
+#endif /* CK_F_STACK_TRYPOP_MPMC */
+#elif defined(UPMC)
+		ref = ck_stack_pop_upmc(&stack);
+		assert(ref);
+		entry = getvalue(ref);
+#elif defined(TRYUPMC)
+		while (ck_stack_trypop_upmc(&stack, &ref) == false)
+			ck_pr_stall();
+		assert(ref);
+		entry = getvalue(ref);
+#elif defined(SPINLOCK)
+		LOCK(&stack_spinlock);
+		entry = stack;
+		stack = stack->next;
+		UNLOCK(&stack_spinlock);
+#else
+#		error Undefined operation.
+#endif
+
+		if (critical) {
+			j = common_rand_r(&seed) % critical;
+			while (j--)
+				__asm__ __volatile__("" ::: "memory");
+		}
+
+		assert (previous >= entry->value);
+		previous = entry->value;
+	}
+
+	return (NULL);
+}
+
+static void
+stack_assert(void)
+{
+
+#ifdef SPINLOCK
+	assert(stack == NULL);
+#else
+	assert(CK_STACK_ISEMPTY(&stack));
+#endif
+	return;
+}
+
+static void
+push_stack(struct entry *bucket)
+{
+	unsigned long long i;
+
+#ifdef SPINLOCK
+	stack = NULL;
+#else
+	ck_stack_init(&stack);
+#endif
+
+	for (i = 0; i < ITEMS; i++) {
+		bucket[i].value = i % INT_MAX;
+#ifdef SPINLOCK
+		bucket[i].next = stack;
+		stack = bucket + i;
+#else
+		ck_stack_push_spnc(&stack, &bucket[i].next);
+#endif
+	}
+
+#ifndef SPINLOCK
+	ck_stack_entry_t *entry;
+	i = 0;
+	CK_STACK_FOREACH(&stack, entry) {
+		i++;
+	}
+	assert(i == ITEMS);
+#endif
+
+	return;
+}
+
+int
+main(int argc, char *argv[])
+{
+	struct entry *bucket;
+	unsigned long long i, d;
+	pthread_t *thread;
+	struct timeval stv, etv;
+
+#if (defined(TRYMPMC) || defined(MPMC)) && (!defined(CK_F_STACK_PUSH_MPMC) || !defined(CK_F_STACK_POP_MPMC))
+	fprintf(stderr, "Unsupported.\n");
+	return 0;
+#endif
+
+	if (argc != 4) {
+		ck_error("Usage: stack <threads> <delta> <critical>\n");
+	}
+
+	{
+		char *e;
+
+		nthr = strtol(argv[1], &e, 10);
+		if (errno == ERANGE) {
+			perror("ERROR: too many threads");
+			exit(EXIT_FAILURE);
+		} else if (*e != '\0') {
+			ck_error("ERROR: input format is incorrect\n");
+		}
+
+		d = strtol(argv[2], &e, 10);
+		if (errno == ERANGE) {
+			perror("ERROR: delta is too large");
+			exit(EXIT_FAILURE);
+		} else if (*e != '\0') {
+			ck_error("ERROR: input format is incorrect\n");
+		}
+
+		critical = strtoul(argv[3], &e, 10);
+		if (errno == ERANGE) {
+			perror("ERROR: critical section is too large");
+			exit(EXIT_FAILURE);
+		} else if (*e != '\0') {
+			ck_error("ERROR: input format is incorrect\n");
+		}
+	}
+
+	srand(getpid());
+
+	affinerator.delta = d;
+	bucket = malloc(sizeof(struct entry) * ITEMS);
+	assert(bucket != NULL);
+
+	thread = malloc(sizeof(pthread_t) * nthr);
+	assert(thread != NULL);
+
+	push_stack(bucket);
+	for (i = 0; i < nthr; i++)
+		pthread_create(&thread[i], NULL, stack_thread, NULL);
+
+	barrier = 1;
+
+	for (i = 0; i < nthr; i++)
+		pthread_join(thread[i], NULL);
+
+	barrier = 0;
+
+	push_stack(bucket);
+	for (i = 0; i < nthr; i++)
+		pthread_create(&thread[i], NULL, stack_thread, NULL);
+
+	common_gettimeofday(&stv, NULL);
+	barrier = 1;
+	for (i = 0; i < nthr; i++)
+		pthread_join(thread[i], NULL);
+	common_gettimeofday(&etv, NULL);
+
+	stack_assert();
+#ifdef _WIN32
+	printf("%3llu %.6f\n", nthr, TVTOD(etv) - TVTOD(stv));
+#else
+	printf("%3llu %.6lf\n", nthr, TVTOD(etv) - TVTOD(stv));
+#endif
+	return 0;
+}