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# panic: vm_reserv_populate: reserv 0xfffff807cbd3c400 is already promoted 30*8a272653SPeter Holm# http://people.freebsd.org/~pho/stress/log/mmap21.txt 31*8a272653SPeter Holm# Fixed by r280238 32*8a272653SPeter Holm 33*8a272653SPeter Holm[ `id -u ` -ne 0 ] && echo "Must be root!" && exit 1 34*8a272653SPeter Holm 35*8a272653SPeter Holm. ../default.cfg 36*8a272653SPeter Holm 37*8a272653SPeter Holmhere=`pwd` 38*8a272653SPeter Holmcd /tmp 39*8a272653SPeter Holmsed '1,/^EOF/d' < $here/$0 > mmap21.c 40*8a272653SPeter Holmmycc -o mmap21 -Wall -Wextra -O2 -g mmap21.c -lpthread || exit 1 41*8a272653SPeter Holmrm -f mmap21.c 42*8a272653SPeter Holm 43*8a272653SPeter Holmsu $testuser -c /tmp/mmap21 44*8a272653SPeter Holm 45*8a272653SPeter Holmrm -f /tmp/mmap21 /tmp/mmap21.core 46*8a272653SPeter Holmexit 0 47*8a272653SPeter HolmEOF 48*8a272653SPeter Holm#include <sys/types.h> 49*8a272653SPeter Holm#include <sys/mman.h> 50*8a272653SPeter Holm#include <sys/stat.h> 51*8a272653SPeter Holm#include <sys/time.h> 52*8a272653SPeter Holm#include <sys/wait.h> 53*8a272653SPeter Holm 54*8a272653SPeter Holm#include <err.h> 55*8a272653SPeter Holm#include <fcntl.h> 56*8a272653SPeter Holm#include <pthread.h> 57*8a272653SPeter Holm#include <pthread_np.h> 58*8a272653SPeter Holm#include <signal.h> 59*8a272653SPeter Holm#include <stdio.h> 60*8a272653SPeter Holm#include <stdlib.h> 61*8a272653SPeter Holm#include <unistd.h> 62*8a272653SPeter Holm 63*8a272653SPeter Holm#define LOOPS 1 64*8a272653SPeter Holm#define NMAPS 50 65*8a272653SPeter Holm#define PARALLEL 2 66*8a272653SPeter Holm 67*8a272653SPeter Holmvoid *p; 68*8a272653SPeter Holm 69*8a272653SPeter Holmstatic void * 70*8a272653SPeter Holmtmmap(void *arg __unused) 71*8a272653SPeter Holm{ 72*8a272653SPeter Holm size_t len; 73*8a272653SPeter Holm int i; 74*8a272653SPeter Holm 75*8a272653SPeter Holm pthread_set_name_np(pthread_self(), __func__); 76*8a272653SPeter Holm len = 1LL * 128 * 1024 * 1024; 77*8a272653SPeter Holm 78*8a272653SPeter Holm for (i = 0; i < NMAPS; i++) 79*8a272653SPeter Holm p = mmap(NULL, len, PROT_READ | PROT_WRITE, MAP_ANON, -1, 0); 80*8a272653SPeter Holm 81*8a272653SPeter Holm return (NULL); 82*8a272653SPeter Holm} 83*8a272653SPeter Holm 84*8a272653SPeter Holmstatic void * 85*8a272653SPeter Holmtmlock(void *arg __unused) 86*8a272653SPeter Holm{ 87*8a272653SPeter Holm size_t len; 88*8a272653SPeter Holm int i, n; 89*8a272653SPeter Holm 90*8a272653SPeter Holm pthread_set_name_np(pthread_self(), __func__); 91*8a272653SPeter Holm n = 0; 92*8a272653SPeter Holm for (i = 0; i < 200; i++) { 93*8a272653SPeter Holm len = trunc_page(arc4random()); 94*8a272653SPeter Holm if (mlock(p, len) == 0) 95*8a272653SPeter Holm n++; 96*8a272653SPeter Holm len = trunc_page(arc4random()); 97*8a272653SPeter Holm if (arc4random() % 100 < 50) 98*8a272653SPeter Holm if (munlock(p, len) == 0) 99*8a272653SPeter Holm n++; 100*8a272653SPeter Holm } 101*8a272653SPeter Holm if (n < 10) 102*8a272653SPeter Holm fprintf(stderr, "Note: tmlock() only succeeded %d times.\n", 103*8a272653SPeter Holm n); 104*8a272653SPeter Holm 105*8a272653SPeter Holm return (NULL); 106*8a272653SPeter Holm} 107*8a272653SPeter Holm 108*8a272653SPeter Holmstatic void 109*8a272653SPeter Holmtest(void) 110*8a272653SPeter Holm{ 111*8a272653SPeter Holm pid_t pid; 112*8a272653SPeter Holm pthread_t tid[2]; 113*8a272653SPeter Holm int i, rc; 114*8a272653SPeter Holm 115*8a272653SPeter Holm if ((rc = pthread_create(&tid[0], NULL, tmmap, NULL)) != 0) 116*8a272653SPeter Holm errc(1, rc, "tmmap()"); 117*8a272653SPeter Holm if ((rc = pthread_create(&tid[1], NULL, tmlock, NULL)) != 0) 118*8a272653SPeter Holm errc(1, rc, "tmlock()"); 119*8a272653SPeter Holm 120*8a272653SPeter Holm for (i = 0; i < 100; i++) { 121*8a272653SPeter Holm if ((pid = fork()) == 0) { 122*8a272653SPeter Holm usleep(10000); 123*8a272653SPeter Holm _exit(0); 124*8a272653SPeter Holm } 125*8a272653SPeter Holm if (waitpid(pid, NULL, 0) != pid) 126*8a272653SPeter Holm err(1, "waitpid(%d)", pid); 127*8a272653SPeter Holm } 128*8a272653SPeter Holm 129*8a272653SPeter Holm raise(SIGSEGV); 130*8a272653SPeter Holm 131*8a272653SPeter Holm for (i = 0; i < 2; i++) 132*8a272653SPeter Holm if ((rc = pthread_join(tid[i], NULL)) != 0) 133*8a272653SPeter Holm errc(1, rc, "pthread_join(%d)", i); 134*8a272653SPeter Holm _exit(0); 135*8a272653SPeter Holm} 136*8a272653SPeter Holm 137*8a272653SPeter Holmint 138*8a272653SPeter Holmmain(void) 139*8a272653SPeter Holm{ 140*8a272653SPeter Holm 141*8a272653SPeter Holm pid_t pids[PARALLEL]; 142*8a272653SPeter Holm time_t start; 143*8a272653SPeter Holm int e, i, j, status; 144*8a272653SPeter Holm 145*8a272653SPeter Holm start = time(NULL); 146*8a272653SPeter Holm for (i = 0; i < LOOPS; i++) { 147*8a272653SPeter Holm for (j = 0; j < PARALLEL; j++) { 148*8a272653SPeter Holm if ((pids[j] = fork()) == 0) 149*8a272653SPeter Holm test(); 150*8a272653SPeter Holm } 151*8a272653SPeter Holm 152*8a272653SPeter Holm e = 0; 153*8a272653SPeter Holm for (j = 0; j < PARALLEL; j++) { 154*8a272653SPeter Holm if (waitpid(pids[j], &status, 0) == -1) 155*8a272653SPeter Holm err(1, "waitpid(%d)", pids[j]); 156*8a272653SPeter Holm e += status == 0 ? 0 : 1; 157*8a272653SPeter Holm } 158*8a272653SPeter Holm if (time(NULL) - start > 1200) { 159*8a272653SPeter Holm fprintf(stderr, "Timed out."); 160*8a272653SPeter Holm break; 161*8a272653SPeter Holm } 162*8a272653SPeter Holm } 163*8a272653SPeter Holm 164*8a272653SPeter Holm return (e); 165*8a272653SPeter Holm} 166