Linux 2.6.16.42-rc1
[linux/fpc-iii.git] / fs / namei.c
blob3ece3a93dd926c9c2ddf22168125bf9532586d98
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/smp_lock.h>
26 #include <linux/personality.h>
27 #include <linux/security.h>
28 #include <linux/syscalls.h>
29 #include <linux/mount.h>
30 #include <linux/audit.h>
31 #include <linux/capability.h>
32 #include <linux/file.h>
33 #include <linux/fcntl.h>
34 #include <linux/namei.h>
35 #include <asm/namei.h>
36 #include <asm/uaccess.h>
38 #define ACC_MODE(x) ("\000\004\002\006"[(x)&O_ACCMODE])
40 /* [Feb-1997 T. Schoebel-Theuer]
41 * Fundamental changes in the pathname lookup mechanisms (namei)
42 * were necessary because of omirr. The reason is that omirr needs
43 * to know the _real_ pathname, not the user-supplied one, in case
44 * of symlinks (and also when transname replacements occur).
46 * The new code replaces the old recursive symlink resolution with
47 * an iterative one (in case of non-nested symlink chains). It does
48 * this with calls to <fs>_follow_link().
49 * As a side effect, dir_namei(), _namei() and follow_link() are now
50 * replaced with a single function lookup_dentry() that can handle all
51 * the special cases of the former code.
53 * With the new dcache, the pathname is stored at each inode, at least as
54 * long as the refcount of the inode is positive. As a side effect, the
55 * size of the dcache depends on the inode cache and thus is dynamic.
57 * [29-Apr-1998 C. Scott Ananian] Updated above description of symlink
58 * resolution to correspond with current state of the code.
60 * Note that the symlink resolution is not *completely* iterative.
61 * There is still a significant amount of tail- and mid- recursion in
62 * the algorithm. Also, note that <fs>_readlink() is not used in
63 * lookup_dentry(): lookup_dentry() on the result of <fs>_readlink()
64 * may return different results than <fs>_follow_link(). Many virtual
65 * filesystems (including /proc) exhibit this behavior.
68 /* [24-Feb-97 T. Schoebel-Theuer] Side effects caused by new implementation:
69 * New symlink semantics: when open() is called with flags O_CREAT | O_EXCL
70 * and the name already exists in form of a symlink, try to create the new
71 * name indicated by the symlink. The old code always complained that the
72 * name already exists, due to not following the symlink even if its target
73 * is nonexistent. The new semantics affects also mknod() and link() when
74 * the name is a symlink pointing to a non-existant name.
76 * I don't know which semantics is the right one, since I have no access
77 * to standards. But I found by trial that HP-UX 9.0 has the full "new"
78 * semantics implemented, while SunOS 4.1.1 and Solaris (SunOS 5.4) have the
79 * "old" one. Personally, I think the new semantics is much more logical.
80 * Note that "ln old new" where "new" is a symlink pointing to a non-existing
81 * file does succeed in both HP-UX and SunOs, but not in Solaris
82 * and in the old Linux semantics.
85 /* [16-Dec-97 Kevin Buhr] For security reasons, we change some symlink
86 * semantics. See the comments in "open_namei" and "do_link" below.
88 * [10-Sep-98 Alan Modra] Another symlink change.
91 /* [Feb-Apr 2000 AV] Complete rewrite. Rules for symlinks:
92 * inside the path - always follow.
93 * in the last component in creation/removal/renaming - never follow.
94 * if LOOKUP_FOLLOW passed - follow.
95 * if the pathname has trailing slashes - follow.
96 * otherwise - don't follow.
97 * (applied in that order).
99 * [Jun 2000 AV] Inconsistent behaviour of open() in case if flags==O_CREAT
100 * restored for 2.4. This is the last surviving part of old 4.2BSD bug.
101 * During the 2.4 we need to fix the userland stuff depending on it -
102 * hopefully we will be able to get rid of that wart in 2.5. So far only
103 * XEmacs seems to be relying on it...
106 * [Sep 2001 AV] Single-semaphore locking scheme (kudos to David Holland)
107 * implemented. Let's see if raised priority of ->s_vfs_rename_sem gives
108 * any extra contention...
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(current->audit_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;
232 if (mask & MAY_WRITE) {
233 umode_t mode = inode->i_mode;
236 * Nobody gets write access to a read-only fs.
238 if (IS_RDONLY(inode) &&
239 (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode)))
240 return -EROFS;
243 * Nobody gets write access to an immutable file.
245 if (IS_IMMUTABLE(inode))
246 return -EACCES;
250 /* Ordinary permission routines do not understand MAY_APPEND. */
251 submask = mask & ~MAY_APPEND;
252 if (inode->i_op && inode->i_op->permission)
253 retval = inode->i_op->permission(inode, submask, nd);
254 else
255 retval = generic_permission(inode, submask, NULL);
256 if (retval)
257 return retval;
259 return security_inode_permission(inode, mask, nd);
263 * vfs_permission - check for access rights to a given path
264 * @nd: lookup result that describes the path
265 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
267 * Used to check for read/write/execute permissions on a path.
268 * We use "fsuid" for this, letting us set arbitrary permissions
269 * for filesystem access without changing the "normal" uids which
270 * are used for other things.
272 int vfs_permission(struct nameidata *nd, int mask)
274 return permission(nd->dentry->d_inode, mask, nd);
278 * file_permission - check for additional access rights to a given file
279 * @file: file to check access rights for
280 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
282 * Used to check for read/write/execute permissions on an already opened
283 * file.
285 * Note:
286 * Do not use this function in new code. All access checks should
287 * be done using vfs_permission().
289 int file_permission(struct file *file, int mask)
291 return permission(file->f_dentry->d_inode, mask, NULL);
295 * get_write_access() gets write permission for a file.
296 * put_write_access() releases this write permission.
297 * This is used for regular files.
298 * We cannot support write (and maybe mmap read-write shared) accesses and
299 * MAP_DENYWRITE mmappings simultaneously. The i_writecount field of an inode
300 * can have the following values:
301 * 0: no writers, no VM_DENYWRITE mappings
302 * < 0: (-i_writecount) vm_area_structs with VM_DENYWRITE set exist
303 * > 0: (i_writecount) users are writing to the file.
305 * Normally we operate on that counter with atomic_{inc,dec} and it's safe
306 * except for the cases where we don't hold i_writecount yet. Then we need to
307 * use {get,deny}_write_access() - these functions check the sign and refuse
308 * to do the change if sign is wrong. Exclusion between them is provided by
309 * the inode->i_lock spinlock.
312 int get_write_access(struct inode * inode)
314 spin_lock(&inode->i_lock);
315 if (atomic_read(&inode->i_writecount) < 0) {
316 spin_unlock(&inode->i_lock);
317 return -ETXTBSY;
319 atomic_inc(&inode->i_writecount);
320 spin_unlock(&inode->i_lock);
322 return 0;
325 int deny_write_access(struct file * file)
327 struct inode *inode = file->f_dentry->d_inode;
329 spin_lock(&inode->i_lock);
330 if (atomic_read(&inode->i_writecount) > 0) {
331 spin_unlock(&inode->i_lock);
332 return -ETXTBSY;
334 atomic_dec(&inode->i_writecount);
335 spin_unlock(&inode->i_lock);
337 return 0;
340 void path_release(struct nameidata *nd)
342 dput(nd->dentry);
343 mntput(nd->mnt);
347 * umount() mustn't call path_release()/mntput() as that would clear
348 * mnt_expiry_mark
350 void path_release_on_umount(struct nameidata *nd)
352 dput(nd->dentry);
353 mntput_no_expire(nd->mnt);
357 * release_open_intent - free up open intent resources
358 * @nd: pointer to nameidata
360 void release_open_intent(struct nameidata *nd)
362 if (nd->intent.open.file->f_dentry == NULL)
363 put_filp(nd->intent.open.file);
364 else
365 fput(nd->intent.open.file);
369 * Internal lookup() using the new generic dcache.
370 * SMP-safe
372 static struct dentry * cached_lookup(struct dentry * parent, struct qstr * name, struct nameidata *nd)
374 struct dentry * dentry = __d_lookup(parent, name);
376 /* lockess __d_lookup may fail due to concurrent d_move()
377 * in some unrelated directory, so try with d_lookup
379 if (!dentry)
380 dentry = d_lookup(parent, name);
382 if (dentry && dentry->d_op && dentry->d_op->d_revalidate) {
383 if (!dentry->d_op->d_revalidate(dentry, nd) && !d_invalidate(dentry)) {
384 dput(dentry);
385 dentry = NULL;
388 return dentry;
392 * Short-cut version of permission(), for calling by
393 * path_walk(), when dcache lock is held. Combines parts
394 * of permission() and generic_permission(), and tests ONLY for
395 * MAY_EXEC permission.
397 * If appropriate, check DAC only. If not appropriate, or
398 * short-cut DAC fails, then call permission() to do more
399 * complete permission check.
401 static int exec_permission_lite(struct inode *inode,
402 struct nameidata *nd)
404 umode_t mode = inode->i_mode;
406 if (inode->i_op && inode->i_op->permission)
407 return -EAGAIN;
409 if (current->fsuid == inode->i_uid)
410 mode >>= 6;
411 else if (in_group_p(inode->i_gid))
412 mode >>= 3;
414 if (mode & MAY_EXEC)
415 goto ok;
417 if ((inode->i_mode & S_IXUGO) && capable(CAP_DAC_OVERRIDE))
418 goto ok;
420 if (S_ISDIR(inode->i_mode) && capable(CAP_DAC_OVERRIDE))
421 goto ok;
423 if (S_ISDIR(inode->i_mode) && capable(CAP_DAC_READ_SEARCH))
424 goto ok;
426 return -EACCES;
428 return security_inode_permission(inode, MAY_EXEC, nd);
432 * This is called when everything else fails, and we actually have
433 * to go to the low-level filesystem to find out what we should do..
435 * We get the directory semaphore, and after getting that we also
436 * make sure that nobody added the entry to the dcache in the meantime..
437 * SMP-safe
439 static struct dentry * real_lookup(struct dentry * parent, struct qstr * name, struct nameidata *nd)
441 struct dentry * result;
442 struct inode *dir = parent->d_inode;
444 mutex_lock(&dir->i_mutex);
446 * First re-do the cached lookup just in case it was created
447 * while we waited for the directory semaphore..
449 * FIXME! This could use version numbering or similar to
450 * avoid unnecessary cache lookups.
452 * The "dcache_lock" is purely to protect the RCU list walker
453 * from concurrent renames at this point (we mustn't get false
454 * negatives from the RCU list walk here, unlike the optimistic
455 * fast walk).
457 * so doing d_lookup() (with seqlock), instead of lockfree __d_lookup
459 result = d_lookup(parent, name);
460 if (!result) {
461 struct dentry * dentry = d_alloc(parent, name);
462 result = ERR_PTR(-ENOMEM);
463 if (dentry) {
464 result = dir->i_op->lookup(dir, dentry, nd);
465 if (result)
466 dput(dentry);
467 else
468 result = dentry;
470 mutex_unlock(&dir->i_mutex);
471 return result;
475 * Uhhuh! Nasty case: the cache was re-populated while
476 * we waited on the semaphore. Need to revalidate.
478 mutex_unlock(&dir->i_mutex);
479 if (result->d_op && result->d_op->d_revalidate) {
480 if (!result->d_op->d_revalidate(result, nd) && !d_invalidate(result)) {
481 dput(result);
482 result = ERR_PTR(-ENOENT);
485 return result;
488 static int __emul_lookup_dentry(const char *, struct nameidata *);
490 /* SMP-safe */
491 static __always_inline int
492 walk_init_root(const char *name, struct nameidata *nd)
494 read_lock(&current->fs->lock);
495 if (current->fs->altroot && !(nd->flags & LOOKUP_NOALT)) {
496 nd->mnt = mntget(current->fs->altrootmnt);
497 nd->dentry = dget(current->fs->altroot);
498 read_unlock(&current->fs->lock);
499 if (__emul_lookup_dentry(name,nd))
500 return 0;
501 read_lock(&current->fs->lock);
503 nd->mnt = mntget(current->fs->rootmnt);
504 nd->dentry = dget(current->fs->root);
505 read_unlock(&current->fs->lock);
506 return 1;
509 static __always_inline int __vfs_follow_link(struct nameidata *nd, const char *link)
511 int res = 0;
512 char *name;
513 if (IS_ERR(link))
514 goto fail;
516 if (*link == '/') {
517 path_release(nd);
518 if (!walk_init_root(link, nd))
519 /* weird __emul_prefix() stuff did it */
520 goto out;
522 res = link_path_walk(link, nd);
523 out:
524 if (nd->depth || res || nd->last_type!=LAST_NORM)
525 return res;
527 * If it is an iterative symlinks resolution in open_namei() we
528 * have to copy the last component. And all that crap because of
529 * bloody create() on broken symlinks. Furrfu...
531 name = __getname();
532 if (unlikely(!name)) {
533 path_release(nd);
534 return -ENOMEM;
536 strcpy(name, nd->last.name);
537 nd->last.name = name;
538 return 0;
539 fail:
540 path_release(nd);
541 return PTR_ERR(link);
544 struct path {
545 struct vfsmount *mnt;
546 struct dentry *dentry;
549 static __always_inline int __do_follow_link(struct path *path, struct nameidata *nd)
551 int error;
552 void *cookie;
553 struct dentry *dentry = path->dentry;
555 touch_atime(path->mnt, dentry);
556 nd_set_link(nd, NULL);
558 if (path->mnt == nd->mnt)
559 mntget(path->mnt);
560 cookie = dentry->d_inode->i_op->follow_link(dentry, nd);
561 error = PTR_ERR(cookie);
562 if (!IS_ERR(cookie)) {
563 char *s = nd_get_link(nd);
564 error = 0;
565 if (s)
566 error = __vfs_follow_link(nd, s);
567 if (dentry->d_inode->i_op->put_link)
568 dentry->d_inode->i_op->put_link(dentry, nd, cookie);
570 dput(dentry);
571 mntput(path->mnt);
573 return error;
576 static inline void dput_path(struct path *path, struct nameidata *nd)
578 dput(path->dentry);
579 if (path->mnt != nd->mnt)
580 mntput(path->mnt);
583 static inline void path_to_nameidata(struct path *path, struct nameidata *nd)
585 dput(nd->dentry);
586 if (nd->mnt != path->mnt)
587 mntput(nd->mnt);
588 nd->mnt = path->mnt;
589 nd->dentry = path->dentry;
593 * This limits recursive symlink follows to 8, while
594 * limiting consecutive symlinks to 40.
596 * Without that kind of total limit, nasty chains of consecutive
597 * symlinks can cause almost arbitrarily long lookups.
599 static inline int do_follow_link(struct path *path, struct nameidata *nd)
601 int err = -ELOOP;
602 if (current->link_count >= MAX_NESTED_LINKS)
603 goto loop;
604 if (current->total_link_count >= 40)
605 goto loop;
606 BUG_ON(nd->depth >= MAX_NESTED_LINKS);
607 cond_resched();
608 err = security_inode_follow_link(path->dentry, nd);
609 if (err)
610 goto loop;
611 current->link_count++;
612 current->total_link_count++;
613 nd->depth++;
614 err = __do_follow_link(path, nd);
615 current->link_count--;
616 nd->depth--;
617 return err;
618 loop:
619 dput_path(path, nd);
620 path_release(nd);
621 return err;
624 int follow_up(struct vfsmount **mnt, struct dentry **dentry)
626 struct vfsmount *parent;
627 struct dentry *mountpoint;
628 spin_lock(&vfsmount_lock);
629 parent=(*mnt)->mnt_parent;
630 if (parent == *mnt) {
631 spin_unlock(&vfsmount_lock);
632 return 0;
634 mntget(parent);
635 mountpoint=dget((*mnt)->mnt_mountpoint);
636 spin_unlock(&vfsmount_lock);
637 dput(*dentry);
638 *dentry = mountpoint;
639 mntput(*mnt);
640 *mnt = parent;
641 return 1;
644 /* no need for dcache_lock, as serialization is taken care in
645 * namespace.c
647 static int __follow_mount(struct path *path)
649 int res = 0;
650 while (d_mountpoint(path->dentry)) {
651 struct vfsmount *mounted = lookup_mnt(path->mnt, path->dentry);
652 if (!mounted)
653 break;
654 dput(path->dentry);
655 if (res)
656 mntput(path->mnt);
657 path->mnt = mounted;
658 path->dentry = dget(mounted->mnt_root);
659 res = 1;
661 return res;
664 static void follow_mount(struct vfsmount **mnt, struct dentry **dentry)
666 while (d_mountpoint(*dentry)) {
667 struct vfsmount *mounted = lookup_mnt(*mnt, *dentry);
668 if (!mounted)
669 break;
670 dput(*dentry);
671 mntput(*mnt);
672 *mnt = mounted;
673 *dentry = dget(mounted->mnt_root);
677 /* no need for dcache_lock, as serialization is taken care in
678 * namespace.c
680 int follow_down(struct vfsmount **mnt, struct dentry **dentry)
682 struct vfsmount *mounted;
684 mounted = lookup_mnt(*mnt, *dentry);
685 if (mounted) {
686 dput(*dentry);
687 mntput(*mnt);
688 *mnt = mounted;
689 *dentry = dget(mounted->mnt_root);
690 return 1;
692 return 0;
695 static __always_inline void follow_dotdot(struct nameidata *nd)
697 while(1) {
698 struct vfsmount *parent;
699 struct dentry *old = nd->dentry;
701 read_lock(&current->fs->lock);
702 if (nd->dentry == current->fs->root &&
703 nd->mnt == current->fs->rootmnt) {
704 read_unlock(&current->fs->lock);
705 break;
707 read_unlock(&current->fs->lock);
708 spin_lock(&dcache_lock);
709 if (nd->dentry != nd->mnt->mnt_root) {
710 nd->dentry = dget(nd->dentry->d_parent);
711 spin_unlock(&dcache_lock);
712 dput(old);
713 break;
715 spin_unlock(&dcache_lock);
716 spin_lock(&vfsmount_lock);
717 parent = nd->mnt->mnt_parent;
718 if (parent == nd->mnt) {
719 spin_unlock(&vfsmount_lock);
720 break;
722 mntget(parent);
723 nd->dentry = dget(nd->mnt->mnt_mountpoint);
724 spin_unlock(&vfsmount_lock);
725 dput(old);
726 mntput(nd->mnt);
727 nd->mnt = parent;
729 follow_mount(&nd->mnt, &nd->dentry);
733 * It's more convoluted than I'd like it to be, but... it's still fairly
734 * small and for now I'd prefer to have fast path as straight as possible.
735 * It _is_ time-critical.
737 static int do_lookup(struct nameidata *nd, struct qstr *name,
738 struct path *path)
740 struct vfsmount *mnt = nd->mnt;
741 struct dentry *dentry = __d_lookup(nd->dentry, name);
743 if (!dentry)
744 goto need_lookup;
745 if (dentry->d_op && dentry->d_op->d_revalidate)
746 goto need_revalidate;
747 done:
748 path->mnt = mnt;
749 path->dentry = dentry;
750 __follow_mount(path);
751 return 0;
753 need_lookup:
754 dentry = real_lookup(nd->dentry, name, nd);
755 if (IS_ERR(dentry))
756 goto fail;
757 goto done;
759 need_revalidate:
760 if (dentry->d_op->d_revalidate(dentry, nd))
761 goto done;
762 if (d_invalidate(dentry))
763 goto done;
764 dput(dentry);
765 goto need_lookup;
767 fail:
768 return PTR_ERR(dentry);
772 * Name resolution.
773 * This is the basic name resolution function, turning a pathname into
774 * the final dentry. We expect 'base' to be positive and a directory.
776 * Returns 0 and nd will have valid dentry and mnt on success.
777 * Returns error and drops reference to input namei data on failure.
779 static fastcall int __link_path_walk(const char * name, struct nameidata *nd)
781 struct path next;
782 struct inode *inode;
783 int err;
784 unsigned int lookup_flags = nd->flags;
786 while (*name=='/')
787 name++;
788 if (!*name)
789 goto return_reval;
791 inode = nd->dentry->d_inode;
792 if (nd->depth)
793 lookup_flags = LOOKUP_FOLLOW | (nd->flags & LOOKUP_CONTINUE);
795 /* At this point we know we have a real path component. */
796 for(;;) {
797 unsigned long hash;
798 struct qstr this;
799 unsigned int c;
801 nd->flags |= LOOKUP_CONTINUE;
802 err = exec_permission_lite(inode, nd);
803 if (err == -EAGAIN)
804 err = vfs_permission(nd, MAY_EXEC);
805 if (err)
806 break;
808 this.name = name;
809 c = *(const unsigned char *)name;
811 hash = init_name_hash();
812 do {
813 name++;
814 hash = partial_name_hash(c, hash);
815 c = *(const unsigned char *)name;
816 } while (c && (c != '/'));
817 this.len = name - (const char *) this.name;
818 this.hash = end_name_hash(hash);
820 /* remove trailing slashes? */
821 if (!c)
822 goto last_component;
823 while (*++name == '/');
824 if (!*name)
825 goto last_with_slashes;
828 * "." and ".." are special - ".." especially so because it has
829 * to be able to know about the current root directory and
830 * parent relationships.
832 if (this.name[0] == '.') switch (this.len) {
833 default:
834 break;
835 case 2:
836 if (this.name[1] != '.')
837 break;
838 follow_dotdot(nd);
839 inode = nd->dentry->d_inode;
840 /* fallthrough */
841 case 1:
842 continue;
845 * See if the low-level filesystem might want
846 * to use its own hash..
848 if (nd->dentry->d_op && nd->dentry->d_op->d_hash) {
849 err = nd->dentry->d_op->d_hash(nd->dentry, &this);
850 if (err < 0)
851 break;
853 /* This does the actual lookups.. */
854 err = do_lookup(nd, &this, &next);
855 if (err)
856 break;
858 err = -ENOENT;
859 inode = next.dentry->d_inode;
860 if (!inode)
861 goto out_dput;
862 err = -ENOTDIR;
863 if (!inode->i_op)
864 goto out_dput;
866 if (inode->i_op->follow_link) {
867 err = do_follow_link(&next, nd);
868 if (err)
869 goto return_err;
870 err = -ENOENT;
871 inode = nd->dentry->d_inode;
872 if (!inode)
873 break;
874 err = -ENOTDIR;
875 if (!inode->i_op)
876 break;
877 } else
878 path_to_nameidata(&next, nd);
879 err = -ENOTDIR;
880 if (!inode->i_op->lookup)
881 break;
882 continue;
883 /* here ends the main loop */
885 last_with_slashes:
886 lookup_flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY;
887 last_component:
888 /* Clear LOOKUP_CONTINUE iff it was previously unset */
889 nd->flags &= lookup_flags | ~LOOKUP_CONTINUE;
890 if (lookup_flags & LOOKUP_PARENT)
891 goto lookup_parent;
892 if (this.name[0] == '.') switch (this.len) {
893 default:
894 break;
895 case 2:
896 if (this.name[1] != '.')
897 break;
898 follow_dotdot(nd);
899 inode = nd->dentry->d_inode;
900 /* fallthrough */
901 case 1:
902 goto return_reval;
904 if (nd->dentry->d_op && nd->dentry->d_op->d_hash) {
905 err = nd->dentry->d_op->d_hash(nd->dentry, &this);
906 if (err < 0)
907 break;
909 err = do_lookup(nd, &this, &next);
910 if (err)
911 break;
912 inode = next.dentry->d_inode;
913 if ((lookup_flags & LOOKUP_FOLLOW)
914 && inode && inode->i_op && inode->i_op->follow_link) {
915 err = do_follow_link(&next, nd);
916 if (err)
917 goto return_err;
918 inode = nd->dentry->d_inode;
919 } else
920 path_to_nameidata(&next, nd);
921 err = -ENOENT;
922 if (!inode)
923 break;
924 if (lookup_flags & LOOKUP_DIRECTORY) {
925 err = -ENOTDIR;
926 if (!inode->i_op || !inode->i_op->lookup)
927 break;
929 goto return_base;
930 lookup_parent:
931 nd->last = this;
932 nd->last_type = LAST_NORM;
933 if (this.name[0] != '.')
934 goto return_base;
935 if (this.len == 1)
936 nd->last_type = LAST_DOT;
937 else if (this.len == 2 && this.name[1] == '.')
938 nd->last_type = LAST_DOTDOT;
939 else
940 goto return_base;
941 return_reval:
943 * We bypassed the ordinary revalidation routines.
944 * We may need to check the cached dentry for staleness.
946 if (nd->dentry && nd->dentry->d_sb &&
947 (nd->dentry->d_sb->s_type->fs_flags & FS_REVAL_DOT)) {
948 err = -ESTALE;
949 /* Note: we do not d_invalidate() */
950 if (!nd->dentry->d_op->d_revalidate(nd->dentry, nd))
951 break;
953 return_base:
954 return 0;
955 out_dput:
956 dput_path(&next, nd);
957 break;
959 path_release(nd);
960 return_err:
961 return err;
965 * Wrapper to retry pathname resolution whenever the underlying
966 * file system returns an ESTALE.
968 * Retry the whole path once, forcing real lookup requests
969 * instead of relying on the dcache.
971 int fastcall link_path_walk(const char *name, struct nameidata *nd)
973 struct nameidata save = *nd;
974 int result;
976 /* make sure the stuff we saved doesn't go away */
977 dget(save.dentry);
978 mntget(save.mnt);
980 result = __link_path_walk(name, nd);
981 if (result == -ESTALE) {
982 *nd = save;
983 dget(nd->dentry);
984 mntget(nd->mnt);
985 nd->flags |= LOOKUP_REVAL;
986 result = __link_path_walk(name, nd);
989 dput(save.dentry);
990 mntput(save.mnt);
992 return result;
995 int fastcall path_walk(const char * name, struct nameidata *nd)
997 current->total_link_count = 0;
998 return link_path_walk(name, nd);
1002 * SMP-safe: Returns 1 and nd will have valid dentry and mnt, if
1003 * everything is done. Returns 0 and drops input nd, if lookup failed;
1005 static int __emul_lookup_dentry(const char *name, struct nameidata *nd)
1007 if (path_walk(name, nd))
1008 return 0; /* something went wrong... */
1010 if (!nd->dentry->d_inode || S_ISDIR(nd->dentry->d_inode->i_mode)) {
1011 struct dentry *old_dentry = nd->dentry;
1012 struct vfsmount *old_mnt = nd->mnt;
1013 struct qstr last = nd->last;
1014 int last_type = nd->last_type;
1016 * NAME was not found in alternate root or it's a directory. Try to find
1017 * it in the normal root:
1019 nd->last_type = LAST_ROOT;
1020 read_lock(&current->fs->lock);
1021 nd->mnt = mntget(current->fs->rootmnt);
1022 nd->dentry = dget(current->fs->root);
1023 read_unlock(&current->fs->lock);
1024 if (path_walk(name, nd) == 0) {
1025 if (nd->dentry->d_inode) {
1026 dput(old_dentry);
1027 mntput(old_mnt);
1028 return 1;
1030 path_release(nd);
1032 nd->dentry = old_dentry;
1033 nd->mnt = old_mnt;
1034 nd->last = last;
1035 nd->last_type = last_type;
1037 return 1;
1040 void set_fs_altroot(void)
1042 char *emul = __emul_prefix();
1043 struct nameidata nd;
1044 struct vfsmount *mnt = NULL, *oldmnt;
1045 struct dentry *dentry = NULL, *olddentry;
1046 int err;
1048 if (!emul)
1049 goto set_it;
1050 err = path_lookup(emul, LOOKUP_FOLLOW|LOOKUP_DIRECTORY|LOOKUP_NOALT, &nd);
1051 if (!err) {
1052 mnt = nd.mnt;
1053 dentry = nd.dentry;
1055 set_it:
1056 write_lock(&current->fs->lock);
1057 oldmnt = current->fs->altrootmnt;
1058 olddentry = current->fs->altroot;
1059 current->fs->altrootmnt = mnt;
1060 current->fs->altroot = dentry;
1061 write_unlock(&current->fs->lock);
1062 if (olddentry) {
1063 dput(olddentry);
1064 mntput(oldmnt);
1068 /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
1069 static int fastcall do_path_lookup(int dfd, const char *name,
1070 unsigned int flags, struct nameidata *nd)
1072 int retval = 0;
1073 int fput_needed;
1074 struct file *file;
1076 nd->last_type = LAST_ROOT; /* if there are only slashes... */
1077 nd->flags = flags;
1078 nd->depth = 0;
1080 if (*name=='/') {
1081 read_lock(&current->fs->lock);
1082 if (current->fs->altroot && !(nd->flags & LOOKUP_NOALT)) {
1083 nd->mnt = mntget(current->fs->altrootmnt);
1084 nd->dentry = dget(current->fs->altroot);
1085 read_unlock(&current->fs->lock);
1086 if (__emul_lookup_dentry(name,nd))
1087 goto out; /* found in altroot */
1088 read_lock(&current->fs->lock);
1090 nd->mnt = mntget(current->fs->rootmnt);
1091 nd->dentry = dget(current->fs->root);
1092 read_unlock(&current->fs->lock);
1093 } else if (dfd == AT_FDCWD) {
1094 read_lock(&current->fs->lock);
1095 nd->mnt = mntget(current->fs->pwdmnt);
1096 nd->dentry = dget(current->fs->pwd);
1097 read_unlock(&current->fs->lock);
1098 } else {
1099 struct dentry *dentry;
1101 file = fget_light(dfd, &fput_needed);
1102 retval = -EBADF;
1103 if (!file)
1104 goto out_fail;
1106 dentry = file->f_dentry;
1108 retval = -ENOTDIR;
1109 if (!S_ISDIR(dentry->d_inode->i_mode))
1110 goto fput_fail;
1112 retval = file_permission(file, MAY_EXEC);
1113 if (retval)
1114 goto fput_fail;
1116 nd->mnt = mntget(file->f_vfsmnt);
1117 nd->dentry = dget(dentry);
1119 fput_light(file, fput_needed);
1121 current->total_link_count = 0;
1122 retval = link_path_walk(name, nd);
1123 out:
1124 if (likely(retval == 0)) {
1125 if (unlikely(current->audit_context && nd && nd->dentry &&
1126 nd->dentry->d_inode))
1127 audit_inode(name, nd->dentry->d_inode, flags);
1129 out_fail:
1130 return retval;
1132 fput_fail:
1133 fput_light(file, fput_needed);
1134 goto out_fail;
1137 int fastcall path_lookup(const char *name, unsigned int flags,
1138 struct nameidata *nd)
1140 return do_path_lookup(AT_FDCWD, name, flags, nd);
1143 static int __path_lookup_intent_open(int dfd, const char *name,
1144 unsigned int lookup_flags, struct nameidata *nd,
1145 int open_flags, int create_mode)
1147 struct file *filp = get_empty_filp();
1148 int err;
1150 if (filp == NULL)
1151 return -ENFILE;
1152 nd->intent.open.file = filp;
1153 nd->intent.open.flags = open_flags;
1154 nd->intent.open.create_mode = create_mode;
1155 err = do_path_lookup(dfd, name, lookup_flags|LOOKUP_OPEN, nd);
1156 if (IS_ERR(nd->intent.open.file)) {
1157 if (err == 0) {
1158 err = PTR_ERR(nd->intent.open.file);
1159 path_release(nd);
1161 } else if (err != 0)
1162 release_open_intent(nd);
1163 return err;
1167 * path_lookup_open - lookup a file path with open intent
1168 * @dfd: the directory to use as base, or AT_FDCWD
1169 * @name: pointer to file name
1170 * @lookup_flags: lookup intent flags
1171 * @nd: pointer to nameidata
1172 * @open_flags: open intent flags
1174 int path_lookup_open(int dfd, const char *name, unsigned int lookup_flags,
1175 struct nameidata *nd, int open_flags)
1177 return __path_lookup_intent_open(dfd, name, lookup_flags, nd,
1178 open_flags, 0);
1182 * path_lookup_create - lookup a file path with open + create intent
1183 * @dfd: the directory to use as base, or AT_FDCWD
1184 * @name: pointer to file name
1185 * @lookup_flags: lookup intent flags
1186 * @nd: pointer to nameidata
1187 * @open_flags: open intent flags
1188 * @create_mode: create intent flags
1190 static int path_lookup_create(int dfd, const char *name,
1191 unsigned int lookup_flags, struct nameidata *nd,
1192 int open_flags, int create_mode)
1194 return __path_lookup_intent_open(dfd, name, lookup_flags|LOOKUP_CREATE,
1195 nd, open_flags, create_mode);
1198 int __user_path_lookup_open(const char __user *name, unsigned int lookup_flags,
1199 struct nameidata *nd, int open_flags)
1201 char *tmp = getname(name);
1202 int err = PTR_ERR(tmp);
1204 if (!IS_ERR(tmp)) {
1205 err = __path_lookup_intent_open(AT_FDCWD, tmp, lookup_flags, nd, open_flags, 0);
1206 putname(tmp);
1208 return err;
1212 * Restricted form of lookup. Doesn't follow links, single-component only,
1213 * needs parent already locked. Doesn't follow mounts.
1214 * SMP-safe.
1216 static struct dentry * __lookup_hash(struct qstr *name, struct dentry * base, struct nameidata *nd)
1218 struct dentry * dentry;
1219 struct inode *inode;
1220 int err;
1222 inode = base->d_inode;
1223 err = permission(inode, MAY_EXEC, nd);
1224 dentry = ERR_PTR(err);
1225 if (err)
1226 goto out;
1229 * See if the low-level filesystem might want
1230 * to use its own hash..
1232 if (base->d_op && base->d_op->d_hash) {
1233 err = base->d_op->d_hash(base, name);
1234 dentry = ERR_PTR(err);
1235 if (err < 0)
1236 goto out;
1239 dentry = cached_lookup(base, name, nd);
1240 if (!dentry) {
1241 struct dentry *new = d_alloc(base, name);
1242 dentry = ERR_PTR(-ENOMEM);
1243 if (!new)
1244 goto out;
1245 dentry = inode->i_op->lookup(inode, new, nd);
1246 if (!dentry)
1247 dentry = new;
1248 else
1249 dput(new);
1251 out:
1252 return dentry;
1255 struct dentry * lookup_hash(struct nameidata *nd)
1257 return __lookup_hash(&nd->last, nd->dentry, nd);
1260 /* SMP-safe */
1261 struct dentry * lookup_one_len(const char * name, struct dentry * base, int len)
1263 unsigned long hash;
1264 struct qstr this;
1265 unsigned int c;
1267 this.name = name;
1268 this.len = len;
1269 if (!len)
1270 goto access;
1272 hash = init_name_hash();
1273 while (len--) {
1274 c = *(const unsigned char *)name++;
1275 if (c == '/' || c == '\0')
1276 goto access;
1277 hash = partial_name_hash(c, hash);
1279 this.hash = end_name_hash(hash);
1281 return __lookup_hash(&this, base, NULL);
1282 access:
1283 return ERR_PTR(-EACCES);
1287 * namei()
1289 * is used by most simple commands to get the inode of a specified name.
1290 * Open, link etc use their own routines, but this is enough for things
1291 * like 'chmod' etc.
1293 * namei exists in two versions: namei/lnamei. The only difference is
1294 * that namei follows links, while lnamei does not.
1295 * SMP-safe
1297 int fastcall __user_walk_fd(int dfd, const char __user *name, unsigned flags,
1298 struct nameidata *nd)
1300 char *tmp = getname(name);
1301 int err = PTR_ERR(tmp);
1303 if (!IS_ERR(tmp)) {
1304 err = do_path_lookup(dfd, tmp, flags, nd);
1305 putname(tmp);
1307 return err;
1310 int fastcall __user_walk(const char __user *name, unsigned flags, struct nameidata *nd)
1312 return __user_walk_fd(AT_FDCWD, name, flags, nd);
1316 * It's inline, so penalty for filesystems that don't use sticky bit is
1317 * minimal.
1319 static inline int check_sticky(struct inode *dir, struct inode *inode)
1321 if (!(dir->i_mode & S_ISVTX))
1322 return 0;
1323 if (inode->i_uid == current->fsuid)
1324 return 0;
1325 if (dir->i_uid == current->fsuid)
1326 return 0;
1327 return !capable(CAP_FOWNER);
1331 * Check whether we can remove a link victim from directory dir, check
1332 * whether the type of victim is right.
1333 * 1. We can't do it if dir is read-only (done in permission())
1334 * 2. We should have write and exec permissions on dir
1335 * 3. We can't remove anything from append-only dir
1336 * 4. We can't do anything with immutable dir (done in permission())
1337 * 5. If the sticky bit on dir is set we should either
1338 * a. be owner of dir, or
1339 * b. be owner of victim, or
1340 * c. have CAP_FOWNER capability
1341 * 6. If the victim is append-only or immutable we can't do antyhing with
1342 * links pointing to it.
1343 * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR.
1344 * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR.
1345 * 9. We can't remove a root or mountpoint.
1346 * 10. We don't allow removal of NFS sillyrenamed files; it's handled by
1347 * nfs_async_unlink().
1349 static int may_delete(struct inode *dir,struct dentry *victim,int isdir)
1351 int error;
1353 if (!victim->d_inode)
1354 return -ENOENT;
1356 BUG_ON(victim->d_parent->d_inode != dir);
1358 error = permission(dir,MAY_WRITE | MAY_EXEC, NULL);
1359 if (error)
1360 return error;
1361 if (IS_APPEND(dir))
1362 return -EPERM;
1363 if (check_sticky(dir, victim->d_inode)||IS_APPEND(victim->d_inode)||
1364 IS_IMMUTABLE(victim->d_inode))
1365 return -EPERM;
1366 if (isdir) {
1367 if (!S_ISDIR(victim->d_inode->i_mode))
1368 return -ENOTDIR;
1369 if (IS_ROOT(victim))
1370 return -EBUSY;
1371 } else if (S_ISDIR(victim->d_inode->i_mode))
1372 return -EISDIR;
1373 if (IS_DEADDIR(dir))
1374 return -ENOENT;
1375 if (victim->d_flags & DCACHE_NFSFS_RENAMED)
1376 return -EBUSY;
1377 return 0;
1380 /* Check whether we can create an object with dentry child in directory
1381 * dir.
1382 * 1. We can't do it if child already exists (open has special treatment for
1383 * this case, but since we are inlined it's OK)
1384 * 2. We can't do it if dir is read-only (done in permission())
1385 * 3. We should have write and exec permissions on dir
1386 * 4. We can't do it if dir is immutable (done in permission())
1388 static inline int may_create(struct inode *dir, struct dentry *child,
1389 struct nameidata *nd)
1391 if (child->d_inode)
1392 return -EEXIST;
1393 if (IS_DEADDIR(dir))
1394 return -ENOENT;
1395 return permission(dir,MAY_WRITE | MAY_EXEC, nd);
1399 * O_DIRECTORY translates into forcing a directory lookup.
1401 static inline int lookup_flags(unsigned int f)
1403 unsigned long retval = LOOKUP_FOLLOW;
1405 if (f & O_NOFOLLOW)
1406 retval &= ~LOOKUP_FOLLOW;
1408 if (f & O_DIRECTORY)
1409 retval |= LOOKUP_DIRECTORY;
1411 return retval;
1415 * p1 and p2 should be directories on the same fs.
1417 struct dentry *lock_rename(struct dentry *p1, struct dentry *p2)
1419 struct dentry *p;
1421 if (p1 == p2) {
1422 mutex_lock(&p1->d_inode->i_mutex);
1423 return NULL;
1426 down(&p1->d_inode->i_sb->s_vfs_rename_sem);
1428 for (p = p1; p->d_parent != p; p = p->d_parent) {
1429 if (p->d_parent == p2) {
1430 mutex_lock(&p2->d_inode->i_mutex);
1431 mutex_lock(&p1->d_inode->i_mutex);
1432 return p;
1436 for (p = p2; p->d_parent != p; p = p->d_parent) {
1437 if (p->d_parent == p1) {
1438 mutex_lock(&p1->d_inode->i_mutex);
1439 mutex_lock(&p2->d_inode->i_mutex);
1440 return p;
1444 mutex_lock(&p1->d_inode->i_mutex);
1445 mutex_lock(&p2->d_inode->i_mutex);
1446 return NULL;
1449 void unlock_rename(struct dentry *p1, struct dentry *p2)
1451 mutex_unlock(&p1->d_inode->i_mutex);
1452 if (p1 != p2) {
1453 mutex_unlock(&p2->d_inode->i_mutex);
1454 up(&p1->d_inode->i_sb->s_vfs_rename_sem);
1458 int vfs_create(struct inode *dir, struct dentry *dentry, int mode,
1459 struct nameidata *nd)
1461 int error = may_create(dir, dentry, nd);
1463 if (error)
1464 return error;
1466 if (!dir->i_op || !dir->i_op->create)
1467 return -EACCES; /* shouldn't it be ENOSYS? */
1468 mode &= S_IALLUGO;
1469 mode |= S_IFREG;
1470 error = security_inode_create(dir, dentry, mode);
1471 if (error)
1472 return error;
1473 DQUOT_INIT(dir);
1474 error = dir->i_op->create(dir, dentry, mode, nd);
1475 if (!error)
1476 fsnotify_create(dir, dentry->d_name.name);
1477 return error;
1480 int may_open(struct nameidata *nd, int acc_mode, int flag)
1482 struct dentry *dentry = nd->dentry;
1483 struct inode *inode = dentry->d_inode;
1484 int error;
1486 if (!inode)
1487 return -ENOENT;
1489 if (S_ISLNK(inode->i_mode))
1490 return -ELOOP;
1492 if (S_ISDIR(inode->i_mode) && (flag & FMODE_WRITE))
1493 return -EISDIR;
1495 error = vfs_permission(nd, acc_mode);
1496 if (error)
1497 return error;
1500 * FIFO's, sockets and device files are special: they don't
1501 * actually live on the filesystem itself, and as such you
1502 * can write to them even if the filesystem is read-only.
1504 if (S_ISFIFO(inode->i_mode) || S_ISSOCK(inode->i_mode)) {
1505 flag &= ~O_TRUNC;
1506 } else if (S_ISBLK(inode->i_mode) || S_ISCHR(inode->i_mode)) {
1507 if (nd->mnt->mnt_flags & MNT_NODEV)
1508 return -EACCES;
1510 flag &= ~O_TRUNC;
1511 } else if (IS_RDONLY(inode) && (flag & FMODE_WRITE))
1512 return -EROFS;
1514 * An append-only file must be opened in append mode for writing.
1516 if (IS_APPEND(inode)) {
1517 if ((flag & FMODE_WRITE) && !(flag & O_APPEND))
1518 return -EPERM;
1519 if (flag & O_TRUNC)
1520 return -EPERM;
1523 /* O_NOATIME can only be set by the owner or superuser */
1524 if (flag & O_NOATIME)
1525 if (current->fsuid != inode->i_uid && !capable(CAP_FOWNER))
1526 return -EPERM;
1529 * Ensure there are no outstanding leases on the file.
1531 error = break_lease(inode, flag);
1532 if (error)
1533 return error;
1535 if (flag & O_TRUNC) {
1536 error = get_write_access(inode);
1537 if (error)
1538 return error;
1541 * Refuse to truncate files with mandatory locks held on them.
1543 error = locks_verify_locked(inode);
1544 if (!error) {
1545 DQUOT_INIT(inode);
1547 error = do_truncate(dentry, 0, ATTR_MTIME|ATTR_CTIME, NULL);
1549 put_write_access(inode);
1550 if (error)
1551 return error;
1552 } else
1553 if (flag & FMODE_WRITE)
1554 DQUOT_INIT(inode);
1556 return 0;
1560 * open_namei()
1562 * namei for open - this is in fact almost the whole open-routine.
1564 * Note that the low bits of "flag" aren't the same as in the open
1565 * system call - they are 00 - no permissions needed
1566 * 01 - read permission needed
1567 * 10 - write permission needed
1568 * 11 - read/write permissions needed
1569 * which is a lot more logical, and also allows the "no perm" needed
1570 * for symlinks (where the permissions are checked later).
1571 * SMP-safe
1573 int open_namei(int dfd, const char *pathname, int flag,
1574 int mode, struct nameidata *nd)
1576 int acc_mode, error;
1577 struct path path;
1578 struct dentry *dir;
1579 int count = 0;
1581 acc_mode = ACC_MODE(flag);
1583 /* O_TRUNC implies we need access checks for write permissions */
1584 if (flag & O_TRUNC)
1585 acc_mode |= MAY_WRITE;
1587 /* Allow the LSM permission hook to distinguish append
1588 access from general write access. */
1589 if (flag & O_APPEND)
1590 acc_mode |= MAY_APPEND;
1593 * The simplest case - just a plain lookup.
1595 if (!(flag & O_CREAT)) {
1596 error = path_lookup_open(dfd, pathname, lookup_flags(flag),
1597 nd, flag);
1598 if (error)
1599 return error;
1600 goto ok;
1604 * Create - we need to know the parent.
1606 error = path_lookup_create(dfd,pathname,LOOKUP_PARENT,nd,flag,mode);
1607 if (error)
1608 return error;
1611 * We have the parent and last component. First of all, check
1612 * that we are not asked to creat(2) an obvious directory - that
1613 * will not do.
1615 error = -EISDIR;
1616 if (nd->last_type != LAST_NORM || nd->last.name[nd->last.len])
1617 goto exit;
1619 dir = nd->dentry;
1620 nd->flags &= ~LOOKUP_PARENT;
1621 mutex_lock(&dir->d_inode->i_mutex);
1622 path.dentry = lookup_hash(nd);
1623 path.mnt = nd->mnt;
1625 do_last:
1626 error = PTR_ERR(path.dentry);
1627 if (IS_ERR(path.dentry)) {
1628 mutex_unlock(&dir->d_inode->i_mutex);
1629 goto exit;
1632 if (IS_ERR(nd->intent.open.file)) {
1633 mutex_unlock(&dir->d_inode->i_mutex);
1634 error = PTR_ERR(nd->intent.open.file);
1635 goto exit_dput;
1638 /* Negative dentry, just create the file */
1639 if (!path.dentry->d_inode) {
1640 if (!IS_POSIXACL(dir->d_inode))
1641 mode &= ~current->fs->umask;
1642 error = vfs_create(dir->d_inode, path.dentry, mode, nd);
1643 mutex_unlock(&dir->d_inode->i_mutex);
1644 dput(nd->dentry);
1645 nd->dentry = path.dentry;
1646 if (error)
1647 goto exit;
1648 /* Don't check for write permission, don't truncate */
1649 acc_mode = 0;
1650 flag &= ~O_TRUNC;
1651 goto ok;
1655 * It already exists.
1657 mutex_unlock(&dir->d_inode->i_mutex);
1659 error = -EEXIST;
1660 if (flag & O_EXCL)
1661 goto exit_dput;
1663 if (__follow_mount(&path)) {
1664 error = -ELOOP;
1665 if (flag & O_NOFOLLOW)
1666 goto exit_dput;
1668 error = -ENOENT;
1669 if (!path.dentry->d_inode)
1670 goto exit_dput;
1671 if (path.dentry->d_inode->i_op && path.dentry->d_inode->i_op->follow_link)
1672 goto do_link;
1674 path_to_nameidata(&path, nd);
1675 error = -EISDIR;
1676 if (path.dentry->d_inode && S_ISDIR(path.dentry->d_inode->i_mode))
1677 goto exit;
1679 error = may_open(nd, acc_mode, flag);
1680 if (error)
1681 goto exit;
1682 return 0;
1684 exit_dput:
1685 dput_path(&path, nd);
1686 exit:
1687 if (!IS_ERR(nd->intent.open.file))
1688 release_open_intent(nd);
1689 path_release(nd);
1690 return error;
1692 do_link:
1693 error = -ELOOP;
1694 if (flag & O_NOFOLLOW)
1695 goto exit_dput;
1697 * This is subtle. Instead of calling do_follow_link() we do the
1698 * thing by hands. The reason is that this way we have zero link_count
1699 * and path_walk() (called from ->follow_link) honoring LOOKUP_PARENT.
1700 * After that we have the parent and last component, i.e.
1701 * we are in the same situation as after the first path_walk().
1702 * Well, almost - if the last component is normal we get its copy
1703 * stored in nd->last.name and we will have to putname() it when we
1704 * are done. Procfs-like symlinks just set LAST_BIND.
1706 nd->flags |= LOOKUP_PARENT;
1707 error = security_inode_follow_link(path.dentry, nd);
1708 if (error)
1709 goto exit_dput;
1710 error = __do_follow_link(&path, nd);
1711 if (error) {
1712 /* Does someone understand code flow here? Or it is only
1713 * me so stupid? Anathema to whoever designed this non-sense
1714 * with "intent.open".
1716 release_open_intent(nd);
1717 return error;
1719 nd->flags &= ~LOOKUP_PARENT;
1720 if (nd->last_type == LAST_BIND)
1721 goto ok;
1722 error = -EISDIR;
1723 if (nd->last_type != LAST_NORM)
1724 goto exit;
1725 if (nd->last.name[nd->last.len]) {
1726 __putname(nd->last.name);
1727 goto exit;
1729 error = -ELOOP;
1730 if (count++==32) {
1731 __putname(nd->last.name);
1732 goto exit;
1734 dir = nd->dentry;
1735 mutex_lock(&dir->d_inode->i_mutex);
1736 path.dentry = lookup_hash(nd);
1737 path.mnt = nd->mnt;
1738 __putname(nd->last.name);
1739 goto do_last;
1743 * lookup_create - lookup a dentry, creating it if it doesn't exist
1744 * @nd: nameidata info
1745 * @is_dir: directory flag
1747 * Simple function to lookup and return a dentry and create it
1748 * if it doesn't exist. Is SMP-safe.
1750 * Returns with nd->dentry->d_inode->i_mutex locked.
1752 struct dentry *lookup_create(struct nameidata *nd, int is_dir)
1754 struct dentry *dentry = ERR_PTR(-EEXIST);
1756 mutex_lock(&nd->dentry->d_inode->i_mutex);
1758 * Yucky last component or no last component at all?
1759 * (foo/., foo/.., /////)
1761 if (nd->last_type != LAST_NORM)
1762 goto fail;
1763 nd->flags &= ~LOOKUP_PARENT;
1766 * Do the final lookup.
1768 dentry = lookup_hash(nd);
1769 if (IS_ERR(dentry))
1770 goto fail;
1773 * Special case - lookup gave negative, but... we had foo/bar/
1774 * From the vfs_mknod() POV we just have a negative dentry -
1775 * all is fine. Let's be bastards - you had / on the end, you've
1776 * been asking for (non-existent) directory. -ENOENT for you.
1778 if (!is_dir && nd->last.name[nd->last.len] && !dentry->d_inode)
1779 goto enoent;
1780 return dentry;
1781 enoent:
1782 dput(dentry);
1783 dentry = ERR_PTR(-ENOENT);
1784 fail:
1785 return dentry;
1787 EXPORT_SYMBOL_GPL(lookup_create);
1789 int vfs_mknod(struct inode *dir, struct dentry *dentry, int mode, dev_t dev)
1791 int error = may_create(dir, dentry, NULL);
1793 if (error)
1794 return error;
1796 if ((S_ISCHR(mode) || S_ISBLK(mode)) && !capable(CAP_MKNOD))
1797 return -EPERM;
1799 if (!dir->i_op || !dir->i_op->mknod)
1800 return -EPERM;
1802 error = security_inode_mknod(dir, dentry, mode, dev);
1803 if (error)
1804 return error;
1806 DQUOT_INIT(dir);
1807 error = dir->i_op->mknod(dir, dentry, mode, dev);
1808 if (!error)
1809 fsnotify_create(dir, dentry->d_name.name);
1810 return error;
1813 asmlinkage long sys_mknodat(int dfd, const char __user *filename, int mode,
1814 unsigned dev)
1816 int error = 0;
1817 char * tmp;
1818 struct dentry * dentry;
1819 struct nameidata nd;
1821 if (S_ISDIR(mode))
1822 return -EPERM;
1823 tmp = getname(filename);
1824 if (IS_ERR(tmp))
1825 return PTR_ERR(tmp);
1827 error = do_path_lookup(dfd, tmp, LOOKUP_PARENT, &nd);
1828 if (error)
1829 goto out;
1830 dentry = lookup_create(&nd, 0);
1831 error = PTR_ERR(dentry);
1833 if (!IS_POSIXACL(nd.dentry->d_inode))
1834 mode &= ~current->fs->umask;
1835 if (!IS_ERR(dentry)) {
1836 switch (mode & S_IFMT) {
1837 case 0: case S_IFREG:
1838 error = vfs_create(nd.dentry->d_inode,dentry,mode,&nd);
1839 break;
1840 case S_IFCHR: case S_IFBLK:
1841 error = vfs_mknod(nd.dentry->d_inode,dentry,mode,
1842 new_decode_dev(dev));
1843 break;
1844 case S_IFIFO: case S_IFSOCK:
1845 error = vfs_mknod(nd.dentry->d_inode,dentry,mode,0);
1846 break;
1847 case S_IFDIR:
1848 error = -EPERM;
1849 break;
1850 default:
1851 error = -EINVAL;
1853 dput(dentry);
1855 mutex_unlock(&nd.dentry->d_inode->i_mutex);
1856 path_release(&nd);
1857 out:
1858 putname(tmp);
1860 return error;
1863 asmlinkage long sys_mknod(const char __user *filename, int mode, unsigned dev)
1865 return sys_mknodat(AT_FDCWD, filename, mode, dev);
1868 int vfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
1870 int error = may_create(dir, dentry, NULL);
1872 if (error)
1873 return error;
1875 if (!dir->i_op || !dir->i_op->mkdir)
1876 return -EPERM;
1878 mode &= (S_IRWXUGO|S_ISVTX);
1879 error = security_inode_mkdir(dir, dentry, mode);
1880 if (error)
1881 return error;
1883 DQUOT_INIT(dir);
1884 error = dir->i_op->mkdir(dir, dentry, mode);
1885 if (!error)
1886 fsnotify_mkdir(dir, dentry->d_name.name);
1887 return error;
1890 asmlinkage long sys_mkdirat(int dfd, const char __user *pathname, int mode)
1892 int error = 0;
1893 char * tmp;
1895 tmp = getname(pathname);
1896 error = PTR_ERR(tmp);
1897 if (!IS_ERR(tmp)) {
1898 struct dentry *dentry;
1899 struct nameidata nd;
1901 error = do_path_lookup(dfd, tmp, LOOKUP_PARENT, &nd);
1902 if (error)
1903 goto out;
1904 dentry = lookup_create(&nd, 1);
1905 error = PTR_ERR(dentry);
1906 if (!IS_ERR(dentry)) {
1907 if (!IS_POSIXACL(nd.dentry->d_inode))
1908 mode &= ~current->fs->umask;
1909 error = vfs_mkdir(nd.dentry->d_inode, dentry, mode);
1910 dput(dentry);
1912 mutex_unlock(&nd.dentry->d_inode->i_mutex);
1913 path_release(&nd);
1914 out:
1915 putname(tmp);
1918 return error;
1921 asmlinkage long sys_mkdir(const char __user *pathname, int mode)
1923 return sys_mkdirat(AT_FDCWD, pathname, mode);
1927 * We try to drop the dentry early: we should have
1928 * a usage count of 2 if we're the only user of this
1929 * dentry, and if that is true (possibly after pruning
1930 * the dcache), then we drop the dentry now.
1932 * A low-level filesystem can, if it choses, legally
1933 * do a
1935 * if (!d_unhashed(dentry))
1936 * return -EBUSY;
1938 * if it cannot handle the case of removing a directory
1939 * that is still in use by something else..
1941 void dentry_unhash(struct dentry *dentry)
1943 dget(dentry);
1944 if (atomic_read(&dentry->d_count))
1945 shrink_dcache_parent(dentry);
1946 spin_lock(&dcache_lock);
1947 spin_lock(&dentry->d_lock);
1948 if (atomic_read(&dentry->d_count) == 2)
1949 __d_drop(dentry);
1950 spin_unlock(&dentry->d_lock);
1951 spin_unlock(&dcache_lock);
1954 int vfs_rmdir(struct inode *dir, struct dentry *dentry)
1956 int error = may_delete(dir, dentry, 1);
1958 if (error)
1959 return error;
1961 if (!dir->i_op || !dir->i_op->rmdir)
1962 return -EPERM;
1964 DQUOT_INIT(dir);
1966 mutex_lock(&dentry->d_inode->i_mutex);
1967 dentry_unhash(dentry);
1968 if (d_mountpoint(dentry))
1969 error = -EBUSY;
1970 else {
1971 error = security_inode_rmdir(dir, dentry);
1972 if (!error) {
1973 error = dir->i_op->rmdir(dir, dentry);
1974 if (!error)
1975 dentry->d_inode->i_flags |= S_DEAD;
1978 mutex_unlock(&dentry->d_inode->i_mutex);
1979 if (!error) {
1980 d_delete(dentry);
1982 dput(dentry);
1984 return error;
1987 static long do_rmdir(int dfd, const char __user *pathname)
1989 int error = 0;
1990 char * name;
1991 struct dentry *dentry;
1992 struct nameidata nd;
1994 name = getname(pathname);
1995 if(IS_ERR(name))
1996 return PTR_ERR(name);
1998 error = do_path_lookup(dfd, name, LOOKUP_PARENT, &nd);
1999 if (error)
2000 goto exit;
2002 switch(nd.last_type) {
2003 case LAST_DOTDOT:
2004 error = -ENOTEMPTY;
2005 goto exit1;
2006 case LAST_DOT:
2007 error = -EINVAL;
2008 goto exit1;
2009 case LAST_ROOT:
2010 error = -EBUSY;
2011 goto exit1;
2013 mutex_lock(&nd.dentry->d_inode->i_mutex);
2014 dentry = lookup_hash(&nd);
2015 error = PTR_ERR(dentry);
2016 if (!IS_ERR(dentry)) {
2017 error = vfs_rmdir(nd.dentry->d_inode, dentry);
2018 dput(dentry);
2020 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2021 exit1:
2022 path_release(&nd);
2023 exit:
2024 putname(name);
2025 return error;
2028 asmlinkage long sys_rmdir(const char __user *pathname)
2030 return do_rmdir(AT_FDCWD, pathname);
2033 int vfs_unlink(struct inode *dir, struct dentry *dentry)
2035 int error = may_delete(dir, dentry, 0);
2037 if (error)
2038 return error;
2040 if (!dir->i_op || !dir->i_op->unlink)
2041 return -EPERM;
2043 DQUOT_INIT(dir);
2045 mutex_lock(&dentry->d_inode->i_mutex);
2046 if (d_mountpoint(dentry))
2047 error = -EBUSY;
2048 else {
2049 error = security_inode_unlink(dir, dentry);
2050 if (!error)
2051 error = dir->i_op->unlink(dir, dentry);
2053 mutex_unlock(&dentry->d_inode->i_mutex);
2055 /* We don't d_delete() NFS sillyrenamed files--they still exist. */
2056 if (!error && !(dentry->d_flags & DCACHE_NFSFS_RENAMED)) {
2057 d_delete(dentry);
2060 return error;
2064 * Make sure that the actual truncation of the file will occur outside its
2065 * directory's i_mutex. Truncate can take a long time if there is a lot of
2066 * writeout happening, and we don't want to prevent access to the directory
2067 * while waiting on the I/O.
2069 static long do_unlinkat(int dfd, const char __user *pathname)
2071 int error = 0;
2072 char * name;
2073 struct dentry *dentry;
2074 struct nameidata nd;
2075 struct inode *inode = NULL;
2077 name = getname(pathname);
2078 if(IS_ERR(name))
2079 return PTR_ERR(name);
2081 error = do_path_lookup(dfd, name, LOOKUP_PARENT, &nd);
2082 if (error)
2083 goto exit;
2084 error = -EISDIR;
2085 if (nd.last_type != LAST_NORM)
2086 goto exit1;
2087 mutex_lock(&nd.dentry->d_inode->i_mutex);
2088 dentry = lookup_hash(&nd);
2089 error = PTR_ERR(dentry);
2090 if (!IS_ERR(dentry)) {
2091 /* Why not before? Because we want correct error value */
2092 if (nd.last.name[nd.last.len])
2093 goto slashes;
2094 inode = dentry->d_inode;
2095 if (inode)
2096 atomic_inc(&inode->i_count);
2097 error = vfs_unlink(nd.dentry->d_inode, dentry);
2098 exit2:
2099 dput(dentry);
2101 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2102 if (inode)
2103 iput(inode); /* truncate the inode here */
2104 exit1:
2105 path_release(&nd);
2106 exit:
2107 putname(name);
2108 return error;
2110 slashes:
2111 error = !dentry->d_inode ? -ENOENT :
2112 S_ISDIR(dentry->d_inode->i_mode) ? -EISDIR : -ENOTDIR;
2113 goto exit2;
2116 asmlinkage long sys_unlinkat(int dfd, const char __user *pathname, int flag)
2118 if ((flag & ~AT_REMOVEDIR) != 0)
2119 return -EINVAL;
2121 if (flag & AT_REMOVEDIR)
2122 return do_rmdir(dfd, pathname);
2124 return do_unlinkat(dfd, pathname);
2127 asmlinkage long sys_unlink(const char __user *pathname)
2129 return do_unlinkat(AT_FDCWD, pathname);
2132 int vfs_symlink(struct inode *dir, struct dentry *dentry, const char *oldname, int mode)
2134 int error = may_create(dir, dentry, NULL);
2136 if (error)
2137 return error;
2139 if (!dir->i_op || !dir->i_op->symlink)
2140 return -EPERM;
2142 error = security_inode_symlink(dir, dentry, oldname);
2143 if (error)
2144 return error;
2146 DQUOT_INIT(dir);
2147 error = dir->i_op->symlink(dir, dentry, oldname);
2148 if (!error)
2149 fsnotify_create(dir, dentry->d_name.name);
2150 return error;
2153 asmlinkage long sys_symlinkat(const char __user *oldname,
2154 int newdfd, const char __user *newname)
2156 int error = 0;
2157 char * from;
2158 char * to;
2160 from = getname(oldname);
2161 if(IS_ERR(from))
2162 return PTR_ERR(from);
2163 to = getname(newname);
2164 error = PTR_ERR(to);
2165 if (!IS_ERR(to)) {
2166 struct dentry *dentry;
2167 struct nameidata nd;
2169 error = do_path_lookup(newdfd, to, LOOKUP_PARENT, &nd);
2170 if (error)
2171 goto out;
2172 dentry = lookup_create(&nd, 0);
2173 error = PTR_ERR(dentry);
2174 if (!IS_ERR(dentry)) {
2175 error = vfs_symlink(nd.dentry->d_inode, dentry, from, S_IALLUGO);
2176 dput(dentry);
2178 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2179 path_release(&nd);
2180 out:
2181 putname(to);
2183 putname(from);
2184 return error;
2187 asmlinkage long sys_symlink(const char __user *oldname, const char __user *newname)
2189 return sys_symlinkat(oldname, AT_FDCWD, newname);
2192 int vfs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *new_dentry)
2194 struct inode *inode = old_dentry->d_inode;
2195 int error;
2197 if (!inode)
2198 return -ENOENT;
2200 error = may_create(dir, new_dentry, NULL);
2201 if (error)
2202 return error;
2204 if (dir->i_sb != inode->i_sb)
2205 return -EXDEV;
2208 * A link to an append-only or immutable file cannot be created.
2210 if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
2211 return -EPERM;
2212 if (!dir->i_op || !dir->i_op->link)
2213 return -EPERM;
2214 if (S_ISDIR(old_dentry->d_inode->i_mode))
2215 return -EPERM;
2217 error = security_inode_link(old_dentry, dir, new_dentry);
2218 if (error)
2219 return error;
2221 mutex_lock(&old_dentry->d_inode->i_mutex);
2222 DQUOT_INIT(dir);
2223 error = dir->i_op->link(old_dentry, dir, new_dentry);
2224 mutex_unlock(&old_dentry->d_inode->i_mutex);
2225 if (!error)
2226 fsnotify_create(dir, new_dentry->d_name.name);
2227 return error;
2231 * Hardlinks are often used in delicate situations. We avoid
2232 * security-related surprises by not following symlinks on the
2233 * newname. --KAB
2235 * We don't follow them on the oldname either to be compatible
2236 * with linux 2.0, and to avoid hard-linking to directories
2237 * and other special files. --ADM
2239 asmlinkage long sys_linkat(int olddfd, const char __user *oldname,
2240 int newdfd, const char __user *newname,
2241 int flags)
2243 struct dentry *new_dentry;
2244 struct nameidata nd, old_nd;
2245 int error;
2246 char * to;
2248 if (flags != 0)
2249 return -EINVAL;
2251 to = getname(newname);
2252 if (IS_ERR(to))
2253 return PTR_ERR(to);
2255 error = __user_walk_fd(olddfd, oldname, 0, &old_nd);
2256 if (error)
2257 goto exit;
2258 error = do_path_lookup(newdfd, to, LOOKUP_PARENT, &nd);
2259 if (error)
2260 goto out;
2261 error = -EXDEV;
2262 if (old_nd.mnt != nd.mnt)
2263 goto out_release;
2264 new_dentry = lookup_create(&nd, 0);
2265 error = PTR_ERR(new_dentry);
2266 if (!IS_ERR(new_dentry)) {
2267 error = vfs_link(old_nd.dentry, nd.dentry->d_inode, new_dentry);
2268 dput(new_dentry);
2270 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2271 out_release:
2272 path_release(&nd);
2273 out:
2274 path_release(&old_nd);
2275 exit:
2276 putname(to);
2278 return error;
2281 asmlinkage long sys_link(const char __user *oldname, const char __user *newname)
2283 return sys_linkat(AT_FDCWD, oldname, AT_FDCWD, newname, 0);
2287 * The worst of all namespace operations - renaming directory. "Perverted"
2288 * doesn't even start to describe it. Somebody in UCB had a heck of a trip...
2289 * Problems:
2290 * a) we can get into loop creation. Check is done in is_subdir().
2291 * b) race potential - two innocent renames can create a loop together.
2292 * That's where 4.4 screws up. Current fix: serialization on
2293 * sb->s_vfs_rename_sem. We might be more accurate, but that's another
2294 * story.
2295 * c) we have to lock _three_ objects - parents and victim (if it exists).
2296 * And that - after we got ->i_mutex on parents (until then we don't know
2297 * whether the target exists). Solution: try to be smart with locking
2298 * order for inodes. We rely on the fact that tree topology may change
2299 * only under ->s_vfs_rename_sem _and_ that parent of the object we
2300 * move will be locked. Thus we can rank directories by the tree
2301 * (ancestors first) and rank all non-directories after them.
2302 * That works since everybody except rename does "lock parent, lookup,
2303 * lock child" and rename is under ->s_vfs_rename_sem.
2304 * HOWEVER, it relies on the assumption that any object with ->lookup()
2305 * has no more than 1 dentry. If "hybrid" objects will ever appear,
2306 * we'd better make sure that there's no link(2) for them.
2307 * d) some filesystems don't support opened-but-unlinked directories,
2308 * either because of layout or because they are not ready to deal with
2309 * all cases correctly. The latter will be fixed (taking this sort of
2310 * stuff into VFS), but the former is not going away. Solution: the same
2311 * trick as in rmdir().
2312 * e) conversion from fhandle to dentry may come in the wrong moment - when
2313 * we are removing the target. Solution: we will have to grab ->i_mutex
2314 * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on
2315 * ->i_mutex on parents, which works but leads to some truely excessive
2316 * locking].
2318 static int vfs_rename_dir(struct inode *old_dir, struct dentry *old_dentry,
2319 struct inode *new_dir, struct dentry *new_dentry)
2321 int error = 0;
2322 struct inode *target;
2325 * If we are going to change the parent - check write permissions,
2326 * we'll need to flip '..'.
2328 if (new_dir != old_dir) {
2329 error = permission(old_dentry->d_inode, MAY_WRITE, NULL);
2330 if (error)
2331 return error;
2334 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2335 if (error)
2336 return error;
2338 target = new_dentry->d_inode;
2339 if (target) {
2340 mutex_lock(&target->i_mutex);
2341 dentry_unhash(new_dentry);
2343 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2344 error = -EBUSY;
2345 else
2346 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2347 if (target) {
2348 if (!error)
2349 target->i_flags |= S_DEAD;
2350 mutex_unlock(&target->i_mutex);
2351 if (d_unhashed(new_dentry))
2352 d_rehash(new_dentry);
2353 dput(new_dentry);
2355 if (!error)
2356 d_move(old_dentry,new_dentry);
2357 return error;
2360 static int vfs_rename_other(struct inode *old_dir, struct dentry *old_dentry,
2361 struct inode *new_dir, struct dentry *new_dentry)
2363 struct inode *target;
2364 int error;
2366 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2367 if (error)
2368 return error;
2370 dget(new_dentry);
2371 target = new_dentry->d_inode;
2372 if (target)
2373 mutex_lock(&target->i_mutex);
2374 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2375 error = -EBUSY;
2376 else
2377 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2378 if (!error) {
2379 /* The following d_move() should become unconditional */
2380 if (!(old_dir->i_sb->s_type->fs_flags & FS_ODD_RENAME))
2381 d_move(old_dentry, new_dentry);
2383 if (target)
2384 mutex_unlock(&target->i_mutex);
2385 dput(new_dentry);
2386 return error;
2389 int vfs_rename(struct inode *old_dir, struct dentry *old_dentry,
2390 struct inode *new_dir, struct dentry *new_dentry)
2392 int error;
2393 int is_dir = S_ISDIR(old_dentry->d_inode->i_mode);
2394 const char *old_name;
2396 if (old_dentry->d_inode == new_dentry->d_inode)
2397 return 0;
2399 error = may_delete(old_dir, old_dentry, is_dir);
2400 if (error)
2401 return error;
2403 if (!new_dentry->d_inode)
2404 error = may_create(new_dir, new_dentry, NULL);
2405 else
2406 error = may_delete(new_dir, new_dentry, is_dir);
2407 if (error)
2408 return error;
2410 if (!old_dir->i_op || !old_dir->i_op->rename)
2411 return -EPERM;
2413 DQUOT_INIT(old_dir);
2414 DQUOT_INIT(new_dir);
2416 old_name = fsnotify_oldname_init(old_dentry->d_name.name);
2418 if (is_dir)
2419 error = vfs_rename_dir(old_dir,old_dentry,new_dir,new_dentry);
2420 else
2421 error = vfs_rename_other(old_dir,old_dentry,new_dir,new_dentry);
2422 if (!error) {
2423 const char *new_name = old_dentry->d_name.name;
2424 fsnotify_move(old_dir, new_dir, old_name, new_name, is_dir,
2425 new_dentry->d_inode, old_dentry->d_inode);
2427 fsnotify_oldname_free(old_name);
2429 return error;
2432 static int do_rename(int olddfd, const char *oldname,
2433 int newdfd, const char *newname)
2435 int error = 0;
2436 struct dentry * old_dir, * new_dir;
2437 struct dentry * old_dentry, *new_dentry;
2438 struct dentry * trap;
2439 struct nameidata oldnd, newnd;
2441 error = do_path_lookup(olddfd, oldname, LOOKUP_PARENT, &oldnd);
2442 if (error)
2443 goto exit;
2445 error = do_path_lookup(newdfd, newname, LOOKUP_PARENT, &newnd);
2446 if (error)
2447 goto exit1;
2449 error = -EXDEV;
2450 if (oldnd.mnt != newnd.mnt)
2451 goto exit2;
2453 old_dir = oldnd.dentry;
2454 error = -EBUSY;
2455 if (oldnd.last_type != LAST_NORM)
2456 goto exit2;
2458 new_dir = newnd.dentry;
2459 if (newnd.last_type != LAST_NORM)
2460 goto exit2;
2462 trap = lock_rename(new_dir, old_dir);
2464 old_dentry = lookup_hash(&oldnd);
2465 error = PTR_ERR(old_dentry);
2466 if (IS_ERR(old_dentry))
2467 goto exit3;
2468 /* source must exist */
2469 error = -ENOENT;
2470 if (!old_dentry->d_inode)
2471 goto exit4;
2472 /* unless the source is a directory trailing slashes give -ENOTDIR */
2473 if (!S_ISDIR(old_dentry->d_inode->i_mode)) {
2474 error = -ENOTDIR;
2475 if (oldnd.last.name[oldnd.last.len])
2476 goto exit4;
2477 if (newnd.last.name[newnd.last.len])
2478 goto exit4;
2480 /* source should not be ancestor of target */
2481 error = -EINVAL;
2482 if (old_dentry == trap)
2483 goto exit4;
2484 new_dentry = lookup_hash(&newnd);
2485 error = PTR_ERR(new_dentry);
2486 if (IS_ERR(new_dentry))
2487 goto exit4;
2488 /* target should not be an ancestor of source */
2489 error = -ENOTEMPTY;
2490 if (new_dentry == trap)
2491 goto exit5;
2493 error = vfs_rename(old_dir->d_inode, old_dentry,
2494 new_dir->d_inode, new_dentry);
2495 exit5:
2496 dput(new_dentry);
2497 exit4:
2498 dput(old_dentry);
2499 exit3:
2500 unlock_rename(new_dir, old_dir);
2501 exit2:
2502 path_release(&newnd);
2503 exit1:
2504 path_release(&oldnd);
2505 exit:
2506 return error;
2509 asmlinkage long sys_renameat(int olddfd, const char __user *oldname,
2510 int newdfd, const char __user *newname)
2512 int error;
2513 char * from;
2514 char * to;
2516 from = getname(oldname);
2517 if(IS_ERR(from))
2518 return PTR_ERR(from);
2519 to = getname(newname);
2520 error = PTR_ERR(to);
2521 if (!IS_ERR(to)) {
2522 error = do_rename(olddfd, from, newdfd, to);
2523 putname(to);
2525 putname(from);
2526 return error;
2529 asmlinkage long sys_rename(const char __user *oldname, const char __user *newname)
2531 return sys_renameat(AT_FDCWD, oldname, AT_FDCWD, newname);
2534 int vfs_readlink(struct dentry *dentry, char __user *buffer, int buflen, const char *link)
2536 int len;
2538 len = PTR_ERR(link);
2539 if (IS_ERR(link))
2540 goto out;
2542 len = strlen(link);
2543 if (len > (unsigned) buflen)
2544 len = buflen;
2545 if (copy_to_user(buffer, link, len))
2546 len = -EFAULT;
2547 out:
2548 return len;
2552 * A helper for ->readlink(). This should be used *ONLY* for symlinks that
2553 * have ->follow_link() touching nd only in nd_set_link(). Using (or not
2554 * using) it for any given inode is up to filesystem.
2556 int generic_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2558 struct nameidata nd;
2559 void *cookie;
2561 nd.depth = 0;
2562 cookie = dentry->d_inode->i_op->follow_link(dentry, &nd);
2563 if (!IS_ERR(cookie)) {
2564 int res = vfs_readlink(dentry, buffer, buflen, nd_get_link(&nd));
2565 if (dentry->d_inode->i_op->put_link)
2566 dentry->d_inode->i_op->put_link(dentry, &nd, cookie);
2567 cookie = ERR_PTR(res);
2569 return PTR_ERR(cookie);
2572 int vfs_follow_link(struct nameidata *nd, const char *link)
2574 return __vfs_follow_link(nd, link);
2577 /* get the link contents into pagecache */
2578 static char *page_getlink(struct dentry * dentry, struct page **ppage)
2580 struct page * page;
2581 struct address_space *mapping = dentry->d_inode->i_mapping;
2582 page = read_cache_page(mapping, 0, (filler_t *)mapping->a_ops->readpage,
2583 NULL);
2584 if (IS_ERR(page))
2585 goto sync_fail;
2586 wait_on_page_locked(page);
2587 if (!PageUptodate(page))
2588 goto async_fail;
2589 *ppage = page;
2590 return kmap(page);
2592 async_fail:
2593 page_cache_release(page);
2594 return ERR_PTR(-EIO);
2596 sync_fail:
2597 return (char*)page;
2600 int page_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2602 struct page *page = NULL;
2603 char *s = page_getlink(dentry, &page);
2604 int res = vfs_readlink(dentry,buffer,buflen,s);
2605 if (page) {
2606 kunmap(page);
2607 page_cache_release(page);
2609 return res;
2612 void *page_follow_link_light(struct dentry *dentry, struct nameidata *nd)
2614 struct page *page = NULL;
2615 nd_set_link(nd, page_getlink(dentry, &page));
2616 return page;
2619 void page_put_link(struct dentry *dentry, struct nameidata *nd, void *cookie)
2621 struct page *page = cookie;
2623 if (page) {
2624 kunmap(page);
2625 page_cache_release(page);
2629 int __page_symlink(struct inode *inode, const char *symname, int len,
2630 gfp_t gfp_mask)
2632 struct address_space *mapping = inode->i_mapping;
2633 struct page *page;
2634 int err = -ENOMEM;
2635 char *kaddr;
2637 page = find_or_create_page(mapping, 0, gfp_mask);
2638 if (!page)
2639 goto fail;
2640 err = mapping->a_ops->prepare_write(NULL, page, 0, len-1);
2641 if (err)
2642 goto fail_map;
2643 kaddr = kmap_atomic(page, KM_USER0);
2644 memcpy(kaddr, symname, len-1);
2645 kunmap_atomic(kaddr, KM_USER0);
2646 mapping->a_ops->commit_write(NULL, page, 0, len-1);
2648 * Notice that we are _not_ going to block here - end of page is
2649 * unmapped, so this will only try to map the rest of page, see
2650 * that it is unmapped (typically even will not look into inode -
2651 * ->i_size will be enough for everything) and zero it out.
2652 * OTOH it's obviously correct and should make the page up-to-date.
2654 if (!PageUptodate(page)) {
2655 err = mapping->a_ops->readpage(NULL, page);
2656 wait_on_page_locked(page);
2657 } else {
2658 unlock_page(page);
2660 page_cache_release(page);
2661 if (err < 0)
2662 goto fail;
2663 mark_inode_dirty(inode);
2664 return 0;
2665 fail_map:
2666 unlock_page(page);
2667 page_cache_release(page);
2668 fail:
2669 return err;
2672 int page_symlink(struct inode *inode, const char *symname, int len)
2674 return __page_symlink(inode, symname, len,
2675 mapping_gfp_mask(inode->i_mapping));
2678 struct inode_operations page_symlink_inode_operations = {
2679 .readlink = generic_readlink,
2680 .follow_link = page_follow_link_light,
2681 .put_link = page_put_link,
2684 EXPORT_SYMBOL(__user_walk);
2685 EXPORT_SYMBOL(__user_walk_fd);
2686 EXPORT_SYMBOL(follow_down);
2687 EXPORT_SYMBOL(follow_up);
2688 EXPORT_SYMBOL(get_write_access); /* binfmt_aout */
2689 EXPORT_SYMBOL(getname);
2690 EXPORT_SYMBOL(lock_rename);
2691 EXPORT_SYMBOL(lookup_hash);
2692 EXPORT_SYMBOL(lookup_one_len);
2693 EXPORT_SYMBOL(page_follow_link_light);
2694 EXPORT_SYMBOL(page_put_link);
2695 EXPORT_SYMBOL(page_readlink);
2696 EXPORT_SYMBOL(__page_symlink);
2697 EXPORT_SYMBOL(page_symlink);
2698 EXPORT_SYMBOL(page_symlink_inode_operations);
2699 EXPORT_SYMBOL(path_lookup);
2700 EXPORT_SYMBOL(path_release);
2701 EXPORT_SYMBOL(path_walk);
2702 EXPORT_SYMBOL(permission);
2703 EXPORT_SYMBOL(vfs_permission);
2704 EXPORT_SYMBOL(file_permission);
2705 EXPORT_SYMBOL(unlock_rename);
2706 EXPORT_SYMBOL(vfs_create);
2707 EXPORT_SYMBOL(vfs_follow_link);
2708 EXPORT_SYMBOL(vfs_link);
2709 EXPORT_SYMBOL(vfs_mkdir);
2710 EXPORT_SYMBOL(vfs_mknod);
2711 EXPORT_SYMBOL(generic_permission);
2712 EXPORT_SYMBOL(vfs_readlink);
2713 EXPORT_SYMBOL(vfs_rename);
2714 EXPORT_SYMBOL(vfs_rmdir);
2715 EXPORT_SYMBOL(vfs_symlink);
2716 EXPORT_SYMBOL(vfs_unlink);
2717 EXPORT_SYMBOL(dentry_unhash);
2718 EXPORT_SYMBOL(generic_readlink);