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) with overlapping ranges */
29*8a272653SPeter Holm
30*8a272653SPeter Holm /* Provoked:
31*8a272653SPeter Holm lock order reversal:
32*8a272653SPeter Holm 1st 0xc50057a0 vnode interlock (vnode interlock) @ kern/kern_lockf.c:190
33*8a272653SPeter Holm 2nd 0xc14710e8 system map (system map) @ vm/vm_kern.c:296
34*8a272653SPeter Holm */
35*8a272653SPeter Holm
36*8a272653SPeter Holm #include <sys/types.h>
37*8a272653SPeter Holm
38*8a272653SPeter Holm #include <err.h>
39*8a272653SPeter Holm #include <errno.h>
40*8a272653SPeter Holm #include <fcntl.h>
41*8a272653SPeter Holm #include <stdio.h>
42*8a272653SPeter Holm #include <stdlib.h>
43*8a272653SPeter Holm #include <strings.h>
44*8a272653SPeter Holm #include <unistd.h>
45*8a272653SPeter Holm
46*8a272653SPeter Holm #include "stress.h"
47*8a272653SPeter Holm
48*8a272653SPeter Holm static char file[128];
49*8a272653SPeter Holm static int fd;
50*8a272653SPeter Holm static int freespace;
51*8a272653SPeter Holm
52*8a272653SPeter Holm int
setup(int nb)53*8a272653SPeter Holm setup(int nb)
54*8a272653SPeter Holm {
55*8a272653SPeter Holm int64_t bl;
56*8a272653SPeter Holm int64_t in;
57*8a272653SPeter Holm int64_t reserve_bl;
58*8a272653SPeter Holm int64_t reserve_in;
59*8a272653SPeter Holm int i;
60*8a272653SPeter Holm char buf[1024];
61*8a272653SPeter Holm
62*8a272653SPeter Holm if (nb == 0) {
63*8a272653SPeter Holm getdf(&bl, &in);
64*8a272653SPeter Holm
65*8a272653SPeter Holm /* Resource requirements: */
66*8a272653SPeter Holm reserve_in = 1 * op->incarnations;
67*8a272653SPeter Holm reserve_bl = 1081344 * op->incarnations;
68*8a272653SPeter Holm freespace = (reserve_bl <= bl && reserve_in <= in);
69*8a272653SPeter Holm if (!freespace)
70*8a272653SPeter Holm reserve_bl = reserve_in = 0;
71*8a272653SPeter Holm
72*8a272653SPeter Holm if (op->verbose > 1)
73*8a272653SPeter Holm printf("lockf2(incarnations=%d). Free(%jdk, %jd), reserve(%jdk, %jd)\n",
74*8a272653SPeter Holm op->incarnations, bl/1024, in, reserve_bl/1024, reserve_in);
75*8a272653SPeter Holm reservedf(reserve_bl, reserve_in);
76*8a272653SPeter Holm putval(freespace);
77*8a272653SPeter Holm } else {
78*8a272653SPeter Holm freespace = getval();
79*8a272653SPeter Holm }
80*8a272653SPeter Holm if (!freespace)
81*8a272653SPeter Holm exit (0);
82*8a272653SPeter Holm
83*8a272653SPeter Holm sprintf(file, "lockf.%d", getpid());
84*8a272653SPeter Holm if ((fd = open(file,O_CREAT | O_TRUNC | O_RDWR, 0600)) == -1)
85*8a272653SPeter Holm err(1, "creat(%s)", file);
86*8a272653SPeter Holm bzero(buf, sizeof(buf));
87*8a272653SPeter Holm for (i = 0; i < 1024; i++)
88*8a272653SPeter Holm if (write(fd, &buf, sizeof(buf)) != sizeof(buf))
89*8a272653SPeter Holm err(1, "write");
90*8a272653SPeter Holm close(fd);
91*8a272653SPeter Holm return (0);
92*8a272653SPeter Holm }
93*8a272653SPeter Holm
94*8a272653SPeter Holm void
cleanup(void)95*8a272653SPeter Holm cleanup(void)
96*8a272653SPeter Holm {
97*8a272653SPeter Holm unlink(file);
98*8a272653SPeter Holm }
99*8a272653SPeter Holm
100*8a272653SPeter Holm int
test(void)101*8a272653SPeter Holm test(void)
102*8a272653SPeter Holm {
103*8a272653SPeter Holm off_t pos;
104*8a272653SPeter Holm off_t size;
105*8a272653SPeter Holm int i, r;
106*8a272653SPeter Holm
107*8a272653SPeter Holm if ((fd = open(file, O_RDWR, 0600)) == -1)
108*8a272653SPeter Holm err(1, "open(%s)", file);
109*8a272653SPeter Holm
110*8a272653SPeter Holm for (i = 0; i < 1024 && done_testing == 0; i++) {
111*8a272653SPeter Holm pos = random_int(0, 1024 * 1024 - 1);
112*8a272653SPeter Holm if (lseek(fd, pos, SEEK_SET) == -1)
113*8a272653SPeter Holm err(1, "lseek");
114*8a272653SPeter Holm size = random_int(1, 1024 * 1024 - pos);
115*8a272653SPeter Holm if (size > 64)
116*8a272653SPeter Holm size = 64;
117*8a272653SPeter Holm do {
118*8a272653SPeter Holm r = lockf(fd, F_LOCK, size);
119*8a272653SPeter Holm } while (r == -1 && errno == EINTR);
120*8a272653SPeter Holm if (r == -1)
121*8a272653SPeter Holm err(1, "lockf(%s, F_LOCK)", file);
122*8a272653SPeter Holm size = random_int(1, size);
123*8a272653SPeter Holm if (lockf(fd, F_ULOCK, size) == -1)
124*8a272653SPeter Holm err(1, "lockf(%s, F_ULOCK)", file);
125*8a272653SPeter Holm
126*8a272653SPeter Holm }
127*8a272653SPeter Holm close(fd);
128*8a272653SPeter Holm
129*8a272653SPeter Holm return (0);
130*8a272653SPeter Holm }
131