dcache.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538
  1. /* -*- mode: c; c-basic-offset: 8; -*-
  2. * vim: noexpandtab sw=8 ts=8 sts=0:
  3. *
  4. * dcache.c
  5. *
  6. * dentry cache handling code
  7. *
  8. * Copyright (C) 2002, 2004 Oracle. All rights reserved.
  9. *
  10. * This program is free software; you can redistribute it and/or
  11. * modify it under the terms of the GNU General Public
  12. * License as published by the Free Software Foundation; either
  13. * version 2 of the License, or (at your option) any later version.
  14. *
  15. * This program is distributed in the hope that it will be useful,
  16. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  18. * General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU General Public
  21. * License along with this program; if not, write to the
  22. * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  23. * Boston, MA 021110-1307, USA.
  24. */
  25. #include <linux/fs.h>
  26. #include <linux/types.h>
  27. #include <linux/slab.h>
  28. #include <linux/namei.h>
  29. #define MLOG_MASK_PREFIX ML_DCACHE
  30. #include <cluster/masklog.h>
  31. #include "ocfs2.h"
  32. #include "alloc.h"
  33. #include "dcache.h"
  34. #include "dlmglue.h"
  35. #include "file.h"
  36. #include "inode.h"
  37. #include "super.h"
  38. void ocfs2_dentry_attach_gen(struct dentry *dentry)
  39. {
  40. unsigned long gen =
  41. OCFS2_I(dentry->d_parent->d_inode)->ip_dir_lock_gen;
  42. BUG_ON(dentry->d_inode);
  43. dentry->d_fsdata = (void *)gen;
  44. }
  45. static int ocfs2_dentry_revalidate(struct dentry *dentry,
  46. struct nameidata *nd)
  47. {
  48. struct inode *inode;
  49. int ret = 0; /* if all else fails, just return false */
  50. struct ocfs2_super *osb;
  51. if (nd && nd->flags & LOOKUP_RCU)
  52. return -ECHILD;
  53. inode = dentry->d_inode;
  54. osb = OCFS2_SB(dentry->d_sb);
  55. mlog_entry("(0x%p, '%.*s')\n", dentry,
  56. dentry->d_name.len, dentry->d_name.name);
  57. /* For a negative dentry -
  58. * check the generation number of the parent and compare with the
  59. * one stored in the inode.
  60. */
  61. if (inode == NULL) {
  62. unsigned long gen = (unsigned long) dentry->d_fsdata;
  63. unsigned long pgen =
  64. OCFS2_I(dentry->d_parent->d_inode)->ip_dir_lock_gen;
  65. mlog(0, "negative dentry: %.*s parent gen: %lu "
  66. "dentry gen: %lu\n",
  67. dentry->d_name.len, dentry->d_name.name, pgen, gen);
  68. if (gen != pgen)
  69. goto bail;
  70. goto valid;
  71. }
  72. BUG_ON(!osb);
  73. if (inode == osb->root_inode || is_bad_inode(inode))
  74. goto bail;
  75. spin_lock(&OCFS2_I(inode)->ip_lock);
  76. /* did we or someone else delete this inode? */
  77. if (OCFS2_I(inode)->ip_flags & OCFS2_INODE_DELETED) {
  78. spin_unlock(&OCFS2_I(inode)->ip_lock);
  79. mlog(0, "inode (%llu) deleted, returning false\n",
  80. (unsigned long long)OCFS2_I(inode)->ip_blkno);
  81. goto bail;
  82. }
  83. spin_unlock(&OCFS2_I(inode)->ip_lock);
  84. /*
  85. * We don't need a cluster lock to test this because once an
  86. * inode nlink hits zero, it never goes back.
  87. */
  88. if (inode->i_nlink == 0) {
  89. mlog(0, "Inode %llu orphaned, returning false "
  90. "dir = %d\n",
  91. (unsigned long long)OCFS2_I(inode)->ip_blkno,
  92. S_ISDIR(inode->i_mode));
  93. goto bail;
  94. }
  95. /*
  96. * If the last lookup failed to create dentry lock, let us
  97. * redo it.
  98. */
  99. if (!dentry->d_fsdata) {
  100. mlog(0, "Inode %llu doesn't have dentry lock, "
  101. "returning false\n",
  102. (unsigned long long)OCFS2_I(inode)->ip_blkno);
  103. goto bail;
  104. }
  105. valid:
  106. ret = 1;
  107. bail:
  108. mlog_exit(ret);
  109. return ret;
  110. }
  111. static int ocfs2_match_dentry(struct dentry *dentry,
  112. u64 parent_blkno,
  113. int skip_unhashed)
  114. {
  115. struct inode *parent;
  116. /*
  117. * ocfs2_lookup() does a d_splice_alias() _before_ attaching
  118. * to the lock data, so we skip those here, otherwise
  119. * ocfs2_dentry_attach_lock() will get its original dentry
  120. * back.
  121. */
  122. if (!dentry->d_fsdata)
  123. return 0;
  124. if (!dentry->d_parent)
  125. return 0;
  126. if (skip_unhashed && d_unhashed(dentry))
  127. return 0;
  128. parent = dentry->d_parent->d_inode;
  129. /* Negative parent dentry? */
  130. if (!parent)
  131. return 0;
  132. /* Name is in a different directory. */
  133. if (OCFS2_I(parent)->ip_blkno != parent_blkno)
  134. return 0;
  135. return 1;
  136. }
  137. /*
  138. * Walk the inode alias list, and find a dentry which has a given
  139. * parent. ocfs2_dentry_attach_lock() wants to find _any_ alias as it
  140. * is looking for a dentry_lock reference. The downconvert thread is
  141. * looking to unhash aliases, so we allow it to skip any that already
  142. * have that property.
  143. */
  144. struct dentry *ocfs2_find_local_alias(struct inode *inode,
  145. u64 parent_blkno,
  146. int skip_unhashed)
  147. {
  148. struct list_head *p;
  149. struct dentry *dentry = NULL;
  150. spin_lock(&inode->i_lock);
  151. list_for_each(p, &inode->i_dentry) {
  152. dentry = list_entry(p, struct dentry, d_alias);
  153. spin_lock(&dentry->d_lock);
  154. if (ocfs2_match_dentry(dentry, parent_blkno, skip_unhashed)) {
  155. mlog(0, "dentry found: %.*s\n",
  156. dentry->d_name.len, dentry->d_name.name);
  157. dget_dlock(dentry);
  158. spin_unlock(&dentry->d_lock);
  159. break;
  160. }
  161. spin_unlock(&dentry->d_lock);
  162. dentry = NULL;
  163. }
  164. spin_unlock(&inode->i_lock);
  165. return dentry;
  166. }
  167. DEFINE_SPINLOCK(dentry_attach_lock);
  168. /*
  169. * Attach this dentry to a cluster lock.
  170. *
  171. * Dentry locks cover all links in a given directory to a particular
  172. * inode. We do this so that ocfs2 can build a lock name which all
  173. * nodes in the cluster can agree on at all times. Shoving full names
  174. * in the cluster lock won't work due to size restrictions. Covering
  175. * links inside of a directory is a good compromise because it still
  176. * allows us to use the parent directory lock to synchronize
  177. * operations.
  178. *
  179. * Call this function with the parent dir semaphore and the parent dir
  180. * cluster lock held.
  181. *
  182. * The dir semaphore will protect us from having to worry about
  183. * concurrent processes on our node trying to attach a lock at the
  184. * same time.
  185. *
  186. * The dir cluster lock (held at either PR or EX mode) protects us
  187. * from unlink and rename on other nodes.
  188. *
  189. * A dput() can happen asynchronously due to pruning, so we cover
  190. * attaching and detaching the dentry lock with a
  191. * dentry_attach_lock.
  192. *
  193. * A node which has done lookup on a name retains a protected read
  194. * lock until final dput. If the user requests and unlink or rename,
  195. * the protected read is upgraded to an exclusive lock. Other nodes
  196. * who have seen the dentry will then be informed that they need to
  197. * downgrade their lock, which will involve d_delete on the
  198. * dentry. This happens in ocfs2_dentry_convert_worker().
  199. */
  200. int ocfs2_dentry_attach_lock(struct dentry *dentry,
  201. struct inode *inode,
  202. u64 parent_blkno)
  203. {
  204. int ret;
  205. struct dentry *alias;
  206. struct ocfs2_dentry_lock *dl = dentry->d_fsdata;
  207. mlog(0, "Attach \"%.*s\", parent %llu, fsdata: %p\n",
  208. dentry->d_name.len, dentry->d_name.name,
  209. (unsigned long long)parent_blkno, dl);
  210. /*
  211. * Negative dentry. We ignore these for now.
  212. *
  213. * XXX: Could we can improve ocfs2_dentry_revalidate() by
  214. * tracking these?
  215. */
  216. if (!inode)
  217. return 0;
  218. if (!dentry->d_inode && dentry->d_fsdata) {
  219. /* Converting a negative dentry to positive
  220. Clear dentry->d_fsdata */
  221. dentry->d_fsdata = dl = NULL;
  222. }
  223. if (dl) {
  224. mlog_bug_on_msg(dl->dl_parent_blkno != parent_blkno,
  225. " \"%.*s\": old parent: %llu, new: %llu\n",
  226. dentry->d_name.len, dentry->d_name.name,
  227. (unsigned long long)parent_blkno,
  228. (unsigned long long)dl->dl_parent_blkno);
  229. return 0;
  230. }
  231. alias = ocfs2_find_local_alias(inode, parent_blkno, 0);
  232. if (alias) {
  233. /*
  234. * Great, an alias exists, which means we must have a
  235. * dentry lock already. We can just grab the lock off
  236. * the alias and add it to the list.
  237. *
  238. * We're depending here on the fact that this dentry
  239. * was found and exists in the dcache and so must have
  240. * a reference to the dentry_lock because we can't
  241. * race creates. Final dput() cannot happen on it
  242. * since we have it pinned, so our reference is safe.
  243. */
  244. dl = alias->d_fsdata;
  245. mlog_bug_on_msg(!dl, "parent %llu, ino %llu\n",
  246. (unsigned long long)parent_blkno,
  247. (unsigned long long)OCFS2_I(inode)->ip_blkno);
  248. mlog_bug_on_msg(dl->dl_parent_blkno != parent_blkno,
  249. " \"%.*s\": old parent: %llu, new: %llu\n",
  250. dentry->d_name.len, dentry->d_name.name,
  251. (unsigned long long)parent_blkno,
  252. (unsigned long long)dl->dl_parent_blkno);
  253. mlog(0, "Found: %s\n", dl->dl_lockres.l_name);
  254. goto out_attach;
  255. }
  256. /*
  257. * There are no other aliases
  258. */
  259. dl = kmalloc(sizeof(*dl), GFP_NOFS);
  260. if (!dl) {
  261. ret = -ENOMEM;
  262. mlog_errno(ret);
  263. return ret;
  264. }
  265. dl->dl_count = 0;
  266. /*
  267. * Does this have to happen below, for all attaches, in case
  268. * the struct inode gets blown away by the downconvert thread?
  269. */
  270. dl->dl_inode = igrab(inode);
  271. dl->dl_parent_blkno = parent_blkno;
  272. ocfs2_dentry_lock_res_init(dl, parent_blkno, inode);
  273. out_attach:
  274. spin_lock(&dentry_attach_lock);
  275. dentry->d_fsdata = dl;
  276. dl->dl_count++;
  277. spin_unlock(&dentry_attach_lock);
  278. /*
  279. * This actually gets us our PRMODE level lock. From now on,
  280. * we'll have a notification if one of these names is
  281. * destroyed on another node.
  282. */
  283. ret = ocfs2_dentry_lock(dentry, 0);
  284. if (!ret)
  285. ocfs2_dentry_unlock(dentry, 0);
  286. else
  287. mlog_errno(ret);
  288. /*
  289. * In case of error, manually free the allocation and do the iput().
  290. * We need to do this because error here means no d_instantiate(),
  291. * which means iput() will not be called during dput(dentry).
  292. */
  293. if (ret < 0 && !alias) {
  294. ocfs2_lock_res_free(&dl->dl_lockres);
  295. BUG_ON(dl->dl_count != 1);
  296. spin_lock(&dentry_attach_lock);
  297. dentry->d_fsdata = NULL;
  298. spin_unlock(&dentry_attach_lock);
  299. kfree(dl);
  300. iput(inode);
  301. }
  302. dput(alias);
  303. return ret;
  304. }
  305. DEFINE_SPINLOCK(dentry_list_lock);
  306. /* We limit the number of dentry locks to drop in one go. We have
  307. * this limit so that we don't starve other users of ocfs2_wq. */
  308. #define DL_INODE_DROP_COUNT 64
  309. /* Drop inode references from dentry locks */
  310. static void __ocfs2_drop_dl_inodes(struct ocfs2_super *osb, int drop_count)
  311. {
  312. struct ocfs2_dentry_lock *dl;
  313. spin_lock(&dentry_list_lock);
  314. while (osb->dentry_lock_list && (drop_count < 0 || drop_count--)) {
  315. dl = osb->dentry_lock_list;
  316. osb->dentry_lock_list = dl->dl_next;
  317. spin_unlock(&dentry_list_lock);
  318. iput(dl->dl_inode);
  319. kfree(dl);
  320. spin_lock(&dentry_list_lock);
  321. }
  322. spin_unlock(&dentry_list_lock);
  323. }
  324. void ocfs2_drop_dl_inodes(struct work_struct *work)
  325. {
  326. struct ocfs2_super *osb = container_of(work, struct ocfs2_super,
  327. dentry_lock_work);
  328. __ocfs2_drop_dl_inodes(osb, DL_INODE_DROP_COUNT);
  329. /*
  330. * Don't queue dropping if umount is in progress. We flush the
  331. * list in ocfs2_dismount_volume
  332. */
  333. spin_lock(&dentry_list_lock);
  334. if (osb->dentry_lock_list &&
  335. !ocfs2_test_osb_flag(osb, OCFS2_OSB_DROP_DENTRY_LOCK_IMMED))
  336. queue_work(ocfs2_wq, &osb->dentry_lock_work);
  337. spin_unlock(&dentry_list_lock);
  338. }
  339. /* Flush the whole work queue */
  340. void ocfs2_drop_all_dl_inodes(struct ocfs2_super *osb)
  341. {
  342. __ocfs2_drop_dl_inodes(osb, -1);
  343. }
  344. /*
  345. * ocfs2_dentry_iput() and friends.
  346. *
  347. * At this point, our particular dentry is detached from the inodes
  348. * alias list, so there's no way that the locking code can find it.
  349. *
  350. * The interesting stuff happens when we determine that our lock needs
  351. * to go away because this is the last subdir alias in the
  352. * system. This function needs to handle a couple things:
  353. *
  354. * 1) Synchronizing lock shutdown with the downconvert threads. This
  355. * is already handled for us via the lockres release drop function
  356. * called in ocfs2_release_dentry_lock()
  357. *
  358. * 2) A race may occur when we're doing our lock shutdown and
  359. * another process wants to create a new dentry lock. Right now we
  360. * let them race, which means that for a very short while, this
  361. * node might have two locks on a lock resource. This should be a
  362. * problem though because one of them is in the process of being
  363. * thrown out.
  364. */
  365. static void ocfs2_drop_dentry_lock(struct ocfs2_super *osb,
  366. struct ocfs2_dentry_lock *dl)
  367. {
  368. ocfs2_simple_drop_lockres(osb, &dl->dl_lockres);
  369. ocfs2_lock_res_free(&dl->dl_lockres);
  370. /* We leave dropping of inode reference to ocfs2_wq as that can
  371. * possibly lead to inode deletion which gets tricky */
  372. spin_lock(&dentry_list_lock);
  373. if (!osb->dentry_lock_list &&
  374. !ocfs2_test_osb_flag(osb, OCFS2_OSB_DROP_DENTRY_LOCK_IMMED))
  375. queue_work(ocfs2_wq, &osb->dentry_lock_work);
  376. dl->dl_next = osb->dentry_lock_list;
  377. osb->dentry_lock_list = dl;
  378. spin_unlock(&dentry_list_lock);
  379. }
  380. void ocfs2_dentry_lock_put(struct ocfs2_super *osb,
  381. struct ocfs2_dentry_lock *dl)
  382. {
  383. int unlock;
  384. BUG_ON(dl->dl_count == 0);
  385. spin_lock(&dentry_attach_lock);
  386. dl->dl_count--;
  387. unlock = !dl->dl_count;
  388. spin_unlock(&dentry_attach_lock);
  389. if (unlock)
  390. ocfs2_drop_dentry_lock(osb, dl);
  391. }
  392. static void ocfs2_dentry_iput(struct dentry *dentry, struct inode *inode)
  393. {
  394. struct ocfs2_dentry_lock *dl = dentry->d_fsdata;
  395. if (!dl) {
  396. /*
  397. * No dentry lock is ok if we're disconnected or
  398. * unhashed.
  399. */
  400. if (!(dentry->d_flags & DCACHE_DISCONNECTED) &&
  401. !d_unhashed(dentry)) {
  402. unsigned long long ino = 0ULL;
  403. if (inode)
  404. ino = (unsigned long long)OCFS2_I(inode)->ip_blkno;
  405. mlog(ML_ERROR, "Dentry is missing cluster lock. "
  406. "inode: %llu, d_flags: 0x%x, d_name: %.*s\n",
  407. ino, dentry->d_flags, dentry->d_name.len,
  408. dentry->d_name.name);
  409. }
  410. goto out;
  411. }
  412. mlog_bug_on_msg(dl->dl_count == 0, "dentry: %.*s, count: %u\n",
  413. dentry->d_name.len, dentry->d_name.name,
  414. dl->dl_count);
  415. ocfs2_dentry_lock_put(OCFS2_SB(dentry->d_sb), dl);
  416. out:
  417. iput(inode);
  418. }
  419. /*
  420. * d_move(), but keep the locks in sync.
  421. *
  422. * When we are done, "dentry" will have the parent dir and name of
  423. * "target", which will be thrown away.
  424. *
  425. * We manually update the lock of "dentry" if need be.
  426. *
  427. * "target" doesn't have it's dentry lock touched - we allow the later
  428. * dput() to handle this for us.
  429. *
  430. * This is called during ocfs2_rename(), while holding parent
  431. * directory locks. The dentries have already been deleted on other
  432. * nodes via ocfs2_remote_dentry_delete().
  433. *
  434. * Normally, the VFS handles the d_move() for the file system, after
  435. * the ->rename() callback. OCFS2 wants to handle this internally, so
  436. * the new lock can be created atomically with respect to the cluster.
  437. */
  438. void ocfs2_dentry_move(struct dentry *dentry, struct dentry *target,
  439. struct inode *old_dir, struct inode *new_dir)
  440. {
  441. int ret;
  442. struct ocfs2_super *osb = OCFS2_SB(old_dir->i_sb);
  443. struct inode *inode = dentry->d_inode;
  444. /*
  445. * Move within the same directory, so the actual lock info won't
  446. * change.
  447. *
  448. * XXX: Is there any advantage to dropping the lock here?
  449. */
  450. if (old_dir == new_dir)
  451. goto out_move;
  452. ocfs2_dentry_lock_put(osb, dentry->d_fsdata);
  453. dentry->d_fsdata = NULL;
  454. ret = ocfs2_dentry_attach_lock(dentry, inode, OCFS2_I(new_dir)->ip_blkno);
  455. if (ret)
  456. mlog_errno(ret);
  457. out_move:
  458. d_move(dentry, target);
  459. }
  460. const struct dentry_operations ocfs2_dentry_ops = {
  461. .d_revalidate = ocfs2_dentry_revalidate,
  462. .d_iput = ocfs2_dentry_iput,
  463. };