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[ `id -u ` -ne 0 ] && echo "Must be root!" && exit 1 30*8a272653SPeter Holm 31*8a272653SPeter Holm# Test that a non root user can at most have maxproc - 10 processes. 32*8a272653SPeter Holm 33*8a272653SPeter Holm. ../default.cfg 34*8a272653SPeter Holm 35*8a272653SPeter Holmhere=`pwd` 36*8a272653SPeter Holmcd /tmp 37*8a272653SPeter Holmsed '1,/^EOF/d' < $here/$0 > maxproc.c 38*8a272653SPeter Holmmycc -o maxproc -Wall -Wextra maxproc.c -lkvm || exit 1 39*8a272653SPeter Holmrm -f maxproc.c 40*8a272653SPeter Holm[ `sysctl -n kern.maxproc` -gt 37028 ] && exit 0 # Excessive run time 41*8a272653SPeter Holmcd $here 42*8a272653SPeter Holm 43*8a272653SPeter Holm/tmp/maxproc 44*8a272653SPeter Holm 45*8a272653SPeter Holmrm -f /tmp/maxproc 46*8a272653SPeter Holmexit 47*8a272653SPeter HolmEOF 48*8a272653SPeter Holm#include <sys/wait.h> 49*8a272653SPeter Holm 50*8a272653SPeter Holm#include <err.h> 51*8a272653SPeter Holm#include <fcntl.h> 52*8a272653SPeter Holm#include <kvm.h> 53*8a272653SPeter Holm#include <limits.h> 54*8a272653SPeter Holm#include <pwd.h> 55*8a272653SPeter Holm#include <signal.h> 56*8a272653SPeter Holm#include <stdio.h> 57*8a272653SPeter Holm#include <string.h> 58*8a272653SPeter Holm#include <unistd.h> 59*8a272653SPeter Holm 60*8a272653SPeter Holmenum { 61*8a272653SPeter Holm NL_NPROCS, 62*8a272653SPeter Holm NL_MAXPROC, 63*8a272653SPeter Holm NL_MARKER 64*8a272653SPeter Holm}; 65*8a272653SPeter Holm 66*8a272653SPeter Holmstatic struct { 67*8a272653SPeter Holm int order; 68*8a272653SPeter Holm const char *name; 69*8a272653SPeter Holm} namelist[] = { 70*8a272653SPeter Holm { NL_NPROCS, "_nprocs" }, 71*8a272653SPeter Holm { NL_MAXPROC, "_maxproc" }, 72*8a272653SPeter Holm { NL_MARKER, "" }, 73*8a272653SPeter Holm}; 74*8a272653SPeter Holm 75*8a272653SPeter Holm#define NNAMES (sizeof(namelist) / sizeof(*namelist)) 76*8a272653SPeter Holm#define MULTIUSERFUZZ 5 77*8a272653SPeter Holm 78*8a272653SPeter Holmstatic struct nlist nl[NNAMES]; 79*8a272653SPeter Holm 80*8a272653SPeter Holmstatic void 81*8a272653SPeter Holmt2(void) 82*8a272653SPeter Holm{ 83*8a272653SPeter Holm pid_t p; 84*8a272653SPeter Holm 85*8a272653SPeter Holm for (;;) { 86*8a272653SPeter Holm if ((p = fork()) == 0) { 87*8a272653SPeter Holm sleep(2); 88*8a272653SPeter Holm _exit(0); 89*8a272653SPeter Holm } 90*8a272653SPeter Holm if (p == -1) 91*8a272653SPeter Holm break; 92*8a272653SPeter Holm } 93*8a272653SPeter Holm} 94*8a272653SPeter Holm 95*8a272653SPeter Holmstatic void 96*8a272653SPeter Holmt1(int priv) 97*8a272653SPeter Holm{ 98*8a272653SPeter Holm pid_t p; 99*8a272653SPeter Holm struct passwd *pw; 100*8a272653SPeter Holm 101*8a272653SPeter Holm if ((p = fork()) == 0) { 102*8a272653SPeter Holm if ((pw = getpwnam("nobody")) == NULL) 103*8a272653SPeter Holm err(1, "no such user: nobody"); 104*8a272653SPeter Holm 105*8a272653SPeter Holm if (priv == 0) { 106*8a272653SPeter Holm if (setgroups(1, &pw->pw_gid) || 107*8a272653SPeter Holm setegid(pw->pw_gid) || setgid(pw->pw_gid) || 108*8a272653SPeter Holm seteuid(pw->pw_uid) || setuid(pw->pw_uid)) 109*8a272653SPeter Holm err(1, "Can't drop privileges to \"nobody\""); 110*8a272653SPeter Holm } 111*8a272653SPeter Holm endpwent(); 112*8a272653SPeter Holm 113*8a272653SPeter Holm t2(); 114*8a272653SPeter Holm _exit(0); 115*8a272653SPeter Holm } 116*8a272653SPeter Holm waitpid(p, NULL, 0); 117*8a272653SPeter Holm} 118*8a272653SPeter Holm 119*8a272653SPeter Holmint 120*8a272653SPeter Holmgetprocs(void) 121*8a272653SPeter Holm{ 122*8a272653SPeter Holm kvm_t *kd; 123*8a272653SPeter Holm int i, nprocs, maxproc; 124*8a272653SPeter Holm char buf[_POSIX2_LINE_MAX]; 125*8a272653SPeter Holm char *nlistf, *memf; 126*8a272653SPeter Holm 127*8a272653SPeter Holm nlistf = memf = NULL; 128*8a272653SPeter Holm for (i = 0; i < (int)NNAMES; i++) 129*8a272653SPeter Holm nl[namelist[i].order].n_name = strdup(namelist[i].name); 130*8a272653SPeter Holm 131*8a272653SPeter Holm if ((kd = kvm_openfiles(nlistf, memf, NULL, O_RDONLY, buf)) == NULL) 132*8a272653SPeter Holm errx(1, "kvm_openfile(%s, %s): %s", nlistf, memf, buf); 133*8a272653SPeter Holm if (kvm_nlist(kd, nl) == -1) 134*8a272653SPeter Holm errx(1, "kvm_nlist: %s", kvm_geterr(kd)); 135*8a272653SPeter Holm if (kvm_read(kd, nl[NL_NPROCS].n_value, &nprocs, 136*8a272653SPeter Holm sizeof(nprocs)) != sizeof(nprocs)) 137*8a272653SPeter Holm errx(1, "kvm_read(): %s", kvm_geterr(kd)); 138*8a272653SPeter Holm if (kvm_read(kd, nl[NL_MAXPROC].n_value, &maxproc, 139*8a272653SPeter Holm sizeof(maxproc)) != sizeof(maxproc)) 140*8a272653SPeter Holm errx(1, "kvm_read(): %s", kvm_geterr(kd)); 141*8a272653SPeter Holm kvm_close(kd); 142*8a272653SPeter Holm 143*8a272653SPeter Holm return (maxproc - nprocs - 1); 144*8a272653SPeter Holm} 145*8a272653SPeter Holm 146*8a272653SPeter Holmint 147*8a272653SPeter Holmmain(void) 148*8a272653SPeter Holm{ 149*8a272653SPeter Holm int i, n; 150*8a272653SPeter Holm 151*8a272653SPeter Holm alarm(1200); 152*8a272653SPeter Holm n = getprocs(); 153*8a272653SPeter Holm for (i = 0; i < n / 10 * 8; i++) { 154*8a272653SPeter Holm if (fork() == 0) { 155*8a272653SPeter Holm sleep(2); 156*8a272653SPeter Holm _exit(0); 157*8a272653SPeter Holm } 158*8a272653SPeter Holm } 159*8a272653SPeter Holm 160*8a272653SPeter Holm t1(0); 161*8a272653SPeter Holm 162*8a272653SPeter Holm n = getprocs(); 163*8a272653SPeter Holm if (n < 10 - MULTIUSERFUZZ) 164*8a272653SPeter Holm errx(1, "FAIL: nprocs = %d\n", n); 165*8a272653SPeter Holm 166*8a272653SPeter Holm return (0); 167*8a272653SPeter Holm} 168