1*8a272653SPeter Holm#!/bin/sh 2*8a272653SPeter Holm 3*8a272653SPeter Holm# 4*8a272653SPeter Holm# Copyright (c) 2016 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# Parallel write test. 30*8a272653SPeter Holm 31*8a272653SPeter Holm# fsync: giving up on dirty 32*8a272653SPeter Holm# 0xc9172168: tag devfs, type VCHR 33*8a272653SPeter Holm# usecount 1, writecount 0, refcount 31 mountedhere 0xc96bd300 34*8a272653SPeter Holm# flags (VI_ACTIVE) 35*8a272653SPeter Holm# v_object 0xc96e55a0 ref 0 pages 983 cleanbuf 27 dirtybuf 2 36*8a272653SPeter Holm# lock type devfs: EXCL by thread 0xcbedf340 (pid 58752, write, tid 100254) 37*8a272653SPeter Holm# #0 0xc0c23f33 at __lockmgr_args+0xae3 38*8a272653SPeter Holm# #1 0xc0cff943 at vop_stdlock+0x53 39*8a272653SPeter Holm# #2 0xc12027c8 at VOP_LOCK1_APV+0x118 40*8a272653SPeter Holm# #3 0xc0d2400a at _vn_lock+0xba 41*8a272653SPeter Holm# #4 0xc0f3288b at ffs_sync+0x34b 42*8a272653SPeter Holm# #5 0xc0f16cc5 at softdep_ast_cleanup_proc+0x205 43*8a272653SPeter Holm# #6 0xc0ca3ac7 at userret+0x37 44*8a272653SPeter Holm# #7 0xc11d021e at syscall+0x50e 45*8a272653SPeter Holm# #8 0xc11bae3f at Xint0x80_syscall+0x2f 46*8a272653SPeter Holm# dev label/tmp 47*8a272653SPeter Holm 48*8a272653SPeter Holm# Deadlock seen: 49*8a272653SPeter Holm# https://people.freebsd.org/~pho/stress/log/write.txt 50*8a272653SPeter Holm 51*8a272653SPeter Holm. ../default.cfg 52*8a272653SPeter Holm 53*8a272653SPeter Holmdir=/tmp 54*8a272653SPeter Holmodir=`pwd` 55*8a272653SPeter Holmcd $dir 56*8a272653SPeter Holmsed '1,/^EOF/d' < $odir/$0 > $dir/write.c 57*8a272653SPeter Holmmycc -o write -Wall -Wextra -O2 -g write.c || exit 1 58*8a272653SPeter Holmrm -f write.c 59*8a272653SPeter Holmcd $odir 60*8a272653SPeter Holm 61*8a272653SPeter Holmneed=$((25 * 1024)) 62*8a272653SPeter Holm[ `df -k $(dirname $diskimage) | tail -1 | awk '{print int($4 / 1024)}'` \ 63*8a272653SPeter Holm -lt $need ] && 64*8a272653SPeter Holm printf "Need %d MB on %s.\n" $need `dirname $diskimage` && exit 0 65*8a272653SPeter Holmwd=`dirname $diskimage` 66*8a272653SPeter Holmwd="$wd/write.dir" 67*8a272653SPeter Holmrm -rf $wd 68*8a272653SPeter Holmmkdir -p $wd 69*8a272653SPeter Holm 70*8a272653SPeter Holm(cd $wd; /tmp/write) 71*8a272653SPeter Holms=$? 72*8a272653SPeter Holm 73*8a272653SPeter Holmrm -rf /tmp/write $wd 74*8a272653SPeter Holmexit $s 75*8a272653SPeter Holm 76*8a272653SPeter HolmEOF 77*8a272653SPeter Holm#include <sys/param.h> 78*8a272653SPeter Holm#include <sys/mman.h> 79*8a272653SPeter Holm#include <sys/stat.h> 80*8a272653SPeter Holm#include <sys/wait.h> 81*8a272653SPeter Holm 82*8a272653SPeter Holm#include <machine/atomic.h> 83*8a272653SPeter Holm 84*8a272653SPeter Holm#include <err.h> 85*8a272653SPeter Holm#include <errno.h> 86*8a272653SPeter Holm#include <fcntl.h> 87*8a272653SPeter Holm#include <stdio.h> 88*8a272653SPeter Holm#include <stdlib.h> 89*8a272653SPeter Holm#include <time.h> 90*8a272653SPeter Holm#include <unistd.h> 91*8a272653SPeter Holm 92*8a272653SPeter Holm#define DONE 1 93*8a272653SPeter Holm#define MAXBLK (2 * 1024 * 1024) 94*8a272653SPeter Holm#define MAXPROC 32 95*8a272653SPeter Holm#define MAXSIZ (9LL * 1024 * 1024 *1024) 96*8a272653SPeter Holm#define RUNTIME (15 * 60) 97*8a272653SPeter Holm#define SYNC 0 98*8a272653SPeter Holm 99*8a272653SPeter Holmvolatile u_int *share; 100*8a272653SPeter Holmint parallel; 101*8a272653SPeter Holm 102*8a272653SPeter Holmstruct typ { 103*8a272653SPeter Holm off_t blocksize; 104*8a272653SPeter Holm off_t blocks; 105*8a272653SPeter Holm int sequential; 106*8a272653SPeter Holm int mindelay; 107*8a272653SPeter Holm int maxdelay; 108*8a272653SPeter Holm} t[MAXPROC]; 109*8a272653SPeter Holm 110*8a272653SPeter Holmint 111*8a272653SPeter Holmrnd(int mi, int ma) 112*8a272653SPeter Holm{ 113*8a272653SPeter Holm return (arc4random() % (ma - mi + 1) + mi); 114*8a272653SPeter Holm} 115*8a272653SPeter Holm 116*8a272653SPeter Holmvoid 117*8a272653SPeter Holmtest(int indx, int num) 118*8a272653SPeter Holm{ 119*8a272653SPeter Holm ssize_t i, r; 120*8a272653SPeter Holm time_t start; 121*8a272653SPeter Holm int fd, n; 122*8a272653SPeter Holm char *buf, file[80]; 123*8a272653SPeter Holm 124*8a272653SPeter Holm atomic_add_int(&share[SYNC], 1); 125*8a272653SPeter Holm while (share[SYNC] != (unsigned int)parallel) 126*8a272653SPeter Holm ; 127*8a272653SPeter Holm 128*8a272653SPeter Holm if ((buf = malloc(t[indx].blocksize)) == NULL) 129*8a272653SPeter Holm err(1, "malloc"); 130*8a272653SPeter Holm snprintf(file, sizeof(file), "file.%06d.%06d", indx, num); 131*8a272653SPeter Holm n = 0; 132*8a272653SPeter Holm start = time(NULL); 133*8a272653SPeter Holm while (share[DONE] != (unsigned int)parallel) { 134*8a272653SPeter Holm setproctitle("test(%d) num %d, n %d", indx, num, n); 135*8a272653SPeter Holm if ((fd = open(file, O_RDWR | O_CREAT | O_TRUNC, DEFFILEMODE)) 136*8a272653SPeter Holm == -1) 137*8a272653SPeter Holm err(1, "open(%s)", file); 138*8a272653SPeter Holm 139*8a272653SPeter Holm for (i = 0; i < t[indx].blocks; i++) { 140*8a272653SPeter Holm if (t[indx].sequential == 0) 141*8a272653SPeter Holm if (lseek(fd, 2LL << (arc4random() % 18), 142*8a272653SPeter Holm SEEK_SET) == -1) 143*8a272653SPeter Holm err(1, "lseek"); 144*8a272653SPeter Holm if ((r = write(fd, buf, t[indx].blocksize)) != 145*8a272653SPeter Holm t[indx].blocksize) { 146*8a272653SPeter Holm warn("write returned %zd\n", r); 147*8a272653SPeter Holm goto done; 148*8a272653SPeter Holm } 149*8a272653SPeter Holm usleep(rnd(t[indx].mindelay, t[indx].maxdelay)); 150*8a272653SPeter Holm } 151*8a272653SPeter Holm 152*8a272653SPeter Holm close(fd); 153*8a272653SPeter Holm if (n++ == 0) 154*8a272653SPeter Holm atomic_add_int(&share[DONE], 1); 155*8a272653SPeter Holm if (time(NULL) - start >= RUNTIME / 4) { 156*8a272653SPeter Holm#if defined(DEBUG) 157*8a272653SPeter Holm fprintf(stderr, "test(%d), %d Timed out\n", indx, num); 158*8a272653SPeter Holm#endif 159*8a272653SPeter Holm break; 160*8a272653SPeter Holm } 161*8a272653SPeter Holm } 162*8a272653SPeter Holmdone: 163*8a272653SPeter Holm if (n++ == 0) 164*8a272653SPeter Holm atomic_add_int(&share[DONE], 1); 165*8a272653SPeter Holm 166*8a272653SPeter Holm _exit(0); 167*8a272653SPeter Holm} 168*8a272653SPeter Holm 169*8a272653SPeter Holmvoid 170*8a272653SPeter Holmsetup(void) 171*8a272653SPeter Holm{ 172*8a272653SPeter Holm int i; 173*8a272653SPeter Holm 174*8a272653SPeter Holm parallel = arc4random() % MAXPROC + 1; 175*8a272653SPeter Holm for (i = 0; i < parallel; i++) { 176*8a272653SPeter Holm if (arc4random() % 100 < 10) 177*8a272653SPeter Holm t[i].blocksize = (arc4random() + 1) % MAXBLK; 178*8a272653SPeter Holm else 179*8a272653SPeter Holm t[i].blocksize = 2 << (arc4random() % 20); 180*8a272653SPeter Holm t[i].sequential = arc4random() % 2; 181*8a272653SPeter Holm t[i].mindelay = arc4random() % 50; 182*8a272653SPeter Holm t[i].maxdelay = t[i].mindelay + arc4random() % 100; 183*8a272653SPeter Holm t[i].blocks = 2LL << (arc4random() % 18); 184*8a272653SPeter Holm if (t[i].blocks * t[i].blocksize > MAXSIZ) 185*8a272653SPeter Holm t[i].blocks = MAXSIZ / t[i].blocksize; 186*8a272653SPeter Holm#if defined(DEBUG) 187*8a272653SPeter Holm fprintf(stderr, "%3d: blocksize %7lld, sequential %d, " 188*8a272653SPeter Holm "mindelay %3d, maxdelay %3d, blocks %6lld, size %4lld MB\n", 189*8a272653SPeter Holm i, (long long)t[i].blocksize, t[i].sequential, t[i].mindelay, 190*8a272653SPeter Holm t[i].maxdelay, (long long)t[i].blocks, 191*8a272653SPeter Holm (long long)t[i].blocksize * t[i].blocks / 1024 / 1024); 192*8a272653SPeter Holm#endif 193*8a272653SPeter Holm } 194*8a272653SPeter Holm} 195*8a272653SPeter Holm 196*8a272653SPeter Holmint 197*8a272653SPeter Holmmain(void) 198*8a272653SPeter Holm{ 199*8a272653SPeter Holm size_t len; 200*8a272653SPeter Holm time_t start; 201*8a272653SPeter Holm int e, i, n, *pids, status; 202*8a272653SPeter Holm 203*8a272653SPeter Holm e = 0; 204*8a272653SPeter Holm len = PAGE_SIZE; 205*8a272653SPeter Holm if ((share = mmap(NULL, len, PROT_READ | PROT_WRITE, 206*8a272653SPeter Holm MAP_ANON | MAP_SHARED, -1, 0)) == MAP_FAILED) 207*8a272653SPeter Holm err(1, "mmap"); 208*8a272653SPeter Holm 209*8a272653SPeter Holm n = 0; 210*8a272653SPeter Holm start = time(NULL); 211*8a272653SPeter Holm while ((time(NULL) - start) < RUNTIME && e == 0) { 212*8a272653SPeter Holm setup(); 213*8a272653SPeter Holm 214*8a272653SPeter Holm pids = malloc(sizeof(pid_t) * parallel); 215*8a272653SPeter Holm share[SYNC] = share[DONE] = 0; 216*8a272653SPeter Holm for (i = 0; i < parallel; i++) { 217*8a272653SPeter Holm if ((pids[i] = fork()) == 0) 218*8a272653SPeter Holm test(i, n); 219*8a272653SPeter Holm } 220*8a272653SPeter Holm for (i = 0; i < parallel; i++) { 221*8a272653SPeter Holm if (waitpid(pids[i], &status, 0) != pids[i]) 222*8a272653SPeter Holm err(1, "waitpid %d", pids[i]); 223*8a272653SPeter Holm e += status == 0 ? 0 : 1; 224*8a272653SPeter Holm } 225*8a272653SPeter Holm n++; 226*8a272653SPeter Holm n = n % 10; 227*8a272653SPeter Holm free(pids); 228*8a272653SPeter Holm } 229*8a272653SPeter Holm 230*8a272653SPeter Holm return (e); 231*8a272653SPeter Holm} 232