inode_mark.c 8.5 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
/*
 *  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/fs.h>
#include <linux/init.h>
#include <linux/kernel.h>
#include <linux/module.h>
#include <linux/mutex.h>
#include <linux/spinlock.h>

A
Arun Sharma 已提交
26
#include <linux/atomic.h>
27 28 29 30

#include <linux/fsnotify_backend.h>
#include "fsnotify.h"

31 32
#include "../internal.h"

33 34 35 36 37
/*
 * Recalculate the mask of events relevant to a given inode locked.
 */
static void fsnotify_recalc_inode_mask_locked(struct inode *inode)
{
38
	struct fsnotify_mark *mark;
39 40 41 42 43
	struct hlist_node *pos;
	__u32 new_mask = 0;

	assert_spin_locked(&inode->i_lock);

44 45
	hlist_for_each_entry(mark, pos, &inode->i_fsnotify_marks, i.i_list)
		new_mask |= mark->mask;
46 47 48 49 50 51 52 53 54 55 56 57
	inode->i_fsnotify_mask = new_mask;
}

/*
 * Recalculate the inode->i_fsnotify_mask, or the mask of all FS_* event types
 * any notifier is interested in hearing for this inode.
 */
void fsnotify_recalc_inode_mask(struct inode *inode)
{
	spin_lock(&inode->i_lock);
	fsnotify_recalc_inode_mask_locked(inode);
	spin_unlock(&inode->i_lock);
E
Eric Paris 已提交
58 59

	__fsnotify_update_child_dentry_flags(inode);
60 61
}

62
void fsnotify_destroy_inode_mark(struct fsnotify_mark *mark)
63
{
64
	struct inode *inode = mark->i.inode;
65

66
	BUG_ON(!mutex_is_locked(&mark->group->mark_mutex));
67
	assert_spin_locked(&mark->lock);
68 69 70

	spin_lock(&inode->i_lock);

71
	hlist_del_init_rcu(&mark->i.i_list);
72
	mark->i.inode = NULL;
73 74

	/*
75
	 * this mark is now off the inode->i_fsnotify_marks list and we
76 77 78 79 80 81 82 83 84 85 86 87 88
	 * hold the inode->i_lock, so this is the perfect time to update the
	 * inode->i_fsnotify_mask
	 */
	fsnotify_recalc_inode_mask_locked(inode);

	spin_unlock(&inode->i_lock);
}

/*
 * Given an inode, destroy all of the marks associated with that inode.
 */
void fsnotify_clear_marks_by_inode(struct inode *inode)
{
89
	struct fsnotify_mark *mark, *lmark;
90 91 92 93
	struct hlist_node *pos, *n;
	LIST_HEAD(free_list);

	spin_lock(&inode->i_lock);
94 95
	hlist_for_each_entry_safe(mark, pos, n, &inode->i_fsnotify_marks, i.i_list) {
		list_add(&mark->i.free_i_list, &free_list);
96
		hlist_del_init_rcu(&mark->i.i_list);
97
		fsnotify_get_mark(mark);
98 99 100
	}
	spin_unlock(&inode->i_lock);

101
	list_for_each_entry_safe(mark, lmark, &free_list, i.free_i_list) {
102 103 104 105 106 107 108 109
		struct fsnotify_group *group;

		spin_lock(&mark->lock);
		fsnotify_get_group(mark->group);
		group = mark->group;
		spin_unlock(&mark->lock);

		fsnotify_destroy_mark(mark, group);
110
		fsnotify_put_mark(mark);
111
		fsnotify_put_group(group);
112 113 114
	}
}

E
Eric Paris 已提交
115 116 117 118 119 120 121 122
/*
 * Given a group clear all of the inode marks associated with that group.
 */
void fsnotify_clear_inode_marks_by_group(struct fsnotify_group *group)
{
	fsnotify_clear_marks_by_group_flags(group, FSNOTIFY_MARK_FLAG_INODE);
}

123 124 125 126
/*
 * given a group and inode, find the mark associated with that combination.
 * if found take a reference to that mark and return it, else return NULL
 */
127 128 129
static struct fsnotify_mark *fsnotify_find_inode_mark_locked(
		struct fsnotify_group *group,
		struct inode *inode)
130
{
131
	struct fsnotify_mark *mark;
132 133 134 135
	struct hlist_node *pos;

	assert_spin_locked(&inode->i_lock);

136 137 138 139
	hlist_for_each_entry(mark, pos, &inode->i_fsnotify_marks, i.i_list) {
		if (mark->group == group) {
			fsnotify_get_mark(mark);
			return mark;
140 141 142 143 144 145
		}
	}
	return NULL;
}

/*
146 147
 * given a group and inode, find the mark associated with that combination.
 * if found take a reference to that mark and return it, else return NULL
148
 */
149 150
struct fsnotify_mark *fsnotify_find_inode_mark(struct fsnotify_group *group,
					       struct inode *inode)
151 152 153 154
{
	struct fsnotify_mark *mark;

	spin_lock(&inode->i_lock);
155
	mark = fsnotify_find_inode_mark_locked(group, inode);
156 157 158 159
	spin_unlock(&inode->i_lock);

	return mark;
}
160 161

/*
162 163 164 165 166
 * If we are setting a mark mask on an inode mark we should pin the inode
 * in memory.
 */
void fsnotify_set_inode_mark_mask_locked(struct fsnotify_mark *mark,
					 __u32 mask)
