namespace.c 83 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431
  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/export.h>
  12. #include <linux/capability.h>
  13. #include <linux/mnt_namespace.h>
  14. #include <linux/user_namespace.h>
  15. #include <linux/namei.h>
  16. #include <linux/security.h>
  17. #include <linux/idr.h>
  18. #include <linux/init.h> /* init_rootfs */
  19. #include <linux/fs_struct.h> /* get_fs_root et.al. */
  20. #include <linux/fsnotify.h> /* fsnotify_vfsmount_delete */
  21. #include <linux/uaccess.h>
  22. #include <linux/proc_ns.h>
  23. #include <linux/magic.h>
  24. #include <linux/bootmem.h>
  25. #include <linux/task_work.h>
  26. #include "pnode.h"
  27. #include "internal.h"
  28. /* Maximum number of mounts in a mount namespace */
  29. unsigned int sysctl_mount_max __read_mostly = 100000;
  30. static unsigned int m_hash_mask __read_mostly;
  31. static unsigned int m_hash_shift __read_mostly;
  32. static unsigned int mp_hash_mask __read_mostly;
  33. static unsigned int mp_hash_shift __read_mostly;
  34. static __initdata unsigned long mhash_entries;
  35. static int __init set_mhash_entries(char *str)
  36. {
  37. if (!str)
  38. return 0;
  39. mhash_entries = simple_strtoul(str, &str, 0);
  40. return 1;
  41. }
  42. __setup("mhash_entries=", set_mhash_entries);
  43. static __initdata unsigned long mphash_entries;
  44. static int __init set_mphash_entries(char *str)
  45. {
  46. if (!str)
  47. return 0;
  48. mphash_entries = simple_strtoul(str, &str, 0);
  49. return 1;
  50. }
  51. __setup("mphash_entries=", set_mphash_entries);
  52. static u64 event;
  53. static DEFINE_IDA(mnt_id_ida);
  54. static DEFINE_IDA(mnt_group_ida);
  55. static DEFINE_SPINLOCK(mnt_id_lock);
  56. static int mnt_id_start = 0;
  57. static int mnt_group_start = 1;
  58. static struct hlist_head *mount_hashtable __read_mostly;
  59. static struct hlist_head *mountpoint_hashtable __read_mostly;
  60. static struct kmem_cache *mnt_cache __read_mostly;
  61. static DECLARE_RWSEM(namespace_sem);
  62. /* /sys/fs */
  63. struct kobject *fs_kobj;
  64. EXPORT_SYMBOL_GPL(fs_kobj);
  65. /*
  66. * vfsmount lock may be taken for read to prevent changes to the
  67. * vfsmount hash, ie. during mountpoint lookups or walking back
  68. * up the tree.
  69. *
  70. * It should be taken for write in all cases where the vfsmount
  71. * tree or hash is modified or when a vfsmount structure is modified.
  72. */
  73. __cacheline_aligned_in_smp DEFINE_SEQLOCK(mount_lock);
  74. static inline struct hlist_head *m_hash(struct vfsmount *mnt, struct dentry *dentry)
  75. {
  76. unsigned long tmp = ((unsigned long)mnt / L1_CACHE_BYTES);
  77. tmp += ((unsigned long)dentry / L1_CACHE_BYTES);
  78. tmp = tmp + (tmp >> m_hash_shift);
  79. return &mount_hashtable[tmp & m_hash_mask];
  80. }
  81. static inline struct hlist_head *mp_hash(struct dentry *dentry)
  82. {
  83. unsigned long tmp = ((unsigned long)dentry / L1_CACHE_BYTES);
  84. tmp = tmp + (tmp >> mp_hash_shift);
  85. return &mountpoint_hashtable[tmp & mp_hash_mask];
  86. }
  87. /*
  88. * allocation is serialized by namespace_sem, but we need the spinlock to
  89. * serialize with freeing.
  90. */
  91. static int mnt_alloc_id(struct mount *mnt)
  92. {
  93. int res;
  94. retry:
  95. ida_pre_get(&mnt_id_ida, GFP_KERNEL);
  96. spin_lock(&mnt_id_lock);
  97. res = ida_get_new_above(&mnt_id_ida, mnt_id_start, &mnt->mnt_id);
  98. if (!res)
  99. mnt_id_start = mnt->mnt_id + 1;
  100. spin_unlock(&mnt_id_lock);
  101. if (res == -EAGAIN)
  102. goto retry;
  103. return res;
  104. }
  105. static void mnt_free_id(struct mount *mnt)
  106. {
  107. int id = mnt->mnt_id;
  108. spin_lock(&mnt_id_lock);
  109. ida_remove(&mnt_id_ida, id);
  110. if (mnt_id_start > id)
  111. mnt_id_start = id;
  112. spin_unlock(&mnt_id_lock);
  113. }
  114. /*
  115. * Allocate a new peer group ID
  116. *
  117. * mnt_group_ida is protected by namespace_sem
  118. */
  119. static int mnt_alloc_group_id(struct mount *mnt)
  120. {
  121. int res;
  122. if (!ida_pre_get(&mnt_group_ida, GFP_KERNEL))
  123. return -ENOMEM;
  124. res = ida_get_new_above(&mnt_group_ida,
  125. mnt_group_start,
  126. &mnt->mnt_group_id);
  127. if (!res)
  128. mnt_group_start = mnt->mnt_group_id + 1;
  129. return res;
  130. }
  131. /*
  132. * Release a peer group ID
  133. */
  134. void mnt_release_group_id(struct mount *mnt)
  135. {
  136. int id = mnt->mnt_group_id;
  137. ida_remove(&mnt_group_ida, id);
  138. if (mnt_group_start > id)
  139. mnt_group_start = id;
  140. mnt->mnt_group_id = 0;
  141. }
  142. /*
  143. * vfsmount lock must be held for read
  144. */
  145. static inline void mnt_add_count(struct mount *mnt, int n)
  146. {
  147. #ifdef CONFIG_SMP
  148. this_cpu_add(mnt->mnt_pcp->mnt_count, n);
  149. #else
  150. preempt_disable();
  151. mnt->mnt_count += n;
  152. preempt_enable();
  153. #endif
  154. }
  155. /*
  156. * vfsmount lock must be held for write
  157. */
  158. unsigned int mnt_get_count(struct mount *mnt)
  159. {
  160. #ifdef CONFIG_SMP
  161. unsigned int count = 0;
  162. int cpu;
  163. for_each_possible_cpu(cpu) {
  164. count += per_cpu_ptr(mnt->mnt_pcp, cpu)->mnt_count;
  165. }
  166. return count;
  167. #else
  168. return mnt->mnt_count;
  169. #endif
  170. }
  171. static void drop_mountpoint(struct fs_pin *p)
  172. {
  173. struct mount *m = container_of(p, struct mount, mnt_umount);
  174. dput(m->mnt_ex_mountpoint);
  175. pin_remove(p);
  176. mntput(&m->mnt);
  177. }
  178. static struct mount *alloc_vfsmnt(const char *name)
  179. {
  180. struct mount *mnt = kmem_cache_zalloc(mnt_cache, GFP_KERNEL);
  181. if (mnt) {
  182. int err;
  183. err = mnt_alloc_id(mnt);
  184. if (err)
  185. goto out_free_cache;
  186. if (name) {
  187. mnt->mnt_devname = kstrdup_const(name, GFP_KERNEL);
  188. if (!mnt->mnt_devname)
  189. goto out_free_id;
  190. }
  191. #ifdef CONFIG_SMP
  192. mnt->mnt_pcp = alloc_percpu(struct mnt_pcp);
  193. if (!mnt->mnt_pcp)
  194. goto out_free_devname;
  195. this_cpu_add(mnt->mnt_pcp->mnt_count, 1);
  196. #else
  197. mnt->mnt_count = 1;
  198. mnt->mnt_writers = 0;
  199. #endif
  200. INIT_HLIST_NODE(&mnt->mnt_hash);
  201. INIT_LIST_HEAD(&mnt->mnt_child);
  202. INIT_LIST_HEAD(&mnt->mnt_mounts);
  203. INIT_LIST_HEAD(&mnt->mnt_list);
  204. INIT_LIST_HEAD(&mnt->mnt_expire);
  205. INIT_LIST_HEAD(&mnt->mnt_share);
  206. INIT_LIST_HEAD(&mnt->mnt_slave_list);
  207. INIT_LIST_HEAD(&mnt->mnt_slave);
  208. INIT_HLIST_NODE(&mnt->mnt_mp_list);
  209. #ifdef CONFIG_FSNOTIFY
  210. INIT_HLIST_HEAD(&mnt->mnt_fsnotify_marks);
  211. #endif
  212. init_fs_pin(&mnt->mnt_umount, drop_mountpoint);
  213. }
  214. return mnt;
  215. #ifdef CONFIG_SMP
  216. out_free_devname:
  217. kfree_const(mnt->mnt_devname);
  218. #endif
  219. out_free_id:
  220. mnt_free_id(mnt);
  221. out_free_cache:
  222. kmem_cache_free(mnt_cache, mnt);
  223. return NULL;
  224. }
  225. /*
  226. * Most r/o checks on a fs are for operations that take
  227. * discrete amounts of time, like a write() or unlink().
  228. * We must keep track of when those operations start
  229. * (for permission checks) and when they end, so that
  230. * we can determine when writes are able to occur to
  231. * a filesystem.
  232. */
  233. /*
  234. * __mnt_is_readonly: check whether a mount is read-only
  235. * @mnt: the mount to check for its write status
  236. *
  237. * This shouldn't be used directly ouside of the VFS.
  238. * It does not guarantee that the filesystem will stay
  239. * r/w, just that it is right *now*. This can not and
  240. * should not be used in place of IS_RDONLY(inode).
  241. * mnt_want/drop_write() will _keep_ the filesystem
  242. * r/w.
  243. */
  244. int __mnt_is_readonly(struct vfsmount *mnt)
  245. {
  246. if (mnt->mnt_flags & MNT_READONLY)
  247. return 1;
  248. if (mnt->mnt_sb->s_flags & MS_RDONLY)
  249. return 1;
  250. return 0;
  251. }
  252. EXPORT_SYMBOL_GPL(__mnt_is_readonly);
  253. static inline void mnt_inc_writers(struct mount *mnt)
  254. {
  255. #ifdef CONFIG_SMP
  256. this_cpu_inc(mnt->mnt_pcp->mnt_writers);
  257. #else
  258. mnt->mnt_writers++;
  259. #endif
  260. }
  261. static inline void mnt_dec_writers(struct mount *mnt)
  262. {
  263. #ifdef CONFIG_SMP
  264. this_cpu_dec(mnt->mnt_pcp->mnt_writers);
  265. #else
  266. mnt->mnt_writers--;
  267. #endif
  268. }
  269. static unsigned int mnt_get_writers(struct mount *mnt)
  270. {
  271. #ifdef CONFIG_SMP
  272. unsigned int count = 0;
  273. int cpu;
  274. for_each_possible_cpu(cpu) {
  275. count += per_cpu_ptr(mnt->mnt_pcp, cpu)->mnt_writers;
  276. }
  277. return count;
  278. #else
  279. return mnt->mnt_writers;
  280. #endif
  281. }
  282. static int mnt_is_readonly(struct vfsmount *mnt)
  283. {
  284. if (mnt->mnt_sb->s_readonly_remount)
  285. return 1;
  286. /* Order wrt setting s_flags/s_readonly_remount in do_remount() */
  287. smp_rmb();
  288. return __mnt_is_readonly(mnt);
  289. }
  290. /*
  291. * Most r/o & frozen checks on a fs are for operations that take discrete
  292. * amounts of time, like a write() or unlink(). We must keep track of when
  293. * those operations start (for permission checks) and when they end, so that we
  294. * can determine when writes are able to occur to a filesystem.
  295. */
  296. /**
  297. * __mnt_want_write - get write access to a mount without freeze protection
  298. * @m: the mount on which to take a write
  299. *
  300. * This tells the low-level filesystem that a write is about to be performed to
  301. * it, and makes sure that writes are allowed (mnt it read-write) before
  302. * returning success. This operation does not protect against filesystem being
  303. * frozen. When the write operation is finished, __mnt_drop_write() must be
  304. * called. This is effectively a refcount.
  305. */
  306. int __mnt_want_write(struct vfsmount *m)
  307. {
  308. struct mount *mnt = real_mount(m);
  309. int ret = 0;
  310. preempt_disable();
  311. mnt_inc_writers(mnt);
  312. /*
  313. * The store to mnt_inc_writers must be visible before we pass
  314. * MNT_WRITE_HOLD loop below, so that the slowpath can see our
  315. * incremented count after it has set MNT_WRITE_HOLD.
  316. */
  317. smp_mb();
  318. while (ACCESS_ONCE(mnt->mnt.mnt_flags) & MNT_WRITE_HOLD)
  319. cpu_relax();
  320. /*
  321. * After the slowpath clears MNT_WRITE_HOLD, mnt_is_readonly will
  322. * be set to match its requirements. So we must not load that until
  323. * MNT_WRITE_HOLD is cleared.
  324. */
  325. smp_rmb();
  326. if (mnt_is_readonly(m)) {
  327. mnt_dec_writers(mnt);
  328. ret = -EROFS;
  329. }
  330. preempt_enable();
  331. return ret;
  332. }
  333. /**
  334. * mnt_want_write - get write access to a mount
  335. * @m: the mount on which to take a write
  336. *
  337. * This tells the low-level filesystem that a write is about to be performed to
  338. * it, and makes sure that writes are allowed (mount is read-write, filesystem
  339. * is not frozen) before returning success. When the write operation is
  340. * finished, mnt_drop_write() must be called. This is effectively a refcount.
  341. */
  342. int mnt_want_write(struct vfsmount *m)
  343. {
  344. int ret;
  345. sb_start_write(m->mnt_sb);
  346. ret = __mnt_want_write(m);
  347. if (ret)
  348. sb_end_write(m->mnt_sb);
  349. return ret;
  350. }
  351. EXPORT_SYMBOL_GPL(mnt_want_write);
  352. /**
  353. * mnt_clone_write - get write access to a mount
  354. * @mnt: the mount on which to take a write
  355. *
  356. * This is effectively like mnt_want_write, except
  357. * it must only be used to take an extra write reference
  358. * on a mountpoint that we already know has a write reference
  359. * on it. This allows some optimisation.
  360. *
  361. * After finished, mnt_drop_write must be called as usual to
  362. * drop the reference.
  363. */
  364. int mnt_clone_write(struct vfsmount *mnt)
  365. {
  366. /* superblock may be r/o */
  367. if (__mnt_is_readonly(mnt))
  368. return -EROFS;
  369. preempt_disable();
  370. mnt_inc_writers(real_mount(mnt));
  371. preempt_enable();
  372. return 0;
  373. }
  374. EXPORT_SYMBOL_GPL(mnt_clone_write);
  375. /**
  376. * __mnt_want_write_file - get write access to a file's mount
  377. * @file: the file who's mount on which to take a write
  378. *
  379. * This is like __mnt_want_write, but it takes a file and can
  380. * do some optimisations if the file is open for write already
  381. */
  382. int __mnt_want_write_file(struct file *file)
  383. {
  384. if (!(file->f_mode & FMODE_WRITER))
  385. return __mnt_want_write(file->f_path.mnt);
  386. else
  387. return mnt_clone_write(file->f_path.mnt);
  388. }
  389. /**
  390. * mnt_want_write_file - get write access to a file's mount
  391. * @file: the file who's mount on which to take a write
  392. *
  393. * This is like mnt_want_write, but it takes a file and can
  394. * do some optimisations if the file is open for write already
  395. */
  396. int mnt_want_write_file(struct file *file)
  397. {
  398. int ret;
  399. sb_start_write(file->f_path.mnt->mnt_sb);
  400. ret = __mnt_want_write_file(file);
  401. if (ret)
  402. sb_end_write(file->f_path.mnt->mnt_sb);
  403. return ret;
  404. }
  405. EXPORT_SYMBOL_GPL(mnt_want_write_file);
  406. /**
  407. * __mnt_drop_write - give up write access to a mount
  408. * @mnt: the mount on which to give up write access
  409. *
  410. * Tells the low-level filesystem that we are done
  411. * performing writes to it. Must be matched with
  412. * __mnt_want_write() call above.
  413. */
  414. void __mnt_drop_write(struct vfsmount *mnt)
  415. {
  416. preempt_disable();
  417. mnt_dec_writers(real_mount(mnt));
  418. preempt_enable();
  419. }
  420. /**
  421. * mnt_drop_write - give up write access to a mount
  422. * @mnt: the mount on which to give up write access
  423. *
  424. * Tells the low-level filesystem that we are done performing writes to it and
  425. * also allows filesystem to be frozen again. Must be matched with
  426. * mnt_want_write() call above.
  427. */
  428. void mnt_drop_write(struct vfsmount *mnt)
  429. {
  430. __mnt_drop_write(mnt);
  431. sb_end_write(mnt->mnt_sb);
  432. }
  433. EXPORT_SYMBOL_GPL(mnt_drop_write);
  434. void __mnt_drop_write_file(struct file *file)
  435. {
  436. __mnt_drop_write(file->f_path.mnt);
  437. }
  438. void mnt_drop_write_file(struct file *file)
  439. {
  440. mnt_drop_write(file->f_path.mnt);
  441. }
  442. EXPORT_SYMBOL(mnt_drop_write_file);
  443. static int mnt_make_readonly(struct mount *mnt)
  444. {
  445. int ret = 0;
  446. lock_mount_hash();
  447. mnt->mnt.mnt_flags |= MNT_WRITE_HOLD;
  448. /*
  449. * After storing MNT_WRITE_HOLD, we'll read the counters. This store
  450. * should be visible before we do.
  451. */
  452. smp_mb();
  453. /*
  454. * With writers on hold, if this value is zero, then there are
  455. * definitely no active writers (although held writers may subsequently
  456. * increment the count, they'll have to wait, and decrement it after
  457. * seeing MNT_READONLY).
  458. *
  459. * It is OK to have counter incremented on one CPU and decremented on
  460. * another: the sum will add up correctly. The danger would be when we
  461. * sum up each counter, if we read a counter before it is incremented,
  462. * but then read another CPU's count which it has been subsequently
  463. * decremented from -- we would see more decrements than we should.
  464. * MNT_WRITE_HOLD protects against this scenario, because
  465. * mnt_want_write first increments count, then smp_mb, then spins on
  466. * MNT_WRITE_HOLD, so it can't be decremented by another CPU while
  467. * we're counting up here.
  468. */
  469. if (mnt_get_writers(mnt) > 0)
  470. ret = -EBUSY;
  471. else
  472. mnt->mnt.mnt_flags |= MNT_READONLY;
  473. /*
  474. * MNT_READONLY must become visible before ~MNT_WRITE_HOLD, so writers
  475. * that become unheld will see MNT_READONLY.
  476. */
  477. smp_wmb();
  478. mnt->mnt.mnt_flags &= ~MNT_WRITE_HOLD;
  479. unlock_mount_hash();
  480. return ret;
  481. }
  482. static void __mnt_unmake_readonly(struct mount *mnt)
  483. {
  484. lock_mount_hash();
  485. mnt->mnt.mnt_flags &= ~MNT_READONLY;
  486. unlock_mount_hash();
  487. }
  488. int sb_prepare_remount_readonly(struct super_block *sb)
  489. {
  490. struct mount *mnt;
  491. int err = 0;
  492. /* Racy optimization. Recheck the counter under MNT_WRITE_HOLD */
  493. if (atomic_long_read(&sb->s_remove_count))
  494. return -EBUSY;
  495. lock_mount_hash();
  496. list_for_each_entry(mnt, &sb->s_mounts, mnt_instance) {
  497. if (!(mnt->mnt.mnt_flags & MNT_READONLY)) {
  498. mnt->mnt.mnt_flags |= MNT_WRITE_HOLD;
  499. smp_mb();
  500. if (mnt_get_writers(mnt) > 0) {
  501. err = -EBUSY;
  502. break;
  503. }
  504. }
  505. }
  506. if (!err && atomic_long_read(&sb->s_remove_count))
  507. err = -EBUSY;
  508. if (!err) {
  509. sb->s_readonly_remount = 1;
  510. smp_wmb();
  511. }
  512. list_for_each_entry(mnt, &sb->s_mounts, mnt_instance) {
  513. if (mnt->mnt.mnt_flags & MNT_WRITE_HOLD)
  514. mnt->mnt.mnt_flags &= ~MNT_WRITE_HOLD;
  515. }
  516. unlock_mount_hash();
  517. return err;
  518. }
  519. static void free_vfsmnt(struct mount *mnt)
  520. {
  521. kfree_const(mnt->mnt_devname);
  522. #ifdef CONFIG_SMP
  523. free_percpu(mnt->mnt_pcp);
  524. #endif
  525. kmem_cache_free(mnt_cache, mnt);
  526. }
  527. static void delayed_free_vfsmnt(struct rcu_head *head)
  528. {
  529. free_vfsmnt(container_of(head, struct mount, mnt_rcu));
  530. }
  531. /* call under rcu_read_lock */
  532. int __legitimize_mnt(struct vfsmount *bastard, unsigned seq)
  533. {
  534. struct mount *mnt;
  535. if (read_seqretry(&mount_lock, seq))
  536. return 1;
  537. if (bastard == NULL)
  538. return 0;
  539. mnt = real_mount(bastard);
  540. mnt_add_count(mnt, 1);
  541. if (likely(!read_seqretry(&mount_lock, seq)))
  542. return 0;
  543. if (bastard->mnt_flags & MNT_SYNC_UMOUNT) {
  544. mnt_add_count(mnt, -1);
  545. return 1;
  546. }
  547. return -1;
  548. }
  549. /* call under rcu_read_lock */
  550. bool legitimize_mnt(struct vfsmount *bastard, unsigned seq)
  551. {
  552. int res = __legitimize_mnt(bastard, seq);
  553. if (likely(!res))
  554. return true;
  555. if (unlikely(res < 0)) {
  556. rcu_read_unlock();
  557. mntput(bastard);
  558. rcu_read_lock();
  559. }
  560. return false;
  561. }
  562. /*
  563. * find the first mount at @dentry on vfsmount @mnt.
  564. * call under rcu_read_lock()
  565. */
  566. struct mount *__lookup_mnt(struct vfsmount *mnt, struct dentry *dentry)
  567. {
  568. struct hlist_head *head = m_hash(mnt, dentry);
  569. struct mount *p;
  570. hlist_for_each_entry_rcu(p, head, mnt_hash)
  571. if (&p->mnt_parent->mnt == mnt && p->mnt_mountpoint == dentry)
  572. return p;
  573. return NULL;
  574. }
  575. /*
  576. * find the last mount at @dentry on vfsmount @mnt.
  577. * mount_lock must be held.
  578. */
  579. struct mount *__lookup_mnt_last(struct vfsmount *mnt, struct dentry *dentry)
  580. {
  581. struct mount *p, *res = NULL;
  582. p = __lookup_mnt(mnt, dentry);
  583. if (!p)
  584. goto out;
  585. if (!(p->mnt.mnt_flags & MNT_UMOUNT))
  586. res = p;
  587. hlist_for_each_entry_continue(p, mnt_hash) {
  588. if (&p->mnt_parent->mnt != mnt || p->mnt_mountpoint != dentry)
  589. break;
  590. if (!(p->mnt.mnt_flags & MNT_UMOUNT))
  591. res = p;
  592. }
  593. out:
  594. return res;
  595. }
  596. /*
  597. * lookup_mnt - Return the first child mount mounted at path
  598. *
  599. * "First" means first mounted chronologically. If you create the
  600. * following mounts:
  601. *
  602. * mount /dev/sda1 /mnt
  603. * mount /dev/sda2 /mnt
  604. * mount /dev/sda3 /mnt
  605. *
  606. * Then lookup_mnt() on the base /mnt dentry in the root mount will
  607. * return successively the root dentry and vfsmount of /dev/sda1, then
  608. * /dev/sda2, then /dev/sda3, then NULL.
  609. *
  610. * lookup_mnt takes a reference to the found vfsmount.
  611. */
  612. struct vfsmount *lookup_mnt(struct path *path)
  613. {
  614. struct mount *child_mnt;
  615. struct vfsmount *m;
  616. unsigned seq;
  617. rcu_read_lock();
  618. do {
  619. seq = read_seqbegin(&mount_lock);
  620. child_mnt = __lookup_mnt(path->mnt, path->dentry);
  621. m = child_mnt ? &child_mnt->mnt : NULL;
  622. } while (!legitimize_mnt(m, seq));
  623. rcu_read_unlock();
  624. return m;
  625. }
  626. /*
  627. * __is_local_mountpoint - Test to see if dentry is a mountpoint in the
  628. * current mount namespace.
  629. *
  630. * The common case is dentries are not mountpoints at all and that
  631. * test is handled inline. For the slow case when we are actually
  632. * dealing with a mountpoint of some kind, walk through all of the
  633. * mounts in the current mount namespace and test to see if the dentry
  634. * is a mountpoint.
  635. *
  636. * The mount_hashtable is not usable in the context because we
  637. * need to identify all mounts that may be in the current mount
  638. * namespace not just a mount that happens to have some specified
  639. * parent mount.
  640. */
  641. bool __is_local_mountpoint(struct dentry *dentry)
  642. {
  643. struct mnt_namespace *ns = current->nsproxy->mnt_ns;
  644. struct mount *mnt;
  645. bool is_covered = false;
  646. if (!d_mountpoint(dentry))
  647. goto out;
  648. down_read(&namespace_sem);
  649. list_for_each_entry(mnt, &ns->list, mnt_list) {
  650. is_covered = (mnt->mnt_mountpoint == dentry);
  651. if (is_covered)
  652. break;
  653. }
  654. up_read(&namespace_sem);
  655. out:
  656. return is_covered;
  657. }
  658. static struct mountpoint *lookup_mountpoint(struct dentry *dentry)
  659. {
  660. struct hlist_head *chain = mp_hash(dentry);
  661. struct mountpoint *mp;
  662. hlist_for_each_entry(mp, chain, m_hash) {
  663. if (mp->m_dentry == dentry) {
  664. /* might be worth a WARN_ON() */
  665. if (d_unlinked(dentry))
  666. return ERR_PTR(-ENOENT);
  667. mp->m_count++;
  668. return mp;
  669. }
  670. }
  671. return NULL;
  672. }
  673. static struct mountpoint *new_mountpoint(struct dentry *dentry)
  674. {
  675. struct hlist_head *chain = mp_hash(dentry);
  676. struct mountpoint *mp;
  677. int ret;
  678. mp = kmalloc(sizeof(struct mountpoint), GFP_KERNEL);
  679. if (!mp)
  680. return ERR_PTR(-ENOMEM);
  681. ret = d_set_mounted(dentry);
  682. if (ret) {
  683. kfree(mp);
  684. return ERR_PTR(ret);
  685. }
  686. mp->m_dentry = dentry;
  687. mp->m_count = 1;
  688. hlist_add_head(&mp->m_hash, chain);
  689. INIT_HLIST_HEAD(&mp->m_list);
  690. return mp;
  691. }
  692. static void put_mountpoint(struct mountpoint *mp)
  693. {
  694. if (!--mp->m_count) {
  695. struct dentry *dentry = mp->m_dentry;
  696. BUG_ON(!hlist_empty(&mp->m_list));
  697. spin_lock(&dentry->d_lock);
  698. dentry->d_flags &= ~DCACHE_MOUNTED;
  699. spin_unlock(&dentry->d_lock);
  700. hlist_del(&mp->m_hash);
  701. kfree(mp);
  702. }
  703. }
  704. static inline int check_mnt(struct mount *mnt)
  705. {
  706. return mnt->mnt_ns == current->nsproxy->mnt_ns;
  707. }
  708. /*
  709. * vfsmount lock must be held for write
  710. */
  711. static void touch_mnt_namespace(struct mnt_namespace *ns)
  712. {
  713. if (ns) {
  714. ns->event = ++event;
  715. wake_up_interruptible(&ns->poll);
  716. }
  717. }
  718. /*
  719. * vfsmount lock must be held for write
  720. */
  721. static void __touch_mnt_namespace(struct mnt_namespace *ns)
  722. {
  723. if (ns && ns->event != event) {
  724. ns->event = event;
  725. wake_up_interruptible(&ns->poll);
  726. }
  727. }
  728. /*
  729. * vfsmount lock must be held for write
  730. */
  731. static void unhash_mnt(struct mount *mnt)
  732. {
  733. mnt->mnt_parent = mnt;
  734. mnt->mnt_mountpoint = mnt->mnt.mnt_root;
  735. list_del_init(&mnt->mnt_child);
  736. hlist_del_init_rcu(&mnt->mnt_hash);
  737. hlist_del_init(&mnt->mnt_mp_list);
  738. put_mountpoint(mnt->mnt_mp);
  739. mnt->mnt_mp = NULL;
  740. }
  741. /*
  742. * vfsmount lock must be held for write
  743. */
  744. static void detach_mnt(struct mount *mnt, struct path *old_path)
  745. {
  746. old_path->dentry = mnt->mnt_mountpoint;
  747. old_path->mnt = &mnt->mnt_parent->mnt;
  748. unhash_mnt(mnt);
  749. }
  750. /*
  751. * vfsmount lock must be held for write
  752. */
  753. static void umount_mnt(struct mount *mnt)
  754. {
  755. /* old mountpoint will be dropped when we can do that */
  756. mnt->mnt_ex_mountpoint = mnt->mnt_mountpoint;
  757. unhash_mnt(mnt);
  758. }
  759. /*
  760. * vfsmount lock must be held for write
  761. */
  762. void mnt_set_mountpoint(struct mount *mnt,
  763. struct mountpoint *mp,
  764. struct mount *child_mnt)
  765. {
  766. mp->m_count++;
  767. mnt_add_count(mnt, 1); /* essentially, that's mntget */
  768. child_mnt->mnt_mountpoint = dget(mp->m_dentry);
  769. child_mnt->mnt_parent = mnt;
  770. child_mnt->mnt_mp = mp;
  771. hlist_add_head(&child_mnt->mnt_mp_list, &mp->m_list);
  772. }
  773. /*
  774. * vfsmount lock must be held for write
  775. */
  776. static void attach_mnt(struct mount *mnt,
  777. struct mount *parent,
  778. struct mountpoint *mp)
  779. {
  780. mnt_set_mountpoint(parent, mp, mnt);
  781. hlist_add_head_rcu(&mnt->mnt_hash, m_hash(&parent->mnt, mp->m_dentry));
  782. list_add_tail(&mnt->mnt_child, &parent->mnt_mounts);
  783. }
  784. static void attach_shadowed(struct mount *mnt,
  785. struct mount *parent,
  786. struct mount *shadows)
  787. {
  788. if (shadows) {
  789. hlist_add_behind_rcu(&mnt->mnt_hash, &shadows->mnt_hash);
  790. list_add(&mnt->mnt_child, &shadows->mnt_child);
  791. } else {
  792. hlist_add_head_rcu(&mnt->mnt_hash,
  793. m_hash(&parent->mnt, mnt->mnt_mountpoint));
  794. list_add_tail(&mnt->mnt_child, &parent->mnt_mounts);
  795. }
  796. }
  797. /*
  798. * vfsmount lock must be held for write
  799. */
  800. static void commit_tree(struct mount *mnt, struct mount *shadows)
  801. {
  802. struct mount *parent = mnt->mnt_parent;
  803. struct mount *m;
  804. LIST_HEAD(head);
  805. struct mnt_namespace *n = parent->mnt_ns;
  806. BUG_ON(parent == mnt);
  807. list_add_tail(&head, &mnt->mnt_list);
  808. list_for_each_entry(m, &head, mnt_list)
  809. m->mnt_ns = n;
  810. list_splice(&head, n->list.prev);
  811. n->mounts += n->pending_mounts;
  812. n->pending_mounts = 0;
  813. attach_shadowed(mnt, parent, shadows);
  814. touch_mnt_namespace(n);
  815. }
  816. static struct mount *next_mnt(struct mount *p, struct mount *root)
  817. {
  818. struct list_head *next = p->mnt_mounts.next;
  819. if (next == &p->mnt_mounts) {
  820. while (1) {
  821. if (p == root)
  822. return NULL;
  823. next = p->mnt_child.next;
  824. if (next != &p->mnt_parent->mnt_mounts)
  825. break;
  826. p = p->mnt_parent;
  827. }
  828. }
  829. return list_entry(next, struct mount, mnt_child);
  830. }
  831. static struct mount *skip_mnt_tree(struct mount *p)
  832. {
  833. struct list_head *prev = p->mnt_mounts.prev;
  834. while (prev != &p->mnt_mounts) {
  835. p = list_entry(prev, struct mount, mnt_child);
  836. prev = p->mnt_mounts.prev;
  837. }
  838. return p;
  839. }
  840. struct vfsmount *
  841. vfs_kern_mount(struct file_system_type *type, int flags, const char *name, void *data)
  842. {
  843. struct mount *mnt;
  844. struct dentry *root;
  845. if (!type)
  846. return ERR_PTR(-ENODEV);
  847. mnt = alloc_vfsmnt(name);
  848. if (!mnt)
  849. return ERR_PTR(-ENOMEM);
  850. if (flags & MS_KERNMOUNT)
  851. mnt->mnt.mnt_flags = MNT_INTERNAL;
  852. root = mount_fs(type, flags, name, data);
  853. if (IS_ERR(root)) {
  854. mnt_free_id(mnt);
  855. free_vfsmnt(mnt);
  856. return ERR_CAST(root);
  857. }
  858. mnt->mnt.mnt_root = root;
  859. mnt->mnt.mnt_sb = root->d_sb;
  860. mnt->mnt_mountpoint = mnt->mnt.mnt_root;
  861. mnt->mnt_parent = mnt;
  862. lock_mount_hash();
  863. list_add_tail(&mnt->mnt_instance, &root->d_sb->s_mounts);
  864. unlock_mount_hash();
  865. return &mnt->mnt;
  866. }
  867. EXPORT_SYMBOL_GPL(vfs_kern_mount);
  868. static struct mount *clone_mnt(struct mount *old, struct dentry *root,
  869. int flag)
  870. {
  871. struct super_block *sb = old->mnt.mnt_sb;
  872. struct mount *mnt;
  873. int err;
  874. mnt = alloc_vfsmnt(old->mnt_devname);
  875. if (!mnt)
  876. return ERR_PTR(-ENOMEM);
  877. if (flag & (CL_SLAVE | CL_PRIVATE | CL_SHARED_TO_SLAVE))
  878. mnt->mnt_group_id = 0; /* not a peer of original */
  879. else
  880. mnt->mnt_group_id = old->mnt_group_id;
  881. if ((flag & CL_MAKE_SHARED) && !mnt->mnt_group_id) {
  882. err = mnt_alloc_group_id(mnt);
  883. if (err)
  884. goto out_free;
  885. }
  886. mnt->mnt.mnt_flags = old->mnt.mnt_flags & ~(MNT_WRITE_HOLD|MNT_MARKED);
  887. /* Don't allow unprivileged users to change mount flags */
  888. if (flag & CL_UNPRIVILEGED) {
  889. mnt->mnt.mnt_flags |= MNT_LOCK_ATIME;
  890. if (mnt->mnt.mnt_flags & MNT_READONLY)
  891. mnt->mnt.mnt_flags |= MNT_LOCK_READONLY;
  892. if (mnt->mnt.mnt_flags & MNT_NODEV)
  893. mnt->mnt.mnt_flags |= MNT_LOCK_NODEV;
  894. if (mnt->mnt.mnt_flags & MNT_NOSUID)
  895. mnt->mnt.mnt_flags |= MNT_LOCK_NOSUID;
  896. if (mnt->mnt.mnt_flags & MNT_NOEXEC)
  897. mnt->mnt.mnt_flags |= MNT_LOCK_NOEXEC;
  898. }
  899. /* Don't allow unprivileged users to reveal what is under a mount */
  900. if ((flag & CL_UNPRIVILEGED) &&
  901. (!(flag & CL_EXPIRE) || list_empty(&old->mnt_expire)))
  902. mnt->mnt.mnt_flags |= MNT_LOCKED;
  903. atomic_inc(&sb->s_active);
  904. mnt->mnt.mnt_sb = sb;
  905. mnt->mnt.mnt_root = dget(root);
  906. mnt->mnt_mountpoint = mnt->mnt.mnt_root;
  907. mnt->mnt_parent = mnt;
  908. lock_mount_hash();
  909. list_add_tail(&mnt->mnt_instance, &sb->s_mounts);
  910. unlock_mount_hash();
  911. if ((flag & CL_SLAVE) ||
  912. ((flag & CL_SHARED_TO_SLAVE) && IS_MNT_SHARED(old))) {
  913. list_add(&mnt->mnt_slave, &old->mnt_slave_list);
  914. mnt->mnt_master = old;
  915. CLEAR_MNT_SHARED(mnt);
  916. } else if (!(flag & CL_PRIVATE)) {
  917. if ((flag & CL_MAKE_SHARED) || IS_MNT_SHARED(old))
  918. list_add(&mnt->mnt_share, &old->mnt_share);
  919. if (IS_MNT_SLAVE(old))
  920. list_add(&mnt->mnt_slave, &old->mnt_slave);
  921. mnt->mnt_master = old->mnt_master;
  922. }
  923. if (flag & CL_MAKE_SHARED)
  924. set_mnt_shared(mnt);
  925. /* stick the duplicate mount on the same expiry list
  926. * as the original if that was on one */
  927. if (flag & CL_EXPIRE) {
  928. if (!list_empty(&old->mnt_expire))
  929. list_add(&mnt->mnt_expire, &old->mnt_expire);
  930. }
  931. return mnt;
  932. out_free:
  933. mnt_free_id(mnt);
  934. free_vfsmnt(mnt);
  935. return ERR_PTR(err);
  936. }
  937. static void cleanup_mnt(struct mount *mnt)
  938. {
  939. /*
  940. * This probably indicates that somebody messed
  941. * up a mnt_want/drop_write() pair. If this
  942. * happens, the filesystem was probably unable
  943. * to make r/w->r/o transitions.
  944. */
  945. /*
  946. * The locking used to deal with mnt_count decrement provides barriers,
  947. * so mnt_get_writers() below is safe.
  948. */
  949. WARN_ON(mnt_get_writers(mnt));
  950. if (unlikely(mnt->mnt_pins.first))
  951. mnt_pin_kill(mnt);
  952. fsnotify_vfsmount_delete(&mnt->mnt);
  953. dput(mnt->mnt.mnt_root);
  954. deactivate_super(mnt->mnt.mnt_sb);
  955. mnt_free_id(mnt);
  956. call_rcu(&mnt->mnt_rcu, delayed_free_vfsmnt);
  957. }
  958. static void __cleanup_mnt(struct rcu_head *head)
  959. {
  960. cleanup_mnt(container_of(head, struct mount, mnt_rcu));
  961. }
  962. static LLIST_HEAD(delayed_mntput_list);
  963. static void delayed_mntput(struct work_struct *unused)
  964. {
  965. struct llist_node *node = llist_del_all(&delayed_mntput_list);
  966. struct llist_node *next;
  967. for (; node; node = next) {
  968. next = llist_next(node);
  969. cleanup_mnt(llist_entry(node, struct mount, mnt_llist));
  970. }
  971. }
  972. static DECLARE_DELAYED_WORK(delayed_mntput_work, delayed_mntput);
  973. static void mntput_no_expire(struct mount *mnt)
  974. {
  975. rcu_read_lock();
  976. mnt_add_count(mnt, -1);
  977. if (likely(mnt->mnt_ns)) { /* shouldn't be the last one */
  978. rcu_read_unlock();
  979. return;
  980. }
  981. lock_mount_hash();
  982. if (mnt_get_count(mnt)) {
  983. rcu_read_unlock();
  984. unlock_mount_hash();
  985. return;
  986. }
  987. if (unlikely(mnt->mnt.mnt_flags & MNT_DOOMED)) {
  988. rcu_read_unlock();
  989. unlock_mount_hash();
  990. return;
  991. }
  992. mnt->mnt.mnt_flags |= MNT_DOOMED;
  993. rcu_read_unlock();
  994. list_del(&mnt->mnt_instance);
  995. if (unlikely(!list_empty(&mnt->mnt_mounts))) {
  996. struct mount *p, *tmp;
  997. list_for_each_entry_safe(p, tmp, &mnt->mnt_mounts, mnt_child) {
  998. umount_mnt(p);
  999. }
  1000. }
  1001. unlock_mount_hash();
  1002. if (likely(!(mnt->mnt.mnt_flags & MNT_INTERNAL))) {
  1003. struct task_struct *task = current;
  1004. if (likely(!(task->flags & PF_KTHREAD))) {
  1005. init_task_work(&mnt->mnt_rcu, __cleanup_mnt);
  1006. if (!task_work_add(task, &mnt->mnt_rcu, true))
  1007. return;
  1008. }
  1009. if (llist_add(&mnt->mnt_llist, &delayed_mntput_list))
  1010. schedule_delayed_work(&delayed_mntput_work, 1);
  1011. return;
  1012. }
  1013. cleanup_mnt(mnt);
  1014. }
  1015. void mntput(struct vfsmount *mnt)
  1016. {
  1017. if (mnt) {
  1018. struct mount *m = real_mount(mnt);
  1019. /* avoid cacheline pingpong, hope gcc doesn't get "smart" */
  1020. if (unlikely(m->mnt_expiry_mark))
  1021. m->mnt_expiry_mark = 0;
  1022. mntput_no_expire(m);
  1023. }
  1024. }
  1025. EXPORT_SYMBOL(mntput);
  1026. struct vfsmount *mntget(struct vfsmount *mnt)
  1027. {
  1028. if (mnt)
  1029. mnt_add_count(real_mount(mnt), 1);
  1030. return mnt;
  1031. }
  1032. EXPORT_SYMBOL(mntget);
  1033. struct vfsmount *mnt_clone_internal(struct path *path)
  1034. {
  1035. struct mount *p;
  1036. p = clone_mnt(real_mount(path->mnt), path->dentry, CL_PRIVATE);
  1037. if (IS_ERR(p))
  1038. return ERR_CAST(p);
  1039. p->mnt.mnt_flags |= MNT_INTERNAL;
  1040. return &p->mnt;
  1041. }
  1042. static inline void mangle(struct seq_file *m, const char *s)
  1043. {
  1044. seq_escape(m, s, " \t\n\\");
  1045. }
  1046. /*
  1047. * Simple .show_options callback for filesystems which don't want to
  1048. * implement more complex mount option showing.
  1049. *
  1050. * See also save_mount_options().
  1051. */
  1052. int generic_show_options(struct seq_file *m, struct dentry *root)
  1053. {
  1054. const char *options;
  1055. rcu_read_lock();
  1056. options = rcu_dereference(root->d_sb->s_options);
  1057. if (options != NULL && options[0]) {
  1058. seq_putc(m, ',');
  1059. mangle(m, options);
  1060. }
  1061. rcu_read_unlock();
  1062. return 0;
  1063. }
  1064. EXPORT_SYMBOL(generic_show_options);
  1065. /*
  1066. * If filesystem uses generic_show_options(), this function should be
  1067. * called from the fill_super() callback.
  1068. *
  1069. * The .remount_fs callback usually needs to be handled in a special
  1070. * way, to make sure, that previous options are not overwritten if the
  1071. * remount fails.
  1072. *
  1073. * Also note, that if the filesystem's .remount_fs function doesn't
  1074. * reset all options to their default value, but changes only newly
  1075. * given options, then the displayed options will not reflect reality
  1076. * any more.
  1077. */
  1078. void save_mount_options(struct super_block *sb, char *options)
  1079. {
  1080. BUG_ON(sb->s_options);
  1081. rcu_assign_pointer(sb->s_options, kstrdup(options, GFP_KERNEL));
  1082. }
  1083. EXPORT_SYMBOL(save_mount_options);
  1084. void replace_mount_options(struct super_block *sb, char *options)
  1085. {
  1086. char *old = sb->s_options;
  1087. rcu_assign_pointer(sb->s_options, options);
  1088. if (old) {
  1089. synchronize_rcu();
  1090. kfree(old);
  1091. }
  1092. }
  1093. EXPORT_SYMBOL(replace_mount_options);
  1094. #ifdef CONFIG_PROC_FS
  1095. /* iterator; we want it to have access to namespace_sem, thus here... */
  1096. static void *m_start(struct seq_file *m, loff_t *pos)
  1097. {
  1098. struct proc_mounts *p = m->private;
  1099. down_read(&namespace_sem);
  1100. if (p->cached_event == p->ns->event) {
  1101. void *v = p->cached_mount;
  1102. if (*pos == p->cached_index)
  1103. return v;
  1104. if (*pos == p->cached_index + 1) {
  1105. v = seq_list_next(v, &p->ns->list, &p->cached_index);
  1106. return p->cached_mount = v;
  1107. }
  1108. }
  1109. p->cached_event = p->ns->event;
  1110. p->cached_mount = seq_list_start(&p->ns->list, *pos);
  1111. p->cached_index = *pos;
  1112. return p->cached_mount;
  1113. }
  1114. static void *m_next(struct seq_file *m, void *v, loff_t *pos)
  1115. {
  1116. struct proc_mounts *p = m->private;
  1117. p->cached_mount = seq_list_next(v, &p->ns->list, pos);
  1118. p->cached_index = *pos;
  1119. return p->cached_mount;
  1120. }
  1121. static void m_stop(struct seq_file *m, void *v)
  1122. {
  1123. up_read(&namespace_sem);
  1124. }
  1125. static int m_show(struct seq_file *m, void *v)
  1126. {
  1127. struct proc_mounts *p = m->private;
  1128. struct mount *r = list_entry(v, struct mount, mnt_list);
  1129. return p->show(m, &r->mnt);
  1130. }
  1131. const struct seq_operations mounts_op = {
  1132. .start = m_start,
  1133. .next = m_next,
  1134. .stop = m_stop,
  1135. .show = m_show,
  1136. };
  1137. #endif /* CONFIG_PROC_FS */
  1138. /**
  1139. * may_umount_tree - check if a mount tree is busy
  1140. * @mnt: root of mount tree
  1141. *
  1142. * This is called to check if a tree of mounts has any
  1143. * open files, pwds, chroots or sub mounts that are
  1144. * busy.
  1145. */
  1146. int may_umount_tree(struct vfsmount *m)
  1147. {
  1148. struct mount *mnt = real_mount(m);
  1149. int actual_refs = 0;
  1150. int minimum_refs = 0;
  1151. struct mount *p;
  1152. BUG_ON(!m);
  1153. /* write lock needed for mnt_get_count */
  1154. lock_mount_hash();
  1155. for (p = mnt; p; p = next_mnt(p, mnt)) {
  1156. actual_refs += mnt_get_count(p);
  1157. minimum_refs += 2;
  1158. }
  1159. unlock_mount_hash();
  1160. if (actual_refs > minimum_refs)
  1161. return 0;
  1162. return 1;
  1163. }
  1164. EXPORT_SYMBOL(may_umount_tree);
  1165. /**
  1166. * may_umount - check if a mount point is busy
  1167. * @mnt: root of mount
  1168. *
  1169. * This is called to check if a mount point has any
  1170. * open files, pwds, chroots or sub mounts. If the
  1171. * mount has sub mounts this will return busy
  1172. * regardless of whether the sub mounts are busy.
  1173. *
  1174. * Doesn't take quota and stuff into account. IOW, in some cases it will
  1175. * give false negatives. The main reason why it's here is that we need
  1176. * a non-destructive way to look for easily umountable filesystems.
  1177. */
  1178. int may_umount(struct vfsmount *mnt)
  1179. {
  1180. int ret = 1;
  1181. down_read(&namespace_sem);
  1182. lock_mount_hash();
  1183. if (propagate_mount_busy(real_mount(mnt), 2))
  1184. ret = 0;
  1185. unlock_mount_hash();
  1186. up_read(&namespace_sem);
  1187. return ret;
  1188. }
  1189. EXPORT_SYMBOL(may_umount);
  1190. static HLIST_HEAD(unmounted); /* protected by namespace_sem */
  1191. static void namespace_unlock(void)
  1192. {
  1193. struct hlist_head head;
  1194. hlist_move_list(&unmounted, &head);
  1195. up_write(&namespace_sem);
  1196. if (likely(hlist_empty(&head)))
  1197. return;
  1198. synchronize_rcu();
  1199. group_pin_kill(&head);
  1200. }
  1201. static inline void namespace_lock(void)
  1202. {
  1203. down_write(&namespace_sem);
  1204. }
  1205. enum umount_tree_flags {
  1206. UMOUNT_SYNC = 1,
  1207. UMOUNT_PROPAGATE = 2,
  1208. UMOUNT_CONNECTED = 4,
  1209. };
  1210. static bool disconnect_mount(struct mount *mnt, enum umount_tree_flags how)
  1211. {
  1212. /* Leaving mounts connected is only valid for lazy umounts */
  1213. if (how & UMOUNT_SYNC)
  1214. return true;
  1215. /* A mount without a parent has nothing to be connected to */
  1216. if (!mnt_has_parent(mnt))
  1217. return true;
  1218. /* Because the reference counting rules change when mounts are
  1219. * unmounted and connected, umounted mounts may not be
  1220. * connected to mounted mounts.
  1221. */
  1222. if (!(mnt->mnt_parent->mnt.mnt_flags & MNT_UMOUNT))
  1223. return true;
  1224. /* Has it been requested that the mount remain connected? */
  1225. if (how & UMOUNT_CONNECTED)
  1226. return false;
  1227. /* Is the mount locked such that it needs to remain connected? */
  1228. if (IS_MNT_LOCKED(mnt))
  1229. return false;
  1230. /* By default disconnect the mount */
  1231. return true;
  1232. }
  1233. /*
  1234. * mount_lock must be held
  1235. * namespace_sem must be held for write
  1236. */
  1237. static void umount_tree(struct mount *mnt, enum umount_tree_flags how)
  1238. {
  1239. LIST_HEAD(tmp_list);
  1240. struct mount *p;
  1241. if (how & UMOUNT_PROPAGATE)
  1242. propagate_mount_unlock(mnt);
  1243. /* Gather the mounts to umount */
  1244. for (p = mnt; p; p = next_mnt(p, mnt)) {
  1245. p->mnt.mnt_flags |= MNT_UMOUNT;
  1246. list_move(&p->mnt_list, &tmp_list);
  1247. }
  1248. /* Hide the mounts from mnt_mounts */
  1249. list_for_each_entry(p, &tmp_list, mnt_list) {
  1250. list_del_init(&p->mnt_child);
  1251. }
  1252. /* Add propogated mounts to the tmp_list */
  1253. if (how & UMOUNT_PROPAGATE)
  1254. propagate_umount(&tmp_list);
  1255. while (!list_empty(&tmp_list)) {
  1256. struct mnt_namespace *ns;
  1257. bool disconnect;
  1258. p = list_first_entry(&tmp_list, struct mount, mnt_list);
  1259. list_del_init(&p->mnt_expire);
  1260. list_del_init(&p->mnt_list);
  1261. ns = p->mnt_ns;
  1262. if (ns) {
  1263. ns->mounts--;
  1264. __touch_mnt_namespace(ns);
  1265. }
  1266. p->mnt_ns = NULL;
  1267. if (how & UMOUNT_SYNC)
  1268. p->mnt.mnt_flags |= MNT_SYNC_UMOUNT;
  1269. disconnect = disconnect_mount(p, how);
  1270. pin_insert_group(&p->mnt_umount, &p->mnt_parent->mnt,
  1271. disconnect ? &unmounted : NULL);
  1272. if (mnt_has_parent(p)) {
  1273. mnt_add_count(p->mnt_parent, -1);
  1274. if (!disconnect) {
  1275. /* Don't forget about p */
  1276. list_add_tail(&p->mnt_child, &p->mnt_parent->mnt_mounts);
  1277. } else {
  1278. umount_mnt(p);
  1279. }
  1280. }
  1281. change_mnt_propagation(p, MS_PRIVATE);
  1282. }
  1283. }
  1284. static void shrink_submounts(struct mount *mnt);
  1285. static int do_umount(struct mount *mnt, int flags)
  1286. {
  1287. struct super_block *sb = mnt->mnt.mnt_sb;
  1288. int retval;
  1289. retval = security_sb_umount(&mnt->mnt, flags);
  1290. if (retval)
  1291. return retval;
  1292. /*
  1293. * Allow userspace to request a mountpoint be expired rather than
  1294. * unmounting unconditionally. Unmount only happens if:
  1295. * (1) the mark is already set (the mark is cleared by mntput())
  1296. * (2) the usage count == 1 [parent vfsmount] + 1 [sys_umount]
  1297. */
  1298. if (flags & MNT_EXPIRE) {
  1299. if (&mnt->mnt == current->fs->root.mnt ||
  1300. flags & (MNT_FORCE | MNT_DETACH))
  1301. return -EINVAL;
  1302. /*
  1303. * probably don't strictly need the lock here if we examined
  1304. * all race cases, but it's a slowpath.
  1305. */
  1306. lock_mount_hash();
  1307. if (mnt_get_count(mnt) != 2) {
  1308. unlock_mount_hash();
  1309. return -EBUSY;
  1310. }
  1311. unlock_mount_hash();
  1312. if (!xchg(&mnt->mnt_expiry_mark, 1))
  1313. return -EAGAIN;
  1314. }
  1315. /*
  1316. * If we may have to abort operations to get out of this
  1317. * mount, and they will themselves hold resources we must
  1318. * allow the fs to do things. In the Unix tradition of
  1319. * 'Gee thats tricky lets do it in userspace' the umount_begin
  1320. * might fail to complete on the first run through as other tasks
  1321. * must return, and the like. Thats for the mount program to worry
  1322. * about for the moment.
  1323. */
  1324. if (flags & MNT_FORCE && sb->s_op->umount_begin) {
  1325. sb->s_op->umount_begin(sb);
  1326. }
  1327. /*
  1328. * No sense to grab the lock for this test, but test itself looks
  1329. * somewhat bogus. Suggestions for better replacement?
  1330. * Ho-hum... In principle, we might treat that as umount + switch
  1331. * to rootfs. GC would eventually take care of the old vfsmount.
  1332. * Actually it makes sense, especially if rootfs would contain a
  1333. * /reboot - static binary that would close all descriptors and
  1334. * call reboot(9). Then init(8) could umount root and exec /reboot.
  1335. */
  1336. if (&mnt->mnt == current->fs->root.mnt && !(flags & MNT_DETACH)) {
  1337. /*
  1338. * Special case for "unmounting" root ...
  1339. * we just try to remount it readonly.
  1340. */
  1341. if (!capable(CAP_SYS_ADMIN))
  1342. return -EPERM;
  1343. down_write(&sb->s_umount);
  1344. if (!(sb->s_flags & MS_RDONLY))
  1345. retval = do_remount_sb(sb, MS_RDONLY, NULL, 0);
  1346. up_write(&sb->s_umount);
  1347. return retval;
  1348. }
  1349. namespace_lock();
  1350. lock_mount_hash();
  1351. event++;
  1352. if (flags & MNT_DETACH) {
  1353. if (!list_empty(&mnt->mnt_list))
  1354. umount_tree(mnt, UMOUNT_PROPAGATE);
  1355. retval = 0;
  1356. } else {
  1357. shrink_submounts(mnt);
  1358. retval = -EBUSY;
  1359. if (!propagate_mount_busy(mnt, 2)) {
  1360. if (!list_empty(&mnt->mnt_list))
  1361. umount_tree(mnt, UMOUNT_PROPAGATE|UMOUNT_SYNC);
  1362. retval = 0;
  1363. }
  1364. }
  1365. unlock_mount_hash();
  1366. namespace_unlock();
  1367. return retval;
  1368. }
  1369. /*
  1370. * __detach_mounts - lazily unmount all mounts on the specified dentry
  1371. *
  1372. * During unlink, rmdir, and d_drop it is possible to loose the path
  1373. * to an existing mountpoint, and wind up leaking the mount.
  1374. * detach_mounts allows lazily unmounting those mounts instead of
  1375. * leaking them.
  1376. *
  1377. * The caller may hold dentry->d_inode->i_mutex.
  1378. */
  1379. void __detach_mounts(struct dentry *dentry)
  1380. {
  1381. struct mountpoint *mp;
  1382. struct mount *mnt;
  1383. namespace_lock();
  1384. mp = lookup_mountpoint(dentry);
  1385. if (IS_ERR_OR_NULL(mp))
  1386. goto out_unlock;
  1387. lock_mount_hash();
  1388. event++;
  1389. while (!hlist_empty(&mp->m_list)) {
  1390. mnt = hlist_entry(mp->m_list.first, struct mount, mnt_mp_list);
  1391. if (mnt->mnt.mnt_flags & MNT_UMOUNT) {
  1392. hlist_add_head(&mnt->mnt_umount.s_list, &unmounted);
  1393. umount_mnt(mnt);
  1394. }
  1395. else umount_tree(mnt, UMOUNT_CONNECTED);
  1396. }
  1397. unlock_mount_hash();
  1398. put_mountpoint(mp);
  1399. out_unlock:
  1400. namespace_unlock();
  1401. }
  1402. /*
  1403. * Is the caller allowed to modify his namespace?
  1404. */
  1405. static inline bool may_mount(void)
  1406. {
  1407. return ns_capable(current->nsproxy->mnt_ns->user_ns, CAP_SYS_ADMIN);
  1408. }
  1409. static inline bool may_mandlock(void)
  1410. {
  1411. #ifndef CONFIG_MANDATORY_FILE_LOCKING
  1412. return false;
  1413. #endif
  1414. return capable(CAP_SYS_ADMIN);
  1415. }
  1416. /*
  1417. * Now umount can handle mount points as well as block devices.
  1418. * This is important for filesystems which use unnamed block devices.
  1419. *
  1420. * We now support a flag for forced unmount like the other 'big iron'
  1421. * unixes. Our API is identical to OSF/1 to avoid making a mess of AMD
  1422. */
  1423. SYSCALL_DEFINE2(umount, char __user *, name, int, flags)
  1424. {
  1425. struct path path;
  1426. struct mount *mnt;
  1427. int retval;
  1428. int lookup_flags = 0;
  1429. if (flags & ~(MNT_FORCE | MNT_DETACH | MNT_EXPIRE | UMOUNT_NOFOLLOW))
  1430. return -EINVAL;
  1431. if (!may_mount())
  1432. return -EPERM;
  1433. if (!(flags & UMOUNT_NOFOLLOW))
  1434. lookup_flags |= LOOKUP_FOLLOW;
  1435. retval = user_path_mountpoint_at(AT_FDCWD, name, lookup_flags, &path);
  1436. if (retval)
  1437. goto out;
  1438. mnt = real_mount(path.mnt);
  1439. retval = -EINVAL;
  1440. if (path.dentry != path.mnt->mnt_root)
  1441. goto dput_and_out;
  1442. if (!check_mnt(mnt))
  1443. goto dput_and_out;
  1444. if (mnt->mnt.mnt_flags & MNT_LOCKED)
  1445. goto dput_and_out;
  1446. retval = -EPERM;
  1447. if (flags & MNT_FORCE && !capable(CAP_SYS_ADMIN))
  1448. goto dput_and_out;
  1449. retval = do_umount(mnt, flags);
  1450. dput_and_out:
  1451. /* we mustn't call path_put() as that would clear mnt_expiry_mark */
  1452. dput(path.dentry);
  1453. mntput_no_expire(mnt);
  1454. out:
  1455. return retval;
  1456. }
  1457. #ifdef __ARCH_WANT_SYS_OLDUMOUNT
  1458. /*
  1459. * The 2.0 compatible umount. No flags.
  1460. */
  1461. SYSCALL_DEFINE1(oldumount, char __user *, name)
  1462. {
  1463. return sys_umount(name, 0);
  1464. }
  1465. #endif
  1466. static bool is_mnt_ns_file(struct dentry *dentry)
  1467. {
  1468. /* Is this a proxy for a mount namespace? */
  1469. return dentry->d_op == &ns_dentry_operations &&
  1470. dentry->d_fsdata == &mntns_operations;
  1471. }
  1472. struct mnt_namespace *to_mnt_ns(struct ns_common *ns)
  1473. {
  1474. return container_of(ns, struct mnt_namespace, ns);
  1475. }
  1476. static bool mnt_ns_loop(struct dentry *dentry)
  1477. {
  1478. /* Could bind mounting the mount namespace inode cause a
  1479. * mount namespace loop?
  1480. */
  1481. struct mnt_namespace *mnt_ns;
  1482. if (!is_mnt_ns_file(dentry))
  1483. return false;
  1484. mnt_ns = to_mnt_ns(get_proc_ns(dentry->d_inode));
  1485. return current->nsproxy->mnt_ns->seq >= mnt_ns->seq;
  1486. }
  1487. struct mount *copy_tree(struct mount *mnt, struct dentry *dentry,
  1488. int flag)
  1489. {
  1490. struct mount *res, *p, *q, *r, *parent;
  1491. if (!(flag & CL_COPY_UNBINDABLE) && IS_MNT_UNBINDABLE(mnt))
  1492. return ERR_PTR(-EINVAL);
  1493. if (!(flag & CL_COPY_MNT_NS_FILE) && is_mnt_ns_file(dentry))
  1494. return ERR_PTR(-EINVAL);
  1495. res = q = clone_mnt(mnt, dentry, flag);
  1496. if (IS_ERR(q))
  1497. return q;
  1498. q->mnt_mountpoint = mnt->mnt_mountpoint;
  1499. p = mnt;
  1500. list_for_each_entry(r, &mnt->mnt_mounts, mnt_child) {
  1501. struct mount *s;
  1502. if (!is_subdir(r->mnt_mountpoint, dentry))
  1503. continue;
  1504. for (s = r; s; s = next_mnt(s, r)) {
  1505. struct mount *t = NULL;
  1506. if (!(flag & CL_COPY_UNBINDABLE) &&
  1507. IS_MNT_UNBINDABLE(s)) {
  1508. s = skip_mnt_tree(s);
  1509. continue;
  1510. }
  1511. if (!(flag & CL_COPY_MNT_NS_FILE) &&
  1512. is_mnt_ns_file(s->mnt.mnt_root)) {
  1513. s = skip_mnt_tree(s);
  1514. continue;
  1515. }
  1516. while (p != s->mnt_parent) {
  1517. p = p->mnt_parent;
  1518. q = q->mnt_parent;
  1519. }
  1520. p = s;
  1521. parent = q;
  1522. q = clone_mnt(p, p->mnt.mnt_root, flag);
  1523. if (IS_ERR(q))
  1524. goto out;
  1525. lock_mount_hash();
  1526. list_add_tail(&q->mnt_list, &res->mnt_list);
  1527. mnt_set_mountpoint(parent, p->mnt_mp, q);
  1528. if (!list_empty(&parent->mnt_mounts)) {
  1529. t = list_last_entry(&parent->mnt_mounts,
  1530. struct mount, mnt_child);
  1531. if (t->mnt_mp != p->mnt_mp)
  1532. t = NULL;
  1533. }
  1534. attach_shadowed(q, parent, t);
  1535. unlock_mount_hash();
  1536. }
  1537. }
  1538. return res;
  1539. out:
  1540. if (res) {
  1541. lock_mount_hash();
  1542. umount_tree(res, UMOUNT_SYNC);
  1543. unlock_mount_hash();
  1544. }
  1545. return q;
  1546. }
  1547. /* Caller should check returned pointer for errors */
  1548. struct vfsmount *collect_mounts(struct path *path)
  1549. {
  1550. struct mount *tree;
  1551. namespace_lock();
  1552. if (!check_mnt(real_mount(path->mnt)))
  1553. tree = ERR_PTR(-EINVAL);
  1554. else
  1555. tree = copy_tree(real_mount(path->mnt), path->dentry,
  1556. CL_COPY_ALL | CL_PRIVATE);
  1557. namespace_unlock();
  1558. if (IS_ERR(tree))
  1559. return ERR_CAST(tree);
  1560. return &tree->mnt;
  1561. }
  1562. void drop_collected_mounts(struct vfsmount *mnt)
  1563. {
  1564. namespace_lock();
  1565. lock_mount_hash();
  1566. umount_tree(real_mount(mnt), UMOUNT_SYNC);
  1567. unlock_mount_hash();
  1568. namespace_unlock();
  1569. }
  1570. /**
  1571. * clone_private_mount - create a private clone of a path
  1572. *
  1573. * This creates a new vfsmount, which will be the clone of @path. The new will
  1574. * not be attached anywhere in the namespace and will be private (i.e. changes
  1575. * to the originating mount won't be propagated into this).
  1576. *
  1577. * Release with mntput().
  1578. */
  1579. struct vfsmount *clone_private_mount(struct path *path)
  1580. {
  1581. struct mount *old_mnt = real_mount(path->mnt);
  1582. struct mount *new_mnt;
  1583. if (IS_MNT_UNBINDABLE(old_mnt))
  1584. return ERR_PTR(-EINVAL);
  1585. down_read(&namespace_sem);
  1586. new_mnt = clone_mnt(old_mnt, path->dentry, CL_PRIVATE);
  1587. up_read(&namespace_sem);
  1588. if (IS_ERR(new_mnt))
  1589. return ERR_CAST(new_mnt);
  1590. return &new_mnt->mnt;
  1591. }
  1592. EXPORT_SYMBOL_GPL(clone_private_mount);
  1593. int iterate_mounts(int (*f)(struct vfsmount *, void *), void *arg,
  1594. struct vfsmount *root)
  1595. {
  1596. struct mount *mnt;
  1597. int res = f(root, arg);
  1598. if (res)
  1599. return res;
  1600. list_for_each_entry(mnt, &real_mount(root)->mnt_list, mnt_list) {
  1601. res = f(&mnt->mnt, arg);
  1602. if (res)
  1603. return res;
  1604. }
  1605. return 0;
  1606. }
  1607. static void cleanup_group_ids(struct mount *mnt, struct mount *end)
  1608. {
  1609. struct mount *p;
  1610. for (p = mnt; p != end; p = next_mnt(p, mnt)) {
  1611. if (p->mnt_group_id && !IS_MNT_SHARED(p))
  1612. mnt_release_group_id(p);
  1613. }
  1614. }
  1615. static int invent_group_ids(struct mount *mnt, bool recurse)
  1616. {
  1617. struct mount *p;
  1618. for (p = mnt; p; p = recurse ? next_mnt(p, mnt) : NULL) {
  1619. if (!p->mnt_group_id && !IS_MNT_SHARED(p)) {
  1620. int err = mnt_alloc_group_id(p);
  1621. if (err) {
  1622. cleanup_group_ids(mnt, p);
  1623. return err;
  1624. }
  1625. }
  1626. }
  1627. return 0;
  1628. }
  1629. int count_mounts(struct mnt_namespace *ns, struct mount *mnt)
  1630. {
  1631. unsigned int max = READ_ONCE(sysctl_mount_max);
  1632. unsigned int mounts = 0, old, pending, sum;
  1633. struct mount *p;
  1634. for (p = mnt; p; p = next_mnt(p, mnt))
  1635. mounts++;
  1636. old = ns->mounts;
  1637. pending = ns->pending_mounts;
  1638. sum = old + pending;
  1639. if ((old > sum) ||
  1640. (pending > sum) ||
  1641. (max < sum) ||
  1642. (mounts > (max - sum)))
  1643. return -ENOSPC;
  1644. ns->pending_mounts = pending + mounts;
  1645. return 0;
  1646. }
  1647. /*
  1648. * @source_mnt : mount tree to be attached
  1649. * @nd : place the mount tree @source_mnt is attached
  1650. * @parent_nd : if non-null, detach the source_mnt from its parent and
  1651. * store the parent mount and mountpoint dentry.
  1652. * (done when source_mnt is moved)
  1653. *
  1654. * NOTE: in the table below explains the semantics when a source mount
  1655. * of a given type is attached to a destination mount of a given type.
  1656. * ---------------------------------------------------------------------------
  1657. * | BIND MOUNT OPERATION |
  1658. * |**************************************************************************
  1659. * | source-->| shared | private | slave | unbindable |
  1660. * | dest | | | | |
  1661. * | | | | | | |
  1662. * | v | | | | |
  1663. * |**************************************************************************
  1664. * | shared | shared (++) | shared (+) | shared(+++)| invalid |
  1665. * | | | | | |
  1666. * |non-shared| shared (+) | private | slave (*) | invalid |
  1667. * ***************************************************************************
  1668. * A bind operation clones the source mount and mounts the clone on the
  1669. * destination mount.
  1670. *
  1671. * (++) the cloned mount is propagated to all the mounts in the propagation
  1672. * tree of the destination mount and the cloned mount is added to
  1673. * the peer group of the source mount.
  1674. * (+) the cloned mount is created under the destination mount and is marked
  1675. * as shared. The cloned mount is added to the peer group of the source
  1676. * mount.
  1677. * (+++) the mount is propagated to all the mounts in the propagation tree
  1678. * of the destination mount and the cloned mount is made slave
  1679. * of the same master as that of the source mount. The cloned mount
  1680. * is marked as 'shared and slave'.
  1681. * (*) the cloned mount is made a slave of the same master as that of the
  1682. * source mount.
  1683. *
  1684. * ---------------------------------------------------------------------------
  1685. * | MOVE MOUNT OPERATION |
  1686. * |**************************************************************************
  1687. * | source-->| shared | private | slave | unbindable |
  1688. * | dest | | | | |
  1689. * | | | | | | |
  1690. * | v | | | | |
  1691. * |**************************************************************************
  1692. * | shared | shared (+) | shared (+) | shared(+++) | invalid |
  1693. * | | | | | |
  1694. * |non-shared| shared (+*) | private | slave (*) | unbindable |
  1695. * ***************************************************************************
  1696. *
  1697. * (+) the mount is moved to the destination. And is then propagated to
  1698. * all the mounts in the propagation tree of the destination mount.
  1699. * (+*) the mount is moved to the destination.
  1700. * (+++) the mount is moved to the destination and is then propagated to
  1701. * all the mounts belonging to the destination mount's propagation tree.
  1702. * the mount is marked as 'shared and slave'.
  1703. * (*) the mount continues to be a slave at the new location.
  1704. *
  1705. * if the source mount is a tree, the operations explained above is
  1706. * applied to each mount in the tree.
  1707. * Must be called without spinlocks held, since this function can sleep
  1708. * in allocations.
  1709. */
  1710. static int attach_recursive_mnt(struct mount *source_mnt,
  1711. struct mount *dest_mnt,
  1712. struct mountpoint *dest_mp,
  1713. struct path *parent_path)
  1714. {
  1715. HLIST_HEAD(tree_list);
  1716. struct mnt_namespace *ns = dest_mnt->mnt_ns;
  1717. struct mount *child, *p;
  1718. struct hlist_node *n;
  1719. int err;
  1720. /* Is there space to add these mounts to the mount namespace? */
  1721. if (!parent_path) {
  1722. err = count_mounts(ns, source_mnt);
  1723. if (err)
  1724. goto out;
  1725. }
  1726. if (IS_MNT_SHARED(dest_mnt)) {
  1727. err = invent_group_ids(source_mnt, true);
  1728. if (err)
  1729. goto out;
  1730. err = propagate_mnt(dest_mnt, dest_mp, source_mnt, &tree_list);
  1731. lock_mount_hash();
  1732. if (err)
  1733. goto out_cleanup_ids;
  1734. for (p = source_mnt; p; p = next_mnt(p, source_mnt))
  1735. set_mnt_shared(p);
  1736. } else {
  1737. lock_mount_hash();
  1738. }
  1739. if (parent_path) {
  1740. detach_mnt(source_mnt, parent_path);
  1741. attach_mnt(source_mnt, dest_mnt, dest_mp);
  1742. touch_mnt_namespace(source_mnt->mnt_ns);
  1743. } else {
  1744. mnt_set_mountpoint(dest_mnt, dest_mp, source_mnt);
  1745. commit_tree(source_mnt, NULL);
  1746. }
  1747. hlist_for_each_entry_safe(child, n, &tree_list, mnt_hash) {
  1748. struct mount *q;
  1749. hlist_del_init(&child->mnt_hash);
  1750. q = __lookup_mnt_last(&child->mnt_parent->mnt,
  1751. child->mnt_mountpoint);
  1752. commit_tree(child, q);
  1753. }
  1754. unlock_mount_hash();
  1755. return 0;
  1756. out_cleanup_ids:
  1757. while (!hlist_empty(&tree_list)) {
  1758. child = hlist_entry(tree_list.first, struct mount, mnt_hash);
  1759. child->mnt_parent->mnt_ns->pending_mounts = 0;
  1760. umount_tree(child, UMOUNT_SYNC);
  1761. }
  1762. unlock_mount_hash();
  1763. cleanup_group_ids(source_mnt, NULL);
  1764. out:
  1765. ns->pending_mounts = 0;
  1766. return err;
  1767. }
  1768. static struct mountpoint *lock_mount(struct path *path)
  1769. {
  1770. struct vfsmount *mnt;
  1771. struct dentry *dentry = path->dentry;
  1772. retry:
  1773. inode_lock(dentry->d_inode);
  1774. if (unlikely(cant_mount(dentry))) {
  1775. inode_unlock(dentry->d_inode);
  1776. return ERR_PTR(-ENOENT);
  1777. }
  1778. namespace_lock();
  1779. mnt = lookup_mnt(path);
  1780. if (likely(!mnt)) {
  1781. struct mountpoint *mp = lookup_mountpoint(dentry);
  1782. if (!mp)
  1783. mp = new_mountpoint(dentry);
  1784. if (IS_ERR(mp)) {
  1785. namespace_unlock();
  1786. inode_unlock(dentry->d_inode);
  1787. return mp;
  1788. }
  1789. return mp;
  1790. }
  1791. namespace_unlock();
  1792. inode_unlock(path->dentry->d_inode);
  1793. path_put(path);
  1794. path->mnt = mnt;
  1795. dentry = path->dentry = dget(mnt->mnt_root);
  1796. goto retry;
  1797. }
  1798. static void unlock_mount(struct mountpoint *where)
  1799. {
  1800. struct dentry *dentry = where->m_dentry;
  1801. put_mountpoint(where);
  1802. namespace_unlock();
  1803. inode_unlock(dentry->d_inode);
  1804. }
  1805. static int graft_tree(struct mount *mnt, struct mount *p, struct mountpoint *mp)
  1806. {
  1807. if (mnt->mnt.mnt_sb->s_flags & MS_NOUSER)
  1808. return -EINVAL;
  1809. if (d_is_dir(mp->m_dentry) !=
  1810. d_is_dir(mnt->mnt.mnt_root))
  1811. return -ENOTDIR;
  1812. return attach_recursive_mnt(mnt, p, mp, NULL);
  1813. }
  1814. /*
  1815. * Sanity check the flags to change_mnt_propagation.
  1816. */
  1817. static int flags_to_propagation_type(int flags)
  1818. {
  1819. int type = flags & ~(MS_REC | MS_SILENT);
  1820. /* Fail if any non-propagation flags are set */
  1821. if (type & ~(MS_SHARED | MS_PRIVATE | MS_SLAVE | MS_UNBINDABLE))
  1822. return 0;
  1823. /* Only one propagation flag should be set */
  1824. if (!is_power_of_2(type))
  1825. return 0;
  1826. return type;
  1827. }
  1828. /*
  1829. * recursively change the type of the mountpoint.
  1830. */
  1831. static int do_change_type(struct path *path, int flag)
  1832. {
  1833. struct mount *m;
  1834. struct mount *mnt = real_mount(path->mnt);
  1835. int recurse = flag & MS_REC;
  1836. int type;
  1837. int err = 0;
  1838. if (path->dentry != path->mnt->mnt_root)
  1839. return -EINVAL;
  1840. type = flags_to_propagation_type(flag);
  1841. if (!type)
  1842. return -EINVAL;
  1843. namespace_lock();
  1844. if (type == MS_SHARED) {
  1845. err = invent_group_ids(mnt, recurse);
  1846. if (err)
  1847. goto out_unlock;
  1848. }
  1849. lock_mount_hash();
  1850. for (m = mnt; m; m = (recurse ? next_mnt(m, mnt) : NULL))
  1851. change_mnt_propagation(m, type);
  1852. unlock_mount_hash();
  1853. out_unlock:
  1854. namespace_unlock();
  1855. return err;
  1856. }
  1857. static bool has_locked_children(struct mount *mnt, struct dentry *dentry)
  1858. {
  1859. struct mount *child;
  1860. list_for_each_entry(child, &mnt->mnt_mounts, mnt_child) {
  1861. if (!is_subdir(child->mnt_mountpoint, dentry))
  1862. continue;
  1863. if (child->mnt.mnt_flags & MNT_LOCKED)
  1864. return true;
  1865. }
  1866. return false;
  1867. }
  1868. /*
  1869. * do loopback mount.
  1870. */
  1871. static int do_loopback(struct path *path, const char *old_name,
  1872. int recurse)
  1873. {
  1874. struct path old_path;
  1875. struct mount *mnt = NULL, *old, *parent;
  1876. struct mountpoint *mp;
  1877. int err;
  1878. if (!old_name || !*old_name)
  1879. return -EINVAL;
  1880. err = kern_path(old_name, LOOKUP_FOLLOW|LOOKUP_AUTOMOUNT, &old_path);
  1881. if (err)
  1882. return err;
  1883. err = -EINVAL;
  1884. if (mnt_ns_loop(old_path.dentry))
  1885. goto out;
  1886. mp = lock_mount(path);
  1887. err = PTR_ERR(mp);
  1888. if (IS_ERR(mp))
  1889. goto out;
  1890. old = real_mount(old_path.mnt);
  1891. parent = real_mount(path->mnt);
  1892. err = -EINVAL;
  1893. if (IS_MNT_UNBINDABLE(old))
  1894. goto out2;
  1895. if (!check_mnt(parent))
  1896. goto out2;
  1897. if (!check_mnt(old) && old_path.dentry->d_op != &ns_dentry_operations)
  1898. goto out2;
  1899. if (!recurse && has_locked_children(old, old_path.dentry))
  1900. goto out2;
  1901. if (recurse)
  1902. mnt = copy_tree(old, old_path.dentry, CL_COPY_MNT_NS_FILE);
  1903. else
  1904. mnt = clone_mnt(old, old_path.dentry, 0);
  1905. if (IS_ERR(mnt)) {
  1906. err = PTR_ERR(mnt);
  1907. goto out2;
  1908. }
  1909. mnt->mnt.mnt_flags &= ~MNT_LOCKED;
  1910. err = graft_tree(mnt, parent, mp);
  1911. if (err) {
  1912. lock_mount_hash();
  1913. umount_tree(mnt, UMOUNT_SYNC);
  1914. unlock_mount_hash();
  1915. }
  1916. out2:
  1917. unlock_mount(mp);
  1918. out:
  1919. path_put(&old_path);
  1920. return err;
  1921. }
  1922. static int change_mount_flags(struct vfsmount *mnt, int ms_flags)
  1923. {
  1924. int error = 0;
  1925. int readonly_request = 0;
  1926. if (ms_flags & MS_RDONLY)
  1927. readonly_request = 1;
  1928. if (readonly_request == __mnt_is_readonly(mnt))
  1929. return 0;
  1930. if (readonly_request)
  1931. error = mnt_make_readonly(real_mount(mnt));
  1932. else
  1933. __mnt_unmake_readonly(real_mount(mnt));
  1934. return error;
  1935. }
  1936. /*
  1937. * change filesystem flags. dir should be a physical root of filesystem.
  1938. * If you've mounted a non-root directory somewhere and want to do remount
  1939. * on it - tough luck.
  1940. */
  1941. static int do_remount(struct path *path, int flags, int mnt_flags,
  1942. void *data)
  1943. {
  1944. int err;
  1945. struct super_block *sb = path->mnt->mnt_sb;
  1946. struct mount *mnt = real_mount(path->mnt);
  1947. if (!check_mnt(mnt))
  1948. return -EINVAL;
  1949. if (path->dentry != path->mnt->mnt_root)
  1950. return -EINVAL;
  1951. /* Don't allow changing of locked mnt flags.
  1952. *
  1953. * No locks need to be held here while testing the various
  1954. * MNT_LOCK flags because those flags can never be cleared
  1955. * once they are set.
  1956. */
  1957. if ((mnt->mnt.mnt_flags & MNT_LOCK_READONLY) &&
  1958. !(mnt_flags & MNT_READONLY)) {
  1959. return -EPERM;
  1960. }
  1961. if ((mnt->mnt.mnt_flags & MNT_LOCK_NODEV) &&
  1962. !(mnt_flags & MNT_NODEV)) {
  1963. return -EPERM;
  1964. }
  1965. if ((mnt->mnt.mnt_flags & MNT_LOCK_NOSUID) &&
  1966. !(mnt_flags & MNT_NOSUID)) {
  1967. return -EPERM;
  1968. }
  1969. if ((mnt->mnt.mnt_flags & MNT_LOCK_NOEXEC) &&
  1970. !(mnt_flags & MNT_NOEXEC)) {
  1971. return -EPERM;
  1972. }
  1973. if ((mnt->mnt.mnt_flags & MNT_LOCK_ATIME) &&
  1974. ((mnt->mnt.mnt_flags & MNT_ATIME_MASK) != (mnt_flags & MNT_ATIME_MASK))) {
  1975. return -EPERM;
  1976. }
  1977. err = security_sb_remount(sb, data);
  1978. if (err)
  1979. return err;
  1980. down_write(&sb->s_umount);
  1981. if (flags & MS_BIND)
  1982. err = change_mount_flags(path->mnt, flags);
  1983. else if (!capable(CAP_SYS_ADMIN))
  1984. err = -EPERM;
  1985. else
  1986. err = do_remount_sb(sb, flags, data, 0);
  1987. if (!err) {
  1988. lock_mount_hash();
  1989. mnt_flags |= mnt->mnt.mnt_flags & ~MNT_USER_SETTABLE_MASK;
  1990. mnt->mnt.mnt_flags = mnt_flags;
  1991. touch_mnt_namespace(mnt->mnt_ns);
  1992. unlock_mount_hash();
  1993. }
  1994. up_write(&sb->s_umount);
  1995. return err;
  1996. }
  1997. static inline int tree_contains_unbindable(struct mount *mnt)
  1998. {
  1999. struct mount *p;
  2000. for (p = mnt; p; p = next_mnt(p, mnt)) {
  2001. if (IS_MNT_UNBINDABLE(p))
  2002. return 1;
  2003. }
  2004. return 0;
  2005. }
  2006. static int do_move_mount(struct path *path, const char *old_name)
  2007. {
  2008. struct path old_path, parent_path;
  2009. struct mount *p;
  2010. struct mount *old;
  2011. struct mountpoint *mp;
  2012. int err;
  2013. if (!old_name || !*old_name)
  2014. return -EINVAL;
  2015. err = kern_path(old_name, LOOKUP_FOLLOW, &old_path);
  2016. if (err)
  2017. return err;
  2018. mp = lock_mount(path);
  2019. err = PTR_ERR(mp);
  2020. if (IS_ERR(mp))
  2021. goto out;
  2022. old = real_mount(old_path.mnt);
  2023. p = real_mount(path->mnt);
  2024. err = -EINVAL;
  2025. if (!check_mnt(p) || !check_mnt(old))
  2026. goto out1;
  2027. if (old->mnt.mnt_flags & MNT_LOCKED)
  2028. goto out1;
  2029. err = -EINVAL;
  2030. if (old_path.dentry != old_path.mnt->mnt_root)
  2031. goto out1;
  2032. if (!mnt_has_parent(old))
  2033. goto out1;
  2034. if (d_is_dir(path->dentry) !=
  2035. d_is_dir(old_path.dentry))
  2036. goto out1;
  2037. /*
  2038. * Don't move a mount residing in a shared parent.
  2039. */
  2040. if (IS_MNT_SHARED(old->mnt_parent))
  2041. goto out1;
  2042. /*
  2043. * Don't move a mount tree containing unbindable mounts to a destination
  2044. * mount which is shared.
  2045. */
  2046. if (IS_MNT_SHARED(p) && tree_contains_unbindable(old))
  2047. goto out1;
  2048. err = -ELOOP;
  2049. for (; mnt_has_parent(p); p = p->mnt_parent)
  2050. if (p == old)
  2051. goto out1;
  2052. err = attach_recursive_mnt(old, real_mount(path->mnt), mp, &parent_path);
  2053. if (err)
  2054. goto out1;
  2055. /* if the mount is moved, it should no longer be expire
  2056. * automatically */
  2057. list_del_init(&old->mnt_expire);
  2058. out1:
  2059. unlock_mount(mp);
  2060. out:
  2061. if (!err)
  2062. path_put(&parent_path);
  2063. path_put(&old_path);
  2064. return err;
  2065. }
  2066. static struct vfsmount *fs_set_subtype(struct vfsmount *mnt, const char *fstype)
  2067. {
  2068. int err;
  2069. const char *subtype = strchr(fstype, '.');
  2070. if (subtype) {
  2071. subtype++;
  2072. err = -EINVAL;
  2073. if (!subtype[0])
  2074. goto err;
  2075. } else
  2076. subtype = "";
  2077. mnt->mnt_sb->s_subtype = kstrdup(subtype, GFP_KERNEL);
  2078. err = -ENOMEM;
  2079. if (!mnt->mnt_sb->s_subtype)
  2080. goto err;
  2081. return mnt;
  2082. err:
  2083. mntput(mnt);
  2084. return ERR_PTR(err);
  2085. }
  2086. /*
  2087. * add a mount into a namespace's mount tree
  2088. */
  2089. static int do_add_mount(struct mount *newmnt, struct path *path, int mnt_flags)
  2090. {
  2091. struct mountpoint *mp;
  2092. struct mount *parent;
  2093. int err;
  2094. mnt_flags &= ~MNT_INTERNAL_FLAGS;
  2095. mp = lock_mount(path);
  2096. if (IS_ERR(mp))
  2097. return PTR_ERR(mp);
  2098. parent = real_mount(path->mnt);
  2099. err = -EINVAL;
  2100. if (unlikely(!check_mnt(parent))) {
  2101. /* that's acceptable only for automounts done in private ns */
  2102. if (!(mnt_flags & MNT_SHRINKABLE))
  2103. goto unlock;
  2104. /* ... and for those we'd better have mountpoint still alive */
  2105. if (!parent->mnt_ns)
  2106. goto unlock;
  2107. }
  2108. /* Refuse the same filesystem on the same mount point */
  2109. err = -EBUSY;
  2110. if (path->mnt->mnt_sb == newmnt->mnt.mnt_sb &&
  2111. path->mnt->mnt_root == path->dentry)
  2112. goto unlock;
  2113. err = -EINVAL;
  2114. if (d_is_symlink(newmnt->mnt.mnt_root))
  2115. goto unlock;
  2116. newmnt->mnt.mnt_flags = mnt_flags;
  2117. err = graft_tree(newmnt, parent, mp);
  2118. unlock:
  2119. unlock_mount(mp);
  2120. return err;
  2121. }
  2122. static bool mount_too_revealing(struct vfsmount *mnt, int *new_mnt_flags);
  2123. /*
  2124. * create a new mount for userspace and request it to be added into the
  2125. * namespace's tree
  2126. */
  2127. static int do_new_mount(struct path *path, const char *fstype, int flags,
  2128. int mnt_flags, const char *name, void *data)
  2129. {
  2130. struct file_system_type *type;
  2131. struct vfsmount *mnt;
  2132. int err;
  2133. if (!fstype)
  2134. return -EINVAL;
  2135. type = get_fs_type(fstype);
  2136. if (!type)
  2137. return -ENODEV;
  2138. mnt = vfs_kern_mount(type, flags, name, data);
  2139. if (!IS_ERR(mnt) && (type->fs_flags & FS_HAS_SUBTYPE) &&
  2140. !mnt->mnt_sb->s_subtype)
  2141. mnt = fs_set_subtype(mnt, fstype);
  2142. put_filesystem(type);
  2143. if (IS_ERR(mnt))
  2144. return PTR_ERR(mnt);
  2145. if (mount_too_revealing(mnt, &mnt_flags)) {
  2146. mntput(mnt);
  2147. return -EPERM;
  2148. }
  2149. err = do_add_mount(real_mount(mnt), path, mnt_flags);
  2150. if (err)
  2151. mntput(mnt);
  2152. return err;
  2153. }
  2154. int finish_automount(struct vfsmount *m, struct path *path)
  2155. {
  2156. struct mount *mnt = real_mount(m);
  2157. int err;
  2158. /* The new mount record should have at least 2 refs to prevent it being
  2159. * expired before we get a chance to add it
  2160. */
  2161. BUG_ON(mnt_get_count(mnt) < 2);
  2162. if (m->mnt_sb == path->mnt->mnt_sb &&
  2163. m->mnt_root == path->dentry) {
  2164. err = -ELOOP;
  2165. goto fail;
  2166. }
  2167. err = do_add_mount(mnt, path, path->mnt->mnt_flags | MNT_SHRINKABLE);
  2168. if (!err)
  2169. return 0;
  2170. fail:
  2171. /* remove m from any expiration list it may be on */
  2172. if (!list_empty(&mnt->mnt_expire)) {
  2173. namespace_lock();
  2174. list_del_init(&mnt->mnt_expire);
  2175. namespace_unlock();
  2176. }
  2177. mntput(m);
  2178. mntput(m);
  2179. return err;
  2180. }
  2181. /**
  2182. * mnt_set_expiry - Put a mount on an expiration list
  2183. * @mnt: The mount to list.
  2184. * @expiry_list: The list to add the mount to.
  2185. */
  2186. void mnt_set_expiry(struct vfsmount *mnt, struct list_head *expiry_list)
  2187. {
  2188. namespace_lock();
  2189. list_add_tail(&real_mount(mnt)->mnt_expire, expiry_list);
  2190. namespace_unlock();
  2191. }
  2192. EXPORT_SYMBOL(mnt_set_expiry);
  2193. /*
  2194. * process a list of expirable mountpoints with the intent of discarding any
  2195. * mountpoints that aren't in use and haven't been touched since last we came
  2196. * here
  2197. */
  2198. void mark_mounts_for_expiry(struct list_head *mounts)
  2199. {
  2200. struct mount *mnt, *next;
  2201. LIST_HEAD(graveyard);
  2202. if (list_empty(mounts))
  2203. return;
  2204. namespace_lock();
  2205. lock_mount_hash();
  2206. /* extract from the expiration list every vfsmount that matches the
  2207. * following criteria:
  2208. * - only referenced by its parent vfsmount
  2209. * - still marked for expiry (marked on the last call here; marks are
  2210. * cleared by mntput())
  2211. */
  2212. list_for_each_entry_safe(mnt, next, mounts, mnt_expire) {
  2213. if (!xchg(&mnt->mnt_expiry_mark, 1) ||
  2214. propagate_mount_busy(mnt, 1))
  2215. continue;
  2216. list_move(&mnt->mnt_expire, &graveyard);
  2217. }
  2218. while (!list_empty(&graveyard)) {
  2219. mnt = list_first_entry(&graveyard, struct mount, mnt_expire);
  2220. touch_mnt_namespace(mnt->mnt_ns);
  2221. umount_tree(mnt, UMOUNT_PROPAGATE|UMOUNT_SYNC);
  2222. }
  2223. unlock_mount_hash();
  2224. namespace_unlock();
  2225. }
  2226. EXPORT_SYMBOL_GPL(mark_mounts_for_expiry);
  2227. /*
  2228. * Ripoff of 'select_parent()'
  2229. *
  2230. * search the list of submounts for a given mountpoint, and move any
  2231. * shrinkable submounts to the 'graveyard' list.
  2232. */
  2233. static int select_submounts(struct mount *parent, struct list_head *graveyard)
  2234. {
  2235. struct mount *this_parent = parent;
  2236. struct list_head *next;
  2237. int found = 0;
  2238. repeat:
  2239. next = this_parent->mnt_mounts.next;
  2240. resume:
  2241. while (next != &this_parent->mnt_mounts) {
  2242. struct list_head *tmp = next;
  2243. struct mount *mnt = list_entry(tmp, struct mount, mnt_child);
  2244. next = tmp->next;
  2245. if (!(mnt->mnt.mnt_flags & MNT_SHRINKABLE))
  2246. continue;
  2247. /*
  2248. * Descend a level if the d_mounts list is non-empty.
  2249. */
  2250. if (!list_empty(&mnt->mnt_mounts)) {
  2251. this_parent = mnt;
  2252. goto repeat;
  2253. }
  2254. if (!propagate_mount_busy(mnt, 1)) {
  2255. list_move_tail(&mnt->mnt_expire, graveyard);
  2256. found++;
  2257. }
  2258. }
  2259. /*
  2260. * All done at this level ... ascend and resume the search
  2261. */
  2262. if (this_parent != parent) {
  2263. next = this_parent->mnt_child.next;
  2264. this_parent = this_parent->mnt_parent;
  2265. goto resume;
  2266. }
  2267. return found;
  2268. }
  2269. /*
  2270. * process a list of expirable mountpoints with the intent of discarding any
  2271. * submounts of a specific parent mountpoint
  2272. *
  2273. * mount_lock must be held for write
  2274. */
  2275. static void shrink_submounts(struct mount *mnt)
  2276. {
  2277. LIST_HEAD(graveyard);
  2278. struct mount *m;
  2279. /* extract submounts of 'mountpoint' from the expiration list */
  2280. while (select_submounts(mnt, &graveyard)) {
  2281. while (!list_empty(&graveyard)) {
  2282. m = list_first_entry(&graveyard, struct mount,
  2283. mnt_expire);
  2284. touch_mnt_namespace(m->mnt_ns);
  2285. umount_tree(m, UMOUNT_PROPAGATE|UMOUNT_SYNC);
  2286. }
  2287. }
  2288. }
  2289. /*
  2290. * Some copy_from_user() implementations do not return the exact number of
  2291. * bytes remaining to copy on a fault. But copy_mount_options() requires that.
  2292. * Note that this function differs from copy_from_user() in that it will oops
  2293. * on bad values of `to', rather than returning a short copy.
  2294. */
  2295. static long exact_copy_from_user(void *to, const void __user * from,
  2296. unsigned long n)
  2297. {
  2298. char *t = to;
  2299. const char __user *f = from;
  2300. char c;
  2301. if (!access_ok(VERIFY_READ, from, n))
  2302. return n;
  2303. while (n) {
  2304. if (__get_user(c, f)) {
  2305. memset(t, 0, n);
  2306. break;
  2307. }
  2308. *t++ = c;
  2309. f++;
  2310. n--;
  2311. }
  2312. return n;
  2313. }
  2314. void *copy_mount_options(const void __user * data)
  2315. {
  2316. int i;
  2317. unsigned long size;
  2318. char *copy;
  2319. if (!data)
  2320. return NULL;
  2321. copy = kmalloc(PAGE_SIZE, GFP_KERNEL);
  2322. if (!copy)
  2323. return ERR_PTR(-ENOMEM);
  2324. /* We only care that *some* data at the address the user
  2325. * gave us is valid. Just in case, we'll zero
  2326. * the remainder of the page.
  2327. */
  2328. /* copy_from_user cannot cross TASK_SIZE ! */
  2329. size = TASK_SIZE - (unsigned long)data;
  2330. if (size > PAGE_SIZE)
  2331. size = PAGE_SIZE;
  2332. i = size - exact_copy_from_user(copy, data, size);
  2333. if (!i) {
  2334. kfree(copy);
  2335. return ERR_PTR(-EFAULT);
  2336. }
  2337. if (i != PAGE_SIZE)
  2338. memset(copy + i, 0, PAGE_SIZE - i);
  2339. return copy;
  2340. }
  2341. char *copy_mount_string(const void __user *data)
  2342. {
  2343. return data ? strndup_user(data, PAGE_SIZE) : NULL;
  2344. }
  2345. /*
  2346. * Flags is a 32-bit value that allows up to 31 non-fs dependent flags to
  2347. * be given to the mount() call (ie: read-only, no-dev, no-suid etc).
  2348. *
  2349. * data is a (void *) that can point to any structure up to
  2350. * PAGE_SIZE-1 bytes, which can contain arbitrary fs-dependent
  2351. * information (or be NULL).
  2352. *
  2353. * Pre-0.97 versions of mount() didn't have a flags word.
  2354. * When the flags word was introduced its top half was required
  2355. * to have the magic value 0xC0ED, and this remained so until 2.4.0-test9.
  2356. * Therefore, if this magic number is present, it carries no information
  2357. * and must be discarded.
  2358. */
  2359. long do_mount(const char *dev_name, const char __user *dir_name,
  2360. const char *type_page, unsigned long flags, void *data_page)
  2361. {
  2362. struct path path;
  2363. int retval = 0;
  2364. int mnt_flags = 0;
  2365. /* Discard magic */
  2366. if ((flags & MS_MGC_MSK) == MS_MGC_VAL)
  2367. flags &= ~MS_MGC_MSK;
  2368. /* Basic sanity checks */
  2369. if (data_page)
  2370. ((char *)data_page)[PAGE_SIZE - 1] = 0;
  2371. /* ... and get the mountpoint */
  2372. retval = user_path(dir_name, &path);
  2373. if (retval)
  2374. return retval;
  2375. retval = security_sb_mount(dev_name, &path,
  2376. type_page, flags, data_page);
  2377. if (!retval && !may_mount())
  2378. retval = -EPERM;
  2379. if (!retval && (flags & MS_MANDLOCK) && !may_mandlock())
  2380. retval = -EPERM;
  2381. if (retval)
  2382. goto dput_out;
  2383. /* Default to relatime unless overriden */
  2384. if (!(flags & MS_NOATIME))
  2385. mnt_flags |= MNT_RELATIME;
  2386. /* Separate the per-mountpoint flags */
  2387. if (flags & MS_NOSUID)
  2388. mnt_flags |= MNT_NOSUID;
  2389. if (flags & MS_NODEV)
  2390. mnt_flags |= MNT_NODEV;
  2391. if (flags & MS_NOEXEC)
  2392. mnt_flags |= MNT_NOEXEC;
  2393. if (flags & MS_NOATIME)
  2394. mnt_flags |= MNT_NOATIME;
  2395. if (flags & MS_NODIRATIME)
  2396. mnt_flags |= MNT_NODIRATIME;
  2397. if (flags & MS_STRICTATIME)
  2398. mnt_flags &= ~(MNT_RELATIME | MNT_NOATIME);
  2399. if (flags & MS_RDONLY)
  2400. mnt_flags |= MNT_READONLY;
  2401. /* The default atime for remount is preservation */
  2402. if ((flags & MS_REMOUNT) &&
  2403. ((flags & (MS_NOATIME | MS_NODIRATIME | MS_RELATIME |
  2404. MS_STRICTATIME)) == 0)) {
  2405. mnt_flags &= ~MNT_ATIME_MASK;
  2406. mnt_flags |= path.mnt->mnt_flags & MNT_ATIME_MASK;
  2407. }
  2408. flags &= ~(MS_NOSUID | MS_NOEXEC | MS_NODEV | MS_ACTIVE | MS_BORN |
  2409. MS_NOATIME | MS_NODIRATIME | MS_RELATIME| MS_KERNMOUNT |
  2410. MS_STRICTATIME | MS_NOREMOTELOCK);
  2411. if (flags & MS_REMOUNT)
  2412. retval = do_remount(&path, flags & ~MS_REMOUNT, mnt_flags,
  2413. data_page);
  2414. else if (flags & MS_BIND)
  2415. retval = do_loopback(&path, dev_name, flags & MS_REC);
  2416. else if (flags & (MS_SHARED | MS_PRIVATE | MS_SLAVE | MS_UNBINDABLE))
  2417. retval = do_change_type(&path, flags);
  2418. else if (flags & MS_MOVE)
  2419. retval = do_move_mount(&path, dev_name);
  2420. else
  2421. retval = do_new_mount(&path, type_page, flags, mnt_flags,
  2422. dev_name, data_page);
  2423. dput_out:
  2424. path_put(&path);
  2425. return retval;
  2426. }
  2427. static struct ucounts *inc_mnt_namespaces(struct user_namespace *ns)
  2428. {
  2429. return inc_ucount(ns, current_euid(), UCOUNT_MNT_NAMESPACES);
  2430. }
  2431. static void dec_mnt_namespaces(struct ucounts *ucounts)
  2432. {
  2433. dec_ucount(ucounts, UCOUNT_MNT_NAMESPACES);
  2434. }
  2435. static void free_mnt_ns(struct mnt_namespace *ns)
  2436. {
  2437. ns_free_inum(&ns->ns);
  2438. dec_mnt_namespaces(ns->ucounts);
  2439. put_user_ns(ns->user_ns);
  2440. kfree(ns);
  2441. }
  2442. /*
  2443. * Assign a sequence number so we can detect when we attempt to bind
  2444. * mount a reference to an older mount namespace into the current
  2445. * mount namespace, preventing reference counting loops. A 64bit
  2446. * number incrementing at 10Ghz will take 12,427 years to wrap which
  2447. * is effectively never, so we can ignore the possibility.
  2448. */
  2449. static atomic64_t mnt_ns_seq = ATOMIC64_INIT(1);
  2450. static struct mnt_namespace *alloc_mnt_ns(struct user_namespace *user_ns)
  2451. {
  2452. struct mnt_namespace *new_ns;
  2453. struct ucounts *ucounts;
  2454. int ret;
  2455. ucounts = inc_mnt_namespaces(user_ns);
  2456. if (!ucounts)
  2457. return ERR_PTR(-ENOSPC);
  2458. new_ns = kmalloc(sizeof(struct mnt_namespace), GFP_KERNEL);
  2459. if (!new_ns) {
  2460. dec_mnt_namespaces(ucounts);
  2461. return ERR_PTR(-ENOMEM);
  2462. }
  2463. ret = ns_alloc_inum(&new_ns->ns);
  2464. if (ret) {
  2465. kfree(new_ns);
  2466. dec_mnt_namespaces(ucounts);
  2467. return ERR_PTR(ret);
  2468. }
  2469. new_ns->ns.ops = &mntns_operations;
  2470. new_ns->seq = atomic64_add_return(1, &mnt_ns_seq);
  2471. atomic_set(&new_ns->count, 1);
  2472. new_ns->root = NULL;
  2473. INIT_LIST_HEAD(&new_ns->list);
  2474. init_waitqueue_head(&new_ns->poll);
  2475. new_ns->event = 0;
  2476. new_ns->user_ns = get_user_ns(user_ns);
  2477. new_ns->ucounts = ucounts;
  2478. new_ns->mounts = 0;
  2479. new_ns->pending_mounts = 0;
  2480. return new_ns;
  2481. }
  2482. __latent_entropy
  2483. struct mnt_namespace *copy_mnt_ns(unsigned long flags, struct mnt_namespace *ns,
  2484. struct user_namespace *user_ns, struct fs_struct *new_fs)
  2485. {
  2486. struct mnt_namespace *new_ns;
  2487. struct vfsmount *rootmnt = NULL, *pwdmnt = NULL;
  2488. struct mount *p, *q;
  2489. struct mount *old;
  2490. struct mount *new;
  2491. int copy_flags;
  2492. BUG_ON(!ns);
  2493. if (likely(!(flags & CLONE_NEWNS))) {
  2494. get_mnt_ns(ns);
  2495. return ns;
  2496. }
  2497. old = ns->root;
  2498. new_ns = alloc_mnt_ns(user_ns);
  2499. if (IS_ERR(new_ns))
  2500. return new_ns;
  2501. namespace_lock();
  2502. /* First pass: copy the tree topology */
  2503. copy_flags = CL_COPY_UNBINDABLE | CL_EXPIRE;
  2504. if (user_ns != ns->user_ns)
  2505. copy_flags |= CL_SHARED_TO_SLAVE | CL_UNPRIVILEGED;
  2506. new = copy_tree(old, old->mnt.mnt_root, copy_flags);
  2507. if (IS_ERR(new)) {
  2508. namespace_unlock();
  2509. free_mnt_ns(new_ns);
  2510. return ERR_CAST(new);
  2511. }
  2512. new_ns->root = new;
  2513. list_add_tail(&new_ns->list, &new->mnt_list);
  2514. /*
  2515. * Second pass: switch the tsk->fs->* elements and mark new vfsmounts
  2516. * as belonging to new namespace. We have already acquired a private
  2517. * fs_struct, so tsk->fs->lock is not needed.
  2518. */
  2519. p = old;
  2520. q = new;
  2521. while (p) {
  2522. q->mnt_ns = new_ns;
  2523. new_ns->mounts++;
  2524. if (new_fs) {
  2525. if (&p->mnt == new_fs->root.mnt) {
  2526. new_fs->root.mnt = mntget(&q->mnt);
  2527. rootmnt = &p->mnt;
  2528. }
  2529. if (&p->mnt == new_fs->pwd.mnt) {
  2530. new_fs->pwd.mnt = mntget(&q->mnt);
  2531. pwdmnt = &p->mnt;
  2532. }
  2533. }
  2534. p = next_mnt(p, old);
  2535. q = next_mnt(q, new);
  2536. if (!q)
  2537. break;
  2538. while (p->mnt.mnt_root != q->mnt.mnt_root)
  2539. p = next_mnt(p, old);
  2540. }
  2541. namespace_unlock();
  2542. if (rootmnt)
  2543. mntput(rootmnt);
  2544. if (pwdmnt)
  2545. mntput(pwdmnt);
  2546. return new_ns;
  2547. }
  2548. /**
  2549. * create_mnt_ns - creates a private namespace and adds a root filesystem
  2550. * @mnt: pointer to the new root filesystem mountpoint
  2551. */
  2552. static struct mnt_namespace *create_mnt_ns(struct vfsmount *m)
  2553. {
  2554. struct mnt_namespace *new_ns = alloc_mnt_ns(&init_user_ns);
  2555. if (!IS_ERR(new_ns)) {
  2556. struct mount *mnt = real_mount(m);
  2557. mnt->mnt_ns = new_ns;
  2558. new_ns->root = mnt;
  2559. new_ns->mounts++;
  2560. list_add(&mnt->mnt_list, &new_ns->list);
  2561. } else {
  2562. mntput(m);
  2563. }
  2564. return new_ns;
  2565. }
  2566. struct dentry *mount_subtree(struct vfsmount *mnt, const char *name)
  2567. {
  2568. struct mnt_namespace *ns;
  2569. struct super_block *s;
  2570. struct path path;
  2571. int err;
  2572. ns = create_mnt_ns(mnt);
  2573. if (IS_ERR(ns))
  2574. return ERR_CAST(ns);
  2575. err = vfs_path_lookup(mnt->mnt_root, mnt,
  2576. name, LOOKUP_FOLLOW|LOOKUP_AUTOMOUNT, &path);
  2577. put_mnt_ns(ns);
  2578. if (err)
  2579. return ERR_PTR(err);
  2580. /* trade a vfsmount reference for active sb one */
  2581. s = path.mnt->mnt_sb;
  2582. atomic_inc(&s->s_active);
  2583. mntput(path.mnt);
  2584. /* lock the sucker */
  2585. down_write(&s->s_umount);
  2586. /* ... and return the root of (sub)tree on it */
  2587. return path.dentry;
  2588. }
  2589. EXPORT_SYMBOL(mount_subtree);
  2590. SYSCALL_DEFINE5(mount, char __user *, dev_name, char __user *, dir_name,
  2591. char __user *, type, unsigned long, flags, void __user *, data)
  2592. {
  2593. int ret;
  2594. char *kernel_type;
  2595. char *kernel_dev;
  2596. void *options;
  2597. kernel_type = copy_mount_string(type);
  2598. ret = PTR_ERR(kernel_type);
  2599. if (IS_ERR(kernel_type))
  2600. goto out_type;
  2601. kernel_dev = copy_mount_string(dev_name);
  2602. ret = PTR_ERR(kernel_dev);
  2603. if (IS_ERR(kernel_dev))
  2604. goto out_dev;
  2605. options = copy_mount_options(data);
  2606. ret = PTR_ERR(options);
  2607. if (IS_ERR(options))
  2608. goto out_data;
  2609. ret = do_mount(kernel_dev, dir_name, kernel_type, flags, options);
  2610. kfree(options);
  2611. out_data:
  2612. kfree(kernel_dev);
  2613. out_dev:
  2614. kfree(kernel_type);
  2615. out_type:
  2616. return ret;
  2617. }
  2618. /*
  2619. * Return true if path is reachable from root
  2620. *
  2621. * namespace_sem or mount_lock is held
  2622. */
  2623. bool is_path_reachable(struct mount *mnt, struct dentry *dentry,
  2624. const struct path *root)
  2625. {
  2626. while (&mnt->mnt != root->mnt && mnt_has_parent(mnt)) {
  2627. dentry = mnt->mnt_mountpoint;
  2628. mnt = mnt->mnt_parent;
  2629. }
  2630. return &mnt->mnt == root->mnt && is_subdir(dentry, root->dentry);
  2631. }
  2632. bool path_is_under(struct path *path1, struct path *path2)
  2633. {
  2634. bool res;
  2635. read_seqlock_excl(&mount_lock);
  2636. res = is_path_reachable(real_mount(path1->mnt), path1->dentry, path2);
  2637. read_sequnlock_excl(&mount_lock);
  2638. return res;
  2639. }
  2640. EXPORT_SYMBOL(path_is_under);
  2641. /*
  2642. * pivot_root Semantics:
  2643. * Moves the root file system of the current process to the directory put_old,
  2644. * makes new_root as the new root file system of the current process, and sets
  2645. * root/cwd of all processes which had them on the current root to new_root.
  2646. *
  2647. * Restrictions:
  2648. * The new_root and put_old must be directories, and must not be on the
  2649. * same file system as the current process root. The put_old must be
  2650. * underneath new_root, i.e. adding a non-zero number of /.. to the string
  2651. * pointed to by put_old must yield the same directory as new_root. No other
  2652. * file system may be mounted on put_old. After all, new_root is a mountpoint.
  2653. *
  2654. * Also, the current root cannot be on the 'rootfs' (initial ramfs) filesystem.
  2655. * See Documentation/filesystems/ramfs-rootfs-initramfs.txt for alternatives
  2656. * in this situation.
  2657. *
  2658. * Notes:
  2659. * - we don't move root/cwd if they are not at the root (reason: if something
  2660. * cared enough to change them, it's probably wrong to force them elsewhere)
  2661. * - it's okay to pick a root that isn't the root of a file system, e.g.
  2662. * /nfs/my_root where /nfs is the mount point. It must be a mountpoint,
  2663. * though, so you may need to say mount --bind /nfs/my_root /nfs/my_root
  2664. * first.
  2665. */
  2666. SYSCALL_DEFINE2(pivot_root, const char __user *, new_root,
  2667. const char __user *, put_old)
  2668. {
  2669. struct path new, old, parent_path, root_parent, root;
  2670. struct mount *new_mnt, *root_mnt, *old_mnt;
  2671. struct mountpoint *old_mp, *root_mp;
  2672. int error;
  2673. if (!may_mount())
  2674. return -EPERM;
  2675. error = user_path_dir(new_root, &new);
  2676. if (error)
  2677. goto out0;
  2678. error = user_path_dir(put_old, &old);
  2679. if (error)
  2680. goto out1;
  2681. error = security_sb_pivotroot(&old, &new);
  2682. if (error)
  2683. goto out2;
  2684. get_fs_root(current->fs, &root);
  2685. old_mp = lock_mount(&old);
  2686. error = PTR_ERR(old_mp);
  2687. if (IS_ERR(old_mp))
  2688. goto out3;
  2689. error = -EINVAL;
  2690. new_mnt = real_mount(new.mnt);
  2691. root_mnt = real_mount(root.mnt);
  2692. old_mnt = real_mount(old.mnt);
  2693. if (IS_MNT_SHARED(old_mnt) ||
  2694. IS_MNT_SHARED(new_mnt->mnt_parent) ||
  2695. IS_MNT_SHARED(root_mnt->mnt_parent))
  2696. goto out4;
  2697. if (!check_mnt(root_mnt) || !check_mnt(new_mnt))
  2698. goto out4;
  2699. if (new_mnt->mnt.mnt_flags & MNT_LOCKED)
  2700. goto out4;
  2701. error = -ENOENT;
  2702. if (d_unlinked(new.dentry))
  2703. goto out4;
  2704. error = -EBUSY;
  2705. if (new_mnt == root_mnt || old_mnt == root_mnt)
  2706. goto out4; /* loop, on the same file system */
  2707. error = -EINVAL;
  2708. if (root.mnt->mnt_root != root.dentry)
  2709. goto out4; /* not a mountpoint */
  2710. if (!mnt_has_parent(root_mnt))
  2711. goto out4; /* not attached */
  2712. root_mp = root_mnt->mnt_mp;
  2713. if (new.mnt->mnt_root != new.dentry)
  2714. goto out4; /* not a mountpoint */
  2715. if (!mnt_has_parent(new_mnt))
  2716. goto out4; /* not attached */
  2717. /* make sure we can reach put_old from new_root */
  2718. if (!is_path_reachable(old_mnt, old.dentry, &new))
  2719. goto out4;
  2720. /* make certain new is below the root */
  2721. if (!is_path_reachable(new_mnt, new.dentry, &root))
  2722. goto out4;
  2723. root_mp->m_count++; /* pin it so it won't go away */
  2724. lock_mount_hash();
  2725. detach_mnt(new_mnt, &parent_path);
  2726. detach_mnt(root_mnt, &root_parent);
  2727. if (root_mnt->mnt.mnt_flags & MNT_LOCKED) {
  2728. new_mnt->mnt.mnt_flags |= MNT_LOCKED;
  2729. root_mnt->mnt.mnt_flags &= ~MNT_LOCKED;
  2730. }
  2731. /* mount old root on put_old */
  2732. attach_mnt(root_mnt, old_mnt, old_mp);
  2733. /* mount new_root on / */
  2734. attach_mnt(new_mnt, real_mount(root_parent.mnt), root_mp);
  2735. touch_mnt_namespace(current->nsproxy->mnt_ns);
  2736. /* A moved mount should not expire automatically */
  2737. list_del_init(&new_mnt->mnt_expire);
  2738. unlock_mount_hash();
  2739. chroot_fs_refs(&root, &new);
  2740. put_mountpoint(root_mp);
  2741. error = 0;
  2742. out4:
  2743. unlock_mount(old_mp);
  2744. if (!error) {
  2745. path_put(&root_parent);
  2746. path_put(&parent_path);
  2747. }
  2748. out3:
  2749. path_put(&root);
  2750. out2:
  2751. path_put(&old);
  2752. out1:
  2753. path_put(&new);
  2754. out0:
  2755. return error;
  2756. }
  2757. static void __init init_mount_tree(void)
  2758. {
  2759. struct vfsmount *mnt;
  2760. struct mnt_namespace *ns;
  2761. struct path root;
  2762. struct file_system_type *type;
  2763. type = get_fs_type("rootfs");
  2764. if (!type)
  2765. panic("Can't find rootfs type");
  2766. mnt = vfs_kern_mount(type, 0, "rootfs", NULL);
  2767. put_filesystem(type);
  2768. if (IS_ERR(mnt))
  2769. panic("Can't create rootfs");
  2770. ns = create_mnt_ns(mnt);
  2771. if (IS_ERR(ns))
  2772. panic("Can't allocate initial namespace");
  2773. init_task.nsproxy->mnt_ns = ns;
  2774. get_mnt_ns(ns);
  2775. root.mnt = mnt;
  2776. root.dentry = mnt->mnt_root;
  2777. mnt->mnt_flags |= MNT_LOCKED;
  2778. set_fs_pwd(current->fs, &root);
  2779. set_fs_root(current->fs, &root);
  2780. }
  2781. void __init mnt_init(void)
  2782. {
  2783. unsigned u;
  2784. int err;
  2785. mnt_cache = kmem_cache_create("mnt_cache", sizeof(struct mount),
  2786. 0, SLAB_HWCACHE_ALIGN | SLAB_PANIC, NULL);
  2787. mount_hashtable = alloc_large_system_hash("Mount-cache",
  2788. sizeof(struct hlist_head),
  2789. mhash_entries, 19,
  2790. 0,
  2791. &m_hash_shift, &m_hash_mask, 0, 0);
  2792. mountpoint_hashtable = alloc_large_system_hash("Mountpoint-cache",
  2793. sizeof(struct hlist_head),
  2794. mphash_entries, 19,
  2795. 0,
  2796. &mp_hash_shift, &mp_hash_mask, 0, 0);
  2797. if (!mount_hashtable || !mountpoint_hashtable)
  2798. panic("Failed to allocate mount hash table\n");
  2799. for (u = 0; u <= m_hash_mask; u++)
  2800. INIT_HLIST_HEAD(&mount_hashtable[u]);
  2801. for (u = 0; u <= mp_hash_mask; u++)
  2802. INIT_HLIST_HEAD(&mountpoint_hashtable[u]);
  2803. kernfs_init();
  2804. err = sysfs_init();
  2805. if (err)
  2806. printk(KERN_WARNING "%s: sysfs_init error: %d\n",
  2807. __func__, err);
  2808. fs_kobj = kobject_create_and_add("fs", NULL);
  2809. if (!fs_kobj)
  2810. printk(KERN_WARNING "%s: kobj create error\n", __func__);
  2811. init_rootfs();
  2812. init_mount_tree();
  2813. }
  2814. void put_mnt_ns(struct mnt_namespace *ns)
  2815. {
  2816. if (!atomic_dec_and_test(&ns->count))
  2817. return;
  2818. drop_collected_mounts(&ns->root->mnt);
  2819. free_mnt_ns(ns);
  2820. }
  2821. struct vfsmount *kern_mount_data(struct file_system_type *type, void *data)
  2822. {
  2823. struct vfsmount *mnt;
  2824. mnt = vfs_kern_mount(type, MS_KERNMOUNT, type->name, data);
  2825. if (!IS_ERR(mnt)) {
  2826. /*
  2827. * it is a longterm mount, don't release mnt until
  2828. * we unmount before file sys is unregistered
  2829. */
  2830. real_mount(mnt)->mnt_ns = MNT_NS_INTERNAL;
  2831. }
  2832. return mnt;
  2833. }
  2834. EXPORT_SYMBOL_GPL(kern_mount_data);
  2835. void kern_unmount(struct vfsmount *mnt)
  2836. {
  2837. /* release long term mount so mount point can be released */
  2838. if (!IS_ERR_OR_NULL(mnt)) {
  2839. real_mount(mnt)->mnt_ns = NULL;
  2840. synchronize_rcu(); /* yecchhh... */
  2841. mntput(mnt);
  2842. }
  2843. }
  2844. EXPORT_SYMBOL(kern_unmount);
  2845. bool our_mnt(struct vfsmount *mnt)
  2846. {
  2847. return check_mnt(real_mount(mnt));
  2848. }
  2849. bool current_chrooted(void)
  2850. {
  2851. /* Does the current process have a non-standard root */
  2852. struct path ns_root;
  2853. struct path fs_root;
  2854. bool chrooted;
  2855. /* Find the namespace root */
  2856. ns_root.mnt = &current->nsproxy->mnt_ns->root->mnt;
  2857. ns_root.dentry = ns_root.mnt->mnt_root;
  2858. path_get(&ns_root);
  2859. while (d_mountpoint(ns_root.dentry) && follow_down_one(&ns_root))
  2860. ;
  2861. get_fs_root(current->fs, &fs_root);
  2862. chrooted = !path_equal(&fs_root, &ns_root);
  2863. path_put(&fs_root);
  2864. path_put(&ns_root);
  2865. return chrooted;
  2866. }
  2867. static bool mnt_already_visible(struct mnt_namespace *ns, struct vfsmount *new,
  2868. int *new_mnt_flags)
  2869. {
  2870. int new_flags = *new_mnt_flags;
  2871. struct mount *mnt;
  2872. bool visible = false;
  2873. down_read(&namespace_sem);
  2874. list_for_each_entry(mnt, &ns->list, mnt_list) {
  2875. struct mount *child;
  2876. int mnt_flags;
  2877. if (mnt->mnt.mnt_sb->s_type != new->mnt_sb->s_type)
  2878. continue;
  2879. /* This mount is not fully visible if it's root directory
  2880. * is not the root directory of the filesystem.
  2881. */
  2882. if (mnt->mnt.mnt_root != mnt->mnt.mnt_sb->s_root)
  2883. continue;
  2884. /* A local view of the mount flags */
  2885. mnt_flags = mnt->mnt.mnt_flags;
  2886. /* Don't miss readonly hidden in the superblock flags */
  2887. if (mnt->mnt.mnt_sb->s_flags & MS_RDONLY)
  2888. mnt_flags |= MNT_LOCK_READONLY;
  2889. /* Verify the mount flags are equal to or more permissive
  2890. * than the proposed new mount.
  2891. */
  2892. if ((mnt_flags & MNT_LOCK_READONLY) &&
  2893. !(new_flags & MNT_READONLY))
  2894. continue;
  2895. if ((mnt_flags & MNT_LOCK_ATIME) &&
  2896. ((mnt_flags & MNT_ATIME_MASK) != (new_flags & MNT_ATIME_MASK)))
  2897. continue;
  2898. /* This mount is not fully visible if there are any
  2899. * locked child mounts that cover anything except for
  2900. * empty directories.
  2901. */
  2902. list_for_each_entry(child, &mnt->mnt_mounts, mnt_child) {
  2903. struct inode *inode = child->mnt_mountpoint->d_inode;
  2904. /* Only worry about locked mounts */
  2905. if (!(child->mnt.mnt_flags & MNT_LOCKED))
  2906. continue;
  2907. /* Is the directory permanetly empty? */
  2908. if (!is_empty_dir_inode(inode))
  2909. goto next;
  2910. }
  2911. /* Preserve the locked attributes */
  2912. *new_mnt_flags |= mnt_flags & (MNT_LOCK_READONLY | \
  2913. MNT_LOCK_ATIME);
  2914. visible = true;
  2915. goto found;
  2916. next: ;
  2917. }
  2918. found:
  2919. up_read(&namespace_sem);
  2920. return visible;
  2921. }
  2922. static bool mount_too_revealing(struct vfsmount *mnt, int *new_mnt_flags)
  2923. {
  2924. const unsigned long required_iflags = SB_I_NOEXEC | SB_I_NODEV;
  2925. struct mnt_namespace *ns = current->nsproxy->mnt_ns;
  2926. unsigned long s_iflags;
  2927. if (ns->user_ns == &init_user_ns)
  2928. return false;
  2929. /* Can this filesystem be too revealing? */
  2930. s_iflags = mnt->mnt_sb->s_iflags;
  2931. if (!(s_iflags & SB_I_USERNS_VISIBLE))
  2932. return false;
  2933. if ((s_iflags & required_iflags) != required_iflags) {
  2934. WARN_ONCE(1, "Expected s_iflags to contain 0x%lx\n",
  2935. required_iflags);
  2936. return true;
  2937. }
  2938. return !mnt_already_visible(ns, mnt, new_mnt_flags);
  2939. }
  2940. bool mnt_may_suid(struct vfsmount *mnt)
  2941. {
  2942. /*
  2943. * Foreign mounts (accessed via fchdir or through /proc
  2944. * symlinks) are always treated as if they are nosuid. This
  2945. * prevents namespaces from trusting potentially unsafe
  2946. * suid/sgid bits, file caps, or security labels that originate
  2947. * in other namespaces.
  2948. */
  2949. return !(mnt->mnt_flags & MNT_NOSUID) && check_mnt(real_mount(mnt)) &&
  2950. current_in_userns(mnt->mnt_sb->s_user_ns);
  2951. }
  2952. static struct ns_common *mntns_get(struct task_struct *task)
  2953. {
  2954. struct ns_common *ns = NULL;
  2955. struct nsproxy *nsproxy;
  2956. task_lock(task);
  2957. nsproxy = task->nsproxy;
  2958. if (nsproxy) {
  2959. ns = &nsproxy->mnt_ns->ns;
  2960. get_mnt_ns(to_mnt_ns(ns));
  2961. }
  2962. task_unlock(task);
  2963. return ns;
  2964. }
  2965. static void mntns_put(struct ns_common *ns)
  2966. {
  2967. put_mnt_ns(to_mnt_ns(ns));
  2968. }
  2969. static int mntns_install(struct nsproxy *nsproxy, struct ns_common *ns)
  2970. {
  2971. struct fs_struct *fs = current->fs;
  2972. struct mnt_namespace *mnt_ns = to_mnt_ns(ns);
  2973. struct path root;
  2974. if (!ns_capable(mnt_ns->user_ns, CAP_SYS_ADMIN) ||
  2975. !ns_capable(current_user_ns(), CAP_SYS_CHROOT) ||
  2976. !ns_capable(current_user_ns(), CAP_SYS_ADMIN))
  2977. return -EPERM;
  2978. if (fs->users != 1)
  2979. return -EINVAL;
  2980. get_mnt_ns(mnt_ns);
  2981. put_mnt_ns(nsproxy->mnt_ns);
  2982. nsproxy->mnt_ns = mnt_ns;
  2983. /* Find the root */
  2984. root.mnt = &mnt_ns->root->mnt;
  2985. root.dentry = mnt_ns->root->mnt.mnt_root;
  2986. path_get(&root);
  2987. while(d_mountpoint(root.dentry) && follow_down_one(&root))
  2988. ;
  2989. /* Update the pwd and root */
  2990. set_fs_pwd(fs, &root);
  2991. set_fs_root(fs, &root);
  2992. path_put(&root);
  2993. return 0;
  2994. }
  2995. static struct user_namespace *mntns_owner(struct ns_common *ns)
  2996. {
  2997. return to_mnt_ns(ns)->user_ns;
  2998. }
  2999. const struct proc_ns_operations mntns_operations = {
  3000. .name = "mnt",
  3001. .type = CLONE_NEWNS,
  3002. .get = mntns_get,
  3003. .put = mntns_put,
  3004. .install = mntns_install,
  3005. .owner = mntns_owner,
  3006. };