]> git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blame - fs/pnode.c
fold dup_mnt_ns() into its only surviving caller
[mirror_ubuntu-artful-kernel.git] / fs / pnode.c
CommitLineData
07b20889
RP
1/*
2 * linux/fs/pnode.c
3 *
4 * (C) Copyright IBM Corporation 2005.
5 * Released under GPL v2.
6 * Author : Ram Pai (linuxram@us.ibm.com)
7 *
8 */
6b3286ed 9#include <linux/mnt_namespace.h>
07b20889
RP
10#include <linux/mount.h>
11#include <linux/fs.h>
132c94e3 12#include <linux/nsproxy.h>
6d59e7f5 13#include "internal.h"
07b20889
RP
14#include "pnode.h"
15
03e06e68 16/* return the next shared peer mount of @p */
c937135d 17static inline struct mount *next_peer(struct mount *p)
03e06e68 18{
6776db3d 19 return list_entry(p->mnt_share.next, struct mount, mnt_share);
03e06e68
RP
20}
21
c937135d 22static inline struct mount *first_slave(struct mount *p)
5afe0022 23{
6776db3d 24 return list_entry(p->mnt_slave_list.next, struct mount, mnt_slave);
5afe0022
RP
25}
26
c937135d 27static inline struct mount *next_slave(struct mount *p)
5afe0022 28{
6776db3d 29 return list_entry(p->mnt_slave.next, struct mount, mnt_slave);
5afe0022
RP
30}
31
6fc7871f
AV
32static struct mount *get_peer_under_root(struct mount *mnt,
33 struct mnt_namespace *ns,
34 const struct path *root)
97e7e0f7 35{
6fc7871f 36 struct mount *m = mnt;
97e7e0f7
MS
37
38 do {
39 /* Check the namespace first for optimization */
143c8c91 40 if (m->mnt_ns == ns && is_path_reachable(m, m->mnt.mnt_root, root))
6fc7871f 41 return m;
97e7e0f7 42
c937135d 43 m = next_peer(m);
6fc7871f 44 } while (m != mnt);
97e7e0f7
MS
45
46 return NULL;
47}
48
49/*
50 * Get ID of closest dominating peer group having a representative
51 * under the given root.
52 *
53 * Caller must hold namespace_sem
54 */
6fc7871f 55int get_dominating_id(struct mount *mnt, const struct path *root)
97e7e0f7 56{
6fc7871f 57 struct mount *m;
97e7e0f7 58
32301920 59 for (m = mnt->mnt_master; m != NULL; m = m->mnt_master) {
143c8c91 60 struct mount *d = get_peer_under_root(m, mnt->mnt_ns, root);
97e7e0f7 61 if (d)
15169fe7 62 return d->mnt_group_id;
97e7e0f7
MS
63 }
64
65 return 0;
66}
67
6fc7871f 68static int do_make_slave(struct mount *mnt)
a58b0eb8 69{
32301920 70 struct mount *peer_mnt = mnt, *master = mnt->mnt_master;
d10e8def 71 struct mount *slave_mnt;
a58b0eb8
RP
72
73 /*
74 * slave 'mnt' to a peer mount that has the
796a6b52 75 * same root dentry. If none is available then
a58b0eb8
RP
76 * slave it to anything that is available.
77 */
c937135d 78 while ((peer_mnt = next_peer(peer_mnt)) != mnt &&
6fc7871f 79 peer_mnt->mnt.mnt_root != mnt->mnt.mnt_root) ;
a58b0eb8
RP
80
81 if (peer_mnt == mnt) {
c937135d 82 peer_mnt = next_peer(mnt);
a58b0eb8
RP
83 if (peer_mnt == mnt)
84 peer_mnt = NULL;
85 }
5d477b60
TI
86 if (mnt->mnt_group_id && IS_MNT_SHARED(mnt) &&
87 list_empty(&mnt->mnt_share))
6fc7871f 88 mnt_release_group_id(mnt);
719f5d7f 89
6776db3d 90 list_del_init(&mnt->mnt_share);
15169fe7 91 mnt->mnt_group_id = 0;
a58b0eb8
RP
92
93 if (peer_mnt)
94 master = peer_mnt;
95
96 if (master) {
6776db3d 97 list_for_each_entry(slave_mnt, &mnt->mnt_slave_list, mnt_slave)
32301920 98 slave_mnt->mnt_master = master;
6776db3d
AV
99 list_move(&mnt->mnt_slave, &master->mnt_slave_list);
100 list_splice(&mnt->mnt_slave_list, master->mnt_slave_list.prev);
101 INIT_LIST_HEAD(&mnt->mnt_slave_list);
a58b0eb8 102 } else {
6776db3d 103 struct list_head *p = &mnt->mnt_slave_list;
a58b0eb8 104 while (!list_empty(p)) {
b5e61818 105 slave_mnt = list_first_entry(p,
6776db3d
AV
106 struct mount, mnt_slave);
107 list_del_init(&slave_mnt->mnt_slave);
a58b0eb8
RP
108 slave_mnt->mnt_master = NULL;
109 }
110 }
32301920 111 mnt->mnt_master = master;
fc7be130 112 CLEAR_MNT_SHARED(mnt);
a58b0eb8
RP
113 return 0;
114}
115
99b7db7b
NP
116/*
117 * vfsmount lock must be held for write
118 */
0f0afb1d 119void change_mnt_propagation(struct mount *mnt, int type)
07b20889 120{
03e06e68 121 if (type == MS_SHARED) {
b90fa9ae 122 set_mnt_shared(mnt);
a58b0eb8
RP
123 return;
124 }
6fc7871f 125 do_make_slave(mnt);
a58b0eb8 126 if (type != MS_SLAVE) {
6776db3d 127 list_del_init(&mnt->mnt_slave);
d10e8def 128 mnt->mnt_master = NULL;
9676f0c6 129 if (type == MS_UNBINDABLE)
0f0afb1d 130 mnt->mnt.mnt_flags |= MNT_UNBINDABLE;
0b03cfb2 131 else
0f0afb1d 132 mnt->mnt.mnt_flags &= ~MNT_UNBINDABLE;
03e06e68 133 }
07b20889 134}
b90fa9ae
RP
135
136/*
137 * get the next mount in the propagation tree.
138 * @m: the mount seen last
139 * @origin: the original mount from where the tree walk initiated
796a6b52
AV
140 *
141 * Note that peer groups form contiguous segments of slave lists.
142 * We rely on that in get_source() to be able to find out if
143 * vfsmount found while iterating with propagation_next() is
144 * a peer of one we'd found earlier.
b90fa9ae 145 */
c937135d
AV
146static struct mount *propagation_next(struct mount *m,
147 struct mount *origin)
b90fa9ae 148{
5afe0022 149 /* are there any slaves of this mount? */
143c8c91 150 if (!IS_MNT_NEW(m) && !list_empty(&m->mnt_slave_list))
5afe0022
RP
151 return first_slave(m);
152
153 while (1) {
32301920 154 struct mount *master = m->mnt_master;
5afe0022 155
32301920 156 if (master == origin->mnt_master) {
c937135d
AV
157 struct mount *next = next_peer(m);
158 return (next == origin) ? NULL : next;
6776db3d 159 } else if (m->mnt_slave.next != &master->mnt_slave_list)
5afe0022
RP
160 return next_slave(m);
161
162 /* back at master */
163 m = master;
164 }
165}
166
167/*
168 * return the source mount to be used for cloning
169 *
170 * @dest the current destination mount
171 * @last_dest the last seen destination mount
172 * @last_src the last seen source mount
173 * @type return CL_SLAVE if the new mount has to be
174 * cloned as a slave.
175 */
c937135d
AV
176static struct mount *get_source(struct mount *dest,
177 struct mount *last_dest,
178 struct mount *last_src,
179 int *type)
5afe0022 180{
c937135d
AV
181 struct mount *p_last_src = NULL;
182 struct mount *p_last_dest = NULL;
5afe0022 183
32301920 184 while (last_dest != dest->mnt_master) {
5afe0022
RP
185 p_last_dest = last_dest;
186 p_last_src = last_src;
32301920
AV
187 last_dest = last_dest->mnt_master;
188 last_src = last_src->mnt_master;
5afe0022
RP
189 }
190
191 if (p_last_dest) {
192 do {
193 p_last_dest = next_peer(p_last_dest);
143c8c91 194 } while (IS_MNT_NEW(p_last_dest));
796a6b52
AV
195 /* is that a peer of the earlier? */
196 if (dest == p_last_dest) {
197 *type = CL_MAKE_SHARED;
198 return p_last_src;
199 }
5afe0022 200 }
796a6b52
AV
201 /* slave of the earlier, then */
202 *type = CL_SLAVE;
203 /* beginning of peer group among the slaves? */
fc7be130 204 if (IS_MNT_SHARED(dest))
796a6b52
AV
205 *type |= CL_MAKE_SHARED;
206 return last_src;
b90fa9ae
RP
207}
208
209/*
210 * mount 'source_mnt' under the destination 'dest_mnt' at
211 * dentry 'dest_dentry'. And propagate that mount to
212 * all the peer and slave mounts of 'dest_mnt'.
213 * Link all the new mounts into a propagation tree headed at
214 * source_mnt. Also link all the new mounts using ->mnt_list
215 * headed at source_mnt's ->mnt_list
216 *
217 * @dest_mnt: destination mount.
218 * @dest_dentry: destination dentry.
219 * @source_mnt: source mount.
220 * @tree_list : list of heads of trees to be attached.
221 */
84d17192 222int propagate_mnt(struct mount *dest_mnt, struct mountpoint *dest_mp,
a8d56d8e 223 struct mount *source_mnt, struct list_head *tree_list)
b90fa9ae 224{
132c94e3 225 struct user_namespace *user_ns = current->nsproxy->mnt_ns->user_ns;
c937135d 226 struct mount *m, *child;
b90fa9ae 227 int ret = 0;
a8d56d8e
AV
228 struct mount *prev_dest_mnt = dest_mnt;
229 struct mount *prev_src_mnt = source_mnt;
b90fa9ae 230 LIST_HEAD(tmp_list);
b90fa9ae 231
a8d56d8e
AV
232 for (m = propagation_next(dest_mnt, dest_mnt); m;
233 m = propagation_next(m, dest_mnt)) {
5afe0022 234 int type;
c937135d 235 struct mount *source;
b90fa9ae 236
143c8c91 237 if (IS_MNT_NEW(m))
b90fa9ae
RP
238 continue;
239
5afe0022 240 source = get_source(m, prev_dest_mnt, prev_src_mnt, &type);
b90fa9ae 241
132c94e3
EB
242 /* Notice when we are propagating across user namespaces */
243 if (m->mnt_ns->user_ns != user_ns)
244 type |= CL_UNPRIVILEGED;
245
be34d1a3
DH
246 child = copy_tree(source, source->mnt.mnt_root, type);
247 if (IS_ERR(child)) {
248 ret = PTR_ERR(child);
b90fa9ae
RP
249 list_splice(tree_list, tmp_list.prev);
250 goto out;
251 }
252
84d17192
AV
253 if (is_subdir(dest_mp->m_dentry, m->mnt.mnt_root)) {
254 mnt_set_mountpoint(m, dest_mp, child);
1b8e5564 255 list_add_tail(&child->mnt_hash, tree_list);
b90fa9ae
RP
256 } else {
257 /*
258 * This can happen if the parent mount was bind mounted
259 * on some subdirectory of a shared/slave mount.
260 */
1b8e5564 261 list_add_tail(&child->mnt_hash, &tmp_list);
b90fa9ae
RP
262 }
263 prev_dest_mnt = m;
c937135d 264 prev_src_mnt = child;
b90fa9ae
RP
265 }
266out:
962830df 267 br_write_lock(&vfsmount_lock);
b90fa9ae 268 while (!list_empty(&tmp_list)) {
1b8e5564 269 child = list_first_entry(&tmp_list, struct mount, mnt_hash);
328e6d90 270 umount_tree(child, 0);
b90fa9ae 271 }
962830df 272 br_write_unlock(&vfsmount_lock);
b90fa9ae
RP
273 return ret;
274}
a05964f3
RP
275
276/*
277 * return true if the refcount is greater than count
278 */
1ab59738 279static inline int do_refcount_check(struct mount *mnt, int count)
a05964f3 280{
863d684f 281 int mycount = mnt_get_count(mnt) - mnt->mnt_ghosts;
a05964f3
RP
282 return (mycount > count);
283}
284
285/*
286 * check if the mount 'mnt' can be unmounted successfully.
287 * @mnt: the mount to be checked for unmount
288 * NOTE: unmounting 'mnt' would naturally propagate to all
289 * other mounts its parent propagates to.
290 * Check if any of these mounts that **do not have submounts**
291 * have more references than 'refcnt'. If so return busy.
99b7db7b 292 *
b3e19d92 293 * vfsmount lock must be held for write
a05964f3 294 */
1ab59738 295int propagate_mount_busy(struct mount *mnt, int refcnt)
a05964f3 296{
c937135d 297 struct mount *m, *child;
0714a533 298 struct mount *parent = mnt->mnt_parent;
a05964f3
RP
299 int ret = 0;
300
0714a533 301 if (mnt == parent)
a05964f3
RP
302 return do_refcount_check(mnt, refcnt);
303
304 /*
305 * quickly check if the current mount can be unmounted.
306 * If not, we don't have to go checking for all other
307 * mounts
308 */
6b41d536 309 if (!list_empty(&mnt->mnt_mounts) || do_refcount_check(mnt, refcnt))
a05964f3
RP
310 return 1;
311
c937135d
AV
312 for (m = propagation_next(parent, parent); m;
313 m = propagation_next(m, parent)) {
314 child = __lookup_mnt(&m->mnt, mnt->mnt_mountpoint, 0);
6b41d536 315 if (child && list_empty(&child->mnt_mounts) &&
1ab59738 316 (ret = do_refcount_check(child, 1)))
a05964f3
RP
317 break;
318 }
319 return ret;
320}
321
322/*
323 * NOTE: unmounting 'mnt' naturally propagates to all other mounts its
324 * parent propagates to.
325 */
61ef47b1 326static void __propagate_umount(struct mount *mnt)
a05964f3 327{
0714a533 328 struct mount *parent = mnt->mnt_parent;
c937135d 329 struct mount *m;
a05964f3 330
0714a533 331 BUG_ON(parent == mnt);
a05964f3 332
c937135d
AV
333 for (m = propagation_next(parent, parent); m;
334 m = propagation_next(m, parent)) {
a05964f3 335
c937135d 336 struct mount *child = __lookup_mnt(&m->mnt,
a73324da 337 mnt->mnt_mountpoint, 0);
a05964f3
RP
338 /*
339 * umount the child only if the child has no
340 * other children
341 */
6b41d536 342 if (child && list_empty(&child->mnt_mounts))
1b8e5564 343 list_move_tail(&child->mnt_hash, &mnt->mnt_hash);
a05964f3
RP
344 }
345}
346
347/*
348 * collect all mounts that receive propagation from the mount in @list,
349 * and return these additional mounts in the same list.
350 * @list: the list of mounts to be unmounted.
99b7db7b
NP
351 *
352 * vfsmount lock must be held for write
a05964f3
RP
353 */
354int propagate_umount(struct list_head *list)
355{
61ef47b1 356 struct mount *mnt;
a05964f3 357
1b8e5564 358 list_for_each_entry(mnt, list, mnt_hash)
a05964f3
RP
359 __propagate_umount(mnt);
360 return 0;
361}