xref: /freebsd/tools/test/stress2/misc/nfsdepth.sh (revision 8a272653d9fbd9fc37691c9aad6a05089b4ecb4d)
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[ `id -u ` -ne 0 ] && echo "Must be root!" && exit 1
30*8a272653SPeter Holm
31*8a272653SPeter Holm. ../default.cfg
32*8a272653SPeter Holm
33*8a272653SPeter Holm# NFS test with deep directories.
34*8a272653SPeter Holm
35*8a272653SPeter Holm# Only issue seen is:
36*8a272653SPeter Holm# nfsdepth: mkdir(d93) l35: Permission denied
37*8a272653SPeter Holm
38*8a272653SPeter Holm[ -z "$nfs_export" ] && exit 0
39*8a272653SPeter Holmping -c 2 `echo $nfs_export | sed 's/:.*//'` > /dev/null 2>&1 ||
40*8a272653SPeter Holm    exit 0
41*8a272653SPeter Holm
42*8a272653SPeter Holmodir=`pwd`
43*8a272653SPeter Holmcd /tmp
44*8a272653SPeter Holmsed '1,/^EOF/d' < $odir/$0 > nfsdepth.c
45*8a272653SPeter Holmmycc -o nfsdepth -Wall -Wextra -g nfsdepth.c || exit 1
46*8a272653SPeter Holmrm -f nfsdepth.c
47*8a272653SPeter Holmcd $odir
48*8a272653SPeter Holm
49*8a272653SPeter Holmmount | grep "$mntpoint" | grep nfs > /dev/null && umount $mntpoint
50*8a272653SPeter Holmmount -t nfs -o tcp -o rw -o soft $nfs_export $mntpoint
51*8a272653SPeter Holm
52*8a272653SPeter Holmwork=$mntpoint/nfsdepth.`jot -rc 8 a z | tr -d '\n'`.dir
53*8a272653SPeter Holmmkdir -p $work
54*8a272653SPeter Holmchmod 777 $work
55*8a272653SPeter Holm
56*8a272653SPeter Holmsu $testuser -c "cd $work; /tmp/nfsdepth"
57*8a272653SPeter Holms=$?
58*8a272653SPeter Holmif [ $s -eq 0 ]; then
59*8a272653SPeter Holm	su $testuser -c "rm -rf $work 2>/dev/null"
60*8a272653SPeter Holm	rm -rf $work
61*8a272653SPeter Holmelse
62*8a272653SPeter Holm	find $work -ls
63*8a272653SPeter Holmfi
64*8a272653SPeter Holm
65*8a272653SPeter Holmumount $mntpoint > /dev/null 2>&1
66*8a272653SPeter Holmwhile mount | grep "$mntpoint" | grep -q nfs; do
67*8a272653SPeter Holm	umount $mntpoint > /dev/null 2>&1
68*8a272653SPeter Holmdone
69*8a272653SPeter Holm
70*8a272653SPeter Holmrm -f /tmp/nfsdepth
71*8a272653SPeter Holmexit $s
72*8a272653SPeter Holm
73*8a272653SPeter HolmEOF
74*8a272653SPeter Holm#include <sys/param.h>
75*8a272653SPeter Holm#include <sys/stat.h>
76*8a272653SPeter Holm#include <sys/wait.h>
77*8a272653SPeter Holm
78*8a272653SPeter Holm#include <err.h>
79*8a272653SPeter Holm#include <errno.h>
80*8a272653SPeter Holm#include <signal.h>
81*8a272653SPeter Holm#include <stdio.h>
82*8a272653SPeter Holm#include <stdlib.h>
83*8a272653SPeter Holm#include <unistd.h>
84*8a272653SPeter Holm
85*8a272653SPeter Holmstatic unsigned long actual, size;
86*8a272653SPeter Holmvolatile int done_testing;
87*8a272653SPeter Holmint fail;
88*8a272653SPeter Holm
89*8a272653SPeter Holm#define DEPTH 200
90*8a272653SPeter Holm#define PARALLEL 8
91*8a272653SPeter Holm#define RUNTIME 180
92*8a272653SPeter Holm
93*8a272653SPeter Holmvoid
94*8a272653SPeter Holmhandler(int s __unused)
95*8a272653SPeter Holm{
96*8a272653SPeter Holm	done_testing = 1;
97*8a272653SPeter Holm}
98*8a272653SPeter Holm
99*8a272653SPeter Holmvoid
100*8a272653SPeter HolmmkDir(char *path, int level) {
101*8a272653SPeter Holm	int n, r;
102*8a272653SPeter Holm	char newPath[MAXPATHLEN + 1];
103*8a272653SPeter Holm
104*8a272653SPeter Holm	n = 0;
105*8a272653SPeter Holm	do {
106*8a272653SPeter Holm		r = mkdir(path, 0770);
107*8a272653SPeter Holm		if (r == -1 && errno == EACCES && n < 10) {
108*8a272653SPeter Holm			warn("mkdir(%s) l%d", path, __LINE__);
109*8a272653SPeter Holm			n++;
110*8a272653SPeter Holm			errno = EAGAIN;
111*8a272653SPeter Holm			usleep(10000);
112*8a272653SPeter Holm		}
113*8a272653SPeter Holm		if (r == -1 && errno == EINTR)
114*8a272653SPeter Holm			(void)rmdir(path);
115*8a272653SPeter Holm	} while (r == -1 && (errno == EINTR || errno == EAGAIN));
116*8a272653SPeter Holm
117*8a272653SPeter Holm	if (r == -1) {
118*8a272653SPeter Holm		warn("mkdir(%s), pid %d, l%d", path, getpid(), __LINE__);
119*8a272653SPeter Holm		fail++;
120*8a272653SPeter Holm	} else {
121*8a272653SPeter Holm		actual++;
122*8a272653SPeter Holm		do {
123*8a272653SPeter Holm			r = chdir (path);
124*8a272653SPeter Holm		if (r == -1 && errno == EACCES && n < 10) {
125*8a272653SPeter Holm			warn("chdir(%s) .%d", path, __LINE__);
126*8a272653SPeter Holm			n++;
127*8a272653SPeter Holm			errno = EAGAIN;
128*8a272653SPeter Holm			usleep(10000);
129*8a272653SPeter Holm		}
130*8a272653SPeter Holm		} while (r == -1 && (errno == EINTR || errno == EAGAIN));
131*8a272653SPeter Holm		if (r == -1)
132*8a272653SPeter Holm			err(1, "chdir(%s), pid %d, l%d", path, getpid(), __LINE__);
133*8a272653SPeter Holm	}
134*8a272653SPeter Holm
135*8a272653SPeter Holm	if (done_testing == 0 && fail == 0 && level < (int)size) {
136*8a272653SPeter Holm		sprintf(newPath,"d%d", level + 1);
137*8a272653SPeter Holm		mkDir(newPath, level + 1);
138*8a272653SPeter Holm	}
139*8a272653SPeter Holm}
140*8a272653SPeter Holm
141*8a272653SPeter Holmvoid
142*8a272653SPeter HolmrmDir(char *path, int level) {
143*8a272653SPeter Holm	int n, r;
144*8a272653SPeter Holm	char newPath[MAXPATHLEN + 1];
145*8a272653SPeter Holm
146*8a272653SPeter Holm	if (level == 0)
147*8a272653SPeter Holm		return;
148*8a272653SPeter Holm
149*8a272653SPeter Holm	if (level < (int)actual) {
150*8a272653SPeter Holm		sprintf(newPath,"d%d", level+1);
151*8a272653SPeter Holm		rmDir(newPath, level+1);
152*8a272653SPeter Holm	}
153*8a272653SPeter Holm	n = 0;
154*8a272653SPeter Holm	do {
155*8a272653SPeter Holm		r = chdir ("..");
156*8a272653SPeter Holm		if (r == -1 && errno == EACCES && n < 10) {
157*8a272653SPeter Holm			warn("chdir(%s) l%d", path, __LINE__);
158*8a272653SPeter Holm			n++;
159*8a272653SPeter Holm			errno = EAGAIN;
160*8a272653SPeter Holm			usleep(10000);
161*8a272653SPeter Holm		}
162*8a272653SPeter Holm	} while (r == -1 && (errno == EINTR || errno == EAGAIN));
163*8a272653SPeter Holm	if (r == -1)
164*8a272653SPeter Holm		err(1, "chdir(%s), pid %d,  l%d", "..", getpid(), __LINE__);
165*8a272653SPeter Holm	n = 0;
166*8a272653SPeter Holm	do {
167*8a272653SPeter Holm		r = rmdir(path);
168*8a272653SPeter Holm		if (r == -1 && errno == EACCES && n < 10) {
169*8a272653SPeter Holm			warn("rmdir(%s) l%d", path, __LINE__);
170*8a272653SPeter Holm			n++;
171*8a272653SPeter Holm			errno = EAGAIN;
172*8a272653SPeter Holm			usleep(10000);
173*8a272653SPeter Holm		}
174*8a272653SPeter Holm	} while (r == -1 && (errno == EINTR || errno == EAGAIN));
175*8a272653SPeter Holm	if (r == -1)
176*8a272653SPeter Holm		err(1, "rmdir(%s), pid %d,  l%d", path, getpid(), __LINE__);
177*8a272653SPeter Holm}
178*8a272653SPeter Holm
179*8a272653SPeter Holmint
180*8a272653SPeter Holmtest2(void)
181*8a272653SPeter Holm{
182*8a272653SPeter Holm	char path[MAXPATHLEN + 1];
183*8a272653SPeter Holm
184*8a272653SPeter Holm	fail = actual = 0;
185*8a272653SPeter Holm	umask(0);
186*8a272653SPeter Holm	sprintf(path,"p%05d.d%d", getpid(), 1);
187*8a272653SPeter Holm	mkDir(path, 1);
188*8a272653SPeter Holm	rmDir(path, 1);
189*8a272653SPeter Holm
190*8a272653SPeter Holm	_exit (fail);
191*8a272653SPeter Holm}
192*8a272653SPeter Holm
193*8a272653SPeter Holmint
194*8a272653SPeter Holmtest(void)
195*8a272653SPeter Holm{
196*8a272653SPeter Holm	pid_t pid;
197*8a272653SPeter Holm	time_t start;
198*8a272653SPeter Holm	int status;
199*8a272653SPeter Holm
200*8a272653SPeter Holm	size = (arc4random() % DEPTH) + 1;
201*8a272653SPeter Holm
202*8a272653SPeter Holm	signal(SIGHUP, handler);
203*8a272653SPeter Holm	start = time(NULL);
204*8a272653SPeter Holm	while (time(NULL) - start < RUNTIME && fail == 0) {
205*8a272653SPeter Holm		if ((pid = fork()) == 0) {
206*8a272653SPeter Holm			done_testing = 0;
207*8a272653SPeter Holm			test2();
208*8a272653SPeter Holm		}
209*8a272653SPeter Holm
210*8a272653SPeter Holm		status = 0;
211*8a272653SPeter Holm		while (wait4(pid, &status, WNOHANG, NULL) != pid) {
212*8a272653SPeter Holm			if (kill(pid, SIGHUP) == -1)
213*8a272653SPeter Holm				err(1, "kill(%d)", pid);
214*8a272653SPeter Holm			usleep(100000 + (arc4random() % 10000));
215*8a272653SPeter Holm		}
216*8a272653SPeter Holm		if (status != 0)
217*8a272653SPeter Holm			fail++;
218*8a272653SPeter Holm	}
219*8a272653SPeter Holm
220*8a272653SPeter Holm	_exit (status != 0);
221*8a272653SPeter Holm}
222*8a272653SPeter Holm
223*8a272653SPeter Holmint
224*8a272653SPeter Holmmain(void)
225*8a272653SPeter Holm{
226*8a272653SPeter Holm	int e, i, pids[PARALLEL], status;
227*8a272653SPeter Holm
228*8a272653SPeter Holm	e = 0;
229*8a272653SPeter Holm	for (i = 0; i < PARALLEL; i++) {
230*8a272653SPeter Holm		if ((pids[i] = fork()) == 0)
231*8a272653SPeter Holm			test();
232*8a272653SPeter Holm	}
233*8a272653SPeter Holm	for (i = 0; i < PARALLEL; i++) {
234*8a272653SPeter Holm		waitpid(pids[i], &status, 0);
235*8a272653SPeter Holm		e += status == 0 ? 0 : 1;
236*8a272653SPeter Holm	}
237*8a272653SPeter Holm
238*8a272653SPeter Holm	return (e);
239*8a272653SPeter Holm}
240