Devon H. O'Dell
14 years ago
commit
22142de58f
@ -0,0 +1,146 @@
|
||||
/*
|
||||
* Copyright 2011 Samy Al Bahra.
|
||||
* Copyright 2011 David Joseph.
|
||||
* 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 <errno.h>
|
||||
#include <inttypes.h>
|
||||
#include <pthread.h>
|
||||
#include <math.h>
|
||||
#include <stdint.h>
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <strings.h>
|
||||
#include <unistd.h>
|
||||
#include <sys/time.h>
|
||||
|
||||
#include <ck_pr.h>
|
||||
#include <ck_barrier.h>
|
||||
|
||||
#include "../../common.h"
|
||||
|
||||
#ifndef ITERATE
|
||||
#define ITERATE 5000000
|
||||
#endif
|
||||
|
||||
#ifndef ENTRIES
|
||||
#define ENTRIES 512
|
||||
#endif
|
||||
|
||||
static struct affinity a;
|
||||
static int nthr;
|
||||
static int counters[ENTRIES];
|
||||
static ck_barrier_combining_t barrier;
|
||||
static int barrier_wait;
|
||||
|
||||
static void *
|
||||
thread(void *null CK_CC_UNUSED)
|
||||
{
|
||||
ck_barrier_combining_entry_t *tnode;
|
||||
ck_barrier_combining_state_t state = CK_BARRIER_COMBINING_STATE_INITIALIZER;
|
||||
int j;
|
||||
int i = 0;
|
||||
int counter;
|
||||
|
||||
tnode = malloc(sizeof(ck_barrier_combining_entry_t));
|
||||
if (tnode == NULL) {
|
||||
fprintf(stderr, "Could not allocate thread barrier entry\n");
|
||||
exit(EXIT_FAILURE);
|
||||
}
|
||||
|
||||
ck_barrier_combining_entry_init(&barrier, tnode);
|
||||
|
||||
aff_iterate(&a);
|
||||
|
||||
ck_pr_inc_int(&barrier_wait);
|
||||
while (ck_pr_load_int(&barrier_wait) != nthr)
|
||||
ck_pr_stall();
|
||||
|
||||
for (j = 0; j < ITERATE; j++) {
|
||||
i = j++ & (ENTRIES - 1);
|
||||
ck_pr_inc_int(&counters[i]);
|
||||
ck_barrier_combining(&barrier, tnode, &state);
|
||||
counter = ck_pr_load_int(&counters[i]);
|
||||
if (counter != nthr * (j / ENTRIES + 1)) {
|
||||
fprintf(stderr, "FAILED [%d:%d]: %d != %d\n", i, j - 1, counter, nthr);
|
||||
exit(EXIT_FAILURE);
|
||||
}
|
||||
}
|
||||
|
||||
free(tnode);
|
||||
return (NULL);
|
||||
}
|
||||
|
||||
int
|
||||
main(int argc, char *argv[])
|
||||
{
|
||||
pthread_t *threads;
|
||||
int i;
|
||||
ck_barrier_combining_entry_t *init_root;
|
||||
|
||||
init_root = malloc(sizeof(ck_barrier_combining_entry_t));
|
||||
if (init_root == NULL) {
|
||||
fprintf(stderr, "ERROR: Could not allocate initial barrier structure\n");
|
||||
exit(EXIT_FAILURE);
|
||||
}
|
||||
ck_barrier_combining_init(&barrier, init_root);
|
||||
|
||||
if (argc != 3) {
|
||||
fprintf(stderr, "Usage: correct <number of threads> <affinity delta>\n");
|
||||
exit(EXIT_FAILURE);
|
||||
}
|
||||
|
||||
nthr = atoi(argv[1]);
|
||||
if (nthr <= 0) {
|
||||
fprintf(stderr, "ERROR: Number of threads must be greater than 0\n");
|
||||
exit(EXIT_FAILURE);
|
||||
}
|
||||
|
||||
threads = malloc(sizeof(pthread_t) * nthr);
|
||||
if (threads == NULL) {
|
||||
fprintf(stderr, "ERROR: Could not allocate thread structures\n");
|
||||
exit(EXIT_FAILURE);
|
||||
}
|
||||
|
||||
a.delta = atoi(argv[2]);
|
||||
|
||||
fprintf(stderr, "Creating threads (barrier)...");
|
||||
for (i = 0; i < nthr; i++) {
|
||||
if (pthread_create(&threads[i], NULL, thread, NULL)) {
|
||||
fprintf(stderr, "ERROR: Could not create thread %d\n", i);
|
||||
exit(EXIT_FAILURE);
|
||||
}
|
||||
}
|
||||
fprintf(stderr, "done\n");
|
||||
|
||||
fprintf(stderr, "Waiting for threads to finish correctness regression...");
|
||||
for (i = 0; i < nthr; i++)
|
||||
pthread_join(threads[i], NULL);
|
||||
fprintf(stderr, "done (passed)\n");
|
||||
|
||||
free(init_root);
|
||||
return (0);
|
||||
}
|
||||
|
||||
Loading…
Reference in new issue