pnode.c 9.03 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 <linux/nsproxy.h>
13
#include "internal.h"
14 15
#include "pnode.h"

16
/* return the next shared peer mount of @p */
17
static inline struct mount *next_peer(struct mount *p)
18
{
19
	return list_entry(p->mnt_share.next, struct mount, mnt_share);
20 21
}

22
static inline struct mount *first_slave(struct mount *p)
23
{
24
	return list_entry(p->mnt_slave_list.next, struct mount, mnt_slave);
25 26
}

27
static inline struct mount *next_slave(struct mount *p)
28
{
29
	return list_entry(p->mnt_slave.next, struct mount, mnt_slave);
30 31
}

32 33 34
static struct mount *get_peer_under_root(struct mount *mnt,
					 struct mnt_namespace *ns,
					 const struct path *root)
35
{
36
	struct mount *m = mnt;
37 38 39

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

43
		m = next_peer(m);
44
	} while (m != mnt);
45 46 47 48 49 50 51 52 53 54

	return NULL;
}

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

59
	for (m = mnt->mnt_master; m != NULL; m = m->mnt_master) {
60
		struct mount *d = get_peer_under_root(m, mnt->mnt_ns, root);
61
		if (d)
Al Viro's avatar
Al Viro committed
62
			return d->mnt_group_id;
63 64 65 66 67
	}

	return 0;
}

68
static int do_make_slave(struct mount *mnt)
Ram Pai's avatar
Ram Pai committed
69
{
70
	struct mount *peer_mnt = mnt, *master = mnt->mnt_master;
71
	struct mount *slave_mnt;
Ram Pai's avatar
Ram Pai committed
72 73 74

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

	if (peer_mnt == mnt) {
82
		peer_mnt = next_peer(mnt);
Ram Pai's avatar
Ram Pai committed
83 84 85
		if (peer_mnt == mnt)
			peer_mnt = NULL;
	}
86 87
	if (mnt->mnt_group_id && IS_MNT_SHARED(mnt) &&
	    list_empty(&mnt->mnt_share))
88
		mnt_release_group_id(mnt);
89

90
	list_del_init(&mnt->mnt_share);
Al Viro's avatar
Al Viro committed
91
	mnt->mnt_group_id = 0;
Ram Pai's avatar
Ram Pai committed
92 93 94 95 96

	if (peer_mnt)
		master = peer_mnt;

	if (master) {
97
		list_for_each_entry(slave_mnt, &mnt->mnt_slave_list, mnt_slave)
98
			slave_mnt->mnt_master = master;
99 100 101
		list_move(&mnt->mnt_slave, &master->mnt_slave_list);
		list_splice(&mnt->mnt_slave_list, master->mnt_slave_list.prev);
		INIT_LIST_HEAD(&mnt->mnt_slave_list);
Ram Pai's avatar
Ram Pai committed
102
	} else {
103
		struct list_head *p = &mnt->mnt_slave_list;
Ram Pai's avatar
Ram Pai committed
104
		while (!list_empty(p)) {
105
                        slave_mnt = list_first_entry(p,
106 107
					struct mount, mnt_slave);
			list_del_init(&slave_mnt->mnt_slave);
Ram Pai's avatar
Ram Pai committed
108 109 110
			slave_mnt->mnt_master = NULL;
		}
	}
111
	mnt->mnt_master = master;
112
	CLEAR_MNT_SHARED(mnt);
Ram Pai's avatar
Ram Pai committed
113 114 115
	return 0;
}

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

/*
 * get the next mount in the propagation tree.
 * @m: the mount seen last
 * @origin: the original mount from where the tree walk initiated
140 141 142 143 144
 *
 * 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.
145
 */
146 147
static struct mount *propagation_next(struct mount *m,
					 struct mount *origin)
