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/module.h>
19 #include <linux/slab.h>
21 #include <linux/namei.h>
22 #include <linux/quotaops.h>
23 #include <linux/pagemap.h>
24 #include <linux/fsnotify.h>
25 #include <linux/personality.h>
26 #include <linux/security.h>
27 #include <linux/syscalls.h>
28 #include <linux/mount.h>
29 #include <linux/audit.h>
30 #include <linux/capability.h>
31 #include <linux/file.h>
32 #include <linux/fcntl.h>
33 #include <asm/namei.h>
34 #include <asm/uaccess.h>
36 #define ACC_MODE(x) ("\000\004\002\006"[(x)&O_ACCMODE])
38 /* [Feb-1997 T. Schoebel-Theuer]
39 * Fundamental changes in the pathname lookup mechanisms (namei)
40 * were necessary because of omirr. The reason is that omirr needs
41 * to know the _real_ pathname, not the user-supplied one, in case
42 * of symlinks (and also when transname replacements occur).
44 * The new code replaces the old recursive symlink resolution with
45 * an iterative one (in case of non-nested symlink chains). It does
46 * this with calls to <fs>_follow_link().
47 * As a side effect, dir_namei(), _namei() and follow_link() are now
48 * replaced with a single function lookup_dentry() that can handle all
49 * the special cases of the former code.
51 * With the new dcache, the pathname is stored at each inode, at least as
52 * long as the refcount of the inode is positive. As a side effect, the
53 * size of the dcache depends on the inode cache and thus is dynamic.
55 * [29-Apr-1998 C. Scott Ananian] Updated above description of symlink
56 * resolution to correspond with current state of the code.
58 * Note that the symlink resolution is not *completely* iterative.
59 * There is still a significant amount of tail- and mid- recursion in
60 * the algorithm. Also, note that <fs>_readlink() is not used in
61 * lookup_dentry(): lookup_dentry() on the result of <fs>_readlink()
62 * may return different results than <fs>_follow_link(). Many virtual
63 * filesystems (including /proc) exhibit this behavior.
66 /* [24-Feb-97 T. Schoebel-Theuer] Side effects caused by new implementation:
67 * New symlink semantics: when open() is called with flags O_CREAT | O_EXCL
68 * and the name already exists in form of a symlink, try to create the new
69 * name indicated by the symlink. The old code always complained that the
70 * name already exists, due to not following the symlink even if its target
71 * is nonexistent. The new semantics affects also mknod() and link() when
72 * the name is a symlink pointing to a non-existant name.
74 * I don't know which semantics is the right one, since I have no access
75 * to standards. But I found by trial that HP-UX 9.0 has the full "new"
76 * semantics implemented, while SunOS 4.1.1 and Solaris (SunOS 5.4) have the
77 * "old" one. Personally, I think the new semantics is much more logical.
78 * Note that "ln old new" where "new" is a symlink pointing to a non-existing
79 * file does succeed in both HP-UX and SunOs, but not in Solaris
80 * and in the old Linux semantics.
83 /* [16-Dec-97 Kevin Buhr] For security reasons, we change some symlink
84 * semantics. See the comments in "open_namei" and "do_link" below.
86 * [10-Sep-98 Alan Modra] Another symlink change.
89 /* [Feb-Apr 2000 AV] Complete rewrite. Rules for symlinks:
90 * inside the path - always follow.
91 * in the last component in creation/removal/renaming - never follow.
92 * if LOOKUP_FOLLOW passed - follow.
93 * if the pathname has trailing slashes - follow.
94 * otherwise - don't follow.
95 * (applied in that order).
97 * [Jun 2000 AV] Inconsistent behaviour of open() in case if flags==O_CREAT
98 * restored for 2.4. This is the last surviving part of old 4.2BSD bug.
99 * During the 2.4 we need to fix the userland stuff depending on it -
100 * hopefully we will be able to get rid of that wart in 2.5. So far only
101 * XEmacs seems to be relying on it...
104 * [Sep 2001 AV] Single-semaphore locking scheme (kudos to David Holland)
105 * implemented. Let's see if raised priority of ->s_vfs_rename_mutex gives
106 * any extra contention...
109 static int fastcall link_path_walk(const char *name, struct nameidata *nd);
111 /* In order to reduce some races, while at the same time doing additional
112 * checking and hopefully speeding things up, we copy filenames to the
113 * kernel data space before using them..
115 * POSIX.1 2.4: an empty pathname is invalid (ENOENT).
116 * PATH_MAX includes the nul terminator --RR.
118 static int do_getname(const char __user *filename, char *page)
121 unsigned long len = PATH_MAX;
123 if (!segment_eq(get_fs(), KERNEL_DS)) {
124 if ((unsigned long) filename >= TASK_SIZE)
126 if (TASK_SIZE - (unsigned long) filename < PATH_MAX)
127 len = TASK_SIZE - (unsigned long) filename;
130 retval = strncpy_from_user(page, filename, len);
134 return -ENAMETOOLONG;
140 char * getname(const char __user * filename)
144 result = ERR_PTR(-ENOMEM);
147 int retval = do_getname(filename, tmp);
152 result = ERR_PTR(retval);
155 audit_getname(result);
159 #ifdef CONFIG_AUDITSYSCALL
160 void putname(const char *name)
162 if (unlikely(!audit_dummy_context()))
167 EXPORT_SYMBOL(putname);
172 * generic_permission - check for access rights on a Posix-like filesystem
173 * @inode: inode to check access rights for
174 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
175 * @check_acl: optional callback to check for Posix ACLs
177 * Used to check for read/write/execute permissions on a file.
178 * We use "fsuid" for this, letting us set arbitrary permissions
179 * for filesystem access without changing the "normal" uids which
180 * are used for other things..
182 int generic_permission(struct inode *inode, int mask,
183 int (*check_acl)(struct inode *inode, int mask))
185 umode_t mode = inode->i_mode;
187 if (current->fsuid == inode->i_uid)
190 if (IS_POSIXACL(inode) && (mode & S_IRWXG) && check_acl) {
191 int error = check_acl(inode, mask);
192 if (error == -EACCES)
193 goto check_capabilities;
194 else if (error != -EAGAIN)
198 if (in_group_p(inode->i_gid))
203 * If the DACs are ok we don't need any capability check.
205 if (((mode & mask & (MAY_READ|MAY_WRITE|MAY_EXEC)) == mask))
210 * Read/write DACs are always overridable.
211 * Executable DACs are overridable if at least one exec bit is set.
213 if (!(mask & MAY_EXEC) ||
214 (inode->i_mode & S_IXUGO) || S_ISDIR(inode->i_mode))
215 if (capable(CAP_DAC_OVERRIDE))
219 * Searching includes executable on directories, else just read.
221 if (mask == MAY_READ || (S_ISDIR(inode->i_mode) && !(mask & MAY_WRITE)))
222 if (capable(CAP_DAC_READ_SEARCH))
228 int permission(struct inode *inode, int mask, struct nameidata *nd)
232 if (mask & MAY_WRITE) {
233 umode_t mode = inode->i_mode;
236 * Nobody gets write access to a read-only fs.
238 if (IS_RDONLY(inode) &&
239 (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode)))
243 * Nobody gets write access to an immutable file.
245 if (IS_IMMUTABLE(inode))
249 if ((mask & MAY_EXEC) && S_ISREG(inode->i_mode)) {
251 * MAY_EXEC on regular files is denied if the fs is mounted
252 * with the "noexec" flag.
254 if (nd && nd->mnt && (nd->mnt->mnt_flags & MNT_NOEXEC))
258 /* Ordinary permission routines do not understand MAY_APPEND. */
259 submask = mask & ~MAY_APPEND;
260 if (inode->i_op && inode->i_op->permission) {
261 retval = inode->i_op->permission(inode, submask, nd);
264 * Exec permission on a regular file is denied if none
265 * of the execute bits are set.
267 * This check should be done by the ->permission()
270 if ((mask & MAY_EXEC) && S_ISREG(inode->i_mode) &&
271 !(inode->i_mode & S_IXUGO))
275 retval = generic_permission(inode, submask, NULL);
280 return security_inode_permission(inode, mask, nd);
284 * vfs_permission - check for access rights to a given path
285 * @nd: lookup result that describes the path
286 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
288 * Used to check for read/write/execute permissions on a path.
289 * We use "fsuid" for this, letting us set arbitrary permissions
290 * for filesystem access without changing the "normal" uids which
291 * are used for other things.
293 int vfs_permission(struct nameidata *nd, int mask)
295 return permission(nd->dentry->d_inode, mask, nd);
299 * file_permission - check for additional access rights to a given file
300 * @file: file to check access rights for
301 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
303 * Used to check for read/write/execute permissions on an already opened
307 * Do not use this function in new code. All access checks should
308 * be done using vfs_permission().
310 int file_permission(struct file *file, int mask)
312 return permission(file->f_path.dentry->d_inode, mask, NULL);
316 * get_write_access() gets write permission for a file.
317 * put_write_access() releases this write permission.
318 * This is used for regular files.
319 * We cannot support write (and maybe mmap read-write shared) accesses and
320 * MAP_DENYWRITE mmappings simultaneously. The i_writecount field of an inode
321 * can have the following values:
322 * 0: no writers, no VM_DENYWRITE mappings
323 * < 0: (-i_writecount) vm_area_structs with VM_DENYWRITE set exist
324 * > 0: (i_writecount) users are writing to the file.
326 * Normally we operate on that counter with atomic_{inc,dec} and it's safe
327 * except for the cases where we don't hold i_writecount yet. Then we need to
328 * use {get,deny}_write_access() - these functions check the sign and refuse
329 * to do the change if sign is wrong. Exclusion between them is provided by
330 * the inode->i_lock spinlock.
333 int get_write_access(struct inode * inode)
335 spin_lock(&inode->i_lock);
336 if (atomic_read(&inode->i_writecount) < 0) {
337 spin_unlock(&inode->i_lock);
340 atomic_inc(&inode->i_writecount);
341 spin_unlock(&inode->i_lock);
346 int deny_write_access(struct file * file)
348 struct inode *inode = file->f_path.dentry->d_inode;
350 spin_lock(&inode->i_lock);
351 if (atomic_read(&inode->i_writecount) > 0) {
352 spin_unlock(&inode->i_lock);
355 atomic_dec(&inode->i_writecount);
356 spin_unlock(&inode->i_lock);
361 void path_release(struct nameidata *nd)
368 * umount() mustn't call path_release()/mntput() as that would clear
371 void path_release_on_umount(struct nameidata *nd)
374 mntput_no_expire(nd->mnt);
378 * release_open_intent - free up open intent resources
379 * @nd: pointer to nameidata
381 void release_open_intent(struct nameidata *nd)
383 if (nd->intent.open.file->f_path.dentry == NULL)
384 put_filp(nd->intent.open.file);
386 fput(nd->intent.open.file);
389 static inline struct dentry *
390 do_revalidate(struct dentry *dentry, struct nameidata *nd)
392 int status = dentry->d_op->d_revalidate(dentry, nd);
393 if (unlikely(status <= 0)) {
395 * The dentry failed validation.
396 * If d_revalidate returned 0 attempt to invalidate
397 * the dentry otherwise d_revalidate is asking us
398 * to return a fail status.
401 if (!d_invalidate(dentry)) {
407 dentry = ERR_PTR(status);
414 * Internal lookup() using the new generic dcache.
417 static struct dentry * cached_lookup(struct dentry * parent, struct qstr * name, struct nameidata *nd)
419 struct dentry * dentry = __d_lookup(parent, name);
421 /* lockess __d_lookup may fail due to concurrent d_move()
422 * in some unrelated directory, so try with d_lookup
425 dentry = d_lookup(parent, name);
427 if (dentry && dentry->d_op && dentry->d_op->d_revalidate)
428 dentry = do_revalidate(dentry, nd);
434 * Short-cut version of permission(), for calling by
435 * path_walk(), when dcache lock is held. Combines parts
436 * of permission() and generic_permission(), and tests ONLY for
437 * MAY_EXEC permission.
439 * If appropriate, check DAC only. If not appropriate, or
440 * short-cut DAC fails, then call permission() to do more
441 * complete permission check.
443 static int exec_permission_lite(struct inode *inode,
444 struct nameidata *nd)
446 umode_t mode = inode->i_mode;
448 if (inode->i_op && inode->i_op->permission)
451 if (current->fsuid == inode->i_uid)
453 else if (in_group_p(inode->i_gid))
459 if ((inode->i_mode & S_IXUGO) && capable(CAP_DAC_OVERRIDE))
462 if (S_ISDIR(inode->i_mode) && capable(CAP_DAC_OVERRIDE))
465 if (S_ISDIR(inode->i_mode) && capable(CAP_DAC_READ_SEARCH))
470 return security_inode_permission(inode, MAY_EXEC, nd);
474 * This is called when everything else fails, and we actually have
475 * to go to the low-level filesystem to find out what we should do..
477 * We get the directory semaphore, and after getting that we also
478 * make sure that nobody added the entry to the dcache in the meantime..
481 static struct dentry * real_lookup(struct dentry * parent, struct qstr * name, struct nameidata *nd)
483 struct dentry * result;
484 struct inode *dir = parent->d_inode;
486 mutex_lock(&dir->i_mutex);
488 * First re-do the cached lookup just in case it was created
489 * while we waited for the directory semaphore..
491 * FIXME! This could use version numbering or similar to
492 * avoid unnecessary cache lookups.
494 * The "dcache_lock" is purely to protect the RCU list walker
495 * from concurrent renames at this point (we mustn't get false
496 * negatives from the RCU list walk here, unlike the optimistic
499 * so doing d_lookup() (with seqlock), instead of lockfree __d_lookup
501 result = d_lookup(parent, name);
503 struct dentry * dentry = d_alloc(parent, name);
504 result = ERR_PTR(-ENOMEM);
506 result = dir->i_op->lookup(dir, dentry, nd);
512 mutex_unlock(&dir->i_mutex);
517 * Uhhuh! Nasty case: the cache was re-populated while
518 * we waited on the semaphore. Need to revalidate.
520 mutex_unlock(&dir->i_mutex);
521 if (result->d_op && result->d_op->d_revalidate) {
522 result = do_revalidate(result, nd);
524 result = ERR_PTR(-ENOENT);
529 static int __emul_lookup_dentry(const char *, struct nameidata *);
532 static __always_inline int
533 walk_init_root(const char *name, struct nameidata *nd)
535 struct fs_struct *fs = current->fs;
537 read_lock(&fs->lock);
538 if (fs->altroot && !(nd->flags & LOOKUP_NOALT)) {
539 nd->mnt = mntget(fs->altrootmnt);
540 nd->dentry = dget(fs->altroot);
541 read_unlock(&fs->lock);
542 if (__emul_lookup_dentry(name,nd))
544 read_lock(&fs->lock);
546 nd->mnt = mntget(fs->rootmnt);
547 nd->dentry = dget(fs->root);
548 read_unlock(&fs->lock);
552 static __always_inline int __vfs_follow_link(struct nameidata *nd, const char *link)
561 if (!walk_init_root(link, nd))
562 /* weird __emul_prefix() stuff did it */
565 res = link_path_walk(link, nd);
567 if (nd->depth || res || nd->last_type!=LAST_NORM)
570 * If it is an iterative symlinks resolution in open_namei() we
571 * have to copy the last component. And all that crap because of
572 * bloody create() on broken symlinks. Furrfu...
575 if (unlikely(!name)) {
579 strcpy(name, nd->last.name);
580 nd->last.name = name;
584 return PTR_ERR(link);
587 static inline void dput_path(struct path *path, struct nameidata *nd)
590 if (path->mnt != nd->mnt)
594 static inline void path_to_nameidata(struct path *path, struct nameidata *nd)
597 if (nd->mnt != path->mnt)
600 nd->dentry = path->dentry;
603 static __always_inline int __do_follow_link(struct path *path, struct nameidata *nd)
607 struct dentry *dentry = path->dentry;
609 touch_atime(path->mnt, dentry);
610 nd_set_link(nd, NULL);
612 if (path->mnt != nd->mnt) {
613 path_to_nameidata(path, nd);
617 cookie = dentry->d_inode->i_op->follow_link(dentry, nd);
618 error = PTR_ERR(cookie);
619 if (!IS_ERR(cookie)) {
620 char *s = nd_get_link(nd);
623 error = __vfs_follow_link(nd, s);
624 if (dentry->d_inode->i_op->put_link)
625 dentry->d_inode->i_op->put_link(dentry, nd, cookie);
634 * This limits recursive symlink follows to 8, while
635 * limiting consecutive symlinks to 40.
637 * Without that kind of total limit, nasty chains of consecutive
638 * symlinks can cause almost arbitrarily long lookups.
640 static inline int do_follow_link(struct path *path, struct nameidata *nd)
643 if (current->link_count >= MAX_NESTED_LINKS)
645 if (current->total_link_count >= 40)
647 BUG_ON(nd->depth >= MAX_NESTED_LINKS);
649 err = security_inode_follow_link(path->dentry, nd);
652 current->link_count++;
653 current->total_link_count++;
655 err = __do_follow_link(path, nd);
656 current->link_count--;
665 int follow_up(struct vfsmount **mnt, struct dentry **dentry)
667 struct vfsmount *parent;
668 struct dentry *mountpoint;
669 spin_lock(&vfsmount_lock);
670 parent=(*mnt)->mnt_parent;
671 if (parent == *mnt) {
672 spin_unlock(&vfsmount_lock);
676 mountpoint=dget((*mnt)->mnt_mountpoint);
677 spin_unlock(&vfsmount_lock);
679 *dentry = mountpoint;
685 /* no need for dcache_lock, as serialization is taken care in
688 static int __follow_mount(struct path *path)
691 while (d_mountpoint(path->dentry)) {
692 struct vfsmount *mounted = lookup_mnt(path->mnt, path->dentry);
699 path->dentry = dget(mounted->mnt_root);
705 static void follow_mount(struct vfsmount **mnt, struct dentry **dentry)
707 while (d_mountpoint(*dentry)) {
708 struct vfsmount *mounted = lookup_mnt(*mnt, *dentry);
714 *dentry = dget(mounted->mnt_root);
718 /* no need for dcache_lock, as serialization is taken care in
721 int follow_down(struct vfsmount **mnt, struct dentry **dentry)
723 struct vfsmount *mounted;
725 mounted = lookup_mnt(*mnt, *dentry);
730 *dentry = dget(mounted->mnt_root);
736 static __always_inline void follow_dotdot(struct nameidata *nd)
738 struct fs_struct *fs = current->fs;
741 struct vfsmount *parent;
742 struct dentry *old = nd->dentry;
744 read_lock(&fs->lock);
745 if (nd->dentry == fs->root &&
746 nd->mnt == fs->rootmnt) {
747 read_unlock(&fs->lock);
750 read_unlock(&fs->lock);
751 spin_lock(&dcache_lock);
752 if (nd->dentry != nd->mnt->mnt_root) {
753 nd->dentry = dget(nd->dentry->d_parent);
754 spin_unlock(&dcache_lock);
758 spin_unlock(&dcache_lock);
759 spin_lock(&vfsmount_lock);
760 parent = nd->mnt->mnt_parent;
761 if (parent == nd->mnt) {
762 spin_unlock(&vfsmount_lock);
766 nd->dentry = dget(nd->mnt->mnt_mountpoint);
767 spin_unlock(&vfsmount_lock);
772 follow_mount(&nd->mnt, &nd->dentry);
776 * It's more convoluted than I'd like it to be, but... it's still fairly
777 * small and for now I'd prefer to have fast path as straight as possible.
778 * It _is_ time-critical.
780 static int do_lookup(struct nameidata *nd, struct qstr *name,
783 struct vfsmount *mnt = nd->mnt;
784 struct dentry *dentry = __d_lookup(nd->dentry, name);
788 if (dentry->d_op && dentry->d_op->d_revalidate)
789 goto need_revalidate;
792 path->dentry = dentry;
793 __follow_mount(path);
797 dentry = real_lookup(nd->dentry, name, nd);
803 dentry = do_revalidate(dentry, nd);
811 return PTR_ERR(dentry);
816 * This is the basic name resolution function, turning a pathname into
817 * the final dentry. We expect 'base' to be positive and a directory.
819 * Returns 0 and nd will have valid dentry and mnt on success.
820 * Returns error and drops reference to input namei data on failure.
822 static fastcall int __link_path_walk(const char * name, struct nameidata *nd)
827 unsigned int lookup_flags = nd->flags;
834 inode = nd->dentry->d_inode;
836 lookup_flags = LOOKUP_FOLLOW | (nd->flags & LOOKUP_CONTINUE);
838 /* At this point we know we have a real path component. */
844 nd->flags |= LOOKUP_CONTINUE;
845 err = exec_permission_lite(inode, nd);
847 err = vfs_permission(nd, MAY_EXEC);
852 c = *(const unsigned char *)name;
854 hash = init_name_hash();
857 hash = partial_name_hash(c, hash);
858 c = *(const unsigned char *)name;
859 } while (c && (c != '/'));
860 this.len = name - (const char *) this.name;
861 this.hash = end_name_hash(hash);
863 /* remove trailing slashes? */
866 while (*++name == '/');
868 goto last_with_slashes;
871 * "." and ".." are special - ".." especially so because it has
872 * to be able to know about the current root directory and
873 * parent relationships.
875 if (this.name[0] == '.') switch (this.len) {
879 if (this.name[1] != '.')
882 inode = nd->dentry->d_inode;
888 * See if the low-level filesystem might want
889 * to use its own hash..
891 if (nd->dentry->d_op && nd->dentry->d_op->d_hash) {
892 err = nd->dentry->d_op->d_hash(nd->dentry, &this);
896 /* This does the actual lookups.. */
897 err = do_lookup(nd, &this, &next);
902 inode = next.dentry->d_inode;
909 if (inode->i_op->follow_link) {
910 err = do_follow_link(&next, nd);
914 inode = nd->dentry->d_inode;
921 path_to_nameidata(&next, nd);
923 if (!inode->i_op->lookup)
926 /* here ends the main loop */
929 lookup_flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY;
931 /* Clear LOOKUP_CONTINUE iff it was previously unset */
932 nd->flags &= lookup_flags | ~LOOKUP_CONTINUE;
933 if (lookup_flags & LOOKUP_PARENT)
935 if (this.name[0] == '.') switch (this.len) {
939 if (this.name[1] != '.')
942 inode = nd->dentry->d_inode;
947 if (nd->dentry->d_op && nd->dentry->d_op->d_hash) {
948 err = nd->dentry->d_op->d_hash(nd->dentry, &this);
952 err = do_lookup(nd, &this, &next);
955 inode = next.dentry->d_inode;
956 if ((lookup_flags & LOOKUP_FOLLOW)
957 && inode && inode->i_op && inode->i_op->follow_link) {
958 err = do_follow_link(&next, nd);
961 inode = nd->dentry->d_inode;
963 path_to_nameidata(&next, nd);
967 if (lookup_flags & LOOKUP_DIRECTORY) {
969 if (!inode->i_op || !inode->i_op->lookup)
975 nd->last_type = LAST_NORM;
976 if (this.name[0] != '.')
979 nd->last_type = LAST_DOT;
980 else if (this.len == 2 && this.name[1] == '.')
981 nd->last_type = LAST_DOTDOT;
986 * We bypassed the ordinary revalidation routines.
987 * We may need to check the cached dentry for staleness.
989 if (nd->dentry && nd->dentry->d_sb &&
990 (nd->dentry->d_sb->s_type->fs_flags & FS_REVAL_DOT)) {
992 /* Note: we do not d_invalidate() */
993 if (!nd->dentry->d_op->d_revalidate(nd->dentry, nd))
999 dput_path(&next, nd);
1008 * Wrapper to retry pathname resolution whenever the underlying
1009 * file system returns an ESTALE.
1011 * Retry the whole path once, forcing real lookup requests
1012 * instead of relying on the dcache.
1014 static int fastcall link_path_walk(const char *name, struct nameidata *nd)
1016 struct nameidata save = *nd;
1019 /* make sure the stuff we saved doesn't go away */
1023 result = __link_path_walk(name, nd);
1024 if (result == -ESTALE) {
1028 nd->flags |= LOOKUP_REVAL;
1029 result = __link_path_walk(name, nd);
1038 static int fastcall path_walk(const char * name, struct nameidata *nd)
1040 current->total_link_count = 0;
1041 return link_path_walk(name, nd);
1045 * SMP-safe: Returns 1 and nd will have valid dentry and mnt, if
1046 * everything is done. Returns 0 and drops input nd, if lookup failed;
1048 static int __emul_lookup_dentry(const char *name, struct nameidata *nd)
1050 if (path_walk(name, nd))
1051 return 0; /* something went wrong... */
1053 if (!nd->dentry->d_inode || S_ISDIR(nd->dentry->d_inode->i_mode)) {
1054 struct dentry *old_dentry = nd->dentry;
1055 struct vfsmount *old_mnt = nd->mnt;
1056 struct qstr last = nd->last;
1057 int last_type = nd->last_type;
1058 struct fs_struct *fs = current->fs;
1061 * NAME was not found in alternate root or it's a directory.
1062 * Try to find it in the normal root:
1064 nd->last_type = LAST_ROOT;
1065 read_lock(&fs->lock);
1066 nd->mnt = mntget(fs->rootmnt);
1067 nd->dentry = dget(fs->root);
1068 read_unlock(&fs->lock);
1069 if (path_walk(name, nd) == 0) {
1070 if (nd->dentry->d_inode) {
1077 nd->dentry = old_dentry;
1080 nd->last_type = last_type;
1085 void set_fs_altroot(void)
1087 char *emul = __emul_prefix();
1088 struct nameidata nd;
1089 struct vfsmount *mnt = NULL, *oldmnt;
1090 struct dentry *dentry = NULL, *olddentry;
1092 struct fs_struct *fs = current->fs;
1096 err = path_lookup(emul, LOOKUP_FOLLOW|LOOKUP_DIRECTORY|LOOKUP_NOALT, &nd);
1102 write_lock(&fs->lock);
1103 oldmnt = fs->altrootmnt;
1104 olddentry = fs->altroot;
1105 fs->altrootmnt = mnt;
1106 fs->altroot = dentry;
1107 write_unlock(&fs->lock);
1114 /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
1115 static int fastcall do_path_lookup(int dfd, const char *name,
1116 unsigned int flags, struct nameidata *nd)
1121 struct fs_struct *fs = current->fs;
1123 nd->last_type = LAST_ROOT; /* if there are only slashes... */
1128 read_lock(&fs->lock);
1129 if (fs->altroot && !(nd->flags & LOOKUP_NOALT)) {
1130 nd->mnt = mntget(fs->altrootmnt);
1131 nd->dentry = dget(fs->altroot);
1132 read_unlock(&fs->lock);
1133 if (__emul_lookup_dentry(name,nd))
1134 goto out; /* found in altroot */
1135 read_lock(&fs->lock);
1137 nd->mnt = mntget(fs->rootmnt);
1138 nd->dentry = dget(fs->root);
1139 read_unlock(&fs->lock);
1140 } else if (dfd == AT_FDCWD) {
1141 read_lock(&fs->lock);
1142 nd->mnt = mntget(fs->pwdmnt);
1143 nd->dentry = dget(fs->pwd);
1144 read_unlock(&fs->lock);
1146 struct dentry *dentry;
1148 file = fget_light(dfd, &fput_needed);
1153 dentry = file->f_path.dentry;
1156 if (!S_ISDIR(dentry->d_inode->i_mode))
1159 retval = file_permission(file, MAY_EXEC);
1163 nd->mnt = mntget(file->f_path.mnt);
1164 nd->dentry = dget(dentry);
1166 fput_light(file, fput_needed);
1169 retval = path_walk(name, nd);
1171 if (unlikely(!retval && !audit_dummy_context() && nd->dentry &&
1172 nd->dentry->d_inode))
1173 audit_inode(name, nd->dentry->d_inode);
1178 fput_light(file, fput_needed);
1182 int fastcall path_lookup(const char *name, unsigned int flags,
1183 struct nameidata *nd)
1185 return do_path_lookup(AT_FDCWD, name, flags, nd);
1189 * vfs_path_lookup - lookup a file path relative to a dentry-vfsmount pair
1190 * @dentry: pointer to dentry of the base directory
1191 * @mnt: pointer to vfs mount of the base directory
1192 * @name: pointer to file name
1193 * @flags: lookup flags
1194 * @nd: pointer to nameidata
1196 int vfs_path_lookup(struct dentry *dentry, struct vfsmount *mnt,
1197 const char *name, unsigned int flags,
1198 struct nameidata *nd)
1202 /* same as do_path_lookup */
1203 nd->last_type = LAST_ROOT;
1207 nd->mnt = mntget(mnt);
1208 nd->dentry = dget(dentry);
1210 retval = path_walk(name, nd);
1211 if (unlikely(!retval && !audit_dummy_context() && nd->dentry &&
1212 nd->dentry->d_inode))
1213 audit_inode(name, nd->dentry->d_inode);
1219 static int __path_lookup_intent_open(int dfd, const char *name,
1220 unsigned int lookup_flags, struct nameidata *nd,
1221 int open_flags, int create_mode)
1223 struct file *filp = get_empty_filp();
1228 nd->intent.open.file = filp;
1229 nd->intent.open.flags = open_flags;
1230 nd->intent.open.create_mode = create_mode;
1231 err = do_path_lookup(dfd, name, lookup_flags|LOOKUP_OPEN, nd);
1232 if (IS_ERR(nd->intent.open.file)) {
1234 err = PTR_ERR(nd->intent.open.file);
1237 } else if (err != 0)
1238 release_open_intent(nd);
1243 * path_lookup_open - lookup a file path with open intent
1244 * @dfd: the directory to use as base, or AT_FDCWD
1245 * @name: pointer to file name
1246 * @lookup_flags: lookup intent flags
1247 * @nd: pointer to nameidata
1248 * @open_flags: open intent flags
1250 int path_lookup_open(int dfd, const char *name, unsigned int lookup_flags,
1251 struct nameidata *nd, int open_flags)
1253 return __path_lookup_intent_open(dfd, name, lookup_flags, nd,
1258 * path_lookup_create - lookup a file path with open + create intent
1259 * @dfd: the directory to use as base, or AT_FDCWD
1260 * @name: pointer to file name
1261 * @lookup_flags: lookup intent flags
1262 * @nd: pointer to nameidata
1263 * @open_flags: open intent flags
1264 * @create_mode: create intent flags
1266 static int path_lookup_create(int dfd, const char *name,
1267 unsigned int lookup_flags, struct nameidata *nd,
1268 int open_flags, int create_mode)
1270 return __path_lookup_intent_open(dfd, name, lookup_flags|LOOKUP_CREATE,
1271 nd, open_flags, create_mode);
1274 int __user_path_lookup_open(const char __user *name, unsigned int lookup_flags,
1275 struct nameidata *nd, int open_flags)
1277 char *tmp = getname(name);
1278 int err = PTR_ERR(tmp);
1281 err = __path_lookup_intent_open(AT_FDCWD, tmp, lookup_flags, nd, open_flags, 0);
1287 static struct dentry *__lookup_hash(struct qstr *name,
1288 struct dentry *base, struct nameidata *nd)
1290 struct dentry *dentry;
1291 struct inode *inode;
1294 inode = base->d_inode;
1297 * See if the low-level filesystem might want
1298 * to use its own hash..
1300 if (base->d_op && base->d_op->d_hash) {
1301 err = base->d_op->d_hash(base, name);
1302 dentry = ERR_PTR(err);
1307 dentry = cached_lookup(base, name, nd);
1309 struct dentry *new = d_alloc(base, name);
1310 dentry = ERR_PTR(-ENOMEM);
1313 dentry = inode->i_op->lookup(inode, new, nd);
1324 * Restricted form of lookup. Doesn't follow links, single-component only,
1325 * needs parent already locked. Doesn't follow mounts.
1328 static struct dentry *lookup_hash(struct nameidata *nd)
1332 err = permission(nd->dentry->d_inode, MAY_EXEC, nd);
1334 return ERR_PTR(err);
1335 return __lookup_hash(&nd->last, nd->dentry, nd);
1338 static int __lookup_one_len(const char *name, struct qstr *this,
1339 struct dentry *base, int len)
1349 hash = init_name_hash();
1351 c = *(const unsigned char *)name++;
1352 if (c == '/' || c == '\0')
1354 hash = partial_name_hash(c, hash);
1356 this->hash = end_name_hash(hash);
1361 * lookup_one_len: filesystem helper to lookup single pathname component
1362 * @name: pathname component to lookup
1363 * @base: base directory to lookup from
1364 * @len: maximum length @len should be interpreted to
1366 * Note that this routine is purely a helper for filesystem useage and should
1367 * not be called by generic code. Also note that by using this function to
1368 * nameidata argument is passed to the filesystem methods and a filesystem
1369 * using this helper needs to be prepared for that.
1371 struct dentry *lookup_one_len(const char *name, struct dentry *base, int len)
1376 err = __lookup_one_len(name, &this, base, len);
1378 return ERR_PTR(err);
1380 err = permission(base->d_inode, MAY_EXEC, NULL);
1382 return ERR_PTR(err);
1383 return __lookup_hash(&this, base, NULL);
1387 * lookup_one_noperm - bad hack for sysfs
1388 * @name: pathname component to lookup
1389 * @base: base directory to lookup from
1391 * This is a variant of lookup_one_len that doesn't perform any permission
1392 * checks. It's a horrible hack to work around the braindead sysfs
1393 * architecture and should not be used anywhere else.
1395 * DON'T USE THIS FUNCTION EVER, thanks.
1397 struct dentry *lookup_one_noperm(const char *name, struct dentry *base)
1402 err = __lookup_one_len(name, &this, base, strlen(name));
1404 return ERR_PTR(err);
1405 return __lookup_hash(&this, base, NULL);
1408 int fastcall __user_walk_fd(int dfd, const char __user *name, unsigned flags,
1409 struct nameidata *nd)
1411 char *tmp = getname(name);
1412 int err = PTR_ERR(tmp);
1415 err = do_path_lookup(dfd, tmp, flags, nd);
1421 int fastcall __user_walk(const char __user *name, unsigned flags, struct nameidata *nd)
1423 return __user_walk_fd(AT_FDCWD, name, flags, nd);
1427 * It's inline, so penalty for filesystems that don't use sticky bit is
1430 static inline int check_sticky(struct inode *dir, struct inode *inode)
1432 if (!(dir->i_mode & S_ISVTX))
1434 if (inode->i_uid == current->fsuid)
1436 if (dir->i_uid == current->fsuid)
1438 return !capable(CAP_FOWNER);
1442 * Check whether we can remove a link victim from directory dir, check
1443 * whether the type of victim is right.
1444 * 1. We can't do it if dir is read-only (done in permission())
1445 * 2. We should have write and exec permissions on dir
1446 * 3. We can't remove anything from append-only dir
1447 * 4. We can't do anything with immutable dir (done in permission())
1448 * 5. If the sticky bit on dir is set we should either
1449 * a. be owner of dir, or
1450 * b. be owner of victim, or
1451 * c. have CAP_FOWNER capability
1452 * 6. If the victim is append-only or immutable we can't do antyhing with
1453 * links pointing to it.
1454 * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR.
1455 * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR.
1456 * 9. We can't remove a root or mountpoint.
1457 * 10. We don't allow removal of NFS sillyrenamed files; it's handled by
1458 * nfs_async_unlink().
1460 static int may_delete(struct inode *dir,struct dentry *victim,int isdir)
1464 if (!victim->d_inode)
1467 BUG_ON(victim->d_parent->d_inode != dir);
1468 audit_inode_child(victim->d_name.name, victim->d_inode, dir);
1470 error = permission(dir,MAY_WRITE | MAY_EXEC, NULL);
1475 if (check_sticky(dir, victim->d_inode)||IS_APPEND(victim->d_inode)||
1476 IS_IMMUTABLE(victim->d_inode))
1479 if (!S_ISDIR(victim->d_inode->i_mode))
1481 if (IS_ROOT(victim))
1483 } else if (S_ISDIR(victim->d_inode->i_mode))
1485 if (IS_DEADDIR(dir))
1487 if (victim->d_flags & DCACHE_NFSFS_RENAMED)
1492 /* Check whether we can create an object with dentry child in directory
1494 * 1. We can't do it if child already exists (open has special treatment for
1495 * this case, but since we are inlined it's OK)
1496 * 2. We can't do it if dir is read-only (done in permission())
1497 * 3. We should have write and exec permissions on dir
1498 * 4. We can't do it if dir is immutable (done in permission())
1500 static inline int may_create(struct inode *dir, struct dentry *child,
1501 struct nameidata *nd)
1505 if (IS_DEADDIR(dir))
1507 return permission(dir,MAY_WRITE | MAY_EXEC, nd);
1511 * O_DIRECTORY translates into forcing a directory lookup.
1513 static inline int lookup_flags(unsigned int f)
1515 unsigned long retval = LOOKUP_FOLLOW;
1518 retval &= ~LOOKUP_FOLLOW;
1520 if (f & O_DIRECTORY)
1521 retval |= LOOKUP_DIRECTORY;
1527 * p1 and p2 should be directories on the same fs.
1529 struct dentry *lock_rename(struct dentry *p1, struct dentry *p2)
1534 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1538 mutex_lock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1540 for (p = p1; p->d_parent != p; p = p->d_parent) {
1541 if (p->d_parent == p2) {
1542 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_PARENT);
1543 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_CHILD);
1548 for (p = p2; p->d_parent != p; p = p->d_parent) {
1549 if (p->d_parent == p1) {
1550 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1551 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1556 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1557 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1561 void unlock_rename(struct dentry *p1, struct dentry *p2)
1563 mutex_unlock(&p1->d_inode->i_mutex);
1565 mutex_unlock(&p2->d_inode->i_mutex);
1566 mutex_unlock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1570 int vfs_create(struct inode *dir, struct dentry *dentry, int mode,
1571 struct nameidata *nd)
1573 int error = may_create(dir, dentry, nd);
1578 if (!dir->i_op || !dir->i_op->create)
1579 return -EACCES; /* shouldn't it be ENOSYS? */
1582 error = security_inode_create(dir, dentry, mode);
1586 error = dir->i_op->create(dir, dentry, mode, nd);
1588 fsnotify_create(dir, dentry);
1592 int may_open(struct nameidata *nd, int acc_mode, int flag)
1594 struct dentry *dentry = nd->dentry;
1595 struct inode *inode = dentry->d_inode;
1601 if (S_ISLNK(inode->i_mode))
1604 if (S_ISDIR(inode->i_mode) && (flag & FMODE_WRITE))
1607 error = vfs_permission(nd, acc_mode);
1612 * FIFO's, sockets and device files are special: they don't
1613 * actually live on the filesystem itself, and as such you
1614 * can write to them even if the filesystem is read-only.
1616 if (S_ISFIFO(inode->i_mode) || S_ISSOCK(inode->i_mode)) {
1618 } else if (S_ISBLK(inode->i_mode) || S_ISCHR(inode->i_mode)) {
1619 if (nd->mnt->mnt_flags & MNT_NODEV)
1623 } else if (IS_RDONLY(inode) && (flag & FMODE_WRITE))
1626 * An append-only file must be opened in append mode for writing.
1628 if (IS_APPEND(inode)) {
1629 if ((flag & FMODE_WRITE) && !(flag & O_APPEND))
1635 /* O_NOATIME can only be set by the owner or superuser */
1636 if (flag & O_NOATIME)
1637 if (!is_owner_or_cap(inode))
1641 * Ensure there are no outstanding leases on the file.
1643 error = break_lease(inode, flag);
1647 if (flag & O_TRUNC) {
1648 error = get_write_access(inode);
1653 * Refuse to truncate files with mandatory locks held on them.
1655 error = locks_verify_locked(inode);
1659 error = do_truncate(dentry, 0, ATTR_MTIME|ATTR_CTIME, NULL);
1661 put_write_access(inode);
1665 if (flag & FMODE_WRITE)
1671 static int open_namei_create(struct nameidata *nd, struct path *path,
1675 struct dentry *dir = nd->dentry;
1677 if (!IS_POSIXACL(dir->d_inode))
1678 mode &= ~current->fs->umask;
1679 error = vfs_create(dir->d_inode, path->dentry, mode, nd);
1680 mutex_unlock(&dir->d_inode->i_mutex);
1682 nd->dentry = path->dentry;
1685 /* Don't check for write permission, don't truncate */
1686 return may_open(nd, 0, flag & ~O_TRUNC);
1692 * namei for open - this is in fact almost the whole open-routine.
1694 * Note that the low bits of "flag" aren't the same as in the open
1695 * system call - they are 00 - no permissions needed
1696 * 01 - read permission needed
1697 * 10 - write permission needed
1698 * 11 - read/write permissions needed
1699 * which is a lot more logical, and also allows the "no perm" needed
1700 * for symlinks (where the permissions are checked later).
1703 int open_namei(int dfd, const char *pathname, int flag,
1704 int mode, struct nameidata *nd)
1706 int acc_mode, error;
1711 acc_mode = ACC_MODE(flag);
1713 /* O_TRUNC implies we need access checks for write permissions */
1715 acc_mode |= MAY_WRITE;
1717 /* Allow the LSM permission hook to distinguish append
1718 access from general write access. */
1719 if (flag & O_APPEND)
1720 acc_mode |= MAY_APPEND;
1723 * The simplest case - just a plain lookup.
1725 if (!(flag & O_CREAT)) {
1726 error = path_lookup_open(dfd, pathname, lookup_flags(flag),
1734 * Create - we need to know the parent.
1736 error = path_lookup_create(dfd,pathname,LOOKUP_PARENT,nd,flag,mode);
1741 * We have the parent and last component. First of all, check
1742 * that we are not asked to creat(2) an obvious directory - that
1746 if (nd->last_type != LAST_NORM || nd->last.name[nd->last.len])
1750 nd->flags &= ~LOOKUP_PARENT;
1751 mutex_lock(&dir->d_inode->i_mutex);
1752 path.dentry = lookup_hash(nd);
1756 error = PTR_ERR(path.dentry);
1757 if (IS_ERR(path.dentry)) {
1758 mutex_unlock(&dir->d_inode->i_mutex);
1762 if (IS_ERR(nd->intent.open.file)) {
1763 mutex_unlock(&dir->d_inode->i_mutex);
1764 error = PTR_ERR(nd->intent.open.file);
1768 /* Negative dentry, just create the file */
1769 if (!path.dentry->d_inode) {
1770 error = open_namei_create(nd, &path, flag, mode);
1777 * It already exists.
1779 mutex_unlock(&dir->d_inode->i_mutex);
1780 audit_inode(pathname, path.dentry->d_inode);
1786 if (__follow_mount(&path)) {
1788 if (flag & O_NOFOLLOW)
1793 if (!path.dentry->d_inode)
1795 if (path.dentry->d_inode->i_op && path.dentry->d_inode->i_op->follow_link)
1798 path_to_nameidata(&path, nd);
1800 if (path.dentry->d_inode && S_ISDIR(path.dentry->d_inode->i_mode))
1803 error = may_open(nd, acc_mode, flag);
1809 dput_path(&path, nd);
1811 if (!IS_ERR(nd->intent.open.file))
1812 release_open_intent(nd);
1818 if (flag & O_NOFOLLOW)
1821 * This is subtle. Instead of calling do_follow_link() we do the
1822 * thing by hands. The reason is that this way we have zero link_count
1823 * and path_walk() (called from ->follow_link) honoring LOOKUP_PARENT.
1824 * After that we have the parent and last component, i.e.
1825 * we are in the same situation as after the first path_walk().
1826 * Well, almost - if the last component is normal we get its copy
1827 * stored in nd->last.name and we will have to putname() it when we
1828 * are done. Procfs-like symlinks just set LAST_BIND.
1830 nd->flags |= LOOKUP_PARENT;
1831 error = security_inode_follow_link(path.dentry, nd);
1834 error = __do_follow_link(&path, nd);
1836 /* Does someone understand code flow here? Or it is only
1837 * me so stupid? Anathema to whoever designed this non-sense
1838 * with "intent.open".
1840 release_open_intent(nd);
1843 nd->flags &= ~LOOKUP_PARENT;
1844 if (nd->last_type == LAST_BIND)
1847 if (nd->last_type != LAST_NORM)
1849 if (nd->last.name[nd->last.len]) {
1850 __putname(nd->last.name);
1855 __putname(nd->last.name);
1859 mutex_lock(&dir->d_inode->i_mutex);
1860 path.dentry = lookup_hash(nd);
1862 __putname(nd->last.name);
1867 * lookup_create - lookup a dentry, creating it if it doesn't exist
1868 * @nd: nameidata info
1869 * @is_dir: directory flag
1871 * Simple function to lookup and return a dentry and create it
1872 * if it doesn't exist. Is SMP-safe.
1874 * Returns with nd->dentry->d_inode->i_mutex locked.
1876 struct dentry *lookup_create(struct nameidata *nd, int is_dir)
1878 struct dentry *dentry = ERR_PTR(-EEXIST);
1880 mutex_lock_nested(&nd->dentry->d_inode->i_mutex, I_MUTEX_PARENT);
1882 * Yucky last component or no last component at all?
1883 * (foo/., foo/.., /////)
1885 if (nd->last_type != LAST_NORM)
1887 nd->flags &= ~LOOKUP_PARENT;
1888 nd->flags |= LOOKUP_CREATE;
1889 nd->intent.open.flags = O_EXCL;
1892 * Do the final lookup.
1894 dentry = lookup_hash(nd);
1899 * Special case - lookup gave negative, but... we had foo/bar/
1900 * From the vfs_mknod() POV we just have a negative dentry -
1901 * all is fine. Let's be bastards - you had / on the end, you've
1902 * been asking for (non-existent) directory. -ENOENT for you.
1904 if (!is_dir && nd->last.name[nd->last.len] && !dentry->d_inode)
1909 dentry = ERR_PTR(-ENOENT);
1913 EXPORT_SYMBOL_GPL(lookup_create);
1915 int vfs_mknod(struct inode *dir, struct dentry *dentry, int mode, dev_t dev)
1917 int error = may_create(dir, dentry, NULL);
1922 if ((S_ISCHR(mode) || S_ISBLK(mode)) && !capable(CAP_MKNOD))
1925 if (!dir->i_op || !dir->i_op->mknod)
1928 error = security_inode_mknod(dir, dentry, mode, dev);
1933 error = dir->i_op->mknod(dir, dentry, mode, dev);
1935 fsnotify_create(dir, dentry);
1939 asmlinkage long sys_mknodat(int dfd, const char __user *filename, int mode,
1944 struct dentry * dentry;
1945 struct nameidata nd;
1949 tmp = getname(filename);
1951 return PTR_ERR(tmp);
1953 error = do_path_lookup(dfd, tmp, LOOKUP_PARENT, &nd);
1956 dentry = lookup_create(&nd, 0);
1957 error = PTR_ERR(dentry);
1959 if (!IS_POSIXACL(nd.dentry->d_inode))
1960 mode &= ~current->fs->umask;
1961 if (!IS_ERR(dentry)) {
1962 switch (mode & S_IFMT) {
1963 case 0: case S_IFREG:
1964 error = vfs_create(nd.dentry->d_inode,dentry,mode,&nd);
1966 case S_IFCHR: case S_IFBLK:
1967 error = vfs_mknod(nd.dentry->d_inode,dentry,mode,
1968 new_decode_dev(dev));
1970 case S_IFIFO: case S_IFSOCK:
1971 error = vfs_mknod(nd.dentry->d_inode,dentry,mode,0);
1981 mutex_unlock(&nd.dentry->d_inode->i_mutex);
1989 asmlinkage long sys_mknod(const char __user *filename, int mode, unsigned dev)
1991 return sys_mknodat(AT_FDCWD, filename, mode, dev);
1994 int vfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
1996 int error = may_create(dir, dentry, NULL);
2001 if (!dir->i_op || !dir->i_op->mkdir)
2004 mode &= (S_IRWXUGO|S_ISVTX);
2005 error = security_inode_mkdir(dir, dentry, mode);
2010 error = dir->i_op->mkdir(dir, dentry, mode);
2012 fsnotify_mkdir(dir, dentry);
2016 asmlinkage long sys_mkdirat(int dfd, const char __user *pathname, int mode)
2020 struct dentry *dentry;
2021 struct nameidata nd;
2023 tmp = getname(pathname);
2024 error = PTR_ERR(tmp);
2028 error = do_path_lookup(dfd, tmp, LOOKUP_PARENT, &nd);
2031 dentry = lookup_create(&nd, 1);
2032 error = PTR_ERR(dentry);
2036 if (!IS_POSIXACL(nd.dentry->d_inode))
2037 mode &= ~current->fs->umask;
2038 error = vfs_mkdir(nd.dentry->d_inode, dentry, mode);
2041 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2049 asmlinkage long sys_mkdir(const char __user *pathname, int mode)
2051 return sys_mkdirat(AT_FDCWD, pathname, mode);
2055 * We try to drop the dentry early: we should have
2056 * a usage count of 2 if we're the only user of this
2057 * dentry, and if that is true (possibly after pruning
2058 * the dcache), then we drop the dentry now.
2060 * A low-level filesystem can, if it choses, legally
2063 * if (!d_unhashed(dentry))
2066 * if it cannot handle the case of removing a directory
2067 * that is still in use by something else..
2069 void dentry_unhash(struct dentry *dentry)
2072 shrink_dcache_parent(dentry);
2073 spin_lock(&dcache_lock);
2074 spin_lock(&dentry->d_lock);
2075 if (atomic_read(&dentry->d_count) == 2)
2077 spin_unlock(&dentry->d_lock);
2078 spin_unlock(&dcache_lock);
2081 int vfs_rmdir(struct inode *dir, struct dentry *dentry)
2083 int error = may_delete(dir, dentry, 1);
2088 if (!dir->i_op || !dir->i_op->rmdir)
2093 mutex_lock(&dentry->d_inode->i_mutex);
2094 dentry_unhash(dentry);
2095 if (d_mountpoint(dentry))
2098 error = security_inode_rmdir(dir, dentry);
2100 error = dir->i_op->rmdir(dir, dentry);
2102 dentry->d_inode->i_flags |= S_DEAD;
2105 mutex_unlock(&dentry->d_inode->i_mutex);
2114 static long do_rmdir(int dfd, const char __user *pathname)
2118 struct dentry *dentry;
2119 struct nameidata nd;
2121 name = getname(pathname);
2123 return PTR_ERR(name);
2125 error = do_path_lookup(dfd, name, LOOKUP_PARENT, &nd);
2129 switch(nd.last_type) {
2140 mutex_lock_nested(&nd.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2141 dentry = lookup_hash(&nd);
2142 error = PTR_ERR(dentry);
2145 error = vfs_rmdir(nd.dentry->d_inode, dentry);
2148 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2156 asmlinkage long sys_rmdir(const char __user *pathname)
2158 return do_rmdir(AT_FDCWD, pathname);
2161 int vfs_unlink(struct inode *dir, struct dentry *dentry)
2163 int error = may_delete(dir, dentry, 0);
2168 if (!dir->i_op || !dir->i_op->unlink)
2173 mutex_lock(&dentry->d_inode->i_mutex);
2174 if (d_mountpoint(dentry))
2177 error = security_inode_unlink(dir, dentry);
2179 error = dir->i_op->unlink(dir, dentry);
2181 mutex_unlock(&dentry->d_inode->i_mutex);
2183 /* We don't d_delete() NFS sillyrenamed files--they still exist. */
2184 if (!error && !(dentry->d_flags & DCACHE_NFSFS_RENAMED)) {
2192 * Make sure that the actual truncation of the file will occur outside its
2193 * directory's i_mutex. Truncate can take a long time if there is a lot of
2194 * writeout happening, and we don't want to prevent access to the directory
2195 * while waiting on the I/O.
2197 static long do_unlinkat(int dfd, const char __user *pathname)
2201 struct dentry *dentry;
2202 struct nameidata nd;
2203 struct inode *inode = NULL;
2205 name = getname(pathname);
2207 return PTR_ERR(name);
2209 error = do_path_lookup(dfd, name, LOOKUP_PARENT, &nd);
2213 if (nd.last_type != LAST_NORM)
2215 mutex_lock_nested(&nd.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2216 dentry = lookup_hash(&nd);
2217 error = PTR_ERR(dentry);
2218 if (!IS_ERR(dentry)) {
2219 /* Why not before? Because we want correct error value */
2220 if (nd.last.name[nd.last.len])
2222 inode = dentry->d_inode;
2224 atomic_inc(&inode->i_count);
2225 error = vfs_unlink(nd.dentry->d_inode, dentry);
2229 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2231 iput(inode); /* truncate the inode here */
2239 error = !dentry->d_inode ? -ENOENT :
2240 S_ISDIR(dentry->d_inode->i_mode) ? -EISDIR : -ENOTDIR;
2244 asmlinkage long sys_unlinkat(int dfd, const char __user *pathname, int flag)
2246 if ((flag & ~AT_REMOVEDIR) != 0)
2249 if (flag & AT_REMOVEDIR)
2250 return do_rmdir(dfd, pathname);
2252 return do_unlinkat(dfd, pathname);
2255 asmlinkage long sys_unlink(const char __user *pathname)
2257 return do_unlinkat(AT_FDCWD, pathname);
2260 int vfs_symlink(struct inode *dir, struct dentry *dentry, const char *oldname, int mode)
2262 int error = may_create(dir, dentry, NULL);
2267 if (!dir->i_op || !dir->i_op->symlink)
2270 error = security_inode_symlink(dir, dentry, oldname);
2275 error = dir->i_op->symlink(dir, dentry, oldname);
2277 fsnotify_create(dir, dentry);
2281 asmlinkage long sys_symlinkat(const char __user *oldname,
2282 int newdfd, const char __user *newname)
2287 struct dentry *dentry;
2288 struct nameidata nd;
2290 from = getname(oldname);
2292 return PTR_ERR(from);
2293 to = getname(newname);
2294 error = PTR_ERR(to);
2298 error = do_path_lookup(newdfd, to, LOOKUP_PARENT, &nd);
2301 dentry = lookup_create(&nd, 0);
2302 error = PTR_ERR(dentry);
2306 error = vfs_symlink(nd.dentry->d_inode, dentry, from, S_IALLUGO);
2309 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2318 asmlinkage long sys_symlink(const char __user *oldname, const char __user *newname)
2320 return sys_symlinkat(oldname, AT_FDCWD, newname);
2323 int vfs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *new_dentry)
2325 struct inode *inode = old_dentry->d_inode;
2331 error = may_create(dir, new_dentry, NULL);
2335 if (dir->i_sb != inode->i_sb)
2339 * A link to an append-only or immutable file cannot be created.
2341 if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
2343 if (!dir->i_op || !dir->i_op->link)
2345 if (S_ISDIR(old_dentry->d_inode->i_mode))
2348 error = security_inode_link(old_dentry, dir, new_dentry);
2352 mutex_lock(&old_dentry->d_inode->i_mutex);
2354 error = dir->i_op->link(old_dentry, dir, new_dentry);
2355 mutex_unlock(&old_dentry->d_inode->i_mutex);
2357 fsnotify_create(dir, new_dentry);
2362 * Hardlinks are often used in delicate situations. We avoid
2363 * security-related surprises by not following symlinks on the
2366 * We don't follow them on the oldname either to be compatible
2367 * with linux 2.0, and to avoid hard-linking to directories
2368 * and other special files. --ADM
2370 asmlinkage long sys_linkat(int olddfd, const char __user *oldname,
2371 int newdfd, const char __user *newname,
2374 struct dentry *new_dentry;
2375 struct nameidata nd, old_nd;
2379 if ((flags & ~AT_SYMLINK_FOLLOW) != 0)
2382 to = getname(newname);
2386 error = __user_walk_fd(olddfd, oldname,
2387 flags & AT_SYMLINK_FOLLOW ? LOOKUP_FOLLOW : 0,
2391 error = do_path_lookup(newdfd, to, LOOKUP_PARENT, &nd);
2395 if (old_nd.mnt != nd.mnt)
2397 new_dentry = lookup_create(&nd, 0);
2398 error = PTR_ERR(new_dentry);
2399 if (IS_ERR(new_dentry))
2401 error = vfs_link(old_nd.dentry, nd.dentry->d_inode, new_dentry);
2404 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2408 path_release(&old_nd);
2415 asmlinkage long sys_link(const char __user *oldname, const char __user *newname)
2417 return sys_linkat(AT_FDCWD, oldname, AT_FDCWD, newname, 0);
2421 * The worst of all namespace operations - renaming directory. "Perverted"
2422 * doesn't even start to describe it. Somebody in UCB had a heck of a trip...
2424 * a) we can get into loop creation. Check is done in is_subdir().
2425 * b) race potential - two innocent renames can create a loop together.
2426 * That's where 4.4 screws up. Current fix: serialization on
2427 * sb->s_vfs_rename_mutex. We might be more accurate, but that's another
2429 * c) we have to lock _three_ objects - parents and victim (if it exists).
2430 * And that - after we got ->i_mutex on parents (until then we don't know
2431 * whether the target exists). Solution: try to be smart with locking
2432 * order for inodes. We rely on the fact that tree topology may change
2433 * only under ->s_vfs_rename_mutex _and_ that parent of the object we
2434 * move will be locked. Thus we can rank directories by the tree
2435 * (ancestors first) and rank all non-directories after them.
2436 * That works since everybody except rename does "lock parent, lookup,
2437 * lock child" and rename is under ->s_vfs_rename_mutex.
2438 * HOWEVER, it relies on the assumption that any object with ->lookup()
2439 * has no more than 1 dentry. If "hybrid" objects will ever appear,
2440 * we'd better make sure that there's no link(2) for them.
2441 * d) some filesystems don't support opened-but-unlinked directories,
2442 * either because of layout or because they are not ready to deal with
2443 * all cases correctly. The latter will be fixed (taking this sort of
2444 * stuff into VFS), but the former is not going away. Solution: the same
2445 * trick as in rmdir().
2446 * e) conversion from fhandle to dentry may come in the wrong moment - when
2447 * we are removing the target. Solution: we will have to grab ->i_mutex
2448 * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on
2449 * ->i_mutex on parents, which works but leads to some truely excessive
2452 static int vfs_rename_dir(struct inode *old_dir, struct dentry *old_dentry,
2453 struct inode *new_dir, struct dentry *new_dentry)
2456 struct inode *target;
2459 * If we are going to change the parent - check write permissions,
2460 * we'll need to flip '..'.
2462 if (new_dir != old_dir) {
2463 error = permission(old_dentry->d_inode, MAY_WRITE, NULL);
2468 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2472 target = new_dentry->d_inode;
2474 mutex_lock(&target->i_mutex);
2475 dentry_unhash(new_dentry);
2477 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2480 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2483 target->i_flags |= S_DEAD;
2484 mutex_unlock(&target->i_mutex);
2485 if (d_unhashed(new_dentry))
2486 d_rehash(new_dentry);
2490 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
2491 d_move(old_dentry,new_dentry);
2495 static int vfs_rename_other(struct inode *old_dir, struct dentry *old_dentry,
2496 struct inode *new_dir, struct dentry *new_dentry)
2498 struct inode *target;
2501 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2506 target = new_dentry->d_inode;
2508 mutex_lock(&target->i_mutex);
2509 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2512 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2514 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
2515 d_move(old_dentry, new_dentry);
2518 mutex_unlock(&target->i_mutex);
2523 int vfs_rename(struct inode *old_dir, struct dentry *old_dentry,
2524 struct inode *new_dir, struct dentry *new_dentry)
2527 int is_dir = S_ISDIR(old_dentry->d_inode->i_mode);
2528 const char *old_name;
2530 if (old_dentry->d_inode == new_dentry->d_inode)
2533 error = may_delete(old_dir, old_dentry, is_dir);
2537 if (!new_dentry->d_inode)
2538 error = may_create(new_dir, new_dentry, NULL);
2540 error = may_delete(new_dir, new_dentry, is_dir);
2544 if (!old_dir->i_op || !old_dir->i_op->rename)
2547 DQUOT_INIT(old_dir);
2548 DQUOT_INIT(new_dir);
2550 old_name = fsnotify_oldname_init(old_dentry->d_name.name);
2553 error = vfs_rename_dir(old_dir,old_dentry,new_dir,new_dentry);
2555 error = vfs_rename_other(old_dir,old_dentry,new_dir,new_dentry);
2557 const char *new_name = old_dentry->d_name.name;
2558 fsnotify_move(old_dir, new_dir, old_name, new_name, is_dir,
2559 new_dentry->d_inode, old_dentry->d_inode);
2561 fsnotify_oldname_free(old_name);
2566 static int do_rename(int olddfd, const char *oldname,
2567 int newdfd, const char *newname)
2570 struct dentry * old_dir, * new_dir;
2571 struct dentry * old_dentry, *new_dentry;
2572 struct dentry * trap;
2573 struct nameidata oldnd, newnd;
2575 error = do_path_lookup(olddfd, oldname, LOOKUP_PARENT, &oldnd);
2579 error = do_path_lookup(newdfd, newname, LOOKUP_PARENT, &newnd);
2584 if (oldnd.mnt != newnd.mnt)
2587 old_dir = oldnd.dentry;
2589 if (oldnd.last_type != LAST_NORM)
2592 new_dir = newnd.dentry;
2593 if (newnd.last_type != LAST_NORM)
2596 trap = lock_rename(new_dir, old_dir);
2598 old_dentry = lookup_hash(&oldnd);
2599 error = PTR_ERR(old_dentry);
2600 if (IS_ERR(old_dentry))
2602 /* source must exist */
2604 if (!old_dentry->d_inode)
2606 /* unless the source is a directory trailing slashes give -ENOTDIR */
2607 if (!S_ISDIR(old_dentry->d_inode->i_mode)) {
2609 if (oldnd.last.name[oldnd.last.len])
2611 if (newnd.last.name[newnd.last.len])
2614 /* source should not be ancestor of target */
2616 if (old_dentry == trap)
2618 new_dentry = lookup_hash(&newnd);
2619 error = PTR_ERR(new_dentry);
2620 if (IS_ERR(new_dentry))
2622 /* target should not be an ancestor of source */
2624 if (new_dentry == trap)
2627 error = vfs_rename(old_dir->d_inode, old_dentry,
2628 new_dir->d_inode, new_dentry);
2634 unlock_rename(new_dir, old_dir);
2636 path_release(&newnd);
2638 path_release(&oldnd);
2643 asmlinkage long sys_renameat(int olddfd, const char __user *oldname,
2644 int newdfd, const char __user *newname)
2650 from = getname(oldname);
2652 return PTR_ERR(from);
2653 to = getname(newname);
2654 error = PTR_ERR(to);
2656 error = do_rename(olddfd, from, newdfd, to);
2663 asmlinkage long sys_rename(const char __user *oldname, const char __user *newname)
2665 return sys_renameat(AT_FDCWD, oldname, AT_FDCWD, newname);
2668 int vfs_readlink(struct dentry *dentry, char __user *buffer, int buflen, const char *link)
2672 len = PTR_ERR(link);
2677 if (len > (unsigned) buflen)
2679 if (copy_to_user(buffer, link, len))
2686 * A helper for ->readlink(). This should be used *ONLY* for symlinks that
2687 * have ->follow_link() touching nd only in nd_set_link(). Using (or not
2688 * using) it for any given inode is up to filesystem.
2690 int generic_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2692 struct nameidata nd;
2696 cookie = dentry->d_inode->i_op->follow_link(dentry, &nd);
2697 if (!IS_ERR(cookie)) {
2698 int res = vfs_readlink(dentry, buffer, buflen, nd_get_link(&nd));
2699 if (dentry->d_inode->i_op->put_link)
2700 dentry->d_inode->i_op->put_link(dentry, &nd, cookie);
2701 cookie = ERR_PTR(res);
2703 return PTR_ERR(cookie);
2706 int vfs_follow_link(struct nameidata *nd, const char *link)
2708 return __vfs_follow_link(nd, link);
2711 /* get the link contents into pagecache */
2712 static char *page_getlink(struct dentry * dentry, struct page **ppage)
2715 struct address_space *mapping = dentry->d_inode->i_mapping;
2716 page = read_mapping_page(mapping, 0, NULL);
2723 int page_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2725 struct page *page = NULL;
2726 char *s = page_getlink(dentry, &page);
2727 int res = vfs_readlink(dentry,buffer,buflen,s);
2730 page_cache_release(page);
2735 void *page_follow_link_light(struct dentry *dentry, struct nameidata *nd)
2737 struct page *page = NULL;
2738 nd_set_link(nd, page_getlink(dentry, &page));
2742 void page_put_link(struct dentry *dentry, struct nameidata *nd, void *cookie)
2744 struct page *page = cookie;
2748 page_cache_release(page);
2752 int __page_symlink(struct inode *inode, const char *symname, int len,
2755 struct address_space *mapping = inode->i_mapping;
2762 err = pagecache_write_begin(NULL, mapping, 0, len-1,
2763 AOP_FLAG_UNINTERRUPTIBLE, &page, &fsdata);
2767 kaddr = kmap_atomic(page, KM_USER0);
2768 memcpy(kaddr, symname, len-1);
2769 kunmap_atomic(kaddr, KM_USER0);
2771 err = pagecache_write_end(NULL, mapping, 0, len-1, len-1,
2778 mark_inode_dirty(inode);
2784 int page_symlink(struct inode *inode, const char *symname, int len)
2786 return __page_symlink(inode, symname, len,
2787 mapping_gfp_mask(inode->i_mapping));
2790 const struct inode_operations page_symlink_inode_operations = {
2791 .readlink = generic_readlink,
2792 .follow_link = page_follow_link_light,
2793 .put_link = page_put_link,
2796 EXPORT_SYMBOL(__user_walk);
2797 EXPORT_SYMBOL(__user_walk_fd);
2798 EXPORT_SYMBOL(follow_down);
2799 EXPORT_SYMBOL(follow_up);
2800 EXPORT_SYMBOL(get_write_access); /* binfmt_aout */
2801 EXPORT_SYMBOL(getname);
2802 EXPORT_SYMBOL(lock_rename);
2803 EXPORT_SYMBOL(lookup_one_len);
2804 EXPORT_SYMBOL(page_follow_link_light);
2805 EXPORT_SYMBOL(page_put_link);
2806 EXPORT_SYMBOL(page_readlink);
2807 EXPORT_SYMBOL(__page_symlink);
2808 EXPORT_SYMBOL(page_symlink);
2809 EXPORT_SYMBOL(page_symlink_inode_operations);
2810 EXPORT_SYMBOL(path_lookup);
2811 EXPORT_SYMBOL(vfs_path_lookup);
2812 EXPORT_SYMBOL(path_release);
2813 EXPORT_SYMBOL(permission);
2814 EXPORT_SYMBOL(vfs_permission);
2815 EXPORT_SYMBOL(file_permission);
2816 EXPORT_SYMBOL(unlock_rename);
2817 EXPORT_SYMBOL(vfs_create);
2818 EXPORT_SYMBOL(vfs_follow_link);
2819 EXPORT_SYMBOL(vfs_link);
2820 EXPORT_SYMBOL(vfs_mkdir);
2821 EXPORT_SYMBOL(vfs_mknod);
2822 EXPORT_SYMBOL(generic_permission);
2823 EXPORT_SYMBOL(vfs_readlink);
2824 EXPORT_SYMBOL(vfs_rename);
2825 EXPORT_SYMBOL(vfs_rmdir);
2826 EXPORT_SYMBOL(vfs_symlink);
2827 EXPORT_SYMBOL(vfs_unlink);
2828 EXPORT_SYMBOL(dentry_unhash);
2829 EXPORT_SYMBOL(generic_readlink);