inode_mark.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353
  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. * entry->lock
  33. * group->mark_lock
  34. * inode->i_lock
  35. *
  36. * entry->lock protects 2 things, entry->group and entry->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 mark_entries list anchored inside a given group
  41. * and each entry 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_mark_entries list anchored inside a
  46. * given inode and each entry 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_by_entry)
  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_mark_entries 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 <asm/atomic.h>
  91. #include <linux/fsnotify_backend.h>
  92. #include "fsnotify.h"
  93. void fsnotify_get_mark(struct fsnotify_mark_entry *entry)
  94. {
  95. atomic_inc(&entry->refcnt);
  96. }
  97. void fsnotify_put_mark(struct fsnotify_mark_entry *entry)
  98. {
  99. if (atomic_dec_and_test(&entry->refcnt))
  100. entry->free_mark(entry);
  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_entry *entry;
  108. struct hlist_node *pos;
  109. __u32 new_mask = 0;
  110. assert_spin_locked(&inode->i_lock);
  111. hlist_for_each_entry(entry, pos, &inode->i_fsnotify_mark_entries, i_list)
  112. new_mask |= entry->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 entry->lock
  130. */
  131. void fsnotify_destroy_mark_by_entry(struct fsnotify_mark_entry *entry)
  132. {
  133. struct fsnotify_group *group;
  134. struct inode *inode;
  135. spin_lock(&entry->lock);
  136. group = entry->group;
  137. inode = entry->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(&entry->lock);
  143. return;
  144. }
  145. /* 1 from caller and 1 for being on i_list/g_list */
  146. BUG_ON(atomic_read(&entry->refcnt) < 2);
  147. spin_lock(&group->mark_lock);
  148. spin_lock(&inode->i_lock);
  149. hlist_del_init(&entry->i_list);
  150. entry->inode = NULL;
  151. list_del_init(&entry->g_list);
  152. entry->group = NULL;
  153. fsnotify_put_mark(entry); /* for i_list and g_list */
  154. /*
  155. * this mark is now off the inode->i_fsnotify_mark_entries 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(&entry->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 entry
  166. * is being freed.
  167. */
  168. group->ops->freeing_mark(entry, group);
  169. /*
  170. * __fsnotify_update_child_dentry_flags(inode);
  171. *
  172. * I really want to call that, but we can't, we have no idea if the inode
  173. * still exists the second we drop the entry->lock.
  174. *
  175. * The next time an event arrive to this inode from one of it's children
  176. * __fsnotify_parent will see that the inode doesn't care about it's
  177. * children and will update all of these flags then. So really this
  178. * is just a lazy update (and could be a perf win...)
  179. */
  180. iput(inode);
  181. /*
  182. * it's possible that this group tried to destroy itself, but this
  183. * this mark was simultaneously being freed by inode. If that's the
  184. * case, we finish freeing the group here.
  185. */
  186. if (unlikely(atomic_dec_and_test(&group->num_marks)))
  187. fsnotify_final_destroy_group(group);
  188. }
  189. /*
  190. * Given a group, destroy all of the marks associated with that group.
  191. */
  192. void fsnotify_clear_marks_by_group(struct fsnotify_group *group)
  193. {
  194. struct fsnotify_mark_entry *lentry, *entry;
  195. LIST_HEAD(free_list);
  196. spin_lock(&group->mark_lock);
  197. list_for_each_entry_safe(entry, lentry, &group->mark_entries, g_list) {
  198. list_add(&entry->free_g_list, &free_list);
  199. list_del_init(&entry->g_list);
  200. fsnotify_get_mark(entry);
  201. }
  202. spin_unlock(&group->mark_lock);
  203. list_for_each_entry_safe(entry, lentry, &free_list, free_g_list) {
  204. fsnotify_destroy_mark_by_entry(entry);
  205. fsnotify_put_mark(entry);
  206. }
  207. }
  208. /*
  209. * Given an inode, destroy all of the marks associated with that inode.
  210. */
  211. void fsnotify_clear_marks_by_inode(struct inode *inode)
  212. {
  213. struct fsnotify_mark_entry *entry, *lentry;
  214. struct hlist_node *pos, *n;
  215. LIST_HEAD(free_list);
  216. spin_lock(&inode->i_lock);
  217. hlist_for_each_entry_safe(entry, pos, n, &inode->i_fsnotify_mark_entries, i_list) {
  218. list_add(&entry->free_i_list, &free_list);
  219. hlist_del_init(&entry->i_list);
  220. fsnotify_get_mark(entry);
  221. }
  222. spin_unlock(&inode->i_lock);
  223. list_for_each_entry_safe(entry, lentry, &free_list, free_i_list) {
  224. fsnotify_destroy_mark_by_entry(entry);
  225. fsnotify_put_mark(entry);
  226. }
  227. }
  228. /*
  229. * given a group and inode, find the mark associated with that combination.
  230. * if found take a reference to that mark and return it, else return NULL
  231. */
  232. struct fsnotify_mark_entry *fsnotify_find_mark_entry(struct fsnotify_group *group,
  233. struct inode *inode)
  234. {
  235. struct fsnotify_mark_entry *entry;
  236. struct hlist_node *pos;
  237. assert_spin_locked(&inode->i_lock);
  238. hlist_for_each_entry(entry, pos, &inode->i_fsnotify_mark_entries, i_list) {
  239. if (entry->group == group) {
  240. fsnotify_get_mark(entry);
  241. return entry;
  242. }
  243. }
  244. return NULL;
  245. }
  246. /*
  247. * Nothing fancy, just initialize lists and locks and counters.
  248. */
  249. void fsnotify_init_mark(struct fsnotify_mark_entry *entry,
  250. void (*free_mark)(struct fsnotify_mark_entry *entry))
  251. {
  252. spin_lock_init(&entry->lock);
  253. atomic_set(&entry->refcnt, 1);
  254. INIT_HLIST_NODE(&entry->i_list);
  255. entry->group = NULL;
  256. entry->mask = 0;
  257. entry->inode = NULL;
  258. entry->free_mark = free_mark;
  259. }
  260. /*
  261. * Attach an initialized mark entry to a given group and inode.
  262. * These marks may be used for the fsnotify backend to determine which
  263. * event types should be delivered to which group and for which inodes.
  264. */
  265. int fsnotify_add_mark(struct fsnotify_mark_entry *entry,
  266. struct fsnotify_group *group, struct inode *inode)
  267. {
  268. struct fsnotify_mark_entry *lentry;
  269. int ret = 0;
  270. inode = igrab(inode);
  271. if (unlikely(!inode))
  272. return -EINVAL;
  273. /*
  274. * LOCKING ORDER!!!!
  275. * entry->lock
  276. * group->mark_lock
  277. * inode->i_lock
  278. */
  279. spin_lock(&entry->lock);
  280. spin_lock(&group->mark_lock);
  281. spin_lock(&inode->i_lock);
  282. entry->group = group;
  283. entry->inode = inode;
  284. lentry = fsnotify_find_mark_entry(group, inode);
  285. if (!lentry) {
  286. hlist_add_head(&entry->i_list, &inode->i_fsnotify_mark_entries);
  287. list_add(&entry->g_list, &group->mark_entries);
  288. fsnotify_get_mark(entry); /* for i_list and g_list */
  289. atomic_inc(&group->num_marks);
  290. fsnotify_recalc_inode_mask_locked(inode);
  291. }
  292. spin_unlock(&inode->i_lock);
  293. spin_unlock(&group->mark_lock);
  294. spin_unlock(&entry->lock);
  295. if (lentry) {
  296. ret = -EEXIST;
  297. iput(inode);
  298. fsnotify_put_mark(lentry);
  299. } else {
  300. __fsnotify_update_child_dentry_flags(inode);
  301. }
  302. return ret;
  303. }