mark.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370
  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/kthread.h>
  87. #include <linux/module.h>
  88. #include <linux/mutex.h>
  89. #include <linux/slab.h>
  90. #include <linux/spinlock.h>
  91. #include <linux/srcu.h>
  92. #include <asm/atomic.h>
  93. #include <linux/fsnotify_backend.h>
  94. #include "fsnotify.h"
  95. struct srcu_struct fsnotify_mark_srcu;
  96. static DEFINE_SPINLOCK(destroy_lock);
  97. static LIST_HEAD(destroy_list);
  98. static DECLARE_WAIT_QUEUE_HEAD(destroy_waitq);
  99. void fsnotify_get_mark(struct fsnotify_mark *mark)
  100. {
  101. atomic_inc(&mark->refcnt);
  102. }
  103. void fsnotify_put_mark(struct fsnotify_mark *mark)
  104. {
  105. if (atomic_dec_and_test(&mark->refcnt))
  106. mark->free_mark(mark);
  107. }
  108. /*
  109. * Any time a mark is getting freed we end up here.
  110. * The caller had better be holding a reference to this mark so we don't actually
  111. * do the final put under the mark->lock
  112. */
  113. void fsnotify_destroy_mark(struct fsnotify_mark *mark)
  114. {
  115. struct fsnotify_group *group;
  116. struct inode *inode = NULL;
  117. spin_lock(&mark->lock);
  118. group = mark->group;
  119. /* something else already called this function on this mark */
  120. if (!(mark->flags & FSNOTIFY_MARK_FLAG_ALIVE)) {
  121. spin_unlock(&mark->lock);
  122. return;
  123. }
  124. mark->flags &= ~FSNOTIFY_MARK_FLAG_ALIVE;
  125. /* 1 from caller and 1 for being on i_list/g_list */
  126. BUG_ON(atomic_read(&mark->refcnt) < 2);
  127. spin_lock(&group->mark_lock);
  128. if (mark->flags & FSNOTIFY_MARK_FLAG_INODE) {
  129. inode = mark->i.inode;
  130. fsnotify_destroy_inode_mark(mark);
  131. } else if (mark->flags & FSNOTIFY_MARK_FLAG_VFSMOUNT)
  132. fsnotify_destroy_vfsmount_mark(mark);
  133. else
  134. BUG();
  135. list_del_init(&mark->g_list);
  136. spin_unlock(&group->mark_lock);
  137. spin_unlock(&mark->lock);
  138. spin_lock(&destroy_lock);
  139. list_add(&mark->destroy_list, &destroy_list);
  140. spin_unlock(&destroy_lock);
  141. wake_up(&destroy_waitq);
  142. /*
  143. * Some groups like to know that marks are being freed. This is a
  144. * callback to the group function to let it know that this mark
  145. * is being freed.
  146. */
  147. if (group->ops->freeing_mark)
  148. group->ops->freeing_mark(mark, group);
  149. /*
  150. * __fsnotify_update_child_dentry_flags(inode);
  151. *
  152. * I really want to call that, but we can't, we have no idea if the inode
  153. * still exists the second we drop the mark->lock.
  154. *
  155. * The next time an event arrive to this inode from one of it's children
  156. * __fsnotify_parent will see that the inode doesn't care about it's
  157. * children and will update all of these flags then. So really this
  158. * is just a lazy update (and could be a perf win...)
  159. */
  160. if (inode && (mark->flags & FSNOTIFY_MARK_FLAG_OBJECT_PINNED))
  161. iput(inode);
  162. /*
  163. * it's possible that this group tried to destroy itself, but this
  164. * this mark was simultaneously being freed by inode. If that's the
  165. * case, we finish freeing the group here.
  166. */
  167. if (unlikely(atomic_dec_and_test(&group->num_marks)))
  168. fsnotify_final_destroy_group(group);
  169. }
  170. void fsnotify_set_mark_mask_locked(struct fsnotify_mark *mark, __u32 mask)
  171. {
  172. assert_spin_locked(&mark->lock);
  173. mark->mask = mask;
  174. if (mark->flags & FSNOTIFY_MARK_FLAG_INODE)
  175. fsnotify_set_inode_mark_mask_locked(mark, mask);
  176. }
  177. void fsnotify_set_mark_ignored_mask_locked(struct fsnotify_mark *mark, __u32 mask)
  178. {
  179. assert_spin_locked(&mark->lock);
  180. mark->ignored_mask = mask;
  181. }
  182. /*
  183. * Attach an initialized mark to a given group and fs object.
  184. * These marks may be used for the fsnotify backend to determine which
  185. * event types should be delivered to which group.
  186. */
  187. int fsnotify_add_mark(struct fsnotify_mark *mark,
  188. struct fsnotify_group *group, struct inode *inode,
  189. struct vfsmount *mnt, int allow_dups)
  190. {
  191. int ret = 0;
  192. BUG_ON(inode && mnt);
  193. BUG_ON(!inode && !mnt);
  194. /*
  195. * LOCKING ORDER!!!!
  196. * mark->lock
  197. * group->mark_lock
  198. * inode->i_lock
  199. */
  200. spin_lock(&mark->lock);
  201. spin_lock(&group->mark_lock);
  202. mark->flags |= FSNOTIFY_MARK_FLAG_ALIVE;
  203. mark->group = group;
  204. list_add(&mark->g_list, &group->marks_list);
  205. atomic_inc(&group->num_marks);
  206. fsnotify_get_mark(mark); /* for i_list and g_list */
  207. if (inode) {
  208. ret = fsnotify_add_inode_mark(mark, group, inode, allow_dups);
  209. if (ret)
  210. goto err;
  211. } else if (mnt) {
  212. ret = fsnotify_add_vfsmount_mark(mark, group, mnt, allow_dups);
  213. if (ret)
  214. goto err;
  215. } else {
  216. BUG();
  217. }
  218. spin_unlock(&group->mark_lock);
  219. /* this will pin the object if appropriate */
  220. fsnotify_set_mark_mask_locked(mark, mark->mask);
  221. spin_unlock(&mark->lock);
  222. if (inode)
  223. __fsnotify_update_child_dentry_flags(inode);
  224. return ret;
  225. err:
  226. mark->flags &= ~FSNOTIFY_MARK_FLAG_ALIVE;
  227. list_del_init(&mark->g_list);
  228. mark->group = NULL;
  229. atomic_dec(&group->num_marks);
  230. spin_unlock(&group->mark_lock);
  231. spin_unlock(&mark->lock);
  232. spin_lock(&destroy_lock);
  233. list_add(&mark->destroy_list, &destroy_list);
  234. spin_unlock(&destroy_lock);
  235. wake_up(&destroy_waitq);
  236. return ret;
  237. }
  238. /*
  239. * clear any marks in a group in which mark->flags & flags is true
  240. */
  241. void fsnotify_clear_marks_by_group_flags(struct fsnotify_group *group,
  242. unsigned int flags)
  243. {
  244. struct fsnotify_mark *lmark, *mark;
  245. LIST_HEAD(free_list);
  246. spin_lock(&group->mark_lock);
  247. list_for_each_entry_safe(mark, lmark, &group->marks_list, g_list) {
  248. if (mark->flags & flags) {
  249. list_add(&mark->free_g_list, &free_list);
  250. list_del_init(&mark->g_list);
  251. fsnotify_get_mark(mark);
  252. }
  253. }
  254. spin_unlock(&group->mark_lock);
  255. list_for_each_entry_safe(mark, lmark, &free_list, free_g_list) {
  256. fsnotify_destroy_mark(mark);
  257. fsnotify_put_mark(mark);
  258. }
  259. }
  260. /*
  261. * Given a group, destroy all of the marks associated with that group.
  262. */
  263. void fsnotify_clear_marks_by_group(struct fsnotify_group *group)
  264. {
  265. fsnotify_clear_marks_by_group_flags(group, (unsigned int)-1);
  266. }
  267. void fsnotify_duplicate_mark(struct fsnotify_mark *new, struct fsnotify_mark *old)
  268. {
  269. assert_spin_locked(&old->lock);
  270. new->i.inode = old->i.inode;
  271. new->m.mnt = old->m.mnt;
  272. new->group = old->group;
  273. new->mask = old->mask;
  274. new->free_mark = old->free_mark;
  275. }
  276. /*
  277. * Nothing fancy, just initialize lists and locks and counters.
  278. */
  279. void fsnotify_init_mark(struct fsnotify_mark *mark,
  280. void (*free_mark)(struct fsnotify_mark *mark))
  281. {
  282. memset(mark, 0, sizeof(*mark));
  283. spin_lock_init(&mark->lock);
  284. atomic_set(&mark->refcnt, 1);
  285. mark->free_mark = free_mark;
  286. }
  287. static int fsnotify_mark_destroy(void *ignored)
  288. {
  289. struct fsnotify_mark *mark, *next;
  290. LIST_HEAD(private_destroy_list);
  291. for (;;) {
  292. spin_lock(&destroy_lock);
  293. /* exchange the list head */
  294. list_replace_init(&destroy_list, &private_destroy_list);
  295. spin_unlock(&destroy_lock);
  296. synchronize_srcu(&fsnotify_mark_srcu);
  297. list_for_each_entry_safe(mark, next, &private_destroy_list, destroy_list) {
  298. list_del_init(&mark->destroy_list);
  299. fsnotify_put_mark(mark);
  300. }
  301. wait_event_interruptible(destroy_waitq, !list_empty(&destroy_list));
  302. }
  303. return 0;
  304. }
  305. static int __init fsnotify_mark_init(void)
  306. {
  307. struct task_struct *thread;
  308. thread = kthread_run(fsnotify_mark_destroy, NULL,
  309. "fsnotify_mark");
  310. if (IS_ERR(thread))
  311. panic("unable to start fsnotify mark destruction thread.");
  312. return 0;
  313. }
  314. device_initcall(fsnotify_mark_init);