18a272653SPeter Holm#!/bin/sh 28a272653SPeter Holm 38a272653SPeter Holm# 48a272653SPeter Holm# Copyright (c) 2012 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[ `id -u ` -ne 0 ] && echo "Must be root!" && exit 1 308a272653SPeter Holm 318a272653SPeter Holm# Unmapped I/O test scenario: 328a272653SPeter Holm# http://people.freebsd.org/~pho/stress/log/kostik515.txt 338a272653SPeter Holm 348a272653SPeter Holm. ../default.cfg 358a272653SPeter Holm 368a272653SPeter Holmhere=`pwd` 378a272653SPeter Holmcd /tmp 388a272653SPeter Holmsed '1,/^EOF/d' < $here/$0 > rot.c 398a272653SPeter Holmmycc -o rot -Wall -Wextra -O2 -g rot.c || exit 1 408a272653SPeter Holmrm -f rot.c 418a272653SPeter Holmcd $here 428a272653SPeter Holm 438a272653SPeter Holmmount | grep $mntpoint | grep -q /dev/md && umount -f $mntpoint 448a272653SPeter Holmmdconfig -l | grep -q md$mdstart && mdconfig -d -u $mdstart 458a272653SPeter Holm 468a272653SPeter Holmmdconfig -a -t swap -s 2g -u $mdstart || exit 1 478a272653SPeter Holm 48*608c97bfSPeter Holmnewfs $newfs_flags md$mdstart > /dev/null 498a272653SPeter Holm 50*608c97bfSPeter Holmmount /dev/md$mdstart $mntpoint 518a272653SPeter Holmchmod 777 $mntpoint 528a272653SPeter Holm 538a272653SPeter Holm(cd $mntpoint; /tmp/rot) 548a272653SPeter Holm(cd `dirname $diskimage`; /tmp/rot) 558a272653SPeter Holm 568a272653SPeter Holmwhile mount | grep $mntpoint | grep -q /dev/md; do 578a272653SPeter Holm umount $mntpoint || sleep 1 588a272653SPeter Holmdone 598a272653SPeter Holmmdconfig -d -u $mdstart 608a272653SPeter Holmrm -f /tmp/rot 618a272653SPeter Holmexit 0 628a272653SPeter HolmEOF 638a272653SPeter Holm#include <err.h> 648a272653SPeter Holm#include <fcntl.h> 658a272653SPeter Holm#include <stdio.h> 668a272653SPeter Holm#include <stdlib.h> 678a272653SPeter Holm#include <sys/mman.h> 688a272653SPeter Holm#include <sys/wait.h> 698a272653SPeter Holm#include <time.h> 708a272653SPeter Holm#include <unistd.h> 718a272653SPeter Holm 728a272653SPeter Holm#define N 10240 /* 40 Mb */ 738a272653SPeter Holm#define PARALLEL 20 748a272653SPeter Holm#define RUNTIME (60 * 15) 758a272653SPeter Holm 768a272653SPeter Holmint 778a272653SPeter Holmtest(void) 788a272653SPeter Holm{ 798a272653SPeter Holm int fd, i, j, s; 808a272653SPeter Holm unsigned char *buf; 818a272653SPeter Holm char path[128]; 828a272653SPeter Holm 838a272653SPeter Holm s = getpagesize(); 848a272653SPeter Holm 858a272653SPeter Holm sprintf(path,"%s.%05d", getprogname(), getpid()); 868a272653SPeter Holm if ((fd = open(path, O_RDWR | O_CREAT | O_TRUNC, 0600)) < 0) 878a272653SPeter Holm err(1, "open(%s)", path); 888a272653SPeter Holm if (lseek(fd, s * N - 1, SEEK_SET) == -1) 898a272653SPeter Holm err(1, "lseek error"); 908a272653SPeter Holm 918a272653SPeter Holm /* write a dummy byte at the last location */ 928a272653SPeter Holm if (write(fd, "", 1) != 1) 938a272653SPeter Holm err(1, "write error"); 948a272653SPeter Holm 958a272653SPeter Holm for (i = 0; i < N; i++) { 968a272653SPeter Holm if ((buf = mmap(0, s, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 978a272653SPeter Holm i * s)) == MAP_FAILED) 988a272653SPeter Holm err(1, "write map"); 998a272653SPeter Holm for (j = 0; j < s; j++) 1008a272653SPeter Holm buf[j] = i % 256; 1018a272653SPeter Holm } 1028a272653SPeter Holm if (munmap(buf, s) == -1) 1038a272653SPeter Holm err(1, "unmap (write)"); 1048a272653SPeter Holm close(fd); 1058a272653SPeter Holm 1068a272653SPeter Holm if ((fd = open(path, O_RDONLY)) < 0) 1078a272653SPeter Holm err(1, "open(%s)", path); 1088a272653SPeter Holm for (i = 0; i < N; i++) { 1098a272653SPeter Holm if ((buf = mmap(0, s, PROT_READ, MAP_SHARED, fd, i * s)) == 1108a272653SPeter Holm MAP_FAILED) 1118a272653SPeter Holm err(1, "write map"); 1128a272653SPeter Holm for (j = 0; j < s; j++) 1138a272653SPeter Holm if (buf[j] != i % 256) 1148a272653SPeter Holm fprintf(stderr, "read %d, expected %d at %d\n", 1158a272653SPeter Holm buf[j], i % 256, i); 1168a272653SPeter Holm } 1178a272653SPeter Holm if (munmap(buf, s) == -1) 1188a272653SPeter Holm err(1, "unmap (read)"); 1198a272653SPeter Holm close(fd); 1208a272653SPeter Holm unlink(path); 1218a272653SPeter Holm 1228a272653SPeter Holm _exit(0); 1238a272653SPeter Holm} 1248a272653SPeter Holm 1258a272653SPeter Holmint 1268a272653SPeter Holmmain(void) 1278a272653SPeter Holm{ 1288a272653SPeter Holm time_t start; 1298a272653SPeter Holm int i; 1308a272653SPeter Holm 1318a272653SPeter Holm start = time(NULL); 1328a272653SPeter Holm while (time(NULL) - start < RUNTIME) { 1338a272653SPeter Holm for (i = 0; i < PARALLEL; i++) 1348a272653SPeter Holm if (fork() == 0) 1358a272653SPeter Holm test(); 1368a272653SPeter Holm for (i = 0; i < PARALLEL; i++) 1378a272653SPeter Holm wait(NULL); 1388a272653SPeter Holm } 1398a272653SPeter Holm 1408a272653SPeter Holm return(0); 1418a272653SPeter Holm} 142