1*8a272653SPeter Holm#!/bin/sh 2*8a272653SPeter Holm 3*8a272653SPeter Holm# 4*8a272653SPeter Holm# Copyright (c) 2015 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# Copy of holdcnt0.sh, but without the memory disk usage. 30*8a272653SPeter Holm 31*8a272653SPeter Holm# Test scenario suggestion by alc@ 32*8a272653SPeter Holm 33*8a272653SPeter Holm[ `id -u ` -ne 0 ] && echo "Must be root!" && exit 1 34*8a272653SPeter Holm[ `swapinfo | wc -l` -eq 1 ] && exit 0 35*8a272653SPeter Holm[ `sysctl -n hw.physmem` -lt $((32 * 1024 * 1024 * 1024)) ] && exit 0 36*8a272653SPeter Holm 37*8a272653SPeter Holm. ../default.cfg 38*8a272653SPeter Holm 39*8a272653SPeter Holmhere=`pwd` 40*8a272653SPeter Holmcd /tmp 41*8a272653SPeter Holmsed '1,/^EOF/d' < $here/$0 > holdcnt02.c 42*8a272653SPeter Holmmycc -o holdcnt02 -Wall -Wextra -g holdcnt02.c || exit 1 43*8a272653SPeter Holmrm -f holdcnt02.c 44*8a272653SPeter Holmcd $here 45*8a272653SPeter Holm 46*8a272653SPeter Holmtrap "rm -f /tmp/holdcnt02 `dirname $diskimage`/f000???" EXIT INT 47*8a272653SPeter Holm(cd `dirname $diskimage`; /tmp/holdcnt02) & 48*8a272653SPeter Holmpid=$! 49*8a272653SPeter Holmsleep 5 50*8a272653SPeter Holmwhile kill -0 $! 2> /dev/null; do 51*8a272653SPeter Holm (cd ../testcases/swap; ./swap -t 1m -i 1) > /dev/null 2>&1 52*8a272653SPeter Holmdone 53*8a272653SPeter Holmwait $pid 54*8a272653SPeter Holmexit 55*8a272653SPeter HolmEOF 56*8a272653SPeter Holm/* 57*8a272653SPeter Holm A test that causes the page daemon to generate cached pages 58*8a272653SPeter Holm within a bunch of files and has some consumer that is trying to 59*8a272653SPeter Holm allocate new pages to the same files. 60*8a272653SPeter Holm*/ 61*8a272653SPeter Holm 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/wait.h> 66*8a272653SPeter Holm 67*8a272653SPeter Holm#include <err.h> 68*8a272653SPeter Holm#include <errno.h> 69*8a272653SPeter Holm#include <fcntl.h> 70*8a272653SPeter Holm#include <setjmp.h> 71*8a272653SPeter Holm#include <signal.h> 72*8a272653SPeter Holm#include <stdio.h> 73*8a272653SPeter Holm#include <stdlib.h> 74*8a272653SPeter Holm#include <time.h> 75*8a272653SPeter Holm#include <unistd.h> 76*8a272653SPeter Holm 77*8a272653SPeter Holm#define BUFSIZE (1024 * 1024) 78*8a272653SPeter Holm#define FILES 200 79*8a272653SPeter Holm#define RPARALLEL 8 80*8a272653SPeter Holm#define WPARALLEL 2 81*8a272653SPeter Holm 82*8a272653SPeter Holmstatic jmp_buf jbuf; 83*8a272653SPeter Holmstatic off_t maxsize; 84*8a272653SPeter Holmstatic int ps; 85*8a272653SPeter Holmstatic char *buf; 86*8a272653SPeter Holmstatic volatile char val; 87*8a272653SPeter Holm 88*8a272653SPeter Holmstatic void 89*8a272653SPeter Holmhand(int i __unused) { /* handler */ 90*8a272653SPeter Holm longjmp(jbuf, 1); 91*8a272653SPeter Holm} 92*8a272653SPeter Holm 93*8a272653SPeter Holmstatic void 94*8a272653SPeter Holmcleanup(void) 95*8a272653SPeter Holm{ 96*8a272653SPeter Holm int i; 97*8a272653SPeter Holm char file[80]; 98*8a272653SPeter Holm 99*8a272653SPeter Holm for (i = 0; i < FILES; i++) { 100*8a272653SPeter Holm snprintf(file, sizeof(file), "f%06d", i); 101*8a272653SPeter Holm unlink(file); 102*8a272653SPeter Holm } 103*8a272653SPeter Holm} 104*8a272653SPeter Holm 105*8a272653SPeter Holmstatic void 106*8a272653SPeter Holminit(void) 107*8a272653SPeter Holm{ 108*8a272653SPeter Holm int fd, i; 109*8a272653SPeter Holm char file[80]; 110*8a272653SPeter Holm 111*8a272653SPeter Holm for (i = 0; i < FILES; i++) { 112*8a272653SPeter Holm snprintf(file, sizeof(file), "f%06d", i); 113*8a272653SPeter Holm if ((fd = open(file, O_RDWR | O_CREAT | O_TRUNC, 0644)) == 114*8a272653SPeter Holm -1) 115*8a272653SPeter Holm err(1, "open(%s)", file); 116*8a272653SPeter Holm if (write(fd, buf, BUFSIZE) != BUFSIZE) 117*8a272653SPeter Holm err(1, "write"); 118*8a272653SPeter Holm close(fd); 119*8a272653SPeter Holm } 120*8a272653SPeter Holm 121*8a272653SPeter Holm} 122*8a272653SPeter Holm 123*8a272653SPeter Holmstatic void 124*8a272653SPeter Holmwriter(void) 125*8a272653SPeter Holm{ 126*8a272653SPeter Holm int fd, i; 127*8a272653SPeter Holm char file[80]; 128*8a272653SPeter Holm time_t start; 129*8a272653SPeter Holm struct stat statbuf; 130*8a272653SPeter Holm 131*8a272653SPeter Holm setproctitle("writer"); 132*8a272653SPeter Holm start = time(NULL); 133*8a272653SPeter Holm while (time(NULL) - start < 600) { 134*8a272653SPeter Holm for (i = 0; i < FILES; i++) { 135*8a272653SPeter Holm snprintf(file, sizeof(file), "f%06d", i); 136*8a272653SPeter Holm if ((fd = open(file, O_RDWR | O_APPEND)) == -1) { 137*8a272653SPeter Holm if (errno != ENOENT) 138*8a272653SPeter Holm err(1, "open(%s) append", file); 139*8a272653SPeter Holm goto err; 140*8a272653SPeter Holm } 141*8a272653SPeter Holm if (fstat(fd, &statbuf) < 0) 142*8a272653SPeter Holm err(1, "fstat error"); 143*8a272653SPeter Holm if (statbuf.st_size < maxsize) { 144*8a272653SPeter Holm if (write(fd, buf, ps) != ps) { 145*8a272653SPeter Holm warn("writer"); 146*8a272653SPeter Holm goto err; 147*8a272653SPeter Holm } 148*8a272653SPeter Holm } 149*8a272653SPeter Holm close(fd); 150*8a272653SPeter Holm } 151*8a272653SPeter Holm } 152*8a272653SPeter Holmerr: 153*8a272653SPeter Holm cleanup(); 154*8a272653SPeter Holm 155*8a272653SPeter Holm _exit(0); 156*8a272653SPeter Holm} 157*8a272653SPeter Holm 158*8a272653SPeter Holmstatic void 159*8a272653SPeter Holmreader(void) 160*8a272653SPeter Holm{ 161*8a272653SPeter Holm int fd, i, j, n; 162*8a272653SPeter Holm void *p; 163*8a272653SPeter Holm size_t len; 164*8a272653SPeter Holm char file[80]; 165*8a272653SPeter Holm struct stat statbuf; 166*8a272653SPeter Holm 167*8a272653SPeter Holm setproctitle("reader"); 168*8a272653SPeter Holm signal(SIGSEGV, hand); 169*8a272653SPeter Holm signal(SIGBUS, hand); 170*8a272653SPeter Holm fd = 0; 171*8a272653SPeter Holm for (;;) { 172*8a272653SPeter Holm (void)setjmp(jbuf); 173*8a272653SPeter Holm for (i = 0; i < FILES; i++) { 174*8a272653SPeter Holm snprintf(file, sizeof(file), "f%06d", i); 175*8a272653SPeter Holm if (fd > 0) 176*8a272653SPeter Holm close(fd); 177*8a272653SPeter Holm if ((fd = open(file, O_RDWR)) == -1) { 178*8a272653SPeter Holm if (errno != ENOENT) 179*8a272653SPeter Holm warn("reader(%s)", file); 180*8a272653SPeter Holm _exit(0); 181*8a272653SPeter Holm } 182*8a272653SPeter Holm if (fstat(fd, &statbuf) < 0) 183*8a272653SPeter Holm err(1, "fstat error"); 184*8a272653SPeter Holm if (statbuf.st_size >= maxsize) { 185*8a272653SPeter Holm if (ftruncate(fd, ps) == -1) 186*8a272653SPeter Holm err(1, "ftruncate"); 187*8a272653SPeter Holm continue; 188*8a272653SPeter Holm } 189*8a272653SPeter Holm len = statbuf.st_size; 190*8a272653SPeter Holm if ((p = mmap(p, len, PROT_READ, MAP_SHARED, fd, 0)) 191*8a272653SPeter Holm == MAP_FAILED) 192*8a272653SPeter Holm err(1, "mmap()"); 193*8a272653SPeter Holm close(fd); 194*8a272653SPeter Holm n = statbuf.st_size / ps; 195*8a272653SPeter Holm for (j = 0; j < n; j++) { 196*8a272653SPeter Holm val = *(char *)p; 197*8a272653SPeter Holm p = p + ps; 198*8a272653SPeter Holm } 199*8a272653SPeter Holm#if 0 200*8a272653SPeter Holm if (munmap(p, len) == -1) 201*8a272653SPeter Holm perror("munmap"); 202*8a272653SPeter Holm#endif 203*8a272653SPeter Holm } 204*8a272653SPeter Holm } 205*8a272653SPeter Holm _exit(0); 206*8a272653SPeter Holm} 207*8a272653SPeter Holmint 208*8a272653SPeter Holmmain(void) 209*8a272653SPeter Holm{ 210*8a272653SPeter Holm pid_t rpid[RPARALLEL], wpid[WPARALLEL]; 211*8a272653SPeter Holm int e, i, s; 212*8a272653SPeter Holm 213*8a272653SPeter Holm maxsize = 2LL * 1024 * 1024 * 1024 / FILES; 214*8a272653SPeter Holm buf = malloc(BUFSIZE); 215*8a272653SPeter Holm ps = getpagesize(); 216*8a272653SPeter Holm 217*8a272653SPeter Holm init(); 218*8a272653SPeter Holm e = 0; 219*8a272653SPeter Holm for (i = 0; i < WPARALLEL; i++) { 220*8a272653SPeter Holm if ((wpid[i] = fork()) == 0) 221*8a272653SPeter Holm writer(); 222*8a272653SPeter Holm } 223*8a272653SPeter Holm for (i = 0; i < RPARALLEL; i++) { 224*8a272653SPeter Holm if ((rpid[i] = fork()) == 0) 225*8a272653SPeter Holm reader(); 226*8a272653SPeter Holm } 227*8a272653SPeter Holm 228*8a272653SPeter Holm for (i = 0; i < WPARALLEL; i++) 229*8a272653SPeter Holm waitpid(wpid[i], &s, 0); 230*8a272653SPeter Holm e += s == 0 ? 0 : 1; 231*8a272653SPeter Holm for (i = 0; i < RPARALLEL; i++) 232*8a272653SPeter Holm waitpid(rpid[i], &s, 0); 233*8a272653SPeter Holm e += s == 0 ? 0 : 1; 234*8a272653SPeter Holm 235*8a272653SPeter Holm free(buf); 236*8a272653SPeter Holm 237*8a272653SPeter Holm return (e); 238*8a272653SPeter Holm} 239