You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
144 lines
4.0 KiB
144 lines
4.0 KiB
/*
|
|
* Copyright 2011-2013 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 ngroups;
|
|
static int counters[ENTRIES];
|
|
static ck_barrier_combining_t barrier;
|
|
static int barrier_wait;
|
|
|
|
static void *
|
|
thread(void *group)
|
|
{
|
|
ck_barrier_combining_state_t state = CK_BARRIER_COMBINING_STATE_INITIALIZER;
|
|
int j, counter;
|
|
int i = 0;
|
|
|
|
aff_iterate(&a);
|
|
|
|
ck_pr_inc_int(&barrier_wait);
|
|
while (ck_pr_load_int(&barrier_wait) != (nthr * ngroups))
|
|
ck_pr_stall();
|
|
|
|
for (j = 0; j < ITERATE; j++) {
|
|
i = j++ & (ENTRIES - 1);
|
|
ck_pr_inc_int(&counters[i]);
|
|
ck_barrier_combining(&barrier, group, &state);
|
|
counter = ck_pr_load_int(&counters[i]);
|
|
if (counter != nthr * ngroups * (j / ENTRIES + 1)) {
|
|
ck_error("FAILED [%d:%d]: %d != %d\n", i, j - 1, counter, nthr * ngroups);
|
|
}
|
|
}
|
|
|
|
return (NULL);
|
|
}
|
|
|
|
int
|
|
main(int argc, char *argv[])
|
|
{
|
|
pthread_t *threads;
|
|
ck_barrier_combining_group_t *groupings;
|
|
ck_barrier_combining_group_t *init_root;
|
|
int i;
|
|
|
|
init_root = malloc(sizeof(ck_barrier_combining_group_t));
|
|
if (init_root == NULL) {
|
|
ck_error("ERROR: Could not allocate initial barrier structure\n");
|
|
}
|
|
ck_barrier_combining_init(&barrier, init_root);
|
|
|
|
if (argc < 4) {
|
|
ck_error("Usage: correct <total groups> <threads per group> <affinity delta>\n");
|
|
}
|
|
|
|
ngroups = atoi(argv[1]);
|
|
if (ngroups <= 0) {
|
|
ck_error("ERROR: Number of groups must be greater than 0\n");
|
|
}
|
|
|
|
nthr = atoi(argv[2]);
|
|
if (nthr <= 0) {
|
|
ck_error("ERROR: Number of threads must be greater than 0\n");
|
|
}
|
|
|
|
groupings = malloc(sizeof(ck_barrier_combining_group_t) * ngroups);
|
|
if (groupings == NULL) {
|
|
ck_error("Could not allocate thread barrier grouping structures\n");
|
|
}
|
|
|
|
threads = malloc(sizeof(pthread_t) * nthr * ngroups);
|
|
if (threads == NULL) {
|
|
ck_error("ERROR: Could not allocate thread structures\n");
|
|
}
|
|
|
|
a.delta = atoi(argv[3]);
|
|
|
|
for (i = 0; i < ngroups; i++)
|
|
ck_barrier_combining_group_init(&barrier, groupings + i, nthr);
|
|
|
|
fprintf(stderr, "Creating threads (barrier)...");
|
|
for (i = 0; i < (nthr * ngroups); i++) {
|
|
if (pthread_create(&threads[i], NULL, thread, groupings + (i % ngroups))) {
|
|
ck_error("ERROR: Could not create thread %d\n", i);
|
|
}
|
|
}
|
|
fprintf(stderr, "done\n");
|
|
|
|
fprintf(stderr, "Waiting for threads to finish correctness regression...");
|
|
for (i = 0; i < (nthr * ngroups); i++)
|
|
pthread_join(threads[i], NULL);
|
|
fprintf(stderr, "done (passed)\n");
|
|
|
|
return (0);
|
|
}
|
|
|