mark.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375
  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 group->recnt and mark->refcnt tell how many "things" in the kernel
  23. * currently are referencing the objects. Both kind of objects typically will
  24. * live inside the kernel with a refcnt of 2, one for its creation and one for
  25. * the reference a group and a mark hold to each other.
  26. * If you are holding the appropriate locks, you can take a reference and the
  27. * object itself is guaranteed to survive until the reference is dropped.
  28. *
  29. * LOCKING:
  30. * There are 3 locks involved with fsnotify inode marks and they MUST be taken
  31. * in order as follows:
  32. *
  33. * group->mark_mutex
  34. * mark->lock
  35. * inode->i_lock
  36. *
  37. * group->mark_mutex protects the marks_list anchored inside a given group and
  38. * each mark is hooked via the g_list. It also protects the groups private
  39. * data (i.e group limits).
  40. * mark->lock protects the marks attributes like its masks and flags.
  41. * Furthermore it protects the access to a reference of the group that the mark
  42. * is assigned to as well as the access to a reference of the inode/vfsmount
  43. * that is being watched by the mark.
  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; we walk i_free_list
  67. * and before we destroy the mark we make sure that we dont race with a
  68. * concurrent destroy_group by getting a ref to the marks group and taking the
  69. * groups mutex.
  70. * Very similarly for freeing by group, except we use free_g_list.
  71. *
  72. * This has the very interesting property of being able to run concurrently with
  73. * any (or all) other directions.
  74. */
  75. #include <linux/fs.h>
  76. #include <linux/init.h>
  77. #include <linux/kernel.h>
  78. #include <linux/kthread.h>
  79. #include <linux/module.h>
  80. #include <linux/mutex.h>
  81. #include <linux/slab.h>
  82. #include <linux/spinlock.h>
  83. #include <linux/srcu.h>
  84. #include <linux/atomic.h>
  85. #include <linux/fsnotify_backend.h>
  86. #include "fsnotify.h"
  87. struct srcu_struct fsnotify_mark_srcu;
  88. static DEFINE_SPINLOCK(destroy_lock);
  89. static LIST_HEAD(destroy_list);
  90. static DECLARE_WAIT_QUEUE_HEAD(destroy_waitq);
  91. void fsnotify_get_mark(struct fsnotify_mark *mark)
  92. {
  93. atomic_inc(&mark->refcnt);
  94. }
  95. void fsnotify_put_mark(struct fsnotify_mark *mark)
  96. {
  97. if (atomic_dec_and_test(&mark->refcnt)) {
  98. if (mark->group)
  99. fsnotify_put_group(mark->group);
  100. mark->free_mark(mark);
  101. }
  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_locked(struct fsnotify_mark *mark,
  109. struct fsnotify_group *group)
  110. {
  111. struct inode *inode = NULL;
  112. BUG_ON(!mutex_is_locked(&group->mark_mutex));
  113. spin_lock(&mark->lock);
  114. /* something else already called this function on this mark */
  115. if (!(mark->flags & FSNOTIFY_MARK_FLAG_ALIVE)) {
  116. spin_unlock(&mark->lock);
  117. return;
  118. }
  119. mark->flags &= ~FSNOTIFY_MARK_FLAG_ALIVE;
  120. if (mark->flags & FSNOTIFY_MARK_FLAG_INODE) {
  121. inode = mark->i.inode;
  122. fsnotify_destroy_inode_mark(mark);
  123. } else if (mark->flags & FSNOTIFY_MARK_FLAG_VFSMOUNT)
  124. fsnotify_destroy_vfsmount_mark(mark);
  125. else
  126. BUG();
  127. list_del_init(&mark->g_list);
  128. spin_unlock(&mark->lock);
  129. if (inode && (mark->flags & FSNOTIFY_MARK_FLAG_OBJECT_PINNED))
  130. iput(inode);
  131. /* release lock temporarily */
  132. mutex_unlock(&group->mark_mutex);
  133. spin_lock(&destroy_lock);
  134. list_add(&mark->destroy_list, &destroy_list);
  135. spin_unlock(&destroy_lock);
  136. wake_up(&destroy_waitq);
  137. /*
  138. * We don't necessarily have a ref on mark from caller so the above destroy
  139. * may have actually freed it, unless this group provides a 'freeing_mark'
  140. * function which must be holding a reference.
  141. */
  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. atomic_dec(&group->num_marks);
  161. mutex_lock_nested(&group->mark_mutex, SINGLE_DEPTH_NESTING);
  162. }
  163. void fsnotify_destroy_mark(struct fsnotify_mark *mark,
  164. struct fsnotify_group *group)
  165. {
  166. mutex_lock_nested(&group->mark_mutex, SINGLE_DEPTH_NESTING);
  167. fsnotify_destroy_mark_locked(mark, group);
  168. mutex_unlock(&group->mark_mutex);
  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_locked(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. BUG_ON(!mutex_is_locked(&group->mark_mutex));
  195. /*
  196. * LOCKING ORDER!!!!
  197. * group->mark_mutex
  198. * mark->lock
  199. * inode->i_lock
  200. */
  201. spin_lock(&mark->lock);
  202. mark->flags |= FSNOTIFY_MARK_FLAG_ALIVE;
  203. fsnotify_get_group(group);
  204. mark->group = group;
  205. list_add(&mark->g_list, &group->marks_list);
  206. atomic_inc(&group->num_marks);
  207. fsnotify_get_mark(mark); /* for i_list and g_list */
  208. if (inode) {
  209. ret = fsnotify_add_inode_mark(mark, group, inode, allow_dups);
  210. if (ret)
  211. goto err;
  212. } else if (mnt) {
  213. ret = fsnotify_add_vfsmount_mark(mark, group, mnt, allow_dups);
  214. if (ret)
  215. goto err;
  216. } else {
  217. BUG();
  218. }
  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. fsnotify_put_group(group);
  229. mark->group = NULL;
  230. atomic_dec(&group->num_marks);
  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. int fsnotify_add_mark(struct fsnotify_mark *mark, struct fsnotify_group *group,
  239. struct inode *inode, struct vfsmount *mnt, int allow_dups)
  240. {
  241. int ret;
  242. mutex_lock(&group->mark_mutex);
  243. ret = fsnotify_add_mark_locked(mark, group, inode, mnt, allow_dups);
  244. mutex_unlock(&group->mark_mutex);
  245. return ret;
  246. }
  247. /*
  248. * clear any marks in a group in which mark->flags & flags is true
  249. */
  250. void fsnotify_clear_marks_by_group_flags(struct fsnotify_group *group,
  251. unsigned int flags)
  252. {
  253. struct fsnotify_mark *lmark, *mark;
  254. mutex_lock_nested(&group->mark_mutex, SINGLE_DEPTH_NESTING);
  255. list_for_each_entry_safe(mark, lmark, &group->marks_list, g_list) {
  256. if (mark->flags & flags) {
  257. fsnotify_get_mark(mark);
  258. fsnotify_destroy_mark_locked(mark, group);
  259. fsnotify_put_mark(mark);
  260. }
  261. }
  262. mutex_unlock(&group->mark_mutex);
  263. }
  264. /*
  265. * Given a group, destroy all of the marks associated with that group.
  266. */
  267. void fsnotify_clear_marks_by_group(struct fsnotify_group *group)
  268. {
  269. fsnotify_clear_marks_by_group_flags(group, (unsigned int)-1);
  270. }
  271. void fsnotify_duplicate_mark(struct fsnotify_mark *new, struct fsnotify_mark *old)
  272. {
  273. assert_spin_locked(&old->lock);
  274. new->i.inode = old->i.inode;
  275. new->m.mnt = old->m.mnt;
  276. if (old->group)
  277. fsnotify_get_group(old->group);
  278. new->group = old->group;
  279. new->mask = old->mask;
  280. new->free_mark = old->free_mark;
  281. }
  282. /*
  283. * Nothing fancy, just initialize lists and locks and counters.
  284. */
  285. void fsnotify_init_mark(struct fsnotify_mark *mark,
  286. void (*free_mark)(struct fsnotify_mark *mark))
  287. {
  288. memset(mark, 0, sizeof(*mark));
  289. spin_lock_init(&mark->lock);
  290. atomic_set(&mark->refcnt, 1);
  291. mark->free_mark = free_mark;
  292. }
  293. static int fsnotify_mark_destroy(void *ignored)
  294. {
  295. struct fsnotify_mark *mark, *next;
  296. LIST_HEAD(private_destroy_list);
  297. for (;;) {
  298. spin_lock(&destroy_lock);
  299. /* exchange the list head */
  300. list_replace_init(&destroy_list, &private_destroy_list);
  301. spin_unlock(&destroy_lock);
  302. synchronize_srcu(&fsnotify_mark_srcu);
  303. list_for_each_entry_safe(mark, next, &private_destroy_list, destroy_list) {
  304. list_del_init(&mark->destroy_list);
  305. fsnotify_put_mark(mark);
  306. }
  307. wait_event_interruptible(destroy_waitq, !list_empty(&destroy_list));
  308. }
  309. return 0;
  310. }
  311. static int __init fsnotify_mark_init(void)
  312. {
  313. struct task_struct *thread;
  314. thread = kthread_run(fsnotify_mark_destroy, NULL,
  315. "fsnotify_mark");
  316. if (IS_ERR(thread))
  317. panic("unable to start fsnotify mark destruction thread.");
  318. return 0;
  319. }
  320. device_initcall(fsnotify_mark_init);