vfsmount_mark.c 5.2 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 26
/*
 *  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/mount.h>
#include <linux/mutex.h>
#include <linux/spinlock.h>

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

#include <linux/fsnotify_backend.h>
#include "fsnotify.h"
31
#include "../mount.h"
32 33 34 35 36

void fsnotify_clear_marks_by_mount(struct vfsmount *mnt)
{
	struct fsnotify_mark *mark, *lmark;
	struct hlist_node *pos, *n;
37
	struct mount *m = real_mount(mnt);
38 39 40
	LIST_HEAD(free_list);

	spin_lock(&mnt->mnt_root->d_lock);
41
	hlist_for_each_entry_safe(mark, pos, n, &m->mnt_fsnotify_marks, m.m_list) {
42
		list_add(&mark->m.free_m_list, &free_list);
43
		hlist_del_init_rcu(&mark->m.m_list);
44 45 46 47 48 49 50 51 52 53
		fsnotify_get_mark(mark);
	}
	spin_unlock(&mnt->mnt_root->d_lock);

	list_for_each_entry_safe(mark, lmark, &free_list, m.free_m_list) {
		fsnotify_destroy_mark(mark);
		fsnotify_put_mark(mark);
	}
}

E
Eric Paris 已提交
54 55 56 57 58
void fsnotify_clear_vfsmount_marks_by_group(struct fsnotify_group *group)
{
	fsnotify_clear_marks_by_group_flags(group, FSNOTIFY_MARK_FLAG_VFSMOUNT);
}

59 60 61 62 63
/*
 * Recalculate the mask of events relevant to a given vfsmount locked.
 */
static void fsnotify_recalc_vfsmount_mask_locked(struct vfsmount *mnt)
{
64
	struct mount *m = real_mount(mnt);
65 66 67 68 69 70
	struct fsnotify_mark *mark;
	struct hlist_node *pos;
	__u32 new_mask = 0;

	assert_spin_locked(&mnt->mnt_root->d_lock);

71
	hlist_for_each_entry(mark, pos, &m->mnt_fsnotify_marks, m.m_list)
72
		new_mask |= mark->mask;
73
	m->mnt_fsnotify_mask = new_mask;
74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95
}

/*
 * Recalculate the mnt->mnt_fsnotify_mask, or the mask of all FS_* event types
 * any notifier is interested in hearing for this mount point
 */
void fsnotify_recalc_vfsmount_mask(struct vfsmount *mnt)
{
	spin_lock(&mnt->mnt_root->d_lock);
	fsnotify_recalc_vfsmount_mask_locked(mnt);
	spin_unlock(&mnt->mnt_root->d_lock);
}

void fsnotify_destroy_vfsmount_mark(struct fsnotify_mark *mark)
{
	struct vfsmount *mnt = mark->m.mnt;

	assert_spin_locked(&mark->lock);
	assert_spin_locked(&mark->group->mark_lock);

	spin_lock(&mnt->mnt_root->d_lock);

96
	hlist_del_init_rcu(&mark->m.m_list);
97 98 99 100 101 102 103 104 105 106
	mark->m.mnt = NULL;

	fsnotify_recalc_vfsmount_mask_locked(mnt);

	spin_unlock(&mnt->mnt_root->d_lock);
}

static struct fsnotify_mark *fsnotify_find_vfsmount_mark_locked(struct fsnotify_group *group,
								struct vfsmount *mnt)
{
107
	struct mount *m = real_mount(mnt);
108 109 110 111 112
	struct fsnotify_mark *mark;
	struct hlist_node *pos;

	assert_spin_locked(&mnt->mnt_root->d_lock);

113
	hlist_for_each_entry(mark, pos, &m->mnt_fsnotify_marks, m.m_list) {
114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146
		if (mark->group == group) {
			fsnotify_get_mark(mark);
			return mark;
		}
	}
	return NULL;
}

/*
 * given a group and vfsmount, find the mark associated with that combination.
 * if found take a reference to that mark and return it, else return NULL
 */
struct fsnotify_mark *fsnotify_find_vfsmount_mark(struct fsnotify_group *group,
						  struct vfsmount *mnt)
{
	struct fsnotify_mark *mark;

	spin_lock(&mnt->mnt_root->d_lock);
	mark = fsnotify_find_vfsmount_mark_locked(group, mnt);
	spin_unlock(&mnt->mnt_root->d_lock);

	return mark;
}

/*
 * Attach an initialized mark to a given group and vfsmount.
 * These marks may be used for the fsnotify backend to determine which
 * event types should be delivered to which groups.
 */
int fsnotify_add_vfsmount_mark(struct fsnotify_mark *mark,
			       struct fsnotify_group *group, struct vfsmount *mnt,
			       int allow_dups)
{
147
	struct mount *m = real_mount(mnt);
148 149
	struct fsnotify_mark *lmark;
	struct hlist_node *node, *last = NULL;
150 151
	int ret = 0;

152
	mark->flags |= FSNOTIFY_MARK_FLAG_VFSMOUNT;
153 154 155 156 157 158

	assert_spin_locked(&mark->lock);
	assert_spin_locked(&group->mark_lock);

	spin_lock(&mnt->mnt_root->d_lock);

159
	mark->m.mnt = mnt;
160

161
	/* is mark the first mark? */
162 163
	if (hlist_empty(&m->mnt_fsnotify_marks)) {
		hlist_add_head_rcu(&mark->m.m_list, &m->mnt_fsnotify_marks);
164 165 166 167
		goto out;
	}

	/* should mark be in the middle of the current list? */
168
	hlist_for_each_entry(lmark, node, &m->mnt_fsnotify_marks, m.m_list) {
169 170 171 172 173 174 175
		last = node;

		if ((lmark->group == group) && !allow_dups) {
			ret = -EEXIST;
			goto out;
		}

176 177 178 179 180
		if (mark->group->priority < lmark->group->priority)
			continue;

		if ((mark->group->priority == lmark->group->priority) &&
		    (mark->group < lmark->group))
181
			continue;
182

183
		hlist_add_before_rcu(&mark->m.m_list, &lmark->m.m_list);
184
		goto out;
185 186
	}

187 188
	BUG_ON(last == NULL);
	/* mark should be the last entry.  last is the current last entry */
189
	hlist_add_after_rcu(last, &mark->m.m_list);
190 191
out:
	fsnotify_recalc_vfsmount_mask_locked(mnt);
192 193 194 195
	spin_unlock(&mnt->mnt_root->d_lock);

	return ret;
}