VFS.c 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720
  1. #include "VFS.h"
  2. #include "internal.h"
  3. #include "mount.h"
  4. #include <common/dirent.h>
  5. #include <common/errno.h>
  6. #include <common/kprint.h>
  7. #include <common/string.h>
  8. #include <debug/bug.h>
  9. #include <filesystem/rootfs/rootfs.h>
  10. #include <mm/mm.h>
  11. #include <mm/slab.h>
  12. #include <process/process.h>
  13. #include <process/ptrace.h>
  14. // 为filesystem_type_t结构体实例化一个链表头
  15. static struct vfs_filesystem_type_t vfs_fs = {"filesystem", 0};
  16. struct vfs_superblock_t *vfs_root_sb = NULL;
  17. struct vfs_dir_entry_t *vfs_alloc_dentry(const int name_size);
  18. /**
  19. * @brief 挂载文件系统
  20. *
  21. * @param path 要挂载到的路径
  22. * @param name 文件系统名
  23. * @param blk 块设备结构体
  24. * @return struct vfs_superblock_t* 挂载后,文件系统的超级块
  25. */
  26. struct vfs_superblock_t *vfs_mount_fs(const char *path, char *name, struct block_device *blk)
  27. {
  28. // 判断挂载点是否存在
  29. struct vfs_dir_entry_t *target_dentry = NULL;
  30. target_dentry = vfs_path_walk(path, 0);
  31. if (target_dentry == NULL)
  32. return NULL;
  33. struct vfs_filesystem_type_t *p = NULL;
  34. for (p = &vfs_fs; p; p = p->next)
  35. {
  36. if (!strcmp(p->name, name)) // 存在符合的文件系统
  37. {
  38. struct vfs_superblock_t *sb = p->read_superblock(blk);
  39. if (strcmp(path, "/") == 0) // 如果挂载到的是'/'挂载点,则让其成为最顶层的文件系统
  40. {
  41. vfs_root_sb = sb;
  42. }
  43. else
  44. {
  45. kdebug("to mount %s", name);
  46. // 调用mount机制,挂载文件系统
  47. struct vfs_dir_entry_t *new_dentry = sb->root;
  48. // 注意,umount的时候需要释放这些内存
  49. new_dentry->name = kzalloc(target_dentry->name_length + 1, 0);
  50. new_dentry->name_length = target_dentry->name_length;
  51. do_mount(target_dentry, new_dentry);
  52. }
  53. return sb;
  54. }
  55. }
  56. kdebug("unsupported fs: %s", name);
  57. return NULL;
  58. }
  59. /**
  60. * @brief 在VFS中注册文件系统
  61. *
  62. * @param fs 文件系统类型结构体
  63. * @return uint64_t
  64. */
  65. uint64_t vfs_register_filesystem(struct vfs_filesystem_type_t *fs)
  66. {
  67. struct vfs_filesystem_type_t *p = NULL;
  68. for (p = &vfs_fs; p; p = p->next)
  69. {
  70. if (!strcmp(p->name, fs->name)) // 已经注册相同名称的文件系统
  71. return -EEXIST;
  72. }
  73. fs->next = vfs_fs.next;
  74. vfs_fs.next = fs;
  75. return 0;
  76. }
  77. uint64_t vfs_unregister_filesystem(struct vfs_filesystem_type_t *fs)
  78. {
  79. struct vfs_filesystem_type_t *p = &vfs_fs;
  80. while (p->next)
  81. {
  82. if (p->next == fs)
  83. {
  84. p->next = p->next->next;
  85. fs->next = NULL;
  86. return 0;
  87. }
  88. else
  89. p = p->next;
  90. }
  91. return -EINVAL;
  92. }
  93. /**
  94. * @brief 在dentry的sub_dir_list中搜索指定名称的dentry
  95. *
  96. * @param dentry 目录项结构体dentry
  97. * @param name 待搜索的dentry名称
  98. * @return struct vfs_dir_entry_t* 目标dentry (无结果则返回NULL)
  99. */
  100. static struct vfs_dir_entry_t *vfs_search_dentry_list(struct vfs_dir_entry_t *dentry, const char *name)
  101. {
  102. if (list_empty(&dentry->subdirs_list))
  103. return NULL;
  104. struct List *ptr = &dentry->subdirs_list;
  105. struct vfs_dir_entry_t *d_ptr = NULL;
  106. do
  107. {
  108. ptr = list_next(ptr);
  109. d_ptr = container_of(ptr, struct vfs_dir_entry_t, child_node_list);
  110. if (strcmp(name, d_ptr->name) == 0)
  111. return d_ptr;
  112. } while (list_next(ptr) != (&dentry->subdirs_list));
  113. return NULL;
  114. }
  115. /**
  116. * @brief 按照路径查找文件
  117. *
  118. * @param path 路径
  119. * @param flags 1:返回父目录项, 0:返回结果目录项
  120. * @return struct vfs_dir_entry_t* 目录项
  121. */
  122. struct vfs_dir_entry_t *vfs_path_walk(const char *path, uint64_t flags)
  123. {
  124. struct vfs_dir_entry_t *parent = vfs_root_sb->root;
  125. // 去除路径前的斜杠
  126. while (*path == '/')
  127. ++path;
  128. if ((!*path) || (*path == '\0'))
  129. return parent;
  130. struct vfs_dir_entry_t *dentry = NULL;
  131. // kdebug("path before walk:%s", path);
  132. while (true)
  133. {
  134. // 提取出下一级待搜索的目录名或文件名,并保存在dEntry_name中
  135. const char *tmp_path = path;
  136. while ((*path && *path != '\0') && (*path != '/'))
  137. ++path;
  138. int tmp_path_len = path - tmp_path;
  139. // 搜索是否有dentry缓存
  140. {
  141. char *tmpname = kzalloc(tmp_path_len + 1, 0);
  142. strncpy(tmpname, tmp_path, tmp_path_len);
  143. tmpname[tmp_path_len] = '\0';
  144. dentry = vfs_search_dentry_list(parent, tmpname);
  145. kfree(tmpname);
  146. }
  147. // 如果没有找到dentry缓存,则申请新的dentry
  148. if (dentry == NULL)
  149. {
  150. dentry = vfs_alloc_dentry(tmp_path_len + 1);
  151. memcpy(dentry->name, (void *)tmp_path, tmp_path_len);
  152. dentry->name[tmp_path_len] = '\0';
  153. // kdebug("tmp_path_len=%d, dentry->name= %s", tmp_path_len, dentry->name);
  154. dentry->name_length = tmp_path_len;
  155. if (parent->dir_inode->inode_ops->lookup(parent->dir_inode, dentry) == NULL)
  156. {
  157. // 搜索失败
  158. // kerror("cannot find the file/dir : %s", dentry->name);
  159. kfree(dentry->name);
  160. kfree(dentry);
  161. return NULL;
  162. }
  163. // 找到子目录项
  164. dentry->parent = parent;
  165. list_add(&parent->subdirs_list, &dentry->child_node_list);
  166. }
  167. while (*path == '/')
  168. ++path;
  169. if ((!*path) || (*path == '\0')) // 已经到达末尾
  170. {
  171. if (flags & 1) // 返回父目录
  172. {
  173. return parent;
  174. }
  175. return dentry;
  176. }
  177. parent = dentry;
  178. }
  179. }
  180. /**
  181. * @brief 填充dentry
  182. *
  183. * @return dirent的总大小
  184. */
  185. int vfs_fill_dirent(void *buf, ino_t d_ino, char *name, int namelen, unsigned char type, off_t offset)
  186. {
  187. struct dirent *dent = (struct dirent *)buf;
  188. // 如果尝试访问内核空间,则返回错误
  189. if (!(verify_area((uint64_t)buf, sizeof(struct dirent) + namelen)))
  190. return -EFAULT;
  191. // ====== 填充dirent结构体 =====
  192. memset(buf, 0, sizeof(struct dirent) + namelen);
  193. memcpy(dent->d_name, name, namelen);
  194. dent->d_name[namelen] = '\0';
  195. // 暂时不显示目录下的记录数
  196. dent->d_reclen = 0;
  197. dent->d_ino = d_ino;
  198. dent->d_off = offset;
  199. dent->d_type = type;
  200. // 返回dirent的总大小
  201. return sizeof(struct dirent) + namelen;
  202. }
  203. /**
  204. * @brief 创建文件夹
  205. *
  206. * @param path 文件夹路径
  207. * @param mode 创建模式
  208. * @param from_userland 该创建请求是否来自用户态
  209. * @return int64_t 错误码
  210. */
  211. int64_t vfs_mkdir(const char *path, mode_t mode, bool from_userland)
  212. {
  213. uint32_t pathlen;
  214. int retval = 0;
  215. if (from_userland)
  216. pathlen = strnlen_user(path, PAGE_4K_SIZE - 1);
  217. else
  218. pathlen = strnlen(path, PAGE_4K_SIZE - 1);
  219. if (pathlen == 0)
  220. return -ENOENT;
  221. int last_slash = -1;
  222. // 查找最后一个'/',忽略路径末尾的'/'
  223. for (int i = pathlen - 2; i >= 0; --i)
  224. {
  225. if (path[i] == '/')
  226. {
  227. last_slash = i;
  228. break;
  229. }
  230. }
  231. // 路径格式不合法(必须使用绝对路径)
  232. if (last_slash < 0)
  233. return -ENOTDIR;
  234. char *buf = (char *)kzalloc(last_slash + 2, 0);
  235. // 拷贝字符串(不包含要被创建的部分)
  236. if (from_userland)
  237. strncpy_from_user(buf, path, last_slash);
  238. else
  239. strncpy(buf, path, last_slash);
  240. buf[last_slash + 1] = '\0';
  241. // 查找父目录
  242. struct vfs_dir_entry_t *parent_dir = vfs_path_walk(buf, 0);
  243. if (parent_dir == NULL)
  244. {
  245. kwarn("parent dir is NULL.");
  246. kfree(buf);
  247. return -ENOENT;
  248. }
  249. kfree(buf);
  250. // 检查父目录中是否已经有相同的目录项
  251. if (vfs_path_walk((const char *)path, 0) != NULL)
  252. {
  253. // 目录中已有对应的文件夹
  254. kwarn("Dir '%s' aleardy exists.", path);
  255. return -EEXIST;
  256. }
  257. spin_lock(&parent_dir->lockref.lock);
  258. struct vfs_dir_entry_t *subdir_dentry = vfs_alloc_dentry(pathlen - last_slash);
  259. if (path[pathlen - 1] == '/')
  260. subdir_dentry->name_length = pathlen - last_slash - 2;
  261. else
  262. subdir_dentry->name_length = pathlen - last_slash - 1;
  263. for (int i = last_slash + 1, cnt = 0; i < pathlen && cnt < subdir_dentry->name_length; ++i, ++cnt)
  264. {
  265. subdir_dentry->name[cnt] = path[i];
  266. }
  267. // kdebug("last_slash=%d", last_slash);
  268. // kdebug("name=%s", path + last_slash + 1);
  269. subdir_dentry->parent = parent_dir;
  270. // kdebug("to mkdir, parent name=%s", parent_dir->name);
  271. spin_lock(&parent_dir->dir_inode->lockref.lock);
  272. retval = parent_dir->dir_inode->inode_ops->mkdir(parent_dir->dir_inode, subdir_dentry, 0);
  273. spin_unlock(&parent_dir->dir_inode->lockref.lock);
  274. if (retval != 0)
  275. {
  276. if (vfs_dentry_put(parent_dir) != 0) // 释放dentry
  277. spin_unlock(&parent_dir->lockref.lock);
  278. return retval;
  279. }
  280. // 获取append前一个dentry并加锁
  281. struct List *target_list = &parent_dir->subdirs_list;
  282. // kdebug("target_list=%#018lx target_list->prev=%#018lx",target_list,target_list->prev);
  283. if (list_empty(target_list) == false)
  284. {
  285. struct vfs_dir_entry_t *prev_dentry = list_entry(target_list->prev, struct vfs_dir_entry_t, child_node_list);
  286. // kdebug("prev_dentry%#018lx",prev_dentry);
  287. spin_lock(&prev_dentry->lockref.lock);
  288. list_append(&parent_dir->subdirs_list, &subdir_dentry->child_node_list);
  289. // kdebug("retval = %d", retval);
  290. spin_unlock(&prev_dentry->lockref.lock);
  291. }
  292. else
  293. {
  294. list_append(&parent_dir->subdirs_list, &subdir_dentry->child_node_list);
  295. goto out;
  296. }
  297. out:;
  298. spin_unlock(&parent_dir->lockref.lock);
  299. return retval;
  300. }
  301. /**
  302. * @brief 创建文件夹
  303. *
  304. * @param path(r8) 路径
  305. * @param mode(r9) 模式
  306. * @return uint64_t
  307. */
  308. uint64_t sys_mkdir(struct pt_regs *regs)
  309. {
  310. const char *path = (const char *)regs->r8;
  311. // kdebug("path = %s", path);
  312. mode_t mode = (mode_t)regs->r9;
  313. if (regs->cs & USER_CS)
  314. return vfs_mkdir(path, mode, true);
  315. else
  316. return vfs_mkdir(path, mode, false);
  317. }
  318. /**
  319. * @brief 打开文件
  320. *
  321. * @param filename 文件路径
  322. * @param flags 标志位
  323. * @return uint64_t 错误码
  324. */
  325. uint64_t do_open(const char *filename, int flags)
  326. {
  327. long path_len = strnlen_user(filename, PAGE_4K_SIZE) + 1;
  328. if (path_len <= 0) // 地址空间错误
  329. return -EFAULT;
  330. else if (path_len >= PAGE_4K_SIZE) // 名称过长
  331. return -ENAMETOOLONG;
  332. // 为待拷贝文件路径字符串分配内存空间
  333. char *path = (char *)kzalloc(path_len, 0);
  334. if (path == NULL)
  335. return -ENOMEM;
  336. strncpy_from_user(path, filename, path_len);
  337. // 去除末尾的 '/'
  338. if (path_len >= 2 && path[path_len - 2] == '/')
  339. {
  340. path[path_len - 2] = '\0';
  341. --path_len;
  342. }
  343. // 寻找文件
  344. struct vfs_dir_entry_t *dentry = vfs_path_walk(path, 0);
  345. if (dentry == NULL && flags & O_CREAT)
  346. {
  347. // 先找到倒数第二级目录
  348. int tmp_index = -1;
  349. for (int i = path_len - 1; i >= 0; --i)
  350. {
  351. if (path[i] == '/')
  352. {
  353. tmp_index = i;
  354. break;
  355. }
  356. }
  357. struct vfs_dir_entry_t *parent_dentry = NULL;
  358. // kdebug("tmp_index=%d", tmp_index);
  359. if (tmp_index > 0)
  360. {
  361. path[tmp_index] = '\0';
  362. parent_dentry = vfs_path_walk(path, 0);
  363. if (parent_dentry == NULL)
  364. {
  365. kfree(path);
  366. return -ENOENT;
  367. }
  368. }
  369. else
  370. {
  371. parent_dentry = vfs_root_sb->root;
  372. }
  373. // 创建新的文件
  374. dentry = vfs_alloc_dentry(path_len - tmp_index);
  375. dentry->name_length = path_len - tmp_index - 1;
  376. strncpy(dentry->name, path + tmp_index + 1, dentry->name_length);
  377. // kdebug("to create new file:%s namelen=%d", dentry->name, dentry->name_length)
  378. dentry->parent = parent_dentry;
  379. // 对父目录项加锁
  380. spin_lock(&parent_dentry->lockref.lock);
  381. spin_lock(&parent_dentry->dir_inode->lockref.lock);
  382. // 创建子目录项
  383. uint64_t retval = parent_dentry->dir_inode->inode_ops->create(parent_dentry->dir_inode, dentry, 0);
  384. spin_unlock(&parent_dentry->dir_inode->lockref.lock); // 解锁inode
  385. if (retval != 0)
  386. {
  387. if (vfs_dentry_put(dentry) != 0) // 释放dentry
  388. BUG_ON(1);
  389. BUG_ON(1);
  390. kfree(path);
  391. spin_unlock(&parent_dentry->lockref.lock);
  392. return retval;
  393. }
  394. // ==== 将子目录项添加到链表 ====
  395. struct vfs_dir_entry_t *next_dentry = NULL;
  396. // 若list非空,则对前一个dentry加锁
  397. if (!list_empty(&parent_dentry->subdirs_list))
  398. {
  399. next_dentry = list_entry(list_next(&parent_dentry->subdirs_list), struct vfs_dir_entry_t, child_node_list);
  400. spin_lock(&next_dentry->lockref.lock);
  401. }
  402. list_add(&parent_dentry->subdirs_list, &dentry->child_node_list);
  403. if (next_dentry != NULL)
  404. spin_unlock(&next_dentry->lockref.lock);
  405. // 新建文件结束,对父目录项解锁
  406. spin_unlock(&parent_dentry->lockref.lock);
  407. // kdebug("created.");
  408. }
  409. kfree(path);
  410. if (dentry == NULL)
  411. {
  412. return -ENOENT;
  413. }
  414. spin_lock(&dentry->lockref.lock);
  415. // 要求打开文件夹而目标不是文件夹
  416. if ((flags & O_DIRECTORY) && (dentry->dir_inode->attribute != VFS_IF_DIR))
  417. {
  418. spin_unlock(&dentry->lockref.lock);
  419. return -ENOTDIR;
  420. }
  421. // 创建文件描述符
  422. struct vfs_file_t *file_ptr = (struct vfs_file_t *)kzalloc(sizeof(struct vfs_file_t), 0);
  423. int errcode = -1;
  424. file_ptr->dEntry = dentry;
  425. file_ptr->mode = flags;
  426. file_ptr->file_ops = dentry->dir_inode->file_ops;
  427. // 如果文件系统实现了打开文件的函数
  428. if (file_ptr->file_ops && file_ptr->file_ops->open)
  429. errcode = file_ptr->file_ops->open(dentry->dir_inode, file_ptr);
  430. if (errcode != 0)
  431. {
  432. kfree(file_ptr);
  433. spin_unlock(&dentry->lockref.lock);
  434. return -EFAULT;
  435. }
  436. if (file_ptr->mode & O_TRUNC) // 清空文件
  437. file_ptr->dEntry->dir_inode->file_size = 0;
  438. if (file_ptr->mode & O_APPEND)
  439. file_ptr->position = file_ptr->dEntry->dir_inode->file_size;
  440. else
  441. file_ptr->position = 0;
  442. struct vfs_file_t **f = current_pcb->fds;
  443. int fd_num = -1;
  444. // 在指针数组中寻找空位
  445. // todo: 当pcb中的指针数组改为动态指针数组之后,需要更改这里(目前还是静态指针数组)
  446. for (int i = 0; i < PROC_MAX_FD_NUM; ++i)
  447. {
  448. if (f[i] == NULL) // 找到指针数组中的空位
  449. {
  450. fd_num = i;
  451. break;
  452. }
  453. }
  454. // 指针数组没有空位了
  455. if (fd_num == -1)
  456. {
  457. kfree(file_ptr);
  458. spin_unlock(&dentry->lockref.lock);
  459. return -ENFILE;
  460. }
  461. // 保存文件描述符
  462. f[fd_num] = file_ptr;
  463. spin_unlock(&dentry->lockref.lock);
  464. return fd_num;
  465. }
  466. uint64_t sys_open(struct pt_regs *regs)
  467. {
  468. char *filename = (char *)(regs->r8);
  469. int flags = (int)(regs->r9);
  470. return do_open(filename, flags);
  471. }
  472. /**
  473. * @brief 动态分配dentry以及路径字符串名称
  474. *
  475. * @param name_size 名称字符串大小(字节)(注意考虑字符串最后需要有一个‘\0’作为结尾)
  476. * @return struct vfs_dir_entry_t* 创建好的dentry
  477. */
  478. struct vfs_dir_entry_t *vfs_alloc_dentry(const int name_size)
  479. {
  480. if (unlikely(name_size > VFS_MAX_PATHLEN))
  481. return NULL;
  482. struct vfs_dir_entry_t *dentry = (struct vfs_dir_entry_t *)kzalloc(sizeof(struct vfs_dir_entry_t), 0);
  483. if (unlikely(dentry == NULL))
  484. return NULL;
  485. if (name_size != 0)
  486. dentry->name = (char *)kzalloc(name_size, 0);
  487. // 初始化lockref
  488. spin_init(&dentry->lockref.lock);
  489. dentry->lockref.count = 1;
  490. // 初始化链表
  491. list_init(&dentry->child_node_list);
  492. list_init(&dentry->subdirs_list);
  493. return dentry;
  494. }
  495. /**
  496. * @brief 判断是否可以删除指定的dentry
  497. *
  498. * 1、我们不能删除一个只读的dentry
  499. * 2、我们应当对这个dentry的inode拥有写、执行权限(暂时还没有实现权限)
  500. * 3、如果dentry指向的是文件夹,而isdir为false,则不能删除
  501. * 3、如果dentry指向的是文件,而isdir为true,则不能删除
  502. * @param dentry 将要被删除的dentry
  503. * @param isdir 是否要删除文件夹
  504. * @return int 错误码
  505. */
  506. int vfs_may_delete(struct vfs_dir_entry_t *dentry, bool isdir)
  507. {
  508. // 当dentry没有inode的时候,认为是bug
  509. BUG_ON(dentry->dir_inode == NULL);
  510. // todo: 进行权限检查
  511. if (isdir) // 要删除文件夹
  512. {
  513. if (!D_ISDIR(dentry))
  514. return -ENOTDIR;
  515. else if (IS_ROOT(dentry))
  516. return -EBUSY;
  517. }
  518. else if (D_ISDIR(dentry)) // 要删除文件但是当前是文件夹
  519. return -EISDIR;
  520. return 0;
  521. }
  522. /**
  523. * @brief 删除文件夹
  524. *
  525. * @param path 文件夹路径
  526. * @param from_userland 请求是否来自用户态
  527. * @return int64_t 错误码
  528. */
  529. int64_t vfs_rmdir(const char *path, bool from_userland)
  530. {
  531. uint32_t pathlen;
  532. if (from_userland)
  533. pathlen = strnlen_user(path, PAGE_4K_SIZE - 1);
  534. else
  535. pathlen = strnlen(path, PAGE_4K_SIZE - 1);
  536. if (pathlen == 0)
  537. return -ENOENT;
  538. int last_slash = -1;
  539. // 去除末尾的'/'
  540. for (int i = pathlen - 1; i >= 0; --i)
  541. {
  542. if (path[i] != '/')
  543. {
  544. last_slash = i + 1;
  545. break;
  546. }
  547. }
  548. // 路径格式不合法
  549. if (last_slash < 0)
  550. return -ENOTDIR;
  551. else if (path[0] != '/')
  552. return -EINVAL;
  553. char *buf = (char *)kzalloc(last_slash + 2, 0);
  554. // 拷贝字符串(不包含要被创建的部分)
  555. if (from_userland)
  556. strncpy_from_user(buf, path, last_slash);
  557. else
  558. strncpy(buf, path, last_slash);
  559. buf[last_slash + 1] = '\0';
  560. struct vfs_dir_entry_t *dentry = vfs_path_walk(buf, 0);
  561. if (dentry == NULL)
  562. return -ENOENT;
  563. int retval = vfs_may_delete(dentry, true);
  564. if (retval != 0)
  565. return retval;
  566. // todo: 对dentry和inode加锁
  567. spin_lock(&dentry->lockref.lock);
  568. retval = -EBUSY;
  569. if (is_local_mountpoint(dentry))
  570. goto out;
  571. // todo:
  572. retval = dentry->dir_inode->inode_ops->rmdir(dentry->dir_inode, dentry);
  573. if (retval != 0)
  574. goto out;
  575. dentry->dir_inode->attribute |= VFS_IF_DEAD; // 将当前inode标记为dead
  576. dont_mount(dentry); // 将当前dentry标记为不可被挂载
  577. detach_mounts(dentry); // 清理同样挂载在该路径的所有挂载点的挂载树
  578. if (vfs_dentry_put(dentry) != 0)
  579. goto out; // 释放dentry
  580. return retval;
  581. out:;
  582. spin_unlock(&dentry->lockref.lock);
  583. // todo: 对dentry和inode放锁
  584. return retval;
  585. }
  586. /**
  587. * @brief 删除文件夹的系统调用函数
  588. *
  589. * @param r8 文件夹路径
  590. * @return uint64_t 错误码
  591. */
  592. uint64_t sys_rmdir(struct pt_regs *regs)
  593. {
  594. if (SYSCALL_FROM_USER(regs))
  595. return vfs_rmdir((char *)regs->r8, true);
  596. else
  597. return vfs_rmdir((char *)regs->r8, false);
  598. }
  599. /**
  600. * @brief 分配inode并将引用计数初始化为1
  601. *
  602. * @return struct vfs_index_node_t * 分配得到的inode
  603. */
  604. struct vfs_index_node_t *vfs_alloc_inode()
  605. {
  606. struct vfs_index_node_t *inode = kzalloc(sizeof(struct vfs_index_node_t), 0);
  607. spin_init(&inode->lockref.lock);
  608. inode->lockref.count = 1; // 初始化引用计数为1
  609. return inode;
  610. }
  611. /**
  612. * @brief 初始化vfs
  613. *
  614. * @return int 错误码
  615. */
  616. int vfs_init()
  617. {
  618. mount_init();
  619. rootfs_init();
  620. return 0;
  621. }