pnode.c 8.83 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"

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

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

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

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

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

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

	return NULL;
}

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

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

	return 0;
}

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

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

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

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

	if (peer_mnt)
		master = peer_mnt;

	if (master) {
95
		list_for_each_entry(slave_mnt, &mnt->mnt_slave_list, mnt_slave)
96
			slave_mnt->mnt_master = master;
97 98 99
		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
100
	} else {
101
		struct list_head *p = &mnt->mnt_slave_list;
Ram Pai's avatar
Ram Pai committed
102
		while (!list_empty(p)) {
103
                        slave_mnt = list_first_entry(p,
104 105
					struct mount, mnt_slave);
			list_del_init(&slave_mnt->mnt_slave);
Ram Pai's avatar
Ram Pai committed
106 107 108
			slave_mnt->mnt_master = NULL;
		}
	}
109
	mnt->mnt_master = master;
110
	CLEAR_MNT_SHARED(mnt);
Ram Pai's avatar
Ram Pai committed
111 112 113
	return 0;
}

Nick Piggin's avatar
Nick Piggin committed
114 115 116
/*
 * vfsmount lock must be held for write
 */
117
void change_mnt_propagation(struct mount *mnt, int type)
118
{
119
	if (type == MS_SHARED) {
120
		set_mnt_shared(mnt);
Ram Pai's avatar
Ram Pai committed
121 122
		return;
	}
123
	do_make_slave(mnt);
Ram Pai's avatar
Ram Pai committed
124
	if (type != MS_SLAVE) {
125
		list_del_init(&mnt->mnt_slave);
126
		mnt->mnt_master = NULL;
Ram Pai's avatar
Ram Pai committed
127
		if (type == MS_UNBINDABLE)
128
			mnt->mnt.mnt_flags |= MNT_UNBINDABLE;
Andries E. Brouwer's avatar
Andries E. Brouwer committed
129
		else
130
			mnt->mnt.mnt_flags &= ~MNT_UNBINDABLE;
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
static struct mount *propagation_next(struct mount *m,
					 struct mount *origin)
146
{
147
	/* are there any slaves of this mount? */
148
	if (!IS_MNT_NEW(m) && !list_empty(&m->mnt_slave_list))
149 150 151
		return first_slave(m);

	while (1) {
152
		struct mount *master = m->mnt_master;
153

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

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

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

/*
 * 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.
 */
220 221
int propagate_mnt(struct mount *dest_mnt, struct dentry *dest_dentry,
		    struct mount *source_mnt, struct list_head *tree_list)
222
{
223
	struct mount *m, *child;
224
	int ret = 0;
225 226
	struct mount *prev_dest_mnt = dest_mnt;
	struct mount *prev_src_mnt  = source_mnt;
227 228 229
	LIST_HEAD(tmp_list);
	LIST_HEAD(umount_list);

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

235
		if (IS_MNT_NEW(m))
236 237
			continue;

238
		source =  get_source(m, prev_dest_mnt, prev_src_mnt, &type);
239

240
		if (!(child = copy_tree(source, source->mnt.mnt_root, type))) {
241 242 243 244 245
			ret = -ENOMEM;
			list_splice(tree_list, tmp_list.prev);
			goto out;
		}

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

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

295
	if (mnt == parent)
296 297 298 299 300 301 302
		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
	 */
303
	if (!list_empty(&mnt->mnt_mounts) || do_refcount_check(mnt, refcnt))
304 305
		return 1;

306 307 308
	for (m = propagation_next(parent, parent); m;
	     		m = propagation_next(m, parent)) {
		child = __lookup_mnt(&m->mnt, mnt->mnt_mountpoint, 0);
309
		if (child && list_empty(&child->mnt_mounts) &&
310
		    (ret = do_refcount_check(child, 1)))
311 312 313 314 315 316 317 318 319
			break;
	}
	return ret;
}

/*
 * NOTE: unmounting 'mnt' naturally propagates to all other mounts its
 * parent propagates to.
 */
320
static void __propagate_umount(struct mount *mnt)
321
{
322
	struct mount *parent = mnt->mnt_parent;
323
	struct mount *m;
324

325
	BUG_ON(parent == mnt);
326

327 328
	for (m = propagation_next(parent, parent); m;
			m = propagation_next(m, parent)) {
329

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

/*
 * 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
345 346
 *
 * vfsmount lock must be held for write
347 348 349
 */
int propagate_umount(struct list_head *list)
{
350
	struct mount *mnt;
351

352
	list_for_each_entry(mnt, list, mnt_hash)
353 354 355
		__propagate_umount(mnt);
	return 0;
}