1*8a272653SPeter Holm#!/bin/sh 2*8a272653SPeter Holm 3*8a272653SPeter Holm# 4*8a272653SPeter Holm# Copyright (c) 2009 Peter Holm <pho@FreeBSD.org> 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# Stress mmap by having at most 100 threads mapping random areas within 30*8a272653SPeter Holm# a 100 Mb range. 31*8a272653SPeter Holm 32*8a272653SPeter Holm# Test scenario by kib@ 33*8a272653SPeter Holm 34*8a272653SPeter Holm. ../default.cfg 35*8a272653SPeter Holm 36*8a272653SPeter Holmodir=`pwd` 37*8a272653SPeter Holmcd /tmp 38*8a272653SPeter Holmsed '1,/^EOF/d' < $odir/$0 > mmap2.c 39*8a272653SPeter Holmmycc -o mmap2 -Wall -g mmap2.c -lpthread 40*8a272653SPeter Holmrm -f mmap2.c 41*8a272653SPeter Holm 42*8a272653SPeter Holmstart=`date '+%s'` 43*8a272653SPeter Holmwhile [ $((`date '+%s'` - start)) -lt 600 ]; do 44*8a272653SPeter Holm ./mmap2 45*8a272653SPeter Holmdone 46*8a272653SPeter Holmrm -f ./mmap2* 47*8a272653SPeter Holmexit 48*8a272653SPeter Holm 49*8a272653SPeter HolmEOF 50*8a272653SPeter Holm#include <sys/types.h> 51*8a272653SPeter Holm#include <err.h> 52*8a272653SPeter Holm#include <stdio.h> 53*8a272653SPeter Holm#include <stdlib.h> 54*8a272653SPeter Holm#include <unistd.h> 55*8a272653SPeter Holm#include <fcntl.h> 56*8a272653SPeter Holm#include <pthread.h> 57*8a272653SPeter Holm#include <sys/mman.h> 58*8a272653SPeter Holm#include <sys/param.h> 59*8a272653SPeter Holm#include <string.h> 60*8a272653SPeter Holm#include <unistd.h> 61*8a272653SPeter Holm#include <errno.h> 62*8a272653SPeter Holm 63*8a272653SPeter Holm#define THREADS 100 64*8a272653SPeter Holm#define STARTADDR 0x50000000U 65*8a272653SPeter Holm#define ADRSPACE 0x06400000U /* 100 Mb */ 66*8a272653SPeter Holm 67*8a272653SPeter Holmstatic void 68*8a272653SPeter Holmwork(int nr) 69*8a272653SPeter Holm{ 70*8a272653SPeter Holm int fd, m; 71*8a272653SPeter Holm void *p; 72*8a272653SPeter Holm size_t left, len; 73*8a272653SPeter Holm char path[128]; 74*8a272653SPeter Holm 75*8a272653SPeter Holm p = (void *)STARTADDR + trunc_page(arc4random() % ADRSPACE); 76*8a272653SPeter Holm left = ADRSPACE - (size_t)p + STARTADDR; 77*8a272653SPeter Holm len = trunc_page(arc4random() % left) + PAGE_SIZE; 78*8a272653SPeter Holm fd = -1; 79*8a272653SPeter Holm 80*8a272653SPeter Holm if (arc4random() % 100 < 90) 81*8a272653SPeter Holm sprintf(path, "/tmp/mmap.%06d.%04d", getpid(), nr); 82*8a272653SPeter Holm else 83*8a272653SPeter Holm sprintf(path, "/dev/zero"); 84*8a272653SPeter Holm if (arc4random() % 2 == 0) { 85*8a272653SPeter Holm if ((fd = open(path, O_CREAT | O_TRUNC | O_RDWR, 0622)) == -1) 86*8a272653SPeter Holm err(1,"open()"); 87*8a272653SPeter Holm if (ftruncate(fd, len) == -1) 88*8a272653SPeter Holm err(1, "ftruncate"); 89*8a272653SPeter Holm if (arc4random() % 2 == 0) { 90*8a272653SPeter Holm if ((p = mmap(p, len, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0)) == 91*8a272653SPeter Holm MAP_FAILED) { 92*8a272653SPeter Holm if (errno == ENOMEM) 93*8a272653SPeter Holm return; 94*8a272653SPeter Holm err(1, "mmap()"); 95*8a272653SPeter Holm } 96*8a272653SPeter Holm } else { 97*8a272653SPeter Holm if ((p = mmap(p, len, PROT_READ | PROT_WRITE, MAP_PRIVATE, fd, 0)) == 98*8a272653SPeter Holm MAP_FAILED) { 99*8a272653SPeter Holm if (errno == ENOMEM) 100*8a272653SPeter Holm return; 101*8a272653SPeter Holm err(1, "mmap()"); 102*8a272653SPeter Holm } 103*8a272653SPeter Holm } 104*8a272653SPeter Holm if (fd > 0 && strcmp(path, "/dev/zero")) 105*8a272653SPeter Holm if (unlink(path) == -1) 106*8a272653SPeter Holm err(1, "unlink(%s)", path); 107*8a272653SPeter Holm } else { 108*8a272653SPeter Holm if ((p = mmap(p, len, PROT_READ | PROT_WRITE, MAP_ANON, -1, 0)) == MAP_FAILED) { 109*8a272653SPeter Holm if (errno == ENOMEM) 110*8a272653SPeter Holm return; 111*8a272653SPeter Holm err(1, "mmap()"); 112*8a272653SPeter Holm } 113*8a272653SPeter Holm strcpy(path, "anon"); 114*8a272653SPeter Holm } 115*8a272653SPeter Holm#if 0 116*8a272653SPeter Holm printf("nr = %d, %-14s, start = %p, end = %p, len = 0x%08x, (%5d pages)\n", 117*8a272653SPeter Holm nr, path, p, p + len, len, len>>PAGE_SHIFT); 118*8a272653SPeter Holm#endif 119*8a272653SPeter Holm 120*8a272653SPeter Holm *(int *)p = 1; 121*8a272653SPeter Holm 122*8a272653SPeter Holm if (arc4random() % 2 == 0) { 123*8a272653SPeter Holm m = arc4random() % 10; 124*8a272653SPeter Holm if (madvise(p, len, m) == -1) 125*8a272653SPeter Holm warn("madvise(%p, %zd, %d)", p, len, m); 126*8a272653SPeter Holm } 127*8a272653SPeter Holm if (arc4random() %2 == 0) 128*8a272653SPeter Holm if (mprotect(p, trunc_page(arc4random() % len), PROT_READ) == -1 ) 129*8a272653SPeter Holm err(1, "mprotect failed with error:"); 130*8a272653SPeter Holm if (arc4random() % 2 == 0) { 131*8a272653SPeter Holm if (arc4random() %2 == 0) { 132*8a272653SPeter Holm if (msync(p, 0, MS_SYNC) == -1) 133*8a272653SPeter Holm err(1, "msync(%p)", p); 134*8a272653SPeter Holm } else { 135*8a272653SPeter Holm if (msync(p, 0, MS_INVALIDATE) == -1) 136*8a272653SPeter Holm err(1, "msync(%p)", p); 137*8a272653SPeter Holm } 138*8a272653SPeter Holm } 139*8a272653SPeter Holm if (munmap(p, len) == -1) 140*8a272653SPeter Holm err(1, "munmap(%p)", p); 141*8a272653SPeter Holm close(fd); 142*8a272653SPeter Holm} 143*8a272653SPeter Holm 144*8a272653SPeter Holmvoid * 145*8a272653SPeter Holmthr(void *arg) 146*8a272653SPeter Holm{ 147*8a272653SPeter Holm int i; 148*8a272653SPeter Holm 149*8a272653SPeter Holm for (i = 0; i < 512; i++) { 150*8a272653SPeter Holm work(*(int *)arg); 151*8a272653SPeter Holm } 152*8a272653SPeter Holm return (0); 153*8a272653SPeter Holm} 154*8a272653SPeter Holm 155*8a272653SPeter Holmint 156*8a272653SPeter Holmmain(int argc, char **argv) 157*8a272653SPeter Holm{ 158*8a272653SPeter Holm pthread_t threads[THREADS]; 159*8a272653SPeter Holm int nr[THREADS]; 160*8a272653SPeter Holm int i, n, r; 161*8a272653SPeter Holm 162*8a272653SPeter Holm// printf("Address start 0x%x, address end 0x%x, pages %d\n", 163*8a272653SPeter Holm// STARTADDR, STARTADDR + ADRSPACE, ADRSPACE>>PAGE_SHIFT); 164*8a272653SPeter Holm n = arc4random() % THREADS + 1; 165*8a272653SPeter Holm for (i = 0; i < n; i++) { 166*8a272653SPeter Holm nr[i] = i; 167*8a272653SPeter Holm if ((r = pthread_create(&threads[i], NULL, thr, (void *)&nr[i])) != 0) 168*8a272653SPeter Holm errc(1, r, "pthread_create()"); 169*8a272653SPeter Holm } 170*8a272653SPeter Holm 171*8a272653SPeter Holm for (i = 0; i < n; i++) { 172*8a272653SPeter Holm if ((r = pthread_join(threads[i], NULL)) != 0) 173*8a272653SPeter Holm errc(1, r, "pthread_join(%d)", i); 174*8a272653SPeter Holm } 175*8a272653SPeter Holm 176*8a272653SPeter Holm return (0); 177*8a272653SPeter Holm} 178