allow coexistance of N build and AC build.
[tomato.git] / release / src-rt-6.x / linux / linux-2.6 / fs / namei.c
blobe1dc9daa3c93aa847288a07d056c378ad70ce8b1
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/namei.h>
34 #include <asm/namei.h>
35 #include <asm/uaccess.h>
37 #define ACC_MODE(x) ("\000\004\002\006"[(x)&O_ACCMODE])
39 /* [Feb-1997 T. Schoebel-Theuer]
40 * Fundamental changes in the pathname lookup mechanisms (namei)
41 * were necessary because of omirr. The reason is that omirr needs
42 * to know the _real_ pathname, not the user-supplied one, in case
43 * of symlinks (and also when transname replacements occur).
45 * The new code replaces the old recursive symlink resolution with
46 * an iterative one (in case of non-nested symlink chains). It does
47 * this with calls to <fs>_follow_link().
48 * As a side effect, dir_namei(), _namei() and follow_link() are now
49 * replaced with a single function lookup_dentry() that can handle all
50 * the special cases of the former code.
52 * With the new dcache, the pathname is stored at each inode, at least as
53 * long as the refcount of the inode is positive. As a side effect, the
54 * size of the dcache depends on the inode cache and thus is dynamic.
56 * [29-Apr-1998 C. Scott Ananian] Updated above description of symlink
57 * resolution to correspond with current state of the code.
59 * Note that the symlink resolution is not *completely* iterative.
60 * There is still a significant amount of tail- and mid- recursion in
61 * the algorithm. Also, note that <fs>_readlink() is not used in
62 * lookup_dentry(): lookup_dentry() on the result of <fs>_readlink()
63 * may return different results than <fs>_follow_link(). Many virtual
64 * filesystems (including /proc) exhibit this behavior.
67 /* [24-Feb-97 T. Schoebel-Theuer] Side effects caused by new implementation:
68 * New symlink semantics: when open() is called with flags O_CREAT | O_EXCL
69 * and the name already exists in form of a symlink, try to create the new
70 * name indicated by the symlink. The old code always complained that the
71 * name already exists, due to not following the symlink even if its target
72 * is nonexistent. The new semantics affects also mknod() and link() when
73 * the name is a symlink pointing to a non-existant name.
75 * I don't know which semantics is the right one, since I have no access
76 * to standards. But I found by trial that HP-UX 9.0 has the full "new"
77 * semantics implemented, while SunOS 4.1.1 and Solaris (SunOS 5.4) have the
78 * "old" one. Personally, I think the new semantics is much more logical.
79 * Note that "ln old new" where "new" is a symlink pointing to a non-existing
80 * file does succeed in both HP-UX and SunOs, but not in Solaris
81 * and in the old Linux semantics.
84 /* [16-Dec-97 Kevin Buhr] For security reasons, we change some symlink
85 * semantics. See the comments in "open_namei" and "do_link" below.
87 * [10-Sep-98 Alan Modra] Another symlink change.
90 /* [Feb-Apr 2000 AV] Complete rewrite. Rules for symlinks:
91 * inside the path - always follow.
92 * in the last component in creation/removal/renaming - never follow.
93 * if LOOKUP_FOLLOW passed - follow.
94 * if the pathname has trailing slashes - follow.
95 * otherwise - don't follow.
96 * (applied in that order).
98 * [Jun 2000 AV] Inconsistent behaviour of open() in case if flags==O_CREAT
99 * restored for 2.4. This is the last surviving part of old 4.2BSD bug.
100 * During the 2.4 we need to fix the userland stuff depending on it -
101 * hopefully we will be able to get rid of that wart in 2.5. So far only
102 * XEmacs seems to be relying on it...
105 * [Sep 2001 AV] Single-semaphore locking scheme (kudos to David Holland)
106 * implemented. Let's see if raised priority of ->s_vfs_rename_mutex gives
107 * any extra contention...
110 /* In order to reduce some races, while at the same time doing additional
111 * checking and hopefully speeding things up, we copy filenames to the
112 * kernel data space before using them..
114 * POSIX.1 2.4: an empty pathname is invalid (ENOENT).
115 * PATH_MAX includes the nul terminator --RR.
117 static int do_getname(const char __user *filename, char *page)
119 int retval;
120 unsigned long len = PATH_MAX;
122 if (!segment_eq(get_fs(), KERNEL_DS)) {
123 if ((unsigned long) filename >= TASK_SIZE)
124 return -EFAULT;
125 if (TASK_SIZE - (unsigned long) filename < PATH_MAX)
126 len = TASK_SIZE - (unsigned long) filename;
129 retval = strncpy_from_user(page, filename, len);
130 if (retval > 0) {
131 if (retval < len)
132 return 0;
133 return -ENAMETOOLONG;
134 } else if (!retval)
135 retval = -ENOENT;
136 return retval;
139 char * getname(const char __user * filename)
141 char *tmp, *result;
143 result = ERR_PTR(-ENOMEM);
144 tmp = __getname();
145 if (tmp) {
146 int retval = do_getname(filename, tmp);
148 result = tmp;
149 if (retval < 0) {
150 __putname(tmp);
151 result = ERR_PTR(retval);
154 audit_getname(result);
155 return result;
158 #ifdef CONFIG_AUDITSYSCALL
159 void putname(const char *name)
161 if (unlikely(!audit_dummy_context()))
162 audit_putname(name);
163 else
164 __putname(name);
166 EXPORT_SYMBOL(putname);
167 #endif
171 * generic_permission - check for access rights on a Posix-like filesystem
172 * @inode: inode to check access rights for
173 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
174 * @check_acl: optional callback to check for Posix ACLs
176 * Used to check for read/write/execute permissions on a file.
177 * We use "fsuid" for this, letting us set arbitrary permissions
178 * for filesystem access without changing the "normal" uids which
179 * are used for other things..
181 int generic_permission(struct inode *inode, int mask,
182 int (*check_acl)(struct inode *inode, int mask))
184 umode_t mode = inode->i_mode;
186 if (current->fsuid == inode->i_uid)
187 mode >>= 6;
188 else {
189 if (IS_POSIXACL(inode) && (mode & S_IRWXG) && check_acl) {
190 int error = check_acl(inode, mask);
191 if (error == -EACCES)
192 goto check_capabilities;
193 else if (error != -EAGAIN)
194 return error;
197 if (in_group_p(inode->i_gid))
198 mode >>= 3;
202 * If the DACs are ok we don't need any capability check.
204 if (((mode & mask & (MAY_READ|MAY_WRITE|MAY_EXEC)) == mask))
205 return 0;
207 check_capabilities:
209 * Read/write DACs are always overridable.
210 * Executable DACs are overridable if at least one exec bit is set.
212 if (!(mask & MAY_EXEC) ||
213 (inode->i_mode & S_IXUGO) || S_ISDIR(inode->i_mode))
214 if (capable(CAP_DAC_OVERRIDE))
215 return 0;
218 * Searching includes executable on directories, else just read.
220 if (mask == MAY_READ || (S_ISDIR(inode->i_mode) && !(mask & MAY_WRITE)))
221 if (capable(CAP_DAC_READ_SEARCH))
222 return 0;
224 return -EACCES;
227 int permission(struct inode *inode, int mask, struct nameidata *nd)
229 umode_t mode = inode->i_mode;
230 int retval, submask;
232 if (mask & MAY_WRITE) {
235 * Nobody gets write access to a read-only fs.
237 if (IS_RDONLY(inode) &&
238 (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode)))
239 return -EROFS;
242 * Nobody gets write access to an immutable file.
244 if (IS_IMMUTABLE(inode))
245 return -EACCES;
250 * MAY_EXEC on regular files requires special handling: We override
251 * filesystem execute permissions if the mode bits aren't set or
252 * the fs is mounted with the "noexec" flag.
254 if ((mask & MAY_EXEC) && S_ISREG(mode) && (!(mode & S_IXUGO) ||
255 (nd && nd->mnt && (nd->mnt->mnt_flags & MNT_NOEXEC))))
256 return -EACCES;
258 /* Ordinary permission routines do not understand MAY_APPEND. */
259 submask = mask & ~MAY_APPEND;
260 if (inode->i_op && inode->i_op->permission)
261 retval = inode->i_op->permission(inode, submask, nd);
262 else
263 retval = generic_permission(inode, submask, NULL);
264 if (retval)
265 return retval;
267 return security_inode_permission(inode, mask, nd);
271 * vfs_permission - check for access rights to a given path
272 * @nd: lookup result that describes the path
273 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
275 * Used to check for read/write/execute permissions on a path.
276 * We use "fsuid" for this, letting us set arbitrary permissions
277 * for filesystem access without changing the "normal" uids which
278 * are used for other things.
280 int vfs_permission(struct nameidata *nd, int mask)
282 return permission(nd->dentry->d_inode, mask, nd);
286 * file_permission - check for additional access rights to a given file
287 * @file: file to check access rights for
288 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
290 * Used to check for read/write/execute permissions on an already opened
291 * file.
293 * Note:
294 * Do not use this function in new code. All access checks should
295 * be done using vfs_permission().
297 int file_permission(struct file *file, int mask)
299 return permission(file->f_path.dentry->d_inode, mask, NULL);
303 * get_write_access() gets write permission for a file.
304 * put_write_access() releases this write permission.
305 * This is used for regular files.
306 * We cannot support write (and maybe mmap read-write shared) accesses and
307 * MAP_DENYWRITE mmappings simultaneously. The i_writecount field of an inode
308 * can have the following values:
309 * 0: no writers, no VM_DENYWRITE mappings
310 * < 0: (-i_writecount) vm_area_structs with VM_DENYWRITE set exist
311 * > 0: (i_writecount) users are writing to the file.
313 * Normally we operate on that counter with atomic_{inc,dec} and it's safe
314 * except for the cases where we don't hold i_writecount yet. Then we need to
315 * use {get,deny}_write_access() - these functions check the sign and refuse
316 * to do the change if sign is wrong. Exclusion between them is provided by
317 * the inode->i_lock spinlock.
320 int get_write_access(struct inode * inode)
322 spin_lock(&inode->i_lock);
323 if (atomic_read(&inode->i_writecount) < 0) {
324 spin_unlock(&inode->i_lock);
325 return -ETXTBSY;
327 atomic_inc(&inode->i_writecount);
328 spin_unlock(&inode->i_lock);
330 return 0;
333 int deny_write_access(struct file * file)
335 struct inode *inode = file->f_path.dentry->d_inode;
337 spin_lock(&inode->i_lock);
338 if (atomic_read(&inode->i_writecount) > 0) {
339 spin_unlock(&inode->i_lock);
340 return -ETXTBSY;
342 atomic_dec(&inode->i_writecount);
343 spin_unlock(&inode->i_lock);
345 return 0;
348 void path_release(struct nameidata *nd)
350 dput(nd->dentry);
351 mntput(nd->mnt);
355 * umount() mustn't call path_release()/mntput() as that would clear
356 * mnt_expiry_mark
358 void path_release_on_umount(struct nameidata *nd)
360 dput(nd->dentry);
361 mntput_no_expire(nd->mnt);
365 * release_open_intent - free up open intent resources
366 * @nd: pointer to nameidata
368 void release_open_intent(struct nameidata *nd)
370 if (nd->intent.open.file->f_path.dentry == NULL)
371 put_filp(nd->intent.open.file);
372 else
373 fput(nd->intent.open.file);
376 static inline struct dentry *
377 do_revalidate(struct dentry *dentry, struct nameidata *nd)
379 int status = dentry->d_op->d_revalidate(dentry, nd);
380 if (unlikely(status <= 0)) {
382 * The dentry failed validation.
383 * If d_revalidate returned 0 attempt to invalidate
384 * the dentry otherwise d_revalidate is asking us
385 * to return a fail status.
387 if (!status) {
388 if (!d_invalidate(dentry)) {
389 dput(dentry);
390 dentry = NULL;
392 } else {
393 dput(dentry);
394 dentry = ERR_PTR(status);
397 return dentry;
401 * Internal lookup() using the new generic dcache.
402 * SMP-safe
404 static struct dentry * cached_lookup(struct dentry * parent, struct qstr * name, struct nameidata *nd)
406 struct dentry * dentry = __d_lookup(parent, name);
408 /* lockess __d_lookup may fail due to concurrent d_move()
409 * in some unrelated directory, so try with d_lookup
411 if (!dentry)
412 dentry = d_lookup(parent, name);
414 if (dentry && dentry->d_op && dentry->d_op->d_revalidate)
415 dentry = do_revalidate(dentry, nd);
417 return dentry;
421 * Short-cut version of permission(), for calling by
422 * path_walk(), when dcache lock is held. Combines parts
423 * of permission() and generic_permission(), and tests ONLY for
424 * MAY_EXEC permission.
426 * If appropriate, check DAC only. If not appropriate, or
427 * short-cut DAC fails, then call permission() to do more
428 * complete permission check.
430 static int exec_permission_lite(struct inode *inode,
431 struct nameidata *nd)
433 umode_t mode = inode->i_mode;
435 if (inode->i_op && inode->i_op->permission)
436 return -EAGAIN;
438 if (current->fsuid == inode->i_uid)
439 mode >>= 6;
440 else if (in_group_p(inode->i_gid))
441 mode >>= 3;
443 if (mode & MAY_EXEC)
444 goto ok;
446 if ((inode->i_mode & S_IXUGO) && capable(CAP_DAC_OVERRIDE))
447 goto ok;
449 if (S_ISDIR(inode->i_mode) && capable(CAP_DAC_OVERRIDE))
450 goto ok;
452 if (S_ISDIR(inode->i_mode) && capable(CAP_DAC_READ_SEARCH))
453 goto ok;
455 return -EACCES;
457 return security_inode_permission(inode, MAY_EXEC, nd);
461 * This is called when everything else fails, and we actually have
462 * to go to the low-level filesystem to find out what we should do..
464 * We get the directory semaphore, and after getting that we also
465 * make sure that nobody added the entry to the dcache in the meantime..
466 * SMP-safe
468 static struct dentry * real_lookup(struct dentry * parent, struct qstr * name, struct nameidata *nd)
470 struct dentry * result;
471 struct inode *dir = parent->d_inode;
473 mutex_lock(&dir->i_mutex);
475 * First re-do the cached lookup just in case it was created
476 * while we waited for the directory semaphore..
478 * FIXME! This could use version numbering or similar to
479 * avoid unnecessary cache lookups.
481 * The "dcache_lock" is purely to protect the RCU list walker
482 * from concurrent renames at this point (we mustn't get false
483 * negatives from the RCU list walk here, unlike the optimistic
484 * fast walk).
486 * so doing d_lookup() (with seqlock), instead of lockfree __d_lookup
488 result = d_lookup(parent, name);
489 if (!result) {
490 struct dentry * dentry = d_alloc(parent, name);
491 result = ERR_PTR(-ENOMEM);
492 if (dentry) {
493 result = dir->i_op->lookup(dir, dentry, nd);
494 if (result)
495 dput(dentry);
496 else
497 result = dentry;
499 mutex_unlock(&dir->i_mutex);
500 return result;
504 * Uhhuh! Nasty case: the cache was re-populated while
505 * we waited on the semaphore. Need to revalidate.
507 mutex_unlock(&dir->i_mutex);
508 if (result->d_op && result->d_op->d_revalidate) {
509 result = do_revalidate(result, nd);
510 if (!result)
511 result = ERR_PTR(-ENOENT);
513 return result;
516 static int __emul_lookup_dentry(const char *, struct nameidata *);
518 /* SMP-safe */
519 static __always_inline int
520 walk_init_root(const char *name, struct nameidata *nd)
522 struct fs_struct *fs = current->fs;
524 read_lock(&fs->lock);
525 if (fs->altroot && !(nd->flags & LOOKUP_NOALT)) {
526 nd->mnt = mntget(fs->altrootmnt);
527 nd->dentry = dget(fs->altroot);
528 read_unlock(&fs->lock);
529 if (__emul_lookup_dentry(name,nd))
530 return 0;
531 read_lock(&fs->lock);
533 nd->mnt = mntget(fs->rootmnt);
534 nd->dentry = dget(fs->root);
535 read_unlock(&fs->lock);
536 return 1;
539 static __always_inline int __vfs_follow_link(struct nameidata *nd, const char *link)
541 int res = 0;
542 char *name;
543 if (IS_ERR(link))
544 goto fail;
546 if (*link == '/') {
547 path_release(nd);
548 if (!walk_init_root(link, nd))
549 /* weird __emul_prefix() stuff did it */
550 goto out;
552 res = link_path_walk(link, nd);
553 out:
554 if (nd->depth || res || nd->last_type!=LAST_NORM)
555 return res;
557 * If it is an iterative symlinks resolution in open_namei() we
558 * have to copy the last component. And all that crap because of
559 * bloody create() on broken symlinks. Furrfu...
561 name = __getname();
562 if (unlikely(!name)) {
563 path_release(nd);
564 return -ENOMEM;
566 strcpy(name, nd->last.name);
567 nd->last.name = name;
568 return 0;
569 fail:
570 path_release(nd);
571 return PTR_ERR(link);
574 static inline void dput_path(struct path *path, struct nameidata *nd)
576 dput(path->dentry);
577 if (path->mnt != nd->mnt)
578 mntput(path->mnt);
581 static inline void path_to_nameidata(struct path *path, struct nameidata *nd)
583 dput(nd->dentry);
584 if (nd->mnt != path->mnt)
585 mntput(nd->mnt);
586 nd->mnt = path->mnt;
587 nd->dentry = path->dentry;
590 static __always_inline int __do_follow_link(struct path *path, struct nameidata *nd)
592 int error;
593 void *cookie;
594 struct dentry *dentry = path->dentry;
596 touch_atime(path->mnt, dentry);
597 nd_set_link(nd, NULL);
599 if (path->mnt != nd->mnt) {
600 path_to_nameidata(path, nd);
601 dget(dentry);
603 mntget(path->mnt);
604 cookie = dentry->d_inode->i_op->follow_link(dentry, nd);
605 error = PTR_ERR(cookie);
606 if (!IS_ERR(cookie)) {
607 char *s = nd_get_link(nd);
608 error = 0;
609 if (s)
610 error = __vfs_follow_link(nd, s);
611 if (dentry->d_inode->i_op->put_link)
612 dentry->d_inode->i_op->put_link(dentry, nd, cookie);
614 dput(dentry);
615 mntput(path->mnt);
617 return error;
621 * This limits recursive symlink follows to 8, while
622 * limiting consecutive symlinks to 40.
624 * Without that kind of total limit, nasty chains of consecutive
625 * symlinks can cause almost arbitrarily long lookups.
627 static inline int do_follow_link(struct path *path, struct nameidata *nd)
629 int err = -ELOOP;
630 if (current->link_count >= MAX_NESTED_LINKS)
631 goto loop;
632 if (current->total_link_count >= 40)
633 goto loop;
634 BUG_ON(nd->depth >= MAX_NESTED_LINKS);
635 cond_resched();
636 err = security_inode_follow_link(path->dentry, nd);
637 if (err)
638 goto loop;
639 current->link_count++;
640 current->total_link_count++;
641 nd->depth++;
642 err = __do_follow_link(path, nd);
643 current->link_count--;
644 nd->depth--;
645 return err;
646 loop:
647 dput_path(path, nd);
648 path_release(nd);
649 return err;
652 int follow_up(struct vfsmount **mnt, struct dentry **dentry)
654 struct vfsmount *parent;
655 struct dentry *mountpoint;
656 spin_lock(&vfsmount_lock);
657 parent=(*mnt)->mnt_parent;
658 if (parent == *mnt) {
659 spin_unlock(&vfsmount_lock);
660 return 0;
662 mntget(parent);
663 mountpoint=dget((*mnt)->mnt_mountpoint);
664 spin_unlock(&vfsmount_lock);
665 dput(*dentry);
666 *dentry = mountpoint;
667 mntput(*mnt);
668 *mnt = parent;
669 return 1;
672 /* no need for dcache_lock, as serialization is taken care in
673 * namespace.c
675 static int __follow_mount(struct path *path)
677 int res = 0;
678 while (d_mountpoint(path->dentry)) {
679 struct vfsmount *mounted = lookup_mnt(path->mnt, path->dentry);
680 if (!mounted)
681 break;
682 dput(path->dentry);
683 if (res)
684 mntput(path->mnt);
685 path->mnt = mounted;
686 path->dentry = dget(mounted->mnt_root);
687 res = 1;
689 return res;
692 static void follow_mount(struct vfsmount **mnt, struct dentry **dentry)
694 while (d_mountpoint(*dentry)) {
695 struct vfsmount *mounted = lookup_mnt(*mnt, *dentry);
696 if (!mounted)
697 break;
698 dput(*dentry);
699 mntput(*mnt);
700 *mnt = mounted;
701 *dentry = dget(mounted->mnt_root);
705 /* no need for dcache_lock, as serialization is taken care in
706 * namespace.c
708 int follow_down(struct vfsmount **mnt, struct dentry **dentry)
710 struct vfsmount *mounted;
712 mounted = lookup_mnt(*mnt, *dentry);
713 if (mounted) {
714 dput(*dentry);
715 mntput(*mnt);
716 *mnt = mounted;
717 *dentry = dget(mounted->mnt_root);
718 return 1;
720 return 0;
723 static __always_inline void follow_dotdot(struct nameidata *nd)
725 struct fs_struct *fs = current->fs;
727 while(1) {
728 struct vfsmount *parent;
729 struct dentry *old = nd->dentry;
731 read_lock(&fs->lock);
732 if (nd->dentry == fs->root &&
733 nd->mnt == fs->rootmnt) {
734 read_unlock(&fs->lock);
735 break;
737 read_unlock(&fs->lock);
738 spin_lock(&dcache_lock);
739 if (nd->dentry != nd->mnt->mnt_root) {
740 nd->dentry = dget(nd->dentry->d_parent);
741 spin_unlock(&dcache_lock);
742 dput(old);
743 break;
745 spin_unlock(&dcache_lock);
746 spin_lock(&vfsmount_lock);
747 parent = nd->mnt->mnt_parent;
748 if (parent == nd->mnt) {
749 spin_unlock(&vfsmount_lock);
750 break;
752 mntget(parent);
753 nd->dentry = dget(nd->mnt->mnt_mountpoint);
754 spin_unlock(&vfsmount_lock);
755 dput(old);
756 mntput(nd->mnt);
757 nd->mnt = parent;
759 follow_mount(&nd->mnt, &nd->dentry);
763 * It's more convoluted than I'd like it to be, but... it's still fairly
764 * small and for now I'd prefer to have fast path as straight as possible.
765 * It _is_ time-critical.
767 static int do_lookup(struct nameidata *nd, struct qstr *name,
768 struct path *path)
770 struct vfsmount *mnt = nd->mnt;
771 struct dentry *dentry = __d_lookup(nd->dentry, name);
773 if (!dentry)
774 goto need_lookup;
775 if (dentry->d_op && dentry->d_op->d_revalidate)
776 goto need_revalidate;
777 done:
778 path->mnt = mnt;
779 path->dentry = dentry;
780 __follow_mount(path);
781 return 0;
783 need_lookup:
784 dentry = real_lookup(nd->dentry, name, nd);
785 if (IS_ERR(dentry))
786 goto fail;
787 goto done;
789 need_revalidate:
790 dentry = do_revalidate(dentry, nd);
791 if (!dentry)
792 goto need_lookup;
793 if (IS_ERR(dentry))
794 goto fail;
795 goto done;
797 fail:
798 return PTR_ERR(dentry);
802 * Name resolution.
803 * This is the basic name resolution function, turning a pathname into
804 * the final dentry. We expect 'base' to be positive and a directory.
806 * Returns 0 and nd will have valid dentry and mnt on success.
807 * Returns error and drops reference to input namei data on failure.
809 static fastcall int __link_path_walk(const char * name, struct nameidata *nd)
811 struct path next;
812 struct inode *inode;
813 int err;
814 unsigned int lookup_flags = nd->flags;
816 while (*name=='/')
817 name++;
818 if (!*name)
819 goto return_reval;
821 inode = nd->dentry->d_inode;
822 if (nd->depth)
823 lookup_flags = LOOKUP_FOLLOW | (nd->flags & LOOKUP_CONTINUE);
825 /* At this point we know we have a real path component. */
826 for(;;) {
827 unsigned long hash;
828 struct qstr this;
829 unsigned int c;
831 nd->flags |= LOOKUP_CONTINUE;
832 err = exec_permission_lite(inode, nd);
833 if (err == -EAGAIN)
834 err = vfs_permission(nd, MAY_EXEC);
835 if (err)
836 break;
838 this.name = name;
839 c = *(const unsigned char *)name;
841 hash = init_name_hash();
842 do {
843 name++;
844 hash = partial_name_hash(c, hash);
845 c = *(const unsigned char *)name;
846 } while (c && (c != '/'));
847 this.len = name - (const char *) this.name;
848 this.hash = end_name_hash(hash);
850 /* remove trailing slashes? */
851 if (!c)
852 goto last_component;
853 while (*++name == '/');
854 if (!*name)
855 goto last_with_slashes;
858 * "." and ".." are special - ".." especially so because it has
859 * to be able to know about the current root directory and
860 * parent relationships.
862 if (this.name[0] == '.') switch (this.len) {
863 default:
864 break;
865 case 2:
866 if (this.name[1] != '.')
867 break;
868 follow_dotdot(nd);
869 inode = nd->dentry->d_inode;
870 /* fallthrough */
871 case 1:
872 continue;
875 * See if the low-level filesystem might want
876 * to use its own hash..
878 if (nd->dentry->d_op && nd->dentry->d_op->d_hash) {
879 err = nd->dentry->d_op->d_hash(nd->dentry, &this);
880 if (err < 0)
881 break;
883 /* This does the actual lookups.. */
884 err = do_lookup(nd, &this, &next);
885 if (err)
886 break;
888 err = -ENOENT;
889 inode = next.dentry->d_inode;
890 if (!inode)
891 goto out_dput;
892 err = -ENOTDIR;
893 if (!inode->i_op)
894 goto out_dput;
896 if (inode->i_op->follow_link) {
897 err = do_follow_link(&next, nd);
898 if (err)
899 goto return_err;
900 err = -ENOENT;
901 inode = nd->dentry->d_inode;
902 if (!inode)
903 break;
904 err = -ENOTDIR;
905 if (!inode->i_op)
906 break;
907 } else
908 path_to_nameidata(&next, nd);
909 err = -ENOTDIR;
910 if (!inode->i_op->lookup)
911 break;
912 continue;
913 /* here ends the main loop */
915 last_with_slashes:
916 lookup_flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY;
917 last_component:
918 /* Clear LOOKUP_CONTINUE iff it was previously unset */
919 nd->flags &= lookup_flags | ~LOOKUP_CONTINUE;
920 if (lookup_flags & LOOKUP_PARENT)
921 goto lookup_parent;
922 if (this.name[0] == '.') switch (this.len) {
923 default:
924 break;
925 case 2:
926 if (this.name[1] != '.')
927 break;
928 follow_dotdot(nd);
929 inode = nd->dentry->d_inode;
930 /* fallthrough */
931 case 1:
932 goto return_reval;
934 if (nd->dentry->d_op && nd->dentry->d_op->d_hash) {
935 err = nd->dentry->d_op->d_hash(nd->dentry, &this);
936 if (err < 0)
937 break;
939 err = do_lookup(nd, &this, &next);
940 if (err)
941 break;
942 inode = next.dentry->d_inode;
943 if ((lookup_flags & LOOKUP_FOLLOW)
944 && inode && inode->i_op && inode->i_op->follow_link) {
945 err = do_follow_link(&next, nd);
946 if (err)
947 goto return_err;
948 inode = nd->dentry->d_inode;
949 } else
950 path_to_nameidata(&next, nd);
951 err = -ENOENT;
952 if (!inode)
953 break;
954 if (lookup_flags & LOOKUP_DIRECTORY) {
955 err = -ENOTDIR;
956 if (!inode->i_op || !inode->i_op->lookup)
957 break;
959 goto return_base;
960 lookup_parent:
961 nd->last = this;
962 nd->last_type = LAST_NORM;
963 if (this.name[0] != '.')
964 goto return_base;
965 if (this.len == 1)
966 nd->last_type = LAST_DOT;
967 else if (this.len == 2 && this.name[1] == '.')
968 nd->last_type = LAST_DOTDOT;
969 else
970 goto return_base;
971 return_reval:
973 * We bypassed the ordinary revalidation routines.
974 * We may need to check the cached dentry for staleness.
976 if (nd->dentry && nd->dentry->d_sb &&
977 (nd->dentry->d_sb->s_type->fs_flags & FS_REVAL_DOT)) {
978 err = -ESTALE;
979 /* Note: we do not d_invalidate() */
980 if (!nd->dentry->d_op->d_revalidate(nd->dentry, nd))
981 break;
983 return_base:
984 return 0;
985 out_dput:
986 dput_path(&next, nd);
987 break;
989 path_release(nd);
990 return_err:
991 return err;
995 * Wrapper to retry pathname resolution whenever the underlying
996 * file system returns an ESTALE.
998 * Retry the whole path once, forcing real lookup requests
999 * instead of relying on the dcache.
1001 int fastcall link_path_walk(const char *name, struct nameidata *nd)
1003 struct nameidata save = *nd;
1004 int result;
1006 /* make sure the stuff we saved doesn't go away */
1007 dget(save.dentry);
1008 mntget(save.mnt);
1010 result = __link_path_walk(name, nd);
1011 if (result == -ESTALE) {
1012 *nd = save;
1013 dget(nd->dentry);
1014 mntget(nd->mnt);
1015 nd->flags |= LOOKUP_REVAL;
1016 result = __link_path_walk(name, nd);
1019 dput(save.dentry);
1020 mntput(save.mnt);
1022 return result;
1025 int fastcall path_walk(const char * name, struct nameidata *nd)
1027 current->total_link_count = 0;
1028 return link_path_walk(name, nd);
1032 * SMP-safe: Returns 1 and nd will have valid dentry and mnt, if
1033 * everything is done. Returns 0 and drops input nd, if lookup failed;
1035 static int __emul_lookup_dentry(const char *name, struct nameidata *nd)
1037 if (path_walk(name, nd))
1038 return 0; /* something went wrong... */
1040 if (!nd->dentry->d_inode || S_ISDIR(nd->dentry->d_inode->i_mode)) {
1041 struct dentry *old_dentry = nd->dentry;
1042 struct vfsmount *old_mnt = nd->mnt;
1043 struct qstr last = nd->last;
1044 int last_type = nd->last_type;
1045 struct fs_struct *fs = current->fs;
1048 * NAME was not found in alternate root or it's a directory.
1049 * Try to find it in the normal root:
1051 nd->last_type = LAST_ROOT;
1052 read_lock(&fs->lock);
1053 nd->mnt = mntget(fs->rootmnt);
1054 nd->dentry = dget(fs->root);
1055 read_unlock(&fs->lock);
1056 if (path_walk(name, nd) == 0) {
1057 if (nd->dentry->d_inode) {
1058 dput(old_dentry);
1059 mntput(old_mnt);
1060 return 1;
1062 path_release(nd);
1064 nd->dentry = old_dentry;
1065 nd->mnt = old_mnt;
1066 nd->last = last;
1067 nd->last_type = last_type;
1069 return 1;
1072 void set_fs_altroot(void)
1074 char *emul = __emul_prefix();
1075 struct nameidata nd;
1076 struct vfsmount *mnt = NULL, *oldmnt;
1077 struct dentry *dentry = NULL, *olddentry;
1078 int err;
1079 struct fs_struct *fs = current->fs;
1081 if (!emul)
1082 goto set_it;
1083 err = path_lookup(emul, LOOKUP_FOLLOW|LOOKUP_DIRECTORY|LOOKUP_NOALT, &nd);
1084 if (!err) {
1085 mnt = nd.mnt;
1086 dentry = nd.dentry;
1088 set_it:
1089 write_lock(&fs->lock);
1090 oldmnt = fs->altrootmnt;
1091 olddentry = fs->altroot;
1092 fs->altrootmnt = mnt;
1093 fs->altroot = dentry;
1094 write_unlock(&fs->lock);
1095 if (olddentry) {
1096 dput(olddentry);
1097 mntput(oldmnt);
1101 /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
1102 static int fastcall do_path_lookup(int dfd, const char *name,
1103 unsigned int flags, struct nameidata *nd)
1105 int retval = 0;
1106 int fput_needed;
1107 struct file *file;
1108 struct fs_struct *fs = current->fs;
1110 nd->last_type = LAST_ROOT; /* if there are only slashes... */
1111 nd->flags = flags;
1112 nd->depth = 0;
1114 if (*name=='/') {
1115 read_lock(&fs->lock);
1116 if (fs->altroot && !(nd->flags & LOOKUP_NOALT)) {
1117 nd->mnt = mntget(fs->altrootmnt);
1118 nd->dentry = dget(fs->altroot);
1119 read_unlock(&fs->lock);
1120 if (__emul_lookup_dentry(name,nd))
1121 goto out; /* found in altroot */
1122 read_lock(&fs->lock);
1124 nd->mnt = mntget(fs->rootmnt);
1125 nd->dentry = dget(fs->root);
1126 read_unlock(&fs->lock);
1127 } else if (dfd == AT_FDCWD) {
1128 read_lock(&fs->lock);
1129 nd->mnt = mntget(fs->pwdmnt);
1130 nd->dentry = dget(fs->pwd);
1131 read_unlock(&fs->lock);
1132 } else {
1133 struct dentry *dentry;
1135 file = fget_light(dfd, &fput_needed);
1136 retval = -EBADF;
1137 if (!file)
1138 goto out_fail;
1140 dentry = file->f_path.dentry;
1142 retval = -ENOTDIR;
1143 if (!S_ISDIR(dentry->d_inode->i_mode))
1144 goto fput_fail;
1146 retval = file_permission(file, MAY_EXEC);
1147 if (retval)
1148 goto fput_fail;
1150 nd->mnt = mntget(file->f_path.mnt);
1151 nd->dentry = dget(dentry);
1153 fput_light(file, fput_needed);
1156 retval = path_walk(name, nd);
1157 out:
1158 if (unlikely(!retval && !audit_dummy_context() && nd->dentry &&
1159 nd->dentry->d_inode))
1160 audit_inode(name, nd->dentry->d_inode);
1161 out_fail:
1162 return retval;
1164 fput_fail:
1165 fput_light(file, fput_needed);
1166 goto out_fail;
1169 int fastcall path_lookup(const char *name, unsigned int flags,
1170 struct nameidata *nd)
1172 return do_path_lookup(AT_FDCWD, name, flags, nd);
1176 * vfs_path_lookup - lookup a file path relative to a dentry-vfsmount pair
1177 * @dentry: pointer to dentry of the base directory
1178 * @mnt: pointer to vfs mount of the base directory
1179 * @name: pointer to file name
1180 * @flags: lookup flags
1181 * @nd: pointer to nameidata
1183 int vfs_path_lookup(struct dentry *dentry, struct vfsmount *mnt,
1184 const char *name, unsigned int flags,
1185 struct nameidata *nd)
1187 int retval;
1189 /* same as do_path_lookup */
1190 nd->last_type = LAST_ROOT;
1191 nd->flags = flags;
1192 nd->depth = 0;
1194 nd->mnt = mntget(mnt);
1195 nd->dentry = dget(dentry);
1197 retval = path_walk(name, nd);
1198 if (unlikely(!retval && !audit_dummy_context() && nd->dentry &&
1199 nd->dentry->d_inode))
1200 audit_inode(name, nd->dentry->d_inode);
1202 return retval;
1206 static int __path_lookup_intent_open(int dfd, const char *name,
1207 unsigned int lookup_flags, struct nameidata *nd,
1208 int open_flags, int create_mode)
1210 struct file *filp = get_empty_filp();
1211 int err;
1213 if (filp == NULL)
1214 return -ENFILE;
1215 nd->intent.open.file = filp;
1216 nd->intent.open.flags = open_flags;
1217 nd->intent.open.create_mode = create_mode;
1218 err = do_path_lookup(dfd, name, lookup_flags|LOOKUP_OPEN, nd);
1219 if (IS_ERR(nd->intent.open.file)) {
1220 if (err == 0) {
1221 err = PTR_ERR(nd->intent.open.file);
1222 path_release(nd);
1224 } else if (err != 0)
1225 release_open_intent(nd);
1226 return err;
1230 * path_lookup_open - lookup a file path with open intent
1231 * @dfd: the directory to use as base, or AT_FDCWD
1232 * @name: pointer to file name
1233 * @lookup_flags: lookup intent flags
1234 * @nd: pointer to nameidata
1235 * @open_flags: open intent flags
1237 int path_lookup_open(int dfd, const char *name, unsigned int lookup_flags,
1238 struct nameidata *nd, int open_flags)
1240 return __path_lookup_intent_open(dfd, name, lookup_flags, nd,
1241 open_flags, 0);
1245 * path_lookup_create - lookup a file path with open + create intent
1246 * @dfd: the directory to use as base, or AT_FDCWD
1247 * @name: pointer to file name
1248 * @lookup_flags: lookup intent flags
1249 * @nd: pointer to nameidata
1250 * @open_flags: open intent flags
1251 * @create_mode: create intent flags
1253 static int path_lookup_create(int dfd, const char *name,
1254 unsigned int lookup_flags, struct nameidata *nd,
1255 int open_flags, int create_mode)
1257 return __path_lookup_intent_open(dfd, name, lookup_flags|LOOKUP_CREATE,
1258 nd, open_flags, create_mode);
1261 int __user_path_lookup_open(const char __user *name, unsigned int lookup_flags,
1262 struct nameidata *nd, int open_flags)
1264 char *tmp = getname(name);
1265 int err = PTR_ERR(tmp);
1267 if (!IS_ERR(tmp)) {
1268 err = __path_lookup_intent_open(AT_FDCWD, tmp, lookup_flags, nd, open_flags, 0);
1269 putname(tmp);
1271 return err;
1274 static inline struct dentry *__lookup_hash_kern(struct qstr *name, struct dentry *base, struct nameidata *nd)
1276 struct dentry *dentry;
1277 struct inode *inode;
1278 int err;
1280 inode = base->d_inode;
1283 * See if the low-level filesystem might want
1284 * to use its own hash..
1286 if (base->d_op && base->d_op->d_hash) {
1287 err = base->d_op->d_hash(base, name);
1288 dentry = ERR_PTR(err);
1289 if (err < 0)
1290 goto out;
1293 dentry = cached_lookup(base, name, nd);
1294 if (!dentry) {
1295 struct dentry *new = d_alloc(base, name);
1296 dentry = ERR_PTR(-ENOMEM);
1297 if (!new)
1298 goto out;
1299 dentry = inode->i_op->lookup(inode, new, nd);
1300 if (!dentry)
1301 dentry = new;
1302 else
1303 dput(new);
1305 out:
1306 return dentry;
1310 * Restricted form of lookup. Doesn't follow links, single-component only,
1311 * needs parent already locked. Doesn't follow mounts.
1312 * SMP-safe.
1314 static inline struct dentry * __lookup_hash(struct qstr *name, struct dentry *base, struct nameidata *nd)
1316 struct dentry *dentry;
1317 struct inode *inode;
1318 int err;
1320 inode = base->d_inode;
1322 err = permission(inode, MAY_EXEC, nd);
1323 dentry = ERR_PTR(err);
1324 if (err)
1325 goto out;
1327 dentry = __lookup_hash_kern(name, base, nd);
1328 out:
1329 return dentry;
1332 static struct dentry *lookup_hash(struct nameidata *nd)
1334 return __lookup_hash(&nd->last, nd->dentry, nd);
1337 /* SMP-safe */
1338 static inline int __lookup_one_len(const char *name, struct qstr *this, struct dentry *base, int len)
1340 unsigned long hash;
1341 unsigned int c;
1343 this->name = name;
1344 this->len = len;
1345 if (!len)
1346 return -EACCES;
1348 hash = init_name_hash();
1349 while (len--) {
1350 c = *(const unsigned char *)name++;
1351 if (c == '/' || c == '\0')
1352 return -EACCES;
1353 hash = partial_name_hash(c, hash);
1355 this->hash = end_name_hash(hash);
1356 return 0;
1359 struct dentry *lookup_one_len(const char *name, struct dentry *base, int len)
1361 int err;
1362 struct qstr this;
1364 err = __lookup_one_len(name, &this, base, len);
1365 if (err)
1366 return ERR_PTR(err);
1367 return __lookup_hash(&this, base, NULL);
1370 struct dentry *lookup_one_len_kern(const char *name, struct dentry *base, int len)
1372 int err;
1373 struct qstr this;
1375 err = __lookup_one_len(name, &this, base, len);
1376 if (err)
1377 return ERR_PTR(err);
1378 return __lookup_hash_kern(&this, base, NULL);
1381 int fastcall __user_walk_fd(int dfd, const char __user *name, unsigned flags,
1382 struct nameidata *nd)
1384 char *tmp = getname(name);
1385 int err = PTR_ERR(tmp);
1387 if (!IS_ERR(tmp)) {
1388 err = do_path_lookup(dfd, tmp, flags, nd);
1389 putname(tmp);
1391 return err;
1394 int fastcall __user_walk(const char __user *name, unsigned flags, struct nameidata *nd)
1396 return __user_walk_fd(AT_FDCWD, name, flags, nd);
1400 * It's inline, so penalty for filesystems that don't use sticky bit is
1401 * minimal.
1403 static inline int check_sticky(struct inode *dir, struct inode *inode)
1405 if (!(dir->i_mode & S_ISVTX))
1406 return 0;
1407 if (inode->i_uid == current->fsuid)
1408 return 0;
1409 if (dir->i_uid == current->fsuid)
1410 return 0;
1411 return !capable(CAP_FOWNER);
1415 * Check whether we can remove a link victim from directory dir, check
1416 * whether the type of victim is right.
1417 * 1. We can't do it if dir is read-only (done in permission())
1418 * 2. We should have write and exec permissions on dir
1419 * 3. We can't remove anything from append-only dir
1420 * 4. We can't do anything with immutable dir (done in permission())
1421 * 5. If the sticky bit on dir is set we should either
1422 * a. be owner of dir, or
1423 * b. be owner of victim, or
1424 * c. have CAP_FOWNER capability
1425 * 6. If the victim is append-only or immutable we can't do antyhing with
1426 * links pointing to it.
1427 * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR.
1428 * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR.
1429 * 9. We can't remove a root or mountpoint.
1430 * 10. We don't allow removal of NFS sillyrenamed files; it's handled by
1431 * nfs_async_unlink().
1433 static int may_delete(struct inode *dir,struct dentry *victim,int isdir)
1435 int error;
1437 if (!victim->d_inode)
1438 return -ENOENT;
1440 BUG_ON(victim->d_parent->d_inode != dir);
1441 audit_inode_child(victim->d_name.name, victim->d_inode, dir);
1443 error = permission(dir,MAY_WRITE | MAY_EXEC, NULL);
1444 if (error)
1445 return error;
1446 if (IS_APPEND(dir))
1447 return -EPERM;
1448 if (check_sticky(dir, victim->d_inode)||IS_APPEND(victim->d_inode)||
1449 IS_IMMUTABLE(victim->d_inode))
1450 return -EPERM;
1451 if (isdir) {
1452 if (!S_ISDIR(victim->d_inode->i_mode))
1453 return -ENOTDIR;
1454 if (IS_ROOT(victim))
1455 return -EBUSY;
1456 } else if (S_ISDIR(victim->d_inode->i_mode))
1457 return -EISDIR;
1458 if (IS_DEADDIR(dir))
1459 return -ENOENT;
1460 if (victim->d_flags & DCACHE_NFSFS_RENAMED)
1461 return -EBUSY;
1462 return 0;
1465 /* Check whether we can create an object with dentry child in directory
1466 * dir.
1467 * 1. We can't do it if child already exists (open has special treatment for
1468 * this case, but since we are inlined it's OK)
1469 * 2. We can't do it if dir is read-only (done in permission())
1470 * 3. We should have write and exec permissions on dir
1471 * 4. We can't do it if dir is immutable (done in permission())
1473 static inline int may_create(struct inode *dir, struct dentry *child,
1474 struct nameidata *nd)
1476 if (child->d_inode)
1477 return -EEXIST;
1478 if (IS_DEADDIR(dir))
1479 return -ENOENT;
1480 return permission(dir,MAY_WRITE | MAY_EXEC, nd);
1484 * O_DIRECTORY translates into forcing a directory lookup.
1486 static inline int lookup_flags(unsigned int f)
1488 unsigned long retval = LOOKUP_FOLLOW;
1490 if (f & O_NOFOLLOW)
1491 retval &= ~LOOKUP_FOLLOW;
1493 if (f & O_DIRECTORY)
1494 retval |= LOOKUP_DIRECTORY;
1496 return retval;
1500 * p1 and p2 should be directories on the same fs.
1502 struct dentry *lock_rename(struct dentry *p1, struct dentry *p2)
1504 struct dentry *p;
1506 if (p1 == p2) {
1507 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1508 return NULL;
1511 mutex_lock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1513 for (p = p1; p->d_parent != p; p = p->d_parent) {
1514 if (p->d_parent == p2) {
1515 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_PARENT);
1516 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_CHILD);
1517 return p;
1521 for (p = p2; p->d_parent != p; p = p->d_parent) {
1522 if (p->d_parent == p1) {
1523 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1524 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1525 return p;
1529 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1530 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1531 return NULL;
1534 void unlock_rename(struct dentry *p1, struct dentry *p2)
1536 mutex_unlock(&p1->d_inode->i_mutex);
1537 if (p1 != p2) {
1538 mutex_unlock(&p2->d_inode->i_mutex);
1539 mutex_unlock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1543 int vfs_create(struct inode *dir, struct dentry *dentry, int mode,
1544 struct nameidata *nd)
1546 int error = may_create(dir, dentry, nd);
1548 if (error)
1549 return error;
1551 if (!dir->i_op || !dir->i_op->create)
1552 return -EACCES; /* shouldn't it be ENOSYS? */
1553 mode &= S_IALLUGO;
1554 mode |= S_IFREG;
1555 error = security_inode_create(dir, dentry, mode);
1556 if (error)
1557 return error;
1558 DQUOT_INIT(dir);
1559 error = dir->i_op->create(dir, dentry, mode, nd);
1560 if (!error)
1561 fsnotify_create(dir, dentry);
1562 return error;
1565 int may_open(struct nameidata *nd, int acc_mode, int flag)
1567 struct dentry *dentry = nd->dentry;
1568 struct inode *inode = dentry->d_inode;
1569 int error;
1571 if (!inode)
1572 return -ENOENT;
1574 if (S_ISLNK(inode->i_mode))
1575 return -ELOOP;
1577 if (S_ISDIR(inode->i_mode) && (acc_mode & MAY_WRITE))
1578 return -EISDIR;
1580 error = vfs_permission(nd, acc_mode);
1581 if (error)
1582 return error;
1585 * FIFO's, sockets and device files are special: they don't
1586 * actually live on the filesystem itself, and as such you
1587 * can write to them even if the filesystem is read-only.
1589 if (S_ISFIFO(inode->i_mode) || S_ISSOCK(inode->i_mode)) {
1590 flag &= ~O_TRUNC;
1591 } else if (S_ISBLK(inode->i_mode) || S_ISCHR(inode->i_mode)) {
1592 if (nd->mnt->mnt_flags & MNT_NODEV)
1593 return -EACCES;
1595 flag &= ~O_TRUNC;
1596 } else if (IS_RDONLY(inode) && (acc_mode & MAY_WRITE))
1597 return -EROFS;
1599 * An append-only file must be opened in append mode for writing.
1601 if (IS_APPEND(inode)) {
1602 if ((flag & FMODE_WRITE) && !(flag & O_APPEND))
1603 return -EPERM;
1604 if (flag & O_TRUNC)
1605 return -EPERM;
1608 /* O_NOATIME can only be set by the owner or superuser */
1609 if (flag & O_NOATIME)
1610 if (current->fsuid != inode->i_uid && !capable(CAP_FOWNER))
1611 return -EPERM;
1614 * Ensure there are no outstanding leases on the file.
1616 error = break_lease(inode, flag);
1617 if (error)
1618 return error;
1620 if (flag & O_TRUNC) {
1621 error = get_write_access(inode);
1622 if (error)
1623 return error;
1626 * Refuse to truncate files with mandatory locks held on them.
1628 error = locks_verify_locked(inode);
1629 if (!error) {
1630 DQUOT_INIT(inode);
1632 error = do_truncate(dentry, 0,
1633 ATTR_MTIME|ATTR_CTIME|ATTR_OPEN,
1634 NULL);
1636 put_write_access(inode);
1637 if (error)
1638 return error;
1639 } else
1640 if (flag & FMODE_WRITE)
1641 DQUOT_INIT(inode);
1643 return 0;
1646 static int open_namei_create(struct nameidata *nd, struct path *path,
1647 int flag, int mode)
1649 int error;
1650 struct dentry *dir = nd->dentry;
1652 if (!IS_POSIXACL(dir->d_inode))
1653 mode &= ~current->fs->umask;
1654 error = vfs_create(dir->d_inode, path->dentry, mode, nd);
1655 mutex_unlock(&dir->d_inode->i_mutex);
1656 dput(nd->dentry);
1657 nd->dentry = path->dentry;
1658 if (error)
1659 return error;
1660 /* Don't check for write permission, don't truncate */
1661 return may_open(nd, 0, flag & ~O_TRUNC);
1665 * open_namei()
1667 * namei for open - this is in fact almost the whole open-routine.
1669 * Note that the low bits of "flag" aren't the same as in the open
1670 * system call - they are 00 - no permissions needed
1671 * 01 - read permission needed
1672 * 10 - write permission needed
1673 * 11 - read/write permissions needed
1674 * which is a lot more logical, and also allows the "no perm" needed
1675 * for symlinks (where the permissions are checked later).
1676 * SMP-safe
1678 int open_namei(int dfd, const char *pathname, int flag,
1679 int mode, struct nameidata *nd)
1681 int acc_mode, error;
1682 struct path path;
1683 struct dentry *dir;
1684 int count = 0;
1686 acc_mode = ACC_MODE(flag);
1688 /* O_TRUNC implies we need access checks for write permissions */
1689 if (flag & O_TRUNC)
1690 acc_mode |= MAY_WRITE;
1692 /* Allow the LSM permission hook to distinguish append
1693 access from general write access. */
1694 if (flag & O_APPEND)
1695 acc_mode |= MAY_APPEND;
1698 * The simplest case - just a plain lookup.
1700 if (!(flag & O_CREAT)) {
1701 error = path_lookup_open(dfd, pathname, lookup_flags(flag),
1702 nd, flag);
1703 if (error)
1704 return error;
1705 goto ok;
1709 * Create - we need to know the parent.
1711 error = path_lookup_create(dfd,pathname,LOOKUP_PARENT,nd,flag,mode);
1712 if (error)
1713 return error;
1716 * We have the parent and last component. First of all, check
1717 * that we are not asked to creat(2) an obvious directory - that
1718 * will not do.
1720 error = -EISDIR;
1721 if (nd->last_type != LAST_NORM || nd->last.name[nd->last.len])
1722 goto exit;
1724 dir = nd->dentry;
1725 nd->flags &= ~LOOKUP_PARENT;
1726 mutex_lock(&dir->d_inode->i_mutex);
1727 path.dentry = lookup_hash(nd);
1728 path.mnt = nd->mnt;
1730 do_last:
1731 error = PTR_ERR(path.dentry);
1732 if (IS_ERR(path.dentry)) {
1733 mutex_unlock(&dir->d_inode->i_mutex);
1734 goto exit;
1737 if (IS_ERR(nd->intent.open.file)) {
1738 mutex_unlock(&dir->d_inode->i_mutex);
1739 error = PTR_ERR(nd->intent.open.file);
1740 goto exit_dput;
1743 /* Negative dentry, just create the file */
1744 if (!path.dentry->d_inode) {
1745 error = open_namei_create(nd, &path, flag, mode);
1746 if (error)
1747 goto exit;
1748 return 0;
1752 * It already exists.
1754 mutex_unlock(&dir->d_inode->i_mutex);
1755 audit_inode(pathname, path.dentry->d_inode);
1757 error = -EEXIST;
1758 if (flag & O_EXCL)
1759 goto exit_dput;
1761 if (__follow_mount(&path)) {
1762 error = -ELOOP;
1763 if (flag & O_NOFOLLOW)
1764 goto exit_dput;
1767 error = -ENOENT;
1768 if (!path.dentry->d_inode)
1769 goto exit_dput;
1770 if (path.dentry->d_inode->i_op && path.dentry->d_inode->i_op->follow_link)
1771 goto do_link;
1773 path_to_nameidata(&path, nd);
1774 error = -EISDIR;
1775 if (path.dentry->d_inode && S_ISDIR(path.dentry->d_inode->i_mode))
1776 goto exit;
1778 error = may_open(nd, acc_mode, flag);
1779 if (error)
1780 goto exit;
1781 return 0;
1783 exit_dput:
1784 dput_path(&path, nd);
1785 exit:
1786 if (!IS_ERR(nd->intent.open.file))
1787 release_open_intent(nd);
1788 path_release(nd);
1789 return error;
1791 do_link:
1792 error = -ELOOP;
1793 if (flag & O_NOFOLLOW)
1794 goto exit_dput;
1796 * This is subtle. Instead of calling do_follow_link() we do the
1797 * thing by hands. The reason is that this way we have zero link_count
1798 * and path_walk() (called from ->follow_link) honoring LOOKUP_PARENT.
1799 * After that we have the parent and last component, i.e.
1800 * we are in the same situation as after the first path_walk().
1801 * Well, almost - if the last component is normal we get its copy
1802 * stored in nd->last.name and we will have to putname() it when we
1803 * are done. Procfs-like symlinks just set LAST_BIND.
1805 nd->flags |= LOOKUP_PARENT;
1806 error = security_inode_follow_link(path.dentry, nd);
1807 if (error)
1808 goto exit_dput;
1809 error = __do_follow_link(&path, nd);
1810 if (error) {
1811 /* Does someone understand code flow here? Or it is only
1812 * me so stupid? Anathema to whoever designed this non-sense
1813 * with "intent.open".
1815 release_open_intent(nd);
1816 return error;
1818 nd->flags &= ~LOOKUP_PARENT;
1819 if (nd->last_type == LAST_BIND)
1820 goto ok;
1821 error = -EISDIR;
1822 if (nd->last_type != LAST_NORM)
1823 goto exit;
1824 if (nd->last.name[nd->last.len]) {
1825 __putname(nd->last.name);
1826 goto exit;
1828 error = -ELOOP;
1829 if (count++==32) {
1830 __putname(nd->last.name);
1831 goto exit;
1833 dir = nd->dentry;
1834 mutex_lock(&dir->d_inode->i_mutex);
1835 path.dentry = lookup_hash(nd);
1836 path.mnt = nd->mnt;
1837 __putname(nd->last.name);
1838 goto do_last;
1842 * lookup_create - lookup a dentry, creating it if it doesn't exist
1843 * @nd: nameidata info
1844 * @is_dir: directory flag
1846 * Simple function to lookup and return a dentry and create it
1847 * if it doesn't exist. Is SMP-safe.
1849 * Returns with nd->dentry->d_inode->i_mutex locked.
1851 struct dentry *lookup_create(struct nameidata *nd, int is_dir)
1853 struct dentry *dentry = ERR_PTR(-EEXIST);
1855 mutex_lock_nested(&nd->dentry->d_inode->i_mutex, I_MUTEX_PARENT);
1857 * Yucky last component or no last component at all?
1858 * (foo/., foo/.., /////)
1860 if (nd->last_type != LAST_NORM)
1861 goto fail;
1862 nd->flags &= ~LOOKUP_PARENT;
1863 nd->flags |= LOOKUP_CREATE;
1864 nd->intent.open.flags = O_EXCL;
1867 * Do the final lookup.
1869 dentry = lookup_hash(nd);
1870 if (IS_ERR(dentry))
1871 goto fail;
1874 * Special case - lookup gave negative, but... we had foo/bar/
1875 * From the vfs_mknod() POV we just have a negative dentry -
1876 * all is fine. Let's be bastards - you had / on the end, you've
1877 * been asking for (non-existent) directory. -ENOENT for you.
1879 if (!is_dir && nd->last.name[nd->last.len] && !dentry->d_inode)
1880 goto enoent;
1881 return dentry;
1882 enoent:
1883 dput(dentry);
1884 dentry = ERR_PTR(-ENOENT);
1885 fail:
1886 return dentry;
1888 EXPORT_SYMBOL_GPL(lookup_create);
1890 int vfs_mknod(struct inode *dir, struct dentry *dentry, int mode, dev_t dev)
1892 int error = may_create(dir, dentry, NULL);
1894 if (error)
1895 return error;
1897 if ((S_ISCHR(mode) || S_ISBLK(mode)) && !capable(CAP_MKNOD))
1898 return -EPERM;
1900 if (!dir->i_op || !dir->i_op->mknod)
1901 return -EPERM;
1903 error = security_inode_mknod(dir, dentry, mode, dev);
1904 if (error)
1905 return error;
1907 DQUOT_INIT(dir);
1908 error = dir->i_op->mknod(dir, dentry, mode, dev);
1909 if (!error)
1910 fsnotify_create(dir, dentry);
1911 return error;
1914 asmlinkage long sys_mknodat(int dfd, const char __user *filename, int mode,
1915 unsigned dev)
1917 int error = 0;
1918 char * tmp;
1919 struct dentry * dentry;
1920 struct nameidata nd;
1922 if (S_ISDIR(mode))
1923 return -EPERM;
1924 tmp = getname(filename);
1925 if (IS_ERR(tmp))
1926 return PTR_ERR(tmp);
1928 error = do_path_lookup(dfd, tmp, LOOKUP_PARENT, &nd);
1929 if (error)
1930 goto out;
1931 dentry = lookup_create(&nd, 0);
1932 error = PTR_ERR(dentry);
1934 if (!IS_POSIXACL(nd.dentry->d_inode))
1935 mode &= ~current->fs->umask;
1936 if (!IS_ERR(dentry)) {
1937 switch (mode & S_IFMT) {
1938 case 0: case S_IFREG:
1939 error = vfs_create(nd.dentry->d_inode,dentry,mode,&nd);
1940 break;
1941 case S_IFCHR: case S_IFBLK:
1942 error = vfs_mknod(nd.dentry->d_inode,dentry,mode,
1943 new_decode_dev(dev));
1944 break;
1945 case S_IFIFO: case S_IFSOCK:
1946 error = vfs_mknod(nd.dentry->d_inode,dentry,mode,0);
1947 break;
1948 case S_IFDIR:
1949 error = -EPERM;
1950 break;
1951 default:
1952 error = -EINVAL;
1954 dput(dentry);
1956 mutex_unlock(&nd.dentry->d_inode->i_mutex);
1957 path_release(&nd);
1958 out:
1959 putname(tmp);
1961 return error;
1964 asmlinkage long sys_mknod(const char __user *filename, int mode, unsigned dev)
1966 return sys_mknodat(AT_FDCWD, filename, mode, dev);
1969 int vfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
1971 int error = may_create(dir, dentry, NULL);
1973 if (error)
1974 return error;
1976 if (!dir->i_op || !dir->i_op->mkdir)
1977 return -EPERM;
1979 mode &= (S_IRWXUGO|S_ISVTX);
1980 error = security_inode_mkdir(dir, dentry, mode);
1981 if (error)
1982 return error;
1984 DQUOT_INIT(dir);
1985 error = dir->i_op->mkdir(dir, dentry, mode);
1986 if (!error)
1987 fsnotify_mkdir(dir, dentry);
1988 return error;
1991 asmlinkage long sys_mkdirat(int dfd, const char __user *pathname, int mode)
1993 int error = 0;
1994 char * tmp;
1995 struct dentry *dentry;
1996 struct nameidata nd;
1998 tmp = getname(pathname);
1999 error = PTR_ERR(tmp);
2000 if (IS_ERR(tmp))
2001 goto out_err;
2003 error = do_path_lookup(dfd, tmp, LOOKUP_PARENT, &nd);
2004 if (error)
2005 goto out;
2006 dentry = lookup_create(&nd, 1);
2007 error = PTR_ERR(dentry);
2008 if (IS_ERR(dentry))
2009 goto out_unlock;
2011 if (!IS_POSIXACL(nd.dentry->d_inode))
2012 mode &= ~current->fs->umask;
2013 error = vfs_mkdir(nd.dentry->d_inode, dentry, mode);
2014 dput(dentry);
2015 out_unlock:
2016 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2017 path_release(&nd);
2018 out:
2019 putname(tmp);
2020 out_err:
2021 return error;
2024 asmlinkage long sys_mkdir(const char __user *pathname, int mode)
2026 return sys_mkdirat(AT_FDCWD, pathname, mode);
2030 * We try to drop the dentry early: we should have
2031 * a usage count of 2 if we're the only user of this
2032 * dentry, and if that is true (possibly after pruning
2033 * the dcache), then we drop the dentry now.
2035 * A low-level filesystem can, if it choses, legally
2036 * do a
2038 * if (!d_unhashed(dentry))
2039 * return -EBUSY;
2041 * if it cannot handle the case of removing a directory
2042 * that is still in use by something else..
2044 void dentry_unhash(struct dentry *dentry)
2046 dget(dentry);
2047 shrink_dcache_parent(dentry);
2048 spin_lock(&dcache_lock);
2049 spin_lock(&dentry->d_lock);
2050 if (atomic_read(&dentry->d_count) == 2)
2051 __d_drop(dentry);
2052 spin_unlock(&dentry->d_lock);
2053 spin_unlock(&dcache_lock);
2056 int vfs_rmdir(struct inode *dir, struct dentry *dentry)
2058 int error = may_delete(dir, dentry, 1);
2060 if (error)
2061 return error;
2063 if (!dir->i_op || !dir->i_op->rmdir)
2064 return -EPERM;
2066 DQUOT_INIT(dir);
2068 mutex_lock(&dentry->d_inode->i_mutex);
2069 dentry_unhash(dentry);
2070 if (d_mountpoint(dentry))
2071 error = -EBUSY;
2072 else {
2073 error = security_inode_rmdir(dir, dentry);
2074 if (!error) {
2075 error = dir->i_op->rmdir(dir, dentry);
2076 if (!error)
2077 dentry->d_inode->i_flags |= S_DEAD;
2080 mutex_unlock(&dentry->d_inode->i_mutex);
2081 if (!error) {
2082 d_delete(dentry);
2084 dput(dentry);
2086 return error;
2089 static long do_rmdir(int dfd, const char __user *pathname)
2091 int error = 0;
2092 char * name;
2093 struct dentry *dentry;
2094 struct nameidata nd;
2096 name = getname(pathname);
2097 if(IS_ERR(name))
2098 return PTR_ERR(name);
2100 error = do_path_lookup(dfd, name, LOOKUP_PARENT, &nd);
2101 if (error)
2102 goto exit;
2104 switch(nd.last_type) {
2105 case LAST_DOTDOT:
2106 error = -ENOTEMPTY;
2107 goto exit1;
2108 case LAST_DOT:
2109 error = -EINVAL;
2110 goto exit1;
2111 case LAST_ROOT:
2112 error = -EBUSY;
2113 goto exit1;
2115 mutex_lock_nested(&nd.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2116 dentry = lookup_hash(&nd);
2117 error = PTR_ERR(dentry);
2118 if (IS_ERR(dentry))
2119 goto exit2;
2120 error = vfs_rmdir(nd.dentry->d_inode, dentry);
2121 dput(dentry);
2122 exit2:
2123 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2124 exit1:
2125 path_release(&nd);
2126 exit:
2127 putname(name);
2128 return error;
2131 asmlinkage long sys_rmdir(const char __user *pathname)
2133 return do_rmdir(AT_FDCWD, pathname);
2136 int vfs_unlink(struct inode *dir, struct dentry *dentry)
2138 int error = may_delete(dir, dentry, 0);
2140 if (error)
2141 return error;
2143 if (!dir->i_op || !dir->i_op->unlink)
2144 return -EPERM;
2146 DQUOT_INIT(dir);
2148 mutex_lock(&dentry->d_inode->i_mutex);
2149 if (d_mountpoint(dentry))
2150 error = -EBUSY;
2151 else {
2152 error = security_inode_unlink(dir, dentry);
2153 if (!error)
2154 error = dir->i_op->unlink(dir, dentry);
2156 mutex_unlock(&dentry->d_inode->i_mutex);
2158 /* We don't d_delete() NFS sillyrenamed files--they still exist. */
2159 if (!error && !(dentry->d_flags & DCACHE_NFSFS_RENAMED)) {
2160 d_delete(dentry);
2163 return error;
2167 * Make sure that the actual truncation of the file will occur outside its
2168 * directory's i_mutex. Truncate can take a long time if there is a lot of
2169 * writeout happening, and we don't want to prevent access to the directory
2170 * while waiting on the I/O.
2172 static long do_unlinkat(int dfd, const char __user *pathname)
2174 int error = 0;
2175 char * name;
2176 struct dentry *dentry;
2177 struct nameidata nd;
2178 struct inode *inode = NULL;
2180 name = getname(pathname);
2181 if(IS_ERR(name))
2182 return PTR_ERR(name);
2184 error = do_path_lookup(dfd, name, LOOKUP_PARENT, &nd);
2185 if (error)
2186 goto exit;
2187 error = -EISDIR;
2188 if (nd.last_type != LAST_NORM)
2189 goto exit1;
2190 mutex_lock_nested(&nd.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2191 dentry = lookup_hash(&nd);
2192 error = PTR_ERR(dentry);
2193 if (!IS_ERR(dentry)) {
2194 /* Why not before? Because we want correct error value */
2195 if (nd.last.name[nd.last.len])
2196 goto slashes;
2197 inode = dentry->d_inode;
2198 if (inode)
2199 atomic_inc(&inode->i_count);
2200 error = vfs_unlink(nd.dentry->d_inode, dentry);
2201 exit2:
2202 dput(dentry);
2204 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2205 if (inode)
2206 iput(inode); /* truncate the inode here */
2207 exit1:
2208 path_release(&nd);
2209 exit:
2210 putname(name);
2211 return error;
2213 slashes:
2214 error = !dentry->d_inode ? -ENOENT :
2215 S_ISDIR(dentry->d_inode->i_mode) ? -EISDIR : -ENOTDIR;
2216 goto exit2;
2219 asmlinkage long sys_unlinkat(int dfd, const char __user *pathname, int flag)
2221 if ((flag & ~AT_REMOVEDIR) != 0)
2222 return -EINVAL;
2224 if (flag & AT_REMOVEDIR)
2225 return do_rmdir(dfd, pathname);
2227 return do_unlinkat(dfd, pathname);
2230 asmlinkage long sys_unlink(const char __user *pathname)
2232 return do_unlinkat(AT_FDCWD, pathname);
2235 int vfs_symlink(struct inode *dir, struct dentry *dentry, const char *oldname, int mode)
2237 int error = may_create(dir, dentry, NULL);
2239 if (error)
2240 return error;
2242 if (!dir->i_op || !dir->i_op->symlink)
2243 return -EPERM;
2245 error = security_inode_symlink(dir, dentry, oldname);
2246 if (error)
2247 return error;
2249 DQUOT_INIT(dir);
2250 error = dir->i_op->symlink(dir, dentry, oldname);
2251 if (!error)
2252 fsnotify_create(dir, dentry);
2253 return error;
2256 asmlinkage long sys_symlinkat(const char __user *oldname,
2257 int newdfd, const char __user *newname)
2259 int error = 0;
2260 char * from;
2261 char * to;
2262 struct dentry *dentry;
2263 struct nameidata nd;
2265 from = getname(oldname);
2266 if(IS_ERR(from))
2267 return PTR_ERR(from);
2268 to = getname(newname);
2269 error = PTR_ERR(to);
2270 if (IS_ERR(to))
2271 goto out_putname;
2273 error = do_path_lookup(newdfd, to, LOOKUP_PARENT, &nd);
2274 if (error)
2275 goto out;
2276 dentry = lookup_create(&nd, 0);
2277 error = PTR_ERR(dentry);
2278 if (IS_ERR(dentry))
2279 goto out_unlock;
2281 error = vfs_symlink(nd.dentry->d_inode, dentry, from, S_IALLUGO);
2282 dput(dentry);
2283 out_unlock:
2284 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2285 path_release(&nd);
2286 out:
2287 putname(to);
2288 out_putname:
2289 putname(from);
2290 return error;
2293 asmlinkage long sys_symlink(const char __user *oldname, const char __user *newname)
2295 return sys_symlinkat(oldname, AT_FDCWD, newname);
2298 int vfs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *new_dentry)
2300 struct inode *inode = old_dentry->d_inode;
2301 int error;
2303 if (!inode)
2304 return -ENOENT;
2306 error = may_create(dir, new_dentry, NULL);
2307 if (error)
2308 return error;
2310 if (dir->i_sb != inode->i_sb)
2311 return -EXDEV;
2314 * A link to an append-only or immutable file cannot be created.
2316 if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
2317 return -EPERM;
2318 if (!dir->i_op || !dir->i_op->link)
2319 return -EPERM;
2320 if (S_ISDIR(old_dentry->d_inode->i_mode))
2321 return -EPERM;
2323 error = security_inode_link(old_dentry, dir, new_dentry);
2324 if (error)
2325 return error;
2327 mutex_lock(&old_dentry->d_inode->i_mutex);
2328 DQUOT_INIT(dir);
2329 error = dir->i_op->link(old_dentry, dir, new_dentry);
2330 mutex_unlock(&old_dentry->d_inode->i_mutex);
2331 if (!error)
2332 fsnotify_create(dir, new_dentry);
2333 return error;
2337 * Hardlinks are often used in delicate situations. We avoid
2338 * security-related surprises by not following symlinks on the
2339 * newname. --KAB
2341 * We don't follow them on the oldname either to be compatible
2342 * with linux 2.0, and to avoid hard-linking to directories
2343 * and other special files. --ADM
2345 asmlinkage long sys_linkat(int olddfd, const char __user *oldname,
2346 int newdfd, const char __user *newname,
2347 int flags)
2349 struct dentry *new_dentry;
2350 struct nameidata nd, old_nd;
2351 int error;
2352 char * to;
2354 if ((flags & ~AT_SYMLINK_FOLLOW) != 0)
2355 return -EINVAL;
2357 to = getname(newname);
2358 if (IS_ERR(to))
2359 return PTR_ERR(to);
2361 error = __user_walk_fd(olddfd, oldname,
2362 flags & AT_SYMLINK_FOLLOW ? LOOKUP_FOLLOW : 0,
2363 &old_nd);
2364 if (error)
2365 goto exit;
2366 error = do_path_lookup(newdfd, to, LOOKUP_PARENT, &nd);
2367 if (error)
2368 goto out;
2369 error = -EXDEV;
2370 if (old_nd.mnt != nd.mnt)
2371 goto out_release;
2372 new_dentry = lookup_create(&nd, 0);
2373 error = PTR_ERR(new_dentry);
2374 if (IS_ERR(new_dentry))
2375 goto out_unlock;
2376 error = vfs_link(old_nd.dentry, nd.dentry->d_inode, new_dentry);
2377 dput(new_dentry);
2378 out_unlock:
2379 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2380 out_release:
2381 path_release(&nd);
2382 out:
2383 path_release(&old_nd);
2384 exit:
2385 putname(to);
2387 return error;
2390 asmlinkage long sys_link(const char __user *oldname, const char __user *newname)
2392 return sys_linkat(AT_FDCWD, oldname, AT_FDCWD, newname, 0);
2396 * The worst of all namespace operations - renaming directory. "Perverted"
2397 * doesn't even start to describe it. Somebody in UCB had a heck of a trip...
2398 * Problems:
2399 * a) we can get into loop creation. Check is done in is_subdir().
2400 * b) race potential - two innocent renames can create a loop together.
2401 * That's where 4.4 screws up. Current fix: serialization on
2402 * sb->s_vfs_rename_mutex. We might be more accurate, but that's another
2403 * story.
2404 * c) we have to lock _three_ objects - parents and victim (if it exists).
2405 * And that - after we got ->i_mutex on parents (until then we don't know
2406 * whether the target exists). Solution: try to be smart with locking
2407 * order for inodes. We rely on the fact that tree topology may change
2408 * only under ->s_vfs_rename_mutex _and_ that parent of the object we
2409 * move will be locked. Thus we can rank directories by the tree
2410 * (ancestors first) and rank all non-directories after them.
2411 * That works since everybody except rename does "lock parent, lookup,
2412 * lock child" and rename is under ->s_vfs_rename_mutex.
2413 * HOWEVER, it relies on the assumption that any object with ->lookup()
2414 * has no more than 1 dentry. If "hybrid" objects will ever appear,
2415 * we'd better make sure that there's no link(2) for them.
2416 * d) some filesystems don't support opened-but-unlinked directories,
2417 * either because of layout or because they are not ready to deal with
2418 * all cases correctly. The latter will be fixed (taking this sort of
2419 * stuff into VFS), but the former is not going away. Solution: the same
2420 * trick as in rmdir().
2421 * e) conversion from fhandle to dentry may come in the wrong moment - when
2422 * we are removing the target. Solution: we will have to grab ->i_mutex
2423 * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on
2424 * ->i_mutex on parents, which works but leads to some truely excessive
2425 * locking].
2427 static int vfs_rename_dir(struct inode *old_dir, struct dentry *old_dentry,
2428 struct inode *new_dir, struct dentry *new_dentry)
2430 int error = 0;
2431 struct inode *target;
2434 * If we are going to change the parent - check write permissions,
2435 * we'll need to flip '..'.
2437 if (new_dir != old_dir) {
2438 error = permission(old_dentry->d_inode, MAY_WRITE, NULL);
2439 if (error)
2440 return error;
2443 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2444 if (error)
2445 return error;
2447 target = new_dentry->d_inode;
2448 if (target) {
2449 mutex_lock(&target->i_mutex);
2450 dentry_unhash(new_dentry);
2452 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2453 error = -EBUSY;
2454 else
2455 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2456 if (target) {
2457 if (!error)
2458 target->i_flags |= S_DEAD;
2459 mutex_unlock(&target->i_mutex);
2460 if (d_unhashed(new_dentry))
2461 d_rehash(new_dentry);
2462 dput(new_dentry);
2464 if (!error)
2465 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
2466 d_move(old_dentry,new_dentry);
2467 return error;
2470 static int vfs_rename_other(struct inode *old_dir, struct dentry *old_dentry,
2471 struct inode *new_dir, struct dentry *new_dentry)
2473 struct inode *target;
2474 int error;
2476 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2477 if (error)
2478 return error;
2480 dget(new_dentry);
2481 target = new_dentry->d_inode;
2482 if (target)
2483 mutex_lock(&target->i_mutex);
2484 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2485 error = -EBUSY;
2486 else
2487 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2488 if (!error) {
2489 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
2490 d_move(old_dentry, new_dentry);
2492 if (target)
2493 mutex_unlock(&target->i_mutex);
2494 dput(new_dentry);
2495 return error;
2498 int vfs_rename(struct inode *old_dir, struct dentry *old_dentry,
2499 struct inode *new_dir, struct dentry *new_dentry)
2501 int error;
2502 int is_dir = S_ISDIR(old_dentry->d_inode->i_mode);
2503 const char *old_name;
2505 if (old_dentry->d_inode == new_dentry->d_inode)
2506 return 0;
2508 error = may_delete(old_dir, old_dentry, is_dir);
2509 if (error)
2510 return error;
2512 if (!new_dentry->d_inode)
2513 error = may_create(new_dir, new_dentry, NULL);
2514 else
2515 error = may_delete(new_dir, new_dentry, is_dir);
2516 if (error)
2517 return error;
2519 if (!old_dir->i_op || !old_dir->i_op->rename)
2520 return -EPERM;
2522 DQUOT_INIT(old_dir);
2523 DQUOT_INIT(new_dir);
2525 old_name = fsnotify_oldname_init(old_dentry->d_name.name);
2527 if (is_dir)
2528 error = vfs_rename_dir(old_dir,old_dentry,new_dir,new_dentry);
2529 else
2530 error = vfs_rename_other(old_dir,old_dentry,new_dir,new_dentry);
2531 if (!error) {
2532 const char *new_name = old_dentry->d_name.name;
2533 fsnotify_move(old_dir, new_dir, old_name, new_name, is_dir,
2534 new_dentry->d_inode, old_dentry->d_inode);
2536 fsnotify_oldname_free(old_name);
2538 return error;
2541 static int do_rename(int olddfd, const char *oldname,
2542 int newdfd, const char *newname)
2544 int error = 0;
2545 struct dentry * old_dir, * new_dir;
2546 struct dentry * old_dentry, *new_dentry;
2547 struct dentry * trap;
2548 struct nameidata oldnd, newnd;
2550 error = do_path_lookup(olddfd, oldname, LOOKUP_PARENT, &oldnd);
2551 if (error)
2552 goto exit;
2554 error = do_path_lookup(newdfd, newname, LOOKUP_PARENT, &newnd);
2555 if (error)
2556 goto exit1;
2558 error = -EXDEV;
2559 if (oldnd.mnt != newnd.mnt)
2560 goto exit2;
2562 old_dir = oldnd.dentry;
2563 error = -EBUSY;
2564 if (oldnd.last_type != LAST_NORM)
2565 goto exit2;
2567 new_dir = newnd.dentry;
2568 if (newnd.last_type != LAST_NORM)
2569 goto exit2;
2571 trap = lock_rename(new_dir, old_dir);
2573 old_dentry = lookup_hash(&oldnd);
2574 error = PTR_ERR(old_dentry);
2575 if (IS_ERR(old_dentry))
2576 goto exit3;
2577 /* source must exist */
2578 error = -ENOENT;
2579 if (!old_dentry->d_inode)
2580 goto exit4;
2581 /* unless the source is a directory trailing slashes give -ENOTDIR */
2582 if (!S_ISDIR(old_dentry->d_inode->i_mode)) {
2583 error = -ENOTDIR;
2584 if (oldnd.last.name[oldnd.last.len])
2585 goto exit4;
2586 if (newnd.last.name[newnd.last.len])
2587 goto exit4;
2589 /* source should not be ancestor of target */
2590 error = -EINVAL;
2591 if (old_dentry == trap)
2592 goto exit4;
2593 new_dentry = lookup_hash(&newnd);
2594 error = PTR_ERR(new_dentry);
2595 if (IS_ERR(new_dentry))
2596 goto exit4;
2597 /* target should not be an ancestor of source */
2598 error = -ENOTEMPTY;
2599 if (new_dentry == trap)
2600 goto exit5;
2602 error = vfs_rename(old_dir->d_inode, old_dentry,
2603 new_dir->d_inode, new_dentry);
2604 exit5:
2605 dput(new_dentry);
2606 exit4:
2607 dput(old_dentry);
2608 exit3:
2609 unlock_rename(new_dir, old_dir);
2610 exit2:
2611 path_release(&newnd);
2612 exit1:
2613 path_release(&oldnd);
2614 exit:
2615 return error;
2618 asmlinkage long sys_renameat(int olddfd, const char __user *oldname,
2619 int newdfd, const char __user *newname)
2621 int error;
2622 char * from;
2623 char * to;
2625 from = getname(oldname);
2626 if(IS_ERR(from))
2627 return PTR_ERR(from);
2628 to = getname(newname);
2629 error = PTR_ERR(to);
2630 if (!IS_ERR(to)) {
2631 error = do_rename(olddfd, from, newdfd, to);
2632 putname(to);
2634 putname(from);
2635 return error;
2638 asmlinkage long sys_rename(const char __user *oldname, const char __user *newname)
2640 return sys_renameat(AT_FDCWD, oldname, AT_FDCWD, newname);
2643 int vfs_readlink(struct dentry *dentry, char __user *buffer, int buflen, const char *link)
2645 int len;
2647 len = PTR_ERR(link);
2648 if (IS_ERR(link))
2649 goto out;
2651 len = strlen(link);
2652 if (len > (unsigned) buflen)
2653 len = buflen;
2654 if (copy_to_user(buffer, link, len))
2655 len = -EFAULT;
2656 out:
2657 return len;
2661 * A helper for ->readlink(). This should be used *ONLY* for symlinks that
2662 * have ->follow_link() touching nd only in nd_set_link(). Using (or not
2663 * using) it for any given inode is up to filesystem.
2665 int generic_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2667 struct nameidata nd;
2668 void *cookie;
2670 nd.depth = 0;
2671 cookie = dentry->d_inode->i_op->follow_link(dentry, &nd);
2672 if (!IS_ERR(cookie)) {
2673 int res = vfs_readlink(dentry, buffer, buflen, nd_get_link(&nd));
2674 if (dentry->d_inode->i_op->put_link)
2675 dentry->d_inode->i_op->put_link(dentry, &nd, cookie);
2676 cookie = ERR_PTR(res);
2678 return PTR_ERR(cookie);
2681 int vfs_follow_link(struct nameidata *nd, const char *link)
2683 return __vfs_follow_link(nd, link);
2686 /* get the link contents into pagecache */
2687 static char *page_getlink(struct dentry * dentry, struct page **ppage)
2689 struct page * page;
2690 struct address_space *mapping = dentry->d_inode->i_mapping;
2691 page = read_mapping_page(mapping, 0, NULL);
2692 if (IS_ERR(page))
2693 return (char*)page;
2694 *ppage = page;
2695 return kmap(page);
2698 int page_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2700 struct page *page = NULL;
2701 char *s = page_getlink(dentry, &page);
2702 int res = vfs_readlink(dentry,buffer,buflen,s);
2703 if (page) {
2704 kunmap(page);
2705 page_cache_release(page);
2707 return res;
2710 void *page_follow_link_light(struct dentry *dentry, struct nameidata *nd)
2712 struct page *page = NULL;
2713 nd_set_link(nd, page_getlink(dentry, &page));
2714 return page;
2717 void page_put_link(struct dentry *dentry, struct nameidata *nd, void *cookie)
2719 struct page *page = cookie;
2721 if (page) {
2722 kunmap(page);
2723 page_cache_release(page);
2727 int __page_symlink(struct inode *inode, const char *symname, int len,
2728 gfp_t gfp_mask)
2730 struct address_space *mapping = inode->i_mapping;
2731 struct page *page;
2732 int err;
2733 char *kaddr;
2735 retry:
2736 err = -ENOMEM;
2737 page = find_or_create_page(mapping, 0, gfp_mask);
2738 if (!page)
2739 goto fail;
2740 err = mapping->a_ops->prepare_write(NULL, page, 0, len-1);
2741 if (err == AOP_TRUNCATED_PAGE) {
2742 page_cache_release(page);
2743 goto retry;
2745 if (err)
2746 goto fail_map;
2747 kaddr = kmap_atomic(page, KM_USER0);
2748 memcpy(kaddr, symname, len-1);
2749 kunmap_atomic(kaddr, KM_USER0);
2750 err = mapping->a_ops->commit_write(NULL, page, 0, len-1);
2751 if (err == AOP_TRUNCATED_PAGE) {
2752 page_cache_release(page);
2753 goto retry;
2755 if (err)
2756 goto fail_map;
2758 * Notice that we are _not_ going to block here - end of page is
2759 * unmapped, so this will only try to map the rest of page, see
2760 * that it is unmapped (typically even will not look into inode -
2761 * ->i_size will be enough for everything) and zero it out.
2762 * OTOH it's obviously correct and should make the page up-to-date.
2764 if (!PageUptodate(page)) {
2765 err = mapping->a_ops->readpage(NULL, page);
2766 if (err != AOP_TRUNCATED_PAGE)
2767 wait_on_page_locked(page);
2768 } else {
2769 unlock_page(page);
2771 page_cache_release(page);
2772 if (err < 0)
2773 goto fail;
2774 mark_inode_dirty(inode);
2775 return 0;
2776 fail_map:
2777 unlock_page(page);
2778 page_cache_release(page);
2779 fail:
2780 return err;
2783 int page_symlink(struct inode *inode, const char *symname, int len)
2785 return __page_symlink(inode, symname, len,
2786 mapping_gfp_mask(inode->i_mapping));
2789 const struct inode_operations page_symlink_inode_operations = {
2790 .readlink = generic_readlink,
2791 .follow_link = page_follow_link_light,
2792 .put_link = page_put_link,
2795 EXPORT_SYMBOL(__user_walk);
2796 EXPORT_SYMBOL(__user_walk_fd);
2797 EXPORT_SYMBOL(follow_down);
2798 EXPORT_SYMBOL(follow_up);
2799 EXPORT_SYMBOL(get_write_access); /* binfmt_aout */
2800 EXPORT_SYMBOL(getname);
2801 EXPORT_SYMBOL(lock_rename);
2802 EXPORT_SYMBOL(lookup_one_len);
2803 EXPORT_SYMBOL(page_follow_link_light);
2804 EXPORT_SYMBOL(page_put_link);
2805 EXPORT_SYMBOL(page_readlink);
2806 EXPORT_SYMBOL(__page_symlink);
2807 EXPORT_SYMBOL(page_symlink);
2808 EXPORT_SYMBOL(page_symlink_inode_operations);
2809 EXPORT_SYMBOL(path_lookup);
2810 EXPORT_SYMBOL(vfs_path_lookup);
2811 EXPORT_SYMBOL(path_release);
2812 EXPORT_SYMBOL(path_walk);
2813 EXPORT_SYMBOL(permission);
2814 EXPORT_SYMBOL(vfs_permission);
2815 EXPORT_SYMBOL(file_permission);
2816 EXPORT_SYMBOL(unlock_rename);
2817 EXPORT_SYMBOL(vfs_create);
2818 EXPORT_SYMBOL(vfs_follow_link);
2819 EXPORT_SYMBOL(vfs_link);
2820 EXPORT_SYMBOL(vfs_mkdir);
2821 EXPORT_SYMBOL(vfs_mknod);
2822 EXPORT_SYMBOL(generic_permission);
2823 EXPORT_SYMBOL(vfs_readlink);
2824 EXPORT_SYMBOL(vfs_rename);
2825 EXPORT_SYMBOL(vfs_rmdir);
2826 EXPORT_SYMBOL(vfs_symlink);
2827 EXPORT_SYMBOL(vfs_unlink);
2828 EXPORT_SYMBOL(dentry_unhash);
2829 EXPORT_SYMBOL(generic_readlink);