1*8a272653SPeter Holm#!/bin/sh 2*8a272653SPeter Holm 3*8a272653SPeter Holm# 4*8a272653SPeter Holm# Copyright (c) 2017 Dell EMC Isilon 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# Hunt for lost wakeup problem. 30*8a272653SPeter Holm 31*8a272653SPeter Holm. ../default.cfg 32*8a272653SPeter Holm 33*8a272653SPeter Holmdir=/tmp 34*8a272653SPeter Holmodir=`pwd` 35*8a272653SPeter Holmcd $dir 36*8a272653SPeter Holmsed '1,/^EOF/d' < $odir/$0 > $dir/pause.c 37*8a272653SPeter Holmmycc -o pause -Wall -Wextra -O0 -g pause.c || exit 1 38*8a272653SPeter Holmrm -f pause.c 39*8a272653SPeter Holm 40*8a272653SPeter Holmpkill pause 41*8a272653SPeter Holm$dir/pause & 42*8a272653SPeter Holmpid=$! 43*8a272653SPeter Holmstart=`date +%s` 44*8a272653SPeter Holmwhile pgrep -q pause; do 45*8a272653SPeter Holm sleep .5 46*8a272653SPeter Holm [ $((`date +%s` - $start)) -gt 1200 ] && 47*8a272653SPeter Holm { echo "Timed out"; pgrep pause | xargs ps -lp; exit 1; } 48*8a272653SPeter Holmdone 49*8a272653SPeter Holmwait $pid 50*8a272653SPeter Holms=$? 51*8a272653SPeter Holm 52*8a272653SPeter Holmcd $odir 53*8a272653SPeter Holmrm -rf $dir/pause 54*8a272653SPeter Holmexit $s 55*8a272653SPeter Holm 56*8a272653SPeter HolmEOF 57*8a272653SPeter Holm#include <sys/param.h> 58*8a272653SPeter Holm#include <sys/mman.h> 59*8a272653SPeter Holm#include <sys/stat.h> 60*8a272653SPeter Holm#include <sys/wait.h> 61*8a272653SPeter Holm 62*8a272653SPeter Holm#include <machine/atomic.h> 63*8a272653SPeter Holm 64*8a272653SPeter Holm#include <err.h> 65*8a272653SPeter Holm#include <errno.h> 66*8a272653SPeter Holm#include <fcntl.h> 67*8a272653SPeter Holm#include <signal.h> 68*8a272653SPeter Holm#include <stdio.h> 69*8a272653SPeter Holm#include <stdlib.h> 70*8a272653SPeter Holm#include <time.h> 71*8a272653SPeter Holm#include <unistd.h> 72*8a272653SPeter Holm 73*8a272653SPeter Holmstatic volatile u_int *share; 74*8a272653SPeter Holm 75*8a272653SPeter Holm#define PARALLEL 400 76*8a272653SPeter Holm#define RUNTIME (5 * 60) 77*8a272653SPeter Holm#define SYNC 0 78*8a272653SPeter Holm 79*8a272653SPeter Holmvoid 80*8a272653SPeter Holmhand(int i __unused) { 81*8a272653SPeter Holm} 82*8a272653SPeter Holm 83*8a272653SPeter Holmstatic void 84*8a272653SPeter Holmtest(int idx) 85*8a272653SPeter Holm{ 86*8a272653SPeter Holm pid_t pid; 87*8a272653SPeter Holm time_t start; 88*8a272653SPeter Holm 89*8a272653SPeter Holm atomic_add_int(&share[SYNC], 1); 90*8a272653SPeter Holm while (share[SYNC] != PARALLEL) 91*8a272653SPeter Holm usleep(1); 92*8a272653SPeter Holm share[idx] = 0; 93*8a272653SPeter Holm 94*8a272653SPeter Holm if ((pid = fork()) == 0) { 95*8a272653SPeter Holm share[idx] = 1; 96*8a272653SPeter Holm for (;;) 97*8a272653SPeter Holm pause(); 98*8a272653SPeter Holm _exit(0); 99*8a272653SPeter Holm } 100*8a272653SPeter Holm while (share[idx] == 0) 101*8a272653SPeter Holm usleep(10); 102*8a272653SPeter Holm start = time(NULL); 103*8a272653SPeter Holm while (time(NULL) - start < 60) { 104*8a272653SPeter Holm usleep(arc4random() % 100); 105*8a272653SPeter Holm if (kill(pid, SIGHUP) == -1) 106*8a272653SPeter Holm err(1, "kill(%d)", pid); 107*8a272653SPeter Holm } 108*8a272653SPeter Holm kill(pid, SIGTERM); 109*8a272653SPeter Holm if (waitpid(pid, NULL, 0) != pid) 110*8a272653SPeter Holm err(1, "waitpid(%d)", pid); 111*8a272653SPeter Holm 112*8a272653SPeter Holm _exit(0); 113*8a272653SPeter Holm} 114*8a272653SPeter Holm 115*8a272653SPeter Holmint 116*8a272653SPeter Holmmain(void) 117*8a272653SPeter Holm{ 118*8a272653SPeter Holm pid_t pids[PARALLEL]; 119*8a272653SPeter Holm struct sigaction sa; 120*8a272653SPeter Holm size_t len; 121*8a272653SPeter Holm time_t start; 122*8a272653SPeter Holm int e, i, status; 123*8a272653SPeter Holm 124*8a272653SPeter Holm sa.sa_handler = hand; 125*8a272653SPeter Holm sigemptyset(&sa.sa_mask); 126*8a272653SPeter Holm sa.sa_flags = 0; 127*8a272653SPeter Holm if (sigaction(SIGHUP, &sa, NULL) == -1) 128*8a272653SPeter Holm err(1, "sigaction"); 129*8a272653SPeter Holm 130*8a272653SPeter Holm e = 0; 131*8a272653SPeter Holm len = PAGE_SIZE; 132*8a272653SPeter Holm if ((share = mmap(NULL, len, PROT_READ | PROT_WRITE, 133*8a272653SPeter Holm MAP_ANON | MAP_SHARED, -1, 0)) == MAP_FAILED) 134*8a272653SPeter Holm err(1, "mmap"); 135*8a272653SPeter Holm 136*8a272653SPeter Holm start = time(NULL); 137*8a272653SPeter Holm while ((time(NULL) - start) < RUNTIME && e == 0) { 138*8a272653SPeter Holm share[SYNC] = 0; 139*8a272653SPeter Holm for (i = 0; i < PARALLEL; i++) { 140*8a272653SPeter Holm if ((pids[i] = fork()) == 0) 141*8a272653SPeter Holm test(i + 1); 142*8a272653SPeter Holm if (pids[i] == -1) 143*8a272653SPeter Holm err(1, "fork()"); 144*8a272653SPeter Holm } 145*8a272653SPeter Holm for (i = 0; i < PARALLEL; i++) { 146*8a272653SPeter Holm if (waitpid(pids[i], &status, 0) == -1) 147*8a272653SPeter Holm err(1, "waitpid(%d)", pids[i]); 148*8a272653SPeter Holm if (status != 0) { 149*8a272653SPeter Holm if (WIFSIGNALED(status)) 150*8a272653SPeter Holm fprintf(stderr, 151*8a272653SPeter Holm "pid %d exit signal %d\n", 152*8a272653SPeter Holm pids[i], WTERMSIG(status)); 153*8a272653SPeter Holm } 154*8a272653SPeter Holm e += status == 0 ? 0 : 1; 155*8a272653SPeter Holm } 156*8a272653SPeter Holm } 157*8a272653SPeter Holm 158*8a272653SPeter Holm return (e); 159*8a272653SPeter Holm} 160