xref: /freebsd/tools/test/stress2/misc/fragments.sh (revision 608c97bff921c8936eb71f4b1a177625cfa60250)
18a272653SPeter Holm#!/bin/sh
28a272653SPeter Holm
38a272653SPeter Holm#
48a272653SPeter Holm# Copyright (c) 2010 Peter Holm <pho@FreeBSD.org>
58a272653SPeter Holm# All rights reserved.
68a272653SPeter Holm#
78a272653SPeter Holm# Redistribution and use in source and binary forms, with or without
88a272653SPeter Holm# modification, are permitted provided that the following conditions
98a272653SPeter Holm# are met:
108a272653SPeter Holm# 1. Redistributions of source code must retain the above copyright
118a272653SPeter Holm#    notice, this list of conditions and the following disclaimer.
128a272653SPeter Holm# 2. Redistributions in binary form must reproduce the above copyright
138a272653SPeter Holm#    notice, this list of conditions and the following disclaimer in the
148a272653SPeter Holm#    documentation and/or other materials provided with the distribution.
158a272653SPeter Holm#
168a272653SPeter Holm# THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
178a272653SPeter Holm# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
188a272653SPeter Holm# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
198a272653SPeter Holm# ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
208a272653SPeter Holm# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
218a272653SPeter Holm# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
228a272653SPeter Holm# OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
238a272653SPeter Holm# HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
248a272653SPeter Holm# LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
258a272653SPeter Holm# OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
268a272653SPeter Holm# SUCH DAMAGE.
278a272653SPeter Holm#
288a272653SPeter Holm
298a272653SPeter Holm# Scenario that causes "panic: brelse: free buffer onto another queue???"
308a272653SPeter Holm# Idea for scenario by kib@. Fixed in r203818
318a272653SPeter Holm
328a272653SPeter Holm# When UFS partition is full, then some high load causes
338a272653SPeter Holm# panic: brelse: free buffer onto another queue???
348a272653SPeter Holm
358a272653SPeter Holm[ `id -u ` -ne 0 ] && echo "Must be root!" && exit 1
368a272653SPeter Holm
378a272653SPeter Holm. ../default.cfg
388a272653SPeter Holm
398a272653SPeter Holmhere=`pwd`
408a272653SPeter Holmcd /tmp
418a272653SPeter Holmsed '1,/^EOF/d' < $here/$0 > fragments.c
428a272653SPeter Holmrm -f /tmp/fragments
438a272653SPeter Holmmycc -o fragments -Wall -Wextra -O2 -g fragments.c
448a272653SPeter Holmrm -f fragments.c
458a272653SPeter Holmcd $here
468a272653SPeter Holm
478a272653SPeter Holmmount | grep "$mntpoint" | grep -q md$mdstart && umount -f $mntpoint
488a272653SPeter Holmmdconfig -l | grep -q md$mdstart &&  mdconfig -d -u $mdstart
498a272653SPeter Holm
508a272653SPeter Holmmdconfig -a -t swap -s 1g -u $mdstart
51*608c97bfSPeter Holmnewfs $newfs_flags -m 0 md$mdstart > /dev/null 2>&1
52*608c97bfSPeter Holmmount /dev/md$mdstart $mntpoint
538a272653SPeter Holmchmod 777 $mntpoint
548a272653SPeter Holm
558a272653SPeter Holmcd $mntpoint
568a272653SPeter Holmsu $testuser -c "/tmp/fragments"
578a272653SPeter Holmcd $here
588a272653SPeter Holm
598a272653SPeter Holmumount $mntpoint
608a272653SPeter Holmmount | grep "$mntpoint" | grep -q md$mdstart && umount -f $mntpoint
618a272653SPeter Holmmdconfig -l | grep -q md$mdstart &&  mdconfig -d -u $mdstart
628a272653SPeter Holm
638a272653SPeter Holmrm -f /tmp/fragments
648a272653SPeter Holmexit
658a272653SPeter HolmEOF
668a272653SPeter Holm#include <sys/param.h>
678a272653SPeter Holm#include <sys/mount.h>
688a272653SPeter Holm#include <sys/stat.h>
698a272653SPeter Holm#include <sys/wait.h>
708a272653SPeter Holm#include <err.h>
718a272653SPeter Holm#include <errno.h>
728a272653SPeter Holm#include <fcntl.h>
738a272653SPeter Holm#include <signal.h>
748a272653SPeter Holm#include <stdio.h>
758a272653SPeter Holm#include <stdlib.h>
768a272653SPeter Holm#include <string.h>
778a272653SPeter Holm#include <unistd.h>
788a272653SPeter Holm
798a272653SPeter Holm#define LOOPS 600
808a272653SPeter Holm#define PARALLEL 8
818a272653SPeter Holm
828a272653SPeter Holmstatic	pid_t pid;
838a272653SPeter Holmstatic	char *buf;
848a272653SPeter Holm
858a272653SPeter Holmstatic volatile sig_atomic_t stop;
868a272653SPeter Holm
878a272653SPeter Holmvoid
888a272653SPeter Holmhandler(int i __unused) {
898a272653SPeter Holm	stop = 1;
908a272653SPeter Holm}
918a272653SPeter Holm
928a272653SPeter Holmvoid
938a272653SPeter Holmcleanup(int n)
948a272653SPeter Holm{
958a272653SPeter Holm	int i, j, start;
968a272653SPeter Holm	int nb = 0;
978a272653SPeter Holm	char file[128];
988a272653SPeter Holm	struct statfs sbuf;
998a272653SPeter Holm	struct stat sb;
1008a272653SPeter Holm
1018a272653SPeter Holm	if (n == -1) {
1028a272653SPeter Holm		for (i = 0; i < LOOPS; i++) {
1038a272653SPeter Holm			sprintf(file,"t%05d", i);
1048a272653SPeter Holm			unlink(file);
1058a272653SPeter Holm		}
1068a272653SPeter Holm		return;
1078a272653SPeter Holm	}
1088a272653SPeter Holm
1098a272653SPeter Holm	start = arc4random() % n;
1108a272653SPeter Holm	for (i = 0; i < LOOPS; i++) {
1118a272653SPeter Holm		j = (start + i) % LOOPS;
1128a272653SPeter Holm		sprintf(file,"t%05d", j);
1138a272653SPeter Holm		if (stat(file, &sb) != 0)
1148a272653SPeter Holm			continue;
1158a272653SPeter Holm
1168a272653SPeter Holm		if (sb.st_size == 0) {
1178a272653SPeter Holm			unlink(file);
1188a272653SPeter Holm			continue;
1198a272653SPeter Holm		}
1208a272653SPeter Holm		if (truncate(file, 0) == 0) {
1218a272653SPeter Holm			nb++;
1228a272653SPeter Holm			continue;
1238a272653SPeter Holm		}
1248a272653SPeter Holm		if (nb > 10)
1258a272653SPeter Holm			break;
1268a272653SPeter Holm	}
1278a272653SPeter Holm
1288a272653SPeter Holm	for (i = 0; i < 10; i++) {
1298a272653SPeter Holm		if (statfs(".", &sbuf) < 0)
1308a272653SPeter Holm			err(1, "statfs(%s)", ".");
1318a272653SPeter Holm
1328a272653SPeter Holm		if (sbuf.f_bfree > 8)
1338a272653SPeter Holm			return;
1348a272653SPeter Holm	}
1358a272653SPeter Holm
1368a272653SPeter Holm	for (i = 0; i < LOOPS; i++) {
1378a272653SPeter Holm		j = (start + i) % LOOPS;
1388a272653SPeter Holm		sprintf(file,"t%05d", j);
1398a272653SPeter Holm		if (unlink(file) == 0) {
1408a272653SPeter Holm			return;
1418a272653SPeter Holm		}
1428a272653SPeter Holm	}
1438a272653SPeter Holm}
1448a272653SPeter Holm
1458a272653SPeter Holmvoid
1468a272653SPeter Holmfragments(void)
1478a272653SPeter Holm{
1488a272653SPeter Holm	int i, len;
1498a272653SPeter Holm	char file[128];
1508a272653SPeter Holm	int fd;
1518a272653SPeter Holm
1528a272653SPeter Holm	for (i = 0;; i++) {
1538a272653SPeter Holm		sprintf(file,"d%d/f%05d.%05d", i/1000, pid, i);
1548a272653SPeter Holm
1558a272653SPeter Holm		if ((fd = open(file, O_RDWR | O_CREAT | O_TRUNC, 0600)) < 0) {
1568a272653SPeter Holm			if (errno != ENOSPC)
1578a272653SPeter Holm				warn("open(%s)", file);
1588a272653SPeter Holm			break;
1598a272653SPeter Holm		}
1608a272653SPeter Holm
1618a272653SPeter Holm		len =  2 * 1024;
1628a272653SPeter Holm		if (write(fd, buf, len) != len) {
1638a272653SPeter Holm		}
1648a272653SPeter Holm
1658a272653SPeter Holm		close(fd);
1668a272653SPeter Holm	}
1678a272653SPeter Holm}
1688a272653SPeter Holm
1698a272653SPeter Holmvoid
1708a272653SPeter Holmblocks(void)
1718a272653SPeter Holm{
1728a272653SPeter Holm	int i, len;
1738a272653SPeter Holm	char file[128];
1748a272653SPeter Holm	int fd;
1758a272653SPeter Holm
1768a272653SPeter Holm	for (i = 0;; i++) {
1778a272653SPeter Holm		sprintf(file,"d%d/b%05d.%05d", i/1000, pid, i);
1788a272653SPeter Holm
1798a272653SPeter Holm		if ((fd = open(file, O_RDWR | O_CREAT | O_TRUNC, 0600)) < 0) {
1808a272653SPeter Holm			if (errno != ENOSPC)
1818a272653SPeter Holm				warn("open(%s)", file);
1828a272653SPeter Holm			break;
1838a272653SPeter Holm		}
1848a272653SPeter Holm
1858a272653SPeter Holm		len =  16 * 1024;
1868a272653SPeter Holm		if (write(fd, buf, len) != len) {
1878a272653SPeter Holm		}
1888a272653SPeter Holm
1898a272653SPeter Holm		close(fd);
1908a272653SPeter Holm	}
1918a272653SPeter Holm}
1928a272653SPeter Holm
1938a272653SPeter Holmvoid
1948a272653SPeter Holmsetup(void)
1958a272653SPeter Holm{
1968a272653SPeter Holm	int i;
1978a272653SPeter Holm	char file[128];
1988a272653SPeter Holm
1998a272653SPeter Holm	for (i = 0; i < 300; i++) {
2008a272653SPeter Holm		sprintf(file,"d%d", i);
2018a272653SPeter Holm		if (mkdir(file, 0700) == -1)
2028a272653SPeter Holm			warn("mkdir(%s)", file);
2038a272653SPeter Holm	}
2048a272653SPeter Holm
2058a272653SPeter Holm	blocks();
2068a272653SPeter Holm	fragments();
2078a272653SPeter Holm
2088a272653SPeter Holm	for (i = 0;i < 8; i++) {
2098a272653SPeter Holm		sprintf(file,"d%d/b%05d.%05d", i/1000, pid, i);
2108a272653SPeter Holm		unlink(file);
2118a272653SPeter Holm	}
2128a272653SPeter Holm	for (i = 0;i < 1; i++) {
2138a272653SPeter Holm		sprintf(file,"d%d/f%05d.%05d", i/1000, pid, i);
2148a272653SPeter Holm		unlink(file);
2158a272653SPeter Holm	}
2168a272653SPeter Holm
2178a272653SPeter Holm}
2188a272653SPeter Holm
2198a272653SPeter Holmint
2208a272653SPeter Holmtest(void)
2218a272653SPeter Holm{
2228a272653SPeter Holm	int i, len, n;
2238a272653SPeter Holm	char file[128];
2248a272653SPeter Holm	int fd;
2258a272653SPeter Holm
2268a272653SPeter Holm	for (i = 0; i < LOOPS; i++) {
2278a272653SPeter Holm		sprintf(file,"t%05d", i);
2288a272653SPeter Holm
2298a272653SPeter Holm		if ((fd = open(file, O_RDWR | O_CREAT | O_EXCL, 0600)) < 0) {
2308a272653SPeter Holm			continue;
2318a272653SPeter Holm		}
2328a272653SPeter Holm//		n = arc4random() % (12 + 1);
2338a272653SPeter Holm		n = 0;
2348a272653SPeter Holm                len = (arc4random() % (16 * 1024) + 1) + n * 16;
2358a272653SPeter Holm		while (len > 0) {
2368a272653SPeter Holm			if (write(fd, buf, len) == len)
2378a272653SPeter Holm				break;
2388a272653SPeter Holm			len = len / 2;
2398a272653SPeter Holm			usleep(1000);
2408a272653SPeter Holm		}
2418a272653SPeter Holm		close(fd);
2428a272653SPeter Holm		if (len == 0) {
2438a272653SPeter Holm			cleanup(i);
2448a272653SPeter Holm		}
2458a272653SPeter Holm	}
2468a272653SPeter Holm
2478a272653SPeter Holm	exit(0);
2488a272653SPeter Holm
2498a272653SPeter Holm	return (0);
2508a272653SPeter Holm}
2518a272653SPeter Holm
2528a272653SPeter Holmint
2538a272653SPeter Holmmain()
2548a272653SPeter Holm{
2558a272653SPeter Holm	int i, j, status;
2568a272653SPeter Holm
2578a272653SPeter Holm	pid = getpid();
2588a272653SPeter Holm	if ((buf = malloc(12 * 16 * 1024)) == NULL)
2598a272653SPeter Holm		err(1, "malloc()");
2608a272653SPeter Holm
2618a272653SPeter Holm	setup();
2628a272653SPeter Holm	signal(SIGALRM, handler);
2638a272653SPeter Holm	alarm(30 * 60);
2648a272653SPeter Holm	for (j = 0; j < 50 && stop == 0; j++) {
2658a272653SPeter Holm		for (i = 0; i < PARALLEL; i++) {
2668a272653SPeter Holm			if (fork() == 0)
2678a272653SPeter Holm				test();
2688a272653SPeter Holm		}
2698a272653SPeter Holm		for (i = 0; i < PARALLEL; i++)
2708a272653SPeter Holm			wait(&status);
2718a272653SPeter Holm		cleanup(-1);
2728a272653SPeter Holm	}
2738a272653SPeter Holm        return (0);
2748a272653SPeter Holm}
275