1*8a272653SPeter Holm#!/bin/sh 2*8a272653SPeter Holm 3*8a272653SPeter Holm# 4*8a272653SPeter Holm# Copyright (c) 2008-2013 Peter Holm <pho@FreeBSD.org> 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[ `id -u ` -ne 0 ] && echo "Must be root!" && exit 1 30*8a272653SPeter Holm 31*8a272653SPeter Holm. ../default.cfg 32*8a272653SPeter Holm 33*8a272653SPeter Holm# Test scenario by jhb@ 34*8a272653SPeter Holm 35*8a272653SPeter Holm[ -z "$nfs_export" ] && exit 0 36*8a272653SPeter Holmping -c 2 `echo $nfs_export | sed 's/:.*//'` > /dev/null 2>&1 || 37*8a272653SPeter Holm exit 0 38*8a272653SPeter Holm 39*8a272653SPeter Holmodir=`pwd` 40*8a272653SPeter Holmcd /tmp 41*8a272653SPeter Holmsed '1,/^EOF/d' < $odir/$0 > nfsrename.c 42*8a272653SPeter Holmmycc -o nfsrename -Wall nfsrename.c 43*8a272653SPeter Holmrm -f nfsrename.c 44*8a272653SPeter Holmcd $odir 45*8a272653SPeter Holm 46*8a272653SPeter Holmmount | grep "$mntpoint" | grep nfs > /dev/null && umount $mntpoint 47*8a272653SPeter Holmmount -t nfs -o tcp -o retrycnt=3 -o intr,soft -o rw $nfs_export $mntpoint 48*8a272653SPeter Holm 49*8a272653SPeter Holmfor i in `jot 10`; do 50*8a272653SPeter Holm /tmp/nfsrename $mntpoint/nfsrename.$i > /dev/null 2>&1 & 51*8a272653SPeter Holm pids="$pids $!" 52*8a272653SPeter Holmdone 53*8a272653SPeter Holms=0 54*8a272653SPeter Holmfor i in $pids; do 55*8a272653SPeter Holm wait $i 56*8a272653SPeter Holm [ $? -ne 0 ] && s=1 57*8a272653SPeter Holmdone 58*8a272653SPeter Holmpkill nfsrename 59*8a272653SPeter Holmrm -f $mntpoint/nfsrename.* 60*8a272653SPeter Holm 61*8a272653SPeter Holmumount $mntpoint > /dev/null 2>&1 62*8a272653SPeter Holmwhile mount | grep "$mntpoint" | grep -q nfs; do 63*8a272653SPeter Holm umount -f $mntpoint > /dev/null 2>&1 64*8a272653SPeter Holmdone 65*8a272653SPeter Holm 66*8a272653SPeter Holmrm -f /tmp/nfsrename 67*8a272653SPeter Holmexit $s 68*8a272653SPeter Holm 69*8a272653SPeter HolmEOF 70*8a272653SPeter Holm/* 71*8a272653SPeter Holm * Try to expose races with doing renames over NFS that require silly 72*8a272653SPeter Holm * renames. This results in 2 different RENAME RPCs leaving a race 73*8a272653SPeter Holm * window where the file may not exist. It also appears that FreeBSD 74*8a272653SPeter Holm * with shared lookups in NFS can get confused and possibly reference 75*8a272653SPeter Holm * the sillyrenamed file in lookup but the file is deleted by the time 76*8a272653SPeter Holm * open gets to it. 77*8a272653SPeter Holm */ 78*8a272653SPeter Holm 79*8a272653SPeter Holm#include <err.h> 80*8a272653SPeter Holm#include <libgen.h> 81*8a272653SPeter Holm#include <limits.h> 82*8a272653SPeter Holm#include <stdio.h> 83*8a272653SPeter Holm#include <stdlib.h> 84*8a272653SPeter Holm#include <time.h> 85*8a272653SPeter Holm#include <unistd.h> 86*8a272653SPeter Holm 87*8a272653SPeter Holmstatic char *filename; 88*8a272653SPeter Holmstatic char *dir; 89*8a272653SPeter Holm 90*8a272653SPeter Holm#define RUNTIME 720 91*8a272653SPeter Holm 92*8a272653SPeter Holmstatic void 93*8a272653SPeter Holmusage(void) 94*8a272653SPeter Holm{ 95*8a272653SPeter Holm 96*8a272653SPeter Holm fprintf(stderr, "nfsrename: [-n children] file\n"); 97*8a272653SPeter Holm exit(1); 98*8a272653SPeter Holm} 99*8a272653SPeter Holm 100*8a272653SPeter Holmstatic void 101*8a272653SPeter Holmread_file(void) 102*8a272653SPeter Holm{ 103*8a272653SPeter Holm FILE *fp; 104*8a272653SPeter Holm char buffer[4096]; 105*8a272653SPeter Holm 106*8a272653SPeter Holm fp = fopen(filename, "r"); 107*8a272653SPeter Holm if (fp == NULL) { 108*8a272653SPeter Holm return; 109*8a272653SPeter Holm } 110*8a272653SPeter Holm while (!feof(fp)) { 111*8a272653SPeter Holm if (fread(buffer, sizeof(buffer), 1, fp) < sizeof(buffer)) 112*8a272653SPeter Holm break; 113*8a272653SPeter Holm } 114*8a272653SPeter Holm if (ferror(fp)) 115*8a272653SPeter Holm warnx("fread encountered an error"); 116*8a272653SPeter Holm fclose(fp); 117*8a272653SPeter Holm} 118*8a272653SPeter Holm 119*8a272653SPeter Holmstatic void 120*8a272653SPeter Holmwrite_file(void) 121*8a272653SPeter Holm{ 122*8a272653SPeter Holm FILE *fp; 123*8a272653SPeter Holm char path[1024]; 124*8a272653SPeter Holm int fd; 125*8a272653SPeter Holm 126*8a272653SPeter Holm snprintf(path, sizeof(path), "%s/nfsrename.XXXXXX", dir); 127*8a272653SPeter Holm fd = mkstemp(path); 128*8a272653SPeter Holm if (fd < 0) { 129*8a272653SPeter Holm warn("mkstemp"); 130*8a272653SPeter Holm return; 131*8a272653SPeter Holm } 132*8a272653SPeter Holm 133*8a272653SPeter Holm fp = fdopen(fd, "w"); 134*8a272653SPeter Holm if (fp == NULL) { 135*8a272653SPeter Holm warn("fdopen:writer"); 136*8a272653SPeter Holm close(fd); 137*8a272653SPeter Holm unlink(path); 138*8a272653SPeter Holm } 139*8a272653SPeter Holm 140*8a272653SPeter Holm fprintf(fp, "blah blah blah garbage %ld\n", random()); 141*8a272653SPeter Holm fclose(fp); 142*8a272653SPeter Holm if (rename(path, filename) < 0) { 143*8a272653SPeter Holm warn("rename"); 144*8a272653SPeter Holm unlink(path); 145*8a272653SPeter Holm } 146*8a272653SPeter Holm} 147*8a272653SPeter Holm 148*8a272653SPeter Holmstatic void 149*8a272653SPeter Holmrandom_sleep(int base, int slop) 150*8a272653SPeter Holm{ 151*8a272653SPeter Holm long val; 152*8a272653SPeter Holm 153*8a272653SPeter Holm val = random() % slop; 154*8a272653SPeter Holm usleep(base + val); 155*8a272653SPeter Holm} 156*8a272653SPeter Holm 157*8a272653SPeter Holmstatic void 158*8a272653SPeter Holmchild(void) 159*8a272653SPeter Holm{ 160*8a272653SPeter Holm time_t start; 161*8a272653SPeter Holm 162*8a272653SPeter Holm start = time(NULL); 163*8a272653SPeter Holm for (;;) { 164*8a272653SPeter Holm random_sleep(500, 50); 165*8a272653SPeter Holm read_file(); 166*8a272653SPeter Holm if (time(NULL) - start > RUNTIME) 167*8a272653SPeter Holm errx(1, "Timed out"); 168*8a272653SPeter Holm } 169*8a272653SPeter Holm exit(0); 170*8a272653SPeter Holm} 171*8a272653SPeter Holm 172*8a272653SPeter Holmint 173*8a272653SPeter Holmmain(int ac, char **av) 174*8a272653SPeter Holm{ 175*8a272653SPeter Holm time_t start; 176*8a272653SPeter Holm long i, nchild; 177*8a272653SPeter Holm char *cp; 178*8a272653SPeter Holm int ch; 179*8a272653SPeter Holm 180*8a272653SPeter Holm nchild = 1; 181*8a272653SPeter Holm while ((ch = getopt(ac, av, "n:")) != -1) { 182*8a272653SPeter Holm switch (ch) { 183*8a272653SPeter Holm case 'n': 184*8a272653SPeter Holm nchild = strtol(optarg, &cp, 0); 185*8a272653SPeter Holm if (*cp != '\0') 186*8a272653SPeter Holm errx(1, "Invalid count %s", optarg); 187*8a272653SPeter Holm break; 188*8a272653SPeter Holm case '?': 189*8a272653SPeter Holm default: 190*8a272653SPeter Holm usage(); 191*8a272653SPeter Holm } 192*8a272653SPeter Holm } 193*8a272653SPeter Holm ac -= optind; 194*8a272653SPeter Holm av += optind; 195*8a272653SPeter Holm 196*8a272653SPeter Holm if (ac == 0) 197*8a272653SPeter Holm errx(1, "Missing filename"); 198*8a272653SPeter Holm else if (ac > 1) 199*8a272653SPeter Holm errx(1, "Extra arguments"); 200*8a272653SPeter Holm 201*8a272653SPeter Holm filename = av[0]; 202*8a272653SPeter Holm dir = dirname(filename); 203*8a272653SPeter Holm srandomdev(); 204*8a272653SPeter Holm write_file(); 205*8a272653SPeter Holm 206*8a272653SPeter Holm for (i = 0; i < nchild; i++) { 207*8a272653SPeter Holm switch (fork()) { 208*8a272653SPeter Holm case 0: 209*8a272653SPeter Holm child(); 210*8a272653SPeter Holm case -1: 211*8a272653SPeter Holm err(1, "fork"); 212*8a272653SPeter Holm } 213*8a272653SPeter Holm } 214*8a272653SPeter Holm 215*8a272653SPeter Holm start = time(NULL); 216*8a272653SPeter Holm for (i = 0; i < 10000; i++) { 217*8a272653SPeter Holm random_sleep(1500, 1000); 218*8a272653SPeter Holm write_file(); 219*8a272653SPeter Holm if (time(NULL) - start > RUNTIME) 220*8a272653SPeter Holm errx(1, "Timed out"); 221*8a272653SPeter Holm } 222*8a272653SPeter Holm 223*8a272653SPeter Holm return (0); 224*8a272653SPeter Holm} 225