Linux 2.6.27.29
[linux-2.6/linux-acpi-2.6/ibm-acpi-2.6.git] / fs / namei.c
blob2259d21ae2818e0767dea0a4dcd89c6fe757d009
1 /*
2 * linux/fs/namei.c
4 * Copyright (C) 1991, 1992 Linus Torvalds
5 */
7 /*
8 * Some corrections by tytso.
9 */
11 /* [Feb 1997 T. Schoebel-Theuer] Complete rewrite of the pathname
12 * lookup logic.
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>
20 #include <linux/fs.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)
120 int retval;
121 unsigned long len = PATH_MAX;
123 if (!segment_eq(get_fs(), KERNEL_DS)) {
124 if ((unsigned long) filename >= TASK_SIZE)
125 return -EFAULT;
126 if (TASK_SIZE - (unsigned long) filename < PATH_MAX)
127 len = TASK_SIZE - (unsigned long) filename;
130 retval = strncpy_from_user(page, filename, len);
131 if (retval > 0) {
132 if (retval < len)
133 return 0;
134 return -ENAMETOOLONG;
135 } else if (!retval)
136 retval = -ENOENT;
137 return retval;
140 char * getname(const char __user * filename)
142 char *tmp, *result;
144 result = ERR_PTR(-ENOMEM);
145 tmp = __getname();
146 if (tmp) {
147 int retval = do_getname(filename, tmp);
149 result = tmp;
150 if (retval < 0) {
151 __putname(tmp);
152 result = ERR_PTR(retval);
155 audit_getname(result);
156 return result;
159 #ifdef CONFIG_AUDITSYSCALL
160 void putname(const char *name)
162 if (unlikely(!audit_dummy_context()))
163 audit_putname(name);
164 else
165 __putname(name);
167 EXPORT_SYMBOL(putname);
168 #endif
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)
190 mode >>= 6;
191 else {
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)
197 return error;
200 if (in_group_p(inode->i_gid))
201 mode >>= 3;
205 * If the DACs are ok we don't need any capability check.
207 if ((mask & ~mode) == 0)
208 return 0;
210 check_capabilities:
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))
218 return 0;
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))
225 return 0;
227 return -EACCES;
230 int inode_permission(struct inode *inode, int mask)
232 int retval;
234 if (mask & MAY_WRITE) {
235 umode_t mode = inode->i_mode;
238 * Nobody gets write access to a read-only fs.
240 if (IS_RDONLY(inode) &&
241 (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode)))
242 return -EROFS;
245 * Nobody gets write access to an immutable file.
247 if (IS_IMMUTABLE(inode))
248 return -EACCES;
251 /* Ordinary permission routines do not understand MAY_APPEND. */
252 if (inode->i_op && inode->i_op->permission) {
253 retval = inode->i_op->permission(inode, mask);
254 if (!retval) {
256 * Exec permission on a regular file is denied if none
257 * of the execute bits are set.
259 * This check should be done by the ->permission()
260 * method.
262 if ((mask & MAY_EXEC) && S_ISREG(inode->i_mode) &&
263 !(inode->i_mode & S_IXUGO))
264 return -EACCES;
266 } else {
267 retval = generic_permission(inode, mask, NULL);
269 if (retval)
270 return retval;
272 retval = devcgroup_inode_permission(inode, mask);
273 if (retval)
274 return retval;
276 return security_inode_permission(inode,
277 mask & (MAY_READ|MAY_WRITE|MAY_EXEC|MAY_APPEND));
281 * vfs_permission - check for access rights to a given path
282 * @nd: lookup result that describes the path
283 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
285 * Used to check for read/write/execute permissions on a path.
286 * We use "fsuid" for this, letting us set arbitrary permissions
287 * for filesystem access without changing the "normal" uids which
288 * are used for other things.
290 int vfs_permission(struct nameidata *nd, int mask)
292 return inode_permission(nd->path.dentry->d_inode, mask);
296 * file_permission - check for additional access rights to a given file
297 * @file: file to check access rights for
298 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
300 * Used to check for read/write/execute permissions on an already opened
301 * file.
303 * Note:
304 * Do not use this function in new code. All access checks should
305 * be done using vfs_permission().
307 int file_permission(struct file *file, int mask)
309 return inode_permission(file->f_path.dentry->d_inode, mask);
313 * get_write_access() gets write permission for a file.
314 * put_write_access() releases this write permission.
315 * This is used for regular files.
316 * We cannot support write (and maybe mmap read-write shared) accesses and
317 * MAP_DENYWRITE mmappings simultaneously. The i_writecount field of an inode
318 * can have the following values:
319 * 0: no writers, no VM_DENYWRITE mappings
320 * < 0: (-i_writecount) vm_area_structs with VM_DENYWRITE set exist
321 * > 0: (i_writecount) users are writing to the file.
323 * Normally we operate on that counter with atomic_{inc,dec} and it's safe
324 * except for the cases where we don't hold i_writecount yet. Then we need to
325 * use {get,deny}_write_access() - these functions check the sign and refuse
326 * to do the change if sign is wrong. Exclusion between them is provided by
327 * the inode->i_lock spinlock.
330 int get_write_access(struct inode * inode)
332 spin_lock(&inode->i_lock);
333 if (atomic_read(&inode->i_writecount) < 0) {
334 spin_unlock(&inode->i_lock);
335 return -ETXTBSY;
337 atomic_inc(&inode->i_writecount);
338 spin_unlock(&inode->i_lock);
340 return 0;
343 int deny_write_access(struct file * file)
345 struct inode *inode = file->f_path.dentry->d_inode;
347 spin_lock(&inode->i_lock);
348 if (atomic_read(&inode->i_writecount) > 0) {
349 spin_unlock(&inode->i_lock);
350 return -ETXTBSY;
352 atomic_dec(&inode->i_writecount);
353 spin_unlock(&inode->i_lock);
355 return 0;
359 * path_get - get a reference to a path
360 * @path: path to get the reference to
362 * Given a path increment the reference count to the dentry and the vfsmount.
364 void path_get(struct path *path)
366 mntget(path->mnt);
367 dget(path->dentry);
369 EXPORT_SYMBOL(path_get);
372 * path_put - put a reference to a path
373 * @path: path to put the reference to
375 * Given a path decrement the reference count to the dentry and the vfsmount.
377 void path_put(struct path *path)
379 dput(path->dentry);
380 mntput(path->mnt);
382 EXPORT_SYMBOL(path_put);
385 * release_open_intent - free up open intent resources
386 * @nd: pointer to nameidata
388 void release_open_intent(struct nameidata *nd)
390 if (nd->intent.open.file->f_path.dentry == NULL)
391 put_filp(nd->intent.open.file);
392 else
393 fput(nd->intent.open.file);
396 static inline struct dentry *
397 do_revalidate(struct dentry *dentry, struct nameidata *nd)
399 int status = dentry->d_op->d_revalidate(dentry, nd);
400 if (unlikely(status <= 0)) {
402 * The dentry failed validation.
403 * If d_revalidate returned 0 attempt to invalidate
404 * the dentry otherwise d_revalidate is asking us
405 * to return a fail status.
407 if (!status) {
408 if (!d_invalidate(dentry)) {
409 dput(dentry);
410 dentry = NULL;
412 } else {
413 dput(dentry);
414 dentry = ERR_PTR(status);
417 return dentry;
421 * Internal lookup() using the new generic dcache.
422 * SMP-safe
424 static struct dentry * cached_lookup(struct dentry * parent, struct qstr * name, struct nameidata *nd)
426 struct dentry * dentry = __d_lookup(parent, name);
428 /* lockess __d_lookup may fail due to concurrent d_move()
429 * in some unrelated directory, so try with d_lookup
431 if (!dentry)
432 dentry = d_lookup(parent, name);
434 if (dentry && dentry->d_op && dentry->d_op->d_revalidate)
435 dentry = do_revalidate(dentry, nd);
437 return dentry;
441 * Short-cut version of permission(), for calling by
442 * path_walk(), when dcache lock is held. Combines parts
443 * of permission() and generic_permission(), and tests ONLY for
444 * MAY_EXEC permission.
446 * If appropriate, check DAC only. If not appropriate, or
447 * short-cut DAC fails, then call permission() to do more
448 * complete permission check.
450 static int exec_permission_lite(struct inode *inode)
452 umode_t mode = inode->i_mode;
454 if (inode->i_op && inode->i_op->permission)
455 return -EAGAIN;
457 if (current->fsuid == inode->i_uid)
458 mode >>= 6;
459 else if (in_group_p(inode->i_gid))
460 mode >>= 3;
462 if (mode & MAY_EXEC)
463 goto ok;
465 if ((inode->i_mode & S_IXUGO) && capable(CAP_DAC_OVERRIDE))
466 goto ok;
468 if (S_ISDIR(inode->i_mode) && capable(CAP_DAC_OVERRIDE))
469 goto ok;
471 if (S_ISDIR(inode->i_mode) && capable(CAP_DAC_READ_SEARCH))
472 goto ok;
474 return -EACCES;
476 return security_inode_permission(inode, MAY_EXEC);
480 * This is called when everything else fails, and we actually have
481 * to go to the low-level filesystem to find out what we should do..
483 * We get the directory semaphore, and after getting that we also
484 * make sure that nobody added the entry to the dcache in the meantime..
485 * SMP-safe
487 static struct dentry * real_lookup(struct dentry * parent, struct qstr * name, struct nameidata *nd)
489 struct dentry * result;
490 struct inode *dir = parent->d_inode;
492 mutex_lock(&dir->i_mutex);
494 * First re-do the cached lookup just in case it was created
495 * while we waited for the directory semaphore..
497 * FIXME! This could use version numbering or similar to
498 * avoid unnecessary cache lookups.
500 * The "dcache_lock" is purely to protect the RCU list walker
501 * from concurrent renames at this point (we mustn't get false
502 * negatives from the RCU list walk here, unlike the optimistic
503 * fast walk).
505 * so doing d_lookup() (with seqlock), instead of lockfree __d_lookup
507 result = d_lookup(parent, name);
508 if (!result) {
509 struct dentry *dentry;
511 /* Don't create child dentry for a dead directory. */
512 result = ERR_PTR(-ENOENT);
513 if (IS_DEADDIR(dir))
514 goto out_unlock;
516 dentry = d_alloc(parent, name);
517 result = ERR_PTR(-ENOMEM);
518 if (dentry) {
519 result = dir->i_op->lookup(dir, dentry, nd);
520 if (result)
521 dput(dentry);
522 else
523 result = dentry;
525 out_unlock:
526 mutex_unlock(&dir->i_mutex);
527 return result;
531 * Uhhuh! Nasty case: the cache was re-populated while
532 * we waited on the semaphore. Need to revalidate.
534 mutex_unlock(&dir->i_mutex);
535 if (result->d_op && result->d_op->d_revalidate) {
536 result = do_revalidate(result, nd);
537 if (!result)
538 result = ERR_PTR(-ENOENT);
540 return result;
543 /* SMP-safe */
544 static __always_inline void
545 walk_init_root(const char *name, struct nameidata *nd)
547 struct fs_struct *fs = current->fs;
549 read_lock(&fs->lock);
550 nd->path = fs->root;
551 path_get(&fs->root);
552 read_unlock(&fs->lock);
556 * Wrapper to retry pathname resolution whenever the underlying
557 * file system returns an ESTALE.
559 * Retry the whole path once, forcing real lookup requests
560 * instead of relying on the dcache.
562 static __always_inline int link_path_walk(const char *name, struct nameidata *nd)
564 struct path save = nd->path;
565 int result;
567 /* make sure the stuff we saved doesn't go away */
568 path_get(&save);
570 result = __link_path_walk(name, nd);
571 if (result == -ESTALE) {
572 /* nd->path had been dropped */
573 nd->path = save;
574 path_get(&nd->path);
575 nd->flags |= LOOKUP_REVAL;
576 result = __link_path_walk(name, nd);
579 path_put(&save);
581 return result;
584 static __always_inline int __vfs_follow_link(struct nameidata *nd, const char *link)
586 int res = 0;
587 char *name;
588 if (IS_ERR(link))
589 goto fail;
591 if (*link == '/') {
592 path_put(&nd->path);
593 walk_init_root(link, nd);
595 res = link_path_walk(link, nd);
596 if (nd->depth || res || nd->last_type!=LAST_NORM)
597 return res;
599 * If it is an iterative symlinks resolution in open_namei() we
600 * have to copy the last component. And all that crap because of
601 * bloody create() on broken symlinks. Furrfu...
603 name = __getname();
604 if (unlikely(!name)) {
605 path_put(&nd->path);
606 return -ENOMEM;
608 strcpy(name, nd->last.name);
609 nd->last.name = name;
610 return 0;
611 fail:
612 path_put(&nd->path);
613 return PTR_ERR(link);
616 static void path_put_conditional(struct path *path, struct nameidata *nd)
618 dput(path->dentry);
619 if (path->mnt != nd->path.mnt)
620 mntput(path->mnt);
623 static inline void path_to_nameidata(struct path *path, struct nameidata *nd)
625 dput(nd->path.dentry);
626 if (nd->path.mnt != path->mnt)
627 mntput(nd->path.mnt);
628 nd->path.mnt = path->mnt;
629 nd->path.dentry = path->dentry;
632 static __always_inline int __do_follow_link(struct path *path, struct nameidata *nd)
634 int error;
635 void *cookie;
636 struct dentry *dentry = path->dentry;
638 touch_atime(path->mnt, dentry);
639 nd_set_link(nd, NULL);
641 if (path->mnt != nd->path.mnt) {
642 path_to_nameidata(path, nd);
643 dget(dentry);
645 mntget(path->mnt);
646 cookie = dentry->d_inode->i_op->follow_link(dentry, nd);
647 error = PTR_ERR(cookie);
648 if (!IS_ERR(cookie)) {
649 char *s = nd_get_link(nd);
650 error = 0;
651 if (s)
652 error = __vfs_follow_link(nd, s);
653 if (dentry->d_inode->i_op->put_link)
654 dentry->d_inode->i_op->put_link(dentry, nd, cookie);
656 path_put(path);
658 return error;
662 * This limits recursive symlink follows to 8, while
663 * limiting consecutive symlinks to 40.
665 * Without that kind of total limit, nasty chains of consecutive
666 * symlinks can cause almost arbitrarily long lookups.
668 static inline int do_follow_link(struct path *path, struct nameidata *nd)
670 int err = -ELOOP;
671 if (current->link_count >= MAX_NESTED_LINKS)
672 goto loop;
673 if (current->total_link_count >= 40)
674 goto loop;
675 BUG_ON(nd->depth >= MAX_NESTED_LINKS);
676 cond_resched();
677 err = security_inode_follow_link(path->dentry, nd);
678 if (err)
679 goto loop;
680 current->link_count++;
681 current->total_link_count++;
682 nd->depth++;
683 err = __do_follow_link(path, nd);
684 current->link_count--;
685 nd->depth--;
686 return err;
687 loop:
688 path_put_conditional(path, nd);
689 path_put(&nd->path);
690 return err;
693 int follow_up(struct vfsmount **mnt, struct dentry **dentry)
695 struct vfsmount *parent;
696 struct dentry *mountpoint;
697 spin_lock(&vfsmount_lock);
698 parent=(*mnt)->mnt_parent;
699 if (parent == *mnt) {
700 spin_unlock(&vfsmount_lock);
701 return 0;
703 mntget(parent);
704 mountpoint=dget((*mnt)->mnt_mountpoint);
705 spin_unlock(&vfsmount_lock);
706 dput(*dentry);
707 *dentry = mountpoint;
708 mntput(*mnt);
709 *mnt = parent;
710 return 1;
713 /* no need for dcache_lock, as serialization is taken care in
714 * namespace.c
716 static int __follow_mount(struct path *path)
718 int res = 0;
719 while (d_mountpoint(path->dentry)) {
720 struct vfsmount *mounted = lookup_mnt(path->mnt, path->dentry);
721 if (!mounted)
722 break;
723 dput(path->dentry);
724 if (res)
725 mntput(path->mnt);
726 path->mnt = mounted;
727 path->dentry = dget(mounted->mnt_root);
728 res = 1;
730 return res;
733 static void follow_mount(struct vfsmount **mnt, struct dentry **dentry)
735 while (d_mountpoint(*dentry)) {
736 struct vfsmount *mounted = lookup_mnt(*mnt, *dentry);
737 if (!mounted)
738 break;
739 dput(*dentry);
740 mntput(*mnt);
741 *mnt = mounted;
742 *dentry = dget(mounted->mnt_root);
746 /* no need for dcache_lock, as serialization is taken care in
747 * namespace.c
749 int follow_down(struct vfsmount **mnt, struct dentry **dentry)
751 struct vfsmount *mounted;
753 mounted = lookup_mnt(*mnt, *dentry);
754 if (mounted) {
755 dput(*dentry);
756 mntput(*mnt);
757 *mnt = mounted;
758 *dentry = dget(mounted->mnt_root);
759 return 1;
761 return 0;
764 static __always_inline void follow_dotdot(struct nameidata *nd)
766 struct fs_struct *fs = current->fs;
768 while(1) {
769 struct vfsmount *parent;
770 struct dentry *old = nd->path.dentry;
772 read_lock(&fs->lock);
773 if (nd->path.dentry == fs->root.dentry &&
774 nd->path.mnt == fs->root.mnt) {
775 read_unlock(&fs->lock);
776 break;
778 read_unlock(&fs->lock);
779 spin_lock(&dcache_lock);
780 if (nd->path.dentry != nd->path.mnt->mnt_root) {
781 nd->path.dentry = dget(nd->path.dentry->d_parent);
782 spin_unlock(&dcache_lock);
783 dput(old);
784 break;
786 spin_unlock(&dcache_lock);
787 spin_lock(&vfsmount_lock);
788 parent = nd->path.mnt->mnt_parent;
789 if (parent == nd->path.mnt) {
790 spin_unlock(&vfsmount_lock);
791 break;
793 mntget(parent);
794 nd->path.dentry = dget(nd->path.mnt->mnt_mountpoint);
795 spin_unlock(&vfsmount_lock);
796 dput(old);
797 mntput(nd->path.mnt);
798 nd->path.mnt = parent;
800 follow_mount(&nd->path.mnt, &nd->path.dentry);
804 * It's more convoluted than I'd like it to be, but... it's still fairly
805 * small and for now I'd prefer to have fast path as straight as possible.
806 * It _is_ time-critical.
808 static int do_lookup(struct nameidata *nd, struct qstr *name,
809 struct path *path)
811 struct vfsmount *mnt = nd->path.mnt;
812 struct dentry *dentry = __d_lookup(nd->path.dentry, name);
814 if (!dentry)
815 goto need_lookup;
816 if (dentry->d_op && dentry->d_op->d_revalidate)
817 goto need_revalidate;
818 done:
819 path->mnt = mnt;
820 path->dentry = dentry;
821 __follow_mount(path);
822 return 0;
824 need_lookup:
825 dentry = real_lookup(nd->path.dentry, name, nd);
826 if (IS_ERR(dentry))
827 goto fail;
828 goto done;
830 need_revalidate:
831 dentry = do_revalidate(dentry, nd);
832 if (!dentry)
833 goto need_lookup;
834 if (IS_ERR(dentry))
835 goto fail;
836 goto done;
838 fail:
839 return PTR_ERR(dentry);
843 * Name resolution.
844 * This is the basic name resolution function, turning a pathname into
845 * the final dentry. We expect 'base' to be positive and a directory.
847 * Returns 0 and nd will have valid dentry and mnt on success.
848 * Returns error and drops reference to input namei data on failure.
850 static int __link_path_walk(const char *name, struct nameidata *nd)
852 struct path next;
853 struct inode *inode;
854 int err;
855 unsigned int lookup_flags = nd->flags;
857 while (*name=='/')
858 name++;
859 if (!*name)
860 goto return_reval;
862 inode = nd->path.dentry->d_inode;
863 if (nd->depth)
864 lookup_flags = LOOKUP_FOLLOW | (nd->flags & LOOKUP_CONTINUE);
866 /* At this point we know we have a real path component. */
867 for(;;) {
868 unsigned long hash;
869 struct qstr this;
870 unsigned int c;
872 nd->flags |= LOOKUP_CONTINUE;
873 err = exec_permission_lite(inode);
874 if (err == -EAGAIN)
875 err = vfs_permission(nd, MAY_EXEC);
876 if (err)
877 break;
879 this.name = name;
880 c = *(const unsigned char *)name;
882 hash = init_name_hash();
883 do {
884 name++;
885 hash = partial_name_hash(c, hash);
886 c = *(const unsigned char *)name;
887 } while (c && (c != '/'));
888 this.len = name - (const char *) this.name;
889 this.hash = end_name_hash(hash);
891 /* remove trailing slashes? */
892 if (!c)
893 goto last_component;
894 while (*++name == '/');
895 if (!*name)
896 goto last_with_slashes;
899 * "." and ".." are special - ".." especially so because it has
900 * to be able to know about the current root directory and
901 * parent relationships.
903 if (this.name[0] == '.') switch (this.len) {
904 default:
905 break;
906 case 2:
907 if (this.name[1] != '.')
908 break;
909 follow_dotdot(nd);
910 inode = nd->path.dentry->d_inode;
911 /* fallthrough */
912 case 1:
913 continue;
916 * See if the low-level filesystem might want
917 * to use its own hash..
919 if (nd->path.dentry->d_op && nd->path.dentry->d_op->d_hash) {
920 err = nd->path.dentry->d_op->d_hash(nd->path.dentry,
921 &this);
922 if (err < 0)
923 break;
925 /* This does the actual lookups.. */
926 err = do_lookup(nd, &this, &next);
927 if (err)
928 break;
930 err = -ENOENT;
931 inode = next.dentry->d_inode;
932 if (!inode)
933 goto out_dput;
934 err = -ENOTDIR;
935 if (!inode->i_op)
936 goto out_dput;
938 if (inode->i_op->follow_link) {
939 err = do_follow_link(&next, nd);
940 if (err)
941 goto return_err;
942 err = -ENOENT;
943 inode = nd->path.dentry->d_inode;
944 if (!inode)
945 break;
946 err = -ENOTDIR;
947 if (!inode->i_op)
948 break;
949 } else
950 path_to_nameidata(&next, nd);
951 err = -ENOTDIR;
952 if (!inode->i_op->lookup)
953 break;
954 continue;
955 /* here ends the main loop */
957 last_with_slashes:
958 lookup_flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY;
959 last_component:
960 /* Clear LOOKUP_CONTINUE iff it was previously unset */
961 nd->flags &= lookup_flags | ~LOOKUP_CONTINUE;
962 if (lookup_flags & LOOKUP_PARENT)
963 goto lookup_parent;
964 if (this.name[0] == '.') switch (this.len) {
965 default:
966 break;
967 case 2:
968 if (this.name[1] != '.')
969 break;
970 follow_dotdot(nd);
971 inode = nd->path.dentry->d_inode;
972 /* fallthrough */
973 case 1:
974 goto return_reval;
976 if (nd->path.dentry->d_op && nd->path.dentry->d_op->d_hash) {
977 err = nd->path.dentry->d_op->d_hash(nd->path.dentry,
978 &this);
979 if (err < 0)
980 break;
982 err = do_lookup(nd, &this, &next);
983 if (err)
984 break;
985 inode = next.dentry->d_inode;
986 if ((lookup_flags & LOOKUP_FOLLOW)
987 && inode && inode->i_op && inode->i_op->follow_link) {
988 err = do_follow_link(&next, nd);
989 if (err)
990 goto return_err;
991 inode = nd->path.dentry->d_inode;
992 } else
993 path_to_nameidata(&next, nd);
994 err = -ENOENT;
995 if (!inode)
996 break;
997 if (lookup_flags & LOOKUP_DIRECTORY) {
998 err = -ENOTDIR;
999 if (!inode->i_op || !inode->i_op->lookup)
1000 break;
1002 goto return_base;
1003 lookup_parent:
1004 nd->last = this;
1005 nd->last_type = LAST_NORM;
1006 if (this.name[0] != '.')
1007 goto return_base;
1008 if (this.len == 1)
1009 nd->last_type = LAST_DOT;
1010 else if (this.len == 2 && this.name[1] == '.')
1011 nd->last_type = LAST_DOTDOT;
1012 else
1013 goto return_base;
1014 return_reval:
1016 * We bypassed the ordinary revalidation routines.
1017 * We may need to check the cached dentry for staleness.
1019 if (nd->path.dentry && nd->path.dentry->d_sb &&
1020 (nd->path.dentry->d_sb->s_type->fs_flags & FS_REVAL_DOT)) {
1021 err = -ESTALE;
1022 /* Note: we do not d_invalidate() */
1023 if (!nd->path.dentry->d_op->d_revalidate(
1024 nd->path.dentry, nd))
1025 break;
1027 return_base:
1028 return 0;
1029 out_dput:
1030 path_put_conditional(&next, nd);
1031 break;
1033 path_put(&nd->path);
1034 return_err:
1035 return err;
1038 static int path_walk(const char *name, struct nameidata *nd)
1040 current->total_link_count = 0;
1041 return link_path_walk(name, nd);
1044 /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
1045 static int do_path_lookup(int dfd, const char *name,
1046 unsigned int flags, struct nameidata *nd)
1048 int retval = 0;
1049 int fput_needed;
1050 struct file *file;
1051 struct fs_struct *fs = current->fs;
1053 nd->last_type = LAST_ROOT; /* if there are only slashes... */
1054 nd->flags = flags;
1055 nd->depth = 0;
1057 if (*name=='/') {
1058 read_lock(&fs->lock);
1059 nd->path = fs->root;
1060 path_get(&fs->root);
1061 read_unlock(&fs->lock);
1062 } else if (dfd == AT_FDCWD) {
1063 read_lock(&fs->lock);
1064 nd->path = fs->pwd;
1065 path_get(&fs->pwd);
1066 read_unlock(&fs->lock);
1067 } else {
1068 struct dentry *dentry;
1070 file = fget_light(dfd, &fput_needed);
1071 retval = -EBADF;
1072 if (!file)
1073 goto out_fail;
1075 dentry = file->f_path.dentry;
1077 retval = -ENOTDIR;
1078 if (!S_ISDIR(dentry->d_inode->i_mode))
1079 goto fput_fail;
1081 retval = file_permission(file, MAY_EXEC);
1082 if (retval)
1083 goto fput_fail;
1085 nd->path = file->f_path;
1086 path_get(&file->f_path);
1088 fput_light(file, fput_needed);
1091 retval = path_walk(name, nd);
1092 if (unlikely(!retval && !audit_dummy_context() && nd->path.dentry &&
1093 nd->path.dentry->d_inode))
1094 audit_inode(name, nd->path.dentry);
1095 out_fail:
1096 return retval;
1098 fput_fail:
1099 fput_light(file, fput_needed);
1100 goto out_fail;
1103 int path_lookup(const char *name, unsigned int flags,
1104 struct nameidata *nd)
1106 return do_path_lookup(AT_FDCWD, name, flags, nd);
1110 * vfs_path_lookup - lookup a file path relative to a dentry-vfsmount pair
1111 * @dentry: pointer to dentry of the base directory
1112 * @mnt: pointer to vfs mount of the base directory
1113 * @name: pointer to file name
1114 * @flags: lookup flags
1115 * @nd: pointer to nameidata
1117 int vfs_path_lookup(struct dentry *dentry, struct vfsmount *mnt,
1118 const char *name, unsigned int flags,
1119 struct nameidata *nd)
1121 int retval;
1123 /* same as do_path_lookup */
1124 nd->last_type = LAST_ROOT;
1125 nd->flags = flags;
1126 nd->depth = 0;
1128 nd->path.dentry = dentry;
1129 nd->path.mnt = mnt;
1130 path_get(&nd->path);
1132 retval = path_walk(name, nd);
1133 if (unlikely(!retval && !audit_dummy_context() && nd->path.dentry &&
1134 nd->path.dentry->d_inode))
1135 audit_inode(name, nd->path.dentry);
1137 return retval;
1141 static int __path_lookup_intent_open(int dfd, const char *name,
1142 unsigned int lookup_flags, struct nameidata *nd,
1143 int open_flags, int create_mode)
1145 struct file *filp = get_empty_filp();
1146 int err;
1148 if (filp == NULL)
1149 return -ENFILE;
1150 nd->intent.open.file = filp;
1151 nd->intent.open.flags = open_flags;
1152 nd->intent.open.create_mode = create_mode;
1153 err = do_path_lookup(dfd, name, lookup_flags|LOOKUP_OPEN, nd);
1154 if (IS_ERR(nd->intent.open.file)) {
1155 if (err == 0) {
1156 err = PTR_ERR(nd->intent.open.file);
1157 path_put(&nd->path);
1159 } else if (err != 0)
1160 release_open_intent(nd);
1161 return err;
1165 * path_lookup_open - lookup a file path with open intent
1166 * @dfd: the directory to use as base, or AT_FDCWD
1167 * @name: pointer to file name
1168 * @lookup_flags: lookup intent flags
1169 * @nd: pointer to nameidata
1170 * @open_flags: open intent flags
1172 int path_lookup_open(int dfd, const char *name, unsigned int lookup_flags,
1173 struct nameidata *nd, int open_flags)
1175 return __path_lookup_intent_open(dfd, name, lookup_flags, nd,
1176 open_flags, 0);
1180 * path_lookup_create - lookup a file path with open + create intent
1181 * @dfd: the directory to use as base, or AT_FDCWD
1182 * @name: pointer to file name
1183 * @lookup_flags: lookup intent flags
1184 * @nd: pointer to nameidata
1185 * @open_flags: open intent flags
1186 * @create_mode: create intent flags
1188 static int path_lookup_create(int dfd, const char *name,
1189 unsigned int lookup_flags, struct nameidata *nd,
1190 int open_flags, int create_mode)
1192 return __path_lookup_intent_open(dfd, name, lookup_flags|LOOKUP_CREATE,
1193 nd, open_flags, create_mode);
1196 static struct dentry *__lookup_hash(struct qstr *name,
1197 struct dentry *base, struct nameidata *nd)
1199 struct dentry *dentry;
1200 struct inode *inode;
1201 int err;
1203 inode = base->d_inode;
1206 * See if the low-level filesystem might want
1207 * to use its own hash..
1209 if (base->d_op && base->d_op->d_hash) {
1210 err = base->d_op->d_hash(base, name);
1211 dentry = ERR_PTR(err);
1212 if (err < 0)
1213 goto out;
1216 dentry = cached_lookup(base, name, nd);
1217 if (!dentry) {
1218 struct dentry *new;
1220 /* Don't create child dentry for a dead directory. */
1221 dentry = ERR_PTR(-ENOENT);
1222 if (IS_DEADDIR(inode))
1223 goto out;
1225 new = d_alloc(base, name);
1226 dentry = ERR_PTR(-ENOMEM);
1227 if (!new)
1228 goto out;
1229 dentry = inode->i_op->lookup(inode, new, nd);
1230 if (!dentry)
1231 dentry = new;
1232 else
1233 dput(new);
1235 out:
1236 return dentry;
1240 * Restricted form of lookup. Doesn't follow links, single-component only,
1241 * needs parent already locked. Doesn't follow mounts.
1242 * SMP-safe.
1244 static struct dentry *lookup_hash(struct nameidata *nd)
1246 int err;
1248 err = inode_permission(nd->path.dentry->d_inode, MAY_EXEC);
1249 if (err)
1250 return ERR_PTR(err);
1251 return __lookup_hash(&nd->last, nd->path.dentry, nd);
1254 static int __lookup_one_len(const char *name, struct qstr *this,
1255 struct dentry *base, int len)
1257 unsigned long hash;
1258 unsigned int c;
1260 this->name = name;
1261 this->len = len;
1262 if (!len)
1263 return -EACCES;
1265 hash = init_name_hash();
1266 while (len--) {
1267 c = *(const unsigned char *)name++;
1268 if (c == '/' || c == '\0')
1269 return -EACCES;
1270 hash = partial_name_hash(c, hash);
1272 this->hash = end_name_hash(hash);
1273 return 0;
1277 * lookup_one_len - filesystem helper to lookup single pathname component
1278 * @name: pathname component to lookup
1279 * @base: base directory to lookup from
1280 * @len: maximum length @len should be interpreted to
1282 * Note that this routine is purely a helper for filesystem usage and should
1283 * not be called by generic code. Also note that by using this function the
1284 * nameidata argument is passed to the filesystem methods and a filesystem
1285 * using this helper needs to be prepared for that.
1287 struct dentry *lookup_one_len(const char *name, struct dentry *base, int len)
1289 int err;
1290 struct qstr this;
1292 err = __lookup_one_len(name, &this, base, len);
1293 if (err)
1294 return ERR_PTR(err);
1296 err = inode_permission(base->d_inode, MAY_EXEC);
1297 if (err)
1298 return ERR_PTR(err);
1299 return __lookup_hash(&this, base, NULL);
1303 * lookup_one_noperm - bad hack for sysfs
1304 * @name: pathname component to lookup
1305 * @base: base directory to lookup from
1307 * This is a variant of lookup_one_len that doesn't perform any permission
1308 * checks. It's a horrible hack to work around the braindead sysfs
1309 * architecture and should not be used anywhere else.
1311 * DON'T USE THIS FUNCTION EVER, thanks.
1313 struct dentry *lookup_one_noperm(const char *name, struct dentry *base)
1315 int err;
1316 struct qstr this;
1318 err = __lookup_one_len(name, &this, base, strlen(name));
1319 if (err)
1320 return ERR_PTR(err);
1321 return __lookup_hash(&this, base, NULL);
1324 int user_path_at(int dfd, const char __user *name, unsigned flags,
1325 struct path *path)
1327 struct nameidata nd;
1328 char *tmp = getname(name);
1329 int err = PTR_ERR(tmp);
1330 if (!IS_ERR(tmp)) {
1332 BUG_ON(flags & LOOKUP_PARENT);
1334 err = do_path_lookup(dfd, tmp, flags, &nd);
1335 putname(tmp);
1336 if (!err)
1337 *path = nd.path;
1339 return err;
1342 static int user_path_parent(int dfd, const char __user *path,
1343 struct nameidata *nd, char **name)
1345 char *s = getname(path);
1346 int error;
1348 if (IS_ERR(s))
1349 return PTR_ERR(s);
1351 error = do_path_lookup(dfd, s, LOOKUP_PARENT, nd);
1352 if (error)
1353 putname(s);
1354 else
1355 *name = s;
1357 return error;
1361 * It's inline, so penalty for filesystems that don't use sticky bit is
1362 * minimal.
1364 static inline int check_sticky(struct inode *dir, struct inode *inode)
1366 if (!(dir->i_mode & S_ISVTX))
1367 return 0;
1368 if (inode->i_uid == current->fsuid)
1369 return 0;
1370 if (dir->i_uid == current->fsuid)
1371 return 0;
1372 return !capable(CAP_FOWNER);
1376 * Check whether we can remove a link victim from directory dir, check
1377 * whether the type of victim is right.
1378 * 1. We can't do it if dir is read-only (done in permission())
1379 * 2. We should have write and exec permissions on dir
1380 * 3. We can't remove anything from append-only dir
1381 * 4. We can't do anything with immutable dir (done in permission())
1382 * 5. If the sticky bit on dir is set we should either
1383 * a. be owner of dir, or
1384 * b. be owner of victim, or
1385 * c. have CAP_FOWNER capability
1386 * 6. If the victim is append-only or immutable we can't do antyhing with
1387 * links pointing to it.
1388 * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR.
1389 * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR.
1390 * 9. We can't remove a root or mountpoint.
1391 * 10. We don't allow removal of NFS sillyrenamed files; it's handled by
1392 * nfs_async_unlink().
1394 static int may_delete(struct inode *dir,struct dentry *victim,int isdir)
1396 int error;
1398 if (!victim->d_inode)
1399 return -ENOENT;
1401 BUG_ON(victim->d_parent->d_inode != dir);
1402 audit_inode_child(victim->d_name.name, victim, dir);
1404 error = inode_permission(dir, MAY_WRITE | MAY_EXEC);
1405 if (error)
1406 return error;
1407 if (IS_APPEND(dir))
1408 return -EPERM;
1409 if (check_sticky(dir, victim->d_inode)||IS_APPEND(victim->d_inode)||
1410 IS_IMMUTABLE(victim->d_inode))
1411 return -EPERM;
1412 if (isdir) {
1413 if (!S_ISDIR(victim->d_inode->i_mode))
1414 return -ENOTDIR;
1415 if (IS_ROOT(victim))
1416 return -EBUSY;
1417 } else if (S_ISDIR(victim->d_inode->i_mode))
1418 return -EISDIR;
1419 if (IS_DEADDIR(dir))
1420 return -ENOENT;
1421 if (victim->d_flags & DCACHE_NFSFS_RENAMED)
1422 return -EBUSY;
1423 return 0;
1426 /* Check whether we can create an object with dentry child in directory
1427 * dir.
1428 * 1. We can't do it if child already exists (open has special treatment for
1429 * this case, but since we are inlined it's OK)
1430 * 2. We can't do it if dir is read-only (done in permission())
1431 * 3. We should have write and exec permissions on dir
1432 * 4. We can't do it if dir is immutable (done in permission())
1434 static inline int may_create(struct inode *dir, struct dentry *child)
1436 if (child->d_inode)
1437 return -EEXIST;
1438 if (IS_DEADDIR(dir))
1439 return -ENOENT;
1440 return inode_permission(dir, MAY_WRITE | MAY_EXEC);
1444 * O_DIRECTORY translates into forcing a directory lookup.
1446 static inline int lookup_flags(unsigned int f)
1448 unsigned long retval = LOOKUP_FOLLOW;
1450 if (f & O_NOFOLLOW)
1451 retval &= ~LOOKUP_FOLLOW;
1453 if (f & O_DIRECTORY)
1454 retval |= LOOKUP_DIRECTORY;
1456 return retval;
1460 * p1 and p2 should be directories on the same fs.
1462 struct dentry *lock_rename(struct dentry *p1, struct dentry *p2)
1464 struct dentry *p;
1466 if (p1 == p2) {
1467 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1468 return NULL;
1471 mutex_lock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1473 for (p = p1; p->d_parent != p; p = p->d_parent) {
1474 if (p->d_parent == p2) {
1475 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_PARENT);
1476 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_CHILD);
1477 return p;
1481 for (p = p2; p->d_parent != p; p = p->d_parent) {
1482 if (p->d_parent == p1) {
1483 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1484 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1485 return p;
1489 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1490 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1491 return NULL;
1494 void unlock_rename(struct dentry *p1, struct dentry *p2)
1496 mutex_unlock(&p1->d_inode->i_mutex);
1497 if (p1 != p2) {
1498 mutex_unlock(&p2->d_inode->i_mutex);
1499 mutex_unlock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1503 int vfs_create(struct inode *dir, struct dentry *dentry, int mode,
1504 struct nameidata *nd)
1506 int error = may_create(dir, dentry);
1508 if (error)
1509 return error;
1511 if (!dir->i_op || !dir->i_op->create)
1512 return -EACCES; /* shouldn't it be ENOSYS? */
1513 mode &= S_IALLUGO;
1514 mode |= S_IFREG;
1515 error = security_inode_create(dir, dentry, mode);
1516 if (error)
1517 return error;
1518 DQUOT_INIT(dir);
1519 error = dir->i_op->create(dir, dentry, mode, nd);
1520 if (!error)
1521 fsnotify_create(dir, dentry);
1522 return error;
1525 int may_open(struct nameidata *nd, int acc_mode, int flag)
1527 struct dentry *dentry = nd->path.dentry;
1528 struct inode *inode = dentry->d_inode;
1529 int error;
1531 if (!inode)
1532 return -ENOENT;
1534 if (S_ISLNK(inode->i_mode))
1535 return -ELOOP;
1537 if (S_ISDIR(inode->i_mode) && (acc_mode & MAY_WRITE))
1538 return -EISDIR;
1541 * FIFO's, sockets and device files are special: they don't
1542 * actually live on the filesystem itself, and as such you
1543 * can write to them even if the filesystem is read-only.
1545 if (S_ISFIFO(inode->i_mode) || S_ISSOCK(inode->i_mode)) {
1546 flag &= ~O_TRUNC;
1547 } else if (S_ISBLK(inode->i_mode) || S_ISCHR(inode->i_mode)) {
1548 if (nd->path.mnt->mnt_flags & MNT_NODEV)
1549 return -EACCES;
1551 flag &= ~O_TRUNC;
1554 error = vfs_permission(nd, acc_mode);
1555 if (error)
1556 return error;
1558 * An append-only file must be opened in append mode for writing.
1560 if (IS_APPEND(inode)) {
1561 if ((flag & FMODE_WRITE) && !(flag & O_APPEND))
1562 return -EPERM;
1563 if (flag & O_TRUNC)
1564 return -EPERM;
1567 /* O_NOATIME can only be set by the owner or superuser */
1568 if (flag & O_NOATIME)
1569 if (!is_owner_or_cap(inode))
1570 return -EPERM;
1573 * Ensure there are no outstanding leases on the file.
1575 error = break_lease(inode, flag);
1576 if (error)
1577 return error;
1579 if (flag & O_TRUNC) {
1580 error = get_write_access(inode);
1581 if (error)
1582 return error;
1585 * Refuse to truncate files with mandatory locks held on them.
1587 error = locks_verify_locked(inode);
1588 if (!error) {
1589 DQUOT_INIT(inode);
1591 error = do_truncate(dentry, 0,
1592 ATTR_MTIME|ATTR_CTIME|ATTR_OPEN,
1593 NULL);
1595 put_write_access(inode);
1596 if (error)
1597 return error;
1598 } else
1599 if (flag & FMODE_WRITE)
1600 DQUOT_INIT(inode);
1602 return 0;
1606 * Be careful about ever adding any more callers of this
1607 * function. Its flags must be in the namei format, not
1608 * what get passed to sys_open().
1610 static int __open_namei_create(struct nameidata *nd, struct path *path,
1611 int flag, int mode)
1613 int error;
1614 struct dentry *dir = nd->path.dentry;
1616 if (!IS_POSIXACL(dir->d_inode))
1617 mode &= ~current->fs->umask;
1618 error = vfs_create(dir->d_inode, path->dentry, mode, nd);
1619 mutex_unlock(&dir->d_inode->i_mutex);
1620 dput(nd->path.dentry);
1621 nd->path.dentry = path->dentry;
1622 if (error)
1623 return error;
1624 /* Don't check for write permission, don't truncate */
1625 return may_open(nd, 0, flag & ~O_TRUNC);
1629 * Note that while the flag value (low two bits) for sys_open means:
1630 * 00 - read-only
1631 * 01 - write-only
1632 * 10 - read-write
1633 * 11 - special
1634 * it is changed into
1635 * 00 - no permissions needed
1636 * 01 - read-permission
1637 * 10 - write-permission
1638 * 11 - read-write
1639 * for the internal routines (ie open_namei()/follow_link() etc)
1640 * This is more logical, and also allows the 00 "no perm needed"
1641 * to be used for symlinks (where the permissions are checked
1642 * later).
1645 static inline int open_to_namei_flags(int flag)
1647 if ((flag+1) & O_ACCMODE)
1648 flag++;
1649 return flag;
1652 static int open_will_write_to_fs(int flag, struct inode *inode)
1655 * We'll never write to the fs underlying
1656 * a device file.
1658 if (special_file(inode->i_mode))
1659 return 0;
1660 return (flag & O_TRUNC);
1664 * Note that the low bits of the passed in "open_flag"
1665 * are not the same as in the local variable "flag". See
1666 * open_to_namei_flags() for more details.
1668 struct file *do_filp_open(int dfd, const char *pathname,
1669 int open_flag, int mode)
1671 struct file *filp;
1672 struct nameidata nd;
1673 int acc_mode, error;
1674 struct path path;
1675 struct dentry *dir;
1676 int count = 0;
1677 int will_write;
1678 int flag = open_to_namei_flags(open_flag);
1680 acc_mode = MAY_OPEN | ACC_MODE(flag);
1682 /* O_TRUNC implies we need access checks for write permissions */
1683 if (flag & O_TRUNC)
1684 acc_mode |= MAY_WRITE;
1686 /* Allow the LSM permission hook to distinguish append
1687 access from general write access. */
1688 if (flag & O_APPEND)
1689 acc_mode |= MAY_APPEND;
1692 * The simplest case - just a plain lookup.
1694 if (!(flag & O_CREAT)) {
1695 error = path_lookup_open(dfd, pathname, lookup_flags(flag),
1696 &nd, flag);
1697 if (error)
1698 return ERR_PTR(error);
1699 goto ok;
1703 * Create - we need to know the parent.
1705 error = path_lookup_create(dfd, pathname, LOOKUP_PARENT,
1706 &nd, flag, mode);
1707 if (error)
1708 return ERR_PTR(error);
1711 * We have the parent and last component. First of all, check
1712 * that we are not asked to creat(2) an obvious directory - that
1713 * will not do.
1715 error = -EISDIR;
1716 if (nd.last_type != LAST_NORM || nd.last.name[nd.last.len])
1717 goto exit;
1719 dir = nd.path.dentry;
1720 nd.flags &= ~LOOKUP_PARENT;
1721 mutex_lock(&dir->d_inode->i_mutex);
1722 path.dentry = lookup_hash(&nd);
1723 path.mnt = nd.path.mnt;
1725 do_last:
1726 error = PTR_ERR(path.dentry);
1727 if (IS_ERR(path.dentry)) {
1728 mutex_unlock(&dir->d_inode->i_mutex);
1729 goto exit;
1732 if (IS_ERR(nd.intent.open.file)) {
1733 error = PTR_ERR(nd.intent.open.file);
1734 goto exit_mutex_unlock;
1737 /* Negative dentry, just create the file */
1738 if (!path.dentry->d_inode) {
1740 * This write is needed to ensure that a
1741 * ro->rw transition does not occur between
1742 * the time when the file is created and when
1743 * a permanent write count is taken through
1744 * the 'struct file' in nameidata_to_filp().
1746 error = mnt_want_write(nd.path.mnt);
1747 if (error)
1748 goto exit_mutex_unlock;
1749 error = __open_namei_create(&nd, &path, flag, mode);
1750 if (error) {
1751 mnt_drop_write(nd.path.mnt);
1752 goto exit;
1754 filp = nameidata_to_filp(&nd, open_flag);
1755 mnt_drop_write(nd.path.mnt);
1756 return filp;
1760 * It already exists.
1762 mutex_unlock(&dir->d_inode->i_mutex);
1763 audit_inode(pathname, path.dentry);
1765 error = -EEXIST;
1766 if (flag & O_EXCL)
1767 goto exit_dput;
1769 if (__follow_mount(&path)) {
1770 error = -ELOOP;
1771 if (flag & O_NOFOLLOW)
1772 goto exit_dput;
1775 error = -ENOENT;
1776 if (!path.dentry->d_inode)
1777 goto exit_dput;
1778 if (path.dentry->d_inode->i_op && path.dentry->d_inode->i_op->follow_link)
1779 goto do_link;
1781 path_to_nameidata(&path, &nd);
1782 error = -EISDIR;
1783 if (path.dentry->d_inode && S_ISDIR(path.dentry->d_inode->i_mode))
1784 goto exit;
1787 * Consider:
1788 * 1. may_open() truncates a file
1789 * 2. a rw->ro mount transition occurs
1790 * 3. nameidata_to_filp() fails due to
1791 * the ro mount.
1792 * That would be inconsistent, and should
1793 * be avoided. Taking this mnt write here
1794 * ensures that (2) can not occur.
1796 will_write = open_will_write_to_fs(flag, nd.path.dentry->d_inode);
1797 if (will_write) {
1798 error = mnt_want_write(nd.path.mnt);
1799 if (error)
1800 goto exit;
1802 error = may_open(&nd, acc_mode, flag);
1803 if (error) {
1804 if (will_write)
1805 mnt_drop_write(nd.path.mnt);
1806 goto exit;
1808 filp = nameidata_to_filp(&nd, open_flag);
1810 * It is now safe to drop the mnt write
1811 * because the filp has had a write taken
1812 * on its behalf.
1814 if (will_write)
1815 mnt_drop_write(nd.path.mnt);
1816 return filp;
1818 exit_mutex_unlock:
1819 mutex_unlock(&dir->d_inode->i_mutex);
1820 exit_dput:
1821 path_put_conditional(&path, &nd);
1822 exit:
1823 if (!IS_ERR(nd.intent.open.file))
1824 release_open_intent(&nd);
1825 path_put(&nd.path);
1826 return ERR_PTR(error);
1828 do_link:
1829 error = -ELOOP;
1830 if (flag & O_NOFOLLOW)
1831 goto exit_dput;
1833 * This is subtle. Instead of calling do_follow_link() we do the
1834 * thing by hands. The reason is that this way we have zero link_count
1835 * and path_walk() (called from ->follow_link) honoring LOOKUP_PARENT.
1836 * After that we have the parent and last component, i.e.
1837 * we are in the same situation as after the first path_walk().
1838 * Well, almost - if the last component is normal we get its copy
1839 * stored in nd->last.name and we will have to putname() it when we
1840 * are done. Procfs-like symlinks just set LAST_BIND.
1842 nd.flags |= LOOKUP_PARENT;
1843 error = security_inode_follow_link(path.dentry, &nd);
1844 if (error)
1845 goto exit_dput;
1846 error = __do_follow_link(&path, &nd);
1847 if (error) {
1848 /* Does someone understand code flow here? Or it is only
1849 * me so stupid? Anathema to whoever designed this non-sense
1850 * with "intent.open".
1852 release_open_intent(&nd);
1853 return ERR_PTR(error);
1855 nd.flags &= ~LOOKUP_PARENT;
1856 if (nd.last_type == LAST_BIND)
1857 goto ok;
1858 error = -EISDIR;
1859 if (nd.last_type != LAST_NORM)
1860 goto exit;
1861 if (nd.last.name[nd.last.len]) {
1862 __putname(nd.last.name);
1863 goto exit;
1865 error = -ELOOP;
1866 if (count++==32) {
1867 __putname(nd.last.name);
1868 goto exit;
1870 dir = nd.path.dentry;
1871 mutex_lock(&dir->d_inode->i_mutex);
1872 path.dentry = lookup_hash(&nd);
1873 path.mnt = nd.path.mnt;
1874 __putname(nd.last.name);
1875 goto do_last;
1879 * filp_open - open file and return file pointer
1881 * @filename: path to open
1882 * @flags: open flags as per the open(2) second argument
1883 * @mode: mode for the new file if O_CREAT is set, else ignored
1885 * This is the helper to open a file from kernelspace if you really
1886 * have to. But in generally you should not do this, so please move
1887 * along, nothing to see here..
1889 struct file *filp_open(const char *filename, int flags, int mode)
1891 return do_filp_open(AT_FDCWD, filename, flags, mode);
1893 EXPORT_SYMBOL(filp_open);
1896 * lookup_create - lookup a dentry, creating it if it doesn't exist
1897 * @nd: nameidata info
1898 * @is_dir: directory flag
1900 * Simple function to lookup and return a dentry and create it
1901 * if it doesn't exist. Is SMP-safe.
1903 * Returns with nd->path.dentry->d_inode->i_mutex locked.
1905 struct dentry *lookup_create(struct nameidata *nd, int is_dir)
1907 struct dentry *dentry = ERR_PTR(-EEXIST);
1909 mutex_lock_nested(&nd->path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
1911 * Yucky last component or no last component at all?
1912 * (foo/., foo/.., /////)
1914 if (nd->last_type != LAST_NORM)
1915 goto fail;
1916 nd->flags &= ~LOOKUP_PARENT;
1917 nd->flags |= LOOKUP_CREATE;
1918 nd->intent.open.flags = O_EXCL;
1921 * Do the final lookup.
1923 dentry = lookup_hash(nd);
1924 if (IS_ERR(dentry))
1925 goto fail;
1927 if (dentry->d_inode)
1928 goto eexist;
1930 * Special case - lookup gave negative, but... we had foo/bar/
1931 * From the vfs_mknod() POV we just have a negative dentry -
1932 * all is fine. Let's be bastards - you had / on the end, you've
1933 * been asking for (non-existent) directory. -ENOENT for you.
1935 if (unlikely(!is_dir && nd->last.name[nd->last.len])) {
1936 dput(dentry);
1937 dentry = ERR_PTR(-ENOENT);
1939 return dentry;
1940 eexist:
1941 dput(dentry);
1942 dentry = ERR_PTR(-EEXIST);
1943 fail:
1944 return dentry;
1946 EXPORT_SYMBOL_GPL(lookup_create);
1948 int vfs_mknod(struct inode *dir, struct dentry *dentry, int mode, dev_t dev)
1950 int error = may_create(dir, dentry);
1952 if (error)
1953 return error;
1955 if ((S_ISCHR(mode) || S_ISBLK(mode)) && !capable(CAP_MKNOD))
1956 return -EPERM;
1958 if (!dir->i_op || !dir->i_op->mknod)
1959 return -EPERM;
1961 error = devcgroup_inode_mknod(mode, dev);
1962 if (error)
1963 return error;
1965 error = security_inode_mknod(dir, dentry, mode, dev);
1966 if (error)
1967 return error;
1969 DQUOT_INIT(dir);
1970 error = dir->i_op->mknod(dir, dentry, mode, dev);
1971 if (!error)
1972 fsnotify_create(dir, dentry);
1973 return error;
1976 static int may_mknod(mode_t mode)
1978 switch (mode & S_IFMT) {
1979 case S_IFREG:
1980 case S_IFCHR:
1981 case S_IFBLK:
1982 case S_IFIFO:
1983 case S_IFSOCK:
1984 case 0: /* zero mode translates to S_IFREG */
1985 return 0;
1986 case S_IFDIR:
1987 return -EPERM;
1988 default:
1989 return -EINVAL;
1993 SYSCALL_DEFINE4(mknodat, int, dfd, const char __user *, filename, int, mode,
1994 unsigned, dev)
1996 int error;
1997 char *tmp;
1998 struct dentry *dentry;
1999 struct nameidata nd;
2001 if (S_ISDIR(mode))
2002 return -EPERM;
2004 error = user_path_parent(dfd, filename, &nd, &tmp);
2005 if (error)
2006 return error;
2008 dentry = lookup_create(&nd, 0);
2009 if (IS_ERR(dentry)) {
2010 error = PTR_ERR(dentry);
2011 goto out_unlock;
2013 if (!IS_POSIXACL(nd.path.dentry->d_inode))
2014 mode &= ~current->fs->umask;
2015 error = may_mknod(mode);
2016 if (error)
2017 goto out_dput;
2018 error = mnt_want_write(nd.path.mnt);
2019 if (error)
2020 goto out_dput;
2021 switch (mode & S_IFMT) {
2022 case 0: case S_IFREG:
2023 error = vfs_create(nd.path.dentry->d_inode,dentry,mode,&nd);
2024 break;
2025 case S_IFCHR: case S_IFBLK:
2026 error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode,
2027 new_decode_dev(dev));
2028 break;
2029 case S_IFIFO: case S_IFSOCK:
2030 error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode,0);
2031 break;
2033 mnt_drop_write(nd.path.mnt);
2034 out_dput:
2035 dput(dentry);
2036 out_unlock:
2037 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2038 path_put(&nd.path);
2039 putname(tmp);
2041 return error;
2044 SYSCALL_DEFINE3(mknod, const char __user *, filename, int, mode, unsigned, dev)
2046 return sys_mknodat(AT_FDCWD, filename, mode, dev);
2049 int vfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
2051 int error = may_create(dir, dentry);
2053 if (error)
2054 return error;
2056 if (!dir->i_op || !dir->i_op->mkdir)
2057 return -EPERM;
2059 mode &= (S_IRWXUGO|S_ISVTX);
2060 error = security_inode_mkdir(dir, dentry, mode);
2061 if (error)
2062 return error;
2064 DQUOT_INIT(dir);
2065 error = dir->i_op->mkdir(dir, dentry, mode);
2066 if (!error)
2067 fsnotify_mkdir(dir, dentry);
2068 return error;
2071 SYSCALL_DEFINE3(mkdirat, int, dfd, const char __user *, pathname, int, mode)
2073 int error = 0;
2074 char * tmp;
2075 struct dentry *dentry;
2076 struct nameidata nd;
2078 error = user_path_parent(dfd, pathname, &nd, &tmp);
2079 if (error)
2080 goto out_err;
2082 dentry = lookup_create(&nd, 1);
2083 error = PTR_ERR(dentry);
2084 if (IS_ERR(dentry))
2085 goto out_unlock;
2087 if (!IS_POSIXACL(nd.path.dentry->d_inode))
2088 mode &= ~current->fs->umask;
2089 error = mnt_want_write(nd.path.mnt);
2090 if (error)
2091 goto out_dput;
2092 error = vfs_mkdir(nd.path.dentry->d_inode, dentry, mode);
2093 mnt_drop_write(nd.path.mnt);
2094 out_dput:
2095 dput(dentry);
2096 out_unlock:
2097 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2098 path_put(&nd.path);
2099 putname(tmp);
2100 out_err:
2101 return error;
2104 SYSCALL_DEFINE2(mkdir, const char __user *, pathname, int, mode)
2106 return sys_mkdirat(AT_FDCWD, pathname, mode);
2110 * We try to drop the dentry early: we should have
2111 * a usage count of 2 if we're the only user of this
2112 * dentry, and if that is true (possibly after pruning
2113 * the dcache), then we drop the dentry now.
2115 * A low-level filesystem can, if it choses, legally
2116 * do a
2118 * if (!d_unhashed(dentry))
2119 * return -EBUSY;
2121 * if it cannot handle the case of removing a directory
2122 * that is still in use by something else..
2124 void dentry_unhash(struct dentry *dentry)
2126 dget(dentry);
2127 shrink_dcache_parent(dentry);
2128 spin_lock(&dcache_lock);
2129 spin_lock(&dentry->d_lock);
2130 if (atomic_read(&dentry->d_count) == 2)
2131 __d_drop(dentry);
2132 spin_unlock(&dentry->d_lock);
2133 spin_unlock(&dcache_lock);
2136 int vfs_rmdir(struct inode *dir, struct dentry *dentry)
2138 int error = may_delete(dir, dentry, 1);
2140 if (error)
2141 return error;
2143 if (!dir->i_op || !dir->i_op->rmdir)
2144 return -EPERM;
2146 DQUOT_INIT(dir);
2148 mutex_lock(&dentry->d_inode->i_mutex);
2149 dentry_unhash(dentry);
2150 if (d_mountpoint(dentry))
2151 error = -EBUSY;
2152 else {
2153 error = security_inode_rmdir(dir, dentry);
2154 if (!error) {
2155 error = dir->i_op->rmdir(dir, dentry);
2156 if (!error)
2157 dentry->d_inode->i_flags |= S_DEAD;
2160 mutex_unlock(&dentry->d_inode->i_mutex);
2161 if (!error) {
2162 d_delete(dentry);
2164 dput(dentry);
2166 return error;
2169 static long do_rmdir(int dfd, const char __user *pathname)
2171 int error = 0;
2172 char * name;
2173 struct dentry *dentry;
2174 struct nameidata nd;
2176 error = user_path_parent(dfd, pathname, &nd, &name);
2177 if (error)
2178 return error;
2180 switch(nd.last_type) {
2181 case LAST_DOTDOT:
2182 error = -ENOTEMPTY;
2183 goto exit1;
2184 case LAST_DOT:
2185 error = -EINVAL;
2186 goto exit1;
2187 case LAST_ROOT:
2188 error = -EBUSY;
2189 goto exit1;
2191 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2192 dentry = lookup_hash(&nd);
2193 error = PTR_ERR(dentry);
2194 if (IS_ERR(dentry))
2195 goto exit2;
2196 error = mnt_want_write(nd.path.mnt);
2197 if (error)
2198 goto exit3;
2199 error = vfs_rmdir(nd.path.dentry->d_inode, dentry);
2200 mnt_drop_write(nd.path.mnt);
2201 exit3:
2202 dput(dentry);
2203 exit2:
2204 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2205 exit1:
2206 path_put(&nd.path);
2207 putname(name);
2208 return error;
2211 SYSCALL_DEFINE1(rmdir, const char __user *, pathname)
2213 return do_rmdir(AT_FDCWD, pathname);
2216 int vfs_unlink(struct inode *dir, struct dentry *dentry)
2218 int error = may_delete(dir, dentry, 0);
2220 if (error)
2221 return error;
2223 if (!dir->i_op || !dir->i_op->unlink)
2224 return -EPERM;
2226 DQUOT_INIT(dir);
2228 mutex_lock(&dentry->d_inode->i_mutex);
2229 if (d_mountpoint(dentry))
2230 error = -EBUSY;
2231 else {
2232 error = security_inode_unlink(dir, dentry);
2233 if (!error)
2234 error = dir->i_op->unlink(dir, dentry);
2236 mutex_unlock(&dentry->d_inode->i_mutex);
2238 /* We don't d_delete() NFS sillyrenamed files--they still exist. */
2239 if (!error && !(dentry->d_flags & DCACHE_NFSFS_RENAMED)) {
2240 fsnotify_link_count(dentry->d_inode);
2241 d_delete(dentry);
2244 return error;
2248 * Make sure that the actual truncation of the file will occur outside its
2249 * directory's i_mutex. Truncate can take a long time if there is a lot of
2250 * writeout happening, and we don't want to prevent access to the directory
2251 * while waiting on the I/O.
2253 static long do_unlinkat(int dfd, const char __user *pathname)
2255 int error;
2256 char *name;
2257 struct dentry *dentry;
2258 struct nameidata nd;
2259 struct inode *inode = NULL;
2261 error = user_path_parent(dfd, pathname, &nd, &name);
2262 if (error)
2263 return error;
2265 error = -EISDIR;
2266 if (nd.last_type != LAST_NORM)
2267 goto exit1;
2268 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2269 dentry = lookup_hash(&nd);
2270 error = PTR_ERR(dentry);
2271 if (!IS_ERR(dentry)) {
2272 /* Why not before? Because we want correct error value */
2273 if (nd.last.name[nd.last.len])
2274 goto slashes;
2275 inode = dentry->d_inode;
2276 if (inode)
2277 atomic_inc(&inode->i_count);
2278 error = mnt_want_write(nd.path.mnt);
2279 if (error)
2280 goto exit2;
2281 error = vfs_unlink(nd.path.dentry->d_inode, dentry);
2282 mnt_drop_write(nd.path.mnt);
2283 exit2:
2284 dput(dentry);
2286 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2287 if (inode)
2288 iput(inode); /* truncate the inode here */
2289 exit1:
2290 path_put(&nd.path);
2291 putname(name);
2292 return error;
2294 slashes:
2295 error = !dentry->d_inode ? -ENOENT :
2296 S_ISDIR(dentry->d_inode->i_mode) ? -EISDIR : -ENOTDIR;
2297 goto exit2;
2300 SYSCALL_DEFINE3(unlinkat, int, dfd, const char __user *, pathname, int, flag)
2302 if ((flag & ~AT_REMOVEDIR) != 0)
2303 return -EINVAL;
2305 if (flag & AT_REMOVEDIR)
2306 return do_rmdir(dfd, pathname);
2308 return do_unlinkat(dfd, pathname);
2311 SYSCALL_DEFINE1(unlink, const char __user *, pathname)
2313 return do_unlinkat(AT_FDCWD, pathname);
2316 int vfs_symlink(struct inode *dir, struct dentry *dentry, const char *oldname)
2318 int error = may_create(dir, dentry);
2320 if (error)
2321 return error;
2323 if (!dir->i_op || !dir->i_op->symlink)
2324 return -EPERM;
2326 error = security_inode_symlink(dir, dentry, oldname);
2327 if (error)
2328 return error;
2330 DQUOT_INIT(dir);
2331 error = dir->i_op->symlink(dir, dentry, oldname);
2332 if (!error)
2333 fsnotify_create(dir, dentry);
2334 return error;
2337 SYSCALL_DEFINE3(symlinkat, const char __user *, oldname,
2338 int, newdfd, const char __user *, newname)
2340 int error;
2341 char *from;
2342 char *to;
2343 struct dentry *dentry;
2344 struct nameidata nd;
2346 from = getname(oldname);
2347 if (IS_ERR(from))
2348 return PTR_ERR(from);
2350 error = user_path_parent(newdfd, newname, &nd, &to);
2351 if (error)
2352 goto out_putname;
2354 dentry = lookup_create(&nd, 0);
2355 error = PTR_ERR(dentry);
2356 if (IS_ERR(dentry))
2357 goto out_unlock;
2359 error = mnt_want_write(nd.path.mnt);
2360 if (error)
2361 goto out_dput;
2362 error = vfs_symlink(nd.path.dentry->d_inode, dentry, from);
2363 mnt_drop_write(nd.path.mnt);
2364 out_dput:
2365 dput(dentry);
2366 out_unlock:
2367 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2368 path_put(&nd.path);
2369 putname(to);
2370 out_putname:
2371 putname(from);
2372 return error;
2375 SYSCALL_DEFINE2(symlink, const char __user *, oldname, const char __user *, newname)
2377 return sys_symlinkat(oldname, AT_FDCWD, newname);
2380 int vfs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *new_dentry)
2382 struct inode *inode = old_dentry->d_inode;
2383 int error;
2385 if (!inode)
2386 return -ENOENT;
2388 error = may_create(dir, new_dentry);
2389 if (error)
2390 return error;
2392 if (dir->i_sb != inode->i_sb)
2393 return -EXDEV;
2396 * A link to an append-only or immutable file cannot be created.
2398 if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
2399 return -EPERM;
2400 if (!dir->i_op || !dir->i_op->link)
2401 return -EPERM;
2402 if (S_ISDIR(inode->i_mode))
2403 return -EPERM;
2405 error = security_inode_link(old_dentry, dir, new_dentry);
2406 if (error)
2407 return error;
2409 mutex_lock(&inode->i_mutex);
2410 DQUOT_INIT(dir);
2411 error = dir->i_op->link(old_dentry, dir, new_dentry);
2412 mutex_unlock(&inode->i_mutex);
2413 if (!error)
2414 fsnotify_link(dir, inode, new_dentry);
2415 return error;
2419 * Hardlinks are often used in delicate situations. We avoid
2420 * security-related surprises by not following symlinks on the
2421 * newname. --KAB
2423 * We don't follow them on the oldname either to be compatible
2424 * with linux 2.0, and to avoid hard-linking to directories
2425 * and other special files. --ADM
2427 SYSCALL_DEFINE5(linkat, int, olddfd, const char __user *, oldname,
2428 int, newdfd, const char __user *, newname, int, flags)
2430 struct dentry *new_dentry;
2431 struct nameidata nd;
2432 struct path old_path;
2433 int error;
2434 char *to;
2436 if ((flags & ~AT_SYMLINK_FOLLOW) != 0)
2437 return -EINVAL;
2439 error = user_path_at(olddfd, oldname,
2440 flags & AT_SYMLINK_FOLLOW ? LOOKUP_FOLLOW : 0,
2441 &old_path);
2442 if (error)
2443 return error;
2445 error = user_path_parent(newdfd, newname, &nd, &to);
2446 if (error)
2447 goto out;
2448 error = -EXDEV;
2449 if (old_path.mnt != nd.path.mnt)
2450 goto out_release;
2451 new_dentry = lookup_create(&nd, 0);
2452 error = PTR_ERR(new_dentry);
2453 if (IS_ERR(new_dentry))
2454 goto out_unlock;
2455 error = mnt_want_write(nd.path.mnt);
2456 if (error)
2457 goto out_dput;
2458 error = vfs_link(old_path.dentry, nd.path.dentry->d_inode, new_dentry);
2459 mnt_drop_write(nd.path.mnt);
2460 out_dput:
2461 dput(new_dentry);
2462 out_unlock:
2463 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2464 out_release:
2465 path_put(&nd.path);
2466 putname(to);
2467 out:
2468 path_put(&old_path);
2470 return error;
2473 SYSCALL_DEFINE2(link, const char __user *, oldname, const char __user *, newname)
2475 return sys_linkat(AT_FDCWD, oldname, AT_FDCWD, newname, 0);
2479 * The worst of all namespace operations - renaming directory. "Perverted"
2480 * doesn't even start to describe it. Somebody in UCB had a heck of a trip...
2481 * Problems:
2482 * a) we can get into loop creation. Check is done in is_subdir().
2483 * b) race potential - two innocent renames can create a loop together.
2484 * That's where 4.4 screws up. Current fix: serialization on
2485 * sb->s_vfs_rename_mutex. We might be more accurate, but that's another
2486 * story.
2487 * c) we have to lock _three_ objects - parents and victim (if it exists).
2488 * And that - after we got ->i_mutex on parents (until then we don't know
2489 * whether the target exists). Solution: try to be smart with locking
2490 * order for inodes. We rely on the fact that tree topology may change
2491 * only under ->s_vfs_rename_mutex _and_ that parent of the object we
2492 * move will be locked. Thus we can rank directories by the tree
2493 * (ancestors first) and rank all non-directories after them.
2494 * That works since everybody except rename does "lock parent, lookup,
2495 * lock child" and rename is under ->s_vfs_rename_mutex.
2496 * HOWEVER, it relies on the assumption that any object with ->lookup()
2497 * has no more than 1 dentry. If "hybrid" objects will ever appear,
2498 * we'd better make sure that there's no link(2) for them.
2499 * d) some filesystems don't support opened-but-unlinked directories,
2500 * either because of layout or because they are not ready to deal with
2501 * all cases correctly. The latter will be fixed (taking this sort of
2502 * stuff into VFS), but the former is not going away. Solution: the same
2503 * trick as in rmdir().
2504 * e) conversion from fhandle to dentry may come in the wrong moment - when
2505 * we are removing the target. Solution: we will have to grab ->i_mutex
2506 * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on
2507 * ->i_mutex on parents, which works but leads to some truely excessive
2508 * locking].
2510 static int vfs_rename_dir(struct inode *old_dir, struct dentry *old_dentry,
2511 struct inode *new_dir, struct dentry *new_dentry)
2513 int error = 0;
2514 struct inode *target;
2517 * If we are going to change the parent - check write permissions,
2518 * we'll need to flip '..'.
2520 if (new_dir != old_dir) {
2521 error = inode_permission(old_dentry->d_inode, MAY_WRITE);
2522 if (error)
2523 return error;
2526 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2527 if (error)
2528 return error;
2530 target = new_dentry->d_inode;
2531 if (target) {
2532 mutex_lock(&target->i_mutex);
2533 dentry_unhash(new_dentry);
2535 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2536 error = -EBUSY;
2537 else
2538 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2539 if (target) {
2540 if (!error)
2541 target->i_flags |= S_DEAD;
2542 mutex_unlock(&target->i_mutex);
2543 if (d_unhashed(new_dentry))
2544 d_rehash(new_dentry);
2545 dput(new_dentry);
2547 if (!error)
2548 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
2549 d_move(old_dentry,new_dentry);
2550 return error;
2553 static int vfs_rename_other(struct inode *old_dir, struct dentry *old_dentry,
2554 struct inode *new_dir, struct dentry *new_dentry)
2556 struct inode *target;
2557 int error;
2559 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2560 if (error)
2561 return error;
2563 dget(new_dentry);
2564 target = new_dentry->d_inode;
2565 if (target)
2566 mutex_lock(&target->i_mutex);
2567 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2568 error = -EBUSY;
2569 else
2570 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2571 if (!error) {
2572 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
2573 d_move(old_dentry, new_dentry);
2575 if (target)
2576 mutex_unlock(&target->i_mutex);
2577 dput(new_dentry);
2578 return error;
2581 int vfs_rename(struct inode *old_dir, struct dentry *old_dentry,
2582 struct inode *new_dir, struct dentry *new_dentry)
2584 int error;
2585 int is_dir = S_ISDIR(old_dentry->d_inode->i_mode);
2586 const char *old_name;
2588 if (old_dentry->d_inode == new_dentry->d_inode)
2589 return 0;
2591 error = may_delete(old_dir, old_dentry, is_dir);
2592 if (error)
2593 return error;
2595 if (!new_dentry->d_inode)
2596 error = may_create(new_dir, new_dentry);
2597 else
2598 error = may_delete(new_dir, new_dentry, is_dir);
2599 if (error)
2600 return error;
2602 if (!old_dir->i_op || !old_dir->i_op->rename)
2603 return -EPERM;
2605 DQUOT_INIT(old_dir);
2606 DQUOT_INIT(new_dir);
2608 old_name = fsnotify_oldname_init(old_dentry->d_name.name);
2610 if (is_dir)
2611 error = vfs_rename_dir(old_dir,old_dentry,new_dir,new_dentry);
2612 else
2613 error = vfs_rename_other(old_dir,old_dentry,new_dir,new_dentry);
2614 if (!error) {
2615 const char *new_name = old_dentry->d_name.name;
2616 fsnotify_move(old_dir, new_dir, old_name, new_name, is_dir,
2617 new_dentry->d_inode, old_dentry);
2619 fsnotify_oldname_free(old_name);
2621 return error;
2624 SYSCALL_DEFINE4(renameat, int, olddfd, const char __user *, oldname,
2625 int, newdfd, const char __user *, newname)
2627 struct dentry *old_dir, *new_dir;
2628 struct dentry *old_dentry, *new_dentry;
2629 struct dentry *trap;
2630 struct nameidata oldnd, newnd;
2631 char *from;
2632 char *to;
2633 int error;
2635 error = user_path_parent(olddfd, oldname, &oldnd, &from);
2636 if (error)
2637 goto exit;
2639 error = user_path_parent(newdfd, newname, &newnd, &to);
2640 if (error)
2641 goto exit1;
2643 error = -EXDEV;
2644 if (oldnd.path.mnt != newnd.path.mnt)
2645 goto exit2;
2647 old_dir = oldnd.path.dentry;
2648 error = -EBUSY;
2649 if (oldnd.last_type != LAST_NORM)
2650 goto exit2;
2652 new_dir = newnd.path.dentry;
2653 if (newnd.last_type != LAST_NORM)
2654 goto exit2;
2656 trap = lock_rename(new_dir, old_dir);
2658 old_dentry = lookup_hash(&oldnd);
2659 error = PTR_ERR(old_dentry);
2660 if (IS_ERR(old_dentry))
2661 goto exit3;
2662 /* source must exist */
2663 error = -ENOENT;
2664 if (!old_dentry->d_inode)
2665 goto exit4;
2666 /* unless the source is a directory trailing slashes give -ENOTDIR */
2667 if (!S_ISDIR(old_dentry->d_inode->i_mode)) {
2668 error = -ENOTDIR;
2669 if (oldnd.last.name[oldnd.last.len])
2670 goto exit4;
2671 if (newnd.last.name[newnd.last.len])
2672 goto exit4;
2674 /* source should not be ancestor of target */
2675 error = -EINVAL;
2676 if (old_dentry == trap)
2677 goto exit4;
2678 new_dentry = lookup_hash(&newnd);
2679 error = PTR_ERR(new_dentry);
2680 if (IS_ERR(new_dentry))
2681 goto exit4;
2682 /* target should not be an ancestor of source */
2683 error = -ENOTEMPTY;
2684 if (new_dentry == trap)
2685 goto exit5;
2687 error = mnt_want_write(oldnd.path.mnt);
2688 if (error)
2689 goto exit5;
2690 error = vfs_rename(old_dir->d_inode, old_dentry,
2691 new_dir->d_inode, new_dentry);
2692 mnt_drop_write(oldnd.path.mnt);
2693 exit5:
2694 dput(new_dentry);
2695 exit4:
2696 dput(old_dentry);
2697 exit3:
2698 unlock_rename(new_dir, old_dir);
2699 exit2:
2700 path_put(&newnd.path);
2701 putname(to);
2702 exit1:
2703 path_put(&oldnd.path);
2704 putname(from);
2705 exit:
2706 return error;
2709 SYSCALL_DEFINE2(rename, const char __user *, oldname, const char __user *, newname)
2711 return sys_renameat(AT_FDCWD, oldname, AT_FDCWD, newname);
2714 int vfs_readlink(struct dentry *dentry, char __user *buffer, int buflen, const char *link)
2716 int len;
2718 len = PTR_ERR(link);
2719 if (IS_ERR(link))
2720 goto out;
2722 len = strlen(link);
2723 if (len > (unsigned) buflen)
2724 len = buflen;
2725 if (copy_to_user(buffer, link, len))
2726 len = -EFAULT;
2727 out:
2728 return len;
2732 * A helper for ->readlink(). This should be used *ONLY* for symlinks that
2733 * have ->follow_link() touching nd only in nd_set_link(). Using (or not
2734 * using) it for any given inode is up to filesystem.
2736 int generic_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2738 struct nameidata nd;
2739 void *cookie;
2740 int res;
2742 nd.depth = 0;
2743 cookie = dentry->d_inode->i_op->follow_link(dentry, &nd);
2744 if (IS_ERR(cookie))
2745 return PTR_ERR(cookie);
2747 res = vfs_readlink(dentry, buffer, buflen, nd_get_link(&nd));
2748 if (dentry->d_inode->i_op->put_link)
2749 dentry->d_inode->i_op->put_link(dentry, &nd, cookie);
2750 return res;
2753 int vfs_follow_link(struct nameidata *nd, const char *link)
2755 return __vfs_follow_link(nd, link);
2758 /* get the link contents into pagecache */
2759 static char *page_getlink(struct dentry * dentry, struct page **ppage)
2761 struct page * page;
2762 struct address_space *mapping = dentry->d_inode->i_mapping;
2763 page = read_mapping_page(mapping, 0, NULL);
2764 if (IS_ERR(page))
2765 return (char*)page;
2766 *ppage = page;
2767 return kmap(page);
2770 int page_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2772 struct page *page = NULL;
2773 char *s = page_getlink(dentry, &page);
2774 int res = vfs_readlink(dentry,buffer,buflen,s);
2775 if (page) {
2776 kunmap(page);
2777 page_cache_release(page);
2779 return res;
2782 void *page_follow_link_light(struct dentry *dentry, struct nameidata *nd)
2784 struct page *page = NULL;
2785 nd_set_link(nd, page_getlink(dentry, &page));
2786 return page;
2789 void page_put_link(struct dentry *dentry, struct nameidata *nd, void *cookie)
2791 struct page *page = cookie;
2793 if (page) {
2794 kunmap(page);
2795 page_cache_release(page);
2800 * The nofs argument instructs pagecache_write_begin to pass AOP_FLAG_NOFS
2802 int __page_symlink(struct inode *inode, const char *symname, int len, int nofs)
2804 struct address_space *mapping = inode->i_mapping;
2805 struct page *page;
2806 void *fsdata;
2807 int err;
2808 char *kaddr;
2809 unsigned int flags = AOP_FLAG_UNINTERRUPTIBLE;
2810 if (nofs)
2811 flags |= AOP_FLAG_NOFS;
2813 retry:
2814 err = pagecache_write_begin(NULL, mapping, 0, len-1,
2815 flags, &page, &fsdata);
2816 if (err)
2817 goto fail;
2819 kaddr = kmap_atomic(page, KM_USER0);
2820 memcpy(kaddr, symname, len-1);
2821 kunmap_atomic(kaddr, KM_USER0);
2823 err = pagecache_write_end(NULL, mapping, 0, len-1, len-1,
2824 page, fsdata);
2825 if (err < 0)
2826 goto fail;
2827 if (err < len-1)
2828 goto retry;
2830 mark_inode_dirty(inode);
2831 return 0;
2832 fail:
2833 return err;
2836 int page_symlink(struct inode *inode, const char *symname, int len)
2838 return __page_symlink(inode, symname, len,
2839 !(mapping_gfp_mask(inode->i_mapping) & __GFP_FS));
2842 const struct inode_operations page_symlink_inode_operations = {
2843 .readlink = generic_readlink,
2844 .follow_link = page_follow_link_light,
2845 .put_link = page_put_link,
2848 EXPORT_SYMBOL(user_path_at);
2849 EXPORT_SYMBOL(follow_down);
2850 EXPORT_SYMBOL(follow_up);
2851 EXPORT_SYMBOL(get_write_access); /* binfmt_aout */
2852 EXPORT_SYMBOL(getname);
2853 EXPORT_SYMBOL(lock_rename);
2854 EXPORT_SYMBOL(lookup_one_len);
2855 EXPORT_SYMBOL(page_follow_link_light);
2856 EXPORT_SYMBOL(page_put_link);
2857 EXPORT_SYMBOL(page_readlink);
2858 EXPORT_SYMBOL(__page_symlink);
2859 EXPORT_SYMBOL(page_symlink);
2860 EXPORT_SYMBOL(page_symlink_inode_operations);
2861 EXPORT_SYMBOL(path_lookup);
2862 EXPORT_SYMBOL(vfs_path_lookup);
2863 EXPORT_SYMBOL(inode_permission);
2864 EXPORT_SYMBOL(vfs_permission);
2865 EXPORT_SYMBOL(file_permission);
2866 EXPORT_SYMBOL(unlock_rename);
2867 EXPORT_SYMBOL(vfs_create);
2868 EXPORT_SYMBOL(vfs_follow_link);
2869 EXPORT_SYMBOL(vfs_link);
2870 EXPORT_SYMBOL(vfs_mkdir);
2871 EXPORT_SYMBOL(vfs_mknod);
2872 EXPORT_SYMBOL(generic_permission);
2873 EXPORT_SYMBOL(vfs_readlink);
2874 EXPORT_SYMBOL(vfs_rename);
2875 EXPORT_SYMBOL(vfs_rmdir);
2876 EXPORT_SYMBOL(vfs_symlink);
2877 EXPORT_SYMBOL(vfs_unlink);
2878 EXPORT_SYMBOL(dentry_unhash);
2879 EXPORT_SYMBOL(generic_readlink);