xref: /freebsd/tools/test/stress2/testcases/run/run.c (revision 8a272653)
18a272653SPeter Holm /*-
28a272653SPeter Holm  * Copyright (c) 2008 Peter Holm <pho@FreeBSD.org>
38a272653SPeter Holm  * All rights reserved.
48a272653SPeter Holm  *
58a272653SPeter Holm  * Redistribution and use in source and binary forms, with or without
68a272653SPeter Holm  * modification, are permitted provided that the following conditions
78a272653SPeter Holm  * are met:
88a272653SPeter Holm  * 1. Redistributions of source code must retain the above copyright
98a272653SPeter Holm  *    notice, this list of conditions and the following disclaimer.
108a272653SPeter Holm  * 2. Redistributions in binary form must reproduce the above copyright
118a272653SPeter Holm  *    notice, this list of conditions and the following disclaimer in the
128a272653SPeter Holm  *    documentation and/or other materials provided with the distribution.
138a272653SPeter Holm  *
148a272653SPeter Holm  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
158a272653SPeter Holm  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
168a272653SPeter Holm  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
178a272653SPeter Holm  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
188a272653SPeter Holm  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
198a272653SPeter Holm  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
208a272653SPeter Holm  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
218a272653SPeter Holm  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
228a272653SPeter Holm  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
238a272653SPeter Holm  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
248a272653SPeter Holm  * SUCH DAMAGE.
258a272653SPeter Holm  *
268a272653SPeter Holm  */
278a272653SPeter Holm 
288a272653SPeter Holm /* Control program to run all the other test cases */
298a272653SPeter Holm 
308a272653SPeter Holm #include <sys/param.h>
318a272653SPeter Holm #include <sys/wait.h>
328a272653SPeter Holm 
338a272653SPeter Holm #include <err.h>
348a272653SPeter Holm #include <libgen.h>
358a272653SPeter Holm #include <stdio.h>
368a272653SPeter Holm #include <stdlib.h>
378a272653SPeter Holm #include <time.h>
388a272653SPeter Holm #include <unistd.h>
398a272653SPeter Holm 
408a272653SPeter Holm #include "stress.h"
418a272653SPeter Holm 
428a272653SPeter Holm #define MAXAV 10
438a272653SPeter Holm static char *av[MAXAV];
448a272653SPeter Holm static int loop = 1;
458a272653SPeter Holm 
468a272653SPeter Holm int
setup(int nb __unused)478a272653SPeter Holm setup(int nb __unused)
488a272653SPeter Holm {
498a272653SPeter Holm 	return (0);
508a272653SPeter Holm }
518a272653SPeter Holm 
528a272653SPeter Holm void
cleanup(void)538a272653SPeter Holm cleanup(void)
548a272653SPeter Holm {
558a272653SPeter Holm }
568a272653SPeter Holm 
578a272653SPeter Holm static char **
mkargv(char * name)588a272653SPeter Holm mkargv(char *name)
598a272653SPeter Holm {
608a272653SPeter Holm 	av[0] = name;
618a272653SPeter Holm 	av[1] = 0;
628a272653SPeter Holm 	return (av);
638a272653SPeter Holm }
648a272653SPeter Holm 
658a272653SPeter Holm static void
clean(void)668a272653SPeter Holm clean(void)
678a272653SPeter Holm {
688a272653SPeter Holm 	char buf[132];
698a272653SPeter Holm 
708a272653SPeter Holm 	snprintf(buf, sizeof(buf),
718a272653SPeter Holm 		"cd %s; rm -rf syscall.[0-9]* fifo.[0-9]* creat.[0-9]* "
728a272653SPeter Holm 		"p[0-9]*.d1 df lock", op->cd);
738a272653SPeter Holm 	(void)system(buf);
748a272653SPeter Holm }
758a272653SPeter Holm 
768a272653SPeter Holm int
test(void)778a272653SPeter Holm test(void)
788a272653SPeter Holm {
798a272653SPeter Holm 	struct tm *tm;
808a272653SPeter Holm 	pid_t *r;
818a272653SPeter Holm 	time_t	t;
828a272653SPeter Holm 	int i;
838a272653SPeter Holm 	int s;
848a272653SPeter Holm 	char fullpath[MAXPATHLEN+1];
858a272653SPeter Holm 	char ct[80];
868a272653SPeter Holm 
878a272653SPeter Holm 	r = (pid_t *)malloc(op->argc * sizeof(pid_t));
888a272653SPeter Holm 
898a272653SPeter Holm 	(void)time(&t);
908a272653SPeter Holm 	tm = localtime(&t);
918a272653SPeter Holm 	(void) strftime(ct, sizeof(ct), "%T", tm);
928a272653SPeter Holm 	printf("%s Loop #%d\n", ct, loop++);
938a272653SPeter Holm 	fflush(stdout);
948a272653SPeter Holm 
958a272653SPeter Holm 	for (i = 0; i < op->argc; i++) {
968a272653SPeter Holm 		r[i] = 0;
978a272653SPeter Holm 		if (op->argv[i][0] == 0)
988a272653SPeter Holm 			continue;
998a272653SPeter Holm 		if ((r[i] = fork()) == 0) {
1008a272653SPeter Holm 			snprintf(fullpath, sizeof(fullpath), "%s/%s", home,
1018a272653SPeter Holm 				op->argv[i]);
1028a272653SPeter Holm 			if (execv(fullpath, mkargv(basename(op->argv[i]))) == -1)
1038a272653SPeter Holm 				err(1, "execl(%s), %s:%d", fullpath, __FILE__,
1048a272653SPeter Holm 					__LINE__);
1058a272653SPeter Holm 		}
1068a272653SPeter Holm 		if (r[i] < 0)
1078a272653SPeter Holm 			err(1, "fork(), %s:%d", __FILE__, __LINE__);
1088a272653SPeter Holm 	}
1098a272653SPeter Holm 	for (i = 0; i < op->argc; i++)
1108a272653SPeter Holm 		if (r[i] != 0 && waitpid(r[i], &s, 0) == -1)
1118a272653SPeter Holm 			err(1, "waitpid(%d), %s:%d", r[i], __FILE__, __LINE__);
1128a272653SPeter Holm 	free(r);
1138a272653SPeter Holm 
1148a272653SPeter Holm 	clean();
1158a272653SPeter Holm 
1168a272653SPeter Holm 	return (0);
1178a272653SPeter Holm }
118