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.
239 lines
6.1 KiB
239 lines
6.1 KiB
/*
|
|
* Copyright 2011-2013 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 <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_rwlock.h>
|
|
|
|
#include "../../common.h"
|
|
|
|
#ifndef ITERATE
|
|
#define ITERATE 1000000
|
|
#endif
|
|
|
|
static struct affinity a;
|
|
static unsigned int locked;
|
|
static unsigned int tid = 2;
|
|
static int nthr;
|
|
static ck_rwlock_t lock = CK_RWLOCK_INITIALIZER;
|
|
static ck_rwlock_recursive_t r_lock = CK_RWLOCK_RECURSIVE_INITIALIZER;
|
|
|
|
static void *
|
|
thread_recursive(void *null CK_CC_UNUSED)
|
|
{
|
|
int i = ITERATE;
|
|
unsigned int l;
|
|
unsigned int t = ck_pr_faa_uint(&tid, 1);
|
|
|
|
if (aff_iterate(&a)) {
|
|
perror("ERROR: Could not affine thread");
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
|
|
while (i--) {
|
|
while (ck_rwlock_recursive_write_trylock(&r_lock, t) == false)
|
|
ck_pr_stall();
|
|
|
|
ck_rwlock_recursive_write_lock(&r_lock, t);
|
|
ck_rwlock_recursive_write_lock(&r_lock, t);
|
|
ck_rwlock_recursive_write_lock(&r_lock, t);
|
|
|
|
{
|
|
l = ck_pr_load_uint(&locked);
|
|
if (l != 0) {
|
|
ck_error("ERROR [WR:%d]: %u != 0\n", __LINE__, l);
|
|
}
|
|
|
|
ck_pr_inc_uint(&locked);
|
|
ck_pr_inc_uint(&locked);
|
|
ck_pr_inc_uint(&locked);
|
|
ck_pr_inc_uint(&locked);
|
|
ck_pr_inc_uint(&locked);
|
|
ck_pr_inc_uint(&locked);
|
|
ck_pr_inc_uint(&locked);
|
|
ck_pr_inc_uint(&locked);
|
|
|
|
l = ck_pr_load_uint(&locked);
|
|
if (l != 8) {
|
|
ck_error("ERROR [WR:%d]: %u != 2\n", __LINE__, l);
|
|
}
|
|
|
|
ck_pr_dec_uint(&locked);
|
|
ck_pr_dec_uint(&locked);
|
|
ck_pr_dec_uint(&locked);
|
|
ck_pr_dec_uint(&locked);
|
|
ck_pr_dec_uint(&locked);
|
|
ck_pr_dec_uint(&locked);
|
|
ck_pr_dec_uint(&locked);
|
|
ck_pr_dec_uint(&locked);
|
|
|
|
l = ck_pr_load_uint(&locked);
|
|
if (l != 0) {
|
|
ck_error("ERROR [WR:%d]: %u != 0\n", __LINE__, l);
|
|
}
|
|
}
|
|
ck_rwlock_recursive_write_unlock(&r_lock);
|
|
ck_rwlock_recursive_write_unlock(&r_lock);
|
|
ck_rwlock_recursive_write_unlock(&r_lock);
|
|
ck_rwlock_recursive_write_unlock(&r_lock);
|
|
|
|
ck_rwlock_recursive_read_lock(&r_lock);
|
|
{
|
|
l = ck_pr_load_uint(&locked);
|
|
if (l != 0) {
|
|
ck_error("ERROR [RD:%d]: %u != 0\n", __LINE__, l);
|
|
}
|
|
}
|
|
ck_rwlock_recursive_read_unlock(&r_lock);
|
|
}
|
|
|
|
return (NULL);
|
|
}
|
|
|
|
static void *
|
|
thread(void *null CK_CC_UNUSED)
|
|
{
|
|
int i = ITERATE;
|
|
unsigned int l;
|
|
|
|
if (aff_iterate(&a)) {
|
|
perror("ERROR: Could not affine thread");
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
|
|
while (i--) {
|
|
ck_rwlock_write_lock(&lock);
|
|
{
|
|
l = ck_pr_load_uint(&locked);
|
|
if (l != 0) {
|
|
ck_error("ERROR [WR:%d]: %u != 0\n", __LINE__, l);
|
|
}
|
|
|
|
ck_pr_inc_uint(&locked);
|
|
ck_pr_inc_uint(&locked);
|
|
ck_pr_inc_uint(&locked);
|
|
ck_pr_inc_uint(&locked);
|
|
ck_pr_inc_uint(&locked);
|
|
ck_pr_inc_uint(&locked);
|
|
ck_pr_inc_uint(&locked);
|
|
ck_pr_inc_uint(&locked);
|
|
|
|
l = ck_pr_load_uint(&locked);
|
|
if (l != 8) {
|
|
ck_error("ERROR [WR:%d]: %u != 2\n", __LINE__, l);
|
|
}
|
|
|
|
ck_pr_dec_uint(&locked);
|
|
ck_pr_dec_uint(&locked);
|
|
ck_pr_dec_uint(&locked);
|
|
ck_pr_dec_uint(&locked);
|
|
ck_pr_dec_uint(&locked);
|
|
ck_pr_dec_uint(&locked);
|
|
ck_pr_dec_uint(&locked);
|
|
ck_pr_dec_uint(&locked);
|
|
|
|
l = ck_pr_load_uint(&locked);
|
|
if (l != 0) {
|
|
ck_error("ERROR [WR:%d]: %u != 0\n", __LINE__, l);
|
|
}
|
|
}
|
|
ck_rwlock_write_unlock(&lock);
|
|
|
|
ck_rwlock_read_lock(&lock);
|
|
{
|
|
l = ck_pr_load_uint(&locked);
|
|
if (l != 0) {
|
|
ck_error("ERROR [RD:%d]: %u != 0\n", __LINE__, l);
|
|
}
|
|
}
|
|
ck_rwlock_read_unlock(&lock);
|
|
}
|
|
|
|
return (NULL);
|
|
}
|
|
|
|
int
|
|
main(int argc, char *argv[])
|
|
{
|
|
pthread_t *threads;
|
|
int i;
|
|
|
|
if (argc != 3) {
|
|
ck_error("Usage: validate <number of threads> <affinity delta>\n");
|
|
}
|
|
|
|
nthr = atoi(argv[1]);
|
|
if (nthr <= 0) {
|
|
ck_error("ERROR: Number of threads must be greater than 0\n");
|
|
}
|
|
|
|
threads = malloc(sizeof(pthread_t) * nthr);
|
|
if (threads == NULL) {
|
|
ck_error("ERROR: Could not allocate thread structures\n");
|
|
}
|
|
|
|
a.delta = atoi(argv[2]);
|
|
|
|
fprintf(stderr, "Creating threads (mutual exclusion)...");
|
|
for (i = 0; i < nthr; i++) {
|
|
if (pthread_create(&threads[i], NULL, thread, NULL)) {
|
|
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; i++)
|
|
pthread_join(threads[i], NULL);
|
|
fprintf(stderr, "done (passed)\n");
|
|
|
|
fprintf(stderr, "Creating threads (mutual exclusion, recursive)...");
|
|
for (i = 0; i < nthr; i++) {
|
|
if (pthread_create(&threads[i], NULL, thread_recursive, NULL)) {
|
|
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; i++)
|
|
pthread_join(threads[i], NULL);
|
|
fprintf(stderr, "done (passed)\n");
|
|
|
|
return (0);
|
|
}
|
|
|