VFS.c 7.6 KB

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