[PATCH] Kprobes: Fix deadlock in function-return probes
[linux-2.6/linux-acpi-2.6/ibm-acpi-2.6.git] / fs / namei.c
blob7ac9fb4acb2c7d265fc48dff00810861f65cc4ce
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;
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 nd->flags &= ~LOOKUP_CONTINUE;
889 if (lookup_flags & LOOKUP_PARENT)
890 goto lookup_parent;
891 if (this.name[0] == '.') switch (this.len) {
892 default:
893 break;
894 case 2:
895 if (this.name[1] != '.')
896 break;
897 follow_dotdot(nd);
898 inode = nd->dentry->d_inode;
899 /* fallthrough */
900 case 1:
901 goto return_reval;
903 if (nd->dentry->d_op && nd->dentry->d_op->d_hash) {
904 err = nd->dentry->d_op->d_hash(nd->dentry, &this);
905 if (err < 0)
906 break;
908 err = do_lookup(nd, &this, &next);
909 if (err)
910 break;
911 inode = next.dentry->d_inode;
912 if ((lookup_flags & LOOKUP_FOLLOW)
913 && inode && inode->i_op && inode->i_op->follow_link) {
914 err = do_follow_link(&next, nd);
915 if (err)
916 goto return_err;
917 inode = nd->dentry->d_inode;
918 } else
919 path_to_nameidata(&next, nd);
920 err = -ENOENT;
921 if (!inode)
922 break;
923 if (lookup_flags & LOOKUP_DIRECTORY) {
924 err = -ENOTDIR;
925 if (!inode->i_op || !inode->i_op->lookup)
926 break;
928 goto return_base;
929 lookup_parent:
930 nd->last = this;
931 nd->last_type = LAST_NORM;
932 if (this.name[0] != '.')
933 goto return_base;
934 if (this.len == 1)
935 nd->last_type = LAST_DOT;
936 else if (this.len == 2 && this.name[1] == '.')
937 nd->last_type = LAST_DOTDOT;
938 else
939 goto return_base;
940 return_reval:
942 * We bypassed the ordinary revalidation routines.
943 * We may need to check the cached dentry for staleness.
945 if (nd->dentry && nd->dentry->d_sb &&
946 (nd->dentry->d_sb->s_type->fs_flags & FS_REVAL_DOT)) {
947 err = -ESTALE;
948 /* Note: we do not d_invalidate() */
949 if (!nd->dentry->d_op->d_revalidate(nd->dentry, nd))
950 break;
952 return_base:
953 return 0;
954 out_dput:
955 dput_path(&next, nd);
956 break;
958 path_release(nd);
959 return_err:
960 return err;
964 * Wrapper to retry pathname resolution whenever the underlying
965 * file system returns an ESTALE.
967 * Retry the whole path once, forcing real lookup requests
968 * instead of relying on the dcache.
970 int fastcall link_path_walk(const char *name, struct nameidata *nd)
972 struct nameidata save = *nd;
973 int result;
975 /* make sure the stuff we saved doesn't go away */
976 dget(save.dentry);
977 mntget(save.mnt);
979 result = __link_path_walk(name, nd);
980 if (result == -ESTALE) {
981 *nd = save;
982 dget(nd->dentry);
983 mntget(nd->mnt);
984 nd->flags |= LOOKUP_REVAL;
985 result = __link_path_walk(name, nd);
988 dput(save.dentry);
989 mntput(save.mnt);
991 return result;
994 int fastcall path_walk(const char * name, struct nameidata *nd)
996 current->total_link_count = 0;
997 return link_path_walk(name, nd);
1001 * SMP-safe: Returns 1 and nd will have valid dentry and mnt, if
1002 * everything is done. Returns 0 and drops input nd, if lookup failed;
1004 static int __emul_lookup_dentry(const char *name, struct nameidata *nd)
1006 if (path_walk(name, nd))
1007 return 0; /* something went wrong... */
1009 if (!nd->dentry->d_inode || S_ISDIR(nd->dentry->d_inode->i_mode)) {
1010 struct dentry *old_dentry = nd->dentry;
1011 struct vfsmount *old_mnt = nd->mnt;
1012 struct qstr last = nd->last;
1013 int last_type = nd->last_type;
1015 * NAME was not found in alternate root or it's a directory. Try to find
1016 * it in the normal root:
1018 nd->last_type = LAST_ROOT;
1019 read_lock(&current->fs->lock);
1020 nd->mnt = mntget(current->fs->rootmnt);
1021 nd->dentry = dget(current->fs->root);
1022 read_unlock(&current->fs->lock);
1023 if (path_walk(name, nd) == 0) {
1024 if (nd->dentry->d_inode) {
1025 dput(old_dentry);
1026 mntput(old_mnt);
1027 return 1;
1029 path_release(nd);
1031 nd->dentry = old_dentry;
1032 nd->mnt = old_mnt;
1033 nd->last = last;
1034 nd->last_type = last_type;
1036 return 1;
1039 void set_fs_altroot(void)
1041 char *emul = __emul_prefix();
1042 struct nameidata nd;
1043 struct vfsmount *mnt = NULL, *oldmnt;
1044 struct dentry *dentry = NULL, *olddentry;
1045 int err;
1047 if (!emul)
1048 goto set_it;
1049 err = path_lookup(emul, LOOKUP_FOLLOW|LOOKUP_DIRECTORY|LOOKUP_NOALT, &nd);
1050 if (!err) {
1051 mnt = nd.mnt;
1052 dentry = nd.dentry;
1054 set_it:
1055 write_lock(&current->fs->lock);
1056 oldmnt = current->fs->altrootmnt;
1057 olddentry = current->fs->altroot;
1058 current->fs->altrootmnt = mnt;
1059 current->fs->altroot = dentry;
1060 write_unlock(&current->fs->lock);
1061 if (olddentry) {
1062 dput(olddentry);
1063 mntput(oldmnt);
1067 /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
1068 static int fastcall do_path_lookup(int dfd, const char *name,
1069 unsigned int flags, struct nameidata *nd)
1071 int retval = 0;
1073 nd->last_type = LAST_ROOT; /* if there are only slashes... */
1074 nd->flags = flags;
1075 nd->depth = 0;
1077 read_lock(&current->fs->lock);
1078 if (*name=='/') {
1079 if (current->fs->altroot && !(nd->flags & LOOKUP_NOALT)) {
1080 nd->mnt = mntget(current->fs->altrootmnt);
1081 nd->dentry = dget(current->fs->altroot);
1082 read_unlock(&current->fs->lock);
1083 if (__emul_lookup_dentry(name,nd))
1084 goto out; /* found in altroot */
1085 read_lock(&current->fs->lock);
1087 nd->mnt = mntget(current->fs->rootmnt);
1088 nd->dentry = dget(current->fs->root);
1089 } else if (dfd == AT_FDCWD) {
1090 nd->mnt = mntget(current->fs->pwdmnt);
1091 nd->dentry = dget(current->fs->pwd);
1092 } else {
1093 struct file *file;
1094 int fput_needed;
1095 struct dentry *dentry;
1097 file = fget_light(dfd, &fput_needed);
1098 if (!file) {
1099 retval = -EBADF;
1100 goto out_fail;
1103 dentry = file->f_dentry;
1105 if (!S_ISDIR(dentry->d_inode->i_mode)) {
1106 retval = -ENOTDIR;
1107 fput_light(file, fput_needed);
1108 goto out_fail;
1111 retval = file_permission(file, MAY_EXEC);
1112 if (retval) {
1113 fput_light(file, fput_needed);
1114 goto out_fail;
1117 nd->mnt = mntget(file->f_vfsmnt);
1118 nd->dentry = dget(dentry);
1120 fput_light(file, fput_needed);
1122 read_unlock(&current->fs->lock);
1123 current->total_link_count = 0;
1124 retval = link_path_walk(name, nd);
1125 out:
1126 if (unlikely(current->audit_context
1127 && nd && nd->dentry && nd->dentry->d_inode))
1128 audit_inode(name, nd->dentry->d_inode, flags);
1129 out_fail:
1130 return retval;
1133 int fastcall path_lookup(const char *name, unsigned int flags,
1134 struct nameidata *nd)
1136 return do_path_lookup(AT_FDCWD, name, flags, nd);
1139 static int __path_lookup_intent_open(int dfd, const char *name,
1140 unsigned int lookup_flags, struct nameidata *nd,
1141 int open_flags, int create_mode)
1143 struct file *filp = get_empty_filp();
1144 int err;
1146 if (filp == NULL)
1147 return -ENFILE;
1148 nd->intent.open.file = filp;
1149 nd->intent.open.flags = open_flags;
1150 nd->intent.open.create_mode = create_mode;
1151 err = do_path_lookup(dfd, name, lookup_flags|LOOKUP_OPEN, nd);
1152 if (IS_ERR(nd->intent.open.file)) {
1153 if (err == 0) {
1154 err = PTR_ERR(nd->intent.open.file);
1155 path_release(nd);
1157 } else if (err != 0)
1158 release_open_intent(nd);
1159 return err;
1163 * path_lookup_open - lookup a file path with open intent
1164 * @dfd: the directory to use as base, or AT_FDCWD
1165 * @name: pointer to file name
1166 * @lookup_flags: lookup intent flags
1167 * @nd: pointer to nameidata
1168 * @open_flags: open intent flags
1170 int path_lookup_open(int dfd, const char *name, unsigned int lookup_flags,
1171 struct nameidata *nd, int open_flags)
1173 return __path_lookup_intent_open(dfd, name, lookup_flags, nd,
1174 open_flags, 0);
1178 * path_lookup_create - lookup a file path with open + create intent
1179 * @dfd: the directory to use as base, or AT_FDCWD
1180 * @name: pointer to file name
1181 * @lookup_flags: lookup intent flags
1182 * @nd: pointer to nameidata
1183 * @open_flags: open intent flags
1184 * @create_mode: create intent flags
1186 static int path_lookup_create(int dfd, const char *name,
1187 unsigned int lookup_flags, struct nameidata *nd,
1188 int open_flags, int create_mode)
1190 return __path_lookup_intent_open(dfd, name, lookup_flags|LOOKUP_CREATE,
1191 nd, open_flags, create_mode);
1194 int __user_path_lookup_open(const char __user *name, unsigned int lookup_flags,
1195 struct nameidata *nd, int open_flags)
1197 char *tmp = getname(name);
1198 int err = PTR_ERR(tmp);
1200 if (!IS_ERR(tmp)) {
1201 err = __path_lookup_intent_open(AT_FDCWD, tmp, lookup_flags, nd, open_flags, 0);
1202 putname(tmp);
1204 return err;
1208 * Restricted form of lookup. Doesn't follow links, single-component only,
1209 * needs parent already locked. Doesn't follow mounts.
1210 * SMP-safe.
1212 static struct dentry * __lookup_hash(struct qstr *name, struct dentry * base, struct nameidata *nd)
1214 struct dentry * dentry;
1215 struct inode *inode;
1216 int err;
1218 inode = base->d_inode;
1219 err = permission(inode, MAY_EXEC, nd);
1220 dentry = ERR_PTR(err);
1221 if (err)
1222 goto out;
1225 * See if the low-level filesystem might want
1226 * to use its own hash..
1228 if (base->d_op && base->d_op->d_hash) {
1229 err = base->d_op->d_hash(base, name);
1230 dentry = ERR_PTR(err);
1231 if (err < 0)
1232 goto out;
1235 dentry = cached_lookup(base, name, nd);
1236 if (!dentry) {
1237 struct dentry *new = d_alloc(base, name);
1238 dentry = ERR_PTR(-ENOMEM);
1239 if (!new)
1240 goto out;
1241 dentry = inode->i_op->lookup(inode, new, nd);
1242 if (!dentry)
1243 dentry = new;
1244 else
1245 dput(new);
1247 out:
1248 return dentry;
1251 struct dentry * lookup_hash(struct nameidata *nd)
1253 return __lookup_hash(&nd->last, nd->dentry, nd);
1256 /* SMP-safe */
1257 struct dentry * lookup_one_len(const char * name, struct dentry * base, int len)
1259 unsigned long hash;
1260 struct qstr this;
1261 unsigned int c;
1263 this.name = name;
1264 this.len = len;
1265 if (!len)
1266 goto access;
1268 hash = init_name_hash();
1269 while (len--) {
1270 c = *(const unsigned char *)name++;
1271 if (c == '/' || c == '\0')
1272 goto access;
1273 hash = partial_name_hash(c, hash);
1275 this.hash = end_name_hash(hash);
1277 return __lookup_hash(&this, base, NULL);
1278 access:
1279 return ERR_PTR(-EACCES);
1283 * namei()
1285 * is used by most simple commands to get the inode of a specified name.
1286 * Open, link etc use their own routines, but this is enough for things
1287 * like 'chmod' etc.
1289 * namei exists in two versions: namei/lnamei. The only difference is
1290 * that namei follows links, while lnamei does not.
1291 * SMP-safe
1293 int fastcall __user_walk_fd(int dfd, const char __user *name, unsigned flags,
1294 struct nameidata *nd)
1296 char *tmp = getname(name);
1297 int err = PTR_ERR(tmp);
1299 if (!IS_ERR(tmp)) {
1300 err = do_path_lookup(dfd, tmp, flags, nd);
1301 putname(tmp);
1303 return err;
1306 int fastcall __user_walk(const char __user *name, unsigned flags, struct nameidata *nd)
1308 return __user_walk_fd(AT_FDCWD, name, flags, nd);
1312 * It's inline, so penalty for filesystems that don't use sticky bit is
1313 * minimal.
1315 static inline int check_sticky(struct inode *dir, struct inode *inode)
1317 if (!(dir->i_mode & S_ISVTX))
1318 return 0;
1319 if (inode->i_uid == current->fsuid)
1320 return 0;
1321 if (dir->i_uid == current->fsuid)
1322 return 0;
1323 return !capable(CAP_FOWNER);
1327 * Check whether we can remove a link victim from directory dir, check
1328 * whether the type of victim is right.
1329 * 1. We can't do it if dir is read-only (done in permission())
1330 * 2. We should have write and exec permissions on dir
1331 * 3. We can't remove anything from append-only dir
1332 * 4. We can't do anything with immutable dir (done in permission())
1333 * 5. If the sticky bit on dir is set we should either
1334 * a. be owner of dir, or
1335 * b. be owner of victim, or
1336 * c. have CAP_FOWNER capability
1337 * 6. If the victim is append-only or immutable we can't do antyhing with
1338 * links pointing to it.
1339 * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR.
1340 * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR.
1341 * 9. We can't remove a root or mountpoint.
1342 * 10. We don't allow removal of NFS sillyrenamed files; it's handled by
1343 * nfs_async_unlink().
1345 static int may_delete(struct inode *dir,struct dentry *victim,int isdir)
1347 int error;
1349 if (!victim->d_inode)
1350 return -ENOENT;
1352 BUG_ON(victim->d_parent->d_inode != dir);
1354 error = permission(dir,MAY_WRITE | MAY_EXEC, NULL);
1355 if (error)
1356 return error;
1357 if (IS_APPEND(dir))
1358 return -EPERM;
1359 if (check_sticky(dir, victim->d_inode)||IS_APPEND(victim->d_inode)||
1360 IS_IMMUTABLE(victim->d_inode))
1361 return -EPERM;
1362 if (isdir) {
1363 if (!S_ISDIR(victim->d_inode->i_mode))
1364 return -ENOTDIR;
1365 if (IS_ROOT(victim))
1366 return -EBUSY;
1367 } else if (S_ISDIR(victim->d_inode->i_mode))
1368 return -EISDIR;
1369 if (IS_DEADDIR(dir))
1370 return -ENOENT;
1371 if (victim->d_flags & DCACHE_NFSFS_RENAMED)
1372 return -EBUSY;
1373 return 0;
1376 /* Check whether we can create an object with dentry child in directory
1377 * dir.
1378 * 1. We can't do it if child already exists (open has special treatment for
1379 * this case, but since we are inlined it's OK)
1380 * 2. We can't do it if dir is read-only (done in permission())
1381 * 3. We should have write and exec permissions on dir
1382 * 4. We can't do it if dir is immutable (done in permission())
1384 static inline int may_create(struct inode *dir, struct dentry *child,
1385 struct nameidata *nd)
1387 if (child->d_inode)
1388 return -EEXIST;
1389 if (IS_DEADDIR(dir))
1390 return -ENOENT;
1391 return permission(dir,MAY_WRITE | MAY_EXEC, nd);
1395 * O_DIRECTORY translates into forcing a directory lookup.
1397 static inline int lookup_flags(unsigned int f)
1399 unsigned long retval = LOOKUP_FOLLOW;
1401 if (f & O_NOFOLLOW)
1402 retval &= ~LOOKUP_FOLLOW;
1404 if (f & O_DIRECTORY)
1405 retval |= LOOKUP_DIRECTORY;
1407 return retval;
1411 * p1 and p2 should be directories on the same fs.
1413 struct dentry *lock_rename(struct dentry *p1, struct dentry *p2)
1415 struct dentry *p;
1417 if (p1 == p2) {
1418 mutex_lock(&p1->d_inode->i_mutex);
1419 return NULL;
1422 down(&p1->d_inode->i_sb->s_vfs_rename_sem);
1424 for (p = p1; p->d_parent != p; p = p->d_parent) {
1425 if (p->d_parent == p2) {
1426 mutex_lock(&p2->d_inode->i_mutex);
1427 mutex_lock(&p1->d_inode->i_mutex);
1428 return p;
1432 for (p = p2; p->d_parent != p; p = p->d_parent) {
1433 if (p->d_parent == p1) {
1434 mutex_lock(&p1->d_inode->i_mutex);
1435 mutex_lock(&p2->d_inode->i_mutex);
1436 return p;
1440 mutex_lock(&p1->d_inode->i_mutex);
1441 mutex_lock(&p2->d_inode->i_mutex);
1442 return NULL;
1445 void unlock_rename(struct dentry *p1, struct dentry *p2)
1447 mutex_unlock(&p1->d_inode->i_mutex);
1448 if (p1 != p2) {
1449 mutex_unlock(&p2->d_inode->i_mutex);
1450 up(&p1->d_inode->i_sb->s_vfs_rename_sem);
1454 int vfs_create(struct inode *dir, struct dentry *dentry, int mode,
1455 struct nameidata *nd)
1457 int error = may_create(dir, dentry, nd);
1459 if (error)
1460 return error;
1462 if (!dir->i_op || !dir->i_op->create)
1463 return -EACCES; /* shouldn't it be ENOSYS? */
1464 mode &= S_IALLUGO;
1465 mode |= S_IFREG;
1466 error = security_inode_create(dir, dentry, mode);
1467 if (error)
1468 return error;
1469 DQUOT_INIT(dir);
1470 error = dir->i_op->create(dir, dentry, mode, nd);
1471 if (!error)
1472 fsnotify_create(dir, dentry->d_name.name);
1473 return error;
1476 int may_open(struct nameidata *nd, int acc_mode, int flag)
1478 struct dentry *dentry = nd->dentry;
1479 struct inode *inode = dentry->d_inode;
1480 int error;
1482 if (!inode)
1483 return -ENOENT;
1485 if (S_ISLNK(inode->i_mode))
1486 return -ELOOP;
1488 if (S_ISDIR(inode->i_mode) && (flag & FMODE_WRITE))
1489 return -EISDIR;
1491 error = vfs_permission(nd, acc_mode);
1492 if (error)
1493 return error;
1496 * FIFO's, sockets and device files are special: they don't
1497 * actually live on the filesystem itself, and as such you
1498 * can write to them even if the filesystem is read-only.
1500 if (S_ISFIFO(inode->i_mode) || S_ISSOCK(inode->i_mode)) {
1501 flag &= ~O_TRUNC;
1502 } else if (S_ISBLK(inode->i_mode) || S_ISCHR(inode->i_mode)) {
1503 if (nd->mnt->mnt_flags & MNT_NODEV)
1504 return -EACCES;
1506 flag &= ~O_TRUNC;
1507 } else if (IS_RDONLY(inode) && (flag & FMODE_WRITE))
1508 return -EROFS;
1510 * An append-only file must be opened in append mode for writing.
1512 if (IS_APPEND(inode)) {
1513 if ((flag & FMODE_WRITE) && !(flag & O_APPEND))
1514 return -EPERM;
1515 if (flag & O_TRUNC)
1516 return -EPERM;
1519 /* O_NOATIME can only be set by the owner or superuser */
1520 if (flag & O_NOATIME)
1521 if (current->fsuid != inode->i_uid && !capable(CAP_FOWNER))
1522 return -EPERM;
1525 * Ensure there are no outstanding leases on the file.
1527 error = break_lease(inode, flag);
1528 if (error)
1529 return error;
1531 if (flag & O_TRUNC) {
1532 error = get_write_access(inode);
1533 if (error)
1534 return error;
1537 * Refuse to truncate files with mandatory locks held on them.
1539 error = locks_verify_locked(inode);
1540 if (!error) {
1541 DQUOT_INIT(inode);
1543 error = do_truncate(dentry, 0, ATTR_MTIME|ATTR_CTIME, NULL);
1545 put_write_access(inode);
1546 if (error)
1547 return error;
1548 } else
1549 if (flag & FMODE_WRITE)
1550 DQUOT_INIT(inode);
1552 return 0;
1556 * open_namei()
1558 * namei for open - this is in fact almost the whole open-routine.
1560 * Note that the low bits of "flag" aren't the same as in the open
1561 * system call - they are 00 - no permissions needed
1562 * 01 - read permission needed
1563 * 10 - write permission needed
1564 * 11 - read/write permissions needed
1565 * which is a lot more logical, and also allows the "no perm" needed
1566 * for symlinks (where the permissions are checked later).
1567 * SMP-safe
1569 int open_namei(int dfd, const char *pathname, int flag,
1570 int mode, struct nameidata *nd)
1572 int acc_mode, error;
1573 struct path path;
1574 struct dentry *dir;
1575 int count = 0;
1577 acc_mode = ACC_MODE(flag);
1579 /* O_TRUNC implies we need access checks for write permissions */
1580 if (flag & O_TRUNC)
1581 acc_mode |= MAY_WRITE;
1583 /* Allow the LSM permission hook to distinguish append
1584 access from general write access. */
1585 if (flag & O_APPEND)
1586 acc_mode |= MAY_APPEND;
1589 * The simplest case - just a plain lookup.
1591 if (!(flag & O_CREAT)) {
1592 error = path_lookup_open(dfd, pathname, lookup_flags(flag),
1593 nd, flag);
1594 if (error)
1595 return error;
1596 goto ok;
1600 * Create - we need to know the parent.
1602 error = path_lookup_create(dfd,pathname,LOOKUP_PARENT,nd,flag,mode);
1603 if (error)
1604 return error;
1607 * We have the parent and last component. First of all, check
1608 * that we are not asked to creat(2) an obvious directory - that
1609 * will not do.
1611 error = -EISDIR;
1612 if (nd->last_type != LAST_NORM || nd->last.name[nd->last.len])
1613 goto exit;
1615 dir = nd->dentry;
1616 nd->flags &= ~LOOKUP_PARENT;
1617 mutex_lock(&dir->d_inode->i_mutex);
1618 path.dentry = lookup_hash(nd);
1619 path.mnt = nd->mnt;
1621 do_last:
1622 error = PTR_ERR(path.dentry);
1623 if (IS_ERR(path.dentry)) {
1624 mutex_unlock(&dir->d_inode->i_mutex);
1625 goto exit;
1628 /* Negative dentry, just create the file */
1629 if (!path.dentry->d_inode) {
1630 if (!IS_POSIXACL(dir->d_inode))
1631 mode &= ~current->fs->umask;
1632 error = vfs_create(dir->d_inode, path.dentry, mode, nd);
1633 mutex_unlock(&dir->d_inode->i_mutex);
1634 dput(nd->dentry);
1635 nd->dentry = path.dentry;
1636 if (error)
1637 goto exit;
1638 /* Don't check for write permission, don't truncate */
1639 acc_mode = 0;
1640 flag &= ~O_TRUNC;
1641 goto ok;
1645 * It already exists.
1647 mutex_unlock(&dir->d_inode->i_mutex);
1649 error = -EEXIST;
1650 if (flag & O_EXCL)
1651 goto exit_dput;
1653 if (__follow_mount(&path)) {
1654 error = -ELOOP;
1655 if (flag & O_NOFOLLOW)
1656 goto exit_dput;
1658 error = -ENOENT;
1659 if (!path.dentry->d_inode)
1660 goto exit_dput;
1661 if (path.dentry->d_inode->i_op && path.dentry->d_inode->i_op->follow_link)
1662 goto do_link;
1664 path_to_nameidata(&path, nd);
1665 error = -EISDIR;
1666 if (path.dentry->d_inode && S_ISDIR(path.dentry->d_inode->i_mode))
1667 goto exit;
1669 error = may_open(nd, acc_mode, flag);
1670 if (error)
1671 goto exit;
1672 return 0;
1674 exit_dput:
1675 dput_path(&path, nd);
1676 exit:
1677 if (!IS_ERR(nd->intent.open.file))
1678 release_open_intent(nd);
1679 path_release(nd);
1680 return error;
1682 do_link:
1683 error = -ELOOP;
1684 if (flag & O_NOFOLLOW)
1685 goto exit_dput;
1687 * This is subtle. Instead of calling do_follow_link() we do the
1688 * thing by hands. The reason is that this way we have zero link_count
1689 * and path_walk() (called from ->follow_link) honoring LOOKUP_PARENT.
1690 * After that we have the parent and last component, i.e.
1691 * we are in the same situation as after the first path_walk().
1692 * Well, almost - if the last component is normal we get its copy
1693 * stored in nd->last.name and we will have to putname() it when we
1694 * are done. Procfs-like symlinks just set LAST_BIND.
1696 nd->flags |= LOOKUP_PARENT;
1697 error = security_inode_follow_link(path.dentry, nd);
1698 if (error)
1699 goto exit_dput;
1700 error = __do_follow_link(&path, nd);
1701 if (error)
1702 return error;
1703 nd->flags &= ~LOOKUP_PARENT;
1704 if (nd->last_type == LAST_BIND)
1705 goto ok;
1706 error = -EISDIR;
1707 if (nd->last_type != LAST_NORM)
1708 goto exit;
1709 if (nd->last.name[nd->last.len]) {
1710 __putname(nd->last.name);
1711 goto exit;
1713 error = -ELOOP;
1714 if (count++==32) {
1715 __putname(nd->last.name);
1716 goto exit;
1718 dir = nd->dentry;
1719 mutex_lock(&dir->d_inode->i_mutex);
1720 path.dentry = lookup_hash(nd);
1721 path.mnt = nd->mnt;
1722 __putname(nd->last.name);
1723 goto do_last;
1727 * lookup_create - lookup a dentry, creating it if it doesn't exist
1728 * @nd: nameidata info
1729 * @is_dir: directory flag
1731 * Simple function to lookup and return a dentry and create it
1732 * if it doesn't exist. Is SMP-safe.
1734 * Returns with nd->dentry->d_inode->i_mutex locked.
1736 struct dentry *lookup_create(struct nameidata *nd, int is_dir)
1738 struct dentry *dentry = ERR_PTR(-EEXIST);
1740 mutex_lock(&nd->dentry->d_inode->i_mutex);
1742 * Yucky last component or no last component at all?
1743 * (foo/., foo/.., /////)
1745 if (nd->last_type != LAST_NORM)
1746 goto fail;
1747 nd->flags &= ~LOOKUP_PARENT;
1750 * Do the final lookup.
1752 dentry = lookup_hash(nd);
1753 if (IS_ERR(dentry))
1754 goto fail;
1757 * Special case - lookup gave negative, but... we had foo/bar/
1758 * From the vfs_mknod() POV we just have a negative dentry -
1759 * all is fine. Let's be bastards - you had / on the end, you've
1760 * been asking for (non-existent) directory. -ENOENT for you.
1762 if (!is_dir && nd->last.name[nd->last.len] && !dentry->d_inode)
1763 goto enoent;
1764 return dentry;
1765 enoent:
1766 dput(dentry);
1767 dentry = ERR_PTR(-ENOENT);
1768 fail:
1769 return dentry;
1771 EXPORT_SYMBOL_GPL(lookup_create);
1773 int vfs_mknod(struct inode *dir, struct dentry *dentry, int mode, dev_t dev)
1775 int error = may_create(dir, dentry, NULL);
1777 if (error)
1778 return error;
1780 if ((S_ISCHR(mode) || S_ISBLK(mode)) && !capable(CAP_MKNOD))
1781 return -EPERM;
1783 if (!dir->i_op || !dir->i_op->mknod)
1784 return -EPERM;
1786 error = security_inode_mknod(dir, dentry, mode, dev);
1787 if (error)
1788 return error;
1790 DQUOT_INIT(dir);
1791 error = dir->i_op->mknod(dir, dentry, mode, dev);
1792 if (!error)
1793 fsnotify_create(dir, dentry->d_name.name);
1794 return error;
1797 asmlinkage long sys_mknodat(int dfd, const char __user *filename, int mode,
1798 unsigned dev)
1800 int error = 0;
1801 char * tmp;
1802 struct dentry * dentry;
1803 struct nameidata nd;
1805 if (S_ISDIR(mode))
1806 return -EPERM;
1807 tmp = getname(filename);
1808 if (IS_ERR(tmp))
1809 return PTR_ERR(tmp);
1811 error = do_path_lookup(dfd, tmp, LOOKUP_PARENT, &nd);
1812 if (error)
1813 goto out;
1814 dentry = lookup_create(&nd, 0);
1815 error = PTR_ERR(dentry);
1817 if (!IS_POSIXACL(nd.dentry->d_inode))
1818 mode &= ~current->fs->umask;
1819 if (!IS_ERR(dentry)) {
1820 switch (mode & S_IFMT) {
1821 case 0: case S_IFREG:
1822 error = vfs_create(nd.dentry->d_inode,dentry,mode,&nd);
1823 break;
1824 case S_IFCHR: case S_IFBLK:
1825 error = vfs_mknod(nd.dentry->d_inode,dentry,mode,
1826 new_decode_dev(dev));
1827 break;
1828 case S_IFIFO: case S_IFSOCK:
1829 error = vfs_mknod(nd.dentry->d_inode,dentry,mode,0);
1830 break;
1831 case S_IFDIR:
1832 error = -EPERM;
1833 break;
1834 default:
1835 error = -EINVAL;
1837 dput(dentry);
1839 mutex_unlock(&nd.dentry->d_inode->i_mutex);
1840 path_release(&nd);
1841 out:
1842 putname(tmp);
1844 return error;
1847 asmlinkage long sys_mknod(const char __user *filename, int mode, unsigned dev)
1849 return sys_mknodat(AT_FDCWD, filename, mode, dev);
1852 int vfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
1854 int error = may_create(dir, dentry, NULL);
1856 if (error)
1857 return error;
1859 if (!dir->i_op || !dir->i_op->mkdir)
1860 return -EPERM;
1862 mode &= (S_IRWXUGO|S_ISVTX);
1863 error = security_inode_mkdir(dir, dentry, mode);
1864 if (error)
1865 return error;
1867 DQUOT_INIT(dir);
1868 error = dir->i_op->mkdir(dir, dentry, mode);
1869 if (!error)
1870 fsnotify_mkdir(dir, dentry->d_name.name);
1871 return error;
1874 asmlinkage long sys_mkdirat(int dfd, const char __user *pathname, int mode)
1876 int error = 0;
1877 char * tmp;
1879 tmp = getname(pathname);
1880 error = PTR_ERR(tmp);
1881 if (!IS_ERR(tmp)) {
1882 struct dentry *dentry;
1883 struct nameidata nd;
1885 error = do_path_lookup(dfd, tmp, LOOKUP_PARENT, &nd);
1886 if (error)
1887 goto out;
1888 dentry = lookup_create(&nd, 1);
1889 error = PTR_ERR(dentry);
1890 if (!IS_ERR(dentry)) {
1891 if (!IS_POSIXACL(nd.dentry->d_inode))
1892 mode &= ~current->fs->umask;
1893 error = vfs_mkdir(nd.dentry->d_inode, dentry, mode);
1894 dput(dentry);
1896 mutex_unlock(&nd.dentry->d_inode->i_mutex);
1897 path_release(&nd);
1898 out:
1899 putname(tmp);
1902 return error;
1905 asmlinkage long sys_mkdir(const char __user *pathname, int mode)
1907 return sys_mkdirat(AT_FDCWD, pathname, mode);
1911 * We try to drop the dentry early: we should have
1912 * a usage count of 2 if we're the only user of this
1913 * dentry, and if that is true (possibly after pruning
1914 * the dcache), then we drop the dentry now.
1916 * A low-level filesystem can, if it choses, legally
1917 * do a
1919 * if (!d_unhashed(dentry))
1920 * return -EBUSY;
1922 * if it cannot handle the case of removing a directory
1923 * that is still in use by something else..
1925 void dentry_unhash(struct dentry *dentry)
1927 dget(dentry);
1928 if (atomic_read(&dentry->d_count))
1929 shrink_dcache_parent(dentry);
1930 spin_lock(&dcache_lock);
1931 spin_lock(&dentry->d_lock);
1932 if (atomic_read(&dentry->d_count) == 2)
1933 __d_drop(dentry);
1934 spin_unlock(&dentry->d_lock);
1935 spin_unlock(&dcache_lock);
1938 int vfs_rmdir(struct inode *dir, struct dentry *dentry)
1940 int error = may_delete(dir, dentry, 1);
1942 if (error)
1943 return error;
1945 if (!dir->i_op || !dir->i_op->rmdir)
1946 return -EPERM;
1948 DQUOT_INIT(dir);
1950 mutex_lock(&dentry->d_inode->i_mutex);
1951 dentry_unhash(dentry);
1952 if (d_mountpoint(dentry))
1953 error = -EBUSY;
1954 else {
1955 error = security_inode_rmdir(dir, dentry);
1956 if (!error) {
1957 error = dir->i_op->rmdir(dir, dentry);
1958 if (!error)
1959 dentry->d_inode->i_flags |= S_DEAD;
1962 mutex_unlock(&dentry->d_inode->i_mutex);
1963 if (!error) {
1964 d_delete(dentry);
1966 dput(dentry);
1968 return error;
1971 static long do_rmdir(int dfd, const char __user *pathname)
1973 int error = 0;
1974 char * name;
1975 struct dentry *dentry;
1976 struct nameidata nd;
1978 name = getname(pathname);
1979 if(IS_ERR(name))
1980 return PTR_ERR(name);
1982 error = do_path_lookup(dfd, name, LOOKUP_PARENT, &nd);
1983 if (error)
1984 goto exit;
1986 switch(nd.last_type) {
1987 case LAST_DOTDOT:
1988 error = -ENOTEMPTY;
1989 goto exit1;
1990 case LAST_DOT:
1991 error = -EINVAL;
1992 goto exit1;
1993 case LAST_ROOT:
1994 error = -EBUSY;
1995 goto exit1;
1997 mutex_lock(&nd.dentry->d_inode->i_mutex);
1998 dentry = lookup_hash(&nd);
1999 error = PTR_ERR(dentry);
2000 if (!IS_ERR(dentry)) {
2001 error = vfs_rmdir(nd.dentry->d_inode, dentry);
2002 dput(dentry);
2004 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2005 exit1:
2006 path_release(&nd);
2007 exit:
2008 putname(name);
2009 return error;
2012 asmlinkage long sys_rmdir(const char __user *pathname)
2014 return do_rmdir(AT_FDCWD, pathname);
2017 int vfs_unlink(struct inode *dir, struct dentry *dentry)
2019 int error = may_delete(dir, dentry, 0);
2021 if (error)
2022 return error;
2024 if (!dir->i_op || !dir->i_op->unlink)
2025 return -EPERM;
2027 DQUOT_INIT(dir);
2029 mutex_lock(&dentry->d_inode->i_mutex);
2030 if (d_mountpoint(dentry))
2031 error = -EBUSY;
2032 else {
2033 error = security_inode_unlink(dir, dentry);
2034 if (!error)
2035 error = dir->i_op->unlink(dir, dentry);
2037 mutex_unlock(&dentry->d_inode->i_mutex);
2039 /* We don't d_delete() NFS sillyrenamed files--they still exist. */
2040 if (!error && !(dentry->d_flags & DCACHE_NFSFS_RENAMED)) {
2041 d_delete(dentry);
2044 return error;
2048 * Make sure that the actual truncation of the file will occur outside its
2049 * directory's i_mutex. Truncate can take a long time if there is a lot of
2050 * writeout happening, and we don't want to prevent access to the directory
2051 * while waiting on the I/O.
2053 static long do_unlinkat(int dfd, const char __user *pathname)
2055 int error = 0;
2056 char * name;
2057 struct dentry *dentry;
2058 struct nameidata nd;
2059 struct inode *inode = NULL;
2061 name = getname(pathname);
2062 if(IS_ERR(name))
2063 return PTR_ERR(name);
2065 error = do_path_lookup(dfd, name, LOOKUP_PARENT, &nd);
2066 if (error)
2067 goto exit;
2068 error = -EISDIR;
2069 if (nd.last_type != LAST_NORM)
2070 goto exit1;
2071 mutex_lock(&nd.dentry->d_inode->i_mutex);
2072 dentry = lookup_hash(&nd);
2073 error = PTR_ERR(dentry);
2074 if (!IS_ERR(dentry)) {
2075 /* Why not before? Because we want correct error value */
2076 if (nd.last.name[nd.last.len])
2077 goto slashes;
2078 inode = dentry->d_inode;
2079 if (inode)
2080 atomic_inc(&inode->i_count);
2081 error = vfs_unlink(nd.dentry->d_inode, dentry);
2082 exit2:
2083 dput(dentry);
2085 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2086 if (inode)
2087 iput(inode); /* truncate the inode here */
2088 exit1:
2089 path_release(&nd);
2090 exit:
2091 putname(name);
2092 return error;
2094 slashes:
2095 error = !dentry->d_inode ? -ENOENT :
2096 S_ISDIR(dentry->d_inode->i_mode) ? -EISDIR : -ENOTDIR;
2097 goto exit2;
2100 asmlinkage long sys_unlinkat(int dfd, const char __user *pathname, int flag)
2102 if ((flag & ~AT_REMOVEDIR) != 0)
2103 return -EINVAL;
2105 if (flag & AT_REMOVEDIR)
2106 return do_rmdir(dfd, pathname);
2108 return do_unlinkat(dfd, pathname);
2111 asmlinkage long sys_unlink(const char __user *pathname)
2113 return do_unlinkat(AT_FDCWD, pathname);
2116 int vfs_symlink(struct inode *dir, struct dentry *dentry, const char *oldname, int mode)
2118 int error = may_create(dir, dentry, NULL);
2120 if (error)
2121 return error;
2123 if (!dir->i_op || !dir->i_op->symlink)
2124 return -EPERM;
2126 error = security_inode_symlink(dir, dentry, oldname);
2127 if (error)
2128 return error;
2130 DQUOT_INIT(dir);
2131 error = dir->i_op->symlink(dir, dentry, oldname);
2132 if (!error)
2133 fsnotify_create(dir, dentry->d_name.name);
2134 return error;
2137 asmlinkage long sys_symlinkat(const char __user *oldname,
2138 int newdfd, const char __user *newname)
2140 int error = 0;
2141 char * from;
2142 char * to;
2144 from = getname(oldname);
2145 if(IS_ERR(from))
2146 return PTR_ERR(from);
2147 to = getname(newname);
2148 error = PTR_ERR(to);
2149 if (!IS_ERR(to)) {
2150 struct dentry *dentry;
2151 struct nameidata nd;
2153 error = do_path_lookup(newdfd, to, LOOKUP_PARENT, &nd);
2154 if (error)
2155 goto out;
2156 dentry = lookup_create(&nd, 0);
2157 error = PTR_ERR(dentry);
2158 if (!IS_ERR(dentry)) {
2159 error = vfs_symlink(nd.dentry->d_inode, dentry, from, S_IALLUGO);
2160 dput(dentry);
2162 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2163 path_release(&nd);
2164 out:
2165 putname(to);
2167 putname(from);
2168 return error;
2171 asmlinkage long sys_symlink(const char __user *oldname, const char __user *newname)
2173 return sys_symlinkat(oldname, AT_FDCWD, newname);
2176 int vfs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *new_dentry)
2178 struct inode *inode = old_dentry->d_inode;
2179 int error;
2181 if (!inode)
2182 return -ENOENT;
2184 error = may_create(dir, new_dentry, NULL);
2185 if (error)
2186 return error;
2188 if (dir->i_sb != inode->i_sb)
2189 return -EXDEV;
2192 * A link to an append-only or immutable file cannot be created.
2194 if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
2195 return -EPERM;
2196 if (!dir->i_op || !dir->i_op->link)
2197 return -EPERM;
2198 if (S_ISDIR(old_dentry->d_inode->i_mode))
2199 return -EPERM;
2201 error = security_inode_link(old_dentry, dir, new_dentry);
2202 if (error)
2203 return error;
2205 mutex_lock(&old_dentry->d_inode->i_mutex);
2206 DQUOT_INIT(dir);
2207 error = dir->i_op->link(old_dentry, dir, new_dentry);
2208 mutex_unlock(&old_dentry->d_inode->i_mutex);
2209 if (!error)
2210 fsnotify_create(dir, new_dentry->d_name.name);
2211 return error;
2215 * Hardlinks are often used in delicate situations. We avoid
2216 * security-related surprises by not following symlinks on the
2217 * newname. --KAB
2219 * We don't follow them on the oldname either to be compatible
2220 * with linux 2.0, and to avoid hard-linking to directories
2221 * and other special files. --ADM
2223 asmlinkage long sys_linkat(int olddfd, const char __user *oldname,
2224 int newdfd, const char __user *newname)
2226 struct dentry *new_dentry;
2227 struct nameidata nd, old_nd;
2228 int error;
2229 char * to;
2231 to = getname(newname);
2232 if (IS_ERR(to))
2233 return PTR_ERR(to);
2235 error = __user_walk_fd(olddfd, oldname, 0, &old_nd);
2236 if (error)
2237 goto exit;
2238 error = do_path_lookup(newdfd, to, LOOKUP_PARENT, &nd);
2239 if (error)
2240 goto out;
2241 error = -EXDEV;
2242 if (old_nd.mnt != nd.mnt)
2243 goto out_release;
2244 new_dentry = lookup_create(&nd, 0);
2245 error = PTR_ERR(new_dentry);
2246 if (!IS_ERR(new_dentry)) {
2247 error = vfs_link(old_nd.dentry, nd.dentry->d_inode, new_dentry);
2248 dput(new_dentry);
2250 mutex_unlock(&nd.dentry->d_inode->i_mutex);
2251 out_release:
2252 path_release(&nd);
2253 out:
2254 path_release(&old_nd);
2255 exit:
2256 putname(to);
2258 return error;
2261 asmlinkage long sys_link(const char __user *oldname, const char __user *newname)
2263 return sys_linkat(AT_FDCWD, oldname, AT_FDCWD, newname);
2267 * The worst of all namespace operations - renaming directory. "Perverted"
2268 * doesn't even start to describe it. Somebody in UCB had a heck of a trip...
2269 * Problems:
2270 * a) we can get into loop creation. Check is done in is_subdir().
2271 * b) race potential - two innocent renames can create a loop together.
2272 * That's where 4.4 screws up. Current fix: serialization on
2273 * sb->s_vfs_rename_sem. We might be more accurate, but that's another
2274 * story.
2275 * c) we have to lock _three_ objects - parents and victim (if it exists).
2276 * And that - after we got ->i_mutex on parents (until then we don't know
2277 * whether the target exists). Solution: try to be smart with locking
2278 * order for inodes. We rely on the fact that tree topology may change
2279 * only under ->s_vfs_rename_sem _and_ that parent of the object we
2280 * move will be locked. Thus we can rank directories by the tree
2281 * (ancestors first) and rank all non-directories after them.
2282 * That works since everybody except rename does "lock parent, lookup,
2283 * lock child" and rename is under ->s_vfs_rename_sem.
2284 * HOWEVER, it relies on the assumption that any object with ->lookup()
2285 * has no more than 1 dentry. If "hybrid" objects will ever appear,
2286 * we'd better make sure that there's no link(2) for them.
2287 * d) some filesystems don't support opened-but-unlinked directories,
2288 * either because of layout or because they are not ready to deal with
2289 * all cases correctly. The latter will be fixed (taking this sort of
2290 * stuff into VFS), but the former is not going away. Solution: the same
2291 * trick as in rmdir().
2292 * e) conversion from fhandle to dentry may come in the wrong moment - when
2293 * we are removing the target. Solution: we will have to grab ->i_mutex
2294 * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on
2295 * ->i_mutex on parents, which works but leads to some truely excessive
2296 * locking].
2298 static int vfs_rename_dir(struct inode *old_dir, struct dentry *old_dentry,
2299 struct inode *new_dir, struct dentry *new_dentry)
2301 int error = 0;
2302 struct inode *target;
2305 * If we are going to change the parent - check write permissions,
2306 * we'll need to flip '..'.
2308 if (new_dir != old_dir) {
2309 error = permission(old_dentry->d_inode, MAY_WRITE, NULL);
2310 if (error)
2311 return error;
2314 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2315 if (error)
2316 return error;
2318 target = new_dentry->d_inode;
2319 if (target) {
2320 mutex_lock(&target->i_mutex);
2321 dentry_unhash(new_dentry);
2323 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2324 error = -EBUSY;
2325 else
2326 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2327 if (target) {
2328 if (!error)
2329 target->i_flags |= S_DEAD;
2330 mutex_unlock(&target->i_mutex);
2331 if (d_unhashed(new_dentry))
2332 d_rehash(new_dentry);
2333 dput(new_dentry);
2335 if (!error)
2336 d_move(old_dentry,new_dentry);
2337 return error;
2340 static int vfs_rename_other(struct inode *old_dir, struct dentry *old_dentry,
2341 struct inode *new_dir, struct dentry *new_dentry)
2343 struct inode *target;
2344 int error;
2346 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2347 if (error)
2348 return error;
2350 dget(new_dentry);
2351 target = new_dentry->d_inode;
2352 if (target)
2353 mutex_lock(&target->i_mutex);
2354 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2355 error = -EBUSY;
2356 else
2357 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2358 if (!error) {
2359 /* The following d_move() should become unconditional */
2360 if (!(old_dir->i_sb->s_type->fs_flags & FS_ODD_RENAME))
2361 d_move(old_dentry, new_dentry);
2363 if (target)
2364 mutex_unlock(&target->i_mutex);
2365 dput(new_dentry);
2366 return error;
2369 int vfs_rename(struct inode *old_dir, struct dentry *old_dentry,
2370 struct inode *new_dir, struct dentry *new_dentry)
2372 int error;
2373 int is_dir = S_ISDIR(old_dentry->d_inode->i_mode);
2374 const char *old_name;
2376 if (old_dentry->d_inode == new_dentry->d_inode)
2377 return 0;
2379 error = may_delete(old_dir, old_dentry, is_dir);
2380 if (error)
2381 return error;
2383 if (!new_dentry->d_inode)
2384 error = may_create(new_dir, new_dentry, NULL);
2385 else
2386 error = may_delete(new_dir, new_dentry, is_dir);
2387 if (error)
2388 return error;
2390 if (!old_dir->i_op || !old_dir->i_op->rename)
2391 return -EPERM;
2393 DQUOT_INIT(old_dir);
2394 DQUOT_INIT(new_dir);
2396 old_name = fsnotify_oldname_init(old_dentry->d_name.name);
2398 if (is_dir)
2399 error = vfs_rename_dir(old_dir,old_dentry,new_dir,new_dentry);
2400 else
2401 error = vfs_rename_other(old_dir,old_dentry,new_dir,new_dentry);
2402 if (!error) {
2403 const char *new_name = old_dentry->d_name.name;
2404 fsnotify_move(old_dir, new_dir, old_name, new_name, is_dir,
2405 new_dentry->d_inode, old_dentry->d_inode);
2407 fsnotify_oldname_free(old_name);
2409 return error;
2412 static int do_rename(int olddfd, const char *oldname,
2413 int newdfd, const char *newname)
2415 int error = 0;
2416 struct dentry * old_dir, * new_dir;
2417 struct dentry * old_dentry, *new_dentry;
2418 struct dentry * trap;
2419 struct nameidata oldnd, newnd;
2421 error = do_path_lookup(olddfd, oldname, LOOKUP_PARENT, &oldnd);
2422 if (error)
2423 goto exit;
2425 error = do_path_lookup(newdfd, newname, LOOKUP_PARENT, &newnd);
2426 if (error)
2427 goto exit1;
2429 error = -EXDEV;
2430 if (oldnd.mnt != newnd.mnt)
2431 goto exit2;
2433 old_dir = oldnd.dentry;
2434 error = -EBUSY;
2435 if (oldnd.last_type != LAST_NORM)
2436 goto exit2;
2438 new_dir = newnd.dentry;
2439 if (newnd.last_type != LAST_NORM)
2440 goto exit2;
2442 trap = lock_rename(new_dir, old_dir);
2444 old_dentry = lookup_hash(&oldnd);
2445 error = PTR_ERR(old_dentry);
2446 if (IS_ERR(old_dentry))
2447 goto exit3;
2448 /* source must exist */
2449 error = -ENOENT;
2450 if (!old_dentry->d_inode)
2451 goto exit4;
2452 /* unless the source is a directory trailing slashes give -ENOTDIR */
2453 if (!S_ISDIR(old_dentry->d_inode->i_mode)) {
2454 error = -ENOTDIR;
2455 if (oldnd.last.name[oldnd.last.len])
2456 goto exit4;
2457 if (newnd.last.name[newnd.last.len])
2458 goto exit4;
2460 /* source should not be ancestor of target */
2461 error = -EINVAL;
2462 if (old_dentry == trap)
2463 goto exit4;
2464 new_dentry = lookup_hash(&newnd);
2465 error = PTR_ERR(new_dentry);
2466 if (IS_ERR(new_dentry))
2467 goto exit4;
2468 /* target should not be an ancestor of source */
2469 error = -ENOTEMPTY;
2470 if (new_dentry == trap)
2471 goto exit5;
2473 error = vfs_rename(old_dir->d_inode, old_dentry,
2474 new_dir->d_inode, new_dentry);
2475 exit5:
2476 dput(new_dentry);
2477 exit4:
2478 dput(old_dentry);
2479 exit3:
2480 unlock_rename(new_dir, old_dir);
2481 exit2:
2482 path_release(&newnd);
2483 exit1:
2484 path_release(&oldnd);
2485 exit:
2486 return error;
2489 asmlinkage long sys_renameat(int olddfd, const char __user *oldname,
2490 int newdfd, const char __user *newname)
2492 int error;
2493 char * from;
2494 char * to;
2496 from = getname(oldname);
2497 if(IS_ERR(from))
2498 return PTR_ERR(from);
2499 to = getname(newname);
2500 error = PTR_ERR(to);
2501 if (!IS_ERR(to)) {
2502 error = do_rename(olddfd, from, newdfd, to);
2503 putname(to);
2505 putname(from);
2506 return error;
2509 asmlinkage long sys_rename(const char __user *oldname, const char __user *newname)
2511 return sys_renameat(AT_FDCWD, oldname, AT_FDCWD, newname);
2514 int vfs_readlink(struct dentry *dentry, char __user *buffer, int buflen, const char *link)
2516 int len;
2518 len = PTR_ERR(link);
2519 if (IS_ERR(link))
2520 goto out;
2522 len = strlen(link);
2523 if (len > (unsigned) buflen)
2524 len = buflen;
2525 if (copy_to_user(buffer, link, len))
2526 len = -EFAULT;
2527 out:
2528 return len;
2532 * A helper for ->readlink(). This should be used *ONLY* for symlinks that
2533 * have ->follow_link() touching nd only in nd_set_link(). Using (or not
2534 * using) it for any given inode is up to filesystem.
2536 int generic_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2538 struct nameidata nd;
2539 void *cookie;
2541 nd.depth = 0;
2542 cookie = dentry->d_inode->i_op->follow_link(dentry, &nd);
2543 if (!IS_ERR(cookie)) {
2544 int res = vfs_readlink(dentry, buffer, buflen, nd_get_link(&nd));
2545 if (dentry->d_inode->i_op->put_link)
2546 dentry->d_inode->i_op->put_link(dentry, &nd, cookie);
2547 cookie = ERR_PTR(res);
2549 return PTR_ERR(cookie);
2552 int vfs_follow_link(struct nameidata *nd, const char *link)
2554 return __vfs_follow_link(nd, link);
2557 /* get the link contents into pagecache */
2558 static char *page_getlink(struct dentry * dentry, struct page **ppage)
2560 struct page * page;
2561 struct address_space *mapping = dentry->d_inode->i_mapping;
2562 page = read_cache_page(mapping, 0, (filler_t *)mapping->a_ops->readpage,
2563 NULL);
2564 if (IS_ERR(page))
2565 goto sync_fail;
2566 wait_on_page_locked(page);
2567 if (!PageUptodate(page))
2568 goto async_fail;
2569 *ppage = page;
2570 return kmap(page);
2572 async_fail:
2573 page_cache_release(page);
2574 return ERR_PTR(-EIO);
2576 sync_fail:
2577 return (char*)page;
2580 int page_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2582 struct page *page = NULL;
2583 char *s = page_getlink(dentry, &page);
2584 int res = vfs_readlink(dentry,buffer,buflen,s);
2585 if (page) {
2586 kunmap(page);
2587 page_cache_release(page);
2589 return res;
2592 void *page_follow_link_light(struct dentry *dentry, struct nameidata *nd)
2594 struct page *page = NULL;
2595 nd_set_link(nd, page_getlink(dentry, &page));
2596 return page;
2599 void page_put_link(struct dentry *dentry, struct nameidata *nd, void *cookie)
2601 struct page *page = cookie;
2603 if (page) {
2604 kunmap(page);
2605 page_cache_release(page);
2609 int page_symlink(struct inode *inode, const char *symname, int len)
2611 struct address_space *mapping = inode->i_mapping;
2612 struct page *page = grab_cache_page(mapping, 0);
2613 int err = -ENOMEM;
2614 char *kaddr;
2616 if (!page)
2617 goto fail;
2618 err = mapping->a_ops->prepare_write(NULL, page, 0, len-1);
2619 if (err)
2620 goto fail_map;
2621 kaddr = kmap_atomic(page, KM_USER0);
2622 memcpy(kaddr, symname, len-1);
2623 kunmap_atomic(kaddr, KM_USER0);
2624 mapping->a_ops->commit_write(NULL, page, 0, len-1);
2626 * Notice that we are _not_ going to block here - end of page is
2627 * unmapped, so this will only try to map the rest of page, see
2628 * that it is unmapped (typically even will not look into inode -
2629 * ->i_size will be enough for everything) and zero it out.
2630 * OTOH it's obviously correct and should make the page up-to-date.
2632 if (!PageUptodate(page)) {
2633 err = mapping->a_ops->readpage(NULL, page);
2634 wait_on_page_locked(page);
2635 } else {
2636 unlock_page(page);
2638 page_cache_release(page);
2639 if (err < 0)
2640 goto fail;
2641 mark_inode_dirty(inode);
2642 return 0;
2643 fail_map:
2644 unlock_page(page);
2645 page_cache_release(page);
2646 fail:
2647 return err;
2650 struct inode_operations page_symlink_inode_operations = {
2651 .readlink = generic_readlink,
2652 .follow_link = page_follow_link_light,
2653 .put_link = page_put_link,
2656 EXPORT_SYMBOL(__user_walk);
2657 EXPORT_SYMBOL(__user_walk_fd);
2658 EXPORT_SYMBOL(follow_down);
2659 EXPORT_SYMBOL(follow_up);
2660 EXPORT_SYMBOL(get_write_access); /* binfmt_aout */
2661 EXPORT_SYMBOL(getname);
2662 EXPORT_SYMBOL(lock_rename);
2663 EXPORT_SYMBOL(lookup_hash);
2664 EXPORT_SYMBOL(lookup_one_len);
2665 EXPORT_SYMBOL(page_follow_link_light);
2666 EXPORT_SYMBOL(page_put_link);
2667 EXPORT_SYMBOL(page_readlink);
2668 EXPORT_SYMBOL(page_symlink);
2669 EXPORT_SYMBOL(page_symlink_inode_operations);
2670 EXPORT_SYMBOL(path_lookup);
2671 EXPORT_SYMBOL(path_release);
2672 EXPORT_SYMBOL(path_walk);
2673 EXPORT_SYMBOL(permission);
2674 EXPORT_SYMBOL(vfs_permission);
2675 EXPORT_SYMBOL(file_permission);
2676 EXPORT_SYMBOL(unlock_rename);
2677 EXPORT_SYMBOL(vfs_create);
2678 EXPORT_SYMBOL(vfs_follow_link);
2679 EXPORT_SYMBOL(vfs_link);
2680 EXPORT_SYMBOL(vfs_mkdir);
2681 EXPORT_SYMBOL(vfs_mknod);
2682 EXPORT_SYMBOL(generic_permission);
2683 EXPORT_SYMBOL(vfs_readlink);
2684 EXPORT_SYMBOL(vfs_rename);
2685 EXPORT_SYMBOL(vfs_rmdir);
2686 EXPORT_SYMBOL(vfs_symlink);
2687 EXPORT_SYMBOL(vfs_unlink);
2688 EXPORT_SYMBOL(dentry_unhash);
2689 EXPORT_SYMBOL(generic_readlink);