3 * @author Lunaixsky (zelong56@gmail.com)
4 * @brief Lunaix virtual file system - an abstraction layer for all file system.
8 * @copyright Copyright (c) 2022
12 #include <klibc/string.h>
13 #include <lunaix/dirent.h>
14 #include <lunaix/foptions.h>
15 #include <lunaix/fs.h>
16 #include <lunaix/mm/cake.h>
17 #include <lunaix/mm/page.h>
18 #include <lunaix/mm/valloc.h>
19 #include <lunaix/process.h>
20 #include <lunaix/spike.h>
21 #include <lunaix/syscall.h>
23 #define PATH_DELIM '/'
24 #define DNODE_HASHTABLE_BITS 10
25 #define DNODE_HASHTABLE_SIZE (1 << DNODE_HASHTABLE_BITS)
26 #define DNODE_HASH_MASK (DNODE_HASHTABLE_SIZE - 1)
27 #define DNODE_HASHBITS (32 - DNODE_HASHTABLE_BITS)
29 static struct cake_pile* dnode_pile;
30 static struct cake_pile* inode_pile;
31 static struct cake_pile* file_pile;
32 static struct cake_pile* superblock_pile;
33 static struct cake_pile* fd_pile;
35 static struct v_superblock* root_sb;
36 static struct hbucket* dnode_cache;
40 struct hstr vfs_ddot = HSTR("..", 2);
41 struct hstr vfs_dot = HSTR(".", 1);
42 struct hstr vfs_empty = HSTR("", 0);
48 vfs_d_free(struct v_dnode* dnode);
54 vfs_sb_free(struct v_superblock* sb);
59 // 为他们专门创建一个蛋糕堆,而不使用valloc,这样我们可以最小化内碎片的产生
60 dnode_pile = cake_new_pile("dnode_cache", sizeof(struct v_dnode), 1, 0);
61 inode_pile = cake_new_pile("inode_cache", sizeof(struct v_inode), 1, 0);
62 file_pile = cake_new_pile("file_cache", sizeof(struct v_file), 1, 0);
63 fd_pile = cake_new_pile("fd_cache", sizeof(struct v_fd), 1, 0);
65 cake_new_pile("sb_cache", sizeof(struct v_superblock), 1, 0);
67 dnode_cache = vzalloc(DNODE_HASHTABLE_SIZE * sizeof(struct hbucket));
69 hstr_rehash(&vfs_ddot, HSTR_FULL_HASH);
70 hstr_rehash(&vfs_dot, HSTR_FULL_HASH);
72 // 创建一个根superblock,用来蕴含我们的根目录。
73 root_sb = vfs_sb_alloc();
74 root_sb->root = vfs_d_alloc();
77 inline struct hbucket*
78 __dcache_get_bucket(struct v_dnode* parent, unsigned int hash)
80 // 与parent的指针值做加法,来减小碰撞的可能性。
81 hash += (uint32_t)parent;
83 hash = hash ^ (hash >> DNODE_HASHBITS);
84 return &dnode_cache[hash & DNODE_HASH_MASK];
88 vfs_dcache_lookup(struct v_dnode* parent, struct hstr* str)
90 if (!str->len || HSTR_EQ(str, &vfs_dot))
93 if (HSTR_EQ(str, &vfs_ddot)) {
94 return parent->parent ? parent->parent : parent;
97 struct hbucket* slot = __dcache_get_bucket(parent, str->hash);
99 struct v_dnode *pos, *n;
100 hashtable_bucket_foreach(slot, pos, n, hash_list)
102 if (pos->name.hash == str->hash) {
110 vfs_dcache_add(struct v_dnode* parent, struct v_dnode* dnode)
112 struct hbucket* bucket = __dcache_get_bucket(parent, dnode->name.hash);
113 hlist_add(&bucket->head, &dnode->hash_list);
117 vfs_walk(struct v_dnode* start,
119 struct v_dnode** dentry,
120 struct hstr* component,
126 if (path[0] == PATH_DELIM || !start) {
127 if ((walk_options & VFS_WALK_FSRELATIVE) && start) {
128 start = start->super_block->root;
130 start = root_sb->root;
135 struct v_dnode* dnode;
136 struct v_dnode* current_level = start;
138 char name_content[VFS_NAME_MAXLEN];
139 struct hstr name = HSTR(name_content, 0);
141 char current = path[i++], lookahead;
143 lookahead = path[i++];
144 if (current != PATH_DELIM) {
145 if (j >= VFS_NAME_MAXLEN - 1) {
148 if (!VFS_VALID_CHAR(current)) {
151 name_content[j++] = current;
157 // handling cases like /^.*(\/+).*$/
158 if (lookahead == PATH_DELIM) {
164 hstr_rehash(&name, HSTR_FULL_HASH);
166 if (!lookahead && (walk_options & VFS_WALK_PARENT)) {
168 component->hash = name.hash;
170 strcpy(component->value, name_content);
175 dnode = vfs_dcache_lookup(current_level, &name);
178 dnode = vfs_d_alloc();
179 dnode->name = HSTR(valloc(VFS_NAME_MAXLEN), j);
180 dnode->name.hash = name.hash;
182 strcpy(dnode->name.value, name_content);
185 current_level->inode->ops.dir_lookup(current_level->inode, dnode);
187 if (errno == ENOENT && (walk_options & VFS_WALK_MKPARENT)) {
188 if (!current_level->inode->ops.mkdir) {
191 errno = current_level->inode->ops.mkdir(
192 current_level->inode, dnode);
200 vfs_dcache_add(current_level, dnode);
202 dnode->parent = current_level;
203 llist_append(¤t_level->children, &dnode->siblings);
207 current_level = dnode;
212 *dentry = current_level;
216 vfree(dnode->name.value);
223 vfs_mount(const char* target, const char* fs_name, bdev_t device)
228 if (!(errno = vfs_walk(NULL, target, &mnt, NULL, 0))) {
229 errno = vfs_mount_at(fs_name, device, mnt);
236 vfs_unmount(const char* target)
241 if (!(errno = vfs_walk(NULL, target, &mnt, NULL, 0))) {
242 errno = vfs_unmount_at(mnt);
249 vfs_mount_at(const char* fs_name, bdev_t device, struct v_dnode* mnt_point)
251 struct filesystem* fs = fsm_get(fs_name);
254 struct v_superblock* sb = vfs_sb_alloc();
259 if (!(errno = fs->mount(sb, mnt_point))) {
261 sb->root = mnt_point;
262 mnt_point->super_block = sb;
263 llist_append(&root_sb->sb_list, &sb->sb_list);
270 vfs_unmount_at(struct v_dnode* mnt_point)
273 struct v_superblock* sb = mnt_point->super_block;
277 if (!(errno = sb->fs->unmount(sb))) {
278 struct v_dnode* fs_root = sb->root;
279 llist_delete(&fs_root->siblings);
280 llist_delete(&sb->sb_list);
287 vfs_open(struct v_dnode* dnode, struct v_file** file)
289 if (!dnode->inode || !dnode->inode->ops.open) {
293 struct v_file* vfile = cake_grab(file_pile);
294 memset(vfile, 0, sizeof(*vfile));
296 vfile->dnode = dnode;
297 vfile->inode = dnode->inode;
299 int errno = dnode->inode->ops.open(dnode->inode, vfile);
301 cake_release(file_pile, vfile);
309 vfs_close(struct v_file* file)
311 if (!file->ops.close) {
315 int errno = file->ops.close(file);
317 cake_release(file_pile, file);
323 vfs_fsync(struct v_file* file)
326 if (file->ops.sync) {
327 errno = file->ops.sync(file);
329 if (!errno && file->inode->ops.sync) {
330 return file->inode->ops.sync(file->inode);
336 vfs_alloc_fdslot(int* fd)
338 for (size_t i = 0; i < VFS_MAX_FD; i++) {
339 if (!__current->fdtable->fds[i]) {
350 struct v_superblock* sb = cake_grab(superblock_pile);
351 memset(sb, 0, sizeof(*sb));
352 llist_init_head(&sb->sb_list);
357 vfs_sb_free(struct v_superblock* sb)
359 cake_release(superblock_pile, sb);
365 struct v_dnode* dnode = cake_grab(dnode_pile);
366 memset(dnode, 0, sizeof(*dnode));
367 llist_init_head(&dnode->children);
368 dnode->name = vfs_empty;
373 vfs_d_free(struct v_dnode* dnode)
375 if (dnode->ops.destruct) {
376 dnode->ops.destruct(dnode);
378 cake_release(dnode_pile, dnode);
384 struct v_inode* inode = cake_grab(inode_pile);
385 memset(inode, 0, sizeof(*inode));
391 vfs_i_free(struct v_inode* inode)
393 cake_release(inode_pile, inode);
397 __vfs_do_open(struct v_file** file_out, const char* path, int options)
399 char name_str[VFS_NAME_MAXLEN];
400 struct hstr name = HSTR(name_str, 0);
401 struct v_dnode *dentry, *file;
403 if ((errno = vfs_walk(NULL, path, &dentry, &name, VFS_WALK_PARENT))) {
407 vfs_walk(dentry, name.value, &file, NULL, 0);
409 struct v_file* opened_file = 0;
411 if ((options & FO_CREATE)) {
412 errno = dentry->inode->ops.create(dentry->inode, opened_file);
417 errno = vfs_open(file, &opened_file);
420 *file_out = opened_file;
424 __DEFINE_LXSYSCALL2(int, open, const char*, path, int, options)
426 struct v_file* opened_file;
427 int errno = __vfs_do_open(&opened_file, path, options), fd;
429 if (!errno && !(errno = vfs_alloc_fdslot(&fd))) {
430 struct v_fd* fd_s = vzalloc(sizeof(*fd_s));
431 fd_s->file = opened_file;
432 fd_s->pos = opened_file->inode->fsize & -((options & FO_APPEND) != 0);
433 __current->fdtable->fds[fd] = fd_s;
437 __current->k_status = errno;
438 return SYSCALL_ESTATUS(errno);
441 #define GET_FD(fd, fd_s) \
442 (fd >= 0 && fd < VFS_MAX_FD && (fd_s = __current->fdtable->fds[fd]))
444 __DEFINE_LXSYSCALL1(int, close, int, fd)
448 if (!GET_FD(fd, fd_s)) {
450 } else if (!(errno = vfs_close(fd_s->file))) {
452 __current->fdtable->fds[fd] = 0;
455 __current->k_status = errno;
457 return SYSCALL_ESTATUS(errno);
461 __vfs_readdir_callback(struct dir_context* dctx,
466 struct dirent* dent = (struct dirent*)dctx->cb_data;
467 strncpy(dent->d_name, name, DIRENT_NAME_MAX_LEN);
469 dent->d_type = dtype;
472 __DEFINE_LXSYSCALL2(int, readdir, int, fd, struct dirent*, dent)
476 if (!GET_FD(fd, fd_s)) {
478 } else if (!(fd_s->file->inode->itype & VFS_INODE_TYPE_DIR)) {
481 struct dir_context dctx =
482 (struct dir_context){ .cb_data = dent,
483 .index = dent->d_offset,
484 .read_complete_callback =
485 __vfs_readdir_callback };
486 if (dent->d_offset == 0) {
487 __vfs_readdir_callback(&dctx, vfs_dot.value, vfs_dot.len, 0);
488 } else if (dent->d_offset == 1) {
489 __vfs_readdir_callback(&dctx, vfs_ddot.value, vfs_ddot.len, 0);
492 if ((errno = fd_s->file->ops.readdir(fd_s->file, &dctx))) {
501 __current->k_status = errno;
502 return SYSCALL_ESTATUS(errno);
505 __DEFINE_LXSYSCALL1(int, mkdir, const char*, path)
507 struct v_dnode *parent, *dir;
508 struct hstr component = HSTR(valloc(VFS_NAME_MAXLEN), 0);
509 int errno = vfs_walk(NULL, path, &parent, &component, VFS_WALK_PARENT);
514 if ((parent->super_block->fs->types & FSTYPE_ROFS)) {
516 } else if (!parent->inode->ops.mkdir) {
518 } else if (!(parent->inode->itype & VFS_INODE_TYPE_DIR)) {
522 dir->name = component;
523 if (!(errno = parent->inode->ops.mkdir(parent->inode, dir))) {
524 llist_append(&parent->children, &dir->siblings);
527 vfree(component.value);
532 __current->k_status = errno;
533 return SYSCALL_ESTATUS(errno);
536 __DEFINE_LXSYSCALL3(int, read, int, fd, void*, buf, size_t, count)
540 if (!GET_FD(fd, fd_s)) {
543 struct v_file* file = fd_s->file;
544 file->f_pos = fd_s->pos;
545 if ((errno = file->ops.read(file, buf, count)) >= 0) {
550 __current->k_status = errno;
551 return SYSCALL_ESTATUS(errno);
554 __DEFINE_LXSYSCALL3(int, write, int, fd, void*, buf, size_t, count)
558 if (!GET_FD(fd, fd_s)) {
561 struct v_file* file = fd_s->file;
562 file->f_pos = fd_s->pos;
563 if ((errno = file->ops.write(file, buf, count)) >= 0) {
568 __current->k_status = errno;
569 return SYSCALL_ESTATUS(errno);
572 __DEFINE_LXSYSCALL3(int, lseek, int, fd, int, offset, int, options)
576 if (!GET_FD(fd, fd_s)) {
579 size_t fpos = fd_s->file->f_pos;
582 fpos = (size_t)((int)fd_s->file->f_pos + offset);
585 fpos = (size_t)((int)fd_s->file->inode->fsize + offset);
597 __current->k_status = errno;
598 return SYSCALL_ESTATUS(errno);
602 vfs_readlink(struct v_dnode* dnode, char* buf, size_t size, int depth)
612 size_t len = vfs_readlink(dnode->parent, buf, size, depth + 1);
618 size_t cpy_size = MIN(dnode->name.len, size - len);
619 strncpy(buf + len, dnode->name.value, cpy_size);
623 buf[len++] = PATH_DELIM;
629 __DEFINE_LXSYSCALL3(int, readlink, const char*, path, char*, buf, size_t, size)
632 struct v_dnode* dnode;
633 if (!(errno = vfs_walk(NULL, path, &dnode, NULL, 0))) {
634 errno = vfs_readlink(dnode, buf, size, 0);
641 __current->k_status = errno;
642 return SYSCALL_ESTATUS(errno);
645 __DEFINE_LXSYSCALL4(int,
658 if (!GET_FD(dirfd, fd_s)) {
661 struct v_dnode* dnode;
662 if (!(errno = vfs_walk(fd_s->file->dnode, pathname, &dnode, NULL, 0))) {
663 errno = vfs_readlink(fd_s->file->dnode, buf, size, 0);
671 __current->k_status = errno;
672 return SYSCALL_ESTATUS(errno);