1*8a272653SPeter Holm /*-
2*8a272653SPeter Holm * Copyright (c) 2008 Peter Holm <pho@FreeBSD.org>
3*8a272653SPeter Holm * All rights reserved.
4*8a272653SPeter Holm *
5*8a272653SPeter Holm * Redistribution and use in source and binary forms, with or without
6*8a272653SPeter Holm * modification, are permitted provided that the following conditions
7*8a272653SPeter Holm * are met:
8*8a272653SPeter Holm * 1. Redistributions of source code must retain the above copyright
9*8a272653SPeter Holm * notice, this list of conditions and the following disclaimer.
10*8a272653SPeter Holm * 2. Redistributions in binary form must reproduce the above copyright
11*8a272653SPeter Holm * notice, this list of conditions and the following disclaimer in the
12*8a272653SPeter Holm * documentation and/or other materials provided with the distribution.
13*8a272653SPeter Holm *
14*8a272653SPeter Holm * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15*8a272653SPeter Holm * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16*8a272653SPeter Holm * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17*8a272653SPeter Holm * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18*8a272653SPeter Holm * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19*8a272653SPeter Holm * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20*8a272653SPeter Holm * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21*8a272653SPeter Holm * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22*8a272653SPeter Holm * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23*8a272653SPeter Holm * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24*8a272653SPeter Holm * SUCH DAMAGE.
25*8a272653SPeter Holm *
26*8a272653SPeter Holm */
27*8a272653SPeter Holm
28*8a272653SPeter Holm /* Control program to run all the other test cases */
29*8a272653SPeter Holm
30*8a272653SPeter Holm #include <sys/param.h>
31*8a272653SPeter Holm #include <sys/wait.h>
32*8a272653SPeter Holm
33*8a272653SPeter Holm #include <err.h>
34*8a272653SPeter Holm #include <libgen.h>
35*8a272653SPeter Holm #include <stdio.h>
36*8a272653SPeter Holm #include <stdlib.h>
37*8a272653SPeter Holm #include <time.h>
38*8a272653SPeter Holm #include <unistd.h>
39*8a272653SPeter Holm
40*8a272653SPeter Holm #include "stress.h"
41*8a272653SPeter Holm
42*8a272653SPeter Holm #define MAXAV 10
43*8a272653SPeter Holm static char *av[MAXAV];
44*8a272653SPeter Holm static int loop = 1;
45*8a272653SPeter Holm
46*8a272653SPeter Holm int
setup(int nb __unused)47*8a272653SPeter Holm setup(int nb __unused)
48*8a272653SPeter Holm {
49*8a272653SPeter Holm return (0);
50*8a272653SPeter Holm }
51*8a272653SPeter Holm
52*8a272653SPeter Holm void
cleanup(void)53*8a272653SPeter Holm cleanup(void)
54*8a272653SPeter Holm {
55*8a272653SPeter Holm }
56*8a272653SPeter Holm
57*8a272653SPeter Holm static char **
mkargv(char * name)58*8a272653SPeter Holm mkargv(char *name)
59*8a272653SPeter Holm {
60*8a272653SPeter Holm av[0] = name;
61*8a272653SPeter Holm av[1] = 0;
62*8a272653SPeter Holm return (av);
63*8a272653SPeter Holm }
64*8a272653SPeter Holm
65*8a272653SPeter Holm static void
clean(void)66*8a272653SPeter Holm clean(void)
67*8a272653SPeter Holm {
68*8a272653SPeter Holm char buf[132];
69*8a272653SPeter Holm
70*8a272653SPeter Holm snprintf(buf, sizeof(buf),
71*8a272653SPeter Holm "cd %s; rm -rf syscall.[0-9]* fifo.[0-9]* creat.[0-9]* "
72*8a272653SPeter Holm "p[0-9]*.d1 df lock", op->cd);
73*8a272653SPeter Holm (void)system(buf);
74*8a272653SPeter Holm }
75*8a272653SPeter Holm
76*8a272653SPeter Holm int
test(void)77*8a272653SPeter Holm test(void)
78*8a272653SPeter Holm {
79*8a272653SPeter Holm struct tm *tm;
80*8a272653SPeter Holm pid_t *r;
81*8a272653SPeter Holm time_t t;
82*8a272653SPeter Holm int i;
83*8a272653SPeter Holm int s;
84*8a272653SPeter Holm char fullpath[MAXPATHLEN+1];
85*8a272653SPeter Holm char ct[80];
86*8a272653SPeter Holm
87*8a272653SPeter Holm r = (pid_t *)malloc(op->argc * sizeof(pid_t));
88*8a272653SPeter Holm
89*8a272653SPeter Holm (void)time(&t);
90*8a272653SPeter Holm tm = localtime(&t);
91*8a272653SPeter Holm (void) strftime(ct, sizeof(ct), "%T", tm);
92*8a272653SPeter Holm printf("%s Loop #%d\n", ct, loop++);
93*8a272653SPeter Holm fflush(stdout);
94*8a272653SPeter Holm
95*8a272653SPeter Holm for (i = 0; i < op->argc; i++) {
96*8a272653SPeter Holm r[i] = 0;
97*8a272653SPeter Holm if (op->argv[i][0] == 0)
98*8a272653SPeter Holm continue;
99*8a272653SPeter Holm if ((r[i] = fork()) == 0) {
100*8a272653SPeter Holm snprintf(fullpath, sizeof(fullpath), "%s/%s", home,
101*8a272653SPeter Holm op->argv[i]);
102*8a272653SPeter Holm if (execv(fullpath, mkargv(basename(op->argv[i]))) == -1)
103*8a272653SPeter Holm err(1, "execl(%s), %s:%d", fullpath, __FILE__,
104*8a272653SPeter Holm __LINE__);
105*8a272653SPeter Holm }
106*8a272653SPeter Holm if (r[i] < 0)
107*8a272653SPeter Holm err(1, "fork(), %s:%d", __FILE__, __LINE__);
108*8a272653SPeter Holm }
109*8a272653SPeter Holm for (i = 0; i < op->argc; i++)
110*8a272653SPeter Holm if (r[i] != 0 && waitpid(r[i], &s, 0) == -1)
111*8a272653SPeter Holm err(1, "waitpid(%d), %s:%d", r[i], __FILE__, __LINE__);
112*8a272653SPeter Holm free(r);
113*8a272653SPeter Holm
114*8a272653SPeter Holm clean();
115*8a272653SPeter Holm
116*8a272653SPeter Holm return (0);
117*8a272653SPeter Holm }
118