148
{
149
	/* are there any slaves of this mount? */
150
	if (!IS_MNT_NEW(m) && !list_empty(&m->mnt_slave_list))
151 152 153
		return first_slave(m);

	while (1) {
154
		struct mount *master = m->mnt_master;
155

156
		if (master == origin->mnt_master) {
157 158
			struct mount *next = next_peer(m);
			return (next == origin) ? NULL : next;
159
		} else if (m->mnt_slave.next != &master->mnt_slave_list)
160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175
			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.
 */
176 177 178 179
static struct mount *get_source(struct mount *dest,
				struct mount *last_dest,
				struct mount *last_src,
				int *type)
180
{
181 182
	struct mount *p_last_src = NULL;
	struct mount *p_last_dest = NULL;
183

184
	while (last_dest != dest->mnt_master) {
185 186
		p_last_dest = last_dest;
		p_last_src = last_src;
187 188
		last_dest = last_dest->mnt_master;
		last_src = last_src->mnt_master;
189 190 191 192 193
	}

	if (p_last_dest) {
		do {
			p_last_dest = next_peer(p_last_dest);
194
		} while (IS_MNT_NEW(p_last_dest));
195 196 197 198 199
		/* is that a peer of the earlier? */
		if (dest == p_last_dest) {
			*type = CL_MAKE_SHARED;
			return p_last_src;
		}
200
	}
201 202 203
	/* slave of the earlier, then */
	*type = CL_SLAVE;
	/* beginning of peer group among the slaves? */
204
	if (IS_MNT_SHARED(dest))
205 206
		*type |= CL_MAKE_SHARED;
	return last_src;
207 208 209 210 211 212 213 214 215 216 217 218 219 220 221
}

/*
 * 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.
 */
222
int propagate_mnt(struct mount *dest_mnt, struct mountpoint *dest_mp,
223
		    struct mount *source_mnt, struct list_head *tree_list)
224
{
225
	struct user_namespace *user_ns = current->nsproxy->mnt_ns->user_ns;
226
	struct mount *m, *child;
227
	int ret = 0;
228 229
	struct mount *prev_dest_mnt = dest_mnt;
	struct mount *prev_src_mnt  = source_mnt;
230 231
	LIST_HEAD(tmp_list);

232 233
	for (m = propagation_next(dest_mnt, dest_mnt); m;
			m = propagation_next(m, dest_mnt)) {
234
		int type;
235
		struct mount *source;
236

237
		if (IS_MNT_NEW(m))
238 239
			continue;

240
		source =  get_source(m, prev_dest_mnt, prev_src_mnt, &type);
241

242 243 244 245
		/* Notice when we are propagating across user namespaces */
		if (m->mnt_ns->user_ns != user_ns)
			type |= CL_UNPRIVILEGED;

246 247 248
		child = copy_tree(source, source->mnt.mnt_root, type);
		if (IS_ERR(child)) {
			ret = PTR_ERR(child);
249 250 251 252
			list_splice(tree_list, tmp_list.prev);
			goto out;
		}

253 254
		if (is_subdir(dest_mp->m_dentry, m->mnt.mnt_root)) {
			mnt_set_mountpoint(m, dest_mp, child);
255
			list_add_tail(&child->mnt_hash, tree_list);
256 257 258 259 260
		} else {
			/*
			 * This can happen if the parent mount was bind mounted
			 * on some subdirectory of a shared/slave mount.
			 */
261
			list_add_tail(&child->mnt_hash, &tmp_list);
262 263
		}
		prev_dest_mnt = m;
264
		prev_src_mnt  = child;
265 266
	}
out:
267
	br_write_lock(&vfsmount_lock);
268
	while (!list_empty(&tmp_list)) {
269
		child = list_first_entry(&tmp_list, struct mount, mnt_hash);
270
		umount_tree(child, 0);
271
	}
272
	br_write_unlock(&vfsmount_lock);
273 274
	return ret;
}
275 276 277 278

/*
 * return true if the refcount is greater than count
 */
279
static inline int do_refcount_check(struct mount *mnt, int count)
280
{
281
	int mycount = mnt_get_count(mnt) - mnt->mnt_ghosts;
282 283 284 285 286 287 288 289 290 291
	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.
Nick Piggin's avatar
Nick Piggin committed
292
 *
Nick Piggin's avatar
Nick Piggin committed
293
 * vfsmount lock must be held for write
294
 */
295
int propagate_mount_busy(struct mount *mnt, int refcnt)
296
{
297
	struct mount *m, *child;
298
	struct mount *parent = mnt->mnt_parent;
299 300
	int ret = 0;

301
	if (mnt == parent)
302 303 304 305 306 307 308
		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
	 */
309
	if (!list_empty(&mnt->mnt_mounts) || do_refcount_check(mnt, refcnt))
310 311
		return 1;

312 313 314
	for (m = propagation_next(parent, parent); m;
	     		m = propagation_next(m, parent)) {
		child = __lookup_mnt(&m->mnt, mnt->mnt_mountpoint, 0);
315
		if (child && list_empty(&child->mnt_mounts) &&
316
		    (ret = do_refcount_check(child, 1)))
317 318 319 320 321 322 323 324 325
			break;
	}
	return ret;
}

/*
 * NOTE: unmounting 'mnt' naturally propagates to all other mounts its
 * parent propagates to.
 */
326
static void __propagate_umount(struct mount *mnt)
327
{
328
	struct mount *parent = mnt->mnt_parent;
329
	struct mount *m;
330

331
	BUG_ON(parent == mnt);
332

333 334
	for (m = propagation_next(parent, parent); m;
			m = propagation_next(m, parent)) {
335

336
		struct mount *child = __lookup_mnt(&m->mnt,
337
					mnt->mnt_mountpoint, 0);
338 339 340 341
		/*
		 * umount the child only if the child has no
		 * other children
		 */
342
		if (child && list_empty(&child->mnt_mounts))
343
			list_move_tail(&child->mnt_hash, &mnt->mnt_hash);
344 345 346 347 348 349 350
	}
}

/*
 * 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.
Nick Piggin's avatar
Nick Piggin committed
351 352
 *
 * vfsmount lock must be held for write
353 354 355
 */
int propagate_umount(struct list_head *list)
{
356
	struct mount *mnt;
357

358
	list_for_each_entry(mnt, list, mnt_hash)
359 360 361
		__propagate_umount(mnt);
	return 0;
}