1*8a272653SPeter Holm /*-
2*8a272653SPeter Holm * Copyright (c) 2008 Peter Holm <pho@FreeBSD.org>
3*8a272653SPeter Holm * All rights reserved.
4*8a272653SPeter Holm *
5*8a272653SPeter Holm * Redistribution and use in source and binary forms, with or without
6*8a272653SPeter Holm * modification, are permitted provided that the following conditions
7*8a272653SPeter Holm * are met:
8*8a272653SPeter Holm * 1. Redistributions of source code must retain the above copyright
9*8a272653SPeter Holm * notice, this list of conditions and the following disclaimer.
10*8a272653SPeter Holm * 2. Redistributions in binary form must reproduce the above copyright
11*8a272653SPeter Holm * notice, this list of conditions and the following disclaimer in the
12*8a272653SPeter Holm * documentation and/or other materials provided with the distribution.
13*8a272653SPeter Holm *
14*8a272653SPeter Holm * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15*8a272653SPeter Holm * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16*8a272653SPeter Holm * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17*8a272653SPeter Holm * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18*8a272653SPeter Holm * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19*8a272653SPeter Holm * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20*8a272653SPeter Holm * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21*8a272653SPeter Holm * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22*8a272653SPeter Holm * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23*8a272653SPeter Holm * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24*8a272653SPeter Holm * SUCH DAMAGE.
25*8a272653SPeter Holm *
26*8a272653SPeter Holm */
27*8a272653SPeter Holm
28*8a272653SPeter Holm /* Write and check read a file */
29*8a272653SPeter Holm
30*8a272653SPeter Holm #include <sys/param.h>
31*8a272653SPeter Holm #include <sys/stat.h>
32*8a272653SPeter Holm #include <err.h>
33*8a272653SPeter Holm #include <fcntl.h>
34*8a272653SPeter Holm #include <stdio.h>
35*8a272653SPeter Holm #include <stdlib.h>
36*8a272653SPeter Holm #include <unistd.h>
37*8a272653SPeter Holm
38*8a272653SPeter Holm #include "stress.h"
39*8a272653SPeter Holm
40*8a272653SPeter Holm static char path[128];
41*8a272653SPeter Holm static int starting_dir;
42*8a272653SPeter Holm static unsigned long size;
43*8a272653SPeter Holm
44*8a272653SPeter Holm #define MAXSIZE 256 * 1024
45*8a272653SPeter Holm
46*8a272653SPeter Holm int
setup(int nb)47*8a272653SPeter Holm setup(int nb)
48*8a272653SPeter Holm {
49*8a272653SPeter Holm int64_t bl;
50*8a272653SPeter Holm int64_t in;
51*8a272653SPeter Holm int64_t reserve_in;
52*8a272653SPeter Holm int64_t reserve_bl;
53*8a272653SPeter Holm int pct;
54*8a272653SPeter Holm
55*8a272653SPeter Holm if (nb == 0) {
56*8a272653SPeter Holm getdf(&bl, &in);
57*8a272653SPeter Holm size = bl / op->incarnations / 1024;
58*8a272653SPeter Holm
59*8a272653SPeter Holm pct = 90;
60*8a272653SPeter Holm if (op->hog == 0)
61*8a272653SPeter Holm pct = random_int(1, 90);
62*8a272653SPeter Holm size = size / 100 * pct + 1;
63*8a272653SPeter Holm
64*8a272653SPeter Holm if (size > MAXSIZE)
65*8a272653SPeter Holm size = MAXSIZE; /* arbitrary limit size pr. incarnation */
66*8a272653SPeter Holm
67*8a272653SPeter Holm /* Resource requirements: */
68*8a272653SPeter Holm while (size > 0) {
69*8a272653SPeter Holm reserve_in = 2 * op->incarnations + 1;
70*8a272653SPeter Holm reserve_bl = size * 1024 * op->incarnations +
71*8a272653SPeter Holm (512 * 1024 * op->incarnations) +
72*8a272653SPeter Holm 64 * 1024;
73*8a272653SPeter Holm if (reserve_bl <= bl && reserve_in <= in)
74*8a272653SPeter Holm break;
75*8a272653SPeter Holm size = size / 10 * 8;
76*8a272653SPeter Holm }
77*8a272653SPeter Holm if (size == 0)
78*8a272653SPeter Holm reserve_bl = reserve_in = 0;
79*8a272653SPeter Holm
80*8a272653SPeter Holm if (op->verbose > 1)
81*8a272653SPeter Holm printf("rw(size=%lu, incarnations=%d). Free(%jdk, %jd), reserve(%jdk, %jd)\n",
82*8a272653SPeter Holm size, op->incarnations, bl/1024, in, reserve_bl/1024, reserve_in);
83*8a272653SPeter Holm reservedf(reserve_bl, reserve_in);
84*8a272653SPeter Holm putval(size);
85*8a272653SPeter Holm size = size * 1024;
86*8a272653SPeter Holm } else {
87*8a272653SPeter Holm size = getval();
88*8a272653SPeter Holm size = size * 1024;
89*8a272653SPeter Holm }
90*8a272653SPeter Holm if (size == 0)
91*8a272653SPeter Holm exit(0);
92*8a272653SPeter Holm
93*8a272653SPeter Holm umask(0);
94*8a272653SPeter Holm sprintf(path,"%s.%05d", getprogname(), getpid());
95*8a272653SPeter Holm (void)mkdir(path, 0770);
96*8a272653SPeter Holm if (chdir(path) == -1)
97*8a272653SPeter Holm err(1, "chdir(%s), %s:%d", path, __FILE__, __LINE__);
98*8a272653SPeter Holm if ((starting_dir = open(".", 0)) < 0)
99*8a272653SPeter Holm err(1, ".");
100*8a272653SPeter Holm
101*8a272653SPeter Holm return (0);
102*8a272653SPeter Holm }
103*8a272653SPeter Holm
104*8a272653SPeter Holm void
cleanup(void)105*8a272653SPeter Holm cleanup(void)
106*8a272653SPeter Holm {
107*8a272653SPeter Holm if (starting_dir == 0)
108*8a272653SPeter Holm return;
109*8a272653SPeter Holm if (fchdir(starting_dir) == -1)
110*8a272653SPeter Holm err(1, "fchdir()");
111*8a272653SPeter Holm if (close(starting_dir) < 0)
112*8a272653SPeter Holm err(1, "close(starting_dir:%d)", starting_dir);
113*8a272653SPeter Holm
114*8a272653SPeter Holm (void)system("find . -delete");
115*8a272653SPeter Holm
116*8a272653SPeter Holm if (chdir("..") == -1)
117*8a272653SPeter Holm err(1, "chdir(..)");
118*8a272653SPeter Holm if (rmdir(path) == -1)
119*8a272653SPeter Holm err(1, "rmdir(%s), %s:%d", path, __FILE__, __LINE__);
120*8a272653SPeter Holm size = 0;
121*8a272653SPeter Holm }
122*8a272653SPeter Holm
123*8a272653SPeter Holm int
test(void)124*8a272653SPeter Holm test(void)
125*8a272653SPeter Holm {
126*8a272653SPeter Holm int buf[1024], index, to;
127*8a272653SPeter Holm #ifdef TEST
128*8a272653SPeter Holm int i;
129*8a272653SPeter Holm #endif
130*8a272653SPeter Holm int fd;
131*8a272653SPeter Holm char file[128];
132*8a272653SPeter Holm
133*8a272653SPeter Holm sprintf(file,"p%05d", getpid());
134*8a272653SPeter Holm if ((fd = creat(file, 0660)) == -1)
135*8a272653SPeter Holm err(1, "creat(%s)", file);
136*8a272653SPeter Holm
137*8a272653SPeter Holm to = sizeof(buf);
138*8a272653SPeter Holm index = 0;
139*8a272653SPeter Holm while (index < (int)size) {
140*8a272653SPeter Holm if (index + to > (int)size)
141*8a272653SPeter Holm to = size - index;
142*8a272653SPeter Holm #ifdef TEST
143*8a272653SPeter Holm for (i = 0; i < to; i++)
144*8a272653SPeter Holm buf[i] = index + i;
145*8a272653SPeter Holm #endif
146*8a272653SPeter Holm index += to;
147*8a272653SPeter Holm if (write(fd, buf, to) != to)
148*8a272653SPeter Holm err(1, "write(%s), %s:%d", file, __FILE__, __LINE__);
149*8a272653SPeter Holm }
150*8a272653SPeter Holm if (close(fd) == -1)
151*8a272653SPeter Holm err(1, "close(%s), %s:%d", file, __FILE__, __LINE__);
152*8a272653SPeter Holm
153*8a272653SPeter Holm if ((fd = open(file, O_RDONLY)) == -1)
154*8a272653SPeter Holm err(1, "open(%s), %s:%d", file, __FILE__, __LINE__);
155*8a272653SPeter Holm
156*8a272653SPeter Holm index = 0;
157*8a272653SPeter Holm while (index < (int)size && done_testing == 0) {
158*8a272653SPeter Holm if (index + to > (int)size)
159*8a272653SPeter Holm to = size - index;
160*8a272653SPeter Holm if (read(fd, buf, to) != to)
161*8a272653SPeter Holm err(1, "rw read. %s.%d", __FILE__, __LINE__);
162*8a272653SPeter Holm #ifdef TEST
163*8a272653SPeter Holm for (i = 0; i < to; i++) {
164*8a272653SPeter Holm if (buf[i] != index + i) {
165*8a272653SPeter Holm fprintf(stderr,
166*8a272653SPeter Holm "%s, pid %d: expected %d @ %d, got %d\n",
167*8a272653SPeter Holm getprogname(), getpid(), index+i, index+i,
168*8a272653SPeter Holm buf[i]);
169*8a272653SPeter Holm exit(EXIT_FAILURE);
170*8a272653SPeter Holm }
171*8a272653SPeter Holm }
172*8a272653SPeter Holm #endif
173*8a272653SPeter Holm index += to;
174*8a272653SPeter Holm }
175*8a272653SPeter Holm if (close(fd) == -1)
176*8a272653SPeter Holm err(1, "close(%s), %s:%d", file, __FILE__, __LINE__);
177*8a272653SPeter Holm if (unlink(file) == -1)
178*8a272653SPeter Holm err(1, "unlink(%s), %s:%d", file, __FILE__, __LINE__);
179*8a272653SPeter Holm return (0);
180*8a272653SPeter Holm }
181