blob: d15c63e97ef1e6df711c9e78c1e72c77cd69709e [file] [log] [blame]
Ram Pai07b20882005-11-07 17:19:07 -05001/*
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 */
Kirill Korotaev6b3286e2006-12-08 02:37:56 -08009#include <linux/mnt_namespace.h>
Ram Pai07b20882005-11-07 17:19:07 -050010#include <linux/mount.h>
11#include <linux/fs.h>
Eric W. Biederman132c94e2013-03-22 04:08:05 -070012#include <linux/nsproxy.h>
Al Viro6d59e7f2008-03-22 15:48:17 -040013#include "internal.h"
Ram Pai07b20882005-11-07 17:19:07 -050014#include "pnode.h"
15
Ram Pai03e06e62005-11-07 17:19:33 -050016/* return the next shared peer mount of @p */
Al Viroc9371352011-11-24 23:56:26 -050017static inline struct mount *next_peer(struct mount *p)
Ram Pai03e06e62005-11-07 17:19:33 -050018{
Al Viro6776db3d2011-11-25 00:22:05 -050019 return list_entry(p->mnt_share.next, struct mount, mnt_share);
Ram Pai03e06e62005-11-07 17:19:33 -050020}
21
Al Viroc9371352011-11-24 23:56:26 -050022static inline struct mount *first_slave(struct mount *p)
Ram Pai5afe0022005-11-07 17:21:01 -050023{
Al Viro6776db3d2011-11-25 00:22:05 -050024 return list_entry(p->mnt_slave_list.next, struct mount, mnt_slave);
Ram Pai5afe0022005-11-07 17:21:01 -050025}
26
Eric W. Biederman54fcb232016-10-24 17:25:19 -050027static inline struct mount *last_slave(struct mount *p)
28{
29 return list_entry(p->mnt_slave_list.prev, struct mount, mnt_slave);
30}
31
Al Viroc9371352011-11-24 23:56:26 -050032static inline struct mount *next_slave(struct mount *p)
Ram Pai5afe0022005-11-07 17:21:01 -050033{
Al Viro6776db3d2011-11-25 00:22:05 -050034 return list_entry(p->mnt_slave.next, struct mount, mnt_slave);
Ram Pai5afe0022005-11-07 17:21:01 -050035}
36
Al Viro6fc78712011-11-24 23:35:54 -050037static struct mount *get_peer_under_root(struct mount *mnt,
38 struct mnt_namespace *ns,
39 const struct path *root)
Miklos Szeredi97e7e0f2008-03-27 13:06:26 +010040{
Al Viro6fc78712011-11-24 23:35:54 -050041 struct mount *m = mnt;
Miklos Szeredi97e7e0f2008-03-27 13:06:26 +010042
43 do {
44 /* Check the namespace first for optimization */
Al Viro143c8c92011-11-25 00:46:35 -050045 if (m->mnt_ns == ns && is_path_reachable(m, m->mnt.mnt_root, root))
Al Viro6fc78712011-11-24 23:35:54 -050046 return m;
Miklos Szeredi97e7e0f2008-03-27 13:06:26 +010047
Al Viroc9371352011-11-24 23:56:26 -050048 m = next_peer(m);
Al Viro6fc78712011-11-24 23:35:54 -050049 } while (m != mnt);
Miklos Szeredi97e7e0f2008-03-27 13:06:26 +010050
51 return NULL;
52}
53
54/*
55 * Get ID of closest dominating peer group having a representative
56 * under the given root.
57 *
58 * Caller must hold namespace_sem
59 */
Al Viro6fc78712011-11-24 23:35:54 -050060int get_dominating_id(struct mount *mnt, const struct path *root)
Miklos Szeredi97e7e0f2008-03-27 13:06:26 +010061{
Al Viro6fc78712011-11-24 23:35:54 -050062 struct mount *m;
Miklos Szeredi97e7e0f2008-03-27 13:06:26 +010063
Al Viro32301922011-11-25 00:10:28 -050064 for (m = mnt->mnt_master; m != NULL; m = m->mnt_master) {
Al Viro143c8c92011-11-25 00:46:35 -050065 struct mount *d = get_peer_under_root(m, mnt->mnt_ns, root);
Miklos Szeredi97e7e0f2008-03-27 13:06:26 +010066 if (d)
Al Viro15169fe2011-11-25 00:50:41 -050067 return d->mnt_group_id;
Miklos Szeredi97e7e0f2008-03-27 13:06:26 +010068 }
69
70 return 0;
71}
72
Al Viro6fc78712011-11-24 23:35:54 -050073static int do_make_slave(struct mount *mnt)
Ram Paia58b0eb2005-11-07 17:20:48 -050074{
Al Viro32301922011-11-25 00:10:28 -050075 struct mount *peer_mnt = mnt, *master = mnt->mnt_master;
Al Virod10e8de2011-11-25 00:07:16 -050076 struct mount *slave_mnt;
Ram Paia58b0eb2005-11-07 17:20:48 -050077
78 /*
79 * slave 'mnt' to a peer mount that has the
Al Viro796a6b52010-01-16 13:28:47 -050080 * same root dentry. If none is available then
Ram Paia58b0eb2005-11-07 17:20:48 -050081 * slave it to anything that is available.
82 */
Al Viroc9371352011-11-24 23:56:26 -050083 while ((peer_mnt = next_peer(peer_mnt)) != mnt &&
Al Viro6fc78712011-11-24 23:35:54 -050084 peer_mnt->mnt.mnt_root != mnt->mnt.mnt_root) ;
Ram Paia58b0eb2005-11-07 17:20:48 -050085
86 if (peer_mnt == mnt) {
Al Viroc9371352011-11-24 23:56:26 -050087 peer_mnt = next_peer(mnt);
Ram Paia58b0eb2005-11-07 17:20:48 -050088 if (peer_mnt == mnt)
89 peer_mnt = NULL;
90 }
Takashi Iwai5d477b62013-05-10 14:04:11 +020091 if (mnt->mnt_group_id && IS_MNT_SHARED(mnt) &&
92 list_empty(&mnt->mnt_share))
Al Viro6fc78712011-11-24 23:35:54 -050093 mnt_release_group_id(mnt);
Miklos Szeredi719f5d72008-03-27 13:06:23 +010094
Al Viro6776db3d2011-11-25 00:22:05 -050095 list_del_init(&mnt->mnt_share);
Al Viro15169fe2011-11-25 00:50:41 -050096 mnt->mnt_group_id = 0;
Ram Paia58b0eb2005-11-07 17:20:48 -050097
98 if (peer_mnt)
99 master = peer_mnt;
100
101 if (master) {
Al Viro6776db3d2011-11-25 00:22:05 -0500102 list_for_each_entry(slave_mnt, &mnt->mnt_slave_list, mnt_slave)
Al Viro32301922011-11-25 00:10:28 -0500103 slave_mnt->mnt_master = master;
Al Viro6776db3d2011-11-25 00:22:05 -0500104 list_move(&mnt->mnt_slave, &master->mnt_slave_list);
105 list_splice(&mnt->mnt_slave_list, master->mnt_slave_list.prev);
106 INIT_LIST_HEAD(&mnt->mnt_slave_list);
Ram Paia58b0eb2005-11-07 17:20:48 -0500107 } else {
Al Viro6776db3d2011-11-25 00:22:05 -0500108 struct list_head *p = &mnt->mnt_slave_list;
Ram Paia58b0eb2005-11-07 17:20:48 -0500109 while (!list_empty(p)) {
Pavel Emelianovb5e61812007-05-08 00:30:19 -0700110 slave_mnt = list_first_entry(p,
Al Viro6776db3d2011-11-25 00:22:05 -0500111 struct mount, mnt_slave);
112 list_del_init(&slave_mnt->mnt_slave);
Ram Paia58b0eb2005-11-07 17:20:48 -0500113 slave_mnt->mnt_master = NULL;
114 }
115 }
Al Viro32301922011-11-25 00:10:28 -0500116 mnt->mnt_master = master;
Al Virofc7be132011-11-25 01:05:37 -0500117 CLEAR_MNT_SHARED(mnt);
Ram Paia58b0eb2005-11-07 17:20:48 -0500118 return 0;
119}
120
Nick Piggin99b7db72010-08-18 04:37:39 +1000121/*
122 * vfsmount lock must be held for write
123 */
Al Viro0f0afb12011-11-24 20:43:10 -0500124void change_mnt_propagation(struct mount *mnt, int type)
Ram Pai07b20882005-11-07 17:19:07 -0500125{
Ram Pai03e06e62005-11-07 17:19:33 -0500126 if (type == MS_SHARED) {
Ram Paib90fa9a2005-11-07 17:19:50 -0500127 set_mnt_shared(mnt);
Ram Paia58b0eb2005-11-07 17:20:48 -0500128 return;
129 }
Al Viro6fc78712011-11-24 23:35:54 -0500130 do_make_slave(mnt);
Ram Paia58b0eb2005-11-07 17:20:48 -0500131 if (type != MS_SLAVE) {
Al Viro6776db3d2011-11-25 00:22:05 -0500132 list_del_init(&mnt->mnt_slave);
Al Virod10e8de2011-11-25 00:07:16 -0500133 mnt->mnt_master = NULL;
Ram Pai9676f0c2005-11-07 17:21:20 -0500134 if (type == MS_UNBINDABLE)
Al Viro0f0afb12011-11-24 20:43:10 -0500135 mnt->mnt.mnt_flags |= MNT_UNBINDABLE;
Andries E. Brouwer0b03cfb2008-02-06 01:36:32 -0800136 else
Al Viro0f0afb12011-11-24 20:43:10 -0500137 mnt->mnt.mnt_flags &= ~MNT_UNBINDABLE;
Ram Pai03e06e62005-11-07 17:19:33 -0500138 }
Ram Pai07b20882005-11-07 17:19:07 -0500139}
Ram Paib90fa9a2005-11-07 17:19:50 -0500140
141/*
142 * get the next mount in the propagation tree.
143 * @m: the mount seen last
144 * @origin: the original mount from where the tree walk initiated
Al Viro796a6b52010-01-16 13:28:47 -0500145 *
146 * Note that peer groups form contiguous segments of slave lists.
147 * We rely on that in get_source() to be able to find out if
148 * vfsmount found while iterating with propagation_next() is
149 * a peer of one we'd found earlier.
Ram Paib90fa9a2005-11-07 17:19:50 -0500150 */
Al Viroc9371352011-11-24 23:56:26 -0500151static struct mount *propagation_next(struct mount *m,
152 struct mount *origin)
Ram Paib90fa9a2005-11-07 17:19:50 -0500153{
Ram Pai5afe0022005-11-07 17:21:01 -0500154 /* are there any slaves of this mount? */
Al Viro143c8c92011-11-25 00:46:35 -0500155 if (!IS_MNT_NEW(m) && !list_empty(&m->mnt_slave_list))
Ram Pai5afe0022005-11-07 17:21:01 -0500156 return first_slave(m);
157
158 while (1) {
Al Viro32301922011-11-25 00:10:28 -0500159 struct mount *master = m->mnt_master;
Ram Pai5afe0022005-11-07 17:21:01 -0500160
Al Viro32301922011-11-25 00:10:28 -0500161 if (master == origin->mnt_master) {
Al Viroc9371352011-11-24 23:56:26 -0500162 struct mount *next = next_peer(m);
163 return (next == origin) ? NULL : next;
Al Viro6776db3d2011-11-25 00:22:05 -0500164 } else if (m->mnt_slave.next != &master->mnt_slave_list)
Ram Pai5afe0022005-11-07 17:21:01 -0500165 return next_slave(m);
166
167 /* back at master */
168 m = master;
169 }
170}
171
Eric W. Biederman54fcb232016-10-24 17:25:19 -0500172static struct mount *skip_propagation_subtree(struct mount *m,
173 struct mount *origin)
174{
175 /*
176 * Advance m such that propagation_next will not return
177 * the slaves of m.
178 */
179 if (!IS_MNT_NEW(m) && !list_empty(&m->mnt_slave_list))
180 m = last_slave(m);
181
182 return m;
183}
184
Al Virof2ebb3a2014-02-27 09:35:45 -0500185static struct mount *next_group(struct mount *m, struct mount *origin)
Ram Pai5afe0022005-11-07 17:21:01 -0500186{
Al Virof2ebb3a2014-02-27 09:35:45 -0500187 while (1) {
188 while (1) {
189 struct mount *next;
190 if (!IS_MNT_NEW(m) && !list_empty(&m->mnt_slave_list))
191 return first_slave(m);
192 next = next_peer(m);
193 if (m->mnt_group_id == origin->mnt_group_id) {
194 if (next == origin)
195 return NULL;
196 } else if (m->mnt_slave.next != &next->mnt_slave)
197 break;
198 m = next;
Al Viro796a6b52010-01-16 13:28:47 -0500199 }
Al Virof2ebb3a2014-02-27 09:35:45 -0500200 /* m is the last peer */
201 while (1) {
202 struct mount *master = m->mnt_master;
203 if (m->mnt_slave.next != &master->mnt_slave_list)
204 return next_slave(m);
205 m = next_peer(master);
206 if (master->mnt_group_id == origin->mnt_group_id)
207 break;
208 if (master->mnt_slave.next == &m->mnt_slave)
209 break;
210 m = master;
211 }
212 if (m == origin)
213 return NULL;
Ram Pai5afe0022005-11-07 17:21:01 -0500214 }
Al Virof2ebb3a2014-02-27 09:35:45 -0500215}
216
217/* all accesses are serialized by namespace_sem */
218static struct user_namespace *user_ns;
Eric W. Biederman5ec08112016-05-05 09:29:29 -0500219static struct mount *last_dest, *first_source, *last_source, *dest_master;
Al Virof2ebb3a2014-02-27 09:35:45 -0500220static struct mountpoint *mp;
221static struct hlist_head *list;
222
Maxim Patlasov7ae8fd02016-02-16 11:45:33 -0800223static inline bool peers(struct mount *m1, struct mount *m2)
224{
225 return m1->mnt_group_id == m2->mnt_group_id && m1->mnt_group_id;
226}
227
Al Virof2ebb3a2014-02-27 09:35:45 -0500228static int propagate_one(struct mount *m)
229{
230 struct mount *child;
231 int type;
232 /* skip ones added by this propagate_mnt() */
233 if (IS_MNT_NEW(m))
234 return 0;
235 /* skip if mountpoint isn't covered by it */
236 if (!is_subdir(mp->m_dentry, m->mnt.mnt_root))
237 return 0;
Maxim Patlasov7ae8fd02016-02-16 11:45:33 -0800238 if (peers(m, last_dest)) {
Al Virof2ebb3a2014-02-27 09:35:45 -0500239 type = CL_MAKE_SHARED;
240 } else {
241 struct mount *n, *p;
Eric W. Biederman5ec08112016-05-05 09:29:29 -0500242 bool done;
Al Virof2ebb3a2014-02-27 09:35:45 -0500243 for (n = m; ; n = p) {
244 p = n->mnt_master;
Eric W. Biederman5ec08112016-05-05 09:29:29 -0500245 if (p == dest_master || IS_MNT_MARKED(p))
Al Virof2ebb3a2014-02-27 09:35:45 -0500246 break;
Al Virof2ebb3a2014-02-27 09:35:45 -0500247 }
Eric W. Biederman5ec08112016-05-05 09:29:29 -0500248 do {
249 struct mount *parent = last_source->mnt_parent;
250 if (last_source == first_source)
251 break;
252 done = parent->mnt_master == p;
253 if (done && peers(n, parent))
254 break;
255 last_source = last_source->mnt_master;
256 } while (!done);
257
Al Virof2ebb3a2014-02-27 09:35:45 -0500258 type = CL_SLAVE;
259 /* beginning of peer group among the slaves? */
260 if (IS_MNT_SHARED(m))
261 type |= CL_MAKE_SHARED;
262 }
263
264 /* Notice when we are propagating across user namespaces */
265 if (m->mnt_ns->user_ns != user_ns)
266 type |= CL_UNPRIVILEGED;
267 child = copy_tree(last_source, last_source->mnt.mnt_root, type);
268 if (IS_ERR(child))
269 return PTR_ERR(child);
Eric W. Biederman8486a782014-10-07 16:22:52 -0700270 child->mnt.mnt_flags &= ~MNT_LOCKED;
Al Virof2ebb3a2014-02-27 09:35:45 -0500271 mnt_set_mountpoint(m, mp, child);
272 last_dest = m;
273 last_source = child;
274 if (m->mnt_master != dest_master) {
275 read_seqlock_excl(&mount_lock);
276 SET_MNT_MARK(m->mnt_master);
277 read_sequnlock_excl(&mount_lock);
278 }
279 hlist_add_head(&child->mnt_hash, list);
Eric W. Biedermand2921682016-09-28 00:27:17 -0500280 return count_mounts(m->mnt_ns, child);
Ram Paib90fa9a2005-11-07 17:19:50 -0500281}
282
283/*
284 * mount 'source_mnt' under the destination 'dest_mnt' at
285 * dentry 'dest_dentry'. And propagate that mount to
286 * all the peer and slave mounts of 'dest_mnt'.
287 * Link all the new mounts into a propagation tree headed at
288 * source_mnt. Also link all the new mounts using ->mnt_list
289 * headed at source_mnt's ->mnt_list
290 *
291 * @dest_mnt: destination mount.
292 * @dest_dentry: destination dentry.
293 * @source_mnt: source mount.
294 * @tree_list : list of heads of trees to be attached.
295 */
Al Viro84d17192013-03-15 10:53:28 -0400296int propagate_mnt(struct mount *dest_mnt, struct mountpoint *dest_mp,
Al Viro38129a12014-03-20 21:10:51 -0400297 struct mount *source_mnt, struct hlist_head *tree_list)
Ram Paib90fa9a2005-11-07 17:19:50 -0500298{
Al Virof2ebb3a2014-02-27 09:35:45 -0500299 struct mount *m, *n;
Ram Paib90fa9a2005-11-07 17:19:50 -0500300 int ret = 0;
Ram Paib90fa9a2005-11-07 17:19:50 -0500301
Al Virof2ebb3a2014-02-27 09:35:45 -0500302 /*
303 * we don't want to bother passing tons of arguments to
304 * propagate_one(); everything is serialized by namespace_sem,
305 * so globals will do just fine.
306 */
307 user_ns = current->nsproxy->mnt_ns->user_ns;
308 last_dest = dest_mnt;
Eric W. Biederman5ec08112016-05-05 09:29:29 -0500309 first_source = source_mnt;
Al Virof2ebb3a2014-02-27 09:35:45 -0500310 last_source = source_mnt;
311 mp = dest_mp;
312 list = tree_list;
313 dest_master = dest_mnt->mnt_master;
Ram Paib90fa9a2005-11-07 17:19:50 -0500314
Al Virof2ebb3a2014-02-27 09:35:45 -0500315 /* all peers of dest_mnt, except dest_mnt itself */
316 for (n = next_peer(dest_mnt); n != dest_mnt; n = next_peer(n)) {
317 ret = propagate_one(n);
318 if (ret)
Ram Paib90fa9a2005-11-07 17:19:50 -0500319 goto out;
Al Virof2ebb3a2014-02-27 09:35:45 -0500320 }
Ram Paib90fa9a2005-11-07 17:19:50 -0500321
Al Virof2ebb3a2014-02-27 09:35:45 -0500322 /* all slave groups */
323 for (m = next_group(dest_mnt, dest_mnt); m;
324 m = next_group(m, dest_mnt)) {
325 /* everything in that slave group */
326 n = m;
327 do {
328 ret = propagate_one(n);
329 if (ret)
330 goto out;
331 n = next_peer(n);
332 } while (n != m);
Ram Paib90fa9a2005-11-07 17:19:50 -0500333 }
334out:
Al Virof2ebb3a2014-02-27 09:35:45 -0500335 read_seqlock_excl(&mount_lock);
336 hlist_for_each_entry(n, tree_list, mnt_hash) {
337 m = n->mnt_parent;
338 if (m->mnt_master != dest_mnt->mnt_master)
339 CLEAR_MNT_MARK(m->mnt_master);
Ram Paib90fa9a2005-11-07 17:19:50 -0500340 }
Al Virof2ebb3a2014-02-27 09:35:45 -0500341 read_sequnlock_excl(&mount_lock);
Ram Paib90fa9a2005-11-07 17:19:50 -0500342 return ret;
343}
Ram Paia05964f2005-11-07 17:20:17 -0500344
Eric W. Biederman808e83e2017-01-20 18:28:35 +1300345static struct mount *find_topper(struct mount *mnt)
346{
347 /* If there is exactly one mount covering mnt completely return it. */
348 struct mount *child;
349
350 if (!list_is_singular(&mnt->mnt_mounts))
351 return NULL;
352
353 child = list_first_entry(&mnt->mnt_mounts, struct mount, mnt_child);
354 if (child->mnt_mountpoint != mnt->mnt.mnt_root)
355 return NULL;
356
357 return child;
358}
359
Ram Paia05964f2005-11-07 17:20:17 -0500360/*
361 * return true if the refcount is greater than count
362 */
Al Viro1ab59732011-11-24 21:35:16 -0500363static inline int do_refcount_check(struct mount *mnt, int count)
Ram Paia05964f2005-11-07 17:20:17 -0500364{
Al Viroaba809cf2013-09-28 23:10:55 -0400365 return mnt_get_count(mnt) > count;
Ram Paia05964f2005-11-07 17:20:17 -0500366}
367
368/*
369 * check if the mount 'mnt' can be unmounted successfully.
370 * @mnt: the mount to be checked for unmount
371 * NOTE: unmounting 'mnt' would naturally propagate to all
372 * other mounts its parent propagates to.
373 * Check if any of these mounts that **do not have submounts**
374 * have more references than 'refcnt'. If so return busy.
Nick Piggin99b7db72010-08-18 04:37:39 +1000375 *
Nick Pigginb3e19d92011-01-07 17:50:11 +1100376 * vfsmount lock must be held for write
Ram Paia05964f2005-11-07 17:20:17 -0500377 */
Al Viro1ab59732011-11-24 21:35:16 -0500378int propagate_mount_busy(struct mount *mnt, int refcnt)
Ram Paia05964f2005-11-07 17:20:17 -0500379{
Eric W. Biederman808e83e2017-01-20 18:28:35 +1300380 struct mount *m, *child, *topper;
Al Viro0714a532011-11-24 22:19:58 -0500381 struct mount *parent = mnt->mnt_parent;
Ram Paia05964f2005-11-07 17:20:17 -0500382
Al Viro0714a532011-11-24 22:19:58 -0500383 if (mnt == parent)
Ram Paia05964f2005-11-07 17:20:17 -0500384 return do_refcount_check(mnt, refcnt);
385
386 /*
387 * quickly check if the current mount can be unmounted.
388 * If not, we don't have to go checking for all other
389 * mounts
390 */
Al Viro6b41d532011-11-24 23:24:33 -0500391 if (!list_empty(&mnt->mnt_mounts) || do_refcount_check(mnt, refcnt))
Ram Paia05964f2005-11-07 17:20:17 -0500392 return 1;
393
Al Viroc9371352011-11-24 23:56:26 -0500394 for (m = propagation_next(parent, parent); m;
395 m = propagation_next(m, parent)) {
Eric W. Biederman808e83e2017-01-20 18:28:35 +1300396 int count = 1;
397 child = __lookup_mnt(&m->mnt, mnt->mnt_mountpoint);
398 if (!child)
399 continue;
400
401 /* Is there exactly one mount on the child that covers
402 * it completely whose reference should be ignored?
403 */
404 topper = find_topper(child);
405 if (topper)
406 count += 1;
407 else if (!list_empty(&child->mnt_mounts))
408 continue;
409
410 if (do_refcount_check(child, count))
411 return 1;
Ram Paia05964f2005-11-07 17:20:17 -0500412 }
Eric W. Biederman808e83e2017-01-20 18:28:35 +1300413 return 0;
Ram Paia05964f2005-11-07 17:20:17 -0500414}
415
416/*
Eric W. Biederman5d884572015-01-03 05:39:35 -0600417 * Clear MNT_LOCKED when it can be shown to be safe.
418 *
419 * mount_lock lock must be held for write
420 */
421void propagate_mount_unlock(struct mount *mnt)
422{
423 struct mount *parent = mnt->mnt_parent;
424 struct mount *m, *child;
425
426 BUG_ON(parent == mnt);
427
428 for (m = propagation_next(parent, parent); m;
429 m = propagation_next(m, parent)) {
Eric W. Biederman808e83e2017-01-20 18:28:35 +1300430 child = __lookup_mnt(&m->mnt, mnt->mnt_mountpoint);
Eric W. Biederman5d884572015-01-03 05:39:35 -0600431 if (child)
432 child->mnt.mnt_flags &= ~MNT_LOCKED;
433 }
434}
435
Eric W. Biedermanbb4fbf02016-10-24 16:16:13 -0500436static void umount_one(struct mount *mnt, struct list_head *to_umount)
Eric W. Biederman0c56fe32015-01-05 13:38:04 -0600437{
Eric W. Biedermanbb4fbf02016-10-24 16:16:13 -0500438 CLEAR_MNT_MARK(mnt);
439 mnt->mnt.mnt_flags |= MNT_UMOUNT;
440 list_del_init(&mnt->mnt_child);
441 list_del_init(&mnt->mnt_umounting);
442 list_move_tail(&mnt->mnt_list, to_umount);
Eric W. Biederman0c56fe32015-01-05 13:38:04 -0600443}
444
445/*
Ram Paia05964f2005-11-07 17:20:17 -0500446 * NOTE: unmounting 'mnt' naturally propagates to all other mounts its
447 * parent propagates to.
448 */
Eric W. Biedermanbb4fbf02016-10-24 16:16:13 -0500449static bool __propagate_umount(struct mount *mnt,
450 struct list_head *to_umount,
451 struct list_head *to_restore)
Ram Paia05964f2005-11-07 17:20:17 -0500452{
Eric W. Biedermanbb4fbf02016-10-24 16:16:13 -0500453 bool progress = false;
454 struct mount *child;
Ram Paia05964f2005-11-07 17:20:17 -0500455
Eric W. Biedermanbb4fbf02016-10-24 16:16:13 -0500456 /*
457 * The state of the parent won't change if this mount is
458 * already unmounted or marked as without children.
459 */
460 if (mnt->mnt.mnt_flags & (MNT_UMOUNT | MNT_MARKED))
461 goto out;
Ram Paia05964f2005-11-07 17:20:17 -0500462
Eric W. Biedermanbb4fbf02016-10-24 16:16:13 -0500463 /* Verify topper is the only grandchild that has not been
464 * speculatively unmounted.
465 */
466 list_for_each_entry(child, &mnt->mnt_mounts, mnt_child) {
467 if (child->mnt_mountpoint == mnt->mnt.mnt_root)
Eric W. Biederman0c56fe32015-01-05 13:38:04 -0600468 continue;
Eric W. Biedermanbb4fbf02016-10-24 16:16:13 -0500469 if (!list_empty(&child->mnt_umounting) && IS_MNT_MARKED(child))
470 continue;
471 /* Found a mounted child */
472 goto children;
473 }
Eric W. Biederman808e83e2017-01-20 18:28:35 +1300474
Eric W. Biedermanbb4fbf02016-10-24 16:16:13 -0500475 /* Mark mounts that can be unmounted if not locked */
476 SET_MNT_MARK(mnt);
477 progress = true;
Eric W. Biederman808e83e2017-01-20 18:28:35 +1300478
Eric W. Biedermanbb4fbf02016-10-24 16:16:13 -0500479 /* If a mount is without children and not locked umount it. */
480 if (!IS_MNT_LOCKED(mnt)) {
481 umount_one(mnt, to_umount);
482 } else {
483children:
484 list_move_tail(&mnt->mnt_umounting, to_restore);
485 }
486out:
487 return progress;
488}
489
490static void umount_list(struct list_head *to_umount,
491 struct list_head *to_restore)
492{
493 struct mount *mnt, *child, *tmp;
494 list_for_each_entry(mnt, to_umount, mnt_list) {
495 list_for_each_entry_safe(child, tmp, &mnt->mnt_mounts, mnt_child) {
496 /* topper? */
497 if (child->mnt_mountpoint == mnt->mnt.mnt_root)
498 list_move_tail(&child->mnt_umounting, to_restore);
499 else
500 umount_one(child, to_umount);
Al Viro38129a12014-03-20 21:10:51 -0400501 }
Ram Paia05964f2005-11-07 17:20:17 -0500502 }
503}
504
Eric W. Biedermanbb4fbf02016-10-24 16:16:13 -0500505static void restore_mounts(struct list_head *to_restore)
Eric W. Biedermane260db72017-05-15 14:42:07 -0500506{
Eric W. Biedermanbb4fbf02016-10-24 16:16:13 -0500507 /* Restore mounts to a clean working state */
508 while (!list_empty(to_restore)) {
Eric W. Biedermane260db72017-05-15 14:42:07 -0500509 struct mount *mnt, *parent;
510 struct mountpoint *mp;
511
Eric W. Biedermanbb4fbf02016-10-24 16:16:13 -0500512 mnt = list_first_entry(to_restore, struct mount, mnt_umounting);
513 CLEAR_MNT_MARK(mnt);
514 list_del_init(&mnt->mnt_umounting);
Eric W. Biedermane260db72017-05-15 14:42:07 -0500515
Eric W. Biedermanbb4fbf02016-10-24 16:16:13 -0500516 /* Should this mount be reparented? */
Eric W. Biedermane260db72017-05-15 14:42:07 -0500517 mp = mnt->mnt_mp;
518 parent = mnt->mnt_parent;
519 while (parent->mnt.mnt_flags & MNT_UMOUNT) {
520 mp = parent->mnt_mp;
521 parent = parent->mnt_parent;
522 }
Eric W. Biedermanbb4fbf02016-10-24 16:16:13 -0500523 if (parent != mnt->mnt_parent)
524 mnt_change_mountpoint(parent, mp, mnt);
Eric W. Biedermane260db72017-05-15 14:42:07 -0500525 }
526}
527
Eric W. Biederman54fcb232016-10-24 17:25:19 -0500528static void cleanup_umount_visitations(struct list_head *visited)
529{
530 while (!list_empty(visited)) {
531 struct mount *mnt =
532 list_first_entry(visited, struct mount, mnt_umounting);
533 list_del_init(&mnt->mnt_umounting);
534 }
535}
536
Ram Paia05964f2005-11-07 17:20:17 -0500537/*
538 * collect all mounts that receive propagation from the mount in @list,
539 * and return these additional mounts in the same list.
540 * @list: the list of mounts to be unmounted.
Nick Piggin99b7db72010-08-18 04:37:39 +1000541 *
542 * vfsmount lock must be held for write
Ram Paia05964f2005-11-07 17:20:17 -0500543 */
Eric W. Biedermanc003b262014-12-18 13:10:48 -0600544int propagate_umount(struct list_head *list)
Ram Paia05964f2005-11-07 17:20:17 -0500545{
Al Viro61ef47b2011-11-24 18:25:28 -0500546 struct mount *mnt;
Eric W. Biedermanbb4fbf02016-10-24 16:16:13 -0500547 LIST_HEAD(to_restore);
548 LIST_HEAD(to_umount);
Eric W. Biederman54fcb232016-10-24 17:25:19 -0500549 LIST_HEAD(visited);
Ram Paia05964f2005-11-07 17:20:17 -0500550
Eric W. Biederman54fcb232016-10-24 17:25:19 -0500551 /* Find candidates for unmounting */
552 list_for_each_entry_reverse(mnt, list, mnt_list) {
Eric W. Biedermanbb4fbf02016-10-24 16:16:13 -0500553 struct mount *parent = mnt->mnt_parent;
554 struct mount *m;
Eric W. Biederman0c56fe32015-01-05 13:38:04 -0600555
Eric W. Biederman54fcb232016-10-24 17:25:19 -0500556 /*
557 * If this mount has already been visited it is known that it's
558 * entire peer group and all of their slaves in the propagation
559 * tree for the mountpoint has already been visited and there is
560 * no need to visit them again.
561 */
562 if (!list_empty(&mnt->mnt_umounting))
563 continue;
564
565 list_add_tail(&mnt->mnt_umounting, &visited);
Eric W. Biedermanbb4fbf02016-10-24 16:16:13 -0500566 for (m = propagation_next(parent, parent); m;
567 m = propagation_next(m, parent)) {
568 struct mount *child = __lookup_mnt(&m->mnt,
569 mnt->mnt_mountpoint);
570 if (!child)
571 continue;
Eric W. Biedermane260db72017-05-15 14:42:07 -0500572
Eric W. Biederman54fcb232016-10-24 17:25:19 -0500573 if (!list_empty(&child->mnt_umounting)) {
574 /*
575 * If the child has already been visited it is
576 * know that it's entire peer group and all of
577 * their slaves in the propgation tree for the
578 * mountpoint has already been visited and there
579 * is no need to visit this subtree again.
580 */
581 m = skip_propagation_subtree(m, parent);
582 continue;
583 } else if (child->mnt.mnt_flags & MNT_UMOUNT) {
584 /*
585 * We have come accross an partially unmounted
586 * mount in list that has not been visited yet.
587 * Remember it has been visited and continue
588 * about our merry way.
589 */
590 list_add_tail(&child->mnt_umounting, &visited);
591 continue;
592 }
593
Eric W. Biedermanbb4fbf02016-10-24 16:16:13 -0500594 /* Check the child and parents while progress is made */
595 while (__propagate_umount(child,
596 &to_umount, &to_restore)) {
597 /* Is the parent a umount candidate? */
598 child = child->mnt_parent;
599 if (list_empty(&child->mnt_umounting))
600 break;
601 }
602 }
603 }
604
605 umount_list(&to_umount, &to_restore);
606 restore_mounts(&to_restore);
Eric W. Biederman54fcb232016-10-24 17:25:19 -0500607 cleanup_umount_visitations(&visited);
Eric W. Biedermanbb4fbf02016-10-24 16:16:13 -0500608 list_splice_tail(&to_umount, list);
Eric W. Biedermane260db72017-05-15 14:42:07 -0500609
Ram Paia05964f2005-11-07 17:20:17 -0500610 return 0;
611}