00001 /* 00002 * Copyright (c) 2000, 2001, 2002, 2003, 2004, 2005, 2008, 2009 00003 * The President and Fellows of Harvard College. 00004 * 00005 * Redistribution and use in source and binary forms, with or without 00006 * modification, are permitted provided that the following conditions 00007 * are met: 00008 * 1. Redistributions of source code must retain the above copyright 00009 * notice, this list of conditions and the following disclaimer. 00010 * 2. Redistributions in binary form must reproduce the above copyright 00011 * notice, this list of conditions and the following disclaimer in the 00012 * documentation and/or other materials provided with the distribution. 00013 * 3. Neither the name of the University nor the names of its contributors 00014 * may be used to endorse or promote products derived from this software 00015 * without specific prior written permission. 00016 * 00017 * THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY AND CONTRIBUTORS ``AS IS'' AND 00018 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00019 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 00020 * ARE DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY OR CONTRIBUTORS BE LIABLE 00021 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 00022 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 00023 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 00024 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 00025 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 00026 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 00027 * SUCH DAMAGE. 00028 */ 00029 00030 /* 00031 * sty.c 00032 * 00033 * Run a bunch of cpu pigs. 00034 * 00035 * This test should itself run correctly when the basic system calls 00036 * are complete. It may be helpful for scheduler performance analysis. 00037 */ 00038 00039 #include <unistd.h> 00040 #include <err.h> 00041 00042 static char *hargv[2] = { (char *)"hog", NULL }; 00043 00044 #define MAXPROCS 6 00045 static int pids[MAXPROCS], npids; 00046 00047 static 00048 void 00049 hog(void) 00050 { 00051 int pid = fork(); 00052 switch (pid) { 00053 case -1: 00054 err(1, "fork"); 00055 case 0: 00056 /* child */ 00057 execv("/testbin/hog", hargv); 00058 err(1, "/testbin/hog"); 00059 default: 00060 /* parent */ 00061 pids[npids++] = pid; 00062 break; 00063 } 00064 } 00065 00066 static 00067 void 00068 waitall(void) 00069 { 00070 int i, status; 00071 for (i=0; i<npids; i++) { 00072 if (waitpid(pids[i], &status, 0)<0) { 00073 warn("waitpid for %d", pids[i]); 00074 } 00075 else if (WIFSIGNALED(status)) { 00076 warnx("pid %d: signal %d", pids[i], WTERMSIG(status)); 00077 } 00078 else if (WEXITSTATUS(status) != 0) { 00079 warnx("pid %d: exit %d", pids[i], WEXITSTATUS(status)); 00080 } 00081 } 00082 } 00083 00084 int 00085 main() 00086 { 00087 hog(); 00088 hog(); 00089 hog(); 00090 hog(); 00091 hog(); 00092 hog(); 00093 00094 waitall(); 00095 return 0; 00096 }