shim_namei.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817
  1. /* -*- mode:c; c-file-style:"k&r"; c-basic-offset: 4; tab-width:4; indent-tabs-mode:nil; mode:auto-fill; fill-column:78; -*- */
  2. /* vim: set ts=4 sw=4 et tw=78 fo=cqt wm=0: */
  3. /* Copyright (C) 2017, University of North Carolina at Chapel Hill
  4. and Fortanix, Inc.
  5. This file is part of Graphene Library OS.
  6. Graphene Library OS is free software: you can redistribute it and/or
  7. modify it under the terms of the GNU Lesser General Public License
  8. as published by the Free Software Foundation, either version 3 of the
  9. License, or (at your option) any later version.
  10. Graphene Library OS is distributed in the hope that it will be useful,
  11. but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. GNU Lesser General Public License for more details.
  14. You should have received a copy of the GNU Lesser General Public License
  15. along with this program. If not, see <http://www.gnu.org/licenses/>. */
  16. /*
  17. * shim_namei.c
  18. *
  19. * This file contains codes for parsing a FS path and looking up in the
  20. * directory cache.
  21. */
  22. #include <stdbool.h>
  23. #include <shim_internal.h>
  24. #include <shim_utils.h>
  25. #include <shim_thread.h>
  26. #include <shim_handle.h>
  27. #include <shim_fs.h>
  28. #include <shim_profile.h>
  29. #include <pal.h>
  30. #include <linux/stat.h>
  31. #include <linux/fcntl.h>
  32. #include <asm/fcntl.h>
  33. /* Advances a char pointer (string) past any repeated slashes and returns the result.
  34. * Must be a null-terminated string. */
  35. static inline const char * eat_slashes (const char * string)
  36. {
  37. while (*string == '/' && *string != '\0') string++;
  38. return string;
  39. }
  40. static inline int __lookup_flags (int flags)
  41. {
  42. int retval = LOOKUP_FOLLOW;
  43. if (flags & O_NOFOLLOW)
  44. retval &= ~LOOKUP_FOLLOW;
  45. if ((flags & (O_CREAT|O_EXCL)) == (O_CREAT|O_EXCL))
  46. retval &= ~LOOKUP_FOLLOW;
  47. if (flags & O_DIRECTORY)
  48. retval |= LOOKUP_DIRECTORY;
  49. return retval;
  50. }
  51. /* check permission (specified by mask) of a dentry. If force is not set,
  52. * permission is considered granted on invalid dentries
  53. *
  54. * mask is the same as mode in the manual for access(2): F_OK, R_OK, W_OK,
  55. * X_OK
  56. *
  57. * Returns 0 on success, negative on failure.
  58. */
  59. /* Assume caller has acquired dcache_lock */
  60. int permission (struct shim_dentry * dent, int mask, bool force) {
  61. mode_t mode = 0;
  62. /* Pseudo dentries don't really have permssions. I wonder if
  63. * we could tighten up the range of allowed calls.
  64. */
  65. if (dent->state & DENTRY_ANCESTOR)
  66. return 0;
  67. if (dent->state & DENTRY_NEGATIVE)
  68. return -ENOENT;
  69. /* At this point, we can just return zero if we are only
  70. * checking F_OK (the dentry isn't negative). */
  71. if (mask == F_OK)
  72. return 0;
  73. /* A dentry may not have the mode stored. The original code
  74. * used both NO_MODE and !DENTRY_VALID; let's try to consolidate to
  75. * just NO_MODE.
  76. */
  77. if (dent->mode == NO_MODE) {
  78. /* DEP 6/16/17: This semantic seems risky to me */
  79. if (!force)
  80. return 0;
  81. /* DEP 6/16/17: I don't think we should be defaulting to 0 if
  82. * there isn't a mode function. */
  83. assert(dent->fs);
  84. assert(dent->fs->d_ops);
  85. assert(dent->fs->d_ops->mode);
  86. /* Fall back to the low-level file system */
  87. int err = dent->fs->d_ops->mode(dent, &mode, force);
  88. /*
  89. * DEP 6/16/17: I think the low-level file system should be
  90. * setting modes, rather than defaulting to open here.
  91. * I'm ok with a file system that doesn't care setting the
  92. * permission to all.
  93. *
  94. * Set an assertion here to catch these cases in debugging.
  95. */
  96. assert(err != -ESKIPPED);
  97. if (err < 0)
  98. return err;
  99. dent->mode = mode;
  100. }
  101. mode = dent->mode;
  102. if (((mode >> 6) & mask) == mask)
  103. return 0;
  104. return -EACCES;
  105. }
  106. /*
  107. * This function looks up a single dentry based on its parent dentry pointer
  108. * and the name. Namelen is the length of char * name.
  109. * The dentry is returned in pointer *new. The refcount of new is incremented
  110. * by one.
  111. *
  112. * Parent can be null when mounting the root file system. In this case, the
  113. * function creates a new, negative dentry, which will then be initialized by
  114. * the mount code and made non-negative.
  115. *
  116. * The fs argument specifies the file system type to use on a miss; typically,
  117. * this will be parent->fs.
  118. *
  119. * This function checks the dcache first, and then, on a miss, falls back
  120. * to the low-level file system.
  121. *
  122. * The force flag causes the libOS to query the underlying file system for the
  123. * existence of the dentry, even on a dcache hit, whereas without force, a
  124. * negative dentry is treated as definitive. A hit with a valid dentry is
  125. * _always_ treated as definitive, even if force is set.
  126. *
  127. * XXX: The original code returned whether the process can exec the task?
  128. * Not clear this is needed; try not doing this.
  129. *
  130. * Returns zero if the file is found; -ENOENT if it doesn't exist,
  131. * possibly other errors.
  132. *
  133. * The caller should hold the dcache_lock.
  134. */
  135. int lookup_dentry (struct shim_dentry * parent, const char * name, int namelen,
  136. bool force, struct shim_dentry ** new,
  137. struct shim_mount * fs)
  138. {
  139. struct shim_dentry * dent = NULL;
  140. int do_fs_lookup = 0;
  141. int err = 0;
  142. /* Look up the name in the dcache first, one atom at a time. */
  143. dent = __lookup_dcache(parent, name, namelen, NULL, 0, NULL);
  144. if (!dent) {
  145. dent = get_new_dentry(fs, parent, name, namelen, NULL);
  146. if (!dent)
  147. return -ENOMEM;
  148. do_fs_lookup = 1;
  149. // In the case we make a new dentry, go ahead and increment the
  150. // ref count; in other cases, __lookup_dcache does this
  151. get_dentry(dent);
  152. } else {
  153. if (!(dent->state & DENTRY_VALID))
  154. do_fs_lookup = 1;
  155. else if (force && (dent->state & DENTRY_NEGATIVE))
  156. do_fs_lookup = 1;
  157. }
  158. if (do_fs_lookup) {
  159. // This doesn't make any sense if there isn't a low-level
  160. // lookup function.
  161. assert (dent->fs);
  162. assert (dent->fs->d_ops);
  163. assert (dent->fs->d_ops->lookup);
  164. err = dent->fs->d_ops->lookup(dent, force);
  165. /* XXX: On an error, it seems like we should probably destroy
  166. * the dentry, rather than keep some malformed dentry lying around.
  167. * Not done in original code, so leaving for now.
  168. */
  169. if (err) {
  170. if (err == -ENOENT) {
  171. // Let ENOENT fall through so we can get negative dentries in
  172. // the cache
  173. dent->state |= DENTRY_NEGATIVE;
  174. } else {
  175. /* Trying to weed out ESKIPPED */
  176. assert(err != -ESKIPPED);
  177. return err;
  178. }
  179. }
  180. dent->state |= DENTRY_VALID;
  181. }
  182. /* I think we can assume we have a valid dent at this point */
  183. assert(dent);
  184. assert(dent->state & DENTRY_VALID);
  185. // Set the err is ENOENT if negative
  186. if (dent->state & DENTRY_NEGATIVE)
  187. err = -ENOENT;
  188. if (new)
  189. *new = dent;
  190. return err;
  191. }
  192. /*
  193. * Looks up path under start dentry. Saves in dent (if specified; dent may be
  194. * NULL). Start is a hint, and may be null; in this case, we use the first
  195. * char of the path to infer whether the path is relative or absolute.
  196. *
  197. * Primarily to support bootstrapping, this function takes a fs parameter,
  198. * that specifies a mount point. Typically, this would be start->fs, but there
  199. * are cases where start may be absent (e.g., in bootstrapping). Fs can be
  200. * null only if the current thread is defined.
  201. *
  202. * Assumes dcache_lock is held; main difference from path_lookupat is that
  203. * dcache_lock is acquired/released.
  204. *
  205. * We assume the caller has incremented the reference count on start and its
  206. * associated file system mount by one
  207. *
  208. * The refcount is raised by one on the returned dentry and associated mount.
  209. *
  210. * The make_ancestor flag creates pseudo-dentries for any parent paths that
  211. * are not in cache and do not exist on the underlying file system. This is
  212. * intended for use only in setting up the file system view specified in the
  213. * manifest.
  214. *
  215. * If the file isn't found, returns -ENOENT.
  216. *
  217. * If the LOOKUP_DIRECTORY flag is set, and the found file isn't a directory,
  218. * returns -ENOTDIR.
  219. */
  220. int __path_lookupat (struct shim_dentry * start, const char * path, int flags,
  221. struct shim_dentry ** dent, int link_depth,
  222. struct shim_mount * fs, bool make_ancestor)
  223. {
  224. // Basic idea: recursively iterate over path, peeling off one atom at a
  225. // time.
  226. /* Chia-Che 12/5/2014:
  227. * XXX I am not a big fan of recursion. I am giving a pass to this code
  228. * for now, but eventually someone (probably me) should rewrite it. */
  229. const char * my_path;
  230. int my_pathlen = 0;
  231. int err = 0;
  232. struct shim_dentry *my_dent = NULL;
  233. struct shim_qstr this = QSTR_INIT;
  234. int base_case = 0, no_start = 0;
  235. struct shim_thread * cur_thread = get_cur_thread();
  236. if (!start) {
  237. if (cur_thread) {
  238. start = *path == '/' ? cur_thread->root : cur_thread->cwd;
  239. } else {
  240. /* Start at the global root if we have no fs and no start dentry.
  241. * This shoud only happen as part of initialization.
  242. */
  243. start = dentry_root;
  244. assert(start);
  245. }
  246. no_start = 1;
  247. }
  248. assert(start);
  249. get_dentry(start);
  250. if (!fs)
  251. fs = start->fs;
  252. assert(fs);
  253. get_mount(fs);
  254. assert(start->state & DENTRY_ISDIRECTORY);
  255. // Peel off any preceeding slashes
  256. path = eat_slashes(path);
  257. // Check that we didn't hit the base case
  258. if (path == '\0') {
  259. my_dent = start;
  260. base_case = 1;
  261. } else {
  262. my_path = path;
  263. // Find the length of the path
  264. while (*my_path != '/' && *my_path != '\0') {
  265. my_path++;
  266. my_pathlen++;
  267. }
  268. if (my_pathlen > MAX_FILENAME) {
  269. err = -ENAMETOOLONG;
  270. goto out;
  271. }
  272. /* Handle . */
  273. if (my_pathlen == 1 && *path == '.') {
  274. /* For the recursion to work, we need to do the following:
  275. * Bump the ref count, set my_dent to start
  276. */
  277. get_dentry(start);
  278. my_dent = start;
  279. } else if (my_pathlen == 2 && path[0] == '.' && path[1] == '.') {
  280. if (start->parent) {
  281. my_dent = start->parent;
  282. } else {
  283. // Root
  284. my_dent = start;
  285. }
  286. get_dentry(start);
  287. } else {
  288. // Once we have an atom, look it up and update start
  289. // XXX: Assume we don't need the force flag here?
  290. err = lookup_dentry(start, path, my_pathlen, 0, &my_dent, fs);
  291. // Allow a negative dentry to move forward
  292. if (err < 0 && err != -ENOENT)
  293. goto out;
  294. // Drop any trailing slashes from the path
  295. my_path = eat_slashes(my_path);
  296. // If the LOOKUP_FOLLOW flag is set, check if we hit a symlink
  297. if ((flags & LOOKUP_FOLLOW) && (my_dent->state & DENTRY_ISLINK)) {
  298. // Keep from following too many links
  299. if (link_depth > 80) {
  300. err = -ELOOP;
  301. goto out;
  302. }
  303. link_depth++;
  304. assert(my_dent->fs->d_ops && my_dent->fs->d_ops->follow_link);
  305. if ((err = my_dent->fs->d_ops->follow_link(my_dent, &this)) < 0)
  306. goto out;
  307. path = qstrgetstr(&this);
  308. if (path) {
  309. /* symlink name starts with a slash, restart lookup at root */
  310. if (*path == '/') {
  311. struct shim_dentry * root;
  312. // not sure how to deal with this case if cur_thread isn't defined
  313. assert(cur_thread);
  314. root = cur_thread->root;
  315. /*XXX: Check out path_reacquire here? */
  316. my_dent = root;
  317. } else // Relative path, stay in this dir
  318. my_dent = start;
  319. }
  320. }
  321. }
  322. // Drop any trailing slashes from the path
  323. my_path = eat_slashes(my_path);
  324. // If we found something, and there is more, recur
  325. if (*my_path != '\0') {
  326. /* If we have more to look up, but got a negative DENTRY,
  327. * we need to fail or (unlikely) create an ancestor dentry.*/
  328. if (my_dent->state & DENTRY_NEGATIVE) {
  329. if (make_ancestor) {
  330. my_dent->state |= DENTRY_ANCESTOR;
  331. my_dent->state |= DENTRY_ISDIRECTORY;
  332. my_dent->state &= ~DENTRY_NEGATIVE;
  333. } else {
  334. err = -ENOENT;
  335. goto out;
  336. }
  337. }
  338. /* Although this is slight over-kill, let's just always increment the
  339. * mount ref count on a recursion, for easier bookkeeping */
  340. get_mount(my_dent->fs);
  341. err = __path_lookupat (my_dent, my_path, flags, dent, link_depth,
  342. my_dent->fs, make_ancestor);
  343. if (err < 0)
  344. goto out;
  345. /* If we aren't returning a live reference to the target dentry, go
  346. * ahead and release the ref count when we unwind the recursion.
  347. */
  348. put_mount(my_dent->fs);
  349. put_dentry(my_dent);
  350. } else {
  351. /* If make_ancestor is set, we also need to handle the case here */
  352. if (make_ancestor && (my_dent->state & DENTRY_NEGATIVE)) {
  353. my_dent->state |= DENTRY_ANCESTOR;
  354. my_dent->state |= DENTRY_ISDIRECTORY;
  355. my_dent->state &= ~DENTRY_NEGATIVE;
  356. if (err == -ENOENT)
  357. err = 0;
  358. }
  359. base_case = 1;
  360. }
  361. }
  362. /* Base case. Set dent and return. */
  363. if (base_case) {
  364. if (dent)
  365. *dent = my_dent;
  366. // Enforce LOOKUP_CREATE flag at a higher level
  367. if (my_dent->state & DENTRY_NEGATIVE)
  368. err = -ENOENT;
  369. // Enforce the LOOKUP_DIRECTORY flag
  370. if ((flags & LOOKUP_DIRECTORY) & !(my_dent->state & DENTRY_ISDIRECTORY))
  371. err = -ENOTDIR;
  372. }
  373. out:
  374. /* If we didn't have a start dentry, decrement the ref count here */
  375. if (no_start) {
  376. put_mount(fs);
  377. put_dentry(start);
  378. }
  379. qstrfree(&this);
  380. return err;
  381. }
  382. /* Just wraps __path_lookupat, but also acquires and releases the dcache_lock.
  383. */
  384. int path_lookupat (struct shim_dentry * start, const char * name, int flags,
  385. struct shim_dentry ** dent, struct shim_mount * fs)
  386. {
  387. int ret = 0;
  388. lock(dcache_lock);
  389. ret = __path_lookupat (start, name, flags, dent, 0, fs, 0);
  390. unlock(dcache_lock);
  391. return ret;
  392. }
  393. /* Open path with given flags, in mode, similar to Unix open.
  394. *
  395. * The start dentry specifies where to begin the search, and can be null. If
  396. * specified, we assume the caller has incremented the ref count on the start,
  397. * but not the associated mount (probably using path_startat)
  398. *
  399. * hdl is an optional argument; if passed in, it is initialized to
  400. * refer to the opened path.
  401. *
  402. * We assume the caller has not increased
  403. *
  404. * The result is stored in dent.
  405. */
  406. int open_namei (struct shim_handle * hdl, struct shim_dentry * start,
  407. const char * path, int flags, int mode,
  408. struct shim_dentry ** dent)
  409. {
  410. int lookup_flags = __lookup_flags(flags);
  411. int acc_mode = ACC_MODE(flags & O_ACCMODE);
  412. int err = 0, newly_created = 0;
  413. struct shim_dentry *mydent = NULL;
  414. lock(dcache_lock);
  415. // lookup the path from start, passing flags
  416. err = __path_lookupat(start, path, lookup_flags, &mydent, 0, NULL, 0);
  417. // Deal with O_CREAT, O_EXCL, but only if we actually got a valid prefix
  418. // of directories.
  419. if (mydent && err == -ENOENT && (flags & O_CREAT)) {
  420. // Create the file
  421. struct shim_dentry * dir = mydent->parent;
  422. if (!dir) {
  423. err = -ENOENT;
  424. goto out;
  425. }
  426. // Check the parent permission first
  427. err = permission(dir, MAY_WRITE | MAY_EXEC, true);
  428. if (err) goto out;
  429. // Try EINVAL when creat isn't an option
  430. if (!dir->fs->d_ops || !dir->fs->d_ops->creat) {
  431. err = -EINVAL;
  432. goto out;
  433. }
  434. // Differentiate directory and file creation;
  435. // Seems like overloading functionality that could probably be more
  436. // cleanly pushed into shim_do_mkdir
  437. if (flags & O_DIRECTORY) {
  438. err = dir->fs->d_ops->mkdir(dir, mydent, mode);
  439. } else {
  440. err = dir->fs->d_ops->creat(hdl, dir, mydent, flags, mode);
  441. }
  442. if (err)
  443. goto out;
  444. newly_created = 1;
  445. // If we didn't get an error and made a directory, set the dcache dir flag
  446. if (flags & O_DIRECTORY)
  447. mydent->state |= DENTRY_ISDIRECTORY;
  448. // Once the dentry is creat-ed, drop the negative flag
  449. mydent->state &= ~DENTRY_NEGATIVE;
  450. // Set err back to zero and fall through
  451. err = 0;
  452. } else if (err == 0 && (flags & (O_CREAT|O_EXCL))) {
  453. err = -EEXIST;
  454. } else if (err < 0)
  455. goto out;
  456. // Check permission, but only if we didn't create the file.
  457. // creat/O_CREAT have idiosyncratic semantics about opening a
  458. // newly-created, read-only file for writing, but only the first time.
  459. if (!newly_created) {
  460. if ((err = permission(mydent, acc_mode, true)) < 0)
  461. goto out;
  462. }
  463. // Set up the file handle, if provided
  464. if (hdl)
  465. err = dentry_open(hdl, mydent, flags);
  466. out:
  467. if (dent && !err)
  468. *dent = mydent;
  469. unlock(dcache_lock);
  470. return err;
  471. }
  472. /* This function calls the low-level file system to do the work
  473. * of opening file indicated by dent, and initializing it in hdl.
  474. * Flags are standard open flags.
  475. *
  476. * If O_TRUNC is specified, this function is responsible for calling
  477. * the underlying truncate function.
  478. */
  479. int dentry_open (struct shim_handle * hdl, struct shim_dentry * dent,
  480. int flags)
  481. {
  482. int ret = 0;
  483. int size;
  484. char *path;
  485. struct shim_mount * fs = dent->fs;
  486. /* I think missing functionality shoudl be treated as EINVAL, or maybe
  487. * ENOSYS?*/
  488. if (!fs->d_ops || !fs->d_ops->open) {
  489. ret = -EINVAL;
  490. goto out;
  491. }
  492. if ((ret = fs->d_ops->open(hdl, dent, flags)) < 0)
  493. goto out;
  494. set_handle_fs(hdl, fs);
  495. get_dentry(dent);
  496. hdl->dentry = dent;
  497. hdl->flags = flags;
  498. // Set the type of the handle if we have a directory. The original code
  499. // had a special case for this.
  500. // XXX: Having a type on the handle seems a little redundant if we have a
  501. // dentry too.
  502. if (dent->state & DENTRY_ISDIRECTORY) {
  503. hdl->type = TYPE_DIR;
  504. memcpy(hdl->fs_type, fs->type, sizeof(fs->type));
  505. // Set dot and dot dot for some reason
  506. get_dentry(dent);
  507. hdl->info.dir.dot = dent;
  508. if (dent->parent) {
  509. get_dentry(dent->parent);
  510. hdl->info.dir.dotdot = dent->parent;
  511. } else
  512. hdl->info.dir.dotdot = NULL;
  513. // Let's defer setting the DENTRY_LISTED flag until we need it
  514. // Use -1 to indicate that the buf/ptr isn't initialized
  515. hdl->info.dir.buf = (void *)-1;
  516. hdl->info.dir.ptr = (void *)-1;
  517. }
  518. path = dentry_get_path(dent, true, &size);
  519. if (!path) {
  520. ret = -ENOMEM;
  521. goto out;
  522. }
  523. qstrsetstr(&hdl->path, path, size);
  524. /* truncate the file if O_TRUNC is given */
  525. if (flags & O_TRUNC) {
  526. if (!fs->fs_ops->truncate) {
  527. ret = -EINVAL;
  528. goto out;
  529. }
  530. ret = fs->fs_ops->truncate(hdl, 0);
  531. }
  532. out:
  533. return ret;
  534. }
  535. static inline void set_dirent_type (mode_t * type, int d_type)
  536. {
  537. switch (d_type) {
  538. case LINUX_DT_FIFO:
  539. *type = S_IFIFO;
  540. return;
  541. case LINUX_DT_CHR:
  542. *type = S_IFCHR;
  543. return;
  544. case LINUX_DT_BLK:
  545. *type = S_IFBLK;
  546. return;
  547. case LINUX_DT_REG:
  548. *type = S_IFREG;
  549. return;
  550. case LINUX_DT_LNK:
  551. *type = S_IFLNK;
  552. return;
  553. case LINUX_DT_SOCK:
  554. *type = S_IFSOCK;
  555. return;
  556. default:
  557. *type = 0;
  558. return;
  559. }
  560. }
  561. /* This function enumerates a directory and caches the results in the cache.
  562. *
  563. * Input: A dentry for a directory in the DENTRY_ISDIRECTORY and not in the
  564. * DENTRY_LISTED state. The dentry DENTRY_LISTED flag is set upon success.
  565. *
  566. * Return value: 0 on success, <0 on error
  567. *
  568. * DEP 7/9/17: This work was once done as part of open, but, since getdents*
  569. * have no consistency semantics, we can apply the principle of laziness and
  570. * not do the work until we are sure we really need to.
  571. */
  572. int list_directory_dentry (struct shim_dentry *dent) {
  573. int ret = 0;
  574. struct shim_mount * fs = dent->fs;
  575. lock(dcache_lock);
  576. /* DEP 8/4/17: Another process could list this directory
  577. * while we are waiting on the dcache lock. This is ok,
  578. * no need to blow an assert.
  579. */
  580. if (dent->state & DENTRY_LISTED){
  581. unlock(dcache_lock);
  582. return 0;
  583. }
  584. // DEP 7/9/17: In yet another strange turn of events in POSIX-land,
  585. // you can do a readdir on a rmdir-ed directory handle. What you
  586. // expect to learn is beyond me, but be careful with blowing assert
  587. // and tell the program something to keep it moving.
  588. if (dent->state & DENTRY_NEGATIVE) {
  589. unlock(dcache_lock);
  590. return 0;
  591. }
  592. assert (dent->state & DENTRY_ISDIRECTORY);
  593. struct shim_dirent * dirent = NULL;
  594. if ((ret = fs->d_ops->readdir(dent, &dirent)) < 0 || !dirent) {
  595. dirent = NULL;
  596. goto done_read;
  597. }
  598. struct shim_dirent * d = dirent;
  599. for ( ; d ; d = d->next) {
  600. struct shim_dentry * child;
  601. if ((ret = lookup_dentry(dent, d->name, strlen(d->name), false,
  602. &child, fs)) < 0)
  603. goto done_read;
  604. if (child->state & DENTRY_NEGATIVE)
  605. continue;
  606. if (!(child->state & DENTRY_VALID)) {
  607. set_dirent_type(&child->type, d->type);
  608. child->state |= DENTRY_VALID|DENTRY_RECENTLY;
  609. }
  610. child->ino = d->ino;
  611. }
  612. dent->state |= DENTRY_LISTED;
  613. done_read:
  614. unlock(dcache_lock);
  615. free(dirent);
  616. return ret;
  617. }
  618. /* This function caches the contents of a directory (dent), already
  619. * in the listed state, in a buffer associated with a handle (hdl).
  620. *
  621. * This function should only be called once on a handle.
  622. *
  623. * Returns 0 on success, <0 on failure.
  624. */
  625. int list_directory_handle (struct shim_dentry * dent, struct shim_handle * hdl)
  626. {
  627. struct shim_dentry ** children = NULL;
  628. int nchildren = dent->nchildren, count = 0;
  629. struct shim_dentry * child;
  630. assert(hdl->info.dir.buf == (void *)-1);
  631. assert(hdl->info.dir.ptr == (void *)-1);
  632. // Handle the case where the handle is on a rmdir-ed directory
  633. // Handle is already locked by caller, so these values shouldn't change
  634. // after dcache lock is acquired
  635. if (dent->state & DENTRY_NEGATIVE) {
  636. hdl->info.dir.buf = NULL;
  637. hdl->info.dir.ptr = NULL;
  638. return 0;
  639. }
  640. children = malloc(sizeof(struct shim_dentry *) * (nchildren + 1));
  641. if (!children)
  642. return -ENOMEM;
  643. lock(dcache_lock);
  644. listp_for_each_entry(child, &dent->children, siblings) {
  645. if (count >= nchildren)
  646. break;
  647. struct shim_dentry * c = child;
  648. while (c->state & DENTRY_MOUNTPOINT)
  649. c = c->mounted->root;
  650. if (c->state & DENTRY_VALID) {
  651. get_dentry(c);
  652. children[count++] = c;
  653. }
  654. }
  655. children[count] = NULL;
  656. hdl->info.dir.buf = children;
  657. hdl->info.dir.ptr = children;
  658. unlock(dcache_lock);
  659. return 0;
  660. }
  661. /* This function initializes dir to before a search, to either point
  662. * to the current working directory (if dfd == AT_FDCWD), or to the handle
  663. * pointed to by dfd, depending on the argument.
  664. *
  665. * Increments dentry ref count by one.
  666. *
  667. * Returns -EBADF if dfd is <0 or not a valid handle.
  668. * Returns -ENOTDIR if dfd is not a directory.
  669. */
  670. int path_startat (int dfd, struct shim_dentry ** dir)
  671. {
  672. if (dfd == AT_FDCWD) {
  673. struct shim_thread * cur = get_cur_thread();
  674. get_dentry(cur->cwd);
  675. *dir = cur->cwd;
  676. return 0;
  677. } else if (dfd < 0) {
  678. return -EBADF;
  679. } else {
  680. struct shim_handle * hdl = get_fd_handle(dfd, NULL, NULL);
  681. if (!hdl)
  682. return -EBADF;
  683. if (hdl->type != TYPE_DIR) {
  684. put_handle(hdl);
  685. return -ENOTDIR;
  686. }
  687. get_dentry(hdl->dentry);
  688. put_handle(hdl);
  689. *dir = hdl->dentry;
  690. return 0;
  691. }
  692. }