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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
|
/* VTreeFS - file.c - file and directory I/O */
#include "inc.h"
#include <dirent.h>
#define GETDENTS_BUFSIZ 4096
static char *buf = NULL;
static size_t bufsize = 0;
/*
* Initialize the main buffer used for I/O. Return OK or an error code.
*/
int
init_buf(size_t size)
{
/* A default buffer size, for at least getdents. */
if (size < GETDENTS_BUFSIZ)
size = GETDENTS_BUFSIZ;
if ((buf = malloc(size)) == NULL)
return ENOMEM;
bufsize = size;
return OK;
}
/*
* Free up the I/O buffer.
*/
void
cleanup_buf(void)
{
free(buf);
buf = NULL;
bufsize = 0;
}
/*
* Read from a file.
*/
ssize_t
fs_read(ino_t ino_nr, struct fsdriver_data * data, size_t bytes,
off_t pos, int __unused call)
{
struct inode *node;
size_t off, chunk;
ssize_t r, len;
/* Try to get inode by its inode number. */
if ((node = find_inode(ino_nr)) == NULL)
return EINVAL;
/* Check whether the node is a regular file. */
if (!S_ISREG(node->i_stat.mode))
return EINVAL;
/* For deleted files or with no read hook, feign an empty file. */
if (is_inode_deleted(node) || vtreefs_hooks->read_hook == NULL)
return 0; /* EOF */
assert(buf != NULL);
assert(bufsize > 0);
/*
* Call the read hook to fill the result buffer, repeatedly for as long
* as 1) the request is not yet fully completed, and 2) the read hook
* fills the entire buffer.
*/
for (off = 0; off < bytes; ) {
/* Get the next result chunk by calling the read hook. */
chunk = bytes - off;
if (chunk > bufsize)
chunk = bufsize;
len = vtreefs_hooks->read_hook(node, buf, chunk, pos,
get_inode_cbdata(node));
/* Copy any resulting data to user space. */
if (len > 0)
r = fsdriver_copyout(data, off, buf, len);
else
r = len; /* EOF or error */
/*
* If an error occurred, but we already produced some output,
* return a partial result. Otherwise return the error.
*/
if (r < 0)
return (off > 0) ? (ssize_t)off : r;
off += len;
pos += len;
if ((size_t)len < bufsize)
break;
}
return off;
}
/*
* Write to a file.
*/
ssize_t
fs_write(ino_t ino_nr, struct fsdriver_data * data, size_t bytes, off_t pos,
int __unused call)
{
struct inode *node;
size_t off, chunk;
ssize_t r;
if ((node = find_inode(ino_nr)) == NULL)
return EINVAL;
if (!S_ISREG(node->i_stat.mode))
return EINVAL;
if (is_inode_deleted(node) || vtreefs_hooks->write_hook == NULL)
return EACCES;
if (bytes == 0)
return 0;
assert(buf != NULL);
assert(bufsize > 0);
/*
* Call the write hook to process the incoming data, repeatedly for as
* long as 1) the request is not yet fully completed, and 2) the write
* hook processes at least some of the given data.
*/
for (off = 0; off < bytes; ) {
chunk = bytes - off;
if (chunk > bufsize)
chunk = bufsize;
/* Copy the data from user space. */
r = fsdriver_copyin(data, off, buf, chunk);
/* Call the write hook for the chunk. */
if (r == OK)
r = vtreefs_hooks->write_hook(node, buf, chunk, pos,
get_inode_cbdata(node));
/*
* If an error occurred, but we already processed some input,
* return a partial result. Otherwise return the error.
*/
if (r < 0)
return (off > 0) ? (ssize_t)off : r;
off += r;
pos += r;
if ((size_t)r == 0)
break;
}
return off;
}
/*
* Truncate a file.
*/
int
fs_trunc(ino_t ino_nr, off_t start_pos, off_t end_pos)
{
struct inode *node;
if ((node = find_inode(ino_nr)) == NULL)
return EINVAL;
if (!S_ISREG(node->i_stat.mode))
return EINVAL;
if (is_inode_deleted(node) || vtreefs_hooks->trunc_hook == NULL)
return EACCES;
/* TODO: translate this case into all-zeroes write callbacks. */
if (end_pos != 0)
return EINVAL;
return vtreefs_hooks->trunc_hook(node, start_pos,
get_inode_cbdata(node));
}
/*
* Retrieve directory entries.
*/
ssize_t
fs_getdents(ino_t ino_nr, struct fsdriver_data * data, size_t bytes,
off_t * posp)
{
struct fsdriver_dentry fsdentry;
struct inode *node, *child;
const char *name;
off_t pos;
int r, skip, get_next, indexed;
if (*posp >= ULONG_MAX)
return EIO;
if ((node = find_inode(ino_nr)) == NULL)
return EINVAL;
indexed = node->i_indexed;
get_next = FALSE;
child = NULL;
/* Call the getdents hook, if any, to "refresh" the directory. */
if (!is_inode_deleted(node) && vtreefs_hooks->getdents_hook != NULL) {
r = vtreefs_hooks->getdents_hook(node, get_inode_cbdata(node));
if (r != OK)
return r;
}
assert(buf != NULL);
assert(bufsize > 0);
fsdriver_dentry_init(&fsdentry, data, bytes, buf, bufsize);
for (;;) {
/* Determine which inode and name to use for this entry. */
pos = (*posp)++;
if (pos == 0) {
/* The "." entry. */
child = node;
name = ".";
} else if (pos == 1) {
/* The ".." entry. */
child = get_parent_inode(node);
if (child == NULL)
child = node;
name = "..";
} else if (pos - 2 < indexed) {
/* All indexed entries. */
child = get_inode_by_index(node, pos - 2);
/*
* If there is no inode with this particular index,
* continue with the next index number.
*/
if (child == NULL) continue;
name = child->i_name;
} else {
/* All non-indexed entries. */
/*
* If this is the first loop iteration, first get to
* the non-indexed child identified by the current
* position.
*/
if (get_next == FALSE) {
skip = pos - indexed - 2;
child = get_first_inode(node);
/* Skip indexed children. */
while (child != NULL &&
child->i_index != NO_INDEX)
child = get_next_inode(child);
/* Skip to the right position. */
while (child != NULL && skip-- > 0)
child = get_next_inode(child);
get_next = TRUE;
} else
child = get_next_inode(child);
/* No more children? Then stop. */
if (child == NULL)
break;
assert(!is_inode_deleted(child));
name = child->i_name;
}
/* Add the directory entry to the output. */
r = fsdriver_dentry_add(&fsdentry,
(ino_t)get_inode_number(child), name, strlen(name),
IFTODT(child->i_stat.mode));
if (r < 0)
return r;
if (r == 0)
break;
}
return fsdriver_dentry_finish(&fsdentry);
}
|