2009-05-21 21:01:20 +00:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2008 Red Hat, Inc., Eric Paris <eparis@redhat.com>
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation; either version 2, or (at your option)
|
|
|
|
* any later version.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program; see the file COPYING. If not, write to
|
|
|
|
* the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/dcache.h>
|
|
|
|
#include <linux/fs.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 08:04:11 +00:00
|
|
|
#include <linux/gfp.h>
|
2009-05-21 21:01:20 +00:00
|
|
|
#include <linux/init.h>
|
|
|
|
#include <linux/module.h>
|
2009-12-18 02:24:23 +00:00
|
|
|
#include <linux/mount.h>
|
2009-05-21 21:01:20 +00:00
|
|
|
#include <linux/srcu.h>
|
|
|
|
|
|
|
|
#include <linux/fsnotify_backend.h>
|
|
|
|
#include "fsnotify.h"
|
|
|
|
|
2009-05-21 21:01:26 +00:00
|
|
|
/*
|
|
|
|
* Clear all of the marks on an inode when it is being evicted from core
|
|
|
|
*/
|
|
|
|
void __fsnotify_inode_delete(struct inode *inode)
|
|
|
|
{
|
|
|
|
fsnotify_clear_marks_by_inode(inode);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(__fsnotify_inode_delete);
|
|
|
|
|
2009-12-18 02:24:27 +00:00
|
|
|
void __fsnotify_vfsmount_delete(struct vfsmount *mnt)
|
|
|
|
{
|
|
|
|
fsnotify_clear_marks_by_mount(mnt);
|
|
|
|
}
|
|
|
|
|
2016-12-21 15:40:48 +00:00
|
|
|
/**
|
|
|
|
* fsnotify_unmount_inodes - an sb is unmounting. handle any watched inodes.
|
|
|
|
* @sb: superblock being unmounted.
|
|
|
|
*
|
|
|
|
* Called during unmount with no locks held, so needs to be safe against
|
|
|
|
* concurrent modifiers. We temporarily drop sb->s_inode_list_lock and CAN block.
|
|
|
|
*/
|
2018-09-01 07:41:11 +00:00
|
|
|
static void fsnotify_unmount_inodes(struct super_block *sb)
|
2016-12-21 15:40:48 +00:00
|
|
|
{
|
|
|
|
struct inode *inode, *iput_inode = NULL;
|
|
|
|
|
|
|
|
spin_lock(&sb->s_inode_list_lock);
|
|
|
|
list_for_each_entry(inode, &sb->s_inodes, i_sb_list) {
|
|
|
|
/*
|
|
|
|
* We cannot __iget() an inode in state I_FREEING,
|
|
|
|
* I_WILL_FREE, or I_NEW which is fine because by that point
|
|
|
|
* the inode cannot have any associated watches.
|
|
|
|
*/
|
|
|
|
spin_lock(&inode->i_lock);
|
|
|
|
if (inode->i_state & (I_FREEING|I_WILL_FREE|I_NEW)) {
|
|
|
|
spin_unlock(&inode->i_lock);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If i_count is zero, the inode cannot have any watches and
|
2017-11-27 21:05:09 +00:00
|
|
|
* doing an __iget/iput with SB_ACTIVE clear would actually
|
2016-12-21 15:40:48 +00:00
|
|
|
* evict all inodes with zero i_count from icache which is
|
|
|
|
* unnecessarily violent and may in fact be illegal to do.
|
|
|
|
*/
|
|
|
|
if (!atomic_read(&inode->i_count)) {
|
|
|
|
spin_unlock(&inode->i_lock);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
__iget(inode);
|
|
|
|
spin_unlock(&inode->i_lock);
|
|
|
|
spin_unlock(&sb->s_inode_list_lock);
|
|
|
|
|
|
|
|
if (iput_inode)
|
|
|
|
iput(iput_inode);
|
|
|
|
|
|
|
|
/* for each watch, send FS_UNMOUNT and then remove it */
|
|
|
|
fsnotify(inode, FS_UNMOUNT, inode, FSNOTIFY_EVENT_INODE, NULL, 0);
|
|
|
|
|
|
|
|
fsnotify_inode_delete(inode);
|
|
|
|
|
|
|
|
iput_inode = inode;
|
|
|
|
|
|
|
|
spin_lock(&sb->s_inode_list_lock);
|
|
|
|
}
|
|
|
|
spin_unlock(&sb->s_inode_list_lock);
|
|
|
|
|
|
|
|
if (iput_inode)
|
|
|
|
iput(iput_inode);
|
2018-10-17 11:07:05 +00:00
|
|
|
/* Wait for outstanding inode references from connectors */
|
|
|
|
wait_var_event(&sb->s_fsnotify_inode_refs,
|
|
|
|
!atomic_long_read(&sb->s_fsnotify_inode_refs));
|
2016-12-21 15:40:48 +00:00
|
|
|
}
|
|
|
|
|
2018-09-01 07:41:11 +00:00
|
|
|
void fsnotify_sb_delete(struct super_block *sb)
|
|
|
|
{
|
|
|
|
fsnotify_unmount_inodes(sb);
|
|
|
|
fsnotify_clear_marks_by_sb(sb);
|
|
|
|
}
|
|
|
|
|
2009-05-21 21:01:29 +00:00
|
|
|
/*
|
|
|
|
* Given an inode, first check if we care what happens to our children. Inotify
|
|
|
|
* and dnotify both tell their parents about events. If we care about any event
|
|
|
|
* on a child we run all of our children and set a dentry flag saying that the
|
|
|
|
* parent cares. Thus when an event happens on a child it can quickly tell if
|
|
|
|
* if there is a need to find a parent and send the event to the parent.
|
|
|
|
*/
|
|
|
|
void __fsnotify_update_child_dentry_flags(struct inode *inode)
|
|
|
|
{
|
|
|
|
struct dentry *alias;
|
|
|
|
int watched;
|
|
|
|
|
|
|
|
if (!S_ISDIR(inode->i_mode))
|
|
|
|
return;
|
|
|
|
|
|
|
|
/* determine if the children should tell inode about their events */
|
|
|
|
watched = fsnotify_inode_watches_children(inode);
|
|
|
|
|
2011-01-07 06:50:06 +00:00
|
|
|
spin_lock(&inode->i_lock);
|
2009-05-21 21:01:29 +00:00
|
|
|
/* run all of the dentries associated with this inode. Since this is a
|
|
|
|
* directory, there damn well better only be one item on this list */
|
2014-10-26 23:19:16 +00:00
|
|
|
hlist_for_each_entry(alias, &inode->i_dentry, d_u.d_alias) {
|
2009-05-21 21:01:29 +00:00
|
|
|
struct dentry *child;
|
|
|
|
|
|
|
|
/* run all of the children of the original inode and fix their
|
|
|
|
* d_flags to indicate parental interest (their parent is the
|
|
|
|
* original inode) */
|
2011-01-07 06:49:34 +00:00
|
|
|
spin_lock(&alias->d_lock);
|
2014-10-26 23:19:16 +00:00
|
|
|
list_for_each_entry(child, &alias->d_subdirs, d_child) {
|
2009-05-21 21:01:29 +00:00
|
|
|
if (!child->d_inode)
|
|
|
|
continue;
|
|
|
|
|
2011-01-07 06:49:34 +00:00
|
|
|
spin_lock_nested(&child->d_lock, DENTRY_D_LOCK_NESTED);
|
2009-05-21 21:01:29 +00:00
|
|
|
if (watched)
|
|
|
|
child->d_flags |= DCACHE_FSNOTIFY_PARENT_WATCHED;
|
|
|
|
else
|
|
|
|
child->d_flags &= ~DCACHE_FSNOTIFY_PARENT_WATCHED;
|
|
|
|
spin_unlock(&child->d_lock);
|
|
|
|
}
|
2011-01-07 06:49:34 +00:00
|
|
|
spin_unlock(&alias->d_lock);
|
2009-05-21 21:01:29 +00:00
|
|
|
}
|
2011-01-07 06:50:06 +00:00
|
|
|
spin_unlock(&inode->i_lock);
|
2009-05-21 21:01:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Notify this dentry's parent about a child's events. */
|
2016-11-21 01:23:04 +00:00
|
|
|
int __fsnotify_parent(const struct path *path, struct dentry *dentry, __u32 mask)
|
2009-05-21 21:01:29 +00:00
|
|
|
{
|
|
|
|
struct dentry *parent;
|
|
|
|
struct inode *p_inode;
|
2010-10-28 21:21:56 +00:00
|
|
|
int ret = 0;
|
2009-05-21 21:01:29 +00:00
|
|
|
|
2009-12-18 02:24:24 +00:00
|
|
|
if (!dentry)
|
2010-08-12 21:23:04 +00:00
|
|
|
dentry = path->dentry;
|
2009-12-18 02:24:21 +00:00
|
|
|
|
2009-05-21 21:01:29 +00:00
|
|
|
if (!(dentry->d_flags & DCACHE_FSNOTIFY_PARENT_WATCHED))
|
2010-10-28 21:21:56 +00:00
|
|
|
return 0;
|
2009-05-21 21:01:29 +00:00
|
|
|
|
2010-10-10 09:36:30 +00:00
|
|
|
parent = dget_parent(dentry);
|
2009-05-21 21:01:29 +00:00
|
|
|
p_inode = parent->d_inode;
|
|
|
|
|
2018-10-30 18:29:53 +00:00
|
|
|
if (unlikely(!fsnotify_inode_watches_children(p_inode))) {
|
2010-10-10 09:36:30 +00:00
|
|
|
__fsnotify_update_child_dentry_flags(p_inode);
|
2018-10-30 18:29:53 +00:00
|
|
|
} else if (p_inode->i_fsnotify_mask & mask & ALL_FSNOTIFY_EVENTS) {
|
2017-07-07 18:51:19 +00:00
|
|
|
struct name_snapshot name;
|
|
|
|
|
2009-05-21 21:01:29 +00:00
|
|
|
/* we are notifying a parent so come up with the new mask which
|
|
|
|
* specifies these are events which came from a child. */
|
|
|
|
mask |= FS_EVENT_ON_CHILD;
|
|
|
|
|
2017-07-07 18:51:19 +00:00
|
|
|
take_dentry_name_snapshot(&name, dentry);
|
2010-08-12 21:23:04 +00:00
|
|
|
if (path)
|
2010-10-28 21:21:56 +00:00
|
|
|
ret = fsnotify(p_inode, mask, path, FSNOTIFY_EVENT_PATH,
|
2017-07-07 18:51:19 +00:00
|
|
|
name.name, 0);
|
2009-12-18 02:24:21 +00:00
|
|
|
else
|
2010-10-28 21:21:56 +00:00
|
|
|
ret = fsnotify(p_inode, mask, dentry->d_inode, FSNOTIFY_EVENT_INODE,
|
2017-07-07 18:51:19 +00:00
|
|
|
name.name, 0);
|
|
|
|
release_dentry_name_snapshot(&name);
|
2009-05-21 21:01:29 +00:00
|
|
|
}
|
|
|
|
|
2010-10-10 09:36:30 +00:00
|
|
|
dput(parent);
|
2010-10-28 21:21:56 +00:00
|
|
|
|
|
|
|
return ret;
|
2009-05-21 21:01:29 +00:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(__fsnotify_parent);
|
|
|
|
|
2012-05-29 18:02:24 +00:00
|
|
|
static int send_to_group(struct inode *to_tell,
|
2016-11-21 01:21:17 +00:00
|
|
|
__u32 mask, const void *data,
|
2010-07-28 14:18:39 +00:00
|
|
|
int data_is, u32 cookie,
|
2016-11-10 16:51:50 +00:00
|
|
|
const unsigned char *file_name,
|
|
|
|
struct fsnotify_iter_info *iter_info)
|
2009-12-18 02:24:23 +00:00
|
|
|
{
|
2010-08-18 16:25:49 +00:00
|
|
|
struct fsnotify_group *group = NULL;
|
2018-10-03 21:25:33 +00:00
|
|
|
__u32 test_mask = (mask & ALL_FSNOTIFY_EVENTS);
|
2018-04-05 13:18:03 +00:00
|
|
|
__u32 marks_mask = 0;
|
|
|
|
__u32 marks_ignored_mask = 0;
|
2018-04-20 23:10:53 +00:00
|
|
|
struct fsnotify_mark *mark;
|
|
|
|
int type;
|
2010-07-28 14:18:39 +00:00
|
|
|
|
2018-04-20 23:10:50 +00:00
|
|
|
if (WARN_ON(!iter_info->report_mask))
|
2010-08-18 16:25:49 +00:00
|
|
|
return 0;
|
2010-07-28 14:18:39 +00:00
|
|
|
|
|
|
|
/* clear ignored on inode modification */
|
|
|
|
if (mask & FS_MODIFY) {
|
2018-04-20 23:10:53 +00:00
|
|
|
fsnotify_foreach_obj_type(type) {
|
|
|
|
if (!fsnotify_iter_should_report_type(iter_info, type))
|
|
|
|
continue;
|
|
|
|
mark = iter_info->marks[type];
|
|
|
|
if (mark &&
|
|
|
|
!(mark->flags & FSNOTIFY_MARK_FLAG_IGNORED_SURV_MODIFY))
|
|
|
|
mark->ignored_mask = 0;
|
|
|
|
}
|
2010-07-28 14:18:39 +00:00
|
|
|
}
|
2010-07-28 14:18:39 +00:00
|
|
|
|
2018-04-20 23:10:53 +00:00
|
|
|
fsnotify_foreach_obj_type(type) {
|
|
|
|
if (!fsnotify_iter_should_report_type(iter_info, type))
|
|
|
|
continue;
|
|
|
|
mark = iter_info->marks[type];
|
|
|
|
/* does the object mark tell us to do something? */
|
|
|
|
if (mark) {
|
|
|
|
group = mark->group;
|
|
|
|
marks_mask |= mark->mask;
|
|
|
|
marks_ignored_mask |= mark->ignored_mask;
|
|
|
|
}
|
2010-07-28 14:18:39 +00:00
|
|
|
}
|
|
|
|
|
2018-04-20 23:10:53 +00:00
|
|
|
pr_debug("%s: group=%p to_tell=%p mask=%x marks_mask=%x marks_ignored_mask=%x"
|
2014-01-21 23:48:14 +00:00
|
|
|
" data=%p data_is=%d cookie=%d\n",
|
2018-04-20 23:10:53 +00:00
|
|
|
__func__, group, to_tell, mask, marks_mask, marks_ignored_mask,
|
|
|
|
data, data_is, cookie);
|
2010-08-18 16:25:49 +00:00
|
|
|
|
2018-04-05 13:18:03 +00:00
|
|
|
if (!(test_mask & marks_mask & ~marks_ignored_mask))
|
2010-07-28 14:18:39 +00:00
|
|
|
return 0;
|
|
|
|
|
2018-04-20 23:10:50 +00:00
|
|
|
return group->ops->handle_event(group, to_tell, mask, data, data_is,
|
2016-11-10 16:51:50 +00:00
|
|
|
file_name, cookie, iter_info);
|
2009-12-18 02:24:23 +00:00
|
|
|
}
|
|
|
|
|
2017-10-30 20:14:56 +00:00
|
|
|
static struct fsnotify_mark *fsnotify_first_mark(struct fsnotify_mark_connector **connp)
|
|
|
|
{
|
|
|
|
struct fsnotify_mark_connector *conn;
|
|
|
|
struct hlist_node *node = NULL;
|
|
|
|
|
|
|
|
conn = srcu_dereference(*connp, &fsnotify_mark_srcu);
|
|
|
|
if (conn)
|
|
|
|
node = srcu_dereference(conn->list.first, &fsnotify_mark_srcu);
|
|
|
|
|
|
|
|
return hlist_entry_safe(node, struct fsnotify_mark, obj_list);
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct fsnotify_mark *fsnotify_next_mark(struct fsnotify_mark *mark)
|
|
|
|
{
|
|
|
|
struct hlist_node *node = NULL;
|
|
|
|
|
|
|
|
if (mark)
|
|
|
|
node = srcu_dereference(mark->obj_list.next,
|
|
|
|
&fsnotify_mark_srcu);
|
|
|
|
|
|
|
|
return hlist_entry_safe(node, struct fsnotify_mark, obj_list);
|
|
|
|
}
|
|
|
|
|
2018-04-20 23:10:51 +00:00
|
|
|
/*
|
|
|
|
* iter_info is a multi head priority queue of marks.
|
|
|
|
* Pick a subset of marks from queue heads, all with the
|
|
|
|
* same group and set the report_mask for selected subset.
|
|
|
|
* Returns the report_mask of the selected subset.
|
|
|
|
*/
|
|
|
|
static unsigned int fsnotify_iter_select_report_types(
|
|
|
|
struct fsnotify_iter_info *iter_info)
|
|
|
|
{
|
2018-04-20 23:10:52 +00:00
|
|
|
struct fsnotify_group *max_prio_group = NULL;
|
|
|
|
struct fsnotify_mark *mark;
|
|
|
|
int type;
|
|
|
|
|
|
|
|
/* Choose max prio group among groups of all queue heads */
|
|
|
|
fsnotify_foreach_obj_type(type) {
|
|
|
|
mark = iter_info->marks[type];
|
|
|
|
if (mark &&
|
|
|
|
fsnotify_compare_groups(max_prio_group, mark->group) > 0)
|
|
|
|
max_prio_group = mark->group;
|
|
|
|
}
|
2018-04-20 23:10:51 +00:00
|
|
|
|
2018-04-20 23:10:52 +00:00
|
|
|
if (!max_prio_group)
|
2018-04-20 23:10:51 +00:00
|
|
|
return 0;
|
|
|
|
|
2018-04-20 23:10:52 +00:00
|
|
|
/* Set the report mask for marks from same group as max prio group */
|
2018-04-20 23:10:51 +00:00
|
|
|
iter_info->report_mask = 0;
|
2018-04-20 23:10:52 +00:00
|
|
|
fsnotify_foreach_obj_type(type) {
|
|
|
|
mark = iter_info->marks[type];
|
|
|
|
if (mark &&
|
|
|
|
fsnotify_compare_groups(max_prio_group, mark->group) == 0)
|
|
|
|
fsnotify_iter_set_report_type(iter_info, type);
|
|
|
|
}
|
2018-04-20 23:10:51 +00:00
|
|
|
|
|
|
|
return iter_info->report_mask;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Pop from iter_info multi head queue, the marks that were iterated in the
|
|
|
|
* current iteration step.
|
|
|
|
*/
|
|
|
|
static void fsnotify_iter_next(struct fsnotify_iter_info *iter_info)
|
|
|
|
{
|
2018-04-20 23:10:52 +00:00
|
|
|
int type;
|
2018-04-20 23:10:51 +00:00
|
|
|
|
2018-04-20 23:10:52 +00:00
|
|
|
fsnotify_foreach_obj_type(type) {
|
|
|
|
if (fsnotify_iter_should_report_type(iter_info, type))
|
|
|
|
iter_info->marks[type] =
|
|
|
|
fsnotify_next_mark(iter_info->marks[type]);
|
|
|
|
}
|
2018-04-20 23:10:51 +00:00
|
|
|
}
|
|
|
|
|
2009-05-21 21:01:20 +00:00
|
|
|
/*
|
|
|
|
* This is the main call to fsnotify. The VFS calls into hook specific functions
|
|
|
|
* in linux/fsnotify.h. Those functions then in turn call here. Here will call
|
|
|
|
* out to all of the registered fsnotify_group. Those groups can then use the
|
|
|
|
* notification event in whatever means they feel necessary.
|
|
|
|
*/
|
2016-11-21 01:21:17 +00:00
|
|
|
int fsnotify(struct inode *to_tell, __u32 mask, const void *data, int data_is,
|
2009-12-18 02:24:34 +00:00
|
|
|
const unsigned char *file_name, u32 cookie)
|
2009-05-21 21:01:20 +00:00
|
|
|
{
|
2017-10-30 20:14:56 +00:00
|
|
|
struct fsnotify_iter_info iter_info = {};
|
2018-09-01 07:41:12 +00:00
|
|
|
struct super_block *sb = NULL;
|
|
|
|
struct mount *mnt = NULL;
|
|
|
|
__u32 mnt_or_sb_mask = 0;
|
2016-11-10 16:51:50 +00:00
|
|
|
int ret = 0;
|
2018-10-03 21:25:33 +00:00
|
|
|
__u32 test_mask = (mask & ALL_FSNOTIFY_EVENTS);
|
2009-05-21 21:01:20 +00:00
|
|
|
|
2018-09-01 07:41:12 +00:00
|
|
|
if (data_is == FSNOTIFY_EVENT_PATH) {
|
2016-11-21 01:21:17 +00:00
|
|
|
mnt = real_mount(((const struct path *)data)->mnt);
|
2018-09-01 07:41:12 +00:00
|
|
|
sb = mnt->mnt.mnt_sb;
|
|
|
|
mnt_or_sb_mask = mnt->mnt_fsnotify_mask | sb->s_fsnotify_mask;
|
|
|
|
}
|
2018-10-30 18:29:53 +00:00
|
|
|
/* An event "on child" is not intended for a mount/sb mark */
|
|
|
|
if (mask & FS_EVENT_ON_CHILD)
|
|
|
|
mnt_or_sb_mask = 0;
|
2010-07-28 14:18:39 +00:00
|
|
|
|
2015-09-04 22:43:01 +00:00
|
|
|
/*
|
|
|
|
* Optimization: srcu_read_lock() has a memory barrier which can
|
|
|
|
* be expensive. It protects walking the *_fsnotify_marks lists.
|
|
|
|
* However, if we do not walk the lists, we do not have to do
|
|
|
|
* SRCU because we have no references to any objects and do not
|
|
|
|
* need SRCU to keep them "alive".
|
|
|
|
*/
|
2017-03-14 11:31:02 +00:00
|
|
|
if (!to_tell->i_fsnotify_marks &&
|
2018-09-01 07:41:12 +00:00
|
|
|
(!mnt || (!mnt->mnt_fsnotify_marks && !sb->s_fsnotify_marks)))
|
2015-09-04 22:43:01 +00:00
|
|
|
return 0;
|
2010-07-28 14:18:39 +00:00
|
|
|
/*
|
|
|
|
* if this is a modify event we may need to clear the ignored masks
|
2018-09-01 07:41:12 +00:00
|
|
|
* otherwise return if neither the inode nor the vfsmount/sb care about
|
2010-07-28 14:18:39 +00:00
|
|
|
* this type of event.
|
|
|
|
*/
|
|
|
|
if (!(mask & FS_MODIFY) &&
|
2018-09-01 07:41:12 +00:00
|
|
|
!(test_mask & (to_tell->i_fsnotify_mask | mnt_or_sb_mask)))
|
2010-07-28 14:18:39 +00:00
|
|
|
return 0;
|
2009-12-18 02:24:23 +00:00
|
|
|
|
2016-11-10 16:51:50 +00:00
|
|
|
iter_info.srcu_idx = srcu_read_lock(&fsnotify_mark_srcu);
|
2009-12-18 02:24:23 +00:00
|
|
|
|
2018-09-01 06:40:01 +00:00
|
|
|
iter_info.marks[FSNOTIFY_OBJ_TYPE_INODE] =
|
|
|
|
fsnotify_first_mark(&to_tell->i_fsnotify_marks);
|
|
|
|
if (mnt) {
|
2018-04-20 23:10:52 +00:00
|
|
|
iter_info.marks[FSNOTIFY_OBJ_TYPE_VFSMOUNT] =
|
2017-10-30 20:14:56 +00:00
|
|
|
fsnotify_first_mark(&mnt->mnt_fsnotify_marks);
|
2018-09-01 07:41:12 +00:00
|
|
|
iter_info.marks[FSNOTIFY_OBJ_TYPE_SB] =
|
|
|
|
fsnotify_first_mark(&sb->s_fsnotify_marks);
|
2009-05-21 21:01:20 +00:00
|
|
|
}
|
2010-07-28 14:18:38 +00:00
|
|
|
|
2014-11-13 23:19:33 +00:00
|
|
|
/*
|
2018-09-01 07:41:12 +00:00
|
|
|
* We need to merge inode/vfsmount/sb mark lists so that e.g. inode mark
|
|
|
|
* ignore masks are properly reflected for mount/sb mark notifications.
|
2014-11-13 23:19:33 +00:00
|
|
|
* That's why this traversal is so complicated...
|
|
|
|
*/
|
2018-04-20 23:10:51 +00:00
|
|
|
while (fsnotify_iter_select_report_types(&iter_info)) {
|
2018-04-20 23:10:50 +00:00
|
|
|
ret = send_to_group(to_tell, mask, data, data_is, cookie,
|
|
|
|
file_name, &iter_info);
|
2010-07-28 14:18:39 +00:00
|
|
|
|
2010-10-28 21:21:56 +00:00
|
|
|
if (ret && (mask & ALL_FSNOTIFY_PERM_EVENTS))
|
|
|
|
goto out;
|
|
|
|
|
2018-04-20 23:10:51 +00:00
|
|
|
fsnotify_iter_next(&iter_info);
|
2009-12-18 02:24:23 +00:00
|
|
|
}
|
2010-10-28 21:21:56 +00:00
|
|
|
ret = 0;
|
|
|
|
out:
|
2016-11-10 16:51:50 +00:00
|
|
|
srcu_read_unlock(&fsnotify_mark_srcu, iter_info.srcu_idx);
|
2009-12-18 02:24:34 +00:00
|
|
|
|
2010-03-23 07:08:09 +00:00
|
|
|
return ret;
|
2009-05-21 21:01:20 +00:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(fsnotify);
|
|
|
|
|
2017-03-14 11:31:02 +00:00
|
|
|
extern struct kmem_cache *fsnotify_mark_connector_cachep;
|
|
|
|
|
2009-05-21 21:01:20 +00:00
|
|
|
static __init int fsnotify_init(void)
|
|
|
|
{
|
2010-07-28 14:18:38 +00:00
|
|
|
int ret;
|
|
|
|
|
2018-11-08 03:07:14 +00:00
|
|
|
BUILD_BUG_ON(HWEIGHT32(ALL_FSNOTIFY_BITS) != 24);
|
2010-07-28 14:18:37 +00:00
|
|
|
|
2010-07-28 14:18:38 +00:00
|
|
|
ret = init_srcu_struct(&fsnotify_mark_srcu);
|
|
|
|
if (ret)
|
|
|
|
panic("initializing fsnotify_mark_srcu");
|
|
|
|
|
2017-03-14 11:31:02 +00:00
|
|
|
fsnotify_mark_connector_cachep = KMEM_CACHE(fsnotify_mark_connector,
|
|
|
|
SLAB_PANIC);
|
|
|
|
|
2010-07-28 14:18:38 +00:00
|
|
|
return 0;
|
2009-05-21 21:01:20 +00:00
|
|
|
}
|
2010-07-28 14:18:38 +00:00
|
|
|
core_initcall(fsnotify_init);
|