1*8a272653SPeter Holm#!/bin/sh 2*8a272653SPeter Holm 3*8a272653SPeter Holm# 4*8a272653SPeter Holm# Copyright (c) 2017 Dell EMC Isilon 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# mknod(2) regression test 30*8a272653SPeter Holm# "panic: ffs_write: type 0xca2b02d0 8 (0,3)" seen. 31*8a272653SPeter Holm# Reported by: Dmitry Vyukov <dvyukov@google.com> 32*8a272653SPeter Holm# Fixed by r324853 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/mknod.c 41*8a272653SPeter Holmmycc -o mknod -Wall -Wextra -O0 -g mknod.c || exit 1 42*8a272653SPeter Holmrm -f mknod.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 Holmbsdlabel -w md$mdstart auto 50*8a272653SPeter Holmnewfs $newfs_flags md${mdstart}$part > /dev/null 51*8a272653SPeter Holmmount /dev/md${mdstart}$part $mntpoint 52*8a272653SPeter Holmset +e 53*8a272653SPeter Holm 54*8a272653SPeter Holmcd $mntpoint 55*8a272653SPeter Holm$dir/mknod $mntpoint 56*8a272653SPeter Holms=$? 57*8a272653SPeter Holm[ -f mknod.core -a $s -eq 0 ] && 58*8a272653SPeter Holm { ls -l mknod.core; mv mknod.core /tmp; s=1; } 59*8a272653SPeter Holmcd $odir 60*8a272653SPeter Holm 61*8a272653SPeter Holmfor i in `jot 6`; do 62*8a272653SPeter Holm mount | grep -q "on $mntpoint " || break 63*8a272653SPeter Holm umount $mntpoint && break || sleep 10 64*8a272653SPeter Holmdone 65*8a272653SPeter Holm[ $i -eq 6 ] && exit 1 66*8a272653SPeter Holmmdconfig -d -u $mdstart 67*8a272653SPeter Holmrm -rf $dir/mknod 68*8a272653SPeter Holmexit $s 69*8a272653SPeter Holm 70*8a272653SPeter HolmEOF 71*8a272653SPeter Holm#include <sys/param.h> 72*8a272653SPeter Holm#include <sys/mman.h> 73*8a272653SPeter Holm#include <sys/stat.h> 74*8a272653SPeter Holm#include <sys/wait.h> 75*8a272653SPeter Holm 76*8a272653SPeter Holm#include <machine/atomic.h> 77*8a272653SPeter Holm 78*8a272653SPeter Holm#include <err.h> 79*8a272653SPeter Holm#include <errno.h> 80*8a272653SPeter Holm#include <fcntl.h> 81*8a272653SPeter Holm#include <stdio.h> 82*8a272653SPeter Holm#include <stdlib.h> 83*8a272653SPeter Holm#include <time.h> 84*8a272653SPeter Holm#include <unistd.h> 85*8a272653SPeter Holm 86*8a272653SPeter Holmstatic volatile u_int *share; 87*8a272653SPeter Holmstatic char *mp; 88*8a272653SPeter Holm 89*8a272653SPeter Holm#define PARALLEL 4 90*8a272653SPeter Holm#define RUNTIME (1 * 60) 91*8a272653SPeter Holm#define SYNC 0 92*8a272653SPeter Holm 93*8a272653SPeter Holmstatic void 94*8a272653SPeter Holmtest(void) 95*8a272653SPeter Holm{ 96*8a272653SPeter Holm dev_t dev; 97*8a272653SPeter Holm mode_t mode; 98*8a272653SPeter Holm time_t start; 99*8a272653SPeter Holm int fd, n, r; 100*8a272653SPeter Holm char path[128]; 101*8a272653SPeter Holm 102*8a272653SPeter Holm atomic_add_int(&share[SYNC], 1); 103*8a272653SPeter Holm while (share[SYNC] != PARALLEL) 104*8a272653SPeter Holm ; 105*8a272653SPeter Holm n = 0; 106*8a272653SPeter Holm snprintf(path, sizeof(path), "%s/node.%06d.%d", mp, getpid(), n); 107*8a272653SPeter Holm start = time(NULL); 108*8a272653SPeter Holm while ((time(NULL) - start) < RUNTIME) { 109*8a272653SPeter Holm dev = makedev(arc4random(), arc4random()); 110*8a272653SPeter Holm mode = arc4random() % 0x10000; 111*8a272653SPeter Holm r = mknod(path, mode, dev); 112*8a272653SPeter Holm if (r == 0) { 113*8a272653SPeter Holm if ((fd = open(path, O_RDWR)) != -1) { 114*8a272653SPeter Holm write(fd, "x", 1); 115*8a272653SPeter Holm close(fd); 116*8a272653SPeter Holm } 117*8a272653SPeter Holm unlink(path); 118*8a272653SPeter Holm n++; 119*8a272653SPeter Holm snprintf(path, sizeof(path), "%s/node.%06d.%d", mp, 120*8a272653SPeter Holm getpid(), n); 121*8a272653SPeter Holm } 122*8a272653SPeter Holm } 123*8a272653SPeter Holm 124*8a272653SPeter Holm _exit(0); 125*8a272653SPeter Holm} 126*8a272653SPeter Holm 127*8a272653SPeter Holmint 128*8a272653SPeter Holmmain(int argc, char *argv[]) 129*8a272653SPeter Holm{ 130*8a272653SPeter Holm pid_t pids[PARALLEL]; 131*8a272653SPeter Holm size_t len; 132*8a272653SPeter Holm int e, i, status; 133*8a272653SPeter Holm 134*8a272653SPeter Holm if (argc != 2) 135*8a272653SPeter Holm return (1); 136*8a272653SPeter Holm mp = argv[1]; 137*8a272653SPeter Holm e = 0; 138*8a272653SPeter Holm len = PAGE_SIZE; 139*8a272653SPeter Holm if ((share = mmap(NULL, len, PROT_READ | PROT_WRITE, 140*8a272653SPeter Holm MAP_ANON | MAP_SHARED, -1, 0)) == MAP_FAILED) 141*8a272653SPeter Holm err(1, "mmap"); 142*8a272653SPeter Holm 143*8a272653SPeter Holm share[SYNC] = 0; 144*8a272653SPeter Holm for (i = 0; i < PARALLEL; i++) { 145*8a272653SPeter Holm if ((pids[i] = fork()) == 0) 146*8a272653SPeter Holm test(); 147*8a272653SPeter Holm if (pids[i] == -1) 148*8a272653SPeter Holm err(1, "fork()"); 149*8a272653SPeter Holm } 150*8a272653SPeter Holm for (i = 0; i < PARALLEL; i++) { 151*8a272653SPeter Holm if (waitpid(pids[i], &status, 0) == -1) 152*8a272653SPeter Holm err(1, "waitpid(%d)", pids[i]); 153*8a272653SPeter Holm if (status != 0) { 154*8a272653SPeter Holm if (WIFSIGNALED(status)) 155*8a272653SPeter Holm fprintf(stderr, 156*8a272653SPeter Holm "pid %d exit signal %d\n", 157*8a272653SPeter Holm pids[i], WTERMSIG(status)); 158*8a272653SPeter Holm } 159*8a272653SPeter Holm e += status == 0 ? 0 : 1; 160*8a272653SPeter Holm } 161*8a272653SPeter Holm 162*8a272653SPeter Holm return (e); 163*8a272653SPeter Holm} 164