shim_fs.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669
  1. /* Copyright (C) 2014 Stony Brook University
  2. This file is part of Graphene Library OS.
  3. Graphene Library OS is free software: you can redistribute it and/or
  4. modify it under the terms of the GNU Lesser General Public License
  5. as published by the Free Software Foundation, either version 3 of the
  6. License, or (at your option) any later version.
  7. Graphene Library OS is distributed in the hope that it will be useful,
  8. but WITHOUT ANY WARRANTY; without even the implied warranty of
  9. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  10. GNU Lesser General Public License for more details.
  11. You should have received a copy of the GNU Lesser General Public License
  12. along with this program. If not, see <http://www.gnu.org/licenses/>. */
  13. /*
  14. * shim_fs.c
  15. *
  16. * This file contains codes for creating filesystems in library OS.
  17. */
  18. #include <linux/fcntl.h>
  19. #include <list.h>
  20. #include <pal.h>
  21. #include <pal_debug.h>
  22. #include <pal_error.h>
  23. #include <shim_checkpoint.h>
  24. #include <shim_fs.h>
  25. #include <shim_internal.h>
  26. #include <shim_utils.h>
  27. struct shim_fs {
  28. char name[8];
  29. struct shim_fs_ops* fs_ops;
  30. struct shim_d_ops* d_ops;
  31. };
  32. #define NUM_MOUNTABLE_FS 3
  33. struct shim_fs mountable_fs[NUM_MOUNTABLE_FS] = {
  34. {
  35. .name = "chroot",
  36. .fs_ops = &chroot_fs_ops,
  37. .d_ops = &chroot_d_ops,
  38. },
  39. {
  40. .name = "proc",
  41. .fs_ops = &proc_fs_ops,
  42. .d_ops = &proc_d_ops,
  43. },
  44. {
  45. .name = "dev",
  46. .fs_ops = &dev_fs_ops,
  47. .d_ops = &dev_d_ops,
  48. },
  49. };
  50. #define NUM_BUILTIN_FS 5
  51. struct shim_mount* builtin_fs[NUM_BUILTIN_FS] = {
  52. &chroot_builtin_fs,
  53. &pipe_builtin_fs,
  54. &socket_builtin_fs,
  55. &epoll_builtin_fs,
  56. &eventfd_builtin_fs,
  57. };
  58. static struct shim_lock mount_mgr_lock;
  59. #define SYSTEM_LOCK() lock(&mount_mgr_lock)
  60. #define SYSTEM_UNLOCK() unlock(&mount_mgr_lock)
  61. #define MOUNT_MGR_ALLOC 64
  62. #define OBJ_TYPE struct shim_mount
  63. #include <memmgr.h>
  64. static MEM_MGR mount_mgr = NULL;
  65. DEFINE_LISTP(shim_mount);
  66. /* Links to mount->list */
  67. static LISTP_TYPE(shim_mount) mount_list;
  68. static struct shim_lock mount_list_lock;
  69. int init_fs(void) {
  70. mount_mgr = create_mem_mgr(init_align_up(MOUNT_MGR_ALLOC));
  71. if (!mount_mgr)
  72. return -ENOMEM;
  73. create_lock(&mount_mgr_lock);
  74. create_lock(&mount_list_lock);
  75. return 0;
  76. }
  77. static struct shim_mount* alloc_mount(void) {
  78. return get_mem_obj_from_mgr_enlarge(mount_mgr, size_align_up(MOUNT_MGR_ALLOC));
  79. }
  80. static bool mount_migrated = false;
  81. static int __mount_root(struct shim_dentry** root) {
  82. char type[CONFIG_MAX];
  83. char uri[CONFIG_MAX];
  84. int ret = 0;
  85. if (root_config && get_config(root_config, "fs.root.type", type, sizeof(type)) > 0 &&
  86. get_config(root_config, "fs.root.uri", uri, sizeof(uri)) > 0) {
  87. debug("mounting root filesystem: %s from %s\n", type, uri);
  88. if ((ret = mount_fs(type, uri, "/", NULL, root, 0)) < 0) {
  89. debug("mounting root filesystem failed (%d)\n", ret);
  90. return ret;
  91. }
  92. return ret;
  93. }
  94. debug("mounting default root filesystem\n");
  95. if ((ret = mount_fs("chroot", URI_PREFIX_FILE, "/", NULL, root, 0)) < 0) {
  96. debug("mounting root filesystem failed (%d)\n", ret);
  97. }
  98. return ret;
  99. }
  100. static int __mount_sys(struct shim_dentry* root) {
  101. int ret;
  102. debug("mounting as proc filesystem: /proc\n");
  103. if ((ret = mount_fs("proc", NULL, "/proc", root, NULL, 0)) < 0) {
  104. debug("mounting proc filesystem failed (%d)\n", ret);
  105. return ret;
  106. }
  107. debug("mounting as dev filesystem: /dev\n");
  108. struct shim_dentry* dev_dent = NULL;
  109. if ((ret = mount_fs("dev", NULL, "/dev", root, &dev_dent, 0)) < 0) {
  110. debug("mounting dev filesystem failed (%d)\n", ret);
  111. return ret;
  112. }
  113. debug("mounting as chroot filesystem: from dev:tty to /dev\n");
  114. if ((ret = mount_fs("chroot", URI_PREFIX_DEV "tty", "/dev/tty", dev_dent, NULL, 0)) < 0) {
  115. debug("mounting terminal device failed (%d)\n", ret);
  116. return ret;
  117. }
  118. return 0;
  119. }
  120. static int __mount_one_other(const char* key, int keylen) {
  121. if (!root_config)
  122. return 0;
  123. char k[CONFIG_MAX];
  124. char p[CONFIG_MAX];
  125. char u[CONFIG_MAX];
  126. char t[CONFIG_MAX];
  127. char* uri = NULL;
  128. int ret;
  129. memcpy(k, "fs.mount.", 9);
  130. memcpy(k + 9, key, keylen);
  131. char* kp = k + 9 + keylen;
  132. memcpy(kp, ".path", 6);
  133. if (get_config(root_config, k, p, sizeof(p)) <= 0)
  134. return -EINVAL;
  135. memcpy(kp, ".type", 6);
  136. if (get_config(root_config, k, t, sizeof(t)) <= 0)
  137. return -EINVAL;
  138. memcpy(kp, ".uri", 5);
  139. if (get_config(root_config, k, u, sizeof(u)) > 0)
  140. uri = u;
  141. debug("mounting as %s filesystem: from %s to %s\n", t, uri, p);
  142. if ((ret = mount_fs(t, uri, p, NULL, NULL, 1)) < 0) {
  143. debug("mounting %s on %s (type=%s) failed (%d)\n", uri, p, t, -ret);
  144. return ret;
  145. }
  146. return 0;
  147. }
  148. static int __mount_others(void) {
  149. char* keybuf;
  150. int ret = 0;
  151. if (!root_config)
  152. return 0;
  153. int nkeys;
  154. ssize_t keybuf_size;
  155. keybuf_size = get_config_entries_size(root_config, "fs.mount");
  156. if (keybuf_size < 0)
  157. return 0;
  158. keybuf = malloc(keybuf_size);
  159. if (!keybuf)
  160. return -ENOMEM;
  161. nkeys = get_config_entries(root_config, "fs.mount", keybuf, keybuf_size);
  162. if (nkeys <= 0)
  163. goto out;
  164. const char *key = keybuf;
  165. const char *next = NULL;
  166. for (int n = 0; n < nkeys; key = next, n++) {
  167. for (next = key; *next; next++)
  168. ;
  169. next++;
  170. ret = __mount_one_other(key, next - key - 1);
  171. if (ret < 0)
  172. goto out;
  173. }
  174. out:
  175. free(keybuf);
  176. return ret;
  177. }
  178. int init_mount_root(void) {
  179. if (mount_migrated)
  180. return 0;
  181. int ret;
  182. struct shim_dentry* root = NULL;
  183. if ((ret = __mount_root(&root)) < 0)
  184. return ret;
  185. if ((ret = __mount_sys(root)) < 0)
  186. return ret;
  187. return 0;
  188. }
  189. int init_mount(void) {
  190. if (mount_migrated)
  191. return 0;
  192. int ret;
  193. if ((ret = __mount_others()) < 0)
  194. return ret;
  195. return 0;
  196. }
  197. static inline struct shim_fs* find_fs(const char* type) {
  198. struct shim_fs* fs = NULL;
  199. size_t len = strlen(type);
  200. for (int i = 0; i < NUM_MOUNTABLE_FS; i++)
  201. if (!memcmp(type, mountable_fs[i].name, len + 1)) {
  202. fs = &mountable_fs[i];
  203. break;
  204. }
  205. return fs;
  206. }
  207. int search_builtin_fs(const char* type, struct shim_mount** fs) {
  208. size_t len = strlen(type);
  209. for (int i = 0; i < NUM_BUILTIN_FS; i++)
  210. if (!memcmp(type, builtin_fs[i]->type, len + 1)) {
  211. *fs = builtin_fs[i];
  212. return 0;
  213. }
  214. return -ENOENT;
  215. }
  216. int __mount_fs(struct shim_mount* mount, struct shim_dentry* dent) {
  217. int ret = 0;
  218. dent->state |= DENTRY_MOUNTPOINT;
  219. get_dentry(dent);
  220. mount->mount_point = dent;
  221. dent->mounted = mount;
  222. struct shim_dentry* mount_root = mount->root;
  223. if (!mount_root) {
  224. /* mount_root->state |= DENTRY_VALID; */
  225. mount_root = get_new_dentry(mount, NULL, "", 0, NULL);
  226. assert(mount->d_ops && mount->d_ops->lookup);
  227. ret = mount->d_ops->lookup(mount_root);
  228. if (ret < 0) {
  229. /* Try getting rid of ESKIPPED case */
  230. assert(ret != -ESKIPPED);
  231. put_dentry(mount_root);
  232. return ret;
  233. }
  234. mount->root = mount_root;
  235. }
  236. /* DEP 7/1/17: If the mount is a directory, make sure the mount
  237. * point is marked as a directory */
  238. if (mount_root->state & DENTRY_ISDIRECTORY)
  239. dent->state |= DENTRY_ISDIRECTORY;
  240. /* DEP 6/16/17: In the dcache redesign, we don't use the *REACHABLE flags, but
  241. * leaving this commented for documentation, in case there is a problem
  242. * I over-simplified */
  243. // mount_root->state |= dent->state & (DENTRY_REACHABLE|DENTRY_UNREACHABLE);
  244. /* DEP 6/16/17: In the dcache redesign, I don't believe we need to manually
  245. * rehash the path; this should be handled by get_new_dentry, or already be
  246. * hashed if mount_root exists. I'm going to leave this line here for now
  247. * as documentation in case there is a problem later.
  248. */
  249. //__add_dcache(mount_root, &mount->path.hash);
  250. if ((ret = __del_dentry_tree(dent)) < 0)
  251. return ret;
  252. lock(&mount_list_lock);
  253. get_mount(mount);
  254. LISTP_ADD_TAIL(mount, &mount_list, list);
  255. unlock(&mount_list_lock);
  256. do {
  257. struct shim_dentry* parent = dent->parent;
  258. if (dent->state & DENTRY_ANCESTOR) {
  259. put_dentry(dent);
  260. break;
  261. }
  262. dent->state |= DENTRY_ANCESTOR;
  263. if (parent)
  264. get_dentry(parent);
  265. put_dentry(dent);
  266. dent = parent;
  267. } while (dent);
  268. return 0;
  269. }
  270. /* Extracts the last component of the `path`. If there's none, `*last_elem_len` is set to 0 and
  271. * `*last_elem` is set to NULL. */
  272. static void find_last_component(const char* path, const char** last_comp, size_t* last_comp_len) {
  273. *last_comp = NULL;
  274. size_t last_len = 0;
  275. size_t path_len = strlen(path);
  276. if (path_len == 0)
  277. goto out;
  278. // Drop any trailing slashes.
  279. const char* last = path + path_len - 1;
  280. while (last > path && *last == '/')
  281. last--;
  282. if (*last == '/')
  283. goto out;
  284. // Skip the last component.
  285. last_len = 1;
  286. while (last > path && *(last - 1) != '/') {
  287. last--;
  288. last_len++;
  289. }
  290. *last_comp = last;
  291. out:
  292. *last_comp_len = last_len;
  293. }
  294. /* Parent is optional, but helpful.
  295. * dentp (optional) memoizes the dentry of the newly-mounted FS, on success.
  296. *
  297. * The make_ancestor flag creates pseudo-dentries for any missing paths (passed to __path_lookupat).
  298. * This is only intended for use to connect mounts specified in the manifest when an intervening
  299. * path is missing.
  300. */
  301. int mount_fs(const char* type, const char* uri, const char* mount_point, struct shim_dentry* parent,
  302. struct shim_dentry** dentp, bool make_ancestor) {
  303. int ret = 0;
  304. struct shim_fs* fs = find_fs(type);
  305. if (!fs || !fs->fs_ops || !fs->fs_ops->mount) {
  306. ret = -ENODEV;
  307. goto out;
  308. }
  309. /* Split the mount point into the prefix and atom */
  310. size_t mount_point_len = strlen(mount_point);
  311. if (mount_point_len == 0) {
  312. ret = -EINVAL;
  313. goto out;
  314. }
  315. const char* last;
  316. size_t last_len;
  317. find_last_component(mount_point, &last, &last_len);
  318. if (!parent) {
  319. // See if we are not at the root mount
  320. if (last_len > 0) {
  321. // Look up the parent
  322. size_t parent_len = last - mount_point;
  323. char* parent_path = __alloca(parent_len + 1);
  324. memcpy(parent_path, mount_point, parent_len);
  325. parent_path[parent_len] = 0;
  326. if ((ret = __path_lookupat(dentry_root, parent_path, 0, &parent, 0, dentry_root->fs,
  327. make_ancestor)) < 0) {
  328. debug("Path lookup failed %d\n", ret);
  329. goto out;
  330. }
  331. }
  332. }
  333. if (parent && last_len > 0) {
  334. /* Newly created dentry's relative path will be a concatenation of parent
  335. * + last strings (see get_new_dentry), make sure it fits into qstr */
  336. if (parent->rel_path.len + 1 + last_len >= STR_SIZE) { /* +1 for '/' */
  337. debug("Relative path exceeds the limit %d\n", STR_SIZE);
  338. ret = -ENAMETOOLONG;
  339. goto out;
  340. }
  341. }
  342. lock(&dcache_lock);
  343. struct shim_mount* mount = alloc_mount();
  344. void* mount_data = NULL;
  345. /* call fs-specific mount to allocate mount_data */
  346. if ((ret = fs->fs_ops->mount(uri, &mount_data)) < 0)
  347. goto out_with_unlock;
  348. size_t uri_len = uri ? strlen(uri) : 0;
  349. qstrsetstr(&mount->path, mount_point, mount_point_len);
  350. qstrsetstr(&mount->uri, uri, uri_len);
  351. memcpy(mount->type, fs->name, sizeof(fs->name));
  352. mount->fs_ops = fs->fs_ops;
  353. mount->d_ops = fs->d_ops;
  354. mount->data = mount_data;
  355. /* Get the negative dentry from the cache, if one exists */
  356. struct shim_dentry* dent;
  357. struct shim_dentry* dent2;
  358. /* Special case the root */
  359. if (last_len == 0)
  360. dent = dentry_root;
  361. else {
  362. dent = __lookup_dcache(parent, last, last_len, NULL);
  363. if (!dent) {
  364. dent = get_new_dentry(mount, parent, last, last_len, NULL);
  365. }
  366. }
  367. assert(dent == dentry_root || !(dent->state & DENTRY_VALID));
  368. // We need to fix up the relative path to this mount, but only for
  369. // directories.
  370. qstrsetstr(&dent->rel_path, "", 0);
  371. mount->path.hash = dent->rel_path.hash;
  372. /*Now go ahead and do a lookup so the dentry is valid */
  373. if ((ret = __path_lookupat(dentry_root, mount_point, 0, &dent2, 0, parent ? parent->fs : mount,
  374. make_ancestor)) < 0)
  375. goto out_with_unlock;
  376. assert(dent == dent2);
  377. /* We want the net impact of mounting to increment the ref count on the
  378. * entry (until the unmount). But we shouldn't also hold the reference on
  379. * dent from the validation step. Drop it here */
  380. put_dentry(dent2);
  381. ret = __mount_fs(mount, dent);
  382. // If we made it this far and the dentry is still negative, clear
  383. // the negative flag from the denry.
  384. if (!ret && (dent->state & DENTRY_NEGATIVE))
  385. dent->state &= ~DENTRY_NEGATIVE;
  386. /* Set the file system at the mount point properly */
  387. dent->fs = mount;
  388. if (dentp && !ret)
  389. *dentp = dent;
  390. out_with_unlock:
  391. unlock(&dcache_lock);
  392. out:
  393. return ret;
  394. }
  395. void get_mount(struct shim_mount* mount) {
  396. REF_INC(mount->ref_count);
  397. }
  398. void put_mount(struct shim_mount* mount) {
  399. REF_DEC(mount->ref_count);
  400. }
  401. int walk_mounts(int (*walk)(struct shim_mount* mount, void* arg), void* arg) {
  402. struct shim_mount* mount;
  403. struct shim_mount* n;
  404. int ret = 0;
  405. int nsrched = 0;
  406. lock(&mount_list_lock);
  407. LISTP_FOR_EACH_ENTRY_SAFE(mount, n, &mount_list, list) {
  408. if ((ret = (*walk)(mount, arg)) < 0)
  409. break;
  410. if (ret > 0)
  411. nsrched++;
  412. }
  413. unlock(&mount_list_lock);
  414. return ret < 0 ? ret : (nsrched ? 0 : -ESRCH);
  415. }
  416. struct shim_mount* find_mount_from_uri(const char* uri) {
  417. struct shim_mount* mount;
  418. struct shim_mount* found = NULL;
  419. size_t longest_path = 0;
  420. lock(&mount_list_lock);
  421. LISTP_FOR_EACH_ENTRY(mount, &mount_list, list) {
  422. if (qstrempty(&mount->uri))
  423. continue;
  424. if (!memcmp(qstrgetstr(&mount->uri), uri, mount->uri.len) && uri[mount->uri.len] == '/') {
  425. if (mount->path.len > longest_path) {
  426. longest_path = mount->path.len;
  427. found = mount;
  428. }
  429. }
  430. }
  431. if (found)
  432. get_mount(found);
  433. unlock(&mount_list_lock);
  434. return found;
  435. }
  436. BEGIN_CP_FUNC(mount) {
  437. __UNUSED(size);
  438. assert(size == sizeof(struct shim_mount));
  439. struct shim_mount* mount = (struct shim_mount*)obj;
  440. struct shim_mount* new_mount = NULL;
  441. ptr_t off = GET_FROM_CP_MAP(obj);
  442. if (!off) {
  443. off = ADD_CP_OFFSET(sizeof(struct shim_mount));
  444. ADD_TO_CP_MAP(obj, off);
  445. mount->cpdata = NULL;
  446. if (mount->fs_ops && mount->fs_ops->checkpoint) {
  447. void* cpdata = NULL;
  448. int bytes = mount->fs_ops->checkpoint(&cpdata, mount->data);
  449. if (bytes > 0) {
  450. mount->cpdata = cpdata;
  451. mount->cpsize = bytes;
  452. }
  453. }
  454. new_mount = (struct shim_mount*)(base + off);
  455. *new_mount = *mount;
  456. if (mount->cpdata) {
  457. struct shim_mem_entry* entry;
  458. DO_CP_SIZE(memory, mount->cpdata, mount->cpsize, &entry);
  459. new_mount->cpdata = NULL;
  460. entry->paddr = &new_mount->cpdata;
  461. }
  462. new_mount->data = NULL;
  463. new_mount->mount_point = NULL;
  464. new_mount->root = NULL;
  465. INIT_LIST_HEAD(new_mount, list);
  466. DO_CP_IN_MEMBER(qstr, new_mount, path);
  467. DO_CP_IN_MEMBER(qstr, new_mount, uri);
  468. if (mount->mount_point)
  469. DO_CP_MEMBER(dentry, mount, new_mount, mount_point);
  470. if (mount->root)
  471. DO_CP_MEMBER(dentry, mount, new_mount, root);
  472. ADD_CP_FUNC_ENTRY(off);
  473. } else {
  474. new_mount = (struct shim_mount*)(base + off);
  475. }
  476. if (objp)
  477. *objp = (void*)new_mount;
  478. }
  479. END_CP_FUNC(mount)
  480. BEGIN_RS_FUNC(mount) {
  481. __UNUSED(offset);
  482. struct shim_mount* mount = (void*)(base + GET_CP_FUNC_ENTRY());
  483. CP_REBASE(mount->cpdata);
  484. CP_REBASE(mount->list);
  485. CP_REBASE(mount->mount_point);
  486. CP_REBASE(mount->root);
  487. struct shim_fs* fs = find_fs(mount->type);
  488. if (fs && fs->fs_ops && fs->fs_ops->migrate && mount->cpdata) {
  489. void* mount_data = NULL;
  490. if (fs->fs_ops->migrate(mount->cpdata, &mount_data) == 0)
  491. mount->data = mount_data;
  492. mount->cpdata = NULL;
  493. }
  494. mount->fs_ops = fs->fs_ops;
  495. mount->d_ops = fs->d_ops;
  496. LISTP_ADD_TAIL(mount, &mount_list, list);
  497. if (!qstrempty(&mount->path)) {
  498. DEBUG_RS("type=%s,uri=%s,path=%s", mount->type, qstrgetstr(&mount->uri),
  499. qstrgetstr(&mount->path));
  500. } else {
  501. DEBUG_RS("type=%s,uri=%s", mount->type, qstrgetstr(&mount->uri));
  502. }
  503. }
  504. END_RS_FUNC(mount)
  505. BEGIN_CP_FUNC(all_mounts) {
  506. __UNUSED(obj);
  507. __UNUSED(size);
  508. __UNUSED(objp);
  509. struct shim_mount* mount;
  510. lock(&mount_list_lock);
  511. LISTP_FOR_EACH_ENTRY(mount, &mount_list, list) {
  512. DO_CP(mount, mount, NULL);
  513. }
  514. unlock(&mount_list_lock);
  515. /* add an empty entry to mark as migrated */
  516. ADD_CP_FUNC_ENTRY(0UL);
  517. }
  518. END_CP_FUNC(all_mounts)
  519. BEGIN_RS_FUNC(all_mounts) {
  520. __UNUSED(entry);
  521. __UNUSED(base);
  522. __UNUSED(offset);
  523. __UNUSED(rebase);
  524. /* to prevent file system from being mount again */
  525. mount_migrated = true;
  526. }
  527. END_RS_FUNC(all_mounts)
  528. const char* get_file_name(const char* path, size_t len) {
  529. const char* c = path + len - 1;
  530. while (c > path && *c != '/')
  531. c--;
  532. return *c == '/' ? c + 1 : c;
  533. }