Merge tag 'v3.3.7' into 3.3/master
[zen-stable.git] / fs / namei.c
blobbcccefd7d4fd2d03ce28ea2d18d1ee99cca9411c
1 /*
2 * linux/fs/namei.c
4 * Copyright (C) 1991, 1992 Linus Torvalds
5 */
7 /*
8 * Some corrections by tytso.
9 */
11 /* [Feb 1997 T. Schoebel-Theuer] Complete rewrite of the pathname
12 * lookup logic.
14 /* [Feb-Apr 2000, AV] Rewrite to the new namespace architecture.
17 #include <linux/init.h>
18 #include <linux/module.h>
19 #include <linux/slab.h>
20 #include <linux/fs.h>
21 #include <linux/namei.h>
22 #include <linux/pagemap.h>
23 #include <linux/fsnotify.h>
24 #include <linux/personality.h>
25 #include <linux/security.h>
26 #include <linux/ima.h>
27 #include <linux/syscalls.h>
28 #include <linux/mount.h>
29 #include <linux/audit.h>
30 #include <linux/capability.h>
31 #include <linux/file.h>
32 #include <linux/fcntl.h>
33 #include <linux/device_cgroup.h>
34 #include <linux/fs_struct.h>
35 #include <linux/posix_acl.h>
36 #include <asm/uaccess.h>
38 #include "internal.h"
39 #include "mount.h"
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).
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.
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.
58 * [29-Apr-1998 C. Scott Ananian] Updated above description of symlink
59 * resolution to correspond with current state of the code.
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.
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
75 * the name is a symlink pointing to a non-existent name.
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.
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.
89 * [10-Sep-98 Alan Modra] Another symlink change.
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).
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...
107 * [Sep 2001 AV] Single-semaphore locking scheme (kudos to David Holland)
108 * implemented. Let's see if raised priority of ->s_vfs_rename_mutex gives
109 * any extra contention...
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..
116 * POSIX.1 2.4: an empty pathname is invalid (ENOENT).
117 * PATH_MAX includes the nul terminator --RR.
119 static int do_getname(const char __user *filename, char *page)
121 int retval;
122 unsigned long len = PATH_MAX;
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;
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;
141 static char *getname_flags(const char __user *filename, int flags, int *empty)
143 char *result = __getname();
144 int retval;
146 if (!result)
147 return ERR_PTR(-ENOMEM);
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);
158 audit_getname(result);
159 return result;
162 char *getname(const char __user * filename)
164 return getname_flags(filename, 0, 0);
167 #ifdef CONFIG_AUDITSYSCALL
168 void putname(const char *name)
170 if (unlikely(!audit_dummy_context()))
171 audit_putname(name);
172 else
173 __putname(name);
175 EXPORT_SYMBOL(putname);
176 #endif
178 static int check_acl(struct inode *inode, int mask)
180 #ifdef CONFIG_FS_POSIX_ACL
181 struct posix_acl *acl;
183 if (mask & MAY_NOT_BLOCK) {
184 acl = get_cached_acl_rcu(inode, ACL_TYPE_ACCESS);
185 if (!acl)
186 return -EAGAIN;
187 /* no ->get_acl() calls in RCU mode... */
188 if (acl == ACL_NOT_CACHED)
189 return -ECHILD;
190 return posix_acl_permission(inode, acl, mask & ~MAY_NOT_BLOCK);
193 acl = get_cached_acl(inode, ACL_TYPE_ACCESS);
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.
200 * If the filesystem doesn't have a get_acl() function at all, we'll
201 * just create the negative cache entry.
203 if (acl == ACL_NOT_CACHED) {
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;
214 if (acl) {
215 int error = posix_acl_permission(inode, acl, mask);
216 posix_acl_release(acl);
217 return error;
219 #endif
221 return -EAGAIN;
225 * This does the basic permission checking
227 static int acl_permission_check(struct inode *inode, int mask)
229 unsigned int mode = inode->i_mode;
231 if (current_user_ns() != inode_userns(inode))
232 goto other_perms;
234 if (likely(current_fsuid() == inode->i_uid))
235 mode >>= 6;
236 else {
237 if (IS_POSIXACL(inode) && (mode & S_IRWXG)) {
238 int error = check_acl(inode, mask);
239 if (error != -EAGAIN)
240 return error;
243 if (in_group_p(inode->i_gid))
244 mode >>= 3;
247 other_perms:
249 * If the DACs are ok we don't need any capability check.
251 if ((mask & ~mode & (MAY_READ | MAY_WRITE | MAY_EXEC)) == 0)
252 return 0;
253 return -EACCES;
257 * generic_permission - check for access rights on a Posix-like filesystem
258 * @inode: inode to check access rights for
259 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC, ...)
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
264 * are used for other things.
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.
270 int generic_permission(struct inode *inode, int mask)
272 int ret;
275 * Do the basic permission checks.
277 ret = acl_permission_check(inode, mask);
278 if (ret != -EACCES)
279 return ret;
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;
291 * Read/write DACs are always overridable.
292 * Executable DACs are overridable when there is
293 * at least one exec bit set.
295 if (!(mask & MAY_EXEC) || (inode->i_mode & S_IXUGO))
296 if (ns_capable(inode_userns(inode), CAP_DAC_OVERRIDE))
297 return 0;
300 * Searching includes executable on directories, else just read.
302 mask &= MAY_READ | MAY_WRITE | MAY_EXEC;
303 if (mask == MAY_READ)
304 if (ns_capable(inode_userns(inode), CAP_DAC_READ_SEARCH))
305 return 0;
307 return -EACCES;
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".
316 static inline int do_inode_permission(struct inode *inode, int mask)
318 if (unlikely(!(inode->i_opflags & IOP_FASTPERM))) {
319 if (likely(inode->i_op->permission))
320 return inode->i_op->permission(inode, mask);
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);
327 return generic_permission(inode, mask);
331 * inode_permission - check for access rights to a given inode
332 * @inode: inode to check permission on
333 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC, ...)
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.
340 * When checking for MAY_APPEND, MAY_WRITE must also be set in @mask.
342 int inode_permission(struct inode *inode, int mask)
344 int retval;
346 if (unlikely(mask & MAY_WRITE)) {
347 umode_t mode = inode->i_mode;
350 * Nobody gets write access to a read-only fs.
352 if (IS_RDONLY(inode) &&
353 (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode)))
354 return -EROFS;
357 * Nobody gets write access to an immutable file.
359 if (IS_IMMUTABLE(inode))
360 return -EACCES;
363 retval = do_inode_permission(inode, mask);
364 if (retval)
365 return retval;
367 retval = devcgroup_inode_permission(inode, mask);
368 if (retval)
369 return retval;
371 return security_inode_permission(inode, mask);
375 * path_get - get a reference to a path
376 * @path: path to get the reference to
378 * Given a path increment the reference count to the dentry and the vfsmount.
380 void path_get(struct path *path)
382 mntget(path->mnt);
383 dget(path->dentry);
385 EXPORT_SYMBOL(path_get);
388 * path_put - put a reference to a path
389 * @path: path to put the reference to
391 * Given a path decrement the reference count to the dentry and the vfsmount.
393 void path_put(struct path *path)
395 dput(path->dentry);
396 mntput(path->mnt);
398 EXPORT_SYMBOL(path_put);
401 * Path walking has 2 modes, rcu-walk and ref-walk (see
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.
412 * unlazy_walk - try to switch to ref-walk mode.
413 * @nd: nameidata pathwalk data
414 * @dentry: child of nd->path.dentry or NULL
415 * Returns: 0 on success, -ECHILD on failure
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.
421 static int unlazy_walk(struct nameidata *nd, struct dentry *dentry)
423 struct fs_struct *fs = current->fs;
424 struct dentry *parent = nd->path.dentry;
425 int want_root = 0;
427 BUG_ON(!(nd->flags & LOOKUP_RCU));
428 if (nd->root.mnt && !(nd->flags & LOOKUP_ROOT)) {
429 want_root = 1;
430 spin_lock(&fs->lock);
431 if (nd->root.mnt != fs->root.mnt ||
432 nd->root.dentry != fs->root.dentry)
433 goto err_root;
435 spin_lock(&parent->d_lock);
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 {
441 if (dentry->d_parent != parent)
442 goto err_parent;
443 spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
444 if (!__d_rcu_to_refcount(dentry, nd->seq))
445 goto err_child;
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.
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);
457 spin_unlock(&parent->d_lock);
458 if (want_root) {
459 path_get(&nd->root);
460 spin_unlock(&fs->lock);
462 mntget(nd->path.mnt);
464 rcu_read_unlock();
465 br_read_unlock(vfsmount_lock);
466 nd->flags &= ~LOOKUP_RCU;
467 return 0;
469 err_child:
470 spin_unlock(&dentry->d_lock);
471 err_parent:
472 spin_unlock(&parent->d_lock);
473 err_root:
474 if (want_root)
475 spin_unlock(&fs->lock);
476 return -ECHILD;
480 * release_open_intent - free up open intent resources
481 * @nd: pointer to nameidata
483 void release_open_intent(struct nameidata *nd)
485 struct file *file = nd->intent.open.file;
487 if (file && !IS_ERR(file)) {
488 if (file->f_path.dentry == NULL)
489 put_filp(file);
490 else
491 fput(file);
495 static inline int d_revalidate(struct dentry *dentry, struct nameidata *nd)
497 return dentry->d_op->d_revalidate(dentry, nd);
501 * complete_walk - successful completion of path walk
502 * @nd: pointer nameidata
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.
510 static int complete_walk(struct nameidata *nd)
512 struct dentry *dentry = nd->path.dentry;
513 int status;
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;
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);
533 if (likely(!(nd->flags & LOOKUP_JUMPED)))
534 return 0;
536 if (likely(!(dentry->d_flags & DCACHE_OP_REVALIDATE)))
537 return 0;
539 if (likely(!(dentry->d_sb->s_type->fs_flags & FS_REVAL_DOT)))
540 return 0;
542 /* Note: we do not d_invalidate() */
543 status = d_revalidate(dentry, nd);
544 if (status > 0)
545 return 0;
547 if (!status)
548 status = -ESTALE;
550 path_put(&nd->path);
551 return status;
554 static __always_inline void set_root(struct nameidata *nd)
556 if (!nd->root.mnt)
557 get_fs_root(current->fs, &nd->root);
560 static int link_path_walk(const char *, struct nameidata *);
562 static __always_inline void set_root_rcu(struct nameidata *nd)
564 if (!nd->root.mnt) {
565 struct fs_struct *fs = current->fs;
566 unsigned seq;
568 do {
569 seq = read_seqcount_begin(&fs->seq);
570 nd->root = fs->root;
571 nd->seq = __read_seqcount_begin(&nd->root.dentry->d_seq);
572 } while (read_seqcount_retry(&fs->seq, seq));
576 static __always_inline int __vfs_follow_link(struct nameidata *nd, const char *link)
578 int ret;
580 if (IS_ERR(link))
581 goto fail;
583 if (*link == '/') {
584 set_root(nd);
585 path_put(&nd->path);
586 nd->path = nd->root;
587 path_get(&nd->root);
588 nd->flags |= LOOKUP_JUMPED;
590 nd->inode = nd->path.dentry->d_inode;
592 ret = link_path_walk(link, nd);
593 return ret;
594 fail:
595 path_put(&nd->path);
596 return PTR_ERR(link);
599 static void path_put_conditional(struct path *path, struct nameidata *nd)
601 dput(path->dentry);
602 if (path->mnt != nd->path.mnt)
603 mntput(path->mnt);
606 static inline void path_to_nameidata(const struct path *path,
607 struct nameidata *nd)
609 if (!(nd->flags & LOOKUP_RCU)) {
610 dput(nd->path.dentry);
611 if (nd->path.mnt != path->mnt)
612 mntput(nd->path.mnt);
614 nd->path.mnt = path->mnt;
615 nd->path.dentry = path->dentry;
618 static inline void put_link(struct nameidata *nd, struct path *link, void *cookie)
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);
626 static __always_inline int
627 follow_link(struct path *link, struct nameidata *nd, void **p)
629 int error;
630 struct dentry *dentry = link->dentry;
632 BUG_ON(nd->flags & LOOKUP_RCU);
634 if (link->mnt == nd->path.mnt)
635 mntget(link->mnt);
637 if (unlikely(current->total_link_count >= 40)) {
638 *p = ERR_PTR(-ELOOP); /* no ->put_link(), please */
639 path_put(&nd->path);
640 return -ELOOP;
642 cond_resched();
643 current->total_link_count++;
645 touch_atime(link->mnt, dentry);
646 nd_set_link(nd, NULL);
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;
655 nd->last_type = LAST_BIND;
656 *p = dentry->d_inode->i_op->follow_link(dentry, nd);
657 error = PTR_ERR(*p);
658 if (!IS_ERR(*p)) {
659 char *s = nd_get_link(nd);
660 error = 0;
661 if (s)
662 error = __vfs_follow_link(nd, s);
663 else if (nd->last_type == LAST_BIND) {
664 nd->flags |= LOOKUP_JUMPED;
665 nd->inode = nd->path.dentry->d_inode;
666 if (nd->inode->i_op->follow_link) {
667 /* stepped on a _really_ weird one */
668 path_put(&nd->path);
669 error = -ELOOP;
673 return error;
676 static int follow_up_rcu(struct path *path)
678 struct mount *mnt = real_mount(path->mnt);
679 struct mount *parent;
680 struct dentry *mountpoint;
682 parent = mnt->mnt_parent;
683 if (&parent->mnt == path->mnt)
684 return 0;
685 mountpoint = mnt->mnt_mountpoint;
686 path->dentry = mountpoint;
687 path->mnt = &parent->mnt;
688 return 1;
691 int follow_up(struct path *path)
693 struct mount *mnt = real_mount(path->mnt);
694 struct mount *parent;
695 struct dentry *mountpoint;
697 br_read_lock(vfsmount_lock);
698 parent = mnt->mnt_parent;
699 if (&parent->mnt == path->mnt) {
700 br_read_unlock(vfsmount_lock);
701 return 0;
703 mntget(&parent->mnt);
704 mountpoint = dget(mnt->mnt_mountpoint);
705 br_read_unlock(vfsmount_lock);
706 dput(path->dentry);
707 path->dentry = mountpoint;
708 mntput(path->mnt);
709 path->mnt = &parent->mnt;
710 return 1;
714 * Perform an automount
715 * - return -EISDIR to tell follow_managed() to stop and return the path we
716 * were called with.
718 static int follow_automount(struct path *path, unsigned flags,
719 bool *need_mntput)
721 struct vfsmount *mnt;
722 int err;
724 if (!path->dentry->d_op || !path->dentry->d_op->d_automount)
725 return -EREMOTE;
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.
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.
738 if (!(flags & (LOOKUP_PARENT | LOOKUP_DIRECTORY |
739 LOOKUP_OPEN | LOOKUP_CREATE | LOOKUP_AUTOMOUNT)) &&
740 path->dentry->d_inode)
741 return -EISDIR;
743 current->total_link_count++;
744 if (current->total_link_count >= 40)
745 return -ELOOP;
747 mnt = path->dentry->d_op->d_automount(path);
748 if (IS_ERR(mnt)) {
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.
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.
758 if (PTR_ERR(mnt) == -EISDIR && (flags & LOOKUP_PARENT))
759 return -EREMOTE;
760 return PTR_ERR(mnt);
763 if (!mnt) /* mount collision */
764 return 0;
766 if (!*need_mntput) {
767 /* lock_mount() may release path->mnt on error */
768 mntget(path->mnt);
769 *need_mntput = true;
771 err = finish_automount(mnt, path);
773 switch (err) {
774 case -EBUSY:
775 /* Someone else made a mount here whilst we were busy */
776 return 0;
777 case 0:
778 path_put(path);
779 path->mnt = mnt;
780 path->dentry = dget(mnt->mnt_root);
781 return 0;
782 default:
783 return err;
789 * Handle a dentry that is managed in some way.
790 * - Flagged for transit management (autofs)
791 * - Flagged as mountpoint
792 * - Flagged as automount point
794 * This may only be called in refwalk mode.
796 * Serialization is taken care of in namespace.c
798 static int follow_managed(struct path *path, unsigned flags)
800 struct vfsmount *mnt = path->mnt; /* held by caller, must be left alone */
801 unsigned managed;
802 bool need_mntput = false;
803 int ret = 0;
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)) {
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);
816 ret = path->dentry->d_op->d_manage(path->dentry, false);
817 if (ret < 0)
818 break;
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;
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 */
840 /* Handle an automount point */
841 if (managed & DCACHE_NEED_AUTOMOUNT) {
842 ret = follow_automount(path, flags, &need_mntput);
843 if (ret < 0)
844 break;
845 continue;
848 /* We didn't change the current path point */
849 break;
852 if (need_mntput && path->mnt == mnt)
853 mntput(path->mnt);
854 if (ret == -EISDIR)
855 ret = 0;
856 return ret < 0 ? ret : need_mntput;
859 int follow_down_one(struct path *path)
861 struct vfsmount *mounted;
863 mounted = lookup_mnt(path);
864 if (mounted) {
865 dput(path->dentry);
866 mntput(path->mnt);
867 path->mnt = mounted;
868 path->dentry = dget(mounted->mnt_root);
869 return 1;
871 return 0;
874 static inline bool managed_dentry_might_block(struct dentry *dentry)
876 return (dentry->d_flags & DCACHE_MANAGE_TRANSIT &&
877 dentry->d_op->d_manage(dentry, true) < 0);
881 * Try to skip to top of mountpoint pile in rcuwalk mode. Fail if
882 * we meet a managed dentry that would need blocking.
884 static bool __follow_mount_rcu(struct nameidata *nd, struct path *path,
885 struct inode **inode)
887 for (;;) {
888 struct mount *mounted;
890 * Don't forget we might have a non-mountpoint managed dentry
891 * that wants to block transit.
893 if (unlikely(managed_dentry_might_block(path->dentry)))
894 return false;
896 if (!d_mountpoint(path->dentry))
897 break;
899 mounted = __lookup_mnt(path->mnt, path->dentry, 1);
900 if (!mounted)
901 break;
902 path->mnt = &mounted->mnt;
903 path->dentry = mounted->mnt.mnt_root;
904 nd->flags |= LOOKUP_JUMPED;
905 nd->seq = read_seqcount_begin(&path->dentry->d_seq);
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.
911 *inode = path->dentry->d_inode;
913 return true;
916 static void follow_mount_rcu(struct nameidata *nd)
918 while (d_mountpoint(nd->path.dentry)) {
919 struct mount *mounted;
920 mounted = __lookup_mnt(nd->path.mnt, nd->path.dentry, 1);
921 if (!mounted)
922 break;
923 nd->path.mnt = &mounted->mnt;
924 nd->path.dentry = mounted->mnt.mnt_root;
925 nd->seq = read_seqcount_begin(&nd->path.dentry->d_seq);
929 static int follow_dotdot_rcu(struct nameidata *nd)
931 set_root_rcu(nd);
933 while (1) {
934 if (nd->path.dentry == nd->root.dentry &&
935 nd->path.mnt == nd->root.mnt) {
936 break;
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;
943 seq = read_seqcount_begin(&parent->d_seq);
944 if (read_seqcount_retry(&old->d_seq, nd->seq))
945 goto failed;
946 nd->path.dentry = parent;
947 nd->seq = seq;
948 break;
950 if (!follow_up_rcu(&nd->path))
951 break;
952 nd->seq = read_seqcount_begin(&nd->path.dentry->d_seq);
954 follow_mount_rcu(nd);
955 nd->inode = nd->path.dentry->d_inode;
956 return 0;
958 failed:
959 nd->flags &= ~LOOKUP_RCU;
960 if (!(nd->flags & LOOKUP_ROOT))
961 nd->root.mnt = NULL;
962 rcu_read_unlock();
963 br_read_unlock(vfsmount_lock);
964 return -ECHILD;
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.
972 int follow_down(struct path *path)
974 unsigned managed;
975 int ret;
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.
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.
987 * The filesystem may sleep at this point.
989 if (managed & DCACHE_MANAGE_TRANSIT) {
990 BUG_ON(!path->dentry->d_op);
991 BUG_ON(!path->dentry->d_op->d_manage);
992 ret = path->dentry->d_op->d_manage(
993 path->dentry, false);
994 if (ret < 0)
995 return ret == -EISDIR ? 0 : ret;
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;
1010 /* Don't handle automount points here */
1011 break;
1013 return 0;
1017 * Skip to top of mountpoint pile in refwalk mode for follow_dotdot()
1019 static void follow_mount(struct path *path)
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);
1032 static void follow_dotdot(struct nameidata *nd)
1034 set_root(nd);
1036 while(1) {
1037 struct dentry *old = nd->path.dentry;
1039 if (nd->path.dentry == nd->root.dentry &&
1040 nd->path.mnt == nd->root.mnt) {
1041 break;
1043 if (nd->path.dentry != nd->path.mnt->mnt_root) {
1044 /* rare case of legitimate dget_parent()... */
1045 nd->path.dentry = dget_parent(nd->path.dentry);
1046 dput(old);
1047 break;
1049 if (!follow_up(&nd->path))
1050 break;
1052 follow_mount(&nd->path);
1053 nd->inode = nd->path.dentry->d_inode;
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.
1062 static struct dentry *d_alloc_and_lookup(struct dentry *parent,
1063 struct qstr *name, struct nameidata *nd)
1065 struct inode *inode = parent->d_inode;
1066 struct dentry *dentry;
1067 struct dentry *old;
1069 /* Don't create child dentry for a dead directory. */
1070 if (unlikely(IS_DEADDIR(inode)))
1071 return ERR_PTR(-ENOENT);
1073 dentry = d_alloc(parent, name);
1074 if (unlikely(!dentry))
1075 return ERR_PTR(-ENOMEM);
1077 old = inode->i_op->lookup(inode, dentry, nd);
1078 if (unlikely(old)) {
1079 dput(dentry);
1080 dentry = old;
1082 return dentry;
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.
1091 static struct dentry *d_inode_lookup(struct dentry *parent, struct dentry *dentry,
1092 struct nameidata *nd)
1094 struct inode *inode = parent->d_inode;
1095 struct dentry *old;
1097 /* Don't create child dentry for a dead directory. */
1098 if (unlikely(IS_DEADDIR(inode))) {
1099 dput(dentry);
1100 return ERR_PTR(-ENOENT);
1103 old = inode->i_op->lookup(inode, dentry, nd);
1104 if (unlikely(old)) {
1105 dput(dentry);
1106 dentry = old;
1108 return dentry;
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.
1116 static int do_lookup(struct nameidata *nd, struct qstr *name,
1117 struct path *path, struct inode **inode)
1119 struct vfsmount *mnt = nd->path.mnt;
1120 struct dentry *dentry, *parent = nd->path.dentry;
1121 int need_reval = 1;
1122 int status = 1;
1123 int err;
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.
1130 if (nd->flags & LOOKUP_RCU) {
1131 unsigned seq;
1132 *inode = nd->inode;
1133 dentry = __d_lookup_rcu(parent, name, &seq, inode);
1134 if (!dentry)
1135 goto unlazy;
1137 /* Memory barrier in read_seqcount_begin of child is enough */
1138 if (__read_seqcount_retry(&parent->d_seq, nd->seq))
1139 return -ECHILD;
1140 nd->seq = seq;
1142 if (unlikely(dentry->d_flags & DCACHE_OP_REVALIDATE)) {
1143 status = d_revalidate(dentry, nd);
1144 if (unlikely(status <= 0)) {
1145 if (status != -ECHILD)
1146 need_reval = 0;
1147 goto unlazy;
1150 if (unlikely(d_need_lookup(dentry)))
1151 goto unlazy;
1152 path->mnt = mnt;
1153 path->dentry = dentry;
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;
1159 unlazy:
1160 if (unlazy_walk(nd, dentry))
1161 return -ECHILD;
1162 } else {
1163 dentry = __d_lookup(parent, name);
1166 if (dentry && unlikely(d_need_lookup(dentry))) {
1167 dput(dentry);
1168 dentry = NULL;
1170 retry:
1171 if (unlikely(!dentry)) {
1172 struct inode *dir = parent->d_inode;
1173 BUG_ON(nd->inode != dir);
1175 mutex_lock(&dir->i_mutex);
1176 dentry = d_lookup(parent, name);
1177 if (likely(!dentry)) {
1178 dentry = d_alloc_and_lookup(parent, name, nd);
1179 if (IS_ERR(dentry)) {
1180 mutex_unlock(&dir->i_mutex);
1181 return PTR_ERR(dentry);
1183 /* known good */
1184 need_reval = 0;
1185 status = 1;
1186 } else if (unlikely(d_need_lookup(dentry))) {
1187 dentry = d_inode_lookup(parent, dentry, nd);
1188 if (IS_ERR(dentry)) {
1189 mutex_unlock(&dir->i_mutex);
1190 return PTR_ERR(dentry);
1192 /* known good */
1193 need_reval = 0;
1194 status = 1;
1196 mutex_unlock(&dir->i_mutex);
1198 if (unlikely(dentry->d_flags & DCACHE_OP_REVALIDATE) && need_reval)
1199 status = d_revalidate(dentry, nd);
1200 if (unlikely(status <= 0)) {
1201 if (status < 0) {
1202 dput(dentry);
1203 return status;
1205 if (!d_invalidate(dentry)) {
1206 dput(dentry);
1207 dentry = NULL;
1208 need_reval = 1;
1209 goto retry;
1213 path->mnt = mnt;
1214 path->dentry = dentry;
1215 err = follow_managed(path, nd->flags);
1216 if (unlikely(err < 0)) {
1217 path_put_conditional(path, nd);
1218 return err;
1220 if (err)
1221 nd->flags |= LOOKUP_JUMPED;
1222 *inode = path->dentry->d_inode;
1223 return 0;
1226 static inline int may_lookup(struct nameidata *nd)
1228 if (nd->flags & LOOKUP_RCU) {
1229 int err = inode_permission(nd->inode, MAY_EXEC|MAY_NOT_BLOCK);
1230 if (err != -ECHILD)
1231 return err;
1232 if (unlazy_walk(nd, NULL))
1233 return -ECHILD;
1235 return inode_permission(nd->inode, MAY_EXEC);
1238 static inline int handle_dots(struct nameidata *nd, int type)
1240 if (type == LAST_DOTDOT) {
1241 if (nd->flags & LOOKUP_RCU) {
1242 if (follow_dotdot_rcu(nd))
1243 return -ECHILD;
1244 } else
1245 follow_dotdot(nd);
1247 return 0;
1250 static void terminate_walk(struct nameidata *nd)
1252 if (!(nd->flags & LOOKUP_RCU)) {
1253 path_put(&nd->path);
1254 } else {
1255 nd->flags &= ~LOOKUP_RCU;
1256 if (!(nd->flags & LOOKUP_ROOT))
1257 nd->root.mnt = NULL;
1258 rcu_read_unlock();
1259 br_read_unlock(vfsmount_lock);
1264 * Do we need to follow links? We _really_ want to be able
1265 * to do this check without having to look at inode->i_op,
1266 * so we keep a cache of "no, this doesn't need follow_link"
1267 * for the common case.
1269 static inline int should_follow_link(struct inode *inode, int follow)
1271 if (unlikely(!(inode->i_opflags & IOP_NOFOLLOW))) {
1272 if (likely(inode->i_op->follow_link))
1273 return follow;
1275 /* This gets set once for the inode lifetime */
1276 spin_lock(&inode->i_lock);
1277 inode->i_opflags |= IOP_NOFOLLOW;
1278 spin_unlock(&inode->i_lock);
1280 return 0;
1283 static inline int walk_component(struct nameidata *nd, struct path *path,
1284 struct qstr *name, int type, int follow)
1286 struct inode *inode;
1287 int err;
1289 * "." and ".." are special - ".." especially so because it has
1290 * to be able to know about the current root directory and
1291 * parent relationships.
1293 if (unlikely(type != LAST_NORM))
1294 return handle_dots(nd, type);
1295 err = do_lookup(nd, name, path, &inode);
1296 if (unlikely(err)) {
1297 terminate_walk(nd);
1298 return err;
1300 if (!inode) {
1301 path_to_nameidata(path, nd);
1302 terminate_walk(nd);
1303 return -ENOENT;
1305 if (should_follow_link(inode, follow)) {
1306 if (nd->flags & LOOKUP_RCU) {
1307 if (unlikely(unlazy_walk(nd, path->dentry))) {
1308 terminate_walk(nd);
1309 return -ECHILD;
1312 BUG_ON(inode != path->dentry->d_inode);
1313 return 1;
1315 path_to_nameidata(path, nd);
1316 nd->inode = inode;
1317 return 0;
1321 * This limits recursive symlink follows to 8, while
1322 * limiting consecutive symlinks to 40.
1324 * Without that kind of total limit, nasty chains of consecutive
1325 * symlinks can cause almost arbitrarily long lookups.
1327 static inline int nested_symlink(struct path *path, struct nameidata *nd)
1329 int res;
1331 if (unlikely(current->link_count >= MAX_NESTED_LINKS)) {
1332 path_put_conditional(path, nd);
1333 path_put(&nd->path);
1334 return -ELOOP;
1336 BUG_ON(nd->depth >= MAX_NESTED_LINKS);
1338 nd->depth++;
1339 current->link_count++;
1341 do {
1342 struct path link = *path;
1343 void *cookie;
1345 res = follow_link(&link, nd, &cookie);
1346 if (!res)
1347 res = walk_component(nd, path, &nd->last,
1348 nd->last_type, LOOKUP_FOLLOW);
1349 put_link(nd, &link, cookie);
1350 } while (res > 0);
1352 current->link_count--;
1353 nd->depth--;
1354 return res;
1358 * We really don't want to look at inode->i_op->lookup
1359 * when we don't have to. So we keep a cache bit in
1360 * the inode ->i_opflags field that says "yes, we can
1361 * do lookup on this inode".
1363 static inline int can_lookup(struct inode *inode)
1365 if (likely(inode->i_opflags & IOP_LOOKUP))
1366 return 1;
1367 if (likely(!inode->i_op->lookup))
1368 return 0;
1370 /* We do this once for the lifetime of the inode */
1371 spin_lock(&inode->i_lock);
1372 inode->i_opflags |= IOP_LOOKUP;
1373 spin_unlock(&inode->i_lock);
1374 return 1;
1377 unsigned int full_name_hash(const unsigned char *name, unsigned int len)
1379 unsigned long hash = init_name_hash();
1380 while (len--)
1381 hash = partial_name_hash(*name++, hash);
1382 return end_name_hash(hash);
1384 EXPORT_SYMBOL(full_name_hash);
1387 * We know there's a real path component here of at least
1388 * one character.
1390 static inline unsigned long hash_name(const char *name, unsigned int *hashp)
1392 unsigned long hash = init_name_hash();
1393 unsigned long len = 0, c;
1395 c = (unsigned char)*name;
1396 do {
1397 len++;
1398 hash = partial_name_hash(c, hash);
1399 c = (unsigned char)name[len];
1400 } while (c && c != '/');
1401 *hashp = end_name_hash(hash);
1402 return len;
1406 * Name resolution.
1407 * This is the basic name resolution function, turning a pathname into
1408 * the final dentry. We expect 'base' to be positive and a directory.
1410 * Returns 0 and nd will have valid dentry and mnt on success.
1411 * Returns error and drops reference to input namei data on failure.
1413 static int link_path_walk(const char *name, struct nameidata *nd)
1415 struct path next;
1416 int err;
1418 while (*name=='/')
1419 name++;
1420 if (!*name)
1421 return 0;
1423 /* At this point we know we have a real path component. */
1424 for(;;) {
1425 struct qstr this;
1426 long len;
1427 int type;
1429 err = may_lookup(nd);
1430 if (err)
1431 break;
1433 len = hash_name(name, &this.hash);
1434 this.name = name;
1435 this.len = len;
1437 type = LAST_NORM;
1438 if (name[0] == '.') switch (len) {
1439 case 2:
1440 if (name[1] == '.') {
1441 type = LAST_DOTDOT;
1442 nd->flags |= LOOKUP_JUMPED;
1444 break;
1445 case 1:
1446 type = LAST_DOT;
1448 if (likely(type == LAST_NORM)) {
1449 struct dentry *parent = nd->path.dentry;
1450 nd->flags &= ~LOOKUP_JUMPED;
1451 if (unlikely(parent->d_flags & DCACHE_OP_HASH)) {
1452 err = parent->d_op->d_hash(parent, nd->inode,
1453 &this);
1454 if (err < 0)
1455 break;
1459 if (!name[len])
1460 goto last_component;
1462 * If it wasn't NUL, we know it was '/'. Skip that
1463 * slash, and continue until no more slashes.
1465 do {
1466 len++;
1467 } while (unlikely(name[len] == '/'));
1468 if (!name[len])
1469 goto last_component;
1470 name += len;
1472 err = walk_component(nd, &next, &this, type, LOOKUP_FOLLOW);
1473 if (err < 0)
1474 return err;
1476 if (err) {
1477 err = nested_symlink(&next, nd);
1478 if (err)
1479 return err;
1481 if (can_lookup(nd->inode))
1482 continue;
1483 err = -ENOTDIR;
1484 break;
1485 /* here ends the main loop */
1487 last_component:
1488 nd->last = this;
1489 nd->last_type = type;
1490 return 0;
1492 terminate_walk(nd);
1493 return err;
1496 static int path_init(int dfd, const char *name, unsigned int flags,
1497 struct nameidata *nd, struct file **fp)
1499 int retval = 0;
1500 int fput_needed;
1501 struct file *file;
1503 nd->last_type = LAST_ROOT; /* if there are only slashes... */
1504 nd->flags = flags | LOOKUP_JUMPED;
1505 nd->depth = 0;
1506 if (flags & LOOKUP_ROOT) {
1507 struct inode *inode = nd->root.dentry->d_inode;
1508 if (*name) {
1509 if (!inode->i_op->lookup)
1510 return -ENOTDIR;
1511 retval = inode_permission(inode, MAY_EXEC);
1512 if (retval)
1513 return retval;
1515 nd->path = nd->root;
1516 nd->inode = inode;
1517 if (flags & LOOKUP_RCU) {
1518 br_read_lock(vfsmount_lock);
1519 rcu_read_lock();
1520 nd->seq = __read_seqcount_begin(&nd->path.dentry->d_seq);
1521 } else {
1522 path_get(&nd->path);
1524 return 0;
1527 nd->root.mnt = NULL;
1529 if (*name=='/') {
1530 if (flags & LOOKUP_RCU) {
1531 br_read_lock(vfsmount_lock);
1532 rcu_read_lock();
1533 set_root_rcu(nd);
1534 } else {
1535 set_root(nd);
1536 path_get(&nd->root);
1538 nd->path = nd->root;
1539 } else if (dfd == AT_FDCWD) {
1540 if (flags & LOOKUP_RCU) {
1541 struct fs_struct *fs = current->fs;
1542 unsigned seq;
1544 br_read_lock(vfsmount_lock);
1545 rcu_read_lock();
1547 do {
1548 seq = read_seqcount_begin(&fs->seq);
1549 nd->path = fs->pwd;
1550 nd->seq = __read_seqcount_begin(&nd->path.dentry->d_seq);
1551 } while (read_seqcount_retry(&fs->seq, seq));
1552 } else {
1553 get_fs_pwd(current->fs, &nd->path);
1555 } else {
1556 struct dentry *dentry;
1558 file = fget_raw_light(dfd, &fput_needed);
1559 retval = -EBADF;
1560 if (!file)
1561 goto out_fail;
1563 dentry = file->f_path.dentry;
1565 if (*name) {
1566 retval = -ENOTDIR;
1567 if (!S_ISDIR(dentry->d_inode->i_mode))
1568 goto fput_fail;
1570 retval = inode_permission(dentry->d_inode, MAY_EXEC);
1571 if (retval)
1572 goto fput_fail;
1575 nd->path = file->f_path;
1576 if (flags & LOOKUP_RCU) {
1577 if (fput_needed)
1578 *fp = file;
1579 nd->seq = __read_seqcount_begin(&nd->path.dentry->d_seq);
1580 br_read_lock(vfsmount_lock);
1581 rcu_read_lock();
1582 } else {
1583 path_get(&file->f_path);
1584 fput_light(file, fput_needed);
1588 nd->inode = nd->path.dentry->d_inode;
1589 return 0;
1591 fput_fail:
1592 fput_light(file, fput_needed);
1593 out_fail:
1594 return retval;
1597 static inline int lookup_last(struct nameidata *nd, struct path *path)
1599 if (nd->last_type == LAST_NORM && nd->last.name[nd->last.len])
1600 nd->flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY;
1602 nd->flags &= ~LOOKUP_PARENT;
1603 return walk_component(nd, path, &nd->last, nd->last_type,
1604 nd->flags & LOOKUP_FOLLOW);
1607 /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
1608 static int path_lookupat(int dfd, const char *name,
1609 unsigned int flags, struct nameidata *nd)
1611 struct file *base = NULL;
1612 struct path path;
1613 int err;
1616 * Path walking is largely split up into 2 different synchronisation
1617 * schemes, rcu-walk and ref-walk (explained in
1618 * Documentation/filesystems/path-lookup.txt). These share much of the
1619 * path walk code, but some things particularly setup, cleanup, and
1620 * following mounts are sufficiently divergent that functions are
1621 * duplicated. Typically there is a function foo(), and its RCU
1622 * analogue, foo_rcu().
1624 * -ECHILD is the error number of choice (just to avoid clashes) that
1625 * is returned if some aspect of an rcu-walk fails. Such an error must
1626 * be handled by restarting a traditional ref-walk (which will always
1627 * be able to complete).
1629 err = path_init(dfd, name, flags | LOOKUP_PARENT, nd, &base);
1631 if (unlikely(err))
1632 return err;
1634 current->total_link_count = 0;
1635 err = link_path_walk(name, nd);
1637 if (!err && !(flags & LOOKUP_PARENT)) {
1638 err = lookup_last(nd, &path);
1639 while (err > 0) {
1640 void *cookie;
1641 struct path link = path;
1642 nd->flags |= LOOKUP_PARENT;
1643 err = follow_link(&link, nd, &cookie);
1644 if (!err)
1645 err = lookup_last(nd, &path);
1646 put_link(nd, &link, cookie);
1650 if (!err)
1651 err = complete_walk(nd);
1653 if (!err && nd->flags & LOOKUP_DIRECTORY) {
1654 if (!nd->inode->i_op->lookup) {
1655 path_put(&nd->path);
1656 err = -ENOTDIR;
1660 if (base)
1661 fput(base);
1663 if (nd->root.mnt && !(nd->flags & LOOKUP_ROOT)) {
1664 path_put(&nd->root);
1665 nd->root.mnt = NULL;
1667 return err;
1670 static int do_path_lookup(int dfd, const char *name,
1671 unsigned int flags, struct nameidata *nd)
1673 int retval = path_lookupat(dfd, name, flags | LOOKUP_RCU, nd);
1674 if (unlikely(retval == -ECHILD))
1675 retval = path_lookupat(dfd, name, flags, nd);
1676 if (unlikely(retval == -ESTALE))
1677 retval = path_lookupat(dfd, name, flags | LOOKUP_REVAL, nd);
1679 if (likely(!retval)) {
1680 if (unlikely(!audit_dummy_context())) {
1681 if (nd->path.dentry && nd->inode)
1682 audit_inode(name, nd->path.dentry);
1685 return retval;
1688 int kern_path_parent(const char *name, struct nameidata *nd)
1690 return do_path_lookup(AT_FDCWD, name, LOOKUP_PARENT, nd);
1693 int kern_path(const char *name, unsigned int flags, struct path *path)
1695 struct nameidata nd;
1696 int res = do_path_lookup(AT_FDCWD, name, flags, &nd);
1697 if (!res)
1698 *path = nd.path;
1699 return res;
1703 * vfs_path_lookup - lookup a file path relative to a dentry-vfsmount pair
1704 * @dentry: pointer to dentry of the base directory
1705 * @mnt: pointer to vfs mount of the base directory
1706 * @name: pointer to file name
1707 * @flags: lookup flags
1708 * @path: pointer to struct path to fill
1710 int vfs_path_lookup(struct dentry *dentry, struct vfsmount *mnt,
1711 const char *name, unsigned int flags,
1712 struct path *path)
1714 struct nameidata nd;
1715 int err;
1716 nd.root.dentry = dentry;
1717 nd.root.mnt = mnt;
1718 BUG_ON(flags & LOOKUP_PARENT);
1719 /* the first argument of do_path_lookup() is ignored with LOOKUP_ROOT */
1720 err = do_path_lookup(AT_FDCWD, name, flags | LOOKUP_ROOT, &nd);
1721 if (!err)
1722 *path = nd.path;
1723 return err;
1726 static struct dentry *__lookup_hash(struct qstr *name,
1727 struct dentry *base, struct nameidata *nd)
1729 struct inode *inode = base->d_inode;
1730 struct dentry *dentry;
1731 int err;
1733 err = inode_permission(inode, MAY_EXEC);
1734 if (err)
1735 return ERR_PTR(err);
1738 * Don't bother with __d_lookup: callers are for creat as
1739 * well as unlink, so a lot of the time it would cost
1740 * a double lookup.
1742 dentry = d_lookup(base, name);
1744 if (dentry && d_need_lookup(dentry)) {
1746 * __lookup_hash is called with the parent dir's i_mutex already
1747 * held, so we are good to go here.
1749 dentry = d_inode_lookup(base, dentry, nd);
1750 if (IS_ERR(dentry))
1751 return dentry;
1754 if (dentry && (dentry->d_flags & DCACHE_OP_REVALIDATE)) {
1755 int status = d_revalidate(dentry, nd);
1756 if (unlikely(status <= 0)) {
1758 * The dentry failed validation.
1759 * If d_revalidate returned 0 attempt to invalidate
1760 * the dentry otherwise d_revalidate is asking us
1761 * to return a fail status.
1763 if (status < 0) {
1764 dput(dentry);
1765 return ERR_PTR(status);
1766 } else if (!d_invalidate(dentry)) {
1767 dput(dentry);
1768 dentry = NULL;
1773 if (!dentry)
1774 dentry = d_alloc_and_lookup(base, name, nd);
1776 return dentry;
1780 * Restricted form of lookup. Doesn't follow links, single-component only,
1781 * needs parent already locked. Doesn't follow mounts.
1782 * SMP-safe.
1784 struct dentry *lookup_hash(struct nameidata *nd)
1786 return __lookup_hash(&nd->last, nd->path.dentry, nd);
1788 EXPORT_SYMBOL(lookup_hash);
1791 * lookup_one_len - filesystem helper to lookup single pathname component
1792 * @name: pathname component to lookup
1793 * @base: base directory to lookup from
1794 * @len: maximum length @len should be interpreted to
1796 * Note that this routine is purely a helper for filesystem usage and should
1797 * not be called by generic code. Also note that by using this function the
1798 * nameidata argument is passed to the filesystem methods and a filesystem
1799 * using this helper needs to be prepared for that.
1801 struct dentry *lookup_one_len(const char *name, struct dentry *base, int len)
1803 struct qstr this;
1804 unsigned int c;
1806 WARN_ON_ONCE(!mutex_is_locked(&base->d_inode->i_mutex));
1808 this.name = name;
1809 this.len = len;
1810 this.hash = full_name_hash(name, len);
1811 if (!len)
1812 return ERR_PTR(-EACCES);
1814 while (len--) {
1815 c = *(const unsigned char *)name++;
1816 if (c == '/' || c == '\0')
1817 return ERR_PTR(-EACCES);
1820 * See if the low-level filesystem might want
1821 * to use its own hash..
1823 if (base->d_flags & DCACHE_OP_HASH) {
1824 int err = base->d_op->d_hash(base, base->d_inode, &this);
1825 if (err < 0)
1826 return ERR_PTR(err);
1829 return __lookup_hash(&this, base, NULL);
1832 int user_path_at_empty(int dfd, const char __user *name, unsigned flags,
1833 struct path *path, int *empty)
1835 struct nameidata nd;
1836 char *tmp = getname_flags(name, flags, empty);
1837 int err = PTR_ERR(tmp);
1838 if (!IS_ERR(tmp)) {
1840 BUG_ON(flags & LOOKUP_PARENT);
1842 err = do_path_lookup(dfd, tmp, flags, &nd);
1843 putname(tmp);
1844 if (!err)
1845 *path = nd.path;
1847 return err;
1850 int user_path_at(int dfd, const char __user *name, unsigned flags,
1851 struct path *path)
1853 return user_path_at_empty(dfd, name, flags, path, 0);
1856 static int user_path_parent(int dfd, const char __user *path,
1857 struct nameidata *nd, char **name)
1859 char *s = getname(path);
1860 int error;
1862 if (IS_ERR(s))
1863 return PTR_ERR(s);
1865 error = do_path_lookup(dfd, s, LOOKUP_PARENT, nd);
1866 if (error)
1867 putname(s);
1868 else
1869 *name = s;
1871 return error;
1875 * It's inline, so penalty for filesystems that don't use sticky bit is
1876 * minimal.
1878 static inline int check_sticky(struct inode *dir, struct inode *inode)
1880 uid_t fsuid = current_fsuid();
1882 if (!(dir->i_mode & S_ISVTX))
1883 return 0;
1884 if (current_user_ns() != inode_userns(inode))
1885 goto other_userns;
1886 if (inode->i_uid == fsuid)
1887 return 0;
1888 if (dir->i_uid == fsuid)
1889 return 0;
1891 other_userns:
1892 return !ns_capable(inode_userns(inode), CAP_FOWNER);
1896 * Check whether we can remove a link victim from directory dir, check
1897 * whether the type of victim is right.
1898 * 1. We can't do it if dir is read-only (done in permission())
1899 * 2. We should have write and exec permissions on dir
1900 * 3. We can't remove anything from append-only dir
1901 * 4. We can't do anything with immutable dir (done in permission())
1902 * 5. If the sticky bit on dir is set we should either
1903 * a. be owner of dir, or
1904 * b. be owner of victim, or
1905 * c. have CAP_FOWNER capability
1906 * 6. If the victim is append-only or immutable we can't do antyhing with
1907 * links pointing to it.
1908 * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR.
1909 * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR.
1910 * 9. We can't remove a root or mountpoint.
1911 * 10. We don't allow removal of NFS sillyrenamed files; it's handled by
1912 * nfs_async_unlink().
1914 static int may_delete(struct inode *dir,struct dentry *victim,int isdir)
1916 int error;
1918 if (!victim->d_inode)
1919 return -ENOENT;
1921 BUG_ON(victim->d_parent->d_inode != dir);
1922 audit_inode_child(victim, dir);
1924 error = inode_permission(dir, MAY_WRITE | MAY_EXEC);
1925 if (error)
1926 return error;
1927 if (IS_APPEND(dir))
1928 return -EPERM;
1929 if (check_sticky(dir, victim->d_inode)||IS_APPEND(victim->d_inode)||
1930 IS_IMMUTABLE(victim->d_inode) || IS_SWAPFILE(victim->d_inode))
1931 return -EPERM;
1932 if (isdir) {
1933 if (!S_ISDIR(victim->d_inode->i_mode))
1934 return -ENOTDIR;
1935 if (IS_ROOT(victim))
1936 return -EBUSY;
1937 } else if (S_ISDIR(victim->d_inode->i_mode))
1938 return -EISDIR;
1939 if (IS_DEADDIR(dir))
1940 return -ENOENT;
1941 if (victim->d_flags & DCACHE_NFSFS_RENAMED)
1942 return -EBUSY;
1943 return 0;
1946 /* Check whether we can create an object with dentry child in directory
1947 * dir.
1948 * 1. We can't do it if child already exists (open has special treatment for
1949 * this case, but since we are inlined it's OK)
1950 * 2. We can't do it if dir is read-only (done in permission())
1951 * 3. We should have write and exec permissions on dir
1952 * 4. We can't do it if dir is immutable (done in permission())
1954 static inline int may_create(struct inode *dir, struct dentry *child)
1956 if (child->d_inode)
1957 return -EEXIST;
1958 if (IS_DEADDIR(dir))
1959 return -ENOENT;
1960 return inode_permission(dir, MAY_WRITE | MAY_EXEC);
1964 * p1 and p2 should be directories on the same fs.
1966 struct dentry *lock_rename(struct dentry *p1, struct dentry *p2)
1968 struct dentry *p;
1970 if (p1 == p2) {
1971 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1972 return NULL;
1975 mutex_lock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1977 p = d_ancestor(p2, p1);
1978 if (p) {
1979 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_PARENT);
1980 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_CHILD);
1981 return p;
1984 p = d_ancestor(p1, p2);
1985 if (p) {
1986 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1987 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1988 return p;
1991 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1992 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1993 return NULL;
1996 void unlock_rename(struct dentry *p1, struct dentry *p2)
1998 mutex_unlock(&p1->d_inode->i_mutex);
1999 if (p1 != p2) {
2000 mutex_unlock(&p2->d_inode->i_mutex);
2001 mutex_unlock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
2005 int vfs_create(struct inode *dir, struct dentry *dentry, umode_t mode,
2006 struct nameidata *nd)
2008 int error = may_create(dir, dentry);
2010 if (error)
2011 return error;
2013 if (!dir->i_op->create)
2014 return -EACCES; /* shouldn't it be ENOSYS? */
2015 mode &= S_IALLUGO;
2016 mode |= S_IFREG;
2017 error = security_inode_create(dir, dentry, mode);
2018 if (error)
2019 return error;
2020 error = dir->i_op->create(dir, dentry, mode, nd);
2021 if (!error)
2022 fsnotify_create(dir, dentry);
2023 return error;
2026 static int may_open(struct path *path, int acc_mode, int flag)
2028 struct dentry *dentry = path->dentry;
2029 struct inode *inode = dentry->d_inode;
2030 int error;
2032 /* O_PATH? */
2033 if (!acc_mode)
2034 return 0;
2036 if (!inode)
2037 return -ENOENT;
2039 switch (inode->i_mode & S_IFMT) {
2040 case S_IFLNK:
2041 return -ELOOP;
2042 case S_IFDIR:
2043 if (acc_mode & MAY_WRITE)
2044 return -EISDIR;
2045 break;
2046 case S_IFBLK:
2047 case S_IFCHR:
2048 if (path->mnt->mnt_flags & MNT_NODEV)
2049 return -EACCES;
2050 /*FALLTHRU*/
2051 case S_IFIFO:
2052 case S_IFSOCK:
2053 flag &= ~O_TRUNC;
2054 break;
2057 error = inode_permission(inode, acc_mode);
2058 if (error)
2059 return error;
2062 * An append-only file must be opened in append mode for writing.
2064 if (IS_APPEND(inode)) {
2065 if ((flag & O_ACCMODE) != O_RDONLY && !(flag & O_APPEND))
2066 return -EPERM;
2067 if (flag & O_TRUNC)
2068 return -EPERM;
2071 /* O_NOATIME can only be set by the owner or superuser */
2072 if (flag & O_NOATIME && !inode_owner_or_capable(inode))
2073 return -EPERM;
2075 return 0;
2078 static int handle_truncate(struct file *filp)
2080 struct path *path = &filp->f_path;
2081 struct inode *inode = path->dentry->d_inode;
2082 int error = get_write_access(inode);
2083 if (error)
2084 return error;
2086 * Refuse to truncate files with mandatory locks held on them.
2088 error = locks_verify_locked(inode);
2089 if (!error)
2090 error = security_path_truncate(path);
2091 if (!error) {
2092 error = do_truncate(path->dentry, 0,
2093 ATTR_MTIME|ATTR_CTIME|ATTR_OPEN,
2094 filp);
2096 put_write_access(inode);
2097 return error;
2100 static inline int open_to_namei_flags(int flag)
2102 if ((flag & O_ACCMODE) == 3)
2103 flag--;
2104 return flag;
2108 * Handle the last step of open()
2110 static struct file *do_last(struct nameidata *nd, struct path *path,
2111 const struct open_flags *op, const char *pathname)
2113 struct dentry *dir = nd->path.dentry;
2114 struct dentry *dentry;
2115 int open_flag = op->open_flag;
2116 int will_truncate = open_flag & O_TRUNC;
2117 int want_write = 0;
2118 int acc_mode = op->acc_mode;
2119 struct file *filp;
2120 int error;
2122 nd->flags &= ~LOOKUP_PARENT;
2123 nd->flags |= op->intent;
2125 switch (nd->last_type) {
2126 case LAST_DOTDOT:
2127 case LAST_DOT:
2128 error = handle_dots(nd, nd->last_type);
2129 if (error)
2130 return ERR_PTR(error);
2131 /* fallthrough */
2132 case LAST_ROOT:
2133 error = complete_walk(nd);
2134 if (error)
2135 return ERR_PTR(error);
2136 audit_inode(pathname, nd->path.dentry);
2137 if (open_flag & O_CREAT) {
2138 error = -EISDIR;
2139 goto exit;
2141 goto ok;
2142 case LAST_BIND:
2143 error = complete_walk(nd);
2144 if (error)
2145 return ERR_PTR(error);
2146 audit_inode(pathname, dir);
2147 goto ok;
2150 if (!(open_flag & O_CREAT)) {
2151 int symlink_ok = 0;
2152 if (nd->last.name[nd->last.len])
2153 nd->flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY;
2154 if (open_flag & O_PATH && !(nd->flags & LOOKUP_FOLLOW))
2155 symlink_ok = 1;
2156 /* we _can_ be in RCU mode here */
2157 error = walk_component(nd, path, &nd->last, LAST_NORM,
2158 !symlink_ok);
2159 if (error < 0)
2160 return ERR_PTR(error);
2161 if (error) /* symlink */
2162 return NULL;
2163 /* sayonara */
2164 error = complete_walk(nd);
2165 if (error)
2166 return ERR_PTR(error);
2168 error = -ENOTDIR;
2169 if (nd->flags & LOOKUP_DIRECTORY) {
2170 if (!nd->inode->i_op->lookup)
2171 goto exit;
2173 audit_inode(pathname, nd->path.dentry);
2174 goto ok;
2177 /* create side of things */
2179 * This will *only* deal with leaving RCU mode - LOOKUP_JUMPED has been
2180 * cleared when we got to the last component we are about to look up
2182 error = complete_walk(nd);
2183 if (error)
2184 return ERR_PTR(error);
2186 audit_inode(pathname, dir);
2187 error = -EISDIR;
2188 /* trailing slashes? */
2189 if (nd->last.name[nd->last.len])
2190 goto exit;
2192 mutex_lock(&dir->d_inode->i_mutex);
2194 dentry = lookup_hash(nd);
2195 error = PTR_ERR(dentry);
2196 if (IS_ERR(dentry)) {
2197 mutex_unlock(&dir->d_inode->i_mutex);
2198 goto exit;
2201 path->dentry = dentry;
2202 path->mnt = nd->path.mnt;
2204 /* Negative dentry, just create the file */
2205 if (!dentry->d_inode) {
2206 umode_t mode = op->mode;
2207 if (!IS_POSIXACL(dir->d_inode))
2208 mode &= ~current_umask();
2210 * This write is needed to ensure that a
2211 * rw->ro transition does not occur between
2212 * the time when the file is created and when
2213 * a permanent write count is taken through
2214 * the 'struct file' in nameidata_to_filp().
2216 error = mnt_want_write(nd->path.mnt);
2217 if (error)
2218 goto exit_mutex_unlock;
2219 want_write = 1;
2220 /* Don't check for write permission, don't truncate */
2221 open_flag &= ~O_TRUNC;
2222 will_truncate = 0;
2223 acc_mode = MAY_OPEN;
2224 error = security_path_mknod(&nd->path, dentry, mode, 0);
2225 if (error)
2226 goto exit_mutex_unlock;
2227 error = vfs_create(dir->d_inode, dentry, mode, nd);
2228 if (error)
2229 goto exit_mutex_unlock;
2230 mutex_unlock(&dir->d_inode->i_mutex);
2231 dput(nd->path.dentry);
2232 nd->path.dentry = dentry;
2233 goto common;
2237 * It already exists.
2239 mutex_unlock(&dir->d_inode->i_mutex);
2240 audit_inode(pathname, path->dentry);
2242 error = -EEXIST;
2243 if (open_flag & O_EXCL)
2244 goto exit_dput;
2246 error = follow_managed(path, nd->flags);
2247 if (error < 0)
2248 goto exit_dput;
2250 if (error)
2251 nd->flags |= LOOKUP_JUMPED;
2253 error = -ENOENT;
2254 if (!path->dentry->d_inode)
2255 goto exit_dput;
2257 if (path->dentry->d_inode->i_op->follow_link)
2258 return NULL;
2260 path_to_nameidata(path, nd);
2261 nd->inode = path->dentry->d_inode;
2262 /* Why this, you ask? _Now_ we might have grown LOOKUP_JUMPED... */
2263 error = complete_walk(nd);
2264 if (error)
2265 return ERR_PTR(error);
2266 error = -EISDIR;
2267 if (S_ISDIR(nd->inode->i_mode))
2268 goto exit;
2270 if (!S_ISREG(nd->inode->i_mode))
2271 will_truncate = 0;
2273 if (will_truncate) {
2274 error = mnt_want_write(nd->path.mnt);
2275 if (error)
2276 goto exit;
2277 want_write = 1;
2279 common:
2280 error = may_open(&nd->path, acc_mode, open_flag);
2281 if (error)
2282 goto exit;
2283 filp = nameidata_to_filp(nd);
2284 if (!IS_ERR(filp)) {
2285 error = ima_file_check(filp, op->acc_mode);
2286 if (error) {
2287 fput(filp);
2288 filp = ERR_PTR(error);
2291 if (!IS_ERR(filp)) {
2292 if (will_truncate) {
2293 error = handle_truncate(filp);
2294 if (error) {
2295 fput(filp);
2296 filp = ERR_PTR(error);
2300 out:
2301 if (want_write)
2302 mnt_drop_write(nd->path.mnt);
2303 path_put(&nd->path);
2304 return filp;
2306 exit_mutex_unlock:
2307 mutex_unlock(&dir->d_inode->i_mutex);
2308 exit_dput:
2309 path_put_conditional(path, nd);
2310 exit:
2311 filp = ERR_PTR(error);
2312 goto out;
2315 static struct file *path_openat(int dfd, const char *pathname,
2316 struct nameidata *nd, const struct open_flags *op, int flags)
2318 struct file *base = NULL;
2319 struct file *filp;
2320 struct path path;
2321 int error;
2323 filp = get_empty_filp();
2324 if (!filp)
2325 return ERR_PTR(-ENFILE);
2327 filp->f_flags = op->open_flag;
2328 nd->intent.open.file = filp;
2329 nd->intent.open.flags = open_to_namei_flags(op->open_flag);
2330 nd->intent.open.create_mode = op->mode;
2332 error = path_init(dfd, pathname, flags | LOOKUP_PARENT, nd, &base);
2333 if (unlikely(error))
2334 goto out_filp;
2336 current->total_link_count = 0;
2337 error = link_path_walk(pathname, nd);
2338 if (unlikely(error))
2339 goto out_filp;
2341 filp = do_last(nd, &path, op, pathname);
2342 while (unlikely(!filp)) { /* trailing symlink */
2343 struct path link = path;
2344 void *cookie;
2345 if (!(nd->flags & LOOKUP_FOLLOW)) {
2346 path_put_conditional(&path, nd);
2347 path_put(&nd->path);
2348 filp = ERR_PTR(-ELOOP);
2349 break;
2351 nd->flags |= LOOKUP_PARENT;
2352 nd->flags &= ~(LOOKUP_OPEN|LOOKUP_CREATE|LOOKUP_EXCL);
2353 error = follow_link(&link, nd, &cookie);
2354 if (unlikely(error))
2355 filp = ERR_PTR(error);
2356 else
2357 filp = do_last(nd, &path, op, pathname);
2358 put_link(nd, &link, cookie);
2360 out:
2361 if (nd->root.mnt && !(nd->flags & LOOKUP_ROOT))
2362 path_put(&nd->root);
2363 if (base)
2364 fput(base);
2365 release_open_intent(nd);
2366 return filp;
2368 out_filp:
2369 filp = ERR_PTR(error);
2370 goto out;
2373 struct file *do_filp_open(int dfd, const char *pathname,
2374 const struct open_flags *op, int flags)
2376 struct nameidata nd;
2377 struct file *filp;
2379 filp = path_openat(dfd, pathname, &nd, op, flags | LOOKUP_RCU);
2380 if (unlikely(filp == ERR_PTR(-ECHILD)))
2381 filp = path_openat(dfd, pathname, &nd, op, flags);
2382 if (unlikely(filp == ERR_PTR(-ESTALE)))
2383 filp = path_openat(dfd, pathname, &nd, op, flags | LOOKUP_REVAL);
2384 return filp;
2387 struct file *do_file_open_root(struct dentry *dentry, struct vfsmount *mnt,
2388 const char *name, const struct open_flags *op, int flags)
2390 struct nameidata nd;
2391 struct file *file;
2393 nd.root.mnt = mnt;
2394 nd.root.dentry = dentry;
2396 flags |= LOOKUP_ROOT;
2398 if (dentry->d_inode->i_op->follow_link && op->intent & LOOKUP_OPEN)
2399 return ERR_PTR(-ELOOP);
2401 file = path_openat(-1, name, &nd, op, flags | LOOKUP_RCU);
2402 if (unlikely(file == ERR_PTR(-ECHILD)))
2403 file = path_openat(-1, name, &nd, op, flags);
2404 if (unlikely(file == ERR_PTR(-ESTALE)))
2405 file = path_openat(-1, name, &nd, op, flags | LOOKUP_REVAL);
2406 return file;
2409 struct dentry *kern_path_create(int dfd, const char *pathname, struct path *path, int is_dir)
2411 struct dentry *dentry = ERR_PTR(-EEXIST);
2412 struct nameidata nd;
2413 int error = do_path_lookup(dfd, pathname, LOOKUP_PARENT, &nd);
2414 if (error)
2415 return ERR_PTR(error);
2418 * Yucky last component or no last component at all?
2419 * (foo/., foo/.., /////)
2421 if (nd.last_type != LAST_NORM)
2422 goto out;
2423 nd.flags &= ~LOOKUP_PARENT;
2424 nd.flags |= LOOKUP_CREATE | LOOKUP_EXCL;
2425 nd.intent.open.flags = O_EXCL;
2428 * Do the final lookup.
2430 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2431 dentry = lookup_hash(&nd);
2432 if (IS_ERR(dentry))
2433 goto fail;
2435 if (dentry->d_inode)
2436 goto eexist;
2438 * Special case - lookup gave negative, but... we had foo/bar/
2439 * From the vfs_mknod() POV we just have a negative dentry -
2440 * all is fine. Let's be bastards - you had / on the end, you've
2441 * been asking for (non-existent) directory. -ENOENT for you.
2443 if (unlikely(!is_dir && nd.last.name[nd.last.len])) {
2444 dput(dentry);
2445 dentry = ERR_PTR(-ENOENT);
2446 goto fail;
2448 *path = nd.path;
2449 return dentry;
2450 eexist:
2451 dput(dentry);
2452 dentry = ERR_PTR(-EEXIST);
2453 fail:
2454 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2455 out:
2456 path_put(&nd.path);
2457 return dentry;
2459 EXPORT_SYMBOL(kern_path_create);
2461 struct dentry *user_path_create(int dfd, const char __user *pathname, struct path *path, int is_dir)
2463 char *tmp = getname(pathname);
2464 struct dentry *res;
2465 if (IS_ERR(tmp))
2466 return ERR_CAST(tmp);
2467 res = kern_path_create(dfd, tmp, path, is_dir);
2468 putname(tmp);
2469 return res;
2471 EXPORT_SYMBOL(user_path_create);
2473 int vfs_mknod(struct inode *dir, struct dentry *dentry, umode_t mode, dev_t dev)
2475 int error = may_create(dir, dentry);
2477 if (error)
2478 return error;
2480 if ((S_ISCHR(mode) || S_ISBLK(mode)) &&
2481 !ns_capable(inode_userns(dir), CAP_MKNOD))
2482 return -EPERM;
2484 if (!dir->i_op->mknod)
2485 return -EPERM;
2487 error = devcgroup_inode_mknod(mode, dev);
2488 if (error)
2489 return error;
2491 error = security_inode_mknod(dir, dentry, mode, dev);
2492 if (error)
2493 return error;
2495 error = dir->i_op->mknod(dir, dentry, mode, dev);
2496 if (!error)
2497 fsnotify_create(dir, dentry);
2498 return error;
2501 static int may_mknod(umode_t mode)
2503 switch (mode & S_IFMT) {
2504 case S_IFREG:
2505 case S_IFCHR:
2506 case S_IFBLK:
2507 case S_IFIFO:
2508 case S_IFSOCK:
2509 case 0: /* zero mode translates to S_IFREG */
2510 return 0;
2511 case S_IFDIR:
2512 return -EPERM;
2513 default:
2514 return -EINVAL;
2518 SYSCALL_DEFINE4(mknodat, int, dfd, const char __user *, filename, umode_t, mode,
2519 unsigned, dev)
2521 struct dentry *dentry;
2522 struct path path;
2523 int error;
2525 if (S_ISDIR(mode))
2526 return -EPERM;
2528 dentry = user_path_create(dfd, filename, &path, 0);
2529 if (IS_ERR(dentry))
2530 return PTR_ERR(dentry);
2532 if (!IS_POSIXACL(path.dentry->d_inode))
2533 mode &= ~current_umask();
2534 error = may_mknod(mode);
2535 if (error)
2536 goto out_dput;
2537 error = mnt_want_write(path.mnt);
2538 if (error)
2539 goto out_dput;
2540 error = security_path_mknod(&path, dentry, mode, dev);
2541 if (error)
2542 goto out_drop_write;
2543 switch (mode & S_IFMT) {
2544 case 0: case S_IFREG:
2545 error = vfs_create(path.dentry->d_inode,dentry,mode,NULL);
2546 break;
2547 case S_IFCHR: case S_IFBLK:
2548 error = vfs_mknod(path.dentry->d_inode,dentry,mode,
2549 new_decode_dev(dev));
2550 break;
2551 case S_IFIFO: case S_IFSOCK:
2552 error = vfs_mknod(path.dentry->d_inode,dentry,mode,0);
2553 break;
2555 out_drop_write:
2556 mnt_drop_write(path.mnt);
2557 out_dput:
2558 dput(dentry);
2559 mutex_unlock(&path.dentry->d_inode->i_mutex);
2560 path_put(&path);
2562 return error;
2565 SYSCALL_DEFINE3(mknod, const char __user *, filename, umode_t, mode, unsigned, dev)
2567 return sys_mknodat(AT_FDCWD, filename, mode, dev);
2570 int vfs_mkdir(struct inode *dir, struct dentry *dentry, umode_t mode)
2572 int error = may_create(dir, dentry);
2574 if (error)
2575 return error;
2577 if (!dir->i_op->mkdir)
2578 return -EPERM;
2580 mode &= (S_IRWXUGO|S_ISVTX);
2581 error = security_inode_mkdir(dir, dentry, mode);
2582 if (error)
2583 return error;
2585 error = dir->i_op->mkdir(dir, dentry, mode);
2586 if (!error)
2587 fsnotify_mkdir(dir, dentry);
2588 return error;
2591 SYSCALL_DEFINE3(mkdirat, int, dfd, const char __user *, pathname, umode_t, mode)
2593 struct dentry *dentry;
2594 struct path path;
2595 int error;
2597 dentry = user_path_create(dfd, pathname, &path, 1);
2598 if (IS_ERR(dentry))
2599 return PTR_ERR(dentry);
2601 if (!IS_POSIXACL(path.dentry->d_inode))
2602 mode &= ~current_umask();
2603 error = mnt_want_write(path.mnt);
2604 if (error)
2605 goto out_dput;
2606 error = security_path_mkdir(&path, dentry, mode);
2607 if (error)
2608 goto out_drop_write;
2609 error = vfs_mkdir(path.dentry->d_inode, dentry, mode);
2610 out_drop_write:
2611 mnt_drop_write(path.mnt);
2612 out_dput:
2613 dput(dentry);
2614 mutex_unlock(&path.dentry->d_inode->i_mutex);
2615 path_put(&path);
2616 return error;
2619 SYSCALL_DEFINE2(mkdir, const char __user *, pathname, umode_t, mode)
2621 return sys_mkdirat(AT_FDCWD, pathname, mode);
2625 * The dentry_unhash() helper will try to drop the dentry early: we
2626 * should have a usage count of 2 if we're the only user of this
2627 * dentry, and if that is true (possibly after pruning the dcache),
2628 * then we drop the dentry now.
2630 * A low-level filesystem can, if it choses, legally
2631 * do a
2633 * if (!d_unhashed(dentry))
2634 * return -EBUSY;
2636 * if it cannot handle the case of removing a directory
2637 * that is still in use by something else..
2639 void dentry_unhash(struct dentry *dentry)
2641 shrink_dcache_parent(dentry);
2642 spin_lock(&dentry->d_lock);
2643 if (dentry->d_count == 1)
2644 __d_drop(dentry);
2645 spin_unlock(&dentry->d_lock);
2648 int vfs_rmdir(struct inode *dir, struct dentry *dentry)
2650 int error = may_delete(dir, dentry, 1);
2652 if (error)
2653 return error;
2655 if (!dir->i_op->rmdir)
2656 return -EPERM;
2658 dget(dentry);
2659 mutex_lock(&dentry->d_inode->i_mutex);
2661 error = -EBUSY;
2662 if (d_mountpoint(dentry))
2663 goto out;
2665 error = security_inode_rmdir(dir, dentry);
2666 if (error)
2667 goto out;
2669 shrink_dcache_parent(dentry);
2670 error = dir->i_op->rmdir(dir, dentry);
2671 if (error)
2672 goto out;
2674 dentry->d_inode->i_flags |= S_DEAD;
2675 dont_mount(dentry);
2677 out:
2678 mutex_unlock(&dentry->d_inode->i_mutex);
2679 dput(dentry);
2680 if (!error)
2681 d_delete(dentry);
2682 return error;
2685 static long do_rmdir(int dfd, const char __user *pathname)
2687 int error = 0;
2688 char * name;
2689 struct dentry *dentry;
2690 struct nameidata nd;
2692 error = user_path_parent(dfd, pathname, &nd, &name);
2693 if (error)
2694 return error;
2696 switch(nd.last_type) {
2697 case LAST_DOTDOT:
2698 error = -ENOTEMPTY;
2699 goto exit1;
2700 case LAST_DOT:
2701 error = -EINVAL;
2702 goto exit1;
2703 case LAST_ROOT:
2704 error = -EBUSY;
2705 goto exit1;
2708 nd.flags &= ~LOOKUP_PARENT;
2710 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2711 dentry = lookup_hash(&nd);
2712 error = PTR_ERR(dentry);
2713 if (IS_ERR(dentry))
2714 goto exit2;
2715 if (!dentry->d_inode) {
2716 error = -ENOENT;
2717 goto exit3;
2719 error = mnt_want_write(nd.path.mnt);
2720 if (error)
2721 goto exit3;
2722 error = security_path_rmdir(&nd.path, dentry);
2723 if (error)
2724 goto exit4;
2725 error = vfs_rmdir(nd.path.dentry->d_inode, dentry);
2726 exit4:
2727 mnt_drop_write(nd.path.mnt);
2728 exit3:
2729 dput(dentry);
2730 exit2:
2731 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2732 exit1:
2733 path_put(&nd.path);
2734 putname(name);
2735 return error;
2738 SYSCALL_DEFINE1(rmdir, const char __user *, pathname)
2740 return do_rmdir(AT_FDCWD, pathname);
2743 int vfs_unlink(struct inode *dir, struct dentry *dentry)
2745 int error = may_delete(dir, dentry, 0);
2747 if (error)
2748 return error;
2750 if (!dir->i_op->unlink)
2751 return -EPERM;
2753 mutex_lock(&dentry->d_inode->i_mutex);
2754 if (d_mountpoint(dentry))
2755 error = -EBUSY;
2756 else {
2757 error = security_inode_unlink(dir, dentry);
2758 if (!error) {
2759 error = dir->i_op->unlink(dir, dentry);
2760 if (!error)
2761 dont_mount(dentry);
2764 mutex_unlock(&dentry->d_inode->i_mutex);
2766 /* We don't d_delete() NFS sillyrenamed files--they still exist. */
2767 if (!error && !(dentry->d_flags & DCACHE_NFSFS_RENAMED)) {
2768 fsnotify_link_count(dentry->d_inode);
2769 d_delete(dentry);
2772 return error;
2776 * Make sure that the actual truncation of the file will occur outside its
2777 * directory's i_mutex. Truncate can take a long time if there is a lot of
2778 * writeout happening, and we don't want to prevent access to the directory
2779 * while waiting on the I/O.
2781 static long do_unlinkat(int dfd, const char __user *pathname)
2783 int error;
2784 char *name;
2785 struct dentry *dentry;
2786 struct nameidata nd;
2787 struct inode *inode = NULL;
2789 error = user_path_parent(dfd, pathname, &nd, &name);
2790 if (error)
2791 return error;
2793 error = -EISDIR;
2794 if (nd.last_type != LAST_NORM)
2795 goto exit1;
2797 nd.flags &= ~LOOKUP_PARENT;
2799 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2800 dentry = lookup_hash(&nd);
2801 error = PTR_ERR(dentry);
2802 if (!IS_ERR(dentry)) {
2803 /* Why not before? Because we want correct error value */
2804 if (nd.last.name[nd.last.len])
2805 goto slashes;
2806 inode = dentry->d_inode;
2807 if (!inode)
2808 goto slashes;
2809 ihold(inode);
2810 error = mnt_want_write(nd.path.mnt);
2811 if (error)
2812 goto exit2;
2813 error = security_path_unlink(&nd.path, dentry);
2814 if (error)
2815 goto exit3;
2816 error = vfs_unlink(nd.path.dentry->d_inode, dentry);
2817 exit3:
2818 mnt_drop_write(nd.path.mnt);
2819 exit2:
2820 dput(dentry);
2822 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2823 if (inode)
2824 iput(inode); /* truncate the inode here */
2825 exit1:
2826 path_put(&nd.path);
2827 putname(name);
2828 return error;
2830 slashes:
2831 error = !dentry->d_inode ? -ENOENT :
2832 S_ISDIR(dentry->d_inode->i_mode) ? -EISDIR : -ENOTDIR;
2833 goto exit2;
2836 SYSCALL_DEFINE3(unlinkat, int, dfd, const char __user *, pathname, int, flag)
2838 if ((flag & ~AT_REMOVEDIR) != 0)
2839 return -EINVAL;
2841 if (flag & AT_REMOVEDIR)
2842 return do_rmdir(dfd, pathname);
2844 return do_unlinkat(dfd, pathname);
2847 SYSCALL_DEFINE1(unlink, const char __user *, pathname)
2849 return do_unlinkat(AT_FDCWD, pathname);
2852 int vfs_symlink(struct inode *dir, struct dentry *dentry, const char *oldname)
2854 int error = may_create(dir, dentry);
2856 if (error)
2857 return error;
2859 if (!dir->i_op->symlink)
2860 return -EPERM;
2862 error = security_inode_symlink(dir, dentry, oldname);
2863 if (error)
2864 return error;
2866 error = dir->i_op->symlink(dir, dentry, oldname);
2867 if (!error)
2868 fsnotify_create(dir, dentry);
2869 return error;
2872 SYSCALL_DEFINE3(symlinkat, const char __user *, oldname,
2873 int, newdfd, const char __user *, newname)
2875 int error;
2876 char *from;
2877 struct dentry *dentry;
2878 struct path path;
2880 from = getname(oldname);
2881 if (IS_ERR(from))
2882 return PTR_ERR(from);
2884 dentry = user_path_create(newdfd, newname, &path, 0);
2885 error = PTR_ERR(dentry);
2886 if (IS_ERR(dentry))
2887 goto out_putname;
2889 error = mnt_want_write(path.mnt);
2890 if (error)
2891 goto out_dput;
2892 error = security_path_symlink(&path, dentry, from);
2893 if (error)
2894 goto out_drop_write;
2895 error = vfs_symlink(path.dentry->d_inode, dentry, from);
2896 out_drop_write:
2897 mnt_drop_write(path.mnt);
2898 out_dput:
2899 dput(dentry);
2900 mutex_unlock(&path.dentry->d_inode->i_mutex);
2901 path_put(&path);
2902 out_putname:
2903 putname(from);
2904 return error;
2907 SYSCALL_DEFINE2(symlink, const char __user *, oldname, const char __user *, newname)
2909 return sys_symlinkat(oldname, AT_FDCWD, newname);
2912 int vfs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *new_dentry)
2914 struct inode *inode = old_dentry->d_inode;
2915 int error;
2917 if (!inode)
2918 return -ENOENT;
2920 error = may_create(dir, new_dentry);
2921 if (error)
2922 return error;
2924 if (dir->i_sb != inode->i_sb)
2925 return -EXDEV;
2928 * A link to an append-only or immutable file cannot be created.
2930 if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
2931 return -EPERM;
2932 if (!dir->i_op->link)
2933 return -EPERM;
2934 if (S_ISDIR(inode->i_mode))
2935 return -EPERM;
2937 error = security_inode_link(old_dentry, dir, new_dentry);
2938 if (error)
2939 return error;
2941 mutex_lock(&inode->i_mutex);
2942 /* Make sure we don't allow creating hardlink to an unlinked file */
2943 if (inode->i_nlink == 0)
2944 error = -ENOENT;
2945 else
2946 error = dir->i_op->link(old_dentry, dir, new_dentry);
2947 mutex_unlock(&inode->i_mutex);
2948 if (!error)
2949 fsnotify_link(dir, inode, new_dentry);
2950 return error;
2954 * Hardlinks are often used in delicate situations. We avoid
2955 * security-related surprises by not following symlinks on the
2956 * newname. --KAB
2958 * We don't follow them on the oldname either to be compatible
2959 * with linux 2.0, and to avoid hard-linking to directories
2960 * and other special files. --ADM
2962 SYSCALL_DEFINE5(linkat, int, olddfd, const char __user *, oldname,
2963 int, newdfd, const char __user *, newname, int, flags)
2965 struct dentry *new_dentry;
2966 struct path old_path, new_path;
2967 int how = 0;
2968 int error;
2970 if ((flags & ~(AT_SYMLINK_FOLLOW | AT_EMPTY_PATH)) != 0)
2971 return -EINVAL;
2973 * To use null names we require CAP_DAC_READ_SEARCH
2974 * This ensures that not everyone will be able to create
2975 * handlink using the passed filedescriptor.
2977 if (flags & AT_EMPTY_PATH) {
2978 if (!capable(CAP_DAC_READ_SEARCH))
2979 return -ENOENT;
2980 how = LOOKUP_EMPTY;
2983 if (flags & AT_SYMLINK_FOLLOW)
2984 how |= LOOKUP_FOLLOW;
2986 error = user_path_at(olddfd, oldname, how, &old_path);
2987 if (error)
2988 return error;
2990 new_dentry = user_path_create(newdfd, newname, &new_path, 0);
2991 error = PTR_ERR(new_dentry);
2992 if (IS_ERR(new_dentry))
2993 goto out;
2995 error = -EXDEV;
2996 if (old_path.mnt != new_path.mnt)
2997 goto out_dput;
2998 error = mnt_want_write(new_path.mnt);
2999 if (error)
3000 goto out_dput;
3001 error = security_path_link(old_path.dentry, &new_path, new_dentry);
3002 if (error)
3003 goto out_drop_write;
3004 error = vfs_link(old_path.dentry, new_path.dentry->d_inode, new_dentry);
3005 out_drop_write:
3006 mnt_drop_write(new_path.mnt);
3007 out_dput:
3008 dput(new_dentry);
3009 mutex_unlock(&new_path.dentry->d_inode->i_mutex);
3010 path_put(&new_path);
3011 out:
3012 path_put(&old_path);
3014 return error;
3017 SYSCALL_DEFINE2(link, const char __user *, oldname, const char __user *, newname)
3019 return sys_linkat(AT_FDCWD, oldname, AT_FDCWD, newname, 0);
3023 * The worst of all namespace operations - renaming directory. "Perverted"
3024 * doesn't even start to describe it. Somebody in UCB had a heck of a trip...
3025 * Problems:
3026 * a) we can get into loop creation. Check is done in is_subdir().
3027 * b) race potential - two innocent renames can create a loop together.
3028 * That's where 4.4 screws up. Current fix: serialization on
3029 * sb->s_vfs_rename_mutex. We might be more accurate, but that's another
3030 * story.
3031 * c) we have to lock _three_ objects - parents and victim (if it exists).
3032 * And that - after we got ->i_mutex on parents (until then we don't know
3033 * whether the target exists). Solution: try to be smart with locking
3034 * order for inodes. We rely on the fact that tree topology may change
3035 * only under ->s_vfs_rename_mutex _and_ that parent of the object we
3036 * move will be locked. Thus we can rank directories by the tree
3037 * (ancestors first) and rank all non-directories after them.
3038 * That works since everybody except rename does "lock parent, lookup,
3039 * lock child" and rename is under ->s_vfs_rename_mutex.
3040 * HOWEVER, it relies on the assumption that any object with ->lookup()
3041 * has no more than 1 dentry. If "hybrid" objects will ever appear,
3042 * we'd better make sure that there's no link(2) for them.
3043 * d) conversion from fhandle to dentry may come in the wrong moment - when
3044 * we are removing the target. Solution: we will have to grab ->i_mutex
3045 * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on
3046 * ->i_mutex on parents, which works but leads to some truly excessive
3047 * locking].
3049 static int vfs_rename_dir(struct inode *old_dir, struct dentry *old_dentry,
3050 struct inode *new_dir, struct dentry *new_dentry)
3052 int error = 0;
3053 struct inode *target = new_dentry->d_inode;
3056 * If we are going to change the parent - check write permissions,
3057 * we'll need to flip '..'.
3059 if (new_dir != old_dir) {
3060 error = inode_permission(old_dentry->d_inode, MAY_WRITE);
3061 if (error)
3062 return error;
3065 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
3066 if (error)
3067 return error;
3069 dget(new_dentry);
3070 if (target)
3071 mutex_lock(&target->i_mutex);
3073 error = -EBUSY;
3074 if (d_mountpoint(old_dentry) || d_mountpoint(new_dentry))
3075 goto out;
3077 if (target)
3078 shrink_dcache_parent(new_dentry);
3079 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
3080 if (error)
3081 goto out;
3083 if (target) {
3084 target->i_flags |= S_DEAD;
3085 dont_mount(new_dentry);
3087 out:
3088 if (target)
3089 mutex_unlock(&target->i_mutex);
3090 dput(new_dentry);
3091 if (!error)
3092 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
3093 d_move(old_dentry,new_dentry);
3094 return error;
3097 static int vfs_rename_other(struct inode *old_dir, struct dentry *old_dentry,
3098 struct inode *new_dir, struct dentry *new_dentry)
3100 struct inode *target = new_dentry->d_inode;
3101 int error;
3103 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
3104 if (error)
3105 return error;
3107 dget(new_dentry);
3108 if (target)
3109 mutex_lock(&target->i_mutex);
3111 error = -EBUSY;
3112 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
3113 goto out;
3115 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
3116 if (error)
3117 goto out;
3119 if (target)
3120 dont_mount(new_dentry);
3121 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
3122 d_move(old_dentry, new_dentry);
3123 out:
3124 if (target)
3125 mutex_unlock(&target->i_mutex);
3126 dput(new_dentry);
3127 return error;
3130 int vfs_rename(struct inode *old_dir, struct dentry *old_dentry,
3131 struct inode *new_dir, struct dentry *new_dentry)
3133 int error;
3134 int is_dir = S_ISDIR(old_dentry->d_inode->i_mode);
3135 const unsigned char *old_name;
3137 if (old_dentry->d_inode == new_dentry->d_inode)
3138 return 0;
3140 error = may_delete(old_dir, old_dentry, is_dir);
3141 if (error)
3142 return error;
3144 if (!new_dentry->d_inode)
3145 error = may_create(new_dir, new_dentry);
3146 else
3147 error = may_delete(new_dir, new_dentry, is_dir);
3148 if (error)
3149 return error;
3151 if (!old_dir->i_op->rename)
3152 return -EPERM;
3154 old_name = fsnotify_oldname_init(old_dentry->d_name.name);
3156 if (is_dir)
3157 error = vfs_rename_dir(old_dir,old_dentry,new_dir,new_dentry);
3158 else
3159 error = vfs_rename_other(old_dir,old_dentry,new_dir,new_dentry);
3160 if (!error)
3161 fsnotify_move(old_dir, new_dir, old_name, is_dir,
3162 new_dentry->d_inode, old_dentry);
3163 fsnotify_oldname_free(old_name);
3165 return error;
3168 SYSCALL_DEFINE4(renameat, int, olddfd, const char __user *, oldname,
3169 int, newdfd, const char __user *, newname)
3171 struct dentry *old_dir, *new_dir;
3172 struct dentry *old_dentry, *new_dentry;
3173 struct dentry *trap;
3174 struct nameidata oldnd, newnd;
3175 char *from;
3176 char *to;
3177 int error;
3179 error = user_path_parent(olddfd, oldname, &oldnd, &from);
3180 if (error)
3181 goto exit;
3183 error = user_path_parent(newdfd, newname, &newnd, &to);
3184 if (error)
3185 goto exit1;
3187 error = -EXDEV;
3188 if (oldnd.path.mnt != newnd.path.mnt)
3189 goto exit2;
3191 old_dir = oldnd.path.dentry;
3192 error = -EBUSY;
3193 if (oldnd.last_type != LAST_NORM)
3194 goto exit2;
3196 new_dir = newnd.path.dentry;
3197 if (newnd.last_type != LAST_NORM)
3198 goto exit2;
3200 oldnd.flags &= ~LOOKUP_PARENT;
3201 newnd.flags &= ~LOOKUP_PARENT;
3202 newnd.flags |= LOOKUP_RENAME_TARGET;
3204 trap = lock_rename(new_dir, old_dir);
3206 old_dentry = lookup_hash(&oldnd);
3207 error = PTR_ERR(old_dentry);
3208 if (IS_ERR(old_dentry))
3209 goto exit3;
3210 /* source must exist */
3211 error = -ENOENT;
3212 if (!old_dentry->d_inode)
3213 goto exit4;
3214 /* unless the source is a directory trailing slashes give -ENOTDIR */
3215 if (!S_ISDIR(old_dentry->d_inode->i_mode)) {
3216 error = -ENOTDIR;
3217 if (oldnd.last.name[oldnd.last.len])
3218 goto exit4;
3219 if (newnd.last.name[newnd.last.len])
3220 goto exit4;
3222 /* source should not be ancestor of target */
3223 error = -EINVAL;
3224 if (old_dentry == trap)
3225 goto exit4;
3226 new_dentry = lookup_hash(&newnd);
3227 error = PTR_ERR(new_dentry);
3228 if (IS_ERR(new_dentry))
3229 goto exit4;
3230 /* target should not be an ancestor of source */
3231 error = -ENOTEMPTY;
3232 if (new_dentry == trap)
3233 goto exit5;
3235 error = mnt_want_write(oldnd.path.mnt);
3236 if (error)
3237 goto exit5;
3238 error = security_path_rename(&oldnd.path, old_dentry,
3239 &newnd.path, new_dentry);
3240 if (error)
3241 goto exit6;
3242 error = vfs_rename(old_dir->d_inode, old_dentry,
3243 new_dir->d_inode, new_dentry);
3244 exit6:
3245 mnt_drop_write(oldnd.path.mnt);
3246 exit5:
3247 dput(new_dentry);
3248 exit4:
3249 dput(old_dentry);
3250 exit3:
3251 unlock_rename(new_dir, old_dir);
3252 exit2:
3253 path_put(&newnd.path);
3254 putname(to);
3255 exit1:
3256 path_put(&oldnd.path);
3257 putname(from);
3258 exit:
3259 return error;
3262 SYSCALL_DEFINE2(rename, const char __user *, oldname, const char __user *, newname)
3264 return sys_renameat(AT_FDCWD, oldname, AT_FDCWD, newname);
3267 int vfs_readlink(struct dentry *dentry, char __user *buffer, int buflen, const char *link)
3269 int len;
3271 len = PTR_ERR(link);
3272 if (IS_ERR(link))
3273 goto out;
3275 len = strlen(link);
3276 if (len > (unsigned) buflen)
3277 len = buflen;
3278 if (copy_to_user(buffer, link, len))
3279 len = -EFAULT;
3280 out:
3281 return len;
3285 * A helper for ->readlink(). This should be used *ONLY* for symlinks that
3286 * have ->follow_link() touching nd only in nd_set_link(). Using (or not
3287 * using) it for any given inode is up to filesystem.
3289 int generic_readlink(struct dentry *dentry, char __user *buffer, int buflen)
3291 struct nameidata nd;
3292 void *cookie;
3293 int res;
3295 nd.depth = 0;
3296 cookie = dentry->d_inode->i_op->follow_link(dentry, &nd);
3297 if (IS_ERR(cookie))
3298 return PTR_ERR(cookie);
3300 res = vfs_readlink(dentry, buffer, buflen, nd_get_link(&nd));
3301 if (dentry->d_inode->i_op->put_link)
3302 dentry->d_inode->i_op->put_link(dentry, &nd, cookie);
3303 return res;
3306 int vfs_follow_link(struct nameidata *nd, const char *link)
3308 return __vfs_follow_link(nd, link);
3311 /* get the link contents into pagecache */
3312 static char *page_getlink(struct dentry * dentry, struct page **ppage)
3314 char *kaddr;
3315 struct page *page;
3316 struct address_space *mapping = dentry->d_inode->i_mapping;
3317 page = read_mapping_page(mapping, 0, NULL);
3318 if (IS_ERR(page))
3319 return (char*)page;
3320 *ppage = page;
3321 kaddr = kmap(page);
3322 nd_terminate_link(kaddr, dentry->d_inode->i_size, PAGE_SIZE - 1);
3323 return kaddr;
3326 int page_readlink(struct dentry *dentry, char __user *buffer, int buflen)
3328 struct page *page = NULL;
3329 char *s = page_getlink(dentry, &page);
3330 int res = vfs_readlink(dentry,buffer,buflen,s);
3331 if (page) {
3332 kunmap(page);
3333 page_cache_release(page);
3335 return res;
3338 void *page_follow_link_light(struct dentry *dentry, struct nameidata *nd)
3340 struct page *page = NULL;
3341 nd_set_link(nd, page_getlink(dentry, &page));
3342 return page;
3345 void page_put_link(struct dentry *dentry, struct nameidata *nd, void *cookie)
3347 struct page *page = cookie;
3349 if (page) {
3350 kunmap(page);
3351 page_cache_release(page);
3356 * The nofs argument instructs pagecache_write_begin to pass AOP_FLAG_NOFS
3358 int __page_symlink(struct inode *inode, const char *symname, int len, int nofs)
3360 struct address_space *mapping = inode->i_mapping;
3361 struct page *page;
3362 void *fsdata;
3363 int err;
3364 char *kaddr;
3365 unsigned int flags = AOP_FLAG_UNINTERRUPTIBLE;
3366 if (nofs)
3367 flags |= AOP_FLAG_NOFS;
3369 retry:
3370 err = pagecache_write_begin(NULL, mapping, 0, len-1,
3371 flags, &page, &fsdata);
3372 if (err)
3373 goto fail;
3375 kaddr = kmap_atomic(page, KM_USER0);
3376 memcpy(kaddr, symname, len-1);
3377 kunmap_atomic(kaddr, KM_USER0);
3379 err = pagecache_write_end(NULL, mapping, 0, len-1, len-1,
3380 page, fsdata);
3381 if (err < 0)
3382 goto fail;
3383 if (err < len-1)
3384 goto retry;
3386 mark_inode_dirty(inode);
3387 return 0;
3388 fail:
3389 return err;
3392 int page_symlink(struct inode *inode, const char *symname, int len)
3394 return __page_symlink(inode, symname, len,
3395 !(mapping_gfp_mask(inode->i_mapping) & __GFP_FS));
3398 const struct inode_operations page_symlink_inode_operations = {
3399 .readlink = generic_readlink,
3400 .follow_link = page_follow_link_light,
3401 .put_link = page_put_link,
3404 EXPORT_SYMBOL(user_path_at);
3405 EXPORT_SYMBOL(follow_down_one);
3406 EXPORT_SYMBOL(follow_down);
3407 EXPORT_SYMBOL(follow_up);
3408 EXPORT_SYMBOL(get_write_access); /* binfmt_aout */
3409 EXPORT_SYMBOL(getname);
3410 EXPORT_SYMBOL(lock_rename);
3411 EXPORT_SYMBOL(lookup_one_len);
3412 EXPORT_SYMBOL(page_follow_link_light);
3413 EXPORT_SYMBOL(page_put_link);
3414 EXPORT_SYMBOL(page_readlink);
3415 EXPORT_SYMBOL(__page_symlink);
3416 EXPORT_SYMBOL(page_symlink);
3417 EXPORT_SYMBOL(page_symlink_inode_operations);
3418 EXPORT_SYMBOL(kern_path);
3419 EXPORT_SYMBOL(vfs_path_lookup);
3420 EXPORT_SYMBOL(inode_permission);
3421 EXPORT_SYMBOL(unlock_rename);
3422 EXPORT_SYMBOL(vfs_create);
3423 EXPORT_SYMBOL(vfs_follow_link);
3424 EXPORT_SYMBOL(vfs_link);
3425 EXPORT_SYMBOL(vfs_mkdir);
3426 EXPORT_SYMBOL(vfs_mknod);
3427 EXPORT_SYMBOL(generic_permission);
3428 EXPORT_SYMBOL(vfs_readlink);
3429 EXPORT_SYMBOL(vfs_rename);
3430 EXPORT_SYMBOL(vfs_rmdir);
3431 EXPORT_SYMBOL(vfs_symlink);
3432 EXPORT_SYMBOL(vfs_unlink);
3433 EXPORT_SYMBOL(dentry_unhash);
3434 EXPORT_SYMBOL(generic_readlink);