VFS.c 7.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263
  1. #include "VFS.h"
  2. #include <common/kprint.h>
  3. #include <common/dirent.h>
  4. #include <common/errno.h>
  5. #include <mm/mm.h>
  6. #include <mm/slab.h>
  7. #include <process/ptrace.h>
  8. #include <process/process.h>
  9. // 为filesystem_type_t结构体实例化一个链表头
  10. static struct vfs_filesystem_type_t vfs_fs = {"filesystem", 0};
  11. /**
  12. * @brief 挂载文件系统
  13. *
  14. * @param name 文件系统名
  15. * @param DPTE 分区表entry
  16. * @param DPT_type 分区表类型
  17. * @param buf 文件系统的引导扇区
  18. * @return struct vfs_superblock_t*
  19. */
  20. struct vfs_superblock_t *vfs_mount_fs(char *name, void *DPTE, uint8_t DPT_type, void *buf, int8_t ahci_ctrl_num, int8_t ahci_port_num, int8_t part_num)
  21. {
  22. struct vfs_filesystem_type_t *p = NULL;
  23. for (p = &vfs_fs; p; p = p->next)
  24. {
  25. if (!strcmp(p->name, name)) // 存在符合的文件系统
  26. {
  27. return p->read_superblock(DPTE, DPT_type, buf, ahci_ctrl_num, ahci_port_num, part_num);
  28. }
  29. }
  30. kdebug("unsupported fs: %s", name);
  31. return NULL;
  32. }
  33. /**
  34. * @brief 在VFS中注册文件系统
  35. *
  36. * @param fs 文件系统类型结构体
  37. * @return uint64_t
  38. */
  39. uint64_t vfs_register_filesystem(struct vfs_filesystem_type_t *fs)
  40. {
  41. struct vfs_filesystem_type_t *p = NULL;
  42. for (p = &vfs_fs; p; p = p->next)
  43. {
  44. if (!strcmp(p->name, fs->name)) // 已经注册相同名称的文件系统
  45. return VFS_E_FS_EXISTED;
  46. }
  47. fs->next = vfs_fs.next;
  48. vfs_fs.next = fs;
  49. return VFS_SUCCESS;
  50. }
  51. uint64_t vfs_unregister_filesystem(struct vfs_filesystem_type_t *fs)
  52. {
  53. struct vfs_filesystem_type_t *p = &vfs_fs;
  54. while (p->next)
  55. {
  56. if (p->next == fs)
  57. {
  58. p->next = p->next->next;
  59. fs->next = NULL;
  60. return VFS_SUCCESS;
  61. }
  62. else
  63. p = p->next;
  64. }
  65. return VFS_E_FS_NOT_EXIST;
  66. }
  67. /**
  68. * @brief 按照路径查找文件
  69. *
  70. * @param path 路径
  71. * @param flags 1:返回父目录项, 0:返回结果目录项
  72. * @return struct vfs_dir_entry_t* 目录项
  73. */
  74. struct vfs_dir_entry_t *vfs_path_walk(const char *path, uint64_t flags)
  75. {
  76. struct vfs_dir_entry_t *parent = vfs_root_sb->root;
  77. // 去除路径前的斜杠
  78. while (*path == '/')
  79. ++path;
  80. if ((!*path) || (*path == '\0'))
  81. return parent;
  82. struct vfs_dir_entry_t *dentry;
  83. kdebug("path before walk:%s", path);
  84. while (true)
  85. {
  86. // 提取出下一级待搜索的目录名或文件名,并保存在dEntry_name中
  87. const char *tmp_path = path;
  88. while ((*path && *path != '\0') && (*path != '/'))
  89. ++path;
  90. int tmp_path_len = path - tmp_path;
  91. dentry = (struct vfs_dir_entry_t *)kmalloc(sizeof(struct vfs_dir_entry_t), 0);
  92. memset(dentry, 0, sizeof(struct vfs_dir_entry_t));
  93. // 为目录项的名称分配内存
  94. dentry->name = (char *)kmalloc(tmp_path_len + 1, 0);
  95. // 貌似这里不需要memset,因为空间会被覆盖
  96. // memset(dentry->name, 0, tmp_path_len+1);
  97. memcpy(dentry->name, (void*)tmp_path, tmp_path_len);
  98. dentry->name[tmp_path_len] = '\0';
  99. kdebug("tmp_path_len=%d, dentry->name= %s", tmp_path_len, dentry->name);
  100. dentry->name_length = tmp_path_len;
  101. if (parent->dir_inode->inode_ops->lookup(parent->dir_inode, dentry) == NULL)
  102. {
  103. // 搜索失败
  104. kerror("cannot find the file/dir : %s", dentry->name);
  105. kfree(dentry->name);
  106. kfree(dentry);
  107. return NULL;
  108. }
  109. // 找到子目录项
  110. // 初始化子目录项的entry
  111. list_init(&dentry->child_node_list);
  112. list_init(&dentry->subdirs_list);
  113. dentry->parent = parent;
  114. list_add(&parent->subdirs_list, &dentry->child_node_list);
  115. while (*path == '/')
  116. ++path;
  117. if ((!*path) || (*path == '\0')) // 已经到达末尾
  118. {
  119. if (flags & 1) // 返回父目录
  120. {
  121. return parent;
  122. }
  123. return dentry;
  124. }
  125. parent = dentry;
  126. }
  127. }
  128. /**
  129. * @brief 填充dentry
  130. *
  131. */
  132. int vfs_fill_dentry(void *buf, ino_t d_ino, char *name, int namelen, unsigned char type, off_t offset)
  133. {
  134. struct dirent *dent = (struct dirent *)buf;
  135. // 如果尝试访问内核空间,则返回错误
  136. if (!(verify_area((uint64_t)buf, sizeof(struct dirent) + namelen)))
  137. return -EFAULT;
  138. // ====== 填充dirent结构体 =====
  139. memset(buf, 0, sizeof(struct dirent) + namelen);
  140. memcpy(dent->d_name, name, namelen);
  141. dent->d_name[namelen] = '\0';
  142. // 暂时不显示目录下的记录数
  143. dent->d_reclen = 0;
  144. dent->d_ino = d_ino;
  145. dent->d_off = offset;
  146. dent->d_type = type;
  147. // 返回dirent的总大小
  148. return sizeof(struct dirent) + namelen;
  149. }
  150. /**
  151. * @brief 创建文件夹
  152. *
  153. * @param path(r8) 路径
  154. * @param mode(r9) 模式
  155. * @return uint64_t
  156. */
  157. uint64_t sys_mkdir(struct pt_regs *regs)
  158. {
  159. const char *path = (const char *)regs->r8;
  160. kdebug("path = %s", path);
  161. mode_t mode = (mode_t)regs->r9;
  162. uint32_t pathlen;
  163. if (regs->cs & USER_CS)
  164. pathlen = strnlen_user(path, PAGE_4K_SIZE - 1);
  165. else
  166. pathlen = strnlen(path, PAGE_4K_SIZE - 1);
  167. if (pathlen == 0)
  168. return -ENOENT;
  169. int last_slash = -1;
  170. // 查找最后一个'/',忽略路径末尾的'/'
  171. for (int i = pathlen - 2; i >= 0; --i)
  172. {
  173. if (path[i] == '/')
  174. {
  175. last_slash = i;
  176. break;
  177. }
  178. }
  179. // 路径格式不合法(必须使用绝对路径)
  180. if (last_slash < 0)
  181. return ENOTDIR;
  182. char *buf = (char *)kmalloc(last_slash + 1, 0);
  183. memset(buf, 0, pathlen + 1);
  184. // 拷贝字符串(不包含要被创建的部分)
  185. if (regs->cs & USER_CS)
  186. strncpy_from_user(buf, path, last_slash);
  187. else
  188. strncpy(buf, path, last_slash);
  189. buf[last_slash + 1] = '\0';
  190. kdebug("to walk: %s", buf);
  191. // 查找父目录
  192. struct vfs_dir_entry_t *parent_dir = vfs_path_walk(buf, 0);
  193. if (parent_dir == NULL)
  194. {
  195. kwarn("parent dir is NULL.");
  196. kfree(buf);
  197. return -ENOENT;
  198. }
  199. kfree(buf);
  200. // 检查父目录中是否已经有相同的目录项
  201. if (vfs_path_walk((const char *)path, 0) != NULL)
  202. {
  203. // 目录中已有对应的文件夹
  204. kwarn("Dir '%s' aleardy exists.", path);
  205. kdebug("name = %s", vfs_path_walk((const char *)path, 0)->name)
  206. return -EEXIST;
  207. }
  208. struct vfs_dir_entry_t *subdir_dentry = (struct vfs_dir_entry_t *)kmalloc(sizeof(struct vfs_dir_entry_t), 0);
  209. memset((void *)subdir_dentry, 0, sizeof(struct vfs_dir_entry_t));
  210. if (path[pathlen - 1] == '/')
  211. subdir_dentry->name_length = pathlen - last_slash - 2;
  212. else
  213. subdir_dentry->name_length = pathlen - last_slash - 1;
  214. subdir_dentry->name = (char *)kmalloc(subdir_dentry->name_length + 1, 0);
  215. memset((void *)subdir_dentry->name, 0, subdir_dentry->name_length + 1);
  216. for (int i = last_slash + 1, cnt = 0; i < pathlen && cnt < subdir_dentry->name_length; ++i, ++cnt)
  217. {
  218. subdir_dentry->name[cnt] = path[i];
  219. }
  220. ++subdir_dentry->name_length;
  221. kdebug("last_slash=%d", last_slash);
  222. kdebug("name=%s", path + last_slash + 1);
  223. subdir_dentry->parent = parent_dir;
  224. kdebug("to mkdir, parent name=%s", parent_dir->name);
  225. int retval = parent_dir->dir_inode->inode_ops->mkdir(parent_dir->dir_inode, subdir_dentry, 0);
  226. list_add(&parent_dir->subdirs_list, &subdir_dentry->child_node_list);
  227. kdebug("retval = %d", retval);
  228. return 0;
  229. }