radix-tree-avoid-atomic-allocations-for-preloaded-insertions
[linux-2.6/linux-trees-mm.git] / fs / namei.c
blob14f9861b093728110a75444643591645e554cbab
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 <asm/namei.h>
34 #include <asm/uaccess.h>
36 #define ACC_MODE(x) ("\000\004\002\006"[(x)&O_ACCMODE])
38 /* [Feb-1997 T. Schoebel-Theuer]
39 * Fundamental changes in the pathname lookup mechanisms (namei)
40 * were necessary because of omirr. The reason is that omirr needs
41 * to know the _real_ pathname, not the user-supplied one, in case
42 * of symlinks (and also when transname replacements occur).
44 * The new code replaces the old recursive symlink resolution with
45 * an iterative one (in case of non-nested symlink chains). It does
46 * this with calls to <fs>_follow_link().
47 * As a side effect, dir_namei(), _namei() and follow_link() are now
48 * replaced with a single function lookup_dentry() that can handle all
49 * the special cases of the former code.
51 * With the new dcache, the pathname is stored at each inode, at least as
52 * long as the refcount of the inode is positive. As a side effect, the
53 * size of the dcache depends on the inode cache and thus is dynamic.
55 * [29-Apr-1998 C. Scott Ananian] Updated above description of symlink
56 * resolution to correspond with current state of the code.
58 * Note that the symlink resolution is not *completely* iterative.
59 * There is still a significant amount of tail- and mid- recursion in
60 * the algorithm. Also, note that <fs>_readlink() is not used in
61 * lookup_dentry(): lookup_dentry() on the result of <fs>_readlink()
62 * may return different results than <fs>_follow_link(). Many virtual
63 * filesystems (including /proc) exhibit this behavior.
66 /* [24-Feb-97 T. Schoebel-Theuer] Side effects caused by new implementation:
67 * New symlink semantics: when open() is called with flags O_CREAT | O_EXCL
68 * and the name already exists in form of a symlink, try to create the new
69 * name indicated by the symlink. The old code always complained that the
70 * name already exists, due to not following the symlink even if its target
71 * is nonexistent. The new semantics affects also mknod() and link() when
72 * the name is a symlink pointing to a non-existant name.
74 * I don't know which semantics is the right one, since I have no access
75 * to standards. But I found by trial that HP-UX 9.0 has the full "new"
76 * semantics implemented, while SunOS 4.1.1 and Solaris (SunOS 5.4) have the
77 * "old" one. Personally, I think the new semantics is much more logical.
78 * Note that "ln old new" where "new" is a symlink pointing to a non-existing
79 * file does succeed in both HP-UX and SunOs, but not in Solaris
80 * and in the old Linux semantics.
83 /* [16-Dec-97 Kevin Buhr] For security reasons, we change some symlink
84 * semantics. See the comments in "open_namei" and "do_link" below.
86 * [10-Sep-98 Alan Modra] Another symlink change.
89 /* [Feb-Apr 2000 AV] Complete rewrite. Rules for symlinks:
90 * inside the path - always follow.
91 * in the last component in creation/removal/renaming - never follow.
92 * if LOOKUP_FOLLOW passed - follow.
93 * if the pathname has trailing slashes - follow.
94 * otherwise - don't follow.
95 * (applied in that order).
97 * [Jun 2000 AV] Inconsistent behaviour of open() in case if flags==O_CREAT
98 * restored for 2.4. This is the last surviving part of old 4.2BSD bug.
99 * During the 2.4 we need to fix the userland stuff depending on it -
100 * hopefully we will be able to get rid of that wart in 2.5. So far only
101 * XEmacs seems to be relying on it...
104 * [Sep 2001 AV] Single-semaphore locking scheme (kudos to David Holland)
105 * implemented. Let's see if raised priority of ->s_vfs_rename_mutex gives
106 * any extra contention...
109 static int fastcall link_path_walk(const char *name, struct nameidata *nd);
111 /* In order to reduce some races, while at the same time doing additional
112 * checking and hopefully speeding things up, we copy filenames to the
113 * kernel data space before using them..
115 * POSIX.1 2.4: an empty pathname is invalid (ENOENT).
116 * PATH_MAX includes the nul terminator --RR.
118 static int do_getname(const char __user *filename, char *page)
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 if (current->fsuid == inode->i_uid)
188 mode >>= 6;
189 else {
190 if (IS_POSIXACL(inode) && (mode & S_IRWXG) && check_acl) {
191 int error = check_acl(inode, mask);
192 if (error == -EACCES)
193 goto check_capabilities;
194 else if (error != -EAGAIN)
195 return error;
198 if (in_group_p(inode->i_gid))
199 mode >>= 3;
203 * If the DACs are ok we don't need any capability check.
205 if (((mode & mask & (MAY_READ|MAY_WRITE|MAY_EXEC)) == mask))
206 return 0;
208 check_capabilities:
210 * Read/write DACs are always overridable.
211 * Executable DACs are overridable if at least one exec bit is set.
213 if (!(mask & MAY_EXEC) ||
214 (inode->i_mode & S_IXUGO) || S_ISDIR(inode->i_mode))
215 if (capable(CAP_DAC_OVERRIDE))
216 return 0;
219 * Searching includes executable on directories, else just read.
221 if (mask == MAY_READ || (S_ISDIR(inode->i_mode) && !(mask & MAY_WRITE)))
222 if (capable(CAP_DAC_READ_SEARCH))
223 return 0;
225 return -EACCES;
228 int permission(struct inode *inode, int mask, struct nameidata *nd)
230 int retval, submask;
231 struct vfsmount *mnt = NULL;
233 if (nd)
234 mnt = nd->mnt;
236 if (mask & MAY_WRITE) {
237 umode_t mode = inode->i_mode;
240 * Nobody gets write access to a read-only fs.
242 if (IS_RDONLY(inode) &&
243 (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode)))
244 return -EROFS;
247 * Nobody gets write access to an immutable file.
249 if (IS_IMMUTABLE(inode))
250 return -EACCES;
253 if ((mask & MAY_EXEC) && S_ISREG(inode->i_mode)) {
255 * MAY_EXEC on regular files is denied if the fs is mounted
256 * with the "noexec" flag.
258 if (mnt && (mnt->mnt_flags & MNT_NOEXEC))
259 return -EACCES;
262 /* Ordinary permission routines do not understand MAY_APPEND. */
263 submask = mask & ~MAY_APPEND;
264 if (inode->i_op && inode->i_op->permission) {
265 retval = inode->i_op->permission(inode, submask, nd);
266 if (!retval) {
268 * Exec permission on a regular file is denied if none
269 * of the execute bits are set.
271 * This check should be done by the ->permission()
272 * method.
274 if ((mask & MAY_EXEC) && S_ISREG(inode->i_mode) &&
275 !(inode->i_mode & S_IXUGO))
276 return -EACCES;
278 } else {
279 retval = generic_permission(inode, submask, NULL);
281 if (retval)
282 return retval;
284 return security_inode_permission(inode, mask, nd);
288 * vfs_permission - check for access rights to a given path
289 * @nd: lookup result that describes the path
290 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
292 * Used to check for read/write/execute permissions on a path.
293 * We use "fsuid" for this, letting us set arbitrary permissions
294 * for filesystem access without changing the "normal" uids which
295 * are used for other things.
297 int vfs_permission(struct nameidata *nd, int mask)
299 return permission(nd->dentry->d_inode, mask, nd);
303 * file_permission - check for additional access rights to a given file
304 * @file: file to check access rights for
305 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
307 * Used to check for read/write/execute permissions on an already opened
308 * file.
310 * Note:
311 * Do not use this function in new code. All access checks should
312 * be done using vfs_permission().
314 int file_permission(struct file *file, int mask)
316 return permission(file->f_path.dentry->d_inode, mask, NULL);
320 * get_write_access() gets write permission for a file.
321 * put_write_access() releases this write permission.
322 * This is used for regular files.
323 * We cannot support write (and maybe mmap read-write shared) accesses and
324 * MAP_DENYWRITE mmappings simultaneously. The i_writecount field of an inode
325 * can have the following values:
326 * 0: no writers, no VM_DENYWRITE mappings
327 * < 0: (-i_writecount) vm_area_structs with VM_DENYWRITE set exist
328 * > 0: (i_writecount) users are writing to the file.
330 * Normally we operate on that counter with atomic_{inc,dec} and it's safe
331 * except for the cases where we don't hold i_writecount yet. Then we need to
332 * use {get,deny}_write_access() - these functions check the sign and refuse
333 * to do the change if sign is wrong. Exclusion between them is provided by
334 * the inode->i_lock spinlock.
337 int get_write_access(struct inode * inode)
339 spin_lock(&inode->i_lock);
340 if (atomic_read(&inode->i_writecount) < 0) {
341 spin_unlock(&inode->i_lock);
342 return -ETXTBSY;
344 atomic_inc(&inode->i_writecount);
345 spin_unlock(&inode->i_lock);
347 return 0;
350 int deny_write_access(struct file * file)
352 struct inode *inode = file->f_path.dentry->d_inode;
354 spin_lock(&inode->i_lock);
355 if (atomic_read(&inode->i_writecount) > 0) {
356 spin_unlock(&inode->i_lock);
357 return -ETXTBSY;
359 atomic_dec(&inode->i_writecount);
360 spin_unlock(&inode->i_lock);
362 return 0;
365 void path_release(struct nameidata *nd)
367 dput(nd->dentry);
368 mntput(nd->mnt);
372 * umount() mustn't call path_release()/mntput() as that would clear
373 * mnt_expiry_mark
375 void path_release_on_umount(struct nameidata *nd)
377 dput(nd->dentry);
378 mntput_no_expire(nd->mnt);
382 * release_open_intent - free up open intent resources
383 * @nd: pointer to nameidata
385 void release_open_intent(struct nameidata *nd)
387 if (nd->intent.open.file->f_path.dentry == NULL)
388 put_filp(nd->intent.open.file);
389 else
390 fput(nd->intent.open.file);
392 EXPORT_SYMBOL(release_open_intent);
394 static inline struct dentry *
395 do_revalidate(struct dentry *dentry, struct nameidata *nd)
397 int status = dentry->d_op->d_revalidate(dentry, nd);
398 if (unlikely(status <= 0)) {
400 * The dentry failed validation.
401 * If d_revalidate returned 0 attempt to invalidate
402 * the dentry otherwise d_revalidate is asking us
403 * to return a fail status.
405 if (!status) {
406 if (!d_invalidate(dentry)) {
407 dput(dentry);
408 dentry = NULL;
410 } else {
411 dput(dentry);
412 dentry = ERR_PTR(status);
415 return dentry;
419 * Internal lookup() using the new generic dcache.
420 * SMP-safe
422 static struct dentry * cached_lookup(struct dentry * parent, struct qstr * name, struct nameidata *nd)
424 struct dentry * dentry = __d_lookup(parent, name);
426 /* lockess __d_lookup may fail due to concurrent d_move()
427 * in some unrelated directory, so try with d_lookup
429 if (!dentry)
430 dentry = d_lookup(parent, name);
432 if (dentry && dentry->d_op && dentry->d_op->d_revalidate)
433 dentry = do_revalidate(dentry, nd);
435 return dentry;
439 * Short-cut version of permission(), for calling by
440 * path_walk(), when dcache lock is held. Combines parts
441 * of permission() and generic_permission(), and tests ONLY for
442 * MAY_EXEC permission.
444 * If appropriate, check DAC only. If not appropriate, or
445 * short-cut DAC fails, then call permission() to do more
446 * complete permission check.
448 static int exec_permission_lite(struct inode *inode,
449 struct nameidata *nd)
451 umode_t mode = inode->i_mode;
453 if (inode->i_op && inode->i_op->permission)
454 return -EAGAIN;
456 if (current->fsuid == inode->i_uid)
457 mode >>= 6;
458 else if (in_group_p(inode->i_gid))
459 mode >>= 3;
461 if (mode & MAY_EXEC)
462 goto ok;
464 if ((inode->i_mode & S_IXUGO) && capable(CAP_DAC_OVERRIDE))
465 goto ok;
467 if (S_ISDIR(inode->i_mode) && capable(CAP_DAC_OVERRIDE))
468 goto ok;
470 if (S_ISDIR(inode->i_mode) && capable(CAP_DAC_READ_SEARCH))
471 goto ok;
473 return -EACCES;
475 return security_inode_permission(inode, MAY_EXEC, nd);
479 * This is called when everything else fails, and we actually have
480 * to go to the low-level filesystem to find out what we should do..
482 * We get the directory semaphore, and after getting that we also
483 * make sure that nobody added the entry to the dcache in the meantime..
484 * SMP-safe
486 static struct dentry * real_lookup(struct dentry * parent, struct qstr * name, struct nameidata *nd)
488 struct dentry * result;
489 struct inode *dir = parent->d_inode;
491 mutex_lock(&dir->i_mutex);
493 * First re-do the cached lookup just in case it was created
494 * while we waited for the directory semaphore..
496 * FIXME! This could use version numbering or similar to
497 * avoid unnecessary cache lookups.
499 * The "dcache_lock" is purely to protect the RCU list walker
500 * from concurrent renames at this point (we mustn't get false
501 * negatives from the RCU list walk here, unlike the optimistic
502 * fast walk).
504 * so doing d_lookup() (with seqlock), instead of lockfree __d_lookup
506 result = d_lookup(parent, name);
507 if (!result) {
508 struct dentry * dentry = d_alloc(parent, name);
509 result = ERR_PTR(-ENOMEM);
510 if (dentry) {
511 result = dir->i_op->lookup(dir, dentry, nd);
512 if (result)
513 dput(dentry);
514 else
515 result = dentry;
517 mutex_unlock(&dir->i_mutex);
518 return result;
522 * Uhhuh! Nasty case: the cache was re-populated while
523 * we waited on the semaphore. Need to revalidate.
525 mutex_unlock(&dir->i_mutex);
526 if (result->d_op && result->d_op->d_revalidate) {
527 result = do_revalidate(result, nd);
528 if (!result)
529 result = ERR_PTR(-ENOENT);
531 return result;
534 static int __emul_lookup_dentry(const char *, struct nameidata *);
536 /* SMP-safe */
537 static __always_inline int
538 walk_init_root(const char *name, struct nameidata *nd)
540 struct fs_struct *fs = current->fs;
542 read_lock(&fs->lock);
543 if (fs->altroot && !(nd->flags & LOOKUP_NOALT)) {
544 nd->mnt = mntget(fs->altrootmnt);
545 nd->dentry = dget(fs->altroot);
546 read_unlock(&fs->lock);
547 if (__emul_lookup_dentry(name,nd))
548 return 0;
549 read_lock(&fs->lock);
551 nd->mnt = mntget(fs->rootmnt);
552 nd->dentry = dget(fs->root);
553 read_unlock(&fs->lock);
554 return 1;
557 static __always_inline int __vfs_follow_link(struct nameidata *nd, const char *link)
559 int res = 0;
560 char *name;
561 if (IS_ERR(link))
562 goto fail;
564 if (*link == '/') {
565 path_release(nd);
566 if (!walk_init_root(link, nd))
567 /* weird __emul_prefix() stuff did it */
568 goto out;
570 res = link_path_walk(link, nd);
571 out:
572 if (nd->depth || res || nd->last_type!=LAST_NORM)
573 return res;
575 * If it is an iterative symlinks resolution in open_namei() we
576 * have to copy the last component. And all that crap because of
577 * bloody create() on broken symlinks. Furrfu...
579 name = __getname();
580 if (unlikely(!name)) {
581 path_release(nd);
582 return -ENOMEM;
584 strcpy(name, nd->last.name);
585 nd->last.name = name;
586 return 0;
587 fail:
588 path_release(nd);
589 return PTR_ERR(link);
592 static inline void dput_path(struct path *path, struct nameidata *nd)
594 dput(path->dentry);
595 if (path->mnt != nd->mnt)
596 mntput(path->mnt);
599 static inline void path_to_nameidata(struct path *path, struct nameidata *nd)
601 dput(nd->dentry);
602 if (nd->mnt != path->mnt)
603 mntput(nd->mnt);
604 nd->mnt = path->mnt;
605 nd->dentry = path->dentry;
608 static __always_inline int __do_follow_link(struct path *path, struct nameidata *nd)
610 int error;
611 void *cookie;
612 struct dentry *dentry = path->dentry;
614 touch_atime(path->mnt, dentry);
615 nd_set_link(nd, NULL);
617 if (path->mnt != nd->mnt) {
618 path_to_nameidata(path, nd);
619 dget(dentry);
621 mntget(path->mnt);
622 cookie = dentry->d_inode->i_op->follow_link(dentry, nd);
623 error = PTR_ERR(cookie);
624 if (!IS_ERR(cookie)) {
625 char *s = nd_get_link(nd);
626 error = 0;
627 if (s)
628 error = __vfs_follow_link(nd, s);
629 if (dentry->d_inode->i_op->put_link)
630 dentry->d_inode->i_op->put_link(dentry, nd, cookie);
632 dput(dentry);
633 mntput(path->mnt);
635 return error;
639 * This limits recursive symlink follows to 8, while
640 * limiting consecutive symlinks to 40.
642 * Without that kind of total limit, nasty chains of consecutive
643 * symlinks can cause almost arbitrarily long lookups.
645 static inline int do_follow_link(struct path *path, struct nameidata *nd)
647 int err = -ELOOP;
648 if (current->link_count >= MAX_NESTED_LINKS)
649 goto loop;
650 if (current->total_link_count >= 40)
651 goto loop;
652 BUG_ON(nd->depth >= MAX_NESTED_LINKS);
653 cond_resched();
654 err = security_inode_follow_link(path->dentry, nd);
655 if (err)
656 goto loop;
657 current->link_count++;
658 current->total_link_count++;
659 nd->depth++;
660 err = __do_follow_link(path, nd);
661 current->link_count--;
662 nd->depth--;
663 return err;
664 loop:
665 dput_path(path, nd);
666 path_release(nd);
667 return err;
670 int follow_up(struct vfsmount **mnt, struct dentry **dentry)
672 struct vfsmount *parent;
673 struct dentry *mountpoint;
674 spin_lock(&vfsmount_lock);
675 parent=(*mnt)->mnt_parent;
676 if (parent == *mnt) {
677 spin_unlock(&vfsmount_lock);
678 return 0;
680 mntget(parent);
681 mountpoint=dget((*mnt)->mnt_mountpoint);
682 spin_unlock(&vfsmount_lock);
683 dput(*dentry);
684 *dentry = mountpoint;
685 mntput(*mnt);
686 *mnt = parent;
687 return 1;
690 /* no need for dcache_lock, as serialization is taken care in
691 * namespace.c
693 static int __follow_mount(struct path *path)
695 int res = 0;
696 while (d_mountpoint(path->dentry)) {
697 struct vfsmount *mounted = lookup_mnt(path->mnt, path->dentry);
698 if (!mounted)
699 break;
700 dput(path->dentry);
701 if (res)
702 mntput(path->mnt);
703 path->mnt = mounted;
704 path->dentry = dget(mounted->mnt_root);
705 res = 1;
707 return res;
710 static void follow_mount(struct vfsmount **mnt, struct dentry **dentry)
712 while (d_mountpoint(*dentry)) {
713 struct vfsmount *mounted = lookup_mnt(*mnt, *dentry);
714 if (!mounted)
715 break;
716 dput(*dentry);
717 mntput(*mnt);
718 *mnt = mounted;
719 *dentry = dget(mounted->mnt_root);
723 /* no need for dcache_lock, as serialization is taken care in
724 * namespace.c
726 int follow_down(struct vfsmount **mnt, struct dentry **dentry)
728 struct vfsmount *mounted;
730 mounted = lookup_mnt(*mnt, *dentry);
731 if (mounted) {
732 dput(*dentry);
733 mntput(*mnt);
734 *mnt = mounted;
735 *dentry = dget(mounted->mnt_root);
736 return 1;
738 return 0;
741 static __always_inline void follow_dotdot(struct nameidata *nd)
743 struct fs_struct *fs = current->fs;
745 while(1) {
746 struct vfsmount *parent;
747 struct dentry *old = nd->dentry;
749 read_lock(&fs->lock);
750 if (nd->dentry == fs->root &&
751 nd->mnt == fs->rootmnt) {
752 read_unlock(&fs->lock);
753 break;
755 read_unlock(&fs->lock);
756 spin_lock(&dcache_lock);
757 if (nd->dentry != nd->mnt->mnt_root) {
758 nd->dentry = dget(nd->dentry->d_parent);
759 spin_unlock(&dcache_lock);
760 dput(old);
761 break;
763 spin_unlock(&dcache_lock);
764 spin_lock(&vfsmount_lock);
765 parent = nd->mnt->mnt_parent;
766 if (parent == nd->mnt) {
767 spin_unlock(&vfsmount_lock);
768 break;
770 mntget(parent);
771 nd->dentry = dget(nd->mnt->mnt_mountpoint);
772 spin_unlock(&vfsmount_lock);
773 dput(old);
774 mntput(nd->mnt);
775 nd->mnt = parent;
777 follow_mount(&nd->mnt, &nd->dentry);
781 * It's more convoluted than I'd like it to be, but... it's still fairly
782 * small and for now I'd prefer to have fast path as straight as possible.
783 * It _is_ time-critical.
785 static int do_lookup(struct nameidata *nd, struct qstr *name,
786 struct path *path)
788 struct vfsmount *mnt = nd->mnt;
789 struct dentry *dentry = __d_lookup(nd->dentry, name);
791 if (!dentry)
792 goto need_lookup;
793 if (dentry->d_op && dentry->d_op->d_revalidate)
794 goto need_revalidate;
795 done:
796 path->mnt = mnt;
797 path->dentry = dentry;
798 __follow_mount(path);
799 return 0;
801 need_lookup:
802 dentry = real_lookup(nd->dentry, name, nd);
803 if (IS_ERR(dentry))
804 goto fail;
805 goto done;
807 need_revalidate:
808 dentry = do_revalidate(dentry, nd);
809 if (!dentry)
810 goto need_lookup;
811 if (IS_ERR(dentry))
812 goto fail;
813 goto done;
815 fail:
816 return PTR_ERR(dentry);
820 * Name resolution.
821 * This is the basic name resolution function, turning a pathname into
822 * the final dentry. We expect 'base' to be positive and a directory.
824 * Returns 0 and nd will have valid dentry and mnt on success.
825 * Returns error and drops reference to input namei data on failure.
827 static fastcall int __link_path_walk(const char * name, struct nameidata *nd)
829 struct path next;
830 struct inode *inode;
831 int err;
832 unsigned int lookup_flags = nd->flags;
834 while (*name=='/')
835 name++;
836 if (!*name)
837 goto return_reval;
839 inode = nd->dentry->d_inode;
840 if (nd->depth)
841 lookup_flags = LOOKUP_FOLLOW | (nd->flags & LOOKUP_CONTINUE);
843 /* At this point we know we have a real path component. */
844 for(;;) {
845 unsigned long hash;
846 struct qstr this;
847 unsigned int c;
849 nd->flags |= LOOKUP_CONTINUE;
850 err = exec_permission_lite(inode, nd);
851 if (err == -EAGAIN)
852 err = vfs_permission(nd, MAY_EXEC);
853 if (err)
854 break;
856 this.name = name;
857 c = *(const unsigned char *)name;
859 hash = init_name_hash();
860 do {
861 name++;
862 hash = partial_name_hash(c, hash);
863 c = *(const unsigned char *)name;
864 } while (c && (c != '/'));
865 this.len = name - (const char *) this.name;
866 this.hash = end_name_hash(hash);
868 /* remove trailing slashes? */
869 if (!c)
870 goto last_component;
871 while (*++name == '/');
872 if (!*name)
873 goto last_with_slashes;
876 * "." and ".." are special - ".." especially so because it has
877 * to be able to know about the current root directory and
878 * parent relationships.
880 if (this.name[0] == '.') switch (this.len) {
881 default:
882 break;
883 case 2:
884 if (this.name[1] != '.')
885 break;
886 follow_dotdot(nd);
887 inode = nd->dentry->d_inode;
888 /* fallthrough */
889 case 1:
890 continue;
893 * See if the low-level filesystem might want
894 * to use its own hash..
896 if (nd->dentry->d_op && nd->dentry->d_op->d_hash) {
897 err = nd->dentry->d_op->d_hash(nd->dentry, &this);
898 if (err < 0)
899 break;
901 /* This does the actual lookups.. */
902 err = do_lookup(nd, &this, &next);
903 if (err)
904 break;
906 err = -ENOENT;
907 inode = next.dentry->d_inode;
908 if (!inode)
909 goto out_dput;
910 err = -ENOTDIR;
911 if (!inode->i_op)
912 goto out_dput;
914 if (inode->i_op->follow_link) {
915 err = do_follow_link(&next, nd);
916 if (err)
917 goto return_err;
918 err = -ENOENT;
919 inode = nd->dentry->d_inode;
920 if (!inode)
921 break;
922 err = -ENOTDIR;
923 if (!inode->i_op)
924 break;
925 } else
926 path_to_nameidata(&next, nd);
927 err = -ENOTDIR;
928 if (!inode->i_op->lookup)
929 break;
930 continue;
931 /* here ends the main loop */
933 last_with_slashes:
934 lookup_flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY;
935 last_component:
936 /* Clear LOOKUP_CONTINUE iff it was previously unset */
937 nd->flags &= lookup_flags | ~LOOKUP_CONTINUE;
938 if (lookup_flags & LOOKUP_PARENT)
939 goto lookup_parent;
940 if (this.name[0] == '.') switch (this.len) {
941 default:
942 break;
943 case 2:
944 if (this.name[1] != '.')
945 break;
946 follow_dotdot(nd);
947 inode = nd->dentry->d_inode;
948 /* fallthrough */
949 case 1:
950 goto return_reval;
952 if (nd->dentry->d_op && nd->dentry->d_op->d_hash) {
953 err = nd->dentry->d_op->d_hash(nd->dentry, &this);
954 if (err < 0)
955 break;
957 err = do_lookup(nd, &this, &next);
958 if (err)
959 break;
960 inode = next.dentry->d_inode;
961 if ((lookup_flags & LOOKUP_FOLLOW)
962 && inode && inode->i_op && inode->i_op->follow_link) {
963 err = do_follow_link(&next, nd);
964 if (err)
965 goto return_err;
966 inode = nd->dentry->d_inode;
967 } else
968 path_to_nameidata(&next, nd);
969 err = -ENOENT;
970 if (!inode)
971 break;
972 if (lookup_flags & LOOKUP_DIRECTORY) {
973 err = -ENOTDIR;
974 if (!inode->i_op || !inode->i_op->lookup)
975 break;
977 goto return_base;
978 lookup_parent:
979 nd->last = this;
980 nd->last_type = LAST_NORM;
981 if (this.name[0] != '.')
982 goto return_base;
983 if (this.len == 1)
984 nd->last_type = LAST_DOT;
985 else if (this.len == 2 && this.name[1] == '.')
986 nd->last_type = LAST_DOTDOT;
987 else
988 goto return_base;
989 return_reval:
991 * We bypassed the ordinary revalidation routines.
992 * We may need to check the cached dentry for staleness.
994 if (nd->dentry && nd->dentry->d_sb &&
995 (nd->dentry->d_sb->s_type->fs_flags & FS_REVAL_DOT)) {
996 err = -ESTALE;
997 /* Note: we do not d_invalidate() */
998 if (!nd->dentry->d_op->d_revalidate(nd->dentry, nd))
999 break;
1001 return_base:
1002 return 0;
1003 out_dput:
1004 dput_path(&next, nd);
1005 break;
1007 path_release(nd);
1008 return_err:
1009 return err;
1013 * Wrapper to retry pathname resolution whenever the underlying
1014 * file system returns an ESTALE.
1016 * Retry the whole path once, forcing real lookup requests
1017 * instead of relying on the dcache.
1019 static int fastcall link_path_walk(const char *name, struct nameidata *nd)
1021 struct nameidata save = *nd;
1022 int result;
1024 /* make sure the stuff we saved doesn't go away */
1025 dget(save.dentry);
1026 mntget(save.mnt);
1028 result = __link_path_walk(name, nd);
1029 if (result == -ESTALE) {
1030 *nd = save;
1031 dget(nd->dentry);
1032 mntget(nd->mnt);
1033 nd->flags |= LOOKUP_REVAL;
1034 result = __link_path_walk(name, nd);
1037 dput(save.dentry);
1038 mntput(save.mnt);
1040 return result;
1043 static int fastcall path_walk(const char * name, struct nameidata *nd)
1045 current->total_link_count = 0;
1046 return link_path_walk(name, nd);
1050 * SMP-safe: Returns 1 and nd will have valid dentry and mnt, if
1051 * everything is done. Returns 0 and drops input nd, if lookup failed;
1053 static int __emul_lookup_dentry(const char *name, struct nameidata *nd)
1055 if (path_walk(name, nd))
1056 return 0; /* something went wrong... */
1058 if (!nd->dentry->d_inode || S_ISDIR(nd->dentry->d_inode->i_mode)) {
1059 struct dentry *old_dentry = nd->dentry;
1060 struct vfsmount *old_mnt = nd->mnt;
1061 struct qstr last = nd->last;
1062 int last_type = nd->last_type;
1063 struct fs_struct *fs = current->fs;
1066 * NAME was not found in alternate root or it's a directory.
1067 * Try to find it in the normal root:
1069 nd->last_type = LAST_ROOT;
1070 read_lock(&fs->lock);
1071 nd->mnt = mntget(fs->rootmnt);
1072 nd->dentry = dget(fs->root);
1073 read_unlock(&fs->lock);
1074 if (path_walk(name, nd) == 0) {
1075 if (nd->dentry->d_inode) {
1076 dput(old_dentry);
1077 mntput(old_mnt);
1078 return 1;
1080 path_release(nd);
1082 nd->dentry = old_dentry;
1083 nd->mnt = old_mnt;
1084 nd->last = last;
1085 nd->last_type = last_type;
1087 return 1;
1090 void set_fs_altroot(void)
1092 char *emul = __emul_prefix();
1093 struct nameidata nd;
1094 struct vfsmount *mnt = NULL, *oldmnt;
1095 struct dentry *dentry = NULL, *olddentry;
1096 int err;
1097 struct fs_struct *fs = current->fs;
1099 if (!emul)
1100 goto set_it;
1101 err = path_lookup(emul, LOOKUP_FOLLOW|LOOKUP_DIRECTORY|LOOKUP_NOALT, &nd);
1102 if (!err) {
1103 mnt = nd.mnt;
1104 dentry = nd.dentry;
1106 set_it:
1107 write_lock(&fs->lock);
1108 oldmnt = fs->altrootmnt;
1109 olddentry = fs->altroot;
1110 fs->altrootmnt = mnt;
1111 fs->altroot = dentry;
1112 write_unlock(&fs->lock);
1113 if (olddentry) {
1114 dput(olddentry);
1115 mntput(oldmnt);
1119 /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
1120 static int fastcall do_path_lookup(int dfd, const char *name,
1121 unsigned int flags, struct nameidata *nd)
1123 int retval = 0;
1124 int fput_needed;
1125 struct file *file;
1126 struct fs_struct *fs = current->fs;
1128 nd->last_type = LAST_ROOT; /* if there are only slashes... */
1129 nd->flags = flags;
1130 nd->depth = 0;
1132 if (*name=='/') {
1133 read_lock(&fs->lock);
1134 if (fs->altroot && !(nd->flags & LOOKUP_NOALT)) {
1135 nd->mnt = mntget(fs->altrootmnt);
1136 nd->dentry = dget(fs->altroot);
1137 read_unlock(&fs->lock);
1138 if (__emul_lookup_dentry(name,nd))
1139 goto out; /* found in altroot */
1140 read_lock(&fs->lock);
1142 nd->mnt = mntget(fs->rootmnt);
1143 nd->dentry = dget(fs->root);
1144 read_unlock(&fs->lock);
1145 } else if (dfd == AT_FDCWD) {
1146 read_lock(&fs->lock);
1147 nd->mnt = mntget(fs->pwdmnt);
1148 nd->dentry = dget(fs->pwd);
1149 read_unlock(&fs->lock);
1150 } else {
1151 struct dentry *dentry;
1153 file = fget_light(dfd, &fput_needed);
1154 retval = -EBADF;
1155 if (!file)
1156 goto out_fail;
1158 dentry = file->f_path.dentry;
1160 retval = -ENOTDIR;
1161 if (!S_ISDIR(dentry->d_inode->i_mode))
1162 goto fput_fail;
1164 retval = file_permission(file, MAY_EXEC);
1165 if (retval)
1166 goto fput_fail;
1168 nd->mnt = mntget(file->f_path.mnt);
1169 nd->dentry = dget(dentry);
1171 fput_light(file, fput_needed);
1174 retval = path_walk(name, nd);
1175 out:
1176 if (unlikely(!retval && !audit_dummy_context() && nd->dentry &&
1177 nd->dentry->d_inode))
1178 audit_inode(name, nd->dentry);
1179 out_fail:
1180 return retval;
1182 fput_fail:
1183 fput_light(file, fput_needed);
1184 goto out_fail;
1187 int fastcall path_lookup(const char *name, unsigned int flags,
1188 struct nameidata *nd)
1190 return do_path_lookup(AT_FDCWD, name, flags, nd);
1194 * vfs_path_lookup - lookup a file path relative to a dentry-vfsmount pair
1195 * @dentry: pointer to dentry of the base directory
1196 * @mnt: pointer to vfs mount of the base directory
1197 * @name: pointer to file name
1198 * @flags: lookup flags
1199 * @nd: pointer to nameidata
1201 int vfs_path_lookup(struct dentry *dentry, struct vfsmount *mnt,
1202 const char *name, unsigned int flags,
1203 struct nameidata *nd)
1205 int retval;
1207 /* same as do_path_lookup */
1208 nd->last_type = LAST_ROOT;
1209 nd->flags = flags;
1210 nd->depth = 0;
1212 nd->mnt = mntget(mnt);
1213 nd->dentry = dget(dentry);
1215 retval = path_walk(name, nd);
1216 if (unlikely(!retval && !audit_dummy_context() && nd->dentry &&
1217 nd->dentry->d_inode))
1218 audit_inode(name, nd->dentry);
1220 return retval;
1224 static int __path_lookup_intent_open(int dfd, const char *name,
1225 unsigned int lookup_flags, struct nameidata *nd,
1226 int open_flags, int create_mode)
1228 struct file *filp = get_empty_filp();
1229 int err;
1231 if (filp == NULL)
1232 return -ENFILE;
1233 nd->intent.open.file = filp;
1234 nd->intent.open.flags = open_flags;
1235 nd->intent.open.create_mode = create_mode;
1236 err = do_path_lookup(dfd, name, lookup_flags|LOOKUP_OPEN, nd);
1237 if (IS_ERR(nd->intent.open.file)) {
1238 if (err == 0) {
1239 err = PTR_ERR(nd->intent.open.file);
1240 path_release(nd);
1242 } else if (err != 0)
1243 release_open_intent(nd);
1244 return err;
1248 * path_lookup_open - lookup a file path with open intent
1249 * @dfd: the directory to use as base, or AT_FDCWD
1250 * @name: pointer to file name
1251 * @lookup_flags: lookup intent flags
1252 * @nd: pointer to nameidata
1253 * @open_flags: open intent flags
1255 int path_lookup_open(int dfd, const char *name, unsigned int lookup_flags,
1256 struct nameidata *nd, int open_flags)
1258 return __path_lookup_intent_open(dfd, name, lookup_flags, nd,
1259 open_flags, 0);
1263 * path_lookup_create - lookup a file path with open + create intent
1264 * @dfd: the directory to use as base, or AT_FDCWD
1265 * @name: pointer to file name
1266 * @lookup_flags: lookup intent flags
1267 * @nd: pointer to nameidata
1268 * @open_flags: open intent flags
1269 * @create_mode: create intent flags
1271 static int path_lookup_create(int dfd, const char *name,
1272 unsigned int lookup_flags, struct nameidata *nd,
1273 int open_flags, int create_mode)
1275 return __path_lookup_intent_open(dfd, name, lookup_flags|LOOKUP_CREATE,
1276 nd, open_flags, create_mode);
1279 int __user_path_lookup_open(const char __user *name, unsigned int lookup_flags,
1280 struct nameidata *nd, int open_flags)
1282 char *tmp = getname(name);
1283 int err = PTR_ERR(tmp);
1285 if (!IS_ERR(tmp)) {
1286 err = __path_lookup_intent_open(AT_FDCWD, tmp, lookup_flags, nd, open_flags, 0);
1287 putname(tmp);
1289 return err;
1292 static struct dentry *__lookup_hash(struct qstr *name,
1293 struct dentry *base, struct nameidata *nd)
1295 struct dentry *dentry;
1296 struct inode *inode;
1297 int err;
1299 inode = base->d_inode;
1302 * See if the low-level filesystem might want
1303 * to use its own hash..
1305 if (base->d_op && base->d_op->d_hash) {
1306 err = base->d_op->d_hash(base, name);
1307 dentry = ERR_PTR(err);
1308 if (err < 0)
1309 goto out;
1312 dentry = cached_lookup(base, name, nd);
1313 if (!dentry) {
1314 struct dentry *new = d_alloc(base, name);
1315 dentry = ERR_PTR(-ENOMEM);
1316 if (!new)
1317 goto out;
1318 dentry = inode->i_op->lookup(inode, new, nd);
1319 if (!dentry)
1320 dentry = new;
1321 else
1322 dput(new);
1324 out:
1325 return dentry;
1329 * Restricted form of lookup. Doesn't follow links, single-component only,
1330 * needs parent already locked. Doesn't follow mounts.
1331 * SMP-safe.
1333 static struct dentry *lookup_hash(struct nameidata *nd)
1335 int err;
1337 err = permission(nd->dentry->d_inode, MAY_EXEC, nd);
1338 if (err)
1339 return ERR_PTR(err);
1340 return __lookup_hash(&nd->last, nd->dentry, nd);
1343 static int __lookup_one_len(const char *name, struct qstr *this,
1344 struct dentry *base, int len)
1346 unsigned long hash;
1347 unsigned int c;
1349 this->name = name;
1350 this->len = len;
1351 if (!len)
1352 return -EACCES;
1354 hash = init_name_hash();
1355 while (len--) {
1356 c = *(const unsigned char *)name++;
1357 if (c == '/' || c == '\0')
1358 return -EACCES;
1359 hash = partial_name_hash(c, hash);
1361 this->hash = end_name_hash(hash);
1362 return 0;
1366 * lookup_one_len: filesystem helper to lookup single pathname component
1367 * @name: pathname component to lookup
1368 * @base: base directory to lookup from
1369 * @len: maximum length @len should be interpreted to
1371 * Note that this routine is purely a helper for filesystem useage and should
1372 * not be called by generic code. Also note that by using this function to
1373 * nameidata argument is passed to the filesystem methods and a filesystem
1374 * using this helper needs to be prepared for that.
1376 struct dentry *lookup_one_len(const char *name, struct dentry *base, int len)
1378 int err;
1379 struct qstr this;
1381 err = __lookup_one_len(name, &this, base, len);
1382 if (err)
1383 return ERR_PTR(err);
1385 err = permission(base->d_inode, MAY_EXEC, NULL);
1386 if (err)
1387 return ERR_PTR(err);
1388 return __lookup_hash(&this, base, NULL);
1392 * lookup_one_noperm - bad hack for sysfs
1393 * @name: pathname component to lookup
1394 * @base: base directory to lookup from
1396 * This is a variant of lookup_one_len that doesn't perform any permission
1397 * checks. It's a horrible hack to work around the braindead sysfs
1398 * architecture and should not be used anywhere else.
1400 * DON'T USE THIS FUNCTION EVER, thanks.
1402 struct dentry *lookup_one_noperm(const char *name, struct dentry *base)
1404 int err;
1405 struct qstr this;
1407 err = __lookup_one_len(name, &this, base, strlen(name));
1408 if (err)
1409 return ERR_PTR(err);
1410 return __lookup_hash(&this, base, NULL);
1413 int fastcall __user_walk_fd(int dfd, const char __user *name, unsigned flags,
1414 struct nameidata *nd)
1416 char *tmp = getname(name);
1417 int err = PTR_ERR(tmp);
1419 if (!IS_ERR(tmp)) {
1420 err = do_path_lookup(dfd, tmp, flags, nd);
1421 putname(tmp);
1423 return err;
1426 int fastcall __user_walk(const char __user *name, unsigned flags, struct nameidata *nd)
1428 return __user_walk_fd(AT_FDCWD, name, flags, nd);
1432 * It's inline, so penalty for filesystems that don't use sticky bit is
1433 * minimal.
1435 static inline int check_sticky(struct inode *dir, struct inode *inode)
1437 if (!(dir->i_mode & S_ISVTX))
1438 return 0;
1439 if (inode->i_uid == current->fsuid)
1440 return 0;
1441 if (dir->i_uid == current->fsuid)
1442 return 0;
1443 return !capable(CAP_FOWNER);
1447 * Check whether we can remove a link victim from directory dir, check
1448 * whether the type of victim is right.
1449 * 1. We can't do it if dir is read-only (done in permission())
1450 * 2. We should have write and exec permissions on dir
1451 * 3. We can't remove anything from append-only dir
1452 * 4. We can't do anything with immutable dir (done in permission())
1453 * 5. If the sticky bit on dir is set we should either
1454 * a. be owner of dir, or
1455 * b. be owner of victim, or
1456 * c. have CAP_FOWNER capability
1457 * 6. If the victim is append-only or immutable we can't do antyhing with
1458 * links pointing to it.
1459 * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR.
1460 * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR.
1461 * 9. We can't remove a root or mountpoint.
1462 * 10. We don't allow removal of NFS sillyrenamed files; it's handled by
1463 * nfs_async_unlink().
1465 static int may_delete(struct inode *dir,struct dentry *victim,int isdir)
1467 int error;
1469 if (!victim->d_inode)
1470 return -ENOENT;
1472 BUG_ON(victim->d_parent->d_inode != dir);
1473 audit_inode_child(victim->d_name.name, victim, dir);
1475 error = permission(dir,MAY_WRITE | MAY_EXEC, NULL);
1476 if (error)
1477 return error;
1478 if (IS_APPEND(dir))
1479 return -EPERM;
1480 if (check_sticky(dir, victim->d_inode)||IS_APPEND(victim->d_inode)||
1481 IS_IMMUTABLE(victim->d_inode))
1482 return -EPERM;
1483 if (isdir) {
1484 if (!S_ISDIR(victim->d_inode->i_mode))
1485 return -ENOTDIR;
1486 if (IS_ROOT(victim))
1487 return -EBUSY;
1488 } else if (S_ISDIR(victim->d_inode->i_mode))
1489 return -EISDIR;
1490 if (IS_DEADDIR(dir))
1491 return -ENOENT;
1492 if (victim->d_flags & DCACHE_NFSFS_RENAMED)
1493 return -EBUSY;
1494 return 0;
1497 /* Check whether we can create an object with dentry child in directory
1498 * dir.
1499 * 1. We can't do it if child already exists (open has special treatment for
1500 * this case, but since we are inlined it's OK)
1501 * 2. We can't do it if dir is read-only (done in permission())
1502 * 3. We should have write and exec permissions on dir
1503 * 4. We can't do it if dir is immutable (done in permission())
1505 static inline int may_create(struct inode *dir, struct dentry *child,
1506 struct nameidata *nd)
1508 if (child->d_inode)
1509 return -EEXIST;
1510 if (IS_DEADDIR(dir))
1511 return -ENOENT;
1512 return permission(dir,MAY_WRITE | MAY_EXEC, nd);
1516 * O_DIRECTORY translates into forcing a directory lookup.
1518 static inline int lookup_flags(unsigned int f)
1520 unsigned long retval = LOOKUP_FOLLOW;
1522 if (f & O_NOFOLLOW)
1523 retval &= ~LOOKUP_FOLLOW;
1525 if (f & O_DIRECTORY)
1526 retval |= LOOKUP_DIRECTORY;
1528 return retval;
1532 * p1 and p2 should be directories on the same fs.
1534 struct dentry *lock_rename(struct dentry *p1, struct dentry *p2)
1536 struct dentry *p;
1538 if (p1 == p2) {
1539 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1540 return NULL;
1543 mutex_lock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1545 for (p = p1; p->d_parent != p; p = p->d_parent) {
1546 if (p->d_parent == p2) {
1547 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_PARENT);
1548 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_CHILD);
1549 return p;
1553 for (p = p2; p->d_parent != p; p = p->d_parent) {
1554 if (p->d_parent == p1) {
1555 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1556 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1557 return p;
1561 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1562 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1563 return NULL;
1566 void unlock_rename(struct dentry *p1, struct dentry *p2)
1568 mutex_unlock(&p1->d_inode->i_mutex);
1569 if (p1 != p2) {
1570 mutex_unlock(&p2->d_inode->i_mutex);
1571 mutex_unlock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1575 int vfs_create(struct inode *dir, struct dentry *dentry, int mode,
1576 struct nameidata *nd)
1578 int error = may_create(dir, dentry, nd);
1580 if (error)
1581 return error;
1583 if (!dir->i_op || !dir->i_op->create)
1584 return -EACCES; /* shouldn't it be ENOSYS? */
1585 mode &= S_IALLUGO;
1586 mode |= S_IFREG;
1587 error = security_inode_create(dir, dentry, mode);
1588 if (error)
1589 return error;
1590 DQUOT_INIT(dir);
1591 error = dir->i_op->create(dir, dentry, mode, nd);
1592 if (!error)
1593 fsnotify_create(dir, dentry);
1594 return error;
1597 int may_open(struct nameidata *nd, int acc_mode, int flag)
1599 struct dentry *dentry = nd->dentry;
1600 struct inode *inode = dentry->d_inode;
1601 int error;
1603 if (!inode)
1604 return -ENOENT;
1606 if (S_ISLNK(inode->i_mode))
1607 return -ELOOP;
1609 if (S_ISDIR(inode->i_mode) && (flag & FMODE_WRITE))
1610 return -EISDIR;
1613 * FIFO's, sockets and device files are special: they don't
1614 * actually live on the filesystem itself, and as such you
1615 * can write to them even if the filesystem is read-only.
1617 if (S_ISFIFO(inode->i_mode) || S_ISSOCK(inode->i_mode)) {
1618 flag &= ~O_TRUNC;
1619 } else if (S_ISBLK(inode->i_mode) || S_ISCHR(inode->i_mode)) {
1620 if (nd->mnt->mnt_flags & MNT_NODEV)
1621 return -EACCES;
1623 flag &= ~O_TRUNC;
1624 } else if (IS_RDONLY(inode) && (flag & FMODE_WRITE))
1625 return -EROFS;
1627 error = vfs_permission(nd, acc_mode);
1628 if (error)
1629 return error;
1631 * An append-only file must be opened in append mode for writing.
1633 if (IS_APPEND(inode)) {
1634 if ((flag & FMODE_WRITE) && !(flag & O_APPEND))
1635 return -EPERM;
1636 if (flag & O_TRUNC)
1637 return -EPERM;
1640 /* O_NOATIME can only be set by the owner or superuser */
1641 if (flag & O_NOATIME)
1642 if (!is_owner_or_cap(inode))
1643 return -EPERM;
1646 * Ensure there are no outstanding leases on the file.
1648 error = break_lease(inode, flag);
1649 if (error)
1650 return error;
1652 if (flag & O_TRUNC) {
1653 error = get_write_access(inode);
1654 if (error)
1655 return error;
1658 * Refuse to truncate files with mandatory locks held on them.
1660 error = locks_verify_locked(inode);
1661 if (!error) {
1662 DQUOT_INIT(inode);
1664 error = do_truncate(dentry, 0,
1665 ATTR_MTIME|ATTR_CTIME|ATTR_OPEN,
1666 NULL);
1668 put_write_access(inode);
1669 if (error)
1670 return error;
1671 } else
1672 if (flag & FMODE_WRITE)
1673 DQUOT_INIT(inode);
1675 return 0;
1678 static int open_namei_create(struct nameidata *nd, struct path *path,
1679 int flag, int mode)
1681 int error;
1682 struct dentry *dir = nd->dentry;
1684 if (!IS_POSIXACL(dir->d_inode))
1685 mode &= ~current->fs->umask;
1686 error = vfs_create(dir->d_inode, path->dentry, mode, nd);
1687 mutex_unlock(&dir->d_inode->i_mutex);
1688 dput(nd->dentry);
1689 nd->dentry = path->dentry;
1690 if (error)
1691 return error;
1692 /* Don't check for write permission, don't truncate */
1693 return may_open(nd, 0, flag & ~O_TRUNC);
1697 * open_namei()
1699 * namei for open - this is in fact almost the whole open-routine.
1701 * Note that the low bits of "flag" aren't the same as in the open
1702 * system call - they are 00 - no permissions needed
1703 * 01 - read permission needed
1704 * 10 - write permission needed
1705 * 11 - read/write permissions needed
1706 * which is a lot more logical, and also allows the "no perm" needed
1707 * for symlinks (where the permissions are checked later).
1708 * SMP-safe
1710 int open_namei(int dfd, const char *pathname, int flag,
1711 int mode, struct nameidata *nd)
1713 int acc_mode, error;
1714 struct path path;
1715 struct dentry *dir;
1716 int count = 0;
1718 acc_mode = ACC_MODE(flag);
1720 /* O_TRUNC implies we need access checks for write permissions */
1721 if (flag & O_TRUNC)
1722 acc_mode |= MAY_WRITE;
1724 /* Allow the LSM permission hook to distinguish append
1725 access from general write access. */
1726 if (flag & O_APPEND)
1727 acc_mode |= MAY_APPEND;
1730 * The simplest case - just a plain lookup.
1732 if (!(flag & O_CREAT)) {
1733 error = path_lookup_open(dfd, pathname, lookup_flags(flag),
1734 nd, flag);
1735 if (error)
1736 return error;
1737 goto ok;
1741 * Create - we need to know the parent.
1743 error = path_lookup_create(dfd,pathname,LOOKUP_PARENT,nd,flag,mode);
1744 if (error)
1745 return error;
1748 * We have the parent and last component. First of all, check
1749 * that we are not asked to creat(2) an obvious directory - that
1750 * will not do.
1752 error = -EISDIR;
1753 if (nd->last_type != LAST_NORM || nd->last.name[nd->last.len])
1754 goto exit;
1756 dir = nd->dentry;
1757 nd->flags &= ~LOOKUP_PARENT;
1758 mutex_lock(&dir->d_inode->i_mutex);
1759 path.dentry = lookup_hash(nd);
1760 path.mnt = nd->mnt;
1762 do_last:
1763 error = PTR_ERR(path.dentry);
1764 if (IS_ERR(path.dentry)) {
1765 mutex_unlock(&dir->d_inode->i_mutex);
1766 goto exit;
1769 if (IS_ERR(nd->intent.open.file)) {
1770 mutex_unlock(&dir->d_inode->i_mutex);
1771 error = PTR_ERR(nd->intent.open.file);
1772 goto exit_dput;
1775 /* Negative dentry, just create the file */
1776 if (!path.dentry->d_inode) {
1777 error = open_namei_create(nd, &path, flag, mode);
1778 if (error)
1779 goto exit;
1780 return 0;
1784 * It already exists.
1786 mutex_unlock(&dir->d_inode->i_mutex);
1787 audit_inode(pathname, path.dentry);
1789 error = -EEXIST;
1790 if (flag & O_EXCL)
1791 goto exit_dput;
1793 if (__follow_mount(&path)) {
1794 error = -ELOOP;
1795 if (flag & O_NOFOLLOW)
1796 goto exit_dput;
1799 error = -ENOENT;
1800 if (!path.dentry->d_inode)
1801 goto exit_dput;
1802 if (path.dentry->d_inode->i_op && path.dentry->d_inode->i_op->follow_link)
1803 goto do_link;
1805 path_to_nameidata(&path, nd);
1806 error = -EISDIR;
1807 if (path.dentry->d_inode && S_ISDIR(path.dentry->d_inode->i_mode))
1808 goto exit;
1810 error = may_open(nd, acc_mode, flag);
1811 if (error)
1812 goto exit;
1813 return 0;
1815 exit_dput:
1816 dput_path(&path, nd);
1817 exit:
1818 if (!IS_ERR(nd->intent.open.file))
1819 release_open_intent(nd);
1820 path_release(nd);
1821 return error;
1823 do_link:
1824 error = -ELOOP;
1825 if (flag & O_NOFOLLOW)
1826 goto exit_dput;
1828 * This is subtle. Instead of calling do_follow_link() we do the
1829 * thing by hands. The reason is that this way we have zero link_count
1830 * and path_walk() (called from ->follow_link) honoring LOOKUP_PARENT.
1831 * After that we have the parent and last component, i.e.
1832 * we are in the same situation as after the first path_walk().
1833 * Well, almost - if the last component is normal we get its copy
1834 * stored in nd->last.name and we will have to putname() it when we
1835 * are done. Procfs-like symlinks just set LAST_BIND.
1837 nd->flags |= LOOKUP_PARENT;
1838 error = security_inode_follow_link(path.dentry, nd);
1839 if (error)
1840 goto exit_dput;
1841 error = __do_follow_link(&path, nd);
1842 if (error) {
1843 /* Does someone understand code flow here? Or it is only
1844 * me so stupid? Anathema to whoever designed this non-sense
1845 * with "intent.open".
1847 release_open_intent(nd);
1848 return error;
1850 nd->flags &= ~LOOKUP_PARENT;
1851 if (nd->last_type == LAST_BIND)
1852 goto ok;
1853 error = -EISDIR;
1854 if (nd->last_type != LAST_NORM)
1855 goto exit;
1856 if (nd->last.name[nd->last.len]) {
1857 __putname(nd->last.name);
1858 goto exit;
1860 error = -ELOOP;
1861 if (count++==32) {
1862 __putname(nd->last.name);
1863 goto exit;
1865 dir = nd->dentry;
1866 mutex_lock(&dir->d_inode->i_mutex);
1867 path.dentry = lookup_hash(nd);
1868 path.mnt = nd->mnt;
1869 __putname(nd->last.name);
1870 goto do_last;
1874 * lookup_create - lookup a dentry, creating it if it doesn't exist
1875 * @nd: nameidata info
1876 * @is_dir: directory flag
1878 * Simple function to lookup and return a dentry and create it
1879 * if it doesn't exist. Is SMP-safe.
1881 * Returns with nd->dentry->d_inode->i_mutex locked.
1883 struct dentry *lookup_create(struct nameidata *nd, int is_dir)
1885 struct dentry *dentry = ERR_PTR(-EEXIST);
1887 mutex_lock_nested(&nd->dentry->d_inode->i_mutex, I_MUTEX_PARENT);
1889 * Yucky last component or no last component at all?
1890 * (foo/., foo/.., /////)
1892 if (nd->last_type != LAST_NORM)
1893 goto fail;
1894 nd->flags &= ~LOOKUP_PARENT;
1895 nd->flags |= LOOKUP_CREATE;
1896 nd->intent.open.flags = O_EXCL;
1899 * Do the final lookup.
1901 dentry = lookup_hash(nd);
1902 if (IS_ERR(dentry))
1903 goto fail;
1906 * Special case - lookup gave negative, but... we had foo/bar/
1907 * From the vfs_mknod() POV we just have a negative dentry -
1908 * all is fine. Let's be bastards - you had / on the end, you've
1909 * been asking for (non-existent) directory. -ENOENT for you.
1911 if (!is_dir && nd->last.name[nd->last.len] && !dentry->d_inode)
1912 goto enoent;
1913 return dentry;
1914 enoent:
1915 dput(dentry);
1916 dentry = ERR_PTR(-ENOENT);
1917 fail:
1918 return dentry;
1920 EXPORT_SYMBOL_GPL(lookup_create);
1922 int vfs_mknod(struct inode *dir, struct dentry *dentry, int mode, dev_t dev)
1924 int error = may_create(dir, dentry, NULL);
1926 if (error)
1927 return error;
1929 if ((S_ISCHR(mode) || S_ISBLK(mode)) && !capable(CAP_MKNOD))
1930 return -EPERM;
1932 if (!dir->i_op || !dir->i_op->mknod)
1933 return -EPERM;
1935 error = security_inode_mknod(dir, dentry, mode, dev);
1936 if (error)
1937 return error;
1939 DQUOT_INIT(dir);
1940 error = dir->i_op->mknod(dir, dentry, mode, dev);
1941 if (!error)
1942 fsnotify_create(dir, dentry);
1943 return error;
1946 asmlinkage long sys_mknodat(int dfd, const char __user *filename, int mode,
1947 unsigned dev)
1949 int error = 0;
1950 char * tmp;
1951 struct dentry * dentry;
1952 struct nameidata nd;
1954 if (S_ISDIR(mode))
1955 return -EPERM;
1956 tmp = getname(filename);
1957 if (IS_ERR(tmp))
1958 return PTR_ERR(tmp);
1960 error = do_path_lookup(dfd, tmp, LOOKUP_PARENT, &nd);
1961 if (error)
1962 goto out;
1963 dentry = lookup_create(&nd, 0);
1964 error = PTR_ERR(dentry);
1966 if (!IS_POSIXACL(nd.dentry->d_inode))
1967 mode &= ~current->fs->umask;
1968 if (!IS_ERR(dentry)) {
1969 switch (mode & S_IFMT) {
1970 case 0: case S_IFREG:
1971 error = vfs_create(nd.dentry->d_inode,dentry,mode,&nd);
1972 break;
1973 case S_IFCHR: case S_IFBLK:
1974 error = vfs_mknod(nd.dentry->d_inode,dentry,mode,
1975 new_decode_dev(dev));
1976 break;
1977 case S_IFIFO: case S_IFSOCK:
1978 error = vfs_mknod(nd.dentry->d_inode,dentry,mode,0);
1979 break;
1980 case S_IFDIR:
1981 error = -EPERM;
1982 break;
1983 default:
1984 error = -EINVAL;
1986 dput(dentry);
1988 mutex_unlock(&nd.dentry->d_inode->i_mutex);
1989 path_release(&nd);
1990 out:
1991 putname(tmp);
1993 return error;
1996 asmlinkage long sys_mknod(const char __user *filename, int mode, unsigned dev)
1998 return sys_mknodat(AT_FDCWD, filename, mode, dev);
2001 int vfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
2003 int error = may_create(dir, dentry, NULL);
2005 if (error)
2006 return error;
2008 if (!dir->i_op || !dir->i_op->mkdir)
2009 return -EPERM;
2011 mode &= (S_IRWXUGO|S_ISVTX);
2012 error = security_inode_mkdir(dir, dentry, mode);
2013 if (error)
2014 return error;
2016 DQUOT_INIT(dir);
2017 error = dir->i_op->mkdir(dir, dentry, mode);
2018 if (!error)
2019 fsnotify_mkdir(dir, dentry);
2020 return error;
2023 asmlinkage long sys_mkdirat(int dfd, const char __user *pathname, int mode)
2025 int error = 0;
2026 char * tmp;
2027 struct dentry *dentry;
2028 struct nameidata nd;
2030 tmp = getname(pathname);
2031 error = PTR_ERR(tmp);
2032 if (IS_ERR(tmp))
2033 goto out_err;
2035 error = do_path_lookup(dfd, tmp, LOOKUP_PARENT, &nd);
2036 if (error)
2037 goto out;
2038 dentry = lookup_create(&nd, 1);
2039 error = PTR_ERR(dentry);
2040 if (IS_ERR(dentry))
2041 goto out_unlock;
2043 if (!IS_POSIXACL(nd.dentry->d_inode))
2044 mode &= ~current->fs->umask;
2045 error = vfs_mkdir(nd.dentry->d_inode, dentry, mode);
2046 dput(dentry);
2047 out_unlock:
2048 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2049 path_release(&nd);
2050 out:
2051 putname(tmp);
2052 out_err:
2053 return error;
2056 asmlinkage long sys_mkdir(const char __user *pathname, int mode)
2058 return sys_mkdirat(AT_FDCWD, pathname, mode);
2062 * We try to drop the dentry early: we should have
2063 * a usage count of 2 if we're the only user of this
2064 * dentry, and if that is true (possibly after pruning
2065 * the dcache), then we drop the dentry now.
2067 * A low-level filesystem can, if it choses, legally
2068 * do a
2070 * if (!d_unhashed(dentry))
2071 * return -EBUSY;
2073 * if it cannot handle the case of removing a directory
2074 * that is still in use by something else..
2076 void dentry_unhash(struct dentry *dentry)
2078 dget(dentry);
2079 shrink_dcache_parent(dentry);
2080 spin_lock(&dcache_lock);
2081 spin_lock(&dentry->d_lock);
2082 if (atomic_read(&dentry->d_count) == 2)
2083 __d_drop(dentry);
2084 spin_unlock(&dentry->d_lock);
2085 spin_unlock(&dcache_lock);
2088 int vfs_rmdir(struct inode *dir, struct dentry *dentry)
2090 int error = may_delete(dir, dentry, 1);
2092 if (error)
2093 return error;
2095 if (!dir->i_op || !dir->i_op->rmdir)
2096 return -EPERM;
2098 DQUOT_INIT(dir);
2100 mutex_lock(&dentry->d_inode->i_mutex);
2101 dentry_unhash(dentry);
2102 if (d_mountpoint(dentry))
2103 error = -EBUSY;
2104 else {
2105 error = security_inode_rmdir(dir, dentry);
2106 if (!error) {
2107 error = dir->i_op->rmdir(dir, dentry);
2108 if (!error)
2109 dentry->d_inode->i_flags |= S_DEAD;
2112 mutex_unlock(&dentry->d_inode->i_mutex);
2113 if (!error) {
2114 d_delete(dentry);
2116 dput(dentry);
2118 return error;
2121 static long do_rmdir(int dfd, const char __user *pathname)
2123 int error = 0;
2124 char * name;
2125 struct dentry *dentry;
2126 struct nameidata nd;
2128 name = getname(pathname);
2129 if(IS_ERR(name))
2130 return PTR_ERR(name);
2132 error = do_path_lookup(dfd, name, LOOKUP_PARENT, &nd);
2133 if (error)
2134 goto exit;
2136 switch(nd.last_type) {
2137 case LAST_DOTDOT:
2138 error = -ENOTEMPTY;
2139 goto exit1;
2140 case LAST_DOT:
2141 error = -EINVAL;
2142 goto exit1;
2143 case LAST_ROOT:
2144 error = -EBUSY;
2145 goto exit1;
2147 mutex_lock_nested(&nd.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2148 dentry = lookup_hash(&nd);
2149 error = PTR_ERR(dentry);
2150 if (IS_ERR(dentry))
2151 goto exit2;
2152 error = vfs_rmdir(nd.dentry->d_inode, dentry);
2153 dput(dentry);
2154 exit2:
2155 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2156 exit1:
2157 path_release(&nd);
2158 exit:
2159 putname(name);
2160 return error;
2163 asmlinkage long sys_rmdir(const char __user *pathname)
2165 return do_rmdir(AT_FDCWD, pathname);
2168 int vfs_unlink(struct inode *dir, struct dentry *dentry)
2170 int error = may_delete(dir, dentry, 0);
2172 if (error)
2173 return error;
2175 if (!dir->i_op || !dir->i_op->unlink)
2176 return -EPERM;
2178 DQUOT_INIT(dir);
2180 mutex_lock(&dentry->d_inode->i_mutex);
2181 if (d_mountpoint(dentry))
2182 error = -EBUSY;
2183 else {
2184 error = security_inode_unlink(dir, dentry);
2185 if (!error)
2186 error = dir->i_op->unlink(dir, dentry);
2188 mutex_unlock(&dentry->d_inode->i_mutex);
2190 /* We don't d_delete() NFS sillyrenamed files--they still exist. */
2191 if (!error && !(dentry->d_flags & DCACHE_NFSFS_RENAMED)) {
2192 d_delete(dentry);
2195 return error;
2199 * Make sure that the actual truncation of the file will occur outside its
2200 * directory's i_mutex. Truncate can take a long time if there is a lot of
2201 * writeout happening, and we don't want to prevent access to the directory
2202 * while waiting on the I/O.
2204 static long do_unlinkat(int dfd, const char __user *pathname)
2206 int error = 0;
2207 char * name;
2208 struct dentry *dentry;
2209 struct nameidata nd;
2210 struct inode *inode = NULL;
2212 name = getname(pathname);
2213 if(IS_ERR(name))
2214 return PTR_ERR(name);
2216 error = do_path_lookup(dfd, name, LOOKUP_PARENT, &nd);
2217 if (error)
2218 goto exit;
2219 error = -EISDIR;
2220 if (nd.last_type != LAST_NORM)
2221 goto exit1;
2222 mutex_lock_nested(&nd.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2223 dentry = lookup_hash(&nd);
2224 error = PTR_ERR(dentry);
2225 if (!IS_ERR(dentry)) {
2226 /* Why not before? Because we want correct error value */
2227 if (nd.last.name[nd.last.len])
2228 goto slashes;
2229 inode = dentry->d_inode;
2230 if (inode)
2231 atomic_inc(&inode->i_count);
2232 error = vfs_unlink(nd.dentry->d_inode, dentry);
2233 exit2:
2234 dput(dentry);
2236 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2237 if (inode)
2238 iput(inode); /* truncate the inode here */
2239 exit1:
2240 path_release(&nd);
2241 exit:
2242 putname(name);
2243 return error;
2245 slashes:
2246 error = !dentry->d_inode ? -ENOENT :
2247 S_ISDIR(dentry->d_inode->i_mode) ? -EISDIR : -ENOTDIR;
2248 goto exit2;
2251 asmlinkage long sys_unlinkat(int dfd, const char __user *pathname, int flag)
2253 if ((flag & ~AT_REMOVEDIR) != 0)
2254 return -EINVAL;
2256 if (flag & AT_REMOVEDIR)
2257 return do_rmdir(dfd, pathname);
2259 return do_unlinkat(dfd, pathname);
2262 asmlinkage long sys_unlink(const char __user *pathname)
2264 return do_unlinkat(AT_FDCWD, pathname);
2267 int vfs_symlink(struct inode *dir, struct dentry *dentry, const char *oldname, int mode)
2269 int error = may_create(dir, dentry, NULL);
2271 if (error)
2272 return error;
2274 if (!dir->i_op || !dir->i_op->symlink)
2275 return -EPERM;
2277 error = security_inode_symlink(dir, dentry, oldname);
2278 if (error)
2279 return error;
2281 DQUOT_INIT(dir);
2282 error = dir->i_op->symlink(dir, dentry, oldname);
2283 if (!error)
2284 fsnotify_create(dir, dentry);
2285 return error;
2288 asmlinkage long sys_symlinkat(const char __user *oldname,
2289 int newdfd, const char __user *newname)
2291 int error = 0;
2292 char * from;
2293 char * to;
2294 struct dentry *dentry;
2295 struct nameidata nd;
2297 from = getname(oldname);
2298 if(IS_ERR(from))
2299 return PTR_ERR(from);
2300 to = getname(newname);
2301 error = PTR_ERR(to);
2302 if (IS_ERR(to))
2303 goto out_putname;
2305 error = do_path_lookup(newdfd, to, LOOKUP_PARENT, &nd);
2306 if (error)
2307 goto out;
2308 dentry = lookup_create(&nd, 0);
2309 error = PTR_ERR(dentry);
2310 if (IS_ERR(dentry))
2311 goto out_unlock;
2313 error = vfs_symlink(nd.dentry->d_inode, dentry, from, S_IALLUGO);
2314 dput(dentry);
2315 out_unlock:
2316 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2317 path_release(&nd);
2318 out:
2319 putname(to);
2320 out_putname:
2321 putname(from);
2322 return error;
2325 asmlinkage long sys_symlink(const char __user *oldname, const char __user *newname)
2327 return sys_symlinkat(oldname, AT_FDCWD, newname);
2330 int vfs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *new_dentry)
2332 struct inode *inode = old_dentry->d_inode;
2333 int error;
2335 if (!inode)
2336 return -ENOENT;
2338 error = may_create(dir, new_dentry, NULL);
2339 if (error)
2340 return error;
2342 if (dir->i_sb != inode->i_sb)
2343 return -EXDEV;
2346 * A link to an append-only or immutable file cannot be created.
2348 if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
2349 return -EPERM;
2350 if (!dir->i_op || !dir->i_op->link)
2351 return -EPERM;
2352 if (S_ISDIR(old_dentry->d_inode->i_mode))
2353 return -EPERM;
2355 error = security_inode_link(old_dentry, dir, new_dentry);
2356 if (error)
2357 return error;
2359 mutex_lock(&old_dentry->d_inode->i_mutex);
2360 DQUOT_INIT(dir);
2361 error = dir->i_op->link(old_dentry, dir, new_dentry);
2362 mutex_unlock(&old_dentry->d_inode->i_mutex);
2363 if (!error)
2364 fsnotify_create(dir, new_dentry);
2365 return error;
2369 * Hardlinks are often used in delicate situations. We avoid
2370 * security-related surprises by not following symlinks on the
2371 * newname. --KAB
2373 * We don't follow them on the oldname either to be compatible
2374 * with linux 2.0, and to avoid hard-linking to directories
2375 * and other special files. --ADM
2377 asmlinkage long sys_linkat(int olddfd, const char __user *oldname,
2378 int newdfd, const char __user *newname,
2379 int flags)
2381 struct dentry *new_dentry;
2382 struct nameidata nd, old_nd;
2383 int error;
2384 char * to;
2386 if ((flags & ~AT_SYMLINK_FOLLOW) != 0)
2387 return -EINVAL;
2389 to = getname(newname);
2390 if (IS_ERR(to))
2391 return PTR_ERR(to);
2393 error = __user_walk_fd(olddfd, oldname,
2394 flags & AT_SYMLINK_FOLLOW ? LOOKUP_FOLLOW : 0,
2395 &old_nd);
2396 if (error)
2397 goto exit;
2398 error = do_path_lookup(newdfd, to, LOOKUP_PARENT, &nd);
2399 if (error)
2400 goto out;
2401 error = -EXDEV;
2402 if (old_nd.mnt != nd.mnt)
2403 goto out_release;
2404 new_dentry = lookup_create(&nd, 0);
2405 error = PTR_ERR(new_dentry);
2406 if (IS_ERR(new_dentry))
2407 goto out_unlock;
2408 error = vfs_link(old_nd.dentry, nd.dentry->d_inode, new_dentry);
2409 dput(new_dentry);
2410 out_unlock:
2411 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2412 out_release:
2413 path_release(&nd);
2414 out:
2415 path_release(&old_nd);
2416 exit:
2417 putname(to);
2419 return error;
2422 asmlinkage long sys_link(const char __user *oldname, const char __user *newname)
2424 return sys_linkat(AT_FDCWD, oldname, AT_FDCWD, newname, 0);
2428 * The worst of all namespace operations - renaming directory. "Perverted"
2429 * doesn't even start to describe it. Somebody in UCB had a heck of a trip...
2430 * Problems:
2431 * a) we can get into loop creation. Check is done in is_subdir().
2432 * b) race potential - two innocent renames can create a loop together.
2433 * That's where 4.4 screws up. Current fix: serialization on
2434 * sb->s_vfs_rename_mutex. We might be more accurate, but that's another
2435 * story.
2436 * c) we have to lock _three_ objects - parents and victim (if it exists).
2437 * And that - after we got ->i_mutex on parents (until then we don't know
2438 * whether the target exists). Solution: try to be smart with locking
2439 * order for inodes. We rely on the fact that tree topology may change
2440 * only under ->s_vfs_rename_mutex _and_ that parent of the object we
2441 * move will be locked. Thus we can rank directories by the tree
2442 * (ancestors first) and rank all non-directories after them.
2443 * That works since everybody except rename does "lock parent, lookup,
2444 * lock child" and rename is under ->s_vfs_rename_mutex.
2445 * HOWEVER, it relies on the assumption that any object with ->lookup()
2446 * has no more than 1 dentry. If "hybrid" objects will ever appear,
2447 * we'd better make sure that there's no link(2) for them.
2448 * d) some filesystems don't support opened-but-unlinked directories,
2449 * either because of layout or because they are not ready to deal with
2450 * all cases correctly. The latter will be fixed (taking this sort of
2451 * stuff into VFS), but the former is not going away. Solution: the same
2452 * trick as in rmdir().
2453 * e) conversion from fhandle to dentry may come in the wrong moment - when
2454 * we are removing the target. Solution: we will have to grab ->i_mutex
2455 * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on
2456 * ->i_mutex on parents, which works but leads to some truely excessive
2457 * locking].
2459 static int vfs_rename_dir(struct inode *old_dir, struct dentry *old_dentry,
2460 struct inode *new_dir, struct dentry *new_dentry)
2462 int error = 0;
2463 struct inode *target;
2466 * If we are going to change the parent - check write permissions,
2467 * we'll need to flip '..'.
2469 if (new_dir != old_dir) {
2470 error = permission(old_dentry->d_inode, MAY_WRITE, NULL);
2471 if (error)
2472 return error;
2475 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2476 if (error)
2477 return error;
2479 target = new_dentry->d_inode;
2480 if (target) {
2481 mutex_lock(&target->i_mutex);
2482 dentry_unhash(new_dentry);
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 (target) {
2489 if (!error)
2490 target->i_flags |= S_DEAD;
2491 mutex_unlock(&target->i_mutex);
2492 if (d_unhashed(new_dentry))
2493 d_rehash(new_dentry);
2494 dput(new_dentry);
2496 if (!error)
2497 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
2498 d_move(old_dentry,new_dentry);
2499 return error;
2502 static int vfs_rename_other(struct inode *old_dir, struct dentry *old_dentry,
2503 struct inode *new_dir, struct dentry *new_dentry)
2505 struct inode *target;
2506 int error;
2508 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2509 if (error)
2510 return error;
2512 dget(new_dentry);
2513 target = new_dentry->d_inode;
2514 if (target)
2515 mutex_lock(&target->i_mutex);
2516 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2517 error = -EBUSY;
2518 else
2519 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2520 if (!error) {
2521 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
2522 d_move(old_dentry, new_dentry);
2524 if (target)
2525 mutex_unlock(&target->i_mutex);
2526 dput(new_dentry);
2527 return error;
2530 int vfs_rename(struct inode *old_dir, struct dentry *old_dentry,
2531 struct inode *new_dir, struct dentry *new_dentry)
2533 int error;
2534 int is_dir = S_ISDIR(old_dentry->d_inode->i_mode);
2535 const char *old_name;
2537 if (old_dentry->d_inode == new_dentry->d_inode)
2538 return 0;
2540 error = may_delete(old_dir, old_dentry, is_dir);
2541 if (error)
2542 return error;
2544 if (!new_dentry->d_inode)
2545 error = may_create(new_dir, new_dentry, NULL);
2546 else
2547 error = may_delete(new_dir, new_dentry, is_dir);
2548 if (error)
2549 return error;
2551 if (!old_dir->i_op || !old_dir->i_op->rename)
2552 return -EPERM;
2554 DQUOT_INIT(old_dir);
2555 DQUOT_INIT(new_dir);
2557 old_name = fsnotify_oldname_init(old_dentry->d_name.name);
2559 if (is_dir)
2560 error = vfs_rename_dir(old_dir,old_dentry,new_dir,new_dentry);
2561 else
2562 error = vfs_rename_other(old_dir,old_dentry,new_dir,new_dentry);
2563 if (!error) {
2564 const char *new_name = old_dentry->d_name.name;
2565 fsnotify_move(old_dir, new_dir, old_name, new_name, is_dir,
2566 new_dentry->d_inode, old_dentry);
2568 fsnotify_oldname_free(old_name);
2570 return error;
2573 static int do_rename(int olddfd, const char *oldname,
2574 int newdfd, const char *newname)
2576 int error = 0;
2577 struct dentry * old_dir, * new_dir;
2578 struct dentry * old_dentry, *new_dentry;
2579 struct dentry * trap;
2580 struct nameidata oldnd, newnd;
2582 error = do_path_lookup(olddfd, oldname, LOOKUP_PARENT, &oldnd);
2583 if (error)
2584 goto exit;
2586 error = do_path_lookup(newdfd, newname, LOOKUP_PARENT, &newnd);
2587 if (error)
2588 goto exit1;
2590 error = -EXDEV;
2591 if (oldnd.mnt != newnd.mnt)
2592 goto exit2;
2594 old_dir = oldnd.dentry;
2595 error = -EBUSY;
2596 if (oldnd.last_type != LAST_NORM)
2597 goto exit2;
2599 new_dir = newnd.dentry;
2600 if (newnd.last_type != LAST_NORM)
2601 goto exit2;
2603 trap = lock_rename(new_dir, old_dir);
2605 old_dentry = lookup_hash(&oldnd);
2606 error = PTR_ERR(old_dentry);
2607 if (IS_ERR(old_dentry))
2608 goto exit3;
2609 /* source must exist */
2610 error = -ENOENT;
2611 if (!old_dentry->d_inode)
2612 goto exit4;
2613 /* unless the source is a directory trailing slashes give -ENOTDIR */
2614 if (!S_ISDIR(old_dentry->d_inode->i_mode)) {
2615 error = -ENOTDIR;
2616 if (oldnd.last.name[oldnd.last.len])
2617 goto exit4;
2618 if (newnd.last.name[newnd.last.len])
2619 goto exit4;
2621 /* source should not be ancestor of target */
2622 error = -EINVAL;
2623 if (old_dentry == trap)
2624 goto exit4;
2625 new_dentry = lookup_hash(&newnd);
2626 error = PTR_ERR(new_dentry);
2627 if (IS_ERR(new_dentry))
2628 goto exit4;
2629 /* target should not be an ancestor of source */
2630 error = -ENOTEMPTY;
2631 if (new_dentry == trap)
2632 goto exit5;
2634 error = vfs_rename(old_dir->d_inode, old_dentry,
2635 new_dir->d_inode, new_dentry);
2636 exit5:
2637 dput(new_dentry);
2638 exit4:
2639 dput(old_dentry);
2640 exit3:
2641 unlock_rename(new_dir, old_dir);
2642 exit2:
2643 path_release(&newnd);
2644 exit1:
2645 path_release(&oldnd);
2646 exit:
2647 return error;
2650 asmlinkage long sys_renameat(int olddfd, const char __user *oldname,
2651 int newdfd, const char __user *newname)
2653 int error;
2654 char * from;
2655 char * to;
2657 from = getname(oldname);
2658 if(IS_ERR(from))
2659 return PTR_ERR(from);
2660 to = getname(newname);
2661 error = PTR_ERR(to);
2662 if (!IS_ERR(to)) {
2663 error = do_rename(olddfd, from, newdfd, to);
2664 putname(to);
2666 putname(from);
2667 return error;
2670 asmlinkage long sys_rename(const char __user *oldname, const char __user *newname)
2672 return sys_renameat(AT_FDCWD, oldname, AT_FDCWD, newname);
2675 int vfs_readlink(struct dentry *dentry, char __user *buffer, int buflen, const char *link)
2677 int len;
2679 len = PTR_ERR(link);
2680 if (IS_ERR(link))
2681 goto out;
2683 len = strlen(link);
2684 if (len > (unsigned) buflen)
2685 len = buflen;
2686 if (copy_to_user(buffer, link, len))
2687 len = -EFAULT;
2688 out:
2689 return len;
2693 * A helper for ->readlink(). This should be used *ONLY* for symlinks that
2694 * have ->follow_link() touching nd only in nd_set_link(). Using (or not
2695 * using) it for any given inode is up to filesystem.
2697 int generic_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2699 struct nameidata nd;
2700 void *cookie;
2702 nd.depth = 0;
2703 cookie = dentry->d_inode->i_op->follow_link(dentry, &nd);
2704 if (!IS_ERR(cookie)) {
2705 int res = vfs_readlink(dentry, buffer, buflen, nd_get_link(&nd));
2706 if (dentry->d_inode->i_op->put_link)
2707 dentry->d_inode->i_op->put_link(dentry, &nd, cookie);
2708 cookie = ERR_PTR(res);
2710 return PTR_ERR(cookie);
2713 int vfs_follow_link(struct nameidata *nd, const char *link)
2715 return __vfs_follow_link(nd, link);
2718 /* get the link contents into pagecache */
2719 static char *page_getlink(struct dentry * dentry, struct page **ppage)
2721 struct page * page;
2722 struct address_space *mapping = dentry->d_inode->i_mapping;
2723 page = read_mapping_page(mapping, 0, NULL);
2724 if (IS_ERR(page))
2725 return (char*)page;
2726 *ppage = page;
2727 return kmap(page);
2730 int page_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2732 struct page *page = NULL;
2733 char *s = page_getlink(dentry, &page);
2734 int res = vfs_readlink(dentry,buffer,buflen,s);
2735 if (page) {
2736 kunmap(page);
2737 page_cache_release(page);
2739 return res;
2742 void *page_follow_link_light(struct dentry *dentry, struct nameidata *nd)
2744 struct page *page = NULL;
2745 nd_set_link(nd, page_getlink(dentry, &page));
2746 return page;
2749 void page_put_link(struct dentry *dentry, struct nameidata *nd, void *cookie)
2751 struct page *page = cookie;
2753 if (page) {
2754 kunmap(page);
2755 page_cache_release(page);
2759 int __page_symlink(struct inode *inode, const char *symname, int len,
2760 gfp_t gfp_mask)
2762 struct address_space *mapping = inode->i_mapping;
2763 struct page *page;
2764 void *fsdata;
2765 int err;
2766 char *kaddr;
2768 retry:
2769 err = pagecache_write_begin(NULL, mapping, 0, len-1,
2770 AOP_FLAG_UNINTERRUPTIBLE, &page, &fsdata);
2771 if (err)
2772 goto fail;
2774 kaddr = kmap_atomic(page, KM_USER0);
2775 memcpy(kaddr, symname, len-1);
2776 kunmap_atomic(kaddr, KM_USER0);
2778 err = pagecache_write_end(NULL, mapping, 0, len-1, len-1,
2779 page, fsdata);
2780 if (err < 0)
2781 goto fail;
2782 if (err < len-1)
2783 goto retry;
2785 mark_inode_dirty(inode);
2786 return 0;
2787 fail:
2788 return err;
2791 int page_symlink(struct inode *inode, const char *symname, int len)
2793 return __page_symlink(inode, symname, len,
2794 mapping_gfp_mask(inode->i_mapping));
2797 const struct inode_operations page_symlink_inode_operations = {
2798 .readlink = generic_readlink,
2799 .follow_link = page_follow_link_light,
2800 .put_link = page_put_link,
2803 EXPORT_SYMBOL(__user_walk);
2804 EXPORT_SYMBOL(__user_walk_fd);
2805 EXPORT_SYMBOL(follow_down);
2806 EXPORT_SYMBOL(follow_up);
2807 EXPORT_SYMBOL(get_write_access); /* binfmt_aout */
2808 EXPORT_SYMBOL(getname);
2809 EXPORT_SYMBOL(lock_rename);
2810 EXPORT_SYMBOL(lookup_one_len);
2811 EXPORT_SYMBOL(page_follow_link_light);
2812 EXPORT_SYMBOL(page_put_link);
2813 EXPORT_SYMBOL(page_readlink);
2814 EXPORT_SYMBOL(__page_symlink);
2815 EXPORT_SYMBOL(page_symlink);
2816 EXPORT_SYMBOL(page_symlink_inode_operations);
2817 EXPORT_SYMBOL(path_lookup);
2818 EXPORT_SYMBOL(vfs_path_lookup);
2819 EXPORT_SYMBOL(path_release);
2820 EXPORT_SYMBOL(permission);
2821 EXPORT_SYMBOL(vfs_permission);
2822 EXPORT_SYMBOL(file_permission);
2823 EXPORT_SYMBOL(unlock_rename);
2824 EXPORT_SYMBOL(vfs_create);
2825 EXPORT_SYMBOL(vfs_follow_link);
2826 EXPORT_SYMBOL(vfs_link);
2827 EXPORT_SYMBOL(vfs_mkdir);
2828 EXPORT_SYMBOL(vfs_mknod);
2829 EXPORT_SYMBOL(generic_permission);
2830 EXPORT_SYMBOL(vfs_readlink);
2831 EXPORT_SYMBOL(vfs_rename);
2832 EXPORT_SYMBOL(vfs_rmdir);
2833 EXPORT_SYMBOL(vfs_symlink);
2834 EXPORT_SYMBOL(vfs_unlink);
2835 EXPORT_SYMBOL(dentry_unhash);
2836 EXPORT_SYMBOL(generic_readlink);