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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
|
#include <camellia/fsutil.h>
#include <camellia/syscalls.h>
#include <shared/mem.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdlib.h>
#include <unistd.h>
#include <user/lib/fs/dir.h>
struct node {
const char *name;
bool directory;
size_t namelen;
struct node *sibling, *child;
char *buf;
size_t size, capacity;
};
struct node *root = NULL;
static struct node special_root = {
.directory = true,
.size = 0,
};
static struct node *lookup(struct node *parent, const char *path, size_t len) {
for (struct node *iter = parent->child; iter; iter = iter->sibling) {
if (iter->namelen == len && !memcmp(path, iter->name, len))
return iter;
}
return NULL;
}
static struct node *tmpfs_open(const char *path, struct fs_wait_response *res) {
struct node *node = &special_root;
if (res->len == 0) return NULL;
if (res->len == 1) return node;
path++;
res->len--;
bool more = true;
size_t segpos = 0, seglen; /* segments end with a slash, inclusive */
while (more) {
struct node *const parent = node;
char *slash = memchr(path + segpos, '/', res->len);
seglen = (slash ? (size_t)(slash - path + 1) : res->len) - segpos;
more = segpos + seglen < res->len;
node = lookup(parent, path + segpos, seglen);
if (!node) {
if (!more && (res->flags & OPEN_CREATE)) {
node = malloc(sizeof *node);
memset(node, 0, sizeof *node);
char *namebuf = malloc(seglen + 1);
memcpy(namebuf, path + segpos, seglen);
namebuf[seglen] = '\0';
node->name = namebuf;
node->directory = slash;
node->namelen = seglen;
node->sibling = parent->child;
parent->child = node;
} else {
return NULL;
}
}
segpos += seglen;
}
return node;
}
int main(void) {
const size_t buflen = 4096;
char *buf = malloc(buflen);
struct fs_wait_response res;
struct node *ptr;
while (!_syscall_fs_wait(buf, buflen, &res)) {
switch (res.op) {
case VFSOP_OPEN:
ptr = tmpfs_open(buf, &res);
_syscall_fs_respond(ptr, ptr ? 0 : -1, 0);
break;
case VFSOP_READ:
ptr = (void*)res.id;
if (ptr->directory) {
struct dirbuild db;
dir_start(&db, res.offset, buf, buflen);
for (struct node *iter = ptr->child; iter; iter = iter->sibling)
dir_append(&db, iter->name);
_syscall_fs_respond(buf, dir_finish(&db), 0);
} else {
fs_normslice(&res.offset, &res.len, ptr->size, false);
_syscall_fs_respond(ptr->buf + res.offset, res.len, 0);
}
break;
case VFSOP_WRITE:
ptr = (void*)res.id;
if (ptr == &special_root) {
_syscall_fs_respond(NULL, -1, 0);
break;
}
if (res.len > 0 && !ptr->buf) {
ptr->buf = malloc(256);
if (!ptr->buf) {
_syscall_fs_respond(NULL, -1, 0);
break;
}
memset(ptr->buf, 0, 256);
ptr->capacity = 256;
}
fs_normslice(&res.offset, &res.len, ptr->size, true);
if (ptr->capacity <= res.offset + res.len) {
size_t newcap = 1;
while (newcap && newcap <= res.offset + res.len)
newcap *= 2;
if (!newcap) { /* overflow */
_syscall_fs_respond(NULL, -1, 0);
break;
}
ptr->capacity = newcap;
ptr->buf = realloc(ptr->buf, ptr->capacity);
}
memcpy(ptr->buf + res.offset, buf, res.len);
if ((res.flags & WRITE_TRUNCATE) || ptr->size < res.offset + res.len) {
ptr->size = res.offset + res.len;
}
_syscall_fs_respond(NULL, res.len, 0);
break;
case VFSOP_GETSIZE:
ptr = (void*)res.id;
if (ptr->directory) {
// TODO could be cached in ptr->size
struct dirbuild db;
dir_start(&db, res.offset, NULL, buflen);
for (struct node *iter = ptr->child; iter; iter = iter->sibling)
dir_append(&db, iter->name);
_syscall_fs_respond(NULL, dir_finish(&db), 0);
} else {
_syscall_fs_respond(NULL, ptr->size, 0);
}
break;
default:
_syscall_fs_respond(NULL, -1, 0);
break;
}
}
return 1;
}
|
