xref: /freebsd/tools/test/stress2/misc/mlockall2.sh (revision 8a272653d9fbd9fc37691c9aad6a05089b4ecb4d)
1*8a272653SPeter Holm#!/bin/sh
2*8a272653SPeter Holm
3*8a272653SPeter Holm#
4*8a272653SPeter Holm# Copyright (c) 2012 Peter Holm <pho@FreeBSD.org>
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# core dumps seen in watchdogd after mlockall() was added.
34*8a272653SPeter Holm# This scenario demonstrates the problem. Fixed in r242012.
35*8a272653SPeter Holm
36*8a272653SPeter Holm# "panic: freeing mapped page 0xfffff8181b38a5e8" seen:
37*8a272653SPeter Holm# https://people.freebsd.org/~pho/stress/log/mark030.txt
38*8a272653SPeter Holm
39*8a272653SPeter Holmmem=`sysctl -n hw.usermem`
40*8a272653SPeter Holm[ `sysctl -n vm.swap_total` -eq 0 ] && mem=$((mem / 100 * 60))
41*8a272653SPeter Holm
42*8a272653SPeter Holmhere=`pwd`
43*8a272653SPeter Holmcd /tmp
44*8a272653SPeter Holmsed '1,/^EOF/d' < $here/$0 > mlockall2.c
45*8a272653SPeter Holmmycc -o mlockall2 -Wall -Wextra -O2 -g mlockall2.c || exit 1
46*8a272653SPeter Holmrm -f mlockall2.c
47*8a272653SPeter Holmcd $here
48*8a272653SPeter Holm
49*8a272653SPeter Holmrm -f mlockall2.core
50*8a272653SPeter Holm/tmp/mlockall2 $mem &
51*8a272653SPeter Holmwhile kill -0 $! 2>/dev/null; do
52*8a272653SPeter Holm        [ -r mlockall2.core ] && kill $! && break
53*8a272653SPeter Holm        sleep 10
54*8a272653SPeter Holmdone
55*8a272653SPeter Holm[ -r mlockall2.core ] && s=1 || s=0
56*8a272653SPeter Holmpkill mlockall2
57*8a272653SPeter Holmwait
58*8a272653SPeter Holmrm -f /tmp/mlockall2 mlockall2.core
59*8a272653SPeter Holmexit $s
60*8a272653SPeter HolmEOF
61*8a272653SPeter Holm#include <sys/types.h>
62*8a272653SPeter Holm#include <sys/mman.h>
63*8a272653SPeter Holm#include <sys/rtprio.h>
64*8a272653SPeter Holm#include <sys/wait.h>
65*8a272653SPeter Holm
66*8a272653SPeter Holm#include <err.h>
67*8a272653SPeter Holm#include <signal.h>
68*8a272653SPeter Holm#include <stdlib.h>
69*8a272653SPeter Holm#include <time.h>
70*8a272653SPeter Holm#include <unistd.h>
71*8a272653SPeter Holm
72*8a272653SPeter Holm#define LOAD 40
73*8a272653SPeter Holm#define N 90000
74*8a272653SPeter Holm#define PARALLEL 5
75*8a272653SPeter Holm#define RUNTIME 600
76*8a272653SPeter Holm
77*8a272653SPeter Holmstatic long size;
78*8a272653SPeter Holm
79*8a272653SPeter Holmstatic void
80*8a272653SPeter Holmswap(void)
81*8a272653SPeter Holm{
82*8a272653SPeter Holm	long i;
83*8a272653SPeter Holm	int page;
84*8a272653SPeter Holm	volatile char *c;
85*8a272653SPeter Holm
86*8a272653SPeter Holm	setproctitle("swap");
87*8a272653SPeter Holm	c = malloc(size);
88*8a272653SPeter Holm	while (c == NULL) {
89*8a272653SPeter Holm		size -=  1024 * 1024;
90*8a272653SPeter Holm		c = malloc(size);
91*8a272653SPeter Holm	}
92*8a272653SPeter Holm	page = getpagesize();
93*8a272653SPeter Holm	for (;;) {
94*8a272653SPeter Holm		i = 0;
95*8a272653SPeter Holm		while (i < size) {
96*8a272653SPeter Holm			c[i] = 0;
97*8a272653SPeter Holm			i += page;
98*8a272653SPeter Holm		}
99*8a272653SPeter Holm	}
100*8a272653SPeter Holm}
101*8a272653SPeter Holm
102*8a272653SPeter Holmstatic void
103*8a272653SPeter Holmtest(void)
104*8a272653SPeter Holm{
105*8a272653SPeter Holm        pid_t p;
106*8a272653SPeter Holm        int i, status;
107*8a272653SPeter Holm
108*8a272653SPeter Holm	setproctitle("test");
109*8a272653SPeter Holm        for (i = 0; i < N; i++) {
110*8a272653SPeter Holm                if ((p = fork()) == 0) {
111*8a272653SPeter Holm			_exit(0);
112*8a272653SPeter Holm		}
113*8a272653SPeter Holm                if (p > 0)
114*8a272653SPeter Holm                        waitpid(p, &status, 0);
115*8a272653SPeter Holm		if (status != 0)
116*8a272653SPeter Holm			break;
117*8a272653SPeter Holm        }
118*8a272653SPeter Holm        _exit(0);
119*8a272653SPeter Holm}
120*8a272653SPeter Holm
121*8a272653SPeter Holmint
122*8a272653SPeter Holmmain(int argc __unused, char **argv)
123*8a272653SPeter Holm{
124*8a272653SPeter Holm	time_t start;
125*8a272653SPeter Holm	struct rtprio rtp;
126*8a272653SPeter Holm	pid_t pids[LOAD], pids2[PARALLEL];
127*8a272653SPeter Holm        int i;
128*8a272653SPeter Holm
129*8a272653SPeter Holm	size = atol(argv[1]) / LOAD * 1.5;
130*8a272653SPeter Holm	for (i = 0; i < LOAD; i++)
131*8a272653SPeter Holm		if ((pids[i] = fork()) == 0)
132*8a272653SPeter Holm			swap();
133*8a272653SPeter Holm	sleep(10);
134*8a272653SPeter Holm
135*8a272653SPeter Holm	rtp.type = RTP_PRIO_REALTIME;
136*8a272653SPeter Holm	rtp.prio = 0;
137*8a272653SPeter Holm	if (rtprio(RTP_SET, 0, &rtp) == -1)
138*8a272653SPeter Holm		err(1, "rtprio");
139*8a272653SPeter Holm
140*8a272653SPeter Holm	if (madvise(0, 0, MADV_PROTECT) != 0)
141*8a272653SPeter Holm		err(1, "madvise failed");
142*8a272653SPeter Holm	if (mlockall(MCL_CURRENT | MCL_FUTURE) != 0)
143*8a272653SPeter Holm		err(1, "mlockall failed");
144*8a272653SPeter Holm
145*8a272653SPeter Holm	start = time(NULL);
146*8a272653SPeter Holm	while (time(NULL) - start < RUNTIME) {
147*8a272653SPeter Holm		for (i = 0; i < PARALLEL; i++) {
148*8a272653SPeter Holm			if ((pids2[i] = fork()) == 0)
149*8a272653SPeter Holm				test();
150*8a272653SPeter Holm		}
151*8a272653SPeter Holm
152*8a272653SPeter Holm		for (i = 0; i < PARALLEL; i++)
153*8a272653SPeter Holm			if (waitpid(pids2[i], NULL, 0) != pids2[i])
154*8a272653SPeter Holm				err(1, "waitpid(%d) (2)", pids2[i]);
155*8a272653SPeter Holm		if (access("mlockall2.core", R_OK) == 0)
156*8a272653SPeter Holm			break;
157*8a272653SPeter Holm	}
158*8a272653SPeter Holm	for (i = 0; i < LOAD; i++)
159*8a272653SPeter Holm		kill(pids[i], SIGKILL);
160*8a272653SPeter Holm	for (i = 0; i < LOAD; i++)
161*8a272653SPeter Holm		if (waitpid(pids[i], NULL, 0) != pids[i])
162*8a272653SPeter Holm			err(1, "waitpid(%d)", pids[i]);
163*8a272653SPeter Holm
164*8a272653SPeter Holm        return (0);
165*8a272653SPeter Holm}
166