1*8a272653SPeter Holm#!/bin/sh 2*8a272653SPeter Holm 3*8a272653SPeter Holm# 4*8a272653SPeter Holm# Copyright (c) 2013 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# "panic: vm_pageout_flush: partially invalid page xx index 0/1" seen. 30*8a272653SPeter Holm# Fixed in r255566. 31*8a272653SPeter Holm 32*8a272653SPeter Holm. ../default.cfg 33*8a272653SPeter Holm 34*8a272653SPeter Holmdir=/tmp 35*8a272653SPeter Holmodir=`pwd` 36*8a272653SPeter Holmcd $dir 37*8a272653SPeter Holmsed '1,/^EOF/d' < $odir/$0 > $dir/msync2.c 38*8a272653SPeter Holmmycc -o msync2 -Wall -Wextra msync2.c || exit 1 39*8a272653SPeter Holmrm -f msync2.c 40*8a272653SPeter Holmcd $odir 41*8a272653SPeter Holm 42*8a272653SPeter Holmdd if=/dev/zero bs=$((4096 + 1)) of=/tmp/msync2.inputfile count=1 \ 43*8a272653SPeter Holm status=none 44*8a272653SPeter Holm/tmp/msync2 /tmp/msync2.inputfile 45*8a272653SPeter Holmrm -f /tmp/msync2 /tmp/msync2.inputfile 46*8a272653SPeter Holmexit 47*8a272653SPeter Holm 48*8a272653SPeter HolmEOF 49*8a272653SPeter Holm#include <sys/param.h> 50*8a272653SPeter Holm#include <sys/fcntl.h> 51*8a272653SPeter Holm#include <sys/mman.h> 52*8a272653SPeter Holm#include <sys/stat.h> 53*8a272653SPeter Holm#include <sys/wait.h> 54*8a272653SPeter Holm 55*8a272653SPeter Holm#include <err.h> 56*8a272653SPeter Holm#include <errno.h> 57*8a272653SPeter Holm#include <stdlib.h> 58*8a272653SPeter Holm#include <time.h> 59*8a272653SPeter Holm#include <unistd.h> 60*8a272653SPeter Holm 61*8a272653SPeter Holm#define RUNTIME 400 62*8a272653SPeter Holm 63*8a272653SPeter Holmconst char *file; 64*8a272653SPeter Holmchar c; 65*8a272653SPeter Holm 66*8a272653SPeter Holmvoid 67*8a272653SPeter Holmwr(void) 68*8a272653SPeter Holm{ 69*8a272653SPeter Holm struct stat st; 70*8a272653SPeter Holm char *p1; 71*8a272653SPeter Holm size_t len; 72*8a272653SPeter Holm int error, fd; 73*8a272653SPeter Holm 74*8a272653SPeter Holm if ((fd = open(file, O_RDWR)) == -1) 75*8a272653SPeter Holm err(1, "open %s", file); 76*8a272653SPeter Holm if ((error = fstat(fd, &st)) == -1) 77*8a272653SPeter Holm err(1, "stat(%s)", file); 78*8a272653SPeter Holm len = round_page(st.st_size); 79*8a272653SPeter Holm if ((p1 = mmap(NULL, len, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0)) == 80*8a272653SPeter Holm MAP_FAILED) 81*8a272653SPeter Holm err(1, "mmap"); 82*8a272653SPeter Holm// p1[len - 1] = 1; /* No panic with this */ 83*8a272653SPeter Holm p1[arc4random() % len] = 1; /* Need this for the panic */ 84*8a272653SPeter Holm 85*8a272653SPeter Holm if ((error = msync(p1, len, MS_SYNC | MS_INVALIDATE)) == -1) 86*8a272653SPeter Holm if (errno != EBUSY) 87*8a272653SPeter Holm err(1, "msync"); 88*8a272653SPeter Holm 89*8a272653SPeter Holm if (munmap(p1, len) == -1) 90*8a272653SPeter Holm err(1, "unmap()"); 91*8a272653SPeter Holm close(fd); 92*8a272653SPeter Holm 93*8a272653SPeter Holm _exit(0); 94*8a272653SPeter Holm} 95*8a272653SPeter Holm 96*8a272653SPeter Holmvoid 97*8a272653SPeter Holmtest(void) 98*8a272653SPeter Holm{ 99*8a272653SPeter Holm#if 1 100*8a272653SPeter Holm int i; 101*8a272653SPeter Holm 102*8a272653SPeter Holm for (i = 0; i < 3; i++) 103*8a272653SPeter Holm if (fork() == 0) 104*8a272653SPeter Holm wr(); 105*8a272653SPeter Holm for (i = 0; i < 3; i++) 106*8a272653SPeter Holm wait(NULL); 107*8a272653SPeter Holm#else 108*8a272653SPeter Holm wr(); /* No problem here */ 109*8a272653SPeter Holm#endif 110*8a272653SPeter Holm 111*8a272653SPeter Holm _exit(0); 112*8a272653SPeter Holm} 113*8a272653SPeter Holm 114*8a272653SPeter Holmint 115*8a272653SPeter Holmmain(int argc, char *argv[]) 116*8a272653SPeter Holm{ 117*8a272653SPeter Holm time_t start; 118*8a272653SPeter Holm 119*8a272653SPeter Holm if (argc != 2) 120*8a272653SPeter Holm errx(1, "Usage: %s <file>", argv[0]); 121*8a272653SPeter Holm file = argv[1]; 122*8a272653SPeter Holm 123*8a272653SPeter Holm start = time(NULL); 124*8a272653SPeter Holm while (time(NULL) - start < RUNTIME) { 125*8a272653SPeter Holm if (fork() == 0) 126*8a272653SPeter Holm test(); 127*8a272653SPeter Holm wait(NULL); 128*8a272653SPeter Holm } 129*8a272653SPeter Holm 130*8a272653SPeter Holm return (0); 131*8a272653SPeter Holm} 132