namei.c 71 KB

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