namei.c 83 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434
  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/pagemap.h>
  20. #include <linux/fsnotify.h>
  21. #include <linux/personality.h>
  22. #include <linux/security.h>
  23. #include <linux/ima.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 <linux/fs_struct.h>
  32. #include <asm/uaccess.h>
  33. #include "internal.h"
  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. /* In order to reduce some races, while at the same time doing additional
  102. * checking and hopefully speeding things up, we copy filenames to the
  103. * kernel data space before using them..
  104. *
  105. * POSIX.1 2.4: an empty pathname is invalid (ENOENT).
  106. * PATH_MAX includes the nul terminator --RR.
  107. */
  108. static int do_getname(const char __user *filename, char *page)
  109. {
  110. int retval;
  111. unsigned long len = PATH_MAX;
  112. if (!segment_eq(get_fs(), KERNEL_DS)) {
  113. if ((unsigned long) filename >= TASK_SIZE)
  114. return -EFAULT;
  115. if (TASK_SIZE - (unsigned long) filename < PATH_MAX)
  116. len = TASK_SIZE - (unsigned long) filename;
  117. }
  118. retval = strncpy_from_user(page, filename, len);
  119. if (retval > 0) {
  120. if (retval < len)
  121. return 0;
  122. return -ENAMETOOLONG;
  123. } else if (!retval)
  124. retval = -ENOENT;
  125. return retval;
  126. }
  127. char * getname(const char __user * filename)
  128. {
  129. char *tmp, *result;
  130. result = ERR_PTR(-ENOMEM);
  131. tmp = __getname();
  132. if (tmp) {
  133. int retval = do_getname(filename, tmp);
  134. result = tmp;
  135. if (retval < 0) {
  136. __putname(tmp);
  137. result = ERR_PTR(retval);
  138. }
  139. }
  140. audit_getname(result);
  141. return result;
  142. }
  143. #ifdef CONFIG_AUDITSYSCALL
  144. void putname(const char *name)
  145. {
  146. if (unlikely(!audit_dummy_context()))
  147. audit_putname(name);
  148. else
  149. __putname(name);
  150. }
  151. EXPORT_SYMBOL(putname);
  152. #endif
  153. /*
  154. * This does basic POSIX ACL permission checking
  155. */
  156. static int acl_permission_check(struct inode *inode, int mask, unsigned int flags,
  157. int (*check_acl)(struct inode *inode, int mask, unsigned int flags))
  158. {
  159. umode_t mode = inode->i_mode;
  160. mask &= MAY_READ | MAY_WRITE | MAY_EXEC;
  161. if (current_fsuid() == inode->i_uid)
  162. mode >>= 6;
  163. else {
  164. if (IS_POSIXACL(inode) && (mode & S_IRWXG) && check_acl) {
  165. int error = check_acl(inode, mask, flags);
  166. if (error != -EAGAIN)
  167. return error;
  168. }
  169. if (in_group_p(inode->i_gid))
  170. mode >>= 3;
  171. }
  172. /*
  173. * If the DACs are ok we don't need any capability check.
  174. */
  175. if ((mask & ~mode) == 0)
  176. return 0;
  177. return -EACCES;
  178. }
  179. /**
  180. * generic_permission - check for access rights on a Posix-like filesystem
  181. * @inode: inode to check access rights for
  182. * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
  183. * @check_acl: optional callback to check for Posix ACLs
  184. * @flags IPERM_FLAG_ flags.
  185. *
  186. * Used to check for read/write/execute permissions on a file.
  187. * We use "fsuid" for this, letting us set arbitrary permissions
  188. * for filesystem access without changing the "normal" uids which
  189. * are used for other things.
  190. *
  191. * generic_permission is rcu-walk aware. It returns -ECHILD in case an rcu-walk
  192. * request cannot be satisfied (eg. requires blocking or too much complexity).
  193. * It would then be called again in ref-walk mode.
  194. */
  195. int generic_permission(struct inode *inode, int mask, unsigned int flags,
  196. int (*check_acl)(struct inode *inode, int mask, unsigned int flags))
  197. {
  198. int ret;
  199. /*
  200. * Do the basic POSIX ACL permission checks.
  201. */
  202. ret = acl_permission_check(inode, mask, flags, check_acl);
  203. if (ret != -EACCES)
  204. return ret;
  205. /*
  206. * Read/write DACs are always overridable.
  207. * Executable DACs are overridable if at least one exec bit is set.
  208. */
  209. if (!(mask & MAY_EXEC) || execute_ok(inode))
  210. if (capable(CAP_DAC_OVERRIDE))
  211. return 0;
  212. /*
  213. * Searching includes executable on directories, else just read.
  214. */
  215. mask &= MAY_READ | MAY_WRITE | MAY_EXEC;
  216. if (mask == MAY_READ || (S_ISDIR(inode->i_mode) && !(mask & MAY_WRITE)))
  217. if (capable(CAP_DAC_READ_SEARCH))
  218. return 0;
  219. return -EACCES;
  220. }
  221. /**
  222. * inode_permission - check for access rights to a given inode
  223. * @inode: inode to check permission on
  224. * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
  225. *
  226. * Used to check for read/write/execute permissions on an inode.
  227. * We use "fsuid" for this, letting us set arbitrary permissions
  228. * for filesystem access without changing the "normal" uids which
  229. * are used for other things.
  230. */
  231. int inode_permission(struct inode *inode, int mask)
  232. {
  233. int retval;
  234. if (mask & MAY_WRITE) {
  235. umode_t mode = inode->i_mode;
  236. /*
  237. * Nobody gets write access to a read-only fs.
  238. */
  239. if (IS_RDONLY(inode) &&
  240. (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode)))
  241. return -EROFS;
  242. /*
  243. * Nobody gets write access to an immutable file.
  244. */
  245. if (IS_IMMUTABLE(inode))
  246. return -EACCES;
  247. }
  248. if (inode->i_op->permission)
  249. retval = inode->i_op->permission(inode, mask, 0);
  250. else
  251. retval = generic_permission(inode, mask, 0,
  252. inode->i_op->check_acl);
  253. if (retval)
  254. return retval;
  255. retval = devcgroup_inode_permission(inode, mask);
  256. if (retval)
  257. return retval;
  258. return security_inode_permission(inode, mask);
  259. }
  260. /**
  261. * file_permission - check for additional access rights to a given file
  262. * @file: file to check access rights for
  263. * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
  264. *
  265. * Used to check for read/write/execute permissions on an already opened
  266. * file.
  267. *
  268. * Note:
  269. * Do not use this function in new code. All access checks should
  270. * be done using inode_permission().
  271. */
  272. int file_permission(struct file *file, int mask)
  273. {
  274. return inode_permission(file->f_path.dentry->d_inode, mask);
  275. }
  276. /*
  277. * get_write_access() gets write permission for a file.
  278. * put_write_access() releases this write permission.
  279. * This is used for regular files.
  280. * We cannot support write (and maybe mmap read-write shared) accesses and
  281. * MAP_DENYWRITE mmappings simultaneously. The i_writecount field of an inode
  282. * can have the following values:
  283. * 0: no writers, no VM_DENYWRITE mappings
  284. * < 0: (-i_writecount) vm_area_structs with VM_DENYWRITE set exist
  285. * > 0: (i_writecount) users are writing to the file.
  286. *
  287. * Normally we operate on that counter with atomic_{inc,dec} and it's safe
  288. * except for the cases where we don't hold i_writecount yet. Then we need to
  289. * use {get,deny}_write_access() - these functions check the sign and refuse
  290. * to do the change if sign is wrong. Exclusion between them is provided by
  291. * the inode->i_lock spinlock.
  292. */
  293. int get_write_access(struct inode * inode)
  294. {
  295. spin_lock(&inode->i_lock);
  296. if (atomic_read(&inode->i_writecount) < 0) {
  297. spin_unlock(&inode->i_lock);
  298. return -ETXTBSY;
  299. }
  300. atomic_inc(&inode->i_writecount);
  301. spin_unlock(&inode->i_lock);
  302. return 0;
  303. }
  304. int deny_write_access(struct file * file)
  305. {
  306. struct inode *inode = file->f_path.dentry->d_inode;
  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_dec(&inode->i_writecount);
  313. spin_unlock(&inode->i_lock);
  314. return 0;
  315. }
  316. /**
  317. * path_get - get a reference to a path
  318. * @path: path to get the reference to
  319. *
  320. * Given a path increment the reference count to the dentry and the vfsmount.
  321. */
  322. void path_get(struct path *path)
  323. {
  324. mntget(path->mnt);
  325. dget(path->dentry);
  326. }
  327. EXPORT_SYMBOL(path_get);
  328. /**
  329. * path_get_long - get a long 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_long(struct path *path)
  335. {
  336. mntget_long(path->mnt);
  337. dget(path->dentry);
  338. }
  339. /**
  340. * path_put - put a reference to a path
  341. * @path: path to put the reference to
  342. *
  343. * Given a path decrement the reference count to the dentry and the vfsmount.
  344. */
  345. void path_put(struct path *path)
  346. {
  347. dput(path->dentry);
  348. mntput(path->mnt);
  349. }
  350. EXPORT_SYMBOL(path_put);
  351. /**
  352. * path_put_long - put a long reference to a path
  353. * @path: path to put the reference to
  354. *
  355. * Given a path decrement the reference count to the dentry and the vfsmount.
  356. */
  357. void path_put_long(struct path *path)
  358. {
  359. dput(path->dentry);
  360. mntput_long(path->mnt);
  361. }
  362. /**
  363. * nameidata_drop_rcu - drop this nameidata out of rcu-walk
  364. * @nd: nameidata pathwalk data to drop
  365. * @Returns: 0 on success, -ECHLID on failure
  366. *
  367. * Path walking has 2 modes, rcu-walk and ref-walk (see
  368. * Documentation/filesystems/path-lookup.txt). __drop_rcu* functions attempt
  369. * to drop out of rcu-walk mode and take normal reference counts on dentries
  370. * and vfsmounts to transition to rcu-walk mode. __drop_rcu* functions take
  371. * refcounts at the last known good point before rcu-walk got stuck, so
  372. * ref-walk may continue from there. If this is not successful (eg. a seqcount
  373. * has changed), then failure is returned and path walk restarts from the
  374. * beginning in ref-walk mode.
  375. *
  376. * nameidata_drop_rcu attempts to drop the current nd->path and nd->root into
  377. * ref-walk. Must be called from rcu-walk context.
  378. */
  379. static int nameidata_drop_rcu(struct nameidata *nd)
  380. {
  381. struct fs_struct *fs = current->fs;
  382. struct dentry *dentry = nd->path.dentry;
  383. BUG_ON(!(nd->flags & LOOKUP_RCU));
  384. if (nd->root.mnt) {
  385. spin_lock(&fs->lock);
  386. if (nd->root.mnt != fs->root.mnt ||
  387. nd->root.dentry != fs->root.dentry)
  388. goto err_root;
  389. }
  390. spin_lock(&dentry->d_lock);
  391. if (!__d_rcu_to_refcount(dentry, nd->seq))
  392. goto err;
  393. BUG_ON(nd->inode != dentry->d_inode);
  394. spin_unlock(&dentry->d_lock);
  395. if (nd->root.mnt) {
  396. path_get(&nd->root);
  397. spin_unlock(&fs->lock);
  398. }
  399. mntget(nd->path.mnt);
  400. rcu_read_unlock();
  401. br_read_unlock(vfsmount_lock);
  402. nd->flags &= ~LOOKUP_RCU;
  403. return 0;
  404. err:
  405. spin_unlock(&dentry->d_lock);
  406. err_root:
  407. if (nd->root.mnt)
  408. spin_unlock(&fs->lock);
  409. return -ECHILD;
  410. }
  411. /* Try to drop out of rcu-walk mode if we were in it, otherwise do nothing. */
  412. static inline int nameidata_drop_rcu_maybe(struct nameidata *nd)
  413. {
  414. if (nd->flags & LOOKUP_RCU)
  415. return nameidata_drop_rcu(nd);
  416. return 0;
  417. }
  418. /**
  419. * nameidata_dentry_drop_rcu - drop nameidata and dentry out of rcu-walk
  420. * @nd: nameidata pathwalk data to drop
  421. * @dentry: dentry to drop
  422. * @Returns: 0 on success, -ECHLID on failure
  423. *
  424. * nameidata_dentry_drop_rcu attempts to drop the current nd->path and nd->root,
  425. * and dentry into ref-walk. @dentry must be a path found by a do_lookup call on
  426. * @nd. Must be called from rcu-walk context.
  427. */
  428. static int nameidata_dentry_drop_rcu(struct nameidata *nd, struct dentry *dentry)
  429. {
  430. struct fs_struct *fs = current->fs;
  431. struct dentry *parent = nd->path.dentry;
  432. BUG_ON(!(nd->flags & LOOKUP_RCU));
  433. if (nd->root.mnt) {
  434. spin_lock(&fs->lock);
  435. if (nd->root.mnt != fs->root.mnt ||
  436. nd->root.dentry != fs->root.dentry)
  437. goto err_root;
  438. }
  439. spin_lock(&parent->d_lock);
  440. spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
  441. if (!__d_rcu_to_refcount(dentry, nd->seq))
  442. goto err;
  443. /*
  444. * If the sequence check on the child dentry passed, then the child has
  445. * not been removed from its parent. This means the parent dentry must
  446. * be valid and able to take a reference at this point.
  447. */
  448. BUG_ON(!IS_ROOT(dentry) && dentry->d_parent != parent);
  449. BUG_ON(!parent->d_count);
  450. parent->d_count++;
  451. spin_unlock(&dentry->d_lock);
  452. spin_unlock(&parent->d_lock);
  453. if (nd->root.mnt) {
  454. path_get(&nd->root);
  455. spin_unlock(&fs->lock);
  456. }
  457. mntget(nd->path.mnt);
  458. rcu_read_unlock();
  459. br_read_unlock(vfsmount_lock);
  460. nd->flags &= ~LOOKUP_RCU;
  461. return 0;
  462. err:
  463. spin_unlock(&dentry->d_lock);
  464. spin_unlock(&parent->d_lock);
  465. err_root:
  466. if (nd->root.mnt)
  467. spin_unlock(&fs->lock);
  468. return -ECHILD;
  469. }
  470. /* Try to drop out of rcu-walk mode if we were in it, otherwise do nothing. */
  471. static inline int nameidata_dentry_drop_rcu_maybe(struct nameidata *nd, struct dentry *dentry)
  472. {
  473. if (nd->flags & LOOKUP_RCU)
  474. return nameidata_dentry_drop_rcu(nd, dentry);
  475. return 0;
  476. }
  477. /**
  478. * nameidata_drop_rcu_last - drop nameidata ending path walk out of rcu-walk
  479. * @nd: nameidata pathwalk data to drop
  480. * @Returns: 0 on success, -ECHLID on failure
  481. *
  482. * nameidata_drop_rcu_last attempts to drop the current nd->path into ref-walk.
  483. * nd->path should be the final element of the lookup, so nd->root is discarded.
  484. * Must be called from rcu-walk context.
  485. */
  486. static int nameidata_drop_rcu_last(struct nameidata *nd)
  487. {
  488. struct dentry *dentry = nd->path.dentry;
  489. BUG_ON(!(nd->flags & LOOKUP_RCU));
  490. nd->flags &= ~LOOKUP_RCU;
  491. nd->root.mnt = NULL;
  492. spin_lock(&dentry->d_lock);
  493. if (!__d_rcu_to_refcount(dentry, nd->seq))
  494. goto err_unlock;
  495. BUG_ON(nd->inode != dentry->d_inode);
  496. spin_unlock(&dentry->d_lock);
  497. mntget(nd->path.mnt);
  498. rcu_read_unlock();
  499. br_read_unlock(vfsmount_lock);
  500. return 0;
  501. err_unlock:
  502. spin_unlock(&dentry->d_lock);
  503. rcu_read_unlock();
  504. br_read_unlock(vfsmount_lock);
  505. return -ECHILD;
  506. }
  507. /* Try to drop out of rcu-walk mode if we were in it, otherwise do nothing. */
  508. static inline int nameidata_drop_rcu_last_maybe(struct nameidata *nd)
  509. {
  510. if (likely(nd->flags & LOOKUP_RCU))
  511. return nameidata_drop_rcu_last(nd);
  512. return 0;
  513. }
  514. /**
  515. * release_open_intent - free up open intent resources
  516. * @nd: pointer to nameidata
  517. */
  518. void release_open_intent(struct nameidata *nd)
  519. {
  520. if (nd->intent.open.file->f_path.dentry == NULL)
  521. put_filp(nd->intent.open.file);
  522. else
  523. fput(nd->intent.open.file);
  524. }
  525. /*
  526. * Call d_revalidate and handle filesystems that request rcu-walk
  527. * to be dropped. This may be called and return in rcu-walk mode,
  528. * regardless of success or error. If -ECHILD is returned, the caller
  529. * must return -ECHILD back up the path walk stack so path walk may
  530. * be restarted in ref-walk mode.
  531. */
  532. static int d_revalidate(struct dentry *dentry, struct nameidata *nd)
  533. {
  534. int status;
  535. status = dentry->d_op->d_revalidate(dentry, nd);
  536. if (status == -ECHILD) {
  537. if (nameidata_dentry_drop_rcu(nd, dentry))
  538. return status;
  539. status = dentry->d_op->d_revalidate(dentry, nd);
  540. }
  541. return status;
  542. }
  543. static inline struct dentry *
  544. do_revalidate(struct dentry *dentry, struct nameidata *nd)
  545. {
  546. int status;
  547. status = d_revalidate(dentry, nd);
  548. if (unlikely(status <= 0)) {
  549. /*
  550. * The dentry failed validation.
  551. * If d_revalidate returned 0 attempt to invalidate
  552. * the dentry otherwise d_revalidate is asking us
  553. * to return a fail status.
  554. */
  555. if (status < 0) {
  556. /* If we're in rcu-walk, we don't have a ref */
  557. if (!(nd->flags & LOOKUP_RCU))
  558. dput(dentry);
  559. dentry = ERR_PTR(status);
  560. } else {
  561. /* Don't d_invalidate in rcu-walk mode */
  562. if (nameidata_dentry_drop_rcu_maybe(nd, dentry))
  563. return ERR_PTR(-ECHILD);
  564. if (!d_invalidate(dentry)) {
  565. dput(dentry);
  566. dentry = NULL;
  567. }
  568. }
  569. }
  570. return dentry;
  571. }
  572. static inline int need_reval_dot(struct dentry *dentry)
  573. {
  574. if (likely(!(dentry->d_flags & DCACHE_OP_REVALIDATE)))
  575. return 0;
  576. if (likely(!(dentry->d_sb->s_type->fs_flags & FS_REVAL_DOT)))
  577. return 0;
  578. return 1;
  579. }
  580. /*
  581. * force_reval_path - force revalidation of a dentry
  582. *
  583. * In some situations the path walking code will trust dentries without
  584. * revalidating them. This causes problems for filesystems that depend on
  585. * d_revalidate to handle file opens (e.g. NFSv4). When FS_REVAL_DOT is set
  586. * (which indicates that it's possible for the dentry to go stale), force
  587. * a d_revalidate call before proceeding.
  588. *
  589. * Returns 0 if the revalidation was successful. If the revalidation fails,
  590. * either return the error returned by d_revalidate or -ESTALE if the
  591. * revalidation it just returned 0. If d_revalidate returns 0, we attempt to
  592. * invalidate the dentry. It's up to the caller to handle putting references
  593. * to the path if necessary.
  594. */
  595. static int
  596. force_reval_path(struct path *path, struct nameidata *nd)
  597. {
  598. int status;
  599. struct dentry *dentry = path->dentry;
  600. /*
  601. * only check on filesystems where it's possible for the dentry to
  602. * become stale.
  603. */
  604. if (!need_reval_dot(dentry))
  605. return 0;
  606. status = d_revalidate(dentry, nd);
  607. if (status > 0)
  608. return 0;
  609. if (!status) {
  610. /* Don't d_invalidate in rcu-walk mode */
  611. if (nameidata_drop_rcu(nd))
  612. return -ECHILD;
  613. d_invalidate(dentry);
  614. status = -ESTALE;
  615. }
  616. return status;
  617. }
  618. /*
  619. * Short-cut version of permission(), for calling on directories
  620. * during pathname resolution. Combines parts of permission()
  621. * and generic_permission(), and tests ONLY for MAY_EXEC permission.
  622. *
  623. * If appropriate, check DAC only. If not appropriate, or
  624. * short-cut DAC fails, then call ->permission() to do more
  625. * complete permission check.
  626. */
  627. static inline int exec_permission(struct inode *inode, unsigned int flags)
  628. {
  629. int ret;
  630. if (inode->i_op->permission) {
  631. ret = inode->i_op->permission(inode, MAY_EXEC, flags);
  632. } else {
  633. ret = acl_permission_check(inode, MAY_EXEC, flags,
  634. inode->i_op->check_acl);
  635. }
  636. if (likely(!ret))
  637. goto ok;
  638. if (ret == -ECHILD)
  639. return ret;
  640. if (capable(CAP_DAC_OVERRIDE) || capable(CAP_DAC_READ_SEARCH))
  641. goto ok;
  642. return ret;
  643. ok:
  644. return security_inode_exec_permission(inode, flags);
  645. }
  646. static __always_inline void set_root(struct nameidata *nd)
  647. {
  648. if (!nd->root.mnt)
  649. get_fs_root(current->fs, &nd->root);
  650. }
  651. static int link_path_walk(const char *, struct nameidata *);
  652. static __always_inline void set_root_rcu(struct nameidata *nd)
  653. {
  654. if (!nd->root.mnt) {
  655. struct fs_struct *fs = current->fs;
  656. unsigned seq;
  657. do {
  658. seq = read_seqcount_begin(&fs->seq);
  659. nd->root = fs->root;
  660. } while (read_seqcount_retry(&fs->seq, seq));
  661. }
  662. }
  663. static __always_inline int __vfs_follow_link(struct nameidata *nd, const char *link)
  664. {
  665. int ret;
  666. if (IS_ERR(link))
  667. goto fail;
  668. if (*link == '/') {
  669. set_root(nd);
  670. path_put(&nd->path);
  671. nd->path = nd->root;
  672. path_get(&nd->root);
  673. }
  674. nd->inode = nd->path.dentry->d_inode;
  675. ret = link_path_walk(link, nd);
  676. return ret;
  677. fail:
  678. path_put(&nd->path);
  679. return PTR_ERR(link);
  680. }
  681. static void path_put_conditional(struct path *path, struct nameidata *nd)
  682. {
  683. dput(path->dentry);
  684. if (path->mnt != nd->path.mnt)
  685. mntput(path->mnt);
  686. }
  687. static inline void path_to_nameidata(struct path *path, struct nameidata *nd)
  688. {
  689. if (!(nd->flags & LOOKUP_RCU)) {
  690. dput(nd->path.dentry);
  691. if (nd->path.mnt != path->mnt)
  692. mntput(nd->path.mnt);
  693. }
  694. nd->path.mnt = path->mnt;
  695. nd->path.dentry = path->dentry;
  696. }
  697. static __always_inline int
  698. __do_follow_link(struct path *path, struct nameidata *nd, void **p)
  699. {
  700. int error;
  701. struct dentry *dentry = path->dentry;
  702. touch_atime(path->mnt, dentry);
  703. nd_set_link(nd, NULL);
  704. if (path->mnt != nd->path.mnt) {
  705. path_to_nameidata(path, nd);
  706. nd->inode = nd->path.dentry->d_inode;
  707. dget(dentry);
  708. }
  709. mntget(path->mnt);
  710. nd->last_type = LAST_BIND;
  711. *p = dentry->d_inode->i_op->follow_link(dentry, nd);
  712. error = PTR_ERR(*p);
  713. if (!IS_ERR(*p)) {
  714. char *s = nd_get_link(nd);
  715. error = 0;
  716. if (s)
  717. error = __vfs_follow_link(nd, s);
  718. else if (nd->last_type == LAST_BIND) {
  719. error = force_reval_path(&nd->path, nd);
  720. if (error)
  721. path_put(&nd->path);
  722. }
  723. }
  724. return error;
  725. }
  726. /*
  727. * This limits recursive symlink follows to 8, while
  728. * limiting consecutive symlinks to 40.
  729. *
  730. * Without that kind of total limit, nasty chains of consecutive
  731. * symlinks can cause almost arbitrarily long lookups.
  732. */
  733. static inline int do_follow_link(struct path *path, struct nameidata *nd)
  734. {
  735. void *cookie;
  736. int err = -ELOOP;
  737. if (current->link_count >= MAX_NESTED_LINKS)
  738. goto loop;
  739. if (current->total_link_count >= 40)
  740. goto loop;
  741. BUG_ON(nd->depth >= MAX_NESTED_LINKS);
  742. cond_resched();
  743. err = security_inode_follow_link(path->dentry, nd);
  744. if (err)
  745. goto loop;
  746. current->link_count++;
  747. current->total_link_count++;
  748. nd->depth++;
  749. err = __do_follow_link(path, nd, &cookie);
  750. if (!IS_ERR(cookie) && path->dentry->d_inode->i_op->put_link)
  751. path->dentry->d_inode->i_op->put_link(path->dentry, nd, cookie);
  752. path_put(path);
  753. current->link_count--;
  754. nd->depth--;
  755. return err;
  756. loop:
  757. path_put_conditional(path, nd);
  758. path_put(&nd->path);
  759. return err;
  760. }
  761. static int follow_up_rcu(struct path *path)
  762. {
  763. struct vfsmount *parent;
  764. struct dentry *mountpoint;
  765. parent = path->mnt->mnt_parent;
  766. if (parent == path->mnt)
  767. return 0;
  768. mountpoint = path->mnt->mnt_mountpoint;
  769. path->dentry = mountpoint;
  770. path->mnt = parent;
  771. return 1;
  772. }
  773. int follow_up(struct path *path)
  774. {
  775. struct vfsmount *parent;
  776. struct dentry *mountpoint;
  777. br_read_lock(vfsmount_lock);
  778. parent = path->mnt->mnt_parent;
  779. if (parent == path->mnt) {
  780. br_read_unlock(vfsmount_lock);
  781. return 0;
  782. }
  783. mntget(parent);
  784. mountpoint = dget(path->mnt->mnt_mountpoint);
  785. br_read_unlock(vfsmount_lock);
  786. dput(path->dentry);
  787. path->dentry = mountpoint;
  788. mntput(path->mnt);
  789. path->mnt = parent;
  790. return 1;
  791. }
  792. /*
  793. * serialization is taken care of in namespace.c
  794. */
  795. static void __follow_mount_rcu(struct nameidata *nd, struct path *path,
  796. struct inode **inode)
  797. {
  798. while (d_mountpoint(path->dentry)) {
  799. struct vfsmount *mounted;
  800. mounted = __lookup_mnt(path->mnt, path->dentry, 1);
  801. if (!mounted)
  802. return;
  803. path->mnt = mounted;
  804. path->dentry = mounted->mnt_root;
  805. nd->seq = read_seqcount_begin(&path->dentry->d_seq);
  806. *inode = path->dentry->d_inode;
  807. }
  808. }
  809. static int __follow_mount(struct path *path)
  810. {
  811. int res = 0;
  812. while (d_mountpoint(path->dentry)) {
  813. struct vfsmount *mounted = lookup_mnt(path);
  814. if (!mounted)
  815. break;
  816. dput(path->dentry);
  817. if (res)
  818. mntput(path->mnt);
  819. path->mnt = mounted;
  820. path->dentry = dget(mounted->mnt_root);
  821. res = 1;
  822. }
  823. return res;
  824. }
  825. static void follow_mount(struct path *path)
  826. {
  827. while (d_mountpoint(path->dentry)) {
  828. struct vfsmount *mounted = lookup_mnt(path);
  829. if (!mounted)
  830. break;
  831. dput(path->dentry);
  832. mntput(path->mnt);
  833. path->mnt = mounted;
  834. path->dentry = dget(mounted->mnt_root);
  835. }
  836. }
  837. int follow_down(struct path *path)
  838. {
  839. struct vfsmount *mounted;
  840. mounted = lookup_mnt(path);
  841. if (mounted) {
  842. dput(path->dentry);
  843. mntput(path->mnt);
  844. path->mnt = mounted;
  845. path->dentry = dget(mounted->mnt_root);
  846. return 1;
  847. }
  848. return 0;
  849. }
  850. static int follow_dotdot_rcu(struct nameidata *nd)
  851. {
  852. struct inode *inode = nd->inode;
  853. set_root_rcu(nd);
  854. while(1) {
  855. if (nd->path.dentry == nd->root.dentry &&
  856. nd->path.mnt == nd->root.mnt) {
  857. break;
  858. }
  859. if (nd->path.dentry != nd->path.mnt->mnt_root) {
  860. struct dentry *old = nd->path.dentry;
  861. struct dentry *parent = old->d_parent;
  862. unsigned seq;
  863. seq = read_seqcount_begin(&parent->d_seq);
  864. if (read_seqcount_retry(&old->d_seq, nd->seq))
  865. return -ECHILD;
  866. inode = parent->d_inode;
  867. nd->path.dentry = parent;
  868. nd->seq = seq;
  869. break;
  870. }
  871. if (!follow_up_rcu(&nd->path))
  872. break;
  873. nd->seq = read_seqcount_begin(&nd->path.dentry->d_seq);
  874. inode = nd->path.dentry->d_inode;
  875. }
  876. __follow_mount_rcu(nd, &nd->path, &inode);
  877. nd->inode = inode;
  878. return 0;
  879. }
  880. static void follow_dotdot(struct nameidata *nd)
  881. {
  882. set_root(nd);
  883. while(1) {
  884. struct dentry *old = nd->path.dentry;
  885. if (nd->path.dentry == nd->root.dentry &&
  886. nd->path.mnt == nd->root.mnt) {
  887. break;
  888. }
  889. if (nd->path.dentry != nd->path.mnt->mnt_root) {
  890. /* rare case of legitimate dget_parent()... */
  891. nd->path.dentry = dget_parent(nd->path.dentry);
  892. dput(old);
  893. break;
  894. }
  895. if (!follow_up(&nd->path))
  896. break;
  897. }
  898. follow_mount(&nd->path);
  899. nd->inode = nd->path.dentry->d_inode;
  900. }
  901. /*
  902. * Allocate a dentry with name and parent, and perform a parent
  903. * directory ->lookup on it. Returns the new dentry, or ERR_PTR
  904. * on error. parent->d_inode->i_mutex must be held. d_lookup must
  905. * have verified that no child exists while under i_mutex.
  906. */
  907. static struct dentry *d_alloc_and_lookup(struct dentry *parent,
  908. struct qstr *name, struct nameidata *nd)
  909. {
  910. struct inode *inode = parent->d_inode;
  911. struct dentry *dentry;
  912. struct dentry *old;
  913. /* Don't create child dentry for a dead directory. */
  914. if (unlikely(IS_DEADDIR(inode)))
  915. return ERR_PTR(-ENOENT);
  916. dentry = d_alloc(parent, name);
  917. if (unlikely(!dentry))
  918. return ERR_PTR(-ENOMEM);
  919. old = inode->i_op->lookup(inode, dentry, nd);
  920. if (unlikely(old)) {
  921. dput(dentry);
  922. dentry = old;
  923. }
  924. return dentry;
  925. }
  926. /*
  927. * It's more convoluted than I'd like it to be, but... it's still fairly
  928. * small and for now I'd prefer to have fast path as straight as possible.
  929. * It _is_ time-critical.
  930. */
  931. static int do_lookup(struct nameidata *nd, struct qstr *name,
  932. struct path *path, struct inode **inode)
  933. {
  934. struct vfsmount *mnt = nd->path.mnt;
  935. struct dentry *dentry, *parent = nd->path.dentry;
  936. struct inode *dir;
  937. /*
  938. * See if the low-level filesystem might want
  939. * to use its own hash..
  940. */
  941. if (unlikely(parent->d_flags & DCACHE_OP_HASH)) {
  942. int err = parent->d_op->d_hash(parent, nd->inode, name);
  943. if (err < 0)
  944. return err;
  945. }
  946. /*
  947. * Rename seqlock is not required here because in the off chance
  948. * of a false negative due to a concurrent rename, we're going to
  949. * do the non-racy lookup, below.
  950. */
  951. if (nd->flags & LOOKUP_RCU) {
  952. unsigned seq;
  953. *inode = nd->inode;
  954. dentry = __d_lookup_rcu(parent, name, &seq, inode);
  955. if (!dentry) {
  956. if (nameidata_drop_rcu(nd))
  957. return -ECHILD;
  958. goto need_lookup;
  959. }
  960. /* Memory barrier in read_seqcount_begin of child is enough */
  961. if (__read_seqcount_retry(&parent->d_seq, nd->seq))
  962. return -ECHILD;
  963. nd->seq = seq;
  964. if (dentry->d_flags & DCACHE_OP_REVALIDATE)
  965. goto need_revalidate;
  966. path->mnt = mnt;
  967. path->dentry = dentry;
  968. __follow_mount_rcu(nd, path, inode);
  969. } else {
  970. dentry = __d_lookup(parent, name);
  971. if (!dentry)
  972. goto need_lookup;
  973. found:
  974. if (dentry->d_flags & DCACHE_OP_REVALIDATE)
  975. goto need_revalidate;
  976. done:
  977. path->mnt = mnt;
  978. path->dentry = dentry;
  979. __follow_mount(path);
  980. *inode = path->dentry->d_inode;
  981. }
  982. return 0;
  983. need_lookup:
  984. dir = parent->d_inode;
  985. BUG_ON(nd->inode != dir);
  986. mutex_lock(&dir->i_mutex);
  987. /*
  988. * First re-do the cached lookup just in case it was created
  989. * while we waited for the directory semaphore, or the first
  990. * lookup failed due to an unrelated rename.
  991. *
  992. * This could use version numbering or similar to avoid unnecessary
  993. * cache lookups, but then we'd have to do the first lookup in the
  994. * non-racy way. However in the common case here, everything should
  995. * be hot in cache, so would it be a big win?
  996. */
  997. dentry = d_lookup(parent, name);
  998. if (likely(!dentry)) {
  999. dentry = d_alloc_and_lookup(parent, name, nd);
  1000. mutex_unlock(&dir->i_mutex);
  1001. if (IS_ERR(dentry))
  1002. goto fail;
  1003. goto done;
  1004. }
  1005. /*
  1006. * Uhhuh! Nasty case: the cache was re-populated while
  1007. * we waited on the semaphore. Need to revalidate.
  1008. */
  1009. mutex_unlock(&dir->i_mutex);
  1010. goto found;
  1011. need_revalidate:
  1012. dentry = do_revalidate(dentry, nd);
  1013. if (!dentry)
  1014. goto need_lookup;
  1015. if (IS_ERR(dentry))
  1016. goto fail;
  1017. goto done;
  1018. fail:
  1019. return PTR_ERR(dentry);
  1020. }
  1021. /*
  1022. * This is a temporary kludge to deal with "automount" symlinks; proper
  1023. * solution is to trigger them on follow_mount(), so that do_lookup()
  1024. * would DTRT. To be killed before 2.6.34-final.
  1025. */
  1026. static inline int follow_on_final(struct inode *inode, unsigned lookup_flags)
  1027. {
  1028. return inode && unlikely(inode->i_op->follow_link) &&
  1029. ((lookup_flags & LOOKUP_FOLLOW) || S_ISDIR(inode->i_mode));
  1030. }
  1031. /*
  1032. * Name resolution.
  1033. * This is the basic name resolution function, turning a pathname into
  1034. * the final dentry. We expect 'base' to be positive and a directory.
  1035. *
  1036. * Returns 0 and nd will have valid dentry and mnt on success.
  1037. * Returns error and drops reference to input namei data on failure.
  1038. */
  1039. static int link_path_walk(const char *name, struct nameidata *nd)
  1040. {
  1041. struct path next;
  1042. int err;
  1043. unsigned int lookup_flags = nd->flags;
  1044. while (*name=='/')
  1045. name++;
  1046. if (!*name)
  1047. goto return_reval;
  1048. if (nd->depth)
  1049. lookup_flags = LOOKUP_FOLLOW | (nd->flags & LOOKUP_CONTINUE);
  1050. /* At this point we know we have a real path component. */
  1051. for(;;) {
  1052. struct inode *inode;
  1053. unsigned long hash;
  1054. struct qstr this;
  1055. unsigned int c;
  1056. nd->flags |= LOOKUP_CONTINUE;
  1057. if (nd->flags & LOOKUP_RCU) {
  1058. err = exec_permission(nd->inode, IPERM_FLAG_RCU);
  1059. if (err == -ECHILD) {
  1060. if (nameidata_drop_rcu(nd))
  1061. return -ECHILD;
  1062. goto exec_again;
  1063. }
  1064. } else {
  1065. exec_again:
  1066. err = exec_permission(nd->inode, 0);
  1067. }
  1068. if (err)
  1069. break;
  1070. this.name = name;
  1071. c = *(const unsigned char *)name;
  1072. hash = init_name_hash();
  1073. do {
  1074. name++;
  1075. hash = partial_name_hash(c, hash);
  1076. c = *(const unsigned char *)name;
  1077. } while (c && (c != '/'));
  1078. this.len = name - (const char *) this.name;
  1079. this.hash = end_name_hash(hash);
  1080. /* remove trailing slashes? */
  1081. if (!c)
  1082. goto last_component;
  1083. while (*++name == '/');
  1084. if (!*name)
  1085. goto last_with_slashes;
  1086. /*
  1087. * "." and ".." are special - ".." especially so because it has
  1088. * to be able to know about the current root directory and
  1089. * parent relationships.
  1090. */
  1091. if (this.name[0] == '.') switch (this.len) {
  1092. default:
  1093. break;
  1094. case 2:
  1095. if (this.name[1] != '.')
  1096. break;
  1097. if (nd->flags & LOOKUP_RCU) {
  1098. if (follow_dotdot_rcu(nd))
  1099. return -ECHILD;
  1100. } else
  1101. follow_dotdot(nd);
  1102. /* fallthrough */
  1103. case 1:
  1104. continue;
  1105. }
  1106. /* This does the actual lookups.. */
  1107. err = do_lookup(nd, &this, &next, &inode);
  1108. if (err)
  1109. break;
  1110. err = -ENOENT;
  1111. if (!inode)
  1112. goto out_dput;
  1113. if (inode->i_op->follow_link) {
  1114. /* We commonly drop rcu-walk here */
  1115. if (nameidata_dentry_drop_rcu_maybe(nd, next.dentry))
  1116. return -ECHILD;
  1117. BUG_ON(inode != next.dentry->d_inode);
  1118. err = do_follow_link(&next, nd);
  1119. if (err)
  1120. goto return_err;
  1121. nd->inode = nd->path.dentry->d_inode;
  1122. err = -ENOENT;
  1123. if (!nd->inode)
  1124. break;
  1125. } else {
  1126. path_to_nameidata(&next, nd);
  1127. nd->inode = inode;
  1128. }
  1129. err = -ENOTDIR;
  1130. if (!nd->inode->i_op->lookup)
  1131. break;
  1132. continue;
  1133. /* here ends the main loop */
  1134. last_with_slashes:
  1135. lookup_flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY;
  1136. last_component:
  1137. /* Clear LOOKUP_CONTINUE iff it was previously unset */
  1138. nd->flags &= lookup_flags | ~LOOKUP_CONTINUE;
  1139. if (lookup_flags & LOOKUP_PARENT)
  1140. goto lookup_parent;
  1141. if (this.name[0] == '.') switch (this.len) {
  1142. default:
  1143. break;
  1144. case 2:
  1145. if (this.name[1] != '.')
  1146. break;
  1147. if (nd->flags & LOOKUP_RCU) {
  1148. if (follow_dotdot_rcu(nd))
  1149. return -ECHILD;
  1150. } else
  1151. follow_dotdot(nd);
  1152. /* fallthrough */
  1153. case 1:
  1154. goto return_reval;
  1155. }
  1156. err = do_lookup(nd, &this, &next, &inode);
  1157. if (err)
  1158. break;
  1159. if (follow_on_final(inode, lookup_flags)) {
  1160. if (nameidata_dentry_drop_rcu_maybe(nd, next.dentry))
  1161. return -ECHILD;
  1162. BUG_ON(inode != next.dentry->d_inode);
  1163. err = do_follow_link(&next, nd);
  1164. if (err)
  1165. goto return_err;
  1166. nd->inode = nd->path.dentry->d_inode;
  1167. } else {
  1168. path_to_nameidata(&next, nd);
  1169. nd->inode = inode;
  1170. }
  1171. err = -ENOENT;
  1172. if (!nd->inode)
  1173. break;
  1174. if (lookup_flags & LOOKUP_DIRECTORY) {
  1175. err = -ENOTDIR;
  1176. if (!nd->inode->i_op->lookup)
  1177. break;
  1178. }
  1179. goto return_base;
  1180. lookup_parent:
  1181. nd->last = this;
  1182. nd->last_type = LAST_NORM;
  1183. if (this.name[0] != '.')
  1184. goto return_base;
  1185. if (this.len == 1)
  1186. nd->last_type = LAST_DOT;
  1187. else if (this.len == 2 && this.name[1] == '.')
  1188. nd->last_type = LAST_DOTDOT;
  1189. else
  1190. goto return_base;
  1191. return_reval:
  1192. /*
  1193. * We bypassed the ordinary revalidation routines.
  1194. * We may need to check the cached dentry for staleness.
  1195. */
  1196. if (need_reval_dot(nd->path.dentry)) {
  1197. /* Note: we do not d_invalidate() */
  1198. err = d_revalidate(nd->path.dentry, nd);
  1199. if (!err)
  1200. err = -ESTALE;
  1201. if (err < 0)
  1202. break;
  1203. }
  1204. return_base:
  1205. if (nameidata_drop_rcu_last_maybe(nd))
  1206. return -ECHILD;
  1207. return 0;
  1208. out_dput:
  1209. if (!(nd->flags & LOOKUP_RCU))
  1210. path_put_conditional(&next, nd);
  1211. break;
  1212. }
  1213. if (!(nd->flags & LOOKUP_RCU))
  1214. path_put(&nd->path);
  1215. return_err:
  1216. return err;
  1217. }
  1218. static inline int path_walk_rcu(const char *name, struct nameidata *nd)
  1219. {
  1220. current->total_link_count = 0;
  1221. return link_path_walk(name, nd);
  1222. }
  1223. static inline int path_walk_simple(const char *name, struct nameidata *nd)
  1224. {
  1225. current->total_link_count = 0;
  1226. return link_path_walk(name, nd);
  1227. }
  1228. static int path_walk(const char *name, struct nameidata *nd)
  1229. {
  1230. struct path save = nd->path;
  1231. int result;
  1232. current->total_link_count = 0;
  1233. /* make sure the stuff we saved doesn't go away */
  1234. path_get(&save);
  1235. result = link_path_walk(name, nd);
  1236. if (result == -ESTALE) {
  1237. /* nd->path had been dropped */
  1238. current->total_link_count = 0;
  1239. nd->path = save;
  1240. path_get(&nd->path);
  1241. nd->flags |= LOOKUP_REVAL;
  1242. result = link_path_walk(name, nd);
  1243. }
  1244. path_put(&save);
  1245. return result;
  1246. }
  1247. static void path_finish_rcu(struct nameidata *nd)
  1248. {
  1249. if (nd->flags & LOOKUP_RCU) {
  1250. /* RCU dangling. Cancel it. */
  1251. nd->flags &= ~LOOKUP_RCU;
  1252. nd->root.mnt = NULL;
  1253. rcu_read_unlock();
  1254. br_read_unlock(vfsmount_lock);
  1255. }
  1256. if (nd->file)
  1257. fput(nd->file);
  1258. }
  1259. static int path_init_rcu(int dfd, const char *name, unsigned int flags, struct nameidata *nd)
  1260. {
  1261. int retval = 0;
  1262. int fput_needed;
  1263. struct file *file;
  1264. nd->last_type = LAST_ROOT; /* if there are only slashes... */
  1265. nd->flags = flags | LOOKUP_RCU;
  1266. nd->depth = 0;
  1267. nd->root.mnt = NULL;
  1268. nd->file = NULL;
  1269. if (*name=='/') {
  1270. struct fs_struct *fs = current->fs;
  1271. unsigned seq;
  1272. br_read_lock(vfsmount_lock);
  1273. rcu_read_lock();
  1274. do {
  1275. seq = read_seqcount_begin(&fs->seq);
  1276. nd->root = fs->root;
  1277. nd->path = nd->root;
  1278. nd->seq = __read_seqcount_begin(&nd->path.dentry->d_seq);
  1279. } while (read_seqcount_retry(&fs->seq, seq));
  1280. } else if (dfd == AT_FDCWD) {
  1281. struct fs_struct *fs = current->fs;
  1282. unsigned seq;
  1283. br_read_lock(vfsmount_lock);
  1284. rcu_read_lock();
  1285. do {
  1286. seq = read_seqcount_begin(&fs->seq);
  1287. nd->path = fs->pwd;
  1288. nd->seq = __read_seqcount_begin(&nd->path.dentry->d_seq);
  1289. } while (read_seqcount_retry(&fs->seq, seq));
  1290. } else {
  1291. struct dentry *dentry;
  1292. file = fget_light(dfd, &fput_needed);
  1293. retval = -EBADF;
  1294. if (!file)
  1295. goto out_fail;
  1296. dentry = file->f_path.dentry;
  1297. retval = -ENOTDIR;
  1298. if (!S_ISDIR(dentry->d_inode->i_mode))
  1299. goto fput_fail;
  1300. retval = file_permission(file, MAY_EXEC);
  1301. if (retval)
  1302. goto fput_fail;
  1303. nd->path = file->f_path;
  1304. if (fput_needed)
  1305. nd->file = file;
  1306. nd->seq = __read_seqcount_begin(&nd->path.dentry->d_seq);
  1307. br_read_lock(vfsmount_lock);
  1308. rcu_read_lock();
  1309. }
  1310. nd->inode = nd->path.dentry->d_inode;
  1311. return 0;
  1312. fput_fail:
  1313. fput_light(file, fput_needed);
  1314. out_fail:
  1315. return retval;
  1316. }
  1317. static int path_init(int dfd, const char *name, unsigned int flags, struct nameidata *nd)
  1318. {
  1319. int retval = 0;
  1320. int fput_needed;
  1321. struct file *file;
  1322. nd->last_type = LAST_ROOT; /* if there are only slashes... */
  1323. nd->flags = flags;
  1324. nd->depth = 0;
  1325. nd->root.mnt = NULL;
  1326. if (*name=='/') {
  1327. set_root(nd);
  1328. nd->path = nd->root;
  1329. path_get(&nd->root);
  1330. } else if (dfd == AT_FDCWD) {
  1331. get_fs_pwd(current->fs, &nd->path);
  1332. } else {
  1333. struct dentry *dentry;
  1334. file = fget_light(dfd, &fput_needed);
  1335. retval = -EBADF;
  1336. if (!file)
  1337. goto out_fail;
  1338. dentry = file->f_path.dentry;
  1339. retval = -ENOTDIR;
  1340. if (!S_ISDIR(dentry->d_inode->i_mode))
  1341. goto fput_fail;
  1342. retval = file_permission(file, MAY_EXEC);
  1343. if (retval)
  1344. goto fput_fail;
  1345. nd->path = file->f_path;
  1346. path_get(&file->f_path);
  1347. fput_light(file, fput_needed);
  1348. }
  1349. nd->inode = nd->path.dentry->d_inode;
  1350. return 0;
  1351. fput_fail:
  1352. fput_light(file, fput_needed);
  1353. out_fail:
  1354. return retval;
  1355. }
  1356. /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
  1357. static int do_path_lookup(int dfd, const char *name,
  1358. unsigned int flags, struct nameidata *nd)
  1359. {
  1360. int retval;
  1361. /*
  1362. * Path walking is largely split up into 2 different synchronisation
  1363. * schemes, rcu-walk and ref-walk (explained in
  1364. * Documentation/filesystems/path-lookup.txt). These share much of the
  1365. * path walk code, but some things particularly setup, cleanup, and
  1366. * following mounts are sufficiently divergent that functions are
  1367. * duplicated. Typically there is a function foo(), and its RCU
  1368. * analogue, foo_rcu().
  1369. *
  1370. * -ECHILD is the error number of choice (just to avoid clashes) that
  1371. * is returned if some aspect of an rcu-walk fails. Such an error must
  1372. * be handled by restarting a traditional ref-walk (which will always
  1373. * be able to complete).
  1374. */
  1375. retval = path_init_rcu(dfd, name, flags, nd);
  1376. if (unlikely(retval))
  1377. return retval;
  1378. retval = path_walk_rcu(name, nd);
  1379. path_finish_rcu(nd);
  1380. if (nd->root.mnt) {
  1381. path_put(&nd->root);
  1382. nd->root.mnt = NULL;
  1383. }
  1384. if (unlikely(retval == -ECHILD || retval == -ESTALE)) {
  1385. /* slower, locked walk */
  1386. if (retval == -ESTALE)
  1387. flags |= LOOKUP_REVAL;
  1388. retval = path_init(dfd, name, flags, nd);
  1389. if (unlikely(retval))
  1390. return retval;
  1391. retval = path_walk(name, nd);
  1392. if (nd->root.mnt) {
  1393. path_put(&nd->root);
  1394. nd->root.mnt = NULL;
  1395. }
  1396. }
  1397. if (likely(!retval)) {
  1398. if (unlikely(!audit_dummy_context())) {
  1399. if (nd->path.dentry && nd->inode)
  1400. audit_inode(name, nd->path.dentry);
  1401. }
  1402. }
  1403. return retval;
  1404. }
  1405. int path_lookup(const char *name, unsigned int flags,
  1406. struct nameidata *nd)
  1407. {
  1408. return do_path_lookup(AT_FDCWD, name, flags, nd);
  1409. }
  1410. int kern_path(const char *name, unsigned int flags, struct path *path)
  1411. {
  1412. struct nameidata nd;
  1413. int res = do_path_lookup(AT_FDCWD, name, flags, &nd);
  1414. if (!res)
  1415. *path = nd.path;
  1416. return res;
  1417. }
  1418. /**
  1419. * vfs_path_lookup - lookup a file path relative to a dentry-vfsmount pair
  1420. * @dentry: pointer to dentry of the base directory
  1421. * @mnt: pointer to vfs mount of the base directory
  1422. * @name: pointer to file name
  1423. * @flags: lookup flags
  1424. * @nd: pointer to nameidata
  1425. */
  1426. int vfs_path_lookup(struct dentry *dentry, struct vfsmount *mnt,
  1427. const char *name, unsigned int flags,
  1428. struct nameidata *nd)
  1429. {
  1430. int retval;
  1431. /* same as do_path_lookup */
  1432. nd->last_type = LAST_ROOT;
  1433. nd->flags = flags;
  1434. nd->depth = 0;
  1435. nd->path.dentry = dentry;
  1436. nd->path.mnt = mnt;
  1437. path_get(&nd->path);
  1438. nd->root = nd->path;
  1439. path_get(&nd->root);
  1440. nd->inode = nd->path.dentry->d_inode;
  1441. retval = path_walk(name, nd);
  1442. if (unlikely(!retval && !audit_dummy_context() && nd->path.dentry &&
  1443. nd->inode))
  1444. audit_inode(name, nd->path.dentry);
  1445. path_put(&nd->root);
  1446. nd->root.mnt = NULL;
  1447. return retval;
  1448. }
  1449. static struct dentry *__lookup_hash(struct qstr *name,
  1450. struct dentry *base, struct nameidata *nd)
  1451. {
  1452. struct inode *inode = base->d_inode;
  1453. struct dentry *dentry;
  1454. int err;
  1455. err = exec_permission(inode, 0);
  1456. if (err)
  1457. return ERR_PTR(err);
  1458. /*
  1459. * See if the low-level filesystem might want
  1460. * to use its own hash..
  1461. */
  1462. if (base->d_flags & DCACHE_OP_HASH) {
  1463. err = base->d_op->d_hash(base, inode, name);
  1464. dentry = ERR_PTR(err);
  1465. if (err < 0)
  1466. goto out;
  1467. }
  1468. /*
  1469. * Don't bother with __d_lookup: callers are for creat as
  1470. * well as unlink, so a lot of the time it would cost
  1471. * a double lookup.
  1472. */
  1473. dentry = d_lookup(base, name);
  1474. if (dentry && (dentry->d_flags & DCACHE_OP_REVALIDATE))
  1475. dentry = do_revalidate(dentry, nd);
  1476. if (!dentry)
  1477. dentry = d_alloc_and_lookup(base, name, nd);
  1478. out:
  1479. return dentry;
  1480. }
  1481. /*
  1482. * Restricted form of lookup. Doesn't follow links, single-component only,
  1483. * needs parent already locked. Doesn't follow mounts.
  1484. * SMP-safe.
  1485. */
  1486. static struct dentry *lookup_hash(struct nameidata *nd)
  1487. {
  1488. return __lookup_hash(&nd->last, nd->path.dentry, nd);
  1489. }
  1490. static int __lookup_one_len(const char *name, struct qstr *this,
  1491. struct dentry *base, int len)
  1492. {
  1493. unsigned long hash;
  1494. unsigned int c;
  1495. this->name = name;
  1496. this->len = len;
  1497. if (!len)
  1498. return -EACCES;
  1499. hash = init_name_hash();
  1500. while (len--) {
  1501. c = *(const unsigned char *)name++;
  1502. if (c == '/' || c == '\0')
  1503. return -EACCES;
  1504. hash = partial_name_hash(c, hash);
  1505. }
  1506. this->hash = end_name_hash(hash);
  1507. return 0;
  1508. }
  1509. /**
  1510. * lookup_one_len - filesystem helper to lookup single pathname component
  1511. * @name: pathname component to lookup
  1512. * @base: base directory to lookup from
  1513. * @len: maximum length @len should be interpreted to
  1514. *
  1515. * Note that this routine is purely a helper for filesystem usage and should
  1516. * not be called by generic code. Also note that by using this function the
  1517. * nameidata argument is passed to the filesystem methods and a filesystem
  1518. * using this helper needs to be prepared for that.
  1519. */
  1520. struct dentry *lookup_one_len(const char *name, struct dentry *base, int len)
  1521. {
  1522. int err;
  1523. struct qstr this;
  1524. WARN_ON_ONCE(!mutex_is_locked(&base->d_inode->i_mutex));
  1525. err = __lookup_one_len(name, &this, base, len);
  1526. if (err)
  1527. return ERR_PTR(err);
  1528. return __lookup_hash(&this, base, NULL);
  1529. }
  1530. int user_path_at(int dfd, const char __user *name, unsigned flags,
  1531. struct path *path)
  1532. {
  1533. struct nameidata nd;
  1534. char *tmp = getname(name);
  1535. int err = PTR_ERR(tmp);
  1536. if (!IS_ERR(tmp)) {
  1537. BUG_ON(flags & LOOKUP_PARENT);
  1538. err = do_path_lookup(dfd, tmp, flags, &nd);
  1539. putname(tmp);
  1540. if (!err)
  1541. *path = nd.path;
  1542. }
  1543. return err;
  1544. }
  1545. static int user_path_parent(int dfd, const char __user *path,
  1546. struct nameidata *nd, char **name)
  1547. {
  1548. char *s = getname(path);
  1549. int error;
  1550. if (IS_ERR(s))
  1551. return PTR_ERR(s);
  1552. error = do_path_lookup(dfd, s, LOOKUP_PARENT, nd);
  1553. if (error)
  1554. putname(s);
  1555. else
  1556. *name = s;
  1557. return error;
  1558. }
  1559. /*
  1560. * It's inline, so penalty for filesystems that don't use sticky bit is
  1561. * minimal.
  1562. */
  1563. static inline int check_sticky(struct inode *dir, struct inode *inode)
  1564. {
  1565. uid_t fsuid = current_fsuid();
  1566. if (!(dir->i_mode & S_ISVTX))
  1567. return 0;
  1568. if (inode->i_uid == fsuid)
  1569. return 0;
  1570. if (dir->i_uid == fsuid)
  1571. return 0;
  1572. return !capable(CAP_FOWNER);
  1573. }
  1574. /*
  1575. * Check whether we can remove a link victim from directory dir, check
  1576. * whether the type of victim is right.
  1577. * 1. We can't do it if dir is read-only (done in permission())
  1578. * 2. We should have write and exec permissions on dir
  1579. * 3. We can't remove anything from append-only dir
  1580. * 4. We can't do anything with immutable dir (done in permission())
  1581. * 5. If the sticky bit on dir is set we should either
  1582. * a. be owner of dir, or
  1583. * b. be owner of victim, or
  1584. * c. have CAP_FOWNER capability
  1585. * 6. If the victim is append-only or immutable we can't do antyhing with
  1586. * links pointing to it.
  1587. * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR.
  1588. * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR.
  1589. * 9. We can't remove a root or mountpoint.
  1590. * 10. We don't allow removal of NFS sillyrenamed files; it's handled by
  1591. * nfs_async_unlink().
  1592. */
  1593. static int may_delete(struct inode *dir,struct dentry *victim,int isdir)
  1594. {
  1595. int error;
  1596. if (!victim->d_inode)
  1597. return -ENOENT;
  1598. BUG_ON(victim->d_parent->d_inode != dir);
  1599. audit_inode_child(victim, dir);
  1600. error = inode_permission(dir, MAY_WRITE | MAY_EXEC);
  1601. if (error)
  1602. return error;
  1603. if (IS_APPEND(dir))
  1604. return -EPERM;
  1605. if (check_sticky(dir, victim->d_inode)||IS_APPEND(victim->d_inode)||
  1606. IS_IMMUTABLE(victim->d_inode) || IS_SWAPFILE(victim->d_inode))
  1607. return -EPERM;
  1608. if (isdir) {
  1609. if (!S_ISDIR(victim->d_inode->i_mode))
  1610. return -ENOTDIR;
  1611. if (IS_ROOT(victim))
  1612. return -EBUSY;
  1613. } else if (S_ISDIR(victim->d_inode->i_mode))
  1614. return -EISDIR;
  1615. if (IS_DEADDIR(dir))
  1616. return -ENOENT;
  1617. if (victim->d_flags & DCACHE_NFSFS_RENAMED)
  1618. return -EBUSY;
  1619. return 0;
  1620. }
  1621. /* Check whether we can create an object with dentry child in directory
  1622. * dir.
  1623. * 1. We can't do it if child already exists (open has special treatment for
  1624. * this case, but since we are inlined it's OK)
  1625. * 2. We can't do it if dir is read-only (done in permission())
  1626. * 3. We should have write and exec permissions on dir
  1627. * 4. We can't do it if dir is immutable (done in permission())
  1628. */
  1629. static inline int may_create(struct inode *dir, struct dentry *child)
  1630. {
  1631. if (child->d_inode)
  1632. return -EEXIST;
  1633. if (IS_DEADDIR(dir))
  1634. return -ENOENT;
  1635. return inode_permission(dir, MAY_WRITE | MAY_EXEC);
  1636. }
  1637. /*
  1638. * p1 and p2 should be directories on the same fs.
  1639. */
  1640. struct dentry *lock_rename(struct dentry *p1, struct dentry *p2)
  1641. {
  1642. struct dentry *p;
  1643. if (p1 == p2) {
  1644. mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
  1645. return NULL;
  1646. }
  1647. mutex_lock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
  1648. p = d_ancestor(p2, p1);
  1649. if (p) {
  1650. mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_PARENT);
  1651. mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_CHILD);
  1652. return p;
  1653. }
  1654. p = d_ancestor(p1, p2);
  1655. if (p) {
  1656. mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
  1657. mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
  1658. return p;
  1659. }
  1660. mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
  1661. mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
  1662. return NULL;
  1663. }
  1664. void unlock_rename(struct dentry *p1, struct dentry *p2)
  1665. {
  1666. mutex_unlock(&p1->d_inode->i_mutex);
  1667. if (p1 != p2) {
  1668. mutex_unlock(&p2->d_inode->i_mutex);
  1669. mutex_unlock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
  1670. }
  1671. }
  1672. int vfs_create(struct inode *dir, struct dentry *dentry, int mode,
  1673. struct nameidata *nd)
  1674. {
  1675. int error = may_create(dir, dentry);
  1676. if (error)
  1677. return error;
  1678. if (!dir->i_op->create)
  1679. return -EACCES; /* shouldn't it be ENOSYS? */
  1680. mode &= S_IALLUGO;
  1681. mode |= S_IFREG;
  1682. error = security_inode_create(dir, dentry, mode);
  1683. if (error)
  1684. return error;
  1685. error = dir->i_op->create(dir, dentry, mode, nd);
  1686. if (!error)
  1687. fsnotify_create(dir, dentry);
  1688. return error;
  1689. }
  1690. int may_open(struct path *path, int acc_mode, int flag)
  1691. {
  1692. struct dentry *dentry = path->dentry;
  1693. struct inode *inode = dentry->d_inode;
  1694. int error;
  1695. if (!inode)
  1696. return -ENOENT;
  1697. switch (inode->i_mode & S_IFMT) {
  1698. case S_IFLNK:
  1699. return -ELOOP;
  1700. case S_IFDIR:
  1701. if (acc_mode & MAY_WRITE)
  1702. return -EISDIR;
  1703. break;
  1704. case S_IFBLK:
  1705. case S_IFCHR:
  1706. if (path->mnt->mnt_flags & MNT_NODEV)
  1707. return -EACCES;
  1708. /*FALLTHRU*/
  1709. case S_IFIFO:
  1710. case S_IFSOCK:
  1711. flag &= ~O_TRUNC;
  1712. break;
  1713. }
  1714. error = inode_permission(inode, acc_mode);
  1715. if (error)
  1716. return error;
  1717. /*
  1718. * An append-only file must be opened in append mode for writing.
  1719. */
  1720. if (IS_APPEND(inode)) {
  1721. if ((flag & O_ACCMODE) != O_RDONLY && !(flag & O_APPEND))
  1722. return -EPERM;
  1723. if (flag & O_TRUNC)
  1724. return -EPERM;
  1725. }
  1726. /* O_NOATIME can only be set by the owner or superuser */
  1727. if (flag & O_NOATIME && !is_owner_or_cap(inode))
  1728. return -EPERM;
  1729. /*
  1730. * Ensure there are no outstanding leases on the file.
  1731. */
  1732. return break_lease(inode, flag);
  1733. }
  1734. static int handle_truncate(struct path *path)
  1735. {
  1736. struct inode *inode = path->dentry->d_inode;
  1737. int error = get_write_access(inode);
  1738. if (error)
  1739. return error;
  1740. /*
  1741. * Refuse to truncate files with mandatory locks held on them.
  1742. */
  1743. error = locks_verify_locked(inode);
  1744. if (!error)
  1745. error = security_path_truncate(path);
  1746. if (!error) {
  1747. error = do_truncate(path->dentry, 0,
  1748. ATTR_MTIME|ATTR_CTIME|ATTR_OPEN,
  1749. NULL);
  1750. }
  1751. put_write_access(inode);
  1752. return error;
  1753. }
  1754. /*
  1755. * Be careful about ever adding any more callers of this
  1756. * function. Its flags must be in the namei format, not
  1757. * what get passed to sys_open().
  1758. */
  1759. static int __open_namei_create(struct nameidata *nd, struct path *path,
  1760. int open_flag, int mode)
  1761. {
  1762. int error;
  1763. struct dentry *dir = nd->path.dentry;
  1764. if (!IS_POSIXACL(dir->d_inode))
  1765. mode &= ~current_umask();
  1766. error = security_path_mknod(&nd->path, path->dentry, mode, 0);
  1767. if (error)
  1768. goto out_unlock;
  1769. error = vfs_create(dir->d_inode, path->dentry, mode, nd);
  1770. out_unlock:
  1771. mutex_unlock(&dir->d_inode->i_mutex);
  1772. dput(nd->path.dentry);
  1773. nd->path.dentry = path->dentry;
  1774. if (error)
  1775. return error;
  1776. /* Don't check for write permission, don't truncate */
  1777. return may_open(&nd->path, 0, open_flag & ~O_TRUNC);
  1778. }
  1779. /*
  1780. * Note that while the flag value (low two bits) for sys_open means:
  1781. * 00 - read-only
  1782. * 01 - write-only
  1783. * 10 - read-write
  1784. * 11 - special
  1785. * it is changed into
  1786. * 00 - no permissions needed
  1787. * 01 - read-permission
  1788. * 10 - write-permission
  1789. * 11 - read-write
  1790. * for the internal routines (ie open_namei()/follow_link() etc)
  1791. * This is more logical, and also allows the 00 "no perm needed"
  1792. * to be used for symlinks (where the permissions are checked
  1793. * later).
  1794. *
  1795. */
  1796. static inline int open_to_namei_flags(int flag)
  1797. {
  1798. if ((flag+1) & O_ACCMODE)
  1799. flag++;
  1800. return flag;
  1801. }
  1802. static int open_will_truncate(int flag, struct inode *inode)
  1803. {
  1804. /*
  1805. * We'll never write to the fs underlying
  1806. * a device file.
  1807. */
  1808. if (special_file(inode->i_mode))
  1809. return 0;
  1810. return (flag & O_TRUNC);
  1811. }
  1812. static struct file *finish_open(struct nameidata *nd,
  1813. int open_flag, int acc_mode)
  1814. {
  1815. struct file *filp;
  1816. int will_truncate;
  1817. int error;
  1818. will_truncate = open_will_truncate(open_flag, nd->path.dentry->d_inode);
  1819. if (will_truncate) {
  1820. error = mnt_want_write(nd->path.mnt);
  1821. if (error)
  1822. goto exit;
  1823. }
  1824. error = may_open(&nd->path, acc_mode, open_flag);
  1825. if (error) {
  1826. if (will_truncate)
  1827. mnt_drop_write(nd->path.mnt);
  1828. goto exit;
  1829. }
  1830. filp = nameidata_to_filp(nd);
  1831. if (!IS_ERR(filp)) {
  1832. error = ima_file_check(filp, acc_mode);
  1833. if (error) {
  1834. fput(filp);
  1835. filp = ERR_PTR(error);
  1836. }
  1837. }
  1838. if (!IS_ERR(filp)) {
  1839. if (will_truncate) {
  1840. error = handle_truncate(&nd->path);
  1841. if (error) {
  1842. fput(filp);
  1843. filp = ERR_PTR(error);
  1844. }
  1845. }
  1846. }
  1847. /*
  1848. * It is now safe to drop the mnt write
  1849. * because the filp has had a write taken
  1850. * on its behalf.
  1851. */
  1852. if (will_truncate)
  1853. mnt_drop_write(nd->path.mnt);
  1854. path_put(&nd->path);
  1855. return filp;
  1856. exit:
  1857. if (!IS_ERR(nd->intent.open.file))
  1858. release_open_intent(nd);
  1859. path_put(&nd->path);
  1860. return ERR_PTR(error);
  1861. }
  1862. /*
  1863. * Handle O_CREAT case for do_filp_open
  1864. */
  1865. static struct file *do_last(struct nameidata *nd, struct path *path,
  1866. int open_flag, int acc_mode,
  1867. int mode, const char *pathname)
  1868. {
  1869. struct dentry *dir = nd->path.dentry;
  1870. struct file *filp;
  1871. int error = -EISDIR;
  1872. switch (nd->last_type) {
  1873. case LAST_DOTDOT:
  1874. follow_dotdot(nd);
  1875. dir = nd->path.dentry;
  1876. case LAST_DOT:
  1877. if (need_reval_dot(dir)) {
  1878. error = d_revalidate(nd->path.dentry, nd);
  1879. if (!error)
  1880. error = -ESTALE;
  1881. if (error < 0)
  1882. goto exit;
  1883. }
  1884. /* fallthrough */
  1885. case LAST_ROOT:
  1886. goto exit;
  1887. case LAST_BIND:
  1888. audit_inode(pathname, dir);
  1889. goto ok;
  1890. }
  1891. /* trailing slashes? */
  1892. if (nd->last.name[nd->last.len])
  1893. goto exit;
  1894. mutex_lock(&dir->d_inode->i_mutex);
  1895. path->dentry = lookup_hash(nd);
  1896. path->mnt = nd->path.mnt;
  1897. error = PTR_ERR(path->dentry);
  1898. if (IS_ERR(path->dentry)) {
  1899. mutex_unlock(&dir->d_inode->i_mutex);
  1900. goto exit;
  1901. }
  1902. if (IS_ERR(nd->intent.open.file)) {
  1903. error = PTR_ERR(nd->intent.open.file);
  1904. goto exit_mutex_unlock;
  1905. }
  1906. /* Negative dentry, just create the file */
  1907. if (!path->dentry->d_inode) {
  1908. /*
  1909. * This write is needed to ensure that a
  1910. * ro->rw transition does not occur between
  1911. * the time when the file is created and when
  1912. * a permanent write count is taken through
  1913. * the 'struct file' in nameidata_to_filp().
  1914. */
  1915. error = mnt_want_write(nd->path.mnt);
  1916. if (error)
  1917. goto exit_mutex_unlock;
  1918. error = __open_namei_create(nd, path, open_flag, mode);
  1919. if (error) {
  1920. mnt_drop_write(nd->path.mnt);
  1921. goto exit;
  1922. }
  1923. filp = nameidata_to_filp(nd);
  1924. mnt_drop_write(nd->path.mnt);
  1925. path_put(&nd->path);
  1926. if (!IS_ERR(filp)) {
  1927. error = ima_file_check(filp, acc_mode);
  1928. if (error) {
  1929. fput(filp);
  1930. filp = ERR_PTR(error);
  1931. }
  1932. }
  1933. return filp;
  1934. }
  1935. /*
  1936. * It already exists.
  1937. */
  1938. mutex_unlock(&dir->d_inode->i_mutex);
  1939. audit_inode(pathname, path->dentry);
  1940. error = -EEXIST;
  1941. if (open_flag & O_EXCL)
  1942. goto exit_dput;
  1943. if (__follow_mount(path)) {
  1944. error = -ELOOP;
  1945. if (open_flag & O_NOFOLLOW)
  1946. goto exit_dput;
  1947. }
  1948. error = -ENOENT;
  1949. if (!path->dentry->d_inode)
  1950. goto exit_dput;
  1951. if (path->dentry->d_inode->i_op->follow_link)
  1952. return NULL;
  1953. path_to_nameidata(path, nd);
  1954. nd->inode = path->dentry->d_inode;
  1955. error = -EISDIR;
  1956. if (S_ISDIR(nd->inode->i_mode))
  1957. goto exit;
  1958. ok:
  1959. filp = finish_open(nd, open_flag, acc_mode);
  1960. return filp;
  1961. exit_mutex_unlock:
  1962. mutex_unlock(&dir->d_inode->i_mutex);
  1963. exit_dput:
  1964. path_put_conditional(path, nd);
  1965. exit:
  1966. if (!IS_ERR(nd->intent.open.file))
  1967. release_open_intent(nd);
  1968. path_put(&nd->path);
  1969. return ERR_PTR(error);
  1970. }
  1971. /*
  1972. * Note that the low bits of the passed in "open_flag"
  1973. * are not the same as in the local variable "flag". See
  1974. * open_to_namei_flags() for more details.
  1975. */
  1976. struct file *do_filp_open(int dfd, const char *pathname,
  1977. int open_flag, int mode, int acc_mode)
  1978. {
  1979. struct file *filp;
  1980. struct nameidata nd;
  1981. int error;
  1982. struct path path;
  1983. int count = 0;
  1984. int flag = open_to_namei_flags(open_flag);
  1985. int flags;
  1986. if (!(open_flag & O_CREAT))
  1987. mode = 0;
  1988. /* Must never be set by userspace */
  1989. open_flag &= ~FMODE_NONOTIFY;
  1990. /*
  1991. * O_SYNC is implemented as __O_SYNC|O_DSYNC. As many places only
  1992. * check for O_DSYNC if the need any syncing at all we enforce it's
  1993. * always set instead of having to deal with possibly weird behaviour
  1994. * for malicious applications setting only __O_SYNC.
  1995. */
  1996. if (open_flag & __O_SYNC)
  1997. open_flag |= O_DSYNC;
  1998. if (!acc_mode)
  1999. acc_mode = MAY_OPEN | ACC_MODE(open_flag);
  2000. /* O_TRUNC implies we need access checks for write permissions */
  2001. if (open_flag & O_TRUNC)
  2002. acc_mode |= MAY_WRITE;
  2003. /* Allow the LSM permission hook to distinguish append
  2004. access from general write access. */
  2005. if (open_flag & O_APPEND)
  2006. acc_mode |= MAY_APPEND;
  2007. flags = LOOKUP_OPEN;
  2008. if (open_flag & O_CREAT) {
  2009. flags |= LOOKUP_CREATE;
  2010. if (open_flag & O_EXCL)
  2011. flags |= LOOKUP_EXCL;
  2012. }
  2013. if (open_flag & O_DIRECTORY)
  2014. flags |= LOOKUP_DIRECTORY;
  2015. if (!(open_flag & O_NOFOLLOW))
  2016. flags |= LOOKUP_FOLLOW;
  2017. filp = get_empty_filp();
  2018. if (!filp)
  2019. return ERR_PTR(-ENFILE);
  2020. filp->f_flags = open_flag;
  2021. nd.intent.open.file = filp;
  2022. nd.intent.open.flags = flag;
  2023. nd.intent.open.create_mode = mode;
  2024. if (open_flag & O_CREAT)
  2025. goto creat;
  2026. /* !O_CREAT, simple open */
  2027. error = do_path_lookup(dfd, pathname, flags, &nd);
  2028. if (unlikely(error))
  2029. goto out_filp;
  2030. error = -ELOOP;
  2031. if (!(nd.flags & LOOKUP_FOLLOW)) {
  2032. if (nd.inode->i_op->follow_link)
  2033. goto out_path;
  2034. }
  2035. error = -ENOTDIR;
  2036. if (nd.flags & LOOKUP_DIRECTORY) {
  2037. if (!nd.inode->i_op->lookup)
  2038. goto out_path;
  2039. }
  2040. audit_inode(pathname, nd.path.dentry);
  2041. filp = finish_open(&nd, open_flag, acc_mode);
  2042. return filp;
  2043. creat:
  2044. /* OK, have to create the file. Find the parent. */
  2045. error = path_init_rcu(dfd, pathname,
  2046. LOOKUP_PARENT | (flags & LOOKUP_REVAL), &nd);
  2047. if (error)
  2048. goto out_filp;
  2049. error = path_walk_rcu(pathname, &nd);
  2050. path_finish_rcu(&nd);
  2051. if (unlikely(error == -ECHILD || error == -ESTALE)) {
  2052. /* slower, locked walk */
  2053. if (error == -ESTALE) {
  2054. reval:
  2055. flags |= LOOKUP_REVAL;
  2056. }
  2057. error = path_init(dfd, pathname,
  2058. LOOKUP_PARENT | (flags & LOOKUP_REVAL), &nd);
  2059. if (error)
  2060. goto out_filp;
  2061. error = path_walk_simple(pathname, &nd);
  2062. }
  2063. if (unlikely(error))
  2064. goto out_filp;
  2065. if (unlikely(!audit_dummy_context()))
  2066. audit_inode(pathname, nd.path.dentry);
  2067. /*
  2068. * We have the parent and last component.
  2069. */
  2070. nd.flags = flags;
  2071. filp = do_last(&nd, &path, open_flag, acc_mode, mode, pathname);
  2072. while (unlikely(!filp)) { /* trailing symlink */
  2073. struct path holder;
  2074. void *cookie;
  2075. error = -ELOOP;
  2076. /* S_ISDIR part is a temporary automount kludge */
  2077. if (!(nd.flags & LOOKUP_FOLLOW) && !S_ISDIR(nd.inode->i_mode))
  2078. goto exit_dput;
  2079. if (count++ == 32)
  2080. goto exit_dput;
  2081. /*
  2082. * This is subtle. Instead of calling do_follow_link() we do
  2083. * the thing by hands. The reason is that this way we have zero
  2084. * link_count and path_walk() (called from ->follow_link)
  2085. * honoring LOOKUP_PARENT. After that we have the parent and
  2086. * last component, i.e. we are in the same situation as after
  2087. * the first path_walk(). Well, almost - if the last component
  2088. * is normal we get its copy stored in nd->last.name and we will
  2089. * have to putname() it when we are done. Procfs-like symlinks
  2090. * just set LAST_BIND.
  2091. */
  2092. nd.flags |= LOOKUP_PARENT;
  2093. error = security_inode_follow_link(path.dentry, &nd);
  2094. if (error)
  2095. goto exit_dput;
  2096. error = __do_follow_link(&path, &nd, &cookie);
  2097. if (unlikely(error)) {
  2098. if (!IS_ERR(cookie) && nd.inode->i_op->put_link)
  2099. nd.inode->i_op->put_link(path.dentry, &nd, cookie);
  2100. /* nd.path had been dropped */
  2101. nd.path = path;
  2102. goto out_path;
  2103. }
  2104. holder = path;
  2105. nd.flags &= ~LOOKUP_PARENT;
  2106. filp = do_last(&nd, &path, open_flag, acc_mode, mode, pathname);
  2107. if (nd.inode->i_op->put_link)
  2108. nd.inode->i_op->put_link(holder.dentry, &nd, cookie);
  2109. path_put(&holder);
  2110. }
  2111. out:
  2112. if (nd.root.mnt)
  2113. path_put(&nd.root);
  2114. if (filp == ERR_PTR(-ESTALE) && !(flags & LOOKUP_REVAL))
  2115. goto reval;
  2116. return filp;
  2117. exit_dput:
  2118. path_put_conditional(&path, &nd);
  2119. out_path:
  2120. path_put(&nd.path);
  2121. out_filp:
  2122. if (!IS_ERR(nd.intent.open.file))
  2123. release_open_intent(&nd);
  2124. filp = ERR_PTR(error);
  2125. goto out;
  2126. }
  2127. /**
  2128. * filp_open - open file and return file pointer
  2129. *
  2130. * @filename: path to open
  2131. * @flags: open flags as per the open(2) second argument
  2132. * @mode: mode for the new file if O_CREAT is set, else ignored
  2133. *
  2134. * This is the helper to open a file from kernelspace if you really
  2135. * have to. But in generally you should not do this, so please move
  2136. * along, nothing to see here..
  2137. */
  2138. struct file *filp_open(const char *filename, int flags, int mode)
  2139. {
  2140. return do_filp_open(AT_FDCWD, filename, flags, mode, 0);
  2141. }
  2142. EXPORT_SYMBOL(filp_open);
  2143. /**
  2144. * lookup_create - lookup a dentry, creating it if it doesn't exist
  2145. * @nd: nameidata info
  2146. * @is_dir: directory flag
  2147. *
  2148. * Simple function to lookup and return a dentry and create it
  2149. * if it doesn't exist. Is SMP-safe.
  2150. *
  2151. * Returns with nd->path.dentry->d_inode->i_mutex locked.
  2152. */
  2153. struct dentry *lookup_create(struct nameidata *nd, int is_dir)
  2154. {
  2155. struct dentry *dentry = ERR_PTR(-EEXIST);
  2156. mutex_lock_nested(&nd->path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
  2157. /*
  2158. * Yucky last component or no last component at all?
  2159. * (foo/., foo/.., /////)
  2160. */
  2161. if (nd->last_type != LAST_NORM)
  2162. goto fail;
  2163. nd->flags &= ~LOOKUP_PARENT;
  2164. nd->flags |= LOOKUP_CREATE | LOOKUP_EXCL;
  2165. nd->intent.open.flags = O_EXCL;
  2166. /*
  2167. * Do the final lookup.
  2168. */
  2169. dentry = lookup_hash(nd);
  2170. if (IS_ERR(dentry))
  2171. goto fail;
  2172. if (dentry->d_inode)
  2173. goto eexist;
  2174. /*
  2175. * Special case - lookup gave negative, but... we had foo/bar/
  2176. * From the vfs_mknod() POV we just have a negative dentry -
  2177. * all is fine. Let's be bastards - you had / on the end, you've
  2178. * been asking for (non-existent) directory. -ENOENT for you.
  2179. */
  2180. if (unlikely(!is_dir && nd->last.name[nd->last.len])) {
  2181. dput(dentry);
  2182. dentry = ERR_PTR(-ENOENT);
  2183. }
  2184. return dentry;
  2185. eexist:
  2186. dput(dentry);
  2187. dentry = ERR_PTR(-EEXIST);
  2188. fail:
  2189. return dentry;
  2190. }
  2191. EXPORT_SYMBOL_GPL(lookup_create);
  2192. int vfs_mknod(struct inode *dir, struct dentry *dentry, int mode, dev_t dev)
  2193. {
  2194. int error = may_create(dir, dentry);
  2195. if (error)
  2196. return error;
  2197. if ((S_ISCHR(mode) || S_ISBLK(mode)) && !capable(CAP_MKNOD))
  2198. return -EPERM;
  2199. if (!dir->i_op->mknod)
  2200. return -EPERM;
  2201. error = devcgroup_inode_mknod(mode, dev);
  2202. if (error)
  2203. return error;
  2204. error = security_inode_mknod(dir, dentry, mode, dev);
  2205. if (error)
  2206. return error;
  2207. error = dir->i_op->mknod(dir, dentry, mode, dev);
  2208. if (!error)
  2209. fsnotify_create(dir, dentry);
  2210. return error;
  2211. }
  2212. static int may_mknod(mode_t mode)
  2213. {
  2214. switch (mode & S_IFMT) {
  2215. case S_IFREG:
  2216. case S_IFCHR:
  2217. case S_IFBLK:
  2218. case S_IFIFO:
  2219. case S_IFSOCK:
  2220. case 0: /* zero mode translates to S_IFREG */
  2221. return 0;
  2222. case S_IFDIR:
  2223. return -EPERM;
  2224. default:
  2225. return -EINVAL;
  2226. }
  2227. }
  2228. SYSCALL_DEFINE4(mknodat, int, dfd, const char __user *, filename, int, mode,
  2229. unsigned, dev)
  2230. {
  2231. int error;
  2232. char *tmp;
  2233. struct dentry *dentry;
  2234. struct nameidata nd;
  2235. if (S_ISDIR(mode))
  2236. return -EPERM;
  2237. error = user_path_parent(dfd, filename, &nd, &tmp);
  2238. if (error)
  2239. return error;
  2240. dentry = lookup_create(&nd, 0);
  2241. if (IS_ERR(dentry)) {
  2242. error = PTR_ERR(dentry);
  2243. goto out_unlock;
  2244. }
  2245. if (!IS_POSIXACL(nd.path.dentry->d_inode))
  2246. mode &= ~current_umask();
  2247. error = may_mknod(mode);
  2248. if (error)
  2249. goto out_dput;
  2250. error = mnt_want_write(nd.path.mnt);
  2251. if (error)
  2252. goto out_dput;
  2253. error = security_path_mknod(&nd.path, dentry, mode, dev);
  2254. if (error)
  2255. goto out_drop_write;
  2256. switch (mode & S_IFMT) {
  2257. case 0: case S_IFREG:
  2258. error = vfs_create(nd.path.dentry->d_inode,dentry,mode,&nd);
  2259. break;
  2260. case S_IFCHR: case S_IFBLK:
  2261. error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode,
  2262. new_decode_dev(dev));
  2263. break;
  2264. case S_IFIFO: case S_IFSOCK:
  2265. error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode,0);
  2266. break;
  2267. }
  2268. out_drop_write:
  2269. mnt_drop_write(nd.path.mnt);
  2270. out_dput:
  2271. dput(dentry);
  2272. out_unlock:
  2273. mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
  2274. path_put(&nd.path);
  2275. putname(tmp);
  2276. return error;
  2277. }
  2278. SYSCALL_DEFINE3(mknod, const char __user *, filename, int, mode, unsigned, dev)
  2279. {
  2280. return sys_mknodat(AT_FDCWD, filename, mode, dev);
  2281. }
  2282. int vfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
  2283. {
  2284. int error = may_create(dir, dentry);
  2285. if (error)
  2286. return error;
  2287. if (!dir->i_op->mkdir)
  2288. return -EPERM;
  2289. mode &= (S_IRWXUGO|S_ISVTX);
  2290. error = security_inode_mkdir(dir, dentry, mode);
  2291. if (error)
  2292. return error;
  2293. error = dir->i_op->mkdir(dir, dentry, mode);
  2294. if (!error)
  2295. fsnotify_mkdir(dir, dentry);
  2296. return error;
  2297. }
  2298. SYSCALL_DEFINE3(mkdirat, int, dfd, const char __user *, pathname, int, mode)
  2299. {
  2300. int error = 0;
  2301. char * tmp;
  2302. struct dentry *dentry;
  2303. struct nameidata nd;
  2304. error = user_path_parent(dfd, pathname, &nd, &tmp);
  2305. if (error)
  2306. goto out_err;
  2307. dentry = lookup_create(&nd, 1);
  2308. error = PTR_ERR(dentry);
  2309. if (IS_ERR(dentry))
  2310. goto out_unlock;
  2311. if (!IS_POSIXACL(nd.path.dentry->d_inode))
  2312. mode &= ~current_umask();
  2313. error = mnt_want_write(nd.path.mnt);
  2314. if (error)
  2315. goto out_dput;
  2316. error = security_path_mkdir(&nd.path, dentry, mode);
  2317. if (error)
  2318. goto out_drop_write;
  2319. error = vfs_mkdir(nd.path.dentry->d_inode, dentry, mode);
  2320. out_drop_write:
  2321. mnt_drop_write(nd.path.mnt);
  2322. out_dput:
  2323. dput(dentry);
  2324. out_unlock:
  2325. mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
  2326. path_put(&nd.path);
  2327. putname(tmp);
  2328. out_err:
  2329. return error;
  2330. }
  2331. SYSCALL_DEFINE2(mkdir, const char __user *, pathname, int, mode)
  2332. {
  2333. return sys_mkdirat(AT_FDCWD, pathname, mode);
  2334. }
  2335. /*
  2336. * We try to drop the dentry early: we should have
  2337. * a usage count of 2 if we're the only user of this
  2338. * dentry, and if that is true (possibly after pruning
  2339. * the dcache), then we drop the dentry now.
  2340. *
  2341. * A low-level filesystem can, if it choses, legally
  2342. * do a
  2343. *
  2344. * if (!d_unhashed(dentry))
  2345. * return -EBUSY;
  2346. *
  2347. * if it cannot handle the case of removing a directory
  2348. * that is still in use by something else..
  2349. */
  2350. void dentry_unhash(struct dentry *dentry)
  2351. {
  2352. dget(dentry);
  2353. shrink_dcache_parent(dentry);
  2354. spin_lock(&dentry->d_lock);
  2355. if (dentry->d_count == 2)
  2356. __d_drop(dentry);
  2357. spin_unlock(&dentry->d_lock);
  2358. }
  2359. int vfs_rmdir(struct inode *dir, struct dentry *dentry)
  2360. {
  2361. int error = may_delete(dir, dentry, 1);
  2362. if (error)
  2363. return error;
  2364. if (!dir->i_op->rmdir)
  2365. return -EPERM;
  2366. mutex_lock(&dentry->d_inode->i_mutex);
  2367. dentry_unhash(dentry);
  2368. if (d_mountpoint(dentry))
  2369. error = -EBUSY;
  2370. else {
  2371. error = security_inode_rmdir(dir, dentry);
  2372. if (!error) {
  2373. error = dir->i_op->rmdir(dir, dentry);
  2374. if (!error) {
  2375. dentry->d_inode->i_flags |= S_DEAD;
  2376. dont_mount(dentry);
  2377. }
  2378. }
  2379. }
  2380. mutex_unlock(&dentry->d_inode->i_mutex);
  2381. if (!error) {
  2382. d_delete(dentry);
  2383. }
  2384. dput(dentry);
  2385. return error;
  2386. }
  2387. static long do_rmdir(int dfd, const char __user *pathname)
  2388. {
  2389. int error = 0;
  2390. char * name;
  2391. struct dentry *dentry;
  2392. struct nameidata nd;
  2393. error = user_path_parent(dfd, pathname, &nd, &name);
  2394. if (error)
  2395. return error;
  2396. switch(nd.last_type) {
  2397. case LAST_DOTDOT:
  2398. error = -ENOTEMPTY;
  2399. goto exit1;
  2400. case LAST_DOT:
  2401. error = -EINVAL;
  2402. goto exit1;
  2403. case LAST_ROOT:
  2404. error = -EBUSY;
  2405. goto exit1;
  2406. }
  2407. nd.flags &= ~LOOKUP_PARENT;
  2408. mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
  2409. dentry = lookup_hash(&nd);
  2410. error = PTR_ERR(dentry);
  2411. if (IS_ERR(dentry))
  2412. goto exit2;
  2413. error = mnt_want_write(nd.path.mnt);
  2414. if (error)
  2415. goto exit3;
  2416. error = security_path_rmdir(&nd.path, dentry);
  2417. if (error)
  2418. goto exit4;
  2419. error = vfs_rmdir(nd.path.dentry->d_inode, dentry);
  2420. exit4:
  2421. mnt_drop_write(nd.path.mnt);
  2422. exit3:
  2423. dput(dentry);
  2424. exit2:
  2425. mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
  2426. exit1:
  2427. path_put(&nd.path);
  2428. putname(name);
  2429. return error;
  2430. }
  2431. SYSCALL_DEFINE1(rmdir, const char __user *, pathname)
  2432. {
  2433. return do_rmdir(AT_FDCWD, pathname);
  2434. }
  2435. int vfs_unlink(struct inode *dir, struct dentry *dentry)
  2436. {
  2437. int error = may_delete(dir, dentry, 0);
  2438. if (error)
  2439. return error;
  2440. if (!dir->i_op->unlink)
  2441. return -EPERM;
  2442. mutex_lock(&dentry->d_inode->i_mutex);
  2443. if (d_mountpoint(dentry))
  2444. error = -EBUSY;
  2445. else {
  2446. error = security_inode_unlink(dir, dentry);
  2447. if (!error) {
  2448. error = dir->i_op->unlink(dir, dentry);
  2449. if (!error)
  2450. dont_mount(dentry);
  2451. }
  2452. }
  2453. mutex_unlock(&dentry->d_inode->i_mutex);
  2454. /* We don't d_delete() NFS sillyrenamed files--they still exist. */
  2455. if (!error && !(dentry->d_flags & DCACHE_NFSFS_RENAMED)) {
  2456. fsnotify_link_count(dentry->d_inode);
  2457. d_delete(dentry);
  2458. }
  2459. return error;
  2460. }
  2461. /*
  2462. * Make sure that the actual truncation of the file will occur outside its
  2463. * directory's i_mutex. Truncate can take a long time if there is a lot of
  2464. * writeout happening, and we don't want to prevent access to the directory
  2465. * while waiting on the I/O.
  2466. */
  2467. static long do_unlinkat(int dfd, const char __user *pathname)
  2468. {
  2469. int error;
  2470. char *name;
  2471. struct dentry *dentry;
  2472. struct nameidata nd;
  2473. struct inode *inode = NULL;
  2474. error = user_path_parent(dfd, pathname, &nd, &name);
  2475. if (error)
  2476. return error;
  2477. error = -EISDIR;
  2478. if (nd.last_type != LAST_NORM)
  2479. goto exit1;
  2480. nd.flags &= ~LOOKUP_PARENT;
  2481. mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
  2482. dentry = lookup_hash(&nd);
  2483. error = PTR_ERR(dentry);
  2484. if (!IS_ERR(dentry)) {
  2485. /* Why not before? Because we want correct error value */
  2486. if (nd.last.name[nd.last.len])
  2487. goto slashes;
  2488. inode = dentry->d_inode;
  2489. if (inode)
  2490. ihold(inode);
  2491. error = mnt_want_write(nd.path.mnt);
  2492. if (error)
  2493. goto exit2;
  2494. error = security_path_unlink(&nd.path, dentry);
  2495. if (error)
  2496. goto exit3;
  2497. error = vfs_unlink(nd.path.dentry->d_inode, dentry);
  2498. exit3:
  2499. mnt_drop_write(nd.path.mnt);
  2500. exit2:
  2501. dput(dentry);
  2502. }
  2503. mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
  2504. if (inode)
  2505. iput(inode); /* truncate the inode here */
  2506. exit1:
  2507. path_put(&nd.path);
  2508. putname(name);
  2509. return error;
  2510. slashes:
  2511. error = !dentry->d_inode ? -ENOENT :
  2512. S_ISDIR(dentry->d_inode->i_mode) ? -EISDIR : -ENOTDIR;
  2513. goto exit2;
  2514. }
  2515. SYSCALL_DEFINE3(unlinkat, int, dfd, const char __user *, pathname, int, flag)
  2516. {
  2517. if ((flag & ~AT_REMOVEDIR) != 0)
  2518. return -EINVAL;
  2519. if (flag & AT_REMOVEDIR)
  2520. return do_rmdir(dfd, pathname);
  2521. return do_unlinkat(dfd, pathname);
  2522. }
  2523. SYSCALL_DEFINE1(unlink, const char __user *, pathname)
  2524. {
  2525. return do_unlinkat(AT_FDCWD, pathname);
  2526. }
  2527. int vfs_symlink(struct inode *dir, struct dentry *dentry, const char *oldname)
  2528. {
  2529. int error = may_create(dir, dentry);
  2530. if (error)
  2531. return error;
  2532. if (!dir->i_op->symlink)
  2533. return -EPERM;
  2534. error = security_inode_symlink(dir, dentry, oldname);
  2535. if (error)
  2536. return error;
  2537. error = dir->i_op->symlink(dir, dentry, oldname);
  2538. if (!error)
  2539. fsnotify_create(dir, dentry);
  2540. return error;
  2541. }
  2542. SYSCALL_DEFINE3(symlinkat, const char __user *, oldname,
  2543. int, newdfd, const char __user *, newname)
  2544. {
  2545. int error;
  2546. char *from;
  2547. char *to;
  2548. struct dentry *dentry;
  2549. struct nameidata nd;
  2550. from = getname(oldname);
  2551. if (IS_ERR(from))
  2552. return PTR_ERR(from);
  2553. error = user_path_parent(newdfd, newname, &nd, &to);
  2554. if (error)
  2555. goto out_putname;
  2556. dentry = lookup_create(&nd, 0);
  2557. error = PTR_ERR(dentry);
  2558. if (IS_ERR(dentry))
  2559. goto out_unlock;
  2560. error = mnt_want_write(nd.path.mnt);
  2561. if (error)
  2562. goto out_dput;
  2563. error = security_path_symlink(&nd.path, dentry, from);
  2564. if (error)
  2565. goto out_drop_write;
  2566. error = vfs_symlink(nd.path.dentry->d_inode, dentry, from);
  2567. out_drop_write:
  2568. mnt_drop_write(nd.path.mnt);
  2569. out_dput:
  2570. dput(dentry);
  2571. out_unlock:
  2572. mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
  2573. path_put(&nd.path);
  2574. putname(to);
  2575. out_putname:
  2576. putname(from);
  2577. return error;
  2578. }
  2579. SYSCALL_DEFINE2(symlink, const char __user *, oldname, const char __user *, newname)
  2580. {
  2581. return sys_symlinkat(oldname, AT_FDCWD, newname);
  2582. }
  2583. int vfs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *new_dentry)
  2584. {
  2585. struct inode *inode = old_dentry->d_inode;
  2586. int error;
  2587. if (!inode)
  2588. return -ENOENT;
  2589. error = may_create(dir, new_dentry);
  2590. if (error)
  2591. return error;
  2592. if (dir->i_sb != inode->i_sb)
  2593. return -EXDEV;
  2594. /*
  2595. * A link to an append-only or immutable file cannot be created.
  2596. */
  2597. if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
  2598. return -EPERM;
  2599. if (!dir->i_op->link)
  2600. return -EPERM;
  2601. if (S_ISDIR(inode->i_mode))
  2602. return -EPERM;
  2603. error = security_inode_link(old_dentry, dir, new_dentry);
  2604. if (error)
  2605. return error;
  2606. mutex_lock(&inode->i_mutex);
  2607. error = dir->i_op->link(old_dentry, dir, new_dentry);
  2608. mutex_unlock(&inode->i_mutex);
  2609. if (!error)
  2610. fsnotify_link(dir, inode, new_dentry);
  2611. return error;
  2612. }
  2613. /*
  2614. * Hardlinks are often used in delicate situations. We avoid
  2615. * security-related surprises by not following symlinks on the
  2616. * newname. --KAB
  2617. *
  2618. * We don't follow them on the oldname either to be compatible
  2619. * with linux 2.0, and to avoid hard-linking to directories
  2620. * and other special files. --ADM
  2621. */
  2622. SYSCALL_DEFINE5(linkat, int, olddfd, const char __user *, oldname,
  2623. int, newdfd, const char __user *, newname, int, flags)
  2624. {
  2625. struct dentry *new_dentry;
  2626. struct nameidata nd;
  2627. struct path old_path;
  2628. int error;
  2629. char *to;
  2630. if ((flags & ~AT_SYMLINK_FOLLOW) != 0)
  2631. return -EINVAL;
  2632. error = user_path_at(olddfd, oldname,
  2633. flags & AT_SYMLINK_FOLLOW ? LOOKUP_FOLLOW : 0,
  2634. &old_path);
  2635. if (error)
  2636. return error;
  2637. error = user_path_parent(newdfd, newname, &nd, &to);
  2638. if (error)
  2639. goto out;
  2640. error = -EXDEV;
  2641. if (old_path.mnt != nd.path.mnt)
  2642. goto out_release;
  2643. new_dentry = lookup_create(&nd, 0);
  2644. error = PTR_ERR(new_dentry);
  2645. if (IS_ERR(new_dentry))
  2646. goto out_unlock;
  2647. error = mnt_want_write(nd.path.mnt);
  2648. if (error)
  2649. goto out_dput;
  2650. error = security_path_link(old_path.dentry, &nd.path, new_dentry);
  2651. if (error)
  2652. goto out_drop_write;
  2653. error = vfs_link(old_path.dentry, nd.path.dentry->d_inode, new_dentry);
  2654. out_drop_write:
  2655. mnt_drop_write(nd.path.mnt);
  2656. out_dput:
  2657. dput(new_dentry);
  2658. out_unlock:
  2659. mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
  2660. out_release:
  2661. path_put(&nd.path);
  2662. putname(to);
  2663. out:
  2664. path_put(&old_path);
  2665. return error;
  2666. }
  2667. SYSCALL_DEFINE2(link, const char __user *, oldname, const char __user *, newname)
  2668. {
  2669. return sys_linkat(AT_FDCWD, oldname, AT_FDCWD, newname, 0);
  2670. }
  2671. /*
  2672. * The worst of all namespace operations - renaming directory. "Perverted"
  2673. * doesn't even start to describe it. Somebody in UCB had a heck of a trip...
  2674. * Problems:
  2675. * a) we can get into loop creation. Check is done in is_subdir().
  2676. * b) race potential - two innocent renames can create a loop together.
  2677. * That's where 4.4 screws up. Current fix: serialization on
  2678. * sb->s_vfs_rename_mutex. We might be more accurate, but that's another
  2679. * story.
  2680. * c) we have to lock _three_ objects - parents and victim (if it exists).
  2681. * And that - after we got ->i_mutex on parents (until then we don't know
  2682. * whether the target exists). Solution: try to be smart with locking
  2683. * order for inodes. We rely on the fact that tree topology may change
  2684. * only under ->s_vfs_rename_mutex _and_ that parent of the object we
  2685. * move will be locked. Thus we can rank directories by the tree
  2686. * (ancestors first) and rank all non-directories after them.
  2687. * That works since everybody except rename does "lock parent, lookup,
  2688. * lock child" and rename is under ->s_vfs_rename_mutex.
  2689. * HOWEVER, it relies on the assumption that any object with ->lookup()
  2690. * has no more than 1 dentry. If "hybrid" objects will ever appear,
  2691. * we'd better make sure that there's no link(2) for them.
  2692. * d) some filesystems don't support opened-but-unlinked directories,
  2693. * either because of layout or because they are not ready to deal with
  2694. * all cases correctly. The latter will be fixed (taking this sort of
  2695. * stuff into VFS), but the former is not going away. Solution: the same
  2696. * trick as in rmdir().
  2697. * e) conversion from fhandle to dentry may come in the wrong moment - when
  2698. * we are removing the target. Solution: we will have to grab ->i_mutex
  2699. * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on
  2700. * ->i_mutex on parents, which works but leads to some truly excessive
  2701. * locking].
  2702. */
  2703. static int vfs_rename_dir(struct inode *old_dir, struct dentry *old_dentry,
  2704. struct inode *new_dir, struct dentry *new_dentry)
  2705. {
  2706. int error = 0;
  2707. struct inode *target;
  2708. /*
  2709. * If we are going to change the parent - check write permissions,
  2710. * we'll need to flip '..'.
  2711. */
  2712. if (new_dir != old_dir) {
  2713. error = inode_permission(old_dentry->d_inode, MAY_WRITE);
  2714. if (error)
  2715. return error;
  2716. }
  2717. error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
  2718. if (error)
  2719. return error;
  2720. target = new_dentry->d_inode;
  2721. if (target)
  2722. mutex_lock(&target->i_mutex);
  2723. if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
  2724. error = -EBUSY;
  2725. else {
  2726. if (target)
  2727. dentry_unhash(new_dentry);
  2728. error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
  2729. }
  2730. if (target) {
  2731. if (!error) {
  2732. target->i_flags |= S_DEAD;
  2733. dont_mount(new_dentry);
  2734. }
  2735. mutex_unlock(&target->i_mutex);
  2736. if (d_unhashed(new_dentry))
  2737. d_rehash(new_dentry);
  2738. dput(new_dentry);
  2739. }
  2740. if (!error)
  2741. if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
  2742. d_move(old_dentry,new_dentry);
  2743. return error;
  2744. }
  2745. static int vfs_rename_other(struct inode *old_dir, struct dentry *old_dentry,
  2746. struct inode *new_dir, struct dentry *new_dentry)
  2747. {
  2748. struct inode *target;
  2749. int error;
  2750. error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
  2751. if (error)
  2752. return error;
  2753. dget(new_dentry);
  2754. target = new_dentry->d_inode;
  2755. if (target)
  2756. mutex_lock(&target->i_mutex);
  2757. if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
  2758. error = -EBUSY;
  2759. else
  2760. error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
  2761. if (!error) {
  2762. if (target)
  2763. dont_mount(new_dentry);
  2764. if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
  2765. d_move(old_dentry, new_dentry);
  2766. }
  2767. if (target)
  2768. mutex_unlock(&target->i_mutex);
  2769. dput(new_dentry);
  2770. return error;
  2771. }
  2772. int vfs_rename(struct inode *old_dir, struct dentry *old_dentry,
  2773. struct inode *new_dir, struct dentry *new_dentry)
  2774. {
  2775. int error;
  2776. int is_dir = S_ISDIR(old_dentry->d_inode->i_mode);
  2777. const unsigned char *old_name;
  2778. if (old_dentry->d_inode == new_dentry->d_inode)
  2779. return 0;
  2780. error = may_delete(old_dir, old_dentry, is_dir);
  2781. if (error)
  2782. return error;
  2783. if (!new_dentry->d_inode)
  2784. error = may_create(new_dir, new_dentry);
  2785. else
  2786. error = may_delete(new_dir, new_dentry, is_dir);
  2787. if (error)
  2788. return error;
  2789. if (!old_dir->i_op->rename)
  2790. return -EPERM;
  2791. old_name = fsnotify_oldname_init(old_dentry->d_name.name);
  2792. if (is_dir)
  2793. error = vfs_rename_dir(old_dir,old_dentry,new_dir,new_dentry);
  2794. else
  2795. error = vfs_rename_other(old_dir,old_dentry,new_dir,new_dentry);
  2796. if (!error)
  2797. fsnotify_move(old_dir, new_dir, old_name, is_dir,
  2798. new_dentry->d_inode, old_dentry);
  2799. fsnotify_oldname_free(old_name);
  2800. return error;
  2801. }
  2802. SYSCALL_DEFINE4(renameat, int, olddfd, const char __user *, oldname,
  2803. int, newdfd, const char __user *, newname)
  2804. {
  2805. struct dentry *old_dir, *new_dir;
  2806. struct dentry *old_dentry, *new_dentry;
  2807. struct dentry *trap;
  2808. struct nameidata oldnd, newnd;
  2809. char *from;
  2810. char *to;
  2811. int error;
  2812. error = user_path_parent(olddfd, oldname, &oldnd, &from);
  2813. if (error)
  2814. goto exit;
  2815. error = user_path_parent(newdfd, newname, &newnd, &to);
  2816. if (error)
  2817. goto exit1;
  2818. error = -EXDEV;
  2819. if (oldnd.path.mnt != newnd.path.mnt)
  2820. goto exit2;
  2821. old_dir = oldnd.path.dentry;
  2822. error = -EBUSY;
  2823. if (oldnd.last_type != LAST_NORM)
  2824. goto exit2;
  2825. new_dir = newnd.path.dentry;
  2826. if (newnd.last_type != LAST_NORM)
  2827. goto exit2;
  2828. oldnd.flags &= ~LOOKUP_PARENT;
  2829. newnd.flags &= ~LOOKUP_PARENT;
  2830. newnd.flags |= LOOKUP_RENAME_TARGET;
  2831. trap = lock_rename(new_dir, old_dir);
  2832. old_dentry = lookup_hash(&oldnd);
  2833. error = PTR_ERR(old_dentry);
  2834. if (IS_ERR(old_dentry))
  2835. goto exit3;
  2836. /* source must exist */
  2837. error = -ENOENT;
  2838. if (!old_dentry->d_inode)
  2839. goto exit4;
  2840. /* unless the source is a directory trailing slashes give -ENOTDIR */
  2841. if (!S_ISDIR(old_dentry->d_inode->i_mode)) {
  2842. error = -ENOTDIR;
  2843. if (oldnd.last.name[oldnd.last.len])
  2844. goto exit4;
  2845. if (newnd.last.name[newnd.last.len])
  2846. goto exit4;
  2847. }
  2848. /* source should not be ancestor of target */
  2849. error = -EINVAL;
  2850. if (old_dentry == trap)
  2851. goto exit4;
  2852. new_dentry = lookup_hash(&newnd);
  2853. error = PTR_ERR(new_dentry);
  2854. if (IS_ERR(new_dentry))
  2855. goto exit4;
  2856. /* target should not be an ancestor of source */
  2857. error = -ENOTEMPTY;
  2858. if (new_dentry == trap)
  2859. goto exit5;
  2860. error = mnt_want_write(oldnd.path.mnt);
  2861. if (error)
  2862. goto exit5;
  2863. error = security_path_rename(&oldnd.path, old_dentry,
  2864. &newnd.path, new_dentry);
  2865. if (error)
  2866. goto exit6;
  2867. error = vfs_rename(old_dir->d_inode, old_dentry,
  2868. new_dir->d_inode, new_dentry);
  2869. exit6:
  2870. mnt_drop_write(oldnd.path.mnt);
  2871. exit5:
  2872. dput(new_dentry);
  2873. exit4:
  2874. dput(old_dentry);
  2875. exit3:
  2876. unlock_rename(new_dir, old_dir);
  2877. exit2:
  2878. path_put(&newnd.path);
  2879. putname(to);
  2880. exit1:
  2881. path_put(&oldnd.path);
  2882. putname(from);
  2883. exit:
  2884. return error;
  2885. }
  2886. SYSCALL_DEFINE2(rename, const char __user *, oldname, const char __user *, newname)
  2887. {
  2888. return sys_renameat(AT_FDCWD, oldname, AT_FDCWD, newname);
  2889. }
  2890. int vfs_readlink(struct dentry *dentry, char __user *buffer, int buflen, const char *link)
  2891. {
  2892. int len;
  2893. len = PTR_ERR(link);
  2894. if (IS_ERR(link))
  2895. goto out;
  2896. len = strlen(link);
  2897. if (len > (unsigned) buflen)
  2898. len = buflen;
  2899. if (copy_to_user(buffer, link, len))
  2900. len = -EFAULT;
  2901. out:
  2902. return len;
  2903. }
  2904. /*
  2905. * A helper for ->readlink(). This should be used *ONLY* for symlinks that
  2906. * have ->follow_link() touching nd only in nd_set_link(). Using (or not
  2907. * using) it for any given inode is up to filesystem.
  2908. */
  2909. int generic_readlink(struct dentry *dentry, char __user *buffer, int buflen)
  2910. {
  2911. struct nameidata nd;
  2912. void *cookie;
  2913. int res;
  2914. nd.depth = 0;
  2915. cookie = dentry->d_inode->i_op->follow_link(dentry, &nd);
  2916. if (IS_ERR(cookie))
  2917. return PTR_ERR(cookie);
  2918. res = vfs_readlink(dentry, buffer, buflen, nd_get_link(&nd));
  2919. if (dentry->d_inode->i_op->put_link)
  2920. dentry->d_inode->i_op->put_link(dentry, &nd, cookie);
  2921. return res;
  2922. }
  2923. int vfs_follow_link(struct nameidata *nd, const char *link)
  2924. {
  2925. return __vfs_follow_link(nd, link);
  2926. }
  2927. /* get the link contents into pagecache */
  2928. static char *page_getlink(struct dentry * dentry, struct page **ppage)
  2929. {
  2930. char *kaddr;
  2931. struct page *page;
  2932. struct address_space *mapping = dentry->d_inode->i_mapping;
  2933. page = read_mapping_page(mapping, 0, NULL);
  2934. if (IS_ERR(page))
  2935. return (char*)page;
  2936. *ppage = page;
  2937. kaddr = kmap(page);
  2938. nd_terminate_link(kaddr, dentry->d_inode->i_size, PAGE_SIZE - 1);
  2939. return kaddr;
  2940. }
  2941. int page_readlink(struct dentry *dentry, char __user *buffer, int buflen)
  2942. {
  2943. struct page *page = NULL;
  2944. char *s = page_getlink(dentry, &page);
  2945. int res = vfs_readlink(dentry,buffer,buflen,s);
  2946. if (page) {
  2947. kunmap(page);
  2948. page_cache_release(page);
  2949. }
  2950. return res;
  2951. }
  2952. void *page_follow_link_light(struct dentry *dentry, struct nameidata *nd)
  2953. {
  2954. struct page *page = NULL;
  2955. nd_set_link(nd, page_getlink(dentry, &page));
  2956. return page;
  2957. }
  2958. void page_put_link(struct dentry *dentry, struct nameidata *nd, void *cookie)
  2959. {
  2960. struct page *page = cookie;
  2961. if (page) {
  2962. kunmap(page);
  2963. page_cache_release(page);
  2964. }
  2965. }
  2966. /*
  2967. * The nofs argument instructs pagecache_write_begin to pass AOP_FLAG_NOFS
  2968. */
  2969. int __page_symlink(struct inode *inode, const char *symname, int len, int nofs)
  2970. {
  2971. struct address_space *mapping = inode->i_mapping;
  2972. struct page *page;
  2973. void *fsdata;
  2974. int err;
  2975. char *kaddr;
  2976. unsigned int flags = AOP_FLAG_UNINTERRUPTIBLE;
  2977. if (nofs)
  2978. flags |= AOP_FLAG_NOFS;
  2979. retry:
  2980. err = pagecache_write_begin(NULL, mapping, 0, len-1,
  2981. flags, &page, &fsdata);
  2982. if (err)
  2983. goto fail;
  2984. kaddr = kmap_atomic(page, KM_USER0);
  2985. memcpy(kaddr, symname, len-1);
  2986. kunmap_atomic(kaddr, KM_USER0);
  2987. err = pagecache_write_end(NULL, mapping, 0, len-1, len-1,
  2988. page, fsdata);
  2989. if (err < 0)
  2990. goto fail;
  2991. if (err < len-1)
  2992. goto retry;
  2993. mark_inode_dirty(inode);
  2994. return 0;
  2995. fail:
  2996. return err;
  2997. }
  2998. int page_symlink(struct inode *inode, const char *symname, int len)
  2999. {
  3000. return __page_symlink(inode, symname, len,
  3001. !(mapping_gfp_mask(inode->i_mapping) & __GFP_FS));
  3002. }
  3003. const struct inode_operations page_symlink_inode_operations = {
  3004. .readlink = generic_readlink,
  3005. .follow_link = page_follow_link_light,
  3006. .put_link = page_put_link,
  3007. };
  3008. EXPORT_SYMBOL(user_path_at);
  3009. EXPORT_SYMBOL(follow_down);
  3010. EXPORT_SYMBOL(follow_up);
  3011. EXPORT_SYMBOL(get_write_access); /* binfmt_aout */
  3012. EXPORT_SYMBOL(getname);
  3013. EXPORT_SYMBOL(lock_rename);
  3014. EXPORT_SYMBOL(lookup_one_len);
  3015. EXPORT_SYMBOL(page_follow_link_light);
  3016. EXPORT_SYMBOL(page_put_link);
  3017. EXPORT_SYMBOL(page_readlink);
  3018. EXPORT_SYMBOL(__page_symlink);
  3019. EXPORT_SYMBOL(page_symlink);
  3020. EXPORT_SYMBOL(page_symlink_inode_operations);
  3021. EXPORT_SYMBOL(path_lookup);
  3022. EXPORT_SYMBOL(kern_path);
  3023. EXPORT_SYMBOL(vfs_path_lookup);
  3024. EXPORT_SYMBOL(inode_permission);
  3025. EXPORT_SYMBOL(file_permission);
  3026. EXPORT_SYMBOL(unlock_rename);
  3027. EXPORT_SYMBOL(vfs_create);
  3028. EXPORT_SYMBOL(vfs_follow_link);
  3029. EXPORT_SYMBOL(vfs_link);
  3030. EXPORT_SYMBOL(vfs_mkdir);
  3031. EXPORT_SYMBOL(vfs_mknod);
  3032. EXPORT_SYMBOL(generic_permission);
  3033. EXPORT_SYMBOL(vfs_readlink);
  3034. EXPORT_SYMBOL(vfs_rename);
  3035. EXPORT_SYMBOL(vfs_rmdir);
  3036. EXPORT_SYMBOL(vfs_symlink);
  3037. EXPORT_SYMBOL(vfs_unlink);
  3038. EXPORT_SYMBOL(dentry_unhash);
  3039. EXPORT_SYMBOL(generic_readlink);