vfs.cpp 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911
  1. #include <bit>
  2. #include <cstddef>
  3. #include <map>
  4. #include <string>
  5. #include <utility>
  6. #include <vector>
  7. #include <assert.h>
  8. #include <bits/alltypes.h>
  9. #include <errno.h>
  10. #include <stdint.h>
  11. #include <stdio.h>
  12. #include <sys/mount.h>
  13. #include <sys/types.h>
  14. #include <types/allocator.hpp>
  15. #include <types/path.hpp>
  16. #include <types/status.h>
  17. #include <kernel/log.hpp>
  18. #include <kernel/mem.h>
  19. #include <kernel/process.hpp>
  20. #include <kernel/tty.hpp>
  21. #include <kernel/vfs.hpp>
  22. #include <kernel/vfs/dentry.hpp>
  23. #include <kernel/vfs/vfs.hpp>
  24. using fs::vfs, fs::dentry;
  25. dentry::dentry(dentry* _parent, inode* _ind, name_type _name)
  26. : parent(_parent) , ind(_ind) , flags { } , name(_name)
  27. {
  28. // the dentry is filesystem root or _ind MUST be non null
  29. assert(_ind || !_parent);
  30. if (!ind || S_ISDIR(ind->mode)) {
  31. flags.dir = 1;
  32. children = new std::list<dentry>;
  33. idx_children = new types::hash_map<name_type, dentry*>;
  34. }
  35. }
  36. int dentry::load()
  37. {
  38. if (!flags.dir || !S_ISDIR(ind->mode))
  39. return -ENOTDIR;
  40. size_t offset = 0;
  41. vfs* fs = ind->fs;
  42. while (true) {
  43. int ret = fs->readdir(ind, offset,
  44. [this](const char* name, size_t len, inode* ind, uint8_t) -> int {
  45. if (!len)
  46. append(ind, name);
  47. else
  48. append(ind, dentry::name_type(name, len));
  49. return GB_OK;
  50. });
  51. if (ret == 0)
  52. break;
  53. offset += ret;
  54. }
  55. flags.present = 1;
  56. return 0;
  57. }
  58. dentry* dentry::append(inode* ind, name_type name)
  59. {
  60. auto& ent = children->emplace_back(this, ind, name);
  61. idx_children->emplace(ent.name, &ent);
  62. return &ent;
  63. }
  64. dentry* dentry::find(const name_type& name)
  65. {
  66. if (!flags.dir)
  67. return nullptr;
  68. if (name[0] == '.') {
  69. if (!name[1])
  70. return this;
  71. if (name[1] == '.' && !name[2])
  72. return parent ? parent : this;
  73. }
  74. if (!flags.present) {
  75. int ret = load();
  76. if (ret != 0) {
  77. errno = -ret;
  78. return nullptr;
  79. }
  80. }
  81. auto iter = idx_children->find(name);
  82. if (!iter) {
  83. errno = ENOENT;
  84. return nullptr;
  85. }
  86. return iter->second;
  87. }
  88. dentry* dentry::replace(dentry* val)
  89. {
  90. // TODO: prevent the dirent to be swapped out of memory
  91. parent->idx_children->find(this->name)->second = val;
  92. return this;
  93. }
  94. void dentry::remove(const name_type& name)
  95. {
  96. for (auto iter = children->begin(); iter != children->end(); ++iter) {
  97. if (iter->name != name)
  98. continue;
  99. children->erase(iter);
  100. break;
  101. }
  102. idx_children->remove(name);
  103. }
  104. void dentry::path(
  105. const dentry& root, types::path &out_dst) const
  106. {
  107. const dentry* dents[32];
  108. int cnt = 0;
  109. const dentry* cur = this;
  110. while (cur != &root) {
  111. assert(cnt < 32);
  112. dents[cnt++] = cur;
  113. cur = cur->parent;
  114. }
  115. out_dst.append("/");
  116. for (int i = cnt - 1; i >= 0; --i)
  117. out_dst.append(dents[i]->name.c_str());
  118. }
  119. vfs::vfs()
  120. : _root { nullptr, nullptr, "" }
  121. {
  122. }
  123. fs::inode* vfs::cache_inode(size_t size, ino_t ino,
  124. mode_t mode, uid_t uid, gid_t gid)
  125. {
  126. auto [ iter, inserted ] =
  127. _inodes.try_emplace(ino, inode { ino, this, size, 0, mode, uid, gid });
  128. return &iter->second;
  129. }
  130. void vfs::free_inode(ino_t ino)
  131. {
  132. assert(_inodes.erase(ino) == 1);
  133. }
  134. fs::inode* vfs::get_inode(ino_t ino)
  135. {
  136. auto iter = _inodes.find(ino);
  137. // TODO: load inode from disk if not found
  138. if (iter)
  139. return &iter->second;
  140. else
  141. return nullptr;
  142. }
  143. void vfs::register_root_node(inode* root)
  144. {
  145. if (!_root.ind)
  146. _root.ind = root;
  147. }
  148. int vfs::mount(dentry* mnt, const char* source, const char* mount_point,
  149. const char* fstype, unsigned long flags, const void *data)
  150. {
  151. if (!mnt->flags.dir)
  152. return -ENOTDIR;
  153. vfs* new_fs;
  154. int ret = fs::create_fs(source, mount_point, fstype, flags, data, new_fs);
  155. if (ret != 0)
  156. return ret;
  157. auto* new_ent = new_fs->root();
  158. new_ent->parent = mnt->parent;
  159. new_ent->name = mnt->name;
  160. auto* orig_ent = mnt->replace(new_ent);
  161. _mount_recover_list.emplace(new_ent, orig_ent);
  162. return 0;
  163. }
  164. // default behavior is to
  165. // return -EINVAL to show that the operation
  166. // is not supported by the fs
  167. size_t vfs::read(inode*, char*, size_t, size_t, size_t)
  168. {
  169. return -EINVAL;
  170. }
  171. size_t vfs::write(inode*, const char*, size_t, size_t)
  172. {
  173. return -EINVAL;
  174. }
  175. int vfs::inode_mkfile(dentry*, const char*, mode_t)
  176. {
  177. return -EINVAL;
  178. }
  179. int vfs::inode_mknode(dentry*, const char*, mode_t, dev_t)
  180. {
  181. return -EINVAL;
  182. }
  183. int vfs::inode_rmfile(dentry*, const char*)
  184. {
  185. return -EINVAL;
  186. }
  187. int vfs::inode_mkdir(dentry*, const char*, mode_t)
  188. {
  189. return -EINVAL;
  190. }
  191. int vfs::symlink(dentry*, const char*, const char*)
  192. {
  193. return -EINVAL;
  194. }
  195. int vfs::inode_statx(dentry*, statx*, unsigned int)
  196. {
  197. return -EINVAL;
  198. }
  199. int vfs::inode_stat(dentry*, struct stat*)
  200. {
  201. return -EINVAL;
  202. }
  203. int vfs::dev_id(inode*, dev_t&)
  204. {
  205. return -EINVAL;
  206. }
  207. int vfs::readlink(inode*, char*, size_t)
  208. {
  209. return -EINVAL;
  210. }
  211. int vfs::truncate(inode*, size_t)
  212. {
  213. return -EINVAL;
  214. }
  215. fs::regular_file::regular_file(dentry* parent,
  216. file_flags flags, size_t cursor, inode* ind)
  217. : file(ind->mode, parent, flags), cursor(cursor), ind(ind) { }
  218. ssize_t fs::regular_file::read(char* __user buf, size_t n)
  219. {
  220. if (!flags.read)
  221. return -EBADF;
  222. if (S_ISDIR(ind->mode))
  223. return -EISDIR;
  224. // TODO: copy to user function !IMPORTANT
  225. ssize_t n_wrote = fs::vfs_read(ind, buf, n, cursor, n);
  226. if (n_wrote >= 0)
  227. cursor += n_wrote;
  228. return n_wrote;
  229. }
  230. ssize_t fs::regular_file::do_write(const char* __user buf, size_t n)
  231. {
  232. if (S_ISDIR(mode))
  233. return -EISDIR;
  234. // TODO: check privilege of user ptr
  235. ssize_t n_wrote = fs::vfs_write(ind, buf, cursor, n);
  236. if (n_wrote >= 0)
  237. cursor += n_wrote;
  238. return n_wrote;
  239. }
  240. ssize_t fs::regular_file::seek(off_t n, int whence)
  241. {
  242. if (!S_ISREG(mode))
  243. return -ESPIPE;
  244. size_t pos;
  245. switch (whence) {
  246. case SEEK_SET:
  247. pos = n;
  248. break;
  249. case SEEK_CUR:
  250. pos = cursor + n;
  251. break;
  252. case SEEK_END:
  253. pos = ind->size + n;
  254. break;
  255. default:
  256. return -EINVAL;
  257. }
  258. if (pos > ind->size)
  259. return -EINVAL;
  260. cursor = pos;
  261. return cursor;
  262. }
  263. int fs::regular_file::getdents(char* __user buf, size_t cnt)
  264. {
  265. if (!S_ISDIR(ind->mode))
  266. return -ENOTDIR;
  267. size_t orig_cnt = cnt;
  268. int nread = ind->fs->readdir(ind, cursor,
  269. [&buf, &cnt](const char* fn, size_t len, inode* ind, uint8_t type) {
  270. if (!len)
  271. len = strlen(fn);
  272. size_t reclen = sizeof(fs::user_dirent) + 1 + len;
  273. if (cnt < reclen)
  274. return GB_FAILED;
  275. auto* dirp = (fs::user_dirent*)buf;
  276. dirp->d_ino = ind->ino;
  277. dirp->d_reclen = reclen;
  278. // TODO: show offset
  279. // dirp->d_off = 0;
  280. // TODO: use copy_to_user
  281. memcpy(dirp->d_name, fn, len);
  282. buf[reclen - 2] = 0;
  283. buf[reclen - 1] = type;
  284. buf += reclen;
  285. cnt -= reclen;
  286. return GB_OK;
  287. });
  288. if (nread > 0)
  289. cursor += nread;
  290. return orig_cnt - cnt;
  291. }
  292. int fs::regular_file::getdents64(char* __user buf, size_t cnt)
  293. {
  294. if (!S_ISDIR(ind->mode))
  295. return -ENOTDIR;
  296. size_t orig_cnt = cnt;
  297. int nread = ind->fs->readdir(ind, cursor,
  298. [&buf, &cnt](const char* fn, size_t len, inode* ind, uint8_t type) {
  299. if (!len)
  300. len = strlen(fn);
  301. size_t reclen = sizeof(fs::user_dirent64) + len;
  302. if (cnt < reclen)
  303. return GB_FAILED;
  304. auto* dirp = (fs::user_dirent64*)buf;
  305. dirp->d_ino = ind->ino;
  306. dirp->d_off = 114514;
  307. dirp->d_reclen = reclen;
  308. dirp->d_type = type;
  309. // TODO: use copy_to_user
  310. memcpy(dirp->d_name, fn, len);
  311. buf[reclen - 1] = 0;
  312. buf += reclen;
  313. cnt -= reclen;
  314. return GB_OK;
  315. });
  316. if (nread > 0)
  317. cursor += nread;
  318. return orig_cnt - cnt;
  319. }
  320. fs::fifo_file::fifo_file(dentry* parent, file_flags flags,
  321. std::shared_ptr<fs::pipe> ppipe)
  322. : file(S_IFIFO, parent, flags), ppipe(ppipe) { }
  323. ssize_t fs::fifo_file::read(char* __user buf, size_t n)
  324. {
  325. if (!flags.read)
  326. return -EBADF;
  327. return ppipe->read(buf, n);
  328. }
  329. ssize_t fs::fifo_file::do_write(const char* __user buf, size_t n)
  330. {
  331. return ppipe->write(buf, n);
  332. }
  333. fs::fifo_file::~fifo_file()
  334. {
  335. assert(flags.read ^ flags.write);
  336. if (flags.read)
  337. ppipe->close_read();
  338. else
  339. ppipe->close_write();
  340. }
  341. static fs::blkdev_ops** blkdevs[256];
  342. static fs::chrdev_ops** chrdevs[256];
  343. size_t fs::vfs_read(fs::inode* file, char* buf, size_t buf_size, size_t offset, size_t n)
  344. {
  345. if (S_ISDIR(file->mode)) {
  346. errno = EISDIR;
  347. return -1U;
  348. }
  349. if (S_ISREG(file->mode))
  350. return file->fs->read(file, buf, buf_size, offset, n);
  351. if (S_ISBLK(file->mode) || S_ISCHR(file->mode)) {
  352. dev_t dev;
  353. if (file->fs->dev_id(file, dev) != 0) {
  354. errno = EINVAL;
  355. return -1U;
  356. }
  357. ssize_t ret;
  358. if (S_ISBLK(file->mode))
  359. ret = block_device_read(dev, buf, buf_size, offset, n);
  360. else
  361. ret = char_device_read(dev, buf, buf_size, n);
  362. if (ret < 0) {
  363. errno = -ret;
  364. return -1U;
  365. }
  366. return ret;
  367. }
  368. errno = EINVAL;
  369. return -1U;
  370. }
  371. size_t fs::vfs_write(fs::inode* file, const char* buf, size_t offset, size_t n)
  372. {
  373. if (S_ISDIR(file->mode)) {
  374. errno = EISDIR;
  375. return -1U;
  376. }
  377. if (S_ISREG(file->mode))
  378. return file->fs->write(file, buf, offset, n);
  379. if (S_ISBLK(file->mode) || S_ISCHR(file->mode)) {
  380. dev_t dev;
  381. if (file->fs->dev_id(file, dev) != 0) {
  382. errno = EINVAL;
  383. return -1U;
  384. }
  385. ssize_t ret;
  386. if (S_ISBLK(file->mode))
  387. ret = block_device_write(dev, buf, offset, n);
  388. else
  389. ret = char_device_write(dev, buf, n);
  390. if (ret < 0) {
  391. errno = -ret;
  392. return -1U;
  393. }
  394. return ret;
  395. }
  396. errno = EINVAL;
  397. return -1U;
  398. }
  399. int fs::vfs_mkfile(dentry* dir, const char* filename, mode_t mode)
  400. {
  401. return dir->ind->fs->inode_mkfile(dir, filename, mode);
  402. }
  403. int fs::vfs_mknode(dentry* dir, const char* filename, mode_t mode, dev_t dev)
  404. {
  405. return dir->ind->fs->inode_mknode(dir, filename, mode, dev);
  406. }
  407. int fs::vfs_rmfile(dentry* dir, const char* filename)
  408. {
  409. return dir->ind->fs->inode_rmfile(dir, filename);
  410. }
  411. int fs::vfs_mkdir(dentry* dir, const char* dirname, mode_t mode)
  412. {
  413. return dir->ind->fs->inode_mkdir(dir, dirname, mode);
  414. }
  415. dentry* fs::vfs_open(dentry& root, const types::path& path, bool follow, int recurs_no)
  416. {
  417. // too many recursive search layers will cause stack overflow
  418. // so we use 16 for now
  419. if (recurs_no >= 16)
  420. return nullptr;
  421. dentry* cur = &root;
  422. types::path curpath("/");
  423. for (const auto& item : path) {
  424. if (S_ISLNK(cur->ind->mode)) {
  425. char linkpath[256];
  426. int ret = cur->ind->fs->readlink(cur->ind, linkpath, sizeof(linkpath));
  427. // TODO: return error code
  428. if (ret < 0)
  429. return nullptr;
  430. curpath.remove_last();
  431. curpath.append(linkpath, ret);
  432. cur = fs::vfs_open(root, curpath, true, recurs_no+1);
  433. if (!cur)
  434. return nullptr;
  435. }
  436. if (item.empty())
  437. continue;
  438. cur = cur->find(item);
  439. if (!cur)
  440. return nullptr;
  441. curpath.append(item.c_str());
  442. }
  443. if (follow && S_ISLNK(cur->ind->mode)) {
  444. char linkpath[256];
  445. int ret = cur->ind->fs->readlink(cur->ind, linkpath, sizeof(linkpath));
  446. // TODO: return error code
  447. if (ret < 0)
  448. return nullptr;
  449. curpath.remove_last();
  450. curpath.append(linkpath, ret);
  451. cur = fs::vfs_open(root, curpath, true, recurs_no+1);
  452. if (!cur)
  453. return nullptr;
  454. }
  455. return cur;
  456. }
  457. int fs::vfs_stat(dentry* ent, statx* stat, unsigned int mask)
  458. {
  459. return ent->ind->fs->inode_statx(ent, stat, mask);
  460. }
  461. int fs::vfs_truncate(inode *file, size_t size)
  462. {
  463. return file->fs->truncate(file, size);
  464. }
  465. int fs::register_block_device(dev_t node, const fs::blkdev_ops& ops)
  466. {
  467. int major = NODE_MAJOR(node);
  468. int minor = NODE_MINOR(node);
  469. if (!blkdevs[major])
  470. blkdevs[major] = new blkdev_ops*[256] {};
  471. if (blkdevs[major][minor])
  472. return -EEXIST;
  473. blkdevs[major][minor] = new blkdev_ops { ops };
  474. return 0;
  475. }
  476. int fs::register_char_device(dev_t node, const fs::chrdev_ops& ops)
  477. {
  478. int major = NODE_MAJOR(node);
  479. int minor = NODE_MINOR(node);
  480. if (!chrdevs[major])
  481. chrdevs[major] = new chrdev_ops*[256] {};
  482. if (chrdevs[major][minor])
  483. return -EEXIST;
  484. chrdevs[major][minor] = new chrdev_ops { ops };
  485. return 0;
  486. }
  487. static std::map<std::string, fs::create_fs_func_t> fs_list;
  488. int fs::register_fs(const char* name, fs::create_fs_func_t func)
  489. {
  490. fs_list.emplace(name, func);
  491. return 0;
  492. }
  493. int fs::create_fs(const char* source, const char* mount_point, const char* fstype,
  494. unsigned long flags, const void* data, vfs*& out_vfs)
  495. {
  496. auto iter = fs_list.find(fstype);
  497. if (!iter)
  498. return -ENODEV;
  499. auto& [ _, func ] = *iter;
  500. if (!(flags & MS_NOATIME))
  501. flags |= MS_RELATIME;
  502. if (flags & MS_STRICTATIME)
  503. flags &= ~(MS_RELATIME | MS_NOATIME);
  504. vfs* created_vfs = func(source, flags, data);
  505. mount_data mnt_data {
  506. .source = source,
  507. .mount_point = mount_point,
  508. .fstype = fstype,
  509. .flags = flags,
  510. };
  511. mounts.emplace(created_vfs, mnt_data);
  512. out_vfs = created_vfs;
  513. return 0;
  514. }
  515. // MBR partition table, used by partprobe()
  516. struct PACKED mbr_part_entry {
  517. uint8_t attr;
  518. uint8_t chs_start[3];
  519. uint8_t type;
  520. uint8_t chs_end[3];
  521. uint32_t lba_start;
  522. uint32_t cnt;
  523. };
  524. struct PACKED mbr {
  525. uint8_t code[440];
  526. uint32_t signature;
  527. uint16_t reserved;
  528. mbr_part_entry parts[4];
  529. uint16_t magic;
  530. };
  531. // TODO: devtmpfs
  532. static int mbr_part_probe(dev_t node)
  533. {
  534. mbr buf_mbr;
  535. int ret = fs::block_device_read(node, (char*)&buf_mbr, sizeof(mbr), 0, 512);
  536. if (ret < 0)
  537. return -EIO;
  538. int n = 1;
  539. for (const auto& part : buf_mbr.parts) {
  540. if (n >= 16)
  541. break;
  542. if (!part.type)
  543. continue;
  544. std::size_t part_offset = part.lba_start * 512;
  545. // TODO: add partition offset limit
  546. fs::register_block_device(node + n, {
  547. [=](char* buf, size_t buf_size, size_t offset, size_t n) -> ssize_t {
  548. offset += part_offset;
  549. return fs::block_device_read(node, buf, buf_size, offset, n);
  550. },
  551. [=](const char* buf, size_t offset, size_t n) -> ssize_t {
  552. offset += part_offset;
  553. return fs::block_device_write(node, buf, offset, n);
  554. }
  555. });
  556. ++n;
  557. }
  558. return 0;
  559. }
  560. void fs::partprobe()
  561. {
  562. for (int i = 0; i < 256; i += 16) {
  563. int ret = mbr_part_probe(make_device(8, i));
  564. if (ret != 0)
  565. continue;
  566. kmsgf("[info] found disk drive sd%c\n", 'a' + (i / 16));
  567. }
  568. }
  569. ssize_t fs::block_device_read(dev_t node, char* buf, size_t buf_size, size_t offset, size_t n)
  570. {
  571. int major = NODE_MAJOR(node);
  572. int minor = NODE_MINOR(node);
  573. if (!blkdevs[major] || !blkdevs[major][minor])
  574. return -EINVAL;
  575. auto& read = blkdevs[major][minor]->read;
  576. if (!read)
  577. return -EINVAL;
  578. return read(buf, buf_size, offset, n);
  579. }
  580. ssize_t fs::block_device_write(dev_t node, const char* buf, size_t offset, size_t n)
  581. {
  582. int major = NODE_MAJOR(node);
  583. int minor = NODE_MINOR(node);
  584. if (!blkdevs[major] || !blkdevs[major][minor])
  585. return -EINVAL;
  586. auto& write = blkdevs[major][minor]->write;
  587. if (!write)
  588. return -EINVAL;
  589. return write(buf, offset, n);
  590. }
  591. ssize_t fs::char_device_read(dev_t node, char* buf, size_t buf_size, size_t n)
  592. {
  593. int major = NODE_MAJOR(node);
  594. int minor = NODE_MINOR(node);
  595. if (!chrdevs[major] || !chrdevs[major][minor])
  596. return -EINVAL;
  597. auto& read = chrdevs[major][minor]->read;
  598. if (!read)
  599. return -EINVAL;
  600. return read(buf, buf_size, n);
  601. }
  602. ssize_t fs::char_device_write(dev_t node, const char* buf, size_t n)
  603. {
  604. int major = NODE_MAJOR(node);
  605. int minor = NODE_MINOR(node);
  606. if (!chrdevs[major] || !chrdevs[major][minor])
  607. return -EINVAL;
  608. auto& write = chrdevs[major][minor]->write;
  609. if (!write)
  610. return -EINVAL;
  611. return write(buf, n);
  612. }
  613. ssize_t b_null_read(char*, size_t, size_t)
  614. {
  615. return 0;
  616. }
  617. ssize_t b_null_write(const char*, size_t n)
  618. {
  619. return n;
  620. }
  621. static ssize_t console_read(char* buf, size_t buf_size, size_t n)
  622. {
  623. return console->read(buf, buf_size, n);
  624. }
  625. static ssize_t console_write(const char* buf, size_t n)
  626. {
  627. size_t orig_n = n;
  628. while (n--)
  629. console->putchar(*(buf++));
  630. return orig_n;
  631. }
  632. fs::pipe::pipe(void)
  633. : buf { PIPE_SIZE }
  634. , flags { READABLE | WRITABLE }
  635. {
  636. }
  637. void fs::pipe::close_read(void)
  638. {
  639. if (1) {
  640. kernel::async::lock_guard lck(mtx);
  641. flags &= (~READABLE);
  642. }
  643. waitlist.notify_all();
  644. }
  645. void fs::pipe::close_write(void)
  646. {
  647. if (1) {
  648. kernel::async::lock_guard lck(mtx);
  649. flags &= (~WRITABLE);
  650. }
  651. waitlist.notify_all();
  652. }
  653. int fs::pipe::write(const char* buf, size_t n)
  654. {
  655. // TODO: check privilege
  656. // TODO: check EPIPE
  657. if (1) {
  658. kernel::async::lock_guard lck(mtx);
  659. if (!is_readable()) {
  660. current_thread->send_signal(SIGPIPE);
  661. return -EPIPE;
  662. }
  663. while (this->buf.avail() < n) {
  664. bool interrupted = waitlist.wait(mtx);
  665. if (interrupted)
  666. return -EINTR;
  667. if (!is_readable()) {
  668. current_thread->send_signal(SIGPIPE);
  669. return -EPIPE;
  670. }
  671. }
  672. for (size_t i = 0; i < n; ++i)
  673. this->buf.put(*(buf++));
  674. }
  675. waitlist.notify_all();
  676. return n;
  677. }
  678. int fs::pipe::read(char* buf, size_t n)
  679. {
  680. // TODO: check privilege
  681. if (1) {
  682. kernel::async::lock_guard lck(mtx);
  683. if (!is_writeable()) {
  684. size_t orig_n = n;
  685. while (!this->buf.empty() && n) {
  686. --n;
  687. *(buf++) = this->buf.get();
  688. }
  689. return orig_n - n;
  690. }
  691. while (this->buf.size() < n) {
  692. bool interrupted = waitlist.wait(mtx);
  693. if (interrupted)
  694. return -EINTR;
  695. if (!is_writeable()) {
  696. size_t orig_n = n;
  697. while (!this->buf.empty() && n) {
  698. --n;
  699. *(buf++) = this->buf.get();
  700. }
  701. return orig_n - n;
  702. }
  703. }
  704. for (size_t i = 0; i < n; ++i)
  705. *(buf++) = this->buf.get();
  706. }
  707. waitlist.notify_all();
  708. return n;
  709. }
  710. SECTION(".text.kinit")
  711. void init_vfs(void)
  712. {
  713. using namespace fs;
  714. // null
  715. register_char_device(make_device(1, 0), { b_null_read, b_null_write });
  716. // console (supports serial console only for now)
  717. // TODO: add interface to bind console device to other devices
  718. register_char_device(make_device(2, 0), { console_read, console_write });
  719. // register tmpfs
  720. fs::register_tmpfs();
  721. vfs* rootfs;
  722. int ret = create_fs("none", "/", "tmpfs", MS_NOATIME, nullptr, rootfs);
  723. assert(ret == 0);
  724. fs_root = rootfs->root();
  725. }