xref: /freebsd/tools/test/stress2/misc/mmap14.sh (revision 8a272653d9fbd9fc37691c9aad6a05089b4ecb4d)
1*8a272653SPeter Holm#!/bin/sh
2*8a272653SPeter Holm
3*8a272653SPeter Holm#
4*8a272653SPeter Holm# Copyright (c) 2014 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# Simplified version of mmap10.sh with focus on core dumps
30*8a272653SPeter Holm# Deadlock seen:
31*8a272653SPeter Holm# http://people.freebsd.org/~pho/stress/log/kostik673.txt
32*8a272653SPeter Holm# No issues seen with r272060.
33*8a272653SPeter Holm
34*8a272653SPeter Holm# panic: vm_reserv_populate: reserv 0xfffff807cbd46300 is already promoted
35*8a272653SPeter Holm# http://people.freebsd.org/~pho/stress/log/kostik764.txt
36*8a272653SPeter Holm# Fixed by r280238
37*8a272653SPeter Holm
38*8a272653SPeter Holm# panic: vm_reserv_break: reserv 0xfffff807cbe9af00 is full
39*8a272653SPeter Holm# https://people.freebsd.org/~pho/stress/log/alan006.txt
40*8a272653SPeter Holm
41*8a272653SPeter Holm# panic: vm_page_dirty: page is invalid!
42*8a272653SPeter Holm# https://people.freebsd.org/~pho/stress/log/kostik818.txt
43*8a272653SPeter Holm
44*8a272653SPeter Holm[ `id -u ` -ne 0 ] && echo "Must be root!" && exit 1
45*8a272653SPeter Holm
46*8a272653SPeter Holm. ../default.cfg
47*8a272653SPeter Holm
48*8a272653SPeter Holmhere=`pwd`
49*8a272653SPeter Holmcd /tmp
50*8a272653SPeter Holmsed '1,/^EOF/d' < $here/$0 > mmap14.c
51*8a272653SPeter Holmmycc -o mmap14 -Wall -Wextra -O2 -g mmap14.c -lpthread || exit 1
52*8a272653SPeter Holmrm -f mmap14.c
53*8a272653SPeter Holm
54*8a272653SPeter Holmdaemon sh -c "(cd $here/../testcases/swap; ./swap -t 2m -i 20 -k -h)"
55*8a272653SPeter Holmsleep `jot -r 1 1 10`
56*8a272653SPeter Holmwire=$((`sysctl -n vm.max_user_wired` - \
57*8a272653SPeter Holm    `sysctl -n vm.stats.vm.v_user_wire_count`))
58*8a272653SPeter Holmfor i in `jot 2`; do
59*8a272653SPeter Holm	/tmp/mmap14 $wire
60*8a272653SPeter Holmdone
61*8a272653SPeter Holmwhile pgrep -q swap; do
62*8a272653SPeter Holm	pkill -9 swap
63*8a272653SPeter Holmdone
64*8a272653SPeter Holm
65*8a272653SPeter Holmrm -f /tmp/mmap14 /tmp/mmap14.core
66*8a272653SPeter Holmexit 0
67*8a272653SPeter HolmEOF
68*8a272653SPeter Holm#include <sys/types.h>
69*8a272653SPeter Holm#include <sys/mman.h>
70*8a272653SPeter Holm#include <sys/resource.h>
71*8a272653SPeter Holm#include <sys/stat.h>
72*8a272653SPeter Holm#include <sys/time.h>
73*8a272653SPeter Holm#include <sys/wait.h>
74*8a272653SPeter Holm
75*8a272653SPeter Holm#include <err.h>
76*8a272653SPeter Holm#include <errno.h>
77*8a272653SPeter Holm#include <fcntl.h>
78*8a272653SPeter Holm#include <pthread.h>
79*8a272653SPeter Holm#include <pthread_np.h>
80*8a272653SPeter Holm#include <sched.h>
81*8a272653SPeter Holm#include <signal.h>
82*8a272653SPeter Holm#include <stdio.h>
83*8a272653SPeter Holm#include <stdlib.h>
84*8a272653SPeter Holm#include <string.h>
85*8a272653SPeter Holm#include <time.h>
86*8a272653SPeter Holm#include <unistd.h>
87*8a272653SPeter Holm
88*8a272653SPeter Holm#define LOOPS 2
89*8a272653SPeter Holm#define N (128 * 1024 / (int)sizeof(u_int32_t))
90*8a272653SPeter Holm#define PARALLEL 50
91*8a272653SPeter Holm
92*8a272653SPeter Holmstatic void *p;
93*8a272653SPeter Holmstatic u_int32_t r[N];
94*8a272653SPeter Holm
95*8a272653SPeter Holmstatic unsigned long
96*8a272653SPeter Holmmakearg(void)
97*8a272653SPeter Holm{
98*8a272653SPeter Holm	unsigned long val;
99*8a272653SPeter Holm	unsigned int i;
100*8a272653SPeter Holm
101*8a272653SPeter Holm	val = arc4random();
102*8a272653SPeter Holm	i   = arc4random() % 100;
103*8a272653SPeter Holm	if (i < 20)
104*8a272653SPeter Holm		val = val & 0xff;
105*8a272653SPeter Holm	if (i >= 20 && i < 40)
106*8a272653SPeter Holm		val = val & 0xffff;
107*8a272653SPeter Holm	if (i >= 40 && i < 60)
108*8a272653SPeter Holm		val = (unsigned long)(r) | (val & 0xffff);
109*8a272653SPeter Holm#if defined(__LP64__)
110*8a272653SPeter Holm	if (i >= 60) {
111*8a272653SPeter Holm		val = (val << 32) | arc4random();
112*8a272653SPeter Holm		if (i > 80)
113*8a272653SPeter Holm			val = val & 0x00007fffffffffffUL;
114*8a272653SPeter Holm	}
115*8a272653SPeter Holm#endif
116*8a272653SPeter Holm
117*8a272653SPeter Holm	return(val);
118*8a272653SPeter Holm}
119*8a272653SPeter Holm
120*8a272653SPeter Holmstatic void *
121*8a272653SPeter Holmmakeptr(void)
122*8a272653SPeter Holm{
123*8a272653SPeter Holm	unsigned long val;
124*8a272653SPeter Holm
125*8a272653SPeter Holm	if (p != MAP_FAILED && p != NULL)
126*8a272653SPeter Holm		val = (unsigned long)p + arc4random();
127*8a272653SPeter Holm	else
128*8a272653SPeter Holm		val = makearg();
129*8a272653SPeter Holm	val = trunc_page(val);
130*8a272653SPeter Holm
131*8a272653SPeter Holm	return ((void *)val);
132*8a272653SPeter Holm}
133*8a272653SPeter Holm
134*8a272653SPeter Holmstatic void *
135*8a272653SPeter Holmtmmap(void *arg __unused)
136*8a272653SPeter Holm{
137*8a272653SPeter Holm	size_t len;
138*8a272653SPeter Holm	int i, fd;
139*8a272653SPeter Holm
140*8a272653SPeter Holm	pthread_set_name_np(pthread_self(), __func__);
141*8a272653SPeter Holm	len = 1LL * 1024 * 1024 * 1024;
142*8a272653SPeter Holm
143*8a272653SPeter Holm	for (i = 0; i < 100; i++) {
144*8a272653SPeter Holm		if ((fd = open("/dev/zero", O_RDWR)) == -1)
145*8a272653SPeter Holm			err(1,"open()");
146*8a272653SPeter Holm
147*8a272653SPeter Holm		if ((p = mmap(NULL, len, PROT_READ | PROT_WRITE, MAP_PRIVATE, fd,
148*8a272653SPeter Holm		    0)) != MAP_FAILED) {
149*8a272653SPeter Holm			usleep(100);
150*8a272653SPeter Holm			munmap(p, len);
151*8a272653SPeter Holm		}
152*8a272653SPeter Holm
153*8a272653SPeter Holm		if ((p = mmap(NULL, len, PROT_READ | PROT_WRITE, MAP_ANON, -1, 0)) !=
154*8a272653SPeter Holm		    MAP_FAILED) {
155*8a272653SPeter Holm			usleep(100);
156*8a272653SPeter Holm			munmap(p, len);
157*8a272653SPeter Holm		}
158*8a272653SPeter Holm		close(fd);
159*8a272653SPeter Holm	}
160*8a272653SPeter Holm
161*8a272653SPeter Holm	return (NULL);
162*8a272653SPeter Holm}
163*8a272653SPeter Holm
164*8a272653SPeter Holmstatic void *
165*8a272653SPeter Holmtmlock(void *arg __unused)
166*8a272653SPeter Holm{
167*8a272653SPeter Holm	size_t len;
168*8a272653SPeter Holm	int i, n;
169*8a272653SPeter Holm
170*8a272653SPeter Holm	pthread_set_name_np(pthread_self(), __func__);
171*8a272653SPeter Holm	n = 0;
172*8a272653SPeter Holm	for (i = 0; i < 200; i++) {
173*8a272653SPeter Holm		len = trunc_page(makearg());
174*8a272653SPeter Holm		if (mlock(makeptr(), len) == 0)
175*8a272653SPeter Holm			n++;
176*8a272653SPeter Holm		len = trunc_page(makearg());
177*8a272653SPeter Holm		if (arc4random() % 100 < 50)
178*8a272653SPeter Holm			if (munlock(makeptr(), len) == 0)
179*8a272653SPeter Holm				n++;
180*8a272653SPeter Holm	}
181*8a272653SPeter Holm	if (n < 10)
182*8a272653SPeter Holm		fprintf(stderr, "Note: tmlock() only succeeded %d times.\n",
183*8a272653SPeter Holm		    n);
184*8a272653SPeter Holm
185*8a272653SPeter Holm	return (NULL);
186*8a272653SPeter Holm}
187*8a272653SPeter Holm
188*8a272653SPeter Holmstatic void
189*8a272653SPeter Holmtest(void)
190*8a272653SPeter Holm{
191*8a272653SPeter Holm	pthread_t tid[4];
192*8a272653SPeter Holm	int i, rc;
193*8a272653SPeter Holm
194*8a272653SPeter Holm	if ((rc = pthread_create(&tid[0], NULL, tmmap, NULL)) != 0)
195*8a272653SPeter Holm		errc(1, rc, "tmmap()");
196*8a272653SPeter Holm	if ((rc = pthread_create(&tid[1], NULL, tmlock, NULL)) != 0)
197*8a272653SPeter Holm		errc(1, rc, "tmlock()");
198*8a272653SPeter Holm
199*8a272653SPeter Holm	for (i = 0; i < 100; i++) {
200*8a272653SPeter Holm		if (fork() == 0) {
201*8a272653SPeter Holm			usleep(10000);
202*8a272653SPeter Holm			_exit(0);
203*8a272653SPeter Holm		}
204*8a272653SPeter Holm		wait(NULL);
205*8a272653SPeter Holm	}
206*8a272653SPeter Holm
207*8a272653SPeter Holm	raise(SIGSEGV);
208*8a272653SPeter Holm
209*8a272653SPeter Holm	for (i = 0; i < 2; i++)
210*8a272653SPeter Holm		if ((rc = pthread_join(tid[i], NULL)) != 0)
211*8a272653SPeter Holm			errc(1, rc, "pthread_join(%d)", i);
212*8a272653SPeter Holm	_exit(0);
213*8a272653SPeter Holm}
214*8a272653SPeter Holm
215*8a272653SPeter Holmint
216*8a272653SPeter Holmmain(int argc, char *argv[])
217*8a272653SPeter Holm{
218*8a272653SPeter Holm	struct rlimit rl;
219*8a272653SPeter Holm	rlim_t maxlock;
220*8a272653SPeter Holm	int i, j;
221*8a272653SPeter Holm
222*8a272653SPeter Holm	if (argc != 2) {
223*8a272653SPeter Holm		fprintf(stderr, "Usage:%s <max pages to lock.>\n", argv[0]);
224*8a272653SPeter Holm		exit(1);
225*8a272653SPeter Holm	}
226*8a272653SPeter Holm	if (getrlimit(RLIMIT_MEMLOCK, &rl) == -1)
227*8a272653SPeter Holm		warn("getrlimit");
228*8a272653SPeter Holm	maxlock = atol(argv[1]);
229*8a272653SPeter Holm	if (maxlock == 0)
230*8a272653SPeter Holm		errx(1, "Argument is zero");
231*8a272653SPeter Holm	maxlock = (maxlock / 10 * 8) / PARALLEL * PAGE_SIZE;
232*8a272653SPeter Holm	if (maxlock < rl.rlim_cur) {
233*8a272653SPeter Holm		rl.rlim_max = rl.rlim_cur = maxlock;
234*8a272653SPeter Holm		if (setrlimit(RLIMIT_MEMLOCK, &rl) == -1)
235*8a272653SPeter Holm			warn("setrlimit");
236*8a272653SPeter Holm	}
237*8a272653SPeter Holm
238*8a272653SPeter Holm	for (i = 0; i < N; i++)
239*8a272653SPeter Holm		r[i] = arc4random();
240*8a272653SPeter Holm
241*8a272653SPeter Holm	for (i = 0; i < LOOPS; i++) {
242*8a272653SPeter Holm		for (j = 0; j < PARALLEL; j++) {
243*8a272653SPeter Holm			if (fork() == 0)
244*8a272653SPeter Holm				test();
245*8a272653SPeter Holm		}
246*8a272653SPeter Holm
247*8a272653SPeter Holm		for (j = 0; j < PARALLEL; j++)
248*8a272653SPeter Holm			wait(NULL);
249*8a272653SPeter Holm	}
250*8a272653SPeter Holm
251*8a272653SPeter Holm	return (0);
252*8a272653SPeter Holm}
253