inode_mark.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463
  1. /*
  2. * Copyright (C) 2008 Red Hat, Inc., Eric Paris <eparis@redhat.com>
  3. *
  4. * This program is free software; you can redistribute it and/or modify
  5. * it under the terms of the GNU General Public License as published by
  6. * the Free Software Foundation; either version 2, or (at your option)
  7. * any later version.
  8. *
  9. * This program is distributed in the hope that it will be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. * GNU General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU General Public License
  15. * along with this program; see the file COPYING. If not, write to
  16. * the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
  17. */
  18. /*
  19. * fsnotify inode mark locking/lifetime/and refcnting
  20. *
  21. * REFCNT:
  22. * The mark->refcnt tells how many "things" in the kernel currently are
  23. * referencing this object. The object typically will live inside the kernel
  24. * with a refcnt of 2, one for each list it is on (i_list, g_list). Any task
  25. * which can find this object holding the appropriete locks, can take a reference
  26. * and the object itself is guarenteed to survive until the reference is dropped.
  27. *
  28. * LOCKING:
  29. * There are 3 spinlocks involved with fsnotify inode marks and they MUST
  30. * be taken in order as follows:
  31. *
  32. * mark->lock
  33. * group->mark_lock
  34. * inode->i_lock
  35. *
  36. * mark->lock protects 2 things, mark->group and mark->inode. You must hold
  37. * that lock to dereference either of these things (they could be NULL even with
  38. * the lock)
  39. *
  40. * group->mark_lock protects the marks_list anchored inside a given group
  41. * and each mark is hooked via the g_list. It also sorta protects the
  42. * free_g_list, which when used is anchored by a private list on the stack of the
  43. * task which held the group->mark_lock.
  44. *
  45. * inode->i_lock protects the i_fsnotify_marks list anchored inside a
  46. * given inode and each mark is hooked via the i_list. (and sorta the
  47. * free_i_list)
  48. *
  49. *
  50. * LIFETIME:
  51. * Inode marks survive between when they are added to an inode and when their
  52. * refcnt==0.
  53. *
  54. * The inode mark can be cleared for a number of different reasons including:
  55. * - The inode is unlinked for the last time. (fsnotify_inode_remove)
  56. * - The inode is being evicted from cache. (fsnotify_inode_delete)
  57. * - The fs the inode is on is unmounted. (fsnotify_inode_delete/fsnotify_unmount_inodes)
  58. * - Something explicitly requests that it be removed. (fsnotify_destroy_mark)
  59. * - The fsnotify_group associated with the mark is going away and all such marks
  60. * need to be cleaned up. (fsnotify_clear_marks_by_group)
  61. *
  62. * Worst case we are given an inode and need to clean up all the marks on that
  63. * inode. We take i_lock and walk the i_fsnotify_marks safely. For each
  64. * mark on the list we take a reference (so the mark can't disappear under us).
  65. * We remove that mark form the inode's list of marks and we add this mark to a
  66. * private list anchored on the stack using i_free_list; At this point we no
  67. * longer fear anything finding the mark using the inode's list of marks.
  68. *
  69. * We can safely and locklessly run the private list on the stack of everything
  70. * we just unattached from the original inode. For each mark on the private list
  71. * we grab the mark-> and can thus dereference mark->group and mark->inode. If
  72. * we see the group and inode are not NULL we take those locks. Now holding all
  73. * 3 locks we can completely remove the mark from other tasks finding it in the
  74. * future. Remember, 10 things might already be referencing this mark, but they
  75. * better be holding a ref. We drop our reference we took before we unhooked it
  76. * from the inode. When the ref hits 0 we can free the mark.
  77. *
  78. * Very similarly for freeing by group, except we use free_g_list.
  79. *
  80. * This has the very interesting property of being able to run concurrently with
  81. * any (or all) other directions.
  82. */
  83. #include <linux/fs.h>
  84. #include <linux/init.h>
  85. #include <linux/kernel.h>
  86. #include <linux/module.h>
  87. #include <linux/mutex.h>
  88. #include <linux/spinlock.h>
  89. #include <linux/writeback.h> /* for inode_lock */
  90. #include <asm/atomic.h>
  91. #include <linux/fsnotify_backend.h>
  92. #include "fsnotify.h"
  93. void fsnotify_get_mark(struct fsnotify_mark *mark)
  94. {
  95. atomic_inc(&mark->refcnt);
  96. }
  97. void fsnotify_put_mark(struct fsnotify_mark *mark)
  98. {
  99. if (atomic_dec_and_test(&mark->refcnt))
  100. mark->free_mark(mark);
  101. }
  102. /*
  103. * Recalculate the mask of events relevant to a given inode locked.
  104. */
  105. static void fsnotify_recalc_inode_mask_locked(struct inode *inode)
  106. {
  107. struct fsnotify_mark *mark;
  108. struct hlist_node *pos;
  109. __u32 new_mask = 0;
  110. assert_spin_locked(&inode->i_lock);
  111. hlist_for_each_entry(mark, pos, &inode->i_fsnotify_marks, i.i_list)
  112. new_mask |= mark->mask;
  113. inode->i_fsnotify_mask = new_mask;
  114. }
  115. /*
  116. * Recalculate the inode->i_fsnotify_mask, or the mask of all FS_* event types
  117. * any notifier is interested in hearing for this inode.
  118. */
  119. void fsnotify_recalc_inode_mask(struct inode *inode)
  120. {
  121. spin_lock(&inode->i_lock);
  122. fsnotify_recalc_inode_mask_locked(inode);
  123. spin_unlock(&inode->i_lock);
  124. __fsnotify_update_child_dentry_flags(inode);
  125. }
  126. /*
  127. * Any time a mark is getting freed we end up here.
  128. * The caller had better be holding a reference to this mark so we don't actually
  129. * do the final put under the mark->lock
  130. */
  131. void fsnotify_destroy_mark(struct fsnotify_mark *mark)
  132. {
  133. struct fsnotify_group *group;
  134. struct inode *inode;
  135. spin_lock(&mark->lock);
  136. group = mark->group;
  137. inode = mark->i.inode;
  138. BUG_ON(group && !inode);
  139. BUG_ON(!group && inode);
  140. /* if !group something else already marked this to die */
  141. if (!group) {
  142. spin_unlock(&mark->lock);
  143. return;
  144. }
  145. /* 1 from caller and 1 for being on i_list/g_list */
  146. BUG_ON(atomic_read(&mark->refcnt) < 2);
  147. spin_lock(&group->mark_lock);
  148. spin_lock(&inode->i_lock);
  149. hlist_del_init(&mark->i.i_list);
  150. mark->i.inode = NULL;
  151. list_del_init(&mark->g_list);
  152. mark->group = NULL;
  153. fsnotify_put_mark(mark); /* for i_list and g_list */
  154. /*
  155. * this mark is now off the inode->i_fsnotify_marks list and we
  156. * hold the inode->i_lock, so this is the perfect time to update the
  157. * inode->i_fsnotify_mask
  158. */
  159. fsnotify_recalc_inode_mask_locked(inode);
  160. spin_unlock(&inode->i_lock);
  161. spin_unlock(&group->mark_lock);
  162. spin_unlock(&mark->lock);
  163. /*
  164. * Some groups like to know that marks are being freed. This is a
  165. * callback to the group function to let it know that this mark
  166. * is being freed.
  167. */
  168. if (group->ops->freeing_mark)
  169. group->ops->freeing_mark(mark, group);
  170. /*
  171. * __fsnotify_update_child_dentry_flags(inode);
  172. *
  173. * I really want to call that, but we can't, we have no idea if the inode
  174. * still exists the second we drop the mark->lock.
  175. *
  176. * The next time an event arrive to this inode from one of it's children
  177. * __fsnotify_parent will see that the inode doesn't care about it's
  178. * children and will update all of these flags then. So really this
  179. * is just a lazy update (and could be a perf win...)
  180. */
  181. iput(inode);
  182. /*
  183. * it's possible that this group tried to destroy itself, but this
  184. * this mark was simultaneously being freed by inode. If that's the
  185. * case, we finish freeing the group here.
  186. */
  187. if (unlikely(atomic_dec_and_test(&group->num_marks)))
  188. fsnotify_final_destroy_group(group);
  189. }
  190. /*
  191. * Given a group, destroy all of the marks associated with that group.
  192. */
  193. void fsnotify_clear_marks_by_group(struct fsnotify_group *group)
  194. {
  195. struct fsnotify_mark *lmark, *mark;
  196. LIST_HEAD(free_list);
  197. spin_lock(&group->mark_lock);
  198. list_for_each_entry_safe(mark, lmark, &group->marks_list, g_list) {
  199. list_add(&mark->free_g_list, &free_list);
  200. list_del_init(&mark->g_list);
  201. fsnotify_get_mark(mark);
  202. }
  203. spin_unlock(&group->mark_lock);
  204. list_for_each_entry_safe(mark, lmark, &free_list, free_g_list) {
  205. fsnotify_destroy_mark(mark);
  206. fsnotify_put_mark(mark);
  207. }
  208. }
  209. /*
  210. * Given an inode, destroy all of the marks associated with that inode.
  211. */
  212. void fsnotify_clear_marks_by_inode(struct inode *inode)
  213. {
  214. struct fsnotify_mark *mark, *lmark;
  215. struct hlist_node *pos, *n;
  216. LIST_HEAD(free_list);
  217. spin_lock(&inode->i_lock);
  218. hlist_for_each_entry_safe(mark, pos, n, &inode->i_fsnotify_marks, i.i_list) {
  219. list_add(&mark->i.free_i_list, &free_list);
  220. hlist_del_init(&mark->i.i_list);
  221. fsnotify_get_mark(mark);
  222. }
  223. spin_unlock(&inode->i_lock);
  224. list_for_each_entry_safe(mark, lmark, &free_list, i.free_i_list) {
  225. fsnotify_destroy_mark(mark);
  226. fsnotify_put_mark(mark);
  227. }
  228. }
  229. static struct fsnotify_mark *fsnotify_find_mark_locked(struct fsnotify_group *group,
  230. struct inode *inode)
  231. {
  232. struct fsnotify_mark *mark;
  233. struct hlist_node *pos;
  234. assert_spin_locked(&inode->i_lock);
  235. hlist_for_each_entry(mark, pos, &inode->i_fsnotify_marks, i.i_list) {
  236. if (mark->group == group) {
  237. fsnotify_get_mark(mark);
  238. return mark;
  239. }
  240. }
  241. return NULL;
  242. }
  243. /*
  244. * given a group and inode, find the mark associated with that combination.
  245. * if found take a reference to that mark and return it, else return NULL
  246. */
  247. struct fsnotify_mark *fsnotify_find_mark(struct fsnotify_group *group,
  248. struct inode *inode)
  249. {
  250. struct fsnotify_mark *mark;
  251. spin_lock(&inode->i_lock);
  252. mark = fsnotify_find_mark_locked(group, inode);
  253. spin_unlock(&inode->i_lock);
  254. return mark;
  255. }
  256. void fsnotify_duplicate_mark(struct fsnotify_mark *new, struct fsnotify_mark *old)
  257. {
  258. assert_spin_locked(&old->lock);
  259. new->i.inode = old->i.inode;
  260. new->group = old->group;
  261. new->mask = old->mask;
  262. new->free_mark = old->free_mark;
  263. }
  264. /*
  265. * Nothing fancy, just initialize lists and locks and counters.
  266. */
  267. void fsnotify_init_mark(struct fsnotify_mark *mark,
  268. void (*free_mark)(struct fsnotify_mark *mark))
  269. {
  270. spin_lock_init(&mark->lock);
  271. atomic_set(&mark->refcnt, 1);
  272. INIT_HLIST_NODE(&mark->i.i_list);
  273. mark->group = NULL;
  274. mark->mask = 0;
  275. mark->i.inode = NULL;
  276. mark->free_mark = free_mark;
  277. }
  278. /*
  279. * Attach an initialized mark mark to a given group and inode.
  280. * These marks may be used for the fsnotify backend to determine which
  281. * event types should be delivered to which group and for which inodes.
  282. */
  283. int fsnotify_add_mark(struct fsnotify_mark *mark,
  284. struct fsnotify_group *group, struct inode *inode,
  285. int allow_dups)
  286. {
  287. struct fsnotify_mark *lmark = NULL;
  288. int ret = 0;
  289. inode = igrab(inode);
  290. if (unlikely(!inode))
  291. return -EINVAL;
  292. mark->flags = FSNOTIFY_MARK_FLAG_INODE;
  293. /*
  294. * if this group isn't being testing for inode type events we need
  295. * to start testing
  296. */
  297. if (unlikely(list_empty(&group->inode_group_list)))
  298. fsnotify_add_inode_group(group);
  299. /*
  300. * XXX This is where we could also do the fsnotify_add_vfsmount_group
  301. * if we are setting and vfsmount mark....
  302. if (unlikely(list_empty(&group->vfsmount_group_list)))
  303. fsnotify_add_vfsmount_group(group);
  304. */
  305. /*
  306. * LOCKING ORDER!!!!
  307. * mark->lock
  308. * group->mark_lock
  309. * inode->i_lock
  310. */
  311. spin_lock(&mark->lock);
  312. spin_lock(&group->mark_lock);
  313. spin_lock(&inode->i_lock);
  314. if (!allow_dups)
  315. lmark = fsnotify_find_mark_locked(group, inode);
  316. if (!lmark) {
  317. mark->group = group;
  318. mark->i.inode = inode;
  319. hlist_add_head(&mark->i.i_list, &inode->i_fsnotify_marks);
  320. list_add(&mark->g_list, &group->marks_list);
  321. fsnotify_get_mark(mark); /* for i_list and g_list */
  322. atomic_inc(&group->num_marks);
  323. fsnotify_recalc_inode_mask_locked(inode);
  324. }
  325. spin_unlock(&inode->i_lock);
  326. spin_unlock(&group->mark_lock);
  327. spin_unlock(&mark->lock);
  328. if (lmark) {
  329. ret = -EEXIST;
  330. iput(inode);
  331. fsnotify_put_mark(lmark);
  332. } else {
  333. __fsnotify_update_child_dentry_flags(inode);
  334. }
  335. return ret;
  336. }
  337. /**
  338. * fsnotify_unmount_inodes - an sb is unmounting. handle any watched inodes.
  339. * @list: list of inodes being unmounted (sb->s_inodes)
  340. *
  341. * Called with inode_lock held, protecting the unmounting super block's list
  342. * of inodes, and with iprune_mutex held, keeping shrink_icache_memory() at bay.
  343. * We temporarily drop inode_lock, however, and CAN block.
  344. */
  345. void fsnotify_unmount_inodes(struct list_head *list)
  346. {
  347. struct inode *inode, *next_i, *need_iput = NULL;
  348. list_for_each_entry_safe(inode, next_i, list, i_sb_list) {
  349. struct inode *need_iput_tmp;
  350. /*
  351. * We cannot __iget() an inode in state I_CLEAR, I_FREEING,
  352. * I_WILL_FREE, or I_NEW which is fine because by that point
  353. * the inode cannot have any associated watches.
  354. */
  355. if (inode->i_state & (I_CLEAR|I_FREEING|I_WILL_FREE|I_NEW))
  356. continue;
  357. /*
  358. * If i_count is zero, the inode cannot have any watches and
  359. * doing an __iget/iput with MS_ACTIVE clear would actually
  360. * evict all inodes with zero i_count from icache which is
  361. * unnecessarily violent and may in fact be illegal to do.
  362. */
  363. if (!atomic_read(&inode->i_count))
  364. continue;
  365. need_iput_tmp = need_iput;
  366. need_iput = NULL;
  367. /* In case fsnotify_inode_delete() drops a reference. */
  368. if (inode != need_iput_tmp)
  369. __iget(inode);
  370. else
  371. need_iput_tmp = NULL;
  372. /* In case the dropping of a reference would nuke next_i. */
  373. if ((&next_i->i_sb_list != list) &&
  374. atomic_read(&next_i->i_count) &&
  375. !(next_i->i_state & (I_CLEAR | I_FREEING | I_WILL_FREE))) {
  376. __iget(next_i);
  377. need_iput = next_i;
  378. }
  379. /*
  380. * We can safely drop inode_lock here because we hold
  381. * references on both inode and next_i. Also no new inodes
  382. * will be added since the umount has begun. Finally,
  383. * iprune_mutex keeps shrink_icache_memory() away.
  384. */
  385. spin_unlock(&inode_lock);
  386. if (need_iput_tmp)
  387. iput(need_iput_tmp);
  388. /* for each watch, send FS_UNMOUNT and then remove it */
  389. fsnotify(inode, FS_UNMOUNT, inode, FSNOTIFY_EVENT_INODE, NULL, 0);
  390. fsnotify_inode_delete(inode);
  391. iput(inode);
  392. spin_lock(&inode_lock);
  393. }
  394. }