#include #include #include #include #include #include "../../common.h" #ifndef ITERATIONS #define ITERATIONS 128 #endif struct context { unsigned int tid; unsigned int previous; unsigned int next; }; struct entry { int tid; int value; }; CK_RING(entry, entry_ring) static int nthr; static CK_RING_INSTANCE(entry_ring) *ring; static struct affinity a; static int size; static volatile int barrier; static void * test(void *c) { struct context *context = c; struct entry entry; int i, j; bool r; if (aff_iterate(&a)) { perror("ERROR: Could not affine thread"); exit(EXIT_FAILURE); } if (context->tid == 0) { struct entry *entries; entries = malloc(sizeof(struct entry) * size); assert(entries != NULL); for (i = 0; i < size; i++) { entries[i].value = i; entries[i].tid = 0; r = CK_RING_ENQUEUE_SPSC(entry_ring, ring + context->tid, entries + i); } barrier = 1; } while (barrier == 0); for (i = 0; i < ITERATIONS; i++) { for (j = 0; j < size; j++) { while (CK_RING_DEQUEUE_SPSC(entry_ring, ring + context->previous, &entry) == false); if (context->previous != (unsigned int)entry.tid) { fprintf(stderr, "[%u] %u != %u\n", context->tid, entry.tid, context->previous); exit(EXIT_FAILURE); } if (entry.value != j) { fprintf(stderr, "[%u] %u != %u\n", context->tid, entry.tid, context->previous); exit(EXIT_FAILURE); } entry.tid = context->tid; r = CK_RING_ENQUEUE_SPSC(entry_ring, ring + context->tid, &entry); assert(r == true); } } return NULL; } int main(int argc, char *argv[]) { int i, r; struct entry *buffer; struct context *context; pthread_t *thread; if (argc != 4) { fprintf(stderr, "Usage: validate \n"); exit(EXIT_FAILURE); } a.request = 0; a.delta = atoi(argv[2]); nthr = atoi(argv[1]); assert(nthr >= 1); size = atoi(argv[3]); assert(size > 0); ring = malloc(sizeof(CK_RING_INSTANCE(entry_ring)) * nthr); assert(ring); context = malloc(sizeof(*context) * nthr); assert(context); thread = malloc(sizeof(pthread_t) * nthr); assert(thread); for (i = 0; i < nthr; i++) { context[i].tid = i; if (i == 0) { context[i].previous = nthr - 1; context[i].next = i + 1; } else if (i == nthr - 1) { context[i].next = 0; context[i].previous = i - 1; } else { context[i].next = i + 1; context[i].previous = i - 1; } buffer = malloc(sizeof(struct entry) * (size + 1)); assert(buffer); CK_RING_INIT(entry_ring, ring + i, buffer, size + 1); r = pthread_create(thread + i, NULL, test, context + i); assert(r == 0); } for (i = 0; i < nthr; i++) pthread_join(thread[i], NULL); return (0); }