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 <linux/device_cgroup.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 __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 mask &= MAY_READ | MAY_WRITE | MAY_EXEC;
189 if (current->fsuid == inode->i_uid)
192 if (IS_POSIXACL(inode) && (mode & S_IRWXG) && check_acl) {
193 int error = check_acl(inode, mask);
194 if (error == -EACCES)
195 goto check_capabilities;
196 else if (error != -EAGAIN)
200 if (in_group_p(inode->i_gid))
205 * If the DACs are ok we don't need any capability check.
207 if ((mask & ~mode) == 0)
212 * Read/write DACs are always overridable.
213 * Executable DACs are overridable if at least one exec bit is set.
215 if (!(mask & MAY_EXEC) ||
216 (inode->i_mode & S_IXUGO) || S_ISDIR(inode->i_mode))
217 if (capable(CAP_DAC_OVERRIDE))
221 * Searching includes executable on directories, else just read.
223 if (mask == MAY_READ || (S_ISDIR(inode->i_mode) && !(mask & MAY_WRITE)))
224 if (capable(CAP_DAC_READ_SEARCH))
230 int permission(struct inode *inode, int mask, struct nameidata *nd)
233 struct vfsmount *mnt = NULL;
238 if (mask & MAY_WRITE) {
239 umode_t mode = inode->i_mode;
242 * Nobody gets write access to a read-only fs.
244 if (IS_RDONLY(inode) &&
245 (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode)))
249 * Nobody gets write access to an immutable file.
251 if (IS_IMMUTABLE(inode))
255 if ((mask & MAY_EXEC) && S_ISREG(inode->i_mode)) {
257 * MAY_EXEC on regular files is denied if the fs is mounted
258 * with the "noexec" flag.
260 if (mnt && (mnt->mnt_flags & MNT_NOEXEC))
264 /* Ordinary permission routines do not understand MAY_APPEND. */
265 if (inode->i_op && inode->i_op->permission) {
266 retval = inode->i_op->permission(inode, mask);
269 * Exec permission on a regular file is denied if none
270 * of the execute bits are set.
272 * This check should be done by the ->permission()
275 if ((mask & MAY_EXEC) && S_ISREG(inode->i_mode) &&
276 !(inode->i_mode & S_IXUGO))
280 retval = generic_permission(inode, mask, NULL);
285 retval = devcgroup_inode_permission(inode, mask);
289 return security_inode_permission(inode,
290 mask & (MAY_READ|MAY_WRITE|MAY_EXEC));
294 * vfs_permission - check for access rights to a given path
295 * @nd: lookup result that describes the path
296 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
298 * Used to check for read/write/execute permissions on a path.
299 * We use "fsuid" for this, letting us set arbitrary permissions
300 * for filesystem access without changing the "normal" uids which
301 * are used for other things.
303 int vfs_permission(struct nameidata *nd, int mask)
305 return permission(nd->path.dentry->d_inode, mask, nd);
309 * file_permission - check for additional access rights to a given file
310 * @file: file to check access rights for
311 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
313 * Used to check for read/write/execute permissions on an already opened
317 * Do not use this function in new code. All access checks should
318 * be done using vfs_permission().
320 int file_permission(struct file *file, int mask)
322 return permission(file->f_path.dentry->d_inode, mask, NULL);
326 * get_write_access() gets write permission for a file.
327 * put_write_access() releases this write permission.
328 * This is used for regular files.
329 * We cannot support write (and maybe mmap read-write shared) accesses and
330 * MAP_DENYWRITE mmappings simultaneously. The i_writecount field of an inode
331 * can have the following values:
332 * 0: no writers, no VM_DENYWRITE mappings
333 * < 0: (-i_writecount) vm_area_structs with VM_DENYWRITE set exist
334 * > 0: (i_writecount) users are writing to the file.
336 * Normally we operate on that counter with atomic_{inc,dec} and it's safe
337 * except for the cases where we don't hold i_writecount yet. Then we need to
338 * use {get,deny}_write_access() - these functions check the sign and refuse
339 * to do the change if sign is wrong. Exclusion between them is provided by
340 * the inode->i_lock spinlock.
343 int get_write_access(struct inode * inode)
345 spin_lock(&inode->i_lock);
346 if (atomic_read(&inode->i_writecount) < 0) {
347 spin_unlock(&inode->i_lock);
350 atomic_inc(&inode->i_writecount);
351 spin_unlock(&inode->i_lock);
356 int deny_write_access(struct file * file)
358 struct inode *inode = file->f_path.dentry->d_inode;
360 spin_lock(&inode->i_lock);
361 if (atomic_read(&inode->i_writecount) > 0) {
362 spin_unlock(&inode->i_lock);
365 atomic_dec(&inode->i_writecount);
366 spin_unlock(&inode->i_lock);
372 * path_get - get a reference to a path
373 * @path: path to get the reference to
375 * Given a path increment the reference count to the dentry and the vfsmount.
377 void path_get(struct path *path)
382 EXPORT_SYMBOL(path_get);
385 * path_put - put a reference to a path
386 * @path: path to put the reference to
388 * Given a path decrement the reference count to the dentry and the vfsmount.
390 void path_put(struct path *path)
395 EXPORT_SYMBOL(path_put);
398 * release_open_intent - free up open intent resources
399 * @nd: pointer to nameidata
401 void release_open_intent(struct nameidata *nd)
403 if (nd->intent.open.file->f_path.dentry == NULL)
404 put_filp(nd->intent.open.file);
406 fput(nd->intent.open.file);
409 static inline struct dentry *
410 do_revalidate(struct dentry *dentry, struct nameidata *nd)
412 int status = dentry->d_op->d_revalidate(dentry, nd);
413 if (unlikely(status <= 0)) {
415 * The dentry failed validation.
416 * If d_revalidate returned 0 attempt to invalidate
417 * the dentry otherwise d_revalidate is asking us
418 * to return a fail status.
421 if (!d_invalidate(dentry)) {
427 dentry = ERR_PTR(status);
434 * Internal lookup() using the new generic dcache.
437 static struct dentry * cached_lookup(struct dentry * parent, struct qstr * name, struct nameidata *nd)
439 struct dentry * dentry = __d_lookup(parent, name);
441 /* lockess __d_lookup may fail due to concurrent d_move()
442 * in some unrelated directory, so try with d_lookup
445 dentry = d_lookup(parent, name);
447 if (dentry && dentry->d_op && dentry->d_op->d_revalidate)
448 dentry = do_revalidate(dentry, nd);
454 * Short-cut version of permission(), for calling by
455 * path_walk(), when dcache lock is held. Combines parts
456 * of permission() and generic_permission(), and tests ONLY for
457 * MAY_EXEC permission.
459 * If appropriate, check DAC only. If not appropriate, or
460 * short-cut DAC fails, then call permission() to do more
461 * complete permission check.
463 static int exec_permission_lite(struct inode *inode,
464 struct nameidata *nd)
466 umode_t mode = inode->i_mode;
468 if (inode->i_op && inode->i_op->permission)
471 if (current->fsuid == inode->i_uid)
473 else if (in_group_p(inode->i_gid))
479 if ((inode->i_mode & S_IXUGO) && capable(CAP_DAC_OVERRIDE))
482 if (S_ISDIR(inode->i_mode) && capable(CAP_DAC_OVERRIDE))
485 if (S_ISDIR(inode->i_mode) && capable(CAP_DAC_READ_SEARCH))
490 return security_inode_permission(inode, MAY_EXEC);
494 * This is called when everything else fails, and we actually have
495 * to go to the low-level filesystem to find out what we should do..
497 * We get the directory semaphore, and after getting that we also
498 * make sure that nobody added the entry to the dcache in the meantime..
501 static struct dentry * real_lookup(struct dentry * parent, struct qstr * name, struct nameidata *nd)
503 struct dentry * result;
504 struct inode *dir = parent->d_inode;
506 mutex_lock(&dir->i_mutex);
508 * First re-do the cached lookup just in case it was created
509 * while we waited for the directory semaphore..
511 * FIXME! This could use version numbering or similar to
512 * avoid unnecessary cache lookups.
514 * The "dcache_lock" is purely to protect the RCU list walker
515 * from concurrent renames at this point (we mustn't get false
516 * negatives from the RCU list walk here, unlike the optimistic
519 * so doing d_lookup() (with seqlock), instead of lockfree __d_lookup
521 result = d_lookup(parent, name);
523 struct dentry *dentry;
525 /* Don't create child dentry for a dead directory. */
526 result = ERR_PTR(-ENOENT);
530 dentry = d_alloc(parent, name);
531 result = ERR_PTR(-ENOMEM);
533 result = dir->i_op->lookup(dir, dentry, nd);
540 mutex_unlock(&dir->i_mutex);
545 * Uhhuh! Nasty case: the cache was re-populated while
546 * we waited on the semaphore. Need to revalidate.
548 mutex_unlock(&dir->i_mutex);
549 if (result->d_op && result->d_op->d_revalidate) {
550 result = do_revalidate(result, nd);
552 result = ERR_PTR(-ENOENT);
558 static __always_inline void
559 walk_init_root(const char *name, struct nameidata *nd)
561 struct fs_struct *fs = current->fs;
563 read_lock(&fs->lock);
566 read_unlock(&fs->lock);
570 * Wrapper to retry pathname resolution whenever the underlying
571 * file system returns an ESTALE.
573 * Retry the whole path once, forcing real lookup requests
574 * instead of relying on the dcache.
576 static __always_inline int link_path_walk(const char *name, struct nameidata *nd)
578 struct path save = nd->path;
581 /* make sure the stuff we saved doesn't go away */
584 result = __link_path_walk(name, nd);
585 if (result == -ESTALE) {
586 /* nd->path had been dropped */
589 nd->flags |= LOOKUP_REVAL;
590 result = __link_path_walk(name, nd);
598 static __always_inline int __vfs_follow_link(struct nameidata *nd, const char *link)
607 walk_init_root(link, nd);
609 res = link_path_walk(link, nd);
610 if (nd->depth || res || nd->last_type!=LAST_NORM)
613 * If it is an iterative symlinks resolution in open_namei() we
614 * have to copy the last component. And all that crap because of
615 * bloody create() on broken symlinks. Furrfu...
618 if (unlikely(!name)) {
622 strcpy(name, nd->last.name);
623 nd->last.name = name;
627 return PTR_ERR(link);
630 static void path_put_conditional(struct path *path, struct nameidata *nd)
633 if (path->mnt != nd->path.mnt)
637 static inline void path_to_nameidata(struct path *path, struct nameidata *nd)
639 dput(nd->path.dentry);
640 if (nd->path.mnt != path->mnt)
641 mntput(nd->path.mnt);
642 nd->path.mnt = path->mnt;
643 nd->path.dentry = path->dentry;
646 static __always_inline int __do_follow_link(struct path *path, struct nameidata *nd)
650 struct dentry *dentry = path->dentry;
652 touch_atime(path->mnt, dentry);
653 nd_set_link(nd, NULL);
655 if (path->mnt != nd->path.mnt) {
656 path_to_nameidata(path, nd);
660 cookie = dentry->d_inode->i_op->follow_link(dentry, nd);
661 error = PTR_ERR(cookie);
662 if (!IS_ERR(cookie)) {
663 char *s = nd_get_link(nd);
666 error = __vfs_follow_link(nd, s);
667 if (dentry->d_inode->i_op->put_link)
668 dentry->d_inode->i_op->put_link(dentry, nd, cookie);
676 * This limits recursive symlink follows to 8, while
677 * limiting consecutive symlinks to 40.
679 * Without that kind of total limit, nasty chains of consecutive
680 * symlinks can cause almost arbitrarily long lookups.
682 static inline int do_follow_link(struct path *path, struct nameidata *nd)
685 if (current->link_count >= MAX_NESTED_LINKS)
687 if (current->total_link_count >= 40)
689 BUG_ON(nd->depth >= MAX_NESTED_LINKS);
691 err = security_inode_follow_link(path->dentry, nd);
694 current->link_count++;
695 current->total_link_count++;
697 err = __do_follow_link(path, nd);
698 current->link_count--;
702 path_put_conditional(path, nd);
707 int follow_up(struct vfsmount **mnt, struct dentry **dentry)
709 struct vfsmount *parent;
710 struct dentry *mountpoint;
711 spin_lock(&vfsmount_lock);
712 parent=(*mnt)->mnt_parent;
713 if (parent == *mnt) {
714 spin_unlock(&vfsmount_lock);
718 mountpoint=dget((*mnt)->mnt_mountpoint);
719 spin_unlock(&vfsmount_lock);
721 *dentry = mountpoint;
727 /* no need for dcache_lock, as serialization is taken care in
730 static int __follow_mount(struct path *path)
733 while (d_mountpoint(path->dentry)) {
734 struct vfsmount *mounted = lookup_mnt(path->mnt, path->dentry);
741 path->dentry = dget(mounted->mnt_root);
747 static void follow_mount(struct vfsmount **mnt, struct dentry **dentry)
749 while (d_mountpoint(*dentry)) {
750 struct vfsmount *mounted = lookup_mnt(*mnt, *dentry);
756 *dentry = dget(mounted->mnt_root);
760 /* no need for dcache_lock, as serialization is taken care in
763 int follow_down(struct vfsmount **mnt, struct dentry **dentry)
765 struct vfsmount *mounted;
767 mounted = lookup_mnt(*mnt, *dentry);
772 *dentry = dget(mounted->mnt_root);
778 static __always_inline void follow_dotdot(struct nameidata *nd)
780 struct fs_struct *fs = current->fs;
783 struct vfsmount *parent;
784 struct dentry *old = nd->path.dentry;
786 read_lock(&fs->lock);
787 if (nd->path.dentry == fs->root.dentry &&
788 nd->path.mnt == fs->root.mnt) {
789 read_unlock(&fs->lock);
792 read_unlock(&fs->lock);
793 spin_lock(&dcache_lock);
794 if (nd->path.dentry != nd->path.mnt->mnt_root) {
795 nd->path.dentry = dget(nd->path.dentry->d_parent);
796 spin_unlock(&dcache_lock);
800 spin_unlock(&dcache_lock);
801 spin_lock(&vfsmount_lock);
802 parent = nd->path.mnt->mnt_parent;
803 if (parent == nd->path.mnt) {
804 spin_unlock(&vfsmount_lock);
808 nd->path.dentry = dget(nd->path.mnt->mnt_mountpoint);
809 spin_unlock(&vfsmount_lock);
811 mntput(nd->path.mnt);
812 nd->path.mnt = parent;
814 follow_mount(&nd->path.mnt, &nd->path.dentry);
818 * It's more convoluted than I'd like it to be, but... it's still fairly
819 * small and for now I'd prefer to have fast path as straight as possible.
820 * It _is_ time-critical.
822 static int do_lookup(struct nameidata *nd, struct qstr *name,
825 struct vfsmount *mnt = nd->path.mnt;
826 struct dentry *dentry = __d_lookup(nd->path.dentry, name);
830 if (dentry->d_op && dentry->d_op->d_revalidate)
831 goto need_revalidate;
834 path->dentry = dentry;
835 __follow_mount(path);
839 dentry = real_lookup(nd->path.dentry, name, nd);
845 dentry = do_revalidate(dentry, nd);
853 return PTR_ERR(dentry);
858 * This is the basic name resolution function, turning a pathname into
859 * the final dentry. We expect 'base' to be positive and a directory.
861 * Returns 0 and nd will have valid dentry and mnt on success.
862 * Returns error and drops reference to input namei data on failure.
864 static int __link_path_walk(const char *name, struct nameidata *nd)
869 unsigned int lookup_flags = nd->flags;
876 inode = nd->path.dentry->d_inode;
878 lookup_flags = LOOKUP_FOLLOW | (nd->flags & LOOKUP_CONTINUE);
880 /* At this point we know we have a real path component. */
886 nd->flags |= LOOKUP_CONTINUE;
887 err = exec_permission_lite(inode, nd);
889 err = vfs_permission(nd, MAY_EXEC);
894 c = *(const unsigned char *)name;
896 hash = init_name_hash();
899 hash = partial_name_hash(c, hash);
900 c = *(const unsigned char *)name;
901 } while (c && (c != '/'));
902 this.len = name - (const char *) this.name;
903 this.hash = end_name_hash(hash);
905 /* remove trailing slashes? */
908 while (*++name == '/');
910 goto last_with_slashes;
913 * "." and ".." are special - ".." especially so because it has
914 * to be able to know about the current root directory and
915 * parent relationships.
917 if (this.name[0] == '.') switch (this.len) {
921 if (this.name[1] != '.')
924 inode = nd->path.dentry->d_inode;
930 * See if the low-level filesystem might want
931 * to use its own hash..
933 if (nd->path.dentry->d_op && nd->path.dentry->d_op->d_hash) {
934 err = nd->path.dentry->d_op->d_hash(nd->path.dentry,
939 /* This does the actual lookups.. */
940 err = do_lookup(nd, &this, &next);
945 inode = next.dentry->d_inode;
952 if (inode->i_op->follow_link) {
953 err = do_follow_link(&next, nd);
957 inode = nd->path.dentry->d_inode;
964 path_to_nameidata(&next, nd);
966 if (!inode->i_op->lookup)
969 /* here ends the main loop */
972 lookup_flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY;
974 /* Clear LOOKUP_CONTINUE iff it was previously unset */
975 nd->flags &= lookup_flags | ~LOOKUP_CONTINUE;
976 if (lookup_flags & LOOKUP_PARENT)
978 if (this.name[0] == '.') switch (this.len) {
982 if (this.name[1] != '.')
985 inode = nd->path.dentry->d_inode;
990 if (nd->path.dentry->d_op && nd->path.dentry->d_op->d_hash) {
991 err = nd->path.dentry->d_op->d_hash(nd->path.dentry,
996 err = do_lookup(nd, &this, &next);
999 inode = next.dentry->d_inode;
1000 if ((lookup_flags & LOOKUP_FOLLOW)
1001 && inode && inode->i_op && inode->i_op->follow_link) {
1002 err = do_follow_link(&next, nd);
1005 inode = nd->path.dentry->d_inode;
1007 path_to_nameidata(&next, nd);
1011 if (lookup_flags & LOOKUP_DIRECTORY) {
1013 if (!inode->i_op || !inode->i_op->lookup)
1019 nd->last_type = LAST_NORM;
1020 if (this.name[0] != '.')
1023 nd->last_type = LAST_DOT;
1024 else if (this.len == 2 && this.name[1] == '.')
1025 nd->last_type = LAST_DOTDOT;
1030 * We bypassed the ordinary revalidation routines.
1031 * We may need to check the cached dentry for staleness.
1033 if (nd->path.dentry && nd->path.dentry->d_sb &&
1034 (nd->path.dentry->d_sb->s_type->fs_flags & FS_REVAL_DOT)) {
1036 /* Note: we do not d_invalidate() */
1037 if (!nd->path.dentry->d_op->d_revalidate(
1038 nd->path.dentry, nd))
1044 path_put_conditional(&next, nd);
1047 path_put(&nd->path);
1052 static int path_walk(const char *name, struct nameidata *nd)
1054 current->total_link_count = 0;
1055 return link_path_walk(name, nd);
1058 /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
1059 static int do_path_lookup(int dfd, const char *name,
1060 unsigned int flags, struct nameidata *nd)
1065 struct fs_struct *fs = current->fs;
1067 nd->last_type = LAST_ROOT; /* if there are only slashes... */
1072 read_lock(&fs->lock);
1073 nd->path = fs->root;
1074 path_get(&fs->root);
1075 read_unlock(&fs->lock);
1076 } else if (dfd == AT_FDCWD) {
1077 read_lock(&fs->lock);
1080 read_unlock(&fs->lock);
1082 struct dentry *dentry;
1084 file = fget_light(dfd, &fput_needed);
1089 dentry = file->f_path.dentry;
1092 if (!S_ISDIR(dentry->d_inode->i_mode))
1095 retval = file_permission(file, MAY_EXEC);
1099 nd->path = file->f_path;
1100 path_get(&file->f_path);
1102 fput_light(file, fput_needed);
1105 retval = path_walk(name, nd);
1106 if (unlikely(!retval && !audit_dummy_context() && nd->path.dentry &&
1107 nd->path.dentry->d_inode))
1108 audit_inode(name, nd->path.dentry);
1113 fput_light(file, fput_needed);
1117 int path_lookup(const char *name, unsigned int flags,
1118 struct nameidata *nd)
1120 return do_path_lookup(AT_FDCWD, name, flags, nd);
1124 * vfs_path_lookup - lookup a file path relative to a dentry-vfsmount pair
1125 * @dentry: pointer to dentry of the base directory
1126 * @mnt: pointer to vfs mount of the base directory
1127 * @name: pointer to file name
1128 * @flags: lookup flags
1129 * @nd: pointer to nameidata
1131 int vfs_path_lookup(struct dentry *dentry, struct vfsmount *mnt,
1132 const char *name, unsigned int flags,
1133 struct nameidata *nd)
1137 /* same as do_path_lookup */
1138 nd->last_type = LAST_ROOT;
1142 nd->path.dentry = dentry;
1144 path_get(&nd->path);
1146 retval = path_walk(name, nd);
1147 if (unlikely(!retval && !audit_dummy_context() && nd->path.dentry &&
1148 nd->path.dentry->d_inode))
1149 audit_inode(name, nd->path.dentry);
1155 static int __path_lookup_intent_open(int dfd, const char *name,
1156 unsigned int lookup_flags, struct nameidata *nd,
1157 int open_flags, int create_mode)
1159 struct file *filp = get_empty_filp();
1164 nd->intent.open.file = filp;
1165 nd->intent.open.flags = open_flags;
1166 nd->intent.open.create_mode = create_mode;
1167 err = do_path_lookup(dfd, name, lookup_flags|LOOKUP_OPEN, nd);
1168 if (IS_ERR(nd->intent.open.file)) {
1170 err = PTR_ERR(nd->intent.open.file);
1171 path_put(&nd->path);
1173 } else if (err != 0)
1174 release_open_intent(nd);
1179 * path_lookup_open - lookup a file path with open intent
1180 * @dfd: the directory to use as base, or AT_FDCWD
1181 * @name: pointer to file name
1182 * @lookup_flags: lookup intent flags
1183 * @nd: pointer to nameidata
1184 * @open_flags: open intent flags
1186 int path_lookup_open(int dfd, const char *name, unsigned int lookup_flags,
1187 struct nameidata *nd, int open_flags)
1189 return __path_lookup_intent_open(dfd, name, lookup_flags, nd,
1194 * path_lookup_create - lookup a file path with open + create intent
1195 * @dfd: the directory to use as base, or AT_FDCWD
1196 * @name: pointer to file name
1197 * @lookup_flags: lookup intent flags
1198 * @nd: pointer to nameidata
1199 * @open_flags: open intent flags
1200 * @create_mode: create intent flags
1202 static int path_lookup_create(int dfd, const char *name,
1203 unsigned int lookup_flags, struct nameidata *nd,
1204 int open_flags, int create_mode)
1206 return __path_lookup_intent_open(dfd, name, lookup_flags|LOOKUP_CREATE,
1207 nd, open_flags, create_mode);
1210 int __user_path_lookup_open(const char __user *name, unsigned int lookup_flags,
1211 struct nameidata *nd, int open_flags)
1213 char *tmp = getname(name);
1214 int err = PTR_ERR(tmp);
1217 err = __path_lookup_intent_open(AT_FDCWD, tmp, lookup_flags, nd, open_flags, 0);
1223 static struct dentry *__lookup_hash(struct qstr *name,
1224 struct dentry *base, struct nameidata *nd)
1226 struct dentry *dentry;
1227 struct inode *inode;
1230 inode = base->d_inode;
1233 * See if the low-level filesystem might want
1234 * to use its own hash..
1236 if (base->d_op && base->d_op->d_hash) {
1237 err = base->d_op->d_hash(base, name);
1238 dentry = ERR_PTR(err);
1243 dentry = cached_lookup(base, name, nd);
1247 /* Don't create child dentry for a dead directory. */
1248 dentry = ERR_PTR(-ENOENT);
1249 if (IS_DEADDIR(inode))
1252 new = d_alloc(base, name);
1253 dentry = ERR_PTR(-ENOMEM);
1256 dentry = inode->i_op->lookup(inode, new, nd);
1267 * Restricted form of lookup. Doesn't follow links, single-component only,
1268 * needs parent already locked. Doesn't follow mounts.
1271 static struct dentry *lookup_hash(struct nameidata *nd)
1275 err = permission(nd->path.dentry->d_inode, MAY_EXEC, nd);
1277 return ERR_PTR(err);
1278 return __lookup_hash(&nd->last, nd->path.dentry, nd);
1281 static int __lookup_one_len(const char *name, struct qstr *this,
1282 struct dentry *base, int len)
1292 hash = init_name_hash();
1294 c = *(const unsigned char *)name++;
1295 if (c == '/' || c == '\0')
1297 hash = partial_name_hash(c, hash);
1299 this->hash = end_name_hash(hash);
1304 * lookup_one_len - filesystem helper to lookup single pathname component
1305 * @name: pathname component to lookup
1306 * @base: base directory to lookup from
1307 * @len: maximum length @len should be interpreted to
1309 * Note that this routine is purely a helper for filesystem usage and should
1310 * not be called by generic code. Also note that by using this function the
1311 * nameidata argument is passed to the filesystem methods and a filesystem
1312 * using this helper needs to be prepared for that.
1314 struct dentry *lookup_one_len(const char *name, struct dentry *base, int len)
1319 err = __lookup_one_len(name, &this, base, len);
1321 return ERR_PTR(err);
1323 err = permission(base->d_inode, MAY_EXEC, NULL);
1325 return ERR_PTR(err);
1326 return __lookup_hash(&this, base, NULL);
1330 * lookup_one_noperm - bad hack for sysfs
1331 * @name: pathname component to lookup
1332 * @base: base directory to lookup from
1334 * This is a variant of lookup_one_len that doesn't perform any permission
1335 * checks. It's a horrible hack to work around the braindead sysfs
1336 * architecture and should not be used anywhere else.
1338 * DON'T USE THIS FUNCTION EVER, thanks.
1340 struct dentry *lookup_one_noperm(const char *name, struct dentry *base)
1345 err = __lookup_one_len(name, &this, base, strlen(name));
1347 return ERR_PTR(err);
1348 return __lookup_hash(&this, base, NULL);
1351 int __user_walk_fd(int dfd, const char __user *name, unsigned flags,
1352 struct nameidata *nd)
1354 char *tmp = getname(name);
1355 int err = PTR_ERR(tmp);
1358 err = do_path_lookup(dfd, tmp, flags, nd);
1364 int __user_walk(const char __user *name, unsigned flags, struct nameidata *nd)
1366 return __user_walk_fd(AT_FDCWD, name, flags, nd);
1370 * It's inline, so penalty for filesystems that don't use sticky bit is
1373 static inline int check_sticky(struct inode *dir, struct inode *inode)
1375 if (!(dir->i_mode & S_ISVTX))
1377 if (inode->i_uid == current->fsuid)
1379 if (dir->i_uid == current->fsuid)
1381 return !capable(CAP_FOWNER);
1385 * Check whether we can remove a link victim from directory dir, check
1386 * whether the type of victim is right.
1387 * 1. We can't do it if dir is read-only (done in permission())
1388 * 2. We should have write and exec permissions on dir
1389 * 3. We can't remove anything from append-only dir
1390 * 4. We can't do anything with immutable dir (done in permission())
1391 * 5. If the sticky bit on dir is set we should either
1392 * a. be owner of dir, or
1393 * b. be owner of victim, or
1394 * c. have CAP_FOWNER capability
1395 * 6. If the victim is append-only or immutable we can't do antyhing with
1396 * links pointing to it.
1397 * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR.
1398 * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR.
1399 * 9. We can't remove a root or mountpoint.
1400 * 10. We don't allow removal of NFS sillyrenamed files; it's handled by
1401 * nfs_async_unlink().
1403 static int may_delete(struct inode *dir,struct dentry *victim,int isdir)
1407 if (!victim->d_inode)
1410 BUG_ON(victim->d_parent->d_inode != dir);
1411 audit_inode_child(victim->d_name.name, victim, dir);
1413 error = permission(dir,MAY_WRITE | MAY_EXEC, NULL);
1418 if (check_sticky(dir, victim->d_inode)||IS_APPEND(victim->d_inode)||
1419 IS_IMMUTABLE(victim->d_inode))
1422 if (!S_ISDIR(victim->d_inode->i_mode))
1424 if (IS_ROOT(victim))
1426 } else if (S_ISDIR(victim->d_inode->i_mode))
1428 if (IS_DEADDIR(dir))
1430 if (victim->d_flags & DCACHE_NFSFS_RENAMED)
1435 /* Check whether we can create an object with dentry child in directory
1437 * 1. We can't do it if child already exists (open has special treatment for
1438 * this case, but since we are inlined it's OK)
1439 * 2. We can't do it if dir is read-only (done in permission())
1440 * 3. We should have write and exec permissions on dir
1441 * 4. We can't do it if dir is immutable (done in permission())
1443 static inline int may_create(struct inode *dir, struct dentry *child,
1444 struct nameidata *nd)
1448 if (IS_DEADDIR(dir))
1450 return permission(dir,MAY_WRITE | MAY_EXEC, nd);
1454 * O_DIRECTORY translates into forcing a directory lookup.
1456 static inline int lookup_flags(unsigned int f)
1458 unsigned long retval = LOOKUP_FOLLOW;
1461 retval &= ~LOOKUP_FOLLOW;
1463 if (f & O_DIRECTORY)
1464 retval |= LOOKUP_DIRECTORY;
1470 * p1 and p2 should be directories on the same fs.
1472 struct dentry *lock_rename(struct dentry *p1, struct dentry *p2)
1477 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1481 mutex_lock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1483 for (p = p1; p->d_parent != p; p = p->d_parent) {
1484 if (p->d_parent == p2) {
1485 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_PARENT);
1486 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_CHILD);
1491 for (p = p2; p->d_parent != p; p = p->d_parent) {
1492 if (p->d_parent == p1) {
1493 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1494 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1499 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1500 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1504 void unlock_rename(struct dentry *p1, struct dentry *p2)
1506 mutex_unlock(&p1->d_inode->i_mutex);
1508 mutex_unlock(&p2->d_inode->i_mutex);
1509 mutex_unlock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1513 int vfs_create(struct inode *dir, struct dentry *dentry, int mode,
1514 struct nameidata *nd)
1516 int error = may_create(dir, dentry, nd);
1521 if (!dir->i_op || !dir->i_op->create)
1522 return -EACCES; /* shouldn't it be ENOSYS? */
1525 error = security_inode_create(dir, dentry, mode);
1529 error = dir->i_op->create(dir, dentry, mode, nd);
1531 fsnotify_create(dir, dentry);
1535 int may_open(struct nameidata *nd, int acc_mode, int flag)
1537 struct dentry *dentry = nd->path.dentry;
1538 struct inode *inode = dentry->d_inode;
1544 if (S_ISLNK(inode->i_mode))
1547 if (S_ISDIR(inode->i_mode) && (acc_mode & MAY_WRITE))
1551 * FIFO's, sockets and device files are special: they don't
1552 * actually live on the filesystem itself, and as such you
1553 * can write to them even if the filesystem is read-only.
1555 if (S_ISFIFO(inode->i_mode) || S_ISSOCK(inode->i_mode)) {
1557 } else if (S_ISBLK(inode->i_mode) || S_ISCHR(inode->i_mode)) {
1558 if (nd->path.mnt->mnt_flags & MNT_NODEV)
1564 error = vfs_permission(nd, acc_mode);
1568 * An append-only file must be opened in append mode for writing.
1570 if (IS_APPEND(inode)) {
1571 if ((flag & FMODE_WRITE) && !(flag & O_APPEND))
1577 /* O_NOATIME can only be set by the owner or superuser */
1578 if (flag & O_NOATIME)
1579 if (!is_owner_or_cap(inode))
1583 * Ensure there are no outstanding leases on the file.
1585 error = break_lease(inode, flag);
1589 if (flag & O_TRUNC) {
1590 error = get_write_access(inode);
1595 * Refuse to truncate files with mandatory locks held on them.
1597 error = locks_verify_locked(inode);
1601 error = do_truncate(dentry, 0,
1602 ATTR_MTIME|ATTR_CTIME|ATTR_OPEN,
1605 put_write_access(inode);
1609 if (flag & FMODE_WRITE)
1616 * Be careful about ever adding any more callers of this
1617 * function. Its flags must be in the namei format, not
1618 * what get passed to sys_open().
1620 static int __open_namei_create(struct nameidata *nd, struct path *path,
1624 struct dentry *dir = nd->path.dentry;
1626 if (!IS_POSIXACL(dir->d_inode))
1627 mode &= ~current->fs->umask;
1628 error = vfs_create(dir->d_inode, path->dentry, mode, nd);
1629 mutex_unlock(&dir->d_inode->i_mutex);
1630 dput(nd->path.dentry);
1631 nd->path.dentry = path->dentry;
1634 /* Don't check for write permission, don't truncate */
1635 return may_open(nd, 0, flag & ~O_TRUNC);
1639 * Note that while the flag value (low two bits) for sys_open means:
1644 * it is changed into
1645 * 00 - no permissions needed
1646 * 01 - read-permission
1647 * 10 - write-permission
1649 * for the internal routines (ie open_namei()/follow_link() etc)
1650 * This is more logical, and also allows the 00 "no perm needed"
1651 * to be used for symlinks (where the permissions are checked
1655 static inline int open_to_namei_flags(int flag)
1657 if ((flag+1) & O_ACCMODE)
1662 static int open_will_write_to_fs(int flag, struct inode *inode)
1665 * We'll never write to the fs underlying
1668 if (special_file(inode->i_mode))
1670 return (flag & O_TRUNC);
1674 * Note that the low bits of the passed in "open_flag"
1675 * are not the same as in the local variable "flag". See
1676 * open_to_namei_flags() for more details.
1678 struct file *do_filp_open(int dfd, const char *pathname,
1679 int open_flag, int mode)
1682 struct nameidata nd;
1683 int acc_mode, error;
1688 int flag = open_to_namei_flags(open_flag);
1690 acc_mode = MAY_OPEN | ACC_MODE(flag);
1692 /* O_TRUNC implies we need access checks for write permissions */
1694 acc_mode |= MAY_WRITE;
1696 /* Allow the LSM permission hook to distinguish append
1697 access from general write access. */
1698 if (flag & O_APPEND)
1699 acc_mode |= MAY_APPEND;
1702 * The simplest case - just a plain lookup.
1704 if (!(flag & O_CREAT)) {
1705 error = path_lookup_open(dfd, pathname, lookup_flags(flag),
1708 return ERR_PTR(error);
1713 * Create - we need to know the parent.
1715 error = path_lookup_create(dfd, pathname, LOOKUP_PARENT,
1718 return ERR_PTR(error);
1721 * We have the parent and last component. First of all, check
1722 * that we are not asked to creat(2) an obvious directory - that
1726 if (nd.last_type != LAST_NORM || nd.last.name[nd.last.len])
1729 dir = nd.path.dentry;
1730 nd.flags &= ~LOOKUP_PARENT;
1731 mutex_lock(&dir->d_inode->i_mutex);
1732 path.dentry = lookup_hash(&nd);
1733 path.mnt = nd.path.mnt;
1736 error = PTR_ERR(path.dentry);
1737 if (IS_ERR(path.dentry)) {
1738 mutex_unlock(&dir->d_inode->i_mutex);
1742 if (IS_ERR(nd.intent.open.file)) {
1743 error = PTR_ERR(nd.intent.open.file);
1744 goto exit_mutex_unlock;
1747 /* Negative dentry, just create the file */
1748 if (!path.dentry->d_inode) {
1750 * This write is needed to ensure that a
1751 * ro->rw transition does not occur between
1752 * the time when the file is created and when
1753 * a permanent write count is taken through
1754 * the 'struct file' in nameidata_to_filp().
1756 error = mnt_want_write(nd.path.mnt);
1758 goto exit_mutex_unlock;
1759 error = __open_namei_create(&nd, &path, flag, mode);
1761 mnt_drop_write(nd.path.mnt);
1764 filp = nameidata_to_filp(&nd, open_flag);
1765 mnt_drop_write(nd.path.mnt);
1770 * It already exists.
1772 mutex_unlock(&dir->d_inode->i_mutex);
1773 audit_inode(pathname, path.dentry);
1779 if (__follow_mount(&path)) {
1781 if (flag & O_NOFOLLOW)
1786 if (!path.dentry->d_inode)
1788 if (path.dentry->d_inode->i_op && path.dentry->d_inode->i_op->follow_link)
1791 path_to_nameidata(&path, &nd);
1793 if (path.dentry->d_inode && S_ISDIR(path.dentry->d_inode->i_mode))
1798 * 1. may_open() truncates a file
1799 * 2. a rw->ro mount transition occurs
1800 * 3. nameidata_to_filp() fails due to
1802 * That would be inconsistent, and should
1803 * be avoided. Taking this mnt write here
1804 * ensures that (2) can not occur.
1806 will_write = open_will_write_to_fs(flag, nd.path.dentry->d_inode);
1808 error = mnt_want_write(nd.path.mnt);
1812 error = may_open(&nd, acc_mode, flag);
1815 mnt_drop_write(nd.path.mnt);
1818 filp = nameidata_to_filp(&nd, open_flag);
1820 * It is now safe to drop the mnt write
1821 * because the filp has had a write taken
1825 mnt_drop_write(nd.path.mnt);
1829 mutex_unlock(&dir->d_inode->i_mutex);
1831 path_put_conditional(&path, &nd);
1833 if (!IS_ERR(nd.intent.open.file))
1834 release_open_intent(&nd);
1836 return ERR_PTR(error);
1840 if (flag & O_NOFOLLOW)
1843 * This is subtle. Instead of calling do_follow_link() we do the
1844 * thing by hands. The reason is that this way we have zero link_count
1845 * and path_walk() (called from ->follow_link) honoring LOOKUP_PARENT.
1846 * After that we have the parent and last component, i.e.
1847 * we are in the same situation as after the first path_walk().
1848 * Well, almost - if the last component is normal we get its copy
1849 * stored in nd->last.name and we will have to putname() it when we
1850 * are done. Procfs-like symlinks just set LAST_BIND.
1852 nd.flags |= LOOKUP_PARENT;
1853 error = security_inode_follow_link(path.dentry, &nd);
1856 error = __do_follow_link(&path, &nd);
1858 /* Does someone understand code flow here? Or it is only
1859 * me so stupid? Anathema to whoever designed this non-sense
1860 * with "intent.open".
1862 release_open_intent(&nd);
1863 return ERR_PTR(error);
1865 nd.flags &= ~LOOKUP_PARENT;
1866 if (nd.last_type == LAST_BIND)
1869 if (nd.last_type != LAST_NORM)
1871 if (nd.last.name[nd.last.len]) {
1872 __putname(nd.last.name);
1877 __putname(nd.last.name);
1880 dir = nd.path.dentry;
1881 mutex_lock(&dir->d_inode->i_mutex);
1882 path.dentry = lookup_hash(&nd);
1883 path.mnt = nd.path.mnt;
1884 __putname(nd.last.name);
1889 * filp_open - open file and return file pointer
1891 * @filename: path to open
1892 * @flags: open flags as per the open(2) second argument
1893 * @mode: mode for the new file if O_CREAT is set, else ignored
1895 * This is the helper to open a file from kernelspace if you really
1896 * have to. But in generally you should not do this, so please move
1897 * along, nothing to see here..
1899 struct file *filp_open(const char *filename, int flags, int mode)
1901 return do_filp_open(AT_FDCWD, filename, flags, mode);
1903 EXPORT_SYMBOL(filp_open);
1906 * lookup_create - lookup a dentry, creating it if it doesn't exist
1907 * @nd: nameidata info
1908 * @is_dir: directory flag
1910 * Simple function to lookup and return a dentry and create it
1911 * if it doesn't exist. Is SMP-safe.
1913 * Returns with nd->path.dentry->d_inode->i_mutex locked.
1915 struct dentry *lookup_create(struct nameidata *nd, int is_dir)
1917 struct dentry *dentry = ERR_PTR(-EEXIST);
1919 mutex_lock_nested(&nd->path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
1921 * Yucky last component or no last component at all?
1922 * (foo/., foo/.., /////)
1924 if (nd->last_type != LAST_NORM)
1926 nd->flags &= ~LOOKUP_PARENT;
1927 nd->flags |= LOOKUP_CREATE;
1928 nd->intent.open.flags = O_EXCL;
1931 * Do the final lookup.
1933 dentry = lookup_hash(nd);
1937 if (dentry->d_inode)
1940 * Special case - lookup gave negative, but... we had foo/bar/
1941 * From the vfs_mknod() POV we just have a negative dentry -
1942 * all is fine. Let's be bastards - you had / on the end, you've
1943 * been asking for (non-existent) directory. -ENOENT for you.
1945 if (unlikely(!is_dir && nd->last.name[nd->last.len])) {
1947 dentry = ERR_PTR(-ENOENT);
1952 dentry = ERR_PTR(-EEXIST);
1956 EXPORT_SYMBOL_GPL(lookup_create);
1958 int vfs_mknod(struct inode *dir, struct dentry *dentry, int mode, dev_t dev)
1960 int error = may_create(dir, dentry, NULL);
1965 if ((S_ISCHR(mode) || S_ISBLK(mode)) && !capable(CAP_MKNOD))
1968 if (!dir->i_op || !dir->i_op->mknod)
1971 error = devcgroup_inode_mknod(mode, dev);
1975 error = security_inode_mknod(dir, dentry, mode, dev);
1980 error = dir->i_op->mknod(dir, dentry, mode, dev);
1982 fsnotify_create(dir, dentry);
1986 static int may_mknod(mode_t mode)
1988 switch (mode & S_IFMT) {
1994 case 0: /* zero mode translates to S_IFREG */
2003 asmlinkage long sys_mknodat(int dfd, const char __user *filename, int mode,
2008 struct dentry * dentry;
2009 struct nameidata nd;
2013 tmp = getname(filename);
2015 return PTR_ERR(tmp);
2017 error = do_path_lookup(dfd, tmp, LOOKUP_PARENT, &nd);
2020 dentry = lookup_create(&nd, 0);
2021 if (IS_ERR(dentry)) {
2022 error = PTR_ERR(dentry);
2025 if (!IS_POSIXACL(nd.path.dentry->d_inode))
2026 mode &= ~current->fs->umask;
2027 error = may_mknod(mode);
2030 error = mnt_want_write(nd.path.mnt);
2033 switch (mode & S_IFMT) {
2034 case 0: case S_IFREG:
2035 error = vfs_create(nd.path.dentry->d_inode,dentry,mode,&nd);
2037 case S_IFCHR: case S_IFBLK:
2038 error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode,
2039 new_decode_dev(dev));
2041 case S_IFIFO: case S_IFSOCK:
2042 error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode,0);
2045 mnt_drop_write(nd.path.mnt);
2049 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2057 asmlinkage long sys_mknod(const char __user *filename, int mode, unsigned dev)
2059 return sys_mknodat(AT_FDCWD, filename, mode, dev);
2062 int vfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
2064 int error = may_create(dir, dentry, NULL);
2069 if (!dir->i_op || !dir->i_op->mkdir)
2072 mode &= (S_IRWXUGO|S_ISVTX);
2073 error = security_inode_mkdir(dir, dentry, mode);
2078 error = dir->i_op->mkdir(dir, dentry, mode);
2080 fsnotify_mkdir(dir, dentry);
2084 asmlinkage long sys_mkdirat(int dfd, const char __user *pathname, int mode)
2088 struct dentry *dentry;
2089 struct nameidata nd;
2091 tmp = getname(pathname);
2092 error = PTR_ERR(tmp);
2096 error = do_path_lookup(dfd, tmp, LOOKUP_PARENT, &nd);
2099 dentry = lookup_create(&nd, 1);
2100 error = PTR_ERR(dentry);
2104 if (!IS_POSIXACL(nd.path.dentry->d_inode))
2105 mode &= ~current->fs->umask;
2106 error = mnt_want_write(nd.path.mnt);
2109 error = vfs_mkdir(nd.path.dentry->d_inode, dentry, mode);
2110 mnt_drop_write(nd.path.mnt);
2114 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2122 asmlinkage long sys_mkdir(const char __user *pathname, int mode)
2124 return sys_mkdirat(AT_FDCWD, pathname, mode);
2128 * We try to drop the dentry early: we should have
2129 * a usage count of 2 if we're the only user of this
2130 * dentry, and if that is true (possibly after pruning
2131 * the dcache), then we drop the dentry now.
2133 * A low-level filesystem can, if it choses, legally
2136 * if (!d_unhashed(dentry))
2139 * if it cannot handle the case of removing a directory
2140 * that is still in use by something else..
2142 void dentry_unhash(struct dentry *dentry)
2145 shrink_dcache_parent(dentry);
2146 spin_lock(&dcache_lock);
2147 spin_lock(&dentry->d_lock);
2148 if (atomic_read(&dentry->d_count) == 2)
2150 spin_unlock(&dentry->d_lock);
2151 spin_unlock(&dcache_lock);
2154 int vfs_rmdir(struct inode *dir, struct dentry *dentry)
2156 int error = may_delete(dir, dentry, 1);
2161 if (!dir->i_op || !dir->i_op->rmdir)
2166 mutex_lock(&dentry->d_inode->i_mutex);
2167 dentry_unhash(dentry);
2168 if (d_mountpoint(dentry))
2171 error = security_inode_rmdir(dir, dentry);
2173 error = dir->i_op->rmdir(dir, dentry);
2175 dentry->d_inode->i_flags |= S_DEAD;
2178 mutex_unlock(&dentry->d_inode->i_mutex);
2187 static long do_rmdir(int dfd, const char __user *pathname)
2191 struct dentry *dentry;
2192 struct nameidata nd;
2194 name = getname(pathname);
2196 return PTR_ERR(name);
2198 error = do_path_lookup(dfd, name, LOOKUP_PARENT, &nd);
2202 switch(nd.last_type) {
2213 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2214 dentry = lookup_hash(&nd);
2215 error = PTR_ERR(dentry);
2218 error = mnt_want_write(nd.path.mnt);
2221 error = vfs_rmdir(nd.path.dentry->d_inode, dentry);
2222 mnt_drop_write(nd.path.mnt);
2226 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2234 asmlinkage long sys_rmdir(const char __user *pathname)
2236 return do_rmdir(AT_FDCWD, pathname);
2239 int vfs_unlink(struct inode *dir, struct dentry *dentry)
2241 int error = may_delete(dir, dentry, 0);
2246 if (!dir->i_op || !dir->i_op->unlink)
2251 mutex_lock(&dentry->d_inode->i_mutex);
2252 if (d_mountpoint(dentry))
2255 error = security_inode_unlink(dir, dentry);
2257 error = dir->i_op->unlink(dir, dentry);
2259 mutex_unlock(&dentry->d_inode->i_mutex);
2261 /* We don't d_delete() NFS sillyrenamed files--they still exist. */
2262 if (!error && !(dentry->d_flags & DCACHE_NFSFS_RENAMED)) {
2263 fsnotify_link_count(dentry->d_inode);
2271 * Make sure that the actual truncation of the file will occur outside its
2272 * directory's i_mutex. Truncate can take a long time if there is a lot of
2273 * writeout happening, and we don't want to prevent access to the directory
2274 * while waiting on the I/O.
2276 static long do_unlinkat(int dfd, const char __user *pathname)
2280 struct dentry *dentry;
2281 struct nameidata nd;
2282 struct inode *inode = NULL;
2284 name = getname(pathname);
2286 return PTR_ERR(name);
2288 error = do_path_lookup(dfd, name, LOOKUP_PARENT, &nd);
2292 if (nd.last_type != LAST_NORM)
2294 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2295 dentry = lookup_hash(&nd);
2296 error = PTR_ERR(dentry);
2297 if (!IS_ERR(dentry)) {
2298 /* Why not before? Because we want correct error value */
2299 if (nd.last.name[nd.last.len])
2301 inode = dentry->d_inode;
2303 atomic_inc(&inode->i_count);
2304 error = mnt_want_write(nd.path.mnt);
2307 error = vfs_unlink(nd.path.dentry->d_inode, dentry);
2308 mnt_drop_write(nd.path.mnt);
2312 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2314 iput(inode); /* truncate the inode here */
2322 error = !dentry->d_inode ? -ENOENT :
2323 S_ISDIR(dentry->d_inode->i_mode) ? -EISDIR : -ENOTDIR;
2327 asmlinkage long sys_unlinkat(int dfd, const char __user *pathname, int flag)
2329 if ((flag & ~AT_REMOVEDIR) != 0)
2332 if (flag & AT_REMOVEDIR)
2333 return do_rmdir(dfd, pathname);
2335 return do_unlinkat(dfd, pathname);
2338 asmlinkage long sys_unlink(const char __user *pathname)
2340 return do_unlinkat(AT_FDCWD, pathname);
2343 int vfs_symlink(struct inode *dir, struct dentry *dentry, const char *oldname)
2345 int error = may_create(dir, dentry, NULL);
2350 if (!dir->i_op || !dir->i_op->symlink)
2353 error = security_inode_symlink(dir, dentry, oldname);
2358 error = dir->i_op->symlink(dir, dentry, oldname);
2360 fsnotify_create(dir, dentry);
2364 asmlinkage long sys_symlinkat(const char __user *oldname,
2365 int newdfd, const char __user *newname)
2370 struct dentry *dentry;
2371 struct nameidata nd;
2373 from = getname(oldname);
2375 return PTR_ERR(from);
2376 to = getname(newname);
2377 error = PTR_ERR(to);
2381 error = do_path_lookup(newdfd, to, LOOKUP_PARENT, &nd);
2384 dentry = lookup_create(&nd, 0);
2385 error = PTR_ERR(dentry);
2389 error = mnt_want_write(nd.path.mnt);
2392 error = vfs_symlink(nd.path.dentry->d_inode, dentry, from);
2393 mnt_drop_write(nd.path.mnt);
2397 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2406 asmlinkage long sys_symlink(const char __user *oldname, const char __user *newname)
2408 return sys_symlinkat(oldname, AT_FDCWD, newname);
2411 int vfs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *new_dentry)
2413 struct inode *inode = old_dentry->d_inode;
2419 error = may_create(dir, new_dentry, NULL);
2423 if (dir->i_sb != inode->i_sb)
2427 * A link to an append-only or immutable file cannot be created.
2429 if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
2431 if (!dir->i_op || !dir->i_op->link)
2433 if (S_ISDIR(inode->i_mode))
2436 error = security_inode_link(old_dentry, dir, new_dentry);
2440 mutex_lock(&inode->i_mutex);
2442 error = dir->i_op->link(old_dentry, dir, new_dentry);
2443 mutex_unlock(&inode->i_mutex);
2445 fsnotify_link(dir, inode, new_dentry);
2450 * Hardlinks are often used in delicate situations. We avoid
2451 * security-related surprises by not following symlinks on the
2454 * We don't follow them on the oldname either to be compatible
2455 * with linux 2.0, and to avoid hard-linking to directories
2456 * and other special files. --ADM
2458 asmlinkage long sys_linkat(int olddfd, const char __user *oldname,
2459 int newdfd, const char __user *newname,
2462 struct dentry *new_dentry;
2463 struct nameidata nd, old_nd;
2467 if ((flags & ~AT_SYMLINK_FOLLOW) != 0)
2470 to = getname(newname);
2474 error = __user_walk_fd(olddfd, oldname,
2475 flags & AT_SYMLINK_FOLLOW ? LOOKUP_FOLLOW : 0,
2479 error = do_path_lookup(newdfd, to, LOOKUP_PARENT, &nd);
2483 if (old_nd.path.mnt != nd.path.mnt)
2485 new_dentry = lookup_create(&nd, 0);
2486 error = PTR_ERR(new_dentry);
2487 if (IS_ERR(new_dentry))
2489 error = mnt_want_write(nd.path.mnt);
2492 error = vfs_link(old_nd.path.dentry, nd.path.dentry->d_inode, new_dentry);
2493 mnt_drop_write(nd.path.mnt);
2497 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2501 path_put(&old_nd.path);
2508 asmlinkage long sys_link(const char __user *oldname, const char __user *newname)
2510 return sys_linkat(AT_FDCWD, oldname, AT_FDCWD, newname, 0);
2514 * The worst of all namespace operations - renaming directory. "Perverted"
2515 * doesn't even start to describe it. Somebody in UCB had a heck of a trip...
2517 * a) we can get into loop creation. Check is done in is_subdir().
2518 * b) race potential - two innocent renames can create a loop together.
2519 * That's where 4.4 screws up. Current fix: serialization on
2520 * sb->s_vfs_rename_mutex. We might be more accurate, but that's another
2522 * c) we have to lock _three_ objects - parents and victim (if it exists).
2523 * And that - after we got ->i_mutex on parents (until then we don't know
2524 * whether the target exists). Solution: try to be smart with locking
2525 * order for inodes. We rely on the fact that tree topology may change
2526 * only under ->s_vfs_rename_mutex _and_ that parent of the object we
2527 * move will be locked. Thus we can rank directories by the tree
2528 * (ancestors first) and rank all non-directories after them.
2529 * That works since everybody except rename does "lock parent, lookup,
2530 * lock child" and rename is under ->s_vfs_rename_mutex.
2531 * HOWEVER, it relies on the assumption that any object with ->lookup()
2532 * has no more than 1 dentry. If "hybrid" objects will ever appear,
2533 * we'd better make sure that there's no link(2) for them.
2534 * d) some filesystems don't support opened-but-unlinked directories,
2535 * either because of layout or because they are not ready to deal with
2536 * all cases correctly. The latter will be fixed (taking this sort of
2537 * stuff into VFS), but the former is not going away. Solution: the same
2538 * trick as in rmdir().
2539 * e) conversion from fhandle to dentry may come in the wrong moment - when
2540 * we are removing the target. Solution: we will have to grab ->i_mutex
2541 * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on
2542 * ->i_mutex on parents, which works but leads to some truely excessive
2545 static int vfs_rename_dir(struct inode *old_dir, struct dentry *old_dentry,
2546 struct inode *new_dir, struct dentry *new_dentry)
2549 struct inode *target;
2552 * If we are going to change the parent - check write permissions,
2553 * we'll need to flip '..'.
2555 if (new_dir != old_dir) {
2556 error = permission(old_dentry->d_inode, MAY_WRITE, NULL);
2561 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2565 target = new_dentry->d_inode;
2567 mutex_lock(&target->i_mutex);
2568 dentry_unhash(new_dentry);
2570 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2573 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2576 target->i_flags |= S_DEAD;
2577 mutex_unlock(&target->i_mutex);
2578 if (d_unhashed(new_dentry))
2579 d_rehash(new_dentry);
2583 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
2584 d_move(old_dentry,new_dentry);
2588 static int vfs_rename_other(struct inode *old_dir, struct dentry *old_dentry,
2589 struct inode *new_dir, struct dentry *new_dentry)
2591 struct inode *target;
2594 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2599 target = new_dentry->d_inode;
2601 mutex_lock(&target->i_mutex);
2602 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2605 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2607 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
2608 d_move(old_dentry, new_dentry);
2611 mutex_unlock(&target->i_mutex);
2616 int vfs_rename(struct inode *old_dir, struct dentry *old_dentry,
2617 struct inode *new_dir, struct dentry *new_dentry)
2620 int is_dir = S_ISDIR(old_dentry->d_inode->i_mode);
2621 const char *old_name;
2623 if (old_dentry->d_inode == new_dentry->d_inode)
2626 error = may_delete(old_dir, old_dentry, is_dir);
2630 if (!new_dentry->d_inode)
2631 error = may_create(new_dir, new_dentry, NULL);
2633 error = may_delete(new_dir, new_dentry, is_dir);
2637 if (!old_dir->i_op || !old_dir->i_op->rename)
2640 DQUOT_INIT(old_dir);
2641 DQUOT_INIT(new_dir);
2643 old_name = fsnotify_oldname_init(old_dentry->d_name.name);
2646 error = vfs_rename_dir(old_dir,old_dentry,new_dir,new_dentry);
2648 error = vfs_rename_other(old_dir,old_dentry,new_dir,new_dentry);
2650 const char *new_name = old_dentry->d_name.name;
2651 fsnotify_move(old_dir, new_dir, old_name, new_name, is_dir,
2652 new_dentry->d_inode, old_dentry);
2654 fsnotify_oldname_free(old_name);
2659 static int do_rename(int olddfd, const char *oldname,
2660 int newdfd, const char *newname)
2663 struct dentry * old_dir, * new_dir;
2664 struct dentry * old_dentry, *new_dentry;
2665 struct dentry * trap;
2666 struct nameidata oldnd, newnd;
2668 error = do_path_lookup(olddfd, oldname, LOOKUP_PARENT, &oldnd);
2672 error = do_path_lookup(newdfd, newname, LOOKUP_PARENT, &newnd);
2677 if (oldnd.path.mnt != newnd.path.mnt)
2680 old_dir = oldnd.path.dentry;
2682 if (oldnd.last_type != LAST_NORM)
2685 new_dir = newnd.path.dentry;
2686 if (newnd.last_type != LAST_NORM)
2689 trap = lock_rename(new_dir, old_dir);
2691 old_dentry = lookup_hash(&oldnd);
2692 error = PTR_ERR(old_dentry);
2693 if (IS_ERR(old_dentry))
2695 /* source must exist */
2697 if (!old_dentry->d_inode)
2699 /* unless the source is a directory trailing slashes give -ENOTDIR */
2700 if (!S_ISDIR(old_dentry->d_inode->i_mode)) {
2702 if (oldnd.last.name[oldnd.last.len])
2704 if (newnd.last.name[newnd.last.len])
2707 /* source should not be ancestor of target */
2709 if (old_dentry == trap)
2711 new_dentry = lookup_hash(&newnd);
2712 error = PTR_ERR(new_dentry);
2713 if (IS_ERR(new_dentry))
2715 /* target should not be an ancestor of source */
2717 if (new_dentry == trap)
2720 error = mnt_want_write(oldnd.path.mnt);
2723 error = vfs_rename(old_dir->d_inode, old_dentry,
2724 new_dir->d_inode, new_dentry);
2725 mnt_drop_write(oldnd.path.mnt);
2731 unlock_rename(new_dir, old_dir);
2733 path_put(&newnd.path);
2735 path_put(&oldnd.path);
2740 asmlinkage long sys_renameat(int olddfd, const char __user *oldname,
2741 int newdfd, const char __user *newname)
2747 from = getname(oldname);
2749 return PTR_ERR(from);
2750 to = getname(newname);
2751 error = PTR_ERR(to);
2753 error = do_rename(olddfd, from, newdfd, to);
2760 asmlinkage long sys_rename(const char __user *oldname, const char __user *newname)
2762 return sys_renameat(AT_FDCWD, oldname, AT_FDCWD, newname);
2765 int vfs_readlink(struct dentry *dentry, char __user *buffer, int buflen, const char *link)
2769 len = PTR_ERR(link);
2774 if (len > (unsigned) buflen)
2776 if (copy_to_user(buffer, link, len))
2783 * A helper for ->readlink(). This should be used *ONLY* for symlinks that
2784 * have ->follow_link() touching nd only in nd_set_link(). Using (or not
2785 * using) it for any given inode is up to filesystem.
2787 int generic_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2789 struct nameidata nd;
2794 cookie = dentry->d_inode->i_op->follow_link(dentry, &nd);
2796 return PTR_ERR(cookie);
2798 res = vfs_readlink(dentry, buffer, buflen, nd_get_link(&nd));
2799 if (dentry->d_inode->i_op->put_link)
2800 dentry->d_inode->i_op->put_link(dentry, &nd, cookie);
2804 int vfs_follow_link(struct nameidata *nd, const char *link)
2806 return __vfs_follow_link(nd, link);
2809 /* get the link contents into pagecache */
2810 static char *page_getlink(struct dentry * dentry, struct page **ppage)
2813 struct address_space *mapping = dentry->d_inode->i_mapping;
2814 page = read_mapping_page(mapping, 0, NULL);
2821 int page_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2823 struct page *page = NULL;
2824 char *s = page_getlink(dentry, &page);
2825 int res = vfs_readlink(dentry,buffer,buflen,s);
2828 page_cache_release(page);
2833 void *page_follow_link_light(struct dentry *dentry, struct nameidata *nd)
2835 struct page *page = NULL;
2836 nd_set_link(nd, page_getlink(dentry, &page));
2840 void page_put_link(struct dentry *dentry, struct nameidata *nd, void *cookie)
2842 struct page *page = cookie;
2846 page_cache_release(page);
2850 int __page_symlink(struct inode *inode, const char *symname, int len,
2853 struct address_space *mapping = inode->i_mapping;
2860 err = pagecache_write_begin(NULL, mapping, 0, len-1,
2861 AOP_FLAG_UNINTERRUPTIBLE, &page, &fsdata);
2865 kaddr = kmap_atomic(page, KM_USER0);
2866 memcpy(kaddr, symname, len-1);
2867 kunmap_atomic(kaddr, KM_USER0);
2869 err = pagecache_write_end(NULL, mapping, 0, len-1, len-1,
2876 mark_inode_dirty(inode);
2882 int page_symlink(struct inode *inode, const char *symname, int len)
2884 return __page_symlink(inode, symname, len,
2885 mapping_gfp_mask(inode->i_mapping));
2888 const struct inode_operations page_symlink_inode_operations = {
2889 .readlink = generic_readlink,
2890 .follow_link = page_follow_link_light,
2891 .put_link = page_put_link,
2894 EXPORT_SYMBOL(__user_walk);
2895 EXPORT_SYMBOL(__user_walk_fd);
2896 EXPORT_SYMBOL(follow_down);
2897 EXPORT_SYMBOL(follow_up);
2898 EXPORT_SYMBOL(get_write_access); /* binfmt_aout */
2899 EXPORT_SYMBOL(getname);
2900 EXPORT_SYMBOL(lock_rename);
2901 EXPORT_SYMBOL(lookup_one_len);
2902 EXPORT_SYMBOL(page_follow_link_light);
2903 EXPORT_SYMBOL(page_put_link);
2904 EXPORT_SYMBOL(page_readlink);
2905 EXPORT_SYMBOL(__page_symlink);
2906 EXPORT_SYMBOL(page_symlink);
2907 EXPORT_SYMBOL(page_symlink_inode_operations);
2908 EXPORT_SYMBOL(path_lookup);
2909 EXPORT_SYMBOL(vfs_path_lookup);
2910 EXPORT_SYMBOL(permission);
2911 EXPORT_SYMBOL(vfs_permission);
2912 EXPORT_SYMBOL(file_permission);
2913 EXPORT_SYMBOL(unlock_rename);
2914 EXPORT_SYMBOL(vfs_create);
2915 EXPORT_SYMBOL(vfs_follow_link);
2916 EXPORT_SYMBOL(vfs_link);
2917 EXPORT_SYMBOL(vfs_mkdir);
2918 EXPORT_SYMBOL(vfs_mknod);
2919 EXPORT_SYMBOL(generic_permission);
2920 EXPORT_SYMBOL(vfs_readlink);
2921 EXPORT_SYMBOL(vfs_rename);
2922 EXPORT_SYMBOL(vfs_rmdir);
2923 EXPORT_SYMBOL(vfs_symlink);
2924 EXPORT_SYMBOL(vfs_unlink);
2925 EXPORT_SYMBOL(dentry_unhash);
2926 EXPORT_SYMBOL(generic_readlink);