1*8a272653SPeter Holm#!/bin/sh 2*8a272653SPeter Holm 3*8a272653SPeter Holm# 4*8a272653SPeter Holm# Copyright (c) 2014 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# Missing wakeup in the bufobj_wwait(). 30*8a272653SPeter Holm 31*8a272653SPeter Holm# Snapshot of WiP work. 32*8a272653SPeter Holm# http://people.freebsd.org/~pho/stress/log/mmap15.txt 33*8a272653SPeter Holm# Not fixed 34*8a272653SPeter Holm 35*8a272653SPeter Holm# panic: invalid size 36*8a272653SPeter Holm# http://people.freebsd.org/~pho/stress/log/kostik738.txt 37*8a272653SPeter Holm# Fixed in r274878 38*8a272653SPeter Holm 39*8a272653SPeter Holm[ `id -u ` -ne 0 ] && echo "Must be root!" && exit 1 40*8a272653SPeter Holm 41*8a272653SPeter Holm. ../default.cfg 42*8a272653SPeter Holm 43*8a272653SPeter Holmhere=`pwd` 44*8a272653SPeter Holmcd /tmp 45*8a272653SPeter Holmsed '1,/^EOF/d' < $here/$0 > mmap15.c 46*8a272653SPeter Holmmycc -o mmap15 -Wall -Wextra -O2 -g mmap15.c -lpthread || exit 1 47*8a272653SPeter Holmrm -f mmap15.c 48*8a272653SPeter Holm 49*8a272653SPeter Holmfor i in `jot 2`; do 50*8a272653SPeter Holm su $testuser -c /tmp/mmap15 & 51*8a272653SPeter Holmdone 52*8a272653SPeter Holmsleep 300 53*8a272653SPeter Holmwhile pgrep -q mmap15; do 54*8a272653SPeter Holm pkill -9 mmap15 55*8a272653SPeter Holm sleep 2 56*8a272653SPeter Holmdone 57*8a272653SPeter Holmwait 58*8a272653SPeter Holm 59*8a272653SPeter Holmrm -f /tmp/mmap15 /tmp/mmap15.core 60*8a272653SPeter Holmexit 0 61*8a272653SPeter HolmEOF 62*8a272653SPeter Holm#include <sys/types.h> 63*8a272653SPeter Holm#include <sys/mman.h> 64*8a272653SPeter Holm#include <sys/stat.h> 65*8a272653SPeter Holm#include <sys/time.h> 66*8a272653SPeter Holm#include <sys/wait.h> 67*8a272653SPeter Holm 68*8a272653SPeter Holm#include <err.h> 69*8a272653SPeter Holm#include <errno.h> 70*8a272653SPeter Holm#include <fcntl.h> 71*8a272653SPeter Holm#include <pthread.h> 72*8a272653SPeter Holm#include <pthread_np.h> 73*8a272653SPeter Holm#include <signal.h> 74*8a272653SPeter Holm#include <stdio.h> 75*8a272653SPeter Holm#include <stdlib.h> 76*8a272653SPeter Holm#include <string.h> 77*8a272653SPeter Holm#include <time.h> 78*8a272653SPeter Holm#include <unistd.h> 79*8a272653SPeter Holm 80*8a272653SPeter Holm#define LOOPS 2 81*8a272653SPeter Holm#define MMSIZE (256 * 1024) 82*8a272653SPeter Holm#define N (128 * 1024 / (int)sizeof(u_int32_t)) 83*8a272653SPeter Holm#define PARALLEL 50 84*8a272653SPeter Holm 85*8a272653SPeter Holmvoid *p; 86*8a272653SPeter Holmu_int32_t r[N]; 87*8a272653SPeter Holm 88*8a272653SPeter Holmunsigned long 89*8a272653SPeter Holmmakearg(void) 90*8a272653SPeter Holm{ 91*8a272653SPeter Holm unsigned long val; 92*8a272653SPeter Holm unsigned int i; 93*8a272653SPeter Holm 94*8a272653SPeter Holm val = arc4random(); 95*8a272653SPeter Holm i = arc4random() % 100; 96*8a272653SPeter Holm if (i < 20) 97*8a272653SPeter Holm val = val & 0xff; 98*8a272653SPeter Holm if (i >= 20 && i < 40) 99*8a272653SPeter Holm val = val & 0xffff; 100*8a272653SPeter Holm if (i >= 40 && i < 60) 101*8a272653SPeter Holm val = (unsigned long)(r) | (val & 0xffff); 102*8a272653SPeter Holm#if defined(__LP64__) 103*8a272653SPeter Holm if (i >= 60) { 104*8a272653SPeter Holm val = (val << 32) | arc4random(); 105*8a272653SPeter Holm if (i > 80) 106*8a272653SPeter Holm val = val & 0x00007fffffffffffUL; 107*8a272653SPeter Holm } 108*8a272653SPeter Holm#endif 109*8a272653SPeter Holm 110*8a272653SPeter Holm return(val); 111*8a272653SPeter Holm} 112*8a272653SPeter Holm 113*8a272653SPeter Holmvoid * 114*8a272653SPeter Holmmakeptr(void) 115*8a272653SPeter Holm{ 116*8a272653SPeter Holm unsigned long val; 117*8a272653SPeter Holm 118*8a272653SPeter Holm if (p != MAP_FAILED && p != NULL) 119*8a272653SPeter Holm val = (unsigned long)p + arc4random(); 120*8a272653SPeter Holm else 121*8a272653SPeter Holm val = makearg(); 122*8a272653SPeter Holm val = trunc_page(val); 123*8a272653SPeter Holm 124*8a272653SPeter Holm return ((void *)val); 125*8a272653SPeter Holm} 126*8a272653SPeter Holm 127*8a272653SPeter Holmvoid * 128*8a272653SPeter Holmtmmap(void *arg __unused) 129*8a272653SPeter Holm{ 130*8a272653SPeter Holm size_t len; 131*8a272653SPeter Holm int i, j, fd; 132*8a272653SPeter Holm 133*8a272653SPeter Holm pthread_set_name_np(pthread_self(), __func__); 134*8a272653SPeter Holm len = MMSIZE; 135*8a272653SPeter Holm 136*8a272653SPeter Holm if ((fd = open("/dev/zero", O_RDWR)) == -1) 137*8a272653SPeter Holm err(1,"open()"); 138*8a272653SPeter Holm for (i = 0, j = 0; i < 100; i++) { 139*8a272653SPeter Holm p = mmap(NULL, len, PROT_READ | PROT_WRITE, MAP_PRIVATE, fd, 0); 140*8a272653SPeter Holm if (p != MAP_FAILED) 141*8a272653SPeter Holm j++; 142*8a272653SPeter Holm p = mmap(NULL, len, PROT_READ | PROT_WRITE, MAP_ANON, -1, 0); 143*8a272653SPeter Holm if (p != MAP_FAILED) 144*8a272653SPeter Holm j++; 145*8a272653SPeter Holm } 146*8a272653SPeter Holm if (j == 0) 147*8a272653SPeter Holm fprintf(stderr, "FAIL: all mmap(2) calls failed.\n"); 148*8a272653SPeter Holm close(fd); 149*8a272653SPeter Holm 150*8a272653SPeter Holm return (NULL); 151*8a272653SPeter Holm} 152*8a272653SPeter Holm 153*8a272653SPeter Holmvoid * 154*8a272653SPeter Holmtmlock(void *arg __unused) 155*8a272653SPeter Holm{ 156*8a272653SPeter Holm size_t len; 157*8a272653SPeter Holm int i, n; 158*8a272653SPeter Holm 159*8a272653SPeter Holm pthread_set_name_np(pthread_self(), __func__); 160*8a272653SPeter Holm n = 0; 161*8a272653SPeter Holm for (i = 0; i < 200; i++) { 162*8a272653SPeter Holm len = trunc_page(makearg()); 163*8a272653SPeter Holm if (mlock(makeptr(), len) == 0) 164*8a272653SPeter Holm n++; 165*8a272653SPeter Holm len = trunc_page(makearg()); 166*8a272653SPeter Holm if (arc4random() % 100 < 50) 167*8a272653SPeter Holm if (munlock(makeptr(), len) == 0) 168*8a272653SPeter Holm n++; 169*8a272653SPeter Holm } 170*8a272653SPeter Holm if (n < 10) 171*8a272653SPeter Holm fprintf(stderr, "Note: tmlock() only succeeded %d times.\n", 172*8a272653SPeter Holm n); 173*8a272653SPeter Holm 174*8a272653SPeter Holm return (NULL); 175*8a272653SPeter Holm} 176*8a272653SPeter Holm 177*8a272653SPeter Holmvoid 178*8a272653SPeter Holmtest(void) 179*8a272653SPeter Holm{ 180*8a272653SPeter Holm pthread_t tid[2]; 181*8a272653SPeter Holm int i, rc; 182*8a272653SPeter Holm 183*8a272653SPeter Holm if ((rc = pthread_create(&tid[0], NULL, tmmap, NULL)) != 0) 184*8a272653SPeter Holm errc(1, rc, "tmmap()"); 185*8a272653SPeter Holm if ((rc = pthread_create(&tid[1], NULL, tmlock, NULL)) != 0) 186*8a272653SPeter Holm errc(1, rc, "tmlock()"); 187*8a272653SPeter Holm 188*8a272653SPeter Holm for (i = 0; i < 100; i++) { 189*8a272653SPeter Holm if (fork() == 0) { 190*8a272653SPeter Holm usleep(10000); 191*8a272653SPeter Holm _exit(0); 192*8a272653SPeter Holm } 193*8a272653SPeter Holm wait(NULL); 194*8a272653SPeter Holm } 195*8a272653SPeter Holm 196*8a272653SPeter Holm raise(SIGSEGV); 197*8a272653SPeter Holm 198*8a272653SPeter Holm for (i = 0; i < 2; i++) 199*8a272653SPeter Holm if ((rc = pthread_join(tid[i], NULL)) != 0) 200*8a272653SPeter Holm errc(1, rc, "pthread_join(%d)", i); 201*8a272653SPeter Holm _exit(0); 202*8a272653SPeter Holm} 203*8a272653SPeter Holm 204*8a272653SPeter Holmint 205*8a272653SPeter Holmmain(void) 206*8a272653SPeter Holm{ 207*8a272653SPeter Holm int i, j; 208*8a272653SPeter Holm 209*8a272653SPeter Holm for (i = 0; i < N; i++) 210*8a272653SPeter Holm r[i] = arc4random(); 211*8a272653SPeter Holm 212*8a272653SPeter Holm for (i = 0; i < LOOPS; i++) { 213*8a272653SPeter Holm for (j = 0; j < PARALLEL; j++) { 214*8a272653SPeter Holm if (fork() == 0) 215*8a272653SPeter Holm test(); 216*8a272653SPeter Holm } 217*8a272653SPeter Holm 218*8a272653SPeter Holm for (j = 0; j < PARALLEL; j++) 219*8a272653SPeter Holm wait(NULL); 220*8a272653SPeter Holm } 221*8a272653SPeter Holm 222*8a272653SPeter Holm return (0); 223*8a272653SPeter Holm} 224