namespace.c 45 KB

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