18a272653SPeter Holm#!/bin/sh 28a272653SPeter Holm 38a272653SPeter Holm# 4*4d846d26SWarner Losh# SPDX-License-Identifier: BSD-2-Clause 58a272653SPeter Holm# 68a272653SPeter Holm# Copyright (c) 2019 Dell EMC Isilon 78a272653SPeter Holm# 88a272653SPeter Holm# Redistribution and use in source and binary forms, with or without 98a272653SPeter Holm# modification, are permitted provided that the following conditions 108a272653SPeter Holm# are met: 118a272653SPeter Holm# 1. Redistributions of source code must retain the above copyright 128a272653SPeter Holm# notice, this list of conditions and the following disclaimer. 138a272653SPeter Holm# 2. Redistributions in binary form must reproduce the above copyright 148a272653SPeter Holm# notice, this list of conditions and the following disclaimer in the 158a272653SPeter Holm# documentation and/or other materials provided with the distribution. 168a272653SPeter Holm# 178a272653SPeter Holm# THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 188a272653SPeter Holm# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 198a272653SPeter Holm# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 208a272653SPeter Holm# ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 218a272653SPeter Holm# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 228a272653SPeter Holm# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 238a272653SPeter Holm# OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 248a272653SPeter Holm# HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 258a272653SPeter Holm# LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 268a272653SPeter Holm# OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 278a272653SPeter Holm# SUCH DAMAGE. 288a272653SPeter Holm# 298a272653SPeter Holm 308a272653SPeter Holm# Test scenario based on alc@'s suggestion for D19826 318a272653SPeter Holm# No problems seen. 328a272653SPeter Holm 338a272653SPeter Holm[ `id -u ` -ne 0 ] && echo "Must be root!" && exit 1 348a272653SPeter Holm 358a272653SPeter Holm. ../default.cfg 368a272653SPeter Holm 378a272653SPeter Holmdir=/tmp 388a272653SPeter Holmodir=`pwd` 398a272653SPeter Holmcd $dir 408a272653SPeter Holmsed '1,/^EOF/d' < $odir/$0 > $dir/vm_map.c 418a272653SPeter Holmmycc -o vm_map -Wall -Wextra -O2 vm_map.c || exit 1 428a272653SPeter Holmrm -f vm_map.c 438a272653SPeter Holm 448a272653SPeter Holmpages=$((`sysctl -n hw.usermem` / `sysctl -n hw.pagesize`)) 458a272653SPeter Holm[ `sysctl -n vm.swap_total` -eq 0 ] && 468a272653SPeter Holm pages=$((pages / 10 * 8)) 47e86b5a62SPeter Holmproccontrol -m aslr -s disable /tmp/vm_map $pages 488a272653SPeter Holm 498a272653SPeter Holmrm -f /tmp/vm_map 508a272653SPeter Holmexit $s 518a272653SPeter HolmEOF 528a272653SPeter Holm#include <sys/param.h> 538a272653SPeter Holm#include <sys/mman.h> 548a272653SPeter Holm#include <sys/time.h> 558a272653SPeter Holm#include <sys/wait.h> 568a272653SPeter Holm 578a272653SPeter Holm#include <err.h> 588a272653SPeter Holm#include <stdio.h> 598a272653SPeter Holm#include <stdlib.h> 608a272653SPeter Holm#include <unistd.h> 618a272653SPeter Holm 628a272653SPeter Holmstatic long n; 638a272653SPeter Holm 648a272653SPeter Holm#define RUNTIME (2 * 60) 658a272653SPeter Holm#define INCARNATIONS 32 668a272653SPeter Holm 678a272653SPeter Holmint 688a272653SPeter Holmtest(void) 698a272653SPeter Holm{ 708a272653SPeter Holm size_t len; 718a272653SPeter Holm time_t start; 728a272653SPeter Holm void *a; 738a272653SPeter Holm char **c; 748a272653SPeter Holm int i; 758a272653SPeter Holm 768a272653SPeter Holm a = NULL; 778a272653SPeter Holm c = calloc(n, sizeof(char *)); 788a272653SPeter Holm len = PAGE_SIZE; 798a272653SPeter Holm start = time(NULL); 808a272653SPeter Holm while ((time(NULL) - start) < RUNTIME) { 818a272653SPeter Holm for (i = 0; i < n; i++) { 828a272653SPeter Holm if ((a = mmap((void *)a, len, PROT_READ | PROT_WRITE, 838a272653SPeter Holm MAP_ANON | MAP_SHARED, -1, 0)) == MAP_FAILED) 848a272653SPeter Holm err(1, "mmap"); 858a272653SPeter Holm c[i] = a; 868a272653SPeter Holm *c[i] = 1; 878a272653SPeter Holm a += PAGE_SIZE; 888a272653SPeter Holm } 898a272653SPeter Holm for (i = 0; i < n; i++) { 908a272653SPeter Holm if (munmap(c[i], PAGE_SIZE) == -1) 918a272653SPeter Holm err(1, "munmap(%p)", c[i]); 928a272653SPeter Holm } 938a272653SPeter Holm a = NULL; 948a272653SPeter Holm } 958a272653SPeter Holm 968a272653SPeter Holm _exit(0); 978a272653SPeter Holm} 988a272653SPeter Holm 998a272653SPeter Holmint 1008a272653SPeter Holmmain(int argc, char *argv[]) 1018a272653SPeter Holm{ 1028a272653SPeter Holm int i; 1038a272653SPeter Holm 1048a272653SPeter Holm if (argc != 2) { 1058a272653SPeter Holm fprintf(stderr, "Usage %s <pages>\n", argv[0]); 1068a272653SPeter Holm exit(1); 1078a272653SPeter Holm } 1088a272653SPeter Holm n = atol(argv[1]) / INCARNATIONS; 1098a272653SPeter Holm for (i = 0; i < INCARNATIONS; i++) 1108a272653SPeter Holm if (fork() == 0) 1118a272653SPeter Holm test(); 1128a272653SPeter Holm 1138a272653SPeter Holm for (i = 0; i < INCARNATIONS; i++) 1148a272653SPeter Holm wait(NULL); 1158a272653SPeter Holm 1168a272653SPeter Holm return (0); 1178a272653SPeter Holm} 118