1 // SPDX-License-Identifier: GPL-2.0
5 * Copyright (C) 1991, 1992 Linus Torvalds
9 * Some corrections by tytso.
12 /* [Feb 1997 T. Schoebel-Theuer] Complete rewrite of the pathname
15 /* [Feb-Apr 2000, AV] Rewrite to the new namespace architecture.
18 #include <linux/init.h>
19 #include <linux/export.h>
20 #include <linux/kernel.h>
21 #include <linux/slab.h>
23 #include <linux/namei.h>
24 #include <linux/pagemap.h>
25 #include <linux/fsnotify.h>
26 #include <linux/personality.h>
27 #include <linux/security.h>
28 #include <linux/ima.h>
29 #include <linux/syscalls.h>
30 #include <linux/mount.h>
31 #include <linux/audit.h>
32 #include <linux/capability.h>
33 #include <linux/file.h>
34 #include <linux/fcntl.h>
35 #include <linux/device_cgroup.h>
36 #include <linux/fs_struct.h>
37 #include <linux/posix_acl.h>
38 #include <linux/hash.h>
39 #include <linux/bitops.h>
40 #include <linux/init_task.h>
41 #include <linux/uaccess.h>
46 /* [Feb-1997 T. Schoebel-Theuer]
47 * Fundamental changes in the pathname lookup mechanisms (namei)
48 * were necessary because of omirr. The reason is that omirr needs
49 * to know the _real_ pathname, not the user-supplied one, in case
50 * of symlinks (and also when transname replacements occur).
52 * The new code replaces the old recursive symlink resolution with
53 * an iterative one (in case of non-nested symlink chains). It does
54 * this with calls to <fs>_follow_link().
55 * As a side effect, dir_namei(), _namei() and follow_link() are now
56 * replaced with a single function lookup_dentry() that can handle all
57 * the special cases of the former code.
59 * With the new dcache, the pathname is stored at each inode, at least as
60 * long as the refcount of the inode is positive. As a side effect, the
61 * size of the dcache depends on the inode cache and thus is dynamic.
63 * [29-Apr-1998 C. Scott Ananian] Updated above description of symlink
64 * resolution to correspond with current state of the code.
66 * Note that the symlink resolution is not *completely* iterative.
67 * There is still a significant amount of tail- and mid- recursion in
68 * the algorithm. Also, note that <fs>_readlink() is not used in
69 * lookup_dentry(): lookup_dentry() on the result of <fs>_readlink()
70 * may return different results than <fs>_follow_link(). Many virtual
71 * filesystems (including /proc) exhibit this behavior.
74 /* [24-Feb-97 T. Schoebel-Theuer] Side effects caused by new implementation:
75 * New symlink semantics: when open() is called with flags O_CREAT | O_EXCL
76 * and the name already exists in form of a symlink, try to create the new
77 * name indicated by the symlink. The old code always complained that the
78 * name already exists, due to not following the symlink even if its target
79 * is nonexistent. The new semantics affects also mknod() and link() when
80 * the name is a symlink pointing to a non-existent name.
82 * I don't know which semantics is the right one, since I have no access
83 * to standards. But I found by trial that HP-UX 9.0 has the full "new"
84 * semantics implemented, while SunOS 4.1.1 and Solaris (SunOS 5.4) have the
85 * "old" one. Personally, I think the new semantics is much more logical.
86 * Note that "ln old new" where "new" is a symlink pointing to a non-existing
87 * file does succeed in both HP-UX and SunOs, but not in Solaris
88 * and in the old Linux semantics.
91 /* [16-Dec-97 Kevin Buhr] For security reasons, we change some symlink
92 * semantics. See the comments in "open_namei" and "do_link" below.
94 * [10-Sep-98 Alan Modra] Another symlink change.
97 /* [Feb-Apr 2000 AV] Complete rewrite. Rules for symlinks:
98 * inside the path - always follow.
99 * in the last component in creation/removal/renaming - never follow.
100 * if LOOKUP_FOLLOW passed - follow.
101 * if the pathname has trailing slashes - follow.
102 * otherwise - don't follow.
103 * (applied in that order).
105 * [Jun 2000 AV] Inconsistent behaviour of open() in case if flags==O_CREAT
106 * restored for 2.4. This is the last surviving part of old 4.2BSD bug.
107 * During the 2.4 we need to fix the userland stuff depending on it -
108 * hopefully we will be able to get rid of that wart in 2.5. So far only
109 * XEmacs seems to be relying on it...
112 * [Sep 2001 AV] Single-semaphore locking scheme (kudos to David Holland)
113 * implemented. Let's see if raised priority of ->s_vfs_rename_mutex gives
114 * any extra contention...
117 /* In order to reduce some races, while at the same time doing additional
118 * checking and hopefully speeding things up, we copy filenames to the
119 * kernel data space before using them..
121 * POSIX.1 2.4: an empty pathname is invalid (ENOENT).
122 * PATH_MAX includes the nul terminator --RR.
125 #define EMBEDDED_NAME_MAX (PATH_MAX - offsetof(struct filename, iname))
128 getname_flags(const char __user
*filename
, int flags
, int *empty
)
130 struct filename
*result
;
134 result
= audit_reusename(filename
);
138 result
= __getname();
139 if (unlikely(!result
))
140 return ERR_PTR(-ENOMEM
);
143 * First, try to embed the struct filename inside the names_cache
146 kname
= (char *)result
->iname
;
147 result
->name
= kname
;
149 len
= strncpy_from_user(kname
, filename
, EMBEDDED_NAME_MAX
);
150 if (unlikely(len
< 0)) {
156 * Uh-oh. We have a name that's approaching PATH_MAX. Allocate a
157 * separate struct filename so we can dedicate the entire
158 * names_cache allocation for the pathname, and re-do the copy from
161 if (unlikely(len
== EMBEDDED_NAME_MAX
)) {
162 const size_t size
= offsetof(struct filename
, iname
[1]);
163 kname
= (char *)result
;
166 * size is chosen that way we to guarantee that
167 * result->iname[0] is within the same object and that
168 * kname can't be equal to result->iname, no matter what.
170 result
= kzalloc(size
, GFP_KERNEL
);
171 if (unlikely(!result
)) {
173 return ERR_PTR(-ENOMEM
);
175 result
->name
= kname
;
176 len
= strncpy_from_user(kname
, filename
, PATH_MAX
);
177 if (unlikely(len
< 0)) {
182 if (unlikely(len
== PATH_MAX
)) {
185 return ERR_PTR(-ENAMETOOLONG
);
190 /* The empty path is special. */
191 if (unlikely(!len
)) {
194 if (!(flags
& LOOKUP_EMPTY
)) {
196 return ERR_PTR(-ENOENT
);
200 result
->uptr
= filename
;
201 result
->aname
= NULL
;
202 audit_getname(result
);
207 getname(const char __user
* filename
)
209 return getname_flags(filename
, 0, NULL
);
213 getname_kernel(const char * filename
)
215 struct filename
*result
;
216 int len
= strlen(filename
) + 1;
218 result
= __getname();
219 if (unlikely(!result
))
220 return ERR_PTR(-ENOMEM
);
222 if (len
<= EMBEDDED_NAME_MAX
) {
223 result
->name
= (char *)result
->iname
;
224 } else if (len
<= PATH_MAX
) {
225 struct filename
*tmp
;
227 tmp
= kmalloc(sizeof(*tmp
), GFP_KERNEL
);
228 if (unlikely(!tmp
)) {
230 return ERR_PTR(-ENOMEM
);
232 tmp
->name
= (char *)result
;
236 return ERR_PTR(-ENAMETOOLONG
);
238 memcpy((char *)result
->name
, filename
, len
);
240 result
->aname
= NULL
;
242 audit_getname(result
);
247 void putname(struct filename
*name
)
249 BUG_ON(name
->refcnt
<= 0);
251 if (--name
->refcnt
> 0)
254 if (name
->name
!= name
->iname
) {
255 __putname(name
->name
);
261 static int check_acl(struct inode
*inode
, int mask
)
263 #ifdef CONFIG_FS_POSIX_ACL
264 struct posix_acl
*acl
;
266 if (mask
& MAY_NOT_BLOCK
) {
267 acl
= get_cached_acl_rcu(inode
, ACL_TYPE_ACCESS
);
270 /* no ->get_acl() calls in RCU mode... */
271 if (is_uncached_acl(acl
))
273 return posix_acl_permission(inode
, acl
, mask
& ~MAY_NOT_BLOCK
);
276 acl
= get_acl(inode
, ACL_TYPE_ACCESS
);
280 int error
= posix_acl_permission(inode
, acl
, mask
);
281 posix_acl_release(acl
);
290 * This does the basic permission checking
292 static int acl_permission_check(struct inode
*inode
, int mask
)
294 unsigned int mode
= inode
->i_mode
;
296 if (likely(uid_eq(current_fsuid(), inode
->i_uid
)))
299 if (IS_POSIXACL(inode
) && (mode
& S_IRWXG
)) {
300 int error
= check_acl(inode
, mask
);
301 if (error
!= -EAGAIN
)
305 if (in_group_p(inode
->i_gid
))
310 * If the DACs are ok we don't need any capability check.
312 if ((mask
& ~mode
& (MAY_READ
| MAY_WRITE
| MAY_EXEC
)) == 0)
318 * generic_permission - check for access rights on a Posix-like filesystem
319 * @inode: inode to check access rights for
320 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC, ...)
322 * Used to check for read/write/execute permissions on a file.
323 * We use "fsuid" for this, letting us set arbitrary permissions
324 * for filesystem access without changing the "normal" uids which
325 * are used for other things.
327 * generic_permission is rcu-walk aware. It returns -ECHILD in case an rcu-walk
328 * request cannot be satisfied (eg. requires blocking or too much complexity).
329 * It would then be called again in ref-walk mode.
331 int generic_permission(struct inode
*inode
, int mask
)
336 * Do the basic permission checks.
338 ret
= acl_permission_check(inode
, mask
);
342 if (S_ISDIR(inode
->i_mode
)) {
343 /* DACs are overridable for directories */
344 if (!(mask
& MAY_WRITE
))
345 if (capable_wrt_inode_uidgid(inode
,
346 CAP_DAC_READ_SEARCH
))
348 if (capable_wrt_inode_uidgid(inode
, CAP_DAC_OVERRIDE
))
354 * Searching includes executable on directories, else just read.
356 mask
&= MAY_READ
| MAY_WRITE
| MAY_EXEC
;
357 if (mask
== MAY_READ
)
358 if (capable_wrt_inode_uidgid(inode
, CAP_DAC_READ_SEARCH
))
361 * Read/write DACs are always overridable.
362 * Executable DACs are overridable when there is
363 * at least one exec bit set.
365 if (!(mask
& MAY_EXEC
) || (inode
->i_mode
& S_IXUGO
))
366 if (capable_wrt_inode_uidgid(inode
, CAP_DAC_OVERRIDE
))
371 EXPORT_SYMBOL(generic_permission
);
374 * We _really_ want to just do "generic_permission()" without
375 * even looking at the inode->i_op values. So we keep a cache
376 * flag in inode->i_opflags, that says "this has not special
377 * permission function, use the fast case".
379 static inline int do_inode_permission(struct inode
*inode
, int mask
)
381 if (unlikely(!(inode
->i_opflags
& IOP_FASTPERM
))) {
382 if (likely(inode
->i_op
->permission
))
383 return inode
->i_op
->permission(inode
, mask
);
385 /* This gets set once for the inode lifetime */
386 spin_lock(&inode
->i_lock
);
387 inode
->i_opflags
|= IOP_FASTPERM
;
388 spin_unlock(&inode
->i_lock
);
390 return generic_permission(inode
, mask
);
394 * __inode_permission - Check for access rights to a given inode
395 * @inode: Inode to check permission on
396 * @mask: Right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
398 * Check for read/write/execute permissions on an inode.
400 * When checking for MAY_APPEND, MAY_WRITE must also be set in @mask.
402 * This does not check for a read-only file system. You probably want
403 * inode_permission().
405 int __inode_permission(struct inode
*inode
, int mask
)
409 if (unlikely(mask
& MAY_WRITE
)) {
411 * Nobody gets write access to an immutable file.
413 if (IS_IMMUTABLE(inode
))
417 * Updating mtime will likely cause i_uid and i_gid to be
418 * written back improperly if their true value is unknown
421 if (HAS_UNMAPPED_ID(inode
))
425 retval
= do_inode_permission(inode
, mask
);
429 retval
= devcgroup_inode_permission(inode
, mask
);
433 return security_inode_permission(inode
, mask
);
435 EXPORT_SYMBOL(__inode_permission
);
438 * sb_permission - Check superblock-level permissions
439 * @sb: Superblock of inode to check permission on
440 * @inode: Inode to check permission on
441 * @mask: Right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
443 * Separate out file-system wide checks from inode-specific permission checks.
445 static int sb_permission(struct super_block
*sb
, struct inode
*inode
, int mask
)
447 if (unlikely(mask
& MAY_WRITE
)) {
448 umode_t mode
= inode
->i_mode
;
450 /* Nobody gets write access to a read-only fs. */
451 if (sb_rdonly(sb
) && (S_ISREG(mode
) || S_ISDIR(mode
) || S_ISLNK(mode
)))
458 * inode_permission - Check for access rights to a given inode
459 * @inode: Inode to check permission on
460 * @mask: Right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
462 * Check for read/write/execute permissions on an inode. We use fs[ug]id for
463 * this, letting us set arbitrary permissions for filesystem access without
464 * changing the "normal" UIDs which are used for other things.
466 * When checking for MAY_APPEND, MAY_WRITE must also be set in @mask.
468 int inode_permission(struct inode
*inode
, int mask
)
472 retval
= sb_permission(inode
->i_sb
, inode
, mask
);
475 return __inode_permission(inode
, mask
);
477 EXPORT_SYMBOL(inode_permission
);
480 * path_get - get a reference to a path
481 * @path: path to get the reference to
483 * Given a path increment the reference count to the dentry and the vfsmount.
485 void path_get(const struct path
*path
)
490 EXPORT_SYMBOL(path_get
);
493 * path_put - put a reference to a path
494 * @path: path to put the reference to
496 * Given a path decrement the reference count to the dentry and the vfsmount.
498 void path_put(const struct path
*path
)
503 EXPORT_SYMBOL(path_put
);
505 #define EMBEDDED_LEVELS 2
510 struct inode
*inode
; /* path.dentry.d_inode */
515 int total_link_count
;
518 struct delayed_call done
;
521 } *stack
, internal
[EMBEDDED_LEVELS
];
522 struct filename
*name
;
523 struct nameidata
*saved
;
524 struct inode
*link_inode
;
527 } __randomize_layout
;
529 static void set_nameidata(struct nameidata
*p
, int dfd
, struct filename
*name
)
531 struct nameidata
*old
= current
->nameidata
;
532 p
->stack
= p
->internal
;
535 p
->total_link_count
= old
? old
->total_link_count
: 0;
537 current
->nameidata
= p
;
540 static void restore_nameidata(void)
542 struct nameidata
*now
= current
->nameidata
, *old
= now
->saved
;
544 current
->nameidata
= old
;
546 old
->total_link_count
= now
->total_link_count
;
547 if (now
->stack
!= now
->internal
)
551 static int __nd_alloc_stack(struct nameidata
*nd
)
555 if (nd
->flags
& LOOKUP_RCU
) {
556 p
= kmalloc(MAXSYMLINKS
* sizeof(struct saved
),
561 p
= kmalloc(MAXSYMLINKS
* sizeof(struct saved
),
566 memcpy(p
, nd
->internal
, sizeof(nd
->internal
));
572 * path_connected - Verify that a path->dentry is below path->mnt.mnt_root
573 * @path: nameidate to verify
575 * Rename can sometimes move a file or directory outside of a bind
576 * mount, path_connected allows those cases to be detected.
578 static bool path_connected(const struct path
*path
)
580 struct vfsmount
*mnt
= path
->mnt
;
582 /* Only bind mounts can have disconnected paths */
583 if (mnt
->mnt_root
== mnt
->mnt_sb
->s_root
)
586 return is_subdir(path
->dentry
, mnt
->mnt_root
);
589 static inline int nd_alloc_stack(struct nameidata
*nd
)
591 if (likely(nd
->depth
!= EMBEDDED_LEVELS
))
593 if (likely(nd
->stack
!= nd
->internal
))
595 return __nd_alloc_stack(nd
);
598 static void drop_links(struct nameidata
*nd
)
602 struct saved
*last
= nd
->stack
+ i
;
603 do_delayed_call(&last
->done
);
604 clear_delayed_call(&last
->done
);
608 static void terminate_walk(struct nameidata
*nd
)
611 if (!(nd
->flags
& LOOKUP_RCU
)) {
614 for (i
= 0; i
< nd
->depth
; i
++)
615 path_put(&nd
->stack
[i
].link
);
616 if (nd
->root
.mnt
&& !(nd
->flags
& LOOKUP_ROOT
)) {
621 nd
->flags
&= ~LOOKUP_RCU
;
622 if (!(nd
->flags
& LOOKUP_ROOT
))
629 /* path_put is needed afterwards regardless of success or failure */
630 static bool legitimize_path(struct nameidata
*nd
,
631 struct path
*path
, unsigned seq
)
633 int res
= __legitimize_mnt(path
->mnt
, nd
->m_seq
);
640 if (unlikely(!lockref_get_not_dead(&path
->dentry
->d_lockref
))) {
644 return !read_seqcount_retry(&path
->dentry
->d_seq
, seq
);
647 static bool legitimize_links(struct nameidata
*nd
)
650 for (i
= 0; i
< nd
->depth
; i
++) {
651 struct saved
*last
= nd
->stack
+ i
;
652 if (unlikely(!legitimize_path(nd
, &last
->link
, last
->seq
))) {
662 * Path walking has 2 modes, rcu-walk and ref-walk (see
663 * Documentation/filesystems/path-lookup.txt). In situations when we can't
664 * continue in RCU mode, we attempt to drop out of rcu-walk mode and grab
665 * normal reference counts on dentries and vfsmounts to transition to ref-walk
666 * mode. Refcounts are grabbed at the last known good point before rcu-walk
667 * got stuck, so ref-walk may continue from there. If this is not successful
668 * (eg. a seqcount has changed), then failure is returned and it's up to caller
669 * to restart the path walk from the beginning in ref-walk mode.
673 * unlazy_walk - try to switch to ref-walk mode.
674 * @nd: nameidata pathwalk data
675 * Returns: 0 on success, -ECHILD on failure
677 * unlazy_walk attempts to legitimize the current nd->path and nd->root
679 * Must be called from rcu-walk context.
680 * Nothing should touch nameidata between unlazy_walk() failure and
683 static int unlazy_walk(struct nameidata
*nd
)
685 struct dentry
*parent
= nd
->path
.dentry
;
687 BUG_ON(!(nd
->flags
& LOOKUP_RCU
));
689 nd
->flags
&= ~LOOKUP_RCU
;
690 if (unlikely(!legitimize_links(nd
)))
692 if (unlikely(!legitimize_path(nd
, &nd
->path
, nd
->seq
)))
694 if (nd
->root
.mnt
&& !(nd
->flags
& LOOKUP_ROOT
)) {
695 if (unlikely(!legitimize_path(nd
, &nd
->root
, nd
->root_seq
)))
699 BUG_ON(nd
->inode
!= parent
->d_inode
);
704 nd
->path
.dentry
= NULL
;
706 if (!(nd
->flags
& LOOKUP_ROOT
))
714 * unlazy_child - try to switch to ref-walk mode.
715 * @nd: nameidata pathwalk data
716 * @dentry: child of nd->path.dentry
717 * @seq: seq number to check dentry against
718 * Returns: 0 on success, -ECHILD on failure
720 * unlazy_child attempts to legitimize the current nd->path, nd->root and dentry
721 * for ref-walk mode. @dentry must be a path found by a do_lookup call on
722 * @nd. Must be called from rcu-walk context.
723 * Nothing should touch nameidata between unlazy_child() failure and
726 static int unlazy_child(struct nameidata
*nd
, struct dentry
*dentry
, unsigned seq
)
728 BUG_ON(!(nd
->flags
& LOOKUP_RCU
));
730 nd
->flags
&= ~LOOKUP_RCU
;
731 if (unlikely(!legitimize_links(nd
)))
733 if (unlikely(!legitimize_mnt(nd
->path
.mnt
, nd
->m_seq
)))
735 if (unlikely(!lockref_get_not_dead(&nd
->path
.dentry
->d_lockref
)))
739 * We need to move both the parent and the dentry from the RCU domain
740 * to be properly refcounted. And the sequence number in the dentry
741 * validates *both* dentry counters, since we checked the sequence
742 * number of the parent after we got the child sequence number. So we
743 * know the parent must still be valid if the child sequence number is
745 if (unlikely(!lockref_get_not_dead(&dentry
->d_lockref
)))
747 if (unlikely(read_seqcount_retry(&dentry
->d_seq
, seq
))) {
753 * Sequence counts matched. Now make sure that the root is
754 * still valid and get it if required.
756 if (nd
->root
.mnt
&& !(nd
->flags
& LOOKUP_ROOT
)) {
757 if (unlikely(!legitimize_path(nd
, &nd
->root
, nd
->root_seq
))) {
770 nd
->path
.dentry
= NULL
;
774 if (!(nd
->flags
& LOOKUP_ROOT
))
779 static inline int d_revalidate(struct dentry
*dentry
, unsigned int flags
)
781 if (unlikely(dentry
->d_flags
& DCACHE_OP_REVALIDATE
))
782 return dentry
->d_op
->d_revalidate(dentry
, flags
);
788 * complete_walk - successful completion of path walk
789 * @nd: pointer nameidata
791 * If we had been in RCU mode, drop out of it and legitimize nd->path.
792 * Revalidate the final result, unless we'd already done that during
793 * the path walk or the filesystem doesn't ask for it. Return 0 on
794 * success, -error on failure. In case of failure caller does not
795 * need to drop nd->path.
797 static int complete_walk(struct nameidata
*nd
)
799 struct dentry
*dentry
= nd
->path
.dentry
;
802 if (nd
->flags
& LOOKUP_RCU
) {
803 if (!(nd
->flags
& LOOKUP_ROOT
))
805 if (unlikely(unlazy_walk(nd
)))
809 if (likely(!(nd
->flags
& LOOKUP_JUMPED
)))
812 if (likely(!(dentry
->d_flags
& DCACHE_OP_WEAK_REVALIDATE
)))
815 status
= dentry
->d_op
->d_weak_revalidate(dentry
, nd
->flags
);
825 static void set_root(struct nameidata
*nd
)
827 struct fs_struct
*fs
= current
->fs
;
829 if (nd
->flags
& LOOKUP_RCU
) {
833 seq
= read_seqcount_begin(&fs
->seq
);
835 nd
->root_seq
= __read_seqcount_begin(&nd
->root
.dentry
->d_seq
);
836 } while (read_seqcount_retry(&fs
->seq
, seq
));
838 get_fs_root(fs
, &nd
->root
);
842 static void path_put_conditional(struct path
*path
, struct nameidata
*nd
)
845 if (path
->mnt
!= nd
->path
.mnt
)
849 static inline void path_to_nameidata(const struct path
*path
,
850 struct nameidata
*nd
)
852 if (!(nd
->flags
& LOOKUP_RCU
)) {
853 dput(nd
->path
.dentry
);
854 if (nd
->path
.mnt
!= path
->mnt
)
855 mntput(nd
->path
.mnt
);
857 nd
->path
.mnt
= path
->mnt
;
858 nd
->path
.dentry
= path
->dentry
;
861 static int nd_jump_root(struct nameidata
*nd
)
863 if (nd
->flags
& LOOKUP_RCU
) {
867 nd
->inode
= d
->d_inode
;
868 nd
->seq
= nd
->root_seq
;
869 if (unlikely(read_seqcount_retry(&d
->d_seq
, nd
->seq
)))
875 nd
->inode
= nd
->path
.dentry
->d_inode
;
877 nd
->flags
|= LOOKUP_JUMPED
;
882 * Helper to directly jump to a known parsed path from ->get_link,
883 * caller must have taken a reference to path beforehand.
885 void nd_jump_link(struct path
*path
)
887 struct nameidata
*nd
= current
->nameidata
;
891 nd
->inode
= nd
->path
.dentry
->d_inode
;
892 nd
->flags
|= LOOKUP_JUMPED
;
895 static inline void put_link(struct nameidata
*nd
)
897 struct saved
*last
= nd
->stack
+ --nd
->depth
;
898 do_delayed_call(&last
->done
);
899 if (!(nd
->flags
& LOOKUP_RCU
))
900 path_put(&last
->link
);
903 int sysctl_protected_symlinks __read_mostly
= 0;
904 int sysctl_protected_hardlinks __read_mostly
= 0;
907 * may_follow_link - Check symlink following for unsafe situations
908 * @nd: nameidata pathwalk data
910 * In the case of the sysctl_protected_symlinks sysctl being enabled,
911 * CAP_DAC_OVERRIDE needs to be specifically ignored if the symlink is
912 * in a sticky world-writable directory. This is to protect privileged
913 * processes from failing races against path names that may change out
914 * from under them by way of other users creating malicious symlinks.
915 * It will permit symlinks to be followed only when outside a sticky
916 * world-writable directory, or when the uid of the symlink and follower
917 * match, or when the directory owner matches the symlink's owner.
919 * Returns 0 if following the symlink is allowed, -ve on error.
921 static inline int may_follow_link(struct nameidata
*nd
)
923 const struct inode
*inode
;
924 const struct inode
*parent
;
927 if (!sysctl_protected_symlinks
)
930 /* Allowed if owner and follower match. */
931 inode
= nd
->link_inode
;
932 if (uid_eq(current_cred()->fsuid
, inode
->i_uid
))
935 /* Allowed if parent directory not sticky and world-writable. */
937 if ((parent
->i_mode
& (S_ISVTX
|S_IWOTH
)) != (S_ISVTX
|S_IWOTH
))
940 /* Allowed if parent directory and link owner match. */
941 puid
= parent
->i_uid
;
942 if (uid_valid(puid
) && uid_eq(puid
, inode
->i_uid
))
945 if (nd
->flags
& LOOKUP_RCU
)
948 audit_log_link_denied("follow_link", &nd
->stack
[0].link
);
953 * safe_hardlink_source - Check for safe hardlink conditions
954 * @inode: the source inode to hardlink from
956 * Return false if at least one of the following conditions:
957 * - inode is not a regular file
959 * - inode is setgid and group-exec
960 * - access failure for read and write
962 * Otherwise returns true.
964 static bool safe_hardlink_source(struct inode
*inode
)
966 umode_t mode
= inode
->i_mode
;
968 /* Special files should not get pinned to the filesystem. */
972 /* Setuid files should not get pinned to the filesystem. */
976 /* Executable setgid files should not get pinned to the filesystem. */
977 if ((mode
& (S_ISGID
| S_IXGRP
)) == (S_ISGID
| S_IXGRP
))
980 /* Hardlinking to unreadable or unwritable sources is dangerous. */
981 if (inode_permission(inode
, MAY_READ
| MAY_WRITE
))
988 * may_linkat - Check permissions for creating a hardlink
989 * @link: the source to hardlink from
991 * Block hardlink when all of:
992 * - sysctl_protected_hardlinks enabled
993 * - fsuid does not match inode
994 * - hardlink source is unsafe (see safe_hardlink_source() above)
995 * - not CAP_FOWNER in a namespace with the inode owner uid mapped
997 * Returns 0 if successful, -ve on error.
999 static int may_linkat(struct path
*link
)
1001 struct inode
*inode
;
1003 if (!sysctl_protected_hardlinks
)
1006 inode
= link
->dentry
->d_inode
;
1008 /* Source inode owner (or CAP_FOWNER) can hardlink all they like,
1009 * otherwise, it must be a safe source.
1011 if (safe_hardlink_source(inode
) || inode_owner_or_capable(inode
))
1014 audit_log_link_denied("linkat", link
);
1018 static __always_inline
1019 const char *get_link(struct nameidata
*nd
)
1021 struct saved
*last
= nd
->stack
+ nd
->depth
- 1;
1022 struct dentry
*dentry
= last
->link
.dentry
;
1023 struct inode
*inode
= nd
->link_inode
;
1027 if (!(nd
->flags
& LOOKUP_RCU
)) {
1028 touch_atime(&last
->link
);
1030 } else if (atime_needs_update_rcu(&last
->link
, inode
)) {
1031 if (unlikely(unlazy_walk(nd
)))
1032 return ERR_PTR(-ECHILD
);
1033 touch_atime(&last
->link
);
1036 error
= security_inode_follow_link(dentry
, inode
,
1037 nd
->flags
& LOOKUP_RCU
);
1038 if (unlikely(error
))
1039 return ERR_PTR(error
);
1041 nd
->last_type
= LAST_BIND
;
1042 res
= inode
->i_link
;
1044 const char * (*get
)(struct dentry
*, struct inode
*,
1045 struct delayed_call
*);
1046 get
= inode
->i_op
->get_link
;
1047 if (nd
->flags
& LOOKUP_RCU
) {
1048 res
= get(NULL
, inode
, &last
->done
);
1049 if (res
== ERR_PTR(-ECHILD
)) {
1050 if (unlikely(unlazy_walk(nd
)))
1051 return ERR_PTR(-ECHILD
);
1052 res
= get(dentry
, inode
, &last
->done
);
1055 res
= get(dentry
, inode
, &last
->done
);
1057 if (IS_ERR_OR_NULL(res
))
1063 if (unlikely(nd_jump_root(nd
)))
1064 return ERR_PTR(-ECHILD
);
1065 while (unlikely(*++res
== '/'))
1074 * follow_up - Find the mountpoint of path's vfsmount
1076 * Given a path, find the mountpoint of its source file system.
1077 * Replace @path with the path of the mountpoint in the parent mount.
1080 * Return 1 if we went up a level and 0 if we were already at the
1083 int follow_up(struct path
*path
)
1085 struct mount
*mnt
= real_mount(path
->mnt
);
1086 struct mount
*parent
;
1087 struct dentry
*mountpoint
;
1089 read_seqlock_excl(&mount_lock
);
1090 parent
= mnt
->mnt_parent
;
1091 if (parent
== mnt
) {
1092 read_sequnlock_excl(&mount_lock
);
1095 mntget(&parent
->mnt
);
1096 mountpoint
= dget(mnt
->mnt_mountpoint
);
1097 read_sequnlock_excl(&mount_lock
);
1099 path
->dentry
= mountpoint
;
1101 path
->mnt
= &parent
->mnt
;
1104 EXPORT_SYMBOL(follow_up
);
1107 * Perform an automount
1108 * - return -EISDIR to tell follow_managed() to stop and return the path we
1111 static int follow_automount(struct path
*path
, struct nameidata
*nd
,
1114 struct vfsmount
*mnt
;
1117 if (!path
->dentry
->d_op
|| !path
->dentry
->d_op
->d_automount
)
1120 /* We don't want to mount if someone's just doing a stat -
1121 * unless they're stat'ing a directory and appended a '/' to
1124 * We do, however, want to mount if someone wants to open or
1125 * create a file of any type under the mountpoint, wants to
1126 * traverse through the mountpoint or wants to open the
1127 * mounted directory. Also, autofs may mark negative dentries
1128 * as being automount points. These will need the attentions
1129 * of the daemon to instantiate them before they can be used.
1131 if (!(nd
->flags
& (LOOKUP_PARENT
| LOOKUP_DIRECTORY
|
1132 LOOKUP_OPEN
| LOOKUP_CREATE
|
1133 LOOKUP_AUTOMOUNT
))) {
1134 /* Positive dentry that isn't meant to trigger an
1135 * automount, EISDIR will allow it to be used,
1136 * otherwise there's no mount here "now" so return
1139 if (path
->dentry
->d_inode
)
1145 if (path
->dentry
->d_sb
->s_user_ns
!= &init_user_ns
)
1148 nd
->total_link_count
++;
1149 if (nd
->total_link_count
>= 40)
1152 mnt
= path
->dentry
->d_op
->d_automount(path
);
1155 * The filesystem is allowed to return -EISDIR here to indicate
1156 * it doesn't want to automount. For instance, autofs would do
1157 * this so that its userspace daemon can mount on this dentry.
1159 * However, we can only permit this if it's a terminal point in
1160 * the path being looked up; if it wasn't then the remainder of
1161 * the path is inaccessible and we should say so.
1163 if (PTR_ERR(mnt
) == -EISDIR
&& (nd
->flags
& LOOKUP_PARENT
))
1165 return PTR_ERR(mnt
);
1168 if (!mnt
) /* mount collision */
1171 if (!*need_mntput
) {
1172 /* lock_mount() may release path->mnt on error */
1174 *need_mntput
= true;
1176 err
= finish_automount(mnt
, path
);
1180 /* Someone else made a mount here whilst we were busy */
1185 path
->dentry
= dget(mnt
->mnt_root
);
1194 * Handle a dentry that is managed in some way.
1195 * - Flagged for transit management (autofs)
1196 * - Flagged as mountpoint
1197 * - Flagged as automount point
1199 * This may only be called in refwalk mode.
1201 * Serialization is taken care of in namespace.c
1203 static int follow_managed(struct path
*path
, struct nameidata
*nd
)
1205 struct vfsmount
*mnt
= path
->mnt
; /* held by caller, must be left alone */
1207 bool need_mntput
= false;
1210 /* Given that we're not holding a lock here, we retain the value in a
1211 * local variable for each dentry as we look at it so that we don't see
1212 * the components of that value change under us */
1213 while (managed
= READ_ONCE(path
->dentry
->d_flags
),
1214 managed
&= DCACHE_MANAGED_DENTRY
,
1215 unlikely(managed
!= 0)) {
1216 /* Allow the filesystem to manage the transit without i_mutex
1218 if (managed
& DCACHE_MANAGE_TRANSIT
) {
1219 BUG_ON(!path
->dentry
->d_op
);
1220 BUG_ON(!path
->dentry
->d_op
->d_manage
);
1221 ret
= path
->dentry
->d_op
->d_manage(path
, false);
1226 /* Transit to a mounted filesystem. */
1227 if (managed
& DCACHE_MOUNTED
) {
1228 struct vfsmount
*mounted
= lookup_mnt(path
);
1233 path
->mnt
= mounted
;
1234 path
->dentry
= dget(mounted
->mnt_root
);
1239 /* Something is mounted on this dentry in another
1240 * namespace and/or whatever was mounted there in this
1241 * namespace got unmounted before lookup_mnt() could
1245 /* Handle an automount point */
1246 if (managed
& DCACHE_NEED_AUTOMOUNT
) {
1247 ret
= follow_automount(path
, nd
, &need_mntput
);
1253 /* We didn't change the current path point */
1257 if (need_mntput
&& path
->mnt
== mnt
)
1259 if (ret
== -EISDIR
|| !ret
)
1262 nd
->flags
|= LOOKUP_JUMPED
;
1263 if (unlikely(ret
< 0))
1264 path_put_conditional(path
, nd
);
1268 int follow_down_one(struct path
*path
)
1270 struct vfsmount
*mounted
;
1272 mounted
= lookup_mnt(path
);
1276 path
->mnt
= mounted
;
1277 path
->dentry
= dget(mounted
->mnt_root
);
1282 EXPORT_SYMBOL(follow_down_one
);
1284 static inline int managed_dentry_rcu(const struct path
*path
)
1286 return (path
->dentry
->d_flags
& DCACHE_MANAGE_TRANSIT
) ?
1287 path
->dentry
->d_op
->d_manage(path
, true) : 0;
1291 * Try to skip to top of mountpoint pile in rcuwalk mode. Fail if
1292 * we meet a managed dentry that would need blocking.
1294 static bool __follow_mount_rcu(struct nameidata
*nd
, struct path
*path
,
1295 struct inode
**inode
, unsigned *seqp
)
1298 struct mount
*mounted
;
1300 * Don't forget we might have a non-mountpoint managed dentry
1301 * that wants to block transit.
1303 switch (managed_dentry_rcu(path
)) {
1313 if (!d_mountpoint(path
->dentry
))
1314 return !(path
->dentry
->d_flags
& DCACHE_NEED_AUTOMOUNT
);
1316 mounted
= __lookup_mnt(path
->mnt
, path
->dentry
);
1319 path
->mnt
= &mounted
->mnt
;
1320 path
->dentry
= mounted
->mnt
.mnt_root
;
1321 nd
->flags
|= LOOKUP_JUMPED
;
1322 *seqp
= read_seqcount_begin(&path
->dentry
->d_seq
);
1324 * Update the inode too. We don't need to re-check the
1325 * dentry sequence number here after this d_inode read,
1326 * because a mount-point is always pinned.
1328 *inode
= path
->dentry
->d_inode
;
1330 return !read_seqretry(&mount_lock
, nd
->m_seq
) &&
1331 !(path
->dentry
->d_flags
& DCACHE_NEED_AUTOMOUNT
);
1334 static int follow_dotdot_rcu(struct nameidata
*nd
)
1336 struct inode
*inode
= nd
->inode
;
1339 if (path_equal(&nd
->path
, &nd
->root
))
1341 if (nd
->path
.dentry
!= nd
->path
.mnt
->mnt_root
) {
1342 struct dentry
*old
= nd
->path
.dentry
;
1343 struct dentry
*parent
= old
->d_parent
;
1346 inode
= parent
->d_inode
;
1347 seq
= read_seqcount_begin(&parent
->d_seq
);
1348 if (unlikely(read_seqcount_retry(&old
->d_seq
, nd
->seq
)))
1350 nd
->path
.dentry
= parent
;
1352 if (unlikely(!path_connected(&nd
->path
)))
1356 struct mount
*mnt
= real_mount(nd
->path
.mnt
);
1357 struct mount
*mparent
= mnt
->mnt_parent
;
1358 struct dentry
*mountpoint
= mnt
->mnt_mountpoint
;
1359 struct inode
*inode2
= mountpoint
->d_inode
;
1360 unsigned seq
= read_seqcount_begin(&mountpoint
->d_seq
);
1361 if (unlikely(read_seqretry(&mount_lock
, nd
->m_seq
)))
1363 if (&mparent
->mnt
== nd
->path
.mnt
)
1365 /* we know that mountpoint was pinned */
1366 nd
->path
.dentry
= mountpoint
;
1367 nd
->path
.mnt
= &mparent
->mnt
;
1372 while (unlikely(d_mountpoint(nd
->path
.dentry
))) {
1373 struct mount
*mounted
;
1374 mounted
= __lookup_mnt(nd
->path
.mnt
, nd
->path
.dentry
);
1375 if (unlikely(read_seqretry(&mount_lock
, nd
->m_seq
)))
1379 nd
->path
.mnt
= &mounted
->mnt
;
1380 nd
->path
.dentry
= mounted
->mnt
.mnt_root
;
1381 inode
= nd
->path
.dentry
->d_inode
;
1382 nd
->seq
= read_seqcount_begin(&nd
->path
.dentry
->d_seq
);
1389 * Follow down to the covering mount currently visible to userspace. At each
1390 * point, the filesystem owning that dentry may be queried as to whether the
1391 * caller is permitted to proceed or not.
1393 int follow_down(struct path
*path
)
1398 while (managed
= READ_ONCE(path
->dentry
->d_flags
),
1399 unlikely(managed
& DCACHE_MANAGED_DENTRY
)) {
1400 /* Allow the filesystem to manage the transit without i_mutex
1403 * We indicate to the filesystem if someone is trying to mount
1404 * something here. This gives autofs the chance to deny anyone
1405 * other than its daemon the right to mount on its
1408 * The filesystem may sleep at this point.
1410 if (managed
& DCACHE_MANAGE_TRANSIT
) {
1411 BUG_ON(!path
->dentry
->d_op
);
1412 BUG_ON(!path
->dentry
->d_op
->d_manage
);
1413 ret
= path
->dentry
->d_op
->d_manage(path
, false);
1415 return ret
== -EISDIR
? 0 : ret
;
1418 /* Transit to a mounted filesystem. */
1419 if (managed
& DCACHE_MOUNTED
) {
1420 struct vfsmount
*mounted
= lookup_mnt(path
);
1425 path
->mnt
= mounted
;
1426 path
->dentry
= dget(mounted
->mnt_root
);
1430 /* Don't handle automount points here */
1435 EXPORT_SYMBOL(follow_down
);
1438 * Skip to top of mountpoint pile in refwalk mode for follow_dotdot()
1440 static void follow_mount(struct path
*path
)
1442 while (d_mountpoint(path
->dentry
)) {
1443 struct vfsmount
*mounted
= lookup_mnt(path
);
1448 path
->mnt
= mounted
;
1449 path
->dentry
= dget(mounted
->mnt_root
);
1453 static int path_parent_directory(struct path
*path
)
1455 struct dentry
*old
= path
->dentry
;
1456 /* rare case of legitimate dget_parent()... */
1457 path
->dentry
= dget_parent(path
->dentry
);
1459 if (unlikely(!path_connected(path
)))
1464 static int follow_dotdot(struct nameidata
*nd
)
1467 if (nd
->path
.dentry
== nd
->root
.dentry
&&
1468 nd
->path
.mnt
== nd
->root
.mnt
) {
1471 if (nd
->path
.dentry
!= nd
->path
.mnt
->mnt_root
) {
1472 int ret
= path_parent_directory(&nd
->path
);
1477 if (!follow_up(&nd
->path
))
1480 follow_mount(&nd
->path
);
1481 nd
->inode
= nd
->path
.dentry
->d_inode
;
1486 * This looks up the name in dcache and possibly revalidates the found dentry.
1487 * NULL is returned if the dentry does not exist in the cache.
1489 static struct dentry
*lookup_dcache(const struct qstr
*name
,
1493 struct dentry
*dentry
= d_lookup(dir
, name
);
1495 int error
= d_revalidate(dentry
, flags
);
1496 if (unlikely(error
<= 0)) {
1498 d_invalidate(dentry
);
1500 return ERR_PTR(error
);
1507 * Call i_op->lookup on the dentry. The dentry must be negative and
1510 * dir->d_inode->i_mutex must be held
1512 static struct dentry
*lookup_real(struct inode
*dir
, struct dentry
*dentry
,
1517 /* Don't create child dentry for a dead directory. */
1518 if (unlikely(IS_DEADDIR(dir
))) {
1520 return ERR_PTR(-ENOENT
);
1523 old
= dir
->i_op
->lookup(dir
, dentry
, flags
);
1524 if (unlikely(old
)) {
1531 static struct dentry
*__lookup_hash(const struct qstr
*name
,
1532 struct dentry
*base
, unsigned int flags
)
1534 struct dentry
*dentry
= lookup_dcache(name
, base
, flags
);
1539 dentry
= d_alloc(base
, name
);
1540 if (unlikely(!dentry
))
1541 return ERR_PTR(-ENOMEM
);
1543 return lookup_real(base
->d_inode
, dentry
, flags
);
1546 static int lookup_fast(struct nameidata
*nd
,
1547 struct path
*path
, struct inode
**inode
,
1550 struct vfsmount
*mnt
= nd
->path
.mnt
;
1551 struct dentry
*dentry
, *parent
= nd
->path
.dentry
;
1556 * Rename seqlock is not required here because in the off chance
1557 * of a false negative due to a concurrent rename, the caller is
1558 * going to fall back to non-racy lookup.
1560 if (nd
->flags
& LOOKUP_RCU
) {
1563 dentry
= __d_lookup_rcu(parent
, &nd
->last
, &seq
);
1564 if (unlikely(!dentry
)) {
1565 if (unlazy_walk(nd
))
1571 * This sequence count validates that the inode matches
1572 * the dentry name information from lookup.
1574 *inode
= d_backing_inode(dentry
);
1575 negative
= d_is_negative(dentry
);
1576 if (unlikely(read_seqcount_retry(&dentry
->d_seq
, seq
)))
1580 * This sequence count validates that the parent had no
1581 * changes while we did the lookup of the dentry above.
1583 * The memory barrier in read_seqcount_begin of child is
1584 * enough, we can use __read_seqcount_retry here.
1586 if (unlikely(__read_seqcount_retry(&parent
->d_seq
, nd
->seq
)))
1590 status
= d_revalidate(dentry
, nd
->flags
);
1591 if (likely(status
> 0)) {
1593 * Note: do negative dentry check after revalidation in
1594 * case that drops it.
1596 if (unlikely(negative
))
1599 path
->dentry
= dentry
;
1600 if (likely(__follow_mount_rcu(nd
, path
, inode
, seqp
)))
1603 if (unlazy_child(nd
, dentry
, seq
))
1605 if (unlikely(status
== -ECHILD
))
1606 /* we'd been told to redo it in non-rcu mode */
1607 status
= d_revalidate(dentry
, nd
->flags
);
1609 dentry
= __d_lookup(parent
, &nd
->last
);
1610 if (unlikely(!dentry
))
1612 status
= d_revalidate(dentry
, nd
->flags
);
1614 if (unlikely(status
<= 0)) {
1616 d_invalidate(dentry
);
1620 if (unlikely(d_is_negative(dentry
))) {
1626 path
->dentry
= dentry
;
1627 err
= follow_managed(path
, nd
);
1628 if (likely(err
> 0))
1629 *inode
= d_backing_inode(path
->dentry
);
1633 /* Fast lookup failed, do it the slow way */
1634 static struct dentry
*lookup_slow(const struct qstr
*name
,
1638 struct dentry
*dentry
= ERR_PTR(-ENOENT
), *old
;
1639 struct inode
*inode
= dir
->d_inode
;
1640 DECLARE_WAIT_QUEUE_HEAD_ONSTACK(wq
);
1642 inode_lock_shared(inode
);
1643 /* Don't go there if it's already dead */
1644 if (unlikely(IS_DEADDIR(inode
)))
1647 dentry
= d_alloc_parallel(dir
, name
, &wq
);
1650 if (unlikely(!d_in_lookup(dentry
))) {
1651 if (!(flags
& LOOKUP_NO_REVAL
)) {
1652 int error
= d_revalidate(dentry
, flags
);
1653 if (unlikely(error
<= 0)) {
1655 d_invalidate(dentry
);
1660 dentry
= ERR_PTR(error
);
1664 old
= inode
->i_op
->lookup(inode
, dentry
, flags
);
1665 d_lookup_done(dentry
);
1666 if (unlikely(old
)) {
1672 inode_unlock_shared(inode
);
1676 static inline int may_lookup(struct nameidata
*nd
)
1678 if (nd
->flags
& LOOKUP_RCU
) {
1679 int err
= inode_permission(nd
->inode
, MAY_EXEC
|MAY_NOT_BLOCK
);
1682 if (unlazy_walk(nd
))
1685 return inode_permission(nd
->inode
, MAY_EXEC
);
1688 static inline int handle_dots(struct nameidata
*nd
, int type
)
1690 if (type
== LAST_DOTDOT
) {
1693 if (nd
->flags
& LOOKUP_RCU
) {
1694 return follow_dotdot_rcu(nd
);
1696 return follow_dotdot(nd
);
1701 static int pick_link(struct nameidata
*nd
, struct path
*link
,
1702 struct inode
*inode
, unsigned seq
)
1706 if (unlikely(nd
->total_link_count
++ >= MAXSYMLINKS
)) {
1707 path_to_nameidata(link
, nd
);
1710 if (!(nd
->flags
& LOOKUP_RCU
)) {
1711 if (link
->mnt
== nd
->path
.mnt
)
1714 error
= nd_alloc_stack(nd
);
1715 if (unlikely(error
)) {
1716 if (error
== -ECHILD
) {
1717 if (unlikely(!legitimize_path(nd
, link
, seq
))) {
1720 nd
->flags
&= ~LOOKUP_RCU
;
1721 nd
->path
.mnt
= NULL
;
1722 nd
->path
.dentry
= NULL
;
1723 if (!(nd
->flags
& LOOKUP_ROOT
))
1724 nd
->root
.mnt
= NULL
;
1726 } else if (likely(unlazy_walk(nd
)) == 0)
1727 error
= nd_alloc_stack(nd
);
1735 last
= nd
->stack
+ nd
->depth
++;
1737 clear_delayed_call(&last
->done
);
1738 nd
->link_inode
= inode
;
1743 enum {WALK_FOLLOW
= 1, WALK_MORE
= 2};
1746 * Do we need to follow links? We _really_ want to be able
1747 * to do this check without having to look at inode->i_op,
1748 * so we keep a cache of "no, this doesn't need follow_link"
1749 * for the common case.
1751 static inline int step_into(struct nameidata
*nd
, struct path
*path
,
1752 int flags
, struct inode
*inode
, unsigned seq
)
1754 if (!(flags
& WALK_MORE
) && nd
->depth
)
1756 if (likely(!d_is_symlink(path
->dentry
)) ||
1757 !(flags
& WALK_FOLLOW
|| nd
->flags
& LOOKUP_FOLLOW
)) {
1758 /* not a symlink or should not follow */
1759 path_to_nameidata(path
, nd
);
1764 /* make sure that d_is_symlink above matches inode */
1765 if (nd
->flags
& LOOKUP_RCU
) {
1766 if (read_seqcount_retry(&path
->dentry
->d_seq
, seq
))
1769 return pick_link(nd
, path
, inode
, seq
);
1772 static int walk_component(struct nameidata
*nd
, int flags
)
1775 struct inode
*inode
;
1779 * "." and ".." are special - ".." especially so because it has
1780 * to be able to know about the current root directory and
1781 * parent relationships.
1783 if (unlikely(nd
->last_type
!= LAST_NORM
)) {
1784 err
= handle_dots(nd
, nd
->last_type
);
1785 if (!(flags
& WALK_MORE
) && nd
->depth
)
1789 err
= lookup_fast(nd
, &path
, &inode
, &seq
);
1790 if (unlikely(err
<= 0)) {
1793 path
.dentry
= lookup_slow(&nd
->last
, nd
->path
.dentry
,
1795 if (IS_ERR(path
.dentry
))
1796 return PTR_ERR(path
.dentry
);
1798 path
.mnt
= nd
->path
.mnt
;
1799 err
= follow_managed(&path
, nd
);
1800 if (unlikely(err
< 0))
1803 if (unlikely(d_is_negative(path
.dentry
))) {
1804 path_to_nameidata(&path
, nd
);
1808 seq
= 0; /* we are already out of RCU mode */
1809 inode
= d_backing_inode(path
.dentry
);
1812 return step_into(nd
, &path
, flags
, inode
, seq
);
1816 * We can do the critical dentry name comparison and hashing
1817 * operations one word at a time, but we are limited to:
1819 * - Architectures with fast unaligned word accesses. We could
1820 * do a "get_unaligned()" if this helps and is sufficiently
1823 * - non-CONFIG_DEBUG_PAGEALLOC configurations (so that we
1824 * do not trap on the (extremely unlikely) case of a page
1825 * crossing operation.
1827 * - Furthermore, we need an efficient 64-bit compile for the
1828 * 64-bit case in order to generate the "number of bytes in
1829 * the final mask". Again, that could be replaced with a
1830 * efficient population count instruction or similar.
1832 #ifdef CONFIG_DCACHE_WORD_ACCESS
1834 #include <asm/word-at-a-time.h>
1838 /* Architecture provides HASH_MIX and fold_hash() in <asm/hash.h> */
1840 #elif defined(CONFIG_64BIT)
1842 * Register pressure in the mixing function is an issue, particularly
1843 * on 32-bit x86, but almost any function requires one state value and
1844 * one temporary. Instead, use a function designed for two state values
1845 * and no temporaries.
1847 * This function cannot create a collision in only two iterations, so
1848 * we have two iterations to achieve avalanche. In those two iterations,
1849 * we have six layers of mixing, which is enough to spread one bit's
1850 * influence out to 2^6 = 64 state bits.
1852 * Rotate constants are scored by considering either 64 one-bit input
1853 * deltas or 64*63/2 = 2016 two-bit input deltas, and finding the
1854 * probability of that delta causing a change to each of the 128 output
1855 * bits, using a sample of random initial states.
1857 * The Shannon entropy of the computed probabilities is then summed
1858 * to produce a score. Ideally, any input change has a 50% chance of
1859 * toggling any given output bit.
1861 * Mixing scores (in bits) for (12,45):
1862 * Input delta: 1-bit 2-bit
1863 * 1 round: 713.3 42542.6
1864 * 2 rounds: 2753.7 140389.8
1865 * 3 rounds: 5954.1 233458.2
1866 * 4 rounds: 7862.6 256672.2
1867 * Perfect: 8192 258048
1868 * (64*128) (64*63/2 * 128)
1870 #define HASH_MIX(x, y, a) \
1872 y ^= x, x = rol64(x,12),\
1873 x += y, y = rol64(y,45),\
1877 * Fold two longs into one 32-bit hash value. This must be fast, but
1878 * latency isn't quite as critical, as there is a fair bit of additional
1879 * work done before the hash value is used.
1881 static inline unsigned int fold_hash(unsigned long x
, unsigned long y
)
1883 y
^= x
* GOLDEN_RATIO_64
;
1884 y
*= GOLDEN_RATIO_64
;
1888 #else /* 32-bit case */
1891 * Mixing scores (in bits) for (7,20):
1892 * Input delta: 1-bit 2-bit
1893 * 1 round: 330.3 9201.6
1894 * 2 rounds: 1246.4 25475.4
1895 * 3 rounds: 1907.1 31295.1
1896 * 4 rounds: 2042.3 31718.6
1897 * Perfect: 2048 31744
1898 * (32*64) (32*31/2 * 64)
1900 #define HASH_MIX(x, y, a) \
1902 y ^= x, x = rol32(x, 7),\
1903 x += y, y = rol32(y,20),\
1906 static inline unsigned int fold_hash(unsigned long x
, unsigned long y
)
1908 /* Use arch-optimized multiply if one exists */
1909 return __hash_32(y
^ __hash_32(x
));
1915 * Return the hash of a string of known length. This is carfully
1916 * designed to match hash_name(), which is the more critical function.
1917 * In particular, we must end by hashing a final word containing 0..7
1918 * payload bytes, to match the way that hash_name() iterates until it
1919 * finds the delimiter after the name.
1921 unsigned int full_name_hash(const void *salt
, const char *name
, unsigned int len
)
1923 unsigned long a
, x
= 0, y
= (unsigned long)salt
;
1928 a
= load_unaligned_zeropad(name
);
1929 if (len
< sizeof(unsigned long))
1932 name
+= sizeof(unsigned long);
1933 len
-= sizeof(unsigned long);
1935 x
^= a
& bytemask_from_count(len
);
1937 return fold_hash(x
, y
);
1939 EXPORT_SYMBOL(full_name_hash
);
1941 /* Return the "hash_len" (hash and length) of a null-terminated string */
1942 u64
hashlen_string(const void *salt
, const char *name
)
1944 unsigned long a
= 0, x
= 0, y
= (unsigned long)salt
;
1945 unsigned long adata
, mask
, len
;
1946 const struct word_at_a_time constants
= WORD_AT_A_TIME_CONSTANTS
;
1953 len
+= sizeof(unsigned long);
1955 a
= load_unaligned_zeropad(name
+len
);
1956 } while (!has_zero(a
, &adata
, &constants
));
1958 adata
= prep_zero_mask(a
, adata
, &constants
);
1959 mask
= create_zero_mask(adata
);
1960 x
^= a
& zero_bytemask(mask
);
1962 return hashlen_create(fold_hash(x
, y
), len
+ find_zero(mask
));
1964 EXPORT_SYMBOL(hashlen_string
);
1967 * Calculate the length and hash of the path component, and
1968 * return the "hash_len" as the result.
1970 static inline u64
hash_name(const void *salt
, const char *name
)
1972 unsigned long a
= 0, b
, x
= 0, y
= (unsigned long)salt
;
1973 unsigned long adata
, bdata
, mask
, len
;
1974 const struct word_at_a_time constants
= WORD_AT_A_TIME_CONSTANTS
;
1981 len
+= sizeof(unsigned long);
1983 a
= load_unaligned_zeropad(name
+len
);
1984 b
= a
^ REPEAT_BYTE('/');
1985 } while (!(has_zero(a
, &adata
, &constants
) | has_zero(b
, &bdata
, &constants
)));
1987 adata
= prep_zero_mask(a
, adata
, &constants
);
1988 bdata
= prep_zero_mask(b
, bdata
, &constants
);
1989 mask
= create_zero_mask(adata
| bdata
);
1990 x
^= a
& zero_bytemask(mask
);
1992 return hashlen_create(fold_hash(x
, y
), len
+ find_zero(mask
));
1995 #else /* !CONFIG_DCACHE_WORD_ACCESS: Slow, byte-at-a-time version */
1997 /* Return the hash of a string of known length */
1998 unsigned int full_name_hash(const void *salt
, const char *name
, unsigned int len
)
2000 unsigned long hash
= init_name_hash(salt
);
2002 hash
= partial_name_hash((unsigned char)*name
++, hash
);
2003 return end_name_hash(hash
);
2005 EXPORT_SYMBOL(full_name_hash
);
2007 /* Return the "hash_len" (hash and length) of a null-terminated string */
2008 u64
hashlen_string(const void *salt
, const char *name
)
2010 unsigned long hash
= init_name_hash(salt
);
2011 unsigned long len
= 0, c
;
2013 c
= (unsigned char)*name
;
2016 hash
= partial_name_hash(c
, hash
);
2017 c
= (unsigned char)name
[len
];
2019 return hashlen_create(end_name_hash(hash
), len
);
2021 EXPORT_SYMBOL(hashlen_string
);
2024 * We know there's a real path component here of at least
2027 static inline u64
hash_name(const void *salt
, const char *name
)
2029 unsigned long hash
= init_name_hash(salt
);
2030 unsigned long len
= 0, c
;
2032 c
= (unsigned char)*name
;
2035 hash
= partial_name_hash(c
, hash
);
2036 c
= (unsigned char)name
[len
];
2037 } while (c
&& c
!= '/');
2038 return hashlen_create(end_name_hash(hash
), len
);
2045 * This is the basic name resolution function, turning a pathname into
2046 * the final dentry. We expect 'base' to be positive and a directory.
2048 * Returns 0 and nd will have valid dentry and mnt on success.
2049 * Returns error and drops reference to input namei data on failure.
2051 static int link_path_walk(const char *name
, struct nameidata
*nd
)
2060 /* At this point we know we have a real path component. */
2065 err
= may_lookup(nd
);
2069 hash_len
= hash_name(nd
->path
.dentry
, name
);
2072 if (name
[0] == '.') switch (hashlen_len(hash_len
)) {
2074 if (name
[1] == '.') {
2076 nd
->flags
|= LOOKUP_JUMPED
;
2082 if (likely(type
== LAST_NORM
)) {
2083 struct dentry
*parent
= nd
->path
.dentry
;
2084 nd
->flags
&= ~LOOKUP_JUMPED
;
2085 if (unlikely(parent
->d_flags
& DCACHE_OP_HASH
)) {
2086 struct qstr
this = { { .hash_len
= hash_len
}, .name
= name
};
2087 err
= parent
->d_op
->d_hash(parent
, &this);
2090 hash_len
= this.hash_len
;
2095 nd
->last
.hash_len
= hash_len
;
2096 nd
->last
.name
= name
;
2097 nd
->last_type
= type
;
2099 name
+= hashlen_len(hash_len
);
2103 * If it wasn't NUL, we know it was '/'. Skip that
2104 * slash, and continue until no more slashes.
2108 } while (unlikely(*name
== '/'));
2109 if (unlikely(!*name
)) {
2111 /* pathname body, done */
2114 name
= nd
->stack
[nd
->depth
- 1].name
;
2115 /* trailing symlink, done */
2118 /* last component of nested symlink */
2119 err
= walk_component(nd
, WALK_FOLLOW
);
2121 /* not the last component */
2122 err
= walk_component(nd
, WALK_FOLLOW
| WALK_MORE
);
2128 const char *s
= get_link(nd
);
2137 nd
->stack
[nd
->depth
- 1].name
= name
;
2142 if (unlikely(!d_can_lookup(nd
->path
.dentry
))) {
2143 if (nd
->flags
& LOOKUP_RCU
) {
2144 if (unlazy_walk(nd
))
2152 static const char *path_init(struct nameidata
*nd
, unsigned flags
)
2154 const char *s
= nd
->name
->name
;
2157 flags
&= ~LOOKUP_RCU
;
2159 nd
->last_type
= LAST_ROOT
; /* if there are only slashes... */
2160 nd
->flags
= flags
| LOOKUP_JUMPED
| LOOKUP_PARENT
;
2162 if (flags
& LOOKUP_ROOT
) {
2163 struct dentry
*root
= nd
->root
.dentry
;
2164 struct inode
*inode
= root
->d_inode
;
2165 if (*s
&& unlikely(!d_can_lookup(root
)))
2166 return ERR_PTR(-ENOTDIR
);
2167 nd
->path
= nd
->root
;
2169 if (flags
& LOOKUP_RCU
) {
2171 nd
->seq
= __read_seqcount_begin(&nd
->path
.dentry
->d_seq
);
2172 nd
->root_seq
= nd
->seq
;
2173 nd
->m_seq
= read_seqbegin(&mount_lock
);
2175 path_get(&nd
->path
);
2180 nd
->root
.mnt
= NULL
;
2181 nd
->path
.mnt
= NULL
;
2182 nd
->path
.dentry
= NULL
;
2184 nd
->m_seq
= read_seqbegin(&mount_lock
);
2186 if (flags
& LOOKUP_RCU
)
2189 if (likely(!nd_jump_root(nd
)))
2191 nd
->root
.mnt
= NULL
;
2193 return ERR_PTR(-ECHILD
);
2194 } else if (nd
->dfd
== AT_FDCWD
) {
2195 if (flags
& LOOKUP_RCU
) {
2196 struct fs_struct
*fs
= current
->fs
;
2202 seq
= read_seqcount_begin(&fs
->seq
);
2204 nd
->inode
= nd
->path
.dentry
->d_inode
;
2205 nd
->seq
= __read_seqcount_begin(&nd
->path
.dentry
->d_seq
);
2206 } while (read_seqcount_retry(&fs
->seq
, seq
));
2208 get_fs_pwd(current
->fs
, &nd
->path
);
2209 nd
->inode
= nd
->path
.dentry
->d_inode
;
2213 /* Caller must check execute permissions on the starting path component */
2214 struct fd f
= fdget_raw(nd
->dfd
);
2215 struct dentry
*dentry
;
2218 return ERR_PTR(-EBADF
);
2220 dentry
= f
.file
->f_path
.dentry
;
2223 if (!d_can_lookup(dentry
)) {
2225 return ERR_PTR(-ENOTDIR
);
2229 nd
->path
= f
.file
->f_path
;
2230 if (flags
& LOOKUP_RCU
) {
2232 nd
->inode
= nd
->path
.dentry
->d_inode
;
2233 nd
->seq
= read_seqcount_begin(&nd
->path
.dentry
->d_seq
);
2235 path_get(&nd
->path
);
2236 nd
->inode
= nd
->path
.dentry
->d_inode
;
2243 static const char *trailing_symlink(struct nameidata
*nd
)
2246 int error
= may_follow_link(nd
);
2247 if (unlikely(error
))
2248 return ERR_PTR(error
);
2249 nd
->flags
|= LOOKUP_PARENT
;
2250 nd
->stack
[0].name
= NULL
;
2255 static inline int lookup_last(struct nameidata
*nd
)
2257 if (nd
->last_type
== LAST_NORM
&& nd
->last
.name
[nd
->last
.len
])
2258 nd
->flags
|= LOOKUP_FOLLOW
| LOOKUP_DIRECTORY
;
2260 nd
->flags
&= ~LOOKUP_PARENT
;
2261 return walk_component(nd
, 0);
2264 static int handle_lookup_down(struct nameidata
*nd
)
2266 struct path path
= nd
->path
;
2267 struct inode
*inode
= nd
->inode
;
2268 unsigned seq
= nd
->seq
;
2271 if (nd
->flags
& LOOKUP_RCU
) {
2273 * don't bother with unlazy_walk on failure - we are
2274 * at the very beginning of walk, so we lose nothing
2275 * if we simply redo everything in non-RCU mode
2277 if (unlikely(!__follow_mount_rcu(nd
, &path
, &inode
, &seq
)))
2281 err
= follow_managed(&path
, nd
);
2282 if (unlikely(err
< 0))
2284 inode
= d_backing_inode(path
.dentry
);
2287 path_to_nameidata(&path
, nd
);
2293 /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
2294 static int path_lookupat(struct nameidata
*nd
, unsigned flags
, struct path
*path
)
2296 const char *s
= path_init(nd
, flags
);
2302 if (unlikely(flags
& LOOKUP_DOWN
)) {
2303 err
= handle_lookup_down(nd
);
2304 if (unlikely(err
< 0)) {
2310 while (!(err
= link_path_walk(s
, nd
))
2311 && ((err
= lookup_last(nd
)) > 0)) {
2312 s
= trailing_symlink(nd
);
2319 err
= complete_walk(nd
);
2321 if (!err
&& nd
->flags
& LOOKUP_DIRECTORY
)
2322 if (!d_can_lookup(nd
->path
.dentry
))
2326 nd
->path
.mnt
= NULL
;
2327 nd
->path
.dentry
= NULL
;
2333 static int filename_lookup(int dfd
, struct filename
*name
, unsigned flags
,
2334 struct path
*path
, struct path
*root
)
2337 struct nameidata nd
;
2339 return PTR_ERR(name
);
2340 if (unlikely(root
)) {
2342 flags
|= LOOKUP_ROOT
;
2344 set_nameidata(&nd
, dfd
, name
);
2345 retval
= path_lookupat(&nd
, flags
| LOOKUP_RCU
, path
);
2346 if (unlikely(retval
== -ECHILD
))
2347 retval
= path_lookupat(&nd
, flags
, path
);
2348 if (unlikely(retval
== -ESTALE
))
2349 retval
= path_lookupat(&nd
, flags
| LOOKUP_REVAL
, path
);
2351 if (likely(!retval
))
2352 audit_inode(name
, path
->dentry
, flags
& LOOKUP_PARENT
);
2353 restore_nameidata();
2358 /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
2359 static int path_parentat(struct nameidata
*nd
, unsigned flags
,
2360 struct path
*parent
)
2362 const char *s
= path_init(nd
, flags
);
2366 err
= link_path_walk(s
, nd
);
2368 err
= complete_walk(nd
);
2371 nd
->path
.mnt
= NULL
;
2372 nd
->path
.dentry
= NULL
;
2378 static struct filename
*filename_parentat(int dfd
, struct filename
*name
,
2379 unsigned int flags
, struct path
*parent
,
2380 struct qstr
*last
, int *type
)
2383 struct nameidata nd
;
2387 set_nameidata(&nd
, dfd
, name
);
2388 retval
= path_parentat(&nd
, flags
| LOOKUP_RCU
, parent
);
2389 if (unlikely(retval
== -ECHILD
))
2390 retval
= path_parentat(&nd
, flags
, parent
);
2391 if (unlikely(retval
== -ESTALE
))
2392 retval
= path_parentat(&nd
, flags
| LOOKUP_REVAL
, parent
);
2393 if (likely(!retval
)) {
2395 *type
= nd
.last_type
;
2396 audit_inode(name
, parent
->dentry
, LOOKUP_PARENT
);
2399 name
= ERR_PTR(retval
);
2401 restore_nameidata();
2405 /* does lookup, returns the object with parent locked */
2406 struct dentry
*kern_path_locked(const char *name
, struct path
*path
)
2408 struct filename
*filename
;
2413 filename
= filename_parentat(AT_FDCWD
, getname_kernel(name
), 0, path
,
2415 if (IS_ERR(filename
))
2416 return ERR_CAST(filename
);
2417 if (unlikely(type
!= LAST_NORM
)) {
2420 return ERR_PTR(-EINVAL
);
2422 inode_lock_nested(path
->dentry
->d_inode
, I_MUTEX_PARENT
);
2423 d
= __lookup_hash(&last
, path
->dentry
, 0);
2425 inode_unlock(path
->dentry
->d_inode
);
2432 int kern_path(const char *name
, unsigned int flags
, struct path
*path
)
2434 return filename_lookup(AT_FDCWD
, getname_kernel(name
),
2437 EXPORT_SYMBOL(kern_path
);
2440 * vfs_path_lookup - lookup a file path relative to a dentry-vfsmount pair
2441 * @dentry: pointer to dentry of the base directory
2442 * @mnt: pointer to vfs mount of the base directory
2443 * @name: pointer to file name
2444 * @flags: lookup flags
2445 * @path: pointer to struct path to fill
2447 int vfs_path_lookup(struct dentry
*dentry
, struct vfsmount
*mnt
,
2448 const char *name
, unsigned int flags
,
2451 struct path root
= {.mnt
= mnt
, .dentry
= dentry
};
2452 /* the first argument of filename_lookup() is ignored with root */
2453 return filename_lookup(AT_FDCWD
, getname_kernel(name
),
2454 flags
, path
, &root
);
2456 EXPORT_SYMBOL(vfs_path_lookup
);
2459 * lookup_one_len - filesystem helper to lookup single pathname component
2460 * @name: pathname component to lookup
2461 * @base: base directory to lookup from
2462 * @len: maximum length @len should be interpreted to
2464 * Note that this routine is purely a helper for filesystem usage and should
2465 * not be called by generic code.
2467 * The caller must hold base->i_mutex.
2469 struct dentry
*lookup_one_len(const char *name
, struct dentry
*base
, int len
)
2475 WARN_ON_ONCE(!inode_is_locked(base
->d_inode
));
2479 this.hash
= full_name_hash(base
, name
, len
);
2481 return ERR_PTR(-EACCES
);
2483 if (unlikely(name
[0] == '.')) {
2484 if (len
< 2 || (len
== 2 && name
[1] == '.'))
2485 return ERR_PTR(-EACCES
);
2489 c
= *(const unsigned char *)name
++;
2490 if (c
== '/' || c
== '\0')
2491 return ERR_PTR(-EACCES
);
2494 * See if the low-level filesystem might want
2495 * to use its own hash..
2497 if (base
->d_flags
& DCACHE_OP_HASH
) {
2498 int err
= base
->d_op
->d_hash(base
, &this);
2500 return ERR_PTR(err
);
2503 err
= inode_permission(base
->d_inode
, MAY_EXEC
);
2505 return ERR_PTR(err
);
2507 return __lookup_hash(&this, base
, 0);
2509 EXPORT_SYMBOL(lookup_one_len
);
2512 * lookup_one_len_unlocked - filesystem helper to lookup single pathname component
2513 * @name: pathname component to lookup
2514 * @base: base directory to lookup from
2515 * @len: maximum length @len should be interpreted to
2517 * Note that this routine is purely a helper for filesystem usage and should
2518 * not be called by generic code.
2520 * Unlike lookup_one_len, it should be called without the parent
2521 * i_mutex held, and will take the i_mutex itself if necessary.
2523 struct dentry
*lookup_one_len_unlocked(const char *name
,
2524 struct dentry
*base
, int len
)
2533 this.hash
= full_name_hash(base
, name
, len
);
2535 return ERR_PTR(-EACCES
);
2537 if (unlikely(name
[0] == '.')) {
2538 if (len
< 2 || (len
== 2 && name
[1] == '.'))
2539 return ERR_PTR(-EACCES
);
2543 c
= *(const unsigned char *)name
++;
2544 if (c
== '/' || c
== '\0')
2545 return ERR_PTR(-EACCES
);
2548 * See if the low-level filesystem might want
2549 * to use its own hash..
2551 if (base
->d_flags
& DCACHE_OP_HASH
) {
2552 int err
= base
->d_op
->d_hash(base
, &this);
2554 return ERR_PTR(err
);
2557 err
= inode_permission(base
->d_inode
, MAY_EXEC
);
2559 return ERR_PTR(err
);
2561 ret
= lookup_dcache(&this, base
, 0);
2563 ret
= lookup_slow(&this, base
, 0);
2566 EXPORT_SYMBOL(lookup_one_len_unlocked
);
2568 #ifdef CONFIG_UNIX98_PTYS
2569 int path_pts(struct path
*path
)
2571 /* Find something mounted on "pts" in the same directory as
2574 struct dentry
*child
, *parent
;
2578 ret
= path_parent_directory(path
);
2582 parent
= path
->dentry
;
2585 child
= d_hash_and_lookup(parent
, &this);
2589 path
->dentry
= child
;
2596 int user_path_at_empty(int dfd
, const char __user
*name
, unsigned flags
,
2597 struct path
*path
, int *empty
)
2599 return filename_lookup(dfd
, getname_flags(name
, flags
, empty
),
2602 EXPORT_SYMBOL(user_path_at_empty
);
2605 * mountpoint_last - look up last component for umount
2606 * @nd: pathwalk nameidata - currently pointing at parent directory of "last"
2608 * This is a special lookup_last function just for umount. In this case, we
2609 * need to resolve the path without doing any revalidation.
2611 * The nameidata should be the result of doing a LOOKUP_PARENT pathwalk. Since
2612 * mountpoints are always pinned in the dcache, their ancestors are too. Thus,
2613 * in almost all cases, this lookup will be served out of the dcache. The only
2614 * cases where it won't are if nd->last refers to a symlink or the path is
2615 * bogus and it doesn't exist.
2618 * -error: if there was an error during lookup. This includes -ENOENT if the
2619 * lookup found a negative dentry.
2621 * 0: if we successfully resolved nd->last and found it to not to be a
2622 * symlink that needs to be followed.
2624 * 1: if we successfully resolved nd->last and found it to be a symlink
2625 * that needs to be followed.
2628 mountpoint_last(struct nameidata
*nd
)
2631 struct dentry
*dir
= nd
->path
.dentry
;
2634 /* If we're in rcuwalk, drop out of it to handle last component */
2635 if (nd
->flags
& LOOKUP_RCU
) {
2636 if (unlazy_walk(nd
))
2640 nd
->flags
&= ~LOOKUP_PARENT
;
2642 if (unlikely(nd
->last_type
!= LAST_NORM
)) {
2643 error
= handle_dots(nd
, nd
->last_type
);
2646 path
.dentry
= dget(nd
->path
.dentry
);
2648 path
.dentry
= d_lookup(dir
, &nd
->last
);
2651 * No cached dentry. Mounted dentries are pinned in the
2652 * cache, so that means that this dentry is probably
2653 * a symlink or the path doesn't actually point
2654 * to a mounted dentry.
2656 path
.dentry
= lookup_slow(&nd
->last
, dir
,
2657 nd
->flags
| LOOKUP_NO_REVAL
);
2658 if (IS_ERR(path
.dentry
))
2659 return PTR_ERR(path
.dentry
);
2662 if (d_is_negative(path
.dentry
)) {
2666 path
.mnt
= nd
->path
.mnt
;
2667 return step_into(nd
, &path
, 0, d_backing_inode(path
.dentry
), 0);
2671 * path_mountpoint - look up a path to be umounted
2672 * @nd: lookup context
2673 * @flags: lookup flags
2674 * @path: pointer to container for result
2676 * Look up the given name, but don't attempt to revalidate the last component.
2677 * Returns 0 and "path" will be valid on success; Returns error otherwise.
2680 path_mountpoint(struct nameidata
*nd
, unsigned flags
, struct path
*path
)
2682 const char *s
= path_init(nd
, flags
);
2686 while (!(err
= link_path_walk(s
, nd
)) &&
2687 (err
= mountpoint_last(nd
)) > 0) {
2688 s
= trailing_symlink(nd
);
2696 nd
->path
.mnt
= NULL
;
2697 nd
->path
.dentry
= NULL
;
2705 filename_mountpoint(int dfd
, struct filename
*name
, struct path
*path
,
2708 struct nameidata nd
;
2711 return PTR_ERR(name
);
2712 set_nameidata(&nd
, dfd
, name
);
2713 error
= path_mountpoint(&nd
, flags
| LOOKUP_RCU
, path
);
2714 if (unlikely(error
== -ECHILD
))
2715 error
= path_mountpoint(&nd
, flags
, path
);
2716 if (unlikely(error
== -ESTALE
))
2717 error
= path_mountpoint(&nd
, flags
| LOOKUP_REVAL
, path
);
2719 audit_inode(name
, path
->dentry
, 0);
2720 restore_nameidata();
2726 * user_path_mountpoint_at - lookup a path from userland in order to umount it
2727 * @dfd: directory file descriptor
2728 * @name: pathname from userland
2729 * @flags: lookup flags
2730 * @path: pointer to container to hold result
2732 * A umount is a special case for path walking. We're not actually interested
2733 * in the inode in this situation, and ESTALE errors can be a problem. We
2734 * simply want track down the dentry and vfsmount attached at the mountpoint
2735 * and avoid revalidating the last component.
2737 * Returns 0 and populates "path" on success.
2740 user_path_mountpoint_at(int dfd
, const char __user
*name
, unsigned int flags
,
2743 return filename_mountpoint(dfd
, getname(name
), path
, flags
);
2747 kern_path_mountpoint(int dfd
, const char *name
, struct path
*path
,
2750 return filename_mountpoint(dfd
, getname_kernel(name
), path
, flags
);
2752 EXPORT_SYMBOL(kern_path_mountpoint
);
2754 int __check_sticky(struct inode
*dir
, struct inode
*inode
)
2756 kuid_t fsuid
= current_fsuid();
2758 if (uid_eq(inode
->i_uid
, fsuid
))
2760 if (uid_eq(dir
->i_uid
, fsuid
))
2762 return !capable_wrt_inode_uidgid(inode
, CAP_FOWNER
);
2764 EXPORT_SYMBOL(__check_sticky
);
2767 * Check whether we can remove a link victim from directory dir, check
2768 * whether the type of victim is right.
2769 * 1. We can't do it if dir is read-only (done in permission())
2770 * 2. We should have write and exec permissions on dir
2771 * 3. We can't remove anything from append-only dir
2772 * 4. We can't do anything with immutable dir (done in permission())
2773 * 5. If the sticky bit on dir is set we should either
2774 * a. be owner of dir, or
2775 * b. be owner of victim, or
2776 * c. have CAP_FOWNER capability
2777 * 6. If the victim is append-only or immutable we can't do antyhing with
2778 * links pointing to it.
2779 * 7. If the victim has an unknown uid or gid we can't change the inode.
2780 * 8. If we were asked to remove a directory and victim isn't one - ENOTDIR.
2781 * 9. If we were asked to remove a non-directory and victim isn't one - EISDIR.
2782 * 10. We can't remove a root or mountpoint.
2783 * 11. We don't allow removal of NFS sillyrenamed files; it's handled by
2784 * nfs_async_unlink().
2786 static int may_delete(struct inode
*dir
, struct dentry
*victim
, bool isdir
)
2788 struct inode
*inode
= d_backing_inode(victim
);
2791 if (d_is_negative(victim
))
2795 BUG_ON(victim
->d_parent
->d_inode
!= dir
);
2796 audit_inode_child(dir
, victim
, AUDIT_TYPE_CHILD_DELETE
);
2798 error
= inode_permission(dir
, MAY_WRITE
| MAY_EXEC
);
2804 if (check_sticky(dir
, inode
) || IS_APPEND(inode
) ||
2805 IS_IMMUTABLE(inode
) || IS_SWAPFILE(inode
) || HAS_UNMAPPED_ID(inode
))
2808 if (!d_is_dir(victim
))
2810 if (IS_ROOT(victim
))
2812 } else if (d_is_dir(victim
))
2814 if (IS_DEADDIR(dir
))
2816 if (victim
->d_flags
& DCACHE_NFSFS_RENAMED
)
2821 /* Check whether we can create an object with dentry child in directory
2823 * 1. We can't do it if child already exists (open has special treatment for
2824 * this case, but since we are inlined it's OK)
2825 * 2. We can't do it if dir is read-only (done in permission())
2826 * 3. We can't do it if the fs can't represent the fsuid or fsgid.
2827 * 4. We should have write and exec permissions on dir
2828 * 5. We can't do it if dir is immutable (done in permission())
2830 static inline int may_create(struct inode
*dir
, struct dentry
*child
)
2832 struct user_namespace
*s_user_ns
;
2833 audit_inode_child(dir
, child
, AUDIT_TYPE_CHILD_CREATE
);
2836 if (IS_DEADDIR(dir
))
2838 s_user_ns
= dir
->i_sb
->s_user_ns
;
2839 if (!kuid_has_mapping(s_user_ns
, current_fsuid()) ||
2840 !kgid_has_mapping(s_user_ns
, current_fsgid()))
2842 return inode_permission(dir
, MAY_WRITE
| MAY_EXEC
);
2846 * p1 and p2 should be directories on the same fs.
2848 struct dentry
*lock_rename(struct dentry
*p1
, struct dentry
*p2
)
2853 inode_lock_nested(p1
->d_inode
, I_MUTEX_PARENT
);
2857 mutex_lock(&p1
->d_sb
->s_vfs_rename_mutex
);
2859 p
= d_ancestor(p2
, p1
);
2861 inode_lock_nested(p2
->d_inode
, I_MUTEX_PARENT
);
2862 inode_lock_nested(p1
->d_inode
, I_MUTEX_CHILD
);
2866 p
= d_ancestor(p1
, p2
);
2868 inode_lock_nested(p1
->d_inode
, I_MUTEX_PARENT
);
2869 inode_lock_nested(p2
->d_inode
, I_MUTEX_CHILD
);
2873 inode_lock_nested(p1
->d_inode
, I_MUTEX_PARENT
);
2874 inode_lock_nested(p2
->d_inode
, I_MUTEX_PARENT2
);
2877 EXPORT_SYMBOL(lock_rename
);
2879 void unlock_rename(struct dentry
*p1
, struct dentry
*p2
)
2881 inode_unlock(p1
->d_inode
);
2883 inode_unlock(p2
->d_inode
);
2884 mutex_unlock(&p1
->d_sb
->s_vfs_rename_mutex
);
2887 EXPORT_SYMBOL(unlock_rename
);
2889 int vfs_create(struct inode
*dir
, struct dentry
*dentry
, umode_t mode
,
2892 int error
= may_create(dir
, dentry
);
2896 if (!dir
->i_op
->create
)
2897 return -EACCES
; /* shouldn't it be ENOSYS? */
2900 error
= security_inode_create(dir
, dentry
, mode
);
2903 error
= dir
->i_op
->create(dir
, dentry
, mode
, want_excl
);
2905 fsnotify_create(dir
, dentry
);
2908 EXPORT_SYMBOL(vfs_create
);
2910 bool may_open_dev(const struct path
*path
)
2912 return !(path
->mnt
->mnt_flags
& MNT_NODEV
) &&
2913 !(path
->mnt
->mnt_sb
->s_iflags
& SB_I_NODEV
);
2916 static int may_open(const struct path
*path
, int acc_mode
, int flag
)
2918 struct dentry
*dentry
= path
->dentry
;
2919 struct inode
*inode
= dentry
->d_inode
;
2925 switch (inode
->i_mode
& S_IFMT
) {
2929 if (acc_mode
& MAY_WRITE
)
2934 if (!may_open_dev(path
))
2943 error
= inode_permission(inode
, MAY_OPEN
| acc_mode
);
2948 * An append-only file must be opened in append mode for writing.
2950 if (IS_APPEND(inode
)) {
2951 if ((flag
& O_ACCMODE
) != O_RDONLY
&& !(flag
& O_APPEND
))
2957 /* O_NOATIME can only be set by the owner or superuser */
2958 if (flag
& O_NOATIME
&& !inode_owner_or_capable(inode
))
2964 static int handle_truncate(struct file
*filp
)
2966 const struct path
*path
= &filp
->f_path
;
2967 struct inode
*inode
= path
->dentry
->d_inode
;
2968 int error
= get_write_access(inode
);
2972 * Refuse to truncate files with mandatory locks held on them.
2974 error
= locks_verify_locked(filp
);
2976 error
= security_path_truncate(path
);
2978 error
= do_truncate(path
->dentry
, 0,
2979 ATTR_MTIME
|ATTR_CTIME
|ATTR_OPEN
,
2982 put_write_access(inode
);
2986 static inline int open_to_namei_flags(int flag
)
2988 if ((flag
& O_ACCMODE
) == 3)
2993 static int may_o_create(const struct path
*dir
, struct dentry
*dentry
, umode_t mode
)
2995 struct user_namespace
*s_user_ns
;
2996 int error
= security_path_mknod(dir
, dentry
, mode
, 0);
3000 s_user_ns
= dir
->dentry
->d_sb
->s_user_ns
;
3001 if (!kuid_has_mapping(s_user_ns
, current_fsuid()) ||
3002 !kgid_has_mapping(s_user_ns
, current_fsgid()))
3005 error
= inode_permission(dir
->dentry
->d_inode
, MAY_WRITE
| MAY_EXEC
);
3009 return security_inode_create(dir
->dentry
->d_inode
, dentry
, mode
);
3013 * Attempt to atomically look up, create and open a file from a negative
3016 * Returns 0 if successful. The file will have been created and attached to
3017 * @file by the filesystem calling finish_open().
3019 * Returns 1 if the file was looked up only or didn't need creating. The
3020 * caller will need to perform the open themselves. @path will have been
3021 * updated to point to the new dentry. This may be negative.
3023 * Returns an error code otherwise.
3025 static int atomic_open(struct nameidata
*nd
, struct dentry
*dentry
,
3026 struct path
*path
, struct file
*file
,
3027 const struct open_flags
*op
,
3028 int open_flag
, umode_t mode
,
3031 struct dentry
*const DENTRY_NOT_SET
= (void *) -1UL;
3032 struct inode
*dir
= nd
->path
.dentry
->d_inode
;
3035 if (!(~open_flag
& (O_EXCL
| O_CREAT
))) /* both O_EXCL and O_CREAT */
3036 open_flag
&= ~O_TRUNC
;
3038 if (nd
->flags
& LOOKUP_DIRECTORY
)
3039 open_flag
|= O_DIRECTORY
;
3041 file
->f_path
.dentry
= DENTRY_NOT_SET
;
3042 file
->f_path
.mnt
= nd
->path
.mnt
;
3043 error
= dir
->i_op
->atomic_open(dir
, dentry
, file
,
3044 open_to_namei_flags(open_flag
),
3046 d_lookup_done(dentry
);
3049 * We didn't have the inode before the open, so check open
3052 int acc_mode
= op
->acc_mode
;
3053 if (*opened
& FILE_CREATED
) {
3054 WARN_ON(!(open_flag
& O_CREAT
));
3055 fsnotify_create(dir
, dentry
);
3058 error
= may_open(&file
->f_path
, acc_mode
, open_flag
);
3059 if (WARN_ON(error
> 0))
3061 } else if (error
> 0) {
3062 if (WARN_ON(file
->f_path
.dentry
== DENTRY_NOT_SET
)) {
3065 if (file
->f_path
.dentry
) {
3067 dentry
= file
->f_path
.dentry
;
3069 if (*opened
& FILE_CREATED
)
3070 fsnotify_create(dir
, dentry
);
3071 if (unlikely(d_is_negative(dentry
))) {
3074 path
->dentry
= dentry
;
3075 path
->mnt
= nd
->path
.mnt
;
3085 * Look up and maybe create and open the last component.
3087 * Must be called with i_mutex held on parent.
3089 * Returns 0 if the file was successfully atomically created (if necessary) and
3090 * opened. In this case the file will be returned attached to @file.
3092 * Returns 1 if the file was not completely opened at this time, though lookups
3093 * and creations will have been performed and the dentry returned in @path will
3094 * be positive upon return if O_CREAT was specified. If O_CREAT wasn't
3095 * specified then a negative dentry may be returned.
3097 * An error code is returned otherwise.
3099 * FILE_CREATE will be set in @*opened if the dentry was created and will be
3100 * cleared otherwise prior to returning.
3102 static int lookup_open(struct nameidata
*nd
, struct path
*path
,
3104 const struct open_flags
*op
,
3105 bool got_write
, int *opened
)
3107 struct dentry
*dir
= nd
->path
.dentry
;
3108 struct inode
*dir_inode
= dir
->d_inode
;
3109 int open_flag
= op
->open_flag
;
3110 struct dentry
*dentry
;
3111 int error
, create_error
= 0;
3112 umode_t mode
= op
->mode
;
3113 DECLARE_WAIT_QUEUE_HEAD_ONSTACK(wq
);
3115 if (unlikely(IS_DEADDIR(dir_inode
)))
3118 *opened
&= ~FILE_CREATED
;
3119 dentry
= d_lookup(dir
, &nd
->last
);
3122 dentry
= d_alloc_parallel(dir
, &nd
->last
, &wq
);
3124 return PTR_ERR(dentry
);
3126 if (d_in_lookup(dentry
))
3129 error
= d_revalidate(dentry
, nd
->flags
);
3130 if (likely(error
> 0))
3134 d_invalidate(dentry
);
3138 if (dentry
->d_inode
) {
3139 /* Cached positive dentry: will open in f_op->open */
3144 * Checking write permission is tricky, bacuse we don't know if we are
3145 * going to actually need it: O_CREAT opens should work as long as the
3146 * file exists. But checking existence breaks atomicity. The trick is
3147 * to check access and if not granted clear O_CREAT from the flags.
3149 * Another problem is returing the "right" error value (e.g. for an
3150 * O_EXCL open we want to return EEXIST not EROFS).
3152 if (open_flag
& O_CREAT
) {
3153 if (!IS_POSIXACL(dir
->d_inode
))
3154 mode
&= ~current_umask();
3155 if (unlikely(!got_write
)) {
3156 create_error
= -EROFS
;
3157 open_flag
&= ~O_CREAT
;
3158 if (open_flag
& (O_EXCL
| O_TRUNC
))
3160 /* No side effects, safe to clear O_CREAT */
3162 create_error
= may_o_create(&nd
->path
, dentry
, mode
);
3164 open_flag
&= ~O_CREAT
;
3165 if (open_flag
& O_EXCL
)
3169 } else if ((open_flag
& (O_TRUNC
|O_WRONLY
|O_RDWR
)) &&
3170 unlikely(!got_write
)) {
3172 * No O_CREATE -> atomicity not a requirement -> fall
3173 * back to lookup + open
3178 if (dir_inode
->i_op
->atomic_open
) {
3179 error
= atomic_open(nd
, dentry
, path
, file
, op
, open_flag
,
3181 if (unlikely(error
== -ENOENT
) && create_error
)
3182 error
= create_error
;
3187 if (d_in_lookup(dentry
)) {
3188 struct dentry
*res
= dir_inode
->i_op
->lookup(dir_inode
, dentry
,
3190 d_lookup_done(dentry
);
3191 if (unlikely(res
)) {
3193 error
= PTR_ERR(res
);
3201 /* Negative dentry, just create the file */
3202 if (!dentry
->d_inode
&& (open_flag
& O_CREAT
)) {
3203 *opened
|= FILE_CREATED
;
3204 audit_inode_child(dir_inode
, dentry
, AUDIT_TYPE_CHILD_CREATE
);
3205 if (!dir_inode
->i_op
->create
) {
3209 error
= dir_inode
->i_op
->create(dir_inode
, dentry
, mode
,
3210 open_flag
& O_EXCL
);
3213 fsnotify_create(dir_inode
, dentry
);
3215 if (unlikely(create_error
) && !dentry
->d_inode
) {
3216 error
= create_error
;
3220 path
->dentry
= dentry
;
3221 path
->mnt
= nd
->path
.mnt
;
3230 * Handle the last step of open()
3232 static int do_last(struct nameidata
*nd
,
3233 struct file
*file
, const struct open_flags
*op
,
3236 struct dentry
*dir
= nd
->path
.dentry
;
3237 int open_flag
= op
->open_flag
;
3238 bool will_truncate
= (open_flag
& O_TRUNC
) != 0;
3239 bool got_write
= false;
3240 int acc_mode
= op
->acc_mode
;
3242 struct inode
*inode
;
3246 nd
->flags
&= ~LOOKUP_PARENT
;
3247 nd
->flags
|= op
->intent
;
3249 if (nd
->last_type
!= LAST_NORM
) {
3250 error
= handle_dots(nd
, nd
->last_type
);
3251 if (unlikely(error
))
3256 if (!(open_flag
& O_CREAT
)) {
3257 if (nd
->last
.name
[nd
->last
.len
])
3258 nd
->flags
|= LOOKUP_FOLLOW
| LOOKUP_DIRECTORY
;
3259 /* we _can_ be in RCU mode here */
3260 error
= lookup_fast(nd
, &path
, &inode
, &seq
);
3261 if (likely(error
> 0))
3267 BUG_ON(nd
->inode
!= dir
->d_inode
);
3268 BUG_ON(nd
->flags
& LOOKUP_RCU
);
3270 /* create side of things */
3272 * This will *only* deal with leaving RCU mode - LOOKUP_JUMPED
3273 * has been cleared when we got to the last component we are
3276 error
= complete_walk(nd
);
3280 audit_inode(nd
->name
, dir
, LOOKUP_PARENT
);
3281 /* trailing slashes? */
3282 if (unlikely(nd
->last
.name
[nd
->last
.len
]))
3286 if (open_flag
& (O_CREAT
| O_TRUNC
| O_WRONLY
| O_RDWR
)) {
3287 error
= mnt_want_write(nd
->path
.mnt
);
3291 * do _not_ fail yet - we might not need that or fail with
3292 * a different error; let lookup_open() decide; we'll be
3293 * dropping this one anyway.
3296 if (open_flag
& O_CREAT
)
3297 inode_lock(dir
->d_inode
);
3299 inode_lock_shared(dir
->d_inode
);
3300 error
= lookup_open(nd
, &path
, file
, op
, got_write
, opened
);
3301 if (open_flag
& O_CREAT
)
3302 inode_unlock(dir
->d_inode
);
3304 inode_unlock_shared(dir
->d_inode
);
3310 if ((*opened
& FILE_CREATED
) ||
3311 !S_ISREG(file_inode(file
)->i_mode
))
3312 will_truncate
= false;
3314 audit_inode(nd
->name
, file
->f_path
.dentry
, 0);
3318 if (*opened
& FILE_CREATED
) {
3319 /* Don't check for write permission, don't truncate */
3320 open_flag
&= ~O_TRUNC
;
3321 will_truncate
= false;
3323 path_to_nameidata(&path
, nd
);
3324 goto finish_open_created
;
3328 * If atomic_open() acquired write access it is dropped now due to
3329 * possible mount and symlink following (this might be optimized away if
3333 mnt_drop_write(nd
->path
.mnt
);
3337 error
= follow_managed(&path
, nd
);
3338 if (unlikely(error
< 0))
3341 if (unlikely(d_is_negative(path
.dentry
))) {
3342 path_to_nameidata(&path
, nd
);
3347 * create/update audit record if it already exists.
3349 audit_inode(nd
->name
, path
.dentry
, 0);
3351 if (unlikely((open_flag
& (O_EXCL
| O_CREAT
)) == (O_EXCL
| O_CREAT
))) {
3352 path_to_nameidata(&path
, nd
);
3356 seq
= 0; /* out of RCU mode, so the value doesn't matter */
3357 inode
= d_backing_inode(path
.dentry
);
3359 error
= step_into(nd
, &path
, 0, inode
, seq
);
3360 if (unlikely(error
))
3363 /* Why this, you ask? _Now_ we might have grown LOOKUP_JUMPED... */
3364 error
= complete_walk(nd
);
3367 audit_inode(nd
->name
, nd
->path
.dentry
, 0);
3369 if ((open_flag
& O_CREAT
) && d_is_dir(nd
->path
.dentry
))
3372 if ((nd
->flags
& LOOKUP_DIRECTORY
) && !d_can_lookup(nd
->path
.dentry
))
3374 if (!d_is_reg(nd
->path
.dentry
))
3375 will_truncate
= false;
3377 if (will_truncate
) {
3378 error
= mnt_want_write(nd
->path
.mnt
);
3383 finish_open_created
:
3384 error
= may_open(&nd
->path
, acc_mode
, open_flag
);
3387 BUG_ON(*opened
& FILE_OPENED
); /* once it's opened, it's opened */
3388 error
= vfs_open(&nd
->path
, file
, current_cred());
3391 *opened
|= FILE_OPENED
;
3393 error
= open_check_o_direct(file
);
3395 error
= ima_file_check(file
, op
->acc_mode
, *opened
);
3396 if (!error
&& will_truncate
)
3397 error
= handle_truncate(file
);
3399 if (unlikely(error
) && (*opened
& FILE_OPENED
))
3401 if (unlikely(error
> 0)) {
3406 mnt_drop_write(nd
->path
.mnt
);
3410 struct dentry
*vfs_tmpfile(struct dentry
*dentry
, umode_t mode
, int open_flag
)
3412 struct dentry
*child
= NULL
;
3413 struct inode
*dir
= dentry
->d_inode
;
3414 struct inode
*inode
;
3417 /* we want directory to be writable */
3418 error
= inode_permission(dir
, MAY_WRITE
| MAY_EXEC
);
3421 error
= -EOPNOTSUPP
;
3422 if (!dir
->i_op
->tmpfile
)
3425 child
= d_alloc(dentry
, &slash_name
);
3426 if (unlikely(!child
))
3428 error
= dir
->i_op
->tmpfile(dir
, child
, mode
);
3432 inode
= child
->d_inode
;
3433 if (unlikely(!inode
))
3435 if (!(open_flag
& O_EXCL
)) {
3436 spin_lock(&inode
->i_lock
);
3437 inode
->i_state
|= I_LINKABLE
;
3438 spin_unlock(&inode
->i_lock
);
3444 return ERR_PTR(error
);
3446 EXPORT_SYMBOL(vfs_tmpfile
);
3448 static int do_tmpfile(struct nameidata
*nd
, unsigned flags
,
3449 const struct open_flags
*op
,
3450 struct file
*file
, int *opened
)
3452 struct dentry
*child
;
3454 int error
= path_lookupat(nd
, flags
| LOOKUP_DIRECTORY
, &path
);
3455 if (unlikely(error
))
3457 error
= mnt_want_write(path
.mnt
);
3458 if (unlikely(error
))
3460 child
= vfs_tmpfile(path
.dentry
, op
->mode
, op
->open_flag
);
3461 error
= PTR_ERR(child
);
3462 if (unlikely(IS_ERR(child
)))
3465 path
.dentry
= child
;
3466 audit_inode(nd
->name
, child
, 0);
3467 /* Don't check for other permissions, the inode was just created */
3468 error
= may_open(&path
, 0, op
->open_flag
);
3471 file
->f_path
.mnt
= path
.mnt
;
3472 error
= finish_open(file
, child
, NULL
, opened
);
3475 error
= open_check_o_direct(file
);
3479 mnt_drop_write(path
.mnt
);
3485 static int do_o_path(struct nameidata
*nd
, unsigned flags
, struct file
*file
)
3488 int error
= path_lookupat(nd
, flags
, &path
);
3490 audit_inode(nd
->name
, path
.dentry
, 0);
3491 error
= vfs_open(&path
, file
, current_cred());
3497 static struct file
*path_openat(struct nameidata
*nd
,
3498 const struct open_flags
*op
, unsigned flags
)
3505 file
= get_empty_filp();
3509 file
->f_flags
= op
->open_flag
;
3511 if (unlikely(file
->f_flags
& __O_TMPFILE
)) {
3512 error
= do_tmpfile(nd
, flags
, op
, file
, &opened
);
3516 if (unlikely(file
->f_flags
& O_PATH
)) {
3517 error
= do_o_path(nd
, flags
, file
);
3519 opened
|= FILE_OPENED
;
3523 s
= path_init(nd
, flags
);
3528 while (!(error
= link_path_walk(s
, nd
)) &&
3529 (error
= do_last(nd
, file
, op
, &opened
)) > 0) {
3530 nd
->flags
&= ~(LOOKUP_OPEN
|LOOKUP_CREATE
|LOOKUP_EXCL
);
3531 s
= trailing_symlink(nd
);
3539 if (!(opened
& FILE_OPENED
)) {
3543 if (unlikely(error
)) {
3544 if (error
== -EOPENSTALE
) {
3545 if (flags
& LOOKUP_RCU
)
3550 file
= ERR_PTR(error
);
3555 struct file
*do_filp_open(int dfd
, struct filename
*pathname
,
3556 const struct open_flags
*op
)
3558 struct nameidata nd
;
3559 int flags
= op
->lookup_flags
;
3562 set_nameidata(&nd
, dfd
, pathname
);
3563 filp
= path_openat(&nd
, op
, flags
| LOOKUP_RCU
);
3564 if (unlikely(filp
== ERR_PTR(-ECHILD
)))
3565 filp
= path_openat(&nd
, op
, flags
);
3566 if (unlikely(filp
== ERR_PTR(-ESTALE
)))
3567 filp
= path_openat(&nd
, op
, flags
| LOOKUP_REVAL
);
3568 restore_nameidata();
3572 struct file
*do_file_open_root(struct dentry
*dentry
, struct vfsmount
*mnt
,
3573 const char *name
, const struct open_flags
*op
)
3575 struct nameidata nd
;
3577 struct filename
*filename
;
3578 int flags
= op
->lookup_flags
| LOOKUP_ROOT
;
3581 nd
.root
.dentry
= dentry
;
3583 if (d_is_symlink(dentry
) && op
->intent
& LOOKUP_OPEN
)
3584 return ERR_PTR(-ELOOP
);
3586 filename
= getname_kernel(name
);
3587 if (IS_ERR(filename
))
3588 return ERR_CAST(filename
);
3590 set_nameidata(&nd
, -1, filename
);
3591 file
= path_openat(&nd
, op
, flags
| LOOKUP_RCU
);
3592 if (unlikely(file
== ERR_PTR(-ECHILD
)))
3593 file
= path_openat(&nd
, op
, flags
);
3594 if (unlikely(file
== ERR_PTR(-ESTALE
)))
3595 file
= path_openat(&nd
, op
, flags
| LOOKUP_REVAL
);
3596 restore_nameidata();
3601 static struct dentry
*filename_create(int dfd
, struct filename
*name
,
3602 struct path
*path
, unsigned int lookup_flags
)
3604 struct dentry
*dentry
= ERR_PTR(-EEXIST
);
3609 bool is_dir
= (lookup_flags
& LOOKUP_DIRECTORY
);
3612 * Note that only LOOKUP_REVAL and LOOKUP_DIRECTORY matter here. Any
3613 * other flags passed in are ignored!
3615 lookup_flags
&= LOOKUP_REVAL
;
3617 name
= filename_parentat(dfd
, name
, lookup_flags
, path
, &last
, &type
);
3619 return ERR_CAST(name
);
3622 * Yucky last component or no last component at all?
3623 * (foo/., foo/.., /////)
3625 if (unlikely(type
!= LAST_NORM
))
3628 /* don't fail immediately if it's r/o, at least try to report other errors */
3629 err2
= mnt_want_write(path
->mnt
);
3631 * Do the final lookup.
3633 lookup_flags
|= LOOKUP_CREATE
| LOOKUP_EXCL
;
3634 inode_lock_nested(path
->dentry
->d_inode
, I_MUTEX_PARENT
);
3635 dentry
= __lookup_hash(&last
, path
->dentry
, lookup_flags
);
3640 if (d_is_positive(dentry
))
3644 * Special case - lookup gave negative, but... we had foo/bar/
3645 * From the vfs_mknod() POV we just have a negative dentry -
3646 * all is fine. Let's be bastards - you had / on the end, you've
3647 * been asking for (non-existent) directory. -ENOENT for you.
3649 if (unlikely(!is_dir
&& last
.name
[last
.len
])) {
3653 if (unlikely(err2
)) {
3661 dentry
= ERR_PTR(error
);
3663 inode_unlock(path
->dentry
->d_inode
);
3665 mnt_drop_write(path
->mnt
);
3672 struct dentry
*kern_path_create(int dfd
, const char *pathname
,
3673 struct path
*path
, unsigned int lookup_flags
)
3675 return filename_create(dfd
, getname_kernel(pathname
),
3676 path
, lookup_flags
);
3678 EXPORT_SYMBOL(kern_path_create
);
3680 void done_path_create(struct path
*path
, struct dentry
*dentry
)
3683 inode_unlock(path
->dentry
->d_inode
);
3684 mnt_drop_write(path
->mnt
);
3687 EXPORT_SYMBOL(done_path_create
);
3689 inline struct dentry
*user_path_create(int dfd
, const char __user
*pathname
,
3690 struct path
*path
, unsigned int lookup_flags
)
3692 return filename_create(dfd
, getname(pathname
), path
, lookup_flags
);
3694 EXPORT_SYMBOL(user_path_create
);
3696 int vfs_mknod(struct inode
*dir
, struct dentry
*dentry
, umode_t mode
, dev_t dev
)
3698 int error
= may_create(dir
, dentry
);
3703 if ((S_ISCHR(mode
) || S_ISBLK(mode
)) && !capable(CAP_MKNOD
))
3706 if (!dir
->i_op
->mknod
)
3709 error
= devcgroup_inode_mknod(mode
, dev
);
3713 error
= security_inode_mknod(dir
, dentry
, mode
, dev
);
3717 error
= dir
->i_op
->mknod(dir
, dentry
, mode
, dev
);
3719 fsnotify_create(dir
, dentry
);
3722 EXPORT_SYMBOL(vfs_mknod
);
3724 static int may_mknod(umode_t mode
)
3726 switch (mode
& S_IFMT
) {
3732 case 0: /* zero mode translates to S_IFREG */
3741 SYSCALL_DEFINE4(mknodat
, int, dfd
, const char __user
*, filename
, umode_t
, mode
,
3744 struct dentry
*dentry
;
3747 unsigned int lookup_flags
= 0;
3749 error
= may_mknod(mode
);
3753 dentry
= user_path_create(dfd
, filename
, &path
, lookup_flags
);
3755 return PTR_ERR(dentry
);
3757 if (!IS_POSIXACL(path
.dentry
->d_inode
))
3758 mode
&= ~current_umask();
3759 error
= security_path_mknod(&path
, dentry
, mode
, dev
);
3762 switch (mode
& S_IFMT
) {
3763 case 0: case S_IFREG
:
3764 error
= vfs_create(path
.dentry
->d_inode
,dentry
,mode
,true);
3766 ima_post_path_mknod(dentry
);
3768 case S_IFCHR
: case S_IFBLK
:
3769 error
= vfs_mknod(path
.dentry
->d_inode
,dentry
,mode
,
3770 new_decode_dev(dev
));
3772 case S_IFIFO
: case S_IFSOCK
:
3773 error
= vfs_mknod(path
.dentry
->d_inode
,dentry
,mode
,0);
3777 done_path_create(&path
, dentry
);
3778 if (retry_estale(error
, lookup_flags
)) {
3779 lookup_flags
|= LOOKUP_REVAL
;
3785 SYSCALL_DEFINE3(mknod
, const char __user
*, filename
, umode_t
, mode
, unsigned, dev
)
3787 return sys_mknodat(AT_FDCWD
, filename
, mode
, dev
);
3790 int vfs_mkdir(struct inode
*dir
, struct dentry
*dentry
, umode_t mode
)
3792 int error
= may_create(dir
, dentry
);
3793 unsigned max_links
= dir
->i_sb
->s_max_links
;
3798 if (!dir
->i_op
->mkdir
)
3801 mode
&= (S_IRWXUGO
|S_ISVTX
);
3802 error
= security_inode_mkdir(dir
, dentry
, mode
);
3806 if (max_links
&& dir
->i_nlink
>= max_links
)
3809 error
= dir
->i_op
->mkdir(dir
, dentry
, mode
);
3811 fsnotify_mkdir(dir
, dentry
);
3814 EXPORT_SYMBOL(vfs_mkdir
);
3816 SYSCALL_DEFINE3(mkdirat
, int, dfd
, const char __user
*, pathname
, umode_t
, mode
)
3818 struct dentry
*dentry
;
3821 unsigned int lookup_flags
= LOOKUP_DIRECTORY
;
3824 dentry
= user_path_create(dfd
, pathname
, &path
, lookup_flags
);
3826 return PTR_ERR(dentry
);
3828 if (!IS_POSIXACL(path
.dentry
->d_inode
))
3829 mode
&= ~current_umask();
3830 error
= security_path_mkdir(&path
, dentry
, mode
);
3832 error
= vfs_mkdir(path
.dentry
->d_inode
, dentry
, mode
);
3833 done_path_create(&path
, dentry
);
3834 if (retry_estale(error
, lookup_flags
)) {
3835 lookup_flags
|= LOOKUP_REVAL
;
3841 SYSCALL_DEFINE2(mkdir
, const char __user
*, pathname
, umode_t
, mode
)
3843 return sys_mkdirat(AT_FDCWD
, pathname
, mode
);
3846 int vfs_rmdir(struct inode
*dir
, struct dentry
*dentry
)
3848 int error
= may_delete(dir
, dentry
, 1);
3853 if (!dir
->i_op
->rmdir
)
3857 inode_lock(dentry
->d_inode
);
3860 if (is_local_mountpoint(dentry
))
3863 error
= security_inode_rmdir(dir
, dentry
);
3867 shrink_dcache_parent(dentry
);
3868 error
= dir
->i_op
->rmdir(dir
, dentry
);
3872 dentry
->d_inode
->i_flags
|= S_DEAD
;
3874 detach_mounts(dentry
);
3877 inode_unlock(dentry
->d_inode
);
3883 EXPORT_SYMBOL(vfs_rmdir
);
3885 static long do_rmdir(int dfd
, const char __user
*pathname
)
3888 struct filename
*name
;
3889 struct dentry
*dentry
;
3893 unsigned int lookup_flags
= 0;
3895 name
= filename_parentat(dfd
, getname(pathname
), lookup_flags
,
3896 &path
, &last
, &type
);
3898 return PTR_ERR(name
);
3912 error
= mnt_want_write(path
.mnt
);
3916 inode_lock_nested(path
.dentry
->d_inode
, I_MUTEX_PARENT
);
3917 dentry
= __lookup_hash(&last
, path
.dentry
, lookup_flags
);
3918 error
= PTR_ERR(dentry
);
3921 if (!dentry
->d_inode
) {
3925 error
= security_path_rmdir(&path
, dentry
);
3928 error
= vfs_rmdir(path
.dentry
->d_inode
, dentry
);
3932 inode_unlock(path
.dentry
->d_inode
);
3933 mnt_drop_write(path
.mnt
);
3937 if (retry_estale(error
, lookup_flags
)) {
3938 lookup_flags
|= LOOKUP_REVAL
;
3944 SYSCALL_DEFINE1(rmdir
, const char __user
*, pathname
)
3946 return do_rmdir(AT_FDCWD
, pathname
);
3950 * vfs_unlink - unlink a filesystem object
3951 * @dir: parent directory
3953 * @delegated_inode: returns victim inode, if the inode is delegated.
3955 * The caller must hold dir->i_mutex.
3957 * If vfs_unlink discovers a delegation, it will return -EWOULDBLOCK and
3958 * return a reference to the inode in delegated_inode. The caller
3959 * should then break the delegation on that inode and retry. Because
3960 * breaking a delegation may take a long time, the caller should drop
3961 * dir->i_mutex before doing so.
3963 * Alternatively, a caller may pass NULL for delegated_inode. This may
3964 * be appropriate for callers that expect the underlying filesystem not
3965 * to be NFS exported.
3967 int vfs_unlink(struct inode
*dir
, struct dentry
*dentry
, struct inode
**delegated_inode
)
3969 struct inode
*target
= dentry
->d_inode
;
3970 int error
= may_delete(dir
, dentry
, 0);
3975 if (!dir
->i_op
->unlink
)
3979 if (is_local_mountpoint(dentry
))
3982 error
= security_inode_unlink(dir
, dentry
);
3984 error
= try_break_deleg(target
, delegated_inode
);
3987 error
= dir
->i_op
->unlink(dir
, dentry
);
3990 detach_mounts(dentry
);
3995 inode_unlock(target
);
3997 /* We don't d_delete() NFS sillyrenamed files--they still exist. */
3998 if (!error
&& !(dentry
->d_flags
& DCACHE_NFSFS_RENAMED
)) {
3999 fsnotify_link_count(target
);
4005 EXPORT_SYMBOL(vfs_unlink
);
4008 * Make sure that the actual truncation of the file will occur outside its
4009 * directory's i_mutex. Truncate can take a long time if there is a lot of
4010 * writeout happening, and we don't want to prevent access to the directory
4011 * while waiting on the I/O.
4013 static long do_unlinkat(int dfd
, const char __user
*pathname
)
4016 struct filename
*name
;
4017 struct dentry
*dentry
;
4021 struct inode
*inode
= NULL
;
4022 struct inode
*delegated_inode
= NULL
;
4023 unsigned int lookup_flags
= 0;
4025 name
= filename_parentat(dfd
, getname(pathname
), lookup_flags
,
4026 &path
, &last
, &type
);
4028 return PTR_ERR(name
);
4031 if (type
!= LAST_NORM
)
4034 error
= mnt_want_write(path
.mnt
);
4038 inode_lock_nested(path
.dentry
->d_inode
, I_MUTEX_PARENT
);
4039 dentry
= __lookup_hash(&last
, path
.dentry
, lookup_flags
);
4040 error
= PTR_ERR(dentry
);
4041 if (!IS_ERR(dentry
)) {
4042 /* Why not before? Because we want correct error value */
4043 if (last
.name
[last
.len
])
4045 inode
= dentry
->d_inode
;
4046 if (d_is_negative(dentry
))
4049 error
= security_path_unlink(&path
, dentry
);
4052 error
= vfs_unlink(path
.dentry
->d_inode
, dentry
, &delegated_inode
);
4056 inode_unlock(path
.dentry
->d_inode
);
4058 iput(inode
); /* truncate the inode here */
4060 if (delegated_inode
) {
4061 error
= break_deleg_wait(&delegated_inode
);
4065 mnt_drop_write(path
.mnt
);
4069 if (retry_estale(error
, lookup_flags
)) {
4070 lookup_flags
|= LOOKUP_REVAL
;
4077 if (d_is_negative(dentry
))
4079 else if (d_is_dir(dentry
))
4086 SYSCALL_DEFINE3(unlinkat
, int, dfd
, const char __user
*, pathname
, int, flag
)
4088 if ((flag
& ~AT_REMOVEDIR
) != 0)
4091 if (flag
& AT_REMOVEDIR
)
4092 return do_rmdir(dfd
, pathname
);
4094 return do_unlinkat(dfd
, pathname
);
4097 SYSCALL_DEFINE1(unlink
, const char __user
*, pathname
)
4099 return do_unlinkat(AT_FDCWD
, pathname
);
4102 int vfs_symlink(struct inode
*dir
, struct dentry
*dentry
, const char *oldname
)
4104 int error
= may_create(dir
, dentry
);
4109 if (!dir
->i_op
->symlink
)
4112 error
= security_inode_symlink(dir
, dentry
, oldname
);
4116 error
= dir
->i_op
->symlink(dir
, dentry
, oldname
);
4118 fsnotify_create(dir
, dentry
);
4121 EXPORT_SYMBOL(vfs_symlink
);
4123 SYSCALL_DEFINE3(symlinkat
, const char __user
*, oldname
,
4124 int, newdfd
, const char __user
*, newname
)
4127 struct filename
*from
;
4128 struct dentry
*dentry
;
4130 unsigned int lookup_flags
= 0;
4132 from
= getname(oldname
);
4134 return PTR_ERR(from
);
4136 dentry
= user_path_create(newdfd
, newname
, &path
, lookup_flags
);
4137 error
= PTR_ERR(dentry
);
4141 error
= security_path_symlink(&path
, dentry
, from
->name
);
4143 error
= vfs_symlink(path
.dentry
->d_inode
, dentry
, from
->name
);
4144 done_path_create(&path
, dentry
);
4145 if (retry_estale(error
, lookup_flags
)) {
4146 lookup_flags
|= LOOKUP_REVAL
;
4154 SYSCALL_DEFINE2(symlink
, const char __user
*, oldname
, const char __user
*, newname
)
4156 return sys_symlinkat(oldname
, AT_FDCWD
, newname
);
4160 * vfs_link - create a new link
4161 * @old_dentry: object to be linked
4163 * @new_dentry: where to create the new link
4164 * @delegated_inode: returns inode needing a delegation break
4166 * The caller must hold dir->i_mutex
4168 * If vfs_link discovers a delegation on the to-be-linked file in need
4169 * of breaking, it will return -EWOULDBLOCK and return a reference to the
4170 * inode in delegated_inode. The caller should then break the delegation
4171 * and retry. Because breaking a delegation may take a long time, the
4172 * caller should drop the i_mutex before doing so.
4174 * Alternatively, a caller may pass NULL for delegated_inode. This may
4175 * be appropriate for callers that expect the underlying filesystem not
4176 * to be NFS exported.
4178 int vfs_link(struct dentry
*old_dentry
, struct inode
*dir
, struct dentry
*new_dentry
, struct inode
**delegated_inode
)
4180 struct inode
*inode
= old_dentry
->d_inode
;
4181 unsigned max_links
= dir
->i_sb
->s_max_links
;
4187 error
= may_create(dir
, new_dentry
);
4191 if (dir
->i_sb
!= inode
->i_sb
)
4195 * A link to an append-only or immutable file cannot be created.
4197 if (IS_APPEND(inode
) || IS_IMMUTABLE(inode
))
4200 * Updating the link count will likely cause i_uid and i_gid to
4201 * be writen back improperly if their true value is unknown to
4204 if (HAS_UNMAPPED_ID(inode
))
4206 if (!dir
->i_op
->link
)
4208 if (S_ISDIR(inode
->i_mode
))
4211 error
= security_inode_link(old_dentry
, dir
, new_dentry
);
4216 /* Make sure we don't allow creating hardlink to an unlinked file */
4217 if (inode
->i_nlink
== 0 && !(inode
->i_state
& I_LINKABLE
))
4219 else if (max_links
&& inode
->i_nlink
>= max_links
)
4222 error
= try_break_deleg(inode
, delegated_inode
);
4224 error
= dir
->i_op
->link(old_dentry
, dir
, new_dentry
);
4227 if (!error
&& (inode
->i_state
& I_LINKABLE
)) {
4228 spin_lock(&inode
->i_lock
);
4229 inode
->i_state
&= ~I_LINKABLE
;
4230 spin_unlock(&inode
->i_lock
);
4232 inode_unlock(inode
);
4234 fsnotify_link(dir
, inode
, new_dentry
);
4237 EXPORT_SYMBOL(vfs_link
);
4240 * Hardlinks are often used in delicate situations. We avoid
4241 * security-related surprises by not following symlinks on the
4244 * We don't follow them on the oldname either to be compatible
4245 * with linux 2.0, and to avoid hard-linking to directories
4246 * and other special files. --ADM
4248 SYSCALL_DEFINE5(linkat
, int, olddfd
, const char __user
*, oldname
,
4249 int, newdfd
, const char __user
*, newname
, int, flags
)
4251 struct dentry
*new_dentry
;
4252 struct path old_path
, new_path
;
4253 struct inode
*delegated_inode
= NULL
;
4257 if ((flags
& ~(AT_SYMLINK_FOLLOW
| AT_EMPTY_PATH
)) != 0)
4260 * To use null names we require CAP_DAC_READ_SEARCH
4261 * This ensures that not everyone will be able to create
4262 * handlink using the passed filedescriptor.
4264 if (flags
& AT_EMPTY_PATH
) {
4265 if (!capable(CAP_DAC_READ_SEARCH
))
4270 if (flags
& AT_SYMLINK_FOLLOW
)
4271 how
|= LOOKUP_FOLLOW
;
4273 error
= user_path_at(olddfd
, oldname
, how
, &old_path
);
4277 new_dentry
= user_path_create(newdfd
, newname
, &new_path
,
4278 (how
& LOOKUP_REVAL
));
4279 error
= PTR_ERR(new_dentry
);
4280 if (IS_ERR(new_dentry
))
4284 if (old_path
.mnt
!= new_path
.mnt
)
4286 error
= may_linkat(&old_path
);
4287 if (unlikely(error
))
4289 error
= security_path_link(old_path
.dentry
, &new_path
, new_dentry
);
4292 error
= vfs_link(old_path
.dentry
, new_path
.dentry
->d_inode
, new_dentry
, &delegated_inode
);
4294 done_path_create(&new_path
, new_dentry
);
4295 if (delegated_inode
) {
4296 error
= break_deleg_wait(&delegated_inode
);
4298 path_put(&old_path
);
4302 if (retry_estale(error
, how
)) {
4303 path_put(&old_path
);
4304 how
|= LOOKUP_REVAL
;
4308 path_put(&old_path
);
4313 SYSCALL_DEFINE2(link
, const char __user
*, oldname
, const char __user
*, newname
)
4315 return sys_linkat(AT_FDCWD
, oldname
, AT_FDCWD
, newname
, 0);
4319 * vfs_rename - rename a filesystem object
4320 * @old_dir: parent of source
4321 * @old_dentry: source
4322 * @new_dir: parent of destination
4323 * @new_dentry: destination
4324 * @delegated_inode: returns an inode needing a delegation break
4325 * @flags: rename flags
4327 * The caller must hold multiple mutexes--see lock_rename()).
4329 * If vfs_rename discovers a delegation in need of breaking at either
4330 * the source or destination, it will return -EWOULDBLOCK and return a
4331 * reference to the inode in delegated_inode. The caller should then
4332 * break the delegation and retry. Because breaking a delegation may
4333 * take a long time, the caller should drop all locks before doing
4336 * Alternatively, a caller may pass NULL for delegated_inode. This may
4337 * be appropriate for callers that expect the underlying filesystem not
4338 * to be NFS exported.
4340 * The worst of all namespace operations - renaming directory. "Perverted"
4341 * doesn't even start to describe it. Somebody in UCB had a heck of a trip...
4344 * a) we can get into loop creation.
4345 * b) race potential - two innocent renames can create a loop together.
4346 * That's where 4.4 screws up. Current fix: serialization on
4347 * sb->s_vfs_rename_mutex. We might be more accurate, but that's another
4349 * c) we have to lock _four_ objects - parents and victim (if it exists),
4350 * and source (if it is not a directory).
4351 * And that - after we got ->i_mutex on parents (until then we don't know
4352 * whether the target exists). Solution: try to be smart with locking
4353 * order for inodes. We rely on the fact that tree topology may change
4354 * only under ->s_vfs_rename_mutex _and_ that parent of the object we
4355 * move will be locked. Thus we can rank directories by the tree
4356 * (ancestors first) and rank all non-directories after them.
4357 * That works since everybody except rename does "lock parent, lookup,
4358 * lock child" and rename is under ->s_vfs_rename_mutex.
4359 * HOWEVER, it relies on the assumption that any object with ->lookup()
4360 * has no more than 1 dentry. If "hybrid" objects will ever appear,
4361 * we'd better make sure that there's no link(2) for them.
4362 * d) conversion from fhandle to dentry may come in the wrong moment - when
4363 * we are removing the target. Solution: we will have to grab ->i_mutex
4364 * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on
4365 * ->i_mutex on parents, which works but leads to some truly excessive
4368 int vfs_rename(struct inode
*old_dir
, struct dentry
*old_dentry
,
4369 struct inode
*new_dir
, struct dentry
*new_dentry
,
4370 struct inode
**delegated_inode
, unsigned int flags
)
4373 bool is_dir
= d_is_dir(old_dentry
);
4374 struct inode
*source
= old_dentry
->d_inode
;
4375 struct inode
*target
= new_dentry
->d_inode
;
4376 bool new_is_dir
= false;
4377 unsigned max_links
= new_dir
->i_sb
->s_max_links
;
4378 struct name_snapshot old_name
;
4380 if (source
== target
)
4383 error
= may_delete(old_dir
, old_dentry
, is_dir
);
4388 error
= may_create(new_dir
, new_dentry
);
4390 new_is_dir
= d_is_dir(new_dentry
);
4392 if (!(flags
& RENAME_EXCHANGE
))
4393 error
= may_delete(new_dir
, new_dentry
, is_dir
);
4395 error
= may_delete(new_dir
, new_dentry
, new_is_dir
);
4400 if (!old_dir
->i_op
->rename
)
4404 * If we are going to change the parent - check write permissions,
4405 * we'll need to flip '..'.
4407 if (new_dir
!= old_dir
) {
4409 error
= inode_permission(source
, MAY_WRITE
);
4413 if ((flags
& RENAME_EXCHANGE
) && new_is_dir
) {
4414 error
= inode_permission(target
, MAY_WRITE
);
4420 error
= security_inode_rename(old_dir
, old_dentry
, new_dir
, new_dentry
,
4425 take_dentry_name_snapshot(&old_name
, old_dentry
);
4427 if (!is_dir
|| (flags
& RENAME_EXCHANGE
))
4428 lock_two_nondirectories(source
, target
);
4433 if (is_local_mountpoint(old_dentry
) || is_local_mountpoint(new_dentry
))
4436 if (max_links
&& new_dir
!= old_dir
) {
4438 if (is_dir
&& !new_is_dir
&& new_dir
->i_nlink
>= max_links
)
4440 if ((flags
& RENAME_EXCHANGE
) && !is_dir
&& new_is_dir
&&
4441 old_dir
->i_nlink
>= max_links
)
4444 if (is_dir
&& !(flags
& RENAME_EXCHANGE
) && target
)
4445 shrink_dcache_parent(new_dentry
);
4447 error
= try_break_deleg(source
, delegated_inode
);
4451 if (target
&& !new_is_dir
) {
4452 error
= try_break_deleg(target
, delegated_inode
);
4456 error
= old_dir
->i_op
->rename(old_dir
, old_dentry
,
4457 new_dir
, new_dentry
, flags
);
4461 if (!(flags
& RENAME_EXCHANGE
) && target
) {
4463 target
->i_flags
|= S_DEAD
;
4464 dont_mount(new_dentry
);
4465 detach_mounts(new_dentry
);
4467 if (!(old_dir
->i_sb
->s_type
->fs_flags
& FS_RENAME_DOES_D_MOVE
)) {
4468 if (!(flags
& RENAME_EXCHANGE
))
4469 d_move(old_dentry
, new_dentry
);
4471 d_exchange(old_dentry
, new_dentry
);
4474 if (!is_dir
|| (flags
& RENAME_EXCHANGE
))
4475 unlock_two_nondirectories(source
, target
);
4477 inode_unlock(target
);
4480 fsnotify_move(old_dir
, new_dir
, old_name
.name
, is_dir
,
4481 !(flags
& RENAME_EXCHANGE
) ? target
: NULL
, old_dentry
);
4482 if (flags
& RENAME_EXCHANGE
) {
4483 fsnotify_move(new_dir
, old_dir
, old_dentry
->d_name
.name
,
4484 new_is_dir
, NULL
, new_dentry
);
4487 release_dentry_name_snapshot(&old_name
);
4491 EXPORT_SYMBOL(vfs_rename
);
4493 SYSCALL_DEFINE5(renameat2
, int, olddfd
, const char __user
*, oldname
,
4494 int, newdfd
, const char __user
*, newname
, unsigned int, flags
)
4496 struct dentry
*old_dentry
, *new_dentry
;
4497 struct dentry
*trap
;
4498 struct path old_path
, new_path
;
4499 struct qstr old_last
, new_last
;
4500 int old_type
, new_type
;
4501 struct inode
*delegated_inode
= NULL
;
4502 struct filename
*from
;
4503 struct filename
*to
;
4504 unsigned int lookup_flags
= 0, target_flags
= LOOKUP_RENAME_TARGET
;
4505 bool should_retry
= false;
4508 if (flags
& ~(RENAME_NOREPLACE
| RENAME_EXCHANGE
| RENAME_WHITEOUT
))
4511 if ((flags
& (RENAME_NOREPLACE
| RENAME_WHITEOUT
)) &&
4512 (flags
& RENAME_EXCHANGE
))
4515 if ((flags
& RENAME_WHITEOUT
) && !capable(CAP_MKNOD
))
4518 if (flags
& RENAME_EXCHANGE
)
4522 from
= filename_parentat(olddfd
, getname(oldname
), lookup_flags
,
4523 &old_path
, &old_last
, &old_type
);
4525 error
= PTR_ERR(from
);
4529 to
= filename_parentat(newdfd
, getname(newname
), lookup_flags
,
4530 &new_path
, &new_last
, &new_type
);
4532 error
= PTR_ERR(to
);
4537 if (old_path
.mnt
!= new_path
.mnt
)
4541 if (old_type
!= LAST_NORM
)
4544 if (flags
& RENAME_NOREPLACE
)
4546 if (new_type
!= LAST_NORM
)
4549 error
= mnt_want_write(old_path
.mnt
);
4554 trap
= lock_rename(new_path
.dentry
, old_path
.dentry
);
4556 old_dentry
= __lookup_hash(&old_last
, old_path
.dentry
, lookup_flags
);
4557 error
= PTR_ERR(old_dentry
);
4558 if (IS_ERR(old_dentry
))
4560 /* source must exist */
4562 if (d_is_negative(old_dentry
))
4564 new_dentry
= __lookup_hash(&new_last
, new_path
.dentry
, lookup_flags
| target_flags
);
4565 error
= PTR_ERR(new_dentry
);
4566 if (IS_ERR(new_dentry
))
4569 if ((flags
& RENAME_NOREPLACE
) && d_is_positive(new_dentry
))
4571 if (flags
& RENAME_EXCHANGE
) {
4573 if (d_is_negative(new_dentry
))
4576 if (!d_is_dir(new_dentry
)) {
4578 if (new_last
.name
[new_last
.len
])
4582 /* unless the source is a directory trailing slashes give -ENOTDIR */
4583 if (!d_is_dir(old_dentry
)) {
4585 if (old_last
.name
[old_last
.len
])
4587 if (!(flags
& RENAME_EXCHANGE
) && new_last
.name
[new_last
.len
])
4590 /* source should not be ancestor of target */
4592 if (old_dentry
== trap
)
4594 /* target should not be an ancestor of source */
4595 if (!(flags
& RENAME_EXCHANGE
))
4597 if (new_dentry
== trap
)
4600 error
= security_path_rename(&old_path
, old_dentry
,
4601 &new_path
, new_dentry
, flags
);
4604 error
= vfs_rename(old_path
.dentry
->d_inode
, old_dentry
,
4605 new_path
.dentry
->d_inode
, new_dentry
,
4606 &delegated_inode
, flags
);
4612 unlock_rename(new_path
.dentry
, old_path
.dentry
);
4613 if (delegated_inode
) {
4614 error
= break_deleg_wait(&delegated_inode
);
4618 mnt_drop_write(old_path
.mnt
);
4620 if (retry_estale(error
, lookup_flags
))
4621 should_retry
= true;
4622 path_put(&new_path
);
4625 path_put(&old_path
);
4628 should_retry
= false;
4629 lookup_flags
|= LOOKUP_REVAL
;
4636 SYSCALL_DEFINE4(renameat
, int, olddfd
, const char __user
*, oldname
,
4637 int, newdfd
, const char __user
*, newname
)
4639 return sys_renameat2(olddfd
, oldname
, newdfd
, newname
, 0);
4642 SYSCALL_DEFINE2(rename
, const char __user
*, oldname
, const char __user
*, newname
)
4644 return sys_renameat2(AT_FDCWD
, oldname
, AT_FDCWD
, newname
, 0);
4647 int vfs_whiteout(struct inode
*dir
, struct dentry
*dentry
)
4649 int error
= may_create(dir
, dentry
);
4653 if (!dir
->i_op
->mknod
)
4656 return dir
->i_op
->mknod(dir
, dentry
,
4657 S_IFCHR
| WHITEOUT_MODE
, WHITEOUT_DEV
);
4659 EXPORT_SYMBOL(vfs_whiteout
);
4661 int readlink_copy(char __user
*buffer
, int buflen
, const char *link
)
4663 int len
= PTR_ERR(link
);
4668 if (len
> (unsigned) buflen
)
4670 if (copy_to_user(buffer
, link
, len
))
4677 * A helper for ->readlink(). This should be used *ONLY* for symlinks that
4678 * have ->get_link() not calling nd_jump_link(). Using (or not using) it
4679 * for any given inode is up to filesystem.
4681 static int generic_readlink(struct dentry
*dentry
, char __user
*buffer
,
4684 DEFINE_DELAYED_CALL(done
);
4685 struct inode
*inode
= d_inode(dentry
);
4686 const char *link
= inode
->i_link
;
4690 link
= inode
->i_op
->get_link(dentry
, inode
, &done
);
4692 return PTR_ERR(link
);
4694 res
= readlink_copy(buffer
, buflen
, link
);
4695 do_delayed_call(&done
);
4700 * vfs_readlink - copy symlink body into userspace buffer
4701 * @dentry: dentry on which to get symbolic link
4702 * @buffer: user memory pointer
4703 * @buflen: size of buffer
4705 * Does not touch atime. That's up to the caller if necessary
4707 * Does not call security hook.
4709 int vfs_readlink(struct dentry
*dentry
, char __user
*buffer
, int buflen
)
4711 struct inode
*inode
= d_inode(dentry
);
4713 if (unlikely(!(inode
->i_opflags
& IOP_DEFAULT_READLINK
))) {
4714 if (unlikely(inode
->i_op
->readlink
))
4715 return inode
->i_op
->readlink(dentry
, buffer
, buflen
);
4717 if (!d_is_symlink(dentry
))
4720 spin_lock(&inode
->i_lock
);
4721 inode
->i_opflags
|= IOP_DEFAULT_READLINK
;
4722 spin_unlock(&inode
->i_lock
);
4725 return generic_readlink(dentry
, buffer
, buflen
);
4727 EXPORT_SYMBOL(vfs_readlink
);
4730 * vfs_get_link - get symlink body
4731 * @dentry: dentry on which to get symbolic link
4732 * @done: caller needs to free returned data with this
4734 * Calls security hook and i_op->get_link() on the supplied inode.
4736 * It does not touch atime. That's up to the caller if necessary.
4738 * Does not work on "special" symlinks like /proc/$$/fd/N
4740 const char *vfs_get_link(struct dentry
*dentry
, struct delayed_call
*done
)
4742 const char *res
= ERR_PTR(-EINVAL
);
4743 struct inode
*inode
= d_inode(dentry
);
4745 if (d_is_symlink(dentry
)) {
4746 res
= ERR_PTR(security_inode_readlink(dentry
));
4748 res
= inode
->i_op
->get_link(dentry
, inode
, done
);
4752 EXPORT_SYMBOL(vfs_get_link
);
4754 /* get the link contents into pagecache */
4755 const char *page_get_link(struct dentry
*dentry
, struct inode
*inode
,
4756 struct delayed_call
*callback
)
4760 struct address_space
*mapping
= inode
->i_mapping
;
4763 page
= find_get_page(mapping
, 0);
4765 return ERR_PTR(-ECHILD
);
4766 if (!PageUptodate(page
)) {
4768 return ERR_PTR(-ECHILD
);
4771 page
= read_mapping_page(mapping
, 0, NULL
);
4775 set_delayed_call(callback
, page_put_link
, page
);
4776 BUG_ON(mapping_gfp_mask(mapping
) & __GFP_HIGHMEM
);
4777 kaddr
= page_address(page
);
4778 nd_terminate_link(kaddr
, inode
->i_size
, PAGE_SIZE
- 1);
4782 EXPORT_SYMBOL(page_get_link
);
4784 void page_put_link(void *arg
)
4788 EXPORT_SYMBOL(page_put_link
);
4790 int page_readlink(struct dentry
*dentry
, char __user
*buffer
, int buflen
)
4792 DEFINE_DELAYED_CALL(done
);
4793 int res
= readlink_copy(buffer
, buflen
,
4794 page_get_link(dentry
, d_inode(dentry
),
4796 do_delayed_call(&done
);
4799 EXPORT_SYMBOL(page_readlink
);
4802 * The nofs argument instructs pagecache_write_begin to pass AOP_FLAG_NOFS
4804 int __page_symlink(struct inode
*inode
, const char *symname
, int len
, int nofs
)
4806 struct address_space
*mapping
= inode
->i_mapping
;
4810 unsigned int flags
= 0;
4812 flags
|= AOP_FLAG_NOFS
;
4815 err
= pagecache_write_begin(NULL
, mapping
, 0, len
-1,
4816 flags
, &page
, &fsdata
);
4820 memcpy(page_address(page
), symname
, len
-1);
4822 err
= pagecache_write_end(NULL
, mapping
, 0, len
-1, len
-1,
4829 mark_inode_dirty(inode
);
4834 EXPORT_SYMBOL(__page_symlink
);
4836 int page_symlink(struct inode
*inode
, const char *symname
, int len
)
4838 return __page_symlink(inode
, symname
, len
,
4839 !mapping_gfp_constraint(inode
->i_mapping
, __GFP_FS
));
4841 EXPORT_SYMBOL(page_symlink
);
4843 const struct inode_operations page_symlink_inode_operations
= {
4844 .get_link
= page_get_link
,
4846 EXPORT_SYMBOL(page_symlink_inode_operations
);