dcache.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461
  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. static int ocfs2_dentry_revalidate(struct dentry *dentry,
  39. struct nameidata *nd)
  40. {
  41. struct inode *inode = dentry->d_inode;
  42. int ret = 0; /* if all else fails, just return false */
  43. struct ocfs2_super *osb = OCFS2_SB(dentry->d_sb);
  44. mlog_entry("(0x%p, '%.*s')\n", dentry,
  45. dentry->d_name.len, dentry->d_name.name);
  46. /* Never trust a negative dentry - force a new lookup. */
  47. if (inode == NULL) {
  48. mlog(0, "negative dentry: %.*s\n", dentry->d_name.len,
  49. dentry->d_name.name);
  50. goto bail;
  51. }
  52. BUG_ON(!osb);
  53. if (inode == osb->root_inode || is_bad_inode(inode))
  54. goto bail;
  55. spin_lock(&OCFS2_I(inode)->ip_lock);
  56. /* did we or someone else delete this inode? */
  57. if (OCFS2_I(inode)->ip_flags & OCFS2_INODE_DELETED) {
  58. spin_unlock(&OCFS2_I(inode)->ip_lock);
  59. mlog(0, "inode (%llu) deleted, returning false\n",
  60. (unsigned long long)OCFS2_I(inode)->ip_blkno);
  61. goto bail;
  62. }
  63. spin_unlock(&OCFS2_I(inode)->ip_lock);
  64. /*
  65. * We don't need a cluster lock to test this because once an
  66. * inode nlink hits zero, it never goes back.
  67. */
  68. if (inode->i_nlink == 0) {
  69. mlog(0, "Inode %llu orphaned, returning false "
  70. "dir = %d\n",
  71. (unsigned long long)OCFS2_I(inode)->ip_blkno,
  72. S_ISDIR(inode->i_mode));
  73. goto bail;
  74. }
  75. ret = 1;
  76. bail:
  77. mlog_exit(ret);
  78. return ret;
  79. }
  80. static int ocfs2_match_dentry(struct dentry *dentry,
  81. u64 parent_blkno,
  82. int skip_unhashed)
  83. {
  84. struct inode *parent;
  85. /*
  86. * ocfs2_lookup() does a d_splice_alias() _before_ attaching
  87. * to the lock data, so we skip those here, otherwise
  88. * ocfs2_dentry_attach_lock() will get its original dentry
  89. * back.
  90. */
  91. if (!dentry->d_fsdata)
  92. return 0;
  93. if (!dentry->d_parent)
  94. return 0;
  95. if (skip_unhashed && d_unhashed(dentry))
  96. return 0;
  97. parent = dentry->d_parent->d_inode;
  98. /* Negative parent dentry? */
  99. if (!parent)
  100. return 0;
  101. /* Name is in a different directory. */
  102. if (OCFS2_I(parent)->ip_blkno != parent_blkno)
  103. return 0;
  104. return 1;
  105. }
  106. /*
  107. * Walk the inode alias list, and find a dentry which has a given
  108. * parent. ocfs2_dentry_attach_lock() wants to find _any_ alias as it
  109. * is looking for a dentry_lock reference. The downconvert thread is
  110. * looking to unhash aliases, so we allow it to skip any that already
  111. * have that property.
  112. */
  113. struct dentry *ocfs2_find_local_alias(struct inode *inode,
  114. u64 parent_blkno,
  115. int skip_unhashed)
  116. {
  117. struct list_head *p;
  118. struct dentry *dentry = NULL;
  119. spin_lock(&dcache_lock);
  120. list_for_each(p, &inode->i_dentry) {
  121. dentry = list_entry(p, struct dentry, d_alias);
  122. if (ocfs2_match_dentry(dentry, parent_blkno, skip_unhashed)) {
  123. mlog(0, "dentry found: %.*s\n",
  124. dentry->d_name.len, dentry->d_name.name);
  125. dget_locked(dentry);
  126. break;
  127. }
  128. dentry = NULL;
  129. }
  130. spin_unlock(&dcache_lock);
  131. return dentry;
  132. }
  133. DEFINE_SPINLOCK(dentry_attach_lock);
  134. /*
  135. * Attach this dentry to a cluster lock.
  136. *
  137. * Dentry locks cover all links in a given directory to a particular
  138. * inode. We do this so that ocfs2 can build a lock name which all
  139. * nodes in the cluster can agree on at all times. Shoving full names
  140. * in the cluster lock won't work due to size restrictions. Covering
  141. * links inside of a directory is a good compromise because it still
  142. * allows us to use the parent directory lock to synchronize
  143. * operations.
  144. *
  145. * Call this function with the parent dir semaphore and the parent dir
  146. * cluster lock held.
  147. *
  148. * The dir semaphore will protect us from having to worry about
  149. * concurrent processes on our node trying to attach a lock at the
  150. * same time.
  151. *
  152. * The dir cluster lock (held at either PR or EX mode) protects us
  153. * from unlink and rename on other nodes.
  154. *
  155. * A dput() can happen asynchronously due to pruning, so we cover
  156. * attaching and detaching the dentry lock with a
  157. * dentry_attach_lock.
  158. *
  159. * A node which has done lookup on a name retains a protected read
  160. * lock until final dput. If the user requests and unlink or rename,
  161. * the protected read is upgraded to an exclusive lock. Other nodes
  162. * who have seen the dentry will then be informed that they need to
  163. * downgrade their lock, which will involve d_delete on the
  164. * dentry. This happens in ocfs2_dentry_convert_worker().
  165. */
  166. int ocfs2_dentry_attach_lock(struct dentry *dentry,
  167. struct inode *inode,
  168. u64 parent_blkno)
  169. {
  170. int ret;
  171. struct dentry *alias;
  172. struct ocfs2_dentry_lock *dl = dentry->d_fsdata;
  173. mlog(0, "Attach \"%.*s\", parent %llu, fsdata: %p\n",
  174. dentry->d_name.len, dentry->d_name.name,
  175. (unsigned long long)parent_blkno, dl);
  176. /*
  177. * Negative dentry. We ignore these for now.
  178. *
  179. * XXX: Could we can improve ocfs2_dentry_revalidate() by
  180. * tracking these?
  181. */
  182. if (!inode)
  183. return 0;
  184. if (dl) {
  185. mlog_bug_on_msg(dl->dl_parent_blkno != parent_blkno,
  186. " \"%.*s\": old parent: %llu, new: %llu\n",
  187. dentry->d_name.len, dentry->d_name.name,
  188. (unsigned long long)parent_blkno,
  189. (unsigned long long)dl->dl_parent_blkno);
  190. return 0;
  191. }
  192. alias = ocfs2_find_local_alias(inode, parent_blkno, 0);
  193. if (alias) {
  194. /*
  195. * Great, an alias exists, which means we must have a
  196. * dentry lock already. We can just grab the lock off
  197. * the alias and add it to the list.
  198. *
  199. * We're depending here on the fact that this dentry
  200. * was found and exists in the dcache and so must have
  201. * a reference to the dentry_lock because we can't
  202. * race creates. Final dput() cannot happen on it
  203. * since we have it pinned, so our reference is safe.
  204. */
  205. dl = alias->d_fsdata;
  206. mlog_bug_on_msg(!dl, "parent %llu, ino %llu\n",
  207. (unsigned long long)parent_blkno,
  208. (unsigned long long)OCFS2_I(inode)->ip_blkno);
  209. mlog_bug_on_msg(dl->dl_parent_blkno != parent_blkno,
  210. " \"%.*s\": old parent: %llu, new: %llu\n",
  211. dentry->d_name.len, dentry->d_name.name,
  212. (unsigned long long)parent_blkno,
  213. (unsigned long long)dl->dl_parent_blkno);
  214. mlog(0, "Found: %s\n", dl->dl_lockres.l_name);
  215. goto out_attach;
  216. }
  217. /*
  218. * There are no other aliases
  219. */
  220. dl = kmalloc(sizeof(*dl), GFP_NOFS);
  221. if (!dl) {
  222. ret = -ENOMEM;
  223. mlog_errno(ret);
  224. return ret;
  225. }
  226. dl->dl_count = 0;
  227. /*
  228. * Does this have to happen below, for all attaches, in case
  229. * the struct inode gets blown away by the downconvert thread?
  230. */
  231. dl->dl_inode = igrab(inode);
  232. dl->dl_parent_blkno = parent_blkno;
  233. ocfs2_dentry_lock_res_init(dl, parent_blkno, inode);
  234. out_attach:
  235. spin_lock(&dentry_attach_lock);
  236. dentry->d_fsdata = dl;
  237. dl->dl_count++;
  238. spin_unlock(&dentry_attach_lock);
  239. /*
  240. * This actually gets us our PRMODE level lock. From now on,
  241. * we'll have a notification if one of these names is
  242. * destroyed on another node.
  243. */
  244. ret = ocfs2_dentry_lock(dentry, 0);
  245. if (!ret)
  246. ocfs2_dentry_unlock(dentry, 0);
  247. else
  248. mlog_errno(ret);
  249. dput(alias);
  250. return ret;
  251. }
  252. static DEFINE_SPINLOCK(dentry_list_lock);
  253. /* We limit the number of dentry locks to drop in one go. We have
  254. * this limit so that we don't starve other users of ocfs2_wq. */
  255. #define DL_INODE_DROP_COUNT 64
  256. /* Drop inode references from dentry locks */
  257. void ocfs2_drop_dl_inodes(struct work_struct *work)
  258. {
  259. struct ocfs2_super *osb = container_of(work, struct ocfs2_super,
  260. dentry_lock_work);
  261. struct ocfs2_dentry_lock *dl;
  262. int drop_count = DL_INODE_DROP_COUNT;
  263. spin_lock(&dentry_list_lock);
  264. while (osb->dentry_lock_list && drop_count--) {
  265. dl = osb->dentry_lock_list;
  266. osb->dentry_lock_list = dl->dl_next;
  267. spin_unlock(&dentry_list_lock);
  268. iput(dl->dl_inode);
  269. kfree(dl);
  270. spin_lock(&dentry_list_lock);
  271. }
  272. if (osb->dentry_lock_list)
  273. queue_work(ocfs2_wq, &osb->dentry_lock_work);
  274. spin_unlock(&dentry_list_lock);
  275. }
  276. /*
  277. * ocfs2_dentry_iput() and friends.
  278. *
  279. * At this point, our particular dentry is detached from the inodes
  280. * alias list, so there's no way that the locking code can find it.
  281. *
  282. * The interesting stuff happens when we determine that our lock needs
  283. * to go away because this is the last subdir alias in the
  284. * system. This function needs to handle a couple things:
  285. *
  286. * 1) Synchronizing lock shutdown with the downconvert threads. This
  287. * is already handled for us via the lockres release drop function
  288. * called in ocfs2_release_dentry_lock()
  289. *
  290. * 2) A race may occur when we're doing our lock shutdown and
  291. * another process wants to create a new dentry lock. Right now we
  292. * let them race, which means that for a very short while, this
  293. * node might have two locks on a lock resource. This should be a
  294. * problem though because one of them is in the process of being
  295. * thrown out.
  296. */
  297. static void ocfs2_drop_dentry_lock(struct ocfs2_super *osb,
  298. struct ocfs2_dentry_lock *dl)
  299. {
  300. ocfs2_simple_drop_lockres(osb, &dl->dl_lockres);
  301. ocfs2_lock_res_free(&dl->dl_lockres);
  302. /* We leave dropping of inode reference to ocfs2_wq as that can
  303. * possibly lead to inode deletion which gets tricky */
  304. spin_lock(&dentry_list_lock);
  305. if (!osb->dentry_lock_list)
  306. queue_work(ocfs2_wq, &osb->dentry_lock_work);
  307. dl->dl_next = osb->dentry_lock_list;
  308. osb->dentry_lock_list = dl;
  309. spin_unlock(&dentry_list_lock);
  310. }
  311. void ocfs2_dentry_lock_put(struct ocfs2_super *osb,
  312. struct ocfs2_dentry_lock *dl)
  313. {
  314. int unlock;
  315. BUG_ON(dl->dl_count == 0);
  316. spin_lock(&dentry_attach_lock);
  317. dl->dl_count--;
  318. unlock = !dl->dl_count;
  319. spin_unlock(&dentry_attach_lock);
  320. if (unlock)
  321. ocfs2_drop_dentry_lock(osb, dl);
  322. }
  323. static void ocfs2_dentry_iput(struct dentry *dentry, struct inode *inode)
  324. {
  325. struct ocfs2_dentry_lock *dl = dentry->d_fsdata;
  326. if (!dl) {
  327. /*
  328. * No dentry lock is ok if we're disconnected or
  329. * unhashed.
  330. */
  331. if (!(dentry->d_flags & DCACHE_DISCONNECTED) &&
  332. !d_unhashed(dentry)) {
  333. unsigned long long ino = 0ULL;
  334. if (inode)
  335. ino = (unsigned long long)OCFS2_I(inode)->ip_blkno;
  336. mlog(ML_ERROR, "Dentry is missing cluster lock. "
  337. "inode: %llu, d_flags: 0x%x, d_name: %.*s\n",
  338. ino, dentry->d_flags, dentry->d_name.len,
  339. dentry->d_name.name);
  340. }
  341. goto out;
  342. }
  343. mlog_bug_on_msg(dl->dl_count == 0, "dentry: %.*s, count: %u\n",
  344. dentry->d_name.len, dentry->d_name.name,
  345. dl->dl_count);
  346. ocfs2_dentry_lock_put(OCFS2_SB(dentry->d_sb), dl);
  347. out:
  348. iput(inode);
  349. }
  350. /*
  351. * d_move(), but keep the locks in sync.
  352. *
  353. * When we are done, "dentry" will have the parent dir and name of
  354. * "target", which will be thrown away.
  355. *
  356. * We manually update the lock of "dentry" if need be.
  357. *
  358. * "target" doesn't have it's dentry lock touched - we allow the later
  359. * dput() to handle this for us.
  360. *
  361. * This is called during ocfs2_rename(), while holding parent
  362. * directory locks. The dentries have already been deleted on other
  363. * nodes via ocfs2_remote_dentry_delete().
  364. *
  365. * Normally, the VFS handles the d_move() for the file system, after
  366. * the ->rename() callback. OCFS2 wants to handle this internally, so
  367. * the new lock can be created atomically with respect to the cluster.
  368. */
  369. void ocfs2_dentry_move(struct dentry *dentry, struct dentry *target,
  370. struct inode *old_dir, struct inode *new_dir)
  371. {
  372. int ret;
  373. struct ocfs2_super *osb = OCFS2_SB(old_dir->i_sb);
  374. struct inode *inode = dentry->d_inode;
  375. /*
  376. * Move within the same directory, so the actual lock info won't
  377. * change.
  378. *
  379. * XXX: Is there any advantage to dropping the lock here?
  380. */
  381. if (old_dir == new_dir)
  382. goto out_move;
  383. ocfs2_dentry_lock_put(osb, dentry->d_fsdata);
  384. dentry->d_fsdata = NULL;
  385. ret = ocfs2_dentry_attach_lock(dentry, inode, OCFS2_I(new_dir)->ip_blkno);
  386. if (ret)
  387. mlog_errno(ret);
  388. out_move:
  389. d_move(dentry, target);
  390. }
  391. const struct dentry_operations ocfs2_dentry_ops = {
  392. .d_revalidate = ocfs2_dentry_revalidate,
  393. .d_iput = ocfs2_dentry_iput,
  394. };