fsnotify.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408
  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. #include <linux/dcache.h>
  19. #include <linux/fs.h>
  20. #include <linux/gfp.h>
  21. #include <linux/init.h>
  22. #include <linux/module.h>
  23. #include <linux/mount.h>
  24. #include <linux/srcu.h>
  25. #include <linux/fsnotify_backend.h>
  26. #include "fsnotify.h"
  27. /*
  28. * Clear all of the marks on an inode when it is being evicted from core
  29. */
  30. void __fsnotify_inode_delete(struct inode *inode)
  31. {
  32. fsnotify_clear_marks_by_inode(inode);
  33. }
  34. EXPORT_SYMBOL_GPL(__fsnotify_inode_delete);
  35. void __fsnotify_vfsmount_delete(struct vfsmount *mnt)
  36. {
  37. fsnotify_clear_marks_by_mount(mnt);
  38. }
  39. /**
  40. * fsnotify_unmount_inodes - an sb is unmounting. handle any watched inodes.
  41. * @sb: superblock being unmounted.
  42. *
  43. * Called during unmount with no locks held, so needs to be safe against
  44. * concurrent modifiers. We temporarily drop sb->s_inode_list_lock and CAN block.
  45. */
  46. void fsnotify_unmount_inodes(struct super_block *sb)
  47. {
  48. struct inode *inode, *iput_inode = NULL;
  49. spin_lock(&sb->s_inode_list_lock);
  50. list_for_each_entry(inode, &sb->s_inodes, i_sb_list) {
  51. /*
  52. * We cannot __iget() an inode in state I_FREEING,
  53. * I_WILL_FREE, or I_NEW which is fine because by that point
  54. * the inode cannot have any associated watches.
  55. */
  56. spin_lock(&inode->i_lock);
  57. if (inode->i_state & (I_FREEING|I_WILL_FREE|I_NEW)) {
  58. spin_unlock(&inode->i_lock);
  59. continue;
  60. }
  61. /*
  62. * If i_count is zero, the inode cannot have any watches and
  63. * doing an __iget/iput with SB_ACTIVE clear would actually
  64. * evict all inodes with zero i_count from icache which is
  65. * unnecessarily violent and may in fact be illegal to do.
  66. */
  67. if (!atomic_read(&inode->i_count)) {
  68. spin_unlock(&inode->i_lock);
  69. continue;
  70. }
  71. __iget(inode);
  72. spin_unlock(&inode->i_lock);
  73. spin_unlock(&sb->s_inode_list_lock);
  74. if (iput_inode)
  75. iput(iput_inode);
  76. /* for each watch, send FS_UNMOUNT and then remove it */
  77. fsnotify(inode, FS_UNMOUNT, inode, FSNOTIFY_EVENT_INODE, NULL, 0);
  78. fsnotify_inode_delete(inode);
  79. iput_inode = inode;
  80. cond_resched();
  81. spin_lock(&sb->s_inode_list_lock);
  82. }
  83. spin_unlock(&sb->s_inode_list_lock);
  84. if (iput_inode)
  85. iput(iput_inode);
  86. /* Wait for outstanding inode references from connectors */
  87. wait_var_event(&sb->s_fsnotify_inode_refs,
  88. !atomic_long_read(&sb->s_fsnotify_inode_refs));
  89. }
  90. /*
  91. * Given an inode, first check if we care what happens to our children. Inotify
  92. * and dnotify both tell their parents about events. If we care about any event
  93. * on a child we run all of our children and set a dentry flag saying that the
  94. * parent cares. Thus when an event happens on a child it can quickly tell if
  95. * if there is a need to find a parent and send the event to the parent.
  96. */
  97. void __fsnotify_update_child_dentry_flags(struct inode *inode)
  98. {
  99. struct dentry *alias;
  100. int watched;
  101. if (!S_ISDIR(inode->i_mode))
  102. return;
  103. /* determine if the children should tell inode about their events */
  104. watched = fsnotify_inode_watches_children(inode);
  105. spin_lock(&inode->i_lock);
  106. /* run all of the dentries associated with this inode. Since this is a
  107. * directory, there damn well better only be one item on this list */
  108. hlist_for_each_entry(alias, &inode->i_dentry, d_u.d_alias) {
  109. struct dentry *child;
  110. /* run all of the children of the original inode and fix their
  111. * d_flags to indicate parental interest (their parent is the
  112. * original inode) */
  113. spin_lock(&alias->d_lock);
  114. list_for_each_entry(child, &alias->d_subdirs, d_child) {
  115. if (!child->d_inode)
  116. continue;
  117. spin_lock_nested(&child->d_lock, DENTRY_D_LOCK_NESTED);
  118. if (watched)
  119. child->d_flags |= DCACHE_FSNOTIFY_PARENT_WATCHED;
  120. else
  121. child->d_flags &= ~DCACHE_FSNOTIFY_PARENT_WATCHED;
  122. spin_unlock(&child->d_lock);
  123. }
  124. spin_unlock(&alias->d_lock);
  125. }
  126. spin_unlock(&inode->i_lock);
  127. }
  128. /* Notify this dentry's parent about a child's events. */
  129. int __fsnotify_parent(const struct path *path, struct dentry *dentry, __u32 mask)
  130. {
  131. struct dentry *parent;
  132. struct inode *p_inode;
  133. int ret = 0;
  134. if (!dentry)
  135. dentry = path->dentry;
  136. if (!(dentry->d_flags & DCACHE_FSNOTIFY_PARENT_WATCHED))
  137. return 0;
  138. parent = dget_parent(dentry);
  139. p_inode = parent->d_inode;
  140. if (unlikely(!fsnotify_inode_watches_children(p_inode))) {
  141. __fsnotify_update_child_dentry_flags(p_inode);
  142. } else if (p_inode->i_fsnotify_mask & mask & ALL_FSNOTIFY_EVENTS) {
  143. struct name_snapshot name;
  144. /* we are notifying a parent so come up with the new mask which
  145. * specifies these are events which came from a child. */
  146. mask |= FS_EVENT_ON_CHILD;
  147. take_dentry_name_snapshot(&name, dentry);
  148. if (path)
  149. ret = fsnotify(p_inode, mask, path, FSNOTIFY_EVENT_PATH,
  150. name.name, 0);
  151. else
  152. ret = fsnotify(p_inode, mask, dentry->d_inode, FSNOTIFY_EVENT_INODE,
  153. name.name, 0);
  154. release_dentry_name_snapshot(&name);
  155. }
  156. dput(parent);
  157. return ret;
  158. }
  159. EXPORT_SYMBOL_GPL(__fsnotify_parent);
  160. static int send_to_group(struct inode *to_tell,
  161. __u32 mask, const void *data,
  162. int data_is, u32 cookie,
  163. const unsigned char *file_name,
  164. struct fsnotify_iter_info *iter_info)
  165. {
  166. struct fsnotify_group *group = NULL;
  167. __u32 test_mask = (mask & ALL_FSNOTIFY_EVENTS);
  168. __u32 marks_mask = 0;
  169. __u32 marks_ignored_mask = 0;
  170. struct fsnotify_mark *mark;
  171. int type;
  172. if (WARN_ON(!iter_info->report_mask))
  173. return 0;
  174. /* clear ignored on inode modification */
  175. if (mask & FS_MODIFY) {
  176. fsnotify_foreach_obj_type(type) {
  177. if (!fsnotify_iter_should_report_type(iter_info, type))
  178. continue;
  179. mark = iter_info->marks[type];
  180. if (mark &&
  181. !(mark->flags & FSNOTIFY_MARK_FLAG_IGNORED_SURV_MODIFY))
  182. mark->ignored_mask = 0;
  183. }
  184. }
  185. fsnotify_foreach_obj_type(type) {
  186. if (!fsnotify_iter_should_report_type(iter_info, type))
  187. continue;
  188. mark = iter_info->marks[type];
  189. /* does the object mark tell us to do something? */
  190. if (mark) {
  191. group = mark->group;
  192. marks_mask |= mark->mask;
  193. marks_ignored_mask |= mark->ignored_mask;
  194. }
  195. }
  196. pr_debug("%s: group=%p to_tell=%p mask=%x marks_mask=%x marks_ignored_mask=%x"
  197. " data=%p data_is=%d cookie=%d\n",
  198. __func__, group, to_tell, mask, marks_mask, marks_ignored_mask,
  199. data, data_is, cookie);
  200. if (!(test_mask & marks_mask & ~marks_ignored_mask))
  201. return 0;
  202. return group->ops->handle_event(group, to_tell, mask, data, data_is,
  203. file_name, cookie, iter_info);
  204. }
  205. static struct fsnotify_mark *fsnotify_first_mark(struct fsnotify_mark_connector **connp)
  206. {
  207. struct fsnotify_mark_connector *conn;
  208. struct hlist_node *node = NULL;
  209. conn = srcu_dereference(*connp, &fsnotify_mark_srcu);
  210. if (conn)
  211. node = srcu_dereference(conn->list.first, &fsnotify_mark_srcu);
  212. return hlist_entry_safe(node, struct fsnotify_mark, obj_list);
  213. }
  214. static struct fsnotify_mark *fsnotify_next_mark(struct fsnotify_mark *mark)
  215. {
  216. struct hlist_node *node = NULL;
  217. if (mark)
  218. node = srcu_dereference(mark->obj_list.next,
  219. &fsnotify_mark_srcu);
  220. return hlist_entry_safe(node, struct fsnotify_mark, obj_list);
  221. }
  222. /*
  223. * iter_info is a multi head priority queue of marks.
  224. * Pick a subset of marks from queue heads, all with the
  225. * same group and set the report_mask for selected subset.
  226. * Returns the report_mask of the selected subset.
  227. */
  228. static unsigned int fsnotify_iter_select_report_types(
  229. struct fsnotify_iter_info *iter_info)
  230. {
  231. struct fsnotify_group *max_prio_group = NULL;
  232. struct fsnotify_mark *mark;
  233. int type;
  234. /* Choose max prio group among groups of all queue heads */
  235. fsnotify_foreach_obj_type(type) {
  236. mark = iter_info->marks[type];
  237. if (mark &&
  238. fsnotify_compare_groups(max_prio_group, mark->group) > 0)
  239. max_prio_group = mark->group;
  240. }
  241. if (!max_prio_group)
  242. return 0;
  243. /* Set the report mask for marks from same group as max prio group */
  244. iter_info->report_mask = 0;
  245. fsnotify_foreach_obj_type(type) {
  246. mark = iter_info->marks[type];
  247. if (mark &&
  248. fsnotify_compare_groups(max_prio_group, mark->group) == 0)
  249. fsnotify_iter_set_report_type(iter_info, type);
  250. }
  251. return iter_info->report_mask;
  252. }
  253. /*
  254. * Pop from iter_info multi head queue, the marks that were iterated in the
  255. * current iteration step.
  256. */
  257. static void fsnotify_iter_next(struct fsnotify_iter_info *iter_info)
  258. {
  259. int type;
  260. fsnotify_foreach_obj_type(type) {
  261. if (fsnotify_iter_should_report_type(iter_info, type))
  262. iter_info->marks[type] =
  263. fsnotify_next_mark(iter_info->marks[type]);
  264. }
  265. }
  266. /*
  267. * This is the main call to fsnotify. The VFS calls into hook specific functions
  268. * in linux/fsnotify.h. Those functions then in turn call here. Here will call
  269. * out to all of the registered fsnotify_group. Those groups can then use the
  270. * notification event in whatever means they feel necessary.
  271. */
  272. int fsnotify(struct inode *to_tell, __u32 mask, const void *data, int data_is,
  273. const unsigned char *file_name, u32 cookie)
  274. {
  275. struct fsnotify_iter_info iter_info = {};
  276. struct mount *mnt;
  277. int ret = 0;
  278. __u32 test_mask = (mask & ALL_FSNOTIFY_EVENTS);
  279. if (data_is == FSNOTIFY_EVENT_PATH)
  280. mnt = real_mount(((const struct path *)data)->mnt);
  281. else
  282. mnt = NULL;
  283. /* An event "on child" is not intended for a mount mark */
  284. if (mask & FS_EVENT_ON_CHILD)
  285. mnt = NULL;
  286. /*
  287. * Optimization: srcu_read_lock() has a memory barrier which can
  288. * be expensive. It protects walking the *_fsnotify_marks lists.
  289. * However, if we do not walk the lists, we do not have to do
  290. * SRCU because we have no references to any objects and do not
  291. * need SRCU to keep them "alive".
  292. */
  293. if (!to_tell->i_fsnotify_marks &&
  294. (!mnt || !mnt->mnt_fsnotify_marks))
  295. return 0;
  296. /*
  297. * if this is a modify event we may need to clear the ignored masks
  298. * otherwise return if neither the inode nor the vfsmount care about
  299. * this type of event.
  300. */
  301. if (!(mask & FS_MODIFY) &&
  302. !(test_mask & to_tell->i_fsnotify_mask) &&
  303. !(mnt && test_mask & mnt->mnt_fsnotify_mask))
  304. return 0;
  305. iter_info.srcu_idx = srcu_read_lock(&fsnotify_mark_srcu);
  306. iter_info.marks[FSNOTIFY_OBJ_TYPE_INODE] =
  307. fsnotify_first_mark(&to_tell->i_fsnotify_marks);
  308. if (mnt) {
  309. iter_info.marks[FSNOTIFY_OBJ_TYPE_VFSMOUNT] =
  310. fsnotify_first_mark(&mnt->mnt_fsnotify_marks);
  311. }
  312. /*
  313. * We need to merge inode & vfsmount mark lists so that inode mark
  314. * ignore masks are properly reflected for mount mark notifications.
  315. * That's why this traversal is so complicated...
  316. */
  317. while (fsnotify_iter_select_report_types(&iter_info)) {
  318. ret = send_to_group(to_tell, mask, data, data_is, cookie,
  319. file_name, &iter_info);
  320. if (ret && (mask & ALL_FSNOTIFY_PERM_EVENTS))
  321. goto out;
  322. fsnotify_iter_next(&iter_info);
  323. }
  324. ret = 0;
  325. out:
  326. srcu_read_unlock(&fsnotify_mark_srcu, iter_info.srcu_idx);
  327. return ret;
  328. }
  329. EXPORT_SYMBOL_GPL(fsnotify);
  330. extern struct kmem_cache *fsnotify_mark_connector_cachep;
  331. static __init int fsnotify_init(void)
  332. {
  333. int ret;
  334. BUG_ON(hweight32(ALL_FSNOTIFY_BITS) != 23);
  335. ret = init_srcu_struct(&fsnotify_mark_srcu);
  336. if (ret)
  337. panic("initializing fsnotify_mark_srcu");
  338. fsnotify_mark_connector_cachep = KMEM_CACHE(fsnotify_mark_connector,
  339. SLAB_PANIC);
  340. return 0;
  341. }
  342. core_initcall(fsnotify_init);