| Ram Pai | 07b2088 | 2005-11-07 17:19:07 -0500 | [diff] [blame] | 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 | */ | 
| Kirill Korotaev | 6b3286e | 2006-12-08 02:37:56 -0800 | [diff] [blame] | 9 | #include <linux/mnt_namespace.h> | 
| Ram Pai | 07b2088 | 2005-11-07 17:19:07 -0500 | [diff] [blame] | 10 | #include <linux/mount.h> | 
|  | 11 | #include <linux/fs.h> | 
| Al Viro | 6d59e7f | 2008-03-22 15:48:17 -0400 | [diff] [blame] | 12 | #include "internal.h" | 
| Ram Pai | 07b2088 | 2005-11-07 17:19:07 -0500 | [diff] [blame] | 13 | #include "pnode.h" | 
|  | 14 |  | 
| Ram Pai | 03e06e6 | 2005-11-07 17:19:33 -0500 | [diff] [blame] | 15 | /* return the next shared peer mount of @p */ | 
|  | 16 | static inline struct vfsmount *next_peer(struct vfsmount *p) | 
|  | 17 | { | 
|  | 18 | return list_entry(p->mnt_share.next, struct vfsmount, mnt_share); | 
|  | 19 | } | 
|  | 20 |  | 
| Ram Pai | 5afe002 | 2005-11-07 17:21:01 -0500 | [diff] [blame] | 21 | static inline struct vfsmount *first_slave(struct vfsmount *p) | 
|  | 22 | { | 
|  | 23 | return list_entry(p->mnt_slave_list.next, struct vfsmount, mnt_slave); | 
|  | 24 | } | 
|  | 25 |  | 
|  | 26 | static inline struct vfsmount *next_slave(struct vfsmount *p) | 
|  | 27 | { | 
|  | 28 | return list_entry(p->mnt_slave.next, struct vfsmount, mnt_slave); | 
|  | 29 | } | 
|  | 30 |  | 
| Miklos Szeredi | 97e7e0f | 2008-03-27 13:06:26 +0100 | [diff] [blame] | 31 | static struct vfsmount *get_peer_under_root(struct vfsmount *mnt, | 
|  | 32 | struct mnt_namespace *ns, | 
|  | 33 | const struct path *root) | 
|  | 34 | { | 
|  | 35 | struct vfsmount *m = mnt; | 
|  | 36 |  | 
|  | 37 | do { | 
|  | 38 | /* Check the namespace first for optimization */ | 
|  | 39 | if (m->mnt_ns == ns && is_path_reachable(m, m->mnt_root, root)) | 
|  | 40 | return m; | 
|  | 41 |  | 
|  | 42 | m = next_peer(m); | 
|  | 43 | } while (m != mnt); | 
|  | 44 |  | 
|  | 45 | return NULL; | 
|  | 46 | } | 
|  | 47 |  | 
|  | 48 | /* | 
|  | 49 | * Get ID of closest dominating peer group having a representative | 
|  | 50 | * under the given root. | 
|  | 51 | * | 
|  | 52 | * Caller must hold namespace_sem | 
|  | 53 | */ | 
|  | 54 | int get_dominating_id(struct vfsmount *mnt, const struct path *root) | 
|  | 55 | { | 
|  | 56 | struct vfsmount *m; | 
|  | 57 |  | 
|  | 58 | for (m = mnt->mnt_master; m != NULL; m = m->mnt_master) { | 
|  | 59 | struct vfsmount *d = get_peer_under_root(m, mnt->mnt_ns, root); | 
|  | 60 | if (d) | 
|  | 61 | return d->mnt_group_id; | 
|  | 62 | } | 
|  | 63 |  | 
|  | 64 | return 0; | 
|  | 65 | } | 
|  | 66 |  | 
| Ram Pai | a58b0eb | 2005-11-07 17:20:48 -0500 | [diff] [blame] | 67 | static int do_make_slave(struct vfsmount *mnt) | 
|  | 68 | { | 
|  | 69 | struct vfsmount *peer_mnt = mnt, *master = mnt->mnt_master; | 
|  | 70 | struct vfsmount *slave_mnt; | 
|  | 71 |  | 
|  | 72 | /* | 
|  | 73 | * slave 'mnt' to a peer mount that has the | 
| Al Viro | 796a6b5 | 2010-01-16 13:28:47 -0500 | [diff] [blame] | 74 | * same root dentry. If none is available then | 
| Ram Pai | a58b0eb | 2005-11-07 17:20:48 -0500 | [diff] [blame] | 75 | * slave it to anything that is available. | 
|  | 76 | */ | 
|  | 77 | while ((peer_mnt = next_peer(peer_mnt)) != mnt && | 
|  | 78 | peer_mnt->mnt_root != mnt->mnt_root) ; | 
|  | 79 |  | 
|  | 80 | if (peer_mnt == mnt) { | 
|  | 81 | peer_mnt = next_peer(mnt); | 
|  | 82 | if (peer_mnt == mnt) | 
|  | 83 | peer_mnt = NULL; | 
|  | 84 | } | 
| Miklos Szeredi | 719f5d7 | 2008-03-27 13:06:23 +0100 | [diff] [blame] | 85 | if (IS_MNT_SHARED(mnt) && list_empty(&mnt->mnt_share)) | 
|  | 86 | mnt_release_group_id(mnt); | 
|  | 87 |  | 
| Ram Pai | a58b0eb | 2005-11-07 17:20:48 -0500 | [diff] [blame] | 88 | list_del_init(&mnt->mnt_share); | 
| Miklos Szeredi | 719f5d7 | 2008-03-27 13:06:23 +0100 | [diff] [blame] | 89 | mnt->mnt_group_id = 0; | 
| Ram Pai | a58b0eb | 2005-11-07 17:20:48 -0500 | [diff] [blame] | 90 |  | 
|  | 91 | if (peer_mnt) | 
|  | 92 | master = peer_mnt; | 
|  | 93 |  | 
|  | 94 | if (master) { | 
|  | 95 | list_for_each_entry(slave_mnt, &mnt->mnt_slave_list, mnt_slave) | 
|  | 96 | slave_mnt->mnt_master = master; | 
| Akinobu Mita | 1bfba4e | 2006-06-26 00:24:40 -0700 | [diff] [blame] | 97 | list_move(&mnt->mnt_slave, &master->mnt_slave_list); | 
| Ram Pai | a58b0eb | 2005-11-07 17:20:48 -0500 | [diff] [blame] | 98 | list_splice(&mnt->mnt_slave_list, master->mnt_slave_list.prev); | 
|  | 99 | INIT_LIST_HEAD(&mnt->mnt_slave_list); | 
|  | 100 | } else { | 
|  | 101 | struct list_head *p = &mnt->mnt_slave_list; | 
|  | 102 | while (!list_empty(p)) { | 
| Pavel Emelianov | b5e6181 | 2007-05-08 00:30:19 -0700 | [diff] [blame] | 103 | slave_mnt = list_first_entry(p, | 
| Ram Pai | a58b0eb | 2005-11-07 17:20:48 -0500 | [diff] [blame] | 104 | struct vfsmount, mnt_slave); | 
|  | 105 | list_del_init(&slave_mnt->mnt_slave); | 
|  | 106 | slave_mnt->mnt_master = NULL; | 
|  | 107 | } | 
|  | 108 | } | 
|  | 109 | mnt->mnt_master = master; | 
|  | 110 | CLEAR_MNT_SHARED(mnt); | 
| Ram Pai | a58b0eb | 2005-11-07 17:20:48 -0500 | [diff] [blame] | 111 | return 0; | 
|  | 112 | } | 
|  | 113 |  | 
| Nick Piggin | 99b7db7 | 2010-08-18 04:37:39 +1000 | [diff] [blame] | 114 | /* | 
|  | 115 | * vfsmount lock must be held for write | 
|  | 116 | */ | 
| Ram Pai | 07b2088 | 2005-11-07 17:19:07 -0500 | [diff] [blame] | 117 | void change_mnt_propagation(struct vfsmount *mnt, int type) | 
|  | 118 | { | 
| Ram Pai | 03e06e6 | 2005-11-07 17:19:33 -0500 | [diff] [blame] | 119 | if (type == MS_SHARED) { | 
| Ram Pai | b90fa9a | 2005-11-07 17:19:50 -0500 | [diff] [blame] | 120 | set_mnt_shared(mnt); | 
| Ram Pai | a58b0eb | 2005-11-07 17:20:48 -0500 | [diff] [blame] | 121 | return; | 
|  | 122 | } | 
|  | 123 | do_make_slave(mnt); | 
|  | 124 | if (type != MS_SLAVE) { | 
|  | 125 | list_del_init(&mnt->mnt_slave); | 
|  | 126 | mnt->mnt_master = NULL; | 
| Ram Pai | 9676f0c | 2005-11-07 17:21:20 -0500 | [diff] [blame] | 127 | if (type == MS_UNBINDABLE) | 
|  | 128 | mnt->mnt_flags |= MNT_UNBINDABLE; | 
| Andries E. Brouwer | 0b03cfb | 2008-02-06 01:36:32 -0800 | [diff] [blame] | 129 | else | 
|  | 130 | mnt->mnt_flags &= ~MNT_UNBINDABLE; | 
| Ram Pai | 03e06e6 | 2005-11-07 17:19:33 -0500 | [diff] [blame] | 131 | } | 
| Ram Pai | 07b2088 | 2005-11-07 17:19:07 -0500 | [diff] [blame] | 132 | } | 
| Ram Pai | b90fa9a | 2005-11-07 17:19:50 -0500 | [diff] [blame] | 133 |  | 
|  | 134 | /* | 
|  | 135 | * get the next mount in the propagation tree. | 
|  | 136 | * @m: the mount seen last | 
|  | 137 | * @origin: the original mount from where the tree walk initiated | 
| Al Viro | 796a6b5 | 2010-01-16 13:28:47 -0500 | [diff] [blame] | 138 | * | 
|  | 139 | * Note that peer groups form contiguous segments of slave lists. | 
|  | 140 | * We rely on that in get_source() to be able to find out if | 
|  | 141 | * vfsmount found while iterating with propagation_next() is | 
|  | 142 | * a peer of one we'd found earlier. | 
| Ram Pai | b90fa9a | 2005-11-07 17:19:50 -0500 | [diff] [blame] | 143 | */ | 
|  | 144 | static struct vfsmount *propagation_next(struct vfsmount *m, | 
|  | 145 | struct vfsmount *origin) | 
|  | 146 | { | 
| Ram Pai | 5afe002 | 2005-11-07 17:21:01 -0500 | [diff] [blame] | 147 | /* are there any slaves of this mount? */ | 
|  | 148 | if (!IS_MNT_NEW(m) && !list_empty(&m->mnt_slave_list)) | 
|  | 149 | return first_slave(m); | 
|  | 150 |  | 
|  | 151 | while (1) { | 
|  | 152 | struct vfsmount *next; | 
|  | 153 | struct vfsmount *master = m->mnt_master; | 
|  | 154 |  | 
| Miklos Szeredi | bf066c7 | 2006-01-08 01:03:19 -0800 | [diff] [blame] | 155 | if (master == origin->mnt_master) { | 
| Ram Pai | 5afe002 | 2005-11-07 17:21:01 -0500 | [diff] [blame] | 156 | next = next_peer(m); | 
|  | 157 | return ((next == origin) ? NULL : next); | 
|  | 158 | } else if (m->mnt_slave.next != &master->mnt_slave_list) | 
|  | 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 | */ | 
|  | 175 | static struct vfsmount *get_source(struct vfsmount *dest, | 
|  | 176 | struct vfsmount *last_dest, | 
|  | 177 | struct vfsmount *last_src, | 
|  | 178 | int *type) | 
|  | 179 | { | 
|  | 180 | struct vfsmount *p_last_src = NULL; | 
|  | 181 | struct vfsmount *p_last_dest = NULL; | 
| Ram Pai | 5afe002 | 2005-11-07 17:21:01 -0500 | [diff] [blame] | 182 |  | 
|  | 183 | while (last_dest != dest->mnt_master) { | 
|  | 184 | p_last_dest = last_dest; | 
|  | 185 | p_last_src = last_src; | 
|  | 186 | last_dest = last_dest->mnt_master; | 
|  | 187 | last_src = last_src->mnt_master; | 
|  | 188 | } | 
|  | 189 |  | 
|  | 190 | if (p_last_dest) { | 
|  | 191 | do { | 
|  | 192 | p_last_dest = next_peer(p_last_dest); | 
|  | 193 | } while (IS_MNT_NEW(p_last_dest)); | 
| Al Viro | 796a6b5 | 2010-01-16 13:28:47 -0500 | [diff] [blame] | 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 | } | 
| Ram Pai | 5afe002 | 2005-11-07 17:21:01 -0500 | [diff] [blame] | 199 | } | 
| Al Viro | 796a6b5 | 2010-01-16 13:28:47 -0500 | [diff] [blame] | 200 | /* slave of the earlier, then */ | 
|  | 201 | *type = CL_SLAVE; | 
|  | 202 | /* beginning of peer group among the slaves? */ | 
|  | 203 | if (IS_MNT_SHARED(dest)) | 
|  | 204 | *type |= CL_MAKE_SHARED; | 
|  | 205 | return last_src; | 
| Ram Pai | b90fa9a | 2005-11-07 17:19:50 -0500 | [diff] [blame] | 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 | */ | 
|  | 221 | int propagate_mnt(struct vfsmount *dest_mnt, struct dentry *dest_dentry, | 
|  | 222 | struct vfsmount *source_mnt, struct list_head *tree_list) | 
|  | 223 | { | 
|  | 224 | struct vfsmount *m, *child; | 
|  | 225 | int ret = 0; | 
|  | 226 | struct vfsmount *prev_dest_mnt = dest_mnt; | 
|  | 227 | struct vfsmount *prev_src_mnt  = source_mnt; | 
|  | 228 | LIST_HEAD(tmp_list); | 
|  | 229 | LIST_HEAD(umount_list); | 
|  | 230 |  | 
|  | 231 | for (m = propagation_next(dest_mnt, dest_mnt); m; | 
|  | 232 | m = propagation_next(m, dest_mnt)) { | 
| Ram Pai | 5afe002 | 2005-11-07 17:21:01 -0500 | [diff] [blame] | 233 | int type; | 
|  | 234 | struct vfsmount *source; | 
| Ram Pai | b90fa9a | 2005-11-07 17:19:50 -0500 | [diff] [blame] | 235 |  | 
|  | 236 | if (IS_MNT_NEW(m)) | 
|  | 237 | continue; | 
|  | 238 |  | 
| Ram Pai | 5afe002 | 2005-11-07 17:21:01 -0500 | [diff] [blame] | 239 | source =  get_source(m, prev_dest_mnt, prev_src_mnt, &type); | 
| Ram Pai | b90fa9a | 2005-11-07 17:19:50 -0500 | [diff] [blame] | 240 |  | 
| Ram Pai | 5afe002 | 2005-11-07 17:21:01 -0500 | [diff] [blame] | 241 | if (!(child = copy_tree(source, source->mnt_root, type))) { | 
| Ram Pai | b90fa9a | 2005-11-07 17:19:50 -0500 | [diff] [blame] | 242 | ret = -ENOMEM; | 
|  | 243 | list_splice(tree_list, tmp_list.prev); | 
|  | 244 | goto out; | 
|  | 245 | } | 
|  | 246 |  | 
|  | 247 | if (is_subdir(dest_dentry, m->mnt_root)) { | 
|  | 248 | mnt_set_mountpoint(m, dest_dentry, child); | 
|  | 249 | list_add_tail(&child->mnt_hash, tree_list); | 
|  | 250 | } else { | 
|  | 251 | /* | 
|  | 252 | * This can happen if the parent mount was bind mounted | 
|  | 253 | * on some subdirectory of a shared/slave mount. | 
|  | 254 | */ | 
|  | 255 | list_add_tail(&child->mnt_hash, &tmp_list); | 
|  | 256 | } | 
|  | 257 | prev_dest_mnt = m; | 
|  | 258 | prev_src_mnt  = child; | 
|  | 259 | } | 
|  | 260 | out: | 
| Nick Piggin | 99b7db7 | 2010-08-18 04:37:39 +1000 | [diff] [blame] | 261 | br_write_lock(vfsmount_lock); | 
| Ram Pai | b90fa9a | 2005-11-07 17:19:50 -0500 | [diff] [blame] | 262 | while (!list_empty(&tmp_list)) { | 
| Al Viro | 4e1b36f | 2008-03-24 00:16:03 -0400 | [diff] [blame] | 263 | child = list_first_entry(&tmp_list, struct vfsmount, mnt_hash); | 
| Ram Pai | a05964f | 2005-11-07 17:20:17 -0500 | [diff] [blame] | 264 | umount_tree(child, 0, &umount_list); | 
| Ram Pai | b90fa9a | 2005-11-07 17:19:50 -0500 | [diff] [blame] | 265 | } | 
| Nick Piggin | 99b7db7 | 2010-08-18 04:37:39 +1000 | [diff] [blame] | 266 | br_write_unlock(vfsmount_lock); | 
| Ram Pai | b90fa9a | 2005-11-07 17:19:50 -0500 | [diff] [blame] | 267 | release_mounts(&umount_list); | 
|  | 268 | return ret; | 
|  | 269 | } | 
| Ram Pai | a05964f | 2005-11-07 17:20:17 -0500 | [diff] [blame] | 270 |  | 
|  | 271 | /* | 
|  | 272 | * return true if the refcount is greater than count | 
|  | 273 | */ | 
|  | 274 | static inline int do_refcount_check(struct vfsmount *mnt, int count) | 
|  | 275 | { | 
| Nick Piggin | b3e19d9 | 2011-01-07 17:50:11 +1100 | [diff] [blame] | 276 | int mycount = mnt_get_count(mnt) - mnt->mnt_ghosts; | 
| Ram Pai | a05964f | 2005-11-07 17:20:17 -0500 | [diff] [blame] | 277 | return (mycount > count); | 
|  | 278 | } | 
|  | 279 |  | 
|  | 280 | /* | 
|  | 281 | * check if the mount 'mnt' can be unmounted successfully. | 
|  | 282 | * @mnt: the mount to be checked for unmount | 
|  | 283 | * NOTE: unmounting 'mnt' would naturally propagate to all | 
|  | 284 | * other mounts its parent propagates to. | 
|  | 285 | * Check if any of these mounts that **do not have submounts** | 
|  | 286 | * have more references than 'refcnt'. If so return busy. | 
| Nick Piggin | 99b7db7 | 2010-08-18 04:37:39 +1000 | [diff] [blame] | 287 | * | 
| Nick Piggin | b3e19d9 | 2011-01-07 17:50:11 +1100 | [diff] [blame] | 288 | * vfsmount lock must be held for write | 
| Ram Pai | a05964f | 2005-11-07 17:20:17 -0500 | [diff] [blame] | 289 | */ | 
|  | 290 | int propagate_mount_busy(struct vfsmount *mnt, int refcnt) | 
|  | 291 | { | 
|  | 292 | struct vfsmount *m, *child; | 
|  | 293 | struct vfsmount *parent = mnt->mnt_parent; | 
|  | 294 | int ret = 0; | 
|  | 295 |  | 
|  | 296 | if (mnt == parent) | 
|  | 297 | return do_refcount_check(mnt, refcnt); | 
|  | 298 |  | 
|  | 299 | /* | 
|  | 300 | * quickly check if the current mount can be unmounted. | 
|  | 301 | * If not, we don't have to go checking for all other | 
|  | 302 | * mounts | 
|  | 303 | */ | 
|  | 304 | if (!list_empty(&mnt->mnt_mounts) || do_refcount_check(mnt, refcnt)) | 
|  | 305 | return 1; | 
|  | 306 |  | 
|  | 307 | for (m = propagation_next(parent, parent); m; | 
|  | 308 | m = propagation_next(m, parent)) { | 
|  | 309 | child = __lookup_mnt(m, mnt->mnt_mountpoint, 0); | 
|  | 310 | if (child && list_empty(&child->mnt_mounts) && | 
|  | 311 | (ret = do_refcount_check(child, 1))) | 
|  | 312 | break; | 
|  | 313 | } | 
|  | 314 | return ret; | 
|  | 315 | } | 
|  | 316 |  | 
|  | 317 | /* | 
|  | 318 | * NOTE: unmounting 'mnt' naturally propagates to all other mounts its | 
|  | 319 | * parent propagates to. | 
|  | 320 | */ | 
|  | 321 | static void __propagate_umount(struct vfsmount *mnt) | 
|  | 322 | { | 
|  | 323 | struct vfsmount *parent = mnt->mnt_parent; | 
|  | 324 | struct vfsmount *m; | 
|  | 325 |  | 
|  | 326 | BUG_ON(parent == mnt); | 
|  | 327 |  | 
|  | 328 | for (m = propagation_next(parent, parent); m; | 
|  | 329 | m = propagation_next(m, parent)) { | 
|  | 330 |  | 
|  | 331 | struct vfsmount *child = __lookup_mnt(m, | 
|  | 332 | mnt->mnt_mountpoint, 0); | 
|  | 333 | /* | 
|  | 334 | * umount the child only if the child has no | 
|  | 335 | * other children | 
|  | 336 | */ | 
| Akinobu Mita | 1bfba4e | 2006-06-26 00:24:40 -0700 | [diff] [blame] | 337 | if (child && list_empty(&child->mnt_mounts)) | 
|  | 338 | list_move_tail(&child->mnt_hash, &mnt->mnt_hash); | 
| Ram Pai | a05964f | 2005-11-07 17:20:17 -0500 | [diff] [blame] | 339 | } | 
|  | 340 | } | 
|  | 341 |  | 
|  | 342 | /* | 
|  | 343 | * collect all mounts that receive propagation from the mount in @list, | 
|  | 344 | * and return these additional mounts in the same list. | 
|  | 345 | * @list: the list of mounts to be unmounted. | 
| Nick Piggin | 99b7db7 | 2010-08-18 04:37:39 +1000 | [diff] [blame] | 346 | * | 
|  | 347 | * vfsmount lock must be held for write | 
| Ram Pai | a05964f | 2005-11-07 17:20:17 -0500 | [diff] [blame] | 348 | */ | 
|  | 349 | int propagate_umount(struct list_head *list) | 
|  | 350 | { | 
|  | 351 | struct vfsmount *mnt; | 
|  | 352 |  | 
|  | 353 | list_for_each_entry(mnt, list, mnt_hash) | 
|  | 354 | __propagate_umount(mnt); | 
|  | 355 | return 0; | 
|  | 356 | } |