namei.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988
  1. /* CacheFiles path walking and related routines
  2. *
  3. * Copyright (C) 2007 Red Hat, Inc. All Rights Reserved.
  4. * Written by David Howells (dhowells@redhat.com)
  5. *
  6. * This program is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU General Public Licence
  8. * as published by the Free Software Foundation; either version
  9. * 2 of the Licence, or (at your option) any later version.
  10. */
  11. #include <linux/module.h>
  12. #include <linux/sched.h>
  13. #include <linux/file.h>
  14. #include <linux/fs.h>
  15. #include <linux/fsnotify.h>
  16. #include <linux/quotaops.h>
  17. #include <linux/xattr.h>
  18. #include <linux/mount.h>
  19. #include <linux/namei.h>
  20. #include <linux/security.h>
  21. #include <linux/slab.h>
  22. #include "internal.h"
  23. #define CACHEFILES_KEYBUF_SIZE 512
  24. /*
  25. * dump debugging info about an object
  26. */
  27. static noinline
  28. void __cachefiles_printk_object(struct cachefiles_object *object,
  29. const char *prefix,
  30. u8 *keybuf)
  31. {
  32. struct fscache_cookie *cookie;
  33. unsigned keylen, loop;
  34. pr_err("%sobject: OBJ%x\n", prefix, object->fscache.debug_id);
  35. pr_err("%sobjstate=%s fl=%lx wbusy=%x ev=%lx[%lx]\n",
  36. prefix, object->fscache.state->name,
  37. object->fscache.flags, work_busy(&object->fscache.work),
  38. object->fscache.events, object->fscache.event_mask);
  39. pr_err("%sops=%u inp=%u exc=%u\n",
  40. prefix, object->fscache.n_ops, object->fscache.n_in_progress,
  41. object->fscache.n_exclusive);
  42. pr_err("%sparent=%p\n",
  43. prefix, object->fscache.parent);
  44. spin_lock(&object->fscache.lock);
  45. cookie = object->fscache.cookie;
  46. if (cookie) {
  47. pr_err("%scookie=%p [pr=%p nd=%p fl=%lx]\n",
  48. prefix,
  49. object->fscache.cookie,
  50. object->fscache.cookie->parent,
  51. object->fscache.cookie->netfs_data,
  52. object->fscache.cookie->flags);
  53. if (keybuf && cookie->def)
  54. keylen = cookie->def->get_key(cookie->netfs_data, keybuf,
  55. CACHEFILES_KEYBUF_SIZE);
  56. else
  57. keylen = 0;
  58. } else {
  59. pr_err("%scookie=NULL\n", prefix);
  60. keylen = 0;
  61. }
  62. spin_unlock(&object->fscache.lock);
  63. if (keylen) {
  64. pr_err("%skey=[%u] '", prefix, keylen);
  65. for (loop = 0; loop < keylen; loop++)
  66. pr_cont("%02x", keybuf[loop]);
  67. pr_cont("'\n");
  68. }
  69. }
  70. /*
  71. * dump debugging info about a pair of objects
  72. */
  73. static noinline void cachefiles_printk_object(struct cachefiles_object *object,
  74. struct cachefiles_object *xobject)
  75. {
  76. u8 *keybuf;
  77. keybuf = kmalloc(CACHEFILES_KEYBUF_SIZE, GFP_NOIO);
  78. if (object)
  79. __cachefiles_printk_object(object, "", keybuf);
  80. if (xobject)
  81. __cachefiles_printk_object(xobject, "x", keybuf);
  82. kfree(keybuf);
  83. }
  84. /*
  85. * mark the owner of a dentry, if there is one, to indicate that that dentry
  86. * has been preemptively deleted
  87. * - the caller must hold the i_mutex on the dentry's parent as required to
  88. * call vfs_unlink(), vfs_rmdir() or vfs_rename()
  89. */
  90. static void cachefiles_mark_object_buried(struct cachefiles_cache *cache,
  91. struct dentry *dentry,
  92. enum fscache_why_object_killed why)
  93. {
  94. struct cachefiles_object *object;
  95. struct rb_node *p;
  96. _enter(",'%pd'", dentry);
  97. write_lock(&cache->active_lock);
  98. p = cache->active_nodes.rb_node;
  99. while (p) {
  100. object = rb_entry(p, struct cachefiles_object, active_node);
  101. if (object->dentry > dentry)
  102. p = p->rb_left;
  103. else if (object->dentry < dentry)
  104. p = p->rb_right;
  105. else
  106. goto found_dentry;
  107. }
  108. write_unlock(&cache->active_lock);
  109. _leave(" [no owner]");
  110. return;
  111. /* found the dentry for */
  112. found_dentry:
  113. kdebug("preemptive burial: OBJ%x [%s] %p",
  114. object->fscache.debug_id,
  115. object->fscache.state->name,
  116. dentry);
  117. if (fscache_object_is_live(&object->fscache)) {
  118. pr_err("\n");
  119. pr_err("Error: Can't preemptively bury live object\n");
  120. cachefiles_printk_object(object, NULL);
  121. } else {
  122. if (why != FSCACHE_OBJECT_IS_STALE)
  123. fscache_object_mark_killed(&object->fscache, why);
  124. }
  125. write_unlock(&cache->active_lock);
  126. _leave(" [owner marked]");
  127. }
  128. /*
  129. * record the fact that an object is now active
  130. */
  131. static int cachefiles_mark_object_active(struct cachefiles_cache *cache,
  132. struct cachefiles_object *object)
  133. {
  134. struct cachefiles_object *xobject;
  135. struct rb_node **_p, *_parent = NULL;
  136. struct dentry *dentry;
  137. _enter(",%p", object);
  138. try_again:
  139. write_lock(&cache->active_lock);
  140. if (test_and_set_bit(CACHEFILES_OBJECT_ACTIVE, &object->flags)) {
  141. pr_err("Error: Object already active\n");
  142. cachefiles_printk_object(object, NULL);
  143. BUG();
  144. }
  145. dentry = object->dentry;
  146. _p = &cache->active_nodes.rb_node;
  147. while (*_p) {
  148. _parent = *_p;
  149. xobject = rb_entry(_parent,
  150. struct cachefiles_object, active_node);
  151. ASSERT(xobject != object);
  152. if (xobject->dentry > dentry)
  153. _p = &(*_p)->rb_left;
  154. else if (xobject->dentry < dentry)
  155. _p = &(*_p)->rb_right;
  156. else
  157. goto wait_for_old_object;
  158. }
  159. rb_link_node(&object->active_node, _parent, _p);
  160. rb_insert_color(&object->active_node, &cache->active_nodes);
  161. write_unlock(&cache->active_lock);
  162. _leave(" = 0");
  163. return 0;
  164. /* an old object from a previous incarnation is hogging the slot - we
  165. * need to wait for it to be destroyed */
  166. wait_for_old_object:
  167. if (fscache_object_is_live(&xobject->fscache)) {
  168. pr_err("\n");
  169. pr_err("Error: Unexpected object collision\n");
  170. cachefiles_printk_object(object, xobject);
  171. }
  172. atomic_inc(&xobject->usage);
  173. write_unlock(&cache->active_lock);
  174. if (test_bit(CACHEFILES_OBJECT_ACTIVE, &xobject->flags)) {
  175. wait_queue_head_t *wq;
  176. signed long timeout = 60 * HZ;
  177. wait_queue_t wait;
  178. bool requeue;
  179. /* if the object we're waiting for is queued for processing,
  180. * then just put ourselves on the queue behind it */
  181. if (work_pending(&xobject->fscache.work)) {
  182. _debug("queue OBJ%x behind OBJ%x immediately",
  183. object->fscache.debug_id,
  184. xobject->fscache.debug_id);
  185. goto requeue;
  186. }
  187. /* otherwise we sleep until either the object we're waiting for
  188. * is done, or the fscache_object is congested */
  189. wq = bit_waitqueue(&xobject->flags, CACHEFILES_OBJECT_ACTIVE);
  190. init_wait(&wait);
  191. requeue = false;
  192. do {
  193. prepare_to_wait(wq, &wait, TASK_UNINTERRUPTIBLE);
  194. if (!test_bit(CACHEFILES_OBJECT_ACTIVE, &xobject->flags))
  195. break;
  196. requeue = fscache_object_sleep_till_congested(&timeout);
  197. } while (timeout > 0 && !requeue);
  198. finish_wait(wq, &wait);
  199. if (requeue &&
  200. test_bit(CACHEFILES_OBJECT_ACTIVE, &xobject->flags)) {
  201. _debug("queue OBJ%x behind OBJ%x after wait",
  202. object->fscache.debug_id,
  203. xobject->fscache.debug_id);
  204. goto requeue;
  205. }
  206. if (timeout <= 0) {
  207. pr_err("\n");
  208. pr_err("Error: Overlong wait for old active object to go away\n");
  209. cachefiles_printk_object(object, xobject);
  210. goto requeue;
  211. }
  212. }
  213. ASSERT(!test_bit(CACHEFILES_OBJECT_ACTIVE, &xobject->flags));
  214. cache->cache.ops->put_object(&xobject->fscache);
  215. goto try_again;
  216. requeue:
  217. clear_bit(CACHEFILES_OBJECT_ACTIVE, &object->flags);
  218. cache->cache.ops->put_object(&xobject->fscache);
  219. _leave(" = -ETIMEDOUT");
  220. return -ETIMEDOUT;
  221. }
  222. /*
  223. * delete an object representation from the cache
  224. * - file backed objects are unlinked
  225. * - directory backed objects are stuffed into the graveyard for userspace to
  226. * delete
  227. * - unlocks the directory mutex
  228. */
  229. static int cachefiles_bury_object(struct cachefiles_cache *cache,
  230. struct dentry *dir,
  231. struct dentry *rep,
  232. bool preemptive,
  233. enum fscache_why_object_killed why)
  234. {
  235. struct dentry *grave, *trap;
  236. struct path path, path_to_graveyard;
  237. char nbuffer[8 + 8 + 1];
  238. int ret;
  239. _enter(",'%pd','%pd'", dir, rep);
  240. _debug("remove %p from %p", rep, dir);
  241. /* non-directories can just be unlinked */
  242. if (!d_is_dir(rep)) {
  243. _debug("unlink stale object");
  244. path.mnt = cache->mnt;
  245. path.dentry = dir;
  246. ret = security_path_unlink(&path, rep);
  247. if (ret < 0) {
  248. cachefiles_io_error(cache, "Unlink security error");
  249. } else {
  250. ret = vfs_unlink(d_inode(dir), rep, NULL);
  251. if (preemptive)
  252. cachefiles_mark_object_buried(cache, rep, why);
  253. }
  254. mutex_unlock(&d_inode(dir)->i_mutex);
  255. if (ret == -EIO)
  256. cachefiles_io_error(cache, "Unlink failed");
  257. _leave(" = %d", ret);
  258. return ret;
  259. }
  260. /* directories have to be moved to the graveyard */
  261. _debug("move stale object to graveyard");
  262. mutex_unlock(&d_inode(dir)->i_mutex);
  263. try_again:
  264. /* first step is to make up a grave dentry in the graveyard */
  265. sprintf(nbuffer, "%08x%08x",
  266. (uint32_t) get_seconds(),
  267. (uint32_t) atomic_inc_return(&cache->gravecounter));
  268. /* do the multiway lock magic */
  269. trap = lock_rename(cache->graveyard, dir);
  270. /* do some checks before getting the grave dentry */
  271. if (rep->d_parent != dir || IS_DEADDIR(d_inode(rep))) {
  272. /* the entry was probably culled when we dropped the parent dir
  273. * lock */
  274. unlock_rename(cache->graveyard, dir);
  275. _leave(" = 0 [culled?]");
  276. return 0;
  277. }
  278. if (!d_can_lookup(cache->graveyard)) {
  279. unlock_rename(cache->graveyard, dir);
  280. cachefiles_io_error(cache, "Graveyard no longer a directory");
  281. return -EIO;
  282. }
  283. if (trap == rep) {
  284. unlock_rename(cache->graveyard, dir);
  285. cachefiles_io_error(cache, "May not make directory loop");
  286. return -EIO;
  287. }
  288. if (d_mountpoint(rep)) {
  289. unlock_rename(cache->graveyard, dir);
  290. cachefiles_io_error(cache, "Mountpoint in cache");
  291. return -EIO;
  292. }
  293. grave = lookup_one_len(nbuffer, cache->graveyard, strlen(nbuffer));
  294. if (IS_ERR(grave)) {
  295. unlock_rename(cache->graveyard, dir);
  296. if (PTR_ERR(grave) == -ENOMEM) {
  297. _leave(" = -ENOMEM");
  298. return -ENOMEM;
  299. }
  300. cachefiles_io_error(cache, "Lookup error %ld",
  301. PTR_ERR(grave));
  302. return -EIO;
  303. }
  304. if (d_is_positive(grave)) {
  305. unlock_rename(cache->graveyard, dir);
  306. dput(grave);
  307. grave = NULL;
  308. cond_resched();
  309. goto try_again;
  310. }
  311. if (d_mountpoint(grave)) {
  312. unlock_rename(cache->graveyard, dir);
  313. dput(grave);
  314. cachefiles_io_error(cache, "Mountpoint in graveyard");
  315. return -EIO;
  316. }
  317. /* target should not be an ancestor of source */
  318. if (trap == grave) {
  319. unlock_rename(cache->graveyard, dir);
  320. dput(grave);
  321. cachefiles_io_error(cache, "May not make directory loop");
  322. return -EIO;
  323. }
  324. /* attempt the rename */
  325. path.mnt = cache->mnt;
  326. path.dentry = dir;
  327. path_to_graveyard.mnt = cache->mnt;
  328. path_to_graveyard.dentry = cache->graveyard;
  329. ret = security_path_rename(&path, rep, &path_to_graveyard, grave, 0);
  330. if (ret < 0) {
  331. cachefiles_io_error(cache, "Rename security error %d", ret);
  332. } else {
  333. ret = vfs_rename(d_inode(dir), rep,
  334. d_inode(cache->graveyard), grave, NULL, 0);
  335. if (ret != 0 && ret != -ENOMEM)
  336. cachefiles_io_error(cache,
  337. "Rename failed with error %d", ret);
  338. if (preemptive)
  339. cachefiles_mark_object_buried(cache, rep, why);
  340. }
  341. unlock_rename(cache->graveyard, dir);
  342. dput(grave);
  343. _leave(" = 0");
  344. return 0;
  345. }
  346. /*
  347. * delete an object representation from the cache
  348. */
  349. int cachefiles_delete_object(struct cachefiles_cache *cache,
  350. struct cachefiles_object *object)
  351. {
  352. struct dentry *dir;
  353. int ret;
  354. _enter(",OBJ%x{%p}", object->fscache.debug_id, object->dentry);
  355. ASSERT(object->dentry);
  356. ASSERT(d_backing_inode(object->dentry));
  357. ASSERT(object->dentry->d_parent);
  358. dir = dget_parent(object->dentry);
  359. mutex_lock_nested(&d_inode(dir)->i_mutex, I_MUTEX_PARENT);
  360. if (test_bit(FSCACHE_OBJECT_KILLED_BY_CACHE, &object->fscache.flags)) {
  361. /* object allocation for the same key preemptively deleted this
  362. * object's file so that it could create its own file */
  363. _debug("object preemptively buried");
  364. mutex_unlock(&d_inode(dir)->i_mutex);
  365. ret = 0;
  366. } else {
  367. /* we need to check that our parent is _still_ our parent - it
  368. * may have been renamed */
  369. if (dir == object->dentry->d_parent) {
  370. ret = cachefiles_bury_object(cache, dir,
  371. object->dentry, false,
  372. FSCACHE_OBJECT_WAS_RETIRED);
  373. } else {
  374. /* it got moved, presumably by cachefilesd culling it,
  375. * so it's no longer in the key path and we can ignore
  376. * it */
  377. mutex_unlock(&d_inode(dir)->i_mutex);
  378. ret = 0;
  379. }
  380. }
  381. dput(dir);
  382. _leave(" = %d", ret);
  383. return ret;
  384. }
  385. /*
  386. * walk from the parent object to the child object through the backing
  387. * filesystem, creating directories as we go
  388. */
  389. int cachefiles_walk_to_object(struct cachefiles_object *parent,
  390. struct cachefiles_object *object,
  391. const char *key,
  392. struct cachefiles_xattr *auxdata)
  393. {
  394. struct cachefiles_cache *cache;
  395. struct dentry *dir, *next = NULL;
  396. struct path path;
  397. unsigned long start;
  398. const char *name;
  399. int ret, nlen;
  400. _enter("OBJ%x{%p},OBJ%x,%s,",
  401. parent->fscache.debug_id, parent->dentry,
  402. object->fscache.debug_id, key);
  403. cache = container_of(parent->fscache.cache,
  404. struct cachefiles_cache, cache);
  405. path.mnt = cache->mnt;
  406. ASSERT(parent->dentry);
  407. ASSERT(d_backing_inode(parent->dentry));
  408. if (!(d_is_dir(parent->dentry))) {
  409. // TODO: convert file to dir
  410. _leave("looking up in none directory");
  411. return -ENOBUFS;
  412. }
  413. dir = dget(parent->dentry);
  414. advance:
  415. /* attempt to transit the first directory component */
  416. name = key;
  417. nlen = strlen(key);
  418. /* key ends in a double NUL */
  419. key = key + nlen + 1;
  420. if (!*key)
  421. key = NULL;
  422. lookup_again:
  423. /* search the current directory for the element name */
  424. _debug("lookup '%s'", name);
  425. mutex_lock_nested(&d_inode(dir)->i_mutex, I_MUTEX_PARENT);
  426. start = jiffies;
  427. next = lookup_one_len(name, dir, nlen);
  428. cachefiles_hist(cachefiles_lookup_histogram, start);
  429. if (IS_ERR(next))
  430. goto lookup_error;
  431. _debug("next -> %p %s", next, d_backing_inode(next) ? "positive" : "negative");
  432. if (!key)
  433. object->new = !d_backing_inode(next);
  434. /* if this element of the path doesn't exist, then the lookup phase
  435. * failed, and we can release any readers in the certain knowledge that
  436. * there's nothing for them to actually read */
  437. if (d_is_negative(next))
  438. fscache_object_lookup_negative(&object->fscache);
  439. /* we need to create the object if it's negative */
  440. if (key || object->type == FSCACHE_COOKIE_TYPE_INDEX) {
  441. /* index objects and intervening tree levels must be subdirs */
  442. if (d_is_negative(next)) {
  443. ret = cachefiles_has_space(cache, 1, 0);
  444. if (ret < 0)
  445. goto no_space_error;
  446. path.dentry = dir;
  447. ret = security_path_mkdir(&path, next, 0);
  448. if (ret < 0)
  449. goto create_error;
  450. start = jiffies;
  451. ret = vfs_mkdir(d_inode(dir), next, 0);
  452. cachefiles_hist(cachefiles_mkdir_histogram, start);
  453. if (ret < 0)
  454. goto create_error;
  455. ASSERT(d_backing_inode(next));
  456. _debug("mkdir -> %p{%p{ino=%lu}}",
  457. next, d_backing_inode(next), d_backing_inode(next)->i_ino);
  458. } else if (!d_can_lookup(next)) {
  459. pr_err("inode %lu is not a directory\n",
  460. d_backing_inode(next)->i_ino);
  461. ret = -ENOBUFS;
  462. goto error;
  463. }
  464. } else {
  465. /* non-index objects start out life as files */
  466. if (d_is_negative(next)) {
  467. ret = cachefiles_has_space(cache, 1, 0);
  468. if (ret < 0)
  469. goto no_space_error;
  470. path.dentry = dir;
  471. ret = security_path_mknod(&path, next, S_IFREG, 0);
  472. if (ret < 0)
  473. goto create_error;
  474. start = jiffies;
  475. ret = vfs_create(d_inode(dir), next, S_IFREG, true);
  476. cachefiles_hist(cachefiles_create_histogram, start);
  477. if (ret < 0)
  478. goto create_error;
  479. ASSERT(d_backing_inode(next));
  480. _debug("create -> %p{%p{ino=%lu}}",
  481. next, d_backing_inode(next), d_backing_inode(next)->i_ino);
  482. } else if (!d_can_lookup(next) &&
  483. !d_is_reg(next)
  484. ) {
  485. pr_err("inode %lu is not a file or directory\n",
  486. d_backing_inode(next)->i_ino);
  487. ret = -ENOBUFS;
  488. goto error;
  489. }
  490. }
  491. /* process the next component */
  492. if (key) {
  493. _debug("advance");
  494. mutex_unlock(&d_inode(dir)->i_mutex);
  495. dput(dir);
  496. dir = next;
  497. next = NULL;
  498. goto advance;
  499. }
  500. /* we've found the object we were looking for */
  501. object->dentry = next;
  502. /* if we've found that the terminal object exists, then we need to
  503. * check its attributes and delete it if it's out of date */
  504. if (!object->new) {
  505. _debug("validate '%pd'", next);
  506. ret = cachefiles_check_object_xattr(object, auxdata);
  507. if (ret == -ESTALE) {
  508. /* delete the object (the deleter drops the directory
  509. * mutex) */
  510. object->dentry = NULL;
  511. ret = cachefiles_bury_object(cache, dir, next, true,
  512. FSCACHE_OBJECT_IS_STALE);
  513. dput(next);
  514. next = NULL;
  515. if (ret < 0)
  516. goto delete_error;
  517. _debug("redo lookup");
  518. fscache_object_retrying_stale(&object->fscache);
  519. goto lookup_again;
  520. }
  521. }
  522. /* note that we're now using this object */
  523. ret = cachefiles_mark_object_active(cache, object);
  524. mutex_unlock(&d_inode(dir)->i_mutex);
  525. dput(dir);
  526. dir = NULL;
  527. if (ret == -ETIMEDOUT)
  528. goto mark_active_timed_out;
  529. _debug("=== OBTAINED_OBJECT ===");
  530. if (object->new) {
  531. /* attach data to a newly constructed terminal object */
  532. ret = cachefiles_set_object_xattr(object, auxdata);
  533. if (ret < 0)
  534. goto check_error;
  535. } else {
  536. /* always update the atime on an object we've just looked up
  537. * (this is used to keep track of culling, and atimes are only
  538. * updated by read, write and readdir but not lookup or
  539. * open) */
  540. path.dentry = next;
  541. touch_atime(&path);
  542. }
  543. /* open a file interface onto a data file */
  544. if (object->type != FSCACHE_COOKIE_TYPE_INDEX) {
  545. if (d_is_reg(object->dentry)) {
  546. const struct address_space_operations *aops;
  547. ret = -EPERM;
  548. aops = d_backing_inode(object->dentry)->i_mapping->a_ops;
  549. if (!aops->bmap)
  550. goto check_error;
  551. if (object->dentry->d_sb->s_blocksize > PAGE_SIZE)
  552. goto check_error;
  553. object->backer = object->dentry;
  554. } else {
  555. BUG(); // TODO: open file in data-class subdir
  556. }
  557. }
  558. object->new = 0;
  559. fscache_obtained_object(&object->fscache);
  560. _leave(" = 0 [%lu]", d_backing_inode(object->dentry)->i_ino);
  561. return 0;
  562. no_space_error:
  563. fscache_object_mark_killed(&object->fscache, FSCACHE_OBJECT_NO_SPACE);
  564. create_error:
  565. _debug("create error %d", ret);
  566. if (ret == -EIO)
  567. cachefiles_io_error(cache, "Create/mkdir failed");
  568. goto error;
  569. mark_active_timed_out:
  570. _debug("mark active timed out");
  571. goto release_dentry;
  572. check_error:
  573. _debug("check error %d", ret);
  574. write_lock(&cache->active_lock);
  575. rb_erase(&object->active_node, &cache->active_nodes);
  576. clear_bit(CACHEFILES_OBJECT_ACTIVE, &object->flags);
  577. wake_up_bit(&object->flags, CACHEFILES_OBJECT_ACTIVE);
  578. write_unlock(&cache->active_lock);
  579. release_dentry:
  580. dput(object->dentry);
  581. object->dentry = NULL;
  582. goto error_out;
  583. delete_error:
  584. _debug("delete error %d", ret);
  585. goto error_out2;
  586. lookup_error:
  587. _debug("lookup error %ld", PTR_ERR(next));
  588. ret = PTR_ERR(next);
  589. if (ret == -EIO)
  590. cachefiles_io_error(cache, "Lookup failed");
  591. next = NULL;
  592. error:
  593. mutex_unlock(&d_inode(dir)->i_mutex);
  594. dput(next);
  595. error_out2:
  596. dput(dir);
  597. error_out:
  598. _leave(" = error %d", -ret);
  599. return ret;
  600. }
  601. /*
  602. * get a subdirectory
  603. */
  604. struct dentry *cachefiles_get_directory(struct cachefiles_cache *cache,
  605. struct dentry *dir,
  606. const char *dirname)
  607. {
  608. struct dentry *subdir;
  609. unsigned long start;
  610. struct path path;
  611. int ret;
  612. _enter(",,%s", dirname);
  613. /* search the current directory for the element name */
  614. mutex_lock(&d_inode(dir)->i_mutex);
  615. start = jiffies;
  616. subdir = lookup_one_len(dirname, dir, strlen(dirname));
  617. cachefiles_hist(cachefiles_lookup_histogram, start);
  618. if (IS_ERR(subdir)) {
  619. if (PTR_ERR(subdir) == -ENOMEM)
  620. goto nomem_d_alloc;
  621. goto lookup_error;
  622. }
  623. _debug("subdir -> %p %s",
  624. subdir, d_backing_inode(subdir) ? "positive" : "negative");
  625. /* we need to create the subdir if it doesn't exist yet */
  626. if (d_is_negative(subdir)) {
  627. ret = cachefiles_has_space(cache, 1, 0);
  628. if (ret < 0)
  629. goto mkdir_error;
  630. _debug("attempt mkdir");
  631. path.mnt = cache->mnt;
  632. path.dentry = dir;
  633. ret = security_path_mkdir(&path, subdir, 0700);
  634. if (ret < 0)
  635. goto mkdir_error;
  636. ret = vfs_mkdir(d_inode(dir), subdir, 0700);
  637. if (ret < 0)
  638. goto mkdir_error;
  639. ASSERT(d_backing_inode(subdir));
  640. _debug("mkdir -> %p{%p{ino=%lu}}",
  641. subdir,
  642. d_backing_inode(subdir),
  643. d_backing_inode(subdir)->i_ino);
  644. }
  645. mutex_unlock(&d_inode(dir)->i_mutex);
  646. /* we need to make sure the subdir is a directory */
  647. ASSERT(d_backing_inode(subdir));
  648. if (!d_can_lookup(subdir)) {
  649. pr_err("%s is not a directory\n", dirname);
  650. ret = -EIO;
  651. goto check_error;
  652. }
  653. ret = -EPERM;
  654. if (!d_backing_inode(subdir)->i_op->setxattr ||
  655. !d_backing_inode(subdir)->i_op->getxattr ||
  656. !d_backing_inode(subdir)->i_op->lookup ||
  657. !d_backing_inode(subdir)->i_op->mkdir ||
  658. !d_backing_inode(subdir)->i_op->create ||
  659. (!d_backing_inode(subdir)->i_op->rename &&
  660. !d_backing_inode(subdir)->i_op->rename2) ||
  661. !d_backing_inode(subdir)->i_op->rmdir ||
  662. !d_backing_inode(subdir)->i_op->unlink)
  663. goto check_error;
  664. _leave(" = [%lu]", d_backing_inode(subdir)->i_ino);
  665. return subdir;
  666. check_error:
  667. dput(subdir);
  668. _leave(" = %d [check]", ret);
  669. return ERR_PTR(ret);
  670. mkdir_error:
  671. mutex_unlock(&d_inode(dir)->i_mutex);
  672. dput(subdir);
  673. pr_err("mkdir %s failed with error %d\n", dirname, ret);
  674. return ERR_PTR(ret);
  675. lookup_error:
  676. mutex_unlock(&d_inode(dir)->i_mutex);
  677. ret = PTR_ERR(subdir);
  678. pr_err("Lookup %s failed with error %d\n", dirname, ret);
  679. return ERR_PTR(ret);
  680. nomem_d_alloc:
  681. mutex_unlock(&d_inode(dir)->i_mutex);
  682. _leave(" = -ENOMEM");
  683. return ERR_PTR(-ENOMEM);
  684. }
  685. /*
  686. * find out if an object is in use or not
  687. * - if finds object and it's not in use:
  688. * - returns a pointer to the object and a reference on it
  689. * - returns with the directory locked
  690. */
  691. static struct dentry *cachefiles_check_active(struct cachefiles_cache *cache,
  692. struct dentry *dir,
  693. char *filename)
  694. {
  695. struct cachefiles_object *object;
  696. struct rb_node *_n;
  697. struct dentry *victim;
  698. unsigned long start;
  699. int ret;
  700. //_enter(",%pd/,%s",
  701. // dir, filename);
  702. /* look up the victim */
  703. mutex_lock_nested(&d_inode(dir)->i_mutex, I_MUTEX_PARENT);
  704. start = jiffies;
  705. victim = lookup_one_len(filename, dir, strlen(filename));
  706. cachefiles_hist(cachefiles_lookup_histogram, start);
  707. if (IS_ERR(victim))
  708. goto lookup_error;
  709. //_debug("victim -> %p %s",
  710. // victim, d_backing_inode(victim) ? "positive" : "negative");
  711. /* if the object is no longer there then we probably retired the object
  712. * at the netfs's request whilst the cull was in progress
  713. */
  714. if (d_is_negative(victim)) {
  715. mutex_unlock(&d_inode(dir)->i_mutex);
  716. dput(victim);
  717. _leave(" = -ENOENT [absent]");
  718. return ERR_PTR(-ENOENT);
  719. }
  720. /* check to see if we're using this object */
  721. read_lock(&cache->active_lock);
  722. _n = cache->active_nodes.rb_node;
  723. while (_n) {
  724. object = rb_entry(_n, struct cachefiles_object, active_node);
  725. if (object->dentry > victim)
  726. _n = _n->rb_left;
  727. else if (object->dentry < victim)
  728. _n = _n->rb_right;
  729. else
  730. goto object_in_use;
  731. }
  732. read_unlock(&cache->active_lock);
  733. //_leave(" = %p", victim);
  734. return victim;
  735. object_in_use:
  736. read_unlock(&cache->active_lock);
  737. mutex_unlock(&d_inode(dir)->i_mutex);
  738. dput(victim);
  739. //_leave(" = -EBUSY [in use]");
  740. return ERR_PTR(-EBUSY);
  741. lookup_error:
  742. mutex_unlock(&d_inode(dir)->i_mutex);
  743. ret = PTR_ERR(victim);
  744. if (ret == -ENOENT) {
  745. /* file or dir now absent - probably retired by netfs */
  746. _leave(" = -ESTALE [absent]");
  747. return ERR_PTR(-ESTALE);
  748. }
  749. if (ret == -EIO) {
  750. cachefiles_io_error(cache, "Lookup failed");
  751. } else if (ret != -ENOMEM) {
  752. pr_err("Internal error: %d\n", ret);
  753. ret = -EIO;
  754. }
  755. _leave(" = %d", ret);
  756. return ERR_PTR(ret);
  757. }
  758. /*
  759. * cull an object if it's not in use
  760. * - called only by cache manager daemon
  761. */
  762. int cachefiles_cull(struct cachefiles_cache *cache, struct dentry *dir,
  763. char *filename)
  764. {
  765. struct dentry *victim;
  766. int ret;
  767. _enter(",%pd/,%s", dir, filename);
  768. victim = cachefiles_check_active(cache, dir, filename);
  769. if (IS_ERR(victim))
  770. return PTR_ERR(victim);
  771. _debug("victim -> %p %s",
  772. victim, d_backing_inode(victim) ? "positive" : "negative");
  773. /* okay... the victim is not being used so we can cull it
  774. * - start by marking it as stale
  775. */
  776. _debug("victim is cullable");
  777. ret = cachefiles_remove_object_xattr(cache, victim);
  778. if (ret < 0)
  779. goto error_unlock;
  780. /* actually remove the victim (drops the dir mutex) */
  781. _debug("bury");
  782. ret = cachefiles_bury_object(cache, dir, victim, false,
  783. FSCACHE_OBJECT_WAS_CULLED);
  784. if (ret < 0)
  785. goto error;
  786. dput(victim);
  787. _leave(" = 0");
  788. return 0;
  789. error_unlock:
  790. mutex_unlock(&d_inode(dir)->i_mutex);
  791. error:
  792. dput(victim);
  793. if (ret == -ENOENT) {
  794. /* file or dir now absent - probably retired by netfs */
  795. _leave(" = -ESTALE [absent]");
  796. return -ESTALE;
  797. }
  798. if (ret != -ENOMEM) {
  799. pr_err("Internal error: %d\n", ret);
  800. ret = -EIO;
  801. }
  802. _leave(" = %d", ret);
  803. return ret;
  804. }
  805. /*
  806. * find out if an object is in use or not
  807. * - called only by cache manager daemon
  808. * - returns -EBUSY or 0 to indicate whether an object is in use or not
  809. */
  810. int cachefiles_check_in_use(struct cachefiles_cache *cache, struct dentry *dir,
  811. char *filename)
  812. {
  813. struct dentry *victim;
  814. //_enter(",%pd/,%s",
  815. // dir, filename);
  816. victim = cachefiles_check_active(cache, dir, filename);
  817. if (IS_ERR(victim))
  818. return PTR_ERR(victim);
  819. mutex_unlock(&d_inode(dir)->i_mutex);
  820. dput(victim);
  821. //_leave(" = 0");
  822. return 0;
  823. }