namei.c 24 KB

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