1*8a272653SPeter Holm#!/bin/sh 2*8a272653SPeter Holm 3*8a272653SPeter Holm# 4*8a272653SPeter Holm# SPDX-License-Identifier: BSD-2-Clause-FreeBSD 5*8a272653SPeter Holm# 6*8a272653SPeter Holm# Copyright (c) 2019 Dell EMC Isilon 7*8a272653SPeter Holm# 8*8a272653SPeter Holm# Redistribution and use in source and binary forms, with or without 9*8a272653SPeter Holm# modification, are permitted provided that the following conditions 10*8a272653SPeter Holm# are met: 11*8a272653SPeter Holm# 1. Redistributions of source code must retain the above copyright 12*8a272653SPeter Holm# notice, this list of conditions and the following disclaimer. 13*8a272653SPeter Holm# 2. Redistributions in binary form must reproduce the above copyright 14*8a272653SPeter Holm# notice, this list of conditions and the following disclaimer in the 15*8a272653SPeter Holm# documentation and/or other materials provided with the distribution. 16*8a272653SPeter Holm# 17*8a272653SPeter Holm# THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 18*8a272653SPeter Holm# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19*8a272653SPeter Holm# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20*8a272653SPeter Holm# ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 21*8a272653SPeter Holm# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22*8a272653SPeter Holm# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23*8a272653SPeter Holm# OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24*8a272653SPeter Holm# HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25*8a272653SPeter Holm# LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26*8a272653SPeter Holm# OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27*8a272653SPeter Holm# SUCH DAMAGE. 28*8a272653SPeter Holm# 29*8a272653SPeter Holm 30*8a272653SPeter Holm# fcntl(2) fuzz 31*8a272653SPeter Holm# "umount: unmount of /mnt failed: Device busy" seen: 32*8a272653SPeter Holm# https://people.freebsd.org/~pho/stress/log/fcntl2.txt 33*8a272653SPeter Holm 34*8a272653SPeter Holm. ../default.cfg 35*8a272653SPeter Holm[ `id -u` -ne 0 ] && echo "Must be root!" && exit 1 36*8a272653SPeter Holm 37*8a272653SPeter Holmdir=/tmp 38*8a272653SPeter Holmodir=`pwd` 39*8a272653SPeter Holmcd $dir 40*8a272653SPeter Holmsed '1,/^EOF/d' < $odir/$0 > $dir/fcntl2.c 41*8a272653SPeter Holmmycc -o fcntl2 -Wall -Wextra -O0 -g fcntl2.c || exit 1 42*8a272653SPeter Holmrm -f fcntl2.c 43*8a272653SPeter Holmcd $odir 44*8a272653SPeter Holm 45*8a272653SPeter Holmset -e 46*8a272653SPeter Holmmount | grep "on $mntpoint " | grep -q /dev/md && umount -f $mntpoint 47*8a272653SPeter Holm[ -c /dev/md$mdstart ] && mdconfig -d -u $mdstart 48*8a272653SPeter Holmmdconfig -a -t swap -s 2g -u $mdstart 49*8a272653SPeter Holmnewfs $newfs_flags md$mdstart > /dev/null 50*8a272653SPeter Holmmount /dev/md$mdstart $mntpoint 51*8a272653SPeter Holmset +e 52*8a272653SPeter Holm 53*8a272653SPeter Holm(cd $odir/../testcases/swap; ./swap -t 3m -i 20) & 54*8a272653SPeter Holmcd $mntpoint 55*8a272653SPeter Holmlimits -n 10000 $dir/fcntl2 56*8a272653SPeter Holms=$? 57*8a272653SPeter Holm[ -f fcntl2.core -a $s -eq 0 ] && 58*8a272653SPeter Holm { ls -l fcntl2.core; mv fcntl2.core $dir; s=1; } 59*8a272653SPeter Holmcd $odir 60*8a272653SPeter Holmwhile pkill swap; do :; done 61*8a272653SPeter Holm 62*8a272653SPeter Holmfor i in `jot 6`; do 63*8a272653SPeter Holm mount | grep -q "on $mntpoint " || break 64*8a272653SPeter Holm umount $mntpoint && break || sleep 10 65*8a272653SPeter Holm [ $i -eq 6 ] && 66*8a272653SPeter Holm { echo FATAL; fstat -mf $mntpoint; exit 1; } 67*8a272653SPeter Holmdone 68*8a272653SPeter Holmmdconfig -d -u $mdstart 69*8a272653SPeter Holmrm -rf $dir/fcntl2 70*8a272653SPeter Holmexit $s 71*8a272653SPeter Holm 72*8a272653SPeter HolmEOF 73*8a272653SPeter Holm#include <sys/param.h> 74*8a272653SPeter Holm#include <sys/mman.h> 75*8a272653SPeter Holm#include <sys/stat.h> 76*8a272653SPeter Holm#include <sys/wait.h> 77*8a272653SPeter Holm 78*8a272653SPeter Holm#include <machine/atomic.h> 79*8a272653SPeter Holm 80*8a272653SPeter Holm#include <err.h> 81*8a272653SPeter Holm#include <errno.h> 82*8a272653SPeter Holm#include <fcntl.h> 83*8a272653SPeter Holm#include <stdio.h> 84*8a272653SPeter Holm#include <stdlib.h> 85*8a272653SPeter Holm#include <time.h> 86*8a272653SPeter Holm#include <unistd.h> 87*8a272653SPeter Holm 88*8a272653SPeter Holmstatic volatile u_int *share; 89*8a272653SPeter Holm 90*8a272653SPeter Holm#define PARALLEL 64 91*8a272653SPeter Holm#define RUNTIME (3 * 60) 92*8a272653SPeter Holm#define SYNC 0 93*8a272653SPeter Holm 94*8a272653SPeter Holm#define N (128 * 1024 / (int)sizeof(u_int32_t)) 95*8a272653SPeter Holmstatic u_int32_t r[N]; 96*8a272653SPeter Holm 97*8a272653SPeter Holmstatic unsigned long 98*8a272653SPeter Holmmakearg(void) 99*8a272653SPeter Holm{ 100*8a272653SPeter Holm unsigned long val; 101*8a272653SPeter Holm unsigned int i; 102*8a272653SPeter Holm 103*8a272653SPeter Holm val = arc4random(); 104*8a272653SPeter Holm i = arc4random() % 100; 105*8a272653SPeter Holm if (i < 20) 106*8a272653SPeter Holm val = val & 0xff; 107*8a272653SPeter Holm if (i >= 20 && i < 40) 108*8a272653SPeter Holm val = val & 0xffff; 109*8a272653SPeter Holm if (i >= 40 && i < 60) 110*8a272653SPeter Holm val = (unsigned long)(r) | (val & 0xffff); 111*8a272653SPeter Holm#if defined(__LP64__) 112*8a272653SPeter Holm if (i >= 60) { 113*8a272653SPeter Holm val = (val << 32) | arc4random(); 114*8a272653SPeter Holm if (i > 80) 115*8a272653SPeter Holm val = val & 0x00007fffffffffffUL; 116*8a272653SPeter Holm } 117*8a272653SPeter Holm#endif 118*8a272653SPeter Holm 119*8a272653SPeter Holm return (val); 120*8a272653SPeter Holm} 121*8a272653SPeter Holmstatic void 122*8a272653SPeter Holmtest(void) 123*8a272653SPeter Holm{ 124*8a272653SPeter Holm time_t start; 125*8a272653SPeter Holm unsigned long arg3; 126*8a272653SPeter Holm int cmd, fd, i, n, success; 127*8a272653SPeter Holm char file[80]; 128*8a272653SPeter Holm 129*8a272653SPeter Holm atomic_add_int(&share[SYNC], 1); 130*8a272653SPeter Holm while (share[SYNC] != PARALLEL) 131*8a272653SPeter Holm ; 132*8a272653SPeter Holm 133*8a272653SPeter Holm success = 0; 134*8a272653SPeter Holm snprintf(file, sizeof(file), "file.%d", getpid()); 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 n = arc4random() % 100 + 1; 139*8a272653SPeter Holm for (i = 0; i < n; i++) 140*8a272653SPeter Holm if (write(fd, file, sizeof(file)) != sizeof(file)) 141*8a272653SPeter Holm err(1, "write()"); 142*8a272653SPeter Holm start = time(NULL); 143*8a272653SPeter Holm while (time(NULL) - start < 60) { 144*8a272653SPeter Holm cmd = arc4random() % 20; 145*8a272653SPeter Holm arg3 = makearg(); 146*8a272653SPeter Holm alarm(20); 147*8a272653SPeter Holm if (fcntl(fd, cmd, arg3) != -1) 148*8a272653SPeter Holm success++; 149*8a272653SPeter Holm alarm(0); 150*8a272653SPeter Holm } 151*8a272653SPeter Holm close(fd); 152*8a272653SPeter Holm unlink(file); 153*8a272653SPeter Holm 154*8a272653SPeter Holm _exit(0); 155*8a272653SPeter Holm} 156*8a272653SPeter Holm 157*8a272653SPeter Holmint 158*8a272653SPeter Holmmain(void) 159*8a272653SPeter Holm{ 160*8a272653SPeter Holm pid_t pids[PARALLEL]; 161*8a272653SPeter Holm size_t len; 162*8a272653SPeter Holm time_t start; 163*8a272653SPeter Holm int i, status; 164*8a272653SPeter Holm 165*8a272653SPeter Holm len = PAGE_SIZE; 166*8a272653SPeter Holm if ((share = mmap(NULL, len, PROT_READ | PROT_WRITE, 167*8a272653SPeter Holm MAP_ANON | MAP_SHARED, -1, 0)) == MAP_FAILED) 168*8a272653SPeter Holm err(1, "mmap"); 169*8a272653SPeter Holm 170*8a272653SPeter Holm start = time(NULL); 171*8a272653SPeter Holm while ((time(NULL) - start) < RUNTIME) { 172*8a272653SPeter Holm for (i = 0; i < N; i++) 173*8a272653SPeter Holm r[i] = arc4random(); 174*8a272653SPeter Holm share[SYNC] = 0; 175*8a272653SPeter Holm for (i = 0; i < PARALLEL; i++) { 176*8a272653SPeter Holm if ((pids[i] = fork()) == 0) 177*8a272653SPeter Holm test(); 178*8a272653SPeter Holm if (pids[i] == -1) 179*8a272653SPeter Holm err(1, "fork()"); 180*8a272653SPeter Holm } 181*8a272653SPeter Holm for (i = 0; i < PARALLEL; i++) { 182*8a272653SPeter Holm if (waitpid(pids[i], &status, 0) == -1) 183*8a272653SPeter Holm err(1, "waitpid(%d)", pids[i]); 184*8a272653SPeter Holm } 185*8a272653SPeter Holm } 186*8a272653SPeter Holm 187*8a272653SPeter Holm return (0); 188*8a272653SPeter Holm} 189