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
);
466 static inline int d_revalidate(struct dentry
*dentry
, unsigned int flags
)
468 return dentry
->d_op
->d_revalidate(dentry
, flags
);
472 * complete_walk - successful completion of path walk
473 * @nd: pointer nameidata
475 * If we had been in RCU mode, drop out of it and legitimize nd->path.
476 * Revalidate the final result, unless we'd already done that during
477 * the path walk or the filesystem doesn't ask for it. Return 0 on
478 * success, -error on failure. In case of failure caller does not
479 * need to drop nd->path.
481 static int complete_walk(struct nameidata
*nd
)
483 struct dentry
*dentry
= nd
->path
.dentry
;
486 if (nd
->flags
& LOOKUP_RCU
) {
487 nd
->flags
&= ~LOOKUP_RCU
;
488 if (!(nd
->flags
& LOOKUP_ROOT
))
490 spin_lock(&dentry
->d_lock
);
491 if (unlikely(!__d_rcu_to_refcount(dentry
, nd
->seq
))) {
492 spin_unlock(&dentry
->d_lock
);
494 br_read_unlock(&vfsmount_lock
);
497 BUG_ON(nd
->inode
!= dentry
->d_inode
);
498 spin_unlock(&dentry
->d_lock
);
499 mntget(nd
->path
.mnt
);
501 br_read_unlock(&vfsmount_lock
);
504 if (likely(!(nd
->flags
& LOOKUP_JUMPED
)))
507 if (likely(!(dentry
->d_flags
& DCACHE_OP_REVALIDATE
)))
510 if (likely(!(dentry
->d_sb
->s_type
->fs_flags
& FS_REVAL_DOT
)))
513 /* Note: we do not d_invalidate() */
514 status
= d_revalidate(dentry
, nd
->flags
);
525 static __always_inline
void set_root(struct nameidata
*nd
)
528 get_fs_root(current
->fs
, &nd
->root
);
531 static int link_path_walk(const char *, struct nameidata
*);
533 static __always_inline
void set_root_rcu(struct nameidata
*nd
)
536 struct fs_struct
*fs
= current
->fs
;
540 seq
= read_seqcount_begin(&fs
->seq
);
542 nd
->seq
= __read_seqcount_begin(&nd
->root
.dentry
->d_seq
);
543 } while (read_seqcount_retry(&fs
->seq
, seq
));
547 static __always_inline
int __vfs_follow_link(struct nameidata
*nd
, const char *link
)
559 nd
->flags
|= LOOKUP_JUMPED
;
561 nd
->inode
= nd
->path
.dentry
->d_inode
;
563 ret
= link_path_walk(link
, nd
);
567 return PTR_ERR(link
);
570 static void path_put_conditional(struct path
*path
, struct nameidata
*nd
)
573 if (path
->mnt
!= nd
->path
.mnt
)
577 static inline void path_to_nameidata(const struct path
*path
,
578 struct nameidata
*nd
)
580 if (!(nd
->flags
& LOOKUP_RCU
)) {
581 dput(nd
->path
.dentry
);
582 if (nd
->path
.mnt
!= path
->mnt
)
583 mntput(nd
->path
.mnt
);
585 nd
->path
.mnt
= path
->mnt
;
586 nd
->path
.dentry
= path
->dentry
;
589 static inline void put_link(struct nameidata
*nd
, struct path
*link
, void *cookie
)
591 struct inode
*inode
= link
->dentry
->d_inode
;
592 if (inode
->i_op
->put_link
)
593 inode
->i_op
->put_link(link
->dentry
, nd
, cookie
);
597 static __always_inline
int
598 follow_link(struct path
*link
, struct nameidata
*nd
, void **p
)
600 struct dentry
*dentry
= link
->dentry
;
604 BUG_ON(nd
->flags
& LOOKUP_RCU
);
606 if (link
->mnt
== nd
->path
.mnt
)
610 if (unlikely(current
->total_link_count
>= 40))
611 goto out_put_nd_path
;
614 current
->total_link_count
++;
617 nd_set_link(nd
, NULL
);
619 error
= security_inode_follow_link(link
->dentry
, nd
);
621 goto out_put_nd_path
;
623 nd
->last_type
= LAST_BIND
;
624 *p
= dentry
->d_inode
->i_op
->follow_link(dentry
, nd
);
632 error
= __vfs_follow_link(nd
, s
);
633 } else if (nd
->last_type
== LAST_BIND
) {
634 nd
->flags
|= LOOKUP_JUMPED
;
635 nd
->inode
= nd
->path
.dentry
->d_inode
;
636 if (nd
->inode
->i_op
->follow_link
) {
637 /* stepped on a _really_ weird one */
643 put_link(nd
, link
, *p
);
654 static int follow_up_rcu(struct path
*path
)
656 struct mount
*mnt
= real_mount(path
->mnt
);
657 struct mount
*parent
;
658 struct dentry
*mountpoint
;
660 parent
= mnt
->mnt_parent
;
661 if (&parent
->mnt
== path
->mnt
)
663 mountpoint
= mnt
->mnt_mountpoint
;
664 path
->dentry
= mountpoint
;
665 path
->mnt
= &parent
->mnt
;
669 int follow_up(struct path
*path
)
671 struct mount
*mnt
= real_mount(path
->mnt
);
672 struct mount
*parent
;
673 struct dentry
*mountpoint
;
675 br_read_lock(&vfsmount_lock
);
676 parent
= mnt
->mnt_parent
;
677 if (&parent
->mnt
== path
->mnt
) {
678 br_read_unlock(&vfsmount_lock
);
681 mntget(&parent
->mnt
);
682 mountpoint
= dget(mnt
->mnt_mountpoint
);
683 br_read_unlock(&vfsmount_lock
);
685 path
->dentry
= mountpoint
;
687 path
->mnt
= &parent
->mnt
;
692 * Perform an automount
693 * - return -EISDIR to tell follow_managed() to stop and return the path we
696 static int follow_automount(struct path
*path
, unsigned flags
,
699 struct vfsmount
*mnt
;
702 if (!path
->dentry
->d_op
|| !path
->dentry
->d_op
->d_automount
)
705 /* We don't want to mount if someone's just doing a stat -
706 * unless they're stat'ing a directory and appended a '/' to
709 * We do, however, want to mount if someone wants to open or
710 * create a file of any type under the mountpoint, wants to
711 * traverse through the mountpoint or wants to open the
712 * mounted directory. Also, autofs may mark negative dentries
713 * as being automount points. These will need the attentions
714 * of the daemon to instantiate them before they can be used.
716 if (!(flags
& (LOOKUP_PARENT
| LOOKUP_DIRECTORY
|
717 LOOKUP_OPEN
| LOOKUP_CREATE
| LOOKUP_AUTOMOUNT
)) &&
718 path
->dentry
->d_inode
)
721 current
->total_link_count
++;
722 if (current
->total_link_count
>= 40)
725 mnt
= path
->dentry
->d_op
->d_automount(path
);
728 * The filesystem is allowed to return -EISDIR here to indicate
729 * it doesn't want to automount. For instance, autofs would do
730 * this so that its userspace daemon can mount on this dentry.
732 * However, we can only permit this if it's a terminal point in
733 * the path being looked up; if it wasn't then the remainder of
734 * the path is inaccessible and we should say so.
736 if (PTR_ERR(mnt
) == -EISDIR
&& (flags
& LOOKUP_PARENT
))
741 if (!mnt
) /* mount collision */
745 /* lock_mount() may release path->mnt on error */
749 err
= finish_automount(mnt
, path
);
753 /* Someone else made a mount here whilst we were busy */
758 path
->dentry
= dget(mnt
->mnt_root
);
767 * Handle a dentry that is managed in some way.
768 * - Flagged for transit management (autofs)
769 * - Flagged as mountpoint
770 * - Flagged as automount point
772 * This may only be called in refwalk mode.
774 * Serialization is taken care of in namespace.c
776 static int follow_managed(struct path
*path
, unsigned flags
)
778 struct vfsmount
*mnt
= path
->mnt
; /* held by caller, must be left alone */
780 bool need_mntput
= false;
783 /* Given that we're not holding a lock here, we retain the value in a
784 * local variable for each dentry as we look at it so that we don't see
785 * the components of that value change under us */
786 while (managed
= ACCESS_ONCE(path
->dentry
->d_flags
),
787 managed
&= DCACHE_MANAGED_DENTRY
,
788 unlikely(managed
!= 0)) {
789 /* Allow the filesystem to manage the transit without i_mutex
791 if (managed
& DCACHE_MANAGE_TRANSIT
) {
792 BUG_ON(!path
->dentry
->d_op
);
793 BUG_ON(!path
->dentry
->d_op
->d_manage
);
794 ret
= path
->dentry
->d_op
->d_manage(path
->dentry
, false);
799 /* Transit to a mounted filesystem. */
800 if (managed
& DCACHE_MOUNTED
) {
801 struct vfsmount
*mounted
= lookup_mnt(path
);
807 path
->dentry
= dget(mounted
->mnt_root
);
812 /* Something is mounted on this dentry in another
813 * namespace and/or whatever was mounted there in this
814 * namespace got unmounted before we managed to get the
818 /* Handle an automount point */
819 if (managed
& DCACHE_NEED_AUTOMOUNT
) {
820 ret
= follow_automount(path
, flags
, &need_mntput
);
826 /* We didn't change the current path point */
830 if (need_mntput
&& path
->mnt
== mnt
)
834 return ret
< 0 ? ret
: need_mntput
;
837 int follow_down_one(struct path
*path
)
839 struct vfsmount
*mounted
;
841 mounted
= lookup_mnt(path
);
846 path
->dentry
= dget(mounted
->mnt_root
);
852 static inline bool managed_dentry_might_block(struct dentry
*dentry
)
854 return (dentry
->d_flags
& DCACHE_MANAGE_TRANSIT
&&
855 dentry
->d_op
->d_manage(dentry
, true) < 0);
859 * Try to skip to top of mountpoint pile in rcuwalk mode. Fail if
860 * we meet a managed dentry that would need blocking.
862 static bool __follow_mount_rcu(struct nameidata
*nd
, struct path
*path
,
863 struct inode
**inode
)
866 struct mount
*mounted
;
868 * Don't forget we might have a non-mountpoint managed dentry
869 * that wants to block transit.
871 if (unlikely(managed_dentry_might_block(path
->dentry
)))
874 if (!d_mountpoint(path
->dentry
))
877 mounted
= __lookup_mnt(path
->mnt
, path
->dentry
, 1);
880 path
->mnt
= &mounted
->mnt
;
881 path
->dentry
= mounted
->mnt
.mnt_root
;
882 nd
->flags
|= LOOKUP_JUMPED
;
883 nd
->seq
= read_seqcount_begin(&path
->dentry
->d_seq
);
885 * Update the inode too. We don't need to re-check the
886 * dentry sequence number here after this d_inode read,
887 * because a mount-point is always pinned.
889 *inode
= path
->dentry
->d_inode
;
894 static void follow_mount_rcu(struct nameidata
*nd
)
896 while (d_mountpoint(nd
->path
.dentry
)) {
897 struct mount
*mounted
;
898 mounted
= __lookup_mnt(nd
->path
.mnt
, nd
->path
.dentry
, 1);
901 nd
->path
.mnt
= &mounted
->mnt
;
902 nd
->path
.dentry
= mounted
->mnt
.mnt_root
;
903 nd
->seq
= read_seqcount_begin(&nd
->path
.dentry
->d_seq
);
907 static int follow_dotdot_rcu(struct nameidata
*nd
)
912 if (nd
->path
.dentry
== nd
->root
.dentry
&&
913 nd
->path
.mnt
== nd
->root
.mnt
) {
916 if (nd
->path
.dentry
!= nd
->path
.mnt
->mnt_root
) {
917 struct dentry
*old
= nd
->path
.dentry
;
918 struct dentry
*parent
= old
->d_parent
;
921 seq
= read_seqcount_begin(&parent
->d_seq
);
922 if (read_seqcount_retry(&old
->d_seq
, nd
->seq
))
924 nd
->path
.dentry
= parent
;
928 if (!follow_up_rcu(&nd
->path
))
930 nd
->seq
= read_seqcount_begin(&nd
->path
.dentry
->d_seq
);
932 follow_mount_rcu(nd
);
933 nd
->inode
= nd
->path
.dentry
->d_inode
;
937 nd
->flags
&= ~LOOKUP_RCU
;
938 if (!(nd
->flags
& LOOKUP_ROOT
))
941 br_read_unlock(&vfsmount_lock
);
946 * Follow down to the covering mount currently visible to userspace. At each
947 * point, the filesystem owning that dentry may be queried as to whether the
948 * caller is permitted to proceed or not.
950 int follow_down(struct path
*path
)
955 while (managed
= ACCESS_ONCE(path
->dentry
->d_flags
),
956 unlikely(managed
& DCACHE_MANAGED_DENTRY
)) {
957 /* Allow the filesystem to manage the transit without i_mutex
960 * We indicate to the filesystem if someone is trying to mount
961 * something here. This gives autofs the chance to deny anyone
962 * other than its daemon the right to mount on its
965 * The filesystem may sleep at this point.
967 if (managed
& DCACHE_MANAGE_TRANSIT
) {
968 BUG_ON(!path
->dentry
->d_op
);
969 BUG_ON(!path
->dentry
->d_op
->d_manage
);
970 ret
= path
->dentry
->d_op
->d_manage(
971 path
->dentry
, false);
973 return ret
== -EISDIR
? 0 : ret
;
976 /* Transit to a mounted filesystem. */
977 if (managed
& DCACHE_MOUNTED
) {
978 struct vfsmount
*mounted
= lookup_mnt(path
);
984 path
->dentry
= dget(mounted
->mnt_root
);
988 /* Don't handle automount points here */
995 * Skip to top of mountpoint pile in refwalk mode for follow_dotdot()
997 static void follow_mount(struct path
*path
)
999 while (d_mountpoint(path
->dentry
)) {
1000 struct vfsmount
*mounted
= lookup_mnt(path
);
1005 path
->mnt
= mounted
;
1006 path
->dentry
= dget(mounted
->mnt_root
);
1010 static void follow_dotdot(struct nameidata
*nd
)
1015 struct dentry
*old
= nd
->path
.dentry
;
1017 if (nd
->path
.dentry
== nd
->root
.dentry
&&
1018 nd
->path
.mnt
== nd
->root
.mnt
) {
1021 if (nd
->path
.dentry
!= nd
->path
.mnt
->mnt_root
) {
1022 /* rare case of legitimate dget_parent()... */
1023 nd
->path
.dentry
= dget_parent(nd
->path
.dentry
);
1027 if (!follow_up(&nd
->path
))
1030 follow_mount(&nd
->path
);
1031 nd
->inode
= nd
->path
.dentry
->d_inode
;
1035 * This looks up the name in dcache, possibly revalidates the old dentry and
1036 * allocates a new one if not found or not valid. In the need_lookup argument
1037 * returns whether i_op->lookup is necessary.
1039 * dir->d_inode->i_mutex must be held
1041 static struct dentry
*lookup_dcache(struct qstr
*name
, struct dentry
*dir
,
1042 unsigned int flags
, bool *need_lookup
)
1044 struct dentry
*dentry
;
1047 *need_lookup
= false;
1048 dentry
= d_lookup(dir
, name
);
1050 if (d_need_lookup(dentry
)) {
1051 *need_lookup
= true;
1052 } else if (dentry
->d_flags
& DCACHE_OP_REVALIDATE
) {
1053 error
= d_revalidate(dentry
, flags
);
1054 if (unlikely(error
<= 0)) {
1057 return ERR_PTR(error
);
1058 } else if (!d_invalidate(dentry
)) {
1067 dentry
= d_alloc(dir
, name
);
1068 if (unlikely(!dentry
))
1069 return ERR_PTR(-ENOMEM
);
1071 *need_lookup
= true;
1077 * Call i_op->lookup on the dentry. The dentry must be negative but may be
1078 * hashed if it was pouplated with DCACHE_NEED_LOOKUP.
1080 * dir->d_inode->i_mutex must be held
1082 static struct dentry
*lookup_real(struct inode
*dir
, struct dentry
*dentry
,
1083 struct nameidata
*nd
)
1087 /* Don't create child dentry for a dead directory. */
1088 if (unlikely(IS_DEADDIR(dir
))) {
1090 return ERR_PTR(-ENOENT
);
1093 old
= dir
->i_op
->lookup(dir
, dentry
, nd
? nd
->flags
: 0);
1094 if (unlikely(old
)) {
1101 static struct dentry
*__lookup_hash(struct qstr
*name
,
1102 struct dentry
*base
, struct nameidata
*nd
)
1105 struct dentry
*dentry
;
1107 dentry
= lookup_dcache(name
, base
, nd
? nd
->flags
: 0, &need_lookup
);
1111 return lookup_real(base
->d_inode
, dentry
, nd
);
1115 * It's more convoluted than I'd like it to be, but... it's still fairly
1116 * small and for now I'd prefer to have fast path as straight as possible.
1117 * It _is_ time-critical.
1119 static int lookup_fast(struct nameidata
*nd
, struct qstr
*name
,
1120 struct path
*path
, struct inode
**inode
)
1122 struct vfsmount
*mnt
= nd
->path
.mnt
;
1123 struct dentry
*dentry
, *parent
= nd
->path
.dentry
;
1129 * Rename seqlock is not required here because in the off chance
1130 * of a false negative due to a concurrent rename, we're going to
1131 * do the non-racy lookup, below.
1133 if (nd
->flags
& LOOKUP_RCU
) {
1135 dentry
= __d_lookup_rcu(parent
, name
, &seq
, nd
->inode
);
1140 * This sequence count validates that the inode matches
1141 * the dentry name information from lookup.
1143 *inode
= dentry
->d_inode
;
1144 if (read_seqcount_retry(&dentry
->d_seq
, seq
))
1148 * This sequence count validates that the parent had no
1149 * changes while we did the lookup of the dentry above.
1151 * The memory barrier in read_seqcount_begin of child is
1152 * enough, we can use __read_seqcount_retry here.
1154 if (__read_seqcount_retry(&parent
->d_seq
, nd
->seq
))
1158 if (unlikely(d_need_lookup(dentry
)))
1160 if (unlikely(dentry
->d_flags
& DCACHE_OP_REVALIDATE
)) {
1161 status
= d_revalidate(dentry
, nd
->flags
);
1162 if (unlikely(status
<= 0)) {
1163 if (status
!= -ECHILD
)
1169 path
->dentry
= dentry
;
1170 if (unlikely(!__follow_mount_rcu(nd
, path
, inode
)))
1172 if (unlikely(path
->dentry
->d_flags
& DCACHE_NEED_AUTOMOUNT
))
1176 if (unlazy_walk(nd
, dentry
))
1179 dentry
= __d_lookup(parent
, name
);
1182 if (unlikely(!dentry
))
1185 if (unlikely(d_need_lookup(dentry
))) {
1190 if (unlikely(dentry
->d_flags
& DCACHE_OP_REVALIDATE
) && need_reval
)
1191 status
= d_revalidate(dentry
, nd
->flags
);
1192 if (unlikely(status
<= 0)) {
1197 if (!d_invalidate(dentry
)) {
1204 path
->dentry
= dentry
;
1205 err
= follow_managed(path
, nd
->flags
);
1206 if (unlikely(err
< 0)) {
1207 path_put_conditional(path
, nd
);
1211 nd
->flags
|= LOOKUP_JUMPED
;
1212 *inode
= path
->dentry
->d_inode
;
1219 /* Fast lookup failed, do it the slow way */
1220 static int lookup_slow(struct nameidata
*nd
, struct qstr
*name
,
1223 struct dentry
*dentry
, *parent
;
1226 parent
= nd
->path
.dentry
;
1227 BUG_ON(nd
->inode
!= parent
->d_inode
);
1229 mutex_lock(&parent
->d_inode
->i_mutex
);
1230 dentry
= __lookup_hash(name
, parent
, nd
);
1231 mutex_unlock(&parent
->d_inode
->i_mutex
);
1233 return PTR_ERR(dentry
);
1234 path
->mnt
= nd
->path
.mnt
;
1235 path
->dentry
= dentry
;
1236 err
= follow_managed(path
, nd
->flags
);
1237 if (unlikely(err
< 0)) {
1238 path_put_conditional(path
, nd
);
1242 nd
->flags
|= LOOKUP_JUMPED
;
1246 static inline int may_lookup(struct nameidata
*nd
)
1248 if (nd
->flags
& LOOKUP_RCU
) {
1249 int err
= inode_permission(nd
->inode
, MAY_EXEC
|MAY_NOT_BLOCK
);
1252 if (unlazy_walk(nd
, NULL
))
1255 return inode_permission(nd
->inode
, MAY_EXEC
);
1258 static inline int handle_dots(struct nameidata
*nd
, int type
)
1260 if (type
== LAST_DOTDOT
) {
1261 if (nd
->flags
& LOOKUP_RCU
) {
1262 if (follow_dotdot_rcu(nd
))
1270 static void terminate_walk(struct nameidata
*nd
)
1272 if (!(nd
->flags
& LOOKUP_RCU
)) {
1273 path_put(&nd
->path
);
1275 nd
->flags
&= ~LOOKUP_RCU
;
1276 if (!(nd
->flags
& LOOKUP_ROOT
))
1277 nd
->root
.mnt
= NULL
;
1279 br_read_unlock(&vfsmount_lock
);
1284 * Do we need to follow links? We _really_ want to be able
1285 * to do this check without having to look at inode->i_op,
1286 * so we keep a cache of "no, this doesn't need follow_link"
1287 * for the common case.
1289 static inline int should_follow_link(struct inode
*inode
, int follow
)
1291 if (unlikely(!(inode
->i_opflags
& IOP_NOFOLLOW
))) {
1292 if (likely(inode
->i_op
->follow_link
))
1295 /* This gets set once for the inode lifetime */
1296 spin_lock(&inode
->i_lock
);
1297 inode
->i_opflags
|= IOP_NOFOLLOW
;
1298 spin_unlock(&inode
->i_lock
);
1303 static inline int walk_component(struct nameidata
*nd
, struct path
*path
,
1304 struct qstr
*name
, int type
, int follow
)
1306 struct inode
*inode
;
1309 * "." and ".." are special - ".." especially so because it has
1310 * to be able to know about the current root directory and
1311 * parent relationships.
1313 if (unlikely(type
!= LAST_NORM
))
1314 return handle_dots(nd
, type
);
1315 err
= lookup_fast(nd
, name
, path
, &inode
);
1316 if (unlikely(err
)) {
1320 err
= lookup_slow(nd
, name
, path
);
1324 inode
= path
->dentry
->d_inode
;
1330 if (should_follow_link(inode
, follow
)) {
1331 if (nd
->flags
& LOOKUP_RCU
) {
1332 if (unlikely(unlazy_walk(nd
, path
->dentry
))) {
1337 BUG_ON(inode
!= path
->dentry
->d_inode
);
1340 path_to_nameidata(path
, nd
);
1345 path_to_nameidata(path
, nd
);
1352 * This limits recursive symlink follows to 8, while
1353 * limiting consecutive symlinks to 40.
1355 * Without that kind of total limit, nasty chains of consecutive
1356 * symlinks can cause almost arbitrarily long lookups.
1358 static inline int nested_symlink(struct path
*path
, struct nameidata
*nd
)
1362 if (unlikely(current
->link_count
>= MAX_NESTED_LINKS
)) {
1363 path_put_conditional(path
, nd
);
1364 path_put(&nd
->path
);
1367 BUG_ON(nd
->depth
>= MAX_NESTED_LINKS
);
1370 current
->link_count
++;
1373 struct path link
= *path
;
1376 res
= follow_link(&link
, nd
, &cookie
);
1379 res
= walk_component(nd
, path
, &nd
->last
,
1380 nd
->last_type
, LOOKUP_FOLLOW
);
1381 put_link(nd
, &link
, cookie
);
1384 current
->link_count
--;
1390 * We really don't want to look at inode->i_op->lookup
1391 * when we don't have to. So we keep a cache bit in
1392 * the inode ->i_opflags field that says "yes, we can
1393 * do lookup on this inode".
1395 static inline int can_lookup(struct inode
*inode
)
1397 if (likely(inode
->i_opflags
& IOP_LOOKUP
))
1399 if (likely(!inode
->i_op
->lookup
))
1402 /* We do this once for the lifetime of the inode */
1403 spin_lock(&inode
->i_lock
);
1404 inode
->i_opflags
|= IOP_LOOKUP
;
1405 spin_unlock(&inode
->i_lock
);
1410 * We can do the critical dentry name comparison and hashing
1411 * operations one word at a time, but we are limited to:
1413 * - Architectures with fast unaligned word accesses. We could
1414 * do a "get_unaligned()" if this helps and is sufficiently
1417 * - Little-endian machines (so that we can generate the mask
1418 * of low bytes efficiently). Again, we *could* do a byte
1419 * swapping load on big-endian architectures if that is not
1420 * expensive enough to make the optimization worthless.
1422 * - non-CONFIG_DEBUG_PAGEALLOC configurations (so that we
1423 * do not trap on the (extremely unlikely) case of a page
1424 * crossing operation.
1426 * - Furthermore, we need an efficient 64-bit compile for the
1427 * 64-bit case in order to generate the "number of bytes in
1428 * the final mask". Again, that could be replaced with a
1429 * efficient population count instruction or similar.
1431 #ifdef CONFIG_DCACHE_WORD_ACCESS
1433 #include <asm/word-at-a-time.h>
1437 static inline unsigned int fold_hash(unsigned long hash
)
1439 hash
+= hash
>> (8*sizeof(int));
1443 #else /* 32-bit case */
1445 #define fold_hash(x) (x)
1449 unsigned int full_name_hash(const unsigned char *name
, unsigned int len
)
1451 unsigned long a
, mask
;
1452 unsigned long hash
= 0;
1455 a
= load_unaligned_zeropad(name
);
1456 if (len
< sizeof(unsigned long))
1460 name
+= sizeof(unsigned long);
1461 len
-= sizeof(unsigned long);
1465 mask
= ~(~0ul << len
*8);
1468 return fold_hash(hash
);
1470 EXPORT_SYMBOL(full_name_hash
);
1473 * Calculate the length and hash of the path component, and
1474 * return the length of the component;
1476 static inline unsigned long hash_name(const char *name
, unsigned int *hashp
)
1478 unsigned long a
, b
, adata
, bdata
, mask
, hash
, len
;
1479 const struct word_at_a_time constants
= WORD_AT_A_TIME_CONSTANTS
;
1482 len
= -sizeof(unsigned long);
1484 hash
= (hash
+ a
) * 9;
1485 len
+= sizeof(unsigned long);
1486 a
= load_unaligned_zeropad(name
+len
);
1487 b
= a
^ REPEAT_BYTE('/');
1488 } while (!(has_zero(a
, &adata
, &constants
) | has_zero(b
, &bdata
, &constants
)));
1490 adata
= prep_zero_mask(a
, adata
, &constants
);
1491 bdata
= prep_zero_mask(b
, bdata
, &constants
);
1493 mask
= create_zero_mask(adata
| bdata
);
1495 hash
+= a
& zero_bytemask(mask
);
1496 *hashp
= fold_hash(hash
);
1498 return len
+ find_zero(mask
);
1503 unsigned int full_name_hash(const unsigned char *name
, unsigned int len
)
1505 unsigned long hash
= init_name_hash();
1507 hash
= partial_name_hash(*name
++, hash
);
1508 return end_name_hash(hash
);
1510 EXPORT_SYMBOL(full_name_hash
);
1513 * We know there's a real path component here of at least
1516 static inline unsigned long hash_name(const char *name
, unsigned int *hashp
)
1518 unsigned long hash
= init_name_hash();
1519 unsigned long len
= 0, c
;
1521 c
= (unsigned char)*name
;
1524 hash
= partial_name_hash(c
, hash
);
1525 c
= (unsigned char)name
[len
];
1526 } while (c
&& c
!= '/');
1527 *hashp
= end_name_hash(hash
);
1535 * This is the basic name resolution function, turning a pathname into
1536 * the final dentry. We expect 'base' to be positive and a directory.
1538 * Returns 0 and nd will have valid dentry and mnt on success.
1539 * Returns error and drops reference to input namei data on failure.
1541 static int link_path_walk(const char *name
, struct nameidata
*nd
)
1551 /* At this point we know we have a real path component. */
1557 err
= may_lookup(nd
);
1561 len
= hash_name(name
, &this.hash
);
1566 if (name
[0] == '.') switch (len
) {
1568 if (name
[1] == '.') {
1570 nd
->flags
|= LOOKUP_JUMPED
;
1576 if (likely(type
== LAST_NORM
)) {
1577 struct dentry
*parent
= nd
->path
.dentry
;
1578 nd
->flags
&= ~LOOKUP_JUMPED
;
1579 if (unlikely(parent
->d_flags
& DCACHE_OP_HASH
)) {
1580 err
= parent
->d_op
->d_hash(parent
, nd
->inode
,
1588 goto last_component
;
1590 * If it wasn't NUL, we know it was '/'. Skip that
1591 * slash, and continue until no more slashes.
1595 } while (unlikely(name
[len
] == '/'));
1597 goto last_component
;
1600 err
= walk_component(nd
, &next
, &this, type
, LOOKUP_FOLLOW
);
1605 err
= nested_symlink(&next
, nd
);
1609 if (can_lookup(nd
->inode
))
1613 /* here ends the main loop */
1617 nd
->last_type
= type
;
1624 static int path_init(int dfd
, const char *name
, unsigned int flags
,
1625 struct nameidata
*nd
, struct file
**fp
)
1631 nd
->last_type
= LAST_ROOT
; /* if there are only slashes... */
1632 nd
->flags
= flags
| LOOKUP_JUMPED
;
1634 if (flags
& LOOKUP_ROOT
) {
1635 struct inode
*inode
= nd
->root
.dentry
->d_inode
;
1637 if (!inode
->i_op
->lookup
)
1639 retval
= inode_permission(inode
, MAY_EXEC
);
1643 nd
->path
= nd
->root
;
1645 if (flags
& LOOKUP_RCU
) {
1646 br_read_lock(&vfsmount_lock
);
1648 nd
->seq
= __read_seqcount_begin(&nd
->path
.dentry
->d_seq
);
1650 path_get(&nd
->path
);
1655 nd
->root
.mnt
= NULL
;
1658 if (flags
& LOOKUP_RCU
) {
1659 br_read_lock(&vfsmount_lock
);
1664 path_get(&nd
->root
);
1666 nd
->path
= nd
->root
;
1667 } else if (dfd
== AT_FDCWD
) {
1668 if (flags
& LOOKUP_RCU
) {
1669 struct fs_struct
*fs
= current
->fs
;
1672 br_read_lock(&vfsmount_lock
);
1676 seq
= read_seqcount_begin(&fs
->seq
);
1678 nd
->seq
= __read_seqcount_begin(&nd
->path
.dentry
->d_seq
);
1679 } while (read_seqcount_retry(&fs
->seq
, seq
));
1681 get_fs_pwd(current
->fs
, &nd
->path
);
1684 struct dentry
*dentry
;
1686 file
= fget_raw_light(dfd
, &fput_needed
);
1691 dentry
= file
->f_path
.dentry
;
1695 if (!S_ISDIR(dentry
->d_inode
->i_mode
))
1698 retval
= inode_permission(dentry
->d_inode
, MAY_EXEC
);
1703 nd
->path
= file
->f_path
;
1704 if (flags
& LOOKUP_RCU
) {
1707 nd
->seq
= __read_seqcount_begin(&nd
->path
.dentry
->d_seq
);
1708 br_read_lock(&vfsmount_lock
);
1711 path_get(&file
->f_path
);
1712 fput_light(file
, fput_needed
);
1716 nd
->inode
= nd
->path
.dentry
->d_inode
;
1720 fput_light(file
, fput_needed
);
1725 static inline int lookup_last(struct nameidata
*nd
, struct path
*path
)
1727 if (nd
->last_type
== LAST_NORM
&& nd
->last
.name
[nd
->last
.len
])
1728 nd
->flags
|= LOOKUP_FOLLOW
| LOOKUP_DIRECTORY
;
1730 nd
->flags
&= ~LOOKUP_PARENT
;
1731 return walk_component(nd
, path
, &nd
->last
, nd
->last_type
,
1732 nd
->flags
& LOOKUP_FOLLOW
);
1735 /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
1736 static int path_lookupat(int dfd
, const char *name
,
1737 unsigned int flags
, struct nameidata
*nd
)
1739 struct file
*base
= NULL
;
1744 * Path walking is largely split up into 2 different synchronisation
1745 * schemes, rcu-walk and ref-walk (explained in
1746 * Documentation/filesystems/path-lookup.txt). These share much of the
1747 * path walk code, but some things particularly setup, cleanup, and
1748 * following mounts are sufficiently divergent that functions are
1749 * duplicated. Typically there is a function foo(), and its RCU
1750 * analogue, foo_rcu().
1752 * -ECHILD is the error number of choice (just to avoid clashes) that
1753 * is returned if some aspect of an rcu-walk fails. Such an error must
1754 * be handled by restarting a traditional ref-walk (which will always
1755 * be able to complete).
1757 err
= path_init(dfd
, name
, flags
| LOOKUP_PARENT
, nd
, &base
);
1762 current
->total_link_count
= 0;
1763 err
= link_path_walk(name
, nd
);
1765 if (!err
&& !(flags
& LOOKUP_PARENT
)) {
1766 err
= lookup_last(nd
, &path
);
1769 struct path link
= path
;
1770 nd
->flags
|= LOOKUP_PARENT
;
1771 err
= follow_link(&link
, nd
, &cookie
);
1774 err
= lookup_last(nd
, &path
);
1775 put_link(nd
, &link
, cookie
);
1780 err
= complete_walk(nd
);
1782 if (!err
&& nd
->flags
& LOOKUP_DIRECTORY
) {
1783 if (!nd
->inode
->i_op
->lookup
) {
1784 path_put(&nd
->path
);
1792 if (nd
->root
.mnt
&& !(nd
->flags
& LOOKUP_ROOT
)) {
1793 path_put(&nd
->root
);
1794 nd
->root
.mnt
= NULL
;
1799 static int do_path_lookup(int dfd
, const char *name
,
1800 unsigned int flags
, struct nameidata
*nd
)
1802 int retval
= path_lookupat(dfd
, name
, flags
| LOOKUP_RCU
, nd
);
1803 if (unlikely(retval
== -ECHILD
))
1804 retval
= path_lookupat(dfd
, name
, flags
, nd
);
1805 if (unlikely(retval
== -ESTALE
))
1806 retval
= path_lookupat(dfd
, name
, flags
| LOOKUP_REVAL
, nd
);
1808 if (likely(!retval
)) {
1809 if (unlikely(!audit_dummy_context())) {
1810 if (nd
->path
.dentry
&& nd
->inode
)
1811 audit_inode(name
, nd
->path
.dentry
);
1817 int kern_path_parent(const char *name
, struct nameidata
*nd
)
1819 return do_path_lookup(AT_FDCWD
, name
, LOOKUP_PARENT
, nd
);
1822 int kern_path(const char *name
, unsigned int flags
, struct path
*path
)
1824 struct nameidata nd
;
1825 int res
= do_path_lookup(AT_FDCWD
, name
, flags
, &nd
);
1832 * vfs_path_lookup - lookup a file path relative to a dentry-vfsmount pair
1833 * @dentry: pointer to dentry of the base directory
1834 * @mnt: pointer to vfs mount of the base directory
1835 * @name: pointer to file name
1836 * @flags: lookup flags
1837 * @path: pointer to struct path to fill
1839 int vfs_path_lookup(struct dentry
*dentry
, struct vfsmount
*mnt
,
1840 const char *name
, unsigned int flags
,
1843 struct nameidata nd
;
1845 nd
.root
.dentry
= dentry
;
1847 BUG_ON(flags
& LOOKUP_PARENT
);
1848 /* the first argument of do_path_lookup() is ignored with LOOKUP_ROOT */
1849 err
= do_path_lookup(AT_FDCWD
, name
, flags
| LOOKUP_ROOT
, &nd
);
1856 * Restricted form of lookup. Doesn't follow links, single-component only,
1857 * needs parent already locked. Doesn't follow mounts.
1860 static struct dentry
*lookup_hash(struct nameidata
*nd
)
1862 return __lookup_hash(&nd
->last
, nd
->path
.dentry
, nd
);
1866 * lookup_one_len - filesystem helper to lookup single pathname component
1867 * @name: pathname component to lookup
1868 * @base: base directory to lookup from
1869 * @len: maximum length @len should be interpreted to
1871 * Note that this routine is purely a helper for filesystem usage and should
1872 * not be called by generic code. Also note that by using this function the
1873 * nameidata argument is passed to the filesystem methods and a filesystem
1874 * using this helper needs to be prepared for that.
1876 struct dentry
*lookup_one_len(const char *name
, struct dentry
*base
, int len
)
1882 WARN_ON_ONCE(!mutex_is_locked(&base
->d_inode
->i_mutex
));
1886 this.hash
= full_name_hash(name
, len
);
1888 return ERR_PTR(-EACCES
);
1891 c
= *(const unsigned char *)name
++;
1892 if (c
== '/' || c
== '\0')
1893 return ERR_PTR(-EACCES
);
1896 * See if the low-level filesystem might want
1897 * to use its own hash..
1899 if (base
->d_flags
& DCACHE_OP_HASH
) {
1900 int err
= base
->d_op
->d_hash(base
, base
->d_inode
, &this);
1902 return ERR_PTR(err
);
1905 err
= inode_permission(base
->d_inode
, MAY_EXEC
);
1907 return ERR_PTR(err
);
1909 return __lookup_hash(&this, base
, NULL
);
1912 int user_path_at_empty(int dfd
, const char __user
*name
, unsigned flags
,
1913 struct path
*path
, int *empty
)
1915 struct nameidata nd
;
1916 char *tmp
= getname_flags(name
, flags
, empty
);
1917 int err
= PTR_ERR(tmp
);
1920 BUG_ON(flags
& LOOKUP_PARENT
);
1922 err
= do_path_lookup(dfd
, tmp
, flags
, &nd
);
1930 int user_path_at(int dfd
, const char __user
*name
, unsigned flags
,
1933 return user_path_at_empty(dfd
, name
, flags
, path
, NULL
);
1936 static int user_path_parent(int dfd
, const char __user
*path
,
1937 struct nameidata
*nd
, char **name
)
1939 char *s
= getname(path
);
1945 error
= do_path_lookup(dfd
, s
, LOOKUP_PARENT
, nd
);
1955 * It's inline, so penalty for filesystems that don't use sticky bit is
1958 static inline int check_sticky(struct inode
*dir
, struct inode
*inode
)
1960 kuid_t fsuid
= current_fsuid();
1962 if (!(dir
->i_mode
& S_ISVTX
))
1964 if (uid_eq(inode
->i_uid
, fsuid
))
1966 if (uid_eq(dir
->i_uid
, fsuid
))
1968 return !inode_capable(inode
, CAP_FOWNER
);
1972 * Check whether we can remove a link victim from directory dir, check
1973 * whether the type of victim is right.
1974 * 1. We can't do it if dir is read-only (done in permission())
1975 * 2. We should have write and exec permissions on dir
1976 * 3. We can't remove anything from append-only dir
1977 * 4. We can't do anything with immutable dir (done in permission())
1978 * 5. If the sticky bit on dir is set we should either
1979 * a. be owner of dir, or
1980 * b. be owner of victim, or
1981 * c. have CAP_FOWNER capability
1982 * 6. If the victim is append-only or immutable we can't do antyhing with
1983 * links pointing to it.
1984 * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR.
1985 * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR.
1986 * 9. We can't remove a root or mountpoint.
1987 * 10. We don't allow removal of NFS sillyrenamed files; it's handled by
1988 * nfs_async_unlink().
1990 static int may_delete(struct inode
*dir
,struct dentry
*victim
,int isdir
)
1994 if (!victim
->d_inode
)
1997 BUG_ON(victim
->d_parent
->d_inode
!= dir
);
1998 audit_inode_child(victim
, dir
);
2000 error
= inode_permission(dir
, MAY_WRITE
| MAY_EXEC
);
2005 if (check_sticky(dir
, victim
->d_inode
)||IS_APPEND(victim
->d_inode
)||
2006 IS_IMMUTABLE(victim
->d_inode
) || IS_SWAPFILE(victim
->d_inode
))
2009 if (!S_ISDIR(victim
->d_inode
->i_mode
))
2011 if (IS_ROOT(victim
))
2013 } else if (S_ISDIR(victim
->d_inode
->i_mode
))
2015 if (IS_DEADDIR(dir
))
2017 if (victim
->d_flags
& DCACHE_NFSFS_RENAMED
)
2022 /* Check whether we can create an object with dentry child in directory
2024 * 1. We can't do it if child already exists (open has special treatment for
2025 * this case, but since we are inlined it's OK)
2026 * 2. We can't do it if dir is read-only (done in permission())
2027 * 3. We should have write and exec permissions on dir
2028 * 4. We can't do it if dir is immutable (done in permission())
2030 static inline int may_create(struct inode
*dir
, struct dentry
*child
)
2034 if (IS_DEADDIR(dir
))
2036 return inode_permission(dir
, MAY_WRITE
| MAY_EXEC
);
2040 * p1 and p2 should be directories on the same fs.
2042 struct dentry
*lock_rename(struct dentry
*p1
, struct dentry
*p2
)
2047 mutex_lock_nested(&p1
->d_inode
->i_mutex
, I_MUTEX_PARENT
);
2051 mutex_lock(&p1
->d_inode
->i_sb
->s_vfs_rename_mutex
);
2053 p
= d_ancestor(p2
, p1
);
2055 mutex_lock_nested(&p2
->d_inode
->i_mutex
, I_MUTEX_PARENT
);
2056 mutex_lock_nested(&p1
->d_inode
->i_mutex
, I_MUTEX_CHILD
);
2060 p
= d_ancestor(p1
, p2
);
2062 mutex_lock_nested(&p1
->d_inode
->i_mutex
, I_MUTEX_PARENT
);
2063 mutex_lock_nested(&p2
->d_inode
->i_mutex
, I_MUTEX_CHILD
);
2067 mutex_lock_nested(&p1
->d_inode
->i_mutex
, I_MUTEX_PARENT
);
2068 mutex_lock_nested(&p2
->d_inode
->i_mutex
, I_MUTEX_CHILD
);
2072 void unlock_rename(struct dentry
*p1
, struct dentry
*p2
)
2074 mutex_unlock(&p1
->d_inode
->i_mutex
);
2076 mutex_unlock(&p2
->d_inode
->i_mutex
);
2077 mutex_unlock(&p1
->d_inode
->i_sb
->s_vfs_rename_mutex
);
2081 int vfs_create(struct inode
*dir
, struct dentry
*dentry
, umode_t mode
,
2082 struct nameidata
*nd
)
2084 int error
= may_create(dir
, dentry
);
2089 if (!dir
->i_op
->create
)
2090 return -EACCES
; /* shouldn't it be ENOSYS? */
2093 error
= security_inode_create(dir
, dentry
, mode
);
2096 error
= dir
->i_op
->create(dir
, dentry
, mode
, nd
);
2098 fsnotify_create(dir
, dentry
);
2102 static int may_open(struct path
*path
, int acc_mode
, int flag
)
2104 struct dentry
*dentry
= path
->dentry
;
2105 struct inode
*inode
= dentry
->d_inode
;
2115 switch (inode
->i_mode
& S_IFMT
) {
2119 if (acc_mode
& MAY_WRITE
)
2124 if (path
->mnt
->mnt_flags
& MNT_NODEV
)
2133 error
= inode_permission(inode
, acc_mode
);
2138 * An append-only file must be opened in append mode for writing.
2140 if (IS_APPEND(inode
)) {
2141 if ((flag
& O_ACCMODE
) != O_RDONLY
&& !(flag
& O_APPEND
))
2147 /* O_NOATIME can only be set by the owner or superuser */
2148 if (flag
& O_NOATIME
&& !inode_owner_or_capable(inode
))
2154 static int handle_truncate(struct file
*filp
)
2156 struct path
*path
= &filp
->f_path
;
2157 struct inode
*inode
= path
->dentry
->d_inode
;
2158 int error
= get_write_access(inode
);
2162 * Refuse to truncate files with mandatory locks held on them.
2164 error
= locks_verify_locked(inode
);
2166 error
= security_path_truncate(path
);
2168 error
= do_truncate(path
->dentry
, 0,
2169 ATTR_MTIME
|ATTR_CTIME
|ATTR_OPEN
,
2172 put_write_access(inode
);
2176 static inline int open_to_namei_flags(int flag
)
2178 if ((flag
& O_ACCMODE
) == 3)
2183 static int may_o_create(struct path
*dir
, struct dentry
*dentry
, umode_t mode
)
2185 int error
= security_path_mknod(dir
, dentry
, mode
, 0);
2189 error
= inode_permission(dir
->dentry
->d_inode
, MAY_WRITE
| MAY_EXEC
);
2193 return security_inode_create(dir
->dentry
->d_inode
, dentry
, mode
);
2196 static int atomic_open(struct nameidata
*nd
, struct dentry
*dentry
,
2197 struct path
*path
, struct file
*file
,
2198 const struct open_flags
*op
,
2199 bool *want_write
, bool need_lookup
,
2202 struct inode
*dir
= nd
->path
.dentry
->d_inode
;
2203 unsigned open_flag
= open_to_namei_flags(op
->open_flag
);
2207 int create_error
= 0;
2208 struct dentry
*const DENTRY_NOT_SET
= (void *) -1UL;
2210 BUG_ON(dentry
->d_inode
);
2212 /* Don't create child dentry for a dead directory. */
2213 if (unlikely(IS_DEADDIR(dir
))) {
2218 mode
= op
->mode
& S_IALLUGO
;
2219 if ((open_flag
& O_CREAT
) && !IS_POSIXACL(dir
))
2220 mode
&= ~current_umask();
2222 if (open_flag
& O_EXCL
) {
2223 open_flag
&= ~O_TRUNC
;
2224 *opened
|= FILE_CREATED
;
2228 * Checking write permission is tricky, bacuse we don't know if we are
2229 * going to actually need it: O_CREAT opens should work as long as the
2230 * file exists. But checking existence breaks atomicity. The trick is
2231 * to check access and if not granted clear O_CREAT from the flags.
2233 * Another problem is returing the "right" error value (e.g. for an
2234 * O_EXCL open we want to return EEXIST not EROFS).
2236 if ((open_flag
& (O_CREAT
| O_TRUNC
)) ||
2237 (open_flag
& O_ACCMODE
) != O_RDONLY
) {
2238 error
= mnt_want_write(nd
->path
.mnt
);
2241 } else if (!(open_flag
& O_CREAT
)) {
2243 * No O_CREATE -> atomicity not a requirement -> fall
2244 * back to lookup + open
2247 } else if (open_flag
& (O_EXCL
| O_TRUNC
)) {
2248 /* Fall back and fail with the right error */
2249 create_error
= error
;
2252 /* No side effects, safe to clear O_CREAT */
2253 create_error
= error
;
2254 open_flag
&= ~O_CREAT
;
2258 if (open_flag
& O_CREAT
) {
2259 error
= may_o_create(&nd
->path
, dentry
, op
->mode
);
2261 create_error
= error
;
2262 if (open_flag
& O_EXCL
)
2264 open_flag
&= ~O_CREAT
;
2268 if (nd
->flags
& LOOKUP_DIRECTORY
)
2269 open_flag
|= O_DIRECTORY
;
2271 file
->f_path
.dentry
= DENTRY_NOT_SET
;
2272 file
->f_path
.mnt
= nd
->path
.mnt
;
2273 error
= dir
->i_op
->atomic_open(dir
, dentry
, file
, open_flag
, mode
,
2276 if (create_error
&& error
== -ENOENT
)
2277 error
= create_error
;
2281 acc_mode
= op
->acc_mode
;
2282 if (*opened
& FILE_CREATED
) {
2283 fsnotify_create(dir
, dentry
);
2284 acc_mode
= MAY_OPEN
;
2287 if (error
) { /* returned 1, that is */
2288 if (WARN_ON(file
->f_path
.dentry
== DENTRY_NOT_SET
)) {
2292 if (file
->f_path
.dentry
) {
2294 dentry
= file
->f_path
.dentry
;
2300 * We didn't have the inode before the open, so check open permission
2303 error
= may_open(&file
->f_path
, acc_mode
, open_flag
);
2313 dentry
= lookup_real(dir
, dentry
, nd
);
2315 return PTR_ERR(dentry
);
2318 int open_flag
= op
->open_flag
;
2320 error
= create_error
;
2321 if ((open_flag
& O_EXCL
)) {
2322 if (!dentry
->d_inode
)
2324 } else if (!dentry
->d_inode
) {
2326 } else if ((open_flag
& O_TRUNC
) &&
2327 S_ISREG(dentry
->d_inode
->i_mode
)) {
2330 /* will fail later, go on to get the right error */
2334 path
->dentry
= dentry
;
2335 path
->mnt
= nd
->path
.mnt
;
2340 * Lookup, maybe create and open the last component
2342 * Must be called with i_mutex held on parent.
2344 * Returns open file or NULL on success, error otherwise. NULL means no open
2345 * was performed, only lookup.
2347 static int lookup_open(struct nameidata
*nd
, struct path
*path
,
2349 const struct open_flags
*op
,
2350 bool *want_write
, int *opened
)
2352 struct dentry
*dir
= nd
->path
.dentry
;
2353 struct inode
*dir_inode
= dir
->d_inode
;
2354 struct dentry
*dentry
;
2358 *opened
&= ~FILE_CREATED
;
2359 dentry
= lookup_dcache(&nd
->last
, dir
, nd
->flags
, &need_lookup
);
2361 return PTR_ERR(dentry
);
2363 /* Cached positive dentry: will open in f_op->open */
2364 if (!need_lookup
&& dentry
->d_inode
)
2367 if ((nd
->flags
& LOOKUP_OPEN
) && dir_inode
->i_op
->atomic_open
) {
2368 return atomic_open(nd
, dentry
, path
, file
, op
, want_write
,
2369 need_lookup
, opened
);
2373 BUG_ON(dentry
->d_inode
);
2375 dentry
= lookup_real(dir_inode
, dentry
, nd
);
2377 return PTR_ERR(dentry
);
2380 /* Negative dentry, just create the file */
2381 if (!dentry
->d_inode
&& (op
->open_flag
& O_CREAT
)) {
2382 umode_t mode
= op
->mode
;
2383 if (!IS_POSIXACL(dir
->d_inode
))
2384 mode
&= ~current_umask();
2386 * This write is needed to ensure that a
2387 * rw->ro transition does not occur between
2388 * the time when the file is created and when
2389 * a permanent write count is taken through
2390 * the 'struct file' in finish_open().
2392 error
= mnt_want_write(nd
->path
.mnt
);
2396 *opened
|= FILE_CREATED
;
2397 error
= security_path_mknod(&nd
->path
, dentry
, mode
, 0);
2400 error
= vfs_create(dir
->d_inode
, dentry
, mode
, nd
);
2405 path
->dentry
= dentry
;
2406 path
->mnt
= nd
->path
.mnt
;
2415 * Handle the last step of open()
2417 static int do_last(struct nameidata
*nd
, struct path
*path
,
2418 struct file
*file
, const struct open_flags
*op
,
2419 int *opened
, const char *pathname
)
2421 struct dentry
*dir
= nd
->path
.dentry
;
2422 int open_flag
= op
->open_flag
;
2423 bool will_truncate
= (open_flag
& O_TRUNC
) != 0;
2424 bool want_write
= false;
2425 int acc_mode
= op
->acc_mode
;
2426 struct inode
*inode
;
2427 bool symlink_ok
= false;
2428 struct path save_parent
= { .dentry
= NULL
, .mnt
= NULL
};
2429 bool retried
= false;
2432 nd
->flags
&= ~LOOKUP_PARENT
;
2433 nd
->flags
|= op
->intent
;
2435 switch (nd
->last_type
) {
2438 error
= handle_dots(nd
, nd
->last_type
);
2443 error
= complete_walk(nd
);
2446 audit_inode(pathname
, nd
->path
.dentry
);
2447 if (open_flag
& O_CREAT
) {
2453 error
= complete_walk(nd
);
2456 audit_inode(pathname
, dir
);
2460 if (!(open_flag
& O_CREAT
)) {
2461 if (nd
->last
.name
[nd
->last
.len
])
2462 nd
->flags
|= LOOKUP_FOLLOW
| LOOKUP_DIRECTORY
;
2463 if (open_flag
& O_PATH
&& !(nd
->flags
& LOOKUP_FOLLOW
))
2465 /* we _can_ be in RCU mode here */
2466 error
= lookup_fast(nd
, &nd
->last
, path
, &inode
);
2473 BUG_ON(nd
->inode
!= dir
->d_inode
);
2475 /* create side of things */
2477 * This will *only* deal with leaving RCU mode - LOOKUP_JUMPED
2478 * has been cleared when we got to the last component we are
2481 error
= complete_walk(nd
);
2485 audit_inode(pathname
, dir
);
2487 /* trailing slashes? */
2488 if (nd
->last
.name
[nd
->last
.len
])
2493 mutex_lock(&dir
->d_inode
->i_mutex
);
2494 error
= lookup_open(nd
, path
, file
, op
, &want_write
, opened
);
2495 mutex_unlock(&dir
->d_inode
->i_mutex
);
2501 if ((*opened
& FILE_CREATED
) ||
2502 !S_ISREG(file
->f_path
.dentry
->d_inode
->i_mode
))
2503 will_truncate
= false;
2505 audit_inode(pathname
, file
->f_path
.dentry
);
2509 if (*opened
& FILE_CREATED
) {
2510 /* Don't check for write permission, don't truncate */
2511 open_flag
&= ~O_TRUNC
;
2512 will_truncate
= false;
2513 acc_mode
= MAY_OPEN
;
2514 path_to_nameidata(path
, nd
);
2515 goto finish_open_created
;
2519 * It already exists.
2521 audit_inode(pathname
, path
->dentry
);
2524 * If atomic_open() acquired write access it is dropped now due to
2525 * possible mount and symlink following (this might be optimized away if
2529 mnt_drop_write(nd
->path
.mnt
);
2534 if (open_flag
& O_EXCL
)
2537 error
= follow_managed(path
, nd
->flags
);
2542 nd
->flags
|= LOOKUP_JUMPED
;
2544 BUG_ON(nd
->flags
& LOOKUP_RCU
);
2545 inode
= path
->dentry
->d_inode
;
2547 /* we _can_ be in RCU mode here */
2550 path_to_nameidata(path
, nd
);
2554 if (should_follow_link(inode
, !symlink_ok
)) {
2555 if (nd
->flags
& LOOKUP_RCU
) {
2556 if (unlikely(unlazy_walk(nd
, path
->dentry
))) {
2561 BUG_ON(inode
!= path
->dentry
->d_inode
);
2565 if ((nd
->flags
& LOOKUP_RCU
) || nd
->path
.mnt
!= path
->mnt
) {
2566 path_to_nameidata(path
, nd
);
2568 save_parent
.dentry
= nd
->path
.dentry
;
2569 save_parent
.mnt
= mntget(path
->mnt
);
2570 nd
->path
.dentry
= path
->dentry
;
2574 /* Why this, you ask? _Now_ we might have grown LOOKUP_JUMPED... */
2575 error
= complete_walk(nd
);
2577 path_put(&save_parent
);
2581 if ((open_flag
& O_CREAT
) && S_ISDIR(nd
->inode
->i_mode
))
2584 if ((nd
->flags
& LOOKUP_DIRECTORY
) && !nd
->inode
->i_op
->lookup
)
2586 audit_inode(pathname
, nd
->path
.dentry
);
2588 if (!S_ISREG(nd
->inode
->i_mode
))
2589 will_truncate
= false;
2591 if (will_truncate
) {
2592 error
= mnt_want_write(nd
->path
.mnt
);
2597 finish_open_created
:
2598 error
= may_open(&nd
->path
, acc_mode
, open_flag
);
2601 file
->f_path
.mnt
= nd
->path
.mnt
;
2602 error
= finish_open(file
, nd
->path
.dentry
, NULL
, opened
);
2604 if (error
== -EOPENSTALE
)
2609 error
= open_check_o_direct(file
);
2612 error
= ima_file_check(file
, op
->acc_mode
);
2616 if (will_truncate
) {
2617 error
= handle_truncate(file
);
2623 mnt_drop_write(nd
->path
.mnt
);
2624 path_put(&save_parent
);
2629 path_put_conditional(path
, nd
);
2636 /* If no saved parent or already retried then can't retry */
2637 if (!save_parent
.dentry
|| retried
)
2640 BUG_ON(save_parent
.dentry
!= dir
);
2641 path_put(&nd
->path
);
2642 nd
->path
= save_parent
;
2643 nd
->inode
= dir
->d_inode
;
2644 save_parent
.mnt
= NULL
;
2645 save_parent
.dentry
= NULL
;
2647 mnt_drop_write(nd
->path
.mnt
);
2654 static struct file
*path_openat(int dfd
, const char *pathname
,
2655 struct nameidata
*nd
, const struct open_flags
*op
, int flags
)
2657 struct file
*base
= NULL
;
2663 file
= get_empty_filp();
2665 return ERR_PTR(-ENFILE
);
2667 file
->f_flags
= op
->open_flag
;
2669 error
= path_init(dfd
, pathname
, flags
| LOOKUP_PARENT
, nd
, &base
);
2670 if (unlikely(error
))
2673 current
->total_link_count
= 0;
2674 error
= link_path_walk(pathname
, nd
);
2675 if (unlikely(error
))
2678 error
= do_last(nd
, &path
, file
, op
, &opened
, pathname
);
2679 while (unlikely(error
> 0)) { /* trailing symlink */
2680 struct path link
= path
;
2682 if (!(nd
->flags
& LOOKUP_FOLLOW
)) {
2683 path_put_conditional(&path
, nd
);
2684 path_put(&nd
->path
);
2688 nd
->flags
|= LOOKUP_PARENT
;
2689 nd
->flags
&= ~(LOOKUP_OPEN
|LOOKUP_CREATE
|LOOKUP_EXCL
);
2690 error
= follow_link(&link
, nd
, &cookie
);
2691 if (unlikely(error
))
2693 error
= do_last(nd
, &path
, file
, op
, &opened
, pathname
);
2694 put_link(nd
, &link
, cookie
);
2697 if (nd
->root
.mnt
&& !(nd
->flags
& LOOKUP_ROOT
))
2698 path_put(&nd
->root
);
2701 if (!(opened
& FILE_OPENED
)) {
2705 if (unlikely(error
)) {
2706 if (error
== -EOPENSTALE
) {
2707 if (flags
& LOOKUP_RCU
)
2712 file
= ERR_PTR(error
);
2717 struct file
*do_filp_open(int dfd
, const char *pathname
,
2718 const struct open_flags
*op
, int flags
)
2720 struct nameidata nd
;
2723 filp
= path_openat(dfd
, pathname
, &nd
, op
, flags
| LOOKUP_RCU
);
2724 if (unlikely(filp
== ERR_PTR(-ECHILD
)))
2725 filp
= path_openat(dfd
, pathname
, &nd
, op
, flags
);
2726 if (unlikely(filp
== ERR_PTR(-ESTALE
)))
2727 filp
= path_openat(dfd
, pathname
, &nd
, op
, flags
| LOOKUP_REVAL
);
2731 struct file
*do_file_open_root(struct dentry
*dentry
, struct vfsmount
*mnt
,
2732 const char *name
, const struct open_flags
*op
, int flags
)
2734 struct nameidata nd
;
2738 nd
.root
.dentry
= dentry
;
2740 flags
|= LOOKUP_ROOT
;
2742 if (dentry
->d_inode
->i_op
->follow_link
&& op
->intent
& LOOKUP_OPEN
)
2743 return ERR_PTR(-ELOOP
);
2745 file
= path_openat(-1, name
, &nd
, op
, flags
| LOOKUP_RCU
);
2746 if (unlikely(file
== ERR_PTR(-ECHILD
)))
2747 file
= path_openat(-1, name
, &nd
, op
, flags
);
2748 if (unlikely(file
== ERR_PTR(-ESTALE
)))
2749 file
= path_openat(-1, name
, &nd
, op
, flags
| LOOKUP_REVAL
);
2753 struct dentry
*kern_path_create(int dfd
, const char *pathname
, struct path
*path
, int is_dir
)
2755 struct dentry
*dentry
= ERR_PTR(-EEXIST
);
2756 struct nameidata nd
;
2757 int error
= do_path_lookup(dfd
, pathname
, LOOKUP_PARENT
, &nd
);
2759 return ERR_PTR(error
);
2762 * Yucky last component or no last component at all?
2763 * (foo/., foo/.., /////)
2765 if (nd
.last_type
!= LAST_NORM
)
2767 nd
.flags
&= ~LOOKUP_PARENT
;
2768 nd
.flags
|= LOOKUP_CREATE
| LOOKUP_EXCL
;
2771 * Do the final lookup.
2773 mutex_lock_nested(&nd
.path
.dentry
->d_inode
->i_mutex
, I_MUTEX_PARENT
);
2774 dentry
= lookup_hash(&nd
);
2778 if (dentry
->d_inode
)
2781 * Special case - lookup gave negative, but... we had foo/bar/
2782 * From the vfs_mknod() POV we just have a negative dentry -
2783 * all is fine. Let's be bastards - you had / on the end, you've
2784 * been asking for (non-existent) directory. -ENOENT for you.
2786 if (unlikely(!is_dir
&& nd
.last
.name
[nd
.last
.len
])) {
2788 dentry
= ERR_PTR(-ENOENT
);
2795 dentry
= ERR_PTR(-EEXIST
);
2797 mutex_unlock(&nd
.path
.dentry
->d_inode
->i_mutex
);
2802 EXPORT_SYMBOL(kern_path_create
);
2804 struct dentry
*user_path_create(int dfd
, const char __user
*pathname
, struct path
*path
, int is_dir
)
2806 char *tmp
= getname(pathname
);
2809 return ERR_CAST(tmp
);
2810 res
= kern_path_create(dfd
, tmp
, path
, is_dir
);
2814 EXPORT_SYMBOL(user_path_create
);
2816 int vfs_mknod(struct inode
*dir
, struct dentry
*dentry
, umode_t mode
, dev_t dev
)
2818 int error
= may_create(dir
, dentry
);
2823 if ((S_ISCHR(mode
) || S_ISBLK(mode
)) && !capable(CAP_MKNOD
))
2826 if (!dir
->i_op
->mknod
)
2829 error
= devcgroup_inode_mknod(mode
, dev
);
2833 error
= security_inode_mknod(dir
, dentry
, mode
, dev
);
2837 error
= dir
->i_op
->mknod(dir
, dentry
, mode
, dev
);
2839 fsnotify_create(dir
, dentry
);
2843 static int may_mknod(umode_t mode
)
2845 switch (mode
& S_IFMT
) {
2851 case 0: /* zero mode translates to S_IFREG */
2860 SYSCALL_DEFINE4(mknodat
, int, dfd
, const char __user
*, filename
, umode_t
, mode
,
2863 struct dentry
*dentry
;
2870 dentry
= user_path_create(dfd
, filename
, &path
, 0);
2872 return PTR_ERR(dentry
);
2874 if (!IS_POSIXACL(path
.dentry
->d_inode
))
2875 mode
&= ~current_umask();
2876 error
= may_mknod(mode
);
2879 error
= mnt_want_write(path
.mnt
);
2882 error
= security_path_mknod(&path
, dentry
, mode
, dev
);
2884 goto out_drop_write
;
2885 switch (mode
& S_IFMT
) {
2886 case 0: case S_IFREG
:
2887 error
= vfs_create(path
.dentry
->d_inode
,dentry
,mode
,NULL
);
2889 case S_IFCHR
: case S_IFBLK
:
2890 error
= vfs_mknod(path
.dentry
->d_inode
,dentry
,mode
,
2891 new_decode_dev(dev
));
2893 case S_IFIFO
: case S_IFSOCK
:
2894 error
= vfs_mknod(path
.dentry
->d_inode
,dentry
,mode
,0);
2898 mnt_drop_write(path
.mnt
);
2901 mutex_unlock(&path
.dentry
->d_inode
->i_mutex
);
2907 SYSCALL_DEFINE3(mknod
, const char __user
*, filename
, umode_t
, mode
, unsigned, dev
)
2909 return sys_mknodat(AT_FDCWD
, filename
, mode
, dev
);
2912 int vfs_mkdir(struct inode
*dir
, struct dentry
*dentry
, umode_t mode
)
2914 int error
= may_create(dir
, dentry
);
2915 unsigned max_links
= dir
->i_sb
->s_max_links
;
2920 if (!dir
->i_op
->mkdir
)
2923 mode
&= (S_IRWXUGO
|S_ISVTX
);
2924 error
= security_inode_mkdir(dir
, dentry
, mode
);
2928 if (max_links
&& dir
->i_nlink
>= max_links
)
2931 error
= dir
->i_op
->mkdir(dir
, dentry
, mode
);
2933 fsnotify_mkdir(dir
, dentry
);
2937 SYSCALL_DEFINE3(mkdirat
, int, dfd
, const char __user
*, pathname
, umode_t
, mode
)
2939 struct dentry
*dentry
;
2943 dentry
= user_path_create(dfd
, pathname
, &path
, 1);
2945 return PTR_ERR(dentry
);
2947 if (!IS_POSIXACL(path
.dentry
->d_inode
))
2948 mode
&= ~current_umask();
2949 error
= mnt_want_write(path
.mnt
);
2952 error
= security_path_mkdir(&path
, dentry
, mode
);
2954 goto out_drop_write
;
2955 error
= vfs_mkdir(path
.dentry
->d_inode
, dentry
, mode
);
2957 mnt_drop_write(path
.mnt
);
2960 mutex_unlock(&path
.dentry
->d_inode
->i_mutex
);
2965 SYSCALL_DEFINE2(mkdir
, const char __user
*, pathname
, umode_t
, mode
)
2967 return sys_mkdirat(AT_FDCWD
, pathname
, mode
);
2971 * The dentry_unhash() helper will try to drop the dentry early: we
2972 * should have a usage count of 1 if we're the only user of this
2973 * dentry, and if that is true (possibly after pruning the dcache),
2974 * then we drop the dentry now.
2976 * A low-level filesystem can, if it choses, legally
2979 * if (!d_unhashed(dentry))
2982 * if it cannot handle the case of removing a directory
2983 * that is still in use by something else..
2985 void dentry_unhash(struct dentry
*dentry
)
2987 shrink_dcache_parent(dentry
);
2988 spin_lock(&dentry
->d_lock
);
2989 if (dentry
->d_count
== 1)
2991 spin_unlock(&dentry
->d_lock
);
2994 int vfs_rmdir(struct inode
*dir
, struct dentry
*dentry
)
2996 int error
= may_delete(dir
, dentry
, 1);
3001 if (!dir
->i_op
->rmdir
)
3005 mutex_lock(&dentry
->d_inode
->i_mutex
);
3008 if (d_mountpoint(dentry
))
3011 error
= security_inode_rmdir(dir
, dentry
);
3015 shrink_dcache_parent(dentry
);
3016 error
= dir
->i_op
->rmdir(dir
, dentry
);
3020 dentry
->d_inode
->i_flags
|= S_DEAD
;
3024 mutex_unlock(&dentry
->d_inode
->i_mutex
);
3031 static long do_rmdir(int dfd
, const char __user
*pathname
)
3035 struct dentry
*dentry
;
3036 struct nameidata nd
;
3038 error
= user_path_parent(dfd
, pathname
, &nd
, &name
);
3042 switch(nd
.last_type
) {
3054 nd
.flags
&= ~LOOKUP_PARENT
;
3056 mutex_lock_nested(&nd
.path
.dentry
->d_inode
->i_mutex
, I_MUTEX_PARENT
);
3057 dentry
= lookup_hash(&nd
);
3058 error
= PTR_ERR(dentry
);
3061 if (!dentry
->d_inode
) {
3065 error
= mnt_want_write(nd
.path
.mnt
);
3068 error
= security_path_rmdir(&nd
.path
, dentry
);
3071 error
= vfs_rmdir(nd
.path
.dentry
->d_inode
, dentry
);
3073 mnt_drop_write(nd
.path
.mnt
);
3077 mutex_unlock(&nd
.path
.dentry
->d_inode
->i_mutex
);
3084 SYSCALL_DEFINE1(rmdir
, const char __user
*, pathname
)
3086 return do_rmdir(AT_FDCWD
, pathname
);
3089 int vfs_unlink(struct inode
*dir
, struct dentry
*dentry
)
3091 int error
= may_delete(dir
, dentry
, 0);
3096 if (!dir
->i_op
->unlink
)
3099 mutex_lock(&dentry
->d_inode
->i_mutex
);
3100 if (d_mountpoint(dentry
))
3103 error
= security_inode_unlink(dir
, dentry
);
3105 error
= dir
->i_op
->unlink(dir
, dentry
);
3110 mutex_unlock(&dentry
->d_inode
->i_mutex
);
3112 /* We don't d_delete() NFS sillyrenamed files--they still exist. */
3113 if (!error
&& !(dentry
->d_flags
& DCACHE_NFSFS_RENAMED
)) {
3114 fsnotify_link_count(dentry
->d_inode
);
3122 * Make sure that the actual truncation of the file will occur outside its
3123 * directory's i_mutex. Truncate can take a long time if there is a lot of
3124 * writeout happening, and we don't want to prevent access to the directory
3125 * while waiting on the I/O.
3127 static long do_unlinkat(int dfd
, const char __user
*pathname
)
3131 struct dentry
*dentry
;
3132 struct nameidata nd
;
3133 struct inode
*inode
= NULL
;
3135 error
= user_path_parent(dfd
, pathname
, &nd
, &name
);
3140 if (nd
.last_type
!= LAST_NORM
)
3143 nd
.flags
&= ~LOOKUP_PARENT
;
3145 mutex_lock_nested(&nd
.path
.dentry
->d_inode
->i_mutex
, I_MUTEX_PARENT
);
3146 dentry
= lookup_hash(&nd
);
3147 error
= PTR_ERR(dentry
);
3148 if (!IS_ERR(dentry
)) {
3149 /* Why not before? Because we want correct error value */
3150 if (nd
.last
.name
[nd
.last
.len
])
3152 inode
= dentry
->d_inode
;
3156 error
= mnt_want_write(nd
.path
.mnt
);
3159 error
= security_path_unlink(&nd
.path
, dentry
);
3162 error
= vfs_unlink(nd
.path
.dentry
->d_inode
, dentry
);
3164 mnt_drop_write(nd
.path
.mnt
);
3168 mutex_unlock(&nd
.path
.dentry
->d_inode
->i_mutex
);
3170 iput(inode
); /* truncate the inode here */
3177 error
= !dentry
->d_inode
? -ENOENT
:
3178 S_ISDIR(dentry
->d_inode
->i_mode
) ? -EISDIR
: -ENOTDIR
;
3182 SYSCALL_DEFINE3(unlinkat
, int, dfd
, const char __user
*, pathname
, int, flag
)
3184 if ((flag
& ~AT_REMOVEDIR
) != 0)
3187 if (flag
& AT_REMOVEDIR
)
3188 return do_rmdir(dfd
, pathname
);
3190 return do_unlinkat(dfd
, pathname
);
3193 SYSCALL_DEFINE1(unlink
, const char __user
*, pathname
)
3195 return do_unlinkat(AT_FDCWD
, pathname
);
3198 int vfs_symlink(struct inode
*dir
, struct dentry
*dentry
, const char *oldname
)
3200 int error
= may_create(dir
, dentry
);
3205 if (!dir
->i_op
->symlink
)
3208 error
= security_inode_symlink(dir
, dentry
, oldname
);
3212 error
= dir
->i_op
->symlink(dir
, dentry
, oldname
);
3214 fsnotify_create(dir
, dentry
);
3218 SYSCALL_DEFINE3(symlinkat
, const char __user
*, oldname
,
3219 int, newdfd
, const char __user
*, newname
)
3223 struct dentry
*dentry
;
3226 from
= getname(oldname
);
3228 return PTR_ERR(from
);
3230 dentry
= user_path_create(newdfd
, newname
, &path
, 0);
3231 error
= PTR_ERR(dentry
);
3235 error
= mnt_want_write(path
.mnt
);
3238 error
= security_path_symlink(&path
, dentry
, from
);
3240 goto out_drop_write
;
3241 error
= vfs_symlink(path
.dentry
->d_inode
, dentry
, from
);
3243 mnt_drop_write(path
.mnt
);
3246 mutex_unlock(&path
.dentry
->d_inode
->i_mutex
);
3253 SYSCALL_DEFINE2(symlink
, const char __user
*, oldname
, const char __user
*, newname
)
3255 return sys_symlinkat(oldname
, AT_FDCWD
, newname
);
3258 int vfs_link(struct dentry
*old_dentry
, struct inode
*dir
, struct dentry
*new_dentry
)
3260 struct inode
*inode
= old_dentry
->d_inode
;
3261 unsigned max_links
= dir
->i_sb
->s_max_links
;
3267 error
= may_create(dir
, new_dentry
);
3271 if (dir
->i_sb
!= inode
->i_sb
)
3275 * A link to an append-only or immutable file cannot be created.
3277 if (IS_APPEND(inode
) || IS_IMMUTABLE(inode
))
3279 if (!dir
->i_op
->link
)
3281 if (S_ISDIR(inode
->i_mode
))
3284 error
= security_inode_link(old_dentry
, dir
, new_dentry
);
3288 mutex_lock(&inode
->i_mutex
);
3289 /* Make sure we don't allow creating hardlink to an unlinked file */
3290 if (inode
->i_nlink
== 0)
3292 else if (max_links
&& inode
->i_nlink
>= max_links
)
3295 error
= dir
->i_op
->link(old_dentry
, dir
, new_dentry
);
3296 mutex_unlock(&inode
->i_mutex
);
3298 fsnotify_link(dir
, inode
, new_dentry
);
3303 * Hardlinks are often used in delicate situations. We avoid
3304 * security-related surprises by not following symlinks on the
3307 * We don't follow them on the oldname either to be compatible
3308 * with linux 2.0, and to avoid hard-linking to directories
3309 * and other special files. --ADM
3311 SYSCALL_DEFINE5(linkat
, int, olddfd
, const char __user
*, oldname
,
3312 int, newdfd
, const char __user
*, newname
, int, flags
)
3314 struct dentry
*new_dentry
;
3315 struct path old_path
, new_path
;
3319 if ((flags
& ~(AT_SYMLINK_FOLLOW
| AT_EMPTY_PATH
)) != 0)
3322 * To use null names we require CAP_DAC_READ_SEARCH
3323 * This ensures that not everyone will be able to create
3324 * handlink using the passed filedescriptor.
3326 if (flags
& AT_EMPTY_PATH
) {
3327 if (!capable(CAP_DAC_READ_SEARCH
))
3332 if (flags
& AT_SYMLINK_FOLLOW
)
3333 how
|= LOOKUP_FOLLOW
;
3335 error
= user_path_at(olddfd
, oldname
, how
, &old_path
);
3339 new_dentry
= user_path_create(newdfd
, newname
, &new_path
, 0);
3340 error
= PTR_ERR(new_dentry
);
3341 if (IS_ERR(new_dentry
))
3345 if (old_path
.mnt
!= new_path
.mnt
)
3347 error
= mnt_want_write(new_path
.mnt
);
3350 error
= security_path_link(old_path
.dentry
, &new_path
, new_dentry
);
3352 goto out_drop_write
;
3353 error
= vfs_link(old_path
.dentry
, new_path
.dentry
->d_inode
, new_dentry
);
3355 mnt_drop_write(new_path
.mnt
);
3358 mutex_unlock(&new_path
.dentry
->d_inode
->i_mutex
);
3359 path_put(&new_path
);
3361 path_put(&old_path
);
3366 SYSCALL_DEFINE2(link
, const char __user
*, oldname
, const char __user
*, newname
)
3368 return sys_linkat(AT_FDCWD
, oldname
, AT_FDCWD
, newname
, 0);
3372 * The worst of all namespace operations - renaming directory. "Perverted"
3373 * doesn't even start to describe it. Somebody in UCB had a heck of a trip...
3375 * a) we can get into loop creation. Check is done in is_subdir().
3376 * b) race potential - two innocent renames can create a loop together.
3377 * That's where 4.4 screws up. Current fix: serialization on
3378 * sb->s_vfs_rename_mutex. We might be more accurate, but that's another
3380 * c) we have to lock _three_ objects - parents and victim (if it exists).
3381 * And that - after we got ->i_mutex on parents (until then we don't know
3382 * whether the target exists). Solution: try to be smart with locking
3383 * order for inodes. We rely on the fact that tree topology may change
3384 * only under ->s_vfs_rename_mutex _and_ that parent of the object we
3385 * move will be locked. Thus we can rank directories by the tree
3386 * (ancestors first) and rank all non-directories after them.
3387 * That works since everybody except rename does "lock parent, lookup,
3388 * lock child" and rename is under ->s_vfs_rename_mutex.
3389 * HOWEVER, it relies on the assumption that any object with ->lookup()
3390 * has no more than 1 dentry. If "hybrid" objects will ever appear,
3391 * we'd better make sure that there's no link(2) for them.
3392 * d) conversion from fhandle to dentry may come in the wrong moment - when
3393 * we are removing the target. Solution: we will have to grab ->i_mutex
3394 * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on
3395 * ->i_mutex on parents, which works but leads to some truly excessive
3398 static int vfs_rename_dir(struct inode
*old_dir
, struct dentry
*old_dentry
,
3399 struct inode
*new_dir
, struct dentry
*new_dentry
)
3402 struct inode
*target
= new_dentry
->d_inode
;
3403 unsigned max_links
= new_dir
->i_sb
->s_max_links
;
3406 * If we are going to change the parent - check write permissions,
3407 * we'll need to flip '..'.
3409 if (new_dir
!= old_dir
) {
3410 error
= inode_permission(old_dentry
->d_inode
, MAY_WRITE
);
3415 error
= security_inode_rename(old_dir
, old_dentry
, new_dir
, new_dentry
);
3421 mutex_lock(&target
->i_mutex
);
3424 if (d_mountpoint(old_dentry
) || d_mountpoint(new_dentry
))
3428 if (max_links
&& !target
&& new_dir
!= old_dir
&&
3429 new_dir
->i_nlink
>= max_links
)
3433 shrink_dcache_parent(new_dentry
);
3434 error
= old_dir
->i_op
->rename(old_dir
, old_dentry
, new_dir
, new_dentry
);
3439 target
->i_flags
|= S_DEAD
;
3440 dont_mount(new_dentry
);
3444 mutex_unlock(&target
->i_mutex
);
3447 if (!(old_dir
->i_sb
->s_type
->fs_flags
& FS_RENAME_DOES_D_MOVE
))
3448 d_move(old_dentry
,new_dentry
);
3452 static int vfs_rename_other(struct inode
*old_dir
, struct dentry
*old_dentry
,
3453 struct inode
*new_dir
, struct dentry
*new_dentry
)
3455 struct inode
*target
= new_dentry
->d_inode
;
3458 error
= security_inode_rename(old_dir
, old_dentry
, new_dir
, new_dentry
);
3464 mutex_lock(&target
->i_mutex
);
3467 if (d_mountpoint(old_dentry
)||d_mountpoint(new_dentry
))
3470 error
= old_dir
->i_op
->rename(old_dir
, old_dentry
, new_dir
, new_dentry
);
3475 dont_mount(new_dentry
);
3476 if (!(old_dir
->i_sb
->s_type
->fs_flags
& FS_RENAME_DOES_D_MOVE
))
3477 d_move(old_dentry
, new_dentry
);
3480 mutex_unlock(&target
->i_mutex
);
3485 int vfs_rename(struct inode
*old_dir
, struct dentry
*old_dentry
,
3486 struct inode
*new_dir
, struct dentry
*new_dentry
)
3489 int is_dir
= S_ISDIR(old_dentry
->d_inode
->i_mode
);
3490 const unsigned char *old_name
;
3492 if (old_dentry
->d_inode
== new_dentry
->d_inode
)
3495 error
= may_delete(old_dir
, old_dentry
, is_dir
);
3499 if (!new_dentry
->d_inode
)
3500 error
= may_create(new_dir
, new_dentry
);
3502 error
= may_delete(new_dir
, new_dentry
, is_dir
);
3506 if (!old_dir
->i_op
->rename
)
3509 old_name
= fsnotify_oldname_init(old_dentry
->d_name
.name
);
3512 error
= vfs_rename_dir(old_dir
,old_dentry
,new_dir
,new_dentry
);
3514 error
= vfs_rename_other(old_dir
,old_dentry
,new_dir
,new_dentry
);
3516 fsnotify_move(old_dir
, new_dir
, old_name
, is_dir
,
3517 new_dentry
->d_inode
, old_dentry
);
3518 fsnotify_oldname_free(old_name
);
3523 SYSCALL_DEFINE4(renameat
, int, olddfd
, const char __user
*, oldname
,
3524 int, newdfd
, const char __user
*, newname
)
3526 struct dentry
*old_dir
, *new_dir
;
3527 struct dentry
*old_dentry
, *new_dentry
;
3528 struct dentry
*trap
;
3529 struct nameidata oldnd
, newnd
;
3534 error
= user_path_parent(olddfd
, oldname
, &oldnd
, &from
);
3538 error
= user_path_parent(newdfd
, newname
, &newnd
, &to
);
3543 if (oldnd
.path
.mnt
!= newnd
.path
.mnt
)
3546 old_dir
= oldnd
.path
.dentry
;
3548 if (oldnd
.last_type
!= LAST_NORM
)
3551 new_dir
= newnd
.path
.dentry
;
3552 if (newnd
.last_type
!= LAST_NORM
)
3555 oldnd
.flags
&= ~LOOKUP_PARENT
;
3556 newnd
.flags
&= ~LOOKUP_PARENT
;
3557 newnd
.flags
|= LOOKUP_RENAME_TARGET
;
3559 trap
= lock_rename(new_dir
, old_dir
);
3561 old_dentry
= lookup_hash(&oldnd
);
3562 error
= PTR_ERR(old_dentry
);
3563 if (IS_ERR(old_dentry
))
3565 /* source must exist */
3567 if (!old_dentry
->d_inode
)
3569 /* unless the source is a directory trailing slashes give -ENOTDIR */
3570 if (!S_ISDIR(old_dentry
->d_inode
->i_mode
)) {
3572 if (oldnd
.last
.name
[oldnd
.last
.len
])
3574 if (newnd
.last
.name
[newnd
.last
.len
])
3577 /* source should not be ancestor of target */
3579 if (old_dentry
== trap
)
3581 new_dentry
= lookup_hash(&newnd
);
3582 error
= PTR_ERR(new_dentry
);
3583 if (IS_ERR(new_dentry
))
3585 /* target should not be an ancestor of source */
3587 if (new_dentry
== trap
)
3590 error
= mnt_want_write(oldnd
.path
.mnt
);
3593 error
= security_path_rename(&oldnd
.path
, old_dentry
,
3594 &newnd
.path
, new_dentry
);
3597 error
= vfs_rename(old_dir
->d_inode
, old_dentry
,
3598 new_dir
->d_inode
, new_dentry
);
3600 mnt_drop_write(oldnd
.path
.mnt
);
3606 unlock_rename(new_dir
, old_dir
);
3608 path_put(&newnd
.path
);
3611 path_put(&oldnd
.path
);
3617 SYSCALL_DEFINE2(rename
, const char __user
*, oldname
, const char __user
*, newname
)
3619 return sys_renameat(AT_FDCWD
, oldname
, AT_FDCWD
, newname
);
3622 int vfs_readlink(struct dentry
*dentry
, char __user
*buffer
, int buflen
, const char *link
)
3626 len
= PTR_ERR(link
);
3631 if (len
> (unsigned) buflen
)
3633 if (copy_to_user(buffer
, link
, len
))
3640 * A helper for ->readlink(). This should be used *ONLY* for symlinks that
3641 * have ->follow_link() touching nd only in nd_set_link(). Using (or not
3642 * using) it for any given inode is up to filesystem.
3644 int generic_readlink(struct dentry
*dentry
, char __user
*buffer
, int buflen
)
3646 struct nameidata nd
;
3651 cookie
= dentry
->d_inode
->i_op
->follow_link(dentry
, &nd
);
3653 return PTR_ERR(cookie
);
3655 res
= vfs_readlink(dentry
, buffer
, buflen
, nd_get_link(&nd
));
3656 if (dentry
->d_inode
->i_op
->put_link
)
3657 dentry
->d_inode
->i_op
->put_link(dentry
, &nd
, cookie
);
3661 int vfs_follow_link(struct nameidata
*nd
, const char *link
)
3663 return __vfs_follow_link(nd
, link
);
3666 /* get the link contents into pagecache */
3667 static char *page_getlink(struct dentry
* dentry
, struct page
**ppage
)
3671 struct address_space
*mapping
= dentry
->d_inode
->i_mapping
;
3672 page
= read_mapping_page(mapping
, 0, NULL
);
3677 nd_terminate_link(kaddr
, dentry
->d_inode
->i_size
, PAGE_SIZE
- 1);
3681 int page_readlink(struct dentry
*dentry
, char __user
*buffer
, int buflen
)
3683 struct page
*page
= NULL
;
3684 char *s
= page_getlink(dentry
, &page
);
3685 int res
= vfs_readlink(dentry
,buffer
,buflen
,s
);
3688 page_cache_release(page
);
3693 void *page_follow_link_light(struct dentry
*dentry
, struct nameidata
*nd
)
3695 struct page
*page
= NULL
;
3696 nd_set_link(nd
, page_getlink(dentry
, &page
));
3700 void page_put_link(struct dentry
*dentry
, struct nameidata
*nd
, void *cookie
)
3702 struct page
*page
= cookie
;
3706 page_cache_release(page
);
3711 * The nofs argument instructs pagecache_write_begin to pass AOP_FLAG_NOFS
3713 int __page_symlink(struct inode
*inode
, const char *symname
, int len
, int nofs
)
3715 struct address_space
*mapping
= inode
->i_mapping
;
3720 unsigned int flags
= AOP_FLAG_UNINTERRUPTIBLE
;
3722 flags
|= AOP_FLAG_NOFS
;
3725 err
= pagecache_write_begin(NULL
, mapping
, 0, len
-1,
3726 flags
, &page
, &fsdata
);
3730 kaddr
= kmap_atomic(page
);
3731 memcpy(kaddr
, symname
, len
-1);
3732 kunmap_atomic(kaddr
);
3734 err
= pagecache_write_end(NULL
, mapping
, 0, len
-1, len
-1,
3741 mark_inode_dirty(inode
);
3747 int page_symlink(struct inode
*inode
, const char *symname
, int len
)
3749 return __page_symlink(inode
, symname
, len
,
3750 !(mapping_gfp_mask(inode
->i_mapping
) & __GFP_FS
));
3753 const struct inode_operations page_symlink_inode_operations
= {
3754 .readlink
= generic_readlink
,
3755 .follow_link
= page_follow_link_light
,
3756 .put_link
= page_put_link
,
3759 EXPORT_SYMBOL(user_path_at
);
3760 EXPORT_SYMBOL(follow_down_one
);
3761 EXPORT_SYMBOL(follow_down
);
3762 EXPORT_SYMBOL(follow_up
);
3763 EXPORT_SYMBOL(get_write_access
); /* binfmt_aout */
3764 EXPORT_SYMBOL(getname
);
3765 EXPORT_SYMBOL(lock_rename
);
3766 EXPORT_SYMBOL(lookup_one_len
);
3767 EXPORT_SYMBOL(page_follow_link_light
);
3768 EXPORT_SYMBOL(page_put_link
);
3769 EXPORT_SYMBOL(page_readlink
);
3770 EXPORT_SYMBOL(__page_symlink
);
3771 EXPORT_SYMBOL(page_symlink
);
3772 EXPORT_SYMBOL(page_symlink_inode_operations
);
3773 EXPORT_SYMBOL(kern_path
);
3774 EXPORT_SYMBOL(vfs_path_lookup
);
3775 EXPORT_SYMBOL(inode_permission
);
3776 EXPORT_SYMBOL(unlock_rename
);
3777 EXPORT_SYMBOL(vfs_create
);
3778 EXPORT_SYMBOL(vfs_follow_link
);
3779 EXPORT_SYMBOL(vfs_link
);
3780 EXPORT_SYMBOL(vfs_mkdir
);
3781 EXPORT_SYMBOL(vfs_mknod
);
3782 EXPORT_SYMBOL(generic_permission
);
3783 EXPORT_SYMBOL(vfs_readlink
);
3784 EXPORT_SYMBOL(vfs_rename
);
3785 EXPORT_SYMBOL(vfs_rmdir
);
3786 EXPORT_SYMBOL(vfs_symlink
);
3787 EXPORT_SYMBOL(vfs_unlink
);
3788 EXPORT_SYMBOL(dentry_unhash
);
3789 EXPORT_SYMBOL(generic_readlink
);