/* [<][>][^][v][top][bottom][index][help] */
DEFINITIONS
This source file includes following definitions.
- hog
- waitall
- main
1 /*
2 * Copyright (c) 2000, 2001, 2002, 2003, 2004, 2005, 2008, 2009
3 * The President and Fellows of Harvard College.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 */
29
30 /*
31 * sty.c
32 *
33 * Run a bunch of cpu pigs.
34 *
35 * This test should itself run correctly when the basic system calls
36 * are complete. It may be helpful for scheduler performance analysis.
37 */
38
39 #include <unistd.h>
40 #include <err.h>
41
42 static char *hargv[2] = { (char *)"hog", NULL };
43
44 #define MAXPROCS 6
45 static int pids[MAXPROCS], npids;
46
47 static
48 void
49 hog(void)
50 {
51 int pid = fork();
52 switch (pid) {
53 case -1:
54 err(1, "fork");
55 case 0:
56 /* child */
57 execv("/testbin/hog", hargv);
58 err(1, "/testbin/hog");
59 default:
60 /* parent */
61 pids[npids++] = pid;
62 break;
63 }
64 }
65
66 static
67 void
68 waitall(void)
69 {
70 int i, status;
71 for (i=0; i<npids; i++) {
72 if (waitpid(pids[i], &status, 0)<0) {
73 warn("waitpid for %d", pids[i]);
74 }
75 else if (WIFSIGNALED(status)) {
76 warnx("pid %d: signal %d", pids[i], WTERMSIG(status));
77 }
78 else if (WEXITSTATUS(status) != 0) {
79 warnx("pid %d: exit %d", pids[i], WEXITSTATUS(status));
80 }
81 }
82 }
83
84 int
85 main()
86 {
87 hog();
88 hog();
89 hog();
90 hog();
91 hog();
92 hog();
93
94 waitall();
95 return 0;
96 }