VFS.c 16 KB

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