1*8a272653SPeter Holm#!/bin/sh 2*8a272653SPeter Holm 3*8a272653SPeter Holm# 4*8a272653SPeter Holm# Copyright (c) 2014 EMC Corp. 5*8a272653SPeter Holm# All rights reserved. 6*8a272653SPeter Holm# 7*8a272653SPeter Holm# Redistribution and use in source and binary forms, with or without 8*8a272653SPeter Holm# modification, are permitted provided that the following conditions 9*8a272653SPeter Holm# are met: 10*8a272653SPeter Holm# 1. Redistributions of source code must retain the above copyright 11*8a272653SPeter Holm# notice, this list of conditions and the following disclaimer. 12*8a272653SPeter Holm# 2. Redistributions in binary form must reproduce the above copyright 13*8a272653SPeter Holm# notice, this list of conditions and the following disclaimer in the 14*8a272653SPeter Holm# documentation and/or other materials provided with the distribution. 15*8a272653SPeter Holm# 16*8a272653SPeter Holm# THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 17*8a272653SPeter Holm# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 18*8a272653SPeter Holm# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 19*8a272653SPeter Holm# ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 20*8a272653SPeter Holm# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 21*8a272653SPeter Holm# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 22*8a272653SPeter Holm# OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 23*8a272653SPeter Holm# HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 24*8a272653SPeter Holm# LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 25*8a272653SPeter Holm# OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 26*8a272653SPeter Holm# SUCH DAMAGE. 27*8a272653SPeter Holm# 28*8a272653SPeter Holm 29*8a272653SPeter Holm# Threaded producer-consumer test. 30*8a272653SPeter Holm 31*8a272653SPeter Holm. ../default.cfg 32*8a272653SPeter Holm 33*8a272653SPeter Holmexport LANG=C 34*8a272653SPeter Holmhere=`pwd` 35*8a272653SPeter Holmcd /tmp 36*8a272653SPeter Holmsed '1,/^EOF/d' < $here/$0 > pthread2.c 37*8a272653SPeter Holmmycc -o pthread2 -Wall -Wextra -O2 -g pthread2.c -lpthread || exit 1 38*8a272653SPeter Holmrm -f pthread2.c /tmp/pthread2.core 39*8a272653SPeter Holm 40*8a272653SPeter Holmlog=/tmp/pthread2.`date '+%Y%m%d-%H%M'` 41*8a272653SPeter Holmfor i in `jot 5`; do 42*8a272653SPeter Holm [ $i -eq 1 ] && echo "# `uname -v`" 43*8a272653SPeter Holm time sh -c ' 44*8a272653SPeter Holm for i in `jot 8`; do 45*8a272653SPeter Holm /tmp/pthread2 & 46*8a272653SPeter Holm done 47*8a272653SPeter Holm wait 48*8a272653SPeter Holm ' 49*8a272653SPeter Holmdone > $log 2>&1 50*8a272653SPeter Holmrm -f /tmp/pthread2 51*8a272653SPeter Holm 52*8a272653SPeter Holmif [ -n "$bench" ]; then 53*8a272653SPeter Holm pair=`ls /tmp/pthread2* | egrep "pthread2\.[0-9]{8}-" | sort | 54*8a272653SPeter Holm tail -2 | tr '\n' ' '` 55*8a272653SPeter Holm ministat -w 72 $pair 56*8a272653SPeter Holmelse 57*8a272653SPeter Holm rm -f $log 58*8a272653SPeter Holmfi 59*8a272653SPeter Holm 60*8a272653SPeter Holm# __thr_umutex_lock() may call abort(3) under VM pressure. 61*8a272653SPeter Holm[ -r /tmp/pthread2.core ] && echo FAIL 62*8a272653SPeter Holmexit 0 63*8a272653SPeter HolmEOF 64*8a272653SPeter Holm/* 65*8a272653SPeter Holm * Threaded producer-consumer test. 66*8a272653SPeter Holm * Loosly based on work by 67*8a272653SPeter Holm * Andrey Zonov (c) 2012 68*8a272653SPeter Holm */ 69*8a272653SPeter Holm 70*8a272653SPeter Holm#include <sys/types.h> 71*8a272653SPeter Holm#include <sys/stat.h> 72*8a272653SPeter Holm#include <sys/time.h> 73*8a272653SPeter Holm#include <sys/queue.h> 74*8a272653SPeter Holm#include <err.h> 75*8a272653SPeter Holm#include <errno.h> 76*8a272653SPeter Holm#include <fcntl.h> 77*8a272653SPeter Holm#include <pthread.h> 78*8a272653SPeter Holm#ifdef __FreeBSD__ 79*8a272653SPeter Holm#include <pthread_np.h> 80*8a272653SPeter Holm#define __NP__ 81*8a272653SPeter Holm#endif 82*8a272653SPeter Holm#include <sched.h> 83*8a272653SPeter Holm#include <signal.h> 84*8a272653SPeter Holm#include <stdio.h> 85*8a272653SPeter Holm#include <stdlib.h> 86*8a272653SPeter Holm#include <string.h> 87*8a272653SPeter Holm#include <time.h> 88*8a272653SPeter Holm#include <unistd.h> 89*8a272653SPeter Holm 90*8a272653SPeter Holm#define LOCK(x) plock(&x.mtx) 91*8a272653SPeter Holm#define UNLOCK(x) punlock(&x.mtx) 92*8a272653SPeter Holm#define SIGNAL(x) psig(&x.wait) 93*8a272653SPeter Holm#define WAIT(x) pwait(&x.wait, &x.mtx) 94*8a272653SPeter Holm 95*8a272653SPeter Holmlong ncreate, nrename, nunlink; 96*8a272653SPeter Holmint bench, max; 97*8a272653SPeter Holmchar *dirname1; 98*8a272653SPeter Holmchar *dirname2; 99*8a272653SPeter Holm 100*8a272653SPeter Holmstruct file { 101*8a272653SPeter Holm char *name; 102*8a272653SPeter Holm STAILQ_ENTRY(file) next; 103*8a272653SPeter Holm}; 104*8a272653SPeter Holm 105*8a272653SPeter Holmstruct files { 106*8a272653SPeter Holm pthread_mutex_t mtx; 107*8a272653SPeter Holm pthread_cond_t wait; 108*8a272653SPeter Holm STAILQ_HEAD(, file) list; 109*8a272653SPeter Holm}; 110*8a272653SPeter Holm 111*8a272653SPeter Holmstatic struct files newfiles; 112*8a272653SPeter Holmstatic struct files renamedfiles; 113*8a272653SPeter Holm 114*8a272653SPeter Holm#define MAXQ 100000 /* Max create queue length */ 115*8a272653SPeter Holm#define MESSAGES 10000000; 116*8a272653SPeter Holm 117*8a272653SPeter Holmstatic void 118*8a272653SPeter Holmhand(int i __unused) { /* handler */ 119*8a272653SPeter Holm fprintf(stderr, "max = %d, ncreate = %ld, nrename = %ld, nunlink = %ld\n", 120*8a272653SPeter Holm max, ncreate, nrename, nunlink); 121*8a272653SPeter Holm} 122*8a272653SPeter Holm 123*8a272653SPeter Holmstatic void 124*8a272653SPeter Holmahand(int i __unused) { /* handler */ 125*8a272653SPeter Holm fprintf(stderr, "FAIL\n"); 126*8a272653SPeter Holm hand(0); 127*8a272653SPeter Holm _exit(0); 128*8a272653SPeter Holm} 129*8a272653SPeter Holm 130*8a272653SPeter Holmvoid 131*8a272653SPeter Holmplock(pthread_mutex_t *l) 132*8a272653SPeter Holm{ 133*8a272653SPeter Holm int rc; 134*8a272653SPeter Holm 135*8a272653SPeter Holm if ((rc = pthread_mutex_lock(l)) != 0) 136*8a272653SPeter Holm errc(1, rc, "pthread_mutex_lock"); 137*8a272653SPeter Holm} 138*8a272653SPeter Holm 139*8a272653SPeter Holmvoid 140*8a272653SPeter Holmpunlock(pthread_mutex_t *l) 141*8a272653SPeter Holm{ 142*8a272653SPeter Holm int rc; 143*8a272653SPeter Holm 144*8a272653SPeter Holm if ((rc = pthread_mutex_unlock(l)) != 0) 145*8a272653SPeter Holm errc(1, rc, "pthread_mutex_unlock"); 146*8a272653SPeter Holm} 147*8a272653SPeter Holm 148*8a272653SPeter Holmvoid 149*8a272653SPeter Holmpsig(pthread_cond_t *c) 150*8a272653SPeter Holm{ 151*8a272653SPeter Holm int rc; 152*8a272653SPeter Holm 153*8a272653SPeter Holm if ((rc = pthread_cond_signal(c)) != 0) 154*8a272653SPeter Holm errc(1, rc, "pthread_cond_signal"); 155*8a272653SPeter Holm} 156*8a272653SPeter Holm 157*8a272653SPeter Holmvoid 158*8a272653SPeter Holmpwait(pthread_cond_t *c, pthread_mutex_t *l) 159*8a272653SPeter Holm{ 160*8a272653SPeter Holm int rc; 161*8a272653SPeter Holm 162*8a272653SPeter Holm if ((rc = pthread_cond_wait(c, l)) != 0) 163*8a272653SPeter Holm errc(1, rc, "pthread_cond_wait"); 164*8a272653SPeter Holm} 165*8a272653SPeter Holm 166*8a272653SPeter Holmvoid * 167*8a272653SPeter Holmloop_create(void *arg __unused) 168*8a272653SPeter Holm{ 169*8a272653SPeter Holm int i; 170*8a272653SPeter Holm struct file *file; 171*8a272653SPeter Holm 172*8a272653SPeter Holm#ifdef __NP__ 173*8a272653SPeter Holm pthread_set_name_np(pthread_self(), __func__); 174*8a272653SPeter Holm#endif 175*8a272653SPeter Holm 176*8a272653SPeter Holm for (i = 0; i < max; i++) { 177*8a272653SPeter Holm file = malloc(sizeof(*file)); 178*8a272653SPeter Holm asprintf(&file->name, "%s/filename_too-long:%d", dirname1, i); 179*8a272653SPeter Holm LOCK(newfiles); 180*8a272653SPeter Holm STAILQ_INSERT_TAIL(&newfiles.list, file, next); 181*8a272653SPeter Holm ncreate++; 182*8a272653SPeter Holm UNLOCK(newfiles); 183*8a272653SPeter Holm SIGNAL(newfiles); 184*8a272653SPeter Holm if (ncreate - nrename > MAXQ) 185*8a272653SPeter Holm usleep(400); 186*8a272653SPeter Holm } 187*8a272653SPeter Holm return (NULL); 188*8a272653SPeter Holm} 189*8a272653SPeter Holm 190*8a272653SPeter Holmvoid * 191*8a272653SPeter Holmloop_rename(void *arg __unused) 192*8a272653SPeter Holm{ 193*8a272653SPeter Holm char *filename, *newname; 194*8a272653SPeter Holm struct file *file; 195*8a272653SPeter Holm 196*8a272653SPeter Holm#ifdef __NP__ 197*8a272653SPeter Holm pthread_set_name_np(pthread_self(), __func__); 198*8a272653SPeter Holm#endif 199*8a272653SPeter Holm 200*8a272653SPeter Holm while (nrename < max) { 201*8a272653SPeter Holm LOCK(newfiles); 202*8a272653SPeter Holm while (STAILQ_EMPTY(&newfiles.list)) { 203*8a272653SPeter Holm WAIT(newfiles); 204*8a272653SPeter Holm } 205*8a272653SPeter Holm file = STAILQ_FIRST(&newfiles.list); 206*8a272653SPeter Holm STAILQ_REMOVE_HEAD(&newfiles.list, next); 207*8a272653SPeter Holm UNLOCK(newfiles); 208*8a272653SPeter Holm filename = strrchr(file->name, '/'); 209*8a272653SPeter Holm asprintf(&newname, "%s/%s", dirname2, filename); 210*8a272653SPeter Holm nrename++; 211*8a272653SPeter Holm free(file->name); 212*8a272653SPeter Holm file->name = newname; 213*8a272653SPeter Holm LOCK(renamedfiles); 214*8a272653SPeter Holm STAILQ_INSERT_TAIL(&renamedfiles.list, file, next); 215*8a272653SPeter Holm UNLOCK(renamedfiles); 216*8a272653SPeter Holm SIGNAL(renamedfiles); 217*8a272653SPeter Holm } 218*8a272653SPeter Holm return (NULL); 219*8a272653SPeter Holm} 220*8a272653SPeter Holm 221*8a272653SPeter Holmvoid * 222*8a272653SPeter Holmloop_unlink(void *arg __unused) 223*8a272653SPeter Holm{ 224*8a272653SPeter Holm struct file *file; 225*8a272653SPeter Holm 226*8a272653SPeter Holm#ifdef __NP__ 227*8a272653SPeter Holm pthread_set_name_np(pthread_self(), __func__); 228*8a272653SPeter Holm#endif 229*8a272653SPeter Holm 230*8a272653SPeter Holm while (nunlink < max) { 231*8a272653SPeter Holm LOCK(renamedfiles); 232*8a272653SPeter Holm while (STAILQ_EMPTY(&renamedfiles.list)) { 233*8a272653SPeter Holm WAIT(renamedfiles); 234*8a272653SPeter Holm } 235*8a272653SPeter Holm file = STAILQ_FIRST(&renamedfiles.list); 236*8a272653SPeter Holm STAILQ_REMOVE_HEAD(&renamedfiles.list, next); 237*8a272653SPeter Holm nunlink++; 238*8a272653SPeter Holm UNLOCK(renamedfiles); 239*8a272653SPeter Holm free(file->name); 240*8a272653SPeter Holm free(file); 241*8a272653SPeter Holm } 242*8a272653SPeter Holm return (NULL); 243*8a272653SPeter Holm} 244*8a272653SPeter Holm 245*8a272653SPeter Holmint 246*8a272653SPeter Holmmain(void) 247*8a272653SPeter Holm{ 248*8a272653SPeter Holm int i; 249*8a272653SPeter Holm int rc; 250*8a272653SPeter Holm pthread_t tid[3]; 251*8a272653SPeter Holm 252*8a272653SPeter Holm bench = getenv("bench") != NULL; 253*8a272653SPeter Holm asprintf(&dirname1, "%s.1", "f1"); 254*8a272653SPeter Holm asprintf(&dirname2, "%s.2", "f2"); 255*8a272653SPeter Holm max = MESSAGES; 256*8a272653SPeter Holm 257*8a272653SPeter Holm STAILQ_INIT(&newfiles.list); 258*8a272653SPeter Holm STAILQ_INIT(&renamedfiles.list); 259*8a272653SPeter Holm 260*8a272653SPeter Holm if ((rc = pthread_mutex_init(&newfiles.mtx, NULL)) != 0) 261*8a272653SPeter Holm errc(1, rc, "pthread_mutex_init()"); 262*8a272653SPeter Holm if ((rc = pthread_cond_init(&newfiles.wait, NULL)) != 0) 263*8a272653SPeter Holm errc(1, rc, "pthread_cond_init()"); 264*8a272653SPeter Holm if ((rc = pthread_mutex_init(&renamedfiles.mtx, NULL)) != 0) 265*8a272653SPeter Holm errc(1, rc, "pthread_mutex_init()"); 266*8a272653SPeter Holm if ((rc = pthread_cond_init(&renamedfiles.wait, NULL)) != 0) 267*8a272653SPeter Holm errc(1, rc, "pthread_cond_init()"); 268*8a272653SPeter Holm 269*8a272653SPeter Holm signal(SIGINFO, hand); 270*8a272653SPeter Holm signal(SIGALRM, ahand); 271*8a272653SPeter Holm alarm(300); 272*8a272653SPeter Holm if ((rc = pthread_create(&tid[0], NULL, loop_create, NULL)) != 0) 273*8a272653SPeter Holm errc(1, rc, "pthread_create()"); 274*8a272653SPeter Holm if ((rc = pthread_create(&tid[1], NULL, loop_rename, NULL)) != 0) 275*8a272653SPeter Holm errc(1, rc, "pthread_create()"); 276*8a272653SPeter Holm if ((rc = pthread_create(&tid[2], NULL, loop_unlink, NULL)) != 0) 277*8a272653SPeter Holm errc(1, rc, "pthread_create()"); 278*8a272653SPeter Holm 279*8a272653SPeter Holm for (i = 0; i < 3; i++) { 280*8a272653SPeter Holm if ((rc = pthread_join(tid[i], NULL)) != 0) 281*8a272653SPeter Holm errc(1, rc, "pthread_join(%d)", i); 282*8a272653SPeter Holm } 283*8a272653SPeter Holm 284*8a272653SPeter Holm if ((rc = pthread_mutex_destroy(&newfiles.mtx)) != 0) 285*8a272653SPeter Holm errc(1, rc, "pthread_mutex_destroy(newfiles)"); 286*8a272653SPeter Holm if ((rc = pthread_cond_destroy(&newfiles.wait)) != 0) 287*8a272653SPeter Holm errc(1, rc, "pthread_cond_destroy(newfiles)"); 288*8a272653SPeter Holm if ((rc = pthread_mutex_destroy(&renamedfiles.mtx)) != 0) 289*8a272653SPeter Holm errc(1, rc, "pthread_mutex_destroy(renamedfiles)"); 290*8a272653SPeter Holm if ((rc = pthread_cond_destroy(&renamedfiles.wait)) != 0) 291*8a272653SPeter Holm errc(1, rc, "pthread_cond_destroy(renamedfiles)"); 292*8a272653SPeter Holm free(dirname1); 293*8a272653SPeter Holm free(dirname2); 294*8a272653SPeter Holm 295*8a272653SPeter Holm return (0); 296*8a272653SPeter Holm} 297