pnode.c 9.0 KB
Newer Older
1 2 3 4 5 6 7 8
/*
 *  linux/fs/pnode.c
 *
 * (C) Copyright IBM Corporation 2005.
 *	Released under GPL v2.
 *	Author : Ram Pai (linuxram@us.ibm.com)
 *
 */
9
#include <linux/mnt_namespace.h>
10 11
#include <linux/mount.h>
#include <linux/fs.h>
12
#include "internal.h"
13 14
#include "pnode.h"

R
Ram Pai 已提交
15 16 17 18 19 20
/* return the next shared peer mount of @p */
static inline struct vfsmount *next_peer(struct vfsmount *p)
{
	return list_entry(p->mnt_share.next, struct vfsmount, mnt_share);
}

R
Ram Pai 已提交
21 22 23 24 25 26 27 28 29 30
static inline struct vfsmount *first_slave(struct vfsmount *p)
{
	return list_entry(p->mnt_slave_list.next, struct vfsmount, mnt_slave);
}

static inline struct vfsmount *next_slave(struct vfsmount *p)
{
	return list_entry(p->mnt_slave.next, struct vfsmount, mnt_slave);
}

31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66
static struct vfsmount *get_peer_under_root(struct vfsmount *mnt,
					    struct mnt_namespace *ns,
					    const struct path *root)
{
	struct vfsmount *m = mnt;

	do {
		/* Check the namespace first for optimization */
		if (m->mnt_ns == ns && is_path_reachable(m, m->mnt_root, root))
			return m;

		m = next_peer(m);
	} while (m != mnt);

	return NULL;
}

/*
 * Get ID of closest dominating peer group having a representative
 * under the given root.
 *
 * Caller must hold namespace_sem
 */
int get_dominating_id(struct vfsmount *mnt, const struct path *root)
{
	struct vfsmount *m;

	for (m = mnt->mnt_master; m != NULL; m = m->mnt_master) {
		struct vfsmount *d = get_peer_under_root(m, mnt->mnt_ns, root);
		if (d)
			return d->mnt_group_id;
	}

	return 0;
}

R
Ram Pai 已提交
67 68 69 70 71 72 73
static int do_make_slave(struct vfsmount *mnt)
{
	struct vfsmount *peer_mnt = mnt, *master = mnt->mnt_master;
	struct vfsmount *slave_mnt;

	/*
	 * slave 'mnt' to a peer mount that has the
74
	 * same root dentry. If none is available then
R
Ram Pai 已提交
75 76 77 78 79 80 81 82 83 84
	 * slave it to anything that is available.
	 */
	while ((peer_mnt = next_peer(peer_mnt)) != mnt &&
	       peer_mnt->mnt_root != mnt->mnt_root) ;

	if (peer_mnt == mnt) {
		peer_mnt = next_peer(mnt);
		if (peer_mnt == mnt)
			peer_mnt = NULL;
	}
85
	if (IS_MNT_SHARED(mnt) && list_empty(&mnt->mnt_share))
86
		mnt_release_group_id(real_mount(mnt));
87

R
Ram Pai 已提交
88
	list_del_init(&mnt->mnt_share);
89
	mnt->mnt_group_id = 0;
R
Ram Pai 已提交
90 91 92 93 94 95 96

	if (peer_mnt)
		master = peer_mnt;

	if (master) {
		list_for_each_entry(slave_mnt, &mnt->mnt_slave_list, mnt_slave)
			slave_mnt->mnt_master = master;
A
Akinobu Mita 已提交
97
		list_move(&mnt->mnt_slave, &master->mnt_slave_list);
R
Ram Pai 已提交
98 99 100 101 102
		list_splice(&mnt->mnt_slave_list, master->mnt_slave_list.prev);
		INIT_LIST_HEAD(&mnt->mnt_slave_list);
	} else {
		struct list_head *p = &mnt->mnt_slave_list;
		while (!list_empty(p)) {
103
                        slave_mnt = list_first_entry(p,
R
Ram Pai 已提交
104 105 106 107 108 109 110 111 112 113
					struct vfsmount, mnt_slave);
			list_del_init(&slave_mnt->mnt_slave);
			slave_mnt->mnt_master = NULL;
		}
	}
	mnt->mnt_master = master;
	CLEAR_MNT_SHARED(mnt);
	return 0;
}

N
Nick Piggin 已提交
114 115 116
/*
 * vfsmount lock must be held for write
 */
