]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * linux/fs/namespace.c | |
3 | * | |
4 | * (C) Copyright Al Viro 2000, 2001 | |
5 | * Released under GPL v2. | |
6 | * | |
7 | * Based on code from fs/super.c, copyright Linus Torvalds and others. | |
8 | * Heavily rewritten. | |
9 | */ | |
10 | ||
11 | #include <linux/config.h> | |
12 | #include <linux/syscalls.h> | |
13 | #include <linux/slab.h> | |
14 | #include <linux/sched.h> | |
15 | #include <linux/smp_lock.h> | |
16 | #include <linux/init.h> | |
17 | #include <linux/quotaops.h> | |
18 | #include <linux/acct.h> | |
19 | #include <linux/module.h> | |
20 | #include <linux/seq_file.h> | |
21 | #include <linux/namespace.h> | |
22 | #include <linux/namei.h> | |
23 | #include <linux/security.h> | |
24 | #include <linux/mount.h> | |
25 | #include <asm/uaccess.h> | |
26 | #include <asm/unistd.h> | |
07b20889 | 27 | #include "pnode.h" |
1da177e4 LT |
28 | |
29 | extern int __init init_rootfs(void); | |
30 | ||
31 | #ifdef CONFIG_SYSFS | |
32 | extern int __init sysfs_init(void); | |
33 | #else | |
34 | static inline int sysfs_init(void) | |
35 | { | |
36 | return 0; | |
37 | } | |
38 | #endif | |
39 | ||
40 | /* spinlock for vfsmount related operations, inplace of dcache_lock */ | |
5addc5dd AV |
41 | __cacheline_aligned_in_smp DEFINE_SPINLOCK(vfsmount_lock); |
42 | ||
43 | static int event; | |
1da177e4 LT |
44 | |
45 | static struct list_head *mount_hashtable; | |
6c231b7b | 46 | static int hash_mask __read_mostly, hash_bits __read_mostly; |
b58fed8b | 47 | static kmem_cache_t *mnt_cache; |
390c6843 | 48 | static struct rw_semaphore namespace_sem; |
1da177e4 LT |
49 | |
50 | static inline unsigned long hash(struct vfsmount *mnt, struct dentry *dentry) | |
51 | { | |
b58fed8b RP |
52 | unsigned long tmp = ((unsigned long)mnt / L1_CACHE_BYTES); |
53 | tmp += ((unsigned long)dentry / L1_CACHE_BYTES); | |
1da177e4 LT |
54 | tmp = tmp + (tmp >> hash_bits); |
55 | return tmp & hash_mask; | |
56 | } | |
57 | ||
58 | struct vfsmount *alloc_vfsmnt(const char *name) | |
59 | { | |
b58fed8b | 60 | struct vfsmount *mnt = kmem_cache_alloc(mnt_cache, GFP_KERNEL); |
1da177e4 LT |
61 | if (mnt) { |
62 | memset(mnt, 0, sizeof(struct vfsmount)); | |
b58fed8b | 63 | atomic_set(&mnt->mnt_count, 1); |
1da177e4 LT |
64 | INIT_LIST_HEAD(&mnt->mnt_hash); |
65 | INIT_LIST_HEAD(&mnt->mnt_child); | |
66 | INIT_LIST_HEAD(&mnt->mnt_mounts); | |
67 | INIT_LIST_HEAD(&mnt->mnt_list); | |
55e700b9 | 68 | INIT_LIST_HEAD(&mnt->mnt_expire); |
03e06e68 | 69 | INIT_LIST_HEAD(&mnt->mnt_share); |
a58b0eb8 RP |
70 | INIT_LIST_HEAD(&mnt->mnt_slave_list); |
71 | INIT_LIST_HEAD(&mnt->mnt_slave); | |
1da177e4 | 72 | if (name) { |
b58fed8b | 73 | int size = strlen(name) + 1; |
1da177e4 LT |
74 | char *newname = kmalloc(size, GFP_KERNEL); |
75 | if (newname) { | |
76 | memcpy(newname, name, size); | |
77 | mnt->mnt_devname = newname; | |
78 | } | |
79 | } | |
80 | } | |
81 | return mnt; | |
82 | } | |
83 | ||
84 | void free_vfsmnt(struct vfsmount *mnt) | |
85 | { | |
86 | kfree(mnt->mnt_devname); | |
87 | kmem_cache_free(mnt_cache, mnt); | |
88 | } | |
89 | ||
90 | /* | |
a05964f3 RP |
91 | * find the first or last mount at @dentry on vfsmount @mnt depending on |
92 | * @dir. If @dir is set return the first mount else return the last mount. | |
1da177e4 | 93 | */ |
a05964f3 RP |
94 | struct vfsmount *__lookup_mnt(struct vfsmount *mnt, struct dentry *dentry, |
95 | int dir) | |
1da177e4 | 96 | { |
b58fed8b RP |
97 | struct list_head *head = mount_hashtable + hash(mnt, dentry); |
98 | struct list_head *tmp = head; | |
1da177e4 LT |
99 | struct vfsmount *p, *found = NULL; |
100 | ||
1da177e4 | 101 | for (;;) { |
a05964f3 | 102 | tmp = dir ? tmp->next : tmp->prev; |
1da177e4 LT |
103 | p = NULL; |
104 | if (tmp == head) | |
105 | break; | |
106 | p = list_entry(tmp, struct vfsmount, mnt_hash); | |
107 | if (p->mnt_parent == mnt && p->mnt_mountpoint == dentry) { | |
a05964f3 | 108 | found = p; |
1da177e4 LT |
109 | break; |
110 | } | |
111 | } | |
1da177e4 LT |
112 | return found; |
113 | } | |
114 | ||
a05964f3 RP |
115 | /* |
116 | * lookup_mnt increments the ref count before returning | |
117 | * the vfsmount struct. | |
118 | */ | |
119 | struct vfsmount *lookup_mnt(struct vfsmount *mnt, struct dentry *dentry) | |
120 | { | |
121 | struct vfsmount *child_mnt; | |
122 | spin_lock(&vfsmount_lock); | |
123 | if ((child_mnt = __lookup_mnt(mnt, dentry, 1))) | |
124 | mntget(child_mnt); | |
125 | spin_unlock(&vfsmount_lock); | |
126 | return child_mnt; | |
127 | } | |
128 | ||
1da177e4 LT |
129 | static inline int check_mnt(struct vfsmount *mnt) |
130 | { | |
131 | return mnt->mnt_namespace == current->namespace; | |
132 | } | |
133 | ||
5addc5dd AV |
134 | static void touch_namespace(struct namespace *ns) |
135 | { | |
136 | if (ns) { | |
137 | ns->event = ++event; | |
138 | wake_up_interruptible(&ns->poll); | |
139 | } | |
140 | } | |
141 | ||
142 | static void __touch_namespace(struct namespace *ns) | |
143 | { | |
144 | if (ns && ns->event != event) { | |
145 | ns->event = event; | |
146 | wake_up_interruptible(&ns->poll); | |
147 | } | |
148 | } | |
149 | ||
1da177e4 LT |
150 | static void detach_mnt(struct vfsmount *mnt, struct nameidata *old_nd) |
151 | { | |
152 | old_nd->dentry = mnt->mnt_mountpoint; | |
153 | old_nd->mnt = mnt->mnt_parent; | |
154 | mnt->mnt_parent = mnt; | |
155 | mnt->mnt_mountpoint = mnt->mnt_root; | |
156 | list_del_init(&mnt->mnt_child); | |
157 | list_del_init(&mnt->mnt_hash); | |
158 | old_nd->dentry->d_mounted--; | |
159 | } | |
160 | ||
b90fa9ae RP |
161 | void mnt_set_mountpoint(struct vfsmount *mnt, struct dentry *dentry, |
162 | struct vfsmount *child_mnt) | |
163 | { | |
164 | child_mnt->mnt_parent = mntget(mnt); | |
165 | child_mnt->mnt_mountpoint = dget(dentry); | |
166 | dentry->d_mounted++; | |
167 | } | |
168 | ||
1da177e4 LT |
169 | static void attach_mnt(struct vfsmount *mnt, struct nameidata *nd) |
170 | { | |
b90fa9ae RP |
171 | mnt_set_mountpoint(nd->mnt, nd->dentry, mnt); |
172 | list_add_tail(&mnt->mnt_hash, mount_hashtable + | |
173 | hash(nd->mnt, nd->dentry)); | |
1da177e4 | 174 | list_add_tail(&mnt->mnt_child, &nd->mnt->mnt_mounts); |
b90fa9ae RP |
175 | } |
176 | ||
177 | /* | |
178 | * the caller must hold vfsmount_lock | |
179 | */ | |
180 | static void commit_tree(struct vfsmount *mnt) | |
181 | { | |
182 | struct vfsmount *parent = mnt->mnt_parent; | |
183 | struct vfsmount *m; | |
184 | LIST_HEAD(head); | |
185 | struct namespace *n = parent->mnt_namespace; | |
186 | ||
187 | BUG_ON(parent == mnt); | |
188 | ||
189 | list_add_tail(&head, &mnt->mnt_list); | |
190 | list_for_each_entry(m, &head, mnt_list) | |
191 | m->mnt_namespace = n; | |
192 | list_splice(&head, n->list.prev); | |
193 | ||
194 | list_add_tail(&mnt->mnt_hash, mount_hashtable + | |
195 | hash(parent, mnt->mnt_mountpoint)); | |
196 | list_add_tail(&mnt->mnt_child, &parent->mnt_mounts); | |
197 | touch_namespace(n); | |
1da177e4 LT |
198 | } |
199 | ||
200 | static struct vfsmount *next_mnt(struct vfsmount *p, struct vfsmount *root) | |
201 | { | |
202 | struct list_head *next = p->mnt_mounts.next; | |
203 | if (next == &p->mnt_mounts) { | |
204 | while (1) { | |
205 | if (p == root) | |
206 | return NULL; | |
207 | next = p->mnt_child.next; | |
208 | if (next != &p->mnt_parent->mnt_mounts) | |
209 | break; | |
210 | p = p->mnt_parent; | |
211 | } | |
212 | } | |
213 | return list_entry(next, struct vfsmount, mnt_child); | |
214 | } | |
215 | ||
9676f0c6 RP |
216 | static struct vfsmount *skip_mnt_tree(struct vfsmount *p) |
217 | { | |
218 | struct list_head *prev = p->mnt_mounts.prev; | |
219 | while (prev != &p->mnt_mounts) { | |
220 | p = list_entry(prev, struct vfsmount, mnt_child); | |
221 | prev = p->mnt_mounts.prev; | |
222 | } | |
223 | return p; | |
224 | } | |
225 | ||
36341f64 RP |
226 | static struct vfsmount *clone_mnt(struct vfsmount *old, struct dentry *root, |
227 | int flag) | |
1da177e4 LT |
228 | { |
229 | struct super_block *sb = old->mnt_sb; | |
230 | struct vfsmount *mnt = alloc_vfsmnt(old->mnt_devname); | |
231 | ||
232 | if (mnt) { | |
233 | mnt->mnt_flags = old->mnt_flags; | |
234 | atomic_inc(&sb->s_active); | |
235 | mnt->mnt_sb = sb; | |
236 | mnt->mnt_root = dget(root); | |
237 | mnt->mnt_mountpoint = mnt->mnt_root; | |
238 | mnt->mnt_parent = mnt; | |
b90fa9ae | 239 | |
5afe0022 RP |
240 | if (flag & CL_SLAVE) { |
241 | list_add(&mnt->mnt_slave, &old->mnt_slave_list); | |
242 | mnt->mnt_master = old; | |
243 | CLEAR_MNT_SHARED(mnt); | |
244 | } else { | |
245 | if ((flag & CL_PROPAGATION) || IS_MNT_SHARED(old)) | |
246 | list_add(&mnt->mnt_share, &old->mnt_share); | |
247 | if (IS_MNT_SLAVE(old)) | |
248 | list_add(&mnt->mnt_slave, &old->mnt_slave); | |
249 | mnt->mnt_master = old->mnt_master; | |
250 | } | |
b90fa9ae RP |
251 | if (flag & CL_MAKE_SHARED) |
252 | set_mnt_shared(mnt); | |
1da177e4 LT |
253 | |
254 | /* stick the duplicate mount on the same expiry list | |
255 | * as the original if that was on one */ | |
36341f64 RP |
256 | if (flag & CL_EXPIRE) { |
257 | spin_lock(&vfsmount_lock); | |
258 | if (!list_empty(&old->mnt_expire)) | |
259 | list_add(&mnt->mnt_expire, &old->mnt_expire); | |
260 | spin_unlock(&vfsmount_lock); | |
261 | } | |
1da177e4 LT |
262 | } |
263 | return mnt; | |
264 | } | |
265 | ||
7b7b1ace | 266 | static inline void __mntput(struct vfsmount *mnt) |
1da177e4 LT |
267 | { |
268 | struct super_block *sb = mnt->mnt_sb; | |
269 | dput(mnt->mnt_root); | |
270 | free_vfsmnt(mnt); | |
271 | deactivate_super(sb); | |
272 | } | |
273 | ||
7b7b1ace AV |
274 | void mntput_no_expire(struct vfsmount *mnt) |
275 | { | |
276 | repeat: | |
277 | if (atomic_dec_and_lock(&mnt->mnt_count, &vfsmount_lock)) { | |
278 | if (likely(!mnt->mnt_pinned)) { | |
279 | spin_unlock(&vfsmount_lock); | |
280 | __mntput(mnt); | |
281 | return; | |
282 | } | |
283 | atomic_add(mnt->mnt_pinned + 1, &mnt->mnt_count); | |
284 | mnt->mnt_pinned = 0; | |
285 | spin_unlock(&vfsmount_lock); | |
286 | acct_auto_close_mnt(mnt); | |
287 | security_sb_umount_close(mnt); | |
288 | goto repeat; | |
289 | } | |
290 | } | |
291 | ||
292 | EXPORT_SYMBOL(mntput_no_expire); | |
293 | ||
294 | void mnt_pin(struct vfsmount *mnt) | |
295 | { | |
296 | spin_lock(&vfsmount_lock); | |
297 | mnt->mnt_pinned++; | |
298 | spin_unlock(&vfsmount_lock); | |
299 | } | |
300 | ||
301 | EXPORT_SYMBOL(mnt_pin); | |
302 | ||
303 | void mnt_unpin(struct vfsmount *mnt) | |
304 | { | |
305 | spin_lock(&vfsmount_lock); | |
306 | if (mnt->mnt_pinned) { | |
307 | atomic_inc(&mnt->mnt_count); | |
308 | mnt->mnt_pinned--; | |
309 | } | |
310 | spin_unlock(&vfsmount_lock); | |
311 | } | |
312 | ||
313 | EXPORT_SYMBOL(mnt_unpin); | |
1da177e4 LT |
314 | |
315 | /* iterator */ | |
316 | static void *m_start(struct seq_file *m, loff_t *pos) | |
317 | { | |
318 | struct namespace *n = m->private; | |
319 | struct list_head *p; | |
320 | loff_t l = *pos; | |
321 | ||
390c6843 | 322 | down_read(&namespace_sem); |
1da177e4 LT |
323 | list_for_each(p, &n->list) |
324 | if (!l--) | |
325 | return list_entry(p, struct vfsmount, mnt_list); | |
326 | return NULL; | |
327 | } | |
328 | ||
329 | static void *m_next(struct seq_file *m, void *v, loff_t *pos) | |
330 | { | |
331 | struct namespace *n = m->private; | |
332 | struct list_head *p = ((struct vfsmount *)v)->mnt_list.next; | |
333 | (*pos)++; | |
b58fed8b | 334 | return p == &n->list ? NULL : list_entry(p, struct vfsmount, mnt_list); |
1da177e4 LT |
335 | } |
336 | ||
337 | static void m_stop(struct seq_file *m, void *v) | |
338 | { | |
390c6843 | 339 | up_read(&namespace_sem); |
1da177e4 LT |
340 | } |
341 | ||
342 | static inline void mangle(struct seq_file *m, const char *s) | |
343 | { | |
344 | seq_escape(m, s, " \t\n\\"); | |
345 | } | |
346 | ||
347 | static int show_vfsmnt(struct seq_file *m, void *v) | |
348 | { | |
349 | struct vfsmount *mnt = v; | |
350 | int err = 0; | |
351 | static struct proc_fs_info { | |
352 | int flag; | |
353 | char *str; | |
354 | } fs_info[] = { | |
355 | { MS_SYNCHRONOUS, ",sync" }, | |
356 | { MS_DIRSYNC, ",dirsync" }, | |
357 | { MS_MANDLOCK, ",mand" }, | |
1da177e4 LT |
358 | { 0, NULL } |
359 | }; | |
360 | static struct proc_fs_info mnt_info[] = { | |
361 | { MNT_NOSUID, ",nosuid" }, | |
362 | { MNT_NODEV, ",nodev" }, | |
363 | { MNT_NOEXEC, ",noexec" }, | |
fc33a7bb CH |
364 | { MNT_NOATIME, ",noatime" }, |
365 | { MNT_NODIRATIME, ",nodiratime" }, | |
1da177e4 LT |
366 | { 0, NULL } |
367 | }; | |
368 | struct proc_fs_info *fs_infop; | |
369 | ||
370 | mangle(m, mnt->mnt_devname ? mnt->mnt_devname : "none"); | |
371 | seq_putc(m, ' '); | |
372 | seq_path(m, mnt, mnt->mnt_root, " \t\n\\"); | |
373 | seq_putc(m, ' '); | |
374 | mangle(m, mnt->mnt_sb->s_type->name); | |
375 | seq_puts(m, mnt->mnt_sb->s_flags & MS_RDONLY ? " ro" : " rw"); | |
376 | for (fs_infop = fs_info; fs_infop->flag; fs_infop++) { | |
377 | if (mnt->mnt_sb->s_flags & fs_infop->flag) | |
378 | seq_puts(m, fs_infop->str); | |
379 | } | |
380 | for (fs_infop = mnt_info; fs_infop->flag; fs_infop++) { | |
381 | if (mnt->mnt_flags & fs_infop->flag) | |
382 | seq_puts(m, fs_infop->str); | |
383 | } | |
384 | if (mnt->mnt_sb->s_op->show_options) | |
385 | err = mnt->mnt_sb->s_op->show_options(m, mnt); | |
386 | seq_puts(m, " 0 0\n"); | |
387 | return err; | |
388 | } | |
389 | ||
390 | struct seq_operations mounts_op = { | |
391 | .start = m_start, | |
392 | .next = m_next, | |
393 | .stop = m_stop, | |
394 | .show = show_vfsmnt | |
395 | }; | |
396 | ||
397 | /** | |
398 | * may_umount_tree - check if a mount tree is busy | |
399 | * @mnt: root of mount tree | |
400 | * | |
401 | * This is called to check if a tree of mounts has any | |
402 | * open files, pwds, chroots or sub mounts that are | |
403 | * busy. | |
404 | */ | |
405 | int may_umount_tree(struct vfsmount *mnt) | |
406 | { | |
36341f64 RP |
407 | int actual_refs = 0; |
408 | int minimum_refs = 0; | |
409 | struct vfsmount *p; | |
1da177e4 LT |
410 | |
411 | spin_lock(&vfsmount_lock); | |
36341f64 | 412 | for (p = mnt; p; p = next_mnt(p, mnt)) { |
1da177e4 LT |
413 | actual_refs += atomic_read(&p->mnt_count); |
414 | minimum_refs += 2; | |
1da177e4 LT |
415 | } |
416 | spin_unlock(&vfsmount_lock); | |
417 | ||
418 | if (actual_refs > minimum_refs) | |
419 | return -EBUSY; | |
420 | ||
421 | return 0; | |
422 | } | |
423 | ||
424 | EXPORT_SYMBOL(may_umount_tree); | |
425 | ||
426 | /** | |
427 | * may_umount - check if a mount point is busy | |
428 | * @mnt: root of mount | |
429 | * | |
430 | * This is called to check if a mount point has any | |
431 | * open files, pwds, chroots or sub mounts. If the | |
432 | * mount has sub mounts this will return busy | |
433 | * regardless of whether the sub mounts are busy. | |
434 | * | |
435 | * Doesn't take quota and stuff into account. IOW, in some cases it will | |
436 | * give false negatives. The main reason why it's here is that we need | |
437 | * a non-destructive way to look for easily umountable filesystems. | |
438 | */ | |
439 | int may_umount(struct vfsmount *mnt) | |
440 | { | |
a05964f3 RP |
441 | int ret = 0; |
442 | spin_lock(&vfsmount_lock); | |
443 | if (propagate_mount_busy(mnt, 2)) | |
444 | ret = -EBUSY; | |
445 | spin_unlock(&vfsmount_lock); | |
446 | return ret; | |
1da177e4 LT |
447 | } |
448 | ||
449 | EXPORT_SYMBOL(may_umount); | |
450 | ||
b90fa9ae | 451 | void release_mounts(struct list_head *head) |
70fbcdf4 RP |
452 | { |
453 | struct vfsmount *mnt; | |
bf066c7d | 454 | while (!list_empty(head)) { |
70fbcdf4 RP |
455 | mnt = list_entry(head->next, struct vfsmount, mnt_hash); |
456 | list_del_init(&mnt->mnt_hash); | |
457 | if (mnt->mnt_parent != mnt) { | |
458 | struct dentry *dentry; | |
459 | struct vfsmount *m; | |
460 | spin_lock(&vfsmount_lock); | |
461 | dentry = mnt->mnt_mountpoint; | |
462 | m = mnt->mnt_parent; | |
463 | mnt->mnt_mountpoint = mnt->mnt_root; | |
464 | mnt->mnt_parent = mnt; | |
465 | spin_unlock(&vfsmount_lock); | |
466 | dput(dentry); | |
467 | mntput(m); | |
468 | } | |
469 | mntput(mnt); | |
470 | } | |
471 | } | |
472 | ||
a05964f3 | 473 | void umount_tree(struct vfsmount *mnt, int propagate, struct list_head *kill) |
1da177e4 LT |
474 | { |
475 | struct vfsmount *p; | |
1da177e4 LT |
476 | |
477 | for (p = mnt; p; p = next_mnt(p, mnt)) { | |
70fbcdf4 RP |
478 | list_del(&p->mnt_hash); |
479 | list_add(&p->mnt_hash, kill); | |
1da177e4 LT |
480 | } |
481 | ||
a05964f3 RP |
482 | if (propagate) |
483 | propagate_umount(kill); | |
484 | ||
70fbcdf4 RP |
485 | list_for_each_entry(p, kill, mnt_hash) { |
486 | list_del_init(&p->mnt_expire); | |
487 | list_del_init(&p->mnt_list); | |
488 | __touch_namespace(p->mnt_namespace); | |
489 | p->mnt_namespace = NULL; | |
490 | list_del_init(&p->mnt_child); | |
491 | if (p->mnt_parent != p) | |
492 | mnt->mnt_mountpoint->d_mounted--; | |
a05964f3 | 493 | change_mnt_propagation(p, MS_PRIVATE); |
1da177e4 LT |
494 | } |
495 | } | |
496 | ||
497 | static int do_umount(struct vfsmount *mnt, int flags) | |
498 | { | |
b58fed8b | 499 | struct super_block *sb = mnt->mnt_sb; |
1da177e4 | 500 | int retval; |
70fbcdf4 | 501 | LIST_HEAD(umount_list); |
1da177e4 LT |
502 | |
503 | retval = security_sb_umount(mnt, flags); | |
504 | if (retval) | |
505 | return retval; | |
506 | ||
507 | /* | |
508 | * Allow userspace to request a mountpoint be expired rather than | |
509 | * unmounting unconditionally. Unmount only happens if: | |
510 | * (1) the mark is already set (the mark is cleared by mntput()) | |
511 | * (2) the usage count == 1 [parent vfsmount] + 1 [sys_umount] | |
512 | */ | |
513 | if (flags & MNT_EXPIRE) { | |
514 | if (mnt == current->fs->rootmnt || | |
515 | flags & (MNT_FORCE | MNT_DETACH)) | |
516 | return -EINVAL; | |
517 | ||
518 | if (atomic_read(&mnt->mnt_count) != 2) | |
519 | return -EBUSY; | |
520 | ||
521 | if (!xchg(&mnt->mnt_expiry_mark, 1)) | |
522 | return -EAGAIN; | |
523 | } | |
524 | ||
525 | /* | |
526 | * If we may have to abort operations to get out of this | |
527 | * mount, and they will themselves hold resources we must | |
528 | * allow the fs to do things. In the Unix tradition of | |
529 | * 'Gee thats tricky lets do it in userspace' the umount_begin | |
530 | * might fail to complete on the first run through as other tasks | |
531 | * must return, and the like. Thats for the mount program to worry | |
532 | * about for the moment. | |
533 | */ | |
534 | ||
535 | lock_kernel(); | |
b58fed8b | 536 | if ((flags & MNT_FORCE) && sb->s_op->umount_begin) |
1da177e4 LT |
537 | sb->s_op->umount_begin(sb); |
538 | unlock_kernel(); | |
539 | ||
540 | /* | |
541 | * No sense to grab the lock for this test, but test itself looks | |
542 | * somewhat bogus. Suggestions for better replacement? | |
543 | * Ho-hum... In principle, we might treat that as umount + switch | |
544 | * to rootfs. GC would eventually take care of the old vfsmount. | |
545 | * Actually it makes sense, especially if rootfs would contain a | |
546 | * /reboot - static binary that would close all descriptors and | |
547 | * call reboot(9). Then init(8) could umount root and exec /reboot. | |
548 | */ | |
549 | if (mnt == current->fs->rootmnt && !(flags & MNT_DETACH)) { | |
550 | /* | |
551 | * Special case for "unmounting" root ... | |
552 | * we just try to remount it readonly. | |
553 | */ | |
554 | down_write(&sb->s_umount); | |
555 | if (!(sb->s_flags & MS_RDONLY)) { | |
556 | lock_kernel(); | |
557 | DQUOT_OFF(sb); | |
558 | retval = do_remount_sb(sb, MS_RDONLY, NULL, 0); | |
559 | unlock_kernel(); | |
560 | } | |
561 | up_write(&sb->s_umount); | |
562 | return retval; | |
563 | } | |
564 | ||
390c6843 | 565 | down_write(&namespace_sem); |
1da177e4 | 566 | spin_lock(&vfsmount_lock); |
5addc5dd | 567 | event++; |
1da177e4 | 568 | |
1da177e4 | 569 | retval = -EBUSY; |
a05964f3 | 570 | if (flags & MNT_DETACH || !propagate_mount_busy(mnt, 2)) { |
1da177e4 | 571 | if (!list_empty(&mnt->mnt_list)) |
a05964f3 | 572 | umount_tree(mnt, 1, &umount_list); |
1da177e4 LT |
573 | retval = 0; |
574 | } | |
575 | spin_unlock(&vfsmount_lock); | |
576 | if (retval) | |
577 | security_sb_umount_busy(mnt); | |
390c6843 | 578 | up_write(&namespace_sem); |
70fbcdf4 | 579 | release_mounts(&umount_list); |
1da177e4 LT |
580 | return retval; |
581 | } | |
582 | ||
583 | /* | |
584 | * Now umount can handle mount points as well as block devices. | |
585 | * This is important for filesystems which use unnamed block devices. | |
586 | * | |
587 | * We now support a flag for forced unmount like the other 'big iron' | |
588 | * unixes. Our API is identical to OSF/1 to avoid making a mess of AMD | |
589 | */ | |
590 | ||
591 | asmlinkage long sys_umount(char __user * name, int flags) | |
592 | { | |
593 | struct nameidata nd; | |
594 | int retval; | |
595 | ||
596 | retval = __user_walk(name, LOOKUP_FOLLOW, &nd); | |
597 | if (retval) | |
598 | goto out; | |
599 | retval = -EINVAL; | |
600 | if (nd.dentry != nd.mnt->mnt_root) | |
601 | goto dput_and_out; | |
602 | if (!check_mnt(nd.mnt)) | |
603 | goto dput_and_out; | |
604 | ||
605 | retval = -EPERM; | |
606 | if (!capable(CAP_SYS_ADMIN)) | |
607 | goto dput_and_out; | |
608 | ||
609 | retval = do_umount(nd.mnt, flags); | |
610 | dput_and_out: | |
611 | path_release_on_umount(&nd); | |
612 | out: | |
613 | return retval; | |
614 | } | |
615 | ||
616 | #ifdef __ARCH_WANT_SYS_OLDUMOUNT | |
617 | ||
618 | /* | |
b58fed8b | 619 | * The 2.0 compatible umount. No flags. |
1da177e4 | 620 | */ |
1da177e4 LT |
621 | asmlinkage long sys_oldumount(char __user * name) |
622 | { | |
b58fed8b | 623 | return sys_umount(name, 0); |
1da177e4 LT |
624 | } |
625 | ||
626 | #endif | |
627 | ||
628 | static int mount_is_safe(struct nameidata *nd) | |
629 | { | |
630 | if (capable(CAP_SYS_ADMIN)) | |
631 | return 0; | |
632 | return -EPERM; | |
633 | #ifdef notyet | |
634 | if (S_ISLNK(nd->dentry->d_inode->i_mode)) | |
635 | return -EPERM; | |
636 | if (nd->dentry->d_inode->i_mode & S_ISVTX) { | |
637 | if (current->uid != nd->dentry->d_inode->i_uid) | |
638 | return -EPERM; | |
639 | } | |
e4543edd | 640 | if (vfs_permission(nd, MAY_WRITE)) |
1da177e4 LT |
641 | return -EPERM; |
642 | return 0; | |
643 | #endif | |
644 | } | |
645 | ||
b58fed8b | 646 | static int lives_below_in_same_fs(struct dentry *d, struct dentry *dentry) |
1da177e4 LT |
647 | { |
648 | while (1) { | |
649 | if (d == dentry) | |
650 | return 1; | |
651 | if (d == NULL || d == d->d_parent) | |
652 | return 0; | |
653 | d = d->d_parent; | |
654 | } | |
655 | } | |
656 | ||
b90fa9ae | 657 | struct vfsmount *copy_tree(struct vfsmount *mnt, struct dentry *dentry, |
36341f64 | 658 | int flag) |
1da177e4 LT |
659 | { |
660 | struct vfsmount *res, *p, *q, *r, *s; | |
1da177e4 LT |
661 | struct nameidata nd; |
662 | ||
9676f0c6 RP |
663 | if (!(flag & CL_COPY_ALL) && IS_MNT_UNBINDABLE(mnt)) |
664 | return NULL; | |
665 | ||
36341f64 | 666 | res = q = clone_mnt(mnt, dentry, flag); |
1da177e4 LT |
667 | if (!q) |
668 | goto Enomem; | |
669 | q->mnt_mountpoint = mnt->mnt_mountpoint; | |
670 | ||
671 | p = mnt; | |
fdadd65f | 672 | list_for_each_entry(r, &mnt->mnt_mounts, mnt_child) { |
1da177e4 LT |
673 | if (!lives_below_in_same_fs(r->mnt_mountpoint, dentry)) |
674 | continue; | |
675 | ||
676 | for (s = r; s; s = next_mnt(s, r)) { | |
9676f0c6 RP |
677 | if (!(flag & CL_COPY_ALL) && IS_MNT_UNBINDABLE(s)) { |
678 | s = skip_mnt_tree(s); | |
679 | continue; | |
680 | } | |
1da177e4 LT |
681 | while (p != s->mnt_parent) { |
682 | p = p->mnt_parent; | |
683 | q = q->mnt_parent; | |
684 | } | |
685 | p = s; | |
686 | nd.mnt = q; | |
687 | nd.dentry = p->mnt_mountpoint; | |
36341f64 | 688 | q = clone_mnt(p, p->mnt_root, flag); |
1da177e4 LT |
689 | if (!q) |
690 | goto Enomem; | |
691 | spin_lock(&vfsmount_lock); | |
692 | list_add_tail(&q->mnt_list, &res->mnt_list); | |
693 | attach_mnt(q, &nd); | |
694 | spin_unlock(&vfsmount_lock); | |
695 | } | |
696 | } | |
697 | return res; | |
b58fed8b | 698 | Enomem: |
1da177e4 | 699 | if (res) { |
70fbcdf4 | 700 | LIST_HEAD(umount_list); |
1da177e4 | 701 | spin_lock(&vfsmount_lock); |
a05964f3 | 702 | umount_tree(res, 0, &umount_list); |
1da177e4 | 703 | spin_unlock(&vfsmount_lock); |
70fbcdf4 | 704 | release_mounts(&umount_list); |
1da177e4 LT |
705 | } |
706 | return NULL; | |
707 | } | |
708 | ||
b90fa9ae RP |
709 | /* |
710 | * @source_mnt : mount tree to be attached | |
21444403 RP |
711 | * @nd : place the mount tree @source_mnt is attached |
712 | * @parent_nd : if non-null, detach the source_mnt from its parent and | |
713 | * store the parent mount and mountpoint dentry. | |
714 | * (done when source_mnt is moved) | |
b90fa9ae RP |
715 | * |
716 | * NOTE: in the table below explains the semantics when a source mount | |
717 | * of a given type is attached to a destination mount of a given type. | |
9676f0c6 RP |
718 | * --------------------------------------------------------------------------- |
719 | * | BIND MOUNT OPERATION | | |
720 | * |************************************************************************** | |
721 | * | source-->| shared | private | slave | unbindable | | |
722 | * | dest | | | | | | |
723 | * | | | | | | | | |
724 | * | v | | | | | | |
725 | * |************************************************************************** | |
726 | * | shared | shared (++) | shared (+) | shared(+++)| invalid | | |
727 | * | | | | | | | |
728 | * |non-shared| shared (+) | private | slave (*) | invalid | | |
729 | * *************************************************************************** | |
b90fa9ae RP |
730 | * A bind operation clones the source mount and mounts the clone on the |
731 | * destination mount. | |
732 | * | |
733 | * (++) the cloned mount is propagated to all the mounts in the propagation | |
734 | * tree of the destination mount and the cloned mount is added to | |
735 | * the peer group of the source mount. | |
736 | * (+) the cloned mount is created under the destination mount and is marked | |
737 | * as shared. The cloned mount is added to the peer group of the source | |
738 | * mount. | |
5afe0022 RP |
739 | * (+++) the mount is propagated to all the mounts in the propagation tree |
740 | * of the destination mount and the cloned mount is made slave | |
741 | * of the same master as that of the source mount. The cloned mount | |
742 | * is marked as 'shared and slave'. | |
743 | * (*) the cloned mount is made a slave of the same master as that of the | |
744 | * source mount. | |
745 | * | |
9676f0c6 RP |
746 | * --------------------------------------------------------------------------- |
747 | * | MOVE MOUNT OPERATION | | |
748 | * |************************************************************************** | |
749 | * | source-->| shared | private | slave | unbindable | | |
750 | * | dest | | | | | | |
751 | * | | | | | | | | |
752 | * | v | | | | | | |
753 | * |************************************************************************** | |
754 | * | shared | shared (+) | shared (+) | shared(+++) | invalid | | |
755 | * | | | | | | | |
756 | * |non-shared| shared (+*) | private | slave (*) | unbindable | | |
757 | * *************************************************************************** | |
5afe0022 RP |
758 | * |
759 | * (+) the mount is moved to the destination. And is then propagated to | |
760 | * all the mounts in the propagation tree of the destination mount. | |
21444403 | 761 | * (+*) the mount is moved to the destination. |
5afe0022 RP |
762 | * (+++) the mount is moved to the destination and is then propagated to |
763 | * all the mounts belonging to the destination mount's propagation tree. | |
764 | * the mount is marked as 'shared and slave'. | |
765 | * (*) the mount continues to be a slave at the new location. | |
b90fa9ae RP |
766 | * |
767 | * if the source mount is a tree, the operations explained above is | |
768 | * applied to each mount in the tree. | |
769 | * Must be called without spinlocks held, since this function can sleep | |
770 | * in allocations. | |
771 | */ | |
772 | static int attach_recursive_mnt(struct vfsmount *source_mnt, | |
21444403 | 773 | struct nameidata *nd, struct nameidata *parent_nd) |
b90fa9ae RP |
774 | { |
775 | LIST_HEAD(tree_list); | |
776 | struct vfsmount *dest_mnt = nd->mnt; | |
777 | struct dentry *dest_dentry = nd->dentry; | |
778 | struct vfsmount *child, *p; | |
779 | ||
780 | if (propagate_mnt(dest_mnt, dest_dentry, source_mnt, &tree_list)) | |
781 | return -EINVAL; | |
782 | ||
783 | if (IS_MNT_SHARED(dest_mnt)) { | |
784 | for (p = source_mnt; p; p = next_mnt(p, source_mnt)) | |
785 | set_mnt_shared(p); | |
786 | } | |
787 | ||
788 | spin_lock(&vfsmount_lock); | |
21444403 RP |
789 | if (parent_nd) { |
790 | detach_mnt(source_mnt, parent_nd); | |
791 | attach_mnt(source_mnt, nd); | |
792 | touch_namespace(current->namespace); | |
793 | } else { | |
794 | mnt_set_mountpoint(dest_mnt, dest_dentry, source_mnt); | |
795 | commit_tree(source_mnt); | |
796 | } | |
b90fa9ae RP |
797 | |
798 | list_for_each_entry_safe(child, p, &tree_list, mnt_hash) { | |
799 | list_del_init(&child->mnt_hash); | |
800 | commit_tree(child); | |
801 | } | |
802 | spin_unlock(&vfsmount_lock); | |
803 | return 0; | |
804 | } | |
805 | ||
1da177e4 LT |
806 | static int graft_tree(struct vfsmount *mnt, struct nameidata *nd) |
807 | { | |
808 | int err; | |
809 | if (mnt->mnt_sb->s_flags & MS_NOUSER) | |
810 | return -EINVAL; | |
811 | ||
812 | if (S_ISDIR(nd->dentry->d_inode->i_mode) != | |
813 | S_ISDIR(mnt->mnt_root->d_inode->i_mode)) | |
814 | return -ENOTDIR; | |
815 | ||
816 | err = -ENOENT; | |
1b1dcc1b | 817 | mutex_lock(&nd->dentry->d_inode->i_mutex); |
1da177e4 LT |
818 | if (IS_DEADDIR(nd->dentry->d_inode)) |
819 | goto out_unlock; | |
820 | ||
821 | err = security_sb_check_sb(mnt, nd); | |
822 | if (err) | |
823 | goto out_unlock; | |
824 | ||
825 | err = -ENOENT; | |
b90fa9ae | 826 | if (IS_ROOT(nd->dentry) || !d_unhashed(nd->dentry)) |
21444403 | 827 | err = attach_recursive_mnt(mnt, nd, NULL); |
1da177e4 | 828 | out_unlock: |
1b1dcc1b | 829 | mutex_unlock(&nd->dentry->d_inode->i_mutex); |
1da177e4 LT |
830 | if (!err) |
831 | security_sb_post_addmount(mnt, nd); | |
832 | return err; | |
833 | } | |
834 | ||
07b20889 RP |
835 | /* |
836 | * recursively change the type of the mountpoint. | |
837 | */ | |
838 | static int do_change_type(struct nameidata *nd, int flag) | |
839 | { | |
840 | struct vfsmount *m, *mnt = nd->mnt; | |
841 | int recurse = flag & MS_REC; | |
842 | int type = flag & ~MS_REC; | |
843 | ||
844 | if (nd->dentry != nd->mnt->mnt_root) | |
845 | return -EINVAL; | |
846 | ||
847 | down_write(&namespace_sem); | |
848 | spin_lock(&vfsmount_lock); | |
849 | for (m = mnt; m; m = (recurse ? next_mnt(m, mnt) : NULL)) | |
850 | change_mnt_propagation(m, type); | |
851 | spin_unlock(&vfsmount_lock); | |
852 | up_write(&namespace_sem); | |
853 | return 0; | |
854 | } | |
855 | ||
1da177e4 LT |
856 | /* |
857 | * do loopback mount. | |
858 | */ | |
859 | static int do_loopback(struct nameidata *nd, char *old_name, int recurse) | |
860 | { | |
861 | struct nameidata old_nd; | |
862 | struct vfsmount *mnt = NULL; | |
863 | int err = mount_is_safe(nd); | |
864 | if (err) | |
865 | return err; | |
866 | if (!old_name || !*old_name) | |
867 | return -EINVAL; | |
868 | err = path_lookup(old_name, LOOKUP_FOLLOW, &old_nd); | |
869 | if (err) | |
870 | return err; | |
871 | ||
390c6843 | 872 | down_write(&namespace_sem); |
1da177e4 | 873 | err = -EINVAL; |
9676f0c6 RP |
874 | if (IS_MNT_UNBINDABLE(old_nd.mnt)) |
875 | goto out; | |
876 | ||
ccd48bc7 AV |
877 | if (!check_mnt(nd->mnt) || !check_mnt(old_nd.mnt)) |
878 | goto out; | |
1da177e4 | 879 | |
ccd48bc7 AV |
880 | err = -ENOMEM; |
881 | if (recurse) | |
36341f64 | 882 | mnt = copy_tree(old_nd.mnt, old_nd.dentry, 0); |
ccd48bc7 | 883 | else |
36341f64 | 884 | mnt = clone_mnt(old_nd.mnt, old_nd.dentry, 0); |
ccd48bc7 AV |
885 | |
886 | if (!mnt) | |
887 | goto out; | |
888 | ||
ccd48bc7 AV |
889 | err = graft_tree(mnt, nd); |
890 | if (err) { | |
70fbcdf4 | 891 | LIST_HEAD(umount_list); |
1da177e4 | 892 | spin_lock(&vfsmount_lock); |
a05964f3 | 893 | umount_tree(mnt, 0, &umount_list); |
1da177e4 | 894 | spin_unlock(&vfsmount_lock); |
70fbcdf4 | 895 | release_mounts(&umount_list); |
5b83d2c5 | 896 | } |
1da177e4 | 897 | |
ccd48bc7 | 898 | out: |
390c6843 | 899 | up_write(&namespace_sem); |
1da177e4 LT |
900 | path_release(&old_nd); |
901 | return err; | |
902 | } | |
903 | ||
904 | /* | |
905 | * change filesystem flags. dir should be a physical root of filesystem. | |
906 | * If you've mounted a non-root directory somewhere and want to do remount | |
907 | * on it - tough luck. | |
908 | */ | |
1da177e4 LT |
909 | static int do_remount(struct nameidata *nd, int flags, int mnt_flags, |
910 | void *data) | |
911 | { | |
912 | int err; | |
b58fed8b | 913 | struct super_block *sb = nd->mnt->mnt_sb; |
1da177e4 LT |
914 | |
915 | if (!capable(CAP_SYS_ADMIN)) | |
916 | return -EPERM; | |
917 | ||
918 | if (!check_mnt(nd->mnt)) | |
919 | return -EINVAL; | |
920 | ||
921 | if (nd->dentry != nd->mnt->mnt_root) | |
922 | return -EINVAL; | |
923 | ||
924 | down_write(&sb->s_umount); | |
925 | err = do_remount_sb(sb, flags, data, 0); | |
926 | if (!err) | |
b58fed8b | 927 | nd->mnt->mnt_flags = mnt_flags; |
1da177e4 LT |
928 | up_write(&sb->s_umount); |
929 | if (!err) | |
930 | security_sb_post_remount(nd->mnt, flags, data); | |
931 | return err; | |
932 | } | |
933 | ||
9676f0c6 RP |
934 | static inline int tree_contains_unbindable(struct vfsmount *mnt) |
935 | { | |
936 | struct vfsmount *p; | |
937 | for (p = mnt; p; p = next_mnt(p, mnt)) { | |
938 | if (IS_MNT_UNBINDABLE(p)) | |
939 | return 1; | |
940 | } | |
941 | return 0; | |
942 | } | |
943 | ||
1da177e4 LT |
944 | static int do_move_mount(struct nameidata *nd, char *old_name) |
945 | { | |
946 | struct nameidata old_nd, parent_nd; | |
947 | struct vfsmount *p; | |
948 | int err = 0; | |
949 | if (!capable(CAP_SYS_ADMIN)) | |
950 | return -EPERM; | |
951 | if (!old_name || !*old_name) | |
952 | return -EINVAL; | |
953 | err = path_lookup(old_name, LOOKUP_FOLLOW, &old_nd); | |
954 | if (err) | |
955 | return err; | |
956 | ||
390c6843 | 957 | down_write(&namespace_sem); |
b58fed8b | 958 | while (d_mountpoint(nd->dentry) && follow_down(&nd->mnt, &nd->dentry)) |
1da177e4 LT |
959 | ; |
960 | err = -EINVAL; | |
961 | if (!check_mnt(nd->mnt) || !check_mnt(old_nd.mnt)) | |
962 | goto out; | |
963 | ||
964 | err = -ENOENT; | |
1b1dcc1b | 965 | mutex_lock(&nd->dentry->d_inode->i_mutex); |
1da177e4 LT |
966 | if (IS_DEADDIR(nd->dentry->d_inode)) |
967 | goto out1; | |
968 | ||
1da177e4 | 969 | if (!IS_ROOT(nd->dentry) && d_unhashed(nd->dentry)) |
21444403 | 970 | goto out1; |
1da177e4 LT |
971 | |
972 | err = -EINVAL; | |
973 | if (old_nd.dentry != old_nd.mnt->mnt_root) | |
21444403 | 974 | goto out1; |
1da177e4 LT |
975 | |
976 | if (old_nd.mnt == old_nd.mnt->mnt_parent) | |
21444403 | 977 | goto out1; |
1da177e4 LT |
978 | |
979 | if (S_ISDIR(nd->dentry->d_inode->i_mode) != | |
980 | S_ISDIR(old_nd.dentry->d_inode->i_mode)) | |
21444403 RP |
981 | goto out1; |
982 | /* | |
983 | * Don't move a mount residing in a shared parent. | |
984 | */ | |
985 | if (old_nd.mnt->mnt_parent && IS_MNT_SHARED(old_nd.mnt->mnt_parent)) | |
986 | goto out1; | |
9676f0c6 RP |
987 | /* |
988 | * Don't move a mount tree containing unbindable mounts to a destination | |
989 | * mount which is shared. | |
990 | */ | |
991 | if (IS_MNT_SHARED(nd->mnt) && tree_contains_unbindable(old_nd.mnt)) | |
992 | goto out1; | |
1da177e4 | 993 | err = -ELOOP; |
b58fed8b | 994 | for (p = nd->mnt; p->mnt_parent != p; p = p->mnt_parent) |
1da177e4 | 995 | if (p == old_nd.mnt) |
21444403 | 996 | goto out1; |
1da177e4 | 997 | |
21444403 RP |
998 | if ((err = attach_recursive_mnt(old_nd.mnt, nd, &parent_nd))) |
999 | goto out1; | |
1da177e4 | 1000 | |
21444403 | 1001 | spin_lock(&vfsmount_lock); |
1da177e4 LT |
1002 | /* if the mount is moved, it should no longer be expire |
1003 | * automatically */ | |
55e700b9 | 1004 | list_del_init(&old_nd.mnt->mnt_expire); |
1da177e4 LT |
1005 | spin_unlock(&vfsmount_lock); |
1006 | out1: | |
1b1dcc1b | 1007 | mutex_unlock(&nd->dentry->d_inode->i_mutex); |
1da177e4 | 1008 | out: |
390c6843 | 1009 | up_write(&namespace_sem); |
1da177e4 LT |
1010 | if (!err) |
1011 | path_release(&parent_nd); | |
1012 | path_release(&old_nd); | |
1013 | return err; | |
1014 | } | |
1015 | ||
1016 | /* | |
1017 | * create a new mount for userspace and request it to be added into the | |
1018 | * namespace's tree | |
1019 | */ | |
1020 | static int do_new_mount(struct nameidata *nd, char *type, int flags, | |
1021 | int mnt_flags, char *name, void *data) | |
1022 | { | |
1023 | struct vfsmount *mnt; | |
1024 | ||
1025 | if (!type || !memchr(type, 0, PAGE_SIZE)) | |
1026 | return -EINVAL; | |
1027 | ||
1028 | /* we need capabilities... */ | |
1029 | if (!capable(CAP_SYS_ADMIN)) | |
1030 | return -EPERM; | |
1031 | ||
1032 | mnt = do_kern_mount(type, flags, name, data); | |
1033 | if (IS_ERR(mnt)) | |
1034 | return PTR_ERR(mnt); | |
1035 | ||
1036 | return do_add_mount(mnt, nd, mnt_flags, NULL); | |
1037 | } | |
1038 | ||
1039 | /* | |
1040 | * add a mount into a namespace's mount tree | |
1041 | * - provide the option of adding the new mount to an expiration list | |
1042 | */ | |
1043 | int do_add_mount(struct vfsmount *newmnt, struct nameidata *nd, | |
1044 | int mnt_flags, struct list_head *fslist) | |
1045 | { | |
1046 | int err; | |
1047 | ||
390c6843 | 1048 | down_write(&namespace_sem); |
1da177e4 | 1049 | /* Something was mounted here while we slept */ |
b58fed8b | 1050 | while (d_mountpoint(nd->dentry) && follow_down(&nd->mnt, &nd->dentry)) |
1da177e4 LT |
1051 | ; |
1052 | err = -EINVAL; | |
1053 | if (!check_mnt(nd->mnt)) | |
1054 | goto unlock; | |
1055 | ||
1056 | /* Refuse the same filesystem on the same mount point */ | |
1057 | err = -EBUSY; | |
1058 | if (nd->mnt->mnt_sb == newmnt->mnt_sb && | |
1059 | nd->mnt->mnt_root == nd->dentry) | |
1060 | goto unlock; | |
1061 | ||
1062 | err = -EINVAL; | |
1063 | if (S_ISLNK(newmnt->mnt_root->d_inode->i_mode)) | |
1064 | goto unlock; | |
1065 | ||
1066 | newmnt->mnt_flags = mnt_flags; | |
5b83d2c5 RP |
1067 | if ((err = graft_tree(newmnt, nd))) |
1068 | goto unlock; | |
1da177e4 | 1069 | |
5b83d2c5 | 1070 | if (fslist) { |
1da177e4 LT |
1071 | /* add to the specified expiration list */ |
1072 | spin_lock(&vfsmount_lock); | |
55e700b9 | 1073 | list_add_tail(&newmnt->mnt_expire, fslist); |
1da177e4 LT |
1074 | spin_unlock(&vfsmount_lock); |
1075 | } | |
390c6843 | 1076 | up_write(&namespace_sem); |
5b83d2c5 | 1077 | return 0; |
1da177e4 LT |
1078 | |
1079 | unlock: | |
390c6843 | 1080 | up_write(&namespace_sem); |
1da177e4 LT |
1081 | mntput(newmnt); |
1082 | return err; | |
1083 | } | |
1084 | ||
1085 | EXPORT_SYMBOL_GPL(do_add_mount); | |
1086 | ||
70fbcdf4 RP |
1087 | static void expire_mount(struct vfsmount *mnt, struct list_head *mounts, |
1088 | struct list_head *umounts) | |
24ca2af1 MS |
1089 | { |
1090 | spin_lock(&vfsmount_lock); | |
1091 | ||
ed42c879 MS |
1092 | /* |
1093 | * Check if mount is still attached, if not, let whoever holds it deal | |
1094 | * with the sucker | |
1095 | */ | |
1096 | if (mnt->mnt_parent == mnt) { | |
1097 | spin_unlock(&vfsmount_lock); | |
1098 | return; | |
1099 | } | |
1100 | ||
24ca2af1 MS |
1101 | /* |
1102 | * Check that it is still dead: the count should now be 2 - as | |
1103 | * contributed by the vfsmount parent and the mntget above | |
1104 | */ | |
a05964f3 | 1105 | if (!propagate_mount_busy(mnt, 2)) { |
24ca2af1 | 1106 | /* delete from the namespace */ |
5addc5dd | 1107 | touch_namespace(mnt->mnt_namespace); |
24ca2af1 | 1108 | list_del_init(&mnt->mnt_list); |
ac081153 | 1109 | mnt->mnt_namespace = NULL; |
a05964f3 | 1110 | umount_tree(mnt, 1, umounts); |
24ca2af1 | 1111 | spin_unlock(&vfsmount_lock); |
24ca2af1 MS |
1112 | } else { |
1113 | /* | |
1114 | * Someone brought it back to life whilst we didn't have any | |
1115 | * locks held so return it to the expiration list | |
1116 | */ | |
55e700b9 | 1117 | list_add_tail(&mnt->mnt_expire, mounts); |
24ca2af1 MS |
1118 | spin_unlock(&vfsmount_lock); |
1119 | } | |
1120 | } | |
1121 | ||
1da177e4 LT |
1122 | /* |
1123 | * process a list of expirable mountpoints with the intent of discarding any | |
1124 | * mountpoints that aren't in use and haven't been touched since last we came | |
1125 | * here | |
1126 | */ | |
1127 | void mark_mounts_for_expiry(struct list_head *mounts) | |
1128 | { | |
1129 | struct namespace *namespace; | |
1130 | struct vfsmount *mnt, *next; | |
1131 | LIST_HEAD(graveyard); | |
1132 | ||
1133 | if (list_empty(mounts)) | |
1134 | return; | |
1135 | ||
1136 | spin_lock(&vfsmount_lock); | |
1137 | ||
1138 | /* extract from the expiration list every vfsmount that matches the | |
1139 | * following criteria: | |
1140 | * - only referenced by its parent vfsmount | |
1141 | * - still marked for expiry (marked on the last call here; marks are | |
1142 | * cleared by mntput()) | |
1143 | */ | |
55e700b9 | 1144 | list_for_each_entry_safe(mnt, next, mounts, mnt_expire) { |
1da177e4 LT |
1145 | if (!xchg(&mnt->mnt_expiry_mark, 1) || |
1146 | atomic_read(&mnt->mnt_count) != 1) | |
1147 | continue; | |
1148 | ||
1149 | mntget(mnt); | |
55e700b9 | 1150 | list_move(&mnt->mnt_expire, &graveyard); |
1da177e4 LT |
1151 | } |
1152 | ||
1153 | /* | |
1154 | * go through the vfsmounts we've just consigned to the graveyard to | |
1155 | * - check that they're still dead | |
1156 | * - delete the vfsmount from the appropriate namespace under lock | |
1157 | * - dispose of the corpse | |
1158 | */ | |
1159 | while (!list_empty(&graveyard)) { | |
70fbcdf4 | 1160 | LIST_HEAD(umounts); |
55e700b9 MS |
1161 | mnt = list_entry(graveyard.next, struct vfsmount, mnt_expire); |
1162 | list_del_init(&mnt->mnt_expire); | |
1da177e4 LT |
1163 | |
1164 | /* don't do anything if the namespace is dead - all the | |
1165 | * vfsmounts from it are going away anyway */ | |
1166 | namespace = mnt->mnt_namespace; | |
1ce88cf4 | 1167 | if (!namespace || !namespace->root) |
1da177e4 LT |
1168 | continue; |
1169 | get_namespace(namespace); | |
1170 | ||
1171 | spin_unlock(&vfsmount_lock); | |
390c6843 | 1172 | down_write(&namespace_sem); |
70fbcdf4 | 1173 | expire_mount(mnt, mounts, &umounts); |
390c6843 | 1174 | up_write(&namespace_sem); |
70fbcdf4 | 1175 | release_mounts(&umounts); |
1da177e4 LT |
1176 | mntput(mnt); |
1177 | put_namespace(namespace); | |
1da177e4 LT |
1178 | spin_lock(&vfsmount_lock); |
1179 | } | |
1180 | ||
1181 | spin_unlock(&vfsmount_lock); | |
1182 | } | |
1183 | ||
1184 | EXPORT_SYMBOL_GPL(mark_mounts_for_expiry); | |
1185 | ||
1186 | /* | |
1187 | * Some copy_from_user() implementations do not return the exact number of | |
1188 | * bytes remaining to copy on a fault. But copy_mount_options() requires that. | |
1189 | * Note that this function differs from copy_from_user() in that it will oops | |
1190 | * on bad values of `to', rather than returning a short copy. | |
1191 | */ | |
b58fed8b RP |
1192 | static long exact_copy_from_user(void *to, const void __user * from, |
1193 | unsigned long n) | |
1da177e4 LT |
1194 | { |
1195 | char *t = to; | |
1196 | const char __user *f = from; | |
1197 | char c; | |
1198 | ||
1199 | if (!access_ok(VERIFY_READ, from, n)) | |
1200 | return n; | |
1201 | ||
1202 | while (n) { | |
1203 | if (__get_user(c, f)) { | |
1204 | memset(t, 0, n); | |
1205 | break; | |
1206 | } | |
1207 | *t++ = c; | |
1208 | f++; | |
1209 | n--; | |
1210 | } | |
1211 | return n; | |
1212 | } | |
1213 | ||
b58fed8b | 1214 | int copy_mount_options(const void __user * data, unsigned long *where) |
1da177e4 LT |
1215 | { |
1216 | int i; | |
1217 | unsigned long page; | |
1218 | unsigned long size; | |
b58fed8b | 1219 | |
1da177e4 LT |
1220 | *where = 0; |
1221 | if (!data) | |
1222 | return 0; | |
1223 | ||
1224 | if (!(page = __get_free_page(GFP_KERNEL))) | |
1225 | return -ENOMEM; | |
1226 | ||
1227 | /* We only care that *some* data at the address the user | |
1228 | * gave us is valid. Just in case, we'll zero | |
1229 | * the remainder of the page. | |
1230 | */ | |
1231 | /* copy_from_user cannot cross TASK_SIZE ! */ | |
1232 | size = TASK_SIZE - (unsigned long)data; | |
1233 | if (size > PAGE_SIZE) | |
1234 | size = PAGE_SIZE; | |
1235 | ||
1236 | i = size - exact_copy_from_user((void *)page, data, size); | |
1237 | if (!i) { | |
b58fed8b | 1238 | free_page(page); |
1da177e4 LT |
1239 | return -EFAULT; |
1240 | } | |
1241 | if (i != PAGE_SIZE) | |
1242 | memset((char *)page + i, 0, PAGE_SIZE - i); | |
1243 | *where = page; | |
1244 | return 0; | |
1245 | } | |
1246 | ||
1247 | /* | |
1248 | * Flags is a 32-bit value that allows up to 31 non-fs dependent flags to | |
1249 | * be given to the mount() call (ie: read-only, no-dev, no-suid etc). | |
1250 | * | |
1251 | * data is a (void *) that can point to any structure up to | |
1252 | * PAGE_SIZE-1 bytes, which can contain arbitrary fs-dependent | |
1253 | * information (or be NULL). | |
1254 | * | |
1255 | * Pre-0.97 versions of mount() didn't have a flags word. | |
1256 | * When the flags word was introduced its top half was required | |
1257 | * to have the magic value 0xC0ED, and this remained so until 2.4.0-test9. | |
1258 | * Therefore, if this magic number is present, it carries no information | |
1259 | * and must be discarded. | |
1260 | */ | |
b58fed8b | 1261 | long do_mount(char *dev_name, char *dir_name, char *type_page, |
1da177e4 LT |
1262 | unsigned long flags, void *data_page) |
1263 | { | |
1264 | struct nameidata nd; | |
1265 | int retval = 0; | |
1266 | int mnt_flags = 0; | |
1267 | ||
1268 | /* Discard magic */ | |
1269 | if ((flags & MS_MGC_MSK) == MS_MGC_VAL) | |
1270 | flags &= ~MS_MGC_MSK; | |
1271 | ||
1272 | /* Basic sanity checks */ | |
1273 | ||
1274 | if (!dir_name || !*dir_name || !memchr(dir_name, 0, PAGE_SIZE)) | |
1275 | return -EINVAL; | |
1276 | if (dev_name && !memchr(dev_name, 0, PAGE_SIZE)) | |
1277 | return -EINVAL; | |
1278 | ||
1279 | if (data_page) | |
1280 | ((char *)data_page)[PAGE_SIZE - 1] = 0; | |
1281 | ||
1282 | /* Separate the per-mountpoint flags */ | |
1283 | if (flags & MS_NOSUID) | |
1284 | mnt_flags |= MNT_NOSUID; | |
1285 | if (flags & MS_NODEV) | |
1286 | mnt_flags |= MNT_NODEV; | |
1287 | if (flags & MS_NOEXEC) | |
1288 | mnt_flags |= MNT_NOEXEC; | |
fc33a7bb CH |
1289 | if (flags & MS_NOATIME) |
1290 | mnt_flags |= MNT_NOATIME; | |
1291 | if (flags & MS_NODIRATIME) | |
1292 | mnt_flags |= MNT_NODIRATIME; | |
1293 | ||
1294 | flags &= ~(MS_NOSUID | MS_NOEXEC | MS_NODEV | MS_ACTIVE | | |
1295 | MS_NOATIME | MS_NODIRATIME); | |
1da177e4 LT |
1296 | |
1297 | /* ... and get the mountpoint */ | |
1298 | retval = path_lookup(dir_name, LOOKUP_FOLLOW, &nd); | |
1299 | if (retval) | |
1300 | return retval; | |
1301 | ||
1302 | retval = security_sb_mount(dev_name, &nd, type_page, flags, data_page); | |
1303 | if (retval) | |
1304 | goto dput_out; | |
1305 | ||
1306 | if (flags & MS_REMOUNT) | |
1307 | retval = do_remount(&nd, flags & ~MS_REMOUNT, mnt_flags, | |
1308 | data_page); | |
1309 | else if (flags & MS_BIND) | |
1310 | retval = do_loopback(&nd, dev_name, flags & MS_REC); | |
9676f0c6 | 1311 | else if (flags & (MS_SHARED | MS_PRIVATE | MS_SLAVE | MS_UNBINDABLE)) |
07b20889 | 1312 | retval = do_change_type(&nd, flags); |
1da177e4 LT |
1313 | else if (flags & MS_MOVE) |
1314 | retval = do_move_mount(&nd, dev_name); | |
1315 | else | |
1316 | retval = do_new_mount(&nd, type_page, flags, mnt_flags, | |
1317 | dev_name, data_page); | |
1318 | dput_out: | |
1319 | path_release(&nd); | |
1320 | return retval; | |
1321 | } | |
1322 | ||
1323 | int copy_namespace(int flags, struct task_struct *tsk) | |
1324 | { | |
1325 | struct namespace *namespace = tsk->namespace; | |
1326 | struct namespace *new_ns; | |
1327 | struct vfsmount *rootmnt = NULL, *pwdmnt = NULL, *altrootmnt = NULL; | |
1328 | struct fs_struct *fs = tsk->fs; | |
1329 | struct vfsmount *p, *q; | |
1330 | ||
1331 | if (!namespace) | |
1332 | return 0; | |
1333 | ||
1334 | get_namespace(namespace); | |
1335 | ||
1336 | if (!(flags & CLONE_NEWNS)) | |
1337 | return 0; | |
1338 | ||
1339 | if (!capable(CAP_SYS_ADMIN)) { | |
1340 | put_namespace(namespace); | |
1341 | return -EPERM; | |
1342 | } | |
1343 | ||
1344 | new_ns = kmalloc(sizeof(struct namespace), GFP_KERNEL); | |
1345 | if (!new_ns) | |
1346 | goto out; | |
1347 | ||
1348 | atomic_set(&new_ns->count, 1); | |
1da177e4 | 1349 | INIT_LIST_HEAD(&new_ns->list); |
5addc5dd AV |
1350 | init_waitqueue_head(&new_ns->poll); |
1351 | new_ns->event = 0; | |
1da177e4 | 1352 | |
390c6843 | 1353 | down_write(&namespace_sem); |
1da177e4 | 1354 | /* First pass: copy the tree topology */ |
36341f64 | 1355 | new_ns->root = copy_tree(namespace->root, namespace->root->mnt_root, |
9676f0c6 | 1356 | CL_COPY_ALL | CL_EXPIRE); |
1da177e4 | 1357 | if (!new_ns->root) { |
390c6843 | 1358 | up_write(&namespace_sem); |
1da177e4 LT |
1359 | kfree(new_ns); |
1360 | goto out; | |
1361 | } | |
1362 | spin_lock(&vfsmount_lock); | |
1363 | list_add_tail(&new_ns->list, &new_ns->root->mnt_list); | |
1364 | spin_unlock(&vfsmount_lock); | |
1365 | ||
1366 | /* | |
1367 | * Second pass: switch the tsk->fs->* elements and mark new vfsmounts | |
1368 | * as belonging to new namespace. We have already acquired a private | |
1369 | * fs_struct, so tsk->fs->lock is not needed. | |
1370 | */ | |
1371 | p = namespace->root; | |
1372 | q = new_ns->root; | |
1373 | while (p) { | |
1374 | q->mnt_namespace = new_ns; | |
1375 | if (fs) { | |
1376 | if (p == fs->rootmnt) { | |
1377 | rootmnt = p; | |
1378 | fs->rootmnt = mntget(q); | |
1379 | } | |
1380 | if (p == fs->pwdmnt) { | |
1381 | pwdmnt = p; | |
1382 | fs->pwdmnt = mntget(q); | |
1383 | } | |
1384 | if (p == fs->altrootmnt) { | |
1385 | altrootmnt = p; | |
1386 | fs->altrootmnt = mntget(q); | |
1387 | } | |
1388 | } | |
1389 | p = next_mnt(p, namespace->root); | |
1390 | q = next_mnt(q, new_ns->root); | |
1391 | } | |
390c6843 | 1392 | up_write(&namespace_sem); |
1da177e4 LT |
1393 | |
1394 | tsk->namespace = new_ns; | |
1395 | ||
1396 | if (rootmnt) | |
1397 | mntput(rootmnt); | |
1398 | if (pwdmnt) | |
1399 | mntput(pwdmnt); | |
1400 | if (altrootmnt) | |
1401 | mntput(altrootmnt); | |
1402 | ||
1403 | put_namespace(namespace); | |
1404 | return 0; | |
1405 | ||
1406 | out: | |
1407 | put_namespace(namespace); | |
1408 | return -ENOMEM; | |
1409 | } | |
1410 | ||
1411 | asmlinkage long sys_mount(char __user * dev_name, char __user * dir_name, | |
1412 | char __user * type, unsigned long flags, | |
1413 | void __user * data) | |
1414 | { | |
1415 | int retval; | |
1416 | unsigned long data_page; | |
1417 | unsigned long type_page; | |
1418 | unsigned long dev_page; | |
1419 | char *dir_page; | |
1420 | ||
b58fed8b | 1421 | retval = copy_mount_options(type, &type_page); |
1da177e4 LT |
1422 | if (retval < 0) |
1423 | return retval; | |
1424 | ||
1425 | dir_page = getname(dir_name); | |
1426 | retval = PTR_ERR(dir_page); | |
1427 | if (IS_ERR(dir_page)) | |
1428 | goto out1; | |
1429 | ||
b58fed8b | 1430 | retval = copy_mount_options(dev_name, &dev_page); |
1da177e4 LT |
1431 | if (retval < 0) |
1432 | goto out2; | |
1433 | ||
b58fed8b | 1434 | retval = copy_mount_options(data, &data_page); |
1da177e4 LT |
1435 | if (retval < 0) |
1436 | goto out3; | |
1437 | ||
1438 | lock_kernel(); | |
b58fed8b RP |
1439 | retval = do_mount((char *)dev_page, dir_page, (char *)type_page, |
1440 | flags, (void *)data_page); | |
1da177e4 LT |
1441 | unlock_kernel(); |
1442 | free_page(data_page); | |
1443 | ||
1444 | out3: | |
1445 | free_page(dev_page); | |
1446 | out2: | |
1447 | putname(dir_page); | |
1448 | out1: | |
1449 | free_page(type_page); | |
1450 | return retval; | |
1451 | } | |
1452 | ||
1453 | /* | |
1454 | * Replace the fs->{rootmnt,root} with {mnt,dentry}. Put the old values. | |
1455 | * It can block. Requires the big lock held. | |
1456 | */ | |
1457 | void set_fs_root(struct fs_struct *fs, struct vfsmount *mnt, | |
1458 | struct dentry *dentry) | |
1459 | { | |
1460 | struct dentry *old_root; | |
1461 | struct vfsmount *old_rootmnt; | |
1462 | write_lock(&fs->lock); | |
1463 | old_root = fs->root; | |
1464 | old_rootmnt = fs->rootmnt; | |
1465 | fs->rootmnt = mntget(mnt); | |
1466 | fs->root = dget(dentry); | |
1467 | write_unlock(&fs->lock); | |
1468 | if (old_root) { | |
1469 | dput(old_root); | |
1470 | mntput(old_rootmnt); | |
1471 | } | |
1472 | } | |
1473 | ||
1474 | /* | |
1475 | * Replace the fs->{pwdmnt,pwd} with {mnt,dentry}. Put the old values. | |
1476 | * It can block. Requires the big lock held. | |
1477 | */ | |
1478 | void set_fs_pwd(struct fs_struct *fs, struct vfsmount *mnt, | |
1479 | struct dentry *dentry) | |
1480 | { | |
1481 | struct dentry *old_pwd; | |
1482 | struct vfsmount *old_pwdmnt; | |
1483 | ||
1484 | write_lock(&fs->lock); | |
1485 | old_pwd = fs->pwd; | |
1486 | old_pwdmnt = fs->pwdmnt; | |
1487 | fs->pwdmnt = mntget(mnt); | |
1488 | fs->pwd = dget(dentry); | |
1489 | write_unlock(&fs->lock); | |
1490 | ||
1491 | if (old_pwd) { | |
1492 | dput(old_pwd); | |
1493 | mntput(old_pwdmnt); | |
1494 | } | |
1495 | } | |
1496 | ||
1497 | static void chroot_fs_refs(struct nameidata *old_nd, struct nameidata *new_nd) | |
1498 | { | |
1499 | struct task_struct *g, *p; | |
1500 | struct fs_struct *fs; | |
1501 | ||
1502 | read_lock(&tasklist_lock); | |
1503 | do_each_thread(g, p) { | |
1504 | task_lock(p); | |
1505 | fs = p->fs; | |
1506 | if (fs) { | |
1507 | atomic_inc(&fs->count); | |
1508 | task_unlock(p); | |
b58fed8b RP |
1509 | if (fs->root == old_nd->dentry |
1510 | && fs->rootmnt == old_nd->mnt) | |
1da177e4 | 1511 | set_fs_root(fs, new_nd->mnt, new_nd->dentry); |
b58fed8b RP |
1512 | if (fs->pwd == old_nd->dentry |
1513 | && fs->pwdmnt == old_nd->mnt) | |
1da177e4 LT |
1514 | set_fs_pwd(fs, new_nd->mnt, new_nd->dentry); |
1515 | put_fs_struct(fs); | |
1516 | } else | |
1517 | task_unlock(p); | |
1518 | } while_each_thread(g, p); | |
1519 | read_unlock(&tasklist_lock); | |
1520 | } | |
1521 | ||
1522 | /* | |
1523 | * pivot_root Semantics: | |
1524 | * Moves the root file system of the current process to the directory put_old, | |
1525 | * makes new_root as the new root file system of the current process, and sets | |
1526 | * root/cwd of all processes which had them on the current root to new_root. | |
1527 | * | |
1528 | * Restrictions: | |
1529 | * The new_root and put_old must be directories, and must not be on the | |
1530 | * same file system as the current process root. The put_old must be | |
1531 | * underneath new_root, i.e. adding a non-zero number of /.. to the string | |
1532 | * pointed to by put_old must yield the same directory as new_root. No other | |
1533 | * file system may be mounted on put_old. After all, new_root is a mountpoint. | |
1534 | * | |
4a0d11fa NB |
1535 | * Also, the current root cannot be on the 'rootfs' (initial ramfs) filesystem. |
1536 | * See Documentation/filesystems/ramfs-rootfs-initramfs.txt for alternatives | |
1537 | * in this situation. | |
1538 | * | |
1da177e4 LT |
1539 | * Notes: |
1540 | * - we don't move root/cwd if they are not at the root (reason: if something | |
1541 | * cared enough to change them, it's probably wrong to force them elsewhere) | |
1542 | * - it's okay to pick a root that isn't the root of a file system, e.g. | |
1543 | * /nfs/my_root where /nfs is the mount point. It must be a mountpoint, | |
1544 | * though, so you may need to say mount --bind /nfs/my_root /nfs/my_root | |
1545 | * first. | |
1546 | */ | |
b58fed8b RP |
1547 | asmlinkage long sys_pivot_root(const char __user * new_root, |
1548 | const char __user * put_old) | |
1da177e4 LT |
1549 | { |
1550 | struct vfsmount *tmp; | |
1551 | struct nameidata new_nd, old_nd, parent_nd, root_parent, user_nd; | |
1552 | int error; | |
1553 | ||
1554 | if (!capable(CAP_SYS_ADMIN)) | |
1555 | return -EPERM; | |
1556 | ||
1557 | lock_kernel(); | |
1558 | ||
b58fed8b RP |
1559 | error = __user_walk(new_root, LOOKUP_FOLLOW | LOOKUP_DIRECTORY, |
1560 | &new_nd); | |
1da177e4 LT |
1561 | if (error) |
1562 | goto out0; | |
1563 | error = -EINVAL; | |
1564 | if (!check_mnt(new_nd.mnt)) | |
1565 | goto out1; | |
1566 | ||
b58fed8b | 1567 | error = __user_walk(put_old, LOOKUP_FOLLOW | LOOKUP_DIRECTORY, &old_nd); |
1da177e4 LT |
1568 | if (error) |
1569 | goto out1; | |
1570 | ||
1571 | error = security_sb_pivotroot(&old_nd, &new_nd); | |
1572 | if (error) { | |
1573 | path_release(&old_nd); | |
1574 | goto out1; | |
1575 | } | |
1576 | ||
1577 | read_lock(¤t->fs->lock); | |
1578 | user_nd.mnt = mntget(current->fs->rootmnt); | |
1579 | user_nd.dentry = dget(current->fs->root); | |
1580 | read_unlock(¤t->fs->lock); | |
390c6843 | 1581 | down_write(&namespace_sem); |
1b1dcc1b | 1582 | mutex_lock(&old_nd.dentry->d_inode->i_mutex); |
1da177e4 | 1583 | error = -EINVAL; |
21444403 RP |
1584 | if (IS_MNT_SHARED(old_nd.mnt) || |
1585 | IS_MNT_SHARED(new_nd.mnt->mnt_parent) || | |
1586 | IS_MNT_SHARED(user_nd.mnt->mnt_parent)) | |
1587 | goto out2; | |
1da177e4 LT |
1588 | if (!check_mnt(user_nd.mnt)) |
1589 | goto out2; | |
1590 | error = -ENOENT; | |
1591 | if (IS_DEADDIR(new_nd.dentry->d_inode)) | |
1592 | goto out2; | |
1593 | if (d_unhashed(new_nd.dentry) && !IS_ROOT(new_nd.dentry)) | |
1594 | goto out2; | |
1595 | if (d_unhashed(old_nd.dentry) && !IS_ROOT(old_nd.dentry)) | |
1596 | goto out2; | |
1597 | error = -EBUSY; | |
1598 | if (new_nd.mnt == user_nd.mnt || old_nd.mnt == user_nd.mnt) | |
1599 | goto out2; /* loop, on the same file system */ | |
1600 | error = -EINVAL; | |
1601 | if (user_nd.mnt->mnt_root != user_nd.dentry) | |
1602 | goto out2; /* not a mountpoint */ | |
0bb6fcc1 MS |
1603 | if (user_nd.mnt->mnt_parent == user_nd.mnt) |
1604 | goto out2; /* not attached */ | |
1da177e4 LT |
1605 | if (new_nd.mnt->mnt_root != new_nd.dentry) |
1606 | goto out2; /* not a mountpoint */ | |
0bb6fcc1 MS |
1607 | if (new_nd.mnt->mnt_parent == new_nd.mnt) |
1608 | goto out2; /* not attached */ | |
1da177e4 LT |
1609 | tmp = old_nd.mnt; /* make sure we can reach put_old from new_root */ |
1610 | spin_lock(&vfsmount_lock); | |
1611 | if (tmp != new_nd.mnt) { | |
1612 | for (;;) { | |
1613 | if (tmp->mnt_parent == tmp) | |
1614 | goto out3; /* already mounted on put_old */ | |
1615 | if (tmp->mnt_parent == new_nd.mnt) | |
1616 | break; | |
1617 | tmp = tmp->mnt_parent; | |
1618 | } | |
1619 | if (!is_subdir(tmp->mnt_mountpoint, new_nd.dentry)) | |
1620 | goto out3; | |
1621 | } else if (!is_subdir(old_nd.dentry, new_nd.dentry)) | |
1622 | goto out3; | |
1623 | detach_mnt(new_nd.mnt, &parent_nd); | |
1624 | detach_mnt(user_nd.mnt, &root_parent); | |
1625 | attach_mnt(user_nd.mnt, &old_nd); /* mount old root on put_old */ | |
1626 | attach_mnt(new_nd.mnt, &root_parent); /* mount new_root on / */ | |
5addc5dd | 1627 | touch_namespace(current->namespace); |
1da177e4 LT |
1628 | spin_unlock(&vfsmount_lock); |
1629 | chroot_fs_refs(&user_nd, &new_nd); | |
1630 | security_sb_post_pivotroot(&user_nd, &new_nd); | |
1631 | error = 0; | |
1632 | path_release(&root_parent); | |
1633 | path_release(&parent_nd); | |
1634 | out2: | |
1b1dcc1b | 1635 | mutex_unlock(&old_nd.dentry->d_inode->i_mutex); |
390c6843 | 1636 | up_write(&namespace_sem); |
1da177e4 LT |
1637 | path_release(&user_nd); |
1638 | path_release(&old_nd); | |
1639 | out1: | |
1640 | path_release(&new_nd); | |
1641 | out0: | |
1642 | unlock_kernel(); | |
1643 | return error; | |
1644 | out3: | |
1645 | spin_unlock(&vfsmount_lock); | |
1646 | goto out2; | |
1647 | } | |
1648 | ||
1649 | static void __init init_mount_tree(void) | |
1650 | { | |
1651 | struct vfsmount *mnt; | |
1652 | struct namespace *namespace; | |
1653 | struct task_struct *g, *p; | |
1654 | ||
1655 | mnt = do_kern_mount("rootfs", 0, "rootfs", NULL); | |
1656 | if (IS_ERR(mnt)) | |
1657 | panic("Can't create rootfs"); | |
1658 | namespace = kmalloc(sizeof(*namespace), GFP_KERNEL); | |
1659 | if (!namespace) | |
1660 | panic("Can't allocate initial namespace"); | |
1661 | atomic_set(&namespace->count, 1); | |
1662 | INIT_LIST_HEAD(&namespace->list); | |
5addc5dd AV |
1663 | init_waitqueue_head(&namespace->poll); |
1664 | namespace->event = 0; | |
1da177e4 LT |
1665 | list_add(&mnt->mnt_list, &namespace->list); |
1666 | namespace->root = mnt; | |
1667 | mnt->mnt_namespace = namespace; | |
1668 | ||
1669 | init_task.namespace = namespace; | |
1670 | read_lock(&tasklist_lock); | |
1671 | do_each_thread(g, p) { | |
1672 | get_namespace(namespace); | |
1673 | p->namespace = namespace; | |
1674 | } while_each_thread(g, p); | |
1675 | read_unlock(&tasklist_lock); | |
1676 | ||
1677 | set_fs_pwd(current->fs, namespace->root, namespace->root->mnt_root); | |
1678 | set_fs_root(current->fs, namespace->root, namespace->root->mnt_root); | |
1679 | } | |
1680 | ||
1681 | void __init mnt_init(unsigned long mempages) | |
1682 | { | |
1683 | struct list_head *d; | |
1684 | unsigned int nr_hash; | |
1685 | int i; | |
1686 | ||
390c6843 RP |
1687 | init_rwsem(&namespace_sem); |
1688 | ||
1da177e4 | 1689 | mnt_cache = kmem_cache_create("mnt_cache", sizeof(struct vfsmount), |
b58fed8b | 1690 | 0, SLAB_HWCACHE_ALIGN | SLAB_PANIC, NULL, NULL); |
1da177e4 | 1691 | |
b58fed8b | 1692 | mount_hashtable = (struct list_head *)__get_free_page(GFP_ATOMIC); |
1da177e4 LT |
1693 | |
1694 | if (!mount_hashtable) | |
1695 | panic("Failed to allocate mount hash table\n"); | |
1696 | ||
1697 | /* | |
1698 | * Find the power-of-two list-heads that can fit into the allocation.. | |
1699 | * We don't guarantee that "sizeof(struct list_head)" is necessarily | |
1700 | * a power-of-two. | |
1701 | */ | |
1702 | nr_hash = PAGE_SIZE / sizeof(struct list_head); | |
1703 | hash_bits = 0; | |
1704 | do { | |
1705 | hash_bits++; | |
1706 | } while ((nr_hash >> hash_bits) != 0); | |
1707 | hash_bits--; | |
1708 | ||
1709 | /* | |
1710 | * Re-calculate the actual number of entries and the mask | |
1711 | * from the number of bits we can fit. | |
1712 | */ | |
1713 | nr_hash = 1UL << hash_bits; | |
b58fed8b | 1714 | hash_mask = nr_hash - 1; |
1da177e4 LT |
1715 | |
1716 | printk("Mount-cache hash table entries: %d\n", nr_hash); | |
1717 | ||
1718 | /* And initialize the newly allocated array */ | |
1719 | d = mount_hashtable; | |
1720 | i = nr_hash; | |
1721 | do { | |
1722 | INIT_LIST_HEAD(d); | |
1723 | d++; | |
1724 | i--; | |
1725 | } while (i); | |
1726 | sysfs_init(); | |
1727 | init_rootfs(); | |
1728 | init_mount_tree(); | |
1729 | } | |
1730 | ||
1731 | void __put_namespace(struct namespace *namespace) | |
1732 | { | |
1ce88cf4 | 1733 | struct vfsmount *root = namespace->root; |
70fbcdf4 | 1734 | LIST_HEAD(umount_list); |
1ce88cf4 MS |
1735 | namespace->root = NULL; |
1736 | spin_unlock(&vfsmount_lock); | |
390c6843 | 1737 | down_write(&namespace_sem); |
1da177e4 | 1738 | spin_lock(&vfsmount_lock); |
a05964f3 | 1739 | umount_tree(root, 0, &umount_list); |
1da177e4 | 1740 | spin_unlock(&vfsmount_lock); |
390c6843 | 1741 | up_write(&namespace_sem); |
70fbcdf4 | 1742 | release_mounts(&umount_list); |
1da177e4 LT |
1743 | kfree(namespace); |
1744 | } |