Use path_put() in a few places instead of {mnt,d}put()
[linux-2.6/x86.git] / fs / namei.c
blob024993535b6f195af876727238ed9390d65af62a
1 /*
2 * linux/fs/namei.c
4 * Copyright (C) 1991, 1992 Linus Torvalds
5 */
7 /*
8 * Some corrections by tytso.
9 */
11 /* [Feb 1997 T. Schoebel-Theuer] Complete rewrite of the pathname
12 * lookup logic.
14 /* [Feb-Apr 2000, AV] Rewrite to the new namespace architecture.
17 #include <linux/init.h>
18 #include <linux/module.h>
19 #include <linux/slab.h>
20 #include <linux/fs.h>
21 #include <linux/namei.h>
22 #include <linux/quotaops.h>
23 #include <linux/pagemap.h>
24 #include <linux/fsnotify.h>
25 #include <linux/personality.h>
26 #include <linux/security.h>
27 #include <linux/syscalls.h>
28 #include <linux/mount.h>
29 #include <linux/audit.h>
30 #include <linux/capability.h>
31 #include <linux/file.h>
32 #include <linux/fcntl.h>
33 #include <asm/namei.h>
34 #include <asm/uaccess.h>
36 #define ACC_MODE(x) ("\000\004\002\006"[(x)&O_ACCMODE])
38 /* [Feb-1997 T. Schoebel-Theuer]
39 * Fundamental changes in the pathname lookup mechanisms (namei)
40 * were necessary because of omirr. The reason is that omirr needs
41 * to know the _real_ pathname, not the user-supplied one, in case
42 * of symlinks (and also when transname replacements occur).
44 * The new code replaces the old recursive symlink resolution with
45 * an iterative one (in case of non-nested symlink chains). It does
46 * this with calls to <fs>_follow_link().
47 * As a side effect, dir_namei(), _namei() and follow_link() are now
48 * replaced with a single function lookup_dentry() that can handle all
49 * the special cases of the former code.
51 * With the new dcache, the pathname is stored at each inode, at least as
52 * long as the refcount of the inode is positive. As a side effect, the
53 * size of the dcache depends on the inode cache and thus is dynamic.
55 * [29-Apr-1998 C. Scott Ananian] Updated above description of symlink
56 * resolution to correspond with current state of the code.
58 * Note that the symlink resolution is not *completely* iterative.
59 * There is still a significant amount of tail- and mid- recursion in
60 * the algorithm. Also, note that <fs>_readlink() is not used in
61 * lookup_dentry(): lookup_dentry() on the result of <fs>_readlink()
62 * may return different results than <fs>_follow_link(). Many virtual
63 * filesystems (including /proc) exhibit this behavior.
66 /* [24-Feb-97 T. Schoebel-Theuer] Side effects caused by new implementation:
67 * New symlink semantics: when open() is called with flags O_CREAT | O_EXCL
68 * and the name already exists in form of a symlink, try to create the new
69 * name indicated by the symlink. The old code always complained that the
70 * name already exists, due to not following the symlink even if its target
71 * is nonexistent. The new semantics affects also mknod() and link() when
72 * the name is a symlink pointing to a non-existant name.
74 * I don't know which semantics is the right one, since I have no access
75 * to standards. But I found by trial that HP-UX 9.0 has the full "new"
76 * semantics implemented, while SunOS 4.1.1 and Solaris (SunOS 5.4) have the
77 * "old" one. Personally, I think the new semantics is much more logical.
78 * Note that "ln old new" where "new" is a symlink pointing to a non-existing
79 * file does succeed in both HP-UX and SunOs, but not in Solaris
80 * and in the old Linux semantics.
83 /* [16-Dec-97 Kevin Buhr] For security reasons, we change some symlink
84 * semantics. See the comments in "open_namei" and "do_link" below.
86 * [10-Sep-98 Alan Modra] Another symlink change.
89 /* [Feb-Apr 2000 AV] Complete rewrite. Rules for symlinks:
90 * inside the path - always follow.
91 * in the last component in creation/removal/renaming - never follow.
92 * if LOOKUP_FOLLOW passed - follow.
93 * if the pathname has trailing slashes - follow.
94 * otherwise - don't follow.
95 * (applied in that order).
97 * [Jun 2000 AV] Inconsistent behaviour of open() in case if flags==O_CREAT
98 * restored for 2.4. This is the last surviving part of old 4.2BSD bug.
99 * During the 2.4 we need to fix the userland stuff depending on it -
100 * hopefully we will be able to get rid of that wart in 2.5. So far only
101 * XEmacs seems to be relying on it...
104 * [Sep 2001 AV] Single-semaphore locking scheme (kudos to David Holland)
105 * implemented. Let's see if raised priority of ->s_vfs_rename_mutex gives
106 * any extra contention...
109 static int link_path_walk(const char *name, struct nameidata *nd);
111 /* In order to reduce some races, while at the same time doing additional
112 * checking and hopefully speeding things up, we copy filenames to the
113 * kernel data space before using them..
115 * POSIX.1 2.4: an empty pathname is invalid (ENOENT).
116 * PATH_MAX includes the nul terminator --RR.
118 static int do_getname(const char __user *filename, char *page)
120 int retval;
121 unsigned long len = PATH_MAX;
123 if (!segment_eq(get_fs(), KERNEL_DS)) {
124 if ((unsigned long) filename >= TASK_SIZE)
125 return -EFAULT;
126 if (TASK_SIZE - (unsigned long) filename < PATH_MAX)
127 len = TASK_SIZE - (unsigned long) filename;
130 retval = strncpy_from_user(page, filename, len);
131 if (retval > 0) {
132 if (retval < len)
133 return 0;
134 return -ENAMETOOLONG;
135 } else if (!retval)
136 retval = -ENOENT;
137 return retval;
140 char * getname(const char __user * filename)
142 char *tmp, *result;
144 result = ERR_PTR(-ENOMEM);
145 tmp = __getname();
146 if (tmp) {
147 int retval = do_getname(filename, tmp);
149 result = tmp;
150 if (retval < 0) {
151 __putname(tmp);
152 result = ERR_PTR(retval);
155 audit_getname(result);
156 return result;
159 #ifdef CONFIG_AUDITSYSCALL
160 void putname(const char *name)
162 if (unlikely(!audit_dummy_context()))
163 audit_putname(name);
164 else
165 __putname(name);
167 EXPORT_SYMBOL(putname);
168 #endif
172 * generic_permission - check for access rights on a Posix-like filesystem
173 * @inode: inode to check access rights for
174 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
175 * @check_acl: optional callback to check for Posix ACLs
177 * Used to check for read/write/execute permissions on a file.
178 * We use "fsuid" for this, letting us set arbitrary permissions
179 * for filesystem access without changing the "normal" uids which
180 * are used for other things..
182 int generic_permission(struct inode *inode, int mask,
183 int (*check_acl)(struct inode *inode, int mask))
185 umode_t mode = inode->i_mode;
187 if (current->fsuid == inode->i_uid)
188 mode >>= 6;
189 else {
190 if (IS_POSIXACL(inode) && (mode & S_IRWXG) && check_acl) {
191 int error = check_acl(inode, mask);
192 if (error == -EACCES)
193 goto check_capabilities;
194 else if (error != -EAGAIN)
195 return error;
198 if (in_group_p(inode->i_gid))
199 mode >>= 3;
203 * If the DACs are ok we don't need any capability check.
205 if (((mode & mask & (MAY_READ|MAY_WRITE|MAY_EXEC)) == mask))
206 return 0;
208 check_capabilities:
210 * Read/write DACs are always overridable.
211 * Executable DACs are overridable if at least one exec bit is set.
213 if (!(mask & MAY_EXEC) ||
214 (inode->i_mode & S_IXUGO) || S_ISDIR(inode->i_mode))
215 if (capable(CAP_DAC_OVERRIDE))
216 return 0;
219 * Searching includes executable on directories, else just read.
221 if (mask == MAY_READ || (S_ISDIR(inode->i_mode) && !(mask & MAY_WRITE)))
222 if (capable(CAP_DAC_READ_SEARCH))
223 return 0;
225 return -EACCES;
228 int permission(struct inode *inode, int mask, struct nameidata *nd)
230 int retval, submask;
231 struct vfsmount *mnt = NULL;
233 if (nd)
234 mnt = nd->path.mnt;
236 if (mask & MAY_WRITE) {
237 umode_t mode = inode->i_mode;
240 * Nobody gets write access to a read-only fs.
242 if (IS_RDONLY(inode) &&
243 (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode)))
244 return -EROFS;
247 * Nobody gets write access to an immutable file.
249 if (IS_IMMUTABLE(inode))
250 return -EACCES;
253 if ((mask & MAY_EXEC) && S_ISREG(inode->i_mode)) {
255 * MAY_EXEC on regular files is denied if the fs is mounted
256 * with the "noexec" flag.
258 if (mnt && (mnt->mnt_flags & MNT_NOEXEC))
259 return -EACCES;
262 /* Ordinary permission routines do not understand MAY_APPEND. */
263 submask = mask & ~MAY_APPEND;
264 if (inode->i_op && inode->i_op->permission) {
265 retval = inode->i_op->permission(inode, submask, nd);
266 if (!retval) {
268 * Exec permission on a regular file is denied if none
269 * of the execute bits are set.
271 * This check should be done by the ->permission()
272 * method.
274 if ((mask & MAY_EXEC) && S_ISREG(inode->i_mode) &&
275 !(inode->i_mode & S_IXUGO))
276 return -EACCES;
278 } else {
279 retval = generic_permission(inode, submask, NULL);
281 if (retval)
282 return retval;
284 return security_inode_permission(inode, mask, nd);
288 * vfs_permission - check for access rights to a given path
289 * @nd: lookup result that describes the path
290 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
292 * Used to check for read/write/execute permissions on a path.
293 * We use "fsuid" for this, letting us set arbitrary permissions
294 * for filesystem access without changing the "normal" uids which
295 * are used for other things.
297 int vfs_permission(struct nameidata *nd, int mask)
299 return permission(nd->path.dentry->d_inode, mask, nd);
303 * file_permission - check for additional access rights to a given file
304 * @file: file to check access rights for
305 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
307 * Used to check for read/write/execute permissions on an already opened
308 * file.
310 * Note:
311 * Do not use this function in new code. All access checks should
312 * be done using vfs_permission().
314 int file_permission(struct file *file, int mask)
316 return permission(file->f_path.dentry->d_inode, mask, NULL);
320 * get_write_access() gets write permission for a file.
321 * put_write_access() releases this write permission.
322 * This is used for regular files.
323 * We cannot support write (and maybe mmap read-write shared) accesses and
324 * MAP_DENYWRITE mmappings simultaneously. The i_writecount field of an inode
325 * can have the following values:
326 * 0: no writers, no VM_DENYWRITE mappings
327 * < 0: (-i_writecount) vm_area_structs with VM_DENYWRITE set exist
328 * > 0: (i_writecount) users are writing to the file.
330 * Normally we operate on that counter with atomic_{inc,dec} and it's safe
331 * except for the cases where we don't hold i_writecount yet. Then we need to
332 * use {get,deny}_write_access() - these functions check the sign and refuse
333 * to do the change if sign is wrong. Exclusion between them is provided by
334 * the inode->i_lock spinlock.
337 int get_write_access(struct inode * inode)
339 spin_lock(&inode->i_lock);
340 if (atomic_read(&inode->i_writecount) < 0) {
341 spin_unlock(&inode->i_lock);
342 return -ETXTBSY;
344 atomic_inc(&inode->i_writecount);
345 spin_unlock(&inode->i_lock);
347 return 0;
350 int deny_write_access(struct file * file)
352 struct inode *inode = file->f_path.dentry->d_inode;
354 spin_lock(&inode->i_lock);
355 if (atomic_read(&inode->i_writecount) > 0) {
356 spin_unlock(&inode->i_lock);
357 return -ETXTBSY;
359 atomic_dec(&inode->i_writecount);
360 spin_unlock(&inode->i_lock);
362 return 0;
366 * path_put - put a reference to a path
367 * @path: path to put the reference to
369 * Given a path decrement the reference count to the dentry and the vfsmount.
371 void path_put(struct path *path)
373 dput(path->dentry);
374 mntput(path->mnt);
376 EXPORT_SYMBOL(path_put);
379 * release_open_intent - free up open intent resources
380 * @nd: pointer to nameidata
382 void release_open_intent(struct nameidata *nd)
384 if (nd->intent.open.file->f_path.dentry == NULL)
385 put_filp(nd->intent.open.file);
386 else
387 fput(nd->intent.open.file);
390 static inline struct dentry *
391 do_revalidate(struct dentry *dentry, struct nameidata *nd)
393 int status = dentry->d_op->d_revalidate(dentry, nd);
394 if (unlikely(status <= 0)) {
396 * The dentry failed validation.
397 * If d_revalidate returned 0 attempt to invalidate
398 * the dentry otherwise d_revalidate is asking us
399 * to return a fail status.
401 if (!status) {
402 if (!d_invalidate(dentry)) {
403 dput(dentry);
404 dentry = NULL;
406 } else {
407 dput(dentry);
408 dentry = ERR_PTR(status);
411 return dentry;
415 * Internal lookup() using the new generic dcache.
416 * SMP-safe
418 static struct dentry * cached_lookup(struct dentry * parent, struct qstr * name, struct nameidata *nd)
420 struct dentry * dentry = __d_lookup(parent, name);
422 /* lockess __d_lookup may fail due to concurrent d_move()
423 * in some unrelated directory, so try with d_lookup
425 if (!dentry)
426 dentry = d_lookup(parent, name);
428 if (dentry && dentry->d_op && dentry->d_op->d_revalidate)
429 dentry = do_revalidate(dentry, nd);
431 return dentry;
435 * Short-cut version of permission(), for calling by
436 * path_walk(), when dcache lock is held. Combines parts
437 * of permission() and generic_permission(), and tests ONLY for
438 * MAY_EXEC permission.
440 * If appropriate, check DAC only. If not appropriate, or
441 * short-cut DAC fails, then call permission() to do more
442 * complete permission check.
444 static int exec_permission_lite(struct inode *inode,
445 struct nameidata *nd)
447 umode_t mode = inode->i_mode;
449 if (inode->i_op && inode->i_op->permission)
450 return -EAGAIN;
452 if (current->fsuid == inode->i_uid)
453 mode >>= 6;
454 else if (in_group_p(inode->i_gid))
455 mode >>= 3;
457 if (mode & MAY_EXEC)
458 goto ok;
460 if ((inode->i_mode & S_IXUGO) && capable(CAP_DAC_OVERRIDE))
461 goto ok;
463 if (S_ISDIR(inode->i_mode) && capable(CAP_DAC_OVERRIDE))
464 goto ok;
466 if (S_ISDIR(inode->i_mode) && capable(CAP_DAC_READ_SEARCH))
467 goto ok;
469 return -EACCES;
471 return security_inode_permission(inode, MAY_EXEC, nd);
475 * This is called when everything else fails, and we actually have
476 * to go to the low-level filesystem to find out what we should do..
478 * We get the directory semaphore, and after getting that we also
479 * make sure that nobody added the entry to the dcache in the meantime..
480 * SMP-safe
482 static struct dentry * real_lookup(struct dentry * parent, struct qstr * name, struct nameidata *nd)
484 struct dentry * result;
485 struct inode *dir = parent->d_inode;
487 mutex_lock(&dir->i_mutex);
489 * First re-do the cached lookup just in case it was created
490 * while we waited for the directory semaphore..
492 * FIXME! This could use version numbering or similar to
493 * avoid unnecessary cache lookups.
495 * The "dcache_lock" is purely to protect the RCU list walker
496 * from concurrent renames at this point (we mustn't get false
497 * negatives from the RCU list walk here, unlike the optimistic
498 * fast walk).
500 * so doing d_lookup() (with seqlock), instead of lockfree __d_lookup
502 result = d_lookup(parent, name);
503 if (!result) {
504 struct dentry * dentry = d_alloc(parent, name);
505 result = ERR_PTR(-ENOMEM);
506 if (dentry) {
507 result = dir->i_op->lookup(dir, dentry, nd);
508 if (result)
509 dput(dentry);
510 else
511 result = dentry;
513 mutex_unlock(&dir->i_mutex);
514 return result;
518 * Uhhuh! Nasty case: the cache was re-populated while
519 * we waited on the semaphore. Need to revalidate.
521 mutex_unlock(&dir->i_mutex);
522 if (result->d_op && result->d_op->d_revalidate) {
523 result = do_revalidate(result, nd);
524 if (!result)
525 result = ERR_PTR(-ENOENT);
527 return result;
530 static int __emul_lookup_dentry(const char *, struct nameidata *);
532 /* SMP-safe */
533 static __always_inline int
534 walk_init_root(const char *name, struct nameidata *nd)
536 struct fs_struct *fs = current->fs;
538 read_lock(&fs->lock);
539 if (fs->altroot && !(nd->flags & LOOKUP_NOALT)) {
540 nd->path.mnt = mntget(fs->altrootmnt);
541 nd->path.dentry = dget(fs->altroot);
542 read_unlock(&fs->lock);
543 if (__emul_lookup_dentry(name,nd))
544 return 0;
545 read_lock(&fs->lock);
547 nd->path.mnt = mntget(fs->rootmnt);
548 nd->path.dentry = dget(fs->root);
549 read_unlock(&fs->lock);
550 return 1;
553 static __always_inline int __vfs_follow_link(struct nameidata *nd, const char *link)
555 int res = 0;
556 char *name;
557 if (IS_ERR(link))
558 goto fail;
560 if (*link == '/') {
561 path_put(&nd->path);
562 if (!walk_init_root(link, nd))
563 /* weird __emul_prefix() stuff did it */
564 goto out;
566 res = link_path_walk(link, nd);
567 out:
568 if (nd->depth || res || nd->last_type!=LAST_NORM)
569 return res;
571 * If it is an iterative symlinks resolution in open_namei() we
572 * have to copy the last component. And all that crap because of
573 * bloody create() on broken symlinks. Furrfu...
575 name = __getname();
576 if (unlikely(!name)) {
577 path_put(&nd->path);
578 return -ENOMEM;
580 strcpy(name, nd->last.name);
581 nd->last.name = name;
582 return 0;
583 fail:
584 path_put(&nd->path);
585 return PTR_ERR(link);
588 static void path_put_conditional(struct path *path, struct nameidata *nd)
590 dput(path->dentry);
591 if (path->mnt != nd->path.mnt)
592 mntput(path->mnt);
595 static inline void path_to_nameidata(struct path *path, struct nameidata *nd)
597 dput(nd->path.dentry);
598 if (nd->path.mnt != path->mnt)
599 mntput(nd->path.mnt);
600 nd->path.mnt = path->mnt;
601 nd->path.dentry = path->dentry;
604 static __always_inline int __do_follow_link(struct path *path, struct nameidata *nd)
606 int error;
607 void *cookie;
608 struct dentry *dentry = path->dentry;
610 touch_atime(path->mnt, dentry);
611 nd_set_link(nd, NULL);
613 if (path->mnt != nd->path.mnt) {
614 path_to_nameidata(path, nd);
615 dget(dentry);
617 mntget(path->mnt);
618 cookie = dentry->d_inode->i_op->follow_link(dentry, nd);
619 error = PTR_ERR(cookie);
620 if (!IS_ERR(cookie)) {
621 char *s = nd_get_link(nd);
622 error = 0;
623 if (s)
624 error = __vfs_follow_link(nd, s);
625 if (dentry->d_inode->i_op->put_link)
626 dentry->d_inode->i_op->put_link(dentry, nd, cookie);
628 path_put(path);
630 return error;
634 * This limits recursive symlink follows to 8, while
635 * limiting consecutive symlinks to 40.
637 * Without that kind of total limit, nasty chains of consecutive
638 * symlinks can cause almost arbitrarily long lookups.
640 static inline int do_follow_link(struct path *path, struct nameidata *nd)
642 int err = -ELOOP;
643 if (current->link_count >= MAX_NESTED_LINKS)
644 goto loop;
645 if (current->total_link_count >= 40)
646 goto loop;
647 BUG_ON(nd->depth >= MAX_NESTED_LINKS);
648 cond_resched();
649 err = security_inode_follow_link(path->dentry, nd);
650 if (err)
651 goto loop;
652 current->link_count++;
653 current->total_link_count++;
654 nd->depth++;
655 err = __do_follow_link(path, nd);
656 current->link_count--;
657 nd->depth--;
658 return err;
659 loop:
660 path_put_conditional(path, nd);
661 path_put(&nd->path);
662 return err;
665 int follow_up(struct vfsmount **mnt, struct dentry **dentry)
667 struct vfsmount *parent;
668 struct dentry *mountpoint;
669 spin_lock(&vfsmount_lock);
670 parent=(*mnt)->mnt_parent;
671 if (parent == *mnt) {
672 spin_unlock(&vfsmount_lock);
673 return 0;
675 mntget(parent);
676 mountpoint=dget((*mnt)->mnt_mountpoint);
677 spin_unlock(&vfsmount_lock);
678 dput(*dentry);
679 *dentry = mountpoint;
680 mntput(*mnt);
681 *mnt = parent;
682 return 1;
685 /* no need for dcache_lock, as serialization is taken care in
686 * namespace.c
688 static int __follow_mount(struct path *path)
690 int res = 0;
691 while (d_mountpoint(path->dentry)) {
692 struct vfsmount *mounted = lookup_mnt(path->mnt, path->dentry);
693 if (!mounted)
694 break;
695 dput(path->dentry);
696 if (res)
697 mntput(path->mnt);
698 path->mnt = mounted;
699 path->dentry = dget(mounted->mnt_root);
700 res = 1;
702 return res;
705 static void follow_mount(struct vfsmount **mnt, struct dentry **dentry)
707 while (d_mountpoint(*dentry)) {
708 struct vfsmount *mounted = lookup_mnt(*mnt, *dentry);
709 if (!mounted)
710 break;
711 dput(*dentry);
712 mntput(*mnt);
713 *mnt = mounted;
714 *dentry = dget(mounted->mnt_root);
718 /* no need for dcache_lock, as serialization is taken care in
719 * namespace.c
721 int follow_down(struct vfsmount **mnt, struct dentry **dentry)
723 struct vfsmount *mounted;
725 mounted = lookup_mnt(*mnt, *dentry);
726 if (mounted) {
727 dput(*dentry);
728 mntput(*mnt);
729 *mnt = mounted;
730 *dentry = dget(mounted->mnt_root);
731 return 1;
733 return 0;
736 static __always_inline void follow_dotdot(struct nameidata *nd)
738 struct fs_struct *fs = current->fs;
740 while(1) {
741 struct vfsmount *parent;
742 struct dentry *old = nd->path.dentry;
744 read_lock(&fs->lock);
745 if (nd->path.dentry == fs->root &&
746 nd->path.mnt == fs->rootmnt) {
747 read_unlock(&fs->lock);
748 break;
750 read_unlock(&fs->lock);
751 spin_lock(&dcache_lock);
752 if (nd->path.dentry != nd->path.mnt->mnt_root) {
753 nd->path.dentry = dget(nd->path.dentry->d_parent);
754 spin_unlock(&dcache_lock);
755 dput(old);
756 break;
758 spin_unlock(&dcache_lock);
759 spin_lock(&vfsmount_lock);
760 parent = nd->path.mnt->mnt_parent;
761 if (parent == nd->path.mnt) {
762 spin_unlock(&vfsmount_lock);
763 break;
765 mntget(parent);
766 nd->path.dentry = dget(nd->path.mnt->mnt_mountpoint);
767 spin_unlock(&vfsmount_lock);
768 dput(old);
769 mntput(nd->path.mnt);
770 nd->path.mnt = parent;
772 follow_mount(&nd->path.mnt, &nd->path.dentry);
776 * It's more convoluted than I'd like it to be, but... it's still fairly
777 * small and for now I'd prefer to have fast path as straight as possible.
778 * It _is_ time-critical.
780 static int do_lookup(struct nameidata *nd, struct qstr *name,
781 struct path *path)
783 struct vfsmount *mnt = nd->path.mnt;
784 struct dentry *dentry = __d_lookup(nd->path.dentry, name);
786 if (!dentry)
787 goto need_lookup;
788 if (dentry->d_op && dentry->d_op->d_revalidate)
789 goto need_revalidate;
790 done:
791 path->mnt = mnt;
792 path->dentry = dentry;
793 __follow_mount(path);
794 return 0;
796 need_lookup:
797 dentry = real_lookup(nd->path.dentry, name, nd);
798 if (IS_ERR(dentry))
799 goto fail;
800 goto done;
802 need_revalidate:
803 dentry = do_revalidate(dentry, nd);
804 if (!dentry)
805 goto need_lookup;
806 if (IS_ERR(dentry))
807 goto fail;
808 goto done;
810 fail:
811 return PTR_ERR(dentry);
815 * Name resolution.
816 * This is the basic name resolution function, turning a pathname into
817 * the final dentry. We expect 'base' to be positive and a directory.
819 * Returns 0 and nd will have valid dentry and mnt on success.
820 * Returns error and drops reference to input namei data on failure.
822 static int __link_path_walk(const char *name, struct nameidata *nd)
824 struct path next;
825 struct inode *inode;
826 int err;
827 unsigned int lookup_flags = nd->flags;
829 while (*name=='/')
830 name++;
831 if (!*name)
832 goto return_reval;
834 inode = nd->path.dentry->d_inode;
835 if (nd->depth)
836 lookup_flags = LOOKUP_FOLLOW | (nd->flags & LOOKUP_CONTINUE);
838 /* At this point we know we have a real path component. */
839 for(;;) {
840 unsigned long hash;
841 struct qstr this;
842 unsigned int c;
844 nd->flags |= LOOKUP_CONTINUE;
845 err = exec_permission_lite(inode, nd);
846 if (err == -EAGAIN)
847 err = vfs_permission(nd, MAY_EXEC);
848 if (err)
849 break;
851 this.name = name;
852 c = *(const unsigned char *)name;
854 hash = init_name_hash();
855 do {
856 name++;
857 hash = partial_name_hash(c, hash);
858 c = *(const unsigned char *)name;
859 } while (c && (c != '/'));
860 this.len = name - (const char *) this.name;
861 this.hash = end_name_hash(hash);
863 /* remove trailing slashes? */
864 if (!c)
865 goto last_component;
866 while (*++name == '/');
867 if (!*name)
868 goto last_with_slashes;
871 * "." and ".." are special - ".." especially so because it has
872 * to be able to know about the current root directory and
873 * parent relationships.
875 if (this.name[0] == '.') switch (this.len) {
876 default:
877 break;
878 case 2:
879 if (this.name[1] != '.')
880 break;
881 follow_dotdot(nd);
882 inode = nd->path.dentry->d_inode;
883 /* fallthrough */
884 case 1:
885 continue;
888 * See if the low-level filesystem might want
889 * to use its own hash..
891 if (nd->path.dentry->d_op && nd->path.dentry->d_op->d_hash) {
892 err = nd->path.dentry->d_op->d_hash(nd->path.dentry,
893 &this);
894 if (err < 0)
895 break;
897 /* This does the actual lookups.. */
898 err = do_lookup(nd, &this, &next);
899 if (err)
900 break;
902 err = -ENOENT;
903 inode = next.dentry->d_inode;
904 if (!inode)
905 goto out_dput;
906 err = -ENOTDIR;
907 if (!inode->i_op)
908 goto out_dput;
910 if (inode->i_op->follow_link) {
911 err = do_follow_link(&next, nd);
912 if (err)
913 goto return_err;
914 err = -ENOENT;
915 inode = nd->path.dentry->d_inode;
916 if (!inode)
917 break;
918 err = -ENOTDIR;
919 if (!inode->i_op)
920 break;
921 } else
922 path_to_nameidata(&next, nd);
923 err = -ENOTDIR;
924 if (!inode->i_op->lookup)
925 break;
926 continue;
927 /* here ends the main loop */
929 last_with_slashes:
930 lookup_flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY;
931 last_component:
932 /* Clear LOOKUP_CONTINUE iff it was previously unset */
933 nd->flags &= lookup_flags | ~LOOKUP_CONTINUE;
934 if (lookup_flags & LOOKUP_PARENT)
935 goto lookup_parent;
936 if (this.name[0] == '.') switch (this.len) {
937 default:
938 break;
939 case 2:
940 if (this.name[1] != '.')
941 break;
942 follow_dotdot(nd);
943 inode = nd->path.dentry->d_inode;
944 /* fallthrough */
945 case 1:
946 goto return_reval;
948 if (nd->path.dentry->d_op && nd->path.dentry->d_op->d_hash) {
949 err = nd->path.dentry->d_op->d_hash(nd->path.dentry,
950 &this);
951 if (err < 0)
952 break;
954 err = do_lookup(nd, &this, &next);
955 if (err)
956 break;
957 inode = next.dentry->d_inode;
958 if ((lookup_flags & LOOKUP_FOLLOW)
959 && inode && inode->i_op && inode->i_op->follow_link) {
960 err = do_follow_link(&next, nd);
961 if (err)
962 goto return_err;
963 inode = nd->path.dentry->d_inode;
964 } else
965 path_to_nameidata(&next, nd);
966 err = -ENOENT;
967 if (!inode)
968 break;
969 if (lookup_flags & LOOKUP_DIRECTORY) {
970 err = -ENOTDIR;
971 if (!inode->i_op || !inode->i_op->lookup)
972 break;
974 goto return_base;
975 lookup_parent:
976 nd->last = this;
977 nd->last_type = LAST_NORM;
978 if (this.name[0] != '.')
979 goto return_base;
980 if (this.len == 1)
981 nd->last_type = LAST_DOT;
982 else if (this.len == 2 && this.name[1] == '.')
983 nd->last_type = LAST_DOTDOT;
984 else
985 goto return_base;
986 return_reval:
988 * We bypassed the ordinary revalidation routines.
989 * We may need to check the cached dentry for staleness.
991 if (nd->path.dentry && nd->path.dentry->d_sb &&
992 (nd->path.dentry->d_sb->s_type->fs_flags & FS_REVAL_DOT)) {
993 err = -ESTALE;
994 /* Note: we do not d_invalidate() */
995 if (!nd->path.dentry->d_op->d_revalidate(
996 nd->path.dentry, nd))
997 break;
999 return_base:
1000 return 0;
1001 out_dput:
1002 path_put_conditional(&next, nd);
1003 break;
1005 path_put(&nd->path);
1006 return_err:
1007 return err;
1011 * Wrapper to retry pathname resolution whenever the underlying
1012 * file system returns an ESTALE.
1014 * Retry the whole path once, forcing real lookup requests
1015 * instead of relying on the dcache.
1017 static int link_path_walk(const char *name, struct nameidata *nd)
1019 struct nameidata save = *nd;
1020 int result;
1022 /* make sure the stuff we saved doesn't go away */
1023 dget(save.path.dentry);
1024 mntget(save.path.mnt);
1026 result = __link_path_walk(name, nd);
1027 if (result == -ESTALE) {
1028 *nd = save;
1029 dget(nd->path.dentry);
1030 mntget(nd->path.mnt);
1031 nd->flags |= LOOKUP_REVAL;
1032 result = __link_path_walk(name, nd);
1035 path_put(&save.path);
1037 return result;
1040 static int path_walk(const char *name, struct nameidata *nd)
1042 current->total_link_count = 0;
1043 return link_path_walk(name, nd);
1047 * SMP-safe: Returns 1 and nd will have valid dentry and mnt, if
1048 * everything is done. Returns 0 and drops input nd, if lookup failed;
1050 static int __emul_lookup_dentry(const char *name, struct nameidata *nd)
1052 if (path_walk(name, nd))
1053 return 0; /* something went wrong... */
1055 if (!nd->path.dentry->d_inode ||
1056 S_ISDIR(nd->path.dentry->d_inode->i_mode)) {
1057 struct path old_path = nd->path;
1058 struct qstr last = nd->last;
1059 int last_type = nd->last_type;
1060 struct fs_struct *fs = current->fs;
1063 * NAME was not found in alternate root or it's a directory.
1064 * Try to find it in the normal root:
1066 nd->last_type = LAST_ROOT;
1067 read_lock(&fs->lock);
1068 nd->path.mnt = mntget(fs->rootmnt);
1069 nd->path.dentry = dget(fs->root);
1070 read_unlock(&fs->lock);
1071 if (path_walk(name, nd) == 0) {
1072 if (nd->path.dentry->d_inode) {
1073 path_put(&old_path);
1074 return 1;
1076 path_put(&nd->path);
1078 nd->path = old_path;
1079 nd->last = last;
1080 nd->last_type = last_type;
1082 return 1;
1085 void set_fs_altroot(void)
1087 char *emul = __emul_prefix();
1088 struct nameidata nd;
1089 struct vfsmount *mnt = NULL, *oldmnt;
1090 struct dentry *dentry = NULL, *olddentry;
1091 int err;
1092 struct fs_struct *fs = current->fs;
1094 if (!emul)
1095 goto set_it;
1096 err = path_lookup(emul, LOOKUP_FOLLOW|LOOKUP_DIRECTORY|LOOKUP_NOALT, &nd);
1097 if (!err) {
1098 mnt = nd.path.mnt;
1099 dentry = nd.path.dentry;
1101 set_it:
1102 write_lock(&fs->lock);
1103 oldmnt = fs->altrootmnt;
1104 olddentry = fs->altroot;
1105 fs->altrootmnt = mnt;
1106 fs->altroot = dentry;
1107 write_unlock(&fs->lock);
1108 if (olddentry) {
1109 dput(olddentry);
1110 mntput(oldmnt);
1114 /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
1115 static int do_path_lookup(int dfd, const char *name,
1116 unsigned int flags, struct nameidata *nd)
1118 int retval = 0;
1119 int fput_needed;
1120 struct file *file;
1121 struct fs_struct *fs = current->fs;
1123 nd->last_type = LAST_ROOT; /* if there are only slashes... */
1124 nd->flags = flags;
1125 nd->depth = 0;
1127 if (*name=='/') {
1128 read_lock(&fs->lock);
1129 if (fs->altroot && !(nd->flags & LOOKUP_NOALT)) {
1130 nd->path.mnt = mntget(fs->altrootmnt);
1131 nd->path.dentry = dget(fs->altroot);
1132 read_unlock(&fs->lock);
1133 if (__emul_lookup_dentry(name,nd))
1134 goto out; /* found in altroot */
1135 read_lock(&fs->lock);
1137 nd->path.mnt = mntget(fs->rootmnt);
1138 nd->path.dentry = dget(fs->root);
1139 read_unlock(&fs->lock);
1140 } else if (dfd == AT_FDCWD) {
1141 read_lock(&fs->lock);
1142 nd->path.mnt = mntget(fs->pwdmnt);
1143 nd->path.dentry = dget(fs->pwd);
1144 read_unlock(&fs->lock);
1145 } else {
1146 struct dentry *dentry;
1148 file = fget_light(dfd, &fput_needed);
1149 retval = -EBADF;
1150 if (!file)
1151 goto out_fail;
1153 dentry = file->f_path.dentry;
1155 retval = -ENOTDIR;
1156 if (!S_ISDIR(dentry->d_inode->i_mode))
1157 goto fput_fail;
1159 retval = file_permission(file, MAY_EXEC);
1160 if (retval)
1161 goto fput_fail;
1163 nd->path.mnt = mntget(file->f_path.mnt);
1164 nd->path.dentry = dget(dentry);
1166 fput_light(file, fput_needed);
1169 retval = path_walk(name, nd);
1170 out:
1171 if (unlikely(!retval && !audit_dummy_context() && nd->path.dentry &&
1172 nd->path.dentry->d_inode))
1173 audit_inode(name, nd->path.dentry);
1174 out_fail:
1175 return retval;
1177 fput_fail:
1178 fput_light(file, fput_needed);
1179 goto out_fail;
1182 int path_lookup(const char *name, unsigned int flags,
1183 struct nameidata *nd)
1185 return do_path_lookup(AT_FDCWD, name, flags, nd);
1189 * vfs_path_lookup - lookup a file path relative to a dentry-vfsmount pair
1190 * @dentry: pointer to dentry of the base directory
1191 * @mnt: pointer to vfs mount of the base directory
1192 * @name: pointer to file name
1193 * @flags: lookup flags
1194 * @nd: pointer to nameidata
1196 int vfs_path_lookup(struct dentry *dentry, struct vfsmount *mnt,
1197 const char *name, unsigned int flags,
1198 struct nameidata *nd)
1200 int retval;
1202 /* same as do_path_lookup */
1203 nd->last_type = LAST_ROOT;
1204 nd->flags = flags;
1205 nd->depth = 0;
1207 nd->path.mnt = mntget(mnt);
1208 nd->path.dentry = dget(dentry);
1210 retval = path_walk(name, nd);
1211 if (unlikely(!retval && !audit_dummy_context() && nd->path.dentry &&
1212 nd->path.dentry->d_inode))
1213 audit_inode(name, nd->path.dentry);
1215 return retval;
1219 static int __path_lookup_intent_open(int dfd, const char *name,
1220 unsigned int lookup_flags, struct nameidata *nd,
1221 int open_flags, int create_mode)
1223 struct file *filp = get_empty_filp();
1224 int err;
1226 if (filp == NULL)
1227 return -ENFILE;
1228 nd->intent.open.file = filp;
1229 nd->intent.open.flags = open_flags;
1230 nd->intent.open.create_mode = create_mode;
1231 err = do_path_lookup(dfd, name, lookup_flags|LOOKUP_OPEN, nd);
1232 if (IS_ERR(nd->intent.open.file)) {
1233 if (err == 0) {
1234 err = PTR_ERR(nd->intent.open.file);
1235 path_put(&nd->path);
1237 } else if (err != 0)
1238 release_open_intent(nd);
1239 return err;
1243 * path_lookup_open - lookup a file path with open intent
1244 * @dfd: the directory to use as base, or AT_FDCWD
1245 * @name: pointer to file name
1246 * @lookup_flags: lookup intent flags
1247 * @nd: pointer to nameidata
1248 * @open_flags: open intent flags
1250 int path_lookup_open(int dfd, const char *name, unsigned int lookup_flags,
1251 struct nameidata *nd, int open_flags)
1253 return __path_lookup_intent_open(dfd, name, lookup_flags, nd,
1254 open_flags, 0);
1258 * path_lookup_create - lookup a file path with open + create intent
1259 * @dfd: the directory to use as base, or AT_FDCWD
1260 * @name: pointer to file name
1261 * @lookup_flags: lookup intent flags
1262 * @nd: pointer to nameidata
1263 * @open_flags: open intent flags
1264 * @create_mode: create intent flags
1266 static int path_lookup_create(int dfd, const char *name,
1267 unsigned int lookup_flags, struct nameidata *nd,
1268 int open_flags, int create_mode)
1270 return __path_lookup_intent_open(dfd, name, lookup_flags|LOOKUP_CREATE,
1271 nd, open_flags, create_mode);
1274 int __user_path_lookup_open(const char __user *name, unsigned int lookup_flags,
1275 struct nameidata *nd, int open_flags)
1277 char *tmp = getname(name);
1278 int err = PTR_ERR(tmp);
1280 if (!IS_ERR(tmp)) {
1281 err = __path_lookup_intent_open(AT_FDCWD, tmp, lookup_flags, nd, open_flags, 0);
1282 putname(tmp);
1284 return err;
1287 static struct dentry *__lookup_hash(struct qstr *name,
1288 struct dentry *base, struct nameidata *nd)
1290 struct dentry *dentry;
1291 struct inode *inode;
1292 int err;
1294 inode = base->d_inode;
1297 * See if the low-level filesystem might want
1298 * to use its own hash..
1300 if (base->d_op && base->d_op->d_hash) {
1301 err = base->d_op->d_hash(base, name);
1302 dentry = ERR_PTR(err);
1303 if (err < 0)
1304 goto out;
1307 dentry = cached_lookup(base, name, nd);
1308 if (!dentry) {
1309 struct dentry *new = d_alloc(base, name);
1310 dentry = ERR_PTR(-ENOMEM);
1311 if (!new)
1312 goto out;
1313 dentry = inode->i_op->lookup(inode, new, nd);
1314 if (!dentry)
1315 dentry = new;
1316 else
1317 dput(new);
1319 out:
1320 return dentry;
1324 * Restricted form of lookup. Doesn't follow links, single-component only,
1325 * needs parent already locked. Doesn't follow mounts.
1326 * SMP-safe.
1328 static struct dentry *lookup_hash(struct nameidata *nd)
1330 int err;
1332 err = permission(nd->path.dentry->d_inode, MAY_EXEC, nd);
1333 if (err)
1334 return ERR_PTR(err);
1335 return __lookup_hash(&nd->last, nd->path.dentry, nd);
1338 static int __lookup_one_len(const char *name, struct qstr *this,
1339 struct dentry *base, int len)
1341 unsigned long hash;
1342 unsigned int c;
1344 this->name = name;
1345 this->len = len;
1346 if (!len)
1347 return -EACCES;
1349 hash = init_name_hash();
1350 while (len--) {
1351 c = *(const unsigned char *)name++;
1352 if (c == '/' || c == '\0')
1353 return -EACCES;
1354 hash = partial_name_hash(c, hash);
1356 this->hash = end_name_hash(hash);
1357 return 0;
1361 * lookup_one_len: filesystem helper to lookup single pathname component
1362 * @name: pathname component to lookup
1363 * @base: base directory to lookup from
1364 * @len: maximum length @len should be interpreted to
1366 * Note that this routine is purely a helper for filesystem useage and should
1367 * not be called by generic code. Also note that by using this function to
1368 * nameidata argument is passed to the filesystem methods and a filesystem
1369 * using this helper needs to be prepared for that.
1371 struct dentry *lookup_one_len(const char *name, struct dentry *base, int len)
1373 int err;
1374 struct qstr this;
1376 err = __lookup_one_len(name, &this, base, len);
1377 if (err)
1378 return ERR_PTR(err);
1380 err = permission(base->d_inode, MAY_EXEC, NULL);
1381 if (err)
1382 return ERR_PTR(err);
1383 return __lookup_hash(&this, base, NULL);
1387 * lookup_one_noperm - bad hack for sysfs
1388 * @name: pathname component to lookup
1389 * @base: base directory to lookup from
1391 * This is a variant of lookup_one_len that doesn't perform any permission
1392 * checks. It's a horrible hack to work around the braindead sysfs
1393 * architecture and should not be used anywhere else.
1395 * DON'T USE THIS FUNCTION EVER, thanks.
1397 struct dentry *lookup_one_noperm(const char *name, struct dentry *base)
1399 int err;
1400 struct qstr this;
1402 err = __lookup_one_len(name, &this, base, strlen(name));
1403 if (err)
1404 return ERR_PTR(err);
1405 return __lookup_hash(&this, base, NULL);
1408 int __user_walk_fd(int dfd, const char __user *name, unsigned flags,
1409 struct nameidata *nd)
1411 char *tmp = getname(name);
1412 int err = PTR_ERR(tmp);
1414 if (!IS_ERR(tmp)) {
1415 err = do_path_lookup(dfd, tmp, flags, nd);
1416 putname(tmp);
1418 return err;
1421 int __user_walk(const char __user *name, unsigned flags, struct nameidata *nd)
1423 return __user_walk_fd(AT_FDCWD, name, flags, nd);
1427 * It's inline, so penalty for filesystems that don't use sticky bit is
1428 * minimal.
1430 static inline int check_sticky(struct inode *dir, struct inode *inode)
1432 if (!(dir->i_mode & S_ISVTX))
1433 return 0;
1434 if (inode->i_uid == current->fsuid)
1435 return 0;
1436 if (dir->i_uid == current->fsuid)
1437 return 0;
1438 return !capable(CAP_FOWNER);
1442 * Check whether we can remove a link victim from directory dir, check
1443 * whether the type of victim is right.
1444 * 1. We can't do it if dir is read-only (done in permission())
1445 * 2. We should have write and exec permissions on dir
1446 * 3. We can't remove anything from append-only dir
1447 * 4. We can't do anything with immutable dir (done in permission())
1448 * 5. If the sticky bit on dir is set we should either
1449 * a. be owner of dir, or
1450 * b. be owner of victim, or
1451 * c. have CAP_FOWNER capability
1452 * 6. If the victim is append-only or immutable we can't do antyhing with
1453 * links pointing to it.
1454 * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR.
1455 * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR.
1456 * 9. We can't remove a root or mountpoint.
1457 * 10. We don't allow removal of NFS sillyrenamed files; it's handled by
1458 * nfs_async_unlink().
1460 static int may_delete(struct inode *dir,struct dentry *victim,int isdir)
1462 int error;
1464 if (!victim->d_inode)
1465 return -ENOENT;
1467 BUG_ON(victim->d_parent->d_inode != dir);
1468 audit_inode_child(victim->d_name.name, victim, dir);
1470 error = permission(dir,MAY_WRITE | MAY_EXEC, NULL);
1471 if (error)
1472 return error;
1473 if (IS_APPEND(dir))
1474 return -EPERM;
1475 if (check_sticky(dir, victim->d_inode)||IS_APPEND(victim->d_inode)||
1476 IS_IMMUTABLE(victim->d_inode))
1477 return -EPERM;
1478 if (isdir) {
1479 if (!S_ISDIR(victim->d_inode->i_mode))
1480 return -ENOTDIR;
1481 if (IS_ROOT(victim))
1482 return -EBUSY;
1483 } else if (S_ISDIR(victim->d_inode->i_mode))
1484 return -EISDIR;
1485 if (IS_DEADDIR(dir))
1486 return -ENOENT;
1487 if (victim->d_flags & DCACHE_NFSFS_RENAMED)
1488 return -EBUSY;
1489 return 0;
1492 /* Check whether we can create an object with dentry child in directory
1493 * dir.
1494 * 1. We can't do it if child already exists (open has special treatment for
1495 * this case, but since we are inlined it's OK)
1496 * 2. We can't do it if dir is read-only (done in permission())
1497 * 3. We should have write and exec permissions on dir
1498 * 4. We can't do it if dir is immutable (done in permission())
1500 static inline int may_create(struct inode *dir, struct dentry *child,
1501 struct nameidata *nd)
1503 if (child->d_inode)
1504 return -EEXIST;
1505 if (IS_DEADDIR(dir))
1506 return -ENOENT;
1507 return permission(dir,MAY_WRITE | MAY_EXEC, nd);
1511 * O_DIRECTORY translates into forcing a directory lookup.
1513 static inline int lookup_flags(unsigned int f)
1515 unsigned long retval = LOOKUP_FOLLOW;
1517 if (f & O_NOFOLLOW)
1518 retval &= ~LOOKUP_FOLLOW;
1520 if (f & O_DIRECTORY)
1521 retval |= LOOKUP_DIRECTORY;
1523 return retval;
1527 * p1 and p2 should be directories on the same fs.
1529 struct dentry *lock_rename(struct dentry *p1, struct dentry *p2)
1531 struct dentry *p;
1533 if (p1 == p2) {
1534 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1535 return NULL;
1538 mutex_lock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1540 for (p = p1; p->d_parent != p; p = p->d_parent) {
1541 if (p->d_parent == p2) {
1542 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_PARENT);
1543 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_CHILD);
1544 return p;
1548 for (p = p2; p->d_parent != p; p = p->d_parent) {
1549 if (p->d_parent == p1) {
1550 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1551 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1552 return p;
1556 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1557 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1558 return NULL;
1561 void unlock_rename(struct dentry *p1, struct dentry *p2)
1563 mutex_unlock(&p1->d_inode->i_mutex);
1564 if (p1 != p2) {
1565 mutex_unlock(&p2->d_inode->i_mutex);
1566 mutex_unlock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1570 int vfs_create(struct inode *dir, struct dentry *dentry, int mode,
1571 struct nameidata *nd)
1573 int error = may_create(dir, dentry, nd);
1575 if (error)
1576 return error;
1578 if (!dir->i_op || !dir->i_op->create)
1579 return -EACCES; /* shouldn't it be ENOSYS? */
1580 mode &= S_IALLUGO;
1581 mode |= S_IFREG;
1582 error = security_inode_create(dir, dentry, mode);
1583 if (error)
1584 return error;
1585 DQUOT_INIT(dir);
1586 error = dir->i_op->create(dir, dentry, mode, nd);
1587 if (!error)
1588 fsnotify_create(dir, dentry);
1589 return error;
1592 int may_open(struct nameidata *nd, int acc_mode, int flag)
1594 struct dentry *dentry = nd->path.dentry;
1595 struct inode *inode = dentry->d_inode;
1596 int error;
1598 if (!inode)
1599 return -ENOENT;
1601 if (S_ISLNK(inode->i_mode))
1602 return -ELOOP;
1604 if (S_ISDIR(inode->i_mode) && (acc_mode & MAY_WRITE))
1605 return -EISDIR;
1608 * FIFO's, sockets and device files are special: they don't
1609 * actually live on the filesystem itself, and as such you
1610 * can write to them even if the filesystem is read-only.
1612 if (S_ISFIFO(inode->i_mode) || S_ISSOCK(inode->i_mode)) {
1613 flag &= ~O_TRUNC;
1614 } else if (S_ISBLK(inode->i_mode) || S_ISCHR(inode->i_mode)) {
1615 if (nd->path.mnt->mnt_flags & MNT_NODEV)
1616 return -EACCES;
1618 flag &= ~O_TRUNC;
1619 } else if (IS_RDONLY(inode) && (acc_mode & MAY_WRITE))
1620 return -EROFS;
1622 error = vfs_permission(nd, acc_mode);
1623 if (error)
1624 return error;
1626 * An append-only file must be opened in append mode for writing.
1628 if (IS_APPEND(inode)) {
1629 if ((flag & FMODE_WRITE) && !(flag & O_APPEND))
1630 return -EPERM;
1631 if (flag & O_TRUNC)
1632 return -EPERM;
1635 /* O_NOATIME can only be set by the owner or superuser */
1636 if (flag & O_NOATIME)
1637 if (!is_owner_or_cap(inode))
1638 return -EPERM;
1641 * Ensure there are no outstanding leases on the file.
1643 error = break_lease(inode, flag);
1644 if (error)
1645 return error;
1647 if (flag & O_TRUNC) {
1648 error = get_write_access(inode);
1649 if (error)
1650 return error;
1653 * Refuse to truncate files with mandatory locks held on them.
1655 error = locks_verify_locked(inode);
1656 if (!error) {
1657 DQUOT_INIT(inode);
1659 error = do_truncate(dentry, 0,
1660 ATTR_MTIME|ATTR_CTIME|ATTR_OPEN,
1661 NULL);
1663 put_write_access(inode);
1664 if (error)
1665 return error;
1666 } else
1667 if (flag & FMODE_WRITE)
1668 DQUOT_INIT(inode);
1670 return 0;
1673 static int open_namei_create(struct nameidata *nd, struct path *path,
1674 int flag, int mode)
1676 int error;
1677 struct dentry *dir = nd->path.dentry;
1679 if (!IS_POSIXACL(dir->d_inode))
1680 mode &= ~current->fs->umask;
1681 error = vfs_create(dir->d_inode, path->dentry, mode, nd);
1682 mutex_unlock(&dir->d_inode->i_mutex);
1683 dput(nd->path.dentry);
1684 nd->path.dentry = path->dentry;
1685 if (error)
1686 return error;
1687 /* Don't check for write permission, don't truncate */
1688 return may_open(nd, 0, flag & ~O_TRUNC);
1692 * open_namei()
1694 * namei for open - this is in fact almost the whole open-routine.
1696 * Note that the low bits of "flag" aren't the same as in the open
1697 * system call - they are 00 - no permissions needed
1698 * 01 - read permission needed
1699 * 10 - write permission needed
1700 * 11 - read/write permissions needed
1701 * which is a lot more logical, and also allows the "no perm" needed
1702 * for symlinks (where the permissions are checked later).
1703 * SMP-safe
1705 int open_namei(int dfd, const char *pathname, int flag,
1706 int mode, struct nameidata *nd)
1708 int acc_mode, error;
1709 struct path path;
1710 struct dentry *dir;
1711 int count = 0;
1713 acc_mode = ACC_MODE(flag);
1715 /* O_TRUNC implies we need access checks for write permissions */
1716 if (flag & O_TRUNC)
1717 acc_mode |= MAY_WRITE;
1719 /* Allow the LSM permission hook to distinguish append
1720 access from general write access. */
1721 if (flag & O_APPEND)
1722 acc_mode |= MAY_APPEND;
1725 * The simplest case - just a plain lookup.
1727 if (!(flag & O_CREAT)) {
1728 error = path_lookup_open(dfd, pathname, lookup_flags(flag),
1729 nd, flag);
1730 if (error)
1731 return error;
1732 goto ok;
1736 * Create - we need to know the parent.
1738 error = path_lookup_create(dfd,pathname,LOOKUP_PARENT,nd,flag,mode);
1739 if (error)
1740 return error;
1743 * We have the parent and last component. First of all, check
1744 * that we are not asked to creat(2) an obvious directory - that
1745 * will not do.
1747 error = -EISDIR;
1748 if (nd->last_type != LAST_NORM || nd->last.name[nd->last.len])
1749 goto exit;
1751 dir = nd->path.dentry;
1752 nd->flags &= ~LOOKUP_PARENT;
1753 mutex_lock(&dir->d_inode->i_mutex);
1754 path.dentry = lookup_hash(nd);
1755 path.mnt = nd->path.mnt;
1757 do_last:
1758 error = PTR_ERR(path.dentry);
1759 if (IS_ERR(path.dentry)) {
1760 mutex_unlock(&dir->d_inode->i_mutex);
1761 goto exit;
1764 if (IS_ERR(nd->intent.open.file)) {
1765 mutex_unlock(&dir->d_inode->i_mutex);
1766 error = PTR_ERR(nd->intent.open.file);
1767 goto exit_dput;
1770 /* Negative dentry, just create the file */
1771 if (!path.dentry->d_inode) {
1772 error = open_namei_create(nd, &path, flag, mode);
1773 if (error)
1774 goto exit;
1775 return 0;
1779 * It already exists.
1781 mutex_unlock(&dir->d_inode->i_mutex);
1782 audit_inode(pathname, path.dentry);
1784 error = -EEXIST;
1785 if (flag & O_EXCL)
1786 goto exit_dput;
1788 if (__follow_mount(&path)) {
1789 error = -ELOOP;
1790 if (flag & O_NOFOLLOW)
1791 goto exit_dput;
1794 error = -ENOENT;
1795 if (!path.dentry->d_inode)
1796 goto exit_dput;
1797 if (path.dentry->d_inode->i_op && path.dentry->d_inode->i_op->follow_link)
1798 goto do_link;
1800 path_to_nameidata(&path, nd);
1801 error = -EISDIR;
1802 if (path.dentry->d_inode && S_ISDIR(path.dentry->d_inode->i_mode))
1803 goto exit;
1805 error = may_open(nd, acc_mode, flag);
1806 if (error)
1807 goto exit;
1808 return 0;
1810 exit_dput:
1811 path_put_conditional(&path, nd);
1812 exit:
1813 if (!IS_ERR(nd->intent.open.file))
1814 release_open_intent(nd);
1815 path_put(&nd->path);
1816 return error;
1818 do_link:
1819 error = -ELOOP;
1820 if (flag & O_NOFOLLOW)
1821 goto exit_dput;
1823 * This is subtle. Instead of calling do_follow_link() we do the
1824 * thing by hands. The reason is that this way we have zero link_count
1825 * and path_walk() (called from ->follow_link) honoring LOOKUP_PARENT.
1826 * After that we have the parent and last component, i.e.
1827 * we are in the same situation as after the first path_walk().
1828 * Well, almost - if the last component is normal we get its copy
1829 * stored in nd->last.name and we will have to putname() it when we
1830 * are done. Procfs-like symlinks just set LAST_BIND.
1832 nd->flags |= LOOKUP_PARENT;
1833 error = security_inode_follow_link(path.dentry, nd);
1834 if (error)
1835 goto exit_dput;
1836 error = __do_follow_link(&path, nd);
1837 if (error) {
1838 /* Does someone understand code flow here? Or it is only
1839 * me so stupid? Anathema to whoever designed this non-sense
1840 * with "intent.open".
1842 release_open_intent(nd);
1843 return error;
1845 nd->flags &= ~LOOKUP_PARENT;
1846 if (nd->last_type == LAST_BIND)
1847 goto ok;
1848 error = -EISDIR;
1849 if (nd->last_type != LAST_NORM)
1850 goto exit;
1851 if (nd->last.name[nd->last.len]) {
1852 __putname(nd->last.name);
1853 goto exit;
1855 error = -ELOOP;
1856 if (count++==32) {
1857 __putname(nd->last.name);
1858 goto exit;
1860 dir = nd->path.dentry;
1861 mutex_lock(&dir->d_inode->i_mutex);
1862 path.dentry = lookup_hash(nd);
1863 path.mnt = nd->path.mnt;
1864 __putname(nd->last.name);
1865 goto do_last;
1869 * lookup_create - lookup a dentry, creating it if it doesn't exist
1870 * @nd: nameidata info
1871 * @is_dir: directory flag
1873 * Simple function to lookup and return a dentry and create it
1874 * if it doesn't exist. Is SMP-safe.
1876 * Returns with nd->path.dentry->d_inode->i_mutex locked.
1878 struct dentry *lookup_create(struct nameidata *nd, int is_dir)
1880 struct dentry *dentry = ERR_PTR(-EEXIST);
1882 mutex_lock_nested(&nd->path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
1884 * Yucky last component or no last component at all?
1885 * (foo/., foo/.., /////)
1887 if (nd->last_type != LAST_NORM)
1888 goto fail;
1889 nd->flags &= ~LOOKUP_PARENT;
1890 nd->flags |= LOOKUP_CREATE;
1891 nd->intent.open.flags = O_EXCL;
1894 * Do the final lookup.
1896 dentry = lookup_hash(nd);
1897 if (IS_ERR(dentry))
1898 goto fail;
1901 * Special case - lookup gave negative, but... we had foo/bar/
1902 * From the vfs_mknod() POV we just have a negative dentry -
1903 * all is fine. Let's be bastards - you had / on the end, you've
1904 * been asking for (non-existent) directory. -ENOENT for you.
1906 if (!is_dir && nd->last.name[nd->last.len] && !dentry->d_inode)
1907 goto enoent;
1908 return dentry;
1909 enoent:
1910 dput(dentry);
1911 dentry = ERR_PTR(-ENOENT);
1912 fail:
1913 return dentry;
1915 EXPORT_SYMBOL_GPL(lookup_create);
1917 int vfs_mknod(struct inode *dir, struct dentry *dentry, int mode, dev_t dev)
1919 int error = may_create(dir, dentry, NULL);
1921 if (error)
1922 return error;
1924 if ((S_ISCHR(mode) || S_ISBLK(mode)) && !capable(CAP_MKNOD))
1925 return -EPERM;
1927 if (!dir->i_op || !dir->i_op->mknod)
1928 return -EPERM;
1930 error = security_inode_mknod(dir, dentry, mode, dev);
1931 if (error)
1932 return error;
1934 DQUOT_INIT(dir);
1935 error = dir->i_op->mknod(dir, dentry, mode, dev);
1936 if (!error)
1937 fsnotify_create(dir, dentry);
1938 return error;
1941 asmlinkage long sys_mknodat(int dfd, const char __user *filename, int mode,
1942 unsigned dev)
1944 int error = 0;
1945 char * tmp;
1946 struct dentry * dentry;
1947 struct nameidata nd;
1949 if (S_ISDIR(mode))
1950 return -EPERM;
1951 tmp = getname(filename);
1952 if (IS_ERR(tmp))
1953 return PTR_ERR(tmp);
1955 error = do_path_lookup(dfd, tmp, LOOKUP_PARENT, &nd);
1956 if (error)
1957 goto out;
1958 dentry = lookup_create(&nd, 0);
1959 error = PTR_ERR(dentry);
1961 if (!IS_POSIXACL(nd.path.dentry->d_inode))
1962 mode &= ~current->fs->umask;
1963 if (!IS_ERR(dentry)) {
1964 switch (mode & S_IFMT) {
1965 case 0: case S_IFREG:
1966 error = vfs_create(nd.path.dentry->d_inode,dentry,mode,&nd);
1967 break;
1968 case S_IFCHR: case S_IFBLK:
1969 error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode,
1970 new_decode_dev(dev));
1971 break;
1972 case S_IFIFO: case S_IFSOCK:
1973 error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode,0);
1974 break;
1975 case S_IFDIR:
1976 error = -EPERM;
1977 break;
1978 default:
1979 error = -EINVAL;
1981 dput(dentry);
1983 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
1984 path_put(&nd.path);
1985 out:
1986 putname(tmp);
1988 return error;
1991 asmlinkage long sys_mknod(const char __user *filename, int mode, unsigned dev)
1993 return sys_mknodat(AT_FDCWD, filename, mode, dev);
1996 int vfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
1998 int error = may_create(dir, dentry, NULL);
2000 if (error)
2001 return error;
2003 if (!dir->i_op || !dir->i_op->mkdir)
2004 return -EPERM;
2006 mode &= (S_IRWXUGO|S_ISVTX);
2007 error = security_inode_mkdir(dir, dentry, mode);
2008 if (error)
2009 return error;
2011 DQUOT_INIT(dir);
2012 error = dir->i_op->mkdir(dir, dentry, mode);
2013 if (!error)
2014 fsnotify_mkdir(dir, dentry);
2015 return error;
2018 asmlinkage long sys_mkdirat(int dfd, const char __user *pathname, int mode)
2020 int error = 0;
2021 char * tmp;
2022 struct dentry *dentry;
2023 struct nameidata nd;
2025 tmp = getname(pathname);
2026 error = PTR_ERR(tmp);
2027 if (IS_ERR(tmp))
2028 goto out_err;
2030 error = do_path_lookup(dfd, tmp, LOOKUP_PARENT, &nd);
2031 if (error)
2032 goto out;
2033 dentry = lookup_create(&nd, 1);
2034 error = PTR_ERR(dentry);
2035 if (IS_ERR(dentry))
2036 goto out_unlock;
2038 if (!IS_POSIXACL(nd.path.dentry->d_inode))
2039 mode &= ~current->fs->umask;
2040 error = vfs_mkdir(nd.path.dentry->d_inode, dentry, mode);
2041 dput(dentry);
2042 out_unlock:
2043 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2044 path_put(&nd.path);
2045 out:
2046 putname(tmp);
2047 out_err:
2048 return error;
2051 asmlinkage long sys_mkdir(const char __user *pathname, int mode)
2053 return sys_mkdirat(AT_FDCWD, pathname, mode);
2057 * We try to drop the dentry early: we should have
2058 * a usage count of 2 if we're the only user of this
2059 * dentry, and if that is true (possibly after pruning
2060 * the dcache), then we drop the dentry now.
2062 * A low-level filesystem can, if it choses, legally
2063 * do a
2065 * if (!d_unhashed(dentry))
2066 * return -EBUSY;
2068 * if it cannot handle the case of removing a directory
2069 * that is still in use by something else..
2071 void dentry_unhash(struct dentry *dentry)
2073 dget(dentry);
2074 shrink_dcache_parent(dentry);
2075 spin_lock(&dcache_lock);
2076 spin_lock(&dentry->d_lock);
2077 if (atomic_read(&dentry->d_count) == 2)
2078 __d_drop(dentry);
2079 spin_unlock(&dentry->d_lock);
2080 spin_unlock(&dcache_lock);
2083 int vfs_rmdir(struct inode *dir, struct dentry *dentry)
2085 int error = may_delete(dir, dentry, 1);
2087 if (error)
2088 return error;
2090 if (!dir->i_op || !dir->i_op->rmdir)
2091 return -EPERM;
2093 DQUOT_INIT(dir);
2095 mutex_lock(&dentry->d_inode->i_mutex);
2096 dentry_unhash(dentry);
2097 if (d_mountpoint(dentry))
2098 error = -EBUSY;
2099 else {
2100 error = security_inode_rmdir(dir, dentry);
2101 if (!error) {
2102 error = dir->i_op->rmdir(dir, dentry);
2103 if (!error)
2104 dentry->d_inode->i_flags |= S_DEAD;
2107 mutex_unlock(&dentry->d_inode->i_mutex);
2108 if (!error) {
2109 d_delete(dentry);
2111 dput(dentry);
2113 return error;
2116 static long do_rmdir(int dfd, const char __user *pathname)
2118 int error = 0;
2119 char * name;
2120 struct dentry *dentry;
2121 struct nameidata nd;
2123 name = getname(pathname);
2124 if(IS_ERR(name))
2125 return PTR_ERR(name);
2127 error = do_path_lookup(dfd, name, LOOKUP_PARENT, &nd);
2128 if (error)
2129 goto exit;
2131 switch(nd.last_type) {
2132 case LAST_DOTDOT:
2133 error = -ENOTEMPTY;
2134 goto exit1;
2135 case LAST_DOT:
2136 error = -EINVAL;
2137 goto exit1;
2138 case LAST_ROOT:
2139 error = -EBUSY;
2140 goto exit1;
2142 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2143 dentry = lookup_hash(&nd);
2144 error = PTR_ERR(dentry);
2145 if (IS_ERR(dentry))
2146 goto exit2;
2147 error = vfs_rmdir(nd.path.dentry->d_inode, dentry);
2148 dput(dentry);
2149 exit2:
2150 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2151 exit1:
2152 path_put(&nd.path);
2153 exit:
2154 putname(name);
2155 return error;
2158 asmlinkage long sys_rmdir(const char __user *pathname)
2160 return do_rmdir(AT_FDCWD, pathname);
2163 int vfs_unlink(struct inode *dir, struct dentry *dentry)
2165 int error = may_delete(dir, dentry, 0);
2167 if (error)
2168 return error;
2170 if (!dir->i_op || !dir->i_op->unlink)
2171 return -EPERM;
2173 DQUOT_INIT(dir);
2175 mutex_lock(&dentry->d_inode->i_mutex);
2176 if (d_mountpoint(dentry))
2177 error = -EBUSY;
2178 else {
2179 error = security_inode_unlink(dir, dentry);
2180 if (!error)
2181 error = dir->i_op->unlink(dir, dentry);
2183 mutex_unlock(&dentry->d_inode->i_mutex);
2185 /* We don't d_delete() NFS sillyrenamed files--they still exist. */
2186 if (!error && !(dentry->d_flags & DCACHE_NFSFS_RENAMED)) {
2187 fsnotify_link_count(dentry->d_inode);
2188 d_delete(dentry);
2191 return error;
2195 * Make sure that the actual truncation of the file will occur outside its
2196 * directory's i_mutex. Truncate can take a long time if there is a lot of
2197 * writeout happening, and we don't want to prevent access to the directory
2198 * while waiting on the I/O.
2200 static long do_unlinkat(int dfd, const char __user *pathname)
2202 int error = 0;
2203 char * name;
2204 struct dentry *dentry;
2205 struct nameidata nd;
2206 struct inode *inode = NULL;
2208 name = getname(pathname);
2209 if(IS_ERR(name))
2210 return PTR_ERR(name);
2212 error = do_path_lookup(dfd, name, LOOKUP_PARENT, &nd);
2213 if (error)
2214 goto exit;
2215 error = -EISDIR;
2216 if (nd.last_type != LAST_NORM)
2217 goto exit1;
2218 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2219 dentry = lookup_hash(&nd);
2220 error = PTR_ERR(dentry);
2221 if (!IS_ERR(dentry)) {
2222 /* Why not before? Because we want correct error value */
2223 if (nd.last.name[nd.last.len])
2224 goto slashes;
2225 inode = dentry->d_inode;
2226 if (inode)
2227 atomic_inc(&inode->i_count);
2228 error = vfs_unlink(nd.path.dentry->d_inode, dentry);
2229 exit2:
2230 dput(dentry);
2232 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2233 if (inode)
2234 iput(inode); /* truncate the inode here */
2235 exit1:
2236 path_put(&nd.path);
2237 exit:
2238 putname(name);
2239 return error;
2241 slashes:
2242 error = !dentry->d_inode ? -ENOENT :
2243 S_ISDIR(dentry->d_inode->i_mode) ? -EISDIR : -ENOTDIR;
2244 goto exit2;
2247 asmlinkage long sys_unlinkat(int dfd, const char __user *pathname, int flag)
2249 if ((flag & ~AT_REMOVEDIR) != 0)
2250 return -EINVAL;
2252 if (flag & AT_REMOVEDIR)
2253 return do_rmdir(dfd, pathname);
2255 return do_unlinkat(dfd, pathname);
2258 asmlinkage long sys_unlink(const char __user *pathname)
2260 return do_unlinkat(AT_FDCWD, pathname);
2263 int vfs_symlink(struct inode *dir, struct dentry *dentry, const char *oldname, int mode)
2265 int error = may_create(dir, dentry, NULL);
2267 if (error)
2268 return error;
2270 if (!dir->i_op || !dir->i_op->symlink)
2271 return -EPERM;
2273 error = security_inode_symlink(dir, dentry, oldname);
2274 if (error)
2275 return error;
2277 DQUOT_INIT(dir);
2278 error = dir->i_op->symlink(dir, dentry, oldname);
2279 if (!error)
2280 fsnotify_create(dir, dentry);
2281 return error;
2284 asmlinkage long sys_symlinkat(const char __user *oldname,
2285 int newdfd, const char __user *newname)
2287 int error = 0;
2288 char * from;
2289 char * to;
2290 struct dentry *dentry;
2291 struct nameidata nd;
2293 from = getname(oldname);
2294 if(IS_ERR(from))
2295 return PTR_ERR(from);
2296 to = getname(newname);
2297 error = PTR_ERR(to);
2298 if (IS_ERR(to))
2299 goto out_putname;
2301 error = do_path_lookup(newdfd, to, LOOKUP_PARENT, &nd);
2302 if (error)
2303 goto out;
2304 dentry = lookup_create(&nd, 0);
2305 error = PTR_ERR(dentry);
2306 if (IS_ERR(dentry))
2307 goto out_unlock;
2309 error = vfs_symlink(nd.path.dentry->d_inode, dentry, from, S_IALLUGO);
2310 dput(dentry);
2311 out_unlock:
2312 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2313 path_put(&nd.path);
2314 out:
2315 putname(to);
2316 out_putname:
2317 putname(from);
2318 return error;
2321 asmlinkage long sys_symlink(const char __user *oldname, const char __user *newname)
2323 return sys_symlinkat(oldname, AT_FDCWD, newname);
2326 int vfs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *new_dentry)
2328 struct inode *inode = old_dentry->d_inode;
2329 int error;
2331 if (!inode)
2332 return -ENOENT;
2334 error = may_create(dir, new_dentry, NULL);
2335 if (error)
2336 return error;
2338 if (dir->i_sb != inode->i_sb)
2339 return -EXDEV;
2342 * A link to an append-only or immutable file cannot be created.
2344 if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
2345 return -EPERM;
2346 if (!dir->i_op || !dir->i_op->link)
2347 return -EPERM;
2348 if (S_ISDIR(old_dentry->d_inode->i_mode))
2349 return -EPERM;
2351 error = security_inode_link(old_dentry, dir, new_dentry);
2352 if (error)
2353 return error;
2355 mutex_lock(&old_dentry->d_inode->i_mutex);
2356 DQUOT_INIT(dir);
2357 error = dir->i_op->link(old_dentry, dir, new_dentry);
2358 mutex_unlock(&old_dentry->d_inode->i_mutex);
2359 if (!error)
2360 fsnotify_link(dir, old_dentry->d_inode, new_dentry);
2361 return error;
2365 * Hardlinks are often used in delicate situations. We avoid
2366 * security-related surprises by not following symlinks on the
2367 * newname. --KAB
2369 * We don't follow them on the oldname either to be compatible
2370 * with linux 2.0, and to avoid hard-linking to directories
2371 * and other special files. --ADM
2373 asmlinkage long sys_linkat(int olddfd, const char __user *oldname,
2374 int newdfd, const char __user *newname,
2375 int flags)
2377 struct dentry *new_dentry;
2378 struct nameidata nd, old_nd;
2379 int error;
2380 char * to;
2382 if ((flags & ~AT_SYMLINK_FOLLOW) != 0)
2383 return -EINVAL;
2385 to = getname(newname);
2386 if (IS_ERR(to))
2387 return PTR_ERR(to);
2389 error = __user_walk_fd(olddfd, oldname,
2390 flags & AT_SYMLINK_FOLLOW ? LOOKUP_FOLLOW : 0,
2391 &old_nd);
2392 if (error)
2393 goto exit;
2394 error = do_path_lookup(newdfd, to, LOOKUP_PARENT, &nd);
2395 if (error)
2396 goto out;
2397 error = -EXDEV;
2398 if (old_nd.path.mnt != nd.path.mnt)
2399 goto out_release;
2400 new_dentry = lookup_create(&nd, 0);
2401 error = PTR_ERR(new_dentry);
2402 if (IS_ERR(new_dentry))
2403 goto out_unlock;
2404 error = vfs_link(old_nd.path.dentry, nd.path.dentry->d_inode, new_dentry);
2405 dput(new_dentry);
2406 out_unlock:
2407 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2408 out_release:
2409 path_put(&nd.path);
2410 out:
2411 path_put(&old_nd.path);
2412 exit:
2413 putname(to);
2415 return error;
2418 asmlinkage long sys_link(const char __user *oldname, const char __user *newname)
2420 return sys_linkat(AT_FDCWD, oldname, AT_FDCWD, newname, 0);
2424 * The worst of all namespace operations - renaming directory. "Perverted"
2425 * doesn't even start to describe it. Somebody in UCB had a heck of a trip...
2426 * Problems:
2427 * a) we can get into loop creation. Check is done in is_subdir().
2428 * b) race potential - two innocent renames can create a loop together.
2429 * That's where 4.4 screws up. Current fix: serialization on
2430 * sb->s_vfs_rename_mutex. We might be more accurate, but that's another
2431 * story.
2432 * c) we have to lock _three_ objects - parents and victim (if it exists).
2433 * And that - after we got ->i_mutex on parents (until then we don't know
2434 * whether the target exists). Solution: try to be smart with locking
2435 * order for inodes. We rely on the fact that tree topology may change
2436 * only under ->s_vfs_rename_mutex _and_ that parent of the object we
2437 * move will be locked. Thus we can rank directories by the tree
2438 * (ancestors first) and rank all non-directories after them.
2439 * That works since everybody except rename does "lock parent, lookup,
2440 * lock child" and rename is under ->s_vfs_rename_mutex.
2441 * HOWEVER, it relies on the assumption that any object with ->lookup()
2442 * has no more than 1 dentry. If "hybrid" objects will ever appear,
2443 * we'd better make sure that there's no link(2) for them.
2444 * d) some filesystems don't support opened-but-unlinked directories,
2445 * either because of layout or because they are not ready to deal with
2446 * all cases correctly. The latter will be fixed (taking this sort of
2447 * stuff into VFS), but the former is not going away. Solution: the same
2448 * trick as in rmdir().
2449 * e) conversion from fhandle to dentry may come in the wrong moment - when
2450 * we are removing the target. Solution: we will have to grab ->i_mutex
2451 * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on
2452 * ->i_mutex on parents, which works but leads to some truely excessive
2453 * locking].
2455 static int vfs_rename_dir(struct inode *old_dir, struct dentry *old_dentry,
2456 struct inode *new_dir, struct dentry *new_dentry)
2458 int error = 0;
2459 struct inode *target;
2462 * If we are going to change the parent - check write permissions,
2463 * we'll need to flip '..'.
2465 if (new_dir != old_dir) {
2466 error = permission(old_dentry->d_inode, MAY_WRITE, NULL);
2467 if (error)
2468 return error;
2471 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2472 if (error)
2473 return error;
2475 target = new_dentry->d_inode;
2476 if (target) {
2477 mutex_lock(&target->i_mutex);
2478 dentry_unhash(new_dentry);
2480 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2481 error = -EBUSY;
2482 else
2483 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2484 if (target) {
2485 if (!error)
2486 target->i_flags |= S_DEAD;
2487 mutex_unlock(&target->i_mutex);
2488 if (d_unhashed(new_dentry))
2489 d_rehash(new_dentry);
2490 dput(new_dentry);
2492 if (!error)
2493 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
2494 d_move(old_dentry,new_dentry);
2495 return error;
2498 static int vfs_rename_other(struct inode *old_dir, struct dentry *old_dentry,
2499 struct inode *new_dir, struct dentry *new_dentry)
2501 struct inode *target;
2502 int error;
2504 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2505 if (error)
2506 return error;
2508 dget(new_dentry);
2509 target = new_dentry->d_inode;
2510 if (target)
2511 mutex_lock(&target->i_mutex);
2512 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2513 error = -EBUSY;
2514 else
2515 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2516 if (!error) {
2517 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
2518 d_move(old_dentry, new_dentry);
2520 if (target)
2521 mutex_unlock(&target->i_mutex);
2522 dput(new_dentry);
2523 return error;
2526 int vfs_rename(struct inode *old_dir, struct dentry *old_dentry,
2527 struct inode *new_dir, struct dentry *new_dentry)
2529 int error;
2530 int is_dir = S_ISDIR(old_dentry->d_inode->i_mode);
2531 const char *old_name;
2533 if (old_dentry->d_inode == new_dentry->d_inode)
2534 return 0;
2536 error = may_delete(old_dir, old_dentry, is_dir);
2537 if (error)
2538 return error;
2540 if (!new_dentry->d_inode)
2541 error = may_create(new_dir, new_dentry, NULL);
2542 else
2543 error = may_delete(new_dir, new_dentry, is_dir);
2544 if (error)
2545 return error;
2547 if (!old_dir->i_op || !old_dir->i_op->rename)
2548 return -EPERM;
2550 DQUOT_INIT(old_dir);
2551 DQUOT_INIT(new_dir);
2553 old_name = fsnotify_oldname_init(old_dentry->d_name.name);
2555 if (is_dir)
2556 error = vfs_rename_dir(old_dir,old_dentry,new_dir,new_dentry);
2557 else
2558 error = vfs_rename_other(old_dir,old_dentry,new_dir,new_dentry);
2559 if (!error) {
2560 const char *new_name = old_dentry->d_name.name;
2561 fsnotify_move(old_dir, new_dir, old_name, new_name, is_dir,
2562 new_dentry->d_inode, old_dentry);
2564 fsnotify_oldname_free(old_name);
2566 return error;
2569 static int do_rename(int olddfd, const char *oldname,
2570 int newdfd, const char *newname)
2572 int error = 0;
2573 struct dentry * old_dir, * new_dir;
2574 struct dentry * old_dentry, *new_dentry;
2575 struct dentry * trap;
2576 struct nameidata oldnd, newnd;
2578 error = do_path_lookup(olddfd, oldname, LOOKUP_PARENT, &oldnd);
2579 if (error)
2580 goto exit;
2582 error = do_path_lookup(newdfd, newname, LOOKUP_PARENT, &newnd);
2583 if (error)
2584 goto exit1;
2586 error = -EXDEV;
2587 if (oldnd.path.mnt != newnd.path.mnt)
2588 goto exit2;
2590 old_dir = oldnd.path.dentry;
2591 error = -EBUSY;
2592 if (oldnd.last_type != LAST_NORM)
2593 goto exit2;
2595 new_dir = newnd.path.dentry;
2596 if (newnd.last_type != LAST_NORM)
2597 goto exit2;
2599 trap = lock_rename(new_dir, old_dir);
2601 old_dentry = lookup_hash(&oldnd);
2602 error = PTR_ERR(old_dentry);
2603 if (IS_ERR(old_dentry))
2604 goto exit3;
2605 /* source must exist */
2606 error = -ENOENT;
2607 if (!old_dentry->d_inode)
2608 goto exit4;
2609 /* unless the source is a directory trailing slashes give -ENOTDIR */
2610 if (!S_ISDIR(old_dentry->d_inode->i_mode)) {
2611 error = -ENOTDIR;
2612 if (oldnd.last.name[oldnd.last.len])
2613 goto exit4;
2614 if (newnd.last.name[newnd.last.len])
2615 goto exit4;
2617 /* source should not be ancestor of target */
2618 error = -EINVAL;
2619 if (old_dentry == trap)
2620 goto exit4;
2621 new_dentry = lookup_hash(&newnd);
2622 error = PTR_ERR(new_dentry);
2623 if (IS_ERR(new_dentry))
2624 goto exit4;
2625 /* target should not be an ancestor of source */
2626 error = -ENOTEMPTY;
2627 if (new_dentry == trap)
2628 goto exit5;
2630 error = vfs_rename(old_dir->d_inode, old_dentry,
2631 new_dir->d_inode, new_dentry);
2632 exit5:
2633 dput(new_dentry);
2634 exit4:
2635 dput(old_dentry);
2636 exit3:
2637 unlock_rename(new_dir, old_dir);
2638 exit2:
2639 path_put(&newnd.path);
2640 exit1:
2641 path_put(&oldnd.path);
2642 exit:
2643 return error;
2646 asmlinkage long sys_renameat(int olddfd, const char __user *oldname,
2647 int newdfd, const char __user *newname)
2649 int error;
2650 char * from;
2651 char * to;
2653 from = getname(oldname);
2654 if(IS_ERR(from))
2655 return PTR_ERR(from);
2656 to = getname(newname);
2657 error = PTR_ERR(to);
2658 if (!IS_ERR(to)) {
2659 error = do_rename(olddfd, from, newdfd, to);
2660 putname(to);
2662 putname(from);
2663 return error;
2666 asmlinkage long sys_rename(const char __user *oldname, const char __user *newname)
2668 return sys_renameat(AT_FDCWD, oldname, AT_FDCWD, newname);
2671 int vfs_readlink(struct dentry *dentry, char __user *buffer, int buflen, const char *link)
2673 int len;
2675 len = PTR_ERR(link);
2676 if (IS_ERR(link))
2677 goto out;
2679 len = strlen(link);
2680 if (len > (unsigned) buflen)
2681 len = buflen;
2682 if (copy_to_user(buffer, link, len))
2683 len = -EFAULT;
2684 out:
2685 return len;
2689 * A helper for ->readlink(). This should be used *ONLY* for symlinks that
2690 * have ->follow_link() touching nd only in nd_set_link(). Using (or not
2691 * using) it for any given inode is up to filesystem.
2693 int generic_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2695 struct nameidata nd;
2696 void *cookie;
2698 nd.depth = 0;
2699 cookie = dentry->d_inode->i_op->follow_link(dentry, &nd);
2700 if (!IS_ERR(cookie)) {
2701 int res = vfs_readlink(dentry, buffer, buflen, nd_get_link(&nd));
2702 if (dentry->d_inode->i_op->put_link)
2703 dentry->d_inode->i_op->put_link(dentry, &nd, cookie);
2704 cookie = ERR_PTR(res);
2706 return PTR_ERR(cookie);
2709 int vfs_follow_link(struct nameidata *nd, const char *link)
2711 return __vfs_follow_link(nd, link);
2714 /* get the link contents into pagecache */
2715 static char *page_getlink(struct dentry * dentry, struct page **ppage)
2717 struct page * page;
2718 struct address_space *mapping = dentry->d_inode->i_mapping;
2719 page = read_mapping_page(mapping, 0, NULL);
2720 if (IS_ERR(page))
2721 return (char*)page;
2722 *ppage = page;
2723 return kmap(page);
2726 int page_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2728 struct page *page = NULL;
2729 char *s = page_getlink(dentry, &page);
2730 int res = vfs_readlink(dentry,buffer,buflen,s);
2731 if (page) {
2732 kunmap(page);
2733 page_cache_release(page);
2735 return res;
2738 void *page_follow_link_light(struct dentry *dentry, struct nameidata *nd)
2740 struct page *page = NULL;
2741 nd_set_link(nd, page_getlink(dentry, &page));
2742 return page;
2745 void page_put_link(struct dentry *dentry, struct nameidata *nd, void *cookie)
2747 struct page *page = cookie;
2749 if (page) {
2750 kunmap(page);
2751 page_cache_release(page);
2755 int __page_symlink(struct inode *inode, const char *symname, int len,
2756 gfp_t gfp_mask)
2758 struct address_space *mapping = inode->i_mapping;
2759 struct page *page;
2760 void *fsdata;
2761 int err;
2762 char *kaddr;
2764 retry:
2765 err = pagecache_write_begin(NULL, mapping, 0, len-1,
2766 AOP_FLAG_UNINTERRUPTIBLE, &page, &fsdata);
2767 if (err)
2768 goto fail;
2770 kaddr = kmap_atomic(page, KM_USER0);
2771 memcpy(kaddr, symname, len-1);
2772 kunmap_atomic(kaddr, KM_USER0);
2774 err = pagecache_write_end(NULL, mapping, 0, len-1, len-1,
2775 page, fsdata);
2776 if (err < 0)
2777 goto fail;
2778 if (err < len-1)
2779 goto retry;
2781 mark_inode_dirty(inode);
2782 return 0;
2783 fail:
2784 return err;
2787 int page_symlink(struct inode *inode, const char *symname, int len)
2789 return __page_symlink(inode, symname, len,
2790 mapping_gfp_mask(inode->i_mapping));
2793 const struct inode_operations page_symlink_inode_operations = {
2794 .readlink = generic_readlink,
2795 .follow_link = page_follow_link_light,
2796 .put_link = page_put_link,
2799 EXPORT_SYMBOL(__user_walk);
2800 EXPORT_SYMBOL(__user_walk_fd);
2801 EXPORT_SYMBOL(follow_down);
2802 EXPORT_SYMBOL(follow_up);
2803 EXPORT_SYMBOL(get_write_access); /* binfmt_aout */
2804 EXPORT_SYMBOL(getname);
2805 EXPORT_SYMBOL(lock_rename);
2806 EXPORT_SYMBOL(lookup_one_len);
2807 EXPORT_SYMBOL(page_follow_link_light);
2808 EXPORT_SYMBOL(page_put_link);
2809 EXPORT_SYMBOL(page_readlink);
2810 EXPORT_SYMBOL(__page_symlink);
2811 EXPORT_SYMBOL(page_symlink);
2812 EXPORT_SYMBOL(page_symlink_inode_operations);
2813 EXPORT_SYMBOL(path_lookup);
2814 EXPORT_SYMBOL(vfs_path_lookup);
2815 EXPORT_SYMBOL(permission);
2816 EXPORT_SYMBOL(vfs_permission);
2817 EXPORT_SYMBOL(file_permission);
2818 EXPORT_SYMBOL(unlock_rename);
2819 EXPORT_SYMBOL(vfs_create);
2820 EXPORT_SYMBOL(vfs_follow_link);
2821 EXPORT_SYMBOL(vfs_link);
2822 EXPORT_SYMBOL(vfs_mkdir);
2823 EXPORT_SYMBOL(vfs_mknod);
2824 EXPORT_SYMBOL(generic_permission);
2825 EXPORT_SYMBOL(vfs_readlink);
2826 EXPORT_SYMBOL(vfs_rename);
2827 EXPORT_SYMBOL(vfs_rmdir);
2828 EXPORT_SYMBOL(vfs_symlink);
2829 EXPORT_SYMBOL(vfs_unlink);
2830 EXPORT_SYMBOL(dentry_unhash);
2831 EXPORT_SYMBOL(generic_readlink);