4 * Copyright (C) 1991, 1992 Linus Torvalds
8 * Some corrections by tytso.
11 /* [Feb 1997 T. Schoebel-Theuer] Complete rewrite of the pathname
14 /* [Feb-Apr 2000, AV] Rewrite to the new namespace architecture.
17 #include <linux/init.h>
18 #include <linux/export.h>
19 #include <linux/kernel.h>
20 #include <linux/slab.h>
22 #include <linux/namei.h>
23 #include <linux/pagemap.h>
24 #include <linux/fsnotify.h>
25 #include <linux/personality.h>
26 #include <linux/security.h>
27 #include <linux/ima.h>
28 #include <linux/syscalls.h>
29 #include <linux/mount.h>
30 #include <linux/audit.h>
31 #include <linux/capability.h>
32 #include <linux/file.h>
33 #include <linux/fcntl.h>
34 #include <linux/device_cgroup.h>
35 #include <linux/fs_struct.h>
36 #include <linux/posix_acl.h>
37 #include <asm/uaccess.h>
42 /* [Feb-1997 T. Schoebel-Theuer]
43 * Fundamental changes in the pathname lookup mechanisms (namei)
44 * were necessary because of omirr. The reason is that omirr needs
45 * to know the _real_ pathname, not the user-supplied one, in case
46 * of symlinks (and also when transname replacements occur).
48 * The new code replaces the old recursive symlink resolution with
49 * an iterative one (in case of non-nested symlink chains). It does
50 * this with calls to <fs>_follow_link().
51 * As a side effect, dir_namei(), _namei() and follow_link() are now
52 * replaced with a single function lookup_dentry() that can handle all
53 * the special cases of the former code.
55 * With the new dcache, the pathname is stored at each inode, at least as
56 * long as the refcount of the inode is positive. As a side effect, the
57 * size of the dcache depends on the inode cache and thus is dynamic.
59 * [29-Apr-1998 C. Scott Ananian] Updated above description of symlink
60 * resolution to correspond with current state of the code.
62 * Note that the symlink resolution is not *completely* iterative.
63 * There is still a significant amount of tail- and mid- recursion in
64 * the algorithm. Also, note that <fs>_readlink() is not used in
65 * lookup_dentry(): lookup_dentry() on the result of <fs>_readlink()
66 * may return different results than <fs>_follow_link(). Many virtual
67 * filesystems (including /proc) exhibit this behavior.
70 /* [24-Feb-97 T. Schoebel-Theuer] Side effects caused by new implementation:
71 * New symlink semantics: when open() is called with flags O_CREAT | O_EXCL
72 * and the name already exists in form of a symlink, try to create the new
73 * name indicated by the symlink. The old code always complained that the
74 * name already exists, due to not following the symlink even if its target
75 * is nonexistent. The new semantics affects also mknod() and link() when
76 * the name is a symlink pointing to a non-existent name.
78 * I don't know which semantics is the right one, since I have no access
79 * to standards. But I found by trial that HP-UX 9.0 has the full "new"
80 * semantics implemented, while SunOS 4.1.1 and Solaris (SunOS 5.4) have the
81 * "old" one. Personally, I think the new semantics is much more logical.
82 * Note that "ln old new" where "new" is a symlink pointing to a non-existing
83 * file does succeed in both HP-UX and SunOs, but not in Solaris
84 * and in the old Linux semantics.
87 /* [16-Dec-97 Kevin Buhr] For security reasons, we change some symlink
88 * semantics. See the comments in "open_namei" and "do_link" below.
90 * [10-Sep-98 Alan Modra] Another symlink change.
93 /* [Feb-Apr 2000 AV] Complete rewrite. Rules for symlinks:
94 * inside the path - always follow.
95 * in the last component in creation/removal/renaming - never follow.
96 * if LOOKUP_FOLLOW passed - follow.
97 * if the pathname has trailing slashes - follow.
98 * otherwise - don't follow.
99 * (applied in that order).
101 * [Jun 2000 AV] Inconsistent behaviour of open() in case if flags==O_CREAT
102 * restored for 2.4. This is the last surviving part of old 4.2BSD bug.
103 * During the 2.4 we need to fix the userland stuff depending on it -
104 * hopefully we will be able to get rid of that wart in 2.5. So far only
105 * XEmacs seems to be relying on it...
108 * [Sep 2001 AV] Single-semaphore locking scheme (kudos to David Holland)
109 * implemented. Let's see if raised priority of ->s_vfs_rename_mutex gives
110 * any extra contention...
113 /* In order to reduce some races, while at the same time doing additional
114 * checking and hopefully speeding things up, we copy filenames to the
115 * kernel data space before using them..
117 * POSIX.1 2.4: an empty pathname is invalid (ENOENT).
118 * PATH_MAX includes the nul terminator --RR.
120 static char *getname_flags(const char __user
*filename
, int flags
, int *empty
)
122 char *result
= __getname(), *err
;
125 if (unlikely(!result
))
126 return ERR_PTR(-ENOMEM
);
128 len
= strncpy_from_user(result
, filename
, PATH_MAX
);
130 if (unlikely(len
< 0))
133 /* The empty path is special. */
134 if (unlikely(!len
)) {
137 err
= ERR_PTR(-ENOENT
);
138 if (!(flags
& LOOKUP_EMPTY
))
142 err
= ERR_PTR(-ENAMETOOLONG
);
143 if (likely(len
< PATH_MAX
)) {
144 audit_getname(result
);
153 char *getname(const char __user
* filename
)
155 return getname_flags(filename
, 0, NULL
);
158 #ifdef CONFIG_AUDITSYSCALL
159 void putname(const char *name
)
161 if (unlikely(!audit_dummy_context()))
166 EXPORT_SYMBOL(putname
);
169 static int check_acl(struct inode
*inode
, int mask
)
171 #ifdef CONFIG_FS_POSIX_ACL
172 struct posix_acl
*acl
;
174 if (mask
& MAY_NOT_BLOCK
) {
175 acl
= get_cached_acl_rcu(inode
, ACL_TYPE_ACCESS
);
178 /* no ->get_acl() calls in RCU mode... */
179 if (acl
== ACL_NOT_CACHED
)
181 return posix_acl_permission(inode
, acl
, mask
& ~MAY_NOT_BLOCK
);
184 acl
= get_cached_acl(inode
, ACL_TYPE_ACCESS
);
187 * A filesystem can force a ACL callback by just never filling the
188 * ACL cache. But normally you'd fill the cache either at inode
189 * instantiation time, or on the first ->get_acl call.
191 * If the filesystem doesn't have a get_acl() function at all, we'll
192 * just create the negative cache entry.
194 if (acl
== ACL_NOT_CACHED
) {
195 if (inode
->i_op
->get_acl
) {
196 acl
= inode
->i_op
->get_acl(inode
, ACL_TYPE_ACCESS
);
200 set_cached_acl(inode
, ACL_TYPE_ACCESS
, NULL
);
206 int error
= posix_acl_permission(inode
, acl
, mask
);
207 posix_acl_release(acl
);
216 * This does the basic permission checking
218 static int acl_permission_check(struct inode
*inode
, int mask
)
220 unsigned int mode
= inode
->i_mode
;
222 if (likely(uid_eq(current_fsuid(), inode
->i_uid
)))
225 if (IS_POSIXACL(inode
) && (mode
& S_IRWXG
)) {
226 int error
= check_acl(inode
, mask
);
227 if (error
!= -EAGAIN
)
231 if (in_group_p(inode
->i_gid
))
236 * If the DACs are ok we don't need any capability check.
238 if ((mask
& ~mode
& (MAY_READ
| MAY_WRITE
| MAY_EXEC
)) == 0)
244 * generic_permission - check for access rights on a Posix-like filesystem
245 * @inode: inode to check access rights for
246 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC, ...)
248 * Used to check for read/write/execute permissions on a file.
249 * We use "fsuid" for this, letting us set arbitrary permissions
250 * for filesystem access without changing the "normal" uids which
251 * are used for other things.
253 * generic_permission is rcu-walk aware. It returns -ECHILD in case an rcu-walk
254 * request cannot be satisfied (eg. requires blocking or too much complexity).
255 * It would then be called again in ref-walk mode.
257 int generic_permission(struct inode
*inode
, int mask
)
262 * Do the basic permission checks.
264 ret
= acl_permission_check(inode
, mask
);
268 if (S_ISDIR(inode
->i_mode
)) {
269 /* DACs are overridable for directories */
270 if (inode_capable(inode
, CAP_DAC_OVERRIDE
))
272 if (!(mask
& MAY_WRITE
))
273 if (inode_capable(inode
, CAP_DAC_READ_SEARCH
))
278 * Read/write DACs are always overridable.
279 * Executable DACs are overridable when there is
280 * at least one exec bit set.
282 if (!(mask
& MAY_EXEC
) || (inode
->i_mode
& S_IXUGO
))
283 if (inode_capable(inode
, CAP_DAC_OVERRIDE
))
287 * Searching includes executable on directories, else just read.
289 mask
&= MAY_READ
| MAY_WRITE
| MAY_EXEC
;
290 if (mask
== MAY_READ
)
291 if (inode_capable(inode
, CAP_DAC_READ_SEARCH
))
298 * We _really_ want to just do "generic_permission()" without
299 * even looking at the inode->i_op values. So we keep a cache
300 * flag in inode->i_opflags, that says "this has not special
301 * permission function, use the fast case".
303 static inline int do_inode_permission(struct inode
*inode
, int mask
)
305 if (unlikely(!(inode
->i_opflags
& IOP_FASTPERM
))) {
306 if (likely(inode
->i_op
->permission
))
307 return inode
->i_op
->permission(inode
, mask
);
309 /* This gets set once for the inode lifetime */
310 spin_lock(&inode
->i_lock
);
311 inode
->i_opflags
|= IOP_FASTPERM
;
312 spin_unlock(&inode
->i_lock
);
314 return generic_permission(inode
, mask
);
318 * inode_permission - check for access rights to a given inode
319 * @inode: inode to check permission on
320 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC, ...)
322 * Used to check for read/write/execute permissions on an inode.
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 * When checking for MAY_APPEND, MAY_WRITE must also be set in @mask.
329 int inode_permission(struct inode
*inode
, int mask
)
333 if (unlikely(mask
& MAY_WRITE
)) {
334 umode_t mode
= inode
->i_mode
;
337 * Nobody gets write access to a read-only fs.
339 if (IS_RDONLY(inode
) &&
340 (S_ISREG(mode
) || S_ISDIR(mode
) || S_ISLNK(mode
)))
344 * Nobody gets write access to an immutable file.
346 if (IS_IMMUTABLE(inode
))
350 retval
= do_inode_permission(inode
, mask
);
354 retval
= devcgroup_inode_permission(inode
, mask
);
358 return security_inode_permission(inode
, mask
);
362 * path_get - get a reference to a path
363 * @path: path to get the reference to
365 * Given a path increment the reference count to the dentry and the vfsmount.
367 void path_get(struct path
*path
)
372 EXPORT_SYMBOL(path_get
);
375 * path_put - put a reference to a path
376 * @path: path to put the reference to
378 * Given a path decrement the reference count to the dentry and the vfsmount.
380 void path_put(struct path
*path
)
385 EXPORT_SYMBOL(path_put
);
388 * Path walking has 2 modes, rcu-walk and ref-walk (see
389 * Documentation/filesystems/path-lookup.txt). In situations when we can't
390 * continue in RCU mode, we attempt to drop out of rcu-walk mode and grab
391 * normal reference counts on dentries and vfsmounts to transition to rcu-walk
392 * mode. Refcounts are grabbed at the last known good point before rcu-walk
393 * got stuck, so ref-walk may continue from there. If this is not successful
394 * (eg. a seqcount has changed), then failure is returned and it's up to caller
395 * to restart the path walk from the beginning in ref-walk mode.
399 * unlazy_walk - try to switch to ref-walk mode.
400 * @nd: nameidata pathwalk data
401 * @dentry: child of nd->path.dentry or NULL
402 * Returns: 0 on success, -ECHILD on failure
404 * unlazy_walk attempts to legitimize the current nd->path, nd->root and dentry
405 * for ref-walk mode. @dentry must be a path found by a do_lookup call on
406 * @nd or NULL. Must be called from rcu-walk context.
408 static int unlazy_walk(struct nameidata
*nd
, struct dentry
*dentry
)
410 struct fs_struct
*fs
= current
->fs
;
411 struct dentry
*parent
= nd
->path
.dentry
;
414 BUG_ON(!(nd
->flags
& LOOKUP_RCU
));
415 if (nd
->root
.mnt
&& !(nd
->flags
& LOOKUP_ROOT
)) {
417 spin_lock(&fs
->lock
);
418 if (nd
->root
.mnt
!= fs
->root
.mnt
||
419 nd
->root
.dentry
!= fs
->root
.dentry
)
422 spin_lock(&parent
->d_lock
);
424 if (!__d_rcu_to_refcount(parent
, nd
->seq
))
426 BUG_ON(nd
->inode
!= parent
->d_inode
);
428 if (dentry
->d_parent
!= parent
)
430 spin_lock_nested(&dentry
->d_lock
, DENTRY_D_LOCK_NESTED
);
431 if (!__d_rcu_to_refcount(dentry
, nd
->seq
))
434 * If the sequence check on the child dentry passed, then
435 * the child has not been removed from its parent. This
436 * means the parent dentry must be valid and able to take
437 * a reference at this point.
439 BUG_ON(!IS_ROOT(dentry
) && dentry
->d_parent
!= parent
);
440 BUG_ON(!parent
->d_count
);
442 spin_unlock(&dentry
->d_lock
);
444 spin_unlock(&parent
->d_lock
);
447 spin_unlock(&fs
->lock
);
449 mntget(nd
->path
.mnt
);
452 br_read_unlock(vfsmount_lock
);
453 nd
->flags
&= ~LOOKUP_RCU
;
457 spin_unlock(&dentry
->d_lock
);
459 spin_unlock(&parent
->d_lock
);
462 spin_unlock(&fs
->lock
);
467 * release_open_intent - free up open intent resources
468 * @nd: pointer to nameidata
470 void release_open_intent(struct nameidata
*nd
)
472 struct file
*file
= nd
->intent
.open
.file
;
474 if (file
&& !IS_ERR(file
)) {
475 if (file
->f_path
.dentry
== NULL
)
482 static inline int d_revalidate(struct dentry
*dentry
, struct nameidata
*nd
)
484 return dentry
->d_op
->d_revalidate(dentry
, nd
);
488 * complete_walk - successful completion of path walk
489 * @nd: pointer nameidata
491 * If we had been in RCU mode, drop out of it and legitimize nd->path.
492 * Revalidate the final result, unless we'd already done that during
493 * the path walk or the filesystem doesn't ask for it. Return 0 on
494 * success, -error on failure. In case of failure caller does not
495 * need to drop nd->path.
497 static int complete_walk(struct nameidata
*nd
)
499 struct dentry
*dentry
= nd
->path
.dentry
;
502 if (nd
->flags
& LOOKUP_RCU
) {
503 nd
->flags
&= ~LOOKUP_RCU
;
504 if (!(nd
->flags
& LOOKUP_ROOT
))
506 spin_lock(&dentry
->d_lock
);
507 if (unlikely(!__d_rcu_to_refcount(dentry
, nd
->seq
))) {
508 spin_unlock(&dentry
->d_lock
);
510 br_read_unlock(vfsmount_lock
);
513 BUG_ON(nd
->inode
!= dentry
->d_inode
);
514 spin_unlock(&dentry
->d_lock
);
515 mntget(nd
->path
.mnt
);
517 br_read_unlock(vfsmount_lock
);
520 if (likely(!(nd
->flags
& LOOKUP_JUMPED
)))
523 if (likely(!(dentry
->d_flags
& DCACHE_OP_REVALIDATE
)))
526 if (likely(!(dentry
->d_sb
->s_type
->fs_flags
& FS_REVAL_DOT
)))
529 /* Note: we do not d_invalidate() */
530 status
= d_revalidate(dentry
, nd
);
541 static __always_inline
void set_root(struct nameidata
*nd
)
544 get_fs_root(current
->fs
, &nd
->root
);
547 static int link_path_walk(const char *, struct nameidata
*);
549 static __always_inline
void set_root_rcu(struct nameidata
*nd
)
552 struct fs_struct
*fs
= current
->fs
;
556 seq
= read_seqcount_begin(&fs
->seq
);
558 nd
->seq
= __read_seqcount_begin(&nd
->root
.dentry
->d_seq
);
559 } while (read_seqcount_retry(&fs
->seq
, seq
));
563 static __always_inline
int __vfs_follow_link(struct nameidata
*nd
, const char *link
)
575 nd
->flags
|= LOOKUP_JUMPED
;
577 nd
->inode
= nd
->path
.dentry
->d_inode
;
579 ret
= link_path_walk(link
, nd
);
583 return PTR_ERR(link
);
586 static void path_put_conditional(struct path
*path
, struct nameidata
*nd
)
589 if (path
->mnt
!= nd
->path
.mnt
)
593 static inline void path_to_nameidata(const struct path
*path
,
594 struct nameidata
*nd
)
596 if (!(nd
->flags
& LOOKUP_RCU
)) {
597 dput(nd
->path
.dentry
);
598 if (nd
->path
.mnt
!= path
->mnt
)
599 mntput(nd
->path
.mnt
);
601 nd
->path
.mnt
= path
->mnt
;
602 nd
->path
.dentry
= path
->dentry
;
605 static inline void put_link(struct nameidata
*nd
, struct path
*link
, void *cookie
)
607 struct inode
*inode
= link
->dentry
->d_inode
;
608 if (!IS_ERR(cookie
) && inode
->i_op
->put_link
)
609 inode
->i_op
->put_link(link
->dentry
, nd
, cookie
);
613 static __always_inline
int
614 follow_link(struct path
*link
, struct nameidata
*nd
, void **p
)
617 struct dentry
*dentry
= link
->dentry
;
619 BUG_ON(nd
->flags
& LOOKUP_RCU
);
621 if (link
->mnt
== nd
->path
.mnt
)
624 if (unlikely(current
->total_link_count
>= 40)) {
625 *p
= ERR_PTR(-ELOOP
); /* no ->put_link(), please */
630 current
->total_link_count
++;
633 nd_set_link(nd
, NULL
);
635 error
= security_inode_follow_link(link
->dentry
, nd
);
637 *p
= ERR_PTR(error
); /* no ->put_link(), please */
642 nd
->last_type
= LAST_BIND
;
643 *p
= dentry
->d_inode
->i_op
->follow_link(dentry
, nd
);
646 char *s
= nd_get_link(nd
);
649 error
= __vfs_follow_link(nd
, s
);
650 else if (nd
->last_type
== LAST_BIND
) {
651 nd
->flags
|= LOOKUP_JUMPED
;
652 nd
->inode
= nd
->path
.dentry
->d_inode
;
653 if (nd
->inode
->i_op
->follow_link
) {
654 /* stepped on a _really_ weird one */
663 static int follow_up_rcu(struct path
*path
)
665 struct mount
*mnt
= real_mount(path
->mnt
);
666 struct mount
*parent
;
667 struct dentry
*mountpoint
;
669 parent
= mnt
->mnt_parent
;
670 if (&parent
->mnt
== path
->mnt
)
672 mountpoint
= mnt
->mnt_mountpoint
;
673 path
->dentry
= mountpoint
;
674 path
->mnt
= &parent
->mnt
;
678 int follow_up(struct path
*path
)
680 struct mount
*mnt
= real_mount(path
->mnt
);
681 struct mount
*parent
;
682 struct dentry
*mountpoint
;
684 br_read_lock(vfsmount_lock
);
685 parent
= mnt
->mnt_parent
;
686 if (&parent
->mnt
== path
->mnt
) {
687 br_read_unlock(vfsmount_lock
);
690 mntget(&parent
->mnt
);
691 mountpoint
= dget(mnt
->mnt_mountpoint
);
692 br_read_unlock(vfsmount_lock
);
694 path
->dentry
= mountpoint
;
696 path
->mnt
= &parent
->mnt
;
701 * Perform an automount
702 * - return -EISDIR to tell follow_managed() to stop and return the path we
705 static int follow_automount(struct path
*path
, unsigned flags
,
708 struct vfsmount
*mnt
;
711 if (!path
->dentry
->d_op
|| !path
->dentry
->d_op
->d_automount
)
714 /* We don't want to mount if someone's just doing a stat -
715 * unless they're stat'ing a directory and appended a '/' to
718 * We do, however, want to mount if someone wants to open or
719 * create a file of any type under the mountpoint, wants to
720 * traverse through the mountpoint or wants to open the
721 * mounted directory. Also, autofs may mark negative dentries
722 * as being automount points. These will need the attentions
723 * of the daemon to instantiate them before they can be used.
725 if (!(flags
& (LOOKUP_PARENT
| LOOKUP_DIRECTORY
|
726 LOOKUP_OPEN
| LOOKUP_CREATE
| LOOKUP_AUTOMOUNT
)) &&
727 path
->dentry
->d_inode
)
730 current
->total_link_count
++;
731 if (current
->total_link_count
>= 40)
734 mnt
= path
->dentry
->d_op
->d_automount(path
);
737 * The filesystem is allowed to return -EISDIR here to indicate
738 * it doesn't want to automount. For instance, autofs would do
739 * this so that its userspace daemon can mount on this dentry.
741 * However, we can only permit this if it's a terminal point in
742 * the path being looked up; if it wasn't then the remainder of
743 * the path is inaccessible and we should say so.
745 if (PTR_ERR(mnt
) == -EISDIR
&& (flags
& LOOKUP_PARENT
))
750 if (!mnt
) /* mount collision */
754 /* lock_mount() may release path->mnt on error */
758 err
= finish_automount(mnt
, path
);
762 /* Someone else made a mount here whilst we were busy */
767 path
->dentry
= dget(mnt
->mnt_root
);
776 * Handle a dentry that is managed in some way.
777 * - Flagged for transit management (autofs)
778 * - Flagged as mountpoint
779 * - Flagged as automount point
781 * This may only be called in refwalk mode.
783 * Serialization is taken care of in namespace.c
785 static int follow_managed(struct path
*path
, unsigned flags
)
787 struct vfsmount
*mnt
= path
->mnt
; /* held by caller, must be left alone */
789 bool need_mntput
= false;
792 /* Given that we're not holding a lock here, we retain the value in a
793 * local variable for each dentry as we look at it so that we don't see
794 * the components of that value change under us */
795 while (managed
= ACCESS_ONCE(path
->dentry
->d_flags
),
796 managed
&= DCACHE_MANAGED_DENTRY
,
797 unlikely(managed
!= 0)) {
798 /* Allow the filesystem to manage the transit without i_mutex
800 if (managed
& DCACHE_MANAGE_TRANSIT
) {
801 BUG_ON(!path
->dentry
->d_op
);
802 BUG_ON(!path
->dentry
->d_op
->d_manage
);
803 ret
= path
->dentry
->d_op
->d_manage(path
->dentry
, false);
808 /* Transit to a mounted filesystem. */
809 if (managed
& DCACHE_MOUNTED
) {
810 struct vfsmount
*mounted
= lookup_mnt(path
);
816 path
->dentry
= dget(mounted
->mnt_root
);
821 /* Something is mounted on this dentry in another
822 * namespace and/or whatever was mounted there in this
823 * namespace got unmounted before we managed to get the
827 /* Handle an automount point */
828 if (managed
& DCACHE_NEED_AUTOMOUNT
) {
829 ret
= follow_automount(path
, flags
, &need_mntput
);
835 /* We didn't change the current path point */
839 if (need_mntput
&& path
->mnt
== mnt
)
843 return ret
< 0 ? ret
: need_mntput
;
846 int follow_down_one(struct path
*path
)
848 struct vfsmount
*mounted
;
850 mounted
= lookup_mnt(path
);
855 path
->dentry
= dget(mounted
->mnt_root
);
861 static inline bool managed_dentry_might_block(struct dentry
*dentry
)
863 return (dentry
->d_flags
& DCACHE_MANAGE_TRANSIT
&&
864 dentry
->d_op
->d_manage(dentry
, true) < 0);
868 * Try to skip to top of mountpoint pile in rcuwalk mode. Fail if
869 * we meet a managed dentry that would need blocking.
871 static bool __follow_mount_rcu(struct nameidata
*nd
, struct path
*path
,
872 struct inode
**inode
)
875 struct mount
*mounted
;
877 * Don't forget we might have a non-mountpoint managed dentry
878 * that wants to block transit.
880 if (unlikely(managed_dentry_might_block(path
->dentry
)))
883 if (!d_mountpoint(path
->dentry
))
886 mounted
= __lookup_mnt(path
->mnt
, path
->dentry
, 1);
889 path
->mnt
= &mounted
->mnt
;
890 path
->dentry
= mounted
->mnt
.mnt_root
;
891 nd
->flags
|= LOOKUP_JUMPED
;
892 nd
->seq
= read_seqcount_begin(&path
->dentry
->d_seq
);
894 * Update the inode too. We don't need to re-check the
895 * dentry sequence number here after this d_inode read,
896 * because a mount-point is always pinned.
898 *inode
= path
->dentry
->d_inode
;
903 static void follow_mount_rcu(struct nameidata
*nd
)
905 while (d_mountpoint(nd
->path
.dentry
)) {
906 struct mount
*mounted
;
907 mounted
= __lookup_mnt(nd
->path
.mnt
, nd
->path
.dentry
, 1);
910 nd
->path
.mnt
= &mounted
->mnt
;
911 nd
->path
.dentry
= mounted
->mnt
.mnt_root
;
912 nd
->seq
= read_seqcount_begin(&nd
->path
.dentry
->d_seq
);
916 static int follow_dotdot_rcu(struct nameidata
*nd
)
921 if (nd
->path
.dentry
== nd
->root
.dentry
&&
922 nd
->path
.mnt
== nd
->root
.mnt
) {
925 if (nd
->path
.dentry
!= nd
->path
.mnt
->mnt_root
) {
926 struct dentry
*old
= nd
->path
.dentry
;
927 struct dentry
*parent
= old
->d_parent
;
930 seq
= read_seqcount_begin(&parent
->d_seq
);
931 if (read_seqcount_retry(&old
->d_seq
, nd
->seq
))
933 nd
->path
.dentry
= parent
;
937 if (!follow_up_rcu(&nd
->path
))
939 nd
->seq
= read_seqcount_begin(&nd
->path
.dentry
->d_seq
);
941 follow_mount_rcu(nd
);
942 nd
->inode
= nd
->path
.dentry
->d_inode
;
946 nd
->flags
&= ~LOOKUP_RCU
;
947 if (!(nd
->flags
& LOOKUP_ROOT
))
950 br_read_unlock(vfsmount_lock
);
955 * Follow down to the covering mount currently visible to userspace. At each
956 * point, the filesystem owning that dentry may be queried as to whether the
957 * caller is permitted to proceed or not.
959 int follow_down(struct path
*path
)
964 while (managed
= ACCESS_ONCE(path
->dentry
->d_flags
),
965 unlikely(managed
& DCACHE_MANAGED_DENTRY
)) {
966 /* Allow the filesystem to manage the transit without i_mutex
969 * We indicate to the filesystem if someone is trying to mount
970 * something here. This gives autofs the chance to deny anyone
971 * other than its daemon the right to mount on its
974 * The filesystem may sleep at this point.
976 if (managed
& DCACHE_MANAGE_TRANSIT
) {
977 BUG_ON(!path
->dentry
->d_op
);
978 BUG_ON(!path
->dentry
->d_op
->d_manage
);
979 ret
= path
->dentry
->d_op
->d_manage(
980 path
->dentry
, false);
982 return ret
== -EISDIR
? 0 : ret
;
985 /* Transit to a mounted filesystem. */
986 if (managed
& DCACHE_MOUNTED
) {
987 struct vfsmount
*mounted
= lookup_mnt(path
);
993 path
->dentry
= dget(mounted
->mnt_root
);
997 /* Don't handle automount points here */
1004 * Skip to top of mountpoint pile in refwalk mode for follow_dotdot()
1006 static void follow_mount(struct path
*path
)
1008 while (d_mountpoint(path
->dentry
)) {
1009 struct vfsmount
*mounted
= lookup_mnt(path
);
1014 path
->mnt
= mounted
;
1015 path
->dentry
= dget(mounted
->mnt_root
);
1019 static void follow_dotdot(struct nameidata
*nd
)
1024 struct dentry
*old
= nd
->path
.dentry
;
1026 if (nd
->path
.dentry
== nd
->root
.dentry
&&
1027 nd
->path
.mnt
== nd
->root
.mnt
) {
1030 if (nd
->path
.dentry
!= nd
->path
.mnt
->mnt_root
) {
1031 /* rare case of legitimate dget_parent()... */
1032 nd
->path
.dentry
= dget_parent(nd
->path
.dentry
);
1036 if (!follow_up(&nd
->path
))
1039 follow_mount(&nd
->path
);
1040 nd
->inode
= nd
->path
.dentry
->d_inode
;
1044 * This looks up the name in dcache, possibly revalidates the old dentry and
1045 * allocates a new one if not found or not valid. In the need_lookup argument
1046 * returns whether i_op->lookup is necessary.
1048 * dir->d_inode->i_mutex must be held
1050 static struct dentry
*lookup_dcache(struct qstr
*name
, struct dentry
*dir
,
1051 struct nameidata
*nd
, bool *need_lookup
)
1053 struct dentry
*dentry
;
1056 *need_lookup
= false;
1057 dentry
= d_lookup(dir
, name
);
1059 if (d_need_lookup(dentry
)) {
1060 *need_lookup
= true;
1061 } else if (dentry
->d_flags
& DCACHE_OP_REVALIDATE
) {
1062 error
= d_revalidate(dentry
, nd
);
1063 if (unlikely(error
<= 0)) {
1066 return ERR_PTR(error
);
1067 } else if (!d_invalidate(dentry
)) {
1076 dentry
= d_alloc(dir
, name
);
1077 if (unlikely(!dentry
))
1078 return ERR_PTR(-ENOMEM
);
1080 *need_lookup
= true;
1086 * Call i_op->lookup on the dentry. The dentry must be negative but may be
1087 * hashed if it was pouplated with DCACHE_NEED_LOOKUP.
1089 * dir->d_inode->i_mutex must be held
1091 static struct dentry
*lookup_real(struct inode
*dir
, struct dentry
*dentry
,
1092 struct nameidata
*nd
)
1096 /* Don't create child dentry for a dead directory. */
1097 if (unlikely(IS_DEADDIR(dir
))) {
1099 return ERR_PTR(-ENOENT
);
1102 old
= dir
->i_op
->lookup(dir
, dentry
, nd
);
1103 if (unlikely(old
)) {
1110 static struct dentry
*__lookup_hash(struct qstr
*name
,
1111 struct dentry
*base
, struct nameidata
*nd
)
1114 struct dentry
*dentry
;
1116 dentry
= lookup_dcache(name
, base
, nd
, &need_lookup
);
1120 return lookup_real(base
->d_inode
, dentry
, nd
);
1124 * It's more convoluted than I'd like it to be, but... it's still fairly
1125 * small and for now I'd prefer to have fast path as straight as possible.
1126 * It _is_ time-critical.
1128 static int do_lookup(struct nameidata
*nd
, struct qstr
*name
,
1129 struct path
*path
, struct inode
**inode
)
1131 struct vfsmount
*mnt
= nd
->path
.mnt
;
1132 struct dentry
*dentry
, *parent
= nd
->path
.dentry
;
1138 * Rename seqlock is not required here because in the off chance
1139 * of a false negative due to a concurrent rename, we're going to
1140 * do the non-racy lookup, below.
1142 if (nd
->flags
& LOOKUP_RCU
) {
1144 dentry
= __d_lookup_rcu(parent
, name
, &seq
, nd
->inode
);
1149 * This sequence count validates that the inode matches
1150 * the dentry name information from lookup.
1152 *inode
= dentry
->d_inode
;
1153 if (read_seqcount_retry(&dentry
->d_seq
, seq
))
1157 * This sequence count validates that the parent had no
1158 * changes while we did the lookup of the dentry above.
1160 * The memory barrier in read_seqcount_begin of child is
1161 * enough, we can use __read_seqcount_retry here.
1163 if (__read_seqcount_retry(&parent
->d_seq
, nd
->seq
))
1167 if (unlikely(d_need_lookup(dentry
)))
1169 if (unlikely(dentry
->d_flags
& DCACHE_OP_REVALIDATE
)) {
1170 status
= d_revalidate(dentry
, nd
);
1171 if (unlikely(status
<= 0)) {
1172 if (status
!= -ECHILD
)
1178 path
->dentry
= dentry
;
1179 if (unlikely(!__follow_mount_rcu(nd
, path
, inode
)))
1181 if (unlikely(path
->dentry
->d_flags
& DCACHE_NEED_AUTOMOUNT
))
1185 if (unlazy_walk(nd
, dentry
))
1188 dentry
= __d_lookup(parent
, name
);
1191 if (unlikely(!dentry
))
1194 if (unlikely(d_need_lookup(dentry
))) {
1199 if (unlikely(dentry
->d_flags
& DCACHE_OP_REVALIDATE
) && need_reval
)
1200 status
= d_revalidate(dentry
, nd
);
1201 if (unlikely(status
<= 0)) {
1206 if (!d_invalidate(dentry
)) {
1213 path
->dentry
= dentry
;
1214 err
= follow_managed(path
, nd
->flags
);
1215 if (unlikely(err
< 0)) {
1216 path_put_conditional(path
, nd
);
1220 nd
->flags
|= LOOKUP_JUMPED
;
1221 *inode
= path
->dentry
->d_inode
;
1225 BUG_ON(nd
->inode
!= parent
->d_inode
);
1227 mutex_lock(&parent
->d_inode
->i_mutex
);
1228 dentry
= __lookup_hash(name
, parent
, nd
);
1229 mutex_unlock(&parent
->d_inode
->i_mutex
);
1231 return PTR_ERR(dentry
);
1235 static inline int may_lookup(struct nameidata
*nd
)
1237 if (nd
->flags
& LOOKUP_RCU
) {
1238 int err
= inode_permission(nd
->inode
, MAY_EXEC
|MAY_NOT_BLOCK
);
1241 if (unlazy_walk(nd
, NULL
))
1244 return inode_permission(nd
->inode
, MAY_EXEC
);
1247 static inline int handle_dots(struct nameidata
*nd
, int type
)
1249 if (type
== LAST_DOTDOT
) {
1250 if (nd
->flags
& LOOKUP_RCU
) {
1251 if (follow_dotdot_rcu(nd
))
1259 static void terminate_walk(struct nameidata
*nd
)
1261 if (!(nd
->flags
& LOOKUP_RCU
)) {
1262 path_put(&nd
->path
);
1264 nd
->flags
&= ~LOOKUP_RCU
;
1265 if (!(nd
->flags
& LOOKUP_ROOT
))
1266 nd
->root
.mnt
= NULL
;
1268 br_read_unlock(vfsmount_lock
);
1273 * Do we need to follow links? We _really_ want to be able
1274 * to do this check without having to look at inode->i_op,
1275 * so we keep a cache of "no, this doesn't need follow_link"
1276 * for the common case.
1278 static inline int should_follow_link(struct inode
*inode
, int follow
)
1280 if (unlikely(!(inode
->i_opflags
& IOP_NOFOLLOW
))) {
1281 if (likely(inode
->i_op
->follow_link
))
1284 /* This gets set once for the inode lifetime */
1285 spin_lock(&inode
->i_lock
);
1286 inode
->i_opflags
|= IOP_NOFOLLOW
;
1287 spin_unlock(&inode
->i_lock
);
1292 static inline int walk_component(struct nameidata
*nd
, struct path
*path
,
1293 struct qstr
*name
, int type
, int follow
)
1295 struct inode
*inode
;
1298 * "." and ".." are special - ".." especially so because it has
1299 * to be able to know about the current root directory and
1300 * parent relationships.
1302 if (unlikely(type
!= LAST_NORM
))
1303 return handle_dots(nd
, type
);
1304 err
= do_lookup(nd
, name
, path
, &inode
);
1305 if (unlikely(err
)) {
1310 path_to_nameidata(path
, nd
);
1314 if (should_follow_link(inode
, follow
)) {
1315 if (nd
->flags
& LOOKUP_RCU
) {
1316 if (unlikely(unlazy_walk(nd
, path
->dentry
))) {
1321 BUG_ON(inode
!= path
->dentry
->d_inode
);
1324 path_to_nameidata(path
, nd
);
1330 * This limits recursive symlink follows to 8, while
1331 * limiting consecutive symlinks to 40.
1333 * Without that kind of total limit, nasty chains of consecutive
1334 * symlinks can cause almost arbitrarily long lookups.
1336 static inline int nested_symlink(struct path
*path
, struct nameidata
*nd
)
1340 if (unlikely(current
->link_count
>= MAX_NESTED_LINKS
)) {
1341 path_put_conditional(path
, nd
);
1342 path_put(&nd
->path
);
1345 BUG_ON(nd
->depth
>= MAX_NESTED_LINKS
);
1348 current
->link_count
++;
1351 struct path link
= *path
;
1354 res
= follow_link(&link
, nd
, &cookie
);
1356 res
= walk_component(nd
, path
, &nd
->last
,
1357 nd
->last_type
, LOOKUP_FOLLOW
);
1358 put_link(nd
, &link
, cookie
);
1361 current
->link_count
--;
1367 * We really don't want to look at inode->i_op->lookup
1368 * when we don't have to. So we keep a cache bit in
1369 * the inode ->i_opflags field that says "yes, we can
1370 * do lookup on this inode".
1372 static inline int can_lookup(struct inode
*inode
)
1374 if (likely(inode
->i_opflags
& IOP_LOOKUP
))
1376 if (likely(!inode
->i_op
->lookup
))
1379 /* We do this once for the lifetime of the inode */
1380 spin_lock(&inode
->i_lock
);
1381 inode
->i_opflags
|= IOP_LOOKUP
;
1382 spin_unlock(&inode
->i_lock
);
1387 * We can do the critical dentry name comparison and hashing
1388 * operations one word at a time, but we are limited to:
1390 * - Architectures with fast unaligned word accesses. We could
1391 * do a "get_unaligned()" if this helps and is sufficiently
1394 * - Little-endian machines (so that we can generate the mask
1395 * of low bytes efficiently). Again, we *could* do a byte
1396 * swapping load on big-endian architectures if that is not
1397 * expensive enough to make the optimization worthless.
1399 * - non-CONFIG_DEBUG_PAGEALLOC configurations (so that we
1400 * do not trap on the (extremely unlikely) case of a page
1401 * crossing operation.
1403 * - Furthermore, we need an efficient 64-bit compile for the
1404 * 64-bit case in order to generate the "number of bytes in
1405 * the final mask". Again, that could be replaced with a
1406 * efficient population count instruction or similar.
1408 #ifdef CONFIG_DCACHE_WORD_ACCESS
1410 #include <asm/word-at-a-time.h>
1414 static inline unsigned int fold_hash(unsigned long hash
)
1416 hash
+= hash
>> (8*sizeof(int));
1420 #else /* 32-bit case */
1422 #define fold_hash(x) (x)
1426 unsigned int full_name_hash(const unsigned char *name
, unsigned int len
)
1428 unsigned long a
, mask
;
1429 unsigned long hash
= 0;
1432 a
= load_unaligned_zeropad(name
);
1433 if (len
< sizeof(unsigned long))
1437 name
+= sizeof(unsigned long);
1438 len
-= sizeof(unsigned long);
1442 mask
= ~(~0ul << len
*8);
1445 return fold_hash(hash
);
1447 EXPORT_SYMBOL(full_name_hash
);
1450 * Calculate the length and hash of the path component, and
1451 * return the length of the component;
1453 static inline unsigned long hash_name(const char *name
, unsigned int *hashp
)
1455 unsigned long a
, b
, adata
, bdata
, mask
, hash
, len
;
1456 const struct word_at_a_time constants
= WORD_AT_A_TIME_CONSTANTS
;
1459 len
= -sizeof(unsigned long);
1461 hash
= (hash
+ a
) * 9;
1462 len
+= sizeof(unsigned long);
1463 a
= load_unaligned_zeropad(name
+len
);
1464 b
= a
^ REPEAT_BYTE('/');
1465 } while (!(has_zero(a
, &adata
, &constants
) | has_zero(b
, &bdata
, &constants
)));
1467 adata
= prep_zero_mask(a
, adata
, &constants
);
1468 bdata
= prep_zero_mask(b
, bdata
, &constants
);
1470 mask
= create_zero_mask(adata
| bdata
);
1472 hash
+= a
& zero_bytemask(mask
);
1473 *hashp
= fold_hash(hash
);
1475 return len
+ find_zero(mask
);
1480 unsigned int full_name_hash(const unsigned char *name
, unsigned int len
)
1482 unsigned long hash
= init_name_hash();
1484 hash
= partial_name_hash(*name
++, hash
);
1485 return end_name_hash(hash
);
1487 EXPORT_SYMBOL(full_name_hash
);
1490 * We know there's a real path component here of at least
1493 static inline unsigned long hash_name(const char *name
, unsigned int *hashp
)
1495 unsigned long hash
= init_name_hash();
1496 unsigned long len
= 0, c
;
1498 c
= (unsigned char)*name
;
1501 hash
= partial_name_hash(c
, hash
);
1502 c
= (unsigned char)name
[len
];
1503 } while (c
&& c
!= '/');
1504 *hashp
= end_name_hash(hash
);
1512 * This is the basic name resolution function, turning a pathname into
1513 * the final dentry. We expect 'base' to be positive and a directory.
1515 * Returns 0 and nd will have valid dentry and mnt on success.
1516 * Returns error and drops reference to input namei data on failure.
1518 static int link_path_walk(const char *name
, struct nameidata
*nd
)
1528 /* At this point we know we have a real path component. */
1534 err
= may_lookup(nd
);
1538 len
= hash_name(name
, &this.hash
);
1543 if (name
[0] == '.') switch (len
) {
1545 if (name
[1] == '.') {
1547 nd
->flags
|= LOOKUP_JUMPED
;
1553 if (likely(type
== LAST_NORM
)) {
1554 struct dentry
*parent
= nd
->path
.dentry
;
1555 nd
->flags
&= ~LOOKUP_JUMPED
;
1556 if (unlikely(parent
->d_flags
& DCACHE_OP_HASH
)) {
1557 err
= parent
->d_op
->d_hash(parent
, nd
->inode
,
1565 goto last_component
;
1567 * If it wasn't NUL, we know it was '/'. Skip that
1568 * slash, and continue until no more slashes.
1572 } while (unlikely(name
[len
] == '/'));
1574 goto last_component
;
1577 err
= walk_component(nd
, &next
, &this, type
, LOOKUP_FOLLOW
);
1582 err
= nested_symlink(&next
, nd
);
1586 if (can_lookup(nd
->inode
))
1590 /* here ends the main loop */
1594 nd
->last_type
= type
;
1601 static int path_init(int dfd
, const char *name
, unsigned int flags
,
1602 struct nameidata
*nd
, struct file
**fp
)
1608 nd
->last_type
= LAST_ROOT
; /* if there are only slashes... */
1609 nd
->flags
= flags
| LOOKUP_JUMPED
;
1611 if (flags
& LOOKUP_ROOT
) {
1612 struct inode
*inode
= nd
->root
.dentry
->d_inode
;
1614 if (!inode
->i_op
->lookup
)
1616 retval
= inode_permission(inode
, MAY_EXEC
);
1620 nd
->path
= nd
->root
;
1622 if (flags
& LOOKUP_RCU
) {
1623 br_read_lock(vfsmount_lock
);
1625 nd
->seq
= __read_seqcount_begin(&nd
->path
.dentry
->d_seq
);
1627 path_get(&nd
->path
);
1632 nd
->root
.mnt
= NULL
;
1635 if (flags
& LOOKUP_RCU
) {
1636 br_read_lock(vfsmount_lock
);
1641 path_get(&nd
->root
);
1643 nd
->path
= nd
->root
;
1644 } else if (dfd
== AT_FDCWD
) {
1645 if (flags
& LOOKUP_RCU
) {
1646 struct fs_struct
*fs
= current
->fs
;
1649 br_read_lock(vfsmount_lock
);
1653 seq
= read_seqcount_begin(&fs
->seq
);
1655 nd
->seq
= __read_seqcount_begin(&nd
->path
.dentry
->d_seq
);
1656 } while (read_seqcount_retry(&fs
->seq
, seq
));
1658 get_fs_pwd(current
->fs
, &nd
->path
);
1661 struct dentry
*dentry
;
1663 file
= fget_raw_light(dfd
, &fput_needed
);
1668 dentry
= file
->f_path
.dentry
;
1672 if (!S_ISDIR(dentry
->d_inode
->i_mode
))
1675 retval
= inode_permission(dentry
->d_inode
, MAY_EXEC
);
1680 nd
->path
= file
->f_path
;
1681 if (flags
& LOOKUP_RCU
) {
1684 nd
->seq
= __read_seqcount_begin(&nd
->path
.dentry
->d_seq
);
1685 br_read_lock(vfsmount_lock
);
1688 path_get(&file
->f_path
);
1689 fput_light(file
, fput_needed
);
1693 nd
->inode
= nd
->path
.dentry
->d_inode
;
1697 fput_light(file
, fput_needed
);
1702 static inline int lookup_last(struct nameidata
*nd
, struct path
*path
)
1704 if (nd
->last_type
== LAST_NORM
&& nd
->last
.name
[nd
->last
.len
])
1705 nd
->flags
|= LOOKUP_FOLLOW
| LOOKUP_DIRECTORY
;
1707 nd
->flags
&= ~LOOKUP_PARENT
;
1708 return walk_component(nd
, path
, &nd
->last
, nd
->last_type
,
1709 nd
->flags
& LOOKUP_FOLLOW
);
1712 /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
1713 static int path_lookupat(int dfd
, const char *name
,
1714 unsigned int flags
, struct nameidata
*nd
)
1716 struct file
*base
= NULL
;
1721 * Path walking is largely split up into 2 different synchronisation
1722 * schemes, rcu-walk and ref-walk (explained in
1723 * Documentation/filesystems/path-lookup.txt). These share much of the
1724 * path walk code, but some things particularly setup, cleanup, and
1725 * following mounts are sufficiently divergent that functions are
1726 * duplicated. Typically there is a function foo(), and its RCU
1727 * analogue, foo_rcu().
1729 * -ECHILD is the error number of choice (just to avoid clashes) that
1730 * is returned if some aspect of an rcu-walk fails. Such an error must
1731 * be handled by restarting a traditional ref-walk (which will always
1732 * be able to complete).
1734 err
= path_init(dfd
, name
, flags
| LOOKUP_PARENT
, nd
, &base
);
1739 current
->total_link_count
= 0;
1740 err
= link_path_walk(name
, nd
);
1742 if (!err
&& !(flags
& LOOKUP_PARENT
)) {
1743 err
= lookup_last(nd
, &path
);
1746 struct path link
= path
;
1747 nd
->flags
|= LOOKUP_PARENT
;
1748 err
= follow_link(&link
, nd
, &cookie
);
1750 err
= lookup_last(nd
, &path
);
1751 put_link(nd
, &link
, cookie
);
1756 err
= complete_walk(nd
);
1758 if (!err
&& nd
->flags
& LOOKUP_DIRECTORY
) {
1759 if (!nd
->inode
->i_op
->lookup
) {
1760 path_put(&nd
->path
);
1768 if (nd
->root
.mnt
&& !(nd
->flags
& LOOKUP_ROOT
)) {
1769 path_put(&nd
->root
);
1770 nd
->root
.mnt
= NULL
;
1775 static int do_path_lookup(int dfd
, const char *name
,
1776 unsigned int flags
, struct nameidata
*nd
)
1778 int retval
= path_lookupat(dfd
, name
, flags
| LOOKUP_RCU
, nd
);
1779 if (unlikely(retval
== -ECHILD
))
1780 retval
= path_lookupat(dfd
, name
, flags
, nd
);
1781 if (unlikely(retval
== -ESTALE
))
1782 retval
= path_lookupat(dfd
, name
, flags
| LOOKUP_REVAL
, nd
);
1784 if (likely(!retval
)) {
1785 if (unlikely(!audit_dummy_context())) {
1786 if (nd
->path
.dentry
&& nd
->inode
)
1787 audit_inode(name
, nd
->path
.dentry
);
1793 int kern_path_parent(const char *name
, struct nameidata
*nd
)
1795 return do_path_lookup(AT_FDCWD
, name
, LOOKUP_PARENT
, nd
);
1798 int kern_path(const char *name
, unsigned int flags
, struct path
*path
)
1800 struct nameidata nd
;
1801 int res
= do_path_lookup(AT_FDCWD
, name
, flags
, &nd
);
1808 * vfs_path_lookup - lookup a file path relative to a dentry-vfsmount pair
1809 * @dentry: pointer to dentry of the base directory
1810 * @mnt: pointer to vfs mount of the base directory
1811 * @name: pointer to file name
1812 * @flags: lookup flags
1813 * @path: pointer to struct path to fill
1815 int vfs_path_lookup(struct dentry
*dentry
, struct vfsmount
*mnt
,
1816 const char *name
, unsigned int flags
,
1819 struct nameidata nd
;
1821 nd
.root
.dentry
= dentry
;
1823 BUG_ON(flags
& LOOKUP_PARENT
);
1824 /* the first argument of do_path_lookup() is ignored with LOOKUP_ROOT */
1825 err
= do_path_lookup(AT_FDCWD
, name
, flags
| LOOKUP_ROOT
, &nd
);
1832 * Restricted form of lookup. Doesn't follow links, single-component only,
1833 * needs parent already locked. Doesn't follow mounts.
1836 static struct dentry
*lookup_hash(struct nameidata
*nd
)
1838 return __lookup_hash(&nd
->last
, nd
->path
.dentry
, nd
);
1842 * lookup_one_len - filesystem helper to lookup single pathname component
1843 * @name: pathname component to lookup
1844 * @base: base directory to lookup from
1845 * @len: maximum length @len should be interpreted to
1847 * Note that this routine is purely a helper for filesystem usage and should
1848 * not be called by generic code. Also note that by using this function the
1849 * nameidata argument is passed to the filesystem methods and a filesystem
1850 * using this helper needs to be prepared for that.
1852 struct dentry
*lookup_one_len(const char *name
, struct dentry
*base
, int len
)
1858 WARN_ON_ONCE(!mutex_is_locked(&base
->d_inode
->i_mutex
));
1862 this.hash
= full_name_hash(name
, len
);
1864 return ERR_PTR(-EACCES
);
1867 c
= *(const unsigned char *)name
++;
1868 if (c
== '/' || c
== '\0')
1869 return ERR_PTR(-EACCES
);
1872 * See if the low-level filesystem might want
1873 * to use its own hash..
1875 if (base
->d_flags
& DCACHE_OP_HASH
) {
1876 int err
= base
->d_op
->d_hash(base
, base
->d_inode
, &this);
1878 return ERR_PTR(err
);
1881 err
= inode_permission(base
->d_inode
, MAY_EXEC
);
1883 return ERR_PTR(err
);
1885 return __lookup_hash(&this, base
, NULL
);
1888 int user_path_at_empty(int dfd
, const char __user
*name
, unsigned flags
,
1889 struct path
*path
, int *empty
)
1891 struct nameidata nd
;
1892 char *tmp
= getname_flags(name
, flags
, empty
);
1893 int err
= PTR_ERR(tmp
);
1896 BUG_ON(flags
& LOOKUP_PARENT
);
1898 err
= do_path_lookup(dfd
, tmp
, flags
, &nd
);
1906 int user_path_at(int dfd
, const char __user
*name
, unsigned flags
,
1909 return user_path_at_empty(dfd
, name
, flags
, path
, NULL
);
1912 static int user_path_parent(int dfd
, const char __user
*path
,
1913 struct nameidata
*nd
, char **name
)
1915 char *s
= getname(path
);
1921 error
= do_path_lookup(dfd
, s
, LOOKUP_PARENT
, nd
);
1931 * It's inline, so penalty for filesystems that don't use sticky bit is
1934 static inline int check_sticky(struct inode
*dir
, struct inode
*inode
)
1936 kuid_t fsuid
= current_fsuid();
1938 if (!(dir
->i_mode
& S_ISVTX
))
1940 if (uid_eq(inode
->i_uid
, fsuid
))
1942 if (uid_eq(dir
->i_uid
, fsuid
))
1944 return !inode_capable(inode
, CAP_FOWNER
);
1948 * Check whether we can remove a link victim from directory dir, check
1949 * whether the type of victim is right.
1950 * 1. We can't do it if dir is read-only (done in permission())
1951 * 2. We should have write and exec permissions on dir
1952 * 3. We can't remove anything from append-only dir
1953 * 4. We can't do anything with immutable dir (done in permission())
1954 * 5. If the sticky bit on dir is set we should either
1955 * a. be owner of dir, or
1956 * b. be owner of victim, or
1957 * c. have CAP_FOWNER capability
1958 * 6. If the victim is append-only or immutable we can't do antyhing with
1959 * links pointing to it.
1960 * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR.
1961 * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR.
1962 * 9. We can't remove a root or mountpoint.
1963 * 10. We don't allow removal of NFS sillyrenamed files; it's handled by
1964 * nfs_async_unlink().
1966 static int may_delete(struct inode
*dir
,struct dentry
*victim
,int isdir
)
1970 if (!victim
->d_inode
)
1973 BUG_ON(victim
->d_parent
->d_inode
!= dir
);
1974 audit_inode_child(victim
, dir
);
1976 error
= inode_permission(dir
, MAY_WRITE
| MAY_EXEC
);
1981 if (check_sticky(dir
, victim
->d_inode
)||IS_APPEND(victim
->d_inode
)||
1982 IS_IMMUTABLE(victim
->d_inode
) || IS_SWAPFILE(victim
->d_inode
))
1985 if (!S_ISDIR(victim
->d_inode
->i_mode
))
1987 if (IS_ROOT(victim
))
1989 } else if (S_ISDIR(victim
->d_inode
->i_mode
))
1991 if (IS_DEADDIR(dir
))
1993 if (victim
->d_flags
& DCACHE_NFSFS_RENAMED
)
1998 /* Check whether we can create an object with dentry child in directory
2000 * 1. We can't do it if child already exists (open has special treatment for
2001 * this case, but since we are inlined it's OK)
2002 * 2. We can't do it if dir is read-only (done in permission())
2003 * 3. We should have write and exec permissions on dir
2004 * 4. We can't do it if dir is immutable (done in permission())
2006 static inline int may_create(struct inode
*dir
, struct dentry
*child
)
2010 if (IS_DEADDIR(dir
))
2012 return inode_permission(dir
, MAY_WRITE
| MAY_EXEC
);
2016 * p1 and p2 should be directories on the same fs.
2018 struct dentry
*lock_rename(struct dentry
*p1
, struct dentry
*p2
)
2023 mutex_lock_nested(&p1
->d_inode
->i_mutex
, I_MUTEX_PARENT
);
2027 mutex_lock(&p1
->d_inode
->i_sb
->s_vfs_rename_mutex
);
2029 p
= d_ancestor(p2
, p1
);
2031 mutex_lock_nested(&p2
->d_inode
->i_mutex
, I_MUTEX_PARENT
);
2032 mutex_lock_nested(&p1
->d_inode
->i_mutex
, I_MUTEX_CHILD
);
2036 p
= d_ancestor(p1
, p2
);
2038 mutex_lock_nested(&p1
->d_inode
->i_mutex
, I_MUTEX_PARENT
);
2039 mutex_lock_nested(&p2
->d_inode
->i_mutex
, I_MUTEX_CHILD
);
2043 mutex_lock_nested(&p1
->d_inode
->i_mutex
, I_MUTEX_PARENT
);
2044 mutex_lock_nested(&p2
->d_inode
->i_mutex
, I_MUTEX_CHILD
);
2048 void unlock_rename(struct dentry
*p1
, struct dentry
*p2
)
2050 mutex_unlock(&p1
->d_inode
->i_mutex
);
2052 mutex_unlock(&p2
->d_inode
->i_mutex
);
2053 mutex_unlock(&p1
->d_inode
->i_sb
->s_vfs_rename_mutex
);
2057 int vfs_create(struct inode
*dir
, struct dentry
*dentry
, umode_t mode
,
2058 struct nameidata
*nd
)
2060 int error
= may_create(dir
, dentry
);
2065 if (!dir
->i_op
->create
)
2066 return -EACCES
; /* shouldn't it be ENOSYS? */
2069 error
= security_inode_create(dir
, dentry
, mode
);
2072 error
= dir
->i_op
->create(dir
, dentry
, mode
, nd
);
2074 fsnotify_create(dir
, dentry
);
2078 static int may_open(struct path
*path
, int acc_mode
, int flag
)
2080 struct dentry
*dentry
= path
->dentry
;
2081 struct inode
*inode
= dentry
->d_inode
;
2091 switch (inode
->i_mode
& S_IFMT
) {
2095 if (acc_mode
& MAY_WRITE
)
2100 if (path
->mnt
->mnt_flags
& MNT_NODEV
)
2109 error
= inode_permission(inode
, acc_mode
);
2114 * An append-only file must be opened in append mode for writing.
2116 if (IS_APPEND(inode
)) {
2117 if ((flag
& O_ACCMODE
) != O_RDONLY
&& !(flag
& O_APPEND
))
2123 /* O_NOATIME can only be set by the owner or superuser */
2124 if (flag
& O_NOATIME
&& !inode_owner_or_capable(inode
))
2130 static int handle_truncate(struct file
*filp
)
2132 struct path
*path
= &filp
->f_path
;
2133 struct inode
*inode
= path
->dentry
->d_inode
;
2134 int error
= get_write_access(inode
);
2138 * Refuse to truncate files with mandatory locks held on them.
2140 error
= locks_verify_locked(inode
);
2142 error
= security_path_truncate(path
);
2144 error
= do_truncate(path
->dentry
, 0,
2145 ATTR_MTIME
|ATTR_CTIME
|ATTR_OPEN
,
2148 put_write_access(inode
);
2152 static inline int open_to_namei_flags(int flag
)
2154 if ((flag
& O_ACCMODE
) == 3)
2160 * Handle the last step of open()
2162 static struct file
*do_last(struct nameidata
*nd
, struct path
*path
,
2163 const struct open_flags
*op
, const char *pathname
)
2165 struct dentry
*dir
= nd
->path
.dentry
;
2166 struct dentry
*dentry
;
2167 int open_flag
= op
->open_flag
;
2168 int will_truncate
= open_flag
& O_TRUNC
;
2170 int acc_mode
= op
->acc_mode
;
2174 nd
->flags
&= ~LOOKUP_PARENT
;
2175 nd
->flags
|= op
->intent
;
2177 switch (nd
->last_type
) {
2180 error
= handle_dots(nd
, nd
->last_type
);
2182 return ERR_PTR(error
);
2185 error
= complete_walk(nd
);
2187 return ERR_PTR(error
);
2188 audit_inode(pathname
, nd
->path
.dentry
);
2189 if (open_flag
& O_CREAT
) {
2195 error
= complete_walk(nd
);
2197 return ERR_PTR(error
);
2198 audit_inode(pathname
, dir
);
2202 if (!(open_flag
& O_CREAT
)) {
2204 if (nd
->last
.name
[nd
->last
.len
])
2205 nd
->flags
|= LOOKUP_FOLLOW
| LOOKUP_DIRECTORY
;
2206 if (open_flag
& O_PATH
&& !(nd
->flags
& LOOKUP_FOLLOW
))
2208 /* we _can_ be in RCU mode here */
2209 error
= walk_component(nd
, path
, &nd
->last
, LAST_NORM
,
2212 return ERR_PTR(error
);
2213 if (error
) /* symlink */
2216 error
= complete_walk(nd
);
2218 return ERR_PTR(error
);
2221 if (nd
->flags
& LOOKUP_DIRECTORY
) {
2222 if (!nd
->inode
->i_op
->lookup
)
2225 audit_inode(pathname
, nd
->path
.dentry
);
2229 /* create side of things */
2231 * This will *only* deal with leaving RCU mode - LOOKUP_JUMPED has been
2232 * cleared when we got to the last component we are about to look up
2234 error
= complete_walk(nd
);
2236 return ERR_PTR(error
);
2238 audit_inode(pathname
, dir
);
2240 /* trailing slashes? */
2241 if (nd
->last
.name
[nd
->last
.len
])
2244 mutex_lock(&dir
->d_inode
->i_mutex
);
2246 dentry
= lookup_hash(nd
);
2247 error
= PTR_ERR(dentry
);
2248 if (IS_ERR(dentry
)) {
2249 mutex_unlock(&dir
->d_inode
->i_mutex
);
2253 path
->dentry
= dentry
;
2254 path
->mnt
= nd
->path
.mnt
;
2256 /* Negative dentry, just create the file */
2257 if (!dentry
->d_inode
) {
2258 umode_t mode
= op
->mode
;
2259 if (!IS_POSIXACL(dir
->d_inode
))
2260 mode
&= ~current_umask();
2262 * This write is needed to ensure that a
2263 * rw->ro transition does not occur between
2264 * the time when the file is created and when
2265 * a permanent write count is taken through
2266 * the 'struct file' in nameidata_to_filp().
2268 error
= mnt_want_write(nd
->path
.mnt
);
2270 goto exit_mutex_unlock
;
2272 /* Don't check for write permission, don't truncate */
2273 open_flag
&= ~O_TRUNC
;
2275 acc_mode
= MAY_OPEN
;
2276 error
= security_path_mknod(&nd
->path
, dentry
, mode
, 0);
2278 goto exit_mutex_unlock
;
2279 error
= vfs_create(dir
->d_inode
, dentry
, mode
, nd
);
2281 goto exit_mutex_unlock
;
2282 mutex_unlock(&dir
->d_inode
->i_mutex
);
2283 dput(nd
->path
.dentry
);
2284 nd
->path
.dentry
= dentry
;
2289 * It already exists.
2291 mutex_unlock(&dir
->d_inode
->i_mutex
);
2292 audit_inode(pathname
, path
->dentry
);
2295 if (open_flag
& O_EXCL
)
2298 error
= follow_managed(path
, nd
->flags
);
2303 nd
->flags
|= LOOKUP_JUMPED
;
2306 if (!path
->dentry
->d_inode
)
2309 if (path
->dentry
->d_inode
->i_op
->follow_link
)
2312 path_to_nameidata(path
, nd
);
2313 nd
->inode
= path
->dentry
->d_inode
;
2314 /* Why this, you ask? _Now_ we might have grown LOOKUP_JUMPED... */
2315 error
= complete_walk(nd
);
2317 return ERR_PTR(error
);
2319 if (S_ISDIR(nd
->inode
->i_mode
))
2322 if (!S_ISREG(nd
->inode
->i_mode
))
2325 if (will_truncate
) {
2326 error
= mnt_want_write(nd
->path
.mnt
);
2332 error
= may_open(&nd
->path
, acc_mode
, open_flag
);
2335 filp
= nameidata_to_filp(nd
);
2336 if (!IS_ERR(filp
)) {
2337 error
= ima_file_check(filp
, op
->acc_mode
);
2340 filp
= ERR_PTR(error
);
2343 if (!IS_ERR(filp
)) {
2344 if (will_truncate
) {
2345 error
= handle_truncate(filp
);
2348 filp
= ERR_PTR(error
);
2354 mnt_drop_write(nd
->path
.mnt
);
2355 path_put(&nd
->path
);
2359 mutex_unlock(&dir
->d_inode
->i_mutex
);
2361 path_put_conditional(path
, nd
);
2363 filp
= ERR_PTR(error
);
2367 static struct file
*path_openat(int dfd
, const char *pathname
,
2368 struct nameidata
*nd
, const struct open_flags
*op
, int flags
)
2370 struct file
*base
= NULL
;
2375 filp
= get_empty_filp();
2377 return ERR_PTR(-ENFILE
);
2379 filp
->f_flags
= op
->open_flag
;
2380 nd
->intent
.open
.file
= filp
;
2381 nd
->intent
.open
.flags
= open_to_namei_flags(op
->open_flag
);
2382 nd
->intent
.open
.create_mode
= op
->mode
;
2384 error
= path_init(dfd
, pathname
, flags
| LOOKUP_PARENT
, nd
, &base
);
2385 if (unlikely(error
))
2388 current
->total_link_count
= 0;
2389 error
= link_path_walk(pathname
, nd
);
2390 if (unlikely(error
))
2393 filp
= do_last(nd
, &path
, op
, pathname
);
2394 while (unlikely(!filp
)) { /* trailing symlink */
2395 struct path link
= path
;
2397 if (!(nd
->flags
& LOOKUP_FOLLOW
)) {
2398 path_put_conditional(&path
, nd
);
2399 path_put(&nd
->path
);
2400 filp
= ERR_PTR(-ELOOP
);
2403 nd
->flags
|= LOOKUP_PARENT
;
2404 nd
->flags
&= ~(LOOKUP_OPEN
|LOOKUP_CREATE
|LOOKUP_EXCL
);
2405 error
= follow_link(&link
, nd
, &cookie
);
2406 if (unlikely(error
))
2407 filp
= ERR_PTR(error
);
2409 filp
= do_last(nd
, &path
, op
, pathname
);
2410 put_link(nd
, &link
, cookie
);
2413 if (nd
->root
.mnt
&& !(nd
->flags
& LOOKUP_ROOT
))
2414 path_put(&nd
->root
);
2417 release_open_intent(nd
);
2421 filp
= ERR_PTR(error
);
2425 struct file
*do_filp_open(int dfd
, const char *pathname
,
2426 const struct open_flags
*op
, int flags
)
2428 struct nameidata nd
;
2431 filp
= path_openat(dfd
, pathname
, &nd
, op
, flags
| LOOKUP_RCU
);
2432 if (unlikely(filp
== ERR_PTR(-ECHILD
)))
2433 filp
= path_openat(dfd
, pathname
, &nd
, op
, flags
);
2434 if (unlikely(filp
== ERR_PTR(-ESTALE
)))
2435 filp
= path_openat(dfd
, pathname
, &nd
, op
, flags
| LOOKUP_REVAL
);
2439 struct file
*do_file_open_root(struct dentry
*dentry
, struct vfsmount
*mnt
,
2440 const char *name
, const struct open_flags
*op
, int flags
)
2442 struct nameidata nd
;
2446 nd
.root
.dentry
= dentry
;
2448 flags
|= LOOKUP_ROOT
;
2450 if (dentry
->d_inode
->i_op
->follow_link
&& op
->intent
& LOOKUP_OPEN
)
2451 return ERR_PTR(-ELOOP
);
2453 file
= path_openat(-1, name
, &nd
, op
, flags
| LOOKUP_RCU
);
2454 if (unlikely(file
== ERR_PTR(-ECHILD
)))
2455 file
= path_openat(-1, name
, &nd
, op
, flags
);
2456 if (unlikely(file
== ERR_PTR(-ESTALE
)))
2457 file
= path_openat(-1, name
, &nd
, op
, flags
| LOOKUP_REVAL
);
2461 struct dentry
*kern_path_create(int dfd
, const char *pathname
, struct path
*path
, int is_dir
)
2463 struct dentry
*dentry
= ERR_PTR(-EEXIST
);
2464 struct nameidata nd
;
2465 int error
= do_path_lookup(dfd
, pathname
, LOOKUP_PARENT
, &nd
);
2467 return ERR_PTR(error
);
2470 * Yucky last component or no last component at all?
2471 * (foo/., foo/.., /////)
2473 if (nd
.last_type
!= LAST_NORM
)
2475 nd
.flags
&= ~LOOKUP_PARENT
;
2476 nd
.flags
|= LOOKUP_CREATE
| LOOKUP_EXCL
;
2477 nd
.intent
.open
.flags
= O_EXCL
;
2480 * Do the final lookup.
2482 mutex_lock_nested(&nd
.path
.dentry
->d_inode
->i_mutex
, I_MUTEX_PARENT
);
2483 dentry
= lookup_hash(&nd
);
2487 if (dentry
->d_inode
)
2490 * Special case - lookup gave negative, but... we had foo/bar/
2491 * From the vfs_mknod() POV we just have a negative dentry -
2492 * all is fine. Let's be bastards - you had / on the end, you've
2493 * been asking for (non-existent) directory. -ENOENT for you.
2495 if (unlikely(!is_dir
&& nd
.last
.name
[nd
.last
.len
])) {
2497 dentry
= ERR_PTR(-ENOENT
);
2504 dentry
= ERR_PTR(-EEXIST
);
2506 mutex_unlock(&nd
.path
.dentry
->d_inode
->i_mutex
);
2511 EXPORT_SYMBOL(kern_path_create
);
2513 struct dentry
*user_path_create(int dfd
, const char __user
*pathname
, struct path
*path
, int is_dir
)
2515 char *tmp
= getname(pathname
);
2518 return ERR_CAST(tmp
);
2519 res
= kern_path_create(dfd
, tmp
, path
, is_dir
);
2523 EXPORT_SYMBOL(user_path_create
);
2525 int vfs_mknod(struct inode
*dir
, struct dentry
*dentry
, umode_t mode
, dev_t dev
)
2527 int error
= may_create(dir
, dentry
);
2532 if ((S_ISCHR(mode
) || S_ISBLK(mode
)) && !capable(CAP_MKNOD
))
2535 if (!dir
->i_op
->mknod
)
2538 error
= devcgroup_inode_mknod(mode
, dev
);
2542 error
= security_inode_mknod(dir
, dentry
, mode
, dev
);
2546 error
= dir
->i_op
->mknod(dir
, dentry
, mode
, dev
);
2548 fsnotify_create(dir
, dentry
);
2552 static int may_mknod(umode_t mode
)
2554 switch (mode
& S_IFMT
) {
2560 case 0: /* zero mode translates to S_IFREG */
2569 SYSCALL_DEFINE4(mknodat
, int, dfd
, const char __user
*, filename
, umode_t
, mode
,
2572 struct dentry
*dentry
;
2579 dentry
= user_path_create(dfd
, filename
, &path
, 0);
2581 return PTR_ERR(dentry
);
2583 if (!IS_POSIXACL(path
.dentry
->d_inode
))
2584 mode
&= ~current_umask();
2585 error
= may_mknod(mode
);
2588 error
= mnt_want_write(path
.mnt
);
2591 error
= security_path_mknod(&path
, dentry
, mode
, dev
);
2593 goto out_drop_write
;
2594 switch (mode
& S_IFMT
) {
2595 case 0: case S_IFREG
:
2596 error
= vfs_create(path
.dentry
->d_inode
,dentry
,mode
,NULL
);
2598 case S_IFCHR
: case S_IFBLK
:
2599 error
= vfs_mknod(path
.dentry
->d_inode
,dentry
,mode
,
2600 new_decode_dev(dev
));
2602 case S_IFIFO
: case S_IFSOCK
:
2603 error
= vfs_mknod(path
.dentry
->d_inode
,dentry
,mode
,0);
2607 mnt_drop_write(path
.mnt
);
2610 mutex_unlock(&path
.dentry
->d_inode
->i_mutex
);
2616 SYSCALL_DEFINE3(mknod
, const char __user
*, filename
, umode_t
, mode
, unsigned, dev
)
2618 return sys_mknodat(AT_FDCWD
, filename
, mode
, dev
);
2621 int vfs_mkdir(struct inode
*dir
, struct dentry
*dentry
, umode_t mode
)
2623 int error
= may_create(dir
, dentry
);
2624 unsigned max_links
= dir
->i_sb
->s_max_links
;
2629 if (!dir
->i_op
->mkdir
)
2632 mode
&= (S_IRWXUGO
|S_ISVTX
);
2633 error
= security_inode_mkdir(dir
, dentry
, mode
);
2637 if (max_links
&& dir
->i_nlink
>= max_links
)
2640 error
= dir
->i_op
->mkdir(dir
, dentry
, mode
);
2642 fsnotify_mkdir(dir
, dentry
);
2646 SYSCALL_DEFINE3(mkdirat
, int, dfd
, const char __user
*, pathname
, umode_t
, mode
)
2648 struct dentry
*dentry
;
2652 dentry
= user_path_create(dfd
, pathname
, &path
, 1);
2654 return PTR_ERR(dentry
);
2656 if (!IS_POSIXACL(path
.dentry
->d_inode
))
2657 mode
&= ~current_umask();
2658 error
= mnt_want_write(path
.mnt
);
2661 error
= security_path_mkdir(&path
, dentry
, mode
);
2663 goto out_drop_write
;
2664 error
= vfs_mkdir(path
.dentry
->d_inode
, dentry
, mode
);
2666 mnt_drop_write(path
.mnt
);
2669 mutex_unlock(&path
.dentry
->d_inode
->i_mutex
);
2674 SYSCALL_DEFINE2(mkdir
, const char __user
*, pathname
, umode_t
, mode
)
2676 return sys_mkdirat(AT_FDCWD
, pathname
, mode
);
2680 * The dentry_unhash() helper will try to drop the dentry early: we
2681 * should have a usage count of 1 if we're the only user of this
2682 * dentry, and if that is true (possibly after pruning the dcache),
2683 * then we drop the dentry now.
2685 * A low-level filesystem can, if it choses, legally
2688 * if (!d_unhashed(dentry))
2691 * if it cannot handle the case of removing a directory
2692 * that is still in use by something else..
2694 void dentry_unhash(struct dentry
*dentry
)
2696 shrink_dcache_parent(dentry
);
2697 spin_lock(&dentry
->d_lock
);
2698 if (dentry
->d_count
== 1)
2700 spin_unlock(&dentry
->d_lock
);
2703 int vfs_rmdir(struct inode
*dir
, struct dentry
*dentry
)
2705 int error
= may_delete(dir
, dentry
, 1);
2710 if (!dir
->i_op
->rmdir
)
2714 mutex_lock(&dentry
->d_inode
->i_mutex
);
2717 if (d_mountpoint(dentry
))
2720 error
= security_inode_rmdir(dir
, dentry
);
2724 shrink_dcache_parent(dentry
);
2725 error
= dir
->i_op
->rmdir(dir
, dentry
);
2729 dentry
->d_inode
->i_flags
|= S_DEAD
;
2733 mutex_unlock(&dentry
->d_inode
->i_mutex
);
2740 static long do_rmdir(int dfd
, const char __user
*pathname
)
2744 struct dentry
*dentry
;
2745 struct nameidata nd
;
2747 error
= user_path_parent(dfd
, pathname
, &nd
, &name
);
2751 switch(nd
.last_type
) {
2763 nd
.flags
&= ~LOOKUP_PARENT
;
2765 mutex_lock_nested(&nd
.path
.dentry
->d_inode
->i_mutex
, I_MUTEX_PARENT
);
2766 dentry
= lookup_hash(&nd
);
2767 error
= PTR_ERR(dentry
);
2770 if (!dentry
->d_inode
) {
2774 error
= mnt_want_write(nd
.path
.mnt
);
2777 error
= security_path_rmdir(&nd
.path
, dentry
);
2780 error
= vfs_rmdir(nd
.path
.dentry
->d_inode
, dentry
);
2782 mnt_drop_write(nd
.path
.mnt
);
2786 mutex_unlock(&nd
.path
.dentry
->d_inode
->i_mutex
);
2793 SYSCALL_DEFINE1(rmdir
, const char __user
*, pathname
)
2795 return do_rmdir(AT_FDCWD
, pathname
);
2798 int vfs_unlink(struct inode
*dir
, struct dentry
*dentry
)
2800 int error
= may_delete(dir
, dentry
, 0);
2805 if (!dir
->i_op
->unlink
)
2808 mutex_lock(&dentry
->d_inode
->i_mutex
);
2809 if (d_mountpoint(dentry
))
2812 error
= security_inode_unlink(dir
, dentry
);
2814 error
= dir
->i_op
->unlink(dir
, dentry
);
2819 mutex_unlock(&dentry
->d_inode
->i_mutex
);
2821 /* We don't d_delete() NFS sillyrenamed files--they still exist. */
2822 if (!error
&& !(dentry
->d_flags
& DCACHE_NFSFS_RENAMED
)) {
2823 fsnotify_link_count(dentry
->d_inode
);
2831 * Make sure that the actual truncation of the file will occur outside its
2832 * directory's i_mutex. Truncate can take a long time if there is a lot of
2833 * writeout happening, and we don't want to prevent access to the directory
2834 * while waiting on the I/O.
2836 static long do_unlinkat(int dfd
, const char __user
*pathname
)
2840 struct dentry
*dentry
;
2841 struct nameidata nd
;
2842 struct inode
*inode
= NULL
;
2844 error
= user_path_parent(dfd
, pathname
, &nd
, &name
);
2849 if (nd
.last_type
!= LAST_NORM
)
2852 nd
.flags
&= ~LOOKUP_PARENT
;
2854 mutex_lock_nested(&nd
.path
.dentry
->d_inode
->i_mutex
, I_MUTEX_PARENT
);
2855 dentry
= lookup_hash(&nd
);
2856 error
= PTR_ERR(dentry
);
2857 if (!IS_ERR(dentry
)) {
2858 /* Why not before? Because we want correct error value */
2859 if (nd
.last
.name
[nd
.last
.len
])
2861 inode
= dentry
->d_inode
;
2865 error
= mnt_want_write(nd
.path
.mnt
);
2868 error
= security_path_unlink(&nd
.path
, dentry
);
2871 error
= vfs_unlink(nd
.path
.dentry
->d_inode
, dentry
);
2873 mnt_drop_write(nd
.path
.mnt
);
2877 mutex_unlock(&nd
.path
.dentry
->d_inode
->i_mutex
);
2879 iput(inode
); /* truncate the inode here */
2886 error
= !dentry
->d_inode
? -ENOENT
:
2887 S_ISDIR(dentry
->d_inode
->i_mode
) ? -EISDIR
: -ENOTDIR
;
2891 SYSCALL_DEFINE3(unlinkat
, int, dfd
, const char __user
*, pathname
, int, flag
)
2893 if ((flag
& ~AT_REMOVEDIR
) != 0)
2896 if (flag
& AT_REMOVEDIR
)
2897 return do_rmdir(dfd
, pathname
);
2899 return do_unlinkat(dfd
, pathname
);
2902 SYSCALL_DEFINE1(unlink
, const char __user
*, pathname
)
2904 return do_unlinkat(AT_FDCWD
, pathname
);
2907 int vfs_symlink(struct inode
*dir
, struct dentry
*dentry
, const char *oldname
)
2909 int error
= may_create(dir
, dentry
);
2914 if (!dir
->i_op
->symlink
)
2917 error
= security_inode_symlink(dir
, dentry
, oldname
);
2921 error
= dir
->i_op
->symlink(dir
, dentry
, oldname
);
2923 fsnotify_create(dir
, dentry
);
2927 SYSCALL_DEFINE3(symlinkat
, const char __user
*, oldname
,
2928 int, newdfd
, const char __user
*, newname
)
2932 struct dentry
*dentry
;
2935 from
= getname(oldname
);
2937 return PTR_ERR(from
);
2939 dentry
= user_path_create(newdfd
, newname
, &path
, 0);
2940 error
= PTR_ERR(dentry
);
2944 error
= mnt_want_write(path
.mnt
);
2947 error
= security_path_symlink(&path
, dentry
, from
);
2949 goto out_drop_write
;
2950 error
= vfs_symlink(path
.dentry
->d_inode
, dentry
, from
);
2952 mnt_drop_write(path
.mnt
);
2955 mutex_unlock(&path
.dentry
->d_inode
->i_mutex
);
2962 SYSCALL_DEFINE2(symlink
, const char __user
*, oldname
, const char __user
*, newname
)
2964 return sys_symlinkat(oldname
, AT_FDCWD
, newname
);
2967 int vfs_link(struct dentry
*old_dentry
, struct inode
*dir
, struct dentry
*new_dentry
)
2969 struct inode
*inode
= old_dentry
->d_inode
;
2970 unsigned max_links
= dir
->i_sb
->s_max_links
;
2976 error
= may_create(dir
, new_dentry
);
2980 if (dir
->i_sb
!= inode
->i_sb
)
2984 * A link to an append-only or immutable file cannot be created.
2986 if (IS_APPEND(inode
) || IS_IMMUTABLE(inode
))
2988 if (!dir
->i_op
->link
)
2990 if (S_ISDIR(inode
->i_mode
))
2993 error
= security_inode_link(old_dentry
, dir
, new_dentry
);
2997 mutex_lock(&inode
->i_mutex
);
2998 /* Make sure we don't allow creating hardlink to an unlinked file */
2999 if (inode
->i_nlink
== 0)
3001 else if (max_links
&& inode
->i_nlink
>= max_links
)
3004 error
= dir
->i_op
->link(old_dentry
, dir
, new_dentry
);
3005 mutex_unlock(&inode
->i_mutex
);
3007 fsnotify_link(dir
, inode
, new_dentry
);
3012 * Hardlinks are often used in delicate situations. We avoid
3013 * security-related surprises by not following symlinks on the
3016 * We don't follow them on the oldname either to be compatible
3017 * with linux 2.0, and to avoid hard-linking to directories
3018 * and other special files. --ADM
3020 SYSCALL_DEFINE5(linkat
, int, olddfd
, const char __user
*, oldname
,
3021 int, newdfd
, const char __user
*, newname
, int, flags
)
3023 struct dentry
*new_dentry
;
3024 struct path old_path
, new_path
;
3028 if ((flags
& ~(AT_SYMLINK_FOLLOW
| AT_EMPTY_PATH
)) != 0)
3031 * To use null names we require CAP_DAC_READ_SEARCH
3032 * This ensures that not everyone will be able to create
3033 * handlink using the passed filedescriptor.
3035 if (flags
& AT_EMPTY_PATH
) {
3036 if (!capable(CAP_DAC_READ_SEARCH
))
3041 if (flags
& AT_SYMLINK_FOLLOW
)
3042 how
|= LOOKUP_FOLLOW
;
3044 error
= user_path_at(olddfd
, oldname
, how
, &old_path
);
3048 new_dentry
= user_path_create(newdfd
, newname
, &new_path
, 0);
3049 error
= PTR_ERR(new_dentry
);
3050 if (IS_ERR(new_dentry
))
3054 if (old_path
.mnt
!= new_path
.mnt
)
3056 error
= mnt_want_write(new_path
.mnt
);
3059 error
= security_path_link(old_path
.dentry
, &new_path
, new_dentry
);
3061 goto out_drop_write
;
3062 error
= vfs_link(old_path
.dentry
, new_path
.dentry
->d_inode
, new_dentry
);
3064 mnt_drop_write(new_path
.mnt
);
3067 mutex_unlock(&new_path
.dentry
->d_inode
->i_mutex
);
3068 path_put(&new_path
);
3070 path_put(&old_path
);
3075 SYSCALL_DEFINE2(link
, const char __user
*, oldname
, const char __user
*, newname
)
3077 return sys_linkat(AT_FDCWD
, oldname
, AT_FDCWD
, newname
, 0);
3081 * The worst of all namespace operations - renaming directory. "Perverted"
3082 * doesn't even start to describe it. Somebody in UCB had a heck of a trip...
3084 * a) we can get into loop creation. Check is done in is_subdir().
3085 * b) race potential - two innocent renames can create a loop together.
3086 * That's where 4.4 screws up. Current fix: serialization on
3087 * sb->s_vfs_rename_mutex. We might be more accurate, but that's another
3089 * c) we have to lock _three_ objects - parents and victim (if it exists).
3090 * And that - after we got ->i_mutex on parents (until then we don't know
3091 * whether the target exists). Solution: try to be smart with locking
3092 * order for inodes. We rely on the fact that tree topology may change
3093 * only under ->s_vfs_rename_mutex _and_ that parent of the object we
3094 * move will be locked. Thus we can rank directories by the tree
3095 * (ancestors first) and rank all non-directories after them.
3096 * That works since everybody except rename does "lock parent, lookup,
3097 * lock child" and rename is under ->s_vfs_rename_mutex.
3098 * HOWEVER, it relies on the assumption that any object with ->lookup()
3099 * has no more than 1 dentry. If "hybrid" objects will ever appear,
3100 * we'd better make sure that there's no link(2) for them.
3101 * d) conversion from fhandle to dentry may come in the wrong moment - when
3102 * we are removing the target. Solution: we will have to grab ->i_mutex
3103 * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on
3104 * ->i_mutex on parents, which works but leads to some truly excessive
3107 static int vfs_rename_dir(struct inode
*old_dir
, struct dentry
*old_dentry
,
3108 struct inode
*new_dir
, struct dentry
*new_dentry
)
3111 struct inode
*target
= new_dentry
->d_inode
;
3112 unsigned max_links
= new_dir
->i_sb
->s_max_links
;
3115 * If we are going to change the parent - check write permissions,
3116 * we'll need to flip '..'.
3118 if (new_dir
!= old_dir
) {
3119 error
= inode_permission(old_dentry
->d_inode
, MAY_WRITE
);
3124 error
= security_inode_rename(old_dir
, old_dentry
, new_dir
, new_dentry
);
3130 mutex_lock(&target
->i_mutex
);
3133 if (d_mountpoint(old_dentry
) || d_mountpoint(new_dentry
))
3137 if (max_links
&& !target
&& new_dir
!= old_dir
&&
3138 new_dir
->i_nlink
>= max_links
)
3142 shrink_dcache_parent(new_dentry
);
3143 error
= old_dir
->i_op
->rename(old_dir
, old_dentry
, new_dir
, new_dentry
);
3148 target
->i_flags
|= S_DEAD
;
3149 dont_mount(new_dentry
);
3153 mutex_unlock(&target
->i_mutex
);
3156 if (!(old_dir
->i_sb
->s_type
->fs_flags
& FS_RENAME_DOES_D_MOVE
))
3157 d_move(old_dentry
,new_dentry
);
3161 static int vfs_rename_other(struct inode
*old_dir
, struct dentry
*old_dentry
,
3162 struct inode
*new_dir
, struct dentry
*new_dentry
)
3164 struct inode
*target
= new_dentry
->d_inode
;
3167 error
= security_inode_rename(old_dir
, old_dentry
, new_dir
, new_dentry
);
3173 mutex_lock(&target
->i_mutex
);
3176 if (d_mountpoint(old_dentry
)||d_mountpoint(new_dentry
))
3179 error
= old_dir
->i_op
->rename(old_dir
, old_dentry
, new_dir
, new_dentry
);
3184 dont_mount(new_dentry
);
3185 if (!(old_dir
->i_sb
->s_type
->fs_flags
& FS_RENAME_DOES_D_MOVE
))
3186 d_move(old_dentry
, new_dentry
);
3189 mutex_unlock(&target
->i_mutex
);
3194 int vfs_rename(struct inode
*old_dir
, struct dentry
*old_dentry
,
3195 struct inode
*new_dir
, struct dentry
*new_dentry
)
3198 int is_dir
= S_ISDIR(old_dentry
->d_inode
->i_mode
);
3199 const unsigned char *old_name
;
3201 if (old_dentry
->d_inode
== new_dentry
->d_inode
)
3204 error
= may_delete(old_dir
, old_dentry
, is_dir
);
3208 if (!new_dentry
->d_inode
)
3209 error
= may_create(new_dir
, new_dentry
);
3211 error
= may_delete(new_dir
, new_dentry
, is_dir
);
3215 if (!old_dir
->i_op
->rename
)
3218 old_name
= fsnotify_oldname_init(old_dentry
->d_name
.name
);
3221 error
= vfs_rename_dir(old_dir
,old_dentry
,new_dir
,new_dentry
);
3223 error
= vfs_rename_other(old_dir
,old_dentry
,new_dir
,new_dentry
);
3225 fsnotify_move(old_dir
, new_dir
, old_name
, is_dir
,
3226 new_dentry
->d_inode
, old_dentry
);
3227 fsnotify_oldname_free(old_name
);
3232 SYSCALL_DEFINE4(renameat
, int, olddfd
, const char __user
*, oldname
,
3233 int, newdfd
, const char __user
*, newname
)
3235 struct dentry
*old_dir
, *new_dir
;
3236 struct dentry
*old_dentry
, *new_dentry
;
3237 struct dentry
*trap
;
3238 struct nameidata oldnd
, newnd
;
3243 error
= user_path_parent(olddfd
, oldname
, &oldnd
, &from
);
3247 error
= user_path_parent(newdfd
, newname
, &newnd
, &to
);
3252 if (oldnd
.path
.mnt
!= newnd
.path
.mnt
)
3255 old_dir
= oldnd
.path
.dentry
;
3257 if (oldnd
.last_type
!= LAST_NORM
)
3260 new_dir
= newnd
.path
.dentry
;
3261 if (newnd
.last_type
!= LAST_NORM
)
3264 oldnd
.flags
&= ~LOOKUP_PARENT
;
3265 newnd
.flags
&= ~LOOKUP_PARENT
;
3266 newnd
.flags
|= LOOKUP_RENAME_TARGET
;
3268 trap
= lock_rename(new_dir
, old_dir
);
3270 old_dentry
= lookup_hash(&oldnd
);
3271 error
= PTR_ERR(old_dentry
);
3272 if (IS_ERR(old_dentry
))
3274 /* source must exist */
3276 if (!old_dentry
->d_inode
)
3278 /* unless the source is a directory trailing slashes give -ENOTDIR */
3279 if (!S_ISDIR(old_dentry
->d_inode
->i_mode
)) {
3281 if (oldnd
.last
.name
[oldnd
.last
.len
])
3283 if (newnd
.last
.name
[newnd
.last
.len
])
3286 /* source should not be ancestor of target */
3288 if (old_dentry
== trap
)
3290 new_dentry
= lookup_hash(&newnd
);
3291 error
= PTR_ERR(new_dentry
);
3292 if (IS_ERR(new_dentry
))
3294 /* target should not be an ancestor of source */
3296 if (new_dentry
== trap
)
3299 error
= mnt_want_write(oldnd
.path
.mnt
);
3302 error
= security_path_rename(&oldnd
.path
, old_dentry
,
3303 &newnd
.path
, new_dentry
);
3306 error
= vfs_rename(old_dir
->d_inode
, old_dentry
,
3307 new_dir
->d_inode
, new_dentry
);
3309 mnt_drop_write(oldnd
.path
.mnt
);
3315 unlock_rename(new_dir
, old_dir
);
3317 path_put(&newnd
.path
);
3320 path_put(&oldnd
.path
);
3326 SYSCALL_DEFINE2(rename
, const char __user
*, oldname
, const char __user
*, newname
)
3328 return sys_renameat(AT_FDCWD
, oldname
, AT_FDCWD
, newname
);
3331 int vfs_readlink(struct dentry
*dentry
, char __user
*buffer
, int buflen
, const char *link
)
3335 len
= PTR_ERR(link
);
3340 if (len
> (unsigned) buflen
)
3342 if (copy_to_user(buffer
, link
, len
))
3349 * A helper for ->readlink(). This should be used *ONLY* for symlinks that
3350 * have ->follow_link() touching nd only in nd_set_link(). Using (or not
3351 * using) it for any given inode is up to filesystem.
3353 int generic_readlink(struct dentry
*dentry
, char __user
*buffer
, int buflen
)
3355 struct nameidata nd
;
3360 cookie
= dentry
->d_inode
->i_op
->follow_link(dentry
, &nd
);
3362 return PTR_ERR(cookie
);
3364 res
= vfs_readlink(dentry
, buffer
, buflen
, nd_get_link(&nd
));
3365 if (dentry
->d_inode
->i_op
->put_link
)
3366 dentry
->d_inode
->i_op
->put_link(dentry
, &nd
, cookie
);
3370 int vfs_follow_link(struct nameidata
*nd
, const char *link
)
3372 return __vfs_follow_link(nd
, link
);
3375 /* get the link contents into pagecache */
3376 static char *page_getlink(struct dentry
* dentry
, struct page
**ppage
)
3380 struct address_space
*mapping
= dentry
->d_inode
->i_mapping
;
3381 page
= read_mapping_page(mapping
, 0, NULL
);
3386 nd_terminate_link(kaddr
, dentry
->d_inode
->i_size
, PAGE_SIZE
- 1);
3390 int page_readlink(struct dentry
*dentry
, char __user
*buffer
, int buflen
)
3392 struct page
*page
= NULL
;
3393 char *s
= page_getlink(dentry
, &page
);
3394 int res
= vfs_readlink(dentry
,buffer
,buflen
,s
);
3397 page_cache_release(page
);
3402 void *page_follow_link_light(struct dentry
*dentry
, struct nameidata
*nd
)
3404 struct page
*page
= NULL
;
3405 nd_set_link(nd
, page_getlink(dentry
, &page
));
3409 void page_put_link(struct dentry
*dentry
, struct nameidata
*nd
, void *cookie
)
3411 struct page
*page
= cookie
;
3415 page_cache_release(page
);
3420 * The nofs argument instructs pagecache_write_begin to pass AOP_FLAG_NOFS
3422 int __page_symlink(struct inode
*inode
, const char *symname
, int len
, int nofs
)
3424 struct address_space
*mapping
= inode
->i_mapping
;
3429 unsigned int flags
= AOP_FLAG_UNINTERRUPTIBLE
;
3431 flags
|= AOP_FLAG_NOFS
;
3434 err
= pagecache_write_begin(NULL
, mapping
, 0, len
-1,
3435 flags
, &page
, &fsdata
);
3439 kaddr
= kmap_atomic(page
);
3440 memcpy(kaddr
, symname
, len
-1);
3441 kunmap_atomic(kaddr
);
3443 err
= pagecache_write_end(NULL
, mapping
, 0, len
-1, len
-1,
3450 mark_inode_dirty(inode
);
3456 int page_symlink(struct inode
*inode
, const char *symname
, int len
)
3458 return __page_symlink(inode
, symname
, len
,
3459 !(mapping_gfp_mask(inode
->i_mapping
) & __GFP_FS
));
3462 const struct inode_operations page_symlink_inode_operations
= {
3463 .readlink
= generic_readlink
,
3464 .follow_link
= page_follow_link_light
,
3465 .put_link
= page_put_link
,
3468 EXPORT_SYMBOL(user_path_at
);
3469 EXPORT_SYMBOL(follow_down_one
);
3470 EXPORT_SYMBOL(follow_down
);
3471 EXPORT_SYMBOL(follow_up
);
3472 EXPORT_SYMBOL(get_write_access
); /* binfmt_aout */
3473 EXPORT_SYMBOL(getname
);
3474 EXPORT_SYMBOL(lock_rename
);
3475 EXPORT_SYMBOL(lookup_one_len
);
3476 EXPORT_SYMBOL(page_follow_link_light
);
3477 EXPORT_SYMBOL(page_put_link
);
3478 EXPORT_SYMBOL(page_readlink
);
3479 EXPORT_SYMBOL(__page_symlink
);
3480 EXPORT_SYMBOL(page_symlink
);
3481 EXPORT_SYMBOL(page_symlink_inode_operations
);
3482 EXPORT_SYMBOL(kern_path
);
3483 EXPORT_SYMBOL(vfs_path_lookup
);
3484 EXPORT_SYMBOL(inode_permission
);
3485 EXPORT_SYMBOL(unlock_rename
);
3486 EXPORT_SYMBOL(vfs_create
);
3487 EXPORT_SYMBOL(vfs_follow_link
);
3488 EXPORT_SYMBOL(vfs_link
);
3489 EXPORT_SYMBOL(vfs_mkdir
);
3490 EXPORT_SYMBOL(vfs_mknod
);
3491 EXPORT_SYMBOL(generic_permission
);
3492 EXPORT_SYMBOL(vfs_readlink
);
3493 EXPORT_SYMBOL(vfs_rename
);
3494 EXPORT_SYMBOL(vfs_rmdir
);
3495 EXPORT_SYMBOL(vfs_symlink
);
3496 EXPORT_SYMBOL(vfs_unlink
);
3497 EXPORT_SYMBOL(dentry_unhash
);
3498 EXPORT_SYMBOL(generic_readlink
);