dcache.c 15 KB

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