167
{
168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183
	struct inode *inode;

	assert_spin_locked(&mark->lock);

	if (mask &&
	    mark->i.inode &&
	    !(mark->flags & FSNOTIFY_MARK_FLAG_OBJECT_PINNED)) {
		mark->flags |= FSNOTIFY_MARK_FLAG_OBJECT_PINNED;
		inode = igrab(mark->i.inode);
		/*
		 * we shouldn't be able to get here if the inode wasn't
		 * already safely held in memory.  But bug in case it
		 * ever is wrong.
		 */
		BUG_ON(!inode);
	}
184 185 186
}

/*
187
 * Attach an initialized mark to a given inode.
188
 * These marks may be used for the fsnotify backend to determine which
189
 * event types should be delivered to which group and for which inodes.  These
190 191
 * marks are ordered according to priority, highest number first, and then by
 * the group's location in memory.
192
 */
193 194 195
int fsnotify_add_inode_mark(struct fsnotify_mark *mark,
			    struct fsnotify_group *group, struct inode *inode,
			    int allow_dups)
196
{
197 198
	struct fsnotify_mark *lmark;
	struct hlist_node *node, *last = NULL;
199 200
	int ret = 0;

201
	mark->flags |= FSNOTIFY_MARK_FLAG_INODE;
202

203
	BUG_ON(!mutex_is_locked(&group->mark_mutex));
204
	assert_spin_locked(&mark->lock);
205

206 207
	spin_lock(&inode->i_lock);

208
	mark->i.inode = inode;
209

210 211
	/* is mark the first mark? */
	if (hlist_empty(&inode->i_fsnotify_marks)) {
212
		hlist_add_head_rcu(&mark->i.i_list, &inode->i_fsnotify_marks);
213 214
		goto out;
	}
215

216 217 218
	/* should mark be in the middle of the current list? */
	hlist_for_each_entry(lmark, node, &inode->i_fsnotify_marks, i.i_list) {
		last = node;
219

220 221 222 223
		if ((lmark->group == group) && !allow_dups) {
			ret = -EEXIST;
			goto out;
		}
224

225 226 227 228 229
		if (mark->group->priority < lmark->group->priority)
			continue;

		if ((mark->group->priority == lmark->group->priority) &&
		    (mark->group < lmark->group))
230
			continue;
231

232
		hlist_add_before_rcu(&mark->i.i_list, &lmark->i.i_list);
233
		goto out;
234 235
	}

236 237
	BUG_ON(last == NULL);
	/* mark should be the last entry.  last is the current last entry */
238
	hlist_add_after_rcu(last, &mark->i.i_list);
239 240
out:
	fsnotify_recalc_inode_mask_locked(inode);
241 242 243 244
	spin_unlock(&inode->i_lock);

	return ret;
}
245 246 247 248 249

/**
 * fsnotify_unmount_inodes - an sb is unmounting.  handle any watched inodes.
 * @list: list of inodes being unmounted (sb->s_inodes)
 *
250 251
 * Called during unmount with no locks held, so needs to be safe against
 * concurrent modifiers. We temporarily drop inode_sb_list_lock and CAN block.
252 253 254 255 256
 */
void fsnotify_unmount_inodes(struct list_head *list)
{
	struct inode *inode, *next_i, *need_iput = NULL;

257
	spin_lock(&inode_sb_list_lock);
258 259 260 261
	list_for_each_entry_safe(inode, next_i, list, i_sb_list) {
		struct inode *need_iput_tmp;

		/*
A
Al Viro 已提交
262
		 * We cannot __iget() an inode in state I_FREEING,
263 264 265
		 * I_WILL_FREE, or I_NEW which is fine because by that point
		 * the inode cannot have any associated watches.
		 */
266 267 268
		spin_lock(&inode->i_lock);
		if (inode->i_state & (I_FREEING|I_WILL_FREE|I_NEW)) {
			spin_unlock(&inode->i_lock);
269
			continue;
270
		}
271 272 273 274 275 276 277

		/*
		 * If i_count is zero, the inode cannot have any watches and
		 * doing an __iget/iput with MS_ACTIVE clear would actually
		 * evict all inodes with zero i_count from icache which is
		 * unnecessarily violent and may in fact be illegal to do.
		 */
278 279
		if (!atomic_read(&inode->i_count)) {
			spin_unlock(&inode->i_lock);
280
			continue;
281
		}
282 283 284 285 286 287 288 289 290

		need_iput_tmp = need_iput;
		need_iput = NULL;

		/* In case fsnotify_inode_delete() drops a reference. */
		if (inode != need_iput_tmp)
			__iget(inode);
		else
			need_iput_tmp = NULL;
291
		spin_unlock(&inode->i_lock);
292 293 294

		/* In case the dropping of a reference would nuke next_i. */
		if ((&next_i->i_sb_list != list) &&
295 296 297 298 299 300 301
		    atomic_read(&next_i->i_count)) {
			spin_lock(&next_i->i_lock);
			if (!(next_i->i_state & (I_FREEING | I_WILL_FREE))) {
				__iget(next_i);
				need_iput = next_i;
			}
			spin_unlock(&next_i->i_lock);
302 303 304
		}

		/*
305
		 * We can safely drop inode_sb_list_lock here because we hold
306
		 * references on both inode and next_i.  Also no new inodes
307
		 * will be added since the umount has begun.
308
		 */
309
		spin_unlock(&inode_sb_list_lock);
310 311 312 313 314 315 316 317 318 319 320

		if (need_iput_tmp)
			iput(need_iput_tmp);

		/* 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);

321
		spin_lock(&inode_sb_list_lock);
322
	}
323
	spin_unlock(&inode_sb_list_lock);
324
}