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 /* Test lockf(3) */
29*8a272653SPeter Holm
30*8a272653SPeter Holm #include <sys/param.h>
31*8a272653SPeter Holm #include <sys/wait.h>
32*8a272653SPeter Holm
33*8a272653SPeter Holm #include <err.h>
34*8a272653SPeter Holm #include <errno.h>
35*8a272653SPeter Holm #include <fcntl.h>
36*8a272653SPeter Holm #include <signal.h>
37*8a272653SPeter Holm #include <stdio.h>
38*8a272653SPeter Holm #include <stdlib.h>
39*8a272653SPeter Holm #include <unistd.h>
40*8a272653SPeter Holm
41*8a272653SPeter Holm #include "stress.h"
42*8a272653SPeter Holm
43*8a272653SPeter Holm static pid_t pid;
44*8a272653SPeter Holm static int fd;
45*8a272653SPeter Holm static int freespace;
46*8a272653SPeter Holm static char file[128];
47*8a272653SPeter Holm
48*8a272653SPeter Holm static int
get(void)49*8a272653SPeter Holm get(void) {
50*8a272653SPeter Holm int r, sem;
51*8a272653SPeter Holm
52*8a272653SPeter Holm do {
53*8a272653SPeter Holm r = lockf(fd, F_LOCK, 0);
54*8a272653SPeter Holm } while (r == -1 && errno == EINTR && done_testing == 0);
55*8a272653SPeter Holm if (r == -1)
56*8a272653SPeter Holm err(1, "lockf(%s, F_LOCK)", file);
57*8a272653SPeter Holm if (lseek(fd, 0, SEEK_SET) == -1) // XXX
58*8a272653SPeter Holm err(1, "lseek"); // XXX
59*8a272653SPeter Holm r = read(fd, &sem, sizeof(sem));
60*8a272653SPeter Holm if (r == -1)
61*8a272653SPeter Holm err(1, "get: read(%d)", fd);
62*8a272653SPeter Holm if (r == 0)
63*8a272653SPeter Holm errx(1, "get() read 0 bytes");
64*8a272653SPeter Holm if (r != sizeof(sem))
65*8a272653SPeter Holm errx(1, "get() size error: %d", r);
66*8a272653SPeter Holm if (lseek(fd, 0, SEEK_SET) == -1)
67*8a272653SPeter Holm err(1, "lseek");
68*8a272653SPeter Holm if (lockf(fd, F_ULOCK, 0) == -1)
69*8a272653SPeter Holm err(1, "lockf(%s, F_ULOCK)", file);
70*8a272653SPeter Holm return (sem);
71*8a272653SPeter Holm }
72*8a272653SPeter Holm
73*8a272653SPeter Holm static void
incr(void)74*8a272653SPeter Holm incr(void) {
75*8a272653SPeter Holm int r, sem;
76*8a272653SPeter Holm
77*8a272653SPeter Holm do {
78*8a272653SPeter Holm r = lockf(fd, F_LOCK, 0);
79*8a272653SPeter Holm } while (r == -1 && errno == EINTR && done_testing == 0);
80*8a272653SPeter Holm if (r == -1)
81*8a272653SPeter Holm err(1, "lockf(%s, F_LOCK)", file);
82*8a272653SPeter Holm if (read(fd, &sem, sizeof(sem)) != sizeof(sem))
83*8a272653SPeter Holm err(1, "incr: read(%d)", fd);
84*8a272653SPeter Holm if (lseek(fd, 0, SEEK_SET) == -1)
85*8a272653SPeter Holm err(1, "lseek");
86*8a272653SPeter Holm sem++;
87*8a272653SPeter Holm if (write(fd, &sem, sizeof(sem)) != sizeof(sem))
88*8a272653SPeter Holm err(1, "incr: read");
89*8a272653SPeter Holm if (lseek(fd, 0, SEEK_SET) == -1)
90*8a272653SPeter Holm err(1, "lseek");
91*8a272653SPeter Holm if (lockf(fd, F_ULOCK, 0) == -1)
92*8a272653SPeter Holm err(1, "lockf(%s, F_ULOCK)", file);
93*8a272653SPeter Holm }
94*8a272653SPeter Holm
95*8a272653SPeter Holm int
setup(int nb)96*8a272653SPeter Holm setup(int nb)
97*8a272653SPeter Holm {
98*8a272653SPeter Holm int64_t bl;
99*8a272653SPeter Holm int64_t in;
100*8a272653SPeter Holm int64_t reserve_bl;
101*8a272653SPeter Holm int64_t reserve_in;
102*8a272653SPeter Holm
103*8a272653SPeter Holm if (nb == 0) {
104*8a272653SPeter Holm getdf(&bl, &in);
105*8a272653SPeter Holm
106*8a272653SPeter Holm /* Resource requirements: */
107*8a272653SPeter Holm reserve_in = 1 * op->incarnations;
108*8a272653SPeter Holm reserve_bl = 4096 * op->incarnations;
109*8a272653SPeter Holm freespace = (reserve_bl <= bl && reserve_in <= in);
110*8a272653SPeter Holm if (!freespace)
111*8a272653SPeter Holm reserve_bl = reserve_in = 0;
112*8a272653SPeter Holm
113*8a272653SPeter Holm if (op->verbose > 1)
114*8a272653SPeter Holm printf("lockf(incarnations=%d). Free(%jdk, %jd), reserve(%jdk, %jd)\n",
115*8a272653SPeter Holm op->incarnations, bl/1024, in, reserve_bl/1024, reserve_in);
116*8a272653SPeter Holm reservedf(reserve_bl, reserve_in);
117*8a272653SPeter Holm putval(freespace);
118*8a272653SPeter Holm } else {
119*8a272653SPeter Holm freespace = getval();
120*8a272653SPeter Holm }
121*8a272653SPeter Holm if (!freespace)
122*8a272653SPeter Holm exit(0);
123*8a272653SPeter Holm
124*8a272653SPeter Holm return (0);
125*8a272653SPeter Holm }
126*8a272653SPeter Holm
127*8a272653SPeter Holm void
cleanup(void)128*8a272653SPeter Holm cleanup(void)
129*8a272653SPeter Holm {
130*8a272653SPeter Holm }
131*8a272653SPeter Holm
132*8a272653SPeter Holm int
test(void)133*8a272653SPeter Holm test(void)
134*8a272653SPeter Holm {
135*8a272653SPeter Holm int i;
136*8a272653SPeter Holm int sem = 0;
137*8a272653SPeter Holm
138*8a272653SPeter Holm sprintf(file, "lockf.0.%d", getpid());
139*8a272653SPeter Holm if ((fd = open(file,O_CREAT | O_TRUNC | O_RDWR, 0600)) == -1) {
140*8a272653SPeter Holm if (errno == ENOENT)
141*8a272653SPeter Holm return (0);
142*8a272653SPeter Holm else
143*8a272653SPeter Holm err(1, "creat(%s) %s:%d", file, __FILE__, __LINE__);
144*8a272653SPeter Holm }
145*8a272653SPeter Holm if (write(fd, &sem, sizeof(sem)) != sizeof(sem))
146*8a272653SPeter Holm err(1, "write");
147*8a272653SPeter Holm if (lseek(fd, 0, SEEK_SET) == -1)
148*8a272653SPeter Holm err(1, "lseek");
149*8a272653SPeter Holm
150*8a272653SPeter Holm pid = fork();
151*8a272653SPeter Holm if (pid == -1) {
152*8a272653SPeter Holm perror("fork");
153*8a272653SPeter Holm exit(2);
154*8a272653SPeter Holm }
155*8a272653SPeter Holm
156*8a272653SPeter Holm if (pid == 0) { /* child */
157*8a272653SPeter Holm alarm(60);
158*8a272653SPeter Holm for (i = 0; i < 100 && done_testing == 0; i++) {
159*8a272653SPeter Holm while ((get() & 1) == 0 && done_testing == 0)
160*8a272653SPeter Holm ;
161*8a272653SPeter Holm if (op->verbose > 3)
162*8a272653SPeter Holm printf("Child %d, sem = %d\n", i, get()),
163*8a272653SPeter Holm fflush(stdout);
164*8a272653SPeter Holm incr();
165*8a272653SPeter Holm }
166*8a272653SPeter Holm _exit(0);
167*8a272653SPeter Holm } else { /* parent */
168*8a272653SPeter Holm for (i = 0; i < 100 && done_testing == 0; i++) {
169*8a272653SPeter Holm while ((get() & 1) == 1 && done_testing == 0)
170*8a272653SPeter Holm ;
171*8a272653SPeter Holm if (op->verbose > 3)
172*8a272653SPeter Holm printf("Parent %d, sem = %d\n", i, get()),
173*8a272653SPeter Holm fflush(stdout);
174*8a272653SPeter Holm incr();
175*8a272653SPeter Holm }
176*8a272653SPeter Holm }
177*8a272653SPeter Holm close(fd);
178*8a272653SPeter Holm if (done_testing == 1)
179*8a272653SPeter Holm kill(pid, SIGHUP);
180*8a272653SPeter Holm waitpid(pid, &i, 0);
181*8a272653SPeter Holm unlink(file);
182*8a272653SPeter Holm
183*8a272653SPeter Holm return (0);
184*8a272653SPeter Holm }
185