#include #include #ifdef SPINLOCK #include #endif #include #include #include #include #include #include #include #include #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; #else static ck_stack_t stack CK_CC_CACHELINE; #endif CK_STACK_CONTAINER(struct entry, next, getvalue) static struct affinity affinerator = AFFINITY_INITIALIZER; static unsigned long long nthr; static volatile unsigned int barrier = 0; static unsigned int critical; #if defined(SPINLOCK) 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(PTHREAD) pthread_mutex_t stack_spinlock = PTHREAD_MUTEX_INITIALIZER; #define LOCK pthread_mutex_lock #define UNLOCK pthread_mutex_unlock #endif static void * stack_thread(void *buffer) { struct entry *bucket = buffer; unsigned long long i, n = ITEMS / nthr; 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++) { bucket[i].value = (i + 1) * 2; #if defined(MPNC) ck_stack_push_mpnc(&stack, &bucket[i].next); #elif defined(MPMC) ck_stack_push_mpmc(&stack, &bucket[i].next); #elif defined(UPMC) ck_stack_push_upmc(&stack, &bucket[i].next); #elif defined(SPINLOCK) || defined(PTHREADS) LOCK(&stack_spinlock); bucket[i].next = stack; stack = bucket + i; UNLOCK(&stack_spinlock); #else # error Undefined operation. #endif if (critical) { j = rand_r(&seed) % critical; while (j--) __asm__ __volatile__("" ::: "memory"); } } return (NULL); } static void stack_assert(void) { #ifndef SPINLOCK ck_stack_entry_t *n; #endif struct entry *p; unsigned long long c = 0; #ifdef SPINLOCK for (p = stack; p; p = p->next) c++; #else CK_STACK_FOREACH(&stack, n) { p = getvalue(n); (void)((volatile struct entry *)p)->value; c++; } #endif assert(c == ITEMS); return; } int main(int argc, char *argv[]) { struct entry *bucket; unsigned long long i, d, n; pthread_t *thread; struct timeval stv, etv; if (argc != 4) { fprintf(stderr, "Usage: stack \n"); exit(EXIT_FAILURE); } { char *e; nthr = strtol(argv[1], &e, 10); if (errno == ERANGE) { perror("ERROR: too many threads"); exit(EXIT_FAILURE); } else if (*e != '\0') { fprintf(stderr, "ERROR: input format is incorrect\n"); exit(EXIT_FAILURE); } d = strtol(argv[2], &e, 10); if (errno == ERANGE) { perror("ERROR: delta is too large"); exit(EXIT_FAILURE); } else if (*e != '\0') { fprintf(stderr, "ERROR: input format is incorrect\n"); exit(EXIT_FAILURE); } critical = strtoul(argv[3], &e, 10); if (errno == ERANGE) { perror("ERROR: critical section is too large"); exit(EXIT_FAILURE); } else if (*e != '\0') { fprintf(stderr, "ERROR: input format is incorrect\n"); exit(EXIT_FAILURE); } } srand(getpid()); affinerator.request = 0; affinerator.delta = d; n = ITEMS / nthr; #ifndef SPINLOCK ck_stack_init(&stack); #else stack = NULL; #endif bucket = malloc(sizeof(struct entry) * ITEMS); 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 * n); barrier = 1; for (i = 0; i < nthr; i++) pthread_join(thread[i], NULL); barrier = 0; #ifndef SPINLOCK ck_stack_init(&stack); #else stack = NULL; #endif for (i = 0; i < nthr; i++) pthread_create(&thread[i], NULL, stack_thread, bucket + i * n); gettimeofday(&stv, NULL); barrier = 1; for (i = 0; i < nthr; i++) pthread_join(thread[i], NULL); gettimeofday(&etv, NULL); stack_assert(); printf("%3llu %.6lf\n", nthr, TVTOD(etv) - TVTOD(stv)); return 0; }