xref: /freebsd-src/tools/test/stress2/misc/collapse.sh (revision 8a272653d9fbd9fc37691c9aad6a05089b4ecb4d)
1*8a272653SPeter Holm#!/bin/sh
2*8a272653SPeter Holm
3*8a272653SPeter Holm#
4*8a272653SPeter Holm# Copyright (c) 2020 Jeffrey Roberson <jeff@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. ../default.cfg
30*8a272653SPeter Holm
31*8a272653SPeter Holm# "panic: freeing mapped page 0xfffffe000aa73910" seen:
32*8a272653SPeter Holm# https://people.freebsd.org/~pho/stress/log/collapse.txt
33*8a272653SPeter Holm
34*8a272653SPeter Holmodir=`pwd`
35*8a272653SPeter Holmcd /tmp
36*8a272653SPeter Holmsed '1,/^EOF/d' < $odir/$0 > collapse.c
37*8a272653SPeter Holmmycc -o collapse -Wall -Wextra -g -O0 collapse.c || exit 1
38*8a272653SPeter Holmrm -f collapse.c
39*8a272653SPeter Holmcd $odir
40*8a272653SPeter Holm
41*8a272653SPeter Holmdaemon sh -c '(cd ../testcases/swap; ./swap -t 20m -i 16 -l 85)' > \
42*8a272653SPeter Holm    /dev/null 2>&1
43*8a272653SPeter Holmsleep 2
44*8a272653SPeter Holm/tmp/collapse
45*8a272653SPeter Holmwhile pgrep -q swap; do
46*8a272653SPeter Holm	pkill -9 swap
47*8a272653SPeter Holmdone
48*8a272653SPeter Holmrm -f /tmp/collapse
49*8a272653SPeter Holmexit 0
50*8a272653SPeter Holm
51*8a272653SPeter HolmEOF
52*8a272653SPeter Holm#include <sys/param.h>
53*8a272653SPeter Holm#include <sys/mman.h>
54*8a272653SPeter Holm#include <sys/wait.h>
55*8a272653SPeter Holm
56*8a272653SPeter Holm#include <err.h>
57*8a272653SPeter Holm#include <errno.h>
58*8a272653SPeter Holm#include <fcntl.h>
59*8a272653SPeter Holm#include <stdio.h>
60*8a272653SPeter Holm#include <stdlib.h>
61*8a272653SPeter Holm#include <string.h>
62*8a272653SPeter Holm#include <time.h>
63*8a272653SPeter Holm#include <unistd.h>
64*8a272653SPeter Holm
65*8a272653SPeter Holm#define ADRSPACE  (256 * 1024)
66*8a272653SPeter Holm#define	DEPTH	6
67*8a272653SPeter Holm#define	WIDTH	3
68*8a272653SPeter Holm#define PARALLEL 4
69*8a272653SPeter Holm#define RUNTIME 1200
70*8a272653SPeter Holm#define CHILDTIME 5
71*8a272653SPeter Holm#define STARTTIME 5
72*8a272653SPeter Holm#define	TOUCH	16
73*8a272653SPeter Holm
74*8a272653SPeter Holmchar *p;
75*8a272653SPeter Holm
76*8a272653SPeter Holmstatic void
77*8a272653SPeter Holmchild(int depth, time_t start)
78*8a272653SPeter Holm{
79*8a272653SPeter Holm	time_t run, delay;
80*8a272653SPeter Holm	int i, shared, off;
81*8a272653SPeter Holm	int len;
82*8a272653SPeter Holm
83*8a272653SPeter Holm	/* Pick a random bit of address space to change inherit on. */
84*8a272653SPeter Holm	for (i = 0; i < ADRSPACE; i += len) {
85*8a272653SPeter Holm		shared = arc4random() & 0x1;
86*8a272653SPeter Holm		len = roundup2(arc4random() % ((ADRSPACE - i) / 4),
87*8a272653SPeter Holm		    PAGE_SIZE);
88*8a272653SPeter Holm		if (minherit(p + i, len, shared ? INHERIT_SHARE :
89*8a272653SPeter Holm		    INHERIT_COPY) != 0)
90*8a272653SPeter Holm			err(1, "minherit");
91*8a272653SPeter Holm	}
92*8a272653SPeter Holm
93*8a272653SPeter Holm	for (i = 0; depth != 0 && i < WIDTH; i++)
94*8a272653SPeter Holm		if (fork() == 0)
95*8a272653SPeter Holm			child(depth - 1, start);
96*8a272653SPeter Holm
97*8a272653SPeter Holm	/*
98*8a272653SPeter Holm	 * Touch all of the memory and exit at a random time to collapse
99*8a272653SPeter Holm	 * some portion of the chain.
100*8a272653SPeter Holm	 */
101*8a272653SPeter Holm	delay = arc4random() % (CHILDTIME - 1);
102*8a272653SPeter Holm	run = arc4random() % (CHILDTIME - delay);
103*8a272653SPeter Holm	for (;;) {
104*8a272653SPeter Holm		if (time(NULL) >= start + delay)
105*8a272653SPeter Holm			break;
106*8a272653SPeter Holm		usleep(100);
107*8a272653SPeter Holm	}
108*8a272653SPeter Holm	while (time(NULL) - start < run) {
109*8a272653SPeter Holm		off = rounddown2(arc4random() % ADRSPACE, PAGE_SIZE);
110*8a272653SPeter Holm		bzero(p + off, PAGE_SIZE);
111*8a272653SPeter Holm		usleep((run * 1000) / TOUCH);
112*8a272653SPeter Holm	}
113*8a272653SPeter Holm
114*8a272653SPeter Holm	_exit(0);
115*8a272653SPeter Holm}
116*8a272653SPeter Holm
117*8a272653SPeter Holmstatic void
118*8a272653SPeter Holmwork(int depth)
119*8a272653SPeter Holm{
120*8a272653SPeter Holm
121*8a272653SPeter Holm	if ((p = mmap(NULL, ADRSPACE, PROT_READ | PROT_WRITE,
122*8a272653SPeter Holm	    MAP_SHARED | MAP_ANON, -1, 0)) == MAP_FAILED) {
123*8a272653SPeter Holm		if (errno == ENOMEM)
124*8a272653SPeter Holm			return;
125*8a272653SPeter Holm		err(1, "mmap()");
126*8a272653SPeter Holm	}
127*8a272653SPeter Holm	child(depth, time(NULL) + STARTTIME);
128*8a272653SPeter Holm}
129*8a272653SPeter Holm
130*8a272653SPeter Holmint
131*8a272653SPeter Holmmain(void)
132*8a272653SPeter Holm{
133*8a272653SPeter Holm	pid_t pids[PARALLEL];
134*8a272653SPeter Holm	time_t start;
135*8a272653SPeter Holm	int i, n;
136*8a272653SPeter Holm
137*8a272653SPeter Holm	start = time(NULL);
138*8a272653SPeter Holm	while (time(NULL) - start < RUNTIME) {
139*8a272653SPeter Holm		n = arc4random() % PARALLEL + 1;
140*8a272653SPeter Holm		for (i = 0; i < n; i++) {
141*8a272653SPeter Holm			if ((pids[i] = fork()) == 0)
142*8a272653SPeter Holm				work(DEPTH);
143*8a272653SPeter Holm		}
144*8a272653SPeter Holm
145*8a272653SPeter Holm		sleep(CHILDTIME + STARTTIME + 1);
146*8a272653SPeter Holm
147*8a272653SPeter Holm		for (i = 0; i < n; i++)
148*8a272653SPeter Holm			if (waitpid(pids[i], NULL, 0) != pids[i])
149*8a272653SPeter Holm				err(1, "waitpid(%d)", pids[i]);
150*8a272653SPeter Holm	}
151*8a272653SPeter Holm
152*8a272653SPeter Holm	return (0);
153*8a272653SPeter Holm}
154