117
void change_mnt_propagation(struct mount *mnt, int type)
118
{
R
Ram Pai 已提交
119
	if (type == MS_SHARED) {
120
		set_mnt_shared(mnt);
R
Ram Pai 已提交
121 122
		return;
	}
123
	do_make_slave(&mnt->mnt);
R
Ram Pai 已提交
124
	if (type != MS_SLAVE) {
125 126
		list_del_init(&mnt->mnt.mnt_slave);
		mnt->mnt.mnt_master = NULL;
R
Ram Pai 已提交
127
		if (type == MS_UNBINDABLE)
128
			mnt->mnt.mnt_flags |= MNT_UNBINDABLE;
A
Andries E. Brouwer 已提交
129
		else
130
			mnt->mnt.mnt_flags &= ~MNT_UNBINDABLE;
R
Ram Pai 已提交
131
	}
132
}
133 134 135 136 137

/*
 * get the next mount in the propagation tree.
 * @m: the mount seen last
 * @origin: the original mount from where the tree walk initiated
138 139 140 141 142
 *
 * Note that peer groups form contiguous segments of slave lists.
 * We rely on that in get_source() to be able to find out if
 * vfsmount found while iterating with propagation_next() is
 * a peer of one we'd found earlier.
143 144 145 146
 */
static struct vfsmount *propagation_next(struct vfsmount *m,
					 struct vfsmount *origin)
{
R
Ram Pai 已提交
147 148 149 150 151 152 153 154
	/* are there any slaves of this mount? */
	if (!IS_MNT_NEW(m) && !list_empty(&m->mnt_slave_list))
		return first_slave(m);

	while (1) {
		struct vfsmount *next;
		struct vfsmount *master = m->mnt_master;

M
Miklos Szeredi 已提交
155
		if (master == origin->mnt_master) {
R
Ram Pai 已提交
156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193
			next = next_peer(m);
			return ((next == origin) ? NULL : next);
		} else if (m->mnt_slave.next != &master->mnt_slave_list)
			return next_slave(m);

		/* back at master */
		m = master;
	}
}

/*
 * return the source mount to be used for cloning
 *
 * @dest 	the current destination mount
 * @last_dest  	the last seen destination mount
 * @last_src  	the last seen source mount
 * @type	return CL_SLAVE if the new mount has to be
 * 		cloned as a slave.
 */
static struct vfsmount *get_source(struct vfsmount *dest,
					struct vfsmount *last_dest,
					struct vfsmount *last_src,
					int *type)
{
	struct vfsmount *p_last_src = NULL;
	struct vfsmount *p_last_dest = NULL;

	while (last_dest != dest->mnt_master) {
		p_last_dest = last_dest;
		p_last_src = last_src;
		last_dest = last_dest->mnt_master;
		last_src = last_src->mnt_master;
	}

	if (p_last_dest) {
		do {
			p_last_dest = next_peer(p_last_dest);
		} while (IS_MNT_NEW(p_last_dest));
194 195 196 197 198
		/* is that a peer of the earlier? */
		if (dest == p_last_dest) {
			*type = CL_MAKE_SHARED;
			return p_last_src;
		}
R
Ram Pai 已提交
199
	}
200 201 202 203 204 205
	/* slave of the earlier, then */
	*type = CL_SLAVE;
	/* beginning of peer group among the slaves? */
	if (IS_MNT_SHARED(dest))
		*type |= CL_MAKE_SHARED;
	return last_src;
206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232
}

/*
 * mount 'source_mnt' under the destination 'dest_mnt' at
 * dentry 'dest_dentry'. And propagate that mount to
 * all the peer and slave mounts of 'dest_mnt'.
 * Link all the new mounts into a propagation tree headed at
 * source_mnt. Also link all the new mounts using ->mnt_list
 * headed at source_mnt's ->mnt_list
 *
 * @dest_mnt: destination mount.
 * @dest_dentry: destination dentry.
 * @source_mnt: source mount.
 * @tree_list : list of heads of trees to be attached.
 */
int propagate_mnt(struct vfsmount *dest_mnt, struct dentry *dest_dentry,
		    struct vfsmount *source_mnt, struct list_head *tree_list)
{
	struct vfsmount *m, *child;
	int ret = 0;
	struct vfsmount *prev_dest_mnt = dest_mnt;
	struct vfsmount *prev_src_mnt  = source_mnt;
	LIST_HEAD(tmp_list);
	LIST_HEAD(umount_list);

	for (m = propagation_next(dest_mnt, dest_mnt); m;
			m = propagation_next(m, dest_mnt)) {
R
Ram Pai 已提交
233 234
		int type;
		struct vfsmount *source;
235 236 237 238

		if (IS_MNT_NEW(m))
			continue;

R
Ram Pai 已提交
239
		source =  get_source(m, prev_dest_mnt, prev_src_mnt, &type);
240

R
Ram Pai 已提交
241
		if (!(child = copy_tree(source, source->mnt_root, type))) {
242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260
			ret = -ENOMEM;
			list_splice(tree_list, tmp_list.prev);
			goto out;
		}

		if (is_subdir(dest_dentry, m->mnt_root)) {
			mnt_set_mountpoint(m, dest_dentry, child);
			list_add_tail(&child->mnt_hash, tree_list);
		} else {
			/*
			 * This can happen if the parent mount was bind mounted
			 * on some subdirectory of a shared/slave mount.
			 */
			list_add_tail(&child->mnt_hash, &tmp_list);
		}
		prev_dest_mnt = m;
		prev_src_mnt  = child;
	}
out:
N
Nick Piggin 已提交
261
	br_write_lock(vfsmount_lock);
262
	while (!list_empty(&tmp_list)) {
263
		child = list_first_entry(&tmp_list, struct vfsmount, mnt_hash);
R
Ram Pai 已提交
264
		umount_tree(child, 0, &umount_list);
265
	}
N
Nick Piggin 已提交
266
	br_write_unlock(vfsmount_lock);
267 268 269
	release_mounts(&umount_list);
	return ret;
}
R
Ram Pai 已提交
270 271 272 273 274 275

/*
 * return true if the refcount is greater than count
 */
static inline int do_refcount_check(struct vfsmount *mnt, int count)
{
N
Nick Piggin 已提交
276
	int mycount = mnt_get_count(mnt) - mnt->mnt_ghosts;
R
Ram Pai 已提交
277 278 279 280 281 282 283 284 285 286
	return (mycount > count);
}

/*
 * check if the mount 'mnt' can be unmounted successfully.
 * @mnt: the mount to be checked for unmount
 * NOTE: unmounting 'mnt' would naturally propagate to all
 * other mounts its parent propagates to.
 * Check if any of these mounts that **do not have submounts**
 * have more references than 'refcnt'. If so return busy.
N
Nick Piggin 已提交
287
 *
N
Nick Piggin 已提交
288
 * vfsmount lock must be held for write
R
Ram Pai 已提交
289 290 291
 */
int propagate_mount_busy(struct vfsmount *mnt, int refcnt)
{
292 293
	struct vfsmount *m;
	struct mount *child;
R
Ram Pai 已提交
294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310
	struct vfsmount *parent = mnt->mnt_parent;
	int ret = 0;

	if (mnt == parent)
		return do_refcount_check(mnt, refcnt);

	/*
	 * quickly check if the current mount can be unmounted.
	 * If not, we don't have to go checking for all other
	 * mounts
	 */
	if (!list_empty(&mnt->mnt_mounts) || do_refcount_check(mnt, refcnt))
		return 1;

	for (m = propagation_next(parent, parent); m;
	     		m = propagation_next(m, parent)) {
		child = __lookup_mnt(m, mnt->mnt_mountpoint, 0);
311 312
		if (child && list_empty(&child->mnt.mnt_mounts) &&
		    (ret = do_refcount_check(&child->mnt, 1)))
R
Ram Pai 已提交
313 314 315 316 317 318 319 320 321
			break;
	}
	return ret;
}

/*
 * NOTE: unmounting 'mnt' naturally propagates to all other mounts its
 * parent propagates to.
 */
322
static void __propagate_umount(struct mount *mnt)
R
Ram Pai 已提交
323
{
324
	struct vfsmount *parent = mnt->mnt.mnt_parent;
R
Ram Pai 已提交
325 326
	struct vfsmount *m;

327
	BUG_ON(parent == &mnt->mnt);
R
Ram Pai 已提交
328 329 330 331

	for (m = propagation_next(parent, parent); m;
			m = propagation_next(m, parent)) {

332
		struct mount *child = __lookup_mnt(m,
333
					mnt->mnt.mnt_mountpoint, 0);
R
Ram Pai 已提交
334 335 336 337
		/*
		 * umount the child only if the child has no
		 * other children
		 */
338
		if (child && list_empty(&child->mnt.mnt_mounts))
339
			list_move_tail(&child->mnt.mnt_hash, &mnt->mnt.mnt_hash);
R
Ram Pai 已提交
340 341 342 343 344 345 346
	}
}

/*
 * collect all mounts that receive propagation from the mount in @list,
 * and return these additional mounts in the same list.
 * @list: the list of mounts to be unmounted.
N
Nick Piggin 已提交
347 348
 *
 * vfsmount lock must be held for write
R
Ram Pai 已提交
349 350 351
 */
int propagate_umount(struct list_head *list)
{
352
	struct mount *mnt;
R
Ram Pai 已提交
353

354
	list_for_each_entry(mnt, list, mnt.mnt_hash)
R
Ram Pai 已提交
355 356 357
		__propagate_umount(mnt);
	return 0;
}