projects / GitHub / mt8127 / android_kernel_alcatel_ttab.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
untangling do_lookup() - merge d_alloc_and_lookup() callers
[GitHub/mt8127/android_kernel_alcatel_ttab.git] / fs / namei.c
CommitLineData
1da177e4
LT		 1/*
2 * linux/fs/namei.c
3 *
4 * Copyright (C) 1991, 1992 Linus Torvalds
5 */
6
7/*
8 * Some corrections by tytso.
9 */
10
11/* [Feb 1997 T. Schoebel-Theuer] Complete rewrite of the pathname
12 * lookup logic.
13 */
14/* [Feb-Apr 2000, AV] Rewrite to the new namespace architecture.
15 */
16
17#include <linux/init.h>
630d9c47 18#include <linux/export.h>
1da177e4
LT		 19#include <linux/slab.h>
20#include <linux/fs.h>
21#include <linux/namei.h>
1da177e4 22#include <linux/pagemap.h>
0eeca283 23#include <linux/fsnotify.h>
1da177e4
LT		 24#include <linux/personality.h>
25#include <linux/security.h>
6146f0d5 26#include <linux/ima.h>
1da177e4
LT		 27#include <linux/syscalls.h>
28#include <linux/mount.h>
29#include <linux/audit.h>
16f7e0fe 30#include <linux/capability.h>
834f2a4a 31#include <linux/file.h>
5590ff0d 32#include <linux/fcntl.h>
08ce5f16 33#include <linux/device_cgroup.h>
5ad4e53b 34#include <linux/fs_struct.h>
e77819e5 35#include <linux/posix_acl.h>
1da177e4
LT		 36#include <asm/uaccess.h>
37
e81e3f4d 38#include "internal.h"
c7105365 39#include "mount.h"
e81e3f4d 40
1da177e4
LT		 41/* [Feb-1997 T. Schoebel-Theuer]
42 * Fundamental changes in the pathname lookup mechanisms (namei)
43 * were necessary because of omirr. The reason is that omirr needs
44 * to know the _real_ pathname, not the user-supplied one, in case
45 * of symlinks (and also when transname replacements occur).
46 *
47 * The new code replaces the old recursive symlink resolution with
48 * an iterative one (in case of non-nested symlink chains). It does
49 * this with calls to <fs>_follow_link().
50 * As a side effect, dir_namei(), _namei() and follow_link() are now
51 * replaced with a single function lookup_dentry() that can handle all
52 * the special cases of the former code.
53 *
54 * With the new dcache, the pathname is stored at each inode, at least as
55 * long as the refcount of the inode is positive. As a side effect, the
56 * size of the dcache depends on the inode cache and thus is dynamic.
57 *
58 * [29-Apr-1998 C. Scott Ananian] Updated above description of symlink
59 * resolution to correspond with current state of the code.
60 *
61 * Note that the symlink resolution is not *completely* iterative.
62 * There is still a significant amount of tail- and mid- recursion in
63 * the algorithm. Also, note that <fs>_readlink() is not used in
64 * lookup_dentry(): lookup_dentry() on the result of <fs>_readlink()
65 * may return different results than <fs>_follow_link(). Many virtual
66 * filesystems (including /proc) exhibit this behavior.
67 */
68
69/* [24-Feb-97 T. Schoebel-Theuer] Side effects caused by new implementation:
70 * New symlink semantics: when open() is called with flags O_CREAT | O_EXCL
71 * and the name already exists in form of a symlink, try to create the new
72 * name indicated by the symlink. The old code always complained that the
73 * name already exists, due to not following the symlink even if its target
74 * is nonexistent. The new semantics affects also mknod() and link() when
25985edc 75 * the name is a symlink pointing to a non-existent name.
1da177e4
LT		 76 *
77 * I don't know which semantics is the right one, since I have no access
78 * to standards. But I found by trial that HP-UX 9.0 has the full "new"
79 * semantics implemented, while SunOS 4.1.1 and Solaris (SunOS 5.4) have the
80 * "old" one. Personally, I think the new semantics is much more logical.
81 * Note that "ln old new" where "new" is a symlink pointing to a non-existing
82 * file does succeed in both HP-UX and SunOs, but not in Solaris
83 * and in the old Linux semantics.
84 */
85
86/* [16-Dec-97 Kevin Buhr] For security reasons, we change some symlink
87 * semantics. See the comments in "open_namei" and "do_link" below.
88 *
89 * [10-Sep-98 Alan Modra] Another symlink change.
90 */
91
92/* [Feb-Apr 2000 AV] Complete rewrite. Rules for symlinks:
93 * inside the path - always follow.
94 * in the last component in creation/removal/renaming - never follow.
95 * if LOOKUP_FOLLOW passed - follow.
96 * if the pathname has trailing slashes - follow.
97 * otherwise - don't follow.
98 * (applied in that order).
99 *
100 * [Jun 2000 AV] Inconsistent behaviour of open() in case if flags==O_CREAT
101 * restored for 2.4. This is the last surviving part of old 4.2BSD bug.
102 * During the 2.4 we need to fix the userland stuff depending on it -
103 * hopefully we will be able to get rid of that wart in 2.5. So far only
104 * XEmacs seems to be relying on it...
105 */
106/*
107 * [Sep 2001 AV] Single-semaphore locking scheme (kudos to David Holland)
a11f3a05 108 * implemented. Let's see if raised priority of ->s_vfs_rename_mutex gives
1da177e4
LT		 109 * any extra contention...
110 */
111
112/* In order to reduce some races, while at the same time doing additional
113 * checking and hopefully speeding things up, we copy filenames to the
114 * kernel data space before using them..
115 *
116 * POSIX.1 2.4: an empty pathname is invalid (ENOENT).
117 * PATH_MAX includes the nul terminator --RR.
118 */
858119e1 119static int do_getname(const char __user *filename, char *page)
1da177e4
LT		 120{
121 int retval;
122 unsigned long len = PATH_MAX;
123
124 if (!segment_eq(get_fs(), KERNEL_DS)) {
125 if ((unsigned long) filename >= TASK_SIZE)
126 return -EFAULT;
127 if (TASK_SIZE - (unsigned long) filename < PATH_MAX)
128 len = TASK_SIZE - (unsigned long) filename;
129 }
130
131 retval = strncpy_from_user(page, filename, len);
132 if (retval > 0) {
133 if (retval < len)
134 return 0;
135 return -ENAMETOOLONG;
136 } else if (!retval)
137 retval = -ENOENT;
138 return retval;
139}
140
1fa1e7f6 141static char *getname_flags(const char __user *filename, int flags, int *empty)
1da177e4 142{
4043cde8
EP		 143 char *result = __getname();
144 int retval;
145
146 if (!result)
147 return ERR_PTR(-ENOMEM);
148
149 retval = do_getname(filename, result);
150 if (retval < 0) {
151 if (retval == -ENOENT && empty)
152 *empty = 1;
153 if (retval != -ENOENT || !(flags & LOOKUP_EMPTY)) {
154 __putname(result);
155 return ERR_PTR(retval);
1da177e4
LT		 156 }
157 }
158 audit_getname(result);
159 return result;
160}
161
f52e0c11
AV		 162char *getname(const char __user * filename)
163{
f7493e5d 164 return getname_flags(filename, 0, NULL);
f52e0c11
AV		 165}
166
1da177e4
LT		 167#ifdef CONFIG_AUDITSYSCALL
168void putname(const char *name)
169{
5ac3a9c2 170 if (unlikely(!audit_dummy_context()))
1da177e4
LT		 171 audit_putname(name);
172 else
173 __putname(name);
174}
175EXPORT_SYMBOL(putname);
176#endif
177
e77819e5
LT		 178static int check_acl(struct inode *inode, int mask)
179{
84635d68 180#ifdef CONFIG_FS_POSIX_ACL
e77819e5
LT		 181 struct posix_acl *acl;
182
e77819e5 183 if (mask & MAY_NOT_BLOCK) {
3567866b
AV		 184 acl = get_cached_acl_rcu(inode, ACL_TYPE_ACCESS);
185 if (!acl)
e77819e5 186 return -EAGAIN;
3567866b
AV		 187 /* no ->get_acl() calls in RCU mode... */
188 if (acl == ACL_NOT_CACHED)
189 return -ECHILD;
206b1d09 190 return posix_acl_permission(inode, acl, mask & ~MAY_NOT_BLOCK);
e77819e5
LT		 191 }
192
193 acl = get_cached_acl(inode, ACL_TYPE_ACCESS);
194
195 /*
4e34e719
CH		 196 * A filesystem can force a ACL callback by just never filling the
197 * ACL cache. But normally you'd fill the cache either at inode
198 * instantiation time, or on the first ->get_acl call.
e77819e5 199 *
4e34e719
CH		 200 * If the filesystem doesn't have a get_acl() function at all, we'll
201 * just create the negative cache entry.
e77819e5
LT		 202 */
203 if (acl == ACL_NOT_CACHED) {
4e34e719
CH		 204 if (inode->i_op->get_acl) {
205 acl = inode->i_op->get_acl(inode, ACL_TYPE_ACCESS);
206 if (IS_ERR(acl))
207 return PTR_ERR(acl);
208 } else {
209 set_cached_acl(inode, ACL_TYPE_ACCESS, NULL);
210 return -EAGAIN;
211 }
e77819e5
LT		 212 }
213
214 if (acl) {
215 int error = posix_acl_permission(inode, acl, mask);
216 posix_acl_release(acl);
217 return error;
218 }
84635d68 219#endif
e77819e5
LT		 220
221 return -EAGAIN;
222}
223
5909ccaa 224/*
948409c7 225 * This does the basic permission checking
1da177e4 226 */
7e40145e 227static int acl_permission_check(struct inode *inode, int mask)
1da177e4 228{
26cf46be 229 unsigned int mode = inode->i_mode;
1da177e4 230
e795b717
SH		 231 if (current_user_ns() != inode_userns(inode))
232 goto other_perms;
233
14067ff5 234 if (likely(current_fsuid() == inode->i_uid))
1da177e4
LT		 235 mode >>= 6;
236 else {
e77819e5 237 if (IS_POSIXACL(inode) && (mode & S_IRWXG)) {
7e40145e 238 int error = check_acl(inode, mask);
b74c79e9
NP		 239 if (error != -EAGAIN)
240 return error;
1da177e4
LT		 241 }
242
243 if (in_group_p(inode->i_gid))
244 mode >>= 3;
245 }
246
e795b717 247other_perms:
1da177e4
LT		 248 /*
249 * If the DACs are ok we don't need any capability check.
250 */
9c2c7039 251 if ((mask & ~mode & (MAY_READ | MAY_WRITE | MAY_EXEC)) == 0)
1da177e4 252 return 0;
5909ccaa
LT		 253 return -EACCES;
254}
255
256/**
b74c79e9 257 * generic_permission - check for access rights on a Posix-like filesystem
5909ccaa 258 * @inode: inode to check access rights for
8fd90c8d 259 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC, ...)
5909ccaa
LT		 260 *
261 * Used to check for read/write/execute permissions on a file.
262 * We use "fsuid" for this, letting us set arbitrary permissions
263 * for filesystem access without changing the "normal" uids which
b74c79e9
NP		 264 * are used for other things.
265 *
266 * generic_permission is rcu-walk aware. It returns -ECHILD in case an rcu-walk
267 * request cannot be satisfied (eg. requires blocking or too much complexity).
268 * It would then be called again in ref-walk mode.
5909ccaa 269 */
2830ba7f 270int generic_permission(struct inode *inode, int mask)
5909ccaa
LT		 271{
272 int ret;
273
274 /*
948409c7 275 * Do the basic permission checks.
5909ccaa 276 */
7e40145e 277 ret = acl_permission_check(inode, mask);
5909ccaa
LT		 278 if (ret != -EACCES)
279 return ret;
1da177e4 280
d594e7ec
AV		 281 if (S_ISDIR(inode->i_mode)) {
282 /* DACs are overridable for directories */
283 if (ns_capable(inode_userns(inode), CAP_DAC_OVERRIDE))
284 return 0;
285 if (!(mask & MAY_WRITE))
286 if (ns_capable(inode_userns(inode), CAP_DAC_READ_SEARCH))
287 return 0;
288 return -EACCES;
289 }
1da177e4
LT		 290 /*
291 * Read/write DACs are always overridable.
d594e7ec
AV		 292 * Executable DACs are overridable when there is
293 * at least one exec bit set.
1da177e4 294 */
d594e7ec 295 if (!(mask & MAY_EXEC) || (inode->i_mode & S_IXUGO))
e795b717 296 if (ns_capable(inode_userns(inode), CAP_DAC_OVERRIDE))
1da177e4
LT		 297 return 0;
298
299 /*
300 * Searching includes executable on directories, else just read.
301 */
7ea66001 302 mask &= MAY_READ | MAY_WRITE | MAY_EXEC;
d594e7ec 303 if (mask == MAY_READ)
e795b717 304 if (ns_capable(inode_userns(inode), CAP_DAC_READ_SEARCH))
1da177e4
LT		 305 return 0;
306
307 return -EACCES;
308}
309
3ddcd056
LT		 310/*
311 * We _really_ want to just do "generic_permission()" without
312 * even looking at the inode->i_op values. So we keep a cache
313 * flag in inode->i_opflags, that says "this has not special
314 * permission function, use the fast case".
315 */
316static inline int do_inode_permission(struct inode *inode, int mask)
317{
318 if (unlikely(!(inode->i_opflags & IOP_FASTPERM))) {
319 if (likely(inode->i_op->permission))
320 return inode->i_op->permission(inode, mask);
321
322 /* This gets set once for the inode lifetime */
323 spin_lock(&inode->i_lock);
324 inode->i_opflags |= IOP_FASTPERM;
325 spin_unlock(&inode->i_lock);
326 }
327 return generic_permission(inode, mask);
328}
329
cb23beb5
CH		 330/**
331 * inode_permission - check for access rights to a given inode
332 * @inode: inode to check permission on
8fd90c8d 333 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC, ...)
cb23beb5
CH		 334 *
335 * Used to check for read/write/execute permissions on an inode.
336 * We use "fsuid" for this, letting us set arbitrary permissions
337 * for filesystem access without changing the "normal" uids which
338 * are used for other things.
948409c7
AG		 339 *
340 * When checking for MAY_APPEND, MAY_WRITE must also be set in @mask.
cb23beb5 341 */
f419a2e3 342int inode_permission(struct inode *inode, int mask)
1da177e4 343{
e6305c43 344 int retval;
1da177e4 345
3ddcd056 346 if (unlikely(mask & MAY_WRITE)) {
22590e41 347 umode_t mode = inode->i_mode;
1da177e4
LT		 348
349 /*
350 * Nobody gets write access to a read-only fs.
351 */
352 if (IS_RDONLY(inode) &&
353 (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode)))
354 return -EROFS;
355
356 /*
357 * Nobody gets write access to an immutable file.
358 */
359 if (IS_IMMUTABLE(inode))
360 return -EACCES;
361 }
362
3ddcd056 363 retval = do_inode_permission(inode, mask);
1da177e4
LT		 364 if (retval)
365 return retval;
366
08ce5f16
SH		 367 retval = devcgroup_inode_permission(inode, mask);
368 if (retval)
369 return retval;
370
d09ca739 371 return security_inode_permission(inode, mask);
1da177e4
LT		 372}
373
5dd784d0
JB		 374/**
375 * path_get - get a reference to a path
376 * @path: path to get the reference to
377 *
378 * Given a path increment the reference count to the dentry and the vfsmount.
379 */
380void path_get(struct path *path)
381{
382 mntget(path->mnt);
383 dget(path->dentry);
384}
385EXPORT_SYMBOL(path_get);
386
1d957f9b
JB		 387/**
388 * path_put - put a reference to a path
389 * @path: path to put the reference to
390 *
391 * Given a path decrement the reference count to the dentry and the vfsmount.
392 */
393void path_put(struct path *path)
1da177e4 394{
1d957f9b
JB		 395 dput(path->dentry);
396 mntput(path->mnt);
1da177e4 397}
1d957f9b 398EXPORT_SYMBOL(path_put);
1da177e4 399
19660af7 400/*
31e6b01f 401 * Path walking has 2 modes, rcu-walk and ref-walk (see
19660af7
AV		 402 * Documentation/filesystems/path-lookup.txt). In situations when we can't
403 * continue in RCU mode, we attempt to drop out of rcu-walk mode and grab
404 * normal reference counts on dentries and vfsmounts to transition to rcu-walk
405 * mode. Refcounts are grabbed at the last known good point before rcu-walk
406 * got stuck, so ref-walk may continue from there. If this is not successful
407 * (eg. a seqcount has changed), then failure is returned and it's up to caller
408 * to restart the path walk from the beginning in ref-walk mode.
31e6b01f 409 */
31e6b01f
NP		 410
411/**
19660af7
AV		 412 * unlazy_walk - try to switch to ref-walk mode.
413 * @nd: nameidata pathwalk data
414 * @dentry: child of nd->path.dentry or NULL
39191628 415 * Returns: 0 on success, -ECHILD on failure
31e6b01f 416 *
19660af7
AV		 417 * unlazy_walk attempts to legitimize the current nd->path, nd->root and dentry
418 * for ref-walk mode. @dentry must be a path found by a do_lookup call on
419 * @nd or NULL. Must be called from rcu-walk context.
31e6b01f 420 */
19660af7 421static int unlazy_walk(struct nameidata *nd, struct dentry *dentry)
31e6b01f
NP		 422{
423 struct fs_struct *fs = current->fs;
424 struct dentry *parent = nd->path.dentry;
5b6ca027 425 int want_root = 0;
31e6b01f
NP		 426
427 BUG_ON(!(nd->flags & LOOKUP_RCU));
5b6ca027
AV		 428 if (nd->root.mnt && !(nd->flags & LOOKUP_ROOT)) {
429 want_root = 1;
31e6b01f
NP		 430 spin_lock(&fs->lock);
431 if (nd->root.mnt != fs->root.mnt ||
432 nd->root.dentry != fs->root.dentry)
433 goto err_root;
434 }
435 spin_lock(&parent->d_lock);
19660af7
AV		 436 if (!dentry) {
437 if (!__d_rcu_to_refcount(parent, nd->seq))
438 goto err_parent;
439 BUG_ON(nd->inode != parent->d_inode);
440 } else {
94c0d4ec
AV		 441 if (dentry->d_parent != parent)
442 goto err_parent;
19660af7
AV		 443 spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
444 if (!__d_rcu_to_refcount(dentry, nd->seq))
445 goto err_child;
446 /*
447 * If the sequence check on the child dentry passed, then
448 * the child has not been removed from its parent. This
449 * means the parent dentry must be valid and able to take
450 * a reference at this point.
451 */
452 BUG_ON(!IS_ROOT(dentry) && dentry->d_parent != parent);
453 BUG_ON(!parent->d_count);
454 parent->d_count++;
455 spin_unlock(&dentry->d_lock);
456 }
31e6b01f 457 spin_unlock(&parent->d_lock);
5b6ca027 458 if (want_root) {
31e6b01f
NP		 459 path_get(&nd->root);
460 spin_unlock(&fs->lock);
461 }
462 mntget(nd->path.mnt);
463
464 rcu_read_unlock();
465 br_read_unlock(vfsmount_lock);
466 nd->flags &= ~LOOKUP_RCU;
467 return 0;
19660af7
AV		 468
469err_child:
31e6b01f 470 spin_unlock(&dentry->d_lock);
19660af7 471err_parent:
31e6b01f
NP		 472 spin_unlock(&parent->d_lock);
473err_root:
5b6ca027 474 if (want_root)
31e6b01f
NP		 475 spin_unlock(&fs->lock);
476 return -ECHILD;
477}
478
834f2a4a
TM		 479/**
480 * release_open_intent - free up open intent resources
481 * @nd: pointer to nameidata
482 */
483void release_open_intent(struct nameidata *nd)
484{
2dab5974
LT		 485 struct file *file = nd->intent.open.file;
486
487 if (file && !IS_ERR(file)) {
488 if (file->f_path.dentry == NULL)
489 put_filp(file);
490 else
491 fput(file);
492 }
834f2a4a
TM		 493}
494
f60aef7e 495static inline int d_revalidate(struct dentry *dentry, struct nameidata *nd)
34286d66 496{
f60aef7e 497 return dentry->d_op->d_revalidate(dentry, nd);
34286d66
NP		 498}
499
9f1fafee
AV		 500/**
501 * complete_walk - successful completion of path walk
502 * @nd: pointer nameidata
39159de2 503 *
9f1fafee
AV		 504 * If we had been in RCU mode, drop out of it and legitimize nd->path.
505 * Revalidate the final result, unless we'd already done that during
506 * the path walk or the filesystem doesn't ask for it. Return 0 on
507 * success, -error on failure. In case of failure caller does not
508 * need to drop nd->path.
39159de2 509 */
9f1fafee 510static int complete_walk(struct nameidata *nd)
39159de2 511{
16c2cd71 512 struct dentry *dentry = nd->path.dentry;
39159de2 513 int status;
39159de2 514
9f1fafee
AV		 515 if (nd->flags & LOOKUP_RCU) {
516 nd->flags &= ~LOOKUP_RCU;
517 if (!(nd->flags & LOOKUP_ROOT))
518 nd->root.mnt = NULL;
519 spin_lock(&dentry->d_lock);
520 if (unlikely(!__d_rcu_to_refcount(dentry, nd->seq))) {
521 spin_unlock(&dentry->d_lock);
522 rcu_read_unlock();
523 br_read_unlock(vfsmount_lock);
524 return -ECHILD;
525 }
526 BUG_ON(nd->inode != dentry->d_inode);
527 spin_unlock(&dentry->d_lock);
528 mntget(nd->path.mnt);
529 rcu_read_unlock();
530 br_read_unlock(vfsmount_lock);
531 }
532
16c2cd71
AV		 533 if (likely(!(nd->flags & LOOKUP_JUMPED)))
534 return 0;
535
536 if (likely(!(dentry->d_flags & DCACHE_OP_REVALIDATE)))
39159de2
JL		 537 return 0;
538
16c2cd71
AV		 539 if (likely(!(dentry->d_sb->s_type->fs_flags & FS_REVAL_DOT)))
540 return 0;
541
542 /* Note: we do not d_invalidate() */
34286d66 543 status = d_revalidate(dentry, nd);
39159de2
JL		 544 if (status > 0)
545 return 0;
546
16c2cd71 547 if (!status)
39159de2 548 status = -ESTALE;
16c2cd71 549
9f1fafee 550 path_put(&nd->path);
39159de2
JL		 551 return status;
552}
553
2a737871
AV		 554static __always_inline void set_root(struct nameidata *nd)
555{
f7ad3c6b
MS		 556 if (!nd->root.mnt)
557 get_fs_root(current->fs, &nd->root);
2a737871
AV		 558}
559
6de88d72
AV		 560static int link_path_walk(const char *, struct nameidata *);
561
31e6b01f
NP		 562static __always_inline void set_root_rcu(struct nameidata *nd)
563{
564 if (!nd->root.mnt) {
565 struct fs_struct *fs = current->fs;
c28cc364
NP		 566 unsigned seq;
567
568 do {
569 seq = read_seqcount_begin(&fs->seq);
570 nd->root = fs->root;
c1530019 571 nd->seq = __read_seqcount_begin(&nd->root.dentry->d_seq);
c28cc364 572 } while (read_seqcount_retry(&fs->seq, seq));
31e6b01f
NP		 573 }
574}
575
f1662356 576static __always_inline int __vfs_follow_link(struct nameidata *nd, const char *link)
1da177e4 577{
31e6b01f
NP		 578 int ret;
579
1da177e4
LT		 580 if (IS_ERR(link))
581 goto fail;
582
583 if (*link == '/') {
2a737871 584 set_root(nd);
1d957f9b 585 path_put(&nd->path);
2a737871
AV		 586 nd->path = nd->root;
587 path_get(&nd->root);
16c2cd71 588 nd->flags |= LOOKUP_JUMPED;
1da177e4 589 }
31e6b01f 590 nd->inode = nd->path.dentry->d_inode;
b4091d5f 591
31e6b01f
NP		 592 ret = link_path_walk(link, nd);
593 return ret;
1da177e4 594fail:
1d957f9b 595 path_put(&nd->path);
1da177e4
LT		 596 return PTR_ERR(link);
597}
598
1d957f9b 599static void path_put_conditional(struct path *path, struct nameidata *nd)
051d3812
IK		 600{
601 dput(path->dentry);
4ac91378 602 if (path->mnt != nd->path.mnt)
051d3812
IK		 603 mntput(path->mnt);
604}
605
7b9337aa
NP		 606static inline void path_to_nameidata(const struct path *path,
607 struct nameidata *nd)
051d3812 608{
31e6b01f
NP		 609 if (!(nd->flags & LOOKUP_RCU)) {
610 dput(nd->path.dentry);
611 if (nd->path.mnt != path->mnt)
612 mntput(nd->path.mnt);
9a229683 613 }
31e6b01f 614 nd->path.mnt = path->mnt;
4ac91378 615 nd->path.dentry = path->dentry;
051d3812
IK		 616}
617
574197e0
AV		 618static inline void put_link(struct nameidata *nd, struct path *link, void *cookie)
619{
620 struct inode *inode = link->dentry->d_inode;
621 if (!IS_ERR(cookie) && inode->i_op->put_link)
622 inode->i_op->put_link(link->dentry, nd, cookie);
623 path_put(link);
624}
625
def4af30 626static __always_inline int
574197e0 627follow_link(struct path *link, struct nameidata *nd, void **p)
1da177e4
LT		 628{
629 int error;
7b9337aa 630 struct dentry *dentry = link->dentry;
1da177e4 631
844a3917
AV		 632 BUG_ON(nd->flags & LOOKUP_RCU);
633
0e794589
AV		 634 if (link->mnt == nd->path.mnt)
635 mntget(link->mnt);
636
574197e0
AV		 637 if (unlikely(current->total_link_count >= 40)) {
638 *p = ERR_PTR(-ELOOP); /* no ->put_link(), please */
574197e0
AV		 639 path_put(&nd->path);
640 return -ELOOP;
641 }
642 cond_resched();
643 current->total_link_count++;
644
68ac1234 645 touch_atime(link);
1da177e4 646 nd_set_link(nd, NULL);
cd4e91d3 647
36f3b4f6
AV		 648 error = security_inode_follow_link(link->dentry, nd);
649 if (error) {
650 *p = ERR_PTR(error); /* no ->put_link(), please */
651 path_put(&nd->path);
652 return error;
653 }
654
86acdca1 655 nd->last_type = LAST_BIND;
def4af30
AV		 656 *p = dentry->d_inode->i_op->follow_link(dentry, nd);
657 error = PTR_ERR(*p);
658 if (!IS_ERR(*p)) {
1da177e4 659 char *s = nd_get_link(nd);
cc314eef 660 error = 0;
1da177e4
LT		 661 if (s)
662 error = __vfs_follow_link(nd, s);
bcda7652 663 else if (nd->last_type == LAST_BIND) {
16c2cd71 664 nd->flags |= LOOKUP_JUMPED;
b21041d0
AV		 665 nd->inode = nd->path.dentry->d_inode;
666 if (nd->inode->i_op->follow_link) {
bcda7652
AV		 667 /* stepped on a _really_ weird one */
668 path_put(&nd->path);
669 error = -ELOOP;
670 }
671 }
1da177e4 672 }
1da177e4
LT		 673 return error;
674}
675
31e6b01f
NP		 676static int follow_up_rcu(struct path *path)
677{
0714a533
AV		 678 struct mount *mnt = real_mount(path->mnt);
679 struct mount *parent;
31e6b01f
NP		 680 struct dentry *mountpoint;
681
0714a533
AV		 682 parent = mnt->mnt_parent;
683 if (&parent->mnt == path->mnt)
31e6b01f 684 return 0;
a73324da 685 mountpoint = mnt->mnt_mountpoint;
31e6b01f 686 path->dentry = mountpoint;
0714a533 687 path->mnt = &parent->mnt;
31e6b01f
NP		 688 return 1;
689}
690
bab77ebf 691int follow_up(struct path *path)
1da177e4 692{
0714a533
AV		 693 struct mount *mnt = real_mount(path->mnt);
694 struct mount *parent;
1da177e4 695 struct dentry *mountpoint;
99b7db7b
NP		 696
697 br_read_lock(vfsmount_lock);
0714a533
AV		 698 parent = mnt->mnt_parent;
699 if (&parent->mnt == path->mnt) {
99b7db7b 700 br_read_unlock(vfsmount_lock);
1da177e4
LT		 701 return 0;
702 }
0714a533 703 mntget(&parent->mnt);
a73324da 704 mountpoint = dget(mnt->mnt_mountpoint);
99b7db7b 705 br_read_unlock(vfsmount_lock);
bab77ebf
AV		 706 dput(path->dentry);
707 path->dentry = mountpoint;
708 mntput(path->mnt);
0714a533 709 path->mnt = &parent->mnt;
1da177e4
LT		 710 return 1;
711}
712
b5c84bf6 713/*
9875cf80
DH		 714 * Perform an automount
715 * - return -EISDIR to tell follow_managed() to stop and return the path we
716 * were called with.
1da177e4 717 */
9875cf80
DH		 718static int follow_automount(struct path *path, unsigned flags,
719 bool *need_mntput)
31e6b01f 720{
9875cf80 721 struct vfsmount *mnt;
ea5b778a 722 int err;
9875cf80
DH		 723
724 if (!path->dentry->d_op || !path->dentry->d_op->d_automount)
725 return -EREMOTE;
726
0ec26fd0
MS		 727 /* We don't want to mount if someone's just doing a stat -
728 * unless they're stat'ing a directory and appended a '/' to
729 * the name.
730 *
731 * We do, however, want to mount if someone wants to open or
732 * create a file of any type under the mountpoint, wants to
733 * traverse through the mountpoint or wants to open the
734 * mounted directory. Also, autofs may mark negative dentries
735 * as being automount points. These will need the attentions
736 * of the daemon to instantiate them before they can be used.
9875cf80 737 */
0ec26fd0 738 if (!(flags & (LOOKUP_PARENT | LOOKUP_DIRECTORY |
d94c177b 739 LOOKUP_OPEN | LOOKUP_CREATE | LOOKUP_AUTOMOUNT)) &&
0ec26fd0
MS		 740 path->dentry->d_inode)
741 return -EISDIR;
742
9875cf80
DH		 743 current->total_link_count++;
744 if (current->total_link_count >= 40)
745 return -ELOOP;
746
747 mnt = path->dentry->d_op->d_automount(path);
748 if (IS_ERR(mnt)) {
749 /*
750 * The filesystem is allowed to return -EISDIR here to indicate
751 * it doesn't want to automount. For instance, autofs would do
752 * this so that its userspace daemon can mount on this dentry.
753 *
754 * However, we can only permit this if it's a terminal point in
755 * the path being looked up; if it wasn't then the remainder of
756 * the path is inaccessible and we should say so.
757 */
49084c3b 758 if (PTR_ERR(mnt) == -EISDIR && (flags & LOOKUP_PARENT))
9875cf80
DH		 759 return -EREMOTE;
760 return PTR_ERR(mnt);
31e6b01f 761 }
ea5b778a 762
9875cf80
DH		 763 if (!mnt) /* mount collision */
764 return 0;
31e6b01f 765
8aef1884
AV		 766 if (!*need_mntput) {
767 /* lock_mount() may release path->mnt on error */
768 mntget(path->mnt);
769 *need_mntput = true;
770 }
19a167af 771 err = finish_automount(mnt, path);
9875cf80 772
ea5b778a
DH		 773 switch (err) {
774 case -EBUSY:
775 /* Someone else made a mount here whilst we were busy */
19a167af 776 return 0;
ea5b778a 777 case 0:
8aef1884 778 path_put(path);
ea5b778a
DH		 779 path->mnt = mnt;
780 path->dentry = dget(mnt->mnt_root);
ea5b778a 781 return 0;
19a167af
AV		 782 default:
783 return err;
ea5b778a 784 }
19a167af 785
463ffb2e
AV		 786}
787
9875cf80
DH		 788/*
789 * Handle a dentry that is managed in some way.
cc53ce53 790 * - Flagged for transit management (autofs)
9875cf80
DH		 791 * - Flagged as mountpoint
792 * - Flagged as automount point
793 *
794 * This may only be called in refwalk mode.
795 *
796 * Serialization is taken care of in namespace.c
797 */
798static int follow_managed(struct path *path, unsigned flags)
1da177e4 799{
8aef1884 800 struct vfsmount *mnt = path->mnt; /* held by caller, must be left alone */
9875cf80
DH		 801 unsigned managed;
802 bool need_mntput = false;
8aef1884 803 int ret = 0;
9875cf80
DH		 804
805 /* Given that we're not holding a lock here, we retain the value in a
806 * local variable for each dentry as we look at it so that we don't see
807 * the components of that value change under us */
808 while (managed = ACCESS_ONCE(path->dentry->d_flags),
809 managed &= DCACHE_MANAGED_DENTRY,
810 unlikely(managed != 0)) {
cc53ce53
DH		 811 /* Allow the filesystem to manage the transit without i_mutex
812 * being held. */
813 if (managed & DCACHE_MANAGE_TRANSIT) {
814 BUG_ON(!path->dentry->d_op);
815 BUG_ON(!path->dentry->d_op->d_manage);
1aed3e42 816 ret = path->dentry->d_op->d_manage(path->dentry, false);
cc53ce53 817 if (ret < 0)
8aef1884 818 break;
cc53ce53
DH		 819 }
820
9875cf80
DH		 821 /* Transit to a mounted filesystem. */
822 if (managed & DCACHE_MOUNTED) {
823 struct vfsmount *mounted = lookup_mnt(path);
824 if (mounted) {
825 dput(path->dentry);
826 if (need_mntput)
827 mntput(path->mnt);
828 path->mnt = mounted;
829 path->dentry = dget(mounted->mnt_root);
830 need_mntput = true;
831 continue;
832 }
833
834 /* Something is mounted on this dentry in another
835 * namespace and/or whatever was mounted there in this
836 * namespace got unmounted before we managed to get the
837 * vfsmount_lock */
838 }
839
840 /* Handle an automount point */
841 if (managed & DCACHE_NEED_AUTOMOUNT) {
842 ret = follow_automount(path, flags, &need_mntput);
843 if (ret < 0)
8aef1884 844 break;
9875cf80
DH		 845 continue;
846 }
847
848 /* We didn't change the current path point */
849 break;
1da177e4 850 }
8aef1884
AV		 851
852 if (need_mntput && path->mnt == mnt)
853 mntput(path->mnt);
854 if (ret == -EISDIR)
855 ret = 0;
a3fbbde7 856 return ret < 0 ? ret : need_mntput;
1da177e4
LT		 857}
858
cc53ce53 859int follow_down_one(struct path *path)
1da177e4
LT		 860{
861 struct vfsmount *mounted;
862
1c755af4 863 mounted = lookup_mnt(path);
1da177e4 864 if (mounted) {
9393bd07
AV		 865 dput(path->dentry);
866 mntput(path->mnt);
867 path->mnt = mounted;
868 path->dentry = dget(mounted->mnt_root);
1da177e4
LT		 869 return 1;
870 }
871 return 0;
872}
873
62a7375e
IK		 874static inline bool managed_dentry_might_block(struct dentry *dentry)
875{
876 return (dentry->d_flags & DCACHE_MANAGE_TRANSIT &&
877 dentry->d_op->d_manage(dentry, true) < 0);
878}
879
9875cf80 880/*
287548e4
AV		 881 * Try to skip to top of mountpoint pile in rcuwalk mode. Fail if
882 * we meet a managed dentry that would need blocking.
9875cf80
DH		 883 */
884static bool __follow_mount_rcu(struct nameidata *nd, struct path *path,
287548e4 885 struct inode **inode)
9875cf80 886{
62a7375e 887 for (;;) {
c7105365 888 struct mount *mounted;
62a7375e
IK		 889 /*
890 * Don't forget we might have a non-mountpoint managed dentry
891 * that wants to block transit.
892 */
287548e4 893 if (unlikely(managed_dentry_might_block(path->dentry)))
ab90911f 894 return false;
62a7375e
IK		 895
896 if (!d_mountpoint(path->dentry))
897 break;
898
9875cf80
DH		 899 mounted = __lookup_mnt(path->mnt, path->dentry, 1);
900 if (!mounted)
901 break;
c7105365
AV		 902 path->mnt = &mounted->mnt;
903 path->dentry = mounted->mnt.mnt_root;
a3fbbde7 904 nd->flags |= LOOKUP_JUMPED;
9875cf80 905 nd->seq = read_seqcount_begin(&path->dentry->d_seq);
59430262
LT		 906 /*
907 * Update the inode too. We don't need to re-check the
908 * dentry sequence number here after this d_inode read,
909 * because a mount-point is always pinned.
910 */
911 *inode = path->dentry->d_inode;
9875cf80 912 }
9875cf80
DH		 913 return true;
914}
915
dea39376 916static void follow_mount_rcu(struct nameidata *nd)
287548e4 917{
dea39376 918 while (d_mountpoint(nd->path.dentry)) {
c7105365 919 struct mount *mounted;
dea39376 920 mounted = __lookup_mnt(nd->path.mnt, nd->path.dentry, 1);
287548e4
AV		 921 if (!mounted)
922 break;
c7105365
AV		 923 nd->path.mnt = &mounted->mnt;
924 nd->path.dentry = mounted->mnt.mnt_root;
dea39376 925 nd->seq = read_seqcount_begin(&nd->path.dentry->d_seq);
287548e4
AV		 926 }
927}
928
31e6b01f
NP		 929static int follow_dotdot_rcu(struct nameidata *nd)
930{
31e6b01f
NP		 931 set_root_rcu(nd);
932
9875cf80 933 while (1) {
31e6b01f
NP		 934 if (nd->path.dentry == nd->root.dentry &&
935 nd->path.mnt == nd->root.mnt) {
936 break;
937 }
938 if (nd->path.dentry != nd->path.mnt->mnt_root) {
939 struct dentry *old = nd->path.dentry;
940 struct dentry *parent = old->d_parent;
941 unsigned seq;
942
943 seq = read_seqcount_begin(&parent->d_seq);
944 if (read_seqcount_retry(&old->d_seq, nd->seq))
ef7562d5 945 goto failed;
31e6b01f
NP		 946 nd->path.dentry = parent;
947 nd->seq = seq;
948 break;
949 }
950 if (!follow_up_rcu(&nd->path))
951 break;
952 nd->seq = read_seqcount_begin(&nd->path.dentry->d_seq);
31e6b01f 953 }
dea39376
AV		 954 follow_mount_rcu(nd);
955 nd->inode = nd->path.dentry->d_inode;
31e6b01f 956 return 0;
ef7562d5
AV		 957
958failed:
959 nd->flags &= ~LOOKUP_RCU;
5b6ca027
AV		 960 if (!(nd->flags & LOOKUP_ROOT))
961 nd->root.mnt = NULL;
ef7562d5
AV		 962 rcu_read_unlock();
963 br_read_unlock(vfsmount_lock);
964 return -ECHILD;
31e6b01f
NP		 965}
966
cc53ce53
DH		 967/*
968 * Follow down to the covering mount currently visible to userspace. At each
969 * point, the filesystem owning that dentry may be queried as to whether the
970 * caller is permitted to proceed or not.
cc53ce53 971 */
7cc90cc3 972int follow_down(struct path *path)
cc53ce53
DH		 973{
974 unsigned managed;
975 int ret;
976
977 while (managed = ACCESS_ONCE(path->dentry->d_flags),
978 unlikely(managed & DCACHE_MANAGED_DENTRY)) {
979 /* Allow the filesystem to manage the transit without i_mutex
980 * being held.
981 *
982 * We indicate to the filesystem if someone is trying to mount
983 * something here. This gives autofs the chance to deny anyone
984 * other than its daemon the right to mount on its
985 * superstructure.
986 *
987 * The filesystem may sleep at this point.
988 */
989 if (managed & DCACHE_MANAGE_TRANSIT) {
990 BUG_ON(!path->dentry->d_op);
991 BUG_ON(!path->dentry->d_op->d_manage);
ab90911f 992 ret = path->dentry->d_op->d_manage(
1aed3e42 993 path->dentry, false);
cc53ce53
DH		 994 if (ret < 0)
995 return ret == -EISDIR ? 0 : ret;
996 }
997
998 /* Transit to a mounted filesystem. */
999 if (managed & DCACHE_MOUNTED) {
1000 struct vfsmount *mounted = lookup_mnt(path);
1001 if (!mounted)
1002 break;
1003 dput(path->dentry);
1004 mntput(path->mnt);
1005 path->mnt = mounted;
1006 path->dentry = dget(mounted->mnt_root);
1007 continue;
1008 }
1009
1010 /* Don't handle automount points here */
1011 break;
1012 }
1013 return 0;
1014}
1015
9875cf80
DH		 1016/*
1017 * Skip to top of mountpoint pile in refwalk mode for follow_dotdot()
1018 */
1019static void follow_mount(struct path *path)
1020{
1021 while (d_mountpoint(path->dentry)) {
1022 struct vfsmount *mounted = lookup_mnt(path);
1023 if (!mounted)
1024 break;
1025 dput(path->dentry);
1026 mntput(path->mnt);
1027 path->mnt = mounted;
1028 path->dentry = dget(mounted->mnt_root);
1029 }
1030}
1031
31e6b01f 1032static void follow_dotdot(struct nameidata *nd)
1da177e4 1033{
2a737871 1034 set_root(nd);
e518ddb7 1035
1da177e4 1036 while(1) {
4ac91378 1037 struct dentry *old = nd->path.dentry;
1da177e4 1038
2a737871
AV		 1039 if (nd->path.dentry == nd->root.dentry &&
1040 nd->path.mnt == nd->root.mnt) {
1da177e4
LT		 1041 break;
1042 }
4ac91378 1043 if (nd->path.dentry != nd->path.mnt->mnt_root) {
3088dd70
AV		 1044 /* rare case of legitimate dget_parent()... */
1045 nd->path.dentry = dget_parent(nd->path.dentry);
1da177e4
LT		 1046 dput(old);
1047 break;
1048 }
3088dd70 1049 if (!follow_up(&nd->path))
1da177e4 1050 break;
1da177e4 1051 }
79ed0226 1052 follow_mount(&nd->path);
31e6b01f 1053 nd->inode = nd->path.dentry->d_inode;
1da177e4
LT		 1054}
1055
baa03890
NP		 1056/*
1057 * Allocate a dentry with name and parent, and perform a parent
1058 * directory ->lookup on it. Returns the new dentry, or ERR_PTR
1059 * on error. parent->d_inode->i_mutex must be held. d_lookup must
1060 * have verified that no child exists while under i_mutex.
1061 */
1062static struct dentry *d_alloc_and_lookup(struct dentry *parent,
1063 struct qstr *name, struct nameidata *nd)
1064{
1065 struct inode *inode = parent->d_inode;
1066 struct dentry *dentry;
1067 struct dentry *old;
1068
1069 /* Don't create child dentry for a dead directory. */
1070 if (unlikely(IS_DEADDIR(inode)))
1071 return ERR_PTR(-ENOENT);
1072
1073 dentry = d_alloc(parent, name);
1074 if (unlikely(!dentry))
1075 return ERR_PTR(-ENOMEM);
1076
1077 old = inode->i_op->lookup(inode, dentry, nd);
1078 if (unlikely(old)) {
1079 dput(dentry);
1080 dentry = old;
1081 }
1082 return dentry;
1083}
1084
44396f4b
JB		 1085/*
1086 * We already have a dentry, but require a lookup to be performed on the parent
1087 * directory to fill in d_inode. Returns the new dentry, or ERR_PTR on error.
1088 * parent->d_inode->i_mutex must be held. d_lookup must have verified that no
1089 * child exists while under i_mutex.
1090 */
1091static struct dentry *d_inode_lookup(struct dentry *parent, struct dentry *dentry,
1092 struct nameidata *nd)
1093{
1094 struct inode *inode = parent->d_inode;
1095 struct dentry *old;
1096
1097 /* Don't create child dentry for a dead directory. */
e188dc02
MS		 1098 if (unlikely(IS_DEADDIR(inode))) {
1099 dput(dentry);
44396f4b 1100 return ERR_PTR(-ENOENT);
e188dc02 1101 }
44396f4b
JB		 1102
1103 old = inode->i_op->lookup(inode, dentry, nd);
1104 if (unlikely(old)) {
1105 dput(dentry);
1106 dentry = old;
1107 }
1108 return dentry;
1109}
1110
1da177e4
LT		 1111/*
1112 * It's more convoluted than I'd like it to be, but... it's still fairly
1113 * small and for now I'd prefer to have fast path as straight as possible.
1114 * It _is_ time-critical.
1115 */
1116static int do_lookup(struct nameidata *nd, struct qstr *name,
31e6b01f 1117 struct path *path, struct inode **inode)
1da177e4 1118{
4ac91378 1119 struct vfsmount *mnt = nd->path.mnt;
31e6b01f 1120 struct dentry *dentry, *parent = nd->path.dentry;
5a18fff2
AV		 1121 int need_reval = 1;
1122 int status = 1;
9875cf80
DH		 1123 int err;
1124
b04f784e
NP		 1125 /*
1126 * Rename seqlock is not required here because in the off chance
1127 * of a false negative due to a concurrent rename, we're going to
1128 * do the non-racy lookup, below.
1129 */
31e6b01f
NP		 1130 if (nd->flags & LOOKUP_RCU) {
1131 unsigned seq;
31e6b01f
NP		 1132 *inode = nd->inode;
1133 dentry = __d_lookup_rcu(parent, name, &seq, inode);
5a18fff2
AV		 1134 if (!dentry)
1135 goto unlazy;
1136
31e6b01f
NP		 1137 /* Memory barrier in read_seqcount_begin of child is enough */
1138 if (__read_seqcount_retry(&parent->d_seq, nd->seq))
1139 return -ECHILD;
31e6b01f 1140 nd->seq = seq;
5a18fff2 1141
fa4ee159
MS		 1142 if (unlikely(d_need_lookup(dentry)))
1143 goto unlazy;
24643087 1144 if (unlikely(dentry->d_flags & DCACHE_OP_REVALIDATE)) {
5a18fff2
AV		 1145 status = d_revalidate(dentry, nd);
1146 if (unlikely(status <= 0)) {
1147 if (status != -ECHILD)
1148 need_reval = 0;
1149 goto unlazy;
1150 }
24643087 1151 }
31e6b01f
NP		 1152 path->mnt = mnt;
1153 path->dentry = dentry;
d6e9bd25
AV		 1154 if (unlikely(!__follow_mount_rcu(nd, path, inode)))
1155 goto unlazy;
1156 if (unlikely(path->dentry->d_flags & DCACHE_NEED_AUTOMOUNT))
1157 goto unlazy;
1158 return 0;
5a18fff2 1159unlazy:
19660af7
AV		 1160 if (unlazy_walk(nd, dentry))
1161 return -ECHILD;
5a18fff2
AV		 1162 } else {
1163 dentry = __d_lookup(parent, name);
9875cf80 1164 }
5a18fff2 1165
44396f4b
JB		 1166 if (dentry && unlikely(d_need_lookup(dentry))) {
1167 dput(dentry);
1168 dentry = NULL;
1169 }
5a18fff2
AV		 1170retry:
1171 if (unlikely(!dentry)) {
1172 struct inode *dir = parent->d_inode;
1173 BUG_ON(nd->inode != dir);
1174
1175 mutex_lock(&dir->i_mutex);
1176 dentry = d_lookup(parent, name);
d774a058 1177 if (dentry && d_need_lookup(dentry)) {
44396f4b 1178 dentry = d_inode_lookup(parent, dentry, nd);
ec335e91
AV		 1179 goto l;
1180 }
1181 if (dentry && (dentry->d_flags & DCACHE_OP_REVALIDATE)) {
3f6c7c71 1182 status = d_revalidate(dentry, nd);
d774a058
AV		 1183 if (unlikely(status <= 0)) {
1184 if (status < 0) {
d774a058 1185 dput(dentry);
ec335e91
AV		 1186 dentry = ERR_PTR(status);
1187 goto l;
d774a058
AV		 1188 }
1189 if (!d_invalidate(dentry)) {
1190 dput(dentry);
a6ecdfcf 1191 dentry = NULL;
acc9cb3c 1192 }
d774a058 1193 }
3f6c7c71 1194 }
a6ecdfcf
AV		 1195 if (!dentry)
1196 dentry = d_alloc_and_lookup(parent, name, nd);
ec335e91 1197 l:
37c17e1f 1198 mutex_unlock(&dir->i_mutex);
ec335e91
AV		 1199 if (IS_ERR(dentry))
1200 return PTR_ERR(dentry);
3f6c7c71 1201 goto done;
5a18fff2
AV		 1202 }
1203 if (unlikely(dentry->d_flags & DCACHE_OP_REVALIDATE) && need_reval)
1204 status = d_revalidate(dentry, nd);
1205 if (unlikely(status <= 0)) {
1206 if (status < 0) {
1207 dput(dentry);
1208 return status;
1209 }
1210 if (!d_invalidate(dentry)) {
1211 dput(dentry);
1212 dentry = NULL;
5a18fff2
AV		 1213 goto retry;
1214 }
24643087 1215 }
3f6c7c71 1216done:
9875cf80
DH		 1217 path->mnt = mnt;
1218 path->dentry = dentry;
1219 err = follow_managed(path, nd->flags);
89312214
IK		 1220 if (unlikely(err < 0)) {
1221 path_put_conditional(path, nd);
9875cf80 1222 return err;
89312214 1223 }
a3fbbde7
AV		 1224 if (err)
1225 nd->flags |= LOOKUP_JUMPED;
9875cf80 1226 *inode = path->dentry->d_inode;
1da177e4 1227 return 0;
1da177e4
LT		 1228}
1229
52094c8a
AV		 1230static inline int may_lookup(struct nameidata *nd)
1231{
1232 if (nd->flags & LOOKUP_RCU) {
4ad5abb3 1233 int err = inode_permission(nd->inode, MAY_EXEC|MAY_NOT_BLOCK);
52094c8a
AV		 1234 if (err != -ECHILD)
1235 return err;
19660af7 1236 if (unlazy_walk(nd, NULL))
52094c8a
AV		 1237 return -ECHILD;
1238 }
4ad5abb3 1239 return inode_permission(nd->inode, MAY_EXEC);
52094c8a
AV		 1240}
1241
9856fa1b
AV		 1242static inline int handle_dots(struct nameidata *nd, int type)
1243{
1244 if (type == LAST_DOTDOT) {
1245 if (nd->flags & LOOKUP_RCU) {
1246 if (follow_dotdot_rcu(nd))
1247 return -ECHILD;
1248 } else
1249 follow_dotdot(nd);
1250 }
1251 return 0;
1252}
1253
951361f9
AV		 1254static void terminate_walk(struct nameidata *nd)
1255{
1256 if (!(nd->flags & LOOKUP_RCU)) {
1257 path_put(&nd->path);
1258 } else {
1259 nd->flags &= ~LOOKUP_RCU;
5b6ca027
AV		 1260 if (!(nd->flags & LOOKUP_ROOT))
1261 nd->root.mnt = NULL;
951361f9
AV		 1262 rcu_read_unlock();
1263 br_read_unlock(vfsmount_lock);
1264 }
1265}
1266
3ddcd056
LT		 1267/*
1268 * Do we need to follow links? We _really_ want to be able
1269 * to do this check without having to look at inode->i_op,
1270 * so we keep a cache of "no, this doesn't need follow_link"
1271 * for the common case.
1272 */
7813b94a 1273static inline int should_follow_link(struct inode *inode, int follow)
3ddcd056
LT		 1274{
1275 if (unlikely(!(inode->i_opflags & IOP_NOFOLLOW))) {
1276 if (likely(inode->i_op->follow_link))
1277 return follow;
1278
1279 /* This gets set once for the inode lifetime */
1280 spin_lock(&inode->i_lock);
1281 inode->i_opflags |= IOP_NOFOLLOW;
1282 spin_unlock(&inode->i_lock);
1283 }
1284 return 0;
1285}
1286
ce57dfc1
AV		 1287static inline int walk_component(struct nameidata *nd, struct path *path,
1288 struct qstr *name, int type, int follow)
1289{
1290 struct inode *inode;
1291 int err;
1292 /*
1293 * "." and ".." are special - ".." especially so because it has
1294 * to be able to know about the current root directory and
1295 * parent relationships.
1296 */
1297 if (unlikely(type != LAST_NORM))
1298 return handle_dots(nd, type);
1299 err = do_lookup(nd, name, path, &inode);
1300 if (unlikely(err)) {
1301 terminate_walk(nd);
1302 return err;
1303 }
1304 if (!inode) {
1305 path_to_nameidata(path, nd);
1306 terminate_walk(nd);
1307 return -ENOENT;
1308 }
7813b94a 1309 if (should_follow_link(inode, follow)) {
19660af7
AV		 1310 if (nd->flags & LOOKUP_RCU) {
1311 if (unlikely(unlazy_walk(nd, path->dentry))) {
1312 terminate_walk(nd);
1313 return -ECHILD;
1314 }
1315 }
ce57dfc1
AV		 1316 BUG_ON(inode != path->dentry->d_inode);
1317 return 1;
1318 }
1319 path_to_nameidata(path, nd);
1320 nd->inode = inode;
1321 return 0;
1322}
1323
b356379a
AV		 1324/*
1325 * This limits recursive symlink follows to 8, while
1326 * limiting consecutive symlinks to 40.
1327 *
1328 * Without that kind of total limit, nasty chains of consecutive
1329 * symlinks can cause almost arbitrarily long lookups.
1330 */
1331static inline int nested_symlink(struct path *path, struct nameidata *nd)
1332{
1333 int res;
1334
b356379a
AV		 1335 if (unlikely(current->link_count >= MAX_NESTED_LINKS)) {
1336 path_put_conditional(path, nd);
1337 path_put(&nd->path);
1338 return -ELOOP;
1339 }
1a4022f8 1340 BUG_ON(nd->depth >= MAX_NESTED_LINKS);
b356379a
AV		 1341
1342 nd->depth++;
1343 current->link_count++;
1344
1345 do {
1346 struct path link = *path;
1347 void *cookie;
574197e0
AV		 1348
1349 res = follow_link(&link, nd, &cookie);
b356379a
AV		 1350 if (!res)
1351 res = walk_component(nd, path, &nd->last,
1352 nd->last_type, LOOKUP_FOLLOW);
574197e0 1353 put_link(nd, &link, cookie);
b356379a
AV		 1354 } while (res > 0);
1355
1356 current->link_count--;
1357 nd->depth--;
1358 return res;
1359}
1360
3ddcd056
LT		 1361/*
1362 * We really don't want to look at inode->i_op->lookup
1363 * when we don't have to. So we keep a cache bit in
1364 * the inode ->i_opflags field that says "yes, we can
1365 * do lookup on this inode".
1366 */
1367static inline int can_lookup(struct inode *inode)
1368{
1369 if (likely(inode->i_opflags & IOP_LOOKUP))
1370 return 1;
1371 if (likely(!inode->i_op->lookup))
1372 return 0;
1373
1374 /* We do this once for the lifetime of the inode */
1375 spin_lock(&inode->i_lock);
1376 inode->i_opflags |= IOP_LOOKUP;
1377 spin_unlock(&inode->i_lock);
1378 return 1;
1379}
1380
bfcfaa77
LT		 1381/*
1382 * We can do the critical dentry name comparison and hashing
1383 * operations one word at a time, but we are limited to:
1384 *
1385 * - Architectures with fast unaligned word accesses. We could
1386 * do a "get_unaligned()" if this helps and is sufficiently
1387 * fast.
1388 *
1389 * - Little-endian machines (so that we can generate the mask
1390 * of low bytes efficiently). Again, we *could* do a byte
1391 * swapping load on big-endian architectures if that is not
1392 * expensive enough to make the optimization worthless.
1393 *
1394 * - non-CONFIG_DEBUG_PAGEALLOC configurations (so that we
1395 * do not trap on the (extremely unlikely) case of a page
1396 * crossing operation.
1397 *
1398 * - Furthermore, we need an efficient 64-bit compile for the
1399 * 64-bit case in order to generate the "number of bytes in
1400 * the final mask". Again, that could be replaced with a
1401 * efficient population count instruction or similar.
1402 */
1403#ifdef CONFIG_DCACHE_WORD_ACCESS
1404
1405#ifdef CONFIG_64BIT
1406
1407/*
1408 * Jan Achrenius on G+: microoptimized version of
1409 * the simpler "(mask & ONEBYTES) * ONEBYTES >> 56"
1410 * that works for the bytemasks without having to
1411 * mask them first.
1412 */
1413static inline long count_masked_bytes(unsigned long mask)
1414{
f7493e5d 1415 return mask*0x0001020304050608ul >> 56;
bfcfaa77
LT		 1416}
1417
1418static inline unsigned int fold_hash(unsigned long hash)
1419{
1420 hash += hash >> (8*sizeof(int));
1421 return hash;
1422}
1423
1424#else /* 32-bit case */
1425
1426/* Carl Chatfield / Jan Achrenius G+ version for 32-bit */
1427static inline long count_masked_bytes(long mask)
1428{
1429 /* (000000 0000ff 00ffff ffffff) -> ( 1 1 2 3 ) */
1430 long a = (0x0ff0001+mask) >> 23;
1431 /* Fix the 1 for 00 case */
1432 return a & mask;
1433}
1434
1435#define fold_hash(x) (x)
1436
1437#endif
1438
1439unsigned int full_name_hash(const unsigned char *name, unsigned int len)
1440{
1441 unsigned long a, mask;
1442 unsigned long hash = 0;
1443
1444 for (;;) {
1445 a = *(unsigned long *)name;
bfcfaa77
LT		 1446 if (len < sizeof(unsigned long))
1447 break;
1448 hash += a;
f132c5be 1449 hash *= 9;
bfcfaa77
LT		 1450 name += sizeof(unsigned long);
1451 len -= sizeof(unsigned long);
1452 if (!len)
1453 goto done;
1454 }
1455 mask = ~(~0ul << len*8);
1456 hash += mask & a;
1457done:
1458 return fold_hash(hash);
1459}
1460EXPORT_SYMBOL(full_name_hash);
1461
989412bb
LT		 1462#define REPEAT_BYTE(x) ((~0ul / 0xff) * (x))
1463#define ONEBYTES REPEAT_BYTE(0x01)
1464#define SLASHBYTES REPEAT_BYTE('/')
1465#define HIGHBITS REPEAT_BYTE(0x80)
bfcfaa77
LT		 1466
1467/* Return the high bit set in the first byte that is a zero */
1468static inline unsigned long has_zero(unsigned long a)
1469{
1470 return ((a - ONEBYTES) & ~a) & HIGHBITS;
1471}
1472
1473/*
1474 * Calculate the length and hash of the path component, and
1475 * return the length of the component;
1476 */
1477static inline unsigned long hash_name(const char *name, unsigned int *hashp)
1478{
1479 unsigned long a, mask, hash, len;
1480
1481 hash = a = 0;
1482 len = -sizeof(unsigned long);
1483 do {
1484 hash = (hash + a) * 9;
1485 len += sizeof(unsigned long);
1486 a = *(unsigned long *)(name+len);
1487 /* Do we have any NUL or '/' bytes in this word? */
1488 mask = has_zero(a) | has_zero(a ^ SLASHBYTES);
1489 } while (!mask);
1490
1491 /* The mask *below* the first high bit set */
1492 mask = (mask - 1) & ~mask;
1493 mask >>= 7;
1494 hash += a & mask;
1495 *hashp = fold_hash(hash);
1496
1497 return len + count_masked_bytes(mask);
1498}
1499
1500#else
1501
0145acc2
LT		 1502unsigned int full_name_hash(const unsigned char *name, unsigned int len)
1503{
1504 unsigned long hash = init_name_hash();
1505 while (len--)
1506 hash = partial_name_hash(*name++, hash);
1507 return end_name_hash(hash);
1508}
ae942ae7 1509EXPORT_SYMBOL(full_name_hash);
0145acc2 1510
200e9ef7
LT		 1511/*
1512 * We know there's a real path component here of at least
1513 * one character.
1514 */
1515static inline unsigned long hash_name(const char *name, unsigned int *hashp)
1516{
1517 unsigned long hash = init_name_hash();
1518 unsigned long len = 0, c;
1519
1520 c = (unsigned char)*name;
1521 do {
1522 len++;
1523 hash = partial_name_hash(c, hash);
1524 c = (unsigned char)name[len];
1525 } while (c && c != '/');
1526 *hashp = end_name_hash(hash);
1527 return len;
1528}
1529
bfcfaa77
LT		 1530#endif
1531
1da177e4
LT		 1532/*
1533 * Name resolution.
ea3834d9
PM		 1534 * This is the basic name resolution function, turning a pathname into
1535 * the final dentry. We expect 'base' to be positive and a directory.
1da177e4 1536 *
ea3834d9
PM		 1537 * Returns 0 and nd will have valid dentry and mnt on success.
1538 * Returns error and drops reference to input namei data on failure.
1da177e4 1539 */
6de88d72 1540static int link_path_walk(const char *name, struct nameidata *nd)
1da177e4
LT		 1541{
1542 struct path next;
1da177e4 1543 int err;
1da177e4
LT		 1544
1545 while (*name=='/')
1546 name++;
1547 if (!*name)
086e183a 1548 return 0;
1da177e4 1549
1da177e4
LT		 1550 /* At this point we know we have a real path component. */
1551 for(;;) {
1da177e4 1552 struct qstr this;
200e9ef7 1553 long len;
fe479a58 1554 int type;
1da177e4 1555
52094c8a 1556 err = may_lookup(nd);
1da177e4
LT		 1557 if (err)
1558 break;
1559
200e9ef7 1560 len = hash_name(name, &this.hash);
1da177e4 1561 this.name = name;
200e9ef7 1562 this.len = len;
1da177e4 1563
fe479a58 1564 type = LAST_NORM;
200e9ef7 1565 if (name[0] == '.') switch (len) {
fe479a58 1566 case 2:
200e9ef7 1567 if (name[1] == '.') {
fe479a58 1568 type = LAST_DOTDOT;
16c2cd71
AV		 1569 nd->flags |= LOOKUP_JUMPED;
1570 }
fe479a58
AV		 1571 break;
1572 case 1:
1573 type = LAST_DOT;
1574 }
5a202bcd
AV		 1575 if (likely(type == LAST_NORM)) {
1576 struct dentry *parent = nd->path.dentry;
16c2cd71 1577 nd->flags &= ~LOOKUP_JUMPED;
5a202bcd
AV		 1578 if (unlikely(parent->d_flags & DCACHE_OP_HASH)) {
1579 err = parent->d_op->d_hash(parent, nd->inode,
1580 &this);
1581 if (err < 0)
1582 break;
1583 }
1584 }
fe479a58 1585
200e9ef7 1586 if (!name[len])
1da177e4 1587 goto last_component;
200e9ef7
LT		 1588 /*
1589 * If it wasn't NUL, we know it was '/'. Skip that
1590 * slash, and continue until no more slashes.
1591 */
1592 do {
1593 len++;
1594 } while (unlikely(name[len] == '/'));
1595 if (!name[len])
b356379a 1596 goto last_component;
200e9ef7 1597 name += len;
1da177e4 1598
ce57dfc1
AV		 1599 err = walk_component(nd, &next, &this, type, LOOKUP_FOLLOW);
1600 if (err < 0)
1601 return err;
1da177e4 1602
ce57dfc1 1603 if (err) {
b356379a 1604 err = nested_symlink(&next, nd);
1da177e4 1605 if (err)
a7472bab 1606 return err;
31e6b01f 1607 }
3ddcd056
LT		 1608 if (can_lookup(nd->inode))
1609 continue;
1da177e4 1610 err = -ENOTDIR;
3ddcd056 1611 break;
1da177e4
LT		 1612 /* here ends the main loop */
1613
1da177e4 1614last_component:
b356379a
AV		 1615 nd->last = this;
1616 nd->last_type = type;
086e183a 1617 return 0;
1da177e4 1618 }
951361f9 1619 terminate_walk(nd);
1da177e4
LT		 1620 return err;
1621}
1622
70e9b357
AV		 1623static int path_init(int dfd, const char *name, unsigned int flags,
1624 struct nameidata *nd, struct file **fp)
31e6b01f
NP		 1625{
1626 int retval = 0;
1627 int fput_needed;
1628 struct file *file;
1629
1630 nd->last_type = LAST_ROOT; /* if there are only slashes... */
16c2cd71 1631 nd->flags = flags | LOOKUP_JUMPED;
31e6b01f 1632 nd->depth = 0;
5b6ca027
AV		 1633 if (flags & LOOKUP_ROOT) {
1634 struct inode *inode = nd->root.dentry->d_inode;
73d049a4
AV		 1635 if (*name) {
1636 if (!inode->i_op->lookup)
1637 return -ENOTDIR;
1638 retval = inode_permission(inode, MAY_EXEC);
1639 if (retval)
1640 return retval;
1641 }
5b6ca027
AV		 1642 nd->path = nd->root;
1643 nd->inode = inode;
1644 if (flags & LOOKUP_RCU) {
1645 br_read_lock(vfsmount_lock);
1646 rcu_read_lock();
1647 nd->seq = __read_seqcount_begin(&nd->path.dentry->d_seq);
1648 } else {
1649 path_get(&nd->path);
1650 }
1651 return 0;
1652 }
1653
31e6b01f 1654 nd->root.mnt = NULL;
31e6b01f
NP		 1655
1656 if (*name=='/') {
e41f7d4e
AV		 1657 if (flags & LOOKUP_RCU) {
1658 br_read_lock(vfsmount_lock);
1659 rcu_read_lock();
1660 set_root_rcu(nd);
1661 } else {
1662 set_root(nd);
1663 path_get(&nd->root);
1664 }
1665 nd->path = nd->root;
31e6b01f 1666 } else if (dfd == AT_FDCWD) {
e41f7d4e
AV		 1667 if (flags & LOOKUP_RCU) {
1668 struct fs_struct *fs = current->fs;
1669 unsigned seq;
31e6b01f 1670
e41f7d4e
AV		 1671 br_read_lock(vfsmount_lock);
1672 rcu_read_lock();
c28cc364 1673
e41f7d4e
AV		 1674 do {
1675 seq = read_seqcount_begin(&fs->seq);
1676 nd->path = fs->pwd;
1677 nd->seq = __read_seqcount_begin(&nd->path.dentry->d_seq);
1678 } while (read_seqcount_retry(&fs->seq, seq));
1679 } else {
1680 get_fs_pwd(current->fs, &nd->path);
1681 }
31e6b01f
NP		 1682 } else {
1683 struct dentry *dentry;
1684
1abf0c71 1685 file = fget_raw_light(dfd, &fput_needed);
31e6b01f
NP		 1686 retval = -EBADF;
1687 if (!file)
1688 goto out_fail;
1689
1690 dentry = file->f_path.dentry;
1691
f52e0c11
AV		 1692 if (*name) {
1693 retval = -ENOTDIR;
1694 if (!S_ISDIR(dentry->d_inode->i_mode))
1695 goto fput_fail;
31e6b01f 1696
4ad5abb3 1697 retval = inode_permission(dentry->d_inode, MAY_EXEC);
f52e0c11
AV		 1698 if (retval)
1699 goto fput_fail;
1700 }
31e6b01f
NP		 1701
1702 nd->path = file->f_path;
e41f7d4e
AV		 1703 if (flags & LOOKUP_RCU) {
1704 if (fput_needed)
70e9b357 1705 *fp = file;
e41f7d4e
AV		 1706 nd->seq = __read_seqcount_begin(&nd->path.dentry->d_seq);
1707 br_read_lock(vfsmount_lock);
1708 rcu_read_lock();
1709 } else {
1710 path_get(&file->f_path);
1711 fput_light(file, fput_needed);
1712 }
31e6b01f 1713 }
31e6b01f 1714
31e6b01f 1715 nd->inode = nd->path.dentry->d_inode;
9b4a9b14 1716 return 0;
2dfdd266 1717
9b4a9b14
AV		 1718fput_fail:
1719 fput_light(file, fput_needed);
1720out_fail:
1721 return retval;
1722}
1723
bd92d7fe
AV		 1724static inline int lookup_last(struct nameidata *nd, struct path *path)
1725{
1726 if (nd->last_type == LAST_NORM && nd->last.name[nd->last.len])
1727 nd->flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY;
1728
1729 nd->flags &= ~LOOKUP_PARENT;
1730 return walk_component(nd, path, &nd->last, nd->last_type,
1731 nd->flags & LOOKUP_FOLLOW);
1732}
1733
9b4a9b14 1734/* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
ee0827cd 1735static int path_lookupat(int dfd, const char *name,
9b4a9b14
AV		 1736 unsigned int flags, struct nameidata *nd)
1737{
70e9b357 1738 struct file *base = NULL;
bd92d7fe
AV		 1739 struct path path;
1740 int err;
31e6b01f
NP		 1741
1742 /*
1743 * Path walking is largely split up into 2 different synchronisation
1744 * schemes, rcu-walk and ref-walk (explained in
1745 * Documentation/filesystems/path-lookup.txt). These share much of the
1746 * path walk code, but some things particularly setup, cleanup, and
1747 * following mounts are sufficiently divergent that functions are
1748 * duplicated. Typically there is a function foo(), and its RCU
1749 * analogue, foo_rcu().
1750 *
1751 * -ECHILD is the error number of choice (just to avoid clashes) that
1752 * is returned if some aspect of an rcu-walk fails. Such an error must
1753 * be handled by restarting a traditional ref-walk (which will always
1754 * be able to complete).
1755 */
bd92d7fe 1756 err = path_init(dfd, name, flags | LOOKUP_PARENT, nd, &base);
ee0827cd 1757
bd92d7fe
AV		 1758 if (unlikely(err))
1759 return err;
ee0827cd
AV		 1760
1761 current->total_link_count = 0;
bd92d7fe
AV		 1762 err = link_path_walk(name, nd);
1763
1764 if (!err && !(flags & LOOKUP_PARENT)) {
bd92d7fe
AV		 1765 err = lookup_last(nd, &path);
1766 while (err > 0) {
1767 void *cookie;
1768 struct path link = path;
bd92d7fe 1769 nd->flags |= LOOKUP_PARENT;
574197e0 1770 err = follow_link(&link, nd, &cookie);
bd92d7fe
AV		 1771 if (!err)
1772 err = lookup_last(nd, &path);
574197e0 1773 put_link(nd, &link, cookie);
bd92d7fe
AV		 1774 }
1775 }
ee0827cd 1776
9f1fafee
AV		 1777 if (!err)
1778 err = complete_walk(nd);
bd92d7fe
AV		 1779
1780 if (!err && nd->flags & LOOKUP_DIRECTORY) {
1781 if (!nd->inode->i_op->lookup) {
1782 path_put(&nd->path);
bd23a539 1783 err = -ENOTDIR;
bd92d7fe
AV		 1784 }
1785 }
16c2cd71 1786
70e9b357
AV		 1787 if (base)
1788 fput(base);
ee0827cd 1789
5b6ca027 1790 if (nd->root.mnt && !(nd->flags & LOOKUP_ROOT)) {
2a737871
AV		 1791 path_put(&nd->root);
1792 nd->root.mnt = NULL;
1793 }
bd92d7fe 1794 return err;
ee0827cd 1795}
31e6b01f 1796
ee0827cd
AV		 1797static int do_path_lookup(int dfd, const char *name,
1798 unsigned int flags, struct nameidata *nd)
1799{
1800 int retval = path_lookupat(dfd, name, flags | LOOKUP_RCU, nd);
1801 if (unlikely(retval == -ECHILD))
1802 retval = path_lookupat(dfd, name, flags, nd);
1803 if (unlikely(retval == -ESTALE))
1804 retval = path_lookupat(dfd, name, flags | LOOKUP_REVAL, nd);
31e6b01f
NP		 1805
1806 if (likely(!retval)) {
1807 if (unlikely(!audit_dummy_context())) {
1808 if (nd->path.dentry && nd->inode)
1809 audit_inode(name, nd->path.dentry);
1810 }
1811 }
170aa3d0 1812 return retval;
1da177e4
LT		 1813}
1814
c9c6cac0 1815int kern_path_parent(const char *name, struct nameidata *nd)
5590ff0d 1816{
c9c6cac0 1817 return do_path_lookup(AT_FDCWD, name, LOOKUP_PARENT, nd);
5590ff0d
UD		 1818}
1819
d1811465
AV		 1820int kern_path(const char *name, unsigned int flags, struct path *path)
1821{
1822 struct nameidata nd;
1823 int res = do_path_lookup(AT_FDCWD, name, flags, &nd);
1824 if (!res)
1825 *path = nd.path;
1826 return res;
1827}
1828
16f18200
JJS		 1829/**
1830 * vfs_path_lookup - lookup a file path relative to a dentry-vfsmount pair
1831 * @dentry: pointer to dentry of the base directory
1832 * @mnt: pointer to vfs mount of the base directory
1833 * @name: pointer to file name
1834 * @flags: lookup flags
e0a01249 1835 * @path: pointer to struct path to fill
16f18200
JJS		 1836 */
1837int vfs_path_lookup(struct dentry *dentry, struct vfsmount *mnt,
1838 const char *name, unsigned int flags,
e0a01249 1839 struct path *path)
16f18200 1840{
e0a01249
AV		 1841 struct nameidata nd;
1842 int err;
1843 nd.root.dentry = dentry;
1844 nd.root.mnt = mnt;
1845 BUG_ON(flags & LOOKUP_PARENT);
5b6ca027 1846 /* the first argument of do_path_lookup() is ignored with LOOKUP_ROOT */
e0a01249
AV		 1847 err = do_path_lookup(AT_FDCWD, name, flags | LOOKUP_ROOT, &nd);
1848 if (!err)
1849 *path = nd.path;
1850 return err;
16f18200
JJS		 1851}
1852
eead1911
CH		 1853static struct dentry *__lookup_hash(struct qstr *name,
1854 struct dentry *base, struct nameidata *nd)
1da177e4 1855{
057f6c01 1856 struct dentry *dentry;
1da177e4 1857
b04f784e
NP		 1858 /*
1859 * Don't bother with __d_lookup: callers are for creat as
1860 * well as unlink, so a lot of the time it would cost
1861 * a double lookup.
6e6b1bd1 1862 */
b04f784e 1863 dentry = d_lookup(base, name);
6e6b1bd1 1864
44396f4b
JB		 1865 if (dentry && d_need_lookup(dentry)) {
1866 /*
1867 * __lookup_hash is called with the parent dir's i_mutex already
1868 * held, so we are good to go here.
1869 */
3637c05d 1870 return d_inode_lookup(base, dentry, nd);
44396f4b
JB		 1871 }
1872
d2d9e9fb
AV		 1873 if (dentry && (dentry->d_flags & DCACHE_OP_REVALIDATE)) {
1874 int status = d_revalidate(dentry, nd);
1875 if (unlikely(status <= 0)) {
1876 /*
1877 * The dentry failed validation.
1878 * If d_revalidate returned 0 attempt to invalidate
1879 * the dentry otherwise d_revalidate is asking us
1880 * to return a fail status.
1881 */
1882 if (status < 0) {
1883 dput(dentry);
1884 return ERR_PTR(status);
1885 } else if (!d_invalidate(dentry)) {
1886 dput(dentry);
1887 dentry = NULL;
1888 }
1889 }
1890 }
6e6b1bd1 1891
baa03890
NP		 1892 if (!dentry)
1893 dentry = d_alloc_and_lookup(base, name, nd);
5a202bcd 1894
1da177e4
LT		 1895 return dentry;
1896}
1897
057f6c01
JM		 1898/*
1899 * Restricted form of lookup. Doesn't follow links, single-component only,
1900 * needs parent already locked. Doesn't follow mounts.
1901 * SMP-safe.
1902 */
eead1911 1903static struct dentry *lookup_hash(struct nameidata *nd)
057f6c01 1904{
4ac91378 1905 return __lookup_hash(&nd->last, nd->path.dentry, nd);
1da177e4
LT		 1906}
1907
eead1911 1908/**
a6b91919 1909 * lookup_one_len - filesystem helper to lookup single pathname component
eead1911
CH		 1910 * @name: pathname component to lookup
1911 * @base: base directory to lookup from
1912 * @len: maximum length @len should be interpreted to
1913 *
a6b91919
RD		 1914 * Note that this routine is purely a helper for filesystem usage and should
1915 * not be called by generic code. Also note that by using this function the
eead1911
CH		 1916 * nameidata argument is passed to the filesystem methods and a filesystem
1917 * using this helper needs to be prepared for that.
1918 */
057f6c01
JM		 1919struct dentry *lookup_one_len(const char *name, struct dentry *base, int len)
1920{
057f6c01 1921 struct qstr this;
6a96ba54 1922 unsigned int c;
cda309de 1923 int err;
057f6c01 1924
2f9092e1
DW		 1925 WARN_ON_ONCE(!mutex_is_locked(&base->d_inode->i_mutex));
1926
6a96ba54
AV		 1927 this.name = name;
1928 this.len = len;
0145acc2 1929 this.hash = full_name_hash(name, len);
6a96ba54
AV		 1930 if (!len)
1931 return ERR_PTR(-EACCES);
1932
6a96ba54
AV		 1933 while (len--) {
1934 c = *(const unsigned char *)name++;
1935 if (c == '/' || c == '\0')
1936 return ERR_PTR(-EACCES);
6a96ba54 1937 }
5a202bcd
AV		 1938 /*
1939 * See if the low-level filesystem might want
1940 * to use its own hash..
1941 */
1942 if (base->d_flags & DCACHE_OP_HASH) {
1943 int err = base->d_op->d_hash(base, base->d_inode, &this);
1944 if (err < 0)
1945 return ERR_PTR(err);
1946 }
eead1911 1947
cda309de
MS		 1948 err = inode_permission(base->d_inode, MAY_EXEC);
1949 if (err)
1950 return ERR_PTR(err);
1951
49705b77 1952 return __lookup_hash(&this, base, NULL);
057f6c01
JM		 1953}
1954
1fa1e7f6
AW		 1955int user_path_at_empty(int dfd, const char __user *name, unsigned flags,
1956 struct path *path, int *empty)
1da177e4 1957{
2d8f3038 1958 struct nameidata nd;
1fa1e7f6 1959 char *tmp = getname_flags(name, flags, empty);
1da177e4 1960 int err = PTR_ERR(tmp);
1da177e4 1961 if (!IS_ERR(tmp)) {
2d8f3038
AV		 1962
1963 BUG_ON(flags & LOOKUP_PARENT);
1964
1965 err = do_path_lookup(dfd, tmp, flags, &nd);
1da177e4 1966 putname(tmp);
2d8f3038
AV		 1967 if (!err)
1968 *path = nd.path;
1da177e4
LT		 1969 }
1970 return err;
1971}
1972
1fa1e7f6
AW		 1973int user_path_at(int dfd, const char __user *name, unsigned flags,
1974 struct path *path)
1975{
f7493e5d 1976 return user_path_at_empty(dfd, name, flags, path, NULL);
1fa1e7f6
AW		 1977}
1978
2ad94ae6
AV		 1979static int user_path_parent(int dfd, const char __user *path,
1980 struct nameidata *nd, char **name)
1981{
1982 char *s = getname(path);
1983 int error;
1984
1985 if (IS_ERR(s))
1986 return PTR_ERR(s);
1987
1988 error = do_path_lookup(dfd, s, LOOKUP_PARENT, nd);
1989 if (error)
1990 putname(s);
1991 else
1992 *name = s;
1993
1994 return error;
1995}
1996
1da177e4
LT		 1997/*
1998 * It's inline, so penalty for filesystems that don't use sticky bit is
1999 * minimal.
2000 */
2001static inline int check_sticky(struct inode *dir, struct inode *inode)
2002{
da9592ed
DH		 2003 uid_t fsuid = current_fsuid();
2004
1da177e4
LT		 2005 if (!(dir->i_mode & S_ISVTX))
2006 return 0;
e795b717
SH		 2007 if (current_user_ns() != inode_userns(inode))
2008 goto other_userns;
da9592ed 2009 if (inode->i_uid == fsuid)
1da177e4 2010 return 0;
da9592ed 2011 if (dir->i_uid == fsuid)
1da177e4 2012 return 0;
e795b717
SH		 2013
2014other_userns:
2015 return !ns_capable(inode_userns(inode), CAP_FOWNER);
1da177e4
LT		 2016}
2017
2018/*
2019 * Check whether we can remove a link victim from directory dir, check
2020 * whether the type of victim is right.
2021 * 1. We can't do it if dir is read-only (done in permission())
2022 * 2. We should have write and exec permissions on dir
2023 * 3. We can't remove anything from append-only dir
2024 * 4. We can't do anything with immutable dir (done in permission())
2025 * 5. If the sticky bit on dir is set we should either
2026 * a. be owner of dir, or
2027 * b. be owner of victim, or
2028 * c. have CAP_FOWNER capability
2029 * 6. If the victim is append-only or immutable we can't do antyhing with
2030 * links pointing to it.
2031 * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR.
2032 * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR.
2033 * 9. We can't remove a root or mountpoint.
2034 * 10. We don't allow removal of NFS sillyrenamed files; it's handled by
2035 * nfs_async_unlink().
2036 */
858119e1 2037static int may_delete(struct inode *dir,struct dentry *victim,int isdir)
1da177e4
LT		 2038{
2039 int error;
2040
2041 if (!victim->d_inode)
2042 return -ENOENT;
2043
2044 BUG_ON(victim->d_parent->d_inode != dir);
cccc6bba 2045 audit_inode_child(victim, dir);
1da177e4 2046
f419a2e3 2047 error = inode_permission(dir, MAY_WRITE | MAY_EXEC);
1da177e4
LT		 2048 if (error)
2049 return error;
2050 if (IS_APPEND(dir))
2051 return -EPERM;
2052 if (check_sticky(dir, victim->d_inode)||IS_APPEND(victim->d_inode)||
f9454548 2053 IS_IMMUTABLE(victim->d_inode) || IS_SWAPFILE(victim->d_inode))
1da177e4
LT		 2054 return -EPERM;
2055 if (isdir) {
2056 if (!S_ISDIR(victim->d_inode->i_mode))
2057 return -ENOTDIR;
2058 if (IS_ROOT(victim))
2059 return -EBUSY;
2060 } else if (S_ISDIR(victim->d_inode->i_mode))
2061 return -EISDIR;
2062 if (IS_DEADDIR(dir))
2063 return -ENOENT;
2064 if (victim->d_flags & DCACHE_NFSFS_RENAMED)
2065 return -EBUSY;
2066 return 0;
2067}
2068
2069/* Check whether we can create an object with dentry child in directory
2070 * dir.
2071 * 1. We can't do it if child already exists (open has special treatment for
2072 * this case, but since we are inlined it's OK)
2073 * 2. We can't do it if dir is read-only (done in permission())
2074 * 3. We should have write and exec permissions on dir
2075 * 4. We can't do it if dir is immutable (done in permission())
2076 */
a95164d9 2077static inline int may_create(struct inode *dir, struct dentry *child)
1da177e4
LT		 2078{
2079 if (child->d_inode)
2080 return -EEXIST;
2081 if (IS_DEADDIR(dir))
2082 return -ENOENT;
f419a2e3 2083 return inode_permission(dir, MAY_WRITE | MAY_EXEC);
1da177e4
LT		 2084}
2085
1da177e4
LT		 2086/*
2087 * p1 and p2 should be directories on the same fs.
2088 */
2089struct dentry *lock_rename(struct dentry *p1, struct dentry *p2)
2090{
2091 struct dentry *p;
2092
2093 if (p1 == p2) {
f2eace23 2094 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1da177e4
LT		 2095 return NULL;
2096 }
2097
a11f3a05 2098 mutex_lock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1da177e4 2099
e2761a11
OH		 2100 p = d_ancestor(p2, p1);
2101 if (p) {
2102 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_PARENT);
2103 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_CHILD);
2104 return p;
1da177e4
LT		 2105 }
2106
e2761a11
OH		 2107 p = d_ancestor(p1, p2);
2108 if (p) {
2109 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
2110 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
2111 return p;
1da177e4
LT		 2112 }
2113
f2eace23
IM		 2114 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
2115 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1da177e4
LT		 2116 return NULL;
2117}
2118
2119void unlock_rename(struct dentry *p1, struct dentry *p2)
2120{
1b1dcc1b 2121 mutex_unlock(&p1->d_inode->i_mutex);
1da177e4 2122 if (p1 != p2) {
1b1dcc1b 2123 mutex_unlock(&p2->d_inode->i_mutex);
a11f3a05 2124 mutex_unlock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1da177e4
LT		 2125 }
2126}
2127
4acdaf27 2128int vfs_create(struct inode *dir, struct dentry *dentry, umode_t mode,
1da177e4
LT		 2129 struct nameidata *nd)
2130{
a95164d9 2131 int error = may_create(dir, dentry);
1da177e4
LT		 2132
2133 if (error)
2134 return error;
2135
acfa4380 2136 if (!dir->i_op->create)
1da177e4
LT		 2137 return -EACCES; /* shouldn't it be ENOSYS? */
2138 mode &= S_IALLUGO;
2139 mode |= S_IFREG;
2140 error = security_inode_create(dir, dentry, mode);
2141 if (error)
2142 return error;
1da177e4 2143 error = dir->i_op->create(dir, dentry, mode, nd);
a74574aa 2144 if (!error)
f38aa942 2145 fsnotify_create(dir, dentry);
1da177e4
LT		 2146 return error;
2147}
2148
73d049a4 2149static int may_open(struct path *path, int acc_mode, int flag)
1da177e4 2150{
3fb64190 2151 struct dentry *dentry = path->dentry;
1da177e4
LT		 2152 struct inode *inode = dentry->d_inode;
2153 int error;
2154
bcda7652
AV		 2155 /* O_PATH? */
2156 if (!acc_mode)
2157 return 0;
2158
1da177e4
LT		 2159 if (!inode)
2160 return -ENOENT;
2161
c8fe8f30
CH		 2162 switch (inode->i_mode & S_IFMT) {
2163 case S_IFLNK:
1da177e4 2164 return -ELOOP;
c8fe8f30
CH		 2165 case S_IFDIR:
2166 if (acc_mode & MAY_WRITE)
2167 return -EISDIR;
2168 break;
2169 case S_IFBLK:
2170 case S_IFCHR:
3fb64190 2171 if (path->mnt->mnt_flags & MNT_NODEV)
1da177e4 2172 return -EACCES;
c8fe8f30
CH		 2173 /*FALLTHRU*/
2174 case S_IFIFO:
2175 case S_IFSOCK:
1da177e4 2176 flag &= ~O_TRUNC;
c8fe8f30 2177 break;
4a3fd211 2178 }
b41572e9 2179
3fb64190 2180 error = inode_permission(inode, acc_mode);
b41572e9
DH		 2181 if (error)
2182 return error;
6146f0d5 2183
1da177e4
LT		 2184 /*
2185 * An append-only file must be opened in append mode for writing.
2186 */
2187 if (IS_APPEND(inode)) {
8737c930 2188 if ((flag & O_ACCMODE) != O_RDONLY && !(flag & O_APPEND))
7715b521 2189 return -EPERM;
1da177e4 2190 if (flag & O_TRUNC)
7715b521 2191 return -EPERM;
1da177e4
LT		 2192 }
2193
2194 /* O_NOATIME can only be set by the owner or superuser */
2e149670 2195 if (flag & O_NOATIME && !inode_owner_or_capable(inode))
7715b521 2196 return -EPERM;
1da177e4 2197
f3c7691e 2198 return 0;
7715b521 2199}
1da177e4 2200
e1181ee6 2201static int handle_truncate(struct file *filp)
7715b521 2202{
e1181ee6 2203 struct path *path = &filp->f_path;
7715b521
AV		 2204 struct inode *inode = path->dentry->d_inode;
2205 int error = get_write_access(inode);
2206 if (error)
2207 return error;
2208 /*
2209 * Refuse to truncate files with mandatory locks held on them.
2210 */
2211 error = locks_verify_locked(inode);
2212 if (!error)
ea0d3ab2 2213 error = security_path_truncate(path);
7715b521
AV		 2214 if (!error) {
2215 error = do_truncate(path->dentry, 0,
2216 ATTR_MTIME|ATTR_CTIME|ATTR_OPEN,
e1181ee6 2217 filp);
7715b521
AV		 2218 }
2219 put_write_access(inode);
acd0c935 2220 return error;
1da177e4
LT		 2221}
2222
d57999e1
DH		 2223static inline int open_to_namei_flags(int flag)
2224{
8a5e929d
AV		 2225 if ((flag & O_ACCMODE) == 3)
2226 flag--;
d57999e1
DH		 2227 return flag;
2228}
2229
31e6b01f 2230/*
fe2d35ff 2231 * Handle the last step of open()
31e6b01f 2232 */
fb1cc555 2233static struct file *do_last(struct nameidata *nd, struct path *path,
c3e380b0 2234 const struct open_flags *op, const char *pathname)
fb1cc555 2235{
a1e28038 2236 struct dentry *dir = nd->path.dentry;
6c0d46c4 2237 struct dentry *dentry;
ca344a89 2238 int open_flag = op->open_flag;
6c0d46c4 2239 int will_truncate = open_flag & O_TRUNC;
ca344a89 2240 int want_write = 0;
bcda7652 2241 int acc_mode = op->acc_mode;
fb1cc555 2242 struct file *filp;
16c2cd71 2243 int error;
1f36f774 2244
c3e380b0
AV		 2245 nd->flags &= ~LOOKUP_PARENT;
2246 nd->flags |= op->intent;
2247
1f36f774
AV		 2248 switch (nd->last_type) {
2249 case LAST_DOTDOT:
176306f5 2250 case LAST_DOT:
fe2d35ff
AV		 2251 error = handle_dots(nd, nd->last_type);
2252 if (error)
2253 return ERR_PTR(error);
1f36f774 2254 /* fallthrough */
1f36f774 2255 case LAST_ROOT:
9f1fafee 2256 error = complete_walk(nd);
16c2cd71 2257 if (error)
9f1fafee 2258 return ERR_PTR(error);
fe2d35ff 2259 audit_inode(pathname, nd->path.dentry);
ca344a89 2260 if (open_flag & O_CREAT) {
fe2d35ff
AV		 2261 error = -EISDIR;
2262 goto exit;
2263 }
2264 goto ok;
1f36f774 2265 case LAST_BIND:
9f1fafee 2266 error = complete_walk(nd);
16c2cd71 2267 if (error)
9f1fafee 2268 return ERR_PTR(error);
1f36f774 2269 audit_inode(pathname, dir);
67ee3ad2 2270 goto ok;
1f36f774 2271 }
67ee3ad2 2272
ca344a89 2273 if (!(open_flag & O_CREAT)) {
bcda7652 2274 int symlink_ok = 0;
fe2d35ff
AV		 2275 if (nd->last.name[nd->last.len])
2276 nd->flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY;
bcda7652
AV		 2277 if (open_flag & O_PATH && !(nd->flags & LOOKUP_FOLLOW))
2278 symlink_ok = 1;
fe2d35ff 2279 /* we _can_ be in RCU mode here */
ce57dfc1
AV		 2280 error = walk_component(nd, path, &nd->last, LAST_NORM,
2281 !symlink_ok);
2282 if (error < 0)
fe2d35ff 2283 return ERR_PTR(error);
ce57dfc1 2284 if (error) /* symlink */
fe2d35ff 2285 return NULL;
fe2d35ff 2286 /* sayonara */
9f1fafee
AV		 2287 error = complete_walk(nd);
2288 if (error)
7f6c7e62 2289 return ERR_PTR(error);
fe2d35ff
AV		 2290
2291 error = -ENOTDIR;
2292 if (nd->flags & LOOKUP_DIRECTORY) {
ce57dfc1 2293 if (!nd->inode->i_op->lookup)
fe2d35ff
AV		 2294 goto exit;
2295 }
2296 audit_inode(pathname, nd->path.dentry);
2297 goto ok;
2298 }
2299
2300 /* create side of things */
a3fbbde7
AV		 2301 /*
2302 * This will *only* deal with leaving RCU mode - LOOKUP_JUMPED has been
2303 * cleared when we got to the last component we are about to look up
2304 */
9f1fafee
AV		 2305 error = complete_walk(nd);
2306 if (error)
2307 return ERR_PTR(error);
fe2d35ff
AV		 2308
2309 audit_inode(pathname, dir);
16c2cd71 2310 error = -EISDIR;
1f36f774 2311 /* trailing slashes? */
31e6b01f
NP		 2312 if (nd->last.name[nd->last.len])
2313 goto exit;
a2c36b45 2314
a1e28038
AV		 2315 mutex_lock(&dir->d_inode->i_mutex);
2316
6c0d46c4
AV		 2317 dentry = lookup_hash(nd);
2318 error = PTR_ERR(dentry);
2319 if (IS_ERR(dentry)) {
fb1cc555
AV		 2320 mutex_unlock(&dir->d_inode->i_mutex);
2321 goto exit;
2322 }
2323
6c0d46c4
AV		 2324 path->dentry = dentry;
2325 path->mnt = nd->path.mnt;
2326
fb1cc555 2327 /* Negative dentry, just create the file */
6c0d46c4 2328 if (!dentry->d_inode) {
a218d0fd 2329 umode_t mode = op->mode;
6c0d46c4
AV		 2330 if (!IS_POSIXACL(dir->d_inode))
2331 mode &= ~current_umask();
fb1cc555
AV		 2332 /*
2333 * This write is needed to ensure that a
6c0d46c4 2334 * rw->ro transition does not occur between
fb1cc555
AV		 2335 * the time when the file is created and when
2336 * a permanent write count is taken through
2337 * the 'struct file' in nameidata_to_filp().
2338 */
2339 error = mnt_want_write(nd->path.mnt);
2340 if (error)
2341 goto exit_mutex_unlock;
ca344a89 2342 want_write = 1;
9b44f1b3 2343 /* Don't check for write permission, don't truncate */
ca344a89 2344 open_flag &= ~O_TRUNC;
6c0d46c4 2345 will_truncate = 0;
bcda7652 2346 acc_mode = MAY_OPEN;
6c0d46c4
AV		 2347 error = security_path_mknod(&nd->path, dentry, mode, 0);
2348 if (error)
2349 goto exit_mutex_unlock;
2350 error = vfs_create(dir->d_inode, dentry, mode, nd);
2351 if (error)
2352 goto exit_mutex_unlock;
2353 mutex_unlock(&dir->d_inode->i_mutex);
2354 dput(nd->path.dentry);
2355 nd->path.dentry = dentry;
ca344a89 2356 goto common;
fb1cc555
AV		 2357 }
2358
2359 /*
2360 * It already exists.
2361 */
2362 mutex_unlock(&dir->d_inode->i_mutex);
2363 audit_inode(pathname, path->dentry);
2364
2365 error = -EEXIST;
ca344a89 2366 if (open_flag & O_EXCL)
fb1cc555
AV		 2367 goto exit_dput;
2368
9875cf80
DH		 2369 error = follow_managed(path, nd->flags);
2370 if (error < 0)
2371 goto exit_dput;
fb1cc555 2372
a3fbbde7
AV		 2373 if (error)
2374 nd->flags |= LOOKUP_JUMPED;
2375
fb1cc555
AV		 2376 error = -ENOENT;
2377 if (!path->dentry->d_inode)
2378 goto exit_dput;
9e67f361
AV		 2379
2380 if (path->dentry->d_inode->i_op->follow_link)
fb1cc555 2381 return NULL;
fb1cc555
AV		 2382
2383 path_to_nameidata(path, nd);
31e6b01f 2384 nd->inode = path->dentry->d_inode;
a3fbbde7
AV		 2385 /* Why this, you ask? _Now_ we might have grown LOOKUP_JUMPED... */
2386 error = complete_walk(nd);
2387 if (error)
097b180c 2388 return ERR_PTR(error);
fb1cc555 2389 error = -EISDIR;
31e6b01f 2390 if (S_ISDIR(nd->inode->i_mode))
fb1cc555 2391 goto exit;
67ee3ad2 2392ok:
6c0d46c4
AV		 2393 if (!S_ISREG(nd->inode->i_mode))
2394 will_truncate = 0;
2395
0f9d1a10
AV		 2396 if (will_truncate) {
2397 error = mnt_want_write(nd->path.mnt);
2398 if (error)
2399 goto exit;
ca344a89 2400 want_write = 1;
0f9d1a10 2401 }
ca344a89 2402common:
bcda7652 2403 error = may_open(&nd->path, acc_mode, open_flag);
ca344a89 2404 if (error)
0f9d1a10 2405 goto exit;
0f9d1a10
AV		 2406 filp = nameidata_to_filp(nd);
2407 if (!IS_ERR(filp)) {
2408 error = ima_file_check(filp, op->acc_mode);
2409 if (error) {
2410 fput(filp);
2411 filp = ERR_PTR(error);
2412 }
2413 }
2414 if (!IS_ERR(filp)) {
2415 if (will_truncate) {
2416 error = handle_truncate(filp);
2417 if (error) {
2418 fput(filp);
2419 filp = ERR_PTR(error);
2420 }
2421 }
2422 }
ca344a89
AV		 2423out:
2424 if (want_write)
0f9d1a10
AV		 2425 mnt_drop_write(nd->path.mnt);
2426 path_put(&nd->path);
fb1cc555
AV		 2427 return filp;
2428
2429exit_mutex_unlock:
2430 mutex_unlock(&dir->d_inode->i_mutex);
2431exit_dput:
2432 path_put_conditional(path, nd);
2433exit:
ca344a89
AV		 2434 filp = ERR_PTR(error);
2435 goto out;
fb1cc555
AV		 2436}
2437
13aab428 2438static struct file *path_openat(int dfd, const char *pathname,
73d049a4 2439 struct nameidata *nd, const struct open_flags *op, int flags)
1da177e4 2440{
fe2d35ff 2441 struct file *base = NULL;
4a3fd211 2442 struct file *filp;
9850c056 2443 struct path path;
13aab428 2444 int error;
31e6b01f
NP		 2445
2446 filp = get_empty_filp();
2447 if (!filp)
2448 return ERR_PTR(-ENFILE);
2449
47c805dc 2450 filp->f_flags = op->open_flag;
73d049a4
AV		 2451 nd->intent.open.file = filp;
2452 nd->intent.open.flags = open_to_namei_flags(op->open_flag);
2453 nd->intent.open.create_mode = op->mode;
31e6b01f 2454
73d049a4 2455 error = path_init(dfd, pathname, flags | LOOKUP_PARENT, nd, &base);
31e6b01f 2456 if (unlikely(error))
13aab428 2457 goto out_filp;
31e6b01f 2458
fe2d35ff 2459 current->total_link_count = 0;
73d049a4 2460 error = link_path_walk(pathname, nd);
31e6b01f
NP		 2461 if (unlikely(error))
2462 goto out_filp;
1da177e4 2463
73d049a4 2464 filp = do_last(nd, &path, op, pathname);
806b681c 2465 while (unlikely(!filp)) { /* trailing symlink */
7b9337aa 2466 struct path link = path;
def4af30 2467 void *cookie;
574197e0 2468 if (!(nd->flags & LOOKUP_FOLLOW)) {
73d049a4
AV		 2469 path_put_conditional(&path, nd);
2470 path_put(&nd->path);
40b39136
AV		 2471 filp = ERR_PTR(-ELOOP);
2472 break;
2473 }
73d049a4
AV		 2474 nd->flags |= LOOKUP_PARENT;
2475 nd->flags &= ~(LOOKUP_OPEN|LOOKUP_CREATE|LOOKUP_EXCL);
574197e0 2476 error = follow_link(&link, nd, &cookie);
c3e380b0 2477 if (unlikely(error))
f1afe9ef 2478 filp = ERR_PTR(error);
c3e380b0 2479 else
73d049a4 2480 filp = do_last(nd, &path, op, pathname);
574197e0 2481 put_link(nd, &link, cookie);
806b681c 2482 }
10fa8e62 2483out:
73d049a4
AV		 2484 if (nd->root.mnt && !(nd->flags & LOOKUP_ROOT))
2485 path_put(&nd->root);
fe2d35ff
AV		 2486 if (base)
2487 fput(base);
73d049a4 2488 release_open_intent(nd);
10fa8e62 2489 return filp;
1da177e4 2490
31e6b01f 2491out_filp:
806b681c 2492 filp = ERR_PTR(error);
10fa8e62 2493 goto out;
1da177e4
LT		 2494}
2495
13aab428
AV		 2496struct file *do_filp_open(int dfd, const char *pathname,
2497 const struct open_flags *op, int flags)
2498{
73d049a4 2499 struct nameidata nd;
13aab428
AV		 2500 struct file *filp;
2501
73d049a4 2502 filp = path_openat(dfd, pathname, &nd, op, flags | LOOKUP_RCU);
13aab428 2503 if (unlikely(filp == ERR_PTR(-ECHILD)))
73d049a4 2504 filp = path_openat(dfd, pathname, &nd, op, flags);
13aab428 2505 if (unlikely(filp == ERR_PTR(-ESTALE)))
73d049a4 2506 filp = path_openat(dfd, pathname, &nd, op, flags | LOOKUP_REVAL);
13aab428
AV		 2507 return filp;
2508}
2509
73d049a4
AV		 2510struct file *do_file_open_root(struct dentry *dentry, struct vfsmount *mnt,
2511 const char *name, const struct open_flags *op, int flags)
2512{
2513 struct nameidata nd;
2514 struct file *file;
2515
2516 nd.root.mnt = mnt;
2517 nd.root.dentry = dentry;
2518
2519 flags |= LOOKUP_ROOT;
2520
bcda7652 2521 if (dentry->d_inode->i_op->follow_link && op->intent & LOOKUP_OPEN)
73d049a4
AV		 2522 return ERR_PTR(-ELOOP);
2523
2524 file = path_openat(-1, name, &nd, op, flags | LOOKUP_RCU);
2525 if (unlikely(file == ERR_PTR(-ECHILD)))
2526 file = path_openat(-1, name, &nd, op, flags);
2527 if (unlikely(file == ERR_PTR(-ESTALE)))
2528 file = path_openat(-1, name, &nd, op, flags | LOOKUP_REVAL);
2529 return file;
2530}
2531
ed75e95d 2532struct dentry *kern_path_create(int dfd, const char *pathname, struct path *path, int is_dir)
1da177e4 2533{
c663e5d8 2534 struct dentry *dentry = ERR_PTR(-EEXIST);
ed75e95d
AV		 2535 struct nameidata nd;
2536 int error = do_path_lookup(dfd, pathname, LOOKUP_PARENT, &nd);
2537 if (error)
2538 return ERR_PTR(error);
1da177e4 2539
c663e5d8
CH		 2540 /*
2541 * Yucky last component or no last component at all?
2542 * (foo/., foo/.., /////)
2543 */
ed75e95d
AV		 2544 if (nd.last_type != LAST_NORM)
2545 goto out;
2546 nd.flags &= ~LOOKUP_PARENT;
2547 nd.flags |= LOOKUP_CREATE | LOOKUP_EXCL;
2548 nd.intent.open.flags = O_EXCL;
c663e5d8
CH		 2549
2550 /*
2551 * Do the final lookup.
2552 */
ed75e95d
AV		 2553 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2554 dentry = lookup_hash(&nd);
1da177e4
LT		 2555 if (IS_ERR(dentry))
2556 goto fail;
c663e5d8 2557
e9baf6e5
AV		 2558 if (dentry->d_inode)
2559 goto eexist;
c663e5d8
CH		 2560 /*
2561 * Special case - lookup gave negative, but... we had foo/bar/
2562 * From the vfs_mknod() POV we just have a negative dentry -
2563 * all is fine. Let's be bastards - you had / on the end, you've
2564 * been asking for (non-existent) directory. -ENOENT for you.
2565 */
ed75e95d 2566 if (unlikely(!is_dir && nd.last.name[nd.last.len])) {
e9baf6e5
AV		 2567 dput(dentry);
2568 dentry = ERR_PTR(-ENOENT);
ed75e95d 2569 goto fail;
e9baf6e5 2570 }
ed75e95d 2571 *path = nd.path;
1da177e4 2572 return dentry;
e9baf6e5 2573eexist:
1da177e4 2574 dput(dentry);
e9baf6e5 2575 dentry = ERR_PTR(-EEXIST);
1da177e4 2576fail:
ed75e95d
AV		 2577 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2578out:
2579 path_put(&nd.path);
1da177e4
LT		 2580 return dentry;
2581}
dae6ad8f
AV		 2582EXPORT_SYMBOL(kern_path_create);
2583
2584struct dentry *user_path_create(int dfd, const char __user *pathname, struct path *path, int is_dir)
2585{
2586 char *tmp = getname(pathname);
2587 struct dentry *res;
2588 if (IS_ERR(tmp))
2589 return ERR_CAST(tmp);
2590 res = kern_path_create(dfd, tmp, path, is_dir);
2591 putname(tmp);
2592 return res;
2593}
2594EXPORT_SYMBOL(user_path_create);
2595
1a67aafb 2596int vfs_mknod(struct inode *dir, struct dentry *dentry, umode_t mode, dev_t dev)
1da177e4 2597{
a95164d9 2598 int error = may_create(dir, dentry);
1da177e4
LT		 2599
2600 if (error)
2601 return error;
2602
e795b717
SH		 2603 if ((S_ISCHR(mode) || S_ISBLK(mode)) &&
2604 !ns_capable(inode_userns(dir), CAP_MKNOD))
1da177e4
LT		 2605 return -EPERM;
2606
acfa4380 2607 if (!dir->i_op->mknod)
1da177e4
LT		 2608 return -EPERM;
2609
08ce5f16
SH		 2610 error = devcgroup_inode_mknod(mode, dev);
2611 if (error)
2612 return error;
2613
1da177e4
LT		 2614 error = security_inode_mknod(dir, dentry, mode, dev);
2615 if (error)
2616 return error;
2617
1da177e4 2618 error = dir->i_op->mknod(dir, dentry, mode, dev);
a74574aa 2619 if (!error)
f38aa942 2620 fsnotify_create(dir, dentry);
1da177e4
LT		 2621 return error;
2622}
2623
f69aac00 2624static int may_mknod(umode_t mode)
463c3197
DH		 2625{
2626 switch (mode & S_IFMT) {
2627 case S_IFREG:
2628 case S_IFCHR:
2629 case S_IFBLK:
2630 case S_IFIFO:
2631 case S_IFSOCK:
2632 case 0: /* zero mode translates to S_IFREG */
2633 return 0;
2634 case S_IFDIR:
2635 return -EPERM;
2636 default:
2637 return -EINVAL;
2638 }
2639}
2640
8208a22b 2641SYSCALL_DEFINE4(mknodat, int, dfd, const char __user *, filename, umode_t, mode,
2e4d0924 2642 unsigned, dev)
1da177e4 2643{
2ad94ae6 2644 struct dentry *dentry;
dae6ad8f
AV		 2645 struct path path;
2646 int error;
1da177e4
LT		 2647
2648 if (S_ISDIR(mode))
2649 return -EPERM;
1da177e4 2650
dae6ad8f
AV		 2651 dentry = user_path_create(dfd, filename, &path, 0);
2652 if (IS_ERR(dentry))
2653 return PTR_ERR(dentry);
2ad94ae6 2654
dae6ad8f 2655 if (!IS_POSIXACL(path.dentry->d_inode))
ce3b0f8d 2656 mode &= ~current_umask();
463c3197
DH		 2657 error = may_mknod(mode);
2658 if (error)
2659 goto out_dput;
dae6ad8f 2660 error = mnt_want_write(path.mnt);
463c3197
DH		 2661 if (error)
2662 goto out_dput;
dae6ad8f 2663 error = security_path_mknod(&path, dentry, mode, dev);
be6d3e56
KT		 2664 if (error)
2665 goto out_drop_write;
463c3197 2666 switch (mode & S_IFMT) {
1da177e4 2667 case 0: case S_IFREG:
dae6ad8f 2668 error = vfs_create(path.dentry->d_inode,dentry,mode,NULL);
1da177e4
LT		 2669 break;
2670 case S_IFCHR: case S_IFBLK:
dae6ad8f 2671 error = vfs_mknod(path.dentry->d_inode,dentry,mode,
1da177e4
LT		 2672 new_decode_dev(dev));
2673 break;
2674 case S_IFIFO: case S_IFSOCK:
dae6ad8f 2675 error = vfs_mknod(path.dentry->d_inode,dentry,mode,0);
1da177e4 2676 break;
1da177e4 2677 }
be6d3e56 2678out_drop_write:
dae6ad8f 2679 mnt_drop_write(path.mnt);
463c3197
DH		 2680out_dput:
2681 dput(dentry);
dae6ad8f
AV		 2682 mutex_unlock(&path.dentry->d_inode->i_mutex);
2683 path_put(&path);
1da177e4
LT		 2684
2685 return error;
2686}
2687
8208a22b 2688SYSCALL_DEFINE3(mknod, const char __user *, filename, umode_t, mode, unsigned, dev)
5590ff0d
UD		 2689{
2690 return sys_mknodat(AT_FDCWD, filename, mode, dev);
2691}
2692
18bb1db3 2693int vfs_mkdir(struct inode *dir, struct dentry *dentry, umode_t mode)
1da177e4 2694{
a95164d9 2695 int error = may_create(dir, dentry);
8de52778 2696 unsigned max_links = dir->i_sb->s_max_links;
1da177e4
LT		 2697
2698 if (error)
2699 return error;
2700
acfa4380 2701 if (!dir->i_op->mkdir)
1da177e4
LT		 2702 return -EPERM;
2703
2704 mode &= (S_IRWXUGO|S_ISVTX);
2705 error = security_inode_mkdir(dir, dentry, mode);
2706 if (error)
2707 return error;
2708
8de52778
AV		 2709 if (max_links && dir->i_nlink >= max_links)
2710 return -EMLINK;
2711
1da177e4 2712 error = dir->i_op->mkdir(dir, dentry, mode);
a74574aa 2713 if (!error)
f38aa942 2714 fsnotify_mkdir(dir, dentry);
1da177e4
LT		 2715 return error;
2716}
2717
a218d0fd 2718SYSCALL_DEFINE3(mkdirat, int, dfd, const char __user *, pathname, umode_t, mode)
1da177e4 2719{
6902d925 2720 struct dentry *dentry;
dae6ad8f
AV		 2721 struct path path;
2722 int error;
1da177e4 2723
dae6ad8f 2724 dentry = user_path_create(dfd, pathname, &path, 1);
6902d925 2725 if (IS_ERR(dentry))
dae6ad8f 2726 return PTR_ERR(dentry);
1da177e4 2727
dae6ad8f 2728 if (!IS_POSIXACL(path.dentry->d_inode))
ce3b0f8d 2729 mode &= ~current_umask();
dae6ad8f 2730 error = mnt_want_write(path.mnt);
463c3197
DH		 2731 if (error)
2732 goto out_dput;
dae6ad8f 2733 error = security_path_mkdir(&path, dentry, mode);
be6d3e56
KT		 2734 if (error)
2735 goto out_drop_write;
dae6ad8f 2736 error = vfs_mkdir(path.dentry->d_inode, dentry, mode);
be6d3e56 2737out_drop_write:
dae6ad8f 2738 mnt_drop_write(path.mnt);
463c3197 2739out_dput:
6902d925 2740 dput(dentry);
dae6ad8f
AV		 2741 mutex_unlock(&path.dentry->d_inode->i_mutex);
2742 path_put(&path);
1da177e4
LT		 2743 return error;
2744}
2745
a218d0fd 2746SYSCALL_DEFINE2(mkdir, const char __user *, pathname, umode_t, mode)
5590ff0d
UD		 2747{
2748 return sys_mkdirat(AT_FDCWD, pathname, mode);
2749}
2750
1da177e4 2751/*
a71905f0
SW		 2752 * The dentry_unhash() helper will try to drop the dentry early: we
2753 * should have a usage count of 2 if we're the only user of this
2754 * dentry, and if that is true (possibly after pruning the dcache),
2755 * then we drop the dentry now.
1da177e4
LT		 2756 *
2757 * A low-level filesystem can, if it choses, legally
2758 * do a
2759 *
2760 * if (!d_unhashed(dentry))
2761 * return -EBUSY;
2762 *
2763 * if it cannot handle the case of removing a directory
2764 * that is still in use by something else..
2765 */
2766void dentry_unhash(struct dentry *dentry)
2767{
dc168427 2768 shrink_dcache_parent(dentry);
1da177e4 2769 spin_lock(&dentry->d_lock);
64252c75 2770 if (dentry->d_count == 1)
1da177e4
LT		 2771 __d_drop(dentry);
2772 spin_unlock(&dentry->d_lock);
1da177e4
LT		 2773}
2774
2775int vfs_rmdir(struct inode *dir, struct dentry *dentry)
2776{
2777 int error = may_delete(dir, dentry, 1);
2778
2779 if (error)
2780 return error;
2781
acfa4380 2782 if (!dir->i_op->rmdir)
1da177e4
LT		 2783 return -EPERM;
2784
1d2ef590 2785 dget(dentry);
1b1dcc1b 2786 mutex_lock(&dentry->d_inode->i_mutex);
912dbc15
SW		 2787
2788 error = -EBUSY;
1da177e4 2789 if (d_mountpoint(dentry))
912dbc15
SW		 2790 goto out;
2791
2792 error = security_inode_rmdir(dir, dentry);
2793 if (error)
2794 goto out;
2795
3cebde24 2796 shrink_dcache_parent(dentry);
912dbc15
SW		 2797 error = dir->i_op->rmdir(dir, dentry);
2798 if (error)
2799 goto out;
2800
2801 dentry->d_inode->i_flags |= S_DEAD;
2802 dont_mount(dentry);
2803
2804out:
1b1dcc1b 2805 mutex_unlock(&dentry->d_inode->i_mutex);
1d2ef590 2806 dput(dentry);
912dbc15 2807 if (!error)
1da177e4 2808 d_delete(dentry);
1da177e4
LT		 2809 return error;
2810}
2811
5590ff0d 2812static long do_rmdir(int dfd, const char __user *pathname)
1da177e4
LT		 2813{
2814 int error = 0;
2815 char * name;
2816 struct dentry *dentry;
2817 struct nameidata nd;
2818
2ad94ae6 2819 error = user_path_parent(dfd, pathname, &nd, &name);
1da177e4 2820 if (error)
2ad94ae6 2821 return error;
1da177e4
LT		 2822
2823 switch(nd.last_type) {
0612d9fb
OH		 2824 case LAST_DOTDOT:
2825 error = -ENOTEMPTY;
2826 goto exit1;
2827 case LAST_DOT:
2828 error = -EINVAL;
2829 goto exit1;
2830 case LAST_ROOT:
2831 error = -EBUSY;
2832 goto exit1;
1da177e4 2833 }
0612d9fb
OH		 2834
2835 nd.flags &= ~LOOKUP_PARENT;
2836
4ac91378 2837 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
49705b77 2838 dentry = lookup_hash(&nd);
1da177e4 2839 error = PTR_ERR(dentry);
6902d925
DH		 2840 if (IS_ERR(dentry))
2841 goto exit2;
e6bc45d6
TT		 2842 if (!dentry->d_inode) {
2843 error = -ENOENT;
2844 goto exit3;
2845 }
0622753b
DH		 2846 error = mnt_want_write(nd.path.mnt);
2847 if (error)
2848 goto exit3;
be6d3e56
KT		 2849 error = security_path_rmdir(&nd.path, dentry);
2850 if (error)
2851 goto exit4;
4ac91378 2852 error = vfs_rmdir(nd.path.dentry->d_inode, dentry);
be6d3e56 2853exit4:
0622753b
DH		 2854 mnt_drop_write(nd.path.mnt);
2855exit3:
6902d925
DH		 2856 dput(dentry);
2857exit2:
4ac91378 2858 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
1da177e4 2859exit1:
1d957f9b 2860 path_put(&nd.path);
1da177e4
LT		 2861 putname(name);
2862 return error;
2863}
2864
3cdad428 2865SYSCALL_DEFINE1(rmdir, const char __user *, pathname)
5590ff0d
UD		 2866{
2867 return do_rmdir(AT_FDCWD, pathname);
2868}
2869
1da177e4
LT		 2870int vfs_unlink(struct inode *dir, struct dentry *dentry)
2871{
2872 int error = may_delete(dir, dentry, 0);
2873
2874 if (error)
2875 return error;
2876
acfa4380 2877 if (!dir->i_op->unlink)
1da177e4
LT		 2878 return -EPERM;
2879
1b1dcc1b 2880 mutex_lock(&dentry->d_inode->i_mutex);
1da177e4
LT		 2881 if (d_mountpoint(dentry))
2882 error = -EBUSY;
2883 else {
2884 error = security_inode_unlink(dir, dentry);
bec1052e 2885 if (!error) {
1da177e4 2886 error = dir->i_op->unlink(dir, dentry);
bec1052e 2887 if (!error)
d83c49f3 2888 dont_mount(dentry);
bec1052e 2889 }
1da177e4 2890 }
1b1dcc1b 2891 mutex_unlock(&dentry->d_inode->i_mutex);
1da177e4
LT		 2892
2893 /* We don't d_delete() NFS sillyrenamed files--they still exist. */
2894 if (!error && !(dentry->d_flags & DCACHE_NFSFS_RENAMED)) {
ece95912 2895 fsnotify_link_count(dentry->d_inode);
e234f35c 2896 d_delete(dentry);
1da177e4 2897 }
0eeca283 2898
1da177e4
LT		 2899 return error;
2900}
2901
2902/*
2903 * Make sure that the actual truncation of the file will occur outside its
1b1dcc1b 2904 * directory's i_mutex. Truncate can take a long time if there is a lot of
1da177e4
LT		 2905 * writeout happening, and we don't want to prevent access to the directory
2906 * while waiting on the I/O.
2907 */
5590ff0d 2908static long do_unlinkat(int dfd, const char __user *pathname)
1da177e4 2909{
2ad94ae6
AV		 2910 int error;
2911 char *name;
1da177e4
LT		 2912 struct dentry *dentry;
2913 struct nameidata nd;
2914 struct inode *inode = NULL;
2915
2ad94ae6 2916 error = user_path_parent(dfd, pathname, &nd, &name);
1da177e4 2917 if (error)
2ad94ae6
AV		 2918 return error;
2919
1da177e4
LT		 2920 error = -EISDIR;
2921 if (nd.last_type != LAST_NORM)
2922 goto exit1;
0612d9fb
OH		 2923
2924 nd.flags &= ~LOOKUP_PARENT;
2925
4ac91378 2926 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
49705b77 2927 dentry = lookup_hash(&nd);
1da177e4
LT		 2928 error = PTR_ERR(dentry);
2929 if (!IS_ERR(dentry)) {
2930 /* Why not before? Because we want correct error value */
50338b88
TE		 2931 if (nd.last.name[nd.last.len])
2932 goto slashes;
1da177e4 2933 inode = dentry->d_inode;
50338b88 2934 if (!inode)
e6bc45d6
TT		 2935 goto slashes;
2936 ihold(inode);
0622753b
DH		 2937 error = mnt_want_write(nd.path.mnt);
2938 if (error)
2939 goto exit2;
be6d3e56
KT		 2940 error = security_path_unlink(&nd.path, dentry);
2941 if (error)
2942 goto exit3;
4ac91378 2943 error = vfs_unlink(nd.path.dentry->d_inode, dentry);
be6d3e56 2944exit3:
0622753b 2945 mnt_drop_write(nd.path.mnt);
1da177e4
LT		 2946 exit2:
2947 dput(dentry);
2948 }
4ac91378 2949 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
1da177e4
LT		 2950 if (inode)
2951 iput(inode); /* truncate the inode here */
2952exit1:
1d957f9b 2953 path_put(&nd.path);
1da177e4
LT		 2954 putname(name);
2955 return error;
2956
2957slashes:
2958 error = !dentry->d_inode ? -ENOENT :
2959 S_ISDIR(dentry->d_inode->i_mode) ? -EISDIR : -ENOTDIR;
2960 goto exit2;
2961}
2962
2e4d0924 2963SYSCALL_DEFINE3(unlinkat, int, dfd, const char __user *, pathname, int, flag)
5590ff0d
UD		 2964{
2965 if ((flag & ~AT_REMOVEDIR) != 0)
2966 return -EINVAL;
2967
2968 if (flag & AT_REMOVEDIR)
2969 return do_rmdir(dfd, pathname);
2970
2971 return do_unlinkat(dfd, pathname);
2972}
2973
3480b257 2974SYSCALL_DEFINE1(unlink, const char __user *, pathname)
5590ff0d
UD		 2975{
2976 return do_unlinkat(AT_FDCWD, pathname);
2977}
2978
db2e747b 2979int vfs_symlink(struct inode *dir, struct dentry *dentry, const char *oldname)
1da177e4 2980{
a95164d9 2981 int error = may_create(dir, dentry);
1da177e4
LT		 2982
2983 if (error)
2984 return error;
2985
acfa4380 2986 if (!dir->i_op->symlink)
1da177e4
LT		 2987 return -EPERM;
2988
2989 error = security_inode_symlink(dir, dentry, oldname);
2990 if (error)
2991 return error;
2992
1da177e4 2993 error = dir->i_op->symlink(dir, dentry, oldname);
a74574aa 2994 if (!error)
f38aa942 2995 fsnotify_create(dir, dentry);
1da177e4
LT		 2996 return error;
2997}
2998
2e4d0924
HC		 2999SYSCALL_DEFINE3(symlinkat, const char __user *, oldname,
3000 int, newdfd, const char __user *, newname)
1da177e4 3001{
2ad94ae6
AV		 3002 int error;
3003 char *from;
6902d925 3004 struct dentry *dentry;
dae6ad8f 3005 struct path path;
1da177e4
LT		 3006
3007 from = getname(oldname);
2ad94ae6 3008 if (IS_ERR(from))
1da177e4 3009 return PTR_ERR(from);
1da177e4 3010
dae6ad8f 3011 dentry = user_path_create(newdfd, newname, &path, 0);
6902d925
DH		 3012 error = PTR_ERR(dentry);
3013 if (IS_ERR(dentry))
dae6ad8f 3014 goto out_putname;
6902d925 3015
dae6ad8f 3016 error = mnt_want_write(path.mnt);
75c3f29d
DH		 3017 if (error)
3018 goto out_dput;
dae6ad8f 3019 error = security_path_symlink(&path, dentry, from);
be6d3e56
KT		 3020 if (error)
3021 goto out_drop_write;
dae6ad8f 3022 error = vfs_symlink(path.dentry->d_inode, dentry, from);
be6d3e56 3023out_drop_write:
dae6ad8f 3024 mnt_drop_write(path.mnt);
75c3f29d 3025out_dput:
6902d925 3026 dput(dentry);
dae6ad8f
AV		 3027 mutex_unlock(&path.dentry->d_inode->i_mutex);
3028 path_put(&path);
6902d925 3029out_putname:
1da177e4
LT		 3030 putname(from);
3031 return error;
3032}
3033
3480b257 3034SYSCALL_DEFINE2(symlink, const char __user *, oldname, const char __user *, newname)
5590ff0d
UD		 3035{
3036 return sys_symlinkat(oldname, AT_FDCWD, newname);
3037}
3038
1da177e4
LT		 3039int vfs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *new_dentry)
3040{
3041 struct inode *inode = old_dentry->d_inode;
8de52778 3042 unsigned max_links = dir->i_sb->s_max_links;
1da177e4
LT		 3043 int error;
3044
3045 if (!inode)
3046 return -ENOENT;
3047
a95164d9 3048 error = may_create(dir, new_dentry);
1da177e4
LT		 3049 if (error)
3050 return error;
3051
3052 if (dir->i_sb != inode->i_sb)
3053 return -EXDEV;
3054
3055 /*
3056 * A link to an append-only or immutable file cannot be created.
3057 */
3058 if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
3059 return -EPERM;
acfa4380 3060 if (!dir->i_op->link)
1da177e4 3061 return -EPERM;
7e79eedb 3062 if (S_ISDIR(inode->i_mode))
1da177e4
LT		 3063 return -EPERM;
3064
3065 error = security_inode_link(old_dentry, dir, new_dentry);
3066 if (error)
3067 return error;
3068
7e79eedb 3069 mutex_lock(&inode->i_mutex);
aae8a97d
AK		 3070 /* Make sure we don't allow creating hardlink to an unlinked file */
3071 if (inode->i_nlink == 0)
3072 error = -ENOENT;
8de52778
AV		 3073 else if (max_links && inode->i_nlink >= max_links)
3074 error = -EMLINK;
aae8a97d
AK		 3075 else
3076 error = dir->i_op->link(old_dentry, dir, new_dentry);
7e79eedb 3077 mutex_unlock(&inode->i_mutex);
e31e14ec 3078 if (!error)
7e79eedb 3079 fsnotify_link(dir, inode, new_dentry);
1da177e4
LT		 3080 return error;
3081}
3082
3083/*
3084 * Hardlinks are often used in delicate situations. We avoid
3085 * security-related surprises by not following symlinks on the
3086 * newname. --KAB
3087 *
3088 * We don't follow them on the oldname either to be compatible
3089 * with linux 2.0, and to avoid hard-linking to directories
3090 * and other special files. --ADM
3091 */
2e4d0924
HC		 3092SYSCALL_DEFINE5(linkat, int, olddfd, const char __user *, oldname,
3093 int, newdfd, const char __user *, newname, int, flags)
1da177e4
LT		 3094{
3095 struct dentry *new_dentry;
dae6ad8f 3096 struct path old_path, new_path;
11a7b371 3097 int how = 0;
1da177e4 3098 int error;
1da177e4 3099
11a7b371 3100 if ((flags & ~(AT_SYMLINK_FOLLOW | AT_EMPTY_PATH)) != 0)
c04030e1 3101 return -EINVAL;
11a7b371
AK		 3102 /*
3103 * To use null names we require CAP_DAC_READ_SEARCH
3104 * This ensures that not everyone will be able to create
3105 * handlink using the passed filedescriptor.
3106 */
3107 if (flags & AT_EMPTY_PATH) {
3108 if (!capable(CAP_DAC_READ_SEARCH))
3109 return -ENOENT;
3110 how = LOOKUP_EMPTY;
3111 }
3112
3113 if (flags & AT_SYMLINK_FOLLOW)
3114 how |= LOOKUP_FOLLOW;
c04030e1 3115
11a7b371 3116 error = user_path_at(olddfd, oldname, how, &old_path);
1da177e4 3117 if (error)
2ad94ae6
AV		 3118 return error;
3119
dae6ad8f 3120 new_dentry = user_path_create(newdfd, newname, &new_path, 0);
1da177e4 3121 error = PTR_ERR(new_dentry);
6902d925 3122 if (IS_ERR(new_dentry))
dae6ad8f
AV		 3123 goto out;
3124
3125 error = -EXDEV;
3126 if (old_path.mnt != new_path.mnt)
3127 goto out_dput;
3128 error = mnt_want_write(new_path.mnt);
75c3f29d
DH		 3129 if (error)
3130 goto out_dput;
dae6ad8f 3131 error = security_path_link(old_path.dentry, &new_path, new_dentry);
be6d3e56
KT		 3132 if (error)
3133 goto out_drop_write;
dae6ad8f 3134 error = vfs_link(old_path.dentry, new_path.dentry->d_inode, new_dentry);
be6d3e56 3135out_drop_write:
dae6ad8f 3136 mnt_drop_write(new_path.mnt);
75c3f29d 3137out_dput:
6902d925 3138 dput(new_dentry);
dae6ad8f
AV		 3139 mutex_unlock(&new_path.dentry->d_inode->i_mutex);
3140 path_put(&new_path);
1da177e4 3141out:
2d8f3038 3142 path_put(&old_path);
1da177e4
LT		 3143
3144 return error;
3145}
3146
3480b257 3147SYSCALL_DEFINE2(link, const char __user *, oldname, const char __user *, newname)
5590ff0d 3148{
c04030e1 3149 return sys_linkat(AT_FDCWD, oldname, AT_FDCWD, newname, 0);
5590ff0d
UD		 3150}
3151
1da177e4
LT		 3152/*
3153 * The worst of all namespace operations - renaming directory. "Perverted"
3154 * doesn't even start to describe it. Somebody in UCB had a heck of a trip...
3155 * Problems:
3156 * a) we can get into loop creation. Check is done in is_subdir().
3157 * b) race potential - two innocent renames can create a loop together.
3158 * That's where 4.4 screws up. Current fix: serialization on
a11f3a05 3159 * sb->s_vfs_rename_mutex. We might be more accurate, but that's another
1da177e4
LT		 3160 * story.
3161 * c) we have to lock _three_ objects - parents and victim (if it exists).
1b1dcc1b 3162 * And that - after we got ->i_mutex on parents (until then we don't know
1da177e4
LT		 3163 * whether the target exists). Solution: try to be smart with locking
3164 * order for inodes. We rely on the fact that tree topology may change
a11f3a05 3165 * only under ->s_vfs_rename_mutex _and_ that parent of the object we
1da177e4
LT		 3166 * move will be locked. Thus we can rank directories by the tree
3167 * (ancestors first) and rank all non-directories after them.
3168 * That works since everybody except rename does "lock parent, lookup,
a11f3a05 3169 * lock child" and rename is under ->s_vfs_rename_mutex.
1da177e4
LT		 3170 * HOWEVER, it relies on the assumption that any object with ->lookup()
3171 * has no more than 1 dentry. If "hybrid" objects will ever appear,
3172 * we'd better make sure that there's no link(2) for them.
e4eaac06 3173 * d) conversion from fhandle to dentry may come in the wrong moment - when
1b1dcc1b 3174 * we are removing the target. Solution: we will have to grab ->i_mutex
1da177e4 3175 * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on
c41b20e7 3176 * ->i_mutex on parents, which works but leads to some truly excessive
1da177e4
LT		 3177 * locking].
3178 */
75c96f85
AB		 3179static int vfs_rename_dir(struct inode *old_dir, struct dentry *old_dentry,
3180 struct inode *new_dir, struct dentry *new_dentry)
1da177e4
LT		 3181{
3182 int error = 0;
9055cba7 3183 struct inode *target = new_dentry->d_inode;
8de52778 3184 unsigned max_links = new_dir->i_sb->s_max_links;
1da177e4
LT		 3185
3186 /*
3187 * If we are going to change the parent - check write permissions,
3188 * we'll need to flip '..'.
3189 */
3190 if (new_dir != old_dir) {
f419a2e3 3191 error = inode_permission(old_dentry->d_inode, MAY_WRITE);
1da177e4
LT		 3192 if (error)
3193 return error;
3194 }
3195
3196 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
3197 if (error)
3198 return error;
3199
1d2ef590 3200 dget(new_dentry);
d83c49f3 3201 if (target)
1b1dcc1b 3202 mutex_lock(&target->i_mutex);
9055cba7
SW		 3203
3204 error = -EBUSY;
3205 if (d_mountpoint(old_dentry) || d_mountpoint(new_dentry))
3206 goto out;
3207
8de52778
AV		 3208 error = -EMLINK;
3209 if (max_links && !target && new_dir != old_dir &&
3210 new_dir->i_nlink >= max_links)
3211 goto out;
3212
3cebde24
SW		 3213 if (target)
3214 shrink_dcache_parent(new_dentry);
9055cba7
SW		 3215 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
3216 if (error)
3217 goto out;
3218
1da177e4 3219 if (target) {
9055cba7
SW		 3220 target->i_flags |= S_DEAD;
3221 dont_mount(new_dentry);
1da177e4 3222 }
9055cba7
SW		 3223out:
3224 if (target)
3225 mutex_unlock(&target->i_mutex);
1d2ef590 3226 dput(new_dentry);
e31e14ec 3227 if (!error)
349457cc
MF		 3228 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
3229 d_move(old_dentry,new_dentry);
1da177e4
LT		 3230 return error;
3231}
3232
75c96f85
AB		 3233static int vfs_rename_other(struct inode *old_dir, struct dentry *old_dentry,
3234 struct inode *new_dir, struct dentry *new_dentry)
1da177e4 3235{
51892bbb 3236 struct inode *target = new_dentry->d_inode;
1da177e4
LT		 3237 int error;
3238
3239 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
3240 if (error)
3241 return error;
3242
3243 dget(new_dentry);
1da177e4 3244 if (target)
1b1dcc1b 3245 mutex_lock(&target->i_mutex);
51892bbb
SW		 3246
3247 error = -EBUSY;
1da177e4 3248 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
51892bbb
SW		 3249 goto out;
3250
3251 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
3252 if (error)
3253 goto out;
3254
3255 if (target)
3256 dont_mount(new_dentry);
3257 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
3258 d_move(old_dentry, new_dentry);
3259out:
1da177e4 3260 if (target)
1b1dcc1b 3261 mutex_unlock(&target->i_mutex);
1da177e4
LT		 3262 dput(new_dentry);
3263 return error;
3264}
3265
3266int vfs_rename(struct inode *old_dir, struct dentry *old_dentry,
3267 struct inode *new_dir, struct dentry *new_dentry)
3268{
3269 int error;
3270 int is_dir = S_ISDIR(old_dentry->d_inode->i_mode);
59b0df21 3271 const unsigned char *old_name;
1da177e4
LT		 3272
3273 if (old_dentry->d_inode == new_dentry->d_inode)
3274 return 0;
3275
3276 error = may_delete(old_dir, old_dentry, is_dir);
3277 if (error)
3278 return error;
3279
3280 if (!new_dentry->d_inode)
a95164d9 3281 error = may_create(new_dir, new_dentry);
1da177e4
LT		 3282 else
3283 error = may_delete(new_dir, new_dentry, is_dir);
3284 if (error)
3285 return error;
3286
acfa4380 3287 if (!old_dir->i_op->rename)
1da177e4
LT		 3288 return -EPERM;
3289
0eeca283
RL		 3290 old_name = fsnotify_oldname_init(old_dentry->d_name.name);
3291
1da177e4
LT		 3292 if (is_dir)
3293 error = vfs_rename_dir(old_dir,old_dentry,new_dir,new_dentry);
3294 else
3295 error = vfs_rename_other(old_dir,old_dentry,new_dir,new_dentry);
123df294
AV		 3296 if (!error)
3297 fsnotify_move(old_dir, new_dir, old_name, is_dir,
5a190ae6 3298 new_dentry->d_inode, old_dentry);
0eeca283
RL		 3299 fsnotify_oldname_free(old_name);
3300
1da177e4
LT		 3301 return error;
3302}
3303
2e4d0924
HC		 3304SYSCALL_DEFINE4(renameat, int, olddfd, const char __user *, oldname,
3305 int, newdfd, const char __user *, newname)
1da177e4 3306{
2ad94ae6
AV		 3307 struct dentry *old_dir, *new_dir;
3308 struct dentry *old_dentry, *new_dentry;
3309 struct dentry *trap;
1da177e4 3310 struct nameidata oldnd, newnd;
2ad94ae6
AV		 3311 char *from;
3312 char *to;
3313 int error;
1da177e4 3314
2ad94ae6 3315 error = user_path_parent(olddfd, oldname, &oldnd, &from);
1da177e4
LT		 3316 if (error)
3317 goto exit;
3318
2ad94ae6 3319 error = user_path_parent(newdfd, newname, &newnd, &to);
1da177e4
LT		 3320 if (error)
3321 goto exit1;
3322
3323 error = -EXDEV;
4ac91378 3324 if (oldnd.path.mnt != newnd.path.mnt)
1da177e4
LT		 3325 goto exit2;
3326
4ac91378 3327 old_dir = oldnd.path.dentry;
1da177e4
LT		 3328 error = -EBUSY;
3329 if (oldnd.last_type != LAST_NORM)
3330 goto exit2;
3331
4ac91378 3332 new_dir = newnd.path.dentry;
1da177e4
LT		 3333 if (newnd.last_type != LAST_NORM)
3334 goto exit2;
3335
0612d9fb
OH		 3336 oldnd.flags &= ~LOOKUP_PARENT;
3337 newnd.flags &= ~LOOKUP_PARENT;
4e9ed2f8 3338 newnd.flags |= LOOKUP_RENAME_TARGET;
0612d9fb 3339
1da177e4
LT		 3340 trap = lock_rename(new_dir, old_dir);
3341
49705b77 3342 old_dentry = lookup_hash(&oldnd);
1da177e4
LT		 3343 error = PTR_ERR(old_dentry);
3344 if (IS_ERR(old_dentry))
3345 goto exit3;
3346 /* source must exist */
3347 error = -ENOENT;
3348 if (!old_dentry->d_inode)
3349 goto exit4;
3350 /* unless the source is a directory trailing slashes give -ENOTDIR */
3351 if (!S_ISDIR(old_dentry->d_inode->i_mode)) {
3352 error = -ENOTDIR;
3353 if (oldnd.last.name[oldnd.last.len])
3354 goto exit4;
3355 if (newnd.last.name[newnd.last.len])
3356 goto exit4;
3357 }
3358 /* source should not be ancestor of target */
3359 error = -EINVAL;
3360 if (old_dentry == trap)
3361 goto exit4;
49705b77 3362 new_dentry = lookup_hash(&newnd);
1da177e4
LT		 3363 error = PTR_ERR(new_dentry);
3364 if (IS_ERR(new_dentry))
3365 goto exit4;
3366 /* target should not be an ancestor of source */
3367 error = -ENOTEMPTY;
3368 if (new_dentry == trap)
3369 goto exit5;
3370
9079b1eb
DH		 3371 error = mnt_want_write(oldnd.path.mnt);
3372 if (error)
3373 goto exit5;
be6d3e56
KT		 3374 error = security_path_rename(&oldnd.path, old_dentry,
3375 &newnd.path, new_dentry);
3376 if (error)
3377 goto exit6;
1da177e4
LT		 3378 error = vfs_rename(old_dir->d_inode, old_dentry,
3379 new_dir->d_inode, new_dentry);
be6d3e56 3380exit6:
9079b1eb 3381 mnt_drop_write(oldnd.path.mnt);
1da177e4
LT		 3382exit5:
3383 dput(new_dentry);
3384exit4:
3385 dput(old_dentry);
3386exit3:
3387 unlock_rename(new_dir, old_dir);
3388exit2:
1d957f9b 3389 path_put(&newnd.path);
2ad94ae6 3390 putname(to);
1da177e4 3391exit1:
1d957f9b 3392 path_put(&oldnd.path);
1da177e4 3393 putname(from);
2ad94ae6 3394exit:
1da177e4
LT		 3395 return error;
3396}
3397
a26eab24 3398SYSCALL_DEFINE2(rename, const char __user *, oldname, const char __user *, newname)
5590ff0d
UD		 3399{
3400 return sys_renameat(AT_FDCWD, oldname, AT_FDCWD, newname);
3401}
3402
1da177e4
LT		 3403int vfs_readlink(struct dentry *dentry, char __user *buffer, int buflen, const char *link)
3404{
3405 int len;
3406
3407 len = PTR_ERR(link);
3408 if (IS_ERR(link))
3409 goto out;
3410
3411 len = strlen(link);
3412 if (len > (unsigned) buflen)
3413 len = buflen;
3414 if (copy_to_user(buffer, link, len))
3415 len = -EFAULT;
3416out:
3417 return len;
3418}
3419
3420/*
3421 * A helper for ->readlink(). This should be used *ONLY* for symlinks that
3422 * have ->follow_link() touching nd only in nd_set_link(). Using (or not
3423 * using) it for any given inode is up to filesystem.
3424 */
3425int generic_readlink(struct dentry *dentry, char __user *buffer, int buflen)
3426{
3427 struct nameidata nd;
cc314eef 3428 void *cookie;
694a1764 3429 int res;
cc314eef 3430
1da177e4 3431 nd.depth = 0;
cc314eef 3432 cookie = dentry->d_inode->i_op->follow_link(dentry, &nd);
694a1764
MS		 3433 if (IS_ERR(cookie))
3434 return PTR_ERR(cookie);
3435
3436 res = vfs_readlink(dentry, buffer, buflen, nd_get_link(&nd));
3437 if (dentry->d_inode->i_op->put_link)
3438 dentry->d_inode->i_op->put_link(dentry, &nd, cookie);
3439 return res;
1da177e4
LT		 3440}
3441
3442int vfs_follow_link(struct nameidata *nd, const char *link)
3443{
3444 return __vfs_follow_link(nd, link);
3445}
3446
3447/* get the link contents into pagecache */
3448static char *page_getlink(struct dentry * dentry, struct page **ppage)
3449{
ebd09abb
DG		 3450 char *kaddr;
3451 struct page *page;
1da177e4 3452 struct address_space *mapping = dentry->d_inode->i_mapping;
090d2b18 3453 page = read_mapping_page(mapping, 0, NULL);
1da177e4 3454 if (IS_ERR(page))
6fe6900e 3455 return (char*)page;
1da177e4 3456 *ppage = page;
ebd09abb
DG		 3457 kaddr = kmap(page);
3458 nd_terminate_link(kaddr, dentry->d_inode->i_size, PAGE_SIZE - 1);
3459 return kaddr;
1da177e4
LT		 3460}
3461
3462int page_readlink(struct dentry *dentry, char __user *buffer, int buflen)
3463{
3464 struct page *page = NULL;
3465 char *s = page_getlink(dentry, &page);
3466 int res = vfs_readlink(dentry,buffer,buflen,s);
3467 if (page) {
3468 kunmap(page);
3469 page_cache_release(page);
3470 }
3471 return res;
3472}
3473
cc314eef 3474void *page_follow_link_light(struct dentry *dentry, struct nameidata *nd)
1da177e4 3475{
cc314eef 3476 struct page *page = NULL;
1da177e4 3477 nd_set_link(nd, page_getlink(dentry, &page));
cc314eef 3478 return page;
1da177e4
LT		 3479}
3480
cc314eef 3481void page_put_link(struct dentry *dentry, struct nameidata *nd, void *cookie)
1da177e4 3482{
cc314eef
LT		 3483 struct page *page = cookie;
3484
3485 if (page) {
1da177e4
LT		 3486 kunmap(page);
3487 page_cache_release(page);
1da177e4
LT		 3488 }
3489}
3490
54566b2c
NP		 3491/*
3492 * The nofs argument instructs pagecache_write_begin to pass AOP_FLAG_NOFS
3493 */
3494int __page_symlink(struct inode *inode, const char *symname, int len, int nofs)
1da177e4
LT		 3495{
3496 struct address_space *mapping = inode->i_mapping;
0adb25d2 3497 struct page *page;
afddba49 3498 void *fsdata;
beb497ab 3499 int err;
1da177e4 3500 char *kaddr;
54566b2c
NP		 3501 unsigned int flags = AOP_FLAG_UNINTERRUPTIBLE;
3502 if (nofs)
3503 flags |= AOP_FLAG_NOFS;
1da177e4 3504
7e53cac4 3505retry:
afddba49 3506 err = pagecache_write_begin(NULL, mapping, 0, len-1,
54566b2c 3507 flags, &page, &fsdata);
1da177e4 3508 if (err)
afddba49
NP		 3509 goto fail;
3510
e8e3c3d6 3511 kaddr = kmap_atomic(page);
1da177e4 3512 memcpy(kaddr, symname, len-1);
e8e3c3d6 3513 kunmap_atomic(kaddr);
afddba49
NP		 3514
3515 err = pagecache_write_end(NULL, mapping, 0, len-1, len-1,
3516 page, fsdata);
1da177e4
LT		 3517 if (err < 0)
3518 goto fail;
afddba49
NP		 3519 if (err < len-1)
3520 goto retry;
3521
1da177e4
LT		 3522 mark_inode_dirty(inode);
3523 return 0;
1da177e4
LT		 3524fail:
3525 return err;
3526}
3527
0adb25d2
KK		 3528int page_symlink(struct inode *inode, const char *symname, int len)
3529{
3530 return __page_symlink(inode, symname, len,
54566b2c 3531 !(mapping_gfp_mask(inode->i_mapping) & __GFP_FS));
0adb25d2
KK		 3532}
3533
92e1d5be 3534const struct inode_operations page_symlink_inode_operations = {
1da177e4
LT		 3535 .readlink = generic_readlink,
3536 .follow_link = page_follow_link_light,
3537 .put_link = page_put_link,
3538};
3539
2d8f3038 3540EXPORT_SYMBOL(user_path_at);
cc53ce53 3541EXPORT_SYMBOL(follow_down_one);
1da177e4
LT		 3542EXPORT_SYMBOL(follow_down);
3543EXPORT_SYMBOL(follow_up);
3544EXPORT_SYMBOL(get_write_access); /* binfmt_aout */
3545EXPORT_SYMBOL(getname);
3546EXPORT_SYMBOL(lock_rename);
1da177e4
LT		 3547EXPORT_SYMBOL(lookup_one_len);
3548EXPORT_SYMBOL(page_follow_link_light);
3549EXPORT_SYMBOL(page_put_link);
3550EXPORT_SYMBOL(page_readlink);
0adb25d2 3551EXPORT_SYMBOL(__page_symlink);
1da177e4
LT		 3552EXPORT_SYMBOL(page_symlink);
3553EXPORT_SYMBOL(page_symlink_inode_operations);
d1811465 3554EXPORT_SYMBOL(kern_path);
16f18200 3555EXPORT_SYMBOL(vfs_path_lookup);
f419a2e3 3556EXPORT_SYMBOL(inode_permission);
1da177e4
LT		 3557EXPORT_SYMBOL(unlock_rename);
3558EXPORT_SYMBOL(vfs_create);
3559EXPORT_SYMBOL(vfs_follow_link);
3560EXPORT_SYMBOL(vfs_link);
3561EXPORT_SYMBOL(vfs_mkdir);
3562EXPORT_SYMBOL(vfs_mknod);
3563EXPORT_SYMBOL(generic_permission);
3564EXPORT_SYMBOL(vfs_readlink);
3565EXPORT_SYMBOL(vfs_rename);
3566EXPORT_SYMBOL(vfs_rmdir);
3567EXPORT_SYMBOL(vfs_symlink);
3568EXPORT_SYMBOL(vfs_unlink);
3569EXPORT_SYMBOL(dentry_unhash);
3570EXPORT_SYMBOL(generic_readlink);
kernel source for telekom puls (alcatel/mediatek)