netfilter: nft_set_rbtree: fix panic when destroying set by GC
[linux/fpc-iii.git] / fs / notify / fsnotify.c
blobf174397b63a046f32ca24a7be30080c4ff5fe009
1 /*
2 * Copyright (C) 2008 Red Hat, Inc., Eric Paris <eparis@redhat.com>
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.
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.
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.
19 #include <linux/dcache.h>
20 #include <linux/fs.h>
21 #include <linux/gfp.h>
22 #include <linux/init.h>
23 #include <linux/module.h>
24 #include <linux/mount.h>
25 #include <linux/srcu.h>
27 #include <linux/fsnotify_backend.h>
28 #include "fsnotify.h"
31 * Clear all of the marks on an inode when it is being evicted from core
33 void __fsnotify_inode_delete(struct inode *inode)
35 fsnotify_clear_marks_by_inode(inode);
37 EXPORT_SYMBOL_GPL(__fsnotify_inode_delete);
39 void __fsnotify_vfsmount_delete(struct vfsmount *mnt)
41 fsnotify_clear_marks_by_mount(mnt);
44 /**
45 * fsnotify_unmount_inodes - an sb is unmounting. handle any watched inodes.
46 * @sb: superblock being unmounted.
48 * Called during unmount with no locks held, so needs to be safe against
49 * concurrent modifiers. We temporarily drop sb->s_inode_list_lock and CAN block.
51 void fsnotify_unmount_inodes(struct super_block *sb)
53 struct inode *inode, *iput_inode = NULL;
55 spin_lock(&sb->s_inode_list_lock);
56 list_for_each_entry(inode, &sb->s_inodes, i_sb_list) {
58 * We cannot __iget() an inode in state I_FREEING,
59 * I_WILL_FREE, or I_NEW which is fine because by that point
60 * the inode cannot have any associated watches.
62 spin_lock(&inode->i_lock);
63 if (inode->i_state & (I_FREEING|I_WILL_FREE|I_NEW)) {
64 spin_unlock(&inode->i_lock);
65 continue;
69 * If i_count is zero, the inode cannot have any watches and
70 * doing an __iget/iput with SB_ACTIVE clear would actually
71 * evict all inodes with zero i_count from icache which is
72 * unnecessarily violent and may in fact be illegal to do.
74 if (!atomic_read(&inode->i_count)) {
75 spin_unlock(&inode->i_lock);
76 continue;
79 __iget(inode);
80 spin_unlock(&inode->i_lock);
81 spin_unlock(&sb->s_inode_list_lock);
83 if (iput_inode)
84 iput(iput_inode);
86 /* for each watch, send FS_UNMOUNT and then remove it */
87 fsnotify(inode, FS_UNMOUNT, inode, FSNOTIFY_EVENT_INODE, NULL, 0);
89 fsnotify_inode_delete(inode);
91 iput_inode = inode;
93 spin_lock(&sb->s_inode_list_lock);
95 spin_unlock(&sb->s_inode_list_lock);
97 if (iput_inode)
98 iput(iput_inode);
102 * Given an inode, first check if we care what happens to our children. Inotify
103 * and dnotify both tell their parents about events. If we care about any event
104 * on a child we run all of our children and set a dentry flag saying that the
105 * parent cares. Thus when an event happens on a child it can quickly tell if
106 * if there is a need to find a parent and send the event to the parent.
108 void __fsnotify_update_child_dentry_flags(struct inode *inode)
110 struct dentry *alias;
111 int watched;
113 if (!S_ISDIR(inode->i_mode))
114 return;
116 /* determine if the children should tell inode about their events */
117 watched = fsnotify_inode_watches_children(inode);
119 spin_lock(&inode->i_lock);
120 /* run all of the dentries associated with this inode. Since this is a
121 * directory, there damn well better only be one item on this list */
122 hlist_for_each_entry(alias, &inode->i_dentry, d_u.d_alias) {
123 struct dentry *child;
125 /* run all of the children of the original inode and fix their
126 * d_flags to indicate parental interest (their parent is the
127 * original inode) */
128 spin_lock(&alias->d_lock);
129 list_for_each_entry(child, &alias->d_subdirs, d_child) {
130 if (!child->d_inode)
131 continue;
133 spin_lock_nested(&child->d_lock, DENTRY_D_LOCK_NESTED);
134 if (watched)
135 child->d_flags |= DCACHE_FSNOTIFY_PARENT_WATCHED;
136 else
137 child->d_flags &= ~DCACHE_FSNOTIFY_PARENT_WATCHED;
138 spin_unlock(&child->d_lock);
140 spin_unlock(&alias->d_lock);
142 spin_unlock(&inode->i_lock);
145 /* Notify this dentry's parent about a child's events. */
146 int __fsnotify_parent(const struct path *path, struct dentry *dentry, __u32 mask)
148 struct dentry *parent;
149 struct inode *p_inode;
150 int ret = 0;
152 if (!dentry)
153 dentry = path->dentry;
155 if (!(dentry->d_flags & DCACHE_FSNOTIFY_PARENT_WATCHED))
156 return 0;
158 parent = dget_parent(dentry);
159 p_inode = parent->d_inode;
161 if (unlikely(!fsnotify_inode_watches_children(p_inode)))
162 __fsnotify_update_child_dentry_flags(p_inode);
163 else if (p_inode->i_fsnotify_mask & mask) {
164 struct name_snapshot name;
166 /* we are notifying a parent so come up with the new mask which
167 * specifies these are events which came from a child. */
168 mask |= FS_EVENT_ON_CHILD;
170 take_dentry_name_snapshot(&name, dentry);
171 if (path)
172 ret = fsnotify(p_inode, mask, path, FSNOTIFY_EVENT_PATH,
173 name.name, 0);
174 else
175 ret = fsnotify(p_inode, mask, dentry->d_inode, FSNOTIFY_EVENT_INODE,
176 name.name, 0);
177 release_dentry_name_snapshot(&name);
180 dput(parent);
182 return ret;
184 EXPORT_SYMBOL_GPL(__fsnotify_parent);
186 static int send_to_group(struct inode *to_tell,
187 __u32 mask, const void *data,
188 int data_is, u32 cookie,
189 const unsigned char *file_name,
190 struct fsnotify_iter_info *iter_info)
192 struct fsnotify_group *group = NULL;
193 __u32 test_mask = (mask & ~FS_EVENT_ON_CHILD);
194 __u32 marks_mask = 0;
195 __u32 marks_ignored_mask = 0;
196 struct fsnotify_mark *mark;
197 int type;
199 if (WARN_ON(!iter_info->report_mask))
200 return 0;
202 /* clear ignored on inode modification */
203 if (mask & FS_MODIFY) {
204 fsnotify_foreach_obj_type(type) {
205 if (!fsnotify_iter_should_report_type(iter_info, type))
206 continue;
207 mark = iter_info->marks[type];
208 if (mark &&
209 !(mark->flags & FSNOTIFY_MARK_FLAG_IGNORED_SURV_MODIFY))
210 mark->ignored_mask = 0;
214 fsnotify_foreach_obj_type(type) {
215 if (!fsnotify_iter_should_report_type(iter_info, type))
216 continue;
217 mark = iter_info->marks[type];
218 /* does the object mark tell us to do something? */
219 if (mark) {
220 group = mark->group;
221 marks_mask |= mark->mask;
222 marks_ignored_mask |= mark->ignored_mask;
226 pr_debug("%s: group=%p to_tell=%p mask=%x marks_mask=%x marks_ignored_mask=%x"
227 " data=%p data_is=%d cookie=%d\n",
228 __func__, group, to_tell, mask, marks_mask, marks_ignored_mask,
229 data, data_is, cookie);
231 if (!(test_mask & marks_mask & ~marks_ignored_mask))
232 return 0;
234 return group->ops->handle_event(group, to_tell, mask, data, data_is,
235 file_name, cookie, iter_info);
238 static struct fsnotify_mark *fsnotify_first_mark(struct fsnotify_mark_connector **connp)
240 struct fsnotify_mark_connector *conn;
241 struct hlist_node *node = NULL;
243 conn = srcu_dereference(*connp, &fsnotify_mark_srcu);
244 if (conn)
245 node = srcu_dereference(conn->list.first, &fsnotify_mark_srcu);
247 return hlist_entry_safe(node, struct fsnotify_mark, obj_list);
250 static struct fsnotify_mark *fsnotify_next_mark(struct fsnotify_mark *mark)
252 struct hlist_node *node = NULL;
254 if (mark)
255 node = srcu_dereference(mark->obj_list.next,
256 &fsnotify_mark_srcu);
258 return hlist_entry_safe(node, struct fsnotify_mark, obj_list);
262 * iter_info is a multi head priority queue of marks.
263 * Pick a subset of marks from queue heads, all with the
264 * same group and set the report_mask for selected subset.
265 * Returns the report_mask of the selected subset.
267 static unsigned int fsnotify_iter_select_report_types(
268 struct fsnotify_iter_info *iter_info)
270 struct fsnotify_group *max_prio_group = NULL;
271 struct fsnotify_mark *mark;
272 int type;
274 /* Choose max prio group among groups of all queue heads */
275 fsnotify_foreach_obj_type(type) {
276 mark = iter_info->marks[type];
277 if (mark &&
278 fsnotify_compare_groups(max_prio_group, mark->group) > 0)
279 max_prio_group = mark->group;
282 if (!max_prio_group)
283 return 0;
285 /* Set the report mask for marks from same group as max prio group */
286 iter_info->report_mask = 0;
287 fsnotify_foreach_obj_type(type) {
288 mark = iter_info->marks[type];
289 if (mark &&
290 fsnotify_compare_groups(max_prio_group, mark->group) == 0)
291 fsnotify_iter_set_report_type(iter_info, type);
294 return iter_info->report_mask;
298 * Pop from iter_info multi head queue, the marks that were iterated in the
299 * current iteration step.
301 static void fsnotify_iter_next(struct fsnotify_iter_info *iter_info)
303 int type;
305 fsnotify_foreach_obj_type(type) {
306 if (fsnotify_iter_should_report_type(iter_info, type))
307 iter_info->marks[type] =
308 fsnotify_next_mark(iter_info->marks[type]);
313 * This is the main call to fsnotify. The VFS calls into hook specific functions
314 * in linux/fsnotify.h. Those functions then in turn call here. Here will call
315 * out to all of the registered fsnotify_group. Those groups can then use the
316 * notification event in whatever means they feel necessary.
318 int fsnotify(struct inode *to_tell, __u32 mask, const void *data, int data_is,
319 const unsigned char *file_name, u32 cookie)
321 struct fsnotify_iter_info iter_info = {};
322 struct mount *mnt;
323 int ret = 0;
324 /* global tests shouldn't care about events on child only the specific event */
325 __u32 test_mask = (mask & ~FS_EVENT_ON_CHILD);
327 if (data_is == FSNOTIFY_EVENT_PATH)
328 mnt = real_mount(((const struct path *)data)->mnt);
329 else
330 mnt = NULL;
333 * Optimization: srcu_read_lock() has a memory barrier which can
334 * be expensive. It protects walking the *_fsnotify_marks lists.
335 * However, if we do not walk the lists, we do not have to do
336 * SRCU because we have no references to any objects and do not
337 * need SRCU to keep them "alive".
339 if (!to_tell->i_fsnotify_marks &&
340 (!mnt || !mnt->mnt_fsnotify_marks))
341 return 0;
343 * if this is a modify event we may need to clear the ignored masks
344 * otherwise return if neither the inode nor the vfsmount care about
345 * this type of event.
347 if (!(mask & FS_MODIFY) &&
348 !(test_mask & to_tell->i_fsnotify_mask) &&
349 !(mnt && test_mask & mnt->mnt_fsnotify_mask))
350 return 0;
352 iter_info.srcu_idx = srcu_read_lock(&fsnotify_mark_srcu);
354 if ((mask & FS_MODIFY) ||
355 (test_mask & to_tell->i_fsnotify_mask)) {
356 iter_info.marks[FSNOTIFY_OBJ_TYPE_INODE] =
357 fsnotify_first_mark(&to_tell->i_fsnotify_marks);
360 if (mnt && ((mask & FS_MODIFY) ||
361 (test_mask & mnt->mnt_fsnotify_mask))) {
362 iter_info.marks[FSNOTIFY_OBJ_TYPE_INODE] =
363 fsnotify_first_mark(&to_tell->i_fsnotify_marks);
364 iter_info.marks[FSNOTIFY_OBJ_TYPE_VFSMOUNT] =
365 fsnotify_first_mark(&mnt->mnt_fsnotify_marks);
369 * We need to merge inode & vfsmount mark lists so that inode mark
370 * ignore masks are properly reflected for mount mark notifications.
371 * That's why this traversal is so complicated...
373 while (fsnotify_iter_select_report_types(&iter_info)) {
374 ret = send_to_group(to_tell, mask, data, data_is, cookie,
375 file_name, &iter_info);
377 if (ret && (mask & ALL_FSNOTIFY_PERM_EVENTS))
378 goto out;
380 fsnotify_iter_next(&iter_info);
382 ret = 0;
383 out:
384 srcu_read_unlock(&fsnotify_mark_srcu, iter_info.srcu_idx);
386 return ret;
388 EXPORT_SYMBOL_GPL(fsnotify);
390 extern struct kmem_cache *fsnotify_mark_connector_cachep;
392 static __init int fsnotify_init(void)
394 int ret;
396 BUG_ON(hweight32(ALL_FSNOTIFY_EVENTS) != 23);
398 ret = init_srcu_struct(&fsnotify_mark_srcu);
399 if (ret)
400 panic("initializing fsnotify_mark_srcu");
402 fsnotify_mark_connector_cachep = KMEM_CACHE(fsnotify_mark_connector,
403 SLAB_PANIC);
405 return 0;
407 core_initcall(fsnotify_init);