minix/test/test8.c
2005-09-19 13:39:27 +00:00

265 lines
6.4 KiB
C

/* test8: pipe() Author: Jan-Mark Wams (jms@cs.vu.nl) */
#include <sys/types.h>
#include <sys/stat.h>
#include <sys/wait.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <fcntl.h>
#include <limits.h>
#include <errno.h>
#include <time.h>
#include <stdio.h>
#define MAX_ERROR 4
#define ITERATIONS 60
#define Fstat(a,b) if (fstat(a,b) != 0) printf("Can't fstat %d\n", a)
#define Time(t) if (time(t) == (time_t)-1) printf("Time error\n")
int errct = 0;
int subtest = 1;
char MaxName[NAME_MAX + 1]; /* Name of maximum length */
char MaxPath[PATH_MAX]; /* Same for path */
char ToLongName[NAME_MAX + 2]; /* Name of maximum +1 length */
char ToLongPath[PATH_MAX + 1]; /* Same for path, both too long */
_PROTOTYPE(void main, (int argc, char *argv[]));
_PROTOTYPE(void test8a, (void));
_PROTOTYPE(void test8b, (void));
_PROTOTYPE(void e, (int number));
_PROTOTYPE(void quit, (void));
void main(argc, argv)
int argc;
char *argv[];
{
int i, m = 0xFFFF;
sync();
if (argc == 2) m = atoi(argv[1]);
printf("Test 8 ");
fflush(stdout);
for (i = 0; i < ITERATIONS; i++) {
if (m & 0001) test8a();
if (m & 0002) test8b();
}
quit();
}
void test8a()
{ /* Test fcntl flags. */
int tube[2], t1[2], t2[2], t3[2];
time_t time1, time2;
char buf[128];
struct stat st1, st2;
int stat_loc, flags;
subtest = 1;
/* Check if lowest fds are returned. */
if (pipe(tube) != 0) e(1);
if (tube[0] != 3 && tube[1] != 3) e(2);
if (tube[1] != 4 && tube[0] != 4) e(3);
if (tube[1] == tube[0]) e(4);
if (pipe(t1) != 0) e(5);
if (t1[0] != 5 && t1[1] != 5) e(6);
if (t1[1] != 6 && t1[0] != 6) e(7);
if (t1[1] == t1[0]) e(8);
if (close(t1[0]) != 0) e(9);
if (close(tube[0]) != 0) e(10);
if (pipe(t2) != 0) e(11);
if (t2[0] != tube[0] && t2[1] != tube[0]) e(12);
if (t2[1] != t1[0] && t2[0] != t1[0]) e(13);
if (t2[1] == t2[0]) e(14);
if (pipe(t3) != 0) e(15);
if (t3[0] != 7 && t3[1] != 7) e(16);
if (t3[1] != 8 && t3[0] != 8) e(17);
if (t3[1] == t3[0]) e(18);
if (close(tube[1]) != 0) e(19);
if (close(t1[1]) != 0) e(20);
if (close(t2[0]) != 0) e(21);
if (close(t2[1]) != 0) e(22);
if (close(t3[0]) != 0) e(23);
if (close(t3[1]) != 0) e(24);
/* All time fields should be marked for update. */
Time(&time1);
if (pipe(tube) != 0) e(25);
Fstat(tube[0], &st1);
Fstat(tube[1], &st2);
Time(&time2);
if (st1.st_atime < time1) e(26);
if (st1.st_ctime < time1) e(27);
if (st1.st_mtime < time1) e(28);
if (st1.st_atime > time2) e(29);
if (st1.st_ctime > time2) e(30);
if (st1.st_mtime > time2) e(31);
if (st2.st_atime < time1) e(32);
if (st2.st_ctime < time1) e(33);
if (st2.st_mtime < time1) e(34);
if (st2.st_atime > time2) e(35);
if (st2.st_ctime > time2) e(36);
if (st2.st_mtime > time2) e(37);
/* Check the file characteristics. */
if ((flags = fcntl(tube[0], F_GETFD)) != 0) e(38);
if ((flags & FD_CLOEXEC) != 0) e(39);
if ((flags = fcntl(tube[0], F_GETFL)) != 0) e(40);
if ((flags & O_RDONLY) != O_RDONLY) e(41);
if ((flags & O_NONBLOCK) != 0) e(42);
if ((flags & O_RDWR) != 0) e(43);
if ((flags & O_WRONLY) != 0) e(44);
if ((flags = fcntl(tube[1], F_GETFD)) != 0) e(45);
if ((flags & FD_CLOEXEC) != 0) e(46);
if ((flags = fcntl(tube[1], F_GETFL)) == -1) e(47);
if ((flags & O_WRONLY) != O_WRONLY) e(48);
if ((flags & O_NONBLOCK) != 0) e(49);
if ((flags & O_RDWR) != 0) e(50);
if ((flags & O_RDONLY) != 0) e(51);
/* Check if we can read and write. */
switch (fork()) {
case -1: printf("Can't fork\n"); break;
case 0:
alarm(20);
if (close(tube[0]) != 0) e(52);
if (write(tube[1], "Hello", 6) != 6) e(53);
if (close(tube[1]) != 0) e(54);
exit(0);
default:
if (read(tube[0], buf, sizeof(buf)) != 6) e(55);
if (strncmp(buf, "Hello", 6) != 0) e(56);
wait(&stat_loc);
if (stat_loc != 0) e(57); /* Alarm? */
}
if (close(tube[0]) != 0) e(58);
if (close(tube[1]) != 0) e(59);
}
void test8b()
{
int tube[2], child2parent[2], parent2child[2];
int i, nchild = 0, nopen = 3, stat_loc;
int fd;
int forkfailed = 0;
char c;
subtest = 2;
/* Take all the pipes we can get. */
while (nopen < OPEN_MAX - 2) {
if (pipe(tube) != 0) {
/* We have not reached OPEN_MAX yet, so we have ENFILE. */
if (errno != ENFILE) e(1);
sleep(2); /* Wait for others to (maybe) closefiles. */
break;
}
nopen += 2;
}
if (nopen < OPEN_MAX - 2) {
if (pipe(tube) != -1) e(2);
switch (errno) {
case EMFILE: /* Errno value is ok. */
break;
case ENFILE: /* No process can open files any more. */
switch (fork()) {
case -1:
printf("Can't fork\n");
break;
case 0:
alarm(20);
if (open("/", O_RDONLY) != -1) e(3);
if (errno != ENFILE) e(4);
exit(0);
default:
wait(&stat_loc);
if (stat_loc != 0) e(5); /* Alarm? */
}
break;
default: /* Wrong value for errno. */
e(6);
}
}
/* Close all but stdin,out,err. */
for (i = 3; i < OPEN_MAX; i++) (void) close(i);
/* ENFILE test. Have children each grab OPEN_MAX fds. */
if (pipe(child2parent) != 0) e(7);
if (pipe(parent2child) != 0) e(8);
while (!forkfailed && (fd = open("/", O_RDONLY)) != -1) {
close(fd);
switch (fork()) {
case -1:
forkfailed = 1;
break;
case 0:
alarm(60);
/* Grab all the fds. */
while (pipe(tube) != -1);
while (open("/", O_RDONLY) != -1);
/* Signal parent OPEN_MAX fds gone. */
if (write(child2parent[1], "*", 1) != 1) e(9);
/* Wait for parent befor freeing all the fds. */
if (read(parent2child[0], &c, 1) != 1) e(10);
exit(0);
default:
/* Wait for child to grab OPEN_MAX fds. */
if (read(child2parent[0], &c, 1) != 1) e(11);
nchild++;
break;
}
}
if (!forkfailed) {
if (pipe(tube) != -1) e(12);
if (errno != ENFILE) e(13);
}
/* Signal children to die and wait for it. */
while (nchild-- > 0) {
if (write(parent2child[1], "*", 1) != 1) e(14);
wait(&stat_loc);
if (stat_loc != 0) e(15); /* Alarm? */
}
/* Close all but stdin,out,err. */
for (i = 3; i < OPEN_MAX; i++) (void) close(i);
}
void e(n)
int n;
{
int err_num = errno; /* Save in case printf clobbers it. */
printf("Subtest %d, error %d errno=%d: ", subtest, n, errno);
errno = err_num;
perror("");
if (errct++ > MAX_ERROR) {
printf("Too many errors; test aborted\n");
chdir("..");
system("rm -rf DIR*");
exit(1);
}
errno = 0;
}
void quit()
{
if (errct == 0) {
printf("ok\n");
exit(0);
} else {
printf("%d errors\n", errct);
exit(1);
}
}