266 lines
6.5 KiB
C
266 lines
6.5 KiB
C
/*
|
|
* Copyright (c) 2000, 2001, 2002, 2003, 2004, 2005, 2008, 2009
|
|
* The President and Fellows of Harvard College.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#include <sys/types.h>
|
|
#include <sys/stat.h>
|
|
#include <stdio.h>
|
|
#include <stdarg.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <unistd.h>
|
|
#include <errno.h>
|
|
#include <err.h>
|
|
|
|
#include "config.h"
|
|
#include "test.h"
|
|
|
|
////////////////////////////////////////////////////////////
|
|
|
|
int open_testfile(const char *string) {
|
|
int fd, rv;
|
|
size_t len;
|
|
|
|
fd = open(TESTFILE, O_RDWR | O_CREAT | O_TRUNC, 0664);
|
|
if (fd < 0) {
|
|
report_warn("creating %s: failed", TESTFILE);
|
|
return -1;
|
|
}
|
|
|
|
if (string) {
|
|
len = strlen(string);
|
|
rv = write(fd, string, len);
|
|
if (rv < 0) {
|
|
report_warn("write to %s failed", TESTFILE);
|
|
close(fd);
|
|
remove(TESTFILE);
|
|
return -1;
|
|
}
|
|
if ((unsigned)rv != len) {
|
|
report_warn("write to %s got short count", TESTFILE);
|
|
close(fd);
|
|
remove(TESTFILE);
|
|
return -1;
|
|
}
|
|
rv = lseek(fd, 0, SEEK_SET);
|
|
if (rv < 0) {
|
|
report_warn("rewind of %s failed", TESTFILE);
|
|
close(fd);
|
|
remove(TESTFILE);
|
|
return -1;
|
|
}
|
|
}
|
|
return fd;
|
|
}
|
|
|
|
int create_testfile(void) {
|
|
int fd, rv;
|
|
|
|
fd = open_testfile(NULL);
|
|
if (fd < 0) {
|
|
return -1;
|
|
}
|
|
|
|
rv = close(fd);
|
|
if (rv < 0) {
|
|
report_warn("closing %s failed", TESTFILE);
|
|
return -1;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
int reopen_testfile(int openflags) {
|
|
int fd;
|
|
|
|
fd = open(TESTFILE, openflags, 0664);
|
|
if (fd < 0) {
|
|
report_warn("reopening %s: failed", TESTFILE);
|
|
return -1;
|
|
}
|
|
return fd;
|
|
}
|
|
|
|
/*
|
|
* Note: unlike everything else this calls skipped/aborted, because
|
|
* otherwise it has to communicate to the caller which to call and
|
|
* that's a pain.
|
|
*/
|
|
int create_testdir(void) {
|
|
int rv;
|
|
rv = mkdir(TESTDIR, 0775);
|
|
if (rv < 0) {
|
|
if (errno == ENOSYS) {
|
|
report_saw_enosys();
|
|
report_warnx("mkdir unimplemented; cannot run test");
|
|
report_skipped();
|
|
} else {
|
|
report_warn("mkdir %s failed", TESTDIR);
|
|
report_aborted();
|
|
}
|
|
return -1;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
int create_testlink(void) {
|
|
int rv;
|
|
rv = symlink("blahblah", TESTLINK);
|
|
if (rv < 0) {
|
|
report_warn("making symlink %s failed", TESTLINK);
|
|
return -1;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
////////////////////////////////////////////////////////////
|
|
|
|
static struct {
|
|
int ch;
|
|
int asst;
|
|
const char *name;
|
|
void (*f)(void);
|
|
} ops[] = {{'a', 2, "execv", test_execv},
|
|
{'b', 2, "waitpid", test_waitpid},
|
|
{'c', 2, "open", test_open},
|
|
{'d', 2, "read", test_read},
|
|
{'e', 2, "write", test_write},
|
|
{'f', 2, "close", test_close},
|
|
{'g', 0, "reboot", test_reboot},
|
|
{'h', 3, "sbrk", test_sbrk},
|
|
{'i', 5, "ioctl", test_ioctl},
|
|
{'j', 2, "lseek", test_lseek},
|
|
{'k', 4, "fsync", test_fsync},
|
|
{'l', 4, "ftruncate", test_ftruncate},
|
|
{'m', 4, "fstat", test_fstat},
|
|
{'n', 4, "remove", test_remove},
|
|
{'o', 4, "rename", test_rename},
|
|
{'p', 5, "link", test_link},
|
|
{'q', 4, "mkdir", test_mkdir},
|
|
{'r', 4, "rmdir", test_rmdir},
|
|
{'s', 2, "chdir", test_chdir},
|
|
{'t', 4, "getdirentry", test_getdirentry},
|
|
{'u', 5, "symlink", test_symlink},
|
|
{'v', 5, "readlink", test_readlink},
|
|
{'w', 2, "dup2", test_dup2},
|
|
{'x', 5, "pipe", test_pipe},
|
|
{'y', 5, "__time", test_time},
|
|
{'z', 2, "__getcwd", test_getcwd},
|
|
{'{', 5, "stat", test_stat},
|
|
{'|', 5, "lstat", test_lstat},
|
|
{0, 0, NULL, NULL}};
|
|
|
|
#define LOWEST 'a'
|
|
#define HIGHEST '|'
|
|
|
|
static void menu(void) {
|
|
int i;
|
|
for (i = 0; ops[i].name; i++) {
|
|
printf("[%c] %-24s", ops[i].ch, ops[i].name);
|
|
if (i % 2 == 1) {
|
|
printf("\n");
|
|
}
|
|
}
|
|
if (i % 2 == 1) {
|
|
printf("\n");
|
|
}
|
|
printf("[1] %-24s", "asst1");
|
|
printf("[2] %-24s\n", "asst2");
|
|
printf("[3] %-24s", "asst3");
|
|
printf("[4] %-24s\n", "asst4");
|
|
printf("[*] %-24s", "all");
|
|
printf("[!] %-24s\n", "quit");
|
|
}
|
|
|
|
static void runit(int op) {
|
|
int i, k;
|
|
|
|
if (op == '!') {
|
|
exit(0);
|
|
}
|
|
|
|
if (op == '?') {
|
|
menu();
|
|
return;
|
|
}
|
|
|
|
if (op == '*') {
|
|
for (i = 0; ops[i].name; i++) {
|
|
printf("[%s]\n", ops[i].name);
|
|
ops[i].f();
|
|
}
|
|
return;
|
|
}
|
|
|
|
if (op >= '1' && op <= '4') {
|
|
k = op - '0';
|
|
for (i = 0; ops[i].name; i++) {
|
|
if (ops[i].asst <= k) {
|
|
printf("[%s]\n", ops[i].name);
|
|
ops[i].f();
|
|
}
|
|
}
|
|
return;
|
|
}
|
|
|
|
if (op < LOWEST || op > HIGHEST) {
|
|
printf("Invalid request %c\n", op);
|
|
return;
|
|
}
|
|
|
|
ops[op - 'a'].f();
|
|
}
|
|
|
|
int main(int argc, char **argv) {
|
|
int op, i, j;
|
|
|
|
printf("[%c-%c, 1-4, *, ?=menu, !=quit]\n", LOWEST, HIGHEST);
|
|
|
|
if (argc > 1) {
|
|
for (i = 1; i < argc; i++) {
|
|
for (j = 0; argv[i][j]; j++) {
|
|
printf("Choose: %c\n", argv[i][j]);
|
|
runit(argv[i][j]);
|
|
}
|
|
}
|
|
} else {
|
|
menu();
|
|
while (1) {
|
|
printf("Choose: ");
|
|
op = getchar();
|
|
if (op == EOF) {
|
|
break;
|
|
}
|
|
printf("%c\n", op);
|
|
runit(op);
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|