namei.c 73 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990
  1. /*
  2. * linux/fs/namei.c
  3. *
  4. * Copyright (C) 1991, 1992 Linus Torvalds
  5. */
  6. /*
  7. * Some corrections by tytso.
  8. */
  9. /* [Feb 1997 T. Schoebel-Theuer] Complete rewrite of the pathname
  10. * lookup logic.
  11. */
  12. /* [Feb-Apr 2000, AV] Rewrite to the new namespace architecture.
  13. */
  14. #include <linux/init.h>
  15. #include <linux/module.h>
  16. #include <linux/slab.h>
  17. #include <linux/fs.h>
  18. #include <linux/namei.h>
  19. #include <linux/quotaops.h>
  20. #include <linux/pagemap.h>
  21. #include <linux/fsnotify.h>
  22. #include <linux/personality.h>
  23. #include <linux/security.h>
  24. #include <linux/syscalls.h>
  25. #include <linux/mount.h>
  26. #include <linux/audit.h>
  27. #include <linux/capability.h>
  28. #include <linux/file.h>
  29. #include <linux/fcntl.h>
  30. #include <linux/device_cgroup.h>
  31. #include <asm/namei.h>
  32. #include <asm/uaccess.h>
  33. #define ACC_MODE(x) ("\000\004\002\006"[(x)&O_ACCMODE])
  34. /* [Feb-1997 T. Schoebel-Theuer]
  35. * Fundamental changes in the pathname lookup mechanisms (namei)
  36. * were necessary because of omirr. The reason is that omirr needs
  37. * to know the _real_ pathname, not the user-supplied one, in case
  38. * of symlinks (and also when transname replacements occur).
  39. *
  40. * The new code replaces the old recursive symlink resolution with
  41. * an iterative one (in case of non-nested symlink chains). It does
  42. * this with calls to <fs>_follow_link().
  43. * As a side effect, dir_namei(), _namei() and follow_link() are now
  44. * replaced with a single function lookup_dentry() that can handle all
  45. * the special cases of the former code.
  46. *
  47. * With the new dcache, the pathname is stored at each inode, at least as
  48. * long as the refcount of the inode is positive. As a side effect, the
  49. * size of the dcache depends on the inode cache and thus is dynamic.
  50. *
  51. * [29-Apr-1998 C. Scott Ananian] Updated above description of symlink
  52. * resolution to correspond with current state of the code.
  53. *
  54. * Note that the symlink resolution is not *completely* iterative.
  55. * There is still a significant amount of tail- and mid- recursion in
  56. * the algorithm. Also, note that <fs>_readlink() is not used in
  57. * lookup_dentry(): lookup_dentry() on the result of <fs>_readlink()
  58. * may return different results than <fs>_follow_link(). Many virtual
  59. * filesystems (including /proc) exhibit this behavior.
  60. */
  61. /* [24-Feb-97 T. Schoebel-Theuer] Side effects caused by new implementation:
  62. * New symlink semantics: when open() is called with flags O_CREAT | O_EXCL
  63. * and the name already exists in form of a symlink, try to create the new
  64. * name indicated by the symlink. The old code always complained that the
  65. * name already exists, due to not following the symlink even if its target
  66. * is nonexistent. The new semantics affects also mknod() and link() when
  67. * the name is a symlink pointing to a non-existant name.
  68. *
  69. * I don't know which semantics is the right one, since I have no access
  70. * to standards. But I found by trial that HP-UX 9.0 has the full "new"
  71. * semantics implemented, while SunOS 4.1.1 and Solaris (SunOS 5.4) have the
  72. * "old" one. Personally, I think the new semantics is much more logical.
  73. * Note that "ln old new" where "new" is a symlink pointing to a non-existing
  74. * file does succeed in both HP-UX and SunOs, but not in Solaris
  75. * and in the old Linux semantics.
  76. */
  77. /* [16-Dec-97 Kevin Buhr] For security reasons, we change some symlink
  78. * semantics. See the comments in "open_namei" and "do_link" below.
  79. *
  80. * [10-Sep-98 Alan Modra] Another symlink change.
  81. */
  82. /* [Feb-Apr 2000 AV] Complete rewrite. Rules for symlinks:
  83. * inside the path - always follow.
  84. * in the last component in creation/removal/renaming - never follow.
  85. * if LOOKUP_FOLLOW passed - follow.
  86. * if the pathname has trailing slashes - follow.
  87. * otherwise - don't follow.
  88. * (applied in that order).
  89. *
  90. * [Jun 2000 AV] Inconsistent behaviour of open() in case if flags==O_CREAT
  91. * restored for 2.4. This is the last surviving part of old 4.2BSD bug.
  92. * During the 2.4 we need to fix the userland stuff depending on it -
  93. * hopefully we will be able to get rid of that wart in 2.5. So far only
  94. * XEmacs seems to be relying on it...
  95. */
  96. /*
  97. * [Sep 2001 AV] Single-semaphore locking scheme (kudos to David Holland)
  98. * implemented. Let's see if raised priority of ->s_vfs_rename_mutex gives
  99. * any extra contention...
  100. */
  101. static int __link_path_walk(const char *name, struct nameidata *nd);
  102. /* In order to reduce some races, while at the same time doing additional
  103. * checking and hopefully speeding things up, we copy filenames to the
  104. * kernel data space before using them..
  105. *
  106. * POSIX.1 2.4: an empty pathname is invalid (ENOENT).
  107. * PATH_MAX includes the nul terminator --RR.
  108. */
  109. static int do_getname(const char __user *filename, char *page)
  110. {
  111. int retval;
  112. unsigned long len = PATH_MAX;
  113. if (!segment_eq(get_fs(), KERNEL_DS)) {
  114. if ((unsigned long) filename >= TASK_SIZE)
  115. return -EFAULT;
  116. if (TASK_SIZE - (unsigned long) filename < PATH_MAX)
  117. len = TASK_SIZE - (unsigned long) filename;
  118. }
  119. retval = strncpy_from_user(page, filename, len);
  120. if (retval > 0) {
  121. if (retval < len)
  122. return 0;
  123. return -ENAMETOOLONG;
  124. } else if (!retval)
  125. retval = -ENOENT;
  126. return retval;
  127. }
  128. char * getname(const char __user * filename)
  129. {
  130. char *tmp, *result;
  131. result = ERR_PTR(-ENOMEM);
  132. tmp = __getname();
  133. if (tmp) {
  134. int retval = do_getname(filename, tmp);
  135. result = tmp;
  136. if (retval < 0) {
  137. __putname(tmp);
  138. result = ERR_PTR(retval);
  139. }
  140. }
  141. audit_getname(result);
  142. return result;
  143. }
  144. #ifdef CONFIG_AUDITSYSCALL
  145. void putname(const char *name)
  146. {
  147. if (unlikely(!audit_dummy_context()))
  148. audit_putname(name);
  149. else
  150. __putname(name);
  151. }
  152. EXPORT_SYMBOL(putname);
  153. #endif
  154. /**
  155. * generic_permission - check for access rights on a Posix-like filesystem
  156. * @inode: inode to check access rights for
  157. * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
  158. * @check_acl: optional callback to check for Posix ACLs
  159. *
  160. * Used to check for read/write/execute permissions on a file.
  161. * We use "fsuid" for this, letting us set arbitrary permissions
  162. * for filesystem access without changing the "normal" uids which
  163. * are used for other things..
  164. */
  165. int generic_permission(struct inode *inode, int mask,
  166. int (*check_acl)(struct inode *inode, int mask))
  167. {
  168. umode_t mode = inode->i_mode;
  169. if (current->fsuid == inode->i_uid)
  170. mode >>= 6;
  171. else {
  172. if (IS_POSIXACL(inode) && (mode & S_IRWXG) && check_acl) {
  173. int error = check_acl(inode, mask);
  174. if (error == -EACCES)
  175. goto check_capabilities;
  176. else if (error != -EAGAIN)
  177. return error;
  178. }
  179. if (in_group_p(inode->i_gid))
  180. mode >>= 3;
  181. }
  182. /*
  183. * If the DACs are ok we don't need any capability check.
  184. */
  185. if (((mode & mask & (MAY_READ|MAY_WRITE|MAY_EXEC)) == mask))
  186. return 0;
  187. check_capabilities:
  188. /*
  189. * Read/write DACs are always overridable.
  190. * Executable DACs are overridable if at least one exec bit is set.
  191. */
  192. if (!(mask & MAY_EXEC) ||
  193. (inode->i_mode & S_IXUGO) || S_ISDIR(inode->i_mode))
  194. if (capable(CAP_DAC_OVERRIDE))
  195. return 0;
  196. /*
  197. * Searching includes executable on directories, else just read.
  198. */
  199. if (mask == MAY_READ || (S_ISDIR(inode->i_mode) && !(mask & MAY_WRITE)))
  200. if (capable(CAP_DAC_READ_SEARCH))
  201. return 0;
  202. return -EACCES;
  203. }
  204. int permission(struct inode *inode, int mask, struct nameidata *nd)
  205. {
  206. int retval, submask;
  207. struct vfsmount *mnt = NULL;
  208. if (nd)
  209. mnt = nd->path.mnt;
  210. if (mask & MAY_WRITE) {
  211. umode_t mode = inode->i_mode;
  212. /*
  213. * Nobody gets write access to a read-only fs.
  214. */
  215. if (IS_RDONLY(inode) &&
  216. (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode)))
  217. return -EROFS;
  218. /*
  219. * Nobody gets write access to an immutable file.
  220. */
  221. if (IS_IMMUTABLE(inode))
  222. return -EACCES;
  223. }
  224. if ((mask & MAY_EXEC) && S_ISREG(inode->i_mode)) {
  225. /*
  226. * MAY_EXEC on regular files is denied if the fs is mounted
  227. * with the "noexec" flag.
  228. */
  229. if (mnt && (mnt->mnt_flags & MNT_NOEXEC))
  230. return -EACCES;
  231. }
  232. /* Ordinary permission routines do not understand MAY_APPEND. */
  233. submask = mask & ~MAY_APPEND;
  234. if (inode->i_op && inode->i_op->permission) {
  235. retval = inode->i_op->permission(inode, submask, nd);
  236. if (!retval) {
  237. /*
  238. * Exec permission on a regular file is denied if none
  239. * of the execute bits are set.
  240. *
  241. * This check should be done by the ->permission()
  242. * method.
  243. */
  244. if ((mask & MAY_EXEC) && S_ISREG(inode->i_mode) &&
  245. !(inode->i_mode & S_IXUGO))
  246. return -EACCES;
  247. }
  248. } else {
  249. retval = generic_permission(inode, submask, NULL);
  250. }
  251. if (retval)
  252. return retval;
  253. retval = devcgroup_inode_permission(inode, mask);
  254. if (retval)
  255. return retval;
  256. return security_inode_permission(inode, mask, nd);
  257. }
  258. /**
  259. * vfs_permission - check for access rights to a given path
  260. * @nd: lookup result that describes the path
  261. * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
  262. *
  263. * Used to check for read/write/execute permissions on a path.
  264. * We use "fsuid" for this, letting us set arbitrary permissions
  265. * for filesystem access without changing the "normal" uids which
  266. * are used for other things.
  267. */
  268. int vfs_permission(struct nameidata *nd, int mask)
  269. {
  270. return permission(nd->path.dentry->d_inode, mask, nd);
  271. }
  272. /**
  273. * file_permission - check for additional access rights to a given file
  274. * @file: file to check access rights for
  275. * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
  276. *
  277. * Used to check for read/write/execute permissions on an already opened
  278. * file.
  279. *
  280. * Note:
  281. * Do not use this function in new code. All access checks should
  282. * be done using vfs_permission().
  283. */
  284. int file_permission(struct file *file, int mask)
  285. {
  286. return permission(file->f_path.dentry->d_inode, mask, NULL);
  287. }
  288. /*
  289. * get_write_access() gets write permission for a file.
  290. * put_write_access() releases this write permission.
  291. * This is used for regular files.
  292. * We cannot support write (and maybe mmap read-write shared) accesses and
  293. * MAP_DENYWRITE mmappings simultaneously. The i_writecount field of an inode
  294. * can have the following values:
  295. * 0: no writers, no VM_DENYWRITE mappings
  296. * < 0: (-i_writecount) vm_area_structs with VM_DENYWRITE set exist
  297. * > 0: (i_writecount) users are writing to the file.
  298. *
  299. * Normally we operate on that counter with atomic_{inc,dec} and it's safe
  300. * except for the cases where we don't hold i_writecount yet. Then we need to
  301. * use {get,deny}_write_access() - these functions check the sign and refuse
  302. * to do the change if sign is wrong. Exclusion between them is provided by
  303. * the inode->i_lock spinlock.
  304. */
  305. int get_write_access(struct inode * inode)
  306. {
  307. spin_lock(&inode->i_lock);
  308. if (atomic_read(&inode->i_writecount) < 0) {
  309. spin_unlock(&inode->i_lock);
  310. return -ETXTBSY;
  311. }
  312. atomic_inc(&inode->i_writecount);
  313. spin_unlock(&inode->i_lock);
  314. return 0;
  315. }
  316. int deny_write_access(struct file * file)
  317. {
  318. struct inode *inode = file->f_path.dentry->d_inode;
  319. spin_lock(&inode->i_lock);
  320. if (atomic_read(&inode->i_writecount) > 0) {
  321. spin_unlock(&inode->i_lock);
  322. return -ETXTBSY;
  323. }
  324. atomic_dec(&inode->i_writecount);
  325. spin_unlock(&inode->i_lock);
  326. return 0;
  327. }
  328. /**
  329. * path_get - get a reference to a path
  330. * @path: path to get the reference to
  331. *
  332. * Given a path increment the reference count to the dentry and the vfsmount.
  333. */
  334. void path_get(struct path *path)
  335. {
  336. mntget(path->mnt);
  337. dget(path->dentry);
  338. }
  339. EXPORT_SYMBOL(path_get);
  340. /**
  341. * path_put - put a reference to a path
  342. * @path: path to put the reference to
  343. *
  344. * Given a path decrement the reference count to the dentry and the vfsmount.
  345. */
  346. void path_put(struct path *path)
  347. {
  348. dput(path->dentry);
  349. mntput(path->mnt);
  350. }
  351. EXPORT_SYMBOL(path_put);
  352. /**
  353. * release_open_intent - free up open intent resources
  354. * @nd: pointer to nameidata
  355. */
  356. void release_open_intent(struct nameidata *nd)
  357. {
  358. if (nd->intent.open.file->f_path.dentry == NULL)
  359. put_filp(nd->intent.open.file);
  360. else
  361. fput(nd->intent.open.file);
  362. }
  363. static inline struct dentry *
  364. do_revalidate(struct dentry *dentry, struct nameidata *nd)
  365. {
  366. int status = dentry->d_op->d_revalidate(dentry, nd);
  367. if (unlikely(status <= 0)) {
  368. /*
  369. * The dentry failed validation.
  370. * If d_revalidate returned 0 attempt to invalidate
  371. * the dentry otherwise d_revalidate is asking us
  372. * to return a fail status.
  373. */
  374. if (!status) {
  375. if (!d_invalidate(dentry)) {
  376. dput(dentry);
  377. dentry = NULL;
  378. }
  379. } else {
  380. dput(dentry);
  381. dentry = ERR_PTR(status);
  382. }
  383. }
  384. return dentry;
  385. }
  386. /*
  387. * Internal lookup() using the new generic dcache.
  388. * SMP-safe
  389. */
  390. static struct dentry * cached_lookup(struct dentry * parent, struct qstr * name, struct nameidata *nd)
  391. {
  392. struct dentry * dentry = __d_lookup(parent, name);
  393. /* lockess __d_lookup may fail due to concurrent d_move()
  394. * in some unrelated directory, so try with d_lookup
  395. */
  396. if (!dentry)
  397. dentry = d_lookup(parent, name);
  398. if (dentry && dentry->d_op && dentry->d_op->d_revalidate)
  399. dentry = do_revalidate(dentry, nd);
  400. return dentry;
  401. }
  402. /*
  403. * Short-cut version of permission(), for calling by
  404. * path_walk(), when dcache lock is held. Combines parts
  405. * of permission() and generic_permission(), and tests ONLY for
  406. * MAY_EXEC permission.
  407. *
  408. * If appropriate, check DAC only. If not appropriate, or
  409. * short-cut DAC fails, then call permission() to do more
  410. * complete permission check.
  411. */
  412. static int exec_permission_lite(struct inode *inode,
  413. struct nameidata *nd)
  414. {
  415. umode_t mode = inode->i_mode;
  416. if (inode->i_op && inode->i_op->permission)
  417. return -EAGAIN;
  418. if (current->fsuid == inode->i_uid)
  419. mode >>= 6;
  420. else if (in_group_p(inode->i_gid))
  421. mode >>= 3;
  422. if (mode & MAY_EXEC)
  423. goto ok;
  424. if ((inode->i_mode & S_IXUGO) && capable(CAP_DAC_OVERRIDE))
  425. goto ok;
  426. if (S_ISDIR(inode->i_mode) && capable(CAP_DAC_OVERRIDE))
  427. goto ok;
  428. if (S_ISDIR(inode->i_mode) && capable(CAP_DAC_READ_SEARCH))
  429. goto ok;
  430. return -EACCES;
  431. ok:
  432. return security_inode_permission(inode, MAY_EXEC, nd);
  433. }
  434. /*
  435. * This is called when everything else fails, and we actually have
  436. * to go to the low-level filesystem to find out what we should do..
  437. *
  438. * We get the directory semaphore, and after getting that we also
  439. * make sure that nobody added the entry to the dcache in the meantime..
  440. * SMP-safe
  441. */
  442. static struct dentry * real_lookup(struct dentry * parent, struct qstr * name, struct nameidata *nd)
  443. {
  444. struct dentry * result;
  445. struct inode *dir = parent->d_inode;
  446. mutex_lock(&dir->i_mutex);
  447. /*
  448. * First re-do the cached lookup just in case it was created
  449. * while we waited for the directory semaphore..
  450. *
  451. * FIXME! This could use version numbering or similar to
  452. * avoid unnecessary cache lookups.
  453. *
  454. * The "dcache_lock" is purely to protect the RCU list walker
  455. * from concurrent renames at this point (we mustn't get false
  456. * negatives from the RCU list walk here, unlike the optimistic
  457. * fast walk).
  458. *
  459. * so doing d_lookup() (with seqlock), instead of lockfree __d_lookup
  460. */
  461. result = d_lookup(parent, name);
  462. if (!result) {
  463. struct dentry * dentry = d_alloc(parent, name);
  464. result = ERR_PTR(-ENOMEM);
  465. if (dentry) {
  466. result = dir->i_op->lookup(dir, dentry, nd);
  467. if (result)
  468. dput(dentry);
  469. else
  470. result = dentry;
  471. }
  472. mutex_unlock(&dir->i_mutex);
  473. return result;
  474. }
  475. /*
  476. * Uhhuh! Nasty case: the cache was re-populated while
  477. * we waited on the semaphore. Need to revalidate.
  478. */
  479. mutex_unlock(&dir->i_mutex);
  480. if (result->d_op && result->d_op->d_revalidate) {
  481. result = do_revalidate(result, nd);
  482. if (!result)
  483. result = ERR_PTR(-ENOENT);
  484. }
  485. return result;
  486. }
  487. static int __emul_lookup_dentry(const char *, struct nameidata *);
  488. /* SMP-safe */
  489. static __always_inline int
  490. walk_init_root(const char *name, struct nameidata *nd)
  491. {
  492. struct fs_struct *fs = current->fs;
  493. read_lock(&fs->lock);
  494. if (fs->altroot.dentry && !(nd->flags & LOOKUP_NOALT)) {
  495. nd->path = fs->altroot;
  496. path_get(&fs->altroot);
  497. read_unlock(&fs->lock);
  498. if (__emul_lookup_dentry(name,nd))
  499. return 0;
  500. read_lock(&fs->lock);
  501. }
  502. nd->path = fs->root;
  503. path_get(&fs->root);
  504. read_unlock(&fs->lock);
  505. return 1;
  506. }
  507. /*
  508. * Wrapper to retry pathname resolution whenever the underlying
  509. * file system returns an ESTALE.
  510. *
  511. * Retry the whole path once, forcing real lookup requests
  512. * instead of relying on the dcache.
  513. */
  514. static __always_inline int link_path_walk(const char *name, struct nameidata *nd)
  515. {
  516. struct path save = nd->path;
  517. int result;
  518. /* make sure the stuff we saved doesn't go away */
  519. dget(save.dentry);
  520. mntget(save.mnt);
  521. result = __link_path_walk(name, nd);
  522. if (result == -ESTALE) {
  523. /* nd->path had been dropped */
  524. nd->path = save;
  525. dget(nd->path.dentry);
  526. mntget(nd->path.mnt);
  527. nd->flags |= LOOKUP_REVAL;
  528. result = __link_path_walk(name, nd);
  529. }
  530. path_put(&save);
  531. return result;
  532. }
  533. static __always_inline int __vfs_follow_link(struct nameidata *nd, const char *link)
  534. {
  535. int res = 0;
  536. char *name;
  537. if (IS_ERR(link))
  538. goto fail;
  539. if (*link == '/') {
  540. path_put(&nd->path);
  541. if (!walk_init_root(link, nd))
  542. /* weird __emul_prefix() stuff did it */
  543. goto out;
  544. }
  545. res = link_path_walk(link, nd);
  546. out:
  547. if (nd->depth || res || nd->last_type!=LAST_NORM)
  548. return res;
  549. /*
  550. * If it is an iterative symlinks resolution in open_namei() we
  551. * have to copy the last component. And all that crap because of
  552. * bloody create() on broken symlinks. Furrfu...
  553. */
  554. name = __getname();
  555. if (unlikely(!name)) {
  556. path_put(&nd->path);
  557. return -ENOMEM;
  558. }
  559. strcpy(name, nd->last.name);
  560. nd->last.name = name;
  561. return 0;
  562. fail:
  563. path_put(&nd->path);
  564. return PTR_ERR(link);
  565. }
  566. static void path_put_conditional(struct path *path, struct nameidata *nd)
  567. {
  568. dput(path->dentry);
  569. if (path->mnt != nd->path.mnt)
  570. mntput(path->mnt);
  571. }
  572. static inline void path_to_nameidata(struct path *path, struct nameidata *nd)
  573. {
  574. dput(nd->path.dentry);
  575. if (nd->path.mnt != path->mnt)
  576. mntput(nd->path.mnt);
  577. nd->path.mnt = path->mnt;
  578. nd->path.dentry = path->dentry;
  579. }
  580. static __always_inline int __do_follow_link(struct path *path, struct nameidata *nd)
  581. {
  582. int error;
  583. void *cookie;
  584. struct dentry *dentry = path->dentry;
  585. touch_atime(path->mnt, dentry);
  586. nd_set_link(nd, NULL);
  587. if (path->mnt != nd->path.mnt) {
  588. path_to_nameidata(path, nd);
  589. dget(dentry);
  590. }
  591. mntget(path->mnt);
  592. cookie = dentry->d_inode->i_op->follow_link(dentry, nd);
  593. error = PTR_ERR(cookie);
  594. if (!IS_ERR(cookie)) {
  595. char *s = nd_get_link(nd);
  596. error = 0;
  597. if (s)
  598. error = __vfs_follow_link(nd, s);
  599. if (dentry->d_inode->i_op->put_link)
  600. dentry->d_inode->i_op->put_link(dentry, nd, cookie);
  601. }
  602. path_put(path);
  603. return error;
  604. }
  605. /*
  606. * This limits recursive symlink follows to 8, while
  607. * limiting consecutive symlinks to 40.
  608. *
  609. * Without that kind of total limit, nasty chains of consecutive
  610. * symlinks can cause almost arbitrarily long lookups.
  611. */
  612. static inline int do_follow_link(struct path *path, struct nameidata *nd)
  613. {
  614. int err = -ELOOP;
  615. if (current->link_count >= MAX_NESTED_LINKS)
  616. goto loop;
  617. if (current->total_link_count >= 40)
  618. goto loop;
  619. BUG_ON(nd->depth >= MAX_NESTED_LINKS);
  620. cond_resched();
  621. err = security_inode_follow_link(path->dentry, nd);
  622. if (err)
  623. goto loop;
  624. current->link_count++;
  625. current->total_link_count++;
  626. nd->depth++;
  627. err = __do_follow_link(path, nd);
  628. current->link_count--;
  629. nd->depth--;
  630. return err;
  631. loop:
  632. path_put_conditional(path, nd);
  633. path_put(&nd->path);
  634. return err;
  635. }
  636. int follow_up(struct vfsmount **mnt, struct dentry **dentry)
  637. {
  638. struct vfsmount *parent;
  639. struct dentry *mountpoint;
  640. spin_lock(&vfsmount_lock);
  641. parent=(*mnt)->mnt_parent;
  642. if (parent == *mnt) {
  643. spin_unlock(&vfsmount_lock);
  644. return 0;
  645. }
  646. mntget(parent);
  647. mountpoint=dget((*mnt)->mnt_mountpoint);
  648. spin_unlock(&vfsmount_lock);
  649. dput(*dentry);
  650. *dentry = mountpoint;
  651. mntput(*mnt);
  652. *mnt = parent;
  653. return 1;
  654. }
  655. /* no need for dcache_lock, as serialization is taken care in
  656. * namespace.c
  657. */
  658. static int __follow_mount(struct path *path)
  659. {
  660. int res = 0;
  661. while (d_mountpoint(path->dentry)) {
  662. struct vfsmount *mounted = lookup_mnt(path->mnt, path->dentry);
  663. if (!mounted)
  664. break;
  665. dput(path->dentry);
  666. if (res)
  667. mntput(path->mnt);
  668. path->mnt = mounted;
  669. path->dentry = dget(mounted->mnt_root);
  670. res = 1;
  671. }
  672. return res;
  673. }
  674. static void follow_mount(struct vfsmount **mnt, struct dentry **dentry)
  675. {
  676. while (d_mountpoint(*dentry)) {
  677. struct vfsmount *mounted = lookup_mnt(*mnt, *dentry);
  678. if (!mounted)
  679. break;
  680. dput(*dentry);
  681. mntput(*mnt);
  682. *mnt = mounted;
  683. *dentry = dget(mounted->mnt_root);
  684. }
  685. }
  686. /* no need for dcache_lock, as serialization is taken care in
  687. * namespace.c
  688. */
  689. int follow_down(struct vfsmount **mnt, struct dentry **dentry)
  690. {
  691. struct vfsmount *mounted;
  692. mounted = lookup_mnt(*mnt, *dentry);
  693. if (mounted) {
  694. dput(*dentry);
  695. mntput(*mnt);
  696. *mnt = mounted;
  697. *dentry = dget(mounted->mnt_root);
  698. return 1;
  699. }
  700. return 0;
  701. }
  702. static __always_inline void follow_dotdot(struct nameidata *nd)
  703. {
  704. struct fs_struct *fs = current->fs;
  705. while(1) {
  706. struct vfsmount *parent;
  707. struct dentry *old = nd->path.dentry;
  708. read_lock(&fs->lock);
  709. if (nd->path.dentry == fs->root.dentry &&
  710. nd->path.mnt == fs->root.mnt) {
  711. read_unlock(&fs->lock);
  712. break;
  713. }
  714. read_unlock(&fs->lock);
  715. spin_lock(&dcache_lock);
  716. if (nd->path.dentry != nd->path.mnt->mnt_root) {
  717. nd->path.dentry = dget(nd->path.dentry->d_parent);
  718. spin_unlock(&dcache_lock);
  719. dput(old);
  720. break;
  721. }
  722. spin_unlock(&dcache_lock);
  723. spin_lock(&vfsmount_lock);
  724. parent = nd->path.mnt->mnt_parent;
  725. if (parent == nd->path.mnt) {
  726. spin_unlock(&vfsmount_lock);
  727. break;
  728. }
  729. mntget(parent);
  730. nd->path.dentry = dget(nd->path.mnt->mnt_mountpoint);
  731. spin_unlock(&vfsmount_lock);
  732. dput(old);
  733. mntput(nd->path.mnt);
  734. nd->path.mnt = parent;
  735. }
  736. follow_mount(&nd->path.mnt, &nd->path.dentry);
  737. }
  738. /*
  739. * It's more convoluted than I'd like it to be, but... it's still fairly
  740. * small and for now I'd prefer to have fast path as straight as possible.
  741. * It _is_ time-critical.
  742. */
  743. static int do_lookup(struct nameidata *nd, struct qstr *name,
  744. struct path *path)
  745. {
  746. struct vfsmount *mnt = nd->path.mnt;
  747. struct dentry *dentry = __d_lookup(nd->path.dentry, name);
  748. if (!dentry)
  749. goto need_lookup;
  750. if (dentry->d_op && dentry->d_op->d_revalidate)
  751. goto need_revalidate;
  752. done:
  753. path->mnt = mnt;
  754. path->dentry = dentry;
  755. __follow_mount(path);
  756. return 0;
  757. need_lookup:
  758. dentry = real_lookup(nd->path.dentry, name, nd);
  759. if (IS_ERR(dentry))
  760. goto fail;
  761. goto done;
  762. need_revalidate:
  763. dentry = do_revalidate(dentry, nd);
  764. if (!dentry)
  765. goto need_lookup;
  766. if (IS_ERR(dentry))
  767. goto fail;
  768. goto done;
  769. fail:
  770. return PTR_ERR(dentry);
  771. }
  772. /*
  773. * Name resolution.
  774. * This is the basic name resolution function, turning a pathname into
  775. * the final dentry. We expect 'base' to be positive and a directory.
  776. *
  777. * Returns 0 and nd will have valid dentry and mnt on success.
  778. * Returns error and drops reference to input namei data on failure.
  779. */
  780. static int __link_path_walk(const char *name, struct nameidata *nd)
  781. {
  782. struct path next;
  783. struct inode *inode;
  784. int err;
  785. unsigned int lookup_flags = nd->flags;
  786. while (*name=='/')
  787. name++;
  788. if (!*name)
  789. goto return_reval;
  790. inode = nd->path.dentry->d_inode;
  791. if (nd->depth)
  792. lookup_flags = LOOKUP_FOLLOW | (nd->flags & LOOKUP_CONTINUE);
  793. /* At this point we know we have a real path component. */
  794. for(;;) {
  795. unsigned long hash;
  796. struct qstr this;
  797. unsigned int c;
  798. nd->flags |= LOOKUP_CONTINUE;
  799. err = exec_permission_lite(inode, nd);
  800. if (err == -EAGAIN)
  801. err = vfs_permission(nd, MAY_EXEC);
  802. if (err)
  803. break;
  804. this.name = name;
  805. c = *(const unsigned char *)name;
  806. hash = init_name_hash();
  807. do {
  808. name++;
  809. hash = partial_name_hash(c, hash);
  810. c = *(const unsigned char *)name;
  811. } while (c && (c != '/'));
  812. this.len = name - (const char *) this.name;
  813. this.hash = end_name_hash(hash);
  814. /* remove trailing slashes? */
  815. if (!c)
  816. goto last_component;
  817. while (*++name == '/');
  818. if (!*name)
  819. goto last_with_slashes;
  820. /*
  821. * "." and ".." are special - ".." especially so because it has
  822. * to be able to know about the current root directory and
  823. * parent relationships.
  824. */
  825. if (this.name[0] == '.') switch (this.len) {
  826. default:
  827. break;
  828. case 2:
  829. if (this.name[1] != '.')
  830. break;
  831. follow_dotdot(nd);
  832. inode = nd->path.dentry->d_inode;
  833. /* fallthrough */
  834. case 1:
  835. continue;
  836. }
  837. /*
  838. * See if the low-level filesystem might want
  839. * to use its own hash..
  840. */
  841. if (nd->path.dentry->d_op && nd->path.dentry->d_op->d_hash) {
  842. err = nd->path.dentry->d_op->d_hash(nd->path.dentry,
  843. &this);
  844. if (err < 0)
  845. break;
  846. }
  847. /* This does the actual lookups.. */
  848. err = do_lookup(nd, &this, &next);
  849. if (err)
  850. break;
  851. err = -ENOENT;
  852. inode = next.dentry->d_inode;
  853. if (!inode)
  854. goto out_dput;
  855. err = -ENOTDIR;
  856. if (!inode->i_op)
  857. goto out_dput;
  858. if (inode->i_op->follow_link) {
  859. err = do_follow_link(&next, nd);
  860. if (err)
  861. goto return_err;
  862. err = -ENOENT;
  863. inode = nd->path.dentry->d_inode;
  864. if (!inode)
  865. break;
  866. err = -ENOTDIR;
  867. if (!inode->i_op)
  868. break;
  869. } else
  870. path_to_nameidata(&next, nd);
  871. err = -ENOTDIR;
  872. if (!inode->i_op->lookup)
  873. break;
  874. continue;
  875. /* here ends the main loop */
  876. last_with_slashes:
  877. lookup_flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY;
  878. last_component:
  879. /* Clear LOOKUP_CONTINUE iff it was previously unset */
  880. nd->flags &= lookup_flags | ~LOOKUP_CONTINUE;
  881. if (lookup_flags & LOOKUP_PARENT)
  882. goto lookup_parent;
  883. if (this.name[0] == '.') switch (this.len) {
  884. default:
  885. break;
  886. case 2:
  887. if (this.name[1] != '.')
  888. break;
  889. follow_dotdot(nd);
  890. inode = nd->path.dentry->d_inode;
  891. /* fallthrough */
  892. case 1:
  893. goto return_reval;
  894. }
  895. if (nd->path.dentry->d_op && nd->path.dentry->d_op->d_hash) {
  896. err = nd->path.dentry->d_op->d_hash(nd->path.dentry,
  897. &this);
  898. if (err < 0)
  899. break;
  900. }
  901. err = do_lookup(nd, &this, &next);
  902. if (err)
  903. break;
  904. inode = next.dentry->d_inode;
  905. if ((lookup_flags & LOOKUP_FOLLOW)
  906. && inode && inode->i_op && inode->i_op->follow_link) {
  907. err = do_follow_link(&next, nd);
  908. if (err)
  909. goto return_err;
  910. inode = nd->path.dentry->d_inode;
  911. } else
  912. path_to_nameidata(&next, nd);
  913. err = -ENOENT;
  914. if (!inode)
  915. break;
  916. if (lookup_flags & LOOKUP_DIRECTORY) {
  917. err = -ENOTDIR;
  918. if (!inode->i_op || !inode->i_op->lookup)
  919. break;
  920. }
  921. goto return_base;
  922. lookup_parent:
  923. nd->last = this;
  924. nd->last_type = LAST_NORM;
  925. if (this.name[0] != '.')
  926. goto return_base;
  927. if (this.len == 1)
  928. nd->last_type = LAST_DOT;
  929. else if (this.len == 2 && this.name[1] == '.')
  930. nd->last_type = LAST_DOTDOT;
  931. else
  932. goto return_base;
  933. return_reval:
  934. /*
  935. * We bypassed the ordinary revalidation routines.
  936. * We may need to check the cached dentry for staleness.
  937. */
  938. if (nd->path.dentry && nd->path.dentry->d_sb &&
  939. (nd->path.dentry->d_sb->s_type->fs_flags & FS_REVAL_DOT)) {
  940. err = -ESTALE;
  941. /* Note: we do not d_invalidate() */
  942. if (!nd->path.dentry->d_op->d_revalidate(
  943. nd->path.dentry, nd))
  944. break;
  945. }
  946. return_base:
  947. return 0;
  948. out_dput:
  949. path_put_conditional(&next, nd);
  950. break;
  951. }
  952. path_put(&nd->path);
  953. return_err:
  954. return err;
  955. }
  956. static int path_walk(const char *name, struct nameidata *nd)
  957. {
  958. current->total_link_count = 0;
  959. return link_path_walk(name, nd);
  960. }
  961. /*
  962. * SMP-safe: Returns 1 and nd will have valid dentry and mnt, if
  963. * everything is done. Returns 0 and drops input nd, if lookup failed;
  964. */
  965. static int __emul_lookup_dentry(const char *name, struct nameidata *nd)
  966. {
  967. if (path_walk(name, nd))
  968. return 0; /* something went wrong... */
  969. if (!nd->path.dentry->d_inode ||
  970. S_ISDIR(nd->path.dentry->d_inode->i_mode)) {
  971. struct path old_path = nd->path;
  972. struct qstr last = nd->last;
  973. int last_type = nd->last_type;
  974. struct fs_struct *fs = current->fs;
  975. /*
  976. * NAME was not found in alternate root or it's a directory.
  977. * Try to find it in the normal root:
  978. */
  979. nd->last_type = LAST_ROOT;
  980. read_lock(&fs->lock);
  981. nd->path = fs->root;
  982. path_get(&fs->root);
  983. read_unlock(&fs->lock);
  984. if (path_walk(name, nd) == 0) {
  985. if (nd->path.dentry->d_inode) {
  986. path_put(&old_path);
  987. return 1;
  988. }
  989. path_put(&nd->path);
  990. }
  991. nd->path = old_path;
  992. nd->last = last;
  993. nd->last_type = last_type;
  994. }
  995. return 1;
  996. }
  997. void set_fs_altroot(void)
  998. {
  999. char *emul = __emul_prefix();
  1000. struct nameidata nd;
  1001. struct path path = {}, old_path;
  1002. int err;
  1003. struct fs_struct *fs = current->fs;
  1004. if (!emul)
  1005. goto set_it;
  1006. err = path_lookup(emul, LOOKUP_FOLLOW|LOOKUP_DIRECTORY|LOOKUP_NOALT, &nd);
  1007. if (!err)
  1008. path = nd.path;
  1009. set_it:
  1010. write_lock(&fs->lock);
  1011. old_path = fs->altroot;
  1012. fs->altroot = path;
  1013. write_unlock(&fs->lock);
  1014. if (old_path.dentry)
  1015. path_put(&old_path);
  1016. }
  1017. /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
  1018. static int do_path_lookup(int dfd, const char *name,
  1019. unsigned int flags, struct nameidata *nd)
  1020. {
  1021. int retval = 0;
  1022. int fput_needed;
  1023. struct file *file;
  1024. struct fs_struct *fs = current->fs;
  1025. nd->last_type = LAST_ROOT; /* if there are only slashes... */
  1026. nd->flags = flags;
  1027. nd->depth = 0;
  1028. if (*name=='/') {
  1029. read_lock(&fs->lock);
  1030. if (fs->altroot.dentry && !(nd->flags & LOOKUP_NOALT)) {
  1031. nd->path = fs->altroot;
  1032. path_get(&fs->altroot);
  1033. read_unlock(&fs->lock);
  1034. if (__emul_lookup_dentry(name,nd))
  1035. goto out; /* found in altroot */
  1036. read_lock(&fs->lock);
  1037. }
  1038. nd->path = fs->root;
  1039. path_get(&fs->root);
  1040. read_unlock(&fs->lock);
  1041. } else if (dfd == AT_FDCWD) {
  1042. read_lock(&fs->lock);
  1043. nd->path = fs->pwd;
  1044. path_get(&fs->pwd);
  1045. read_unlock(&fs->lock);
  1046. } else {
  1047. struct dentry *dentry;
  1048. file = fget_light(dfd, &fput_needed);
  1049. retval = -EBADF;
  1050. if (!file)
  1051. goto out_fail;
  1052. dentry = file->f_path.dentry;
  1053. retval = -ENOTDIR;
  1054. if (!S_ISDIR(dentry->d_inode->i_mode))
  1055. goto fput_fail;
  1056. retval = file_permission(file, MAY_EXEC);
  1057. if (retval)
  1058. goto fput_fail;
  1059. nd->path = file->f_path;
  1060. path_get(&file->f_path);
  1061. fput_light(file, fput_needed);
  1062. }
  1063. retval = path_walk(name, nd);
  1064. out:
  1065. if (unlikely(!retval && !audit_dummy_context() && nd->path.dentry &&
  1066. nd->path.dentry->d_inode))
  1067. audit_inode(name, nd->path.dentry);
  1068. out_fail:
  1069. return retval;
  1070. fput_fail:
  1071. fput_light(file, fput_needed);
  1072. goto out_fail;
  1073. }
  1074. int path_lookup(const char *name, unsigned int flags,
  1075. struct nameidata *nd)
  1076. {
  1077. return do_path_lookup(AT_FDCWD, name, flags, nd);
  1078. }
  1079. /**
  1080. * vfs_path_lookup - lookup a file path relative to a dentry-vfsmount pair
  1081. * @dentry: pointer to dentry of the base directory
  1082. * @mnt: pointer to vfs mount of the base directory
  1083. * @name: pointer to file name
  1084. * @flags: lookup flags
  1085. * @nd: pointer to nameidata
  1086. */
  1087. int vfs_path_lookup(struct dentry *dentry, struct vfsmount *mnt,
  1088. const char *name, unsigned int flags,
  1089. struct nameidata *nd)
  1090. {
  1091. int retval;
  1092. /* same as do_path_lookup */
  1093. nd->last_type = LAST_ROOT;
  1094. nd->flags = flags;
  1095. nd->depth = 0;
  1096. nd->path.mnt = mntget(mnt);
  1097. nd->path.dentry = dget(dentry);
  1098. retval = path_walk(name, nd);
  1099. if (unlikely(!retval && !audit_dummy_context() && nd->path.dentry &&
  1100. nd->path.dentry->d_inode))
  1101. audit_inode(name, nd->path.dentry);
  1102. return retval;
  1103. }
  1104. static int __path_lookup_intent_open(int dfd, const char *name,
  1105. unsigned int lookup_flags, struct nameidata *nd,
  1106. int open_flags, int create_mode)
  1107. {
  1108. struct file *filp = get_empty_filp();
  1109. int err;
  1110. if (filp == NULL)
  1111. return -ENFILE;
  1112. nd->intent.open.file = filp;
  1113. nd->intent.open.flags = open_flags;
  1114. nd->intent.open.create_mode = create_mode;
  1115. err = do_path_lookup(dfd, name, lookup_flags|LOOKUP_OPEN, nd);
  1116. if (IS_ERR(nd->intent.open.file)) {
  1117. if (err == 0) {
  1118. err = PTR_ERR(nd->intent.open.file);
  1119. path_put(&nd->path);
  1120. }
  1121. } else if (err != 0)
  1122. release_open_intent(nd);
  1123. return err;
  1124. }
  1125. /**
  1126. * path_lookup_open - lookup a file path with open intent
  1127. * @dfd: the directory to use as base, or AT_FDCWD
  1128. * @name: pointer to file name
  1129. * @lookup_flags: lookup intent flags
  1130. * @nd: pointer to nameidata
  1131. * @open_flags: open intent flags
  1132. */
  1133. int path_lookup_open(int dfd, const char *name, unsigned int lookup_flags,
  1134. struct nameidata *nd, int open_flags)
  1135. {
  1136. return __path_lookup_intent_open(dfd, name, lookup_flags, nd,
  1137. open_flags, 0);
  1138. }
  1139. /**
  1140. * path_lookup_create - lookup a file path with open + create intent
  1141. * @dfd: the directory to use as base, or AT_FDCWD
  1142. * @name: pointer to file name
  1143. * @lookup_flags: lookup intent flags
  1144. * @nd: pointer to nameidata
  1145. * @open_flags: open intent flags
  1146. * @create_mode: create intent flags
  1147. */
  1148. static int path_lookup_create(int dfd, const char *name,
  1149. unsigned int lookup_flags, struct nameidata *nd,
  1150. int open_flags, int create_mode)
  1151. {
  1152. return __path_lookup_intent_open(dfd, name, lookup_flags|LOOKUP_CREATE,
  1153. nd, open_flags, create_mode);
  1154. }
  1155. int __user_path_lookup_open(const char __user *name, unsigned int lookup_flags,
  1156. struct nameidata *nd, int open_flags)
  1157. {
  1158. char *tmp = getname(name);
  1159. int err = PTR_ERR(tmp);
  1160. if (!IS_ERR(tmp)) {
  1161. err = __path_lookup_intent_open(AT_FDCWD, tmp, lookup_flags, nd, open_flags, 0);
  1162. putname(tmp);
  1163. }
  1164. return err;
  1165. }
  1166. static struct dentry *__lookup_hash(struct qstr *name,
  1167. struct dentry *base, struct nameidata *nd)
  1168. {
  1169. struct dentry *dentry;
  1170. struct inode *inode;
  1171. int err;
  1172. inode = base->d_inode;
  1173. /*
  1174. * See if the low-level filesystem might want
  1175. * to use its own hash..
  1176. */
  1177. if (base->d_op && base->d_op->d_hash) {
  1178. err = base->d_op->d_hash(base, name);
  1179. dentry = ERR_PTR(err);
  1180. if (err < 0)
  1181. goto out;
  1182. }
  1183. dentry = cached_lookup(base, name, nd);
  1184. if (!dentry) {
  1185. struct dentry *new = d_alloc(base, name);
  1186. dentry = ERR_PTR(-ENOMEM);
  1187. if (!new)
  1188. goto out;
  1189. dentry = inode->i_op->lookup(inode, new, nd);
  1190. if (!dentry)
  1191. dentry = new;
  1192. else
  1193. dput(new);
  1194. }
  1195. out:
  1196. return dentry;
  1197. }
  1198. /*
  1199. * Restricted form of lookup. Doesn't follow links, single-component only,
  1200. * needs parent already locked. Doesn't follow mounts.
  1201. * SMP-safe.
  1202. */
  1203. static struct dentry *lookup_hash(struct nameidata *nd)
  1204. {
  1205. int err;
  1206. err = permission(nd->path.dentry->d_inode, MAY_EXEC, nd);
  1207. if (err)
  1208. return ERR_PTR(err);
  1209. return __lookup_hash(&nd->last, nd->path.dentry, nd);
  1210. }
  1211. static int __lookup_one_len(const char *name, struct qstr *this,
  1212. struct dentry *base, int len)
  1213. {
  1214. unsigned long hash;
  1215. unsigned int c;
  1216. this->name = name;
  1217. this->len = len;
  1218. if (!len)
  1219. return -EACCES;
  1220. hash = init_name_hash();
  1221. while (len--) {
  1222. c = *(const unsigned char *)name++;
  1223. if (c == '/' || c == '\0')
  1224. return -EACCES;
  1225. hash = partial_name_hash(c, hash);
  1226. }
  1227. this->hash = end_name_hash(hash);
  1228. return 0;
  1229. }
  1230. /**
  1231. * lookup_one_len - filesystem helper to lookup single pathname component
  1232. * @name: pathname component to lookup
  1233. * @base: base directory to lookup from
  1234. * @len: maximum length @len should be interpreted to
  1235. *
  1236. * Note that this routine is purely a helper for filesystem usage and should
  1237. * not be called by generic code. Also note that by using this function the
  1238. * nameidata argument is passed to the filesystem methods and a filesystem
  1239. * using this helper needs to be prepared for that.
  1240. */
  1241. struct dentry *lookup_one_len(const char *name, struct dentry *base, int len)
  1242. {
  1243. int err;
  1244. struct qstr this;
  1245. err = __lookup_one_len(name, &this, base, len);
  1246. if (err)
  1247. return ERR_PTR(err);
  1248. err = permission(base->d_inode, MAY_EXEC, NULL);
  1249. if (err)
  1250. return ERR_PTR(err);
  1251. return __lookup_hash(&this, base, NULL);
  1252. }
  1253. /**
  1254. * lookup_one_noperm - bad hack for sysfs
  1255. * @name: pathname component to lookup
  1256. * @base: base directory to lookup from
  1257. *
  1258. * This is a variant of lookup_one_len that doesn't perform any permission
  1259. * checks. It's a horrible hack to work around the braindead sysfs
  1260. * architecture and should not be used anywhere else.
  1261. *
  1262. * DON'T USE THIS FUNCTION EVER, thanks.
  1263. */
  1264. struct dentry *lookup_one_noperm(const char *name, struct dentry *base)
  1265. {
  1266. int err;
  1267. struct qstr this;
  1268. err = __lookup_one_len(name, &this, base, strlen(name));
  1269. if (err)
  1270. return ERR_PTR(err);
  1271. return __lookup_hash(&this, base, NULL);
  1272. }
  1273. int __user_walk_fd(int dfd, const char __user *name, unsigned flags,
  1274. struct nameidata *nd)
  1275. {
  1276. char *tmp = getname(name);
  1277. int err = PTR_ERR(tmp);
  1278. if (!IS_ERR(tmp)) {
  1279. err = do_path_lookup(dfd, tmp, flags, nd);
  1280. putname(tmp);
  1281. }
  1282. return err;
  1283. }
  1284. int __user_walk(const char __user *name, unsigned flags, struct nameidata *nd)
  1285. {
  1286. return __user_walk_fd(AT_FDCWD, name, flags, nd);
  1287. }
  1288. /*
  1289. * It's inline, so penalty for filesystems that don't use sticky bit is
  1290. * minimal.
  1291. */
  1292. static inline int check_sticky(struct inode *dir, struct inode *inode)
  1293. {
  1294. if (!(dir->i_mode & S_ISVTX))
  1295. return 0;
  1296. if (inode->i_uid == current->fsuid)
  1297. return 0;
  1298. if (dir->i_uid == current->fsuid)
  1299. return 0;
  1300. return !capable(CAP_FOWNER);
  1301. }
  1302. /*
  1303. * Check whether we can remove a link victim from directory dir, check
  1304. * whether the type of victim is right.
  1305. * 1. We can't do it if dir is read-only (done in permission())
  1306. * 2. We should have write and exec permissions on dir
  1307. * 3. We can't remove anything from append-only dir
  1308. * 4. We can't do anything with immutable dir (done in permission())
  1309. * 5. If the sticky bit on dir is set we should either
  1310. * a. be owner of dir, or
  1311. * b. be owner of victim, or
  1312. * c. have CAP_FOWNER capability
  1313. * 6. If the victim is append-only or immutable we can't do antyhing with
  1314. * links pointing to it.
  1315. * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR.
  1316. * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR.
  1317. * 9. We can't remove a root or mountpoint.
  1318. * 10. We don't allow removal of NFS sillyrenamed files; it's handled by
  1319. * nfs_async_unlink().
  1320. */
  1321. static int may_delete(struct inode *dir,struct dentry *victim,int isdir)
  1322. {
  1323. int error;
  1324. if (!victim->d_inode)
  1325. return -ENOENT;
  1326. BUG_ON(victim->d_parent->d_inode != dir);
  1327. audit_inode_child(victim->d_name.name, victim, dir);
  1328. error = permission(dir,MAY_WRITE | MAY_EXEC, NULL);
  1329. if (error)
  1330. return error;
  1331. if (IS_APPEND(dir))
  1332. return -EPERM;
  1333. if (check_sticky(dir, victim->d_inode)||IS_APPEND(victim->d_inode)||
  1334. IS_IMMUTABLE(victim->d_inode))
  1335. return -EPERM;
  1336. if (isdir) {
  1337. if (!S_ISDIR(victim->d_inode->i_mode))
  1338. return -ENOTDIR;
  1339. if (IS_ROOT(victim))
  1340. return -EBUSY;
  1341. } else if (S_ISDIR(victim->d_inode->i_mode))
  1342. return -EISDIR;
  1343. if (IS_DEADDIR(dir))
  1344. return -ENOENT;
  1345. if (victim->d_flags & DCACHE_NFSFS_RENAMED)
  1346. return -EBUSY;
  1347. return 0;
  1348. }
  1349. /* Check whether we can create an object with dentry child in directory
  1350. * dir.
  1351. * 1. We can't do it if child already exists (open has special treatment for
  1352. * this case, but since we are inlined it's OK)
  1353. * 2. We can't do it if dir is read-only (done in permission())
  1354. * 3. We should have write and exec permissions on dir
  1355. * 4. We can't do it if dir is immutable (done in permission())
  1356. */
  1357. static inline int may_create(struct inode *dir, struct dentry *child,
  1358. struct nameidata *nd)
  1359. {
  1360. if (child->d_inode)
  1361. return -EEXIST;
  1362. if (IS_DEADDIR(dir))
  1363. return -ENOENT;
  1364. return permission(dir,MAY_WRITE | MAY_EXEC, nd);
  1365. }
  1366. /*
  1367. * O_DIRECTORY translates into forcing a directory lookup.
  1368. */
  1369. static inline int lookup_flags(unsigned int f)
  1370. {
  1371. unsigned long retval = LOOKUP_FOLLOW;
  1372. if (f & O_NOFOLLOW)
  1373. retval &= ~LOOKUP_FOLLOW;
  1374. if (f & O_DIRECTORY)
  1375. retval |= LOOKUP_DIRECTORY;
  1376. return retval;
  1377. }
  1378. /*
  1379. * p1 and p2 should be directories on the same fs.
  1380. */
  1381. struct dentry *lock_rename(struct dentry *p1, struct dentry *p2)
  1382. {
  1383. struct dentry *p;
  1384. if (p1 == p2) {
  1385. mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
  1386. return NULL;
  1387. }
  1388. mutex_lock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
  1389. for (p = p1; p->d_parent != p; p = p->d_parent) {
  1390. if (p->d_parent == p2) {
  1391. mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_PARENT);
  1392. mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_CHILD);
  1393. return p;
  1394. }
  1395. }
  1396. for (p = p2; p->d_parent != p; p = p->d_parent) {
  1397. if (p->d_parent == p1) {
  1398. mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
  1399. mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
  1400. return p;
  1401. }
  1402. }
  1403. mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
  1404. mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
  1405. return NULL;
  1406. }
  1407. void unlock_rename(struct dentry *p1, struct dentry *p2)
  1408. {
  1409. mutex_unlock(&p1->d_inode->i_mutex);
  1410. if (p1 != p2) {
  1411. mutex_unlock(&p2->d_inode->i_mutex);
  1412. mutex_unlock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
  1413. }
  1414. }
  1415. int vfs_create(struct inode *dir, struct dentry *dentry, int mode,
  1416. struct nameidata *nd)
  1417. {
  1418. int error = may_create(dir, dentry, nd);
  1419. if (error)
  1420. return error;
  1421. if (!dir->i_op || !dir->i_op->create)
  1422. return -EACCES; /* shouldn't it be ENOSYS? */
  1423. mode &= S_IALLUGO;
  1424. mode |= S_IFREG;
  1425. error = security_inode_create(dir, dentry, mode);
  1426. if (error)
  1427. return error;
  1428. DQUOT_INIT(dir);
  1429. error = dir->i_op->create(dir, dentry, mode, nd);
  1430. if (!error)
  1431. fsnotify_create(dir, dentry);
  1432. return error;
  1433. }
  1434. int may_open(struct nameidata *nd, int acc_mode, int flag)
  1435. {
  1436. struct dentry *dentry = nd->path.dentry;
  1437. struct inode *inode = dentry->d_inode;
  1438. int error;
  1439. if (!inode)
  1440. return -ENOENT;
  1441. if (S_ISLNK(inode->i_mode))
  1442. return -ELOOP;
  1443. if (S_ISDIR(inode->i_mode) && (acc_mode & MAY_WRITE))
  1444. return -EISDIR;
  1445. /*
  1446. * FIFO's, sockets and device files are special: they don't
  1447. * actually live on the filesystem itself, and as such you
  1448. * can write to them even if the filesystem is read-only.
  1449. */
  1450. if (S_ISFIFO(inode->i_mode) || S_ISSOCK(inode->i_mode)) {
  1451. flag &= ~O_TRUNC;
  1452. } else if (S_ISBLK(inode->i_mode) || S_ISCHR(inode->i_mode)) {
  1453. if (nd->path.mnt->mnt_flags & MNT_NODEV)
  1454. return -EACCES;
  1455. flag &= ~O_TRUNC;
  1456. }
  1457. error = vfs_permission(nd, acc_mode);
  1458. if (error)
  1459. return error;
  1460. /*
  1461. * An append-only file must be opened in append mode for writing.
  1462. */
  1463. if (IS_APPEND(inode)) {
  1464. if ((flag & FMODE_WRITE) && !(flag & O_APPEND))
  1465. return -EPERM;
  1466. if (flag & O_TRUNC)
  1467. return -EPERM;
  1468. }
  1469. /* O_NOATIME can only be set by the owner or superuser */
  1470. if (flag & O_NOATIME)
  1471. if (!is_owner_or_cap(inode))
  1472. return -EPERM;
  1473. /*
  1474. * Ensure there are no outstanding leases on the file.
  1475. */
  1476. error = break_lease(inode, flag);
  1477. if (error)
  1478. return error;
  1479. if (flag & O_TRUNC) {
  1480. error = get_write_access(inode);
  1481. if (error)
  1482. return error;
  1483. /*
  1484. * Refuse to truncate files with mandatory locks held on them.
  1485. */
  1486. error = locks_verify_locked(inode);
  1487. if (!error) {
  1488. DQUOT_INIT(inode);
  1489. error = do_truncate(dentry, 0,
  1490. ATTR_MTIME|ATTR_CTIME|ATTR_OPEN,
  1491. NULL);
  1492. }
  1493. put_write_access(inode);
  1494. if (error)
  1495. return error;
  1496. } else
  1497. if (flag & FMODE_WRITE)
  1498. DQUOT_INIT(inode);
  1499. return 0;
  1500. }
  1501. /*
  1502. * Be careful about ever adding any more callers of this
  1503. * function. Its flags must be in the namei format, not
  1504. * what get passed to sys_open().
  1505. */
  1506. static int __open_namei_create(struct nameidata *nd, struct path *path,
  1507. int flag, int mode)
  1508. {
  1509. int error;
  1510. struct dentry *dir = nd->path.dentry;
  1511. if (!IS_POSIXACL(dir->d_inode))
  1512. mode &= ~current->fs->umask;
  1513. error = vfs_create(dir->d_inode, path->dentry, mode, nd);
  1514. mutex_unlock(&dir->d_inode->i_mutex);
  1515. dput(nd->path.dentry);
  1516. nd->path.dentry = path->dentry;
  1517. if (error)
  1518. return error;
  1519. /* Don't check for write permission, don't truncate */
  1520. return may_open(nd, 0, flag & ~O_TRUNC);
  1521. }
  1522. /*
  1523. * Note that while the flag value (low two bits) for sys_open means:
  1524. * 00 - read-only
  1525. * 01 - write-only
  1526. * 10 - read-write
  1527. * 11 - special
  1528. * it is changed into
  1529. * 00 - no permissions needed
  1530. * 01 - read-permission
  1531. * 10 - write-permission
  1532. * 11 - read-write
  1533. * for the internal routines (ie open_namei()/follow_link() etc)
  1534. * This is more logical, and also allows the 00 "no perm needed"
  1535. * to be used for symlinks (where the permissions are checked
  1536. * later).
  1537. *
  1538. */
  1539. static inline int open_to_namei_flags(int flag)
  1540. {
  1541. if ((flag+1) & O_ACCMODE)
  1542. flag++;
  1543. return flag;
  1544. }
  1545. static int open_will_write_to_fs(int flag, struct inode *inode)
  1546. {
  1547. /*
  1548. * We'll never write to the fs underlying
  1549. * a device file.
  1550. */
  1551. if (special_file(inode->i_mode))
  1552. return 0;
  1553. return (flag & O_TRUNC);
  1554. }
  1555. /*
  1556. * Note that the low bits of the passed in "open_flag"
  1557. * are not the same as in the local variable "flag". See
  1558. * open_to_namei_flags() for more details.
  1559. */
  1560. struct file *do_filp_open(int dfd, const char *pathname,
  1561. int open_flag, int mode)
  1562. {
  1563. struct file *filp;
  1564. struct nameidata nd;
  1565. int acc_mode, error;
  1566. struct path path;
  1567. struct dentry *dir;
  1568. int count = 0;
  1569. int will_write;
  1570. int flag = open_to_namei_flags(open_flag);
  1571. acc_mode = ACC_MODE(flag);
  1572. /* O_TRUNC implies we need access checks for write permissions */
  1573. if (flag & O_TRUNC)
  1574. acc_mode |= MAY_WRITE;
  1575. /* Allow the LSM permission hook to distinguish append
  1576. access from general write access. */
  1577. if (flag & O_APPEND)
  1578. acc_mode |= MAY_APPEND;
  1579. /*
  1580. * The simplest case - just a plain lookup.
  1581. */
  1582. if (!(flag & O_CREAT)) {
  1583. error = path_lookup_open(dfd, pathname, lookup_flags(flag),
  1584. &nd, flag);
  1585. if (error)
  1586. return ERR_PTR(error);
  1587. goto ok;
  1588. }
  1589. /*
  1590. * Create - we need to know the parent.
  1591. */
  1592. error = path_lookup_create(dfd, pathname, LOOKUP_PARENT,
  1593. &nd, flag, mode);
  1594. if (error)
  1595. return ERR_PTR(error);
  1596. /*
  1597. * We have the parent and last component. First of all, check
  1598. * that we are not asked to creat(2) an obvious directory - that
  1599. * will not do.
  1600. */
  1601. error = -EISDIR;
  1602. if (nd.last_type != LAST_NORM || nd.last.name[nd.last.len])
  1603. goto exit;
  1604. dir = nd.path.dentry;
  1605. nd.flags &= ~LOOKUP_PARENT;
  1606. mutex_lock(&dir->d_inode->i_mutex);
  1607. path.dentry = lookup_hash(&nd);
  1608. path.mnt = nd.path.mnt;
  1609. do_last:
  1610. error = PTR_ERR(path.dentry);
  1611. if (IS_ERR(path.dentry)) {
  1612. mutex_unlock(&dir->d_inode->i_mutex);
  1613. goto exit;
  1614. }
  1615. if (IS_ERR(nd.intent.open.file)) {
  1616. error = PTR_ERR(nd.intent.open.file);
  1617. goto exit_mutex_unlock;
  1618. }
  1619. /* Negative dentry, just create the file */
  1620. if (!path.dentry->d_inode) {
  1621. /*
  1622. * This write is needed to ensure that a
  1623. * ro->rw transition does not occur between
  1624. * the time when the file is created and when
  1625. * a permanent write count is taken through
  1626. * the 'struct file' in nameidata_to_filp().
  1627. */
  1628. error = mnt_want_write(nd.path.mnt);
  1629. if (error)
  1630. goto exit_mutex_unlock;
  1631. error = __open_namei_create(&nd, &path, flag, mode);
  1632. if (error) {
  1633. mnt_drop_write(nd.path.mnt);
  1634. goto exit;
  1635. }
  1636. filp = nameidata_to_filp(&nd, open_flag);
  1637. mnt_drop_write(nd.path.mnt);
  1638. return filp;
  1639. }
  1640. /*
  1641. * It already exists.
  1642. */
  1643. mutex_unlock(&dir->d_inode->i_mutex);
  1644. audit_inode(pathname, path.dentry);
  1645. error = -EEXIST;
  1646. if (flag & O_EXCL)
  1647. goto exit_dput;
  1648. if (__follow_mount(&path)) {
  1649. error = -ELOOP;
  1650. if (flag & O_NOFOLLOW)
  1651. goto exit_dput;
  1652. }
  1653. error = -ENOENT;
  1654. if (!path.dentry->d_inode)
  1655. goto exit_dput;
  1656. if (path.dentry->d_inode->i_op && path.dentry->d_inode->i_op->follow_link)
  1657. goto do_link;
  1658. path_to_nameidata(&path, &nd);
  1659. error = -EISDIR;
  1660. if (path.dentry->d_inode && S_ISDIR(path.dentry->d_inode->i_mode))
  1661. goto exit;
  1662. ok:
  1663. /*
  1664. * Consider:
  1665. * 1. may_open() truncates a file
  1666. * 2. a rw->ro mount transition occurs
  1667. * 3. nameidata_to_filp() fails due to
  1668. * the ro mount.
  1669. * That would be inconsistent, and should
  1670. * be avoided. Taking this mnt write here
  1671. * ensures that (2) can not occur.
  1672. */
  1673. will_write = open_will_write_to_fs(flag, nd.path.dentry->d_inode);
  1674. if (will_write) {
  1675. error = mnt_want_write(nd.path.mnt);
  1676. if (error)
  1677. goto exit;
  1678. }
  1679. error = may_open(&nd, acc_mode, flag);
  1680. if (error) {
  1681. if (will_write)
  1682. mnt_drop_write(nd.path.mnt);
  1683. goto exit;
  1684. }
  1685. filp = nameidata_to_filp(&nd, open_flag);
  1686. /*
  1687. * It is now safe to drop the mnt write
  1688. * because the filp has had a write taken
  1689. * on its behalf.
  1690. */
  1691. if (will_write)
  1692. mnt_drop_write(nd.path.mnt);
  1693. return filp;
  1694. exit_mutex_unlock:
  1695. mutex_unlock(&dir->d_inode->i_mutex);
  1696. exit_dput:
  1697. path_put_conditional(&path, &nd);
  1698. exit:
  1699. if (!IS_ERR(nd.intent.open.file))
  1700. release_open_intent(&nd);
  1701. path_put(&nd.path);
  1702. return ERR_PTR(error);
  1703. do_link:
  1704. error = -ELOOP;
  1705. if (flag & O_NOFOLLOW)
  1706. goto exit_dput;
  1707. /*
  1708. * This is subtle. Instead of calling do_follow_link() we do the
  1709. * thing by hands. The reason is that this way we have zero link_count
  1710. * and path_walk() (called from ->follow_link) honoring LOOKUP_PARENT.
  1711. * After that we have the parent and last component, i.e.
  1712. * we are in the same situation as after the first path_walk().
  1713. * Well, almost - if the last component is normal we get its copy
  1714. * stored in nd->last.name and we will have to putname() it when we
  1715. * are done. Procfs-like symlinks just set LAST_BIND.
  1716. */
  1717. nd.flags |= LOOKUP_PARENT;
  1718. error = security_inode_follow_link(path.dentry, &nd);
  1719. if (error)
  1720. goto exit_dput;
  1721. error = __do_follow_link(&path, &nd);
  1722. if (error) {
  1723. /* Does someone understand code flow here? Or it is only
  1724. * me so stupid? Anathema to whoever designed this non-sense
  1725. * with "intent.open".
  1726. */
  1727. release_open_intent(&nd);
  1728. return ERR_PTR(error);
  1729. }
  1730. nd.flags &= ~LOOKUP_PARENT;
  1731. if (nd.last_type == LAST_BIND)
  1732. goto ok;
  1733. error = -EISDIR;
  1734. if (nd.last_type != LAST_NORM)
  1735. goto exit;
  1736. if (nd.last.name[nd.last.len]) {
  1737. __putname(nd.last.name);
  1738. goto exit;
  1739. }
  1740. error = -ELOOP;
  1741. if (count++==32) {
  1742. __putname(nd.last.name);
  1743. goto exit;
  1744. }
  1745. dir = nd.path.dentry;
  1746. mutex_lock(&dir->d_inode->i_mutex);
  1747. path.dentry = lookup_hash(&nd);
  1748. path.mnt = nd.path.mnt;
  1749. __putname(nd.last.name);
  1750. goto do_last;
  1751. }
  1752. /**
  1753. * filp_open - open file and return file pointer
  1754. *
  1755. * @filename: path to open
  1756. * @flags: open flags as per the open(2) second argument
  1757. * @mode: mode for the new file if O_CREAT is set, else ignored
  1758. *
  1759. * This is the helper to open a file from kernelspace if you really
  1760. * have to. But in generally you should not do this, so please move
  1761. * along, nothing to see here..
  1762. */
  1763. struct file *filp_open(const char *filename, int flags, int mode)
  1764. {
  1765. return do_filp_open(AT_FDCWD, filename, flags, mode);
  1766. }
  1767. EXPORT_SYMBOL(filp_open);
  1768. /**
  1769. * lookup_create - lookup a dentry, creating it if it doesn't exist
  1770. * @nd: nameidata info
  1771. * @is_dir: directory flag
  1772. *
  1773. * Simple function to lookup and return a dentry and create it
  1774. * if it doesn't exist. Is SMP-safe.
  1775. *
  1776. * Returns with nd->path.dentry->d_inode->i_mutex locked.
  1777. */
  1778. struct dentry *lookup_create(struct nameidata *nd, int is_dir)
  1779. {
  1780. struct dentry *dentry = ERR_PTR(-EEXIST);
  1781. mutex_lock_nested(&nd->path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
  1782. /*
  1783. * Yucky last component or no last component at all?
  1784. * (foo/., foo/.., /////)
  1785. */
  1786. if (nd->last_type != LAST_NORM)
  1787. goto fail;
  1788. nd->flags &= ~LOOKUP_PARENT;
  1789. nd->flags |= LOOKUP_CREATE;
  1790. nd->intent.open.flags = O_EXCL;
  1791. /*
  1792. * Do the final lookup.
  1793. */
  1794. dentry = lookup_hash(nd);
  1795. if (IS_ERR(dentry))
  1796. goto fail;
  1797. /*
  1798. * Special case - lookup gave negative, but... we had foo/bar/
  1799. * From the vfs_mknod() POV we just have a negative dentry -
  1800. * all is fine. Let's be bastards - you had / on the end, you've
  1801. * been asking for (non-existent) directory. -ENOENT for you.
  1802. */
  1803. if (!is_dir && nd->last.name[nd->last.len] && !dentry->d_inode)
  1804. goto enoent;
  1805. return dentry;
  1806. enoent:
  1807. dput(dentry);
  1808. dentry = ERR_PTR(-ENOENT);
  1809. fail:
  1810. return dentry;
  1811. }
  1812. EXPORT_SYMBOL_GPL(lookup_create);
  1813. int vfs_mknod(struct inode *dir, struct dentry *dentry, int mode, dev_t dev)
  1814. {
  1815. int error = may_create(dir, dentry, NULL);
  1816. if (error)
  1817. return error;
  1818. if ((S_ISCHR(mode) || S_ISBLK(mode)) && !capable(CAP_MKNOD))
  1819. return -EPERM;
  1820. if (!dir->i_op || !dir->i_op->mknod)
  1821. return -EPERM;
  1822. error = devcgroup_inode_mknod(mode, dev);
  1823. if (error)
  1824. return error;
  1825. error = security_inode_mknod(dir, dentry, mode, dev);
  1826. if (error)
  1827. return error;
  1828. DQUOT_INIT(dir);
  1829. error = dir->i_op->mknod(dir, dentry, mode, dev);
  1830. if (!error)
  1831. fsnotify_create(dir, dentry);
  1832. return error;
  1833. }
  1834. static int may_mknod(mode_t mode)
  1835. {
  1836. switch (mode & S_IFMT) {
  1837. case S_IFREG:
  1838. case S_IFCHR:
  1839. case S_IFBLK:
  1840. case S_IFIFO:
  1841. case S_IFSOCK:
  1842. case 0: /* zero mode translates to S_IFREG */
  1843. return 0;
  1844. case S_IFDIR:
  1845. return -EPERM;
  1846. default:
  1847. return -EINVAL;
  1848. }
  1849. }
  1850. asmlinkage long sys_mknodat(int dfd, const char __user *filename, int mode,
  1851. unsigned dev)
  1852. {
  1853. int error = 0;
  1854. char * tmp;
  1855. struct dentry * dentry;
  1856. struct nameidata nd;
  1857. if (S_ISDIR(mode))
  1858. return -EPERM;
  1859. tmp = getname(filename);
  1860. if (IS_ERR(tmp))
  1861. return PTR_ERR(tmp);
  1862. error = do_path_lookup(dfd, tmp, LOOKUP_PARENT, &nd);
  1863. if (error)
  1864. goto out;
  1865. dentry = lookup_create(&nd, 0);
  1866. if (IS_ERR(dentry)) {
  1867. error = PTR_ERR(dentry);
  1868. goto out_unlock;
  1869. }
  1870. if (!IS_POSIXACL(nd.path.dentry->d_inode))
  1871. mode &= ~current->fs->umask;
  1872. error = may_mknod(mode);
  1873. if (error)
  1874. goto out_dput;
  1875. error = mnt_want_write(nd.path.mnt);
  1876. if (error)
  1877. goto out_dput;
  1878. switch (mode & S_IFMT) {
  1879. case 0: case S_IFREG:
  1880. error = vfs_create(nd.path.dentry->d_inode,dentry,mode,&nd);
  1881. break;
  1882. case S_IFCHR: case S_IFBLK:
  1883. error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode,
  1884. new_decode_dev(dev));
  1885. break;
  1886. case S_IFIFO: case S_IFSOCK:
  1887. error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode,0);
  1888. break;
  1889. }
  1890. mnt_drop_write(nd.path.mnt);
  1891. out_dput:
  1892. dput(dentry);
  1893. out_unlock:
  1894. mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
  1895. path_put(&nd.path);
  1896. out:
  1897. putname(tmp);
  1898. return error;
  1899. }
  1900. asmlinkage long sys_mknod(const char __user *filename, int mode, unsigned dev)
  1901. {
  1902. return sys_mknodat(AT_FDCWD, filename, mode, dev);
  1903. }
  1904. int vfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
  1905. {
  1906. int error = may_create(dir, dentry, NULL);
  1907. if (error)
  1908. return error;
  1909. if (!dir->i_op || !dir->i_op->mkdir)
  1910. return -EPERM;
  1911. mode &= (S_IRWXUGO|S_ISVTX);
  1912. error = security_inode_mkdir(dir, dentry, mode);
  1913. if (error)
  1914. return error;
  1915. DQUOT_INIT(dir);
  1916. error = dir->i_op->mkdir(dir, dentry, mode);
  1917. if (!error)
  1918. fsnotify_mkdir(dir, dentry);
  1919. return error;
  1920. }
  1921. asmlinkage long sys_mkdirat(int dfd, const char __user *pathname, int mode)
  1922. {
  1923. int error = 0;
  1924. char * tmp;
  1925. struct dentry *dentry;
  1926. struct nameidata nd;
  1927. tmp = getname(pathname);
  1928. error = PTR_ERR(tmp);
  1929. if (IS_ERR(tmp))
  1930. goto out_err;
  1931. error = do_path_lookup(dfd, tmp, LOOKUP_PARENT, &nd);
  1932. if (error)
  1933. goto out;
  1934. dentry = lookup_create(&nd, 1);
  1935. error = PTR_ERR(dentry);
  1936. if (IS_ERR(dentry))
  1937. goto out_unlock;
  1938. if (!IS_POSIXACL(nd.path.dentry->d_inode))
  1939. mode &= ~current->fs->umask;
  1940. error = mnt_want_write(nd.path.mnt);
  1941. if (error)
  1942. goto out_dput;
  1943. error = vfs_mkdir(nd.path.dentry->d_inode, dentry, mode);
  1944. mnt_drop_write(nd.path.mnt);
  1945. out_dput:
  1946. dput(dentry);
  1947. out_unlock:
  1948. mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
  1949. path_put(&nd.path);
  1950. out:
  1951. putname(tmp);
  1952. out_err:
  1953. return error;
  1954. }
  1955. asmlinkage long sys_mkdir(const char __user *pathname, int mode)
  1956. {
  1957. return sys_mkdirat(AT_FDCWD, pathname, mode);
  1958. }
  1959. /*
  1960. * We try to drop the dentry early: we should have
  1961. * a usage count of 2 if we're the only user of this
  1962. * dentry, and if that is true (possibly after pruning
  1963. * the dcache), then we drop the dentry now.
  1964. *
  1965. * A low-level filesystem can, if it choses, legally
  1966. * do a
  1967. *
  1968. * if (!d_unhashed(dentry))
  1969. * return -EBUSY;
  1970. *
  1971. * if it cannot handle the case of removing a directory
  1972. * that is still in use by something else..
  1973. */
  1974. void dentry_unhash(struct dentry *dentry)
  1975. {
  1976. dget(dentry);
  1977. shrink_dcache_parent(dentry);
  1978. spin_lock(&dcache_lock);
  1979. spin_lock(&dentry->d_lock);
  1980. if (atomic_read(&dentry->d_count) == 2)
  1981. __d_drop(dentry);
  1982. spin_unlock(&dentry->d_lock);
  1983. spin_unlock(&dcache_lock);
  1984. }
  1985. int vfs_rmdir(struct inode *dir, struct dentry *dentry)
  1986. {
  1987. int error = may_delete(dir, dentry, 1);
  1988. if (error)
  1989. return error;
  1990. if (!dir->i_op || !dir->i_op->rmdir)
  1991. return -EPERM;
  1992. DQUOT_INIT(dir);
  1993. mutex_lock(&dentry->d_inode->i_mutex);
  1994. dentry_unhash(dentry);
  1995. if (d_mountpoint(dentry))
  1996. error = -EBUSY;
  1997. else {
  1998. error = security_inode_rmdir(dir, dentry);
  1999. if (!error) {
  2000. error = dir->i_op->rmdir(dir, dentry);
  2001. if (!error)
  2002. dentry->d_inode->i_flags |= S_DEAD;
  2003. }
  2004. }
  2005. mutex_unlock(&dentry->d_inode->i_mutex);
  2006. if (!error) {
  2007. d_delete(dentry);
  2008. }
  2009. dput(dentry);
  2010. return error;
  2011. }
  2012. static long do_rmdir(int dfd, const char __user *pathname)
  2013. {
  2014. int error = 0;
  2015. char * name;
  2016. struct dentry *dentry;
  2017. struct nameidata nd;
  2018. name = getname(pathname);
  2019. if(IS_ERR(name))
  2020. return PTR_ERR(name);
  2021. error = do_path_lookup(dfd, name, LOOKUP_PARENT, &nd);
  2022. if (error)
  2023. goto exit;
  2024. switch(nd.last_type) {
  2025. case LAST_DOTDOT:
  2026. error = -ENOTEMPTY;
  2027. goto exit1;
  2028. case LAST_DOT:
  2029. error = -EINVAL;
  2030. goto exit1;
  2031. case LAST_ROOT:
  2032. error = -EBUSY;
  2033. goto exit1;
  2034. }
  2035. mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
  2036. dentry = lookup_hash(&nd);
  2037. error = PTR_ERR(dentry);
  2038. if (IS_ERR(dentry))
  2039. goto exit2;
  2040. error = mnt_want_write(nd.path.mnt);
  2041. if (error)
  2042. goto exit3;
  2043. error = vfs_rmdir(nd.path.dentry->d_inode, dentry);
  2044. mnt_drop_write(nd.path.mnt);
  2045. exit3:
  2046. dput(dentry);
  2047. exit2:
  2048. mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
  2049. exit1:
  2050. path_put(&nd.path);
  2051. exit:
  2052. putname(name);
  2053. return error;
  2054. }
  2055. asmlinkage long sys_rmdir(const char __user *pathname)
  2056. {
  2057. return do_rmdir(AT_FDCWD, pathname);
  2058. }
  2059. int vfs_unlink(struct inode *dir, struct dentry *dentry)
  2060. {
  2061. int error = may_delete(dir, dentry, 0);
  2062. if (error)
  2063. return error;
  2064. if (!dir->i_op || !dir->i_op->unlink)
  2065. return -EPERM;
  2066. DQUOT_INIT(dir);
  2067. mutex_lock(&dentry->d_inode->i_mutex);
  2068. if (d_mountpoint(dentry))
  2069. error = -EBUSY;
  2070. else {
  2071. error = security_inode_unlink(dir, dentry);
  2072. if (!error)
  2073. error = dir->i_op->unlink(dir, dentry);
  2074. }
  2075. mutex_unlock(&dentry->d_inode->i_mutex);
  2076. /* We don't d_delete() NFS sillyrenamed files--they still exist. */
  2077. if (!error && !(dentry->d_flags & DCACHE_NFSFS_RENAMED)) {
  2078. fsnotify_link_count(dentry->d_inode);
  2079. d_delete(dentry);
  2080. }
  2081. return error;
  2082. }
  2083. /*
  2084. * Make sure that the actual truncation of the file will occur outside its
  2085. * directory's i_mutex. Truncate can take a long time if there is a lot of
  2086. * writeout happening, and we don't want to prevent access to the directory
  2087. * while waiting on the I/O.
  2088. */
  2089. static long do_unlinkat(int dfd, const char __user *pathname)
  2090. {
  2091. int error = 0;
  2092. char * name;
  2093. struct dentry *dentry;
  2094. struct nameidata nd;
  2095. struct inode *inode = NULL;
  2096. name = getname(pathname);
  2097. if(IS_ERR(name))
  2098. return PTR_ERR(name);
  2099. error = do_path_lookup(dfd, name, LOOKUP_PARENT, &nd);
  2100. if (error)
  2101. goto exit;
  2102. error = -EISDIR;
  2103. if (nd.last_type != LAST_NORM)
  2104. goto exit1;
  2105. mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
  2106. dentry = lookup_hash(&nd);
  2107. error = PTR_ERR(dentry);
  2108. if (!IS_ERR(dentry)) {
  2109. /* Why not before? Because we want correct error value */
  2110. if (nd.last.name[nd.last.len])
  2111. goto slashes;
  2112. inode = dentry->d_inode;
  2113. if (inode)
  2114. atomic_inc(&inode->i_count);
  2115. error = mnt_want_write(nd.path.mnt);
  2116. if (error)
  2117. goto exit2;
  2118. error = vfs_unlink(nd.path.dentry->d_inode, dentry);
  2119. mnt_drop_write(nd.path.mnt);
  2120. exit2:
  2121. dput(dentry);
  2122. }
  2123. mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
  2124. if (inode)
  2125. iput(inode); /* truncate the inode here */
  2126. exit1:
  2127. path_put(&nd.path);
  2128. exit:
  2129. putname(name);
  2130. return error;
  2131. slashes:
  2132. error = !dentry->d_inode ? -ENOENT :
  2133. S_ISDIR(dentry->d_inode->i_mode) ? -EISDIR : -ENOTDIR;
  2134. goto exit2;
  2135. }
  2136. asmlinkage long sys_unlinkat(int dfd, const char __user *pathname, int flag)
  2137. {
  2138. if ((flag & ~AT_REMOVEDIR) != 0)
  2139. return -EINVAL;
  2140. if (flag & AT_REMOVEDIR)
  2141. return do_rmdir(dfd, pathname);
  2142. return do_unlinkat(dfd, pathname);
  2143. }
  2144. asmlinkage long sys_unlink(const char __user *pathname)
  2145. {
  2146. return do_unlinkat(AT_FDCWD, pathname);
  2147. }
  2148. int vfs_symlink(struct inode *dir, struct dentry *dentry, const char *oldname, int mode)
  2149. {
  2150. int error = may_create(dir, dentry, NULL);
  2151. if (error)
  2152. return error;
  2153. if (!dir->i_op || !dir->i_op->symlink)
  2154. return -EPERM;
  2155. error = security_inode_symlink(dir, dentry, oldname);
  2156. if (error)
  2157. return error;
  2158. DQUOT_INIT(dir);
  2159. error = dir->i_op->symlink(dir, dentry, oldname);
  2160. if (!error)
  2161. fsnotify_create(dir, dentry);
  2162. return error;
  2163. }
  2164. asmlinkage long sys_symlinkat(const char __user *oldname,
  2165. int newdfd, const char __user *newname)
  2166. {
  2167. int error = 0;
  2168. char * from;
  2169. char * to;
  2170. struct dentry *dentry;
  2171. struct nameidata nd;
  2172. from = getname(oldname);
  2173. if(IS_ERR(from))
  2174. return PTR_ERR(from);
  2175. to = getname(newname);
  2176. error = PTR_ERR(to);
  2177. if (IS_ERR(to))
  2178. goto out_putname;
  2179. error = do_path_lookup(newdfd, to, LOOKUP_PARENT, &nd);
  2180. if (error)
  2181. goto out;
  2182. dentry = lookup_create(&nd, 0);
  2183. error = PTR_ERR(dentry);
  2184. if (IS_ERR(dentry))
  2185. goto out_unlock;
  2186. error = mnt_want_write(nd.path.mnt);
  2187. if (error)
  2188. goto out_dput;
  2189. error = vfs_symlink(nd.path.dentry->d_inode, dentry, from, S_IALLUGO);
  2190. mnt_drop_write(nd.path.mnt);
  2191. out_dput:
  2192. dput(dentry);
  2193. out_unlock:
  2194. mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
  2195. path_put(&nd.path);
  2196. out:
  2197. putname(to);
  2198. out_putname:
  2199. putname(from);
  2200. return error;
  2201. }
  2202. asmlinkage long sys_symlink(const char __user *oldname, const char __user *newname)
  2203. {
  2204. return sys_symlinkat(oldname, AT_FDCWD, newname);
  2205. }
  2206. int vfs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *new_dentry)
  2207. {
  2208. struct inode *inode = old_dentry->d_inode;
  2209. int error;
  2210. if (!inode)
  2211. return -ENOENT;
  2212. error = may_create(dir, new_dentry, NULL);
  2213. if (error)
  2214. return error;
  2215. if (dir->i_sb != inode->i_sb)
  2216. return -EXDEV;
  2217. /*
  2218. * A link to an append-only or immutable file cannot be created.
  2219. */
  2220. if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
  2221. return -EPERM;
  2222. if (!dir->i_op || !dir->i_op->link)
  2223. return -EPERM;
  2224. if (S_ISDIR(old_dentry->d_inode->i_mode))
  2225. return -EPERM;
  2226. error = security_inode_link(old_dentry, dir, new_dentry);
  2227. if (error)
  2228. return error;
  2229. mutex_lock(&old_dentry->d_inode->i_mutex);
  2230. DQUOT_INIT(dir);
  2231. error = dir->i_op->link(old_dentry, dir, new_dentry);
  2232. mutex_unlock(&old_dentry->d_inode->i_mutex);
  2233. if (!error)
  2234. fsnotify_link(dir, old_dentry->d_inode, new_dentry);
  2235. return error;
  2236. }
  2237. /*
  2238. * Hardlinks are often used in delicate situations. We avoid
  2239. * security-related surprises by not following symlinks on the
  2240. * newname. --KAB
  2241. *
  2242. * We don't follow them on the oldname either to be compatible
  2243. * with linux 2.0, and to avoid hard-linking to directories
  2244. * and other special files. --ADM
  2245. */
  2246. asmlinkage long sys_linkat(int olddfd, const char __user *oldname,
  2247. int newdfd, const char __user *newname,
  2248. int flags)
  2249. {
  2250. struct dentry *new_dentry;
  2251. struct nameidata nd, old_nd;
  2252. int error;
  2253. char * to;
  2254. if ((flags & ~AT_SYMLINK_FOLLOW) != 0)
  2255. return -EINVAL;
  2256. to = getname(newname);
  2257. if (IS_ERR(to))
  2258. return PTR_ERR(to);
  2259. error = __user_walk_fd(olddfd, oldname,
  2260. flags & AT_SYMLINK_FOLLOW ? LOOKUP_FOLLOW : 0,
  2261. &old_nd);
  2262. if (error)
  2263. goto exit;
  2264. error = do_path_lookup(newdfd, to, LOOKUP_PARENT, &nd);
  2265. if (error)
  2266. goto out;
  2267. error = -EXDEV;
  2268. if (old_nd.path.mnt != nd.path.mnt)
  2269. goto out_release;
  2270. new_dentry = lookup_create(&nd, 0);
  2271. error = PTR_ERR(new_dentry);
  2272. if (IS_ERR(new_dentry))
  2273. goto out_unlock;
  2274. error = mnt_want_write(nd.path.mnt);
  2275. if (error)
  2276. goto out_dput;
  2277. error = vfs_link(old_nd.path.dentry, nd.path.dentry->d_inode, new_dentry);
  2278. mnt_drop_write(nd.path.mnt);
  2279. out_dput:
  2280. dput(new_dentry);
  2281. out_unlock:
  2282. mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
  2283. out_release:
  2284. path_put(&nd.path);
  2285. out:
  2286. path_put(&old_nd.path);
  2287. exit:
  2288. putname(to);
  2289. return error;
  2290. }
  2291. asmlinkage long sys_link(const char __user *oldname, const char __user *newname)
  2292. {
  2293. return sys_linkat(AT_FDCWD, oldname, AT_FDCWD, newname, 0);
  2294. }
  2295. /*
  2296. * The worst of all namespace operations - renaming directory. "Perverted"
  2297. * doesn't even start to describe it. Somebody in UCB had a heck of a trip...
  2298. * Problems:
  2299. * a) we can get into loop creation. Check is done in is_subdir().
  2300. * b) race potential - two innocent renames can create a loop together.
  2301. * That's where 4.4 screws up. Current fix: serialization on
  2302. * sb->s_vfs_rename_mutex. We might be more accurate, but that's another
  2303. * story.
  2304. * c) we have to lock _three_ objects - parents and victim (if it exists).
  2305. * And that - after we got ->i_mutex on parents (until then we don't know
  2306. * whether the target exists). Solution: try to be smart with locking
  2307. * order for inodes. We rely on the fact that tree topology may change
  2308. * only under ->s_vfs_rename_mutex _and_ that parent of the object we
  2309. * move will be locked. Thus we can rank directories by the tree
  2310. * (ancestors first) and rank all non-directories after them.
  2311. * That works since everybody except rename does "lock parent, lookup,
  2312. * lock child" and rename is under ->s_vfs_rename_mutex.
  2313. * HOWEVER, it relies on the assumption that any object with ->lookup()
  2314. * has no more than 1 dentry. If "hybrid" objects will ever appear,
  2315. * we'd better make sure that there's no link(2) for them.
  2316. * d) some filesystems don't support opened-but-unlinked directories,
  2317. * either because of layout or because they are not ready to deal with
  2318. * all cases correctly. The latter will be fixed (taking this sort of
  2319. * stuff into VFS), but the former is not going away. Solution: the same
  2320. * trick as in rmdir().
  2321. * e) conversion from fhandle to dentry may come in the wrong moment - when
  2322. * we are removing the target. Solution: we will have to grab ->i_mutex
  2323. * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on
  2324. * ->i_mutex on parents, which works but leads to some truely excessive
  2325. * locking].
  2326. */
  2327. static int vfs_rename_dir(struct inode *old_dir, struct dentry *old_dentry,
  2328. struct inode *new_dir, struct dentry *new_dentry)
  2329. {
  2330. int error = 0;
  2331. struct inode *target;
  2332. /*
  2333. * If we are going to change the parent - check write permissions,
  2334. * we'll need to flip '..'.
  2335. */
  2336. if (new_dir != old_dir) {
  2337. error = permission(old_dentry->d_inode, MAY_WRITE, NULL);
  2338. if (error)
  2339. return error;
  2340. }
  2341. error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
  2342. if (error)
  2343. return error;
  2344. target = new_dentry->d_inode;
  2345. if (target) {
  2346. mutex_lock(&target->i_mutex);
  2347. dentry_unhash(new_dentry);
  2348. }
  2349. if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
  2350. error = -EBUSY;
  2351. else
  2352. error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
  2353. if (target) {
  2354. if (!error)
  2355. target->i_flags |= S_DEAD;
  2356. mutex_unlock(&target->i_mutex);
  2357. if (d_unhashed(new_dentry))
  2358. d_rehash(new_dentry);
  2359. dput(new_dentry);
  2360. }
  2361. if (!error)
  2362. if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
  2363. d_move(old_dentry,new_dentry);
  2364. return error;
  2365. }
  2366. static int vfs_rename_other(struct inode *old_dir, struct dentry *old_dentry,
  2367. struct inode *new_dir, struct dentry *new_dentry)
  2368. {
  2369. struct inode *target;
  2370. int error;
  2371. error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
  2372. if (error)
  2373. return error;
  2374. dget(new_dentry);
  2375. target = new_dentry->d_inode;
  2376. if (target)
  2377. mutex_lock(&target->i_mutex);
  2378. if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
  2379. error = -EBUSY;
  2380. else
  2381. error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
  2382. if (!error) {
  2383. if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
  2384. d_move(old_dentry, new_dentry);
  2385. }
  2386. if (target)
  2387. mutex_unlock(&target->i_mutex);
  2388. dput(new_dentry);
  2389. return error;
  2390. }
  2391. int vfs_rename(struct inode *old_dir, struct dentry *old_dentry,
  2392. struct inode *new_dir, struct dentry *new_dentry)
  2393. {
  2394. int error;
  2395. int is_dir = S_ISDIR(old_dentry->d_inode->i_mode);
  2396. const char *old_name;
  2397. if (old_dentry->d_inode == new_dentry->d_inode)
  2398. return 0;
  2399. error = may_delete(old_dir, old_dentry, is_dir);
  2400. if (error)
  2401. return error;
  2402. if (!new_dentry->d_inode)
  2403. error = may_create(new_dir, new_dentry, NULL);
  2404. else
  2405. error = may_delete(new_dir, new_dentry, is_dir);
  2406. if (error)
  2407. return error;
  2408. if (!old_dir->i_op || !old_dir->i_op->rename)
  2409. return -EPERM;
  2410. DQUOT_INIT(old_dir);
  2411. DQUOT_INIT(new_dir);
  2412. old_name = fsnotify_oldname_init(old_dentry->d_name.name);
  2413. if (is_dir)
  2414. error = vfs_rename_dir(old_dir,old_dentry,new_dir,new_dentry);
  2415. else
  2416. error = vfs_rename_other(old_dir,old_dentry,new_dir,new_dentry);
  2417. if (!error) {
  2418. const char *new_name = old_dentry->d_name.name;
  2419. fsnotify_move(old_dir, new_dir, old_name, new_name, is_dir,
  2420. new_dentry->d_inode, old_dentry);
  2421. }
  2422. fsnotify_oldname_free(old_name);
  2423. return error;
  2424. }
  2425. static int do_rename(int olddfd, const char *oldname,
  2426. int newdfd, const char *newname)
  2427. {
  2428. int error = 0;
  2429. struct dentry * old_dir, * new_dir;
  2430. struct dentry * old_dentry, *new_dentry;
  2431. struct dentry * trap;
  2432. struct nameidata oldnd, newnd;
  2433. error = do_path_lookup(olddfd, oldname, LOOKUP_PARENT, &oldnd);
  2434. if (error)
  2435. goto exit;
  2436. error = do_path_lookup(newdfd, newname, LOOKUP_PARENT, &newnd);
  2437. if (error)
  2438. goto exit1;
  2439. error = -EXDEV;
  2440. if (oldnd.path.mnt != newnd.path.mnt)
  2441. goto exit2;
  2442. old_dir = oldnd.path.dentry;
  2443. error = -EBUSY;
  2444. if (oldnd.last_type != LAST_NORM)
  2445. goto exit2;
  2446. new_dir = newnd.path.dentry;
  2447. if (newnd.last_type != LAST_NORM)
  2448. goto exit2;
  2449. trap = lock_rename(new_dir, old_dir);
  2450. old_dentry = lookup_hash(&oldnd);
  2451. error = PTR_ERR(old_dentry);
  2452. if (IS_ERR(old_dentry))
  2453. goto exit3;
  2454. /* source must exist */
  2455. error = -ENOENT;
  2456. if (!old_dentry->d_inode)
  2457. goto exit4;
  2458. /* unless the source is a directory trailing slashes give -ENOTDIR */
  2459. if (!S_ISDIR(old_dentry->d_inode->i_mode)) {
  2460. error = -ENOTDIR;
  2461. if (oldnd.last.name[oldnd.last.len])
  2462. goto exit4;
  2463. if (newnd.last.name[newnd.last.len])
  2464. goto exit4;
  2465. }
  2466. /* source should not be ancestor of target */
  2467. error = -EINVAL;
  2468. if (old_dentry == trap)
  2469. goto exit4;
  2470. new_dentry = lookup_hash(&newnd);
  2471. error = PTR_ERR(new_dentry);
  2472. if (IS_ERR(new_dentry))
  2473. goto exit4;
  2474. /* target should not be an ancestor of source */
  2475. error = -ENOTEMPTY;
  2476. if (new_dentry == trap)
  2477. goto exit5;
  2478. error = mnt_want_write(oldnd.path.mnt);
  2479. if (error)
  2480. goto exit5;
  2481. error = vfs_rename(old_dir->d_inode, old_dentry,
  2482. new_dir->d_inode, new_dentry);
  2483. mnt_drop_write(oldnd.path.mnt);
  2484. exit5:
  2485. dput(new_dentry);
  2486. exit4:
  2487. dput(old_dentry);
  2488. exit3:
  2489. unlock_rename(new_dir, old_dir);
  2490. exit2:
  2491. path_put(&newnd.path);
  2492. exit1:
  2493. path_put(&oldnd.path);
  2494. exit:
  2495. return error;
  2496. }
  2497. asmlinkage long sys_renameat(int olddfd, const char __user *oldname,
  2498. int newdfd, const char __user *newname)
  2499. {
  2500. int error;
  2501. char * from;
  2502. char * to;
  2503. from = getname(oldname);
  2504. if(IS_ERR(from))
  2505. return PTR_ERR(from);
  2506. to = getname(newname);
  2507. error = PTR_ERR(to);
  2508. if (!IS_ERR(to)) {
  2509. error = do_rename(olddfd, from, newdfd, to);
  2510. putname(to);
  2511. }
  2512. putname(from);
  2513. return error;
  2514. }
  2515. asmlinkage long sys_rename(const char __user *oldname, const char __user *newname)
  2516. {
  2517. return sys_renameat(AT_FDCWD, oldname, AT_FDCWD, newname);
  2518. }
  2519. int vfs_readlink(struct dentry *dentry, char __user *buffer, int buflen, const char *link)
  2520. {
  2521. int len;
  2522. len = PTR_ERR(link);
  2523. if (IS_ERR(link))
  2524. goto out;
  2525. len = strlen(link);
  2526. if (len > (unsigned) buflen)
  2527. len = buflen;
  2528. if (copy_to_user(buffer, link, len))
  2529. len = -EFAULT;
  2530. out:
  2531. return len;
  2532. }
  2533. /*
  2534. * A helper for ->readlink(). This should be used *ONLY* for symlinks that
  2535. * have ->follow_link() touching nd only in nd_set_link(). Using (or not
  2536. * using) it for any given inode is up to filesystem.
  2537. */
  2538. int generic_readlink(struct dentry *dentry, char __user *buffer, int buflen)
  2539. {
  2540. struct nameidata nd;
  2541. void *cookie;
  2542. nd.depth = 0;
  2543. cookie = dentry->d_inode->i_op->follow_link(dentry, &nd);
  2544. if (!IS_ERR(cookie)) {
  2545. int res = vfs_readlink(dentry, buffer, buflen, nd_get_link(&nd));
  2546. if (dentry->d_inode->i_op->put_link)
  2547. dentry->d_inode->i_op->put_link(dentry, &nd, cookie);
  2548. cookie = ERR_PTR(res);
  2549. }
  2550. return PTR_ERR(cookie);
  2551. }
  2552. int vfs_follow_link(struct nameidata *nd, const char *link)
  2553. {
  2554. return __vfs_follow_link(nd, link);
  2555. }
  2556. /* get the link contents into pagecache */
  2557. static char *page_getlink(struct dentry * dentry, struct page **ppage)
  2558. {
  2559. struct page * page;
  2560. struct address_space *mapping = dentry->d_inode->i_mapping;
  2561. page = read_mapping_page(mapping, 0, NULL);
  2562. if (IS_ERR(page))
  2563. return (char*)page;
  2564. *ppage = page;
  2565. return kmap(page);
  2566. }
  2567. int page_readlink(struct dentry *dentry, char __user *buffer, int buflen)
  2568. {
  2569. struct page *page = NULL;
  2570. char *s = page_getlink(dentry, &page);
  2571. int res = vfs_readlink(dentry,buffer,buflen,s);
  2572. if (page) {
  2573. kunmap(page);
  2574. page_cache_release(page);
  2575. }
  2576. return res;
  2577. }
  2578. void *page_follow_link_light(struct dentry *dentry, struct nameidata *nd)
  2579. {
  2580. struct page *page = NULL;
  2581. nd_set_link(nd, page_getlink(dentry, &page));
  2582. return page;
  2583. }
  2584. void page_put_link(struct dentry *dentry, struct nameidata *nd, void *cookie)
  2585. {
  2586. struct page *page = cookie;
  2587. if (page) {
  2588. kunmap(page);
  2589. page_cache_release(page);
  2590. }
  2591. }
  2592. int __page_symlink(struct inode *inode, const char *symname, int len,
  2593. gfp_t gfp_mask)
  2594. {
  2595. struct address_space *mapping = inode->i_mapping;
  2596. struct page *page;
  2597. void *fsdata;
  2598. int err;
  2599. char *kaddr;
  2600. retry:
  2601. err = pagecache_write_begin(NULL, mapping, 0, len-1,
  2602. AOP_FLAG_UNINTERRUPTIBLE, &page, &fsdata);
  2603. if (err)
  2604. goto fail;
  2605. kaddr = kmap_atomic(page, KM_USER0);
  2606. memcpy(kaddr, symname, len-1);
  2607. kunmap_atomic(kaddr, KM_USER0);
  2608. err = pagecache_write_end(NULL, mapping, 0, len-1, len-1,
  2609. page, fsdata);
  2610. if (err < 0)
  2611. goto fail;
  2612. if (err < len-1)
  2613. goto retry;
  2614. mark_inode_dirty(inode);
  2615. return 0;
  2616. fail:
  2617. return err;
  2618. }
  2619. int page_symlink(struct inode *inode, const char *symname, int len)
  2620. {
  2621. return __page_symlink(inode, symname, len,
  2622. mapping_gfp_mask(inode->i_mapping));
  2623. }
  2624. const struct inode_operations page_symlink_inode_operations = {
  2625. .readlink = generic_readlink,
  2626. .follow_link = page_follow_link_light,
  2627. .put_link = page_put_link,
  2628. };
  2629. EXPORT_SYMBOL(__user_walk);
  2630. EXPORT_SYMBOL(__user_walk_fd);
  2631. EXPORT_SYMBOL(follow_down);
  2632. EXPORT_SYMBOL(follow_up);
  2633. EXPORT_SYMBOL(get_write_access); /* binfmt_aout */
  2634. EXPORT_SYMBOL(getname);
  2635. EXPORT_SYMBOL(lock_rename);
  2636. EXPORT_SYMBOL(lookup_one_len);
  2637. EXPORT_SYMBOL(page_follow_link_light);
  2638. EXPORT_SYMBOL(page_put_link);
  2639. EXPORT_SYMBOL(page_readlink);
  2640. EXPORT_SYMBOL(__page_symlink);
  2641. EXPORT_SYMBOL(page_symlink);
  2642. EXPORT_SYMBOL(page_symlink_inode_operations);
  2643. EXPORT_SYMBOL(path_lookup);
  2644. EXPORT_SYMBOL(vfs_path_lookup);
  2645. EXPORT_SYMBOL(permission);
  2646. EXPORT_SYMBOL(vfs_permission);
  2647. EXPORT_SYMBOL(file_permission);
  2648. EXPORT_SYMBOL(unlock_rename);
  2649. EXPORT_SYMBOL(vfs_create);
  2650. EXPORT_SYMBOL(vfs_follow_link);
  2651. EXPORT_SYMBOL(vfs_link);
  2652. EXPORT_SYMBOL(vfs_mkdir);
  2653. EXPORT_SYMBOL(vfs_mknod);
  2654. EXPORT_SYMBOL(generic_permission);
  2655. EXPORT_SYMBOL(vfs_readlink);
  2656. EXPORT_SYMBOL(vfs_rename);
  2657. EXPORT_SYMBOL(vfs_rmdir);
  2658. EXPORT_SYMBOL(vfs_symlink);
  2659. EXPORT_SYMBOL(vfs_unlink);
  2660. EXPORT_SYMBOL(dentry_unhash);
  2661. EXPORT_SYMBOL(generic_readlink);