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# Swap test. Variation of testcases/swap. 30*8a272653SPeter Holm# OOM seen: https://people.freebsd.org/~pho/stress/log/swap.txt 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/swap.c 38*8a272653SPeter Holmmycc -o swap -Wall -Wextra -O2 swap.c || exit 1 39*8a272653SPeter Holmrm -f swap.c 40*8a272653SPeter Holm 41*8a272653SPeter Holmusermem=`sysctl hw.usermem | sed 's/.* //'` 42*8a272653SPeter Holm 43*8a272653SPeter Holmif [ `sysctl -n vm.swap_total` -gt 0 ]; then 44*8a272653SPeter Holm size=$((usermem/10*11)) 45*8a272653SPeter Holmelse 46*8a272653SPeter Holm size=$((usermem/10*8)) 47*8a272653SPeter Holmfi 48*8a272653SPeter Holm 49*8a272653SPeter Holmlog=/tmp/swap.log 50*8a272653SPeter Holmtail -F -n 0 /var/log/messages > $log & lpid=$! 51*8a272653SPeter Holm/tmp/swap $((size / 4096)) 52*8a272653SPeter Holmkill $lpid 53*8a272653SPeter Holmgrep -m 1 "swp_pager_getswapspace" $log && s=1 || s=0 54*8a272653SPeter Holmrm $log 55*8a272653SPeter Holm 56*8a272653SPeter Holmrm -f /tmp/swap 57*8a272653SPeter Holmexit $s 58*8a272653SPeter HolmEOF 59*8a272653SPeter Holm#include <sys/types.h> 60*8a272653SPeter Holm#include <err.h> 61*8a272653SPeter Holm#include <stdio.h> 62*8a272653SPeter Holm#include <stdlib.h> 63*8a272653SPeter Holm#include <sys/resource.h> 64*8a272653SPeter Holm#include <sys/sysctl.h> 65*8a272653SPeter Holm#include <sys/time.h> 66*8a272653SPeter Holm#include <sys/wait.h> 67*8a272653SPeter Holm#include <unistd.h> 68*8a272653SPeter Holm 69*8a272653SPeter Holm#define RUNTIME (5 * 60) 70*8a272653SPeter Holm#define INCARNATIONS 32 71*8a272653SPeter Holm 72*8a272653SPeter Holmstatic unsigned long size, original; 73*8a272653SPeter Holm 74*8a272653SPeter Holmvoid 75*8a272653SPeter Holmsetup(void) 76*8a272653SPeter Holm{ 77*8a272653SPeter Holm struct rlimit rlp; 78*8a272653SPeter Holm 79*8a272653SPeter Holm size = size / INCARNATIONS; 80*8a272653SPeter Holm original = size; 81*8a272653SPeter Holm if (size == 0) 82*8a272653SPeter Holm errx(1, "Argument too small"); 83*8a272653SPeter Holm 84*8a272653SPeter Holm if (getrlimit(RLIMIT_DATA, &rlp) < 0) 85*8a272653SPeter Holm err(1,"getrlimit"); 86*8a272653SPeter Holm rlp.rlim_cur -= 1024 * 1024; 87*8a272653SPeter Holm 88*8a272653SPeter Holm if (size > (unsigned long)rlp.rlim_cur) 89*8a272653SPeter Holm size = rlp.rlim_cur; 90*8a272653SPeter Holm 91*8a272653SPeter Holm#if 0 92*8a272653SPeter Holm printf("setup: pid %d. Total %luMb\n", 93*8a272653SPeter Holm getpid(), size / 1024 / 1024 * INCARNATIONS); 94*8a272653SPeter Holm#endif 95*8a272653SPeter Holm 96*8a272653SPeter Holm if (size == 0) 97*8a272653SPeter Holm errx(1, "Argument too small"); 98*8a272653SPeter Holm 99*8a272653SPeter Holm return; 100*8a272653SPeter Holm} 101*8a272653SPeter Holm 102*8a272653SPeter Holmint 103*8a272653SPeter Holmtest(void) 104*8a272653SPeter Holm{ 105*8a272653SPeter Holm volatile char *c; 106*8a272653SPeter Holm int page; 107*8a272653SPeter Holm unsigned long i, j; 108*8a272653SPeter Holm time_t start; 109*8a272653SPeter Holm 110*8a272653SPeter Holm c = malloc(size); 111*8a272653SPeter Holm while (c == NULL) { 112*8a272653SPeter Holm size -= 1024 * 1024; 113*8a272653SPeter Holm c = malloc(size); 114*8a272653SPeter Holm } 115*8a272653SPeter Holm if (size != original) 116*8a272653SPeter Holm printf("Malloc size changed from %ld Mb to %ld Mb\n", 117*8a272653SPeter Holm original / 1024 / 1024, size / 1024 / 1024); 118*8a272653SPeter Holm page = getpagesize(); 119*8a272653SPeter Holm start = time(NULL); 120*8a272653SPeter Holm while ((time(NULL) - start) < RUNTIME) { 121*8a272653SPeter Holm i = j = 0; 122*8a272653SPeter Holm while (i < size) { 123*8a272653SPeter Holm c[i] = 0; 124*8a272653SPeter Holm i += page; 125*8a272653SPeter Holm if (++j % 1024 == 0) { 126*8a272653SPeter Holm if ((time(NULL) - start) >= RUNTIME) 127*8a272653SPeter Holm break; 128*8a272653SPeter Holm if (arc4random() % 100 < 5) 129*8a272653SPeter Holm usleep(1000); 130*8a272653SPeter Holm } 131*8a272653SPeter Holm } 132*8a272653SPeter Holm } 133*8a272653SPeter Holm free((void *)c); 134*8a272653SPeter Holm 135*8a272653SPeter Holm _exit(0); 136*8a272653SPeter Holm} 137*8a272653SPeter Holm 138*8a272653SPeter Holmint 139*8a272653SPeter Holmmain(int argc, char **argv) 140*8a272653SPeter Holm{ 141*8a272653SPeter Holm int i; 142*8a272653SPeter Holm 143*8a272653SPeter Holm if (argc != 2) 144*8a272653SPeter Holm errx(1, "Usage: %s bytes", argv[0]); 145*8a272653SPeter Holm 146*8a272653SPeter Holm size = atol(argv[1]) * 4096; 147*8a272653SPeter Holm setup(); 148*8a272653SPeter Holm 149*8a272653SPeter Holm for (i = 0; i < INCARNATIONS; i++) 150*8a272653SPeter Holm if (fork() == 0) 151*8a272653SPeter Holm test(); 152*8a272653SPeter Holm 153*8a272653SPeter Holm for (i = 0; i < INCARNATIONS; i++) 154*8a272653SPeter Holm wait(NULL); 155*8a272653SPeter Holm 156*8a272653SPeter Holm return (0); 157*8a272653SPeter Holm} 158