shim_namei.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812
  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. /* Handle . */
  269. if (my_pathlen == 1 && *path == '.') {
  270. /* For the recursion to work, we need to do the following:
  271. * Bump the ref count, set my_dent to start
  272. */
  273. get_dentry(start);
  274. my_dent = start;
  275. } else if (my_pathlen == 2 && path[0] == '.' && path[1] == '.') {
  276. if (start->parent) {
  277. my_dent = start->parent;
  278. } else {
  279. // Root
  280. my_dent = start;
  281. }
  282. get_dentry(start);
  283. } else {
  284. // Once we have an atom, look it up and update start
  285. // XXX: Assume we don't need the force flag here?
  286. err = lookup_dentry(start, path, my_pathlen, 0, &my_dent, fs);
  287. // Allow a negative dentry to move forward
  288. if (err < 0 && err != -ENOENT)
  289. goto out;
  290. // Drop any trailing slashes from the path
  291. my_path = eat_slashes(my_path);
  292. // If the LOOKUP_FOLLOW flag is set, check if we hit a symlink
  293. if ((flags & LOOKUP_FOLLOW) && (my_dent->state & DENTRY_ISLINK)) {
  294. // Keep from following too many links
  295. if (link_depth > 80) {
  296. err = -ELOOP;
  297. goto out;
  298. }
  299. link_depth++;
  300. assert(my_dent->fs->d_ops && my_dent->fs->d_ops->follow_link);
  301. if ((err = my_dent->fs->d_ops->follow_link(my_dent, &this)) < 0)
  302. goto out;
  303. path = qstrgetstr(&this);
  304. if (path) {
  305. /* symlink name starts with a slash, restart lookup at root */
  306. if (*path == '/') {
  307. struct shim_dentry * root;
  308. // not sure how to deal with this case if cur_thread isn't defined
  309. assert(cur_thread);
  310. root = cur_thread->root;
  311. /*XXX: Check out path_reacquire here? */
  312. my_dent = root;
  313. } else // Relative path, stay in this dir
  314. my_dent = start;
  315. }
  316. }
  317. }
  318. // Drop any trailing slashes from the path
  319. my_path = eat_slashes(my_path);
  320. // If we found something, and there is more, recur
  321. if (*my_path != '\0') {
  322. /* If we have more to look up, but got a negative DENTRY,
  323. * we need to fail or (unlikely) create an ancestor dentry.*/
  324. if (my_dent->state & DENTRY_NEGATIVE) {
  325. if (make_ancestor) {
  326. my_dent->state |= DENTRY_ANCESTOR;
  327. my_dent->state |= DENTRY_ISDIRECTORY;
  328. my_dent->state &= ~DENTRY_NEGATIVE;
  329. } else {
  330. err = -ENOENT;
  331. goto out;
  332. }
  333. }
  334. /* Although this is slight over-kill, let's just always increment the
  335. * mount ref count on a recursion, for easier bookkeeping */
  336. get_mount(my_dent->fs);
  337. err = __path_lookupat (my_dent, my_path, flags, dent, link_depth,
  338. my_dent->fs, make_ancestor);
  339. if (err < 0)
  340. goto out;
  341. /* If we aren't returning a live reference to the target dentry, go
  342. * ahead and release the ref count when we unwind the recursion.
  343. */
  344. put_mount(my_dent->fs);
  345. put_dentry(my_dent);
  346. } else {
  347. /* If make_ancestor is set, we also need to handle the case here */
  348. if (make_ancestor && (my_dent->state & DENTRY_NEGATIVE)) {
  349. my_dent->state |= DENTRY_ANCESTOR;
  350. my_dent->state |= DENTRY_ISDIRECTORY;
  351. my_dent->state &= ~DENTRY_NEGATIVE;
  352. if (err == -ENOENT)
  353. err = 0;
  354. }
  355. base_case = 1;
  356. }
  357. }
  358. /* Base case. Set dent and return. */
  359. if (base_case) {
  360. if (dent)
  361. *dent = my_dent;
  362. // Enforce LOOKUP_CREATE flag at a higher level
  363. if (my_dent->state & DENTRY_NEGATIVE)
  364. err = -ENOENT;
  365. // Enforce the LOOKUP_DIRECTORY flag
  366. if ((flags & LOOKUP_DIRECTORY) & !(my_dent->state & DENTRY_ISDIRECTORY))
  367. err = -ENOTDIR;
  368. }
  369. out:
  370. /* If we didn't have a start dentry, decrement the ref count here */
  371. if (no_start) {
  372. put_mount(fs);
  373. put_dentry(start);
  374. }
  375. qstrfree(&this);
  376. return err;
  377. }
  378. /* Just wraps __path_lookupat, but also acquires and releases the dcache_lock.
  379. */
  380. int path_lookupat (struct shim_dentry * start, const char * name, int flags,
  381. struct shim_dentry ** dent, struct shim_mount * fs)
  382. {
  383. int ret = 0;
  384. lock(dcache_lock);
  385. ret = __path_lookupat (start, name, flags, dent, 0, fs, 0);
  386. unlock(dcache_lock);
  387. return ret;
  388. }
  389. /* Open path with given flags, in mode, similar to Unix open.
  390. *
  391. * The start dentry specifies where to begin the search, and can be null. If
  392. * specified, we assume the caller has incremented the ref count on the start,
  393. * but not the associated mount (probably using path_startat)
  394. *
  395. * hdl is an optional argument; if passed in, it is initialized to
  396. * refer to the opened path.
  397. *
  398. * We assume the caller has not increased
  399. *
  400. * The result is stored in dent.
  401. */
  402. int open_namei (struct shim_handle * hdl, struct shim_dentry * start,
  403. const char * path, int flags, int mode,
  404. struct shim_dentry ** dent)
  405. {
  406. int lookup_flags = __lookup_flags(flags);
  407. int acc_mode = ACC_MODE(flags & O_ACCMODE);
  408. int err = 0, newly_created = 0;
  409. struct shim_dentry *mydent = NULL;
  410. lock(dcache_lock);
  411. // lookup the path from start, passing flags
  412. err = __path_lookupat(start, path, lookup_flags, &mydent, 0, NULL, 0);
  413. // Deal with O_CREAT, O_EXCL, but only if we actually got a valid prefix
  414. // of directories.
  415. if (mydent && err == -ENOENT && (flags & O_CREAT)) {
  416. // Create the file
  417. struct shim_dentry * dir = mydent->parent;
  418. if (!dir) {
  419. err = -ENOENT;
  420. goto out;
  421. }
  422. // Check the parent permission first
  423. err = permission(dir, MAY_WRITE | MAY_EXEC, true);
  424. if (err) goto out;
  425. // Try EINVAL when creat isn't an option
  426. if (!dir->fs->d_ops || !dir->fs->d_ops->creat) {
  427. err = -EINVAL;
  428. goto out;
  429. }
  430. // Differentiate directory and file creation;
  431. // Seems like overloading functionality that could probably be more
  432. // cleanly pushed into shim_do_mkdir
  433. if (flags & O_DIRECTORY) {
  434. err = dir->fs->d_ops->mkdir(dir, mydent, mode);
  435. } else {
  436. err = dir->fs->d_ops->creat(hdl, dir, mydent, flags, mode);
  437. }
  438. if (err)
  439. goto out;
  440. newly_created = 1;
  441. // If we didn't get an error and made a directory, set the dcache dir flag
  442. if (flags & O_DIRECTORY)
  443. mydent->state |= DENTRY_ISDIRECTORY;
  444. // Once the dentry is creat-ed, drop the negative flag
  445. mydent->state &= ~DENTRY_NEGATIVE;
  446. // Set err back to zero and fall through
  447. err = 0;
  448. } else if (err == 0 && (flags & (O_CREAT|O_EXCL))) {
  449. err = -EEXIST;
  450. } else if (err < 0)
  451. goto out;
  452. // Check permission, but only if we didn't create the file.
  453. // creat/O_CREAT have idiosyncratic semantics about opening a
  454. // newly-created, read-only file for writing, but only the first time.
  455. if (!newly_created) {
  456. if ((err = permission(mydent, acc_mode, true)) < 0)
  457. goto out;
  458. }
  459. // Set up the file handle, if provided
  460. if (hdl)
  461. err = dentry_open(hdl, mydent, flags);
  462. out:
  463. if (dent && !err)
  464. *dent = mydent;
  465. unlock(dcache_lock);
  466. return err;
  467. }
  468. /* This function calls the low-level file system to do the work
  469. * of opening file indicated by dent, and initializing it in hdl.
  470. * Flags are standard open flags.
  471. *
  472. * If O_TRUNC is specified, this function is responsible for calling
  473. * the underlying truncate function.
  474. */
  475. int dentry_open (struct shim_handle * hdl, struct shim_dentry * dent,
  476. int flags)
  477. {
  478. int ret = 0;
  479. int size;
  480. char *path;
  481. struct shim_mount * fs = dent->fs;
  482. /* I think missing functionality shoudl be treated as EINVAL, or maybe
  483. * ENOSYS?*/
  484. if (!fs->d_ops || !fs->d_ops->open) {
  485. ret = -EINVAL;
  486. goto out;
  487. }
  488. if ((ret = fs->d_ops->open(hdl, dent, flags)) < 0)
  489. goto out;
  490. set_handle_fs(hdl, fs);
  491. get_dentry(dent);
  492. hdl->dentry = dent;
  493. hdl->flags = flags;
  494. // Set the type of the handle if we have a directory. The original code
  495. // had a special case for this.
  496. // XXX: Having a type on the handle seems a little redundant if we have a
  497. // dentry too.
  498. if (dent->state & DENTRY_ISDIRECTORY) {
  499. hdl->type = TYPE_DIR;
  500. memcpy(hdl->fs_type, fs->type, sizeof(fs->type));
  501. // Set dot and dot dot for some reason
  502. get_dentry(dent);
  503. hdl->info.dir.dot = dent;
  504. if (dent->parent) {
  505. get_dentry(dent->parent);
  506. hdl->info.dir.dotdot = dent->parent;
  507. } else
  508. hdl->info.dir.dotdot = NULL;
  509. // Let's defer setting the DENTRY_LISTED flag until we need it
  510. // Use -1 to indicate that the buf/ptr isn't initialized
  511. hdl->info.dir.buf = (void *)-1;
  512. hdl->info.dir.ptr = (void *)-1;
  513. }
  514. path = dentry_get_path(dent, true, &size);
  515. if (!path) {
  516. ret = -ENOMEM;
  517. goto out;
  518. }
  519. qstrsetstr(&hdl->path, path, size);
  520. /* truncate the file if O_TRUNC is given */
  521. if (flags & O_TRUNC) {
  522. if (!fs->fs_ops->truncate) {
  523. ret = -EINVAL;
  524. goto out;
  525. }
  526. ret = fs->fs_ops->truncate(hdl, 0);
  527. }
  528. out:
  529. return ret;
  530. }
  531. static inline void set_dirent_type (mode_t * type, int d_type)
  532. {
  533. switch (d_type) {
  534. case LINUX_DT_FIFO:
  535. *type = S_IFIFO;
  536. return;
  537. case LINUX_DT_CHR:
  538. *type = S_IFCHR;
  539. return;
  540. case LINUX_DT_BLK:
  541. *type = S_IFBLK;
  542. return;
  543. case LINUX_DT_REG:
  544. *type = S_IFREG;
  545. return;
  546. case LINUX_DT_LNK:
  547. *type = S_IFLNK;
  548. return;
  549. case LINUX_DT_SOCK:
  550. *type = S_IFSOCK;
  551. return;
  552. default:
  553. *type = 0;
  554. return;
  555. }
  556. }
  557. /* This function enumerates a directory and caches the results in the cache.
  558. *
  559. * Input: A dentry for a directory in the DENTRY_ISDIRECTORY and not in the
  560. * DENTRY_LISTED state. The dentry DENTRY_LISTED flag is set upon success.
  561. *
  562. * Return value: 0 on success, <0 on error
  563. *
  564. * DEP 7/9/17: This work was once done as part of open, but, since getdents*
  565. * have no consistency semantics, we can apply the principle of laziness and
  566. * not do the work until we are sure we really need to.
  567. */
  568. int list_directory_dentry (struct shim_dentry *dent) {
  569. int ret = 0;
  570. struct shim_mount * fs = dent->fs;
  571. lock(dcache_lock);
  572. /* DEP 8/4/17: Another process could list this directory
  573. * while we are waiting on the dcache lock. This is ok,
  574. * no need to blow an assert.
  575. */
  576. if (dent->state & DENTRY_LISTED){
  577. unlock(dcache_lock);
  578. return 0;
  579. }
  580. // DEP 7/9/17: In yet another strange turn of events in POSIX-land,
  581. // you can do a readdir on a rmdir-ed directory handle. What you
  582. // expect to learn is beyond me, but be careful with blowing assert
  583. // and tell the program something to keep it moving.
  584. if (dent->state & DENTRY_NEGATIVE) {
  585. unlock(dcache_lock);
  586. return 0;
  587. }
  588. assert (dent->state & DENTRY_ISDIRECTORY);
  589. struct shim_dirent * dirent = NULL;
  590. if ((ret = fs->d_ops->readdir(dent, &dirent)) < 0 || !dirent) {
  591. dirent = NULL;
  592. goto done_read;
  593. }
  594. struct shim_dirent * d = dirent;
  595. for ( ; d ; d = d->next) {
  596. struct shim_dentry * child;
  597. if ((ret = lookup_dentry(dent, d->name, strlen(d->name), false,
  598. &child, fs)) < 0)
  599. goto done_read;
  600. if (child->state & DENTRY_NEGATIVE)
  601. continue;
  602. if (!(child->state & DENTRY_VALID)) {
  603. set_dirent_type(&child->type, d->type);
  604. child->state |= DENTRY_VALID|DENTRY_RECENTLY;
  605. }
  606. child->ino = d->ino;
  607. }
  608. dent->state |= DENTRY_LISTED;
  609. done_read:
  610. unlock(dcache_lock);
  611. free(dirent);
  612. return ret;
  613. }
  614. /* This function caches the contents of a directory (dent), already
  615. * in the listed state, in a buffer associated with a handle (hdl).
  616. *
  617. * This function should only be called once on a handle.
  618. *
  619. * Returns 0 on success, <0 on failure.
  620. */
  621. int list_directory_handle (struct shim_dentry * dent, struct shim_handle * hdl)
  622. {
  623. struct shim_dentry ** children = NULL;
  624. int nchildren = dent->nchildren, count = 0;
  625. struct shim_dentry * child;
  626. assert(hdl->info.dir.buf == (void *)-1);
  627. assert(hdl->info.dir.ptr == (void *)-1);
  628. // Handle the case where the handle is on a rmdir-ed directory
  629. // Handle is already locked by caller, so these values shouldn't change
  630. // after dcache lock is acquired
  631. if (dent->state & DENTRY_NEGATIVE) {
  632. hdl->info.dir.buf = NULL;
  633. hdl->info.dir.ptr = NULL;
  634. return 0;
  635. }
  636. children = malloc(sizeof(struct shim_dentry *) * (nchildren + 1));
  637. if (!children)
  638. return -ENOMEM;
  639. lock(dcache_lock);
  640. listp_for_each_entry(child, &dent->children, siblings) {
  641. if (count >= nchildren)
  642. break;
  643. struct shim_dentry * c = child;
  644. while (c->state & DENTRY_MOUNTPOINT)
  645. c = c->mounted->root;
  646. if (c->state & DENTRY_VALID) {
  647. get_dentry(c);
  648. children[count++] = c;
  649. }
  650. }
  651. children[count] = NULL;
  652. hdl->info.dir.buf = children;
  653. hdl->info.dir.ptr = children;
  654. unlock(dcache_lock);
  655. return 0;
  656. }
  657. /* This function initializes dir to before a search, to either point
  658. * to the current working directory (if dfd == AT_FDCWD), or to the handle
  659. * pointed to by dfd, depending on the argument.
  660. *
  661. * Increments dentry ref count by one.
  662. *
  663. * Returns -EBADF if dfd is <0 or not a valid handle.
  664. * Returns -ENOTDIR if dfd is not a directory.
  665. */
  666. int path_startat (int dfd, struct shim_dentry ** dir)
  667. {
  668. if (dfd == AT_FDCWD) {
  669. struct shim_thread * cur = get_cur_thread();
  670. get_dentry(cur->cwd);
  671. *dir = cur->cwd;
  672. return 0;
  673. } else if (dfd < 0) {
  674. return -EBADF;
  675. } else {
  676. struct shim_handle * hdl = get_fd_handle(dfd, NULL, NULL);
  677. if (!hdl)
  678. return -EBADF;
  679. if (hdl->type != TYPE_DIR) {
  680. put_handle(hdl);
  681. return -ENOTDIR;
  682. }
  683. get_dentry(hdl->dentry);
  684. put_handle(hdl);
  685. *dir = hdl->dentry;
  686. return 0;
  687. }
  688. }