mark.c 8.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294
  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/slab.h>
  89. #include <linux/spinlock.h>
  90. #include <linux/writeback.h> /* for inode_lock */
  91. #include <asm/atomic.h>
  92. #include <linux/fsnotify_backend.h>
  93. #include "fsnotify.h"
  94. void fsnotify_get_mark(struct fsnotify_mark *mark)
  95. {
  96. atomic_inc(&mark->refcnt);
  97. }
  98. void fsnotify_put_mark(struct fsnotify_mark *mark)
  99. {
  100. if (atomic_dec_and_test(&mark->refcnt))
  101. mark->free_mark(mark);
  102. }
  103. /*
  104. * Any time a mark is getting freed we end up here.
  105. * The caller had better be holding a reference to this mark so we don't actually
  106. * do the final put under the mark->lock
  107. */
  108. void fsnotify_destroy_mark(struct fsnotify_mark *mark)
  109. {
  110. struct fsnotify_group *group;
  111. struct inode *inode;
  112. spin_lock(&mark->lock);
  113. group = mark->group;
  114. inode = mark->i.inode;
  115. BUG_ON(group && !inode);
  116. BUG_ON(!group && inode);
  117. /* if !group something else already marked this to die */
  118. if (!group) {
  119. spin_unlock(&mark->lock);
  120. return;
  121. }
  122. /* 1 from caller and 1 for being on i_list/g_list */
  123. BUG_ON(atomic_read(&mark->refcnt) < 2);
  124. spin_lock(&group->mark_lock);
  125. if (mark->flags & FSNOTIFY_MARK_FLAG_INODE)
  126. fsnotify_destroy_inode_mark(mark);
  127. else
  128. BUG();
  129. list_del_init(&mark->g_list);
  130. mark->group = NULL;
  131. fsnotify_put_mark(mark); /* for i_list and g_list */
  132. spin_unlock(&group->mark_lock);
  133. spin_unlock(&mark->lock);
  134. /*
  135. * Some groups like to know that marks are being freed. This is a
  136. * callback to the group function to let it know that this mark
  137. * is being freed.
  138. */
  139. if (group->ops->freeing_mark)
  140. group->ops->freeing_mark(mark, group);
  141. /*
  142. * __fsnotify_update_child_dentry_flags(inode);
  143. *
  144. * I really want to call that, but we can't, we have no idea if the inode
  145. * still exists the second we drop the mark->lock.
  146. *
  147. * The next time an event arrive to this inode from one of it's children
  148. * __fsnotify_parent will see that the inode doesn't care about it's
  149. * children and will update all of these flags then. So really this
  150. * is just a lazy update (and could be a perf win...)
  151. */
  152. iput(inode);
  153. /*
  154. * it's possible that this group tried to destroy itself, but this
  155. * this mark was simultaneously being freed by inode. If that's the
  156. * case, we finish freeing the group here.
  157. */
  158. if (unlikely(atomic_dec_and_test(&group->num_marks)))
  159. fsnotify_final_destroy_group(group);
  160. }
  161. /*
  162. * Attach an initialized mark to a given group and fs object.
  163. * These marks may be used for the fsnotify backend to determine which
  164. * event types should be delivered to which group.
  165. */
  166. int fsnotify_add_mark(struct fsnotify_mark *mark,
  167. struct fsnotify_group *group, struct inode *inode,
  168. struct vfsmount *mnt, int allow_dups)
  169. {
  170. int ret = 0;
  171. BUG_ON(mnt);
  172. BUG_ON(inode && mnt);
  173. BUG_ON(!inode && !mnt);
  174. /*
  175. * if this group isn't being testing for inode type events we need
  176. * to start testing
  177. */
  178. if (inode && unlikely(list_empty(&group->inode_group_list)))
  179. fsnotify_add_inode_group(group);
  180. else if (mnt && unlikely(list_empty(&group->vfsmount_group_list)))
  181. fsnotify_add_vfsmount_group(group);
  182. /*
  183. * LOCKING ORDER!!!!
  184. * mark->lock
  185. * group->mark_lock
  186. * inode->i_lock
  187. */
  188. spin_lock(&mark->lock);
  189. spin_lock(&group->mark_lock);
  190. mark->group = group;
  191. list_add(&mark->g_list, &group->marks_list);
  192. atomic_inc(&group->num_marks);
  193. fsnotify_get_mark(mark); /* for i_list and g_list */
  194. if (inode) {
  195. ret = fsnotify_add_inode_mark(mark, group, inode, allow_dups);
  196. if (ret)
  197. goto err;
  198. } else {
  199. BUG();
  200. }
  201. spin_unlock(&group->mark_lock);
  202. spin_unlock(&mark->lock);
  203. if (inode)
  204. __fsnotify_update_child_dentry_flags(inode);
  205. return ret;
  206. err:
  207. mark->group = NULL;
  208. list_del_init(&mark->g_list);
  209. atomic_dec(&group->num_marks);
  210. fsnotify_put_mark(mark);
  211. spin_unlock(&group->mark_lock);
  212. spin_unlock(&mark->lock);
  213. return ret;
  214. }
  215. /*
  216. * Given a group, destroy all of the marks associated with that group.
  217. */
  218. void fsnotify_clear_marks_by_group(struct fsnotify_group *group)
  219. {
  220. struct fsnotify_mark *lmark, *mark;
  221. LIST_HEAD(free_list);
  222. spin_lock(&group->mark_lock);
  223. list_for_each_entry_safe(mark, lmark, &group->marks_list, g_list) {
  224. list_add(&mark->free_g_list, &free_list);
  225. list_del_init(&mark->g_list);
  226. fsnotify_get_mark(mark);
  227. }
  228. spin_unlock(&group->mark_lock);
  229. list_for_each_entry_safe(mark, lmark, &free_list, free_g_list) {
  230. fsnotify_destroy_mark(mark);
  231. fsnotify_put_mark(mark);
  232. }
  233. }
  234. void fsnotify_duplicate_mark(struct fsnotify_mark *new, struct fsnotify_mark *old)
  235. {
  236. assert_spin_locked(&old->lock);
  237. new->i.inode = old->i.inode;
  238. new->m.mnt = old->m.mnt;
  239. new->group = old->group;
  240. new->mask = old->mask;
  241. new->free_mark = old->free_mark;
  242. }
  243. /*
  244. * Nothing fancy, just initialize lists and locks and counters.
  245. */
  246. void fsnotify_init_mark(struct fsnotify_mark *mark,
  247. void (*free_mark)(struct fsnotify_mark *mark))
  248. {
  249. spin_lock_init(&mark->lock);
  250. atomic_set(&mark->refcnt, 1);
  251. INIT_HLIST_NODE(&mark->i.i_list);
  252. mark->group = NULL;
  253. mark->mask = 0;
  254. mark->i.inode = NULL;
  255. mark->free_mark = free_mark;
  256. }