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 // Welcome to The Mountain O'Shit! :)
15 TODO vfs & device todos checklist
17 It is overseen by Twilight Sparkle ;)
19 1. Get inodes hooked into lru (CHECKED)
20 2. Get dnodes hooked into lru (CHECKED)
21 3. Get inodes properly hashed so they can be reused by underling fs (CHECKED)
22 4. (lru) Add a callback function (or destructor) for eviction. (CHECKED)
23 [good idea] or a constructor/destructor pattern in cake allocator ?
24 5. (mount) Figure out a way to identify a busy mount point before unmount
25 maybe a unified mount_point structure that maintain a referencing
26 counter on any dnodes within the subtree? Such a counter will only
27 increament if a file is opened or a dnode is being used as working
28 directory and decreamenting conversely. (CHECKED)
29 6. (mount) Ability to track all mount points (including sub-mounts)
30 so we can be confident to clean up everything when we
32 7. (mount) Figure out a way to acquire the device represented by a dnode.
33 so it can be used to mount. (e.g. we wish to get `struct device*`
34 out of the dnode at /dev/sda)
35 [tip] we should pay attention at twifs and add a private_data field
36 under struct v_dnode? (CHECKED)
37 8. (mount) Then, we should refactor on mount/unmount mechanism. (CHECKED)
38 9. (mount) (future) Ability to mount any thing? e.g. Linux can mount a disk
39 image file using a so called "loopback" pseudo device. Maybe
40 we can do similar thing in Lunaix? A block device emulation
41 above the regular file when we mount it on.
42 10. (device) device number (dev_t) allocation
43 [good idea] <class>:<subclass>:<uniq_id> composition
46 #include <klibc/string.h>
47 #include <lunaix/foptions.h>
48 #include <lunaix/fs.h>
49 #include <lunaix/mm/cake.h>
50 #include <lunaix/mm/page.h>
51 #include <lunaix/mm/valloc.h>
52 #include <lunaix/process.h>
53 #include <lunaix/spike.h>
54 #include <lunaix/syscall.h>
55 #include <lunaix/syscall_utils.h>
57 #include <lunaix/fs/twifs.h>
59 #include <usr/sys/dirent_defs.h>
61 static struct cake_pile* dnode_pile;
62 static struct cake_pile* inode_pile;
63 static struct cake_pile* file_pile;
64 static struct cake_pile* superblock_pile;
65 static struct cake_pile* fd_pile;
67 struct v_dnode* vfs_sysroot;
68 static struct hbucket* dnode_cache;
70 struct lru_zone *dnode_lru, *inode_lru;
72 struct hstr vfs_ddot = HSTR("..", 2);
73 struct hstr vfs_dot = HSTR(".", 1);
74 struct hstr vfs_empty = HSTR("", 0);
80 vfs_sb_free(struct v_superblock* sb);
83 __vfs_try_evict_dnode(struct lru_node* obj);
86 __vfs_try_evict_inode(struct lru_node* obj);
91 // 为他们专门创建一个蛋糕堆,而不使用valloc,这样我们可以最小化内碎片的产生
92 dnode_pile = cake_new_pile("dnode_cache", sizeof(struct v_dnode), 1, 0);
93 inode_pile = cake_new_pile("inode_cache", sizeof(struct v_inode), 1, 0);
94 file_pile = cake_new_pile("file_cache", sizeof(struct v_file), 1, 0);
95 fd_pile = cake_new_pile("fd_cache", sizeof(struct v_fd), 1, 0);
97 cake_new_pile("sb_cache", sizeof(struct v_superblock), 1, 0);
99 dnode_cache = vzalloc(VFS_HASHTABLE_SIZE * sizeof(struct hbucket));
101 dnode_lru = lru_new_zone(__vfs_try_evict_dnode);
102 inode_lru = lru_new_zone(__vfs_try_evict_inode);
104 hstr_rehash(&vfs_ddot, HSTR_FULL_HASH);
105 hstr_rehash(&vfs_dot, HSTR_FULL_HASH);
108 vfs_sysroot = vfs_d_alloc(NULL, &vfs_empty);
109 vfs_sysroot->parent = vfs_sysroot;
110 atomic_fetch_add(&vfs_sysroot->ref_count, 1);
113 inline struct hbucket*
114 __dcache_hash(struct v_dnode* parent, u32_t* hash)
118 _hash = _hash ^ (_hash >> VFS_HASHBITS);
119 // 与parent的指针值做加法,来减小碰撞的可能性。
120 _hash += (u32_t)parent;
122 return &dnode_cache[_hash & VFS_HASH_MASK];
126 vfs_dcache_lookup(struct v_dnode* parent, struct hstr* str)
128 if (!str->len || HSTR_EQ(str, &vfs_dot))
131 if (HSTR_EQ(str, &vfs_ddot)) {
132 return parent->parent;
135 u32_t hash = str->hash;
136 struct hbucket* slot = __dcache_hash(parent, &hash);
138 struct v_dnode *pos, *n;
139 hashtable_bucket_foreach(slot, pos, n, hash_list)
141 if (pos->name.hash == hash) {
149 vfs_dcache_add(struct v_dnode* parent, struct v_dnode* dnode)
153 atomic_fetch_add(&dnode->ref_count, 1);
154 dnode->parent = parent;
155 llist_append(&parent->children, &dnode->siblings);
157 struct hbucket* bucket = __dcache_hash(parent, &dnode->name.hash);
158 hlist_add(&bucket->head, &dnode->hash_list);
162 vfs_dcache_remove(struct v_dnode* dnode)
165 assert(dnode->ref_count == 1);
167 llist_delete(&dnode->siblings);
168 llist_delete(&dnode->aka_list);
169 hlist_delete(&dnode->hash_list);
171 dnode->parent = NULL;
172 atomic_fetch_sub(&dnode->ref_count, 1);
176 vfs_dcache_rehash(struct v_dnode* new_parent, struct v_dnode* dnode)
180 hstr_rehash(&dnode->name, HSTR_FULL_HASH);
181 vfs_dcache_remove(dnode);
182 vfs_dcache_add(new_parent, dnode);
186 vfs_open(struct v_dnode* dnode, struct v_file** file)
188 if (!dnode->inode || !dnode->inode->ops->open) {
192 struct v_inode* inode = dnode->inode;
196 struct v_file* vfile = cake_grab(file_pile);
197 memset(vfile, 0, sizeof(*vfile));
199 vfile->dnode = dnode;
200 vfile->inode = inode;
201 vfile->ref_count = ATOMIC_VAR_INIT(1);
202 vfile->ops = inode->default_fops;
204 if ((inode->itype & VFS_IFFILE) && !inode->pg_cache) {
205 struct pcache* pcache = vzalloc(sizeof(struct pcache));
207 pcache->master = inode;
208 inode->pg_cache = pcache;
211 int errno = inode->ops->open(inode, vfile);
213 cake_release(file_pile, vfile);
215 atomic_fetch_add(&dnode->ref_count, 1);
217 mnt_mkbusy(dnode->mnt);
228 vfs_assign_inode(struct v_dnode* assign_to, struct v_inode* inode)
230 if (assign_to->inode) {
231 llist_delete(&assign_to->aka_list);
232 assign_to->inode->link_count--;
234 llist_append(&inode->aka_dnodes, &assign_to->aka_list);
235 assign_to->inode = inode;
240 vfs_link(struct v_dnode* to_link, struct v_dnode* name)
244 if ((errno = vfs_check_writable(to_link))) {
248 lock_inode(to_link->inode);
249 if (to_link->super_block->root != name->super_block->root) {
251 } else if (!to_link->inode->ops->link) {
253 } else if (!(errno = to_link->inode->ops->link(to_link->inode, name))) {
254 vfs_assign_inode(name, to_link->inode);
256 unlock_inode(to_link->inode);
262 vfs_pclose(struct v_file* file, pid_t pid)
265 if (file->ref_count > 1) {
266 atomic_fetch_sub(&file->ref_count, 1);
267 } else if (!(errno = file->ops->close(file))) {
268 atomic_fetch_sub(&file->dnode->ref_count, 1);
269 file->inode->open_count--;
273 * This happened when process is terminated while blocking on read.
274 * In that case, the process is still holding the inode lock and it
275 will never get released.
276 * The unlocking should also include ownership check.
278 * To see why, consider two process both open the same file both with
280 * Process A: busy on reading x
281 * Process B: do nothing with x
282 * Assuming that, after a very short time, process B get terminated
283 * while process A is still busy in it's reading business. By this
284 * design, the inode lock of this file x is get released by B rather
285 * than A. And this will cause a probable race condition on A if other
286 * process is writing to this file later after B exit.
288 if (mutex_on_hold(&file->inode->lock)) {
289 mutex_unlock_for(&file->inode->lock, pid);
291 mnt_chillax(file->dnode->mnt);
293 pcache_commit_all(file->inode);
294 cake_release(file_pile, file);
300 vfs_close(struct v_file* file)
302 return vfs_pclose(file, __current->pid);
306 vfs_free_fd(struct v_fd* fd)
308 cake_release(fd_pile, fd);
312 vfs_fsync(struct v_file* file)
315 if ((errno = vfs_check_writable(file->dnode))) {
319 lock_inode(file->inode);
321 pcache_commit_all(file->inode);
324 if (file->ops->sync) {
325 errno = file->ops->sync(file);
328 unlock_inode(file->inode);
334 vfs_alloc_fdslot(int* fd)
336 for (size_t i = 0; i < VFS_MAX_FD; i++) {
337 if (!__current->fdtable->fds[i]) {
348 struct v_superblock* sb = cake_grab(superblock_pile);
349 memset(sb, 0, sizeof(*sb));
350 llist_init_head(&sb->sb_list);
351 sb->i_cache = vzalloc(VFS_HASHTABLE_SIZE * sizeof(struct hbucket));
356 vfs_sb_free(struct v_superblock* sb)
359 cake_release(superblock_pile, sb);
363 __vfs_try_evict_dnode(struct lru_node* obj)
365 struct v_dnode* dnode = container_of(obj, struct v_dnode, lru);
367 if (!dnode->ref_count) {
375 __vfs_try_evict_inode(struct lru_node* obj)
377 struct v_inode* inode = container_of(obj, struct v_inode, lru);
379 if (!inode->link_count && !inode->open_count) {
387 vfs_d_alloc(struct v_dnode* parent, struct hstr* name)
389 struct v_dnode* dnode = cake_grab(dnode_pile);
391 lru_evict_half(dnode_lru);
393 if (!(dnode = cake_grab(dnode_pile))) {
398 memset(dnode, 0, sizeof(*dnode));
399 llist_init_head(&dnode->children);
400 llist_init_head(&dnode->siblings);
401 llist_init_head(&dnode->aka_list);
402 mutex_init(&dnode->lock);
404 dnode->ref_count = ATOMIC_VAR_INIT(0);
405 dnode->name = HHSTR(vzalloc(VFS_NAME_MAXLEN), 0, 0);
407 hstrcpy(&dnode->name, name);
410 dnode->super_block = parent->super_block;
411 dnode->mnt = parent->mnt;
414 lru_use_one(dnode_lru, &dnode->lru);
420 vfs_d_free(struct v_dnode* dnode)
422 assert(dnode->ref_count == 1);
425 assert(dnode->inode->link_count > 0);
426 dnode->inode->link_count--;
429 vfs_dcache_remove(dnode);
430 // Make sure the children de-referencing their parent.
431 // With lru presented, the eviction will be propagated over the entire
432 // detached subtree eventually
433 struct v_dnode *pos, *n;
434 llist_for_each(pos, n, &dnode->children, siblings)
436 vfs_dcache_remove(pos);
439 vfree(dnode->name.value);
440 cake_release(dnode_pile, dnode);
444 vfs_i_find(struct v_superblock* sb, u32_t i_id)
446 struct hbucket* slot = &sb->i_cache[i_id & VFS_HASH_MASK];
447 struct v_inode *pos, *n;
448 hashtable_bucket_foreach(slot, pos, n, hash_list)
450 if (pos->id == i_id) {
451 lru_use_one(inode_lru, &pos->lru);
460 vfs_i_addhash(struct v_inode* inode)
462 struct hbucket* slot = &inode->sb->i_cache[inode->id & VFS_HASH_MASK];
464 hlist_delete(&inode->hash_list);
465 hlist_add(&slot->head, &inode->hash_list);
469 vfs_i_alloc(struct v_superblock* sb)
471 assert(sb->ops.init_inode);
473 struct v_inode* inode;
474 if (!(inode = cake_grab(inode_pile))) {
475 lru_evict_half(inode_lru);
476 if (!(inode = cake_grab(inode_pile))) {
481 memset(inode, 0, sizeof(*inode));
482 mutex_init(&inode->lock);
483 llist_init_head(&inode->xattrs);
484 llist_init_head(&inode->aka_dnodes);
486 sb->ops.init_inode(sb, inode);
489 inode->ctime = clock_unixtime();
490 inode->atime = inode->ctime;
491 inode->mtime = inode->ctime;
494 lru_use_one(inode_lru, &inode->lru);
499 vfs_i_free(struct v_inode* inode)
501 if (inode->pg_cache) {
502 pcache_release(inode->pg_cache);
503 vfree(inode->pg_cache);
505 // we don't need to sync inode.
506 // If an inode can be free, then it must be properly closed.
507 // Hence it must be synced already!
508 if (inode->destruct) {
509 inode->destruct(inode);
511 hlist_delete(&inode->hash_list);
512 cake_release(inode_pile, inode);
515 /* ---- System call definition and support ---- */
517 #define FLOCATE_CREATE_EMPTY 1
520 vfs_getfd(int fd, struct v_fd** fd_s)
522 if (TEST_FD(fd) && (*fd_s = __current->fdtable->fds[fd])) {
529 __vfs_try_locate_file(const char* path,
530 struct v_dnode** fdir,
531 struct v_dnode** file,
534 char name_str[VFS_NAME_MAXLEN];
535 struct hstr name = HSTR(name_str, 0);
539 if ((errno = vfs_walk_proc(path, fdir, &name, VFS_WALK_PARENT))) {
543 errno = vfs_walk(*fdir, name.value, file, NULL, 0);
544 if (errno != ENOENT || !(options & FLOCATE_CREATE_EMPTY)) {
548 struct v_dnode* parent = *fdir;
549 struct v_dnode* file_new = vfs_d_alloc(parent, &name);
557 if (!(errno = parent->inode->ops->create(parent->inode, file_new))) {
558 vfs_dcache_add(parent, file_new);
561 vfs_d_free(file_new);
564 unlock_dnode(parent);
570 vfs_do_open(const char* path, int options)
573 struct v_dnode *dentry, *file;
574 struct v_file* ofile = NULL;
576 errno = __vfs_try_locate_file(
577 path, &dentry, &file, (options & FO_CREATE) ? FLOCATE_CREATE_EMPTY : 0);
579 if (!errno && !(errno = vfs_alloc_fdslot(&fd))) {
581 if (errno || (errno = vfs_open(file, &ofile))) {
585 struct v_fd* fd_s = cake_grab(fd_pile);
586 memset(fd_s, 0, sizeof(*fd_s));
588 ofile->f_pos = ofile->inode->fsize & -((options & FO_APPEND) != 0);
590 fd_s->flags = options;
591 __current->fdtable->fds[fd] = fd_s;
598 __DEFINE_LXSYSCALL2(int, open, const char*, path, int, options)
600 int errno = vfs_do_open(path, options);
601 return DO_STATUS_OR_RETURN(errno);
604 __DEFINE_LXSYSCALL1(int, close, int, fd)
608 if ((errno = vfs_getfd(fd, &fd_s))) {
612 if ((errno = vfs_close(fd_s->file))) {
616 cake_release(fd_pile, fd_s);
617 __current->fdtable->fds[fd] = 0;
620 return DO_STATUS(errno);
624 __vfs_readdir_callback(struct dir_context* dctx,
629 struct lx_dirent* dent = (struct lx_dirent*)dctx->cb_data;
630 strncpy(dent->d_name, name, DIRENT_NAME_MAX_LEN);
632 dent->d_type = dtype;
635 __DEFINE_LXSYSCALL2(int, sys_readdir, int, fd, struct lx_dirent*, dent)
640 if ((errno = vfs_getfd(fd, &fd_s))) {
644 struct v_inode* inode = fd_s->file->inode;
648 if (!(inode->itype & VFS_IFDIR)) {
651 struct dir_context dctx =
652 (struct dir_context){ .cb_data = dent,
653 .index = dent->d_offset,
654 .read_complete_callback =
655 __vfs_readdir_callback };
657 if (dent->d_offset == 0) {
658 __vfs_readdir_callback(&dctx, vfs_dot.value, vfs_dot.len, DT_DIR);
659 } else if (dent->d_offset == 1) {
660 __vfs_readdir_callback(&dctx, vfs_ddot.value, vfs_ddot.len, DT_DIR);
663 if ((errno = fd_s->file->ops->readdir(fd_s->file, &dctx)) != 1) {
674 return DO_STATUS_OR_RETURN(errno);
677 __DEFINE_LXSYSCALL3(int, read, int, fd, void*, buf, size_t, count)
681 if ((errno = vfs_getfd(fd, &fd_s))) {
685 struct v_file* file = fd_s->file;
686 if ((file->inode->itype & VFS_IFDIR)) {
691 lock_inode(file->inode);
693 file->inode->atime = clock_unixtime();
695 if ((file->inode->itype & VFS_IFSEQDEV) || (fd_s->flags & FO_DIRECT)) {
696 errno = file->ops->read(file->inode, buf, count, file->f_pos);
698 errno = pcache_read(file->inode, buf, count, file->f_pos);
702 file->f_pos += errno;
703 unlock_inode(file->inode);
707 unlock_inode(file->inode);
710 return DO_STATUS(errno);
713 __DEFINE_LXSYSCALL3(int, write, int, fd, void*, buf, size_t, count)
717 if ((errno = vfs_getfd(fd, &fd_s))) {
721 struct v_file* file = fd_s->file;
723 if ((errno = vfs_check_writable(file->dnode))) {
727 if ((file->inode->itype & VFS_IFDIR)) {
732 lock_inode(file->inode);
734 file->inode->mtime = clock_unixtime();
736 if ((file->inode->itype & VFS_IFSEQDEV) || (fd_s->flags & FO_DIRECT)) {
737 errno = file->ops->write(file->inode, buf, count, file->f_pos);
739 errno = pcache_write(file->inode, buf, count, file->f_pos);
743 file->f_pos += errno;
744 unlock_inode(file->inode);
748 unlock_inode(file->inode);
751 return DO_STATUS(errno);
754 __DEFINE_LXSYSCALL3(int, lseek, int, fd, int, offset, int, options)
758 if ((errno = vfs_getfd(fd, &fd_s))) {
762 struct v_file* file = fd_s->file;
764 if (!file->ops->seek) {
769 lock_inode(file->inode);
772 int fpos = file->f_pos;
775 overflow = __builtin_sadd_overflow((int)file->f_pos, offset, &fpos);
779 __builtin_sadd_overflow((int)file->inode->fsize, offset, &fpos);
787 } else if (!(errno = file->ops->seek(file->inode, fpos))) {
791 unlock_inode(file->inode);
794 return DO_STATUS(errno);
798 vfs_get_path(struct v_dnode* dnode, char* buf, size_t size, int depth)
810 if (dnode->parent != dnode) {
811 len = vfs_get_path(dnode->parent, buf, size, depth + 1);
818 if (!len || buf[len - 1] != VFS_PATH_DELIM) {
819 buf[len++] = VFS_PATH_DELIM;
822 size_t cpy_size = MIN(dnode->name.len, size - len);
823 strncpy(buf + len, dnode->name.value, cpy_size);
830 vfs_readlink(struct v_dnode* dnode, char* buf, size_t size)
833 struct v_inode* inode = dnode->inode;
834 if (inode->ops->read_symlink) {
837 int errno = inode->ops->read_symlink(inode, &link);
838 strncpy(buf, link, size);
847 vfs_get_dtype(int itype)
859 __DEFINE_LXSYSCALL3(int, realpathat, int, fd, char*, buf, size_t, size)
863 if ((errno = vfs_getfd(fd, &fd_s))) {
867 struct v_dnode* dnode;
868 errno = vfs_get_path(fd_s->file->dnode, buf, size, 0);
875 return DO_STATUS(errno);
878 __DEFINE_LXSYSCALL3(int, readlink, const char*, path, char*, buf, size_t, size)
881 struct v_dnode* dnode;
882 if (!(errno = vfs_walk_proc(path, &dnode, NULL, VFS_WALK_NOFOLLOW))) {
883 errno = vfs_readlink(dnode, buf, size);
890 return DO_STATUS(errno);
893 __DEFINE_LXSYSCALL4(int,
906 if ((errno = vfs_getfd(dirfd, &fd_s))) {
910 struct v_dnode* dnode;
911 if (!(errno = vfs_walk(
912 fd_s->file->dnode, pathname, &dnode, NULL, VFS_WALK_NOFOLLOW))) {
913 errno = vfs_readlink(fd_s->file->dnode, buf, size);
921 return DO_STATUS(errno);
926 When we perform operation that could affect the layout of
927 directory (i.e., rename, mkdir, rmdir). We must lock the parent dir
928 whenever possible. This will blocking any ongoing path walking to reach
929 it hence avoid any partial state.
932 __DEFINE_LXSYSCALL1(int, rmdir, const char*, pathname)
935 struct v_dnode* dnode;
936 if ((errno = vfs_walk_proc(pathname, &dnode, NULL, 0))) {
937 return DO_STATUS(errno);
942 if ((errno = vfs_check_writable(dnode))) {
946 if ((dnode->super_block->fs->types & FSTYPE_ROFS)) {
951 if (dnode->ref_count > 1 || dnode->inode->open_count) {
956 if (!llist_empty(&dnode->children)) {
961 struct v_dnode* parent = dnode->parent;
969 lock_inode(parent->inode);
971 if ((dnode->inode->itype & VFS_IFDIR)) {
972 errno = parent->inode->ops->rmdir(parent->inode, dnode);
974 vfs_dcache_remove(dnode);
980 unlock_inode(parent->inode);
981 unlock_dnode(parent);
985 return DO_STATUS(errno);
988 __DEFINE_LXSYSCALL1(int, mkdir, const char*, path)
991 struct v_dnode *parent, *dir;
992 char name_value[VFS_NAME_MAXLEN];
993 struct hstr name = HHSTR(name_value, 0, 0);
995 if ((errno = vfs_walk_proc(path, &parent, &name, VFS_WALK_PARENT))) {
999 if ((errno = vfs_check_writable(parent))) {
1003 if (!(dir = vfs_d_alloc(parent, &name))) {
1009 lock_inode(parent->inode);
1011 if ((parent->super_block->fs->types & FSTYPE_ROFS)) {
1013 } else if (!parent->inode->ops->mkdir) {
1015 } else if (!(parent->inode->itype & VFS_IFDIR)) {
1017 } else if (!(errno = parent->inode->ops->mkdir(parent->inode, dir))) {
1018 vfs_dcache_add(parent, dir);
1025 unlock_inode(parent->inode);
1026 unlock_dnode(parent);
1028 return DO_STATUS(errno);
1032 __vfs_do_unlink(struct v_dnode* dnode)
1035 struct v_inode* inode = dnode->inode;
1037 if (dnode->ref_count > 1) {
1041 if ((errno = vfs_check_writable(dnode))) {
1047 if (inode->open_count) {
1049 } else if (!(inode->itype & VFS_IFDIR)) {
1050 // The underlying unlink implementation should handle
1052 errno = inode->ops->unlink(inode);
1060 unlock_inode(inode);
1065 __DEFINE_LXSYSCALL1(int, unlink, const char*, pathname)
1068 struct v_dnode* dnode;
1069 if ((errno = vfs_walk_proc(pathname, &dnode, NULL, 0))) {
1073 errno = __vfs_do_unlink(dnode);
1076 return DO_STATUS(errno);
1079 __DEFINE_LXSYSCALL2(int, unlinkat, int, fd, const char*, pathname)
1083 if ((errno = vfs_getfd(fd, &fd_s))) {
1087 struct v_dnode* dnode;
1088 if (!(errno = vfs_walk(fd_s->file->dnode, pathname, &dnode, NULL, 0))) {
1089 errno = __vfs_do_unlink(dnode);
1093 return DO_STATUS(errno);
1096 __DEFINE_LXSYSCALL2(int, link, const char*, oldpath, const char*, newpath)
1099 struct v_dnode *dentry, *to_link, *name_dentry, *name_file;
1101 errno = __vfs_try_locate_file(oldpath, &dentry, &to_link, 0);
1103 errno = __vfs_try_locate_file(
1104 newpath, &name_dentry, &name_file, FLOCATE_CREATE_EMPTY);
1107 } else if (name_file) {
1108 errno = vfs_link(to_link, name_file);
1111 return DO_STATUS(errno);
1114 __DEFINE_LXSYSCALL1(int, fsync, int, fildes)
1119 if (!(errno = vfs_getfd(fildes, &fd_s))) {
1120 errno = vfs_fsync(fd_s->file);
1123 return DO_STATUS(errno);
1127 vfs_dup_fd(struct v_fd* old, struct v_fd** new)
1130 struct v_fd* copied = cake_grab(fd_pile);
1132 memcpy(copied, old, sizeof(struct v_fd));
1134 atomic_fetch_add(&old->file->ref_count, 1);
1142 vfs_dup2(int oldfd, int newfd)
1144 if (newfd == oldfd) {
1149 struct v_fd *oldfd_s, *newfd_s;
1150 if ((errno = vfs_getfd(oldfd, &oldfd_s))) {
1154 if (!TEST_FD(newfd)) {
1159 newfd_s = __current->fdtable->fds[newfd];
1160 if (newfd_s && (errno = vfs_close(newfd_s->file))) {
1164 if (!(errno = vfs_dup_fd(oldfd_s, &newfd_s))) {
1165 __current->fdtable->fds[newfd] = newfd_s;
1170 return DO_STATUS(errno);
1173 __DEFINE_LXSYSCALL2(int, dup2, int, oldfd, int, newfd)
1175 return vfs_dup2(oldfd, newfd);
1178 __DEFINE_LXSYSCALL1(int, dup, int, oldfd)
1181 struct v_fd *oldfd_s, *newfd_s;
1182 if ((errno = vfs_getfd(oldfd, &oldfd_s))) {
1186 if (!(errno = vfs_alloc_fdslot(&newfd)) &&
1187 !(errno = vfs_dup_fd(oldfd_s, &newfd_s))) {
1188 __current->fdtable->fds[newfd] = newfd_s;
1193 return DO_STATUS(errno);
1196 __DEFINE_LXSYSCALL2(int,
1204 struct v_dnode* dnode;
1205 if ((errno = vfs_walk_proc(pathname, &dnode, NULL, 0))) {
1209 if (errno = vfs_check_writable(dnode)) {
1213 if (!dnode->inode->ops->set_symlink) {
1218 lock_inode(dnode->inode);
1220 errno = dnode->inode->ops->set_symlink(dnode->inode, link_target);
1222 unlock_inode(dnode->inode);
1225 return DO_STATUS(errno);
1229 vfs_ref_file(struct v_file* file)
1231 atomic_fetch_add(&file->ref_count, 1);
1235 vfs_ref_dnode(struct v_dnode* dnode)
1237 atomic_fetch_add(&dnode->ref_count, 1);
1238 mnt_mkbusy(dnode->mnt);
1242 vfs_unref_dnode(struct v_dnode* dnode)
1244 atomic_fetch_sub(&dnode->ref_count, 1);
1245 mnt_chillax(dnode->mnt);
1249 vfs_do_chdir(struct proc_info* proc, struct v_dnode* dnode)
1255 if (!(dnode->inode->itype & VFS_IFDIR)) {
1261 vfs_unref_dnode(proc->cwd);
1264 vfs_ref_dnode(dnode);
1267 unlock_dnode(dnode);
1273 __DEFINE_LXSYSCALL1(int, chdir, const char*, path)
1275 struct v_dnode* dnode;
1278 if ((errno = vfs_walk_proc(path, &dnode, NULL, 0))) {
1282 errno = vfs_do_chdir(__current, dnode);
1285 return DO_STATUS(errno);
1288 __DEFINE_LXSYSCALL1(int, fchdir, int, fd)
1293 if ((errno = vfs_getfd(fd, &fd_s))) {
1297 errno = vfs_do_chdir(__current, fd_s->file->dnode);
1300 return DO_STATUS(errno);
1303 __DEFINE_LXSYSCALL2(char*, getcwd, char*, buf, size_t, size)
1314 if (!__current->cwd) {
1315 *buf = VFS_PATH_DELIM;
1318 len = vfs_get_path(__current->cwd, buf, size, 0);
1325 buf[len + 1] = '\0';
1330 __current->k_status = errno;
1335 vfs_do_rename(struct v_dnode* current, struct v_dnode* target)
1338 if (current->inode->id == target->inode->id) {
1343 if (errno = vfs_check_writable(current)) {
1347 if (current->ref_count > 1 || target->ref_count > 1) {
1351 if (current->super_block != target->super_block) {
1355 struct v_dnode* oldparent = current->parent;
1356 struct v_dnode* newparent = target->parent;
1358 lock_dnode(current);
1361 lock_dnode(oldparent);
1363 lock_dnode(newparent);
1365 if (!llist_empty(&target->children)) {
1367 unlock_dnode(target);
1372 current->inode->ops->rename(current->inode, current, target))) {
1373 unlock_dnode(target);
1377 // re-position current
1378 hstrcpy(¤t->name, &target->name);
1379 vfs_dcache_rehash(newparent, current);
1384 unlock_dnode(target);
1387 unlock_dnode(current);
1389 unlock_dnode(oldparent);
1391 unlock_dnode(newparent);
1396 __DEFINE_LXSYSCALL2(int, rename, const char*, oldpath, const char*, newpath)
1398 struct v_dnode *cur, *target_parent, *target;
1399 struct hstr name = HSTR(valloc(VFS_NAME_MAXLEN), 0);
1402 if ((errno = vfs_walk_proc(oldpath, &cur, NULL, 0))) {
1406 if ((errno = vfs_walk(
1407 __current->cwd, newpath, &target_parent, &name, VFS_WALK_PARENT))) {
1411 errno = vfs_walk(target_parent, name.value, &target, NULL, 0);
1412 if (errno == ENOENT) {
1413 target = vfs_d_alloc(target_parent, &name);
1414 vfs_dcache_add(target_parent, target);
1424 errno = vfs_do_rename(cur, target);
1428 return DO_STATUS(errno);