1*8a272653SPeter Holm#!/bin/sh 2*8a272653SPeter Holm 3*8a272653SPeter Holm# 4*8a272653SPeter Holm# Copyright (c) 2016 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. ../default.cfg 30*8a272653SPeter Holm 31*8a272653SPeter Holmhere=`pwd` 32*8a272653SPeter Holmcd /tmp 33*8a272653SPeter Holmsed '1,/^EOF/d' < $here/$0 > context.c 34*8a272653SPeter Holmmycc -o context -Wall -Wextra -O2 -g context.c || exit 1 35*8a272653SPeter Holmrm -f context.c 36*8a272653SPeter Holm[ -d $RUNDIR ] || mkdir -p $RUNDIR 37*8a272653SPeter Holmcd $RUNDIR 38*8a272653SPeter Holm 39*8a272653SPeter Holmdaemon sh -c "(cd $here/../testcases/swap; ./swap -t 10m -i 20)" > \ 40*8a272653SPeter Holm /dev/null 2>&1 41*8a272653SPeter Holmfor i in `jot 4`; do 42*8a272653SPeter Holm /tmp/context & 43*8a272653SPeter Holm pids="$pids $!" 44*8a272653SPeter Holmdone 45*8a272653SPeter Holms=0 46*8a272653SPeter Holmfor i in $pids; do 47*8a272653SPeter Holm wait $i 48*8a272653SPeter Holm [ $? -ne 0 ] && s=$((s + 1)) 49*8a272653SPeter Holmdone 50*8a272653SPeter Holmwhile pgrep -q swap; do 51*8a272653SPeter Holm pkill -9 swap 52*8a272653SPeter Holmdone 53*8a272653SPeter Holmrm -f /tmp/context 54*8a272653SPeter Holmexit $s 55*8a272653SPeter HolmEOF 56*8a272653SPeter Holm/* 57*8a272653SPeter Holm * Inspired by lmbench-3.0-a9/src/lat_ctx.c 58*8a272653SPeter Holm * Pass a token thru pipes to CHILDREN+1 processes in a circular list 59*8a272653SPeter Holm */ 60*8a272653SPeter Holm 61*8a272653SPeter Holm#include <sys/types.h> 62*8a272653SPeter Holm 63*8a272653SPeter Holm#include <err.h> 64*8a272653SPeter Holm#include <errno.h> 65*8a272653SPeter Holm#include <signal.h> 66*8a272653SPeter Holm#include <stdio.h> 67*8a272653SPeter Holm#include <stdlib.h> 68*8a272653SPeter Holm#include <time.h> 69*8a272653SPeter Holm#include <unistd.h> 70*8a272653SPeter Holm 71*8a272653SPeter Holm#define CHILDREN 64 72*8a272653SPeter Holm#define RUNTIME 300 73*8a272653SPeter Holm 74*8a272653SPeter Holmint fds[CHILDREN +1 ][2]; 75*8a272653SPeter Holmpid_t pid[CHILDREN]; 76*8a272653SPeter Holm 77*8a272653SPeter Holmvoid 78*8a272653SPeter Holmhandler(int s __unused) 79*8a272653SPeter Holm{ 80*8a272653SPeter Holm _exit(0); 81*8a272653SPeter Holm} 82*8a272653SPeter Holm 83*8a272653SPeter Holmint 84*8a272653SPeter Holmmain(void) 85*8a272653SPeter Holm{ 86*8a272653SPeter Holm time_t start; 87*8a272653SPeter Holm int i, j; 88*8a272653SPeter Holm int token; 89*8a272653SPeter Holm 90*8a272653SPeter Holm for (i = 0; i < CHILDREN + 1; i++) { 91*8a272653SPeter Holm if (pipe(fds[i]) == -1) 92*8a272653SPeter Holm err(1, "pipe"); 93*8a272653SPeter Holm } 94*8a272653SPeter Holm 95*8a272653SPeter Holm signal(SIGHUP, handler); 96*8a272653SPeter Holm start = time(NULL); 97*8a272653SPeter Holm for (i = 0; i < CHILDREN; i++) { 98*8a272653SPeter Holm pid[i] = fork(); 99*8a272653SPeter Holm if (pid[i] == -1) { 100*8a272653SPeter Holm perror("fork"); 101*8a272653SPeter Holm exit(2); 102*8a272653SPeter Holm } 103*8a272653SPeter Holm 104*8a272653SPeter Holm if (pid[i] == 0) { /* child */ 105*8a272653SPeter Holm for (;;) { 106*8a272653SPeter Holm if (read(fds[i][0], &token, sizeof(token)) 107*8a272653SPeter Holm != sizeof(token)) 108*8a272653SPeter Holm err(1, "read pipe 2"); 109*8a272653SPeter Holm if (write(fds[i+1][1], &token, sizeof(token)) 110*8a272653SPeter Holm != sizeof(token)) 111*8a272653SPeter Holm err(1, "write pipe 1"); 112*8a272653SPeter Holm } 113*8a272653SPeter Holm } 114*8a272653SPeter Holm 115*8a272653SPeter Holm } /* parent */ 116*8a272653SPeter Holm 117*8a272653SPeter Holm for (j = 0; time(NULL) - start < RUNTIME; j++) { 118*8a272653SPeter Holm token = j; 119*8a272653SPeter Holm if (write(fds[0][1], &token, sizeof(token)) != sizeof(token)) 120*8a272653SPeter Holm err(1, "write pipe 2"); 121*8a272653SPeter Holm if (read(fds[CHILDREN][0], &token, sizeof(token)) 122*8a272653SPeter Holm != sizeof(token)) 123*8a272653SPeter Holm err(1, "read pipe 1"); 124*8a272653SPeter Holm } 125*8a272653SPeter Holm 126*8a272653SPeter Holm for (i = 0; i < CHILDREN; i++) 127*8a272653SPeter Holm kill(pid[i], SIGHUP); 128*8a272653SPeter Holm 129*8a272653SPeter Holm return (0); 130*8a272653SPeter Holm} 131