1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
|
#include "../tests.h"
#include <camellia/flags.h>
#include <camellia/syscalls.h>
#include <stdbool.h>
#include <string.h>
static void test_unfinished_req(void) {
handle_t h = -1;
int ret = _syscall_fork(FORK_NEWFS, &h);
test(0 <= ret);
if (ret == 0) {
// TODO make a similar test with all 0s passed to fs_wait
struct ufs_request res;
_syscall_fs_wait(NULL, 0, &res);
// TODO second fs_wait
exit(0);
} else {
test(0 <= h);
test(_syscall_mount(h, "/", 1) == 0);
int ret = _syscall_open("/", 1, 0);
test(ret < 0);
// the handler quits while handling that call - but this syscall should return anyways
}
}
static void test_orphaned_fs(void) {
handle_t h = -1;
int ret = _syscall_fork(FORK_NEWFS, &h);
test(0 <= ret);
if (ret == 0) {
exit(0);
} else {
test(0 <= h);
test(_syscall_mount(h, "/", 1) == 0);
int ret = _syscall_open("/", 1, 0);
test(ret < 0);
}
}
static void test_fs_cleanup(void) {
const char *msg = "success";
int msglen = 8;
char buf[16];
handle_t ends[2];
test(_syscall_pipe(ends, 0) >= 0);
if (!_syscall_fork(0, NULL)) {
handle_t h = -1;
if (_syscall_fork(FORK_NEWFS, &h) == 0) {
for (;;) {
struct ufs_request req;
handle_t reqh = _syscall_fs_wait(buf, sizeof buf, &req);
if (reqh < 0) break;
_syscall_fs_respond(reqh, NULL, 0, 0); /* success */
}
/* this is the test: does it break out of the loop
* when it should cleanup */
_syscall_write(ends[1], msg, msglen, -1, 0);
exit(0);
} else {
test(_syscall_mount(h, "/", 1) == 0);
h = _syscall_open("/", 1, 0);
test(h >= 0);
_syscall_close(h);
// TODO another test without the delay
_syscall_sleep(0);
exit(0);
}
} else {
test(_syscall_read(ends[0], buf, sizeof buf, 0) == msglen);
test(memcmp(buf, msg, msglen) == 0);
}
}
void r_k_fs(void) {
run_test(test_unfinished_req);
run_test(test_orphaned_fs);
run_test(test_fs_cleanup);
run_test(test_fs_cleanup);
}
|
