VFS.c 19 KB

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