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