]> bbs.cooldavid.org Git - net-next-2.6.git/blame - fs/pnode.c
[PATCH] get rid of more nameidata passing in namespace.c
[net-next-2.6.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>
6d59e7f5 12#include "internal.h"
07b20889
RP
13#include "pnode.h"
14
03e06e68
RP
15/* return the next shared peer mount of @p */
16static inline struct vfsmount *next_peer(struct vfsmount *p)
17{
18 return list_entry(p->mnt_share.next, struct vfsmount, mnt_share);
19}
20
5afe0022
RP
21static inline struct vfsmount *first_slave(struct vfsmount *p)
22{
23 return list_entry(p->mnt_slave_list.next, struct vfsmount, mnt_slave);
24}
25
26static inline struct vfsmount *next_slave(struct vfsmount *p)
27{
28 return list_entry(p->mnt_slave.next, struct vfsmount, mnt_slave);
29}
30
a58b0eb8
RP
31static int do_make_slave(struct vfsmount *mnt)
32{
33 struct vfsmount *peer_mnt = mnt, *master = mnt->mnt_master;
34 struct vfsmount *slave_mnt;
35
36 /*
37 * slave 'mnt' to a peer mount that has the
38 * same root dentry. If none is available than
39 * slave it to anything that is available.
40 */
41 while ((peer_mnt = next_peer(peer_mnt)) != mnt &&
42 peer_mnt->mnt_root != mnt->mnt_root) ;
43
44 if (peer_mnt == mnt) {
45 peer_mnt = next_peer(mnt);
46 if (peer_mnt == mnt)
47 peer_mnt = NULL;
48 }
49 list_del_init(&mnt->mnt_share);
50
51 if (peer_mnt)
52 master = peer_mnt;
53
54 if (master) {
55 list_for_each_entry(slave_mnt, &mnt->mnt_slave_list, mnt_slave)
56 slave_mnt->mnt_master = master;
1bfba4e8 57 list_move(&mnt->mnt_slave, &master->mnt_slave_list);
a58b0eb8
RP
58 list_splice(&mnt->mnt_slave_list, master->mnt_slave_list.prev);
59 INIT_LIST_HEAD(&mnt->mnt_slave_list);
60 } else {
61 struct list_head *p = &mnt->mnt_slave_list;
62 while (!list_empty(p)) {
b5e61818 63 slave_mnt = list_first_entry(p,
a58b0eb8
RP
64 struct vfsmount, mnt_slave);
65 list_del_init(&slave_mnt->mnt_slave);
66 slave_mnt->mnt_master = NULL;
67 }
68 }
69 mnt->mnt_master = master;
70 CLEAR_MNT_SHARED(mnt);
71 INIT_LIST_HEAD(&mnt->mnt_slave_list);
72 return 0;
73}
74
07b20889
RP
75void change_mnt_propagation(struct vfsmount *mnt, int type)
76{
03e06e68 77 if (type == MS_SHARED) {
b90fa9ae 78 set_mnt_shared(mnt);
a58b0eb8
RP
79 return;
80 }
81 do_make_slave(mnt);
82 if (type != MS_SLAVE) {
83 list_del_init(&mnt->mnt_slave);
84 mnt->mnt_master = NULL;
9676f0c6
RP
85 if (type == MS_UNBINDABLE)
86 mnt->mnt_flags |= MNT_UNBINDABLE;
0b03cfb2
AB
87 else
88 mnt->mnt_flags &= ~MNT_UNBINDABLE;
03e06e68 89 }
07b20889 90}
b90fa9ae
RP
91
92/*
93 * get the next mount in the propagation tree.
94 * @m: the mount seen last
95 * @origin: the original mount from where the tree walk initiated
96 */
97static struct vfsmount *propagation_next(struct vfsmount *m,
98 struct vfsmount *origin)
99{
5afe0022
RP
100 /* are there any slaves of this mount? */
101 if (!IS_MNT_NEW(m) && !list_empty(&m->mnt_slave_list))
102 return first_slave(m);
103
104 while (1) {
105 struct vfsmount *next;
106 struct vfsmount *master = m->mnt_master;
107
bf066c7d 108 if (master == origin->mnt_master) {
5afe0022
RP
109 next = next_peer(m);
110 return ((next == origin) ? NULL : next);
111 } else if (m->mnt_slave.next != &master->mnt_slave_list)
112 return next_slave(m);
113
114 /* back at master */
115 m = master;
116 }
117}
118
119/*
120 * return the source mount to be used for cloning
121 *
122 * @dest the current destination mount
123 * @last_dest the last seen destination mount
124 * @last_src the last seen source mount
125 * @type return CL_SLAVE if the new mount has to be
126 * cloned as a slave.
127 */
128static struct vfsmount *get_source(struct vfsmount *dest,
129 struct vfsmount *last_dest,
130 struct vfsmount *last_src,
131 int *type)
132{
133 struct vfsmount *p_last_src = NULL;
134 struct vfsmount *p_last_dest = NULL;
53b3531b 135 *type = CL_PROPAGATION;
5afe0022
RP
136
137 if (IS_MNT_SHARED(dest))
138 *type |= CL_MAKE_SHARED;
139
140 while (last_dest != dest->mnt_master) {
141 p_last_dest = last_dest;
142 p_last_src = last_src;
143 last_dest = last_dest->mnt_master;
144 last_src = last_src->mnt_master;
145 }
146
147 if (p_last_dest) {
148 do {
149 p_last_dest = next_peer(p_last_dest);
150 } while (IS_MNT_NEW(p_last_dest));
151 }
152
153 if (dest != p_last_dest) {
154 *type |= CL_SLAVE;
155 return last_src;
156 } else
157 return p_last_src;
b90fa9ae
RP
158}
159
160/*
161 * mount 'source_mnt' under the destination 'dest_mnt' at
162 * dentry 'dest_dentry'. And propagate that mount to
163 * all the peer and slave mounts of 'dest_mnt'.
164 * Link all the new mounts into a propagation tree headed at
165 * source_mnt. Also link all the new mounts using ->mnt_list
166 * headed at source_mnt's ->mnt_list
167 *
168 * @dest_mnt: destination mount.
169 * @dest_dentry: destination dentry.
170 * @source_mnt: source mount.
171 * @tree_list : list of heads of trees to be attached.
172 */
173int propagate_mnt(struct vfsmount *dest_mnt, struct dentry *dest_dentry,
174 struct vfsmount *source_mnt, struct list_head *tree_list)
175{
176 struct vfsmount *m, *child;
177 int ret = 0;
178 struct vfsmount *prev_dest_mnt = dest_mnt;
179 struct vfsmount *prev_src_mnt = source_mnt;
180 LIST_HEAD(tmp_list);
181 LIST_HEAD(umount_list);
182
183 for (m = propagation_next(dest_mnt, dest_mnt); m;
184 m = propagation_next(m, dest_mnt)) {
5afe0022
RP
185 int type;
186 struct vfsmount *source;
b90fa9ae
RP
187
188 if (IS_MNT_NEW(m))
189 continue;
190
5afe0022 191 source = get_source(m, prev_dest_mnt, prev_src_mnt, &type);
b90fa9ae 192
5afe0022 193 if (!(child = copy_tree(source, source->mnt_root, type))) {
b90fa9ae
RP
194 ret = -ENOMEM;
195 list_splice(tree_list, tmp_list.prev);
196 goto out;
197 }
198
199 if (is_subdir(dest_dentry, m->mnt_root)) {
200 mnt_set_mountpoint(m, dest_dentry, child);
201 list_add_tail(&child->mnt_hash, tree_list);
202 } else {
203 /*
204 * This can happen if the parent mount was bind mounted
205 * on some subdirectory of a shared/slave mount.
206 */
207 list_add_tail(&child->mnt_hash, &tmp_list);
208 }
209 prev_dest_mnt = m;
210 prev_src_mnt = child;
211 }
212out:
213 spin_lock(&vfsmount_lock);
214 while (!list_empty(&tmp_list)) {
215 child = list_entry(tmp_list.next, struct vfsmount, mnt_hash);
216 list_del_init(&child->mnt_hash);
a05964f3 217 umount_tree(child, 0, &umount_list);
b90fa9ae
RP
218 }
219 spin_unlock(&vfsmount_lock);
220 release_mounts(&umount_list);
221 return ret;
222}
a05964f3
RP
223
224/*
225 * return true if the refcount is greater than count
226 */
227static inline int do_refcount_check(struct vfsmount *mnt, int count)
228{
7c4b93d8 229 int mycount = atomic_read(&mnt->mnt_count) - mnt->mnt_ghosts;
a05964f3
RP
230 return (mycount > count);
231}
232
233/*
234 * check if the mount 'mnt' can be unmounted successfully.
235 * @mnt: the mount to be checked for unmount
236 * NOTE: unmounting 'mnt' would naturally propagate to all
237 * other mounts its parent propagates to.
238 * Check if any of these mounts that **do not have submounts**
239 * have more references than 'refcnt'. If so return busy.
240 */
241int propagate_mount_busy(struct vfsmount *mnt, int refcnt)
242{
243 struct vfsmount *m, *child;
244 struct vfsmount *parent = mnt->mnt_parent;
245 int ret = 0;
246
247 if (mnt == parent)
248 return do_refcount_check(mnt, refcnt);
249
250 /*
251 * quickly check if the current mount can be unmounted.
252 * If not, we don't have to go checking for all other
253 * mounts
254 */
255 if (!list_empty(&mnt->mnt_mounts) || do_refcount_check(mnt, refcnt))
256 return 1;
257
258 for (m = propagation_next(parent, parent); m;
259 m = propagation_next(m, parent)) {
260 child = __lookup_mnt(m, mnt->mnt_mountpoint, 0);
261 if (child && list_empty(&child->mnt_mounts) &&
262 (ret = do_refcount_check(child, 1)))
263 break;
264 }
265 return ret;
266}
267
268/*
269 * NOTE: unmounting 'mnt' naturally propagates to all other mounts its
270 * parent propagates to.
271 */
272static void __propagate_umount(struct vfsmount *mnt)
273{
274 struct vfsmount *parent = mnt->mnt_parent;
275 struct vfsmount *m;
276
277 BUG_ON(parent == mnt);
278
279 for (m = propagation_next(parent, parent); m;
280 m = propagation_next(m, parent)) {
281
282 struct vfsmount *child = __lookup_mnt(m,
283 mnt->mnt_mountpoint, 0);
284 /*
285 * umount the child only if the child has no
286 * other children
287 */
1bfba4e8
AM
288 if (child && list_empty(&child->mnt_mounts))
289 list_move_tail(&child->mnt_hash, &mnt->mnt_hash);
a05964f3
RP
290 }
291}
292
293/*
294 * collect all mounts that receive propagation from the mount in @list,
295 * and return these additional mounts in the same list.
296 * @list: the list of mounts to be unmounted.
297 */
298int propagate_umount(struct list_head *list)
299{
300 struct vfsmount *mnt;
301
302 list_for_each_entry(mnt, list, mnt_hash)
303 __propagate_umount(mnt);
304 return 0;
305}