1*8a272653SPeter Holm#!/bin/sh 2*8a272653SPeter Holm 3*8a272653SPeter Holm# 4*8a272653SPeter Holm# Copyright (c) 2014 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# A regression test for a bug introduced in r269656. 30*8a272653SPeter Holm# Page fault in proc_realparent+0x70 seen. 31*8a272653SPeter Holm# Fixed in r270024. 32*8a272653SPeter Holm 33*8a272653SPeter Holm# Test scenario by Mark Johnston markj@ 34*8a272653SPeter Holm 35*8a272653SPeter Holm. ../default.cfg 36*8a272653SPeter Holm 37*8a272653SPeter Holmhere=`pwd` 38*8a272653SPeter Holmcd /tmp 39*8a272653SPeter Holmsed '1,/^EOF/d' < $here/$0 > ptrace3.c 40*8a272653SPeter Holmmycc -o ptrace3 -Wall -Wextra -g ptrace3.c || exit 1 41*8a272653SPeter Holmrm -f ptrace3.c 42*8a272653SPeter Holmcd $here 43*8a272653SPeter Holm 44*8a272653SPeter Holm/tmp/ptrace3 45*8a272653SPeter Holm 46*8a272653SPeter Holmrm -f /tmp/ptrace3 47*8a272653SPeter Holmexit 48*8a272653SPeter HolmEOF 49*8a272653SPeter Holm#include <sys/types.h> 50*8a272653SPeter Holm#include <sys/ptrace.h> 51*8a272653SPeter Holm#include <sys/wait.h> 52*8a272653SPeter Holm 53*8a272653SPeter Holm#include <err.h> 54*8a272653SPeter Holm#include <signal.h> 55*8a272653SPeter Holm#include <unistd.h> 56*8a272653SPeter Holm 57*8a272653SPeter Holm/* 58*8a272653SPeter Holm * A regression test for a bug introduced in r269656. The test process p creates 59*8a272653SPeter Holm * child processes c1 and c2 which do nothing but sleep; a third child process 60*8a272653SPeter Holm * (c3) uses ptrace(2) to reparent c1 and c2 from p to c3. Then c3 detaches from 61*8a272653SPeter Holm * c1 and c2, causing a crash when c1 and c2 are removed from p's now-corrupt 62*8a272653SPeter Holm * orphan list. 63*8a272653SPeter Holm */ 64*8a272653SPeter Holm 65*8a272653SPeter Holmpid_t 66*8a272653SPeter Holmsleeper() 67*8a272653SPeter Holm{ 68*8a272653SPeter Holm pid_t p; 69*8a272653SPeter Holm 70*8a272653SPeter Holm p = fork(); 71*8a272653SPeter Holm if (p == -1) 72*8a272653SPeter Holm err(1, "fork"); 73*8a272653SPeter Holm else if (p == 0) 74*8a272653SPeter Holm while (1) 75*8a272653SPeter Holm sleep(1000000); 76*8a272653SPeter Holm return (p); 77*8a272653SPeter Holm} 78*8a272653SPeter Holm 79*8a272653SPeter Holmvoid 80*8a272653SPeter Holmattach(pid_t p) 81*8a272653SPeter Holm{ 82*8a272653SPeter Holm int status; 83*8a272653SPeter Holm 84*8a272653SPeter Holm if (ptrace(PT_ATTACH, p, 0, 0) == -1) 85*8a272653SPeter Holm err(1, "ptrace"); 86*8a272653SPeter Holm 87*8a272653SPeter Holm if (waitpid(p, &status, 0) == -1) 88*8a272653SPeter Holm err(1, "waitpid"); 89*8a272653SPeter Holm else if (!WIFSTOPPED(status)) 90*8a272653SPeter Holm errx(1, "failed to stop child"); 91*8a272653SPeter Holm} 92*8a272653SPeter Holm 93*8a272653SPeter Holmvoid 94*8a272653SPeter Holmdetach(pid_t p) 95*8a272653SPeter Holm{ 96*8a272653SPeter Holm 97*8a272653SPeter Holm if (ptrace(PT_DETACH, p, 0, 0) == -1) 98*8a272653SPeter Holm err(1, "ptrace"); 99*8a272653SPeter Holm} 100*8a272653SPeter Holm 101*8a272653SPeter Holmint 102*8a272653SPeter Holmmain(void) 103*8a272653SPeter Holm{ 104*8a272653SPeter Holm int status; 105*8a272653SPeter Holm pid_t c1, c2, p; 106*8a272653SPeter Holm 107*8a272653SPeter Holm c1 = sleeper(); 108*8a272653SPeter Holm c2 = sleeper(); 109*8a272653SPeter Holm 110*8a272653SPeter Holm p = fork(); 111*8a272653SPeter Holm if (p == -1) { 112*8a272653SPeter Holm err(1, "fork"); 113*8a272653SPeter Holm } else if (p == 0) { 114*8a272653SPeter Holm attach(c1); 115*8a272653SPeter Holm attach(c2); 116*8a272653SPeter Holm detach(c1); 117*8a272653SPeter Holm detach(c2); 118*8a272653SPeter Holm } else { 119*8a272653SPeter Holm if (waitpid(p, &status, 0) == -1) 120*8a272653SPeter Holm err(1, "waitpid"); 121*8a272653SPeter Holm if (!WIFEXITED(status) || WEXITSTATUS(status) != 0) 122*8a272653SPeter Holm errx(1, "child exited abnormally"); 123*8a272653SPeter Holm } 124*8a272653SPeter Holm 125*8a272653SPeter Holm /* Clean up. */ 126*8a272653SPeter Holm (void)kill(c1, SIGKILL); 127*8a272653SPeter Holm (void)kill(c2, SIGKILL); 128*8a272653SPeter Holm 129*8a272653SPeter Holm return (0); 130*8a272653SPeter Holm} 131