1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249
|
/*
* Copyright 2009 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)
#endif
#define TVTOD(tv) ((tv).tv_sec+((tv).tv_usec / (double)1000000))
struct entry {
int value;
#if defined(SPINLOCK) || defined(PTHREADS)
struct entry *next;
#else
ck_stack_entry_t next;
#endif
} CK_CC_CACHELINE;
#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
#elif defined(PTHREADS)
static struct entry *stack CK_CC_CACHELINE;
pthread_mutex_t stack_spinlock = PTHREAD_MUTEX_INITIALIZER;
#define LOCK pthread_mutex_lock
#define UNLOCK pthread_mutex_unlock
#else
static ck_stack_t stack CK_CC_CACHELINE;
CK_STACK_CONTAINER(struct entry, next, getvalue)
#endif
static struct affinity affinerator;
static unsigned long long nthr;
static volatile unsigned int barrier = 0;
static unsigned int critical;
static void *
stack_thread(void *buffer)
{
#if (defined(MPMC) && defined(CK_F_STACK_POP_MPMC)) || (defined(UPMC) && defined(CK_F_STACK_POP_UPMC)) || (defined(TRYUPMC) && defined(CK_F_STACK_TRYPOP_UPMC)) || (defined(TRYMPMC) && defined(CK_F_STACK_TRYPOP_MPMC))
ck_stack_entry_t *ref;
#endif
struct entry *entry = buffer;
unsigned long long i, n = ITEMS;
unsigned int seed;
int j;
if (aff_iterate(&affinerator)) {
perror("ERROR: failed to affine thread");
exit(EXIT_FAILURE);
}
while (barrier == 0);
for (i = 0; i < n; i++) {
#if defined(MPMC)
ck_stack_push_mpmc(&stack, &entry->next);
#elif defined(TRYMPMC)
while (ck_stack_trypush_mpmc(&stack, &entry->next) == false)
ck_pr_stall();
#elif defined(UPMC)
ck_stack_push_upmc(&stack, &entry->next);
#elif defined(TRYUPMC)
while (ck_stack_trypush_upmc(&stack, &entry->next) == false)
ck_pr_stall();
#elif defined(SPINLOCK) || defined(PTHREADS)
LOCK(&stack_spinlock);
ck_pr_store_ptr(&entry->next, stack);
ck_pr_store_ptr(&stack, entry);
UNLOCK(&stack_spinlock);
#else
# error Undefined operation.
#endif
if (critical) {
j = common_rand_r(&seed) % critical;
while (j--)
__asm__ __volatile__("" ::: "memory");
}
#if defined(MPMC)
#ifdef CK_F_STACK_POP_MPMC
ref = ck_stack_pop_mpmc(&stack);
entry = getvalue(ref);
#endif
#elif defined(TRYMPMC)
#ifdef CK_F_STACK_TRYPOP_MPMC
while (ck_stack_trypop_mpmc(&stack, &ref) == false)
ck_pr_stall();
entry = getvalue(ref);
#endif /* CK_F_STACK_TRYPOP_MPMC */
#elif defined(UPMC)
ref = ck_stack_pop_upmc(&stack);
entry = getvalue(ref);
#elif defined(SPINLOCK) || defined(PTHREADS)
LOCK(&stack_spinlock);
entry = stack;
stack = stack->next;
UNLOCK(&stack_spinlock);
#else
# error Undefined operation.
#endif
}
return (NULL);
}
static void
stack_assert(void)
{
#if defined(SPINLOCK) || defined(PTHREADS)
assert(stack == NULL);
#else
assert(CK_STACK_ISEMPTY(&stack));
#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.request = 0;
affinerator.delta = d;
bucket = malloc(sizeof(struct entry) * nthr);
assert(bucket != NULL);
thread = malloc(sizeof(pthread_t) * nthr);
assert(thread != NULL);
for (i = 0; i < nthr; i++)
pthread_create(&thread[i], NULL, stack_thread, bucket + i);
barrier = 1;
for (i = 0; i < nthr; i++)
pthread_join(thread[i], NULL);
barrier = 0;
for (i = 0; i < nthr; i++)
pthread_create(&thread[i], NULL, stack_thread, bucket + i);
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;
}
|