. use library function to parse memory string
[minix3.git] / test / test31.c
blob59c0fde436d40dabe2874ef88d25941c84bffeec
1 /* test31: mkfifo() Author: Jan-Mark Wams (jms@cs.vu.nl) */
3 #include <sys/types.h>
4 #include <sys/stat.h>
5 #include <sys/wait.h>
6 #include <stdlib.h>
7 #include <unistd.h>
8 #include <string.h>
9 #include <fcntl.h>
10 #include <limits.h>
11 #include <errno.h>
12 #include <time.h>
13 #include <stdio.h>
15 #define MAX_ERROR 4
16 #define ITERATIONS 10
18 #define System(cmd) if (system(cmd) != 0) printf("``%s'' failed\n", cmd)
19 #define Chdir(dir) if (chdir(dir) != 0) printf("Can't goto %s\n", dir)
20 #define Stat(a,b) if (stat(a,b) != 0) printf("Can't stat %s\n", a)
22 int errct = 0;
23 int subtest = 1;
24 int superuser;
25 char MaxName[NAME_MAX + 1]; /* Name of maximum length */
26 char MaxPath[PATH_MAX]; /* Same for path */
27 char ToLongName[NAME_MAX + 2]; /* Name of maximum +1 length */
28 char ToLongPath[PATH_MAX + 1]; /* Same for path, both too long */
30 _PROTOTYPE(void main, (int argc, char *argv[]));
31 _PROTOTYPE(void test31a, (void));
32 _PROTOTYPE(void test31b, (void));
33 _PROTOTYPE(void test31c, (void));
34 _PROTOTYPE(void makelongnames, (void));
35 _PROTOTYPE(void e, (int number));
36 _PROTOTYPE(void quit, (void));
38 void main(argc, argv)
39 int argc;
40 char *argv[];
42 int i, m = 0xFFFF;
44 sync();
45 if (argc == 2) m = atoi(argv[1]);
46 printf("Test 31 ");
47 fflush(stdout);
48 System("rm -rf DIR_31; mkdir DIR_31");
49 Chdir("DIR_31");
50 makelongnames();
51 superuser = (geteuid() == 0);
53 umask(0000);
55 for (i = 0; i < ITERATIONS; i++) {
56 if (m & 0001) test31a();
57 if (m & 0002) test31b();
58 if (m & 0004) test31c();
60 quit();
63 void test31a()
64 { /* Test normal operation. */
66 #define BUF_SIZE 1024
68 int fd;
69 char buf[BUF_SIZE];
70 struct stat st, dirst;
71 time_t time1, time2;
72 int stat_loc, cnt;
74 subtest = 1;
76 System("rm -rf ../DIR_31/*");
78 /* Check if the file status information is updated correctly */
79 System("rm -rf fifo");
80 cnt = 0;
81 Stat(".", &dirst);
82 time(&time1);
83 while (time1 == time((time_t *)0))
86 do {
87 time(&time1);
88 if (mkfifo("fifo", 0644) != 0) e(1);
89 Stat("fifo", &st);
90 time(&time2);
91 } while (time1 != time2 && cnt++ < 100);
93 if (cnt >= 100) e(2);
94 if (st.st_uid != geteuid()) e(3); /* Uid should be set. */
95 #if defined(NGROUPS_MAX) && NGROUPS_MAX == 0
96 if (st.st_gid != getegid()) e(4);
97 #endif /* defined(NGROUPS_MAX) && NGROUPS_MAX == 0 */
98 if (!S_ISFIFO(st.st_mode)) e(5);
99 if (st.st_mode & 0777 != 0644) e(6);
100 if (st.st_nlink != 1) e(7);
101 if (st.st_ctime != time1) e(8);
102 if (st.st_atime != time1) e(9);
103 if (st.st_mtime != time1) e(10);
104 if (st.st_size != 0) e(11); /* File should be empty. */
106 /* Check if status for "." is updated. */
107 Stat(".", &st);
108 if (st.st_ctime <= dirst.st_ctime) e(12);
109 if (st.st_mtime <= dirst.st_mtime) e(13);
111 /* Basic checking if a fifo file created with mkfifo() is a pipe. */
112 alarm(10); /* in case fifo hangs */
113 switch (fork()) {
114 case -1: printf("Can't fork\n"); break;
115 case 0:
116 if ((fd = open("fifo", O_RDONLY)) != 3) e(14);
117 if (read(fd, buf, BUF_SIZE) != 7) e(15);
118 if (strcmp(buf, "banana") != 0) e(16);
119 if (close(fd) != 0) e(17);
120 if ((fd = open("fifo", O_WRONLY)) != 3) e(18);
121 if (write(fd, "thanks", 7) != 7) e(19);
122 if (close(fd) != 0) e(20);
123 exit(0);
125 default:
126 if ((fd = open("fifo", O_WRONLY)) != 3) e(21);
127 if (write(fd, "banana", 7) != 7) e(22);
128 if (close(fd) != 0) e(23);
129 if ((fd = open("fifo", O_RDONLY)) != 3) e(24);
130 if (read(fd, buf, BUF_SIZE) != 7) e(25);
131 if (strcmp(buf, "thanks") != 0) e(26);
132 if (close(fd) != 0) e(27);
133 wait(&stat_loc);
134 if (stat_loc != 0) e(28); /* Alarm? */
136 alarm(0);
139 void test31b()
141 subtest = 2;
143 System("rm -rf ../DIR_31/*");
145 /* Test maximal file name length. */
146 if (mkfifo(MaxName, 0777) != 0) e(1);
147 if (unlink(MaxName) != 0) e(2);
148 MaxPath[strlen(MaxPath) - 2] = '/';
149 MaxPath[strlen(MaxPath) - 1] = 'a'; /* make ././.../a */
150 if (mkfifo(MaxPath, 0777) != 0) e(3);
151 if (unlink(MaxPath) != 0) e(4);
152 MaxPath[strlen(MaxPath) - 1] = '/'; /* make ././.../a */
155 void test31c()
157 subtest = 3;
159 System("rm -rf ../DIR_31/*");
161 /* Check if mkfifo() removes, files, fifos, dirs. */
162 if (mkfifo("fifo", 0777) != 0) e(1);
163 System("mkdir dir; > file");
164 if (mkfifo("fifo", 0777) != -1) e(2);
165 if (errno != EEXIST) e(3);
166 if (mkfifo("dir", 0777) != -1) e(4);
167 if (errno != EEXIST) e(5);
168 if (mkfifo("file", 0777) != -1) e(6);
169 if (errno != EEXIST) e(7);
171 /* Test empty path. */
172 if (mkfifo("", 0777) != -1) e(8);
173 if (errno != ENOENT) e(9);
174 if (mkfifo("/tmp/noway/out", 0777) != -1) e(10);
175 if (errno != ENOENT) e(11);
177 /* Test if path prefix is a directory. */
178 if (mkfifo("/etc/passwd/nono", 0777) != -1) e(12);
179 if (errno != ENOTDIR) e(13);
181 mkdir("bar", 0777); /* make bar */
183 /* Check if no access on part of path generates the correct error. */
184 System("chmod 577 bar"); /* r-xrwxrwx */
185 if (!superuser) {
186 if (mkfifo("bar/nono", 0666) != -1) e(14);
187 if (errno != EACCES) e(15);
189 if (superuser) {
190 if (mkfifo("bar/nono", 0666) != 0) e(14);
191 if (unlink("bar/nono") != 0) e(666);
193 System("chmod 677 bar"); /* rw-rwxrwx */
194 if (!superuser) {
195 if (mkfifo("bar/../nono", 0666) != -1) e(16);
196 if (errno != EACCES) e(17);
198 if (unlink("nono") != -1) e(18);
200 /* Clean up bar. */
201 System("rm -rf bar");
203 /* Test ToLongName and ToLongPath */
204 #ifdef _POSIX_NO_TRUNC
205 # if _POSIX_NO_TRUNC - 0 != -1
206 if (mkfifo(ToLongName, 0777) != -1) e(19);
207 if (errno != ENAMETOOLONG) e(20);
208 # else
209 if (mkfifo(ToLongName, 0777) != 0) e(21);
210 # endif
211 #else
212 # include "error, this case requires dynamic checks and is not handled"
213 #endif
214 ToLongPath[PATH_MAX - 2] = '/';
215 ToLongPath[PATH_MAX - 1] = 'a';
216 if (mkfifo(ToLongPath, 0777) != -1) e(22);
217 if (errno != ENAMETOOLONG) e(23);
218 ToLongPath[PATH_MAX - 1] = '/';
221 void makelongnames()
223 register int i;
225 memset(MaxName, 'a', NAME_MAX);
226 MaxName[NAME_MAX] = '\0';
227 for (i = 0; i < PATH_MAX - 1; i++) { /* idem path */
228 MaxPath[i++] = '.';
229 MaxPath[i] = '/';
231 MaxPath[PATH_MAX - 1] = '\0';
233 strcpy(ToLongName, MaxName); /* copy them Max to ToLong */
234 strcpy(ToLongPath, MaxPath);
236 ToLongName[NAME_MAX] = 'a';
237 ToLongName[NAME_MAX + 1] = '\0'; /* extend ToLongName by one too many */
238 ToLongPath[PATH_MAX - 1] = '/';
239 ToLongPath[PATH_MAX] = '\0'; /* inc ToLongPath by one */
242 void e(n)
243 int n;
245 int err_num = errno; /* Save in case printf clobbers it. */
247 printf("Subtest %d, error %d errno=%d: ", subtest, n, errno);
248 errno = err_num;
249 perror("");
250 if (errct++ > MAX_ERROR) {
251 printf("Too many errors; test aborted\n");
252 chdir("..");
253 system("rm -rf DIR*");
254 exit(1);
256 errno = 0;
259 void quit()
261 Chdir("..");
262 System("rm -rf DIR_31");
264 if (errct == 0) {
265 printf("ok\n");
266 exit(0);
267 } else {
268 printf("%d errors\n", errct);
269 exit(1);