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
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
|
#include <debug.h>
#include <vfs.h>
#include <string.h>
// ============================= //
// FILESYSTEM DRIVER REGISTERING //
// ============================= //
typedef struct fs_driver {
const char* name;
fs_driver_ops_t *ops;
struct fs_driver *next;
} fs_driver_t;
fs_driver_t *drivers = 0;
void register_fs_driver(const char* name, fs_driver_ops_t *ops) {
fs_driver_t *d = (fs_driver_t*)malloc(sizeof(fs_driver_t));
ASSERT(d != 0); // should we fail in a more graceful manner ? TODO
d->name = name;
d->ops = ops;
d->next = drivers;
drivers = d;
}
// ================================== //
// CREATING AND DELETING FILE SYSTEMS //
// ================================== //
fs_t *make_fs(const char* drv_name, fs_handle_t *source, char* opts) {
// Look for driver
fs_driver_t *d = 0;
for(fs_driver_t *i = drivers; i != 0; i = i->next) {
if (drv_name != 0 && strcmp(i->name, drv_name) == 0) d = i;
if (drv_name == 0 && source != 0 && i->ops->detect && i->ops->detect(source)) d = i;
if (d != 0) break;
}
if (d == 0) return 0; // driver not found
// Open file system
fs_t *fs = (fs_t*)malloc(sizeof(fs_t));
if (fs == 0) return 0;
fs->refs = 1;
fs->root.refs = 1; // root node is never disposed of (done by fs->shutdown)
fs->root.fs = fs;
fs->root.parent = 0;
if (d->ops->make(source, opts, fs)) {
return fs;
} else {
free(fs);
return 0;
}
}
bool fs_add_source(fs_t *fs, fs_handle_t *source) {
return fs->ops->add_source && fs->ops->add_source(fs->data, source);
}
void ref_fs(fs_t *fs) {
fs->refs++;
}
void unref_fs(fs_t *fs) {
fs->refs--;
if (fs->refs == 0) {
// don't unref root node, don't call dispose on it
// (done by fs->shutdown)
fs->ops->shutdown(fs->data);
free(fs);
}
}
// ====================================================== //
// WALKING IN THE FILE SYSTEM CREATING AND DELETING NODES //
void ref_fs_node(fs_node_t *n) {
n->refs++;
}
void unref_fs_node(fs_node_t *n) {
n->refs--;
if (n->refs == 0) {
ASSERT(n != &n->fs->root);
ASSERT(n->parent != 0);
if (n->ops->dispose) n->ops->dispose(n->data);
unref_fs_node(n->parent);
unref_fs(n->fs);
free(n);
}
}
fs_node_t* fs_walk_one(fs_node_t* from, const char* file) {
fs_node_t *n = (fs_node_t*)malloc(sizeof(fs_node_t));
if (n == 0) return 0;
n->fs = from->fs;
n->refs = 1;
n->parent = from;
if (from->ops->walk && from->ops->walk(from->data, file, n)) {
ref_fs_node(n->parent);
ref_fs(n->fs);
return n;
} else {
free(n);
return 0;
}
}
fs_node_t* fs_walk_path(fs_node_t* from, const char* path) {
if (*path == '/') path++;
fs_node_t *n = from;
ref_fs_node(n);
while (n && (*path)) {
if (*path == '/') {
// we don't want multiple slashes, so fail
unref_fs_node(n);
return 0;
}
const char* d = strchr(path, '/');
if (d == 0) {
fs_node_t *n2 = fs_walk_one(n, path);
unref_fs_node(n);
return n2;
} else {
size_t nlen = d - path;
if (nlen >= DIR_MAX - 1) {
unref_fs_node(n);
return 0; // sorry, path item too long
}
char name_buf[DIR_MAX];
strncpy(name_buf, path, nlen);
name_buf[nlen] = 0;
fs_node_t *n2 = fs_walk_one(n, name_buf);
unref_fs_node(n);
n = n2;
path = d + 1;
}
}
return n;
}
fs_node_t* fs_walk_path_except_last(fs_node_t* from, const char* path, char* last_file_buf) {
// This function does NOT walk into the last component of the path (it may not even exist),
// instead it isolates it in the buffer last_file
// This buffer is expected to be of size DIR_MAX (defined in fs.h)
if (*path == '/') path++;
if (*path == 0) return 0; // no last component !
fs_node_t *n = from;
ref_fs_node(n);
while (n && (*path)) {
if (*path == '/') {
// we don't want multiple slashes, so fail
unref_fs_node(n);
return 0;
}
const char* d = strchr(path, '/');
if (d == 0) {
if (strlen(path) >= DIR_MAX - 1) {
unref_fs_node(n);
return 0; // sorry, path item too long
}
strcpy(last_file_buf, path);
return n;
} else {
size_t nlen = d - path;
if (nlen >= DIR_MAX - 1) {
unref_fs_node(n);
return 0; // sorry, path item too long
}
strncpy(last_file_buf, path, nlen);
last_file_buf[nlen] = 0;
if (*(d+1) == 0) {
// trailing slash !
return n;
} else {
fs_node_t *n2 = fs_walk_one(n, last_file_buf);
unref_fs_node(n);
n = n2;
path = d + 1;
}
}
}
return n;
}
// ========================== //
// DOING THINGS IN FLESYSTEMS //
bool fs_create(fs_t *fs, const char* file, int type) {
char name[DIR_MAX];
fs_node_t *n = fs_walk_path_except_last(&fs->root, file, name);
if (n == 0) return false;
bool ret = n->ops->create && n->ops->create(n->data, name, type);
unref_fs_node(n);
return ret;
}
bool fs_delete(fs_t *fs, const char* file) {
fs_node_t* n = fs_walk_path(&fs->root, file);
if (n == 0) return false;
bool ret = n->ops->delete && n->ops->delete(n->data);
unref_fs_node(n);
return ret;
}
bool fs_move(fs_t *fs, const char* from, const char* to) {
fs_node_t *n = fs_walk_path(&fs->root, from);
if (n == 0) return false;
char new_name[DIR_MAX];
fs_node_t *new_parent = fs_walk_path_except_last(&fs->root, to, new_name);
if (new_parent == 0) return false;
return n->ops->move && n->ops->move(n->data, new_parent, new_name);
}
bool fs_stat(fs_t *fs, const char* file, stat_t *st) {
fs_node_t* n = fs_walk_path(&fs->root, file);
if (n == 0) return false;
bool ret = n->ops->stat && n->ops->stat(n->data, st);
unref_fs_node(n);
return ret;
}
int fs_ioctl(fs_t *fs, const char* file, int command, void* data) {
fs_node_t* n = fs_walk_path(&fs->root, file);
if (n == 0) return false;
int ret = (n->ops->ioctl ? n->ops->ioctl(n->data, command, data) : -1);
unref_fs_node(n);
return ret;
}
// =================== //
// OPERATIONS ON FILES //
// =================== //
fs_handle_t* fs_open(fs_t *fs, const char* file, int mode) {
fs_node_t *n = fs_walk_path(&fs->root, file);
if (n == 0) return false;
fs_handle_t *h = (fs_handle_t*)malloc(sizeof(fs_handle_t));
if (h == 0) {
unref_fs_node(n);
return 0;
}
h->refs = 1;
h->fs = fs;
h->n = n;
if (n->ops->open(n->data, mode, h)) {
// our reference to node n is transferred to the file handle
ref_fs(fs);
return h;
} else {
unref_fs_node(n);
free(h);
return 0;
}
}
void ref_file(fs_handle_t *file) {
file->refs++;
}
void unref_file(fs_handle_t *file) {
file->refs--;
if (file->refs == 0) {
file->ops->close(file->data);
unref_fs_node(file->n);
unref_fs(file->fs);
free(file);
}
}
int file_get_mode(fs_handle_t *f) {
return f->mode;
}
size_t file_read(fs_handle_t *f, size_t offset, size_t len, char* buf) {
if (!(f->mode && FM_READ)) return 0;
if (f->ops->read == 0) return 0;
return f->ops->read(f->data, offset, len, buf);
}
size_t file_write(fs_handle_t *f, size_t offset, size_t len, const char* buf) {
if (!(f->mode && FM_WRITE)) return 0;
if (f->ops->write == 0) return 0;
return f->ops->write(f->data, offset, len, buf);
}
bool file_stat(fs_handle_t *f, stat_t *st) {
return f->ops->stat && f->ops->stat(f->data, st);
}
bool file_readdir(fs_handle_t *f, dirent_t *d) {
return f->ops->readdir && f->ops->readdir(f->data, d);
}
/* vim: set ts=4 sw=4 tw=0 noet :*/
|