namespace.c 57 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297
  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/syscalls.h>
  11. #include <linux/slab.h>
  12. #include <linux/sched.h>
  13. #include <linux/smp_lock.h>
  14. #include <linux/init.h>
  15. #include <linux/kernel.h>
  16. #include <linux/acct.h>
  17. #include <linux/capability.h>
  18. #include <linux/cpumask.h>
  19. #include <linux/module.h>
  20. #include <linux/sysfs.h>
  21. #include <linux/seq_file.h>
  22. #include <linux/mnt_namespace.h>
  23. #include <linux/namei.h>
  24. #include <linux/security.h>
  25. #include <linux/mount.h>
  26. #include <linux/ramfs.h>
  27. #include <linux/log2.h>
  28. #include <linux/idr.h>
  29. #include <linux/fs_struct.h>
  30. #include <asm/uaccess.h>
  31. #include <asm/unistd.h>
  32. #include "pnode.h"
  33. #include "internal.h"
  34. #define HASH_SHIFT ilog2(PAGE_SIZE / sizeof(struct list_head))
  35. #define HASH_SIZE (1UL << HASH_SHIFT)
  36. /* spinlock for vfsmount related operations, inplace of dcache_lock */
  37. __cacheline_aligned_in_smp DEFINE_SPINLOCK(vfsmount_lock);
  38. static int event;
  39. static DEFINE_IDA(mnt_id_ida);
  40. static DEFINE_IDA(mnt_group_ida);
  41. static struct list_head *mount_hashtable __read_mostly;
  42. static struct kmem_cache *mnt_cache __read_mostly;
  43. static struct rw_semaphore namespace_sem;
  44. /* /sys/fs */
  45. struct kobject *fs_kobj;
  46. EXPORT_SYMBOL_GPL(fs_kobj);
  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_SHIFT);
  52. return tmp & (HASH_SIZE - 1);
  53. }
  54. #define MNT_WRITER_UNDERFLOW_LIMIT -(1<<16)
  55. /* allocation is serialized by namespace_sem */
  56. static int mnt_alloc_id(struct vfsmount *mnt)
  57. {
  58. int res;
  59. retry:
  60. ida_pre_get(&mnt_id_ida, GFP_KERNEL);
  61. spin_lock(&vfsmount_lock);
  62. res = ida_get_new(&mnt_id_ida, &mnt->mnt_id);
  63. spin_unlock(&vfsmount_lock);
  64. if (res == -EAGAIN)
  65. goto retry;
  66. return res;
  67. }
  68. static void mnt_free_id(struct vfsmount *mnt)
  69. {
  70. spin_lock(&vfsmount_lock);
  71. ida_remove(&mnt_id_ida, mnt->mnt_id);
  72. spin_unlock(&vfsmount_lock);
  73. }
  74. /*
  75. * Allocate a new peer group ID
  76. *
  77. * mnt_group_ida is protected by namespace_sem
  78. */
  79. static int mnt_alloc_group_id(struct vfsmount *mnt)
  80. {
  81. if (!ida_pre_get(&mnt_group_ida, GFP_KERNEL))
  82. return -ENOMEM;
  83. return ida_get_new_above(&mnt_group_ida, 1, &mnt->mnt_group_id);
  84. }
  85. /*
  86. * Release a peer group ID
  87. */
  88. void mnt_release_group_id(struct vfsmount *mnt)
  89. {
  90. ida_remove(&mnt_group_ida, mnt->mnt_group_id);
  91. mnt->mnt_group_id = 0;
  92. }
  93. struct vfsmount *alloc_vfsmnt(const char *name)
  94. {
  95. struct vfsmount *mnt = kmem_cache_zalloc(mnt_cache, GFP_KERNEL);
  96. if (mnt) {
  97. int err;
  98. err = mnt_alloc_id(mnt);
  99. if (err)
  100. goto out_free_cache;
  101. if (name) {
  102. mnt->mnt_devname = kstrdup(name, GFP_KERNEL);
  103. if (!mnt->mnt_devname)
  104. goto out_free_id;
  105. }
  106. atomic_set(&mnt->mnt_count, 1);
  107. INIT_LIST_HEAD(&mnt->mnt_hash);
  108. INIT_LIST_HEAD(&mnt->mnt_child);
  109. INIT_LIST_HEAD(&mnt->mnt_mounts);
  110. INIT_LIST_HEAD(&mnt->mnt_list);
  111. INIT_LIST_HEAD(&mnt->mnt_expire);
  112. INIT_LIST_HEAD(&mnt->mnt_share);
  113. INIT_LIST_HEAD(&mnt->mnt_slave_list);
  114. INIT_LIST_HEAD(&mnt->mnt_slave);
  115. atomic_set(&mnt->__mnt_writers, 0);
  116. }
  117. return mnt;
  118. out_free_id:
  119. mnt_free_id(mnt);
  120. out_free_cache:
  121. kmem_cache_free(mnt_cache, mnt);
  122. return NULL;
  123. }
  124. /*
  125. * Most r/o checks on a fs are for operations that take
  126. * discrete amounts of time, like a write() or unlink().
  127. * We must keep track of when those operations start
  128. * (for permission checks) and when they end, so that
  129. * we can determine when writes are able to occur to
  130. * a filesystem.
  131. */
  132. /*
  133. * __mnt_is_readonly: check whether a mount is read-only
  134. * @mnt: the mount to check for its write status
  135. *
  136. * This shouldn't be used directly ouside of the VFS.
  137. * It does not guarantee that the filesystem will stay
  138. * r/w, just that it is right *now*. This can not and
  139. * should not be used in place of IS_RDONLY(inode).
  140. * mnt_want/drop_write() will _keep_ the filesystem
  141. * r/w.
  142. */
  143. int __mnt_is_readonly(struct vfsmount *mnt)
  144. {
  145. if (mnt->mnt_flags & MNT_READONLY)
  146. return 1;
  147. if (mnt->mnt_sb->s_flags & MS_RDONLY)
  148. return 1;
  149. return 0;
  150. }
  151. EXPORT_SYMBOL_GPL(__mnt_is_readonly);
  152. struct mnt_writer {
  153. /*
  154. * If holding multiple instances of this lock, they
  155. * must be ordered by cpu number.
  156. */
  157. spinlock_t lock;
  158. struct lock_class_key lock_class; /* compiles out with !lockdep */
  159. unsigned long count;
  160. struct vfsmount *mnt;
  161. } ____cacheline_aligned_in_smp;
  162. static DEFINE_PER_CPU(struct mnt_writer, mnt_writers);
  163. static int __init init_mnt_writers(void)
  164. {
  165. int cpu;
  166. for_each_possible_cpu(cpu) {
  167. struct mnt_writer *writer = &per_cpu(mnt_writers, cpu);
  168. spin_lock_init(&writer->lock);
  169. lockdep_set_class(&writer->lock, &writer->lock_class);
  170. writer->count = 0;
  171. }
  172. return 0;
  173. }
  174. fs_initcall(init_mnt_writers);
  175. static void unlock_mnt_writers(void)
  176. {
  177. int cpu;
  178. struct mnt_writer *cpu_writer;
  179. for_each_possible_cpu(cpu) {
  180. cpu_writer = &per_cpu(mnt_writers, cpu);
  181. spin_unlock(&cpu_writer->lock);
  182. }
  183. }
  184. static inline void __clear_mnt_count(struct mnt_writer *cpu_writer)
  185. {
  186. if (!cpu_writer->mnt)
  187. return;
  188. /*
  189. * This is in case anyone ever leaves an invalid,
  190. * old ->mnt and a count of 0.
  191. */
  192. if (!cpu_writer->count)
  193. return;
  194. atomic_add(cpu_writer->count, &cpu_writer->mnt->__mnt_writers);
  195. cpu_writer->count = 0;
  196. }
  197. /*
  198. * must hold cpu_writer->lock
  199. */
  200. static inline void use_cpu_writer_for_mount(struct mnt_writer *cpu_writer,
  201. struct vfsmount *mnt)
  202. {
  203. if (cpu_writer->mnt == mnt)
  204. return;
  205. __clear_mnt_count(cpu_writer);
  206. cpu_writer->mnt = mnt;
  207. }
  208. /*
  209. * Most r/o checks on a fs are for operations that take
  210. * discrete amounts of time, like a write() or unlink().
  211. * We must keep track of when those operations start
  212. * (for permission checks) and when they end, so that
  213. * we can determine when writes are able to occur to
  214. * a filesystem.
  215. */
  216. /**
  217. * mnt_want_write - get write access to a mount
  218. * @mnt: the mount on which to take a write
  219. *
  220. * This tells the low-level filesystem that a write is
  221. * about to be performed to it, and makes sure that
  222. * writes are allowed before returning success. When
  223. * the write operation is finished, mnt_drop_write()
  224. * must be called. This is effectively a refcount.
  225. */
  226. int mnt_want_write(struct vfsmount *mnt)
  227. {
  228. int ret = 0;
  229. struct mnt_writer *cpu_writer;
  230. cpu_writer = &get_cpu_var(mnt_writers);
  231. spin_lock(&cpu_writer->lock);
  232. if (__mnt_is_readonly(mnt)) {
  233. ret = -EROFS;
  234. goto out;
  235. }
  236. use_cpu_writer_for_mount(cpu_writer, mnt);
  237. cpu_writer->count++;
  238. out:
  239. spin_unlock(&cpu_writer->lock);
  240. put_cpu_var(mnt_writers);
  241. return ret;
  242. }
  243. EXPORT_SYMBOL_GPL(mnt_want_write);
  244. static void lock_mnt_writers(void)
  245. {
  246. int cpu;
  247. struct mnt_writer *cpu_writer;
  248. for_each_possible_cpu(cpu) {
  249. cpu_writer = &per_cpu(mnt_writers, cpu);
  250. spin_lock(&cpu_writer->lock);
  251. __clear_mnt_count(cpu_writer);
  252. cpu_writer->mnt = NULL;
  253. }
  254. }
  255. /*
  256. * These per-cpu write counts are not guaranteed to have
  257. * matched increments and decrements on any given cpu.
  258. * A file open()ed for write on one cpu and close()d on
  259. * another cpu will imbalance this count. Make sure it
  260. * does not get too far out of whack.
  261. */
  262. static void handle_write_count_underflow(struct vfsmount *mnt)
  263. {
  264. if (atomic_read(&mnt->__mnt_writers) >=
  265. MNT_WRITER_UNDERFLOW_LIMIT)
  266. return;
  267. /*
  268. * It isn't necessary to hold all of the locks
  269. * at the same time, but doing it this way makes
  270. * us share a lot more code.
  271. */
  272. lock_mnt_writers();
  273. /*
  274. * vfsmount_lock is for mnt_flags.
  275. */
  276. spin_lock(&vfsmount_lock);
  277. /*
  278. * If coalescing the per-cpu writer counts did not
  279. * get us back to a positive writer count, we have
  280. * a bug.
  281. */
  282. if ((atomic_read(&mnt->__mnt_writers) < 0) &&
  283. !(mnt->mnt_flags & MNT_IMBALANCED_WRITE_COUNT)) {
  284. WARN(1, KERN_DEBUG "leak detected on mount(%p) writers "
  285. "count: %d\n",
  286. mnt, atomic_read(&mnt->__mnt_writers));
  287. /* use the flag to keep the dmesg spam down */
  288. mnt->mnt_flags |= MNT_IMBALANCED_WRITE_COUNT;
  289. }
  290. spin_unlock(&vfsmount_lock);
  291. unlock_mnt_writers();
  292. }
  293. /**
  294. * mnt_drop_write - give up write access to a mount
  295. * @mnt: the mount on which to give up write access
  296. *
  297. * Tells the low-level filesystem that we are done
  298. * performing writes to it. Must be matched with
  299. * mnt_want_write() call above.
  300. */
  301. void mnt_drop_write(struct vfsmount *mnt)
  302. {
  303. int must_check_underflow = 0;
  304. struct mnt_writer *cpu_writer;
  305. cpu_writer = &get_cpu_var(mnt_writers);
  306. spin_lock(&cpu_writer->lock);
  307. use_cpu_writer_for_mount(cpu_writer, mnt);
  308. if (cpu_writer->count > 0) {
  309. cpu_writer->count--;
  310. } else {
  311. must_check_underflow = 1;
  312. atomic_dec(&mnt->__mnt_writers);
  313. }
  314. spin_unlock(&cpu_writer->lock);
  315. /*
  316. * Logically, we could call this each time,
  317. * but the __mnt_writers cacheline tends to
  318. * be cold, and makes this expensive.
  319. */
  320. if (must_check_underflow)
  321. handle_write_count_underflow(mnt);
  322. /*
  323. * This could be done right after the spinlock
  324. * is taken because the spinlock keeps us on
  325. * the cpu, and disables preemption. However,
  326. * putting it here bounds the amount that
  327. * __mnt_writers can underflow. Without it,
  328. * we could theoretically wrap __mnt_writers.
  329. */
  330. put_cpu_var(mnt_writers);
  331. }
  332. EXPORT_SYMBOL_GPL(mnt_drop_write);
  333. static int mnt_make_readonly(struct vfsmount *mnt)
  334. {
  335. int ret = 0;
  336. lock_mnt_writers();
  337. /*
  338. * With all the locks held, this value is stable
  339. */
  340. if (atomic_read(&mnt->__mnt_writers) > 0) {
  341. ret = -EBUSY;
  342. goto out;
  343. }
  344. /*
  345. * nobody can do a successful mnt_want_write() with all
  346. * of the counts in MNT_DENIED_WRITE and the locks held.
  347. */
  348. spin_lock(&vfsmount_lock);
  349. if (!ret)
  350. mnt->mnt_flags |= MNT_READONLY;
  351. spin_unlock(&vfsmount_lock);
  352. out:
  353. unlock_mnt_writers();
  354. return ret;
  355. }
  356. static void __mnt_unmake_readonly(struct vfsmount *mnt)
  357. {
  358. spin_lock(&vfsmount_lock);
  359. mnt->mnt_flags &= ~MNT_READONLY;
  360. spin_unlock(&vfsmount_lock);
  361. }
  362. void simple_set_mnt(struct vfsmount *mnt, struct super_block *sb)
  363. {
  364. mnt->mnt_sb = sb;
  365. mnt->mnt_root = dget(sb->s_root);
  366. }
  367. EXPORT_SYMBOL(simple_set_mnt);
  368. void free_vfsmnt(struct vfsmount *mnt)
  369. {
  370. kfree(mnt->mnt_devname);
  371. mnt_free_id(mnt);
  372. kmem_cache_free(mnt_cache, mnt);
  373. }
  374. /*
  375. * find the first or last mount at @dentry on vfsmount @mnt depending on
  376. * @dir. If @dir is set return the first mount else return the last mount.
  377. */
  378. struct vfsmount *__lookup_mnt(struct vfsmount *mnt, struct dentry *dentry,
  379. int dir)
  380. {
  381. struct list_head *head = mount_hashtable + hash(mnt, dentry);
  382. struct list_head *tmp = head;
  383. struct vfsmount *p, *found = NULL;
  384. for (;;) {
  385. tmp = dir ? tmp->next : tmp->prev;
  386. p = NULL;
  387. if (tmp == head)
  388. break;
  389. p = list_entry(tmp, struct vfsmount, mnt_hash);
  390. if (p->mnt_parent == mnt && p->mnt_mountpoint == dentry) {
  391. found = p;
  392. break;
  393. }
  394. }
  395. return found;
  396. }
  397. /*
  398. * lookup_mnt increments the ref count before returning
  399. * the vfsmount struct.
  400. */
  401. struct vfsmount *lookup_mnt(struct vfsmount *mnt, struct dentry *dentry)
  402. {
  403. struct vfsmount *child_mnt;
  404. spin_lock(&vfsmount_lock);
  405. if ((child_mnt = __lookup_mnt(mnt, dentry, 1)))
  406. mntget(child_mnt);
  407. spin_unlock(&vfsmount_lock);
  408. return child_mnt;
  409. }
  410. static inline int check_mnt(struct vfsmount *mnt)
  411. {
  412. return mnt->mnt_ns == current->nsproxy->mnt_ns;
  413. }
  414. static void touch_mnt_namespace(struct mnt_namespace *ns)
  415. {
  416. if (ns) {
  417. ns->event = ++event;
  418. wake_up_interruptible(&ns->poll);
  419. }
  420. }
  421. static void __touch_mnt_namespace(struct mnt_namespace *ns)
  422. {
  423. if (ns && ns->event != event) {
  424. ns->event = event;
  425. wake_up_interruptible(&ns->poll);
  426. }
  427. }
  428. static void detach_mnt(struct vfsmount *mnt, struct path *old_path)
  429. {
  430. old_path->dentry = mnt->mnt_mountpoint;
  431. old_path->mnt = mnt->mnt_parent;
  432. mnt->mnt_parent = mnt;
  433. mnt->mnt_mountpoint = mnt->mnt_root;
  434. list_del_init(&mnt->mnt_child);
  435. list_del_init(&mnt->mnt_hash);
  436. old_path->dentry->d_mounted--;
  437. }
  438. void mnt_set_mountpoint(struct vfsmount *mnt, struct dentry *dentry,
  439. struct vfsmount *child_mnt)
  440. {
  441. child_mnt->mnt_parent = mntget(mnt);
  442. child_mnt->mnt_mountpoint = dget(dentry);
  443. dentry->d_mounted++;
  444. }
  445. static void attach_mnt(struct vfsmount *mnt, struct path *path)
  446. {
  447. mnt_set_mountpoint(path->mnt, path->dentry, mnt);
  448. list_add_tail(&mnt->mnt_hash, mount_hashtable +
  449. hash(path->mnt, path->dentry));
  450. list_add_tail(&mnt->mnt_child, &path->mnt->mnt_mounts);
  451. }
  452. /*
  453. * the caller must hold vfsmount_lock
  454. */
  455. static void commit_tree(struct vfsmount *mnt)
  456. {
  457. struct vfsmount *parent = mnt->mnt_parent;
  458. struct vfsmount *m;
  459. LIST_HEAD(head);
  460. struct mnt_namespace *n = parent->mnt_ns;
  461. BUG_ON(parent == mnt);
  462. list_add_tail(&head, &mnt->mnt_list);
  463. list_for_each_entry(m, &head, mnt_list)
  464. m->mnt_ns = n;
  465. list_splice(&head, n->list.prev);
  466. list_add_tail(&mnt->mnt_hash, mount_hashtable +
  467. hash(parent, mnt->mnt_mountpoint));
  468. list_add_tail(&mnt->mnt_child, &parent->mnt_mounts);
  469. touch_mnt_namespace(n);
  470. }
  471. static struct vfsmount *next_mnt(struct vfsmount *p, struct vfsmount *root)
  472. {
  473. struct list_head *next = p->mnt_mounts.next;
  474. if (next == &p->mnt_mounts) {
  475. while (1) {
  476. if (p == root)
  477. return NULL;
  478. next = p->mnt_child.next;
  479. if (next != &p->mnt_parent->mnt_mounts)
  480. break;
  481. p = p->mnt_parent;
  482. }
  483. }
  484. return list_entry(next, struct vfsmount, mnt_child);
  485. }
  486. static struct vfsmount *skip_mnt_tree(struct vfsmount *p)
  487. {
  488. struct list_head *prev = p->mnt_mounts.prev;
  489. while (prev != &p->mnt_mounts) {
  490. p = list_entry(prev, struct vfsmount, mnt_child);
  491. prev = p->mnt_mounts.prev;
  492. }
  493. return p;
  494. }
  495. static struct vfsmount *clone_mnt(struct vfsmount *old, struct dentry *root,
  496. int flag)
  497. {
  498. struct super_block *sb = old->mnt_sb;
  499. struct vfsmount *mnt = alloc_vfsmnt(old->mnt_devname);
  500. if (mnt) {
  501. if (flag & (CL_SLAVE | CL_PRIVATE))
  502. mnt->mnt_group_id = 0; /* not a peer of original */
  503. else
  504. mnt->mnt_group_id = old->mnt_group_id;
  505. if ((flag & CL_MAKE_SHARED) && !mnt->mnt_group_id) {
  506. int err = mnt_alloc_group_id(mnt);
  507. if (err)
  508. goto out_free;
  509. }
  510. mnt->mnt_flags = old->mnt_flags;
  511. atomic_inc(&sb->s_active);
  512. mnt->mnt_sb = sb;
  513. mnt->mnt_root = dget(root);
  514. mnt->mnt_mountpoint = mnt->mnt_root;
  515. mnt->mnt_parent = mnt;
  516. if (flag & CL_SLAVE) {
  517. list_add(&mnt->mnt_slave, &old->mnt_slave_list);
  518. mnt->mnt_master = old;
  519. CLEAR_MNT_SHARED(mnt);
  520. } else if (!(flag & CL_PRIVATE)) {
  521. if ((flag & CL_PROPAGATION) || IS_MNT_SHARED(old))
  522. list_add(&mnt->mnt_share, &old->mnt_share);
  523. if (IS_MNT_SLAVE(old))
  524. list_add(&mnt->mnt_slave, &old->mnt_slave);
  525. mnt->mnt_master = old->mnt_master;
  526. }
  527. if (flag & CL_MAKE_SHARED)
  528. set_mnt_shared(mnt);
  529. /* stick the duplicate mount on the same expiry list
  530. * as the original if that was on one */
  531. if (flag & CL_EXPIRE) {
  532. if (!list_empty(&old->mnt_expire))
  533. list_add(&mnt->mnt_expire, &old->mnt_expire);
  534. }
  535. }
  536. return mnt;
  537. out_free:
  538. free_vfsmnt(mnt);
  539. return NULL;
  540. }
  541. static inline void __mntput(struct vfsmount *mnt)
  542. {
  543. int cpu;
  544. struct super_block *sb = mnt->mnt_sb;
  545. /*
  546. * We don't have to hold all of the locks at the
  547. * same time here because we know that we're the
  548. * last reference to mnt and that no new writers
  549. * can come in.
  550. */
  551. for_each_possible_cpu(cpu) {
  552. struct mnt_writer *cpu_writer = &per_cpu(mnt_writers, cpu);
  553. spin_lock(&cpu_writer->lock);
  554. if (cpu_writer->mnt != mnt) {
  555. spin_unlock(&cpu_writer->lock);
  556. continue;
  557. }
  558. atomic_add(cpu_writer->count, &mnt->__mnt_writers);
  559. cpu_writer->count = 0;
  560. /*
  561. * Might as well do this so that no one
  562. * ever sees the pointer and expects
  563. * it to be valid.
  564. */
  565. cpu_writer->mnt = NULL;
  566. spin_unlock(&cpu_writer->lock);
  567. }
  568. /*
  569. * This probably indicates that somebody messed
  570. * up a mnt_want/drop_write() pair. If this
  571. * happens, the filesystem was probably unable
  572. * to make r/w->r/o transitions.
  573. */
  574. WARN_ON(atomic_read(&mnt->__mnt_writers));
  575. dput(mnt->mnt_root);
  576. free_vfsmnt(mnt);
  577. deactivate_super(sb);
  578. }
  579. void mntput_no_expire(struct vfsmount *mnt)
  580. {
  581. repeat:
  582. if (atomic_dec_and_lock(&mnt->mnt_count, &vfsmount_lock)) {
  583. if (likely(!mnt->mnt_pinned)) {
  584. spin_unlock(&vfsmount_lock);
  585. __mntput(mnt);
  586. return;
  587. }
  588. atomic_add(mnt->mnt_pinned + 1, &mnt->mnt_count);
  589. mnt->mnt_pinned = 0;
  590. spin_unlock(&vfsmount_lock);
  591. acct_auto_close_mnt(mnt);
  592. security_sb_umount_close(mnt);
  593. goto repeat;
  594. }
  595. }
  596. EXPORT_SYMBOL(mntput_no_expire);
  597. void mnt_pin(struct vfsmount *mnt)
  598. {
  599. spin_lock(&vfsmount_lock);
  600. mnt->mnt_pinned++;
  601. spin_unlock(&vfsmount_lock);
  602. }
  603. EXPORT_SYMBOL(mnt_pin);
  604. void mnt_unpin(struct vfsmount *mnt)
  605. {
  606. spin_lock(&vfsmount_lock);
  607. if (mnt->mnt_pinned) {
  608. atomic_inc(&mnt->mnt_count);
  609. mnt->mnt_pinned--;
  610. }
  611. spin_unlock(&vfsmount_lock);
  612. }
  613. EXPORT_SYMBOL(mnt_unpin);
  614. static inline void mangle(struct seq_file *m, const char *s)
  615. {
  616. seq_escape(m, s, " \t\n\\");
  617. }
  618. /*
  619. * Simple .show_options callback for filesystems which don't want to
  620. * implement more complex mount option showing.
  621. *
  622. * See also save_mount_options().
  623. */
  624. int generic_show_options(struct seq_file *m, struct vfsmount *mnt)
  625. {
  626. const char *options = mnt->mnt_sb->s_options;
  627. if (options != NULL && options[0]) {
  628. seq_putc(m, ',');
  629. mangle(m, options);
  630. }
  631. return 0;
  632. }
  633. EXPORT_SYMBOL(generic_show_options);
  634. /*
  635. * If filesystem uses generic_show_options(), this function should be
  636. * called from the fill_super() callback.
  637. *
  638. * The .remount_fs callback usually needs to be handled in a special
  639. * way, to make sure, that previous options are not overwritten if the
  640. * remount fails.
  641. *
  642. * Also note, that if the filesystem's .remount_fs function doesn't
  643. * reset all options to their default value, but changes only newly
  644. * given options, then the displayed options will not reflect reality
  645. * any more.
  646. */
  647. void save_mount_options(struct super_block *sb, char *options)
  648. {
  649. kfree(sb->s_options);
  650. sb->s_options = kstrdup(options, GFP_KERNEL);
  651. }
  652. EXPORT_SYMBOL(save_mount_options);
  653. #ifdef CONFIG_PROC_FS
  654. /* iterator */
  655. static void *m_start(struct seq_file *m, loff_t *pos)
  656. {
  657. struct proc_mounts *p = m->private;
  658. down_read(&namespace_sem);
  659. return seq_list_start(&p->ns->list, *pos);
  660. }
  661. static void *m_next(struct seq_file *m, void *v, loff_t *pos)
  662. {
  663. struct proc_mounts *p = m->private;
  664. return seq_list_next(v, &p->ns->list, pos);
  665. }
  666. static void m_stop(struct seq_file *m, void *v)
  667. {
  668. up_read(&namespace_sem);
  669. }
  670. struct proc_fs_info {
  671. int flag;
  672. const char *str;
  673. };
  674. static int show_sb_opts(struct seq_file *m, struct super_block *sb)
  675. {
  676. static const struct proc_fs_info fs_info[] = {
  677. { MS_SYNCHRONOUS, ",sync" },
  678. { MS_DIRSYNC, ",dirsync" },
  679. { MS_MANDLOCK, ",mand" },
  680. { 0, NULL }
  681. };
  682. const struct proc_fs_info *fs_infop;
  683. for (fs_infop = fs_info; fs_infop->flag; fs_infop++) {
  684. if (sb->s_flags & fs_infop->flag)
  685. seq_puts(m, fs_infop->str);
  686. }
  687. return security_sb_show_options(m, sb);
  688. }
  689. static void show_mnt_opts(struct seq_file *m, struct vfsmount *mnt)
  690. {
  691. static const struct proc_fs_info mnt_info[] = {
  692. { MNT_NOSUID, ",nosuid" },
  693. { MNT_NODEV, ",nodev" },
  694. { MNT_NOEXEC, ",noexec" },
  695. { MNT_NOATIME, ",noatime" },
  696. { MNT_NODIRATIME, ",nodiratime" },
  697. { MNT_RELATIME, ",relatime" },
  698. { MNT_STRICTATIME, ",strictatime" },
  699. { 0, NULL }
  700. };
  701. const struct proc_fs_info *fs_infop;
  702. for (fs_infop = mnt_info; fs_infop->flag; fs_infop++) {
  703. if (mnt->mnt_flags & fs_infop->flag)
  704. seq_puts(m, fs_infop->str);
  705. }
  706. }
  707. static void show_type(struct seq_file *m, struct super_block *sb)
  708. {
  709. mangle(m, sb->s_type->name);
  710. if (sb->s_subtype && sb->s_subtype[0]) {
  711. seq_putc(m, '.');
  712. mangle(m, sb->s_subtype);
  713. }
  714. }
  715. static int show_vfsmnt(struct seq_file *m, void *v)
  716. {
  717. struct vfsmount *mnt = list_entry(v, struct vfsmount, mnt_list);
  718. int err = 0;
  719. struct path mnt_path = { .dentry = mnt->mnt_root, .mnt = mnt };
  720. mangle(m, mnt->mnt_devname ? mnt->mnt_devname : "none");
  721. seq_putc(m, ' ');
  722. seq_path(m, &mnt_path, " \t\n\\");
  723. seq_putc(m, ' ');
  724. show_type(m, mnt->mnt_sb);
  725. seq_puts(m, __mnt_is_readonly(mnt) ? " ro" : " rw");
  726. err = show_sb_opts(m, mnt->mnt_sb);
  727. if (err)
  728. goto out;
  729. show_mnt_opts(m, mnt);
  730. if (mnt->mnt_sb->s_op->show_options)
  731. err = mnt->mnt_sb->s_op->show_options(m, mnt);
  732. seq_puts(m, " 0 0\n");
  733. out:
  734. return err;
  735. }
  736. const struct seq_operations mounts_op = {
  737. .start = m_start,
  738. .next = m_next,
  739. .stop = m_stop,
  740. .show = show_vfsmnt
  741. };
  742. static int show_mountinfo(struct seq_file *m, void *v)
  743. {
  744. struct proc_mounts *p = m->private;
  745. struct vfsmount *mnt = list_entry(v, struct vfsmount, mnt_list);
  746. struct super_block *sb = mnt->mnt_sb;
  747. struct path mnt_path = { .dentry = mnt->mnt_root, .mnt = mnt };
  748. struct path root = p->root;
  749. int err = 0;
  750. seq_printf(m, "%i %i %u:%u ", mnt->mnt_id, mnt->mnt_parent->mnt_id,
  751. MAJOR(sb->s_dev), MINOR(sb->s_dev));
  752. seq_dentry(m, mnt->mnt_root, " \t\n\\");
  753. seq_putc(m, ' ');
  754. seq_path_root(m, &mnt_path, &root, " \t\n\\");
  755. if (root.mnt != p->root.mnt || root.dentry != p->root.dentry) {
  756. /*
  757. * Mountpoint is outside root, discard that one. Ugly,
  758. * but less so than trying to do that in iterator in a
  759. * race-free way (due to renames).
  760. */
  761. return SEQ_SKIP;
  762. }
  763. seq_puts(m, mnt->mnt_flags & MNT_READONLY ? " ro" : " rw");
  764. show_mnt_opts(m, mnt);
  765. /* Tagged fields ("foo:X" or "bar") */
  766. if (IS_MNT_SHARED(mnt))
  767. seq_printf(m, " shared:%i", mnt->mnt_group_id);
  768. if (IS_MNT_SLAVE(mnt)) {
  769. int master = mnt->mnt_master->mnt_group_id;
  770. int dom = get_dominating_id(mnt, &p->root);
  771. seq_printf(m, " master:%i", master);
  772. if (dom && dom != master)
  773. seq_printf(m, " propagate_from:%i", dom);
  774. }
  775. if (IS_MNT_UNBINDABLE(mnt))
  776. seq_puts(m, " unbindable");
  777. /* Filesystem specific data */
  778. seq_puts(m, " - ");
  779. show_type(m, sb);
  780. seq_putc(m, ' ');
  781. mangle(m, mnt->mnt_devname ? mnt->mnt_devname : "none");
  782. seq_puts(m, sb->s_flags & MS_RDONLY ? " ro" : " rw");
  783. err = show_sb_opts(m, sb);
  784. if (err)
  785. goto out;
  786. if (sb->s_op->show_options)
  787. err = sb->s_op->show_options(m, mnt);
  788. seq_putc(m, '\n');
  789. out:
  790. return err;
  791. }
  792. const struct seq_operations mountinfo_op = {
  793. .start = m_start,
  794. .next = m_next,
  795. .stop = m_stop,
  796. .show = show_mountinfo,
  797. };
  798. static int show_vfsstat(struct seq_file *m, void *v)
  799. {
  800. struct vfsmount *mnt = list_entry(v, struct vfsmount, mnt_list);
  801. struct path mnt_path = { .dentry = mnt->mnt_root, .mnt = mnt };
  802. int err = 0;
  803. /* device */
  804. if (mnt->mnt_devname) {
  805. seq_puts(m, "device ");
  806. mangle(m, mnt->mnt_devname);
  807. } else
  808. seq_puts(m, "no device");
  809. /* mount point */
  810. seq_puts(m, " mounted on ");
  811. seq_path(m, &mnt_path, " \t\n\\");
  812. seq_putc(m, ' ');
  813. /* file system type */
  814. seq_puts(m, "with fstype ");
  815. show_type(m, mnt->mnt_sb);
  816. /* optional statistics */
  817. if (mnt->mnt_sb->s_op->show_stats) {
  818. seq_putc(m, ' ');
  819. err = mnt->mnt_sb->s_op->show_stats(m, mnt);
  820. }
  821. seq_putc(m, '\n');
  822. return err;
  823. }
  824. const struct seq_operations mountstats_op = {
  825. .start = m_start,
  826. .next = m_next,
  827. .stop = m_stop,
  828. .show = show_vfsstat,
  829. };
  830. #endif /* CONFIG_PROC_FS */
  831. /**
  832. * may_umount_tree - check if a mount tree is busy
  833. * @mnt: root of mount tree
  834. *
  835. * This is called to check if a tree of mounts has any
  836. * open files, pwds, chroots or sub mounts that are
  837. * busy.
  838. */
  839. int may_umount_tree(struct vfsmount *mnt)
  840. {
  841. int actual_refs = 0;
  842. int minimum_refs = 0;
  843. struct vfsmount *p;
  844. spin_lock(&vfsmount_lock);
  845. for (p = mnt; p; p = next_mnt(p, mnt)) {
  846. actual_refs += atomic_read(&p->mnt_count);
  847. minimum_refs += 2;
  848. }
  849. spin_unlock(&vfsmount_lock);
  850. if (actual_refs > minimum_refs)
  851. return 0;
  852. return 1;
  853. }
  854. EXPORT_SYMBOL(may_umount_tree);
  855. /**
  856. * may_umount - check if a mount point is busy
  857. * @mnt: root of mount
  858. *
  859. * This is called to check if a mount point has any
  860. * open files, pwds, chroots or sub mounts. If the
  861. * mount has sub mounts this will return busy
  862. * regardless of whether the sub mounts are busy.
  863. *
  864. * Doesn't take quota and stuff into account. IOW, in some cases it will
  865. * give false negatives. The main reason why it's here is that we need
  866. * a non-destructive way to look for easily umountable filesystems.
  867. */
  868. int may_umount(struct vfsmount *mnt)
  869. {
  870. int ret = 1;
  871. spin_lock(&vfsmount_lock);
  872. if (propagate_mount_busy(mnt, 2))
  873. ret = 0;
  874. spin_unlock(&vfsmount_lock);
  875. return ret;
  876. }
  877. EXPORT_SYMBOL(may_umount);
  878. void release_mounts(struct list_head *head)
  879. {
  880. struct vfsmount *mnt;
  881. while (!list_empty(head)) {
  882. mnt = list_first_entry(head, struct vfsmount, mnt_hash);
  883. list_del_init(&mnt->mnt_hash);
  884. if (mnt->mnt_parent != mnt) {
  885. struct dentry *dentry;
  886. struct vfsmount *m;
  887. spin_lock(&vfsmount_lock);
  888. dentry = mnt->mnt_mountpoint;
  889. m = mnt->mnt_parent;
  890. mnt->mnt_mountpoint = mnt->mnt_root;
  891. mnt->mnt_parent = mnt;
  892. m->mnt_ghosts--;
  893. spin_unlock(&vfsmount_lock);
  894. dput(dentry);
  895. mntput(m);
  896. }
  897. mntput(mnt);
  898. }
  899. }
  900. void umount_tree(struct vfsmount *mnt, int propagate, struct list_head *kill)
  901. {
  902. struct vfsmount *p;
  903. for (p = mnt; p; p = next_mnt(p, mnt))
  904. list_move(&p->mnt_hash, kill);
  905. if (propagate)
  906. propagate_umount(kill);
  907. list_for_each_entry(p, kill, mnt_hash) {
  908. list_del_init(&p->mnt_expire);
  909. list_del_init(&p->mnt_list);
  910. __touch_mnt_namespace(p->mnt_ns);
  911. p->mnt_ns = NULL;
  912. list_del_init(&p->mnt_child);
  913. if (p->mnt_parent != p) {
  914. p->mnt_parent->mnt_ghosts++;
  915. p->mnt_mountpoint->d_mounted--;
  916. }
  917. change_mnt_propagation(p, MS_PRIVATE);
  918. }
  919. }
  920. static void shrink_submounts(struct vfsmount *mnt, struct list_head *umounts);
  921. static int do_umount(struct vfsmount *mnt, int flags)
  922. {
  923. struct super_block *sb = mnt->mnt_sb;
  924. int retval;
  925. LIST_HEAD(umount_list);
  926. retval = security_sb_umount(mnt, flags);
  927. if (retval)
  928. return retval;
  929. /*
  930. * Allow userspace to request a mountpoint be expired rather than
  931. * unmounting unconditionally. Unmount only happens if:
  932. * (1) the mark is already set (the mark is cleared by mntput())
  933. * (2) the usage count == 1 [parent vfsmount] + 1 [sys_umount]
  934. */
  935. if (flags & MNT_EXPIRE) {
  936. if (mnt == current->fs->root.mnt ||
  937. flags & (MNT_FORCE | MNT_DETACH))
  938. return -EINVAL;
  939. if (atomic_read(&mnt->mnt_count) != 2)
  940. return -EBUSY;
  941. if (!xchg(&mnt->mnt_expiry_mark, 1))
  942. return -EAGAIN;
  943. }
  944. /*
  945. * If we may have to abort operations to get out of this
  946. * mount, and they will themselves hold resources we must
  947. * allow the fs to do things. In the Unix tradition of
  948. * 'Gee thats tricky lets do it in userspace' the umount_begin
  949. * might fail to complete on the first run through as other tasks
  950. * must return, and the like. Thats for the mount program to worry
  951. * about for the moment.
  952. */
  953. if (flags & MNT_FORCE && sb->s_op->umount_begin) {
  954. lock_kernel();
  955. sb->s_op->umount_begin(sb);
  956. unlock_kernel();
  957. }
  958. /*
  959. * No sense to grab the lock for this test, but test itself looks
  960. * somewhat bogus. Suggestions for better replacement?
  961. * Ho-hum... In principle, we might treat that as umount + switch
  962. * to rootfs. GC would eventually take care of the old vfsmount.
  963. * Actually it makes sense, especially if rootfs would contain a
  964. * /reboot - static binary that would close all descriptors and
  965. * call reboot(9). Then init(8) could umount root and exec /reboot.
  966. */
  967. if (mnt == current->fs->root.mnt && !(flags & MNT_DETACH)) {
  968. /*
  969. * Special case for "unmounting" root ...
  970. * we just try to remount it readonly.
  971. */
  972. down_write(&sb->s_umount);
  973. if (!(sb->s_flags & MS_RDONLY)) {
  974. lock_kernel();
  975. retval = do_remount_sb(sb, MS_RDONLY, NULL, 0);
  976. unlock_kernel();
  977. }
  978. up_write(&sb->s_umount);
  979. return retval;
  980. }
  981. down_write(&namespace_sem);
  982. spin_lock(&vfsmount_lock);
  983. event++;
  984. if (!(flags & MNT_DETACH))
  985. shrink_submounts(mnt, &umount_list);
  986. retval = -EBUSY;
  987. if (flags & MNT_DETACH || !propagate_mount_busy(mnt, 2)) {
  988. if (!list_empty(&mnt->mnt_list))
  989. umount_tree(mnt, 1, &umount_list);
  990. retval = 0;
  991. }
  992. spin_unlock(&vfsmount_lock);
  993. if (retval)
  994. security_sb_umount_busy(mnt);
  995. up_write(&namespace_sem);
  996. release_mounts(&umount_list);
  997. return retval;
  998. }
  999. /*
  1000. * Now umount can handle mount points as well as block devices.
  1001. * This is important for filesystems which use unnamed block devices.
  1002. *
  1003. * We now support a flag for forced unmount like the other 'big iron'
  1004. * unixes. Our API is identical to OSF/1 to avoid making a mess of AMD
  1005. */
  1006. SYSCALL_DEFINE2(umount, char __user *, name, int, flags)
  1007. {
  1008. struct path path;
  1009. int retval;
  1010. retval = user_path(name, &path);
  1011. if (retval)
  1012. goto out;
  1013. retval = -EINVAL;
  1014. if (path.dentry != path.mnt->mnt_root)
  1015. goto dput_and_out;
  1016. if (!check_mnt(path.mnt))
  1017. goto dput_and_out;
  1018. retval = -EPERM;
  1019. if (!capable(CAP_SYS_ADMIN))
  1020. goto dput_and_out;
  1021. retval = do_umount(path.mnt, flags);
  1022. dput_and_out:
  1023. /* we mustn't call path_put() as that would clear mnt_expiry_mark */
  1024. dput(path.dentry);
  1025. mntput_no_expire(path.mnt);
  1026. out:
  1027. return retval;
  1028. }
  1029. #ifdef __ARCH_WANT_SYS_OLDUMOUNT
  1030. /*
  1031. * The 2.0 compatible umount. No flags.
  1032. */
  1033. SYSCALL_DEFINE1(oldumount, char __user *, name)
  1034. {
  1035. return sys_umount(name, 0);
  1036. }
  1037. #endif
  1038. static int mount_is_safe(struct path *path)
  1039. {
  1040. if (capable(CAP_SYS_ADMIN))
  1041. return 0;
  1042. return -EPERM;
  1043. #ifdef notyet
  1044. if (S_ISLNK(path->dentry->d_inode->i_mode))
  1045. return -EPERM;
  1046. if (path->dentry->d_inode->i_mode & S_ISVTX) {
  1047. if (current_uid() != path->dentry->d_inode->i_uid)
  1048. return -EPERM;
  1049. }
  1050. if (inode_permission(path->dentry->d_inode, MAY_WRITE))
  1051. return -EPERM;
  1052. return 0;
  1053. #endif
  1054. }
  1055. struct vfsmount *copy_tree(struct vfsmount *mnt, struct dentry *dentry,
  1056. int flag)
  1057. {
  1058. struct vfsmount *res, *p, *q, *r, *s;
  1059. struct path path;
  1060. if (!(flag & CL_COPY_ALL) && IS_MNT_UNBINDABLE(mnt))
  1061. return NULL;
  1062. res = q = clone_mnt(mnt, dentry, flag);
  1063. if (!q)
  1064. goto Enomem;
  1065. q->mnt_mountpoint = mnt->mnt_mountpoint;
  1066. p = mnt;
  1067. list_for_each_entry(r, &mnt->mnt_mounts, mnt_child) {
  1068. if (!is_subdir(r->mnt_mountpoint, dentry))
  1069. continue;
  1070. for (s = r; s; s = next_mnt(s, r)) {
  1071. if (!(flag & CL_COPY_ALL) && IS_MNT_UNBINDABLE(s)) {
  1072. s = skip_mnt_tree(s);
  1073. continue;
  1074. }
  1075. while (p != s->mnt_parent) {
  1076. p = p->mnt_parent;
  1077. q = q->mnt_parent;
  1078. }
  1079. p = s;
  1080. path.mnt = q;
  1081. path.dentry = p->mnt_mountpoint;
  1082. q = clone_mnt(p, p->mnt_root, flag);
  1083. if (!q)
  1084. goto Enomem;
  1085. spin_lock(&vfsmount_lock);
  1086. list_add_tail(&q->mnt_list, &res->mnt_list);
  1087. attach_mnt(q, &path);
  1088. spin_unlock(&vfsmount_lock);
  1089. }
  1090. }
  1091. return res;
  1092. Enomem:
  1093. if (res) {
  1094. LIST_HEAD(umount_list);
  1095. spin_lock(&vfsmount_lock);
  1096. umount_tree(res, 0, &umount_list);
  1097. spin_unlock(&vfsmount_lock);
  1098. release_mounts(&umount_list);
  1099. }
  1100. return NULL;
  1101. }
  1102. struct vfsmount *collect_mounts(struct vfsmount *mnt, struct dentry *dentry)
  1103. {
  1104. struct vfsmount *tree;
  1105. down_write(&namespace_sem);
  1106. tree = copy_tree(mnt, dentry, CL_COPY_ALL | CL_PRIVATE);
  1107. up_write(&namespace_sem);
  1108. return tree;
  1109. }
  1110. void drop_collected_mounts(struct vfsmount *mnt)
  1111. {
  1112. LIST_HEAD(umount_list);
  1113. down_write(&namespace_sem);
  1114. spin_lock(&vfsmount_lock);
  1115. umount_tree(mnt, 0, &umount_list);
  1116. spin_unlock(&vfsmount_lock);
  1117. up_write(&namespace_sem);
  1118. release_mounts(&umount_list);
  1119. }
  1120. static void cleanup_group_ids(struct vfsmount *mnt, struct vfsmount *end)
  1121. {
  1122. struct vfsmount *p;
  1123. for (p = mnt; p != end; p = next_mnt(p, mnt)) {
  1124. if (p->mnt_group_id && !IS_MNT_SHARED(p))
  1125. mnt_release_group_id(p);
  1126. }
  1127. }
  1128. static int invent_group_ids(struct vfsmount *mnt, bool recurse)
  1129. {
  1130. struct vfsmount *p;
  1131. for (p = mnt; p; p = recurse ? next_mnt(p, mnt) : NULL) {
  1132. if (!p->mnt_group_id && !IS_MNT_SHARED(p)) {
  1133. int err = mnt_alloc_group_id(p);
  1134. if (err) {
  1135. cleanup_group_ids(mnt, p);
  1136. return err;
  1137. }
  1138. }
  1139. }
  1140. return 0;
  1141. }
  1142. /*
  1143. * @source_mnt : mount tree to be attached
  1144. * @nd : place the mount tree @source_mnt is attached
  1145. * @parent_nd : if non-null, detach the source_mnt from its parent and
  1146. * store the parent mount and mountpoint dentry.
  1147. * (done when source_mnt is moved)
  1148. *
  1149. * NOTE: in the table below explains the semantics when a source mount
  1150. * of a given type is attached to a destination mount of a given type.
  1151. * ---------------------------------------------------------------------------
  1152. * | BIND MOUNT OPERATION |
  1153. * |**************************************************************************
  1154. * | source-->| shared | private | slave | unbindable |
  1155. * | dest | | | | |
  1156. * | | | | | | |
  1157. * | v | | | | |
  1158. * |**************************************************************************
  1159. * | shared | shared (++) | shared (+) | shared(+++)| invalid |
  1160. * | | | | | |
  1161. * |non-shared| shared (+) | private | slave (*) | invalid |
  1162. * ***************************************************************************
  1163. * A bind operation clones the source mount and mounts the clone on the
  1164. * destination mount.
  1165. *
  1166. * (++) the cloned mount is propagated to all the mounts in the propagation
  1167. * tree of the destination mount and the cloned mount is added to
  1168. * the peer group of the source mount.
  1169. * (+) the cloned mount is created under the destination mount and is marked
  1170. * as shared. The cloned mount is added to the peer group of the source
  1171. * mount.
  1172. * (+++) the mount is propagated to all the mounts in the propagation tree
  1173. * of the destination mount and the cloned mount is made slave
  1174. * of the same master as that of the source mount. The cloned mount
  1175. * is marked as 'shared and slave'.
  1176. * (*) the cloned mount is made a slave of the same master as that of the
  1177. * source mount.
  1178. *
  1179. * ---------------------------------------------------------------------------
  1180. * | MOVE MOUNT OPERATION |
  1181. * |**************************************************************************
  1182. * | source-->| shared | private | slave | unbindable |
  1183. * | dest | | | | |
  1184. * | | | | | | |
  1185. * | v | | | | |
  1186. * |**************************************************************************
  1187. * | shared | shared (+) | shared (+) | shared(+++) | invalid |
  1188. * | | | | | |
  1189. * |non-shared| shared (+*) | private | slave (*) | unbindable |
  1190. * ***************************************************************************
  1191. *
  1192. * (+) the mount is moved to the destination. And is then propagated to
  1193. * all the mounts in the propagation tree of the destination mount.
  1194. * (+*) the mount is moved to the destination.
  1195. * (+++) the mount is moved to the destination and is then propagated to
  1196. * all the mounts belonging to the destination mount's propagation tree.
  1197. * the mount is marked as 'shared and slave'.
  1198. * (*) the mount continues to be a slave at the new location.
  1199. *
  1200. * if the source mount is a tree, the operations explained above is
  1201. * applied to each mount in the tree.
  1202. * Must be called without spinlocks held, since this function can sleep
  1203. * in allocations.
  1204. */
  1205. static int attach_recursive_mnt(struct vfsmount *source_mnt,
  1206. struct path *path, struct path *parent_path)
  1207. {
  1208. LIST_HEAD(tree_list);
  1209. struct vfsmount *dest_mnt = path->mnt;
  1210. struct dentry *dest_dentry = path->dentry;
  1211. struct vfsmount *child, *p;
  1212. int err;
  1213. if (IS_MNT_SHARED(dest_mnt)) {
  1214. err = invent_group_ids(source_mnt, true);
  1215. if (err)
  1216. goto out;
  1217. }
  1218. err = propagate_mnt(dest_mnt, dest_dentry, source_mnt, &tree_list);
  1219. if (err)
  1220. goto out_cleanup_ids;
  1221. if (IS_MNT_SHARED(dest_mnt)) {
  1222. for (p = source_mnt; p; p = next_mnt(p, source_mnt))
  1223. set_mnt_shared(p);
  1224. }
  1225. spin_lock(&vfsmount_lock);
  1226. if (parent_path) {
  1227. detach_mnt(source_mnt, parent_path);
  1228. attach_mnt(source_mnt, path);
  1229. touch_mnt_namespace(current->nsproxy->mnt_ns);
  1230. } else {
  1231. mnt_set_mountpoint(dest_mnt, dest_dentry, source_mnt);
  1232. commit_tree(source_mnt);
  1233. }
  1234. list_for_each_entry_safe(child, p, &tree_list, mnt_hash) {
  1235. list_del_init(&child->mnt_hash);
  1236. commit_tree(child);
  1237. }
  1238. spin_unlock(&vfsmount_lock);
  1239. return 0;
  1240. out_cleanup_ids:
  1241. if (IS_MNT_SHARED(dest_mnt))
  1242. cleanup_group_ids(source_mnt, NULL);
  1243. out:
  1244. return err;
  1245. }
  1246. static int graft_tree(struct vfsmount *mnt, struct path *path)
  1247. {
  1248. int err;
  1249. if (mnt->mnt_sb->s_flags & MS_NOUSER)
  1250. return -EINVAL;
  1251. if (S_ISDIR(path->dentry->d_inode->i_mode) !=
  1252. S_ISDIR(mnt->mnt_root->d_inode->i_mode))
  1253. return -ENOTDIR;
  1254. err = -ENOENT;
  1255. mutex_lock(&path->dentry->d_inode->i_mutex);
  1256. if (IS_DEADDIR(path->dentry->d_inode))
  1257. goto out_unlock;
  1258. err = security_sb_check_sb(mnt, path);
  1259. if (err)
  1260. goto out_unlock;
  1261. err = -ENOENT;
  1262. if (IS_ROOT(path->dentry) || !d_unhashed(path->dentry))
  1263. err = attach_recursive_mnt(mnt, path, NULL);
  1264. out_unlock:
  1265. mutex_unlock(&path->dentry->d_inode->i_mutex);
  1266. if (!err)
  1267. security_sb_post_addmount(mnt, path);
  1268. return err;
  1269. }
  1270. /*
  1271. * recursively change the type of the mountpoint.
  1272. */
  1273. static int do_change_type(struct path *path, int flag)
  1274. {
  1275. struct vfsmount *m, *mnt = path->mnt;
  1276. int recurse = flag & MS_REC;
  1277. int type = flag & ~MS_REC;
  1278. int err = 0;
  1279. if (!capable(CAP_SYS_ADMIN))
  1280. return -EPERM;
  1281. if (path->dentry != path->mnt->mnt_root)
  1282. return -EINVAL;
  1283. down_write(&namespace_sem);
  1284. if (type == MS_SHARED) {
  1285. err = invent_group_ids(mnt, recurse);
  1286. if (err)
  1287. goto out_unlock;
  1288. }
  1289. spin_lock(&vfsmount_lock);
  1290. for (m = mnt; m; m = (recurse ? next_mnt(m, mnt) : NULL))
  1291. change_mnt_propagation(m, type);
  1292. spin_unlock(&vfsmount_lock);
  1293. out_unlock:
  1294. up_write(&namespace_sem);
  1295. return err;
  1296. }
  1297. /*
  1298. * do loopback mount.
  1299. */
  1300. static int do_loopback(struct path *path, char *old_name,
  1301. int recurse)
  1302. {
  1303. struct path old_path;
  1304. struct vfsmount *mnt = NULL;
  1305. int err = mount_is_safe(path);
  1306. if (err)
  1307. return err;
  1308. if (!old_name || !*old_name)
  1309. return -EINVAL;
  1310. err = kern_path(old_name, LOOKUP_FOLLOW, &old_path);
  1311. if (err)
  1312. return err;
  1313. down_write(&namespace_sem);
  1314. err = -EINVAL;
  1315. if (IS_MNT_UNBINDABLE(old_path.mnt))
  1316. goto out;
  1317. if (!check_mnt(path->mnt) || !check_mnt(old_path.mnt))
  1318. goto out;
  1319. err = -ENOMEM;
  1320. if (recurse)
  1321. mnt = copy_tree(old_path.mnt, old_path.dentry, 0);
  1322. else
  1323. mnt = clone_mnt(old_path.mnt, old_path.dentry, 0);
  1324. if (!mnt)
  1325. goto out;
  1326. err = graft_tree(mnt, path);
  1327. if (err) {
  1328. LIST_HEAD(umount_list);
  1329. spin_lock(&vfsmount_lock);
  1330. umount_tree(mnt, 0, &umount_list);
  1331. spin_unlock(&vfsmount_lock);
  1332. release_mounts(&umount_list);
  1333. }
  1334. out:
  1335. up_write(&namespace_sem);
  1336. path_put(&old_path);
  1337. return err;
  1338. }
  1339. static int change_mount_flags(struct vfsmount *mnt, int ms_flags)
  1340. {
  1341. int error = 0;
  1342. int readonly_request = 0;
  1343. if (ms_flags & MS_RDONLY)
  1344. readonly_request = 1;
  1345. if (readonly_request == __mnt_is_readonly(mnt))
  1346. return 0;
  1347. if (readonly_request)
  1348. error = mnt_make_readonly(mnt);
  1349. else
  1350. __mnt_unmake_readonly(mnt);
  1351. return error;
  1352. }
  1353. /*
  1354. * change filesystem flags. dir should be a physical root of filesystem.
  1355. * If you've mounted a non-root directory somewhere and want to do remount
  1356. * on it - tough luck.
  1357. */
  1358. static int do_remount(struct path *path, int flags, int mnt_flags,
  1359. void *data)
  1360. {
  1361. int err;
  1362. struct super_block *sb = path->mnt->mnt_sb;
  1363. if (!capable(CAP_SYS_ADMIN))
  1364. return -EPERM;
  1365. if (!check_mnt(path->mnt))
  1366. return -EINVAL;
  1367. if (path->dentry != path->mnt->mnt_root)
  1368. return -EINVAL;
  1369. down_write(&sb->s_umount);
  1370. if (flags & MS_BIND)
  1371. err = change_mount_flags(path->mnt, flags);
  1372. else
  1373. err = do_remount_sb(sb, flags, data, 0);
  1374. if (!err)
  1375. path->mnt->mnt_flags = mnt_flags;
  1376. up_write(&sb->s_umount);
  1377. if (!err) {
  1378. security_sb_post_remount(path->mnt, flags, data);
  1379. spin_lock(&vfsmount_lock);
  1380. touch_mnt_namespace(path->mnt->mnt_ns);
  1381. spin_unlock(&vfsmount_lock);
  1382. }
  1383. return err;
  1384. }
  1385. static inline int tree_contains_unbindable(struct vfsmount *mnt)
  1386. {
  1387. struct vfsmount *p;
  1388. for (p = mnt; p; p = next_mnt(p, mnt)) {
  1389. if (IS_MNT_UNBINDABLE(p))
  1390. return 1;
  1391. }
  1392. return 0;
  1393. }
  1394. static int do_move_mount(struct path *path, char *old_name)
  1395. {
  1396. struct path old_path, parent_path;
  1397. struct vfsmount *p;
  1398. int err = 0;
  1399. if (!capable(CAP_SYS_ADMIN))
  1400. return -EPERM;
  1401. if (!old_name || !*old_name)
  1402. return -EINVAL;
  1403. err = kern_path(old_name, LOOKUP_FOLLOW, &old_path);
  1404. if (err)
  1405. return err;
  1406. down_write(&namespace_sem);
  1407. while (d_mountpoint(path->dentry) &&
  1408. follow_down(&path->mnt, &path->dentry))
  1409. ;
  1410. err = -EINVAL;
  1411. if (!check_mnt(path->mnt) || !check_mnt(old_path.mnt))
  1412. goto out;
  1413. err = -ENOENT;
  1414. mutex_lock(&path->dentry->d_inode->i_mutex);
  1415. if (IS_DEADDIR(path->dentry->d_inode))
  1416. goto out1;
  1417. if (!IS_ROOT(path->dentry) && d_unhashed(path->dentry))
  1418. goto out1;
  1419. err = -EINVAL;
  1420. if (old_path.dentry != old_path.mnt->mnt_root)
  1421. goto out1;
  1422. if (old_path.mnt == old_path.mnt->mnt_parent)
  1423. goto out1;
  1424. if (S_ISDIR(path->dentry->d_inode->i_mode) !=
  1425. S_ISDIR(old_path.dentry->d_inode->i_mode))
  1426. goto out1;
  1427. /*
  1428. * Don't move a mount residing in a shared parent.
  1429. */
  1430. if (old_path.mnt->mnt_parent &&
  1431. IS_MNT_SHARED(old_path.mnt->mnt_parent))
  1432. goto out1;
  1433. /*
  1434. * Don't move a mount tree containing unbindable mounts to a destination
  1435. * mount which is shared.
  1436. */
  1437. if (IS_MNT_SHARED(path->mnt) &&
  1438. tree_contains_unbindable(old_path.mnt))
  1439. goto out1;
  1440. err = -ELOOP;
  1441. for (p = path->mnt; p->mnt_parent != p; p = p->mnt_parent)
  1442. if (p == old_path.mnt)
  1443. goto out1;
  1444. err = attach_recursive_mnt(old_path.mnt, path, &parent_path);
  1445. if (err)
  1446. goto out1;
  1447. /* if the mount is moved, it should no longer be expire
  1448. * automatically */
  1449. list_del_init(&old_path.mnt->mnt_expire);
  1450. out1:
  1451. mutex_unlock(&path->dentry->d_inode->i_mutex);
  1452. out:
  1453. up_write(&namespace_sem);
  1454. if (!err)
  1455. path_put(&parent_path);
  1456. path_put(&old_path);
  1457. return err;
  1458. }
  1459. /*
  1460. * create a new mount for userspace and request it to be added into the
  1461. * namespace's tree
  1462. */
  1463. static int do_new_mount(struct path *path, char *type, int flags,
  1464. int mnt_flags, char *name, void *data)
  1465. {
  1466. struct vfsmount *mnt;
  1467. if (!type || !memchr(type, 0, PAGE_SIZE))
  1468. return -EINVAL;
  1469. /* we need capabilities... */
  1470. if (!capable(CAP_SYS_ADMIN))
  1471. return -EPERM;
  1472. mnt = do_kern_mount(type, flags, name, data);
  1473. if (IS_ERR(mnt))
  1474. return PTR_ERR(mnt);
  1475. return do_add_mount(mnt, path, mnt_flags, NULL);
  1476. }
  1477. /*
  1478. * add a mount into a namespace's mount tree
  1479. * - provide the option of adding the new mount to an expiration list
  1480. */
  1481. int do_add_mount(struct vfsmount *newmnt, struct path *path,
  1482. int mnt_flags, struct list_head *fslist)
  1483. {
  1484. int err;
  1485. down_write(&namespace_sem);
  1486. /* Something was mounted here while we slept */
  1487. while (d_mountpoint(path->dentry) &&
  1488. follow_down(&path->mnt, &path->dentry))
  1489. ;
  1490. err = -EINVAL;
  1491. if (!check_mnt(path->mnt))
  1492. goto unlock;
  1493. /* Refuse the same filesystem on the same mount point */
  1494. err = -EBUSY;
  1495. if (path->mnt->mnt_sb == newmnt->mnt_sb &&
  1496. path->mnt->mnt_root == path->dentry)
  1497. goto unlock;
  1498. err = -EINVAL;
  1499. if (S_ISLNK(newmnt->mnt_root->d_inode->i_mode))
  1500. goto unlock;
  1501. newmnt->mnt_flags = mnt_flags;
  1502. if ((err = graft_tree(newmnt, path)))
  1503. goto unlock;
  1504. if (fslist) /* add to the specified expiration list */
  1505. list_add_tail(&newmnt->mnt_expire, fslist);
  1506. up_write(&namespace_sem);
  1507. return 0;
  1508. unlock:
  1509. up_write(&namespace_sem);
  1510. mntput(newmnt);
  1511. return err;
  1512. }
  1513. EXPORT_SYMBOL_GPL(do_add_mount);
  1514. /*
  1515. * process a list of expirable mountpoints with the intent of discarding any
  1516. * mountpoints that aren't in use and haven't been touched since last we came
  1517. * here
  1518. */
  1519. void mark_mounts_for_expiry(struct list_head *mounts)
  1520. {
  1521. struct vfsmount *mnt, *next;
  1522. LIST_HEAD(graveyard);
  1523. LIST_HEAD(umounts);
  1524. if (list_empty(mounts))
  1525. return;
  1526. down_write(&namespace_sem);
  1527. spin_lock(&vfsmount_lock);
  1528. /* extract from the expiration list every vfsmount that matches the
  1529. * following criteria:
  1530. * - only referenced by its parent vfsmount
  1531. * - still marked for expiry (marked on the last call here; marks are
  1532. * cleared by mntput())
  1533. */
  1534. list_for_each_entry_safe(mnt, next, mounts, mnt_expire) {
  1535. if (!xchg(&mnt->mnt_expiry_mark, 1) ||
  1536. propagate_mount_busy(mnt, 1))
  1537. continue;
  1538. list_move(&mnt->mnt_expire, &graveyard);
  1539. }
  1540. while (!list_empty(&graveyard)) {
  1541. mnt = list_first_entry(&graveyard, struct vfsmount, mnt_expire);
  1542. touch_mnt_namespace(mnt->mnt_ns);
  1543. umount_tree(mnt, 1, &umounts);
  1544. }
  1545. spin_unlock(&vfsmount_lock);
  1546. up_write(&namespace_sem);
  1547. release_mounts(&umounts);
  1548. }
  1549. EXPORT_SYMBOL_GPL(mark_mounts_for_expiry);
  1550. /*
  1551. * Ripoff of 'select_parent()'
  1552. *
  1553. * search the list of submounts for a given mountpoint, and move any
  1554. * shrinkable submounts to the 'graveyard' list.
  1555. */
  1556. static int select_submounts(struct vfsmount *parent, struct list_head *graveyard)
  1557. {
  1558. struct vfsmount *this_parent = parent;
  1559. struct list_head *next;
  1560. int found = 0;
  1561. repeat:
  1562. next = this_parent->mnt_mounts.next;
  1563. resume:
  1564. while (next != &this_parent->mnt_mounts) {
  1565. struct list_head *tmp = next;
  1566. struct vfsmount *mnt = list_entry(tmp, struct vfsmount, mnt_child);
  1567. next = tmp->next;
  1568. if (!(mnt->mnt_flags & MNT_SHRINKABLE))
  1569. continue;
  1570. /*
  1571. * Descend a level if the d_mounts list is non-empty.
  1572. */
  1573. if (!list_empty(&mnt->mnt_mounts)) {
  1574. this_parent = mnt;
  1575. goto repeat;
  1576. }
  1577. if (!propagate_mount_busy(mnt, 1)) {
  1578. list_move_tail(&mnt->mnt_expire, graveyard);
  1579. found++;
  1580. }
  1581. }
  1582. /*
  1583. * All done at this level ... ascend and resume the search
  1584. */
  1585. if (this_parent != parent) {
  1586. next = this_parent->mnt_child.next;
  1587. this_parent = this_parent->mnt_parent;
  1588. goto resume;
  1589. }
  1590. return found;
  1591. }
  1592. /*
  1593. * process a list of expirable mountpoints with the intent of discarding any
  1594. * submounts of a specific parent mountpoint
  1595. */
  1596. static void shrink_submounts(struct vfsmount *mnt, struct list_head *umounts)
  1597. {
  1598. LIST_HEAD(graveyard);
  1599. struct vfsmount *m;
  1600. /* extract submounts of 'mountpoint' from the expiration list */
  1601. while (select_submounts(mnt, &graveyard)) {
  1602. while (!list_empty(&graveyard)) {
  1603. m = list_first_entry(&graveyard, struct vfsmount,
  1604. mnt_expire);
  1605. touch_mnt_namespace(m->mnt_ns);
  1606. umount_tree(m, 1, umounts);
  1607. }
  1608. }
  1609. }
  1610. /*
  1611. * Some copy_from_user() implementations do not return the exact number of
  1612. * bytes remaining to copy on a fault. But copy_mount_options() requires that.
  1613. * Note that this function differs from copy_from_user() in that it will oops
  1614. * on bad values of `to', rather than returning a short copy.
  1615. */
  1616. static long exact_copy_from_user(void *to, const void __user * from,
  1617. unsigned long n)
  1618. {
  1619. char *t = to;
  1620. const char __user *f = from;
  1621. char c;
  1622. if (!access_ok(VERIFY_READ, from, n))
  1623. return n;
  1624. while (n) {
  1625. if (__get_user(c, f)) {
  1626. memset(t, 0, n);
  1627. break;
  1628. }
  1629. *t++ = c;
  1630. f++;
  1631. n--;
  1632. }
  1633. return n;
  1634. }
  1635. int copy_mount_options(const void __user * data, unsigned long *where)
  1636. {
  1637. int i;
  1638. unsigned long page;
  1639. unsigned long size;
  1640. *where = 0;
  1641. if (!data)
  1642. return 0;
  1643. if (!(page = __get_free_page(GFP_KERNEL)))
  1644. return -ENOMEM;
  1645. /* We only care that *some* data at the address the user
  1646. * gave us is valid. Just in case, we'll zero
  1647. * the remainder of the page.
  1648. */
  1649. /* copy_from_user cannot cross TASK_SIZE ! */
  1650. size = TASK_SIZE - (unsigned long)data;
  1651. if (size > PAGE_SIZE)
  1652. size = PAGE_SIZE;
  1653. i = size - exact_copy_from_user((void *)page, data, size);
  1654. if (!i) {
  1655. free_page(page);
  1656. return -EFAULT;
  1657. }
  1658. if (i != PAGE_SIZE)
  1659. memset((char *)page + i, 0, PAGE_SIZE - i);
  1660. *where = page;
  1661. return 0;
  1662. }
  1663. /*
  1664. * Flags is a 32-bit value that allows up to 31 non-fs dependent flags to
  1665. * be given to the mount() call (ie: read-only, no-dev, no-suid etc).
  1666. *
  1667. * data is a (void *) that can point to any structure up to
  1668. * PAGE_SIZE-1 bytes, which can contain arbitrary fs-dependent
  1669. * information (or be NULL).
  1670. *
  1671. * Pre-0.97 versions of mount() didn't have a flags word.
  1672. * When the flags word was introduced its top half was required
  1673. * to have the magic value 0xC0ED, and this remained so until 2.4.0-test9.
  1674. * Therefore, if this magic number is present, it carries no information
  1675. * and must be discarded.
  1676. */
  1677. long do_mount(char *dev_name, char *dir_name, char *type_page,
  1678. unsigned long flags, void *data_page)
  1679. {
  1680. struct path path;
  1681. int retval = 0;
  1682. int mnt_flags = 0;
  1683. /* Discard magic */
  1684. if ((flags & MS_MGC_MSK) == MS_MGC_VAL)
  1685. flags &= ~MS_MGC_MSK;
  1686. /* Basic sanity checks */
  1687. if (!dir_name || !*dir_name || !memchr(dir_name, 0, PAGE_SIZE))
  1688. return -EINVAL;
  1689. if (dev_name && !memchr(dev_name, 0, PAGE_SIZE))
  1690. return -EINVAL;
  1691. if (data_page)
  1692. ((char *)data_page)[PAGE_SIZE - 1] = 0;
  1693. /* Default to relatime */
  1694. mnt_flags |= MNT_RELATIME;
  1695. /* Separate the per-mountpoint flags */
  1696. if (flags & MS_NOSUID)
  1697. mnt_flags |= MNT_NOSUID;
  1698. if (flags & MS_NODEV)
  1699. mnt_flags |= MNT_NODEV;
  1700. if (flags & MS_NOEXEC)
  1701. mnt_flags |= MNT_NOEXEC;
  1702. if (flags & MS_NOATIME)
  1703. mnt_flags |= MNT_NOATIME;
  1704. if (flags & MS_NODIRATIME)
  1705. mnt_flags |= MNT_NODIRATIME;
  1706. if (flags & MS_STRICTATIME)
  1707. mnt_flags &= ~(MNT_RELATIME | MNT_NOATIME);
  1708. if (flags & MS_RDONLY)
  1709. mnt_flags |= MNT_READONLY;
  1710. flags &= ~(MS_NOSUID | MS_NOEXEC | MS_NODEV | MS_ACTIVE |
  1711. MS_NOATIME | MS_NODIRATIME | MS_RELATIME| MS_KERNMOUNT |
  1712. MS_STRICTATIME);
  1713. /* ... and get the mountpoint */
  1714. retval = kern_path(dir_name, LOOKUP_FOLLOW, &path);
  1715. if (retval)
  1716. return retval;
  1717. retval = security_sb_mount(dev_name, &path,
  1718. type_page, flags, data_page);
  1719. if (retval)
  1720. goto dput_out;
  1721. if (flags & MS_REMOUNT)
  1722. retval = do_remount(&path, flags & ~MS_REMOUNT, mnt_flags,
  1723. data_page);
  1724. else if (flags & MS_BIND)
  1725. retval = do_loopback(&path, dev_name, flags & MS_REC);
  1726. else if (flags & (MS_SHARED | MS_PRIVATE | MS_SLAVE | MS_UNBINDABLE))
  1727. retval = do_change_type(&path, flags);
  1728. else if (flags & MS_MOVE)
  1729. retval = do_move_mount(&path, dev_name);
  1730. else
  1731. retval = do_new_mount(&path, type_page, flags, mnt_flags,
  1732. dev_name, data_page);
  1733. dput_out:
  1734. path_put(&path);
  1735. return retval;
  1736. }
  1737. /*
  1738. * Allocate a new namespace structure and populate it with contents
  1739. * copied from the namespace of the passed in task structure.
  1740. */
  1741. static struct mnt_namespace *dup_mnt_ns(struct mnt_namespace *mnt_ns,
  1742. struct fs_struct *fs)
  1743. {
  1744. struct mnt_namespace *new_ns;
  1745. struct vfsmount *rootmnt = NULL, *pwdmnt = NULL;
  1746. struct vfsmount *p, *q;
  1747. new_ns = kmalloc(sizeof(struct mnt_namespace), GFP_KERNEL);
  1748. if (!new_ns)
  1749. return ERR_PTR(-ENOMEM);
  1750. atomic_set(&new_ns->count, 1);
  1751. INIT_LIST_HEAD(&new_ns->list);
  1752. init_waitqueue_head(&new_ns->poll);
  1753. new_ns->event = 0;
  1754. down_write(&namespace_sem);
  1755. /* First pass: copy the tree topology */
  1756. new_ns->root = copy_tree(mnt_ns->root, mnt_ns->root->mnt_root,
  1757. CL_COPY_ALL | CL_EXPIRE);
  1758. if (!new_ns->root) {
  1759. up_write(&namespace_sem);
  1760. kfree(new_ns);
  1761. return ERR_PTR(-ENOMEM);
  1762. }
  1763. spin_lock(&vfsmount_lock);
  1764. list_add_tail(&new_ns->list, &new_ns->root->mnt_list);
  1765. spin_unlock(&vfsmount_lock);
  1766. /*
  1767. * Second pass: switch the tsk->fs->* elements and mark new vfsmounts
  1768. * as belonging to new namespace. We have already acquired a private
  1769. * fs_struct, so tsk->fs->lock is not needed.
  1770. */
  1771. p = mnt_ns->root;
  1772. q = new_ns->root;
  1773. while (p) {
  1774. q->mnt_ns = new_ns;
  1775. if (fs) {
  1776. if (p == fs->root.mnt) {
  1777. rootmnt = p;
  1778. fs->root.mnt = mntget(q);
  1779. }
  1780. if (p == fs->pwd.mnt) {
  1781. pwdmnt = p;
  1782. fs->pwd.mnt = mntget(q);
  1783. }
  1784. }
  1785. p = next_mnt(p, mnt_ns->root);
  1786. q = next_mnt(q, new_ns->root);
  1787. }
  1788. up_write(&namespace_sem);
  1789. if (rootmnt)
  1790. mntput(rootmnt);
  1791. if (pwdmnt)
  1792. mntput(pwdmnt);
  1793. return new_ns;
  1794. }
  1795. struct mnt_namespace *copy_mnt_ns(unsigned long flags, struct mnt_namespace *ns,
  1796. struct fs_struct *new_fs)
  1797. {
  1798. struct mnt_namespace *new_ns;
  1799. BUG_ON(!ns);
  1800. get_mnt_ns(ns);
  1801. if (!(flags & CLONE_NEWNS))
  1802. return ns;
  1803. new_ns = dup_mnt_ns(ns, new_fs);
  1804. put_mnt_ns(ns);
  1805. return new_ns;
  1806. }
  1807. SYSCALL_DEFINE5(mount, char __user *, dev_name, char __user *, dir_name,
  1808. char __user *, type, unsigned long, flags, void __user *, data)
  1809. {
  1810. int retval;
  1811. unsigned long data_page;
  1812. unsigned long type_page;
  1813. unsigned long dev_page;
  1814. char *dir_page;
  1815. retval = copy_mount_options(type, &type_page);
  1816. if (retval < 0)
  1817. return retval;
  1818. dir_page = getname(dir_name);
  1819. retval = PTR_ERR(dir_page);
  1820. if (IS_ERR(dir_page))
  1821. goto out1;
  1822. retval = copy_mount_options(dev_name, &dev_page);
  1823. if (retval < 0)
  1824. goto out2;
  1825. retval = copy_mount_options(data, &data_page);
  1826. if (retval < 0)
  1827. goto out3;
  1828. lock_kernel();
  1829. retval = do_mount((char *)dev_page, dir_page, (char *)type_page,
  1830. flags, (void *)data_page);
  1831. unlock_kernel();
  1832. free_page(data_page);
  1833. out3:
  1834. free_page(dev_page);
  1835. out2:
  1836. putname(dir_page);
  1837. out1:
  1838. free_page(type_page);
  1839. return retval;
  1840. }
  1841. /*
  1842. * pivot_root Semantics:
  1843. * Moves the root file system of the current process to the directory put_old,
  1844. * makes new_root as the new root file system of the current process, and sets
  1845. * root/cwd of all processes which had them on the current root to new_root.
  1846. *
  1847. * Restrictions:
  1848. * The new_root and put_old must be directories, and must not be on the
  1849. * same file system as the current process root. The put_old must be
  1850. * underneath new_root, i.e. adding a non-zero number of /.. to the string
  1851. * pointed to by put_old must yield the same directory as new_root. No other
  1852. * file system may be mounted on put_old. After all, new_root is a mountpoint.
  1853. *
  1854. * Also, the current root cannot be on the 'rootfs' (initial ramfs) filesystem.
  1855. * See Documentation/filesystems/ramfs-rootfs-initramfs.txt for alternatives
  1856. * in this situation.
  1857. *
  1858. * Notes:
  1859. * - we don't move root/cwd if they are not at the root (reason: if something
  1860. * cared enough to change them, it's probably wrong to force them elsewhere)
  1861. * - it's okay to pick a root that isn't the root of a file system, e.g.
  1862. * /nfs/my_root where /nfs is the mount point. It must be a mountpoint,
  1863. * though, so you may need to say mount --bind /nfs/my_root /nfs/my_root
  1864. * first.
  1865. */
  1866. SYSCALL_DEFINE2(pivot_root, const char __user *, new_root,
  1867. const char __user *, put_old)
  1868. {
  1869. struct vfsmount *tmp;
  1870. struct path new, old, parent_path, root_parent, root;
  1871. int error;
  1872. if (!capable(CAP_SYS_ADMIN))
  1873. return -EPERM;
  1874. error = user_path_dir(new_root, &new);
  1875. if (error)
  1876. goto out0;
  1877. error = -EINVAL;
  1878. if (!check_mnt(new.mnt))
  1879. goto out1;
  1880. error = user_path_dir(put_old, &old);
  1881. if (error)
  1882. goto out1;
  1883. error = security_sb_pivotroot(&old, &new);
  1884. if (error) {
  1885. path_put(&old);
  1886. goto out1;
  1887. }
  1888. read_lock(&current->fs->lock);
  1889. root = current->fs->root;
  1890. path_get(&current->fs->root);
  1891. read_unlock(&current->fs->lock);
  1892. down_write(&namespace_sem);
  1893. mutex_lock(&old.dentry->d_inode->i_mutex);
  1894. error = -EINVAL;
  1895. if (IS_MNT_SHARED(old.mnt) ||
  1896. IS_MNT_SHARED(new.mnt->mnt_parent) ||
  1897. IS_MNT_SHARED(root.mnt->mnt_parent))
  1898. goto out2;
  1899. if (!check_mnt(root.mnt))
  1900. goto out2;
  1901. error = -ENOENT;
  1902. if (IS_DEADDIR(new.dentry->d_inode))
  1903. goto out2;
  1904. if (d_unhashed(new.dentry) && !IS_ROOT(new.dentry))
  1905. goto out2;
  1906. if (d_unhashed(old.dentry) && !IS_ROOT(old.dentry))
  1907. goto out2;
  1908. error = -EBUSY;
  1909. if (new.mnt == root.mnt ||
  1910. old.mnt == root.mnt)
  1911. goto out2; /* loop, on the same file system */
  1912. error = -EINVAL;
  1913. if (root.mnt->mnt_root != root.dentry)
  1914. goto out2; /* not a mountpoint */
  1915. if (root.mnt->mnt_parent == root.mnt)
  1916. goto out2; /* not attached */
  1917. if (new.mnt->mnt_root != new.dentry)
  1918. goto out2; /* not a mountpoint */
  1919. if (new.mnt->mnt_parent == new.mnt)
  1920. goto out2; /* not attached */
  1921. /* make sure we can reach put_old from new_root */
  1922. tmp = old.mnt;
  1923. spin_lock(&vfsmount_lock);
  1924. if (tmp != new.mnt) {
  1925. for (;;) {
  1926. if (tmp->mnt_parent == tmp)
  1927. goto out3; /* already mounted on put_old */
  1928. if (tmp->mnt_parent == new.mnt)
  1929. break;
  1930. tmp = tmp->mnt_parent;
  1931. }
  1932. if (!is_subdir(tmp->mnt_mountpoint, new.dentry))
  1933. goto out3;
  1934. } else if (!is_subdir(old.dentry, new.dentry))
  1935. goto out3;
  1936. detach_mnt(new.mnt, &parent_path);
  1937. detach_mnt(root.mnt, &root_parent);
  1938. /* mount old root on put_old */
  1939. attach_mnt(root.mnt, &old);
  1940. /* mount new_root on / */
  1941. attach_mnt(new.mnt, &root_parent);
  1942. touch_mnt_namespace(current->nsproxy->mnt_ns);
  1943. spin_unlock(&vfsmount_lock);
  1944. chroot_fs_refs(&root, &new);
  1945. security_sb_post_pivotroot(&root, &new);
  1946. error = 0;
  1947. path_put(&root_parent);
  1948. path_put(&parent_path);
  1949. out2:
  1950. mutex_unlock(&old.dentry->d_inode->i_mutex);
  1951. up_write(&namespace_sem);
  1952. path_put(&root);
  1953. path_put(&old);
  1954. out1:
  1955. path_put(&new);
  1956. out0:
  1957. return error;
  1958. out3:
  1959. spin_unlock(&vfsmount_lock);
  1960. goto out2;
  1961. }
  1962. static void __init init_mount_tree(void)
  1963. {
  1964. struct vfsmount *mnt;
  1965. struct mnt_namespace *ns;
  1966. struct path root;
  1967. mnt = do_kern_mount("rootfs", 0, "rootfs", NULL);
  1968. if (IS_ERR(mnt))
  1969. panic("Can't create rootfs");
  1970. ns = kmalloc(sizeof(*ns), GFP_KERNEL);
  1971. if (!ns)
  1972. panic("Can't allocate initial namespace");
  1973. atomic_set(&ns->count, 1);
  1974. INIT_LIST_HEAD(&ns->list);
  1975. init_waitqueue_head(&ns->poll);
  1976. ns->event = 0;
  1977. list_add(&mnt->mnt_list, &ns->list);
  1978. ns->root = mnt;
  1979. mnt->mnt_ns = ns;
  1980. init_task.nsproxy->mnt_ns = ns;
  1981. get_mnt_ns(ns);
  1982. root.mnt = ns->root;
  1983. root.dentry = ns->root->mnt_root;
  1984. set_fs_pwd(current->fs, &root);
  1985. set_fs_root(current->fs, &root);
  1986. }
  1987. void __init mnt_init(void)
  1988. {
  1989. unsigned u;
  1990. int err;
  1991. init_rwsem(&namespace_sem);
  1992. mnt_cache = kmem_cache_create("mnt_cache", sizeof(struct vfsmount),
  1993. 0, SLAB_HWCACHE_ALIGN | SLAB_PANIC, NULL);
  1994. mount_hashtable = (struct list_head *)__get_free_page(GFP_ATOMIC);
  1995. if (!mount_hashtable)
  1996. panic("Failed to allocate mount hash table\n");
  1997. printk("Mount-cache hash table entries: %lu\n", HASH_SIZE);
  1998. for (u = 0; u < HASH_SIZE; u++)
  1999. INIT_LIST_HEAD(&mount_hashtable[u]);
  2000. err = sysfs_init();
  2001. if (err)
  2002. printk(KERN_WARNING "%s: sysfs_init error: %d\n",
  2003. __func__, err);
  2004. fs_kobj = kobject_create_and_add("fs", NULL);
  2005. if (!fs_kobj)
  2006. printk(KERN_WARNING "%s: kobj create error\n", __func__);
  2007. init_rootfs();
  2008. init_mount_tree();
  2009. }
  2010. void __put_mnt_ns(struct mnt_namespace *ns)
  2011. {
  2012. struct vfsmount *root = ns->root;
  2013. LIST_HEAD(umount_list);
  2014. ns->root = NULL;
  2015. spin_unlock(&vfsmount_lock);
  2016. down_write(&namespace_sem);
  2017. spin_lock(&vfsmount_lock);
  2018. umount_tree(root, 0, &umount_list);
  2019. spin_unlock(&vfsmount_lock);
  2020. up_write(&namespace_sem);
  2021. release_mounts(&umount_list);
  2022. kfree(ns);
  2023. }