1*8a272653SPeter Holm#!/bin/sh 2*8a272653SPeter Holm 3*8a272653SPeter Holm# 4*8a272653SPeter Holm# Copyright (c) 2008 Peter Holm <pho@FreeBSD.org> 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# Test scenario by marcus@freebsd.org 30*8a272653SPeter Holm 31*8a272653SPeter Holm[ `id -u ` -ne 0 ] && echo "Must be root!" && exit 1 32*8a272653SPeter Holm 33*8a272653SPeter Holm. ../default.cfg 34*8a272653SPeter Holm 35*8a272653SPeter Holmodir=`pwd` 36*8a272653SPeter Holmcd /tmp 37*8a272653SPeter Holmsed '1,/^EOF/d' < $odir/$0 > kinfo.c 38*8a272653SPeter Holmmycc -o kinfo -Wall kinfo.c -lutil || exit 1 39*8a272653SPeter Holmrm -f kinfo.c 40*8a272653SPeter Holm 41*8a272653SPeter Holmmount | grep -q procfs || mount -t procfs procfs /proc 42*8a272653SPeter Holmfor i in `jot 20`; do 43*8a272653SPeter Holm for j in `jot 5`; do 44*8a272653SPeter Holm /tmp/kinfo & 45*8a272653SPeter Holm done 46*8a272653SPeter Holm 47*8a272653SPeter Holm for j in `jot 5`; do 48*8a272653SPeter Holm wait 49*8a272653SPeter Holm done 50*8a272653SPeter Holmdone 51*8a272653SPeter Holm 52*8a272653SPeter Holmrm -f /tmp/kinfo 53*8a272653SPeter Holmexit 54*8a272653SPeter HolmEOF 55*8a272653SPeter Holm 56*8a272653SPeter Holm#include <sys/types.h> 57*8a272653SPeter Holm#include <stdio.h> 58*8a272653SPeter Holm#include <stdlib.h> 59*8a272653SPeter Holm#include <unistd.h> 60*8a272653SPeter Holm#include <sys/sysctl.h> 61*8a272653SPeter Holm#include <sys/param.h> 62*8a272653SPeter Holm#include <sys/user.h> 63*8a272653SPeter Holm#include <sys/signal.h> 64*8a272653SPeter Holm#include <fcntl.h> 65*8a272653SPeter Holm#include <err.h> 66*8a272653SPeter Holm#include <strings.h> 67*8a272653SPeter Holm#include <sys/wait.h> 68*8a272653SPeter Holm#include <libutil.h> 69*8a272653SPeter Holm 70*8a272653SPeter Holmchar buf[8096]; 71*8a272653SPeter Holm 72*8a272653SPeter Holmvoid 73*8a272653SPeter Holmhandler(int i) { 74*8a272653SPeter Holm exit(0); 75*8a272653SPeter Holm} 76*8a272653SPeter Holm 77*8a272653SPeter Holm/* Stir /dev/proc */ 78*8a272653SPeter Holmint 79*8a272653SPeter Holmchurning(void) { 80*8a272653SPeter Holm pid_t r; 81*8a272653SPeter Holm int fd, status; 82*8a272653SPeter Holm 83*8a272653SPeter Holm for (;;) { 84*8a272653SPeter Holm r = fork(); 85*8a272653SPeter Holm if (r == 0) { 86*8a272653SPeter Holm if ((fd = open("/proc/curproc/mem", O_RDONLY)) == -1) 87*8a272653SPeter Holm err(1, "open(/proc/curproc/mem)"); 88*8a272653SPeter Holm bzero(buf, sizeof(buf)); 89*8a272653SPeter Holm exit(0); 90*8a272653SPeter Holm } 91*8a272653SPeter Holm if (r < 0) { 92*8a272653SPeter Holm perror("fork"); 93*8a272653SPeter Holm exit(2); 94*8a272653SPeter Holm } 95*8a272653SPeter Holm wait(&status); 96*8a272653SPeter Holm } 97*8a272653SPeter Holm} 98*8a272653SPeter Holm 99*8a272653SPeter Holm/* Get files for each proc */ 100*8a272653SPeter Holmvoid 101*8a272653SPeter Holmlist(void) 102*8a272653SPeter Holm{ 103*8a272653SPeter Holm struct kinfo_file *freep; 104*8a272653SPeter Holm struct kinfo_vmentry *freep_vm; 105*8a272653SPeter Holm long i; 106*8a272653SPeter Holm int cnt, name[4]; 107*8a272653SPeter Holm struct kinfo_proc *kipp; 108*8a272653SPeter Holm size_t len; 109*8a272653SPeter Holm 110*8a272653SPeter Holm name[0] = CTL_KERN; 111*8a272653SPeter Holm name[1] = KERN_PROC; 112*8a272653SPeter Holm name[2] = KERN_PROC_PROC; 113*8a272653SPeter Holm 114*8a272653SPeter Holm len = 0; 115*8a272653SPeter Holm if (sysctl(name, 3, NULL, &len, NULL, 0) < 0) 116*8a272653SPeter Holm err(-1, "sysctl: kern.proc.all"); 117*8a272653SPeter Holm 118*8a272653SPeter Holm kipp = malloc(len); 119*8a272653SPeter Holm if (kipp == NULL) 120*8a272653SPeter Holm err(1, "malloc"); 121*8a272653SPeter Holm 122*8a272653SPeter Holm if (sysctl(name, 3, kipp, &len, NULL, 0) < 0) { 123*8a272653SPeter Holm free(kipp); 124*8a272653SPeter Holm// warn("sysctl: kern.proc.all"); 125*8a272653SPeter Holm return; 126*8a272653SPeter Holm } 127*8a272653SPeter Holm 128*8a272653SPeter Holm for (i = 0; i < len / sizeof(*kipp); i++) { 129*8a272653SPeter Holm 130*8a272653SPeter Holm /* The test starts here */ 131*8a272653SPeter Holm freep = kinfo_getfile(kipp[i].ki_pid, &cnt); 132*8a272653SPeter Holm free(freep); 133*8a272653SPeter Holm 134*8a272653SPeter Holm freep_vm = kinfo_getvmmap(kipp[i].ki_pid, &cnt); 135*8a272653SPeter Holm free(freep_vm); 136*8a272653SPeter Holm /* End test */ 137*8a272653SPeter Holm } 138*8a272653SPeter Holm free(kipp); 139*8a272653SPeter Holm} 140*8a272653SPeter Holm 141*8a272653SPeter Holmint 142*8a272653SPeter Holmmain(int argc, char **argv) 143*8a272653SPeter Holm{ 144*8a272653SPeter Holm pid_t r; 145*8a272653SPeter Holm signal(SIGALRM, handler); 146*8a272653SPeter Holm alarm(60); 147*8a272653SPeter Holm 148*8a272653SPeter Holm if ((r = fork()) == 0) { 149*8a272653SPeter Holm alarm(60); 150*8a272653SPeter Holm for (;;) 151*8a272653SPeter Holm churning(); 152*8a272653SPeter Holm } 153*8a272653SPeter Holm if (r < 0) { 154*8a272653SPeter Holm perror("fork"); 155*8a272653SPeter Holm exit(2); 156*8a272653SPeter Holm } 157*8a272653SPeter Holm 158*8a272653SPeter Holm for (;;) 159*8a272653SPeter Holm list(); 160*8a272653SPeter Holm 161*8a272653SPeter Holm return (0); 162*8a272653SPeter Holm} 163