make blk_settings_init() static
[pv_ops_mirror.git] / fs / namei.c
blob941c8e8228c041d90652313f13e72f2b6e975716
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_get - get a reference to a path
367 * @path: path to get the reference to
369 * Given a path increment the reference count to the dentry and the vfsmount.
371 void path_get(struct path *path)
373 mntget(path->mnt);
374 dget(path->dentry);
376 EXPORT_SYMBOL(path_get);
379 * path_put - put a reference to a path
380 * @path: path to put the reference to
382 * Given a path decrement the reference count to the dentry and the vfsmount.
384 void path_put(struct path *path)
386 dput(path->dentry);
387 mntput(path->mnt);
389 EXPORT_SYMBOL(path_put);
392 * release_open_intent - free up open intent resources
393 * @nd: pointer to nameidata
395 void release_open_intent(struct nameidata *nd)
397 if (nd->intent.open.file->f_path.dentry == NULL)
398 put_filp(nd->intent.open.file);
399 else
400 fput(nd->intent.open.file);
403 static inline struct dentry *
404 do_revalidate(struct dentry *dentry, struct nameidata *nd)
406 int status = dentry->d_op->d_revalidate(dentry, nd);
407 if (unlikely(status <= 0)) {
409 * The dentry failed validation.
410 * If d_revalidate returned 0 attempt to invalidate
411 * the dentry otherwise d_revalidate is asking us
412 * to return a fail status.
414 if (!status) {
415 if (!d_invalidate(dentry)) {
416 dput(dentry);
417 dentry = NULL;
419 } else {
420 dput(dentry);
421 dentry = ERR_PTR(status);
424 return dentry;
428 * Internal lookup() using the new generic dcache.
429 * SMP-safe
431 static struct dentry * cached_lookup(struct dentry * parent, struct qstr * name, struct nameidata *nd)
433 struct dentry * dentry = __d_lookup(parent, name);
435 /* lockess __d_lookup may fail due to concurrent d_move()
436 * in some unrelated directory, so try with d_lookup
438 if (!dentry)
439 dentry = d_lookup(parent, name);
441 if (dentry && dentry->d_op && dentry->d_op->d_revalidate)
442 dentry = do_revalidate(dentry, nd);
444 return dentry;
448 * Short-cut version of permission(), for calling by
449 * path_walk(), when dcache lock is held. Combines parts
450 * of permission() and generic_permission(), and tests ONLY for
451 * MAY_EXEC permission.
453 * If appropriate, check DAC only. If not appropriate, or
454 * short-cut DAC fails, then call permission() to do more
455 * complete permission check.
457 static int exec_permission_lite(struct inode *inode,
458 struct nameidata *nd)
460 umode_t mode = inode->i_mode;
462 if (inode->i_op && inode->i_op->permission)
463 return -EAGAIN;
465 if (current->fsuid == inode->i_uid)
466 mode >>= 6;
467 else if (in_group_p(inode->i_gid))
468 mode >>= 3;
470 if (mode & MAY_EXEC)
471 goto ok;
473 if ((inode->i_mode & S_IXUGO) && capable(CAP_DAC_OVERRIDE))
474 goto ok;
476 if (S_ISDIR(inode->i_mode) && capable(CAP_DAC_OVERRIDE))
477 goto ok;
479 if (S_ISDIR(inode->i_mode) && capable(CAP_DAC_READ_SEARCH))
480 goto ok;
482 return -EACCES;
484 return security_inode_permission(inode, MAY_EXEC, nd);
488 * This is called when everything else fails, and we actually have
489 * to go to the low-level filesystem to find out what we should do..
491 * We get the directory semaphore, and after getting that we also
492 * make sure that nobody added the entry to the dcache in the meantime..
493 * SMP-safe
495 static struct dentry * real_lookup(struct dentry * parent, struct qstr * name, struct nameidata *nd)
497 struct dentry * result;
498 struct inode *dir = parent->d_inode;
500 mutex_lock(&dir->i_mutex);
502 * First re-do the cached lookup just in case it was created
503 * while we waited for the directory semaphore..
505 * FIXME! This could use version numbering or similar to
506 * avoid unnecessary cache lookups.
508 * The "dcache_lock" is purely to protect the RCU list walker
509 * from concurrent renames at this point (we mustn't get false
510 * negatives from the RCU list walk here, unlike the optimistic
511 * fast walk).
513 * so doing d_lookup() (with seqlock), instead of lockfree __d_lookup
515 result = d_lookup(parent, name);
516 if (!result) {
517 struct dentry * dentry = d_alloc(parent, name);
518 result = ERR_PTR(-ENOMEM);
519 if (dentry) {
520 result = dir->i_op->lookup(dir, dentry, nd);
521 if (result)
522 dput(dentry);
523 else
524 result = dentry;
526 mutex_unlock(&dir->i_mutex);
527 return result;
531 * Uhhuh! Nasty case: the cache was re-populated while
532 * we waited on the semaphore. Need to revalidate.
534 mutex_unlock(&dir->i_mutex);
535 if (result->d_op && result->d_op->d_revalidate) {
536 result = do_revalidate(result, nd);
537 if (!result)
538 result = ERR_PTR(-ENOENT);
540 return result;
543 static int __emul_lookup_dentry(const char *, struct nameidata *);
545 /* SMP-safe */
546 static __always_inline int
547 walk_init_root(const char *name, struct nameidata *nd)
549 struct fs_struct *fs = current->fs;
551 read_lock(&fs->lock);
552 if (fs->altroot.dentry && !(nd->flags & LOOKUP_NOALT)) {
553 nd->path = fs->altroot;
554 path_get(&fs->altroot);
555 read_unlock(&fs->lock);
556 if (__emul_lookup_dentry(name,nd))
557 return 0;
558 read_lock(&fs->lock);
560 nd->path = fs->root;
561 path_get(&fs->root);
562 read_unlock(&fs->lock);
563 return 1;
566 static __always_inline int __vfs_follow_link(struct nameidata *nd, const char *link)
568 int res = 0;
569 char *name;
570 if (IS_ERR(link))
571 goto fail;
573 if (*link == '/') {
574 path_put(&nd->path);
575 if (!walk_init_root(link, nd))
576 /* weird __emul_prefix() stuff did it */
577 goto out;
579 res = link_path_walk(link, nd);
580 out:
581 if (nd->depth || res || nd->last_type!=LAST_NORM)
582 return res;
584 * If it is an iterative symlinks resolution in open_namei() we
585 * have to copy the last component. And all that crap because of
586 * bloody create() on broken symlinks. Furrfu...
588 name = __getname();
589 if (unlikely(!name)) {
590 path_put(&nd->path);
591 return -ENOMEM;
593 strcpy(name, nd->last.name);
594 nd->last.name = name;
595 return 0;
596 fail:
597 path_put(&nd->path);
598 return PTR_ERR(link);
601 static void path_put_conditional(struct path *path, struct nameidata *nd)
603 dput(path->dentry);
604 if (path->mnt != nd->path.mnt)
605 mntput(path->mnt);
608 static inline void path_to_nameidata(struct path *path, struct nameidata *nd)
610 dput(nd->path.dentry);
611 if (nd->path.mnt != path->mnt)
612 mntput(nd->path.mnt);
613 nd->path.mnt = path->mnt;
614 nd->path.dentry = path->dentry;
617 static __always_inline int __do_follow_link(struct path *path, struct nameidata *nd)
619 int error;
620 void *cookie;
621 struct dentry *dentry = path->dentry;
623 touch_atime(path->mnt, dentry);
624 nd_set_link(nd, NULL);
626 if (path->mnt != nd->path.mnt) {
627 path_to_nameidata(path, nd);
628 dget(dentry);
630 mntget(path->mnt);
631 cookie = dentry->d_inode->i_op->follow_link(dentry, nd);
632 error = PTR_ERR(cookie);
633 if (!IS_ERR(cookie)) {
634 char *s = nd_get_link(nd);
635 error = 0;
636 if (s)
637 error = __vfs_follow_link(nd, s);
638 if (dentry->d_inode->i_op->put_link)
639 dentry->d_inode->i_op->put_link(dentry, nd, cookie);
641 path_put(path);
643 return error;
647 * This limits recursive symlink follows to 8, while
648 * limiting consecutive symlinks to 40.
650 * Without that kind of total limit, nasty chains of consecutive
651 * symlinks can cause almost arbitrarily long lookups.
653 static inline int do_follow_link(struct path *path, struct nameidata *nd)
655 int err = -ELOOP;
656 if (current->link_count >= MAX_NESTED_LINKS)
657 goto loop;
658 if (current->total_link_count >= 40)
659 goto loop;
660 BUG_ON(nd->depth >= MAX_NESTED_LINKS);
661 cond_resched();
662 err = security_inode_follow_link(path->dentry, nd);
663 if (err)
664 goto loop;
665 current->link_count++;
666 current->total_link_count++;
667 nd->depth++;
668 err = __do_follow_link(path, nd);
669 current->link_count--;
670 nd->depth--;
671 return err;
672 loop:
673 path_put_conditional(path, nd);
674 path_put(&nd->path);
675 return err;
678 int follow_up(struct vfsmount **mnt, struct dentry **dentry)
680 struct vfsmount *parent;
681 struct dentry *mountpoint;
682 spin_lock(&vfsmount_lock);
683 parent=(*mnt)->mnt_parent;
684 if (parent == *mnt) {
685 spin_unlock(&vfsmount_lock);
686 return 0;
688 mntget(parent);
689 mountpoint=dget((*mnt)->mnt_mountpoint);
690 spin_unlock(&vfsmount_lock);
691 dput(*dentry);
692 *dentry = mountpoint;
693 mntput(*mnt);
694 *mnt = parent;
695 return 1;
698 /* no need for dcache_lock, as serialization is taken care in
699 * namespace.c
701 static int __follow_mount(struct path *path)
703 int res = 0;
704 while (d_mountpoint(path->dentry)) {
705 struct vfsmount *mounted = lookup_mnt(path->mnt, path->dentry);
706 if (!mounted)
707 break;
708 dput(path->dentry);
709 if (res)
710 mntput(path->mnt);
711 path->mnt = mounted;
712 path->dentry = dget(mounted->mnt_root);
713 res = 1;
715 return res;
718 static void follow_mount(struct vfsmount **mnt, struct dentry **dentry)
720 while (d_mountpoint(*dentry)) {
721 struct vfsmount *mounted = lookup_mnt(*mnt, *dentry);
722 if (!mounted)
723 break;
724 dput(*dentry);
725 mntput(*mnt);
726 *mnt = mounted;
727 *dentry = dget(mounted->mnt_root);
731 /* no need for dcache_lock, as serialization is taken care in
732 * namespace.c
734 int follow_down(struct vfsmount **mnt, struct dentry **dentry)
736 struct vfsmount *mounted;
738 mounted = lookup_mnt(*mnt, *dentry);
739 if (mounted) {
740 dput(*dentry);
741 mntput(*mnt);
742 *mnt = mounted;
743 *dentry = dget(mounted->mnt_root);
744 return 1;
746 return 0;
749 static __always_inline void follow_dotdot(struct nameidata *nd)
751 struct fs_struct *fs = current->fs;
753 while(1) {
754 struct vfsmount *parent;
755 struct dentry *old = nd->path.dentry;
757 read_lock(&fs->lock);
758 if (nd->path.dentry == fs->root.dentry &&
759 nd->path.mnt == fs->root.mnt) {
760 read_unlock(&fs->lock);
761 break;
763 read_unlock(&fs->lock);
764 spin_lock(&dcache_lock);
765 if (nd->path.dentry != nd->path.mnt->mnt_root) {
766 nd->path.dentry = dget(nd->path.dentry->d_parent);
767 spin_unlock(&dcache_lock);
768 dput(old);
769 break;
771 spin_unlock(&dcache_lock);
772 spin_lock(&vfsmount_lock);
773 parent = nd->path.mnt->mnt_parent;
774 if (parent == nd->path.mnt) {
775 spin_unlock(&vfsmount_lock);
776 break;
778 mntget(parent);
779 nd->path.dentry = dget(nd->path.mnt->mnt_mountpoint);
780 spin_unlock(&vfsmount_lock);
781 dput(old);
782 mntput(nd->path.mnt);
783 nd->path.mnt = parent;
785 follow_mount(&nd->path.mnt, &nd->path.dentry);
789 * It's more convoluted than I'd like it to be, but... it's still fairly
790 * small and for now I'd prefer to have fast path as straight as possible.
791 * It _is_ time-critical.
793 static int do_lookup(struct nameidata *nd, struct qstr *name,
794 struct path *path)
796 struct vfsmount *mnt = nd->path.mnt;
797 struct dentry *dentry = __d_lookup(nd->path.dentry, name);
799 if (!dentry)
800 goto need_lookup;
801 if (dentry->d_op && dentry->d_op->d_revalidate)
802 goto need_revalidate;
803 done:
804 path->mnt = mnt;
805 path->dentry = dentry;
806 __follow_mount(path);
807 return 0;
809 need_lookup:
810 dentry = real_lookup(nd->path.dentry, name, nd);
811 if (IS_ERR(dentry))
812 goto fail;
813 goto done;
815 need_revalidate:
816 dentry = do_revalidate(dentry, nd);
817 if (!dentry)
818 goto need_lookup;
819 if (IS_ERR(dentry))
820 goto fail;
821 goto done;
823 fail:
824 return PTR_ERR(dentry);
828 * Name resolution.
829 * This is the basic name resolution function, turning a pathname into
830 * the final dentry. We expect 'base' to be positive and a directory.
832 * Returns 0 and nd will have valid dentry and mnt on success.
833 * Returns error and drops reference to input namei data on failure.
835 static int __link_path_walk(const char *name, struct nameidata *nd)
837 struct path next;
838 struct inode *inode;
839 int err;
840 unsigned int lookup_flags = nd->flags;
842 while (*name=='/')
843 name++;
844 if (!*name)
845 goto return_reval;
847 inode = nd->path.dentry->d_inode;
848 if (nd->depth)
849 lookup_flags = LOOKUP_FOLLOW | (nd->flags & LOOKUP_CONTINUE);
851 /* At this point we know we have a real path component. */
852 for(;;) {
853 unsigned long hash;
854 struct qstr this;
855 unsigned int c;
857 nd->flags |= LOOKUP_CONTINUE;
858 err = exec_permission_lite(inode, nd);
859 if (err == -EAGAIN)
860 err = vfs_permission(nd, MAY_EXEC);
861 if (err)
862 break;
864 this.name = name;
865 c = *(const unsigned char *)name;
867 hash = init_name_hash();
868 do {
869 name++;
870 hash = partial_name_hash(c, hash);
871 c = *(const unsigned char *)name;
872 } while (c && (c != '/'));
873 this.len = name - (const char *) this.name;
874 this.hash = end_name_hash(hash);
876 /* remove trailing slashes? */
877 if (!c)
878 goto last_component;
879 while (*++name == '/');
880 if (!*name)
881 goto last_with_slashes;
884 * "." and ".." are special - ".." especially so because it has
885 * to be able to know about the current root directory and
886 * parent relationships.
888 if (this.name[0] == '.') switch (this.len) {
889 default:
890 break;
891 case 2:
892 if (this.name[1] != '.')
893 break;
894 follow_dotdot(nd);
895 inode = nd->path.dentry->d_inode;
896 /* fallthrough */
897 case 1:
898 continue;
901 * See if the low-level filesystem might want
902 * to use its own hash..
904 if (nd->path.dentry->d_op && nd->path.dentry->d_op->d_hash) {
905 err = nd->path.dentry->d_op->d_hash(nd->path.dentry,
906 &this);
907 if (err < 0)
908 break;
910 /* This does the actual lookups.. */
911 err = do_lookup(nd, &this, &next);
912 if (err)
913 break;
915 err = -ENOENT;
916 inode = next.dentry->d_inode;
917 if (!inode)
918 goto out_dput;
919 err = -ENOTDIR;
920 if (!inode->i_op)
921 goto out_dput;
923 if (inode->i_op->follow_link) {
924 err = do_follow_link(&next, nd);
925 if (err)
926 goto return_err;
927 err = -ENOENT;
928 inode = nd->path.dentry->d_inode;
929 if (!inode)
930 break;
931 err = -ENOTDIR;
932 if (!inode->i_op)
933 break;
934 } else
935 path_to_nameidata(&next, nd);
936 err = -ENOTDIR;
937 if (!inode->i_op->lookup)
938 break;
939 continue;
940 /* here ends the main loop */
942 last_with_slashes:
943 lookup_flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY;
944 last_component:
945 /* Clear LOOKUP_CONTINUE iff it was previously unset */
946 nd->flags &= lookup_flags | ~LOOKUP_CONTINUE;
947 if (lookup_flags & LOOKUP_PARENT)
948 goto lookup_parent;
949 if (this.name[0] == '.') switch (this.len) {
950 default:
951 break;
952 case 2:
953 if (this.name[1] != '.')
954 break;
955 follow_dotdot(nd);
956 inode = nd->path.dentry->d_inode;
957 /* fallthrough */
958 case 1:
959 goto return_reval;
961 if (nd->path.dentry->d_op && nd->path.dentry->d_op->d_hash) {
962 err = nd->path.dentry->d_op->d_hash(nd->path.dentry,
963 &this);
964 if (err < 0)
965 break;
967 err = do_lookup(nd, &this, &next);
968 if (err)
969 break;
970 inode = next.dentry->d_inode;
971 if ((lookup_flags & LOOKUP_FOLLOW)
972 && inode && inode->i_op && inode->i_op->follow_link) {
973 err = do_follow_link(&next, nd);
974 if (err)
975 goto return_err;
976 inode = nd->path.dentry->d_inode;
977 } else
978 path_to_nameidata(&next, nd);
979 err = -ENOENT;
980 if (!inode)
981 break;
982 if (lookup_flags & LOOKUP_DIRECTORY) {
983 err = -ENOTDIR;
984 if (!inode->i_op || !inode->i_op->lookup)
985 break;
987 goto return_base;
988 lookup_parent:
989 nd->last = this;
990 nd->last_type = LAST_NORM;
991 if (this.name[0] != '.')
992 goto return_base;
993 if (this.len == 1)
994 nd->last_type = LAST_DOT;
995 else if (this.len == 2 && this.name[1] == '.')
996 nd->last_type = LAST_DOTDOT;
997 else
998 goto return_base;
999 return_reval:
1001 * We bypassed the ordinary revalidation routines.
1002 * We may need to check the cached dentry for staleness.
1004 if (nd->path.dentry && nd->path.dentry->d_sb &&
1005 (nd->path.dentry->d_sb->s_type->fs_flags & FS_REVAL_DOT)) {
1006 err = -ESTALE;
1007 /* Note: we do not d_invalidate() */
1008 if (!nd->path.dentry->d_op->d_revalidate(
1009 nd->path.dentry, nd))
1010 break;
1012 return_base:
1013 return 0;
1014 out_dput:
1015 path_put_conditional(&next, nd);
1016 break;
1018 path_put(&nd->path);
1019 return_err:
1020 return err;
1024 * Wrapper to retry pathname resolution whenever the underlying
1025 * file system returns an ESTALE.
1027 * Retry the whole path once, forcing real lookup requests
1028 * instead of relying on the dcache.
1030 static int link_path_walk(const char *name, struct nameidata *nd)
1032 struct nameidata save = *nd;
1033 int result;
1035 /* make sure the stuff we saved doesn't go away */
1036 dget(save.path.dentry);
1037 mntget(save.path.mnt);
1039 result = __link_path_walk(name, nd);
1040 if (result == -ESTALE) {
1041 *nd = save;
1042 dget(nd->path.dentry);
1043 mntget(nd->path.mnt);
1044 nd->flags |= LOOKUP_REVAL;
1045 result = __link_path_walk(name, nd);
1048 path_put(&save.path);
1050 return result;
1053 static int path_walk(const char *name, struct nameidata *nd)
1055 current->total_link_count = 0;
1056 return link_path_walk(name, nd);
1060 * SMP-safe: Returns 1 and nd will have valid dentry and mnt, if
1061 * everything is done. Returns 0 and drops input nd, if lookup failed;
1063 static int __emul_lookup_dentry(const char *name, struct nameidata *nd)
1065 if (path_walk(name, nd))
1066 return 0; /* something went wrong... */
1068 if (!nd->path.dentry->d_inode ||
1069 S_ISDIR(nd->path.dentry->d_inode->i_mode)) {
1070 struct path old_path = nd->path;
1071 struct qstr last = nd->last;
1072 int last_type = nd->last_type;
1073 struct fs_struct *fs = current->fs;
1076 * NAME was not found in alternate root or it's a directory.
1077 * Try to find it in the normal root:
1079 nd->last_type = LAST_ROOT;
1080 read_lock(&fs->lock);
1081 nd->path = fs->root;
1082 path_get(&fs->root);
1083 read_unlock(&fs->lock);
1084 if (path_walk(name, nd) == 0) {
1085 if (nd->path.dentry->d_inode) {
1086 path_put(&old_path);
1087 return 1;
1089 path_put(&nd->path);
1091 nd->path = old_path;
1092 nd->last = last;
1093 nd->last_type = last_type;
1095 return 1;
1098 void set_fs_altroot(void)
1100 char *emul = __emul_prefix();
1101 struct nameidata nd;
1102 struct path path = {}, old_path;
1103 int err;
1104 struct fs_struct *fs = current->fs;
1106 if (!emul)
1107 goto set_it;
1108 err = path_lookup(emul, LOOKUP_FOLLOW|LOOKUP_DIRECTORY|LOOKUP_NOALT, &nd);
1109 if (!err)
1110 path = nd.path;
1111 set_it:
1112 write_lock(&fs->lock);
1113 old_path = fs->altroot;
1114 fs->altroot = path;
1115 write_unlock(&fs->lock);
1116 if (old_path.dentry)
1117 path_put(&old_path);
1120 /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
1121 static int do_path_lookup(int dfd, const char *name,
1122 unsigned int flags, struct nameidata *nd)
1124 int retval = 0;
1125 int fput_needed;
1126 struct file *file;
1127 struct fs_struct *fs = current->fs;
1129 nd->last_type = LAST_ROOT; /* if there are only slashes... */
1130 nd->flags = flags;
1131 nd->depth = 0;
1133 if (*name=='/') {
1134 read_lock(&fs->lock);
1135 if (fs->altroot.dentry && !(nd->flags & LOOKUP_NOALT)) {
1136 nd->path = fs->altroot;
1137 path_get(&fs->altroot);
1138 read_unlock(&fs->lock);
1139 if (__emul_lookup_dentry(name,nd))
1140 goto out; /* found in altroot */
1141 read_lock(&fs->lock);
1143 nd->path = fs->root;
1144 path_get(&fs->root);
1145 read_unlock(&fs->lock);
1146 } else if (dfd == AT_FDCWD) {
1147 read_lock(&fs->lock);
1148 nd->path = fs->pwd;
1149 path_get(&fs->pwd);
1150 read_unlock(&fs->lock);
1151 } else {
1152 struct dentry *dentry;
1154 file = fget_light(dfd, &fput_needed);
1155 retval = -EBADF;
1156 if (!file)
1157 goto out_fail;
1159 dentry = file->f_path.dentry;
1161 retval = -ENOTDIR;
1162 if (!S_ISDIR(dentry->d_inode->i_mode))
1163 goto fput_fail;
1165 retval = file_permission(file, MAY_EXEC);
1166 if (retval)
1167 goto fput_fail;
1169 nd->path = file->f_path;
1170 path_get(&file->f_path);
1172 fput_light(file, fput_needed);
1175 retval = path_walk(name, nd);
1176 out:
1177 if (unlikely(!retval && !audit_dummy_context() && nd->path.dentry &&
1178 nd->path.dentry->d_inode))
1179 audit_inode(name, nd->path.dentry);
1180 out_fail:
1181 return retval;
1183 fput_fail:
1184 fput_light(file, fput_needed);
1185 goto out_fail;
1188 int path_lookup(const char *name, unsigned int flags,
1189 struct nameidata *nd)
1191 return do_path_lookup(AT_FDCWD, name, flags, nd);
1195 * vfs_path_lookup - lookup a file path relative to a dentry-vfsmount pair
1196 * @dentry: pointer to dentry of the base directory
1197 * @mnt: pointer to vfs mount of the base directory
1198 * @name: pointer to file name
1199 * @flags: lookup flags
1200 * @nd: pointer to nameidata
1202 int vfs_path_lookup(struct dentry *dentry, struct vfsmount *mnt,
1203 const char *name, unsigned int flags,
1204 struct nameidata *nd)
1206 int retval;
1208 /* same as do_path_lookup */
1209 nd->last_type = LAST_ROOT;
1210 nd->flags = flags;
1211 nd->depth = 0;
1213 nd->path.mnt = mntget(mnt);
1214 nd->path.dentry = dget(dentry);
1216 retval = path_walk(name, nd);
1217 if (unlikely(!retval && !audit_dummy_context() && nd->path.dentry &&
1218 nd->path.dentry->d_inode))
1219 audit_inode(name, nd->path.dentry);
1221 return retval;
1225 static int __path_lookup_intent_open(int dfd, const char *name,
1226 unsigned int lookup_flags, struct nameidata *nd,
1227 int open_flags, int create_mode)
1229 struct file *filp = get_empty_filp();
1230 int err;
1232 if (filp == NULL)
1233 return -ENFILE;
1234 nd->intent.open.file = filp;
1235 nd->intent.open.flags = open_flags;
1236 nd->intent.open.create_mode = create_mode;
1237 err = do_path_lookup(dfd, name, lookup_flags|LOOKUP_OPEN, nd);
1238 if (IS_ERR(nd->intent.open.file)) {
1239 if (err == 0) {
1240 err = PTR_ERR(nd->intent.open.file);
1241 path_put(&nd->path);
1243 } else if (err != 0)
1244 release_open_intent(nd);
1245 return err;
1249 * path_lookup_open - lookup a file path with open intent
1250 * @dfd: the directory to use as base, or AT_FDCWD
1251 * @name: pointer to file name
1252 * @lookup_flags: lookup intent flags
1253 * @nd: pointer to nameidata
1254 * @open_flags: open intent flags
1256 int path_lookup_open(int dfd, const char *name, unsigned int lookup_flags,
1257 struct nameidata *nd, int open_flags)
1259 return __path_lookup_intent_open(dfd, name, lookup_flags, nd,
1260 open_flags, 0);
1264 * path_lookup_create - lookup a file path with open + create intent
1265 * @dfd: the directory to use as base, or AT_FDCWD
1266 * @name: pointer to file name
1267 * @lookup_flags: lookup intent flags
1268 * @nd: pointer to nameidata
1269 * @open_flags: open intent flags
1270 * @create_mode: create intent flags
1272 static int path_lookup_create(int dfd, const char *name,
1273 unsigned int lookup_flags, struct nameidata *nd,
1274 int open_flags, int create_mode)
1276 return __path_lookup_intent_open(dfd, name, lookup_flags|LOOKUP_CREATE,
1277 nd, open_flags, create_mode);
1280 int __user_path_lookup_open(const char __user *name, unsigned int lookup_flags,
1281 struct nameidata *nd, int open_flags)
1283 char *tmp = getname(name);
1284 int err = PTR_ERR(tmp);
1286 if (!IS_ERR(tmp)) {
1287 err = __path_lookup_intent_open(AT_FDCWD, tmp, lookup_flags, nd, open_flags, 0);
1288 putname(tmp);
1290 return err;
1293 static struct dentry *__lookup_hash(struct qstr *name,
1294 struct dentry *base, struct nameidata *nd)
1296 struct dentry *dentry;
1297 struct inode *inode;
1298 int err;
1300 inode = base->d_inode;
1303 * See if the low-level filesystem might want
1304 * to use its own hash..
1306 if (base->d_op && base->d_op->d_hash) {
1307 err = base->d_op->d_hash(base, name);
1308 dentry = ERR_PTR(err);
1309 if (err < 0)
1310 goto out;
1313 dentry = cached_lookup(base, name, nd);
1314 if (!dentry) {
1315 struct dentry *new = d_alloc(base, name);
1316 dentry = ERR_PTR(-ENOMEM);
1317 if (!new)
1318 goto out;
1319 dentry = inode->i_op->lookup(inode, new, nd);
1320 if (!dentry)
1321 dentry = new;
1322 else
1323 dput(new);
1325 out:
1326 return dentry;
1330 * Restricted form of lookup. Doesn't follow links, single-component only,
1331 * needs parent already locked. Doesn't follow mounts.
1332 * SMP-safe.
1334 static struct dentry *lookup_hash(struct nameidata *nd)
1336 int err;
1338 err = permission(nd->path.dentry->d_inode, MAY_EXEC, nd);
1339 if (err)
1340 return ERR_PTR(err);
1341 return __lookup_hash(&nd->last, nd->path.dentry, nd);
1344 static int __lookup_one_len(const char *name, struct qstr *this,
1345 struct dentry *base, int len)
1347 unsigned long hash;
1348 unsigned int c;
1350 this->name = name;
1351 this->len = len;
1352 if (!len)
1353 return -EACCES;
1355 hash = init_name_hash();
1356 while (len--) {
1357 c = *(const unsigned char *)name++;
1358 if (c == '/' || c == '\0')
1359 return -EACCES;
1360 hash = partial_name_hash(c, hash);
1362 this->hash = end_name_hash(hash);
1363 return 0;
1367 * lookup_one_len: filesystem helper to lookup single pathname component
1368 * @name: pathname component to lookup
1369 * @base: base directory to lookup from
1370 * @len: maximum length @len should be interpreted to
1372 * Note that this routine is purely a helper for filesystem useage and should
1373 * not be called by generic code. Also note that by using this function to
1374 * nameidata argument is passed to the filesystem methods and a filesystem
1375 * using this helper needs to be prepared for that.
1377 struct dentry *lookup_one_len(const char *name, struct dentry *base, int len)
1379 int err;
1380 struct qstr this;
1382 err = __lookup_one_len(name, &this, base, len);
1383 if (err)
1384 return ERR_PTR(err);
1386 err = permission(base->d_inode, MAY_EXEC, NULL);
1387 if (err)
1388 return ERR_PTR(err);
1389 return __lookup_hash(&this, base, NULL);
1393 * lookup_one_noperm - bad hack for sysfs
1394 * @name: pathname component to lookup
1395 * @base: base directory to lookup from
1397 * This is a variant of lookup_one_len that doesn't perform any permission
1398 * checks. It's a horrible hack to work around the braindead sysfs
1399 * architecture and should not be used anywhere else.
1401 * DON'T USE THIS FUNCTION EVER, thanks.
1403 struct dentry *lookup_one_noperm(const char *name, struct dentry *base)
1405 int err;
1406 struct qstr this;
1408 err = __lookup_one_len(name, &this, base, strlen(name));
1409 if (err)
1410 return ERR_PTR(err);
1411 return __lookup_hash(&this, base, NULL);
1414 int __user_walk_fd(int dfd, const char __user *name, unsigned flags,
1415 struct nameidata *nd)
1417 char *tmp = getname(name);
1418 int err = PTR_ERR(tmp);
1420 if (!IS_ERR(tmp)) {
1421 err = do_path_lookup(dfd, tmp, flags, nd);
1422 putname(tmp);
1424 return err;
1427 int __user_walk(const char __user *name, unsigned flags, struct nameidata *nd)
1429 return __user_walk_fd(AT_FDCWD, name, flags, nd);
1433 * It's inline, so penalty for filesystems that don't use sticky bit is
1434 * minimal.
1436 static inline int check_sticky(struct inode *dir, struct inode *inode)
1438 if (!(dir->i_mode & S_ISVTX))
1439 return 0;
1440 if (inode->i_uid == current->fsuid)
1441 return 0;
1442 if (dir->i_uid == current->fsuid)
1443 return 0;
1444 return !capable(CAP_FOWNER);
1448 * Check whether we can remove a link victim from directory dir, check
1449 * whether the type of victim is right.
1450 * 1. We can't do it if dir is read-only (done in permission())
1451 * 2. We should have write and exec permissions on dir
1452 * 3. We can't remove anything from append-only dir
1453 * 4. We can't do anything with immutable dir (done in permission())
1454 * 5. If the sticky bit on dir is set we should either
1455 * a. be owner of dir, or
1456 * b. be owner of victim, or
1457 * c. have CAP_FOWNER capability
1458 * 6. If the victim is append-only or immutable we can't do antyhing with
1459 * links pointing to it.
1460 * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR.
1461 * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR.
1462 * 9. We can't remove a root or mountpoint.
1463 * 10. We don't allow removal of NFS sillyrenamed files; it's handled by
1464 * nfs_async_unlink().
1466 static int may_delete(struct inode *dir,struct dentry *victim,int isdir)
1468 int error;
1470 if (!victim->d_inode)
1471 return -ENOENT;
1473 BUG_ON(victim->d_parent->d_inode != dir);
1474 audit_inode_child(victim->d_name.name, victim, dir);
1476 error = permission(dir,MAY_WRITE | MAY_EXEC, NULL);
1477 if (error)
1478 return error;
1479 if (IS_APPEND(dir))
1480 return -EPERM;
1481 if (check_sticky(dir, victim->d_inode)||IS_APPEND(victim->d_inode)||
1482 IS_IMMUTABLE(victim->d_inode))
1483 return -EPERM;
1484 if (isdir) {
1485 if (!S_ISDIR(victim->d_inode->i_mode))
1486 return -ENOTDIR;
1487 if (IS_ROOT(victim))
1488 return -EBUSY;
1489 } else if (S_ISDIR(victim->d_inode->i_mode))
1490 return -EISDIR;
1491 if (IS_DEADDIR(dir))
1492 return -ENOENT;
1493 if (victim->d_flags & DCACHE_NFSFS_RENAMED)
1494 return -EBUSY;
1495 return 0;
1498 /* Check whether we can create an object with dentry child in directory
1499 * dir.
1500 * 1. We can't do it if child already exists (open has special treatment for
1501 * this case, but since we are inlined it's OK)
1502 * 2. We can't do it if dir is read-only (done in permission())
1503 * 3. We should have write and exec permissions on dir
1504 * 4. We can't do it if dir is immutable (done in permission())
1506 static inline int may_create(struct inode *dir, struct dentry *child,
1507 struct nameidata *nd)
1509 if (child->d_inode)
1510 return -EEXIST;
1511 if (IS_DEADDIR(dir))
1512 return -ENOENT;
1513 return permission(dir,MAY_WRITE | MAY_EXEC, nd);
1517 * O_DIRECTORY translates into forcing a directory lookup.
1519 static inline int lookup_flags(unsigned int f)
1521 unsigned long retval = LOOKUP_FOLLOW;
1523 if (f & O_NOFOLLOW)
1524 retval &= ~LOOKUP_FOLLOW;
1526 if (f & O_DIRECTORY)
1527 retval |= LOOKUP_DIRECTORY;
1529 return retval;
1533 * p1 and p2 should be directories on the same fs.
1535 struct dentry *lock_rename(struct dentry *p1, struct dentry *p2)
1537 struct dentry *p;
1539 if (p1 == p2) {
1540 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1541 return NULL;
1544 mutex_lock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1546 for (p = p1; p->d_parent != p; p = p->d_parent) {
1547 if (p->d_parent == p2) {
1548 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_PARENT);
1549 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_CHILD);
1550 return p;
1554 for (p = p2; p->d_parent != p; p = p->d_parent) {
1555 if (p->d_parent == p1) {
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 p;
1562 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1563 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1564 return NULL;
1567 void unlock_rename(struct dentry *p1, struct dentry *p2)
1569 mutex_unlock(&p1->d_inode->i_mutex);
1570 if (p1 != p2) {
1571 mutex_unlock(&p2->d_inode->i_mutex);
1572 mutex_unlock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1576 int vfs_create(struct inode *dir, struct dentry *dentry, int mode,
1577 struct nameidata *nd)
1579 int error = may_create(dir, dentry, nd);
1581 if (error)
1582 return error;
1584 if (!dir->i_op || !dir->i_op->create)
1585 return -EACCES; /* shouldn't it be ENOSYS? */
1586 mode &= S_IALLUGO;
1587 mode |= S_IFREG;
1588 error = security_inode_create(dir, dentry, mode);
1589 if (error)
1590 return error;
1591 DQUOT_INIT(dir);
1592 error = dir->i_op->create(dir, dentry, mode, nd);
1593 if (!error)
1594 fsnotify_create(dir, dentry);
1595 return error;
1598 int may_open(struct nameidata *nd, int acc_mode, int flag)
1600 struct dentry *dentry = nd->path.dentry;
1601 struct inode *inode = dentry->d_inode;
1602 int error;
1604 if (!inode)
1605 return -ENOENT;
1607 if (S_ISLNK(inode->i_mode))
1608 return -ELOOP;
1610 if (S_ISDIR(inode->i_mode) && (acc_mode & MAY_WRITE))
1611 return -EISDIR;
1614 * FIFO's, sockets and device files are special: they don't
1615 * actually live on the filesystem itself, and as such you
1616 * can write to them even if the filesystem is read-only.
1618 if (S_ISFIFO(inode->i_mode) || S_ISSOCK(inode->i_mode)) {
1619 flag &= ~O_TRUNC;
1620 } else if (S_ISBLK(inode->i_mode) || S_ISCHR(inode->i_mode)) {
1621 if (nd->path.mnt->mnt_flags & MNT_NODEV)
1622 return -EACCES;
1624 flag &= ~O_TRUNC;
1625 } else if (IS_RDONLY(inode) && (acc_mode & MAY_WRITE))
1626 return -EROFS;
1628 error = vfs_permission(nd, acc_mode);
1629 if (error)
1630 return error;
1632 * An append-only file must be opened in append mode for writing.
1634 if (IS_APPEND(inode)) {
1635 if ((flag & FMODE_WRITE) && !(flag & O_APPEND))
1636 return -EPERM;
1637 if (flag & O_TRUNC)
1638 return -EPERM;
1641 /* O_NOATIME can only be set by the owner or superuser */
1642 if (flag & O_NOATIME)
1643 if (!is_owner_or_cap(inode))
1644 return -EPERM;
1647 * Ensure there are no outstanding leases on the file.
1649 error = break_lease(inode, flag);
1650 if (error)
1651 return error;
1653 if (flag & O_TRUNC) {
1654 error = get_write_access(inode);
1655 if (error)
1656 return error;
1659 * Refuse to truncate files with mandatory locks held on them.
1661 error = locks_verify_locked(inode);
1662 if (!error) {
1663 DQUOT_INIT(inode);
1665 error = do_truncate(dentry, 0,
1666 ATTR_MTIME|ATTR_CTIME|ATTR_OPEN,
1667 NULL);
1669 put_write_access(inode);
1670 if (error)
1671 return error;
1672 } else
1673 if (flag & FMODE_WRITE)
1674 DQUOT_INIT(inode);
1676 return 0;
1679 static int open_namei_create(struct nameidata *nd, struct path *path,
1680 int flag, int mode)
1682 int error;
1683 struct dentry *dir = nd->path.dentry;
1685 if (!IS_POSIXACL(dir->d_inode))
1686 mode &= ~current->fs->umask;
1687 error = vfs_create(dir->d_inode, path->dentry, mode, nd);
1688 mutex_unlock(&dir->d_inode->i_mutex);
1689 dput(nd->path.dentry);
1690 nd->path.dentry = path->dentry;
1691 if (error)
1692 return error;
1693 /* Don't check for write permission, don't truncate */
1694 return may_open(nd, 0, flag & ~O_TRUNC);
1698 * open_namei()
1700 * namei for open - this is in fact almost the whole open-routine.
1702 * Note that the low bits of "flag" aren't the same as in the open
1703 * system call - they are 00 - no permissions needed
1704 * 01 - read permission needed
1705 * 10 - write permission needed
1706 * 11 - read/write permissions needed
1707 * which is a lot more logical, and also allows the "no perm" needed
1708 * for symlinks (where the permissions are checked later).
1709 * SMP-safe
1711 int open_namei(int dfd, const char *pathname, int flag,
1712 int mode, struct nameidata *nd)
1714 int acc_mode, error;
1715 struct path path;
1716 struct dentry *dir;
1717 int count = 0;
1719 acc_mode = ACC_MODE(flag);
1721 /* O_TRUNC implies we need access checks for write permissions */
1722 if (flag & O_TRUNC)
1723 acc_mode |= MAY_WRITE;
1725 /* Allow the LSM permission hook to distinguish append
1726 access from general write access. */
1727 if (flag & O_APPEND)
1728 acc_mode |= MAY_APPEND;
1731 * The simplest case - just a plain lookup.
1733 if (!(flag & O_CREAT)) {
1734 error = path_lookup_open(dfd, pathname, lookup_flags(flag),
1735 nd, flag);
1736 if (error)
1737 return error;
1738 goto ok;
1742 * Create - we need to know the parent.
1744 error = path_lookup_create(dfd,pathname,LOOKUP_PARENT,nd,flag,mode);
1745 if (error)
1746 return error;
1749 * We have the parent and last component. First of all, check
1750 * that we are not asked to creat(2) an obvious directory - that
1751 * will not do.
1753 error = -EISDIR;
1754 if (nd->last_type != LAST_NORM || nd->last.name[nd->last.len])
1755 goto exit;
1757 dir = nd->path.dentry;
1758 nd->flags &= ~LOOKUP_PARENT;
1759 mutex_lock(&dir->d_inode->i_mutex);
1760 path.dentry = lookup_hash(nd);
1761 path.mnt = nd->path.mnt;
1763 do_last:
1764 error = PTR_ERR(path.dentry);
1765 if (IS_ERR(path.dentry)) {
1766 mutex_unlock(&dir->d_inode->i_mutex);
1767 goto exit;
1770 if (IS_ERR(nd->intent.open.file)) {
1771 mutex_unlock(&dir->d_inode->i_mutex);
1772 error = PTR_ERR(nd->intent.open.file);
1773 goto exit_dput;
1776 /* Negative dentry, just create the file */
1777 if (!path.dentry->d_inode) {
1778 error = open_namei_create(nd, &path, flag, mode);
1779 if (error)
1780 goto exit;
1781 return 0;
1785 * It already exists.
1787 mutex_unlock(&dir->d_inode->i_mutex);
1788 audit_inode(pathname, path.dentry);
1790 error = -EEXIST;
1791 if (flag & O_EXCL)
1792 goto exit_dput;
1794 if (__follow_mount(&path)) {
1795 error = -ELOOP;
1796 if (flag & O_NOFOLLOW)
1797 goto exit_dput;
1800 error = -ENOENT;
1801 if (!path.dentry->d_inode)
1802 goto exit_dput;
1803 if (path.dentry->d_inode->i_op && path.dentry->d_inode->i_op->follow_link)
1804 goto do_link;
1806 path_to_nameidata(&path, nd);
1807 error = -EISDIR;
1808 if (path.dentry->d_inode && S_ISDIR(path.dentry->d_inode->i_mode))
1809 goto exit;
1811 error = may_open(nd, acc_mode, flag);
1812 if (error)
1813 goto exit;
1814 return 0;
1816 exit_dput:
1817 path_put_conditional(&path, nd);
1818 exit:
1819 if (!IS_ERR(nd->intent.open.file))
1820 release_open_intent(nd);
1821 path_put(&nd->path);
1822 return error;
1824 do_link:
1825 error = -ELOOP;
1826 if (flag & O_NOFOLLOW)
1827 goto exit_dput;
1829 * This is subtle. Instead of calling do_follow_link() we do the
1830 * thing by hands. The reason is that this way we have zero link_count
1831 * and path_walk() (called from ->follow_link) honoring LOOKUP_PARENT.
1832 * After that we have the parent and last component, i.e.
1833 * we are in the same situation as after the first path_walk().
1834 * Well, almost - if the last component is normal we get its copy
1835 * stored in nd->last.name and we will have to putname() it when we
1836 * are done. Procfs-like symlinks just set LAST_BIND.
1838 nd->flags |= LOOKUP_PARENT;
1839 error = security_inode_follow_link(path.dentry, nd);
1840 if (error)
1841 goto exit_dput;
1842 error = __do_follow_link(&path, nd);
1843 if (error) {
1844 /* Does someone understand code flow here? Or it is only
1845 * me so stupid? Anathema to whoever designed this non-sense
1846 * with "intent.open".
1848 release_open_intent(nd);
1849 return error;
1851 nd->flags &= ~LOOKUP_PARENT;
1852 if (nd->last_type == LAST_BIND)
1853 goto ok;
1854 error = -EISDIR;
1855 if (nd->last_type != LAST_NORM)
1856 goto exit;
1857 if (nd->last.name[nd->last.len]) {
1858 __putname(nd->last.name);
1859 goto exit;
1861 error = -ELOOP;
1862 if (count++==32) {
1863 __putname(nd->last.name);
1864 goto exit;
1866 dir = nd->path.dentry;
1867 mutex_lock(&dir->d_inode->i_mutex);
1868 path.dentry = lookup_hash(nd);
1869 path.mnt = nd->path.mnt;
1870 __putname(nd->last.name);
1871 goto do_last;
1875 * lookup_create - lookup a dentry, creating it if it doesn't exist
1876 * @nd: nameidata info
1877 * @is_dir: directory flag
1879 * Simple function to lookup and return a dentry and create it
1880 * if it doesn't exist. Is SMP-safe.
1882 * Returns with nd->path.dentry->d_inode->i_mutex locked.
1884 struct dentry *lookup_create(struct nameidata *nd, int is_dir)
1886 struct dentry *dentry = ERR_PTR(-EEXIST);
1888 mutex_lock_nested(&nd->path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
1890 * Yucky last component or no last component at all?
1891 * (foo/., foo/.., /////)
1893 if (nd->last_type != LAST_NORM)
1894 goto fail;
1895 nd->flags &= ~LOOKUP_PARENT;
1896 nd->flags |= LOOKUP_CREATE;
1897 nd->intent.open.flags = O_EXCL;
1900 * Do the final lookup.
1902 dentry = lookup_hash(nd);
1903 if (IS_ERR(dentry))
1904 goto fail;
1907 * Special case - lookup gave negative, but... we had foo/bar/
1908 * From the vfs_mknod() POV we just have a negative dentry -
1909 * all is fine. Let's be bastards - you had / on the end, you've
1910 * been asking for (non-existent) directory. -ENOENT for you.
1912 if (!is_dir && nd->last.name[nd->last.len] && !dentry->d_inode)
1913 goto enoent;
1914 return dentry;
1915 enoent:
1916 dput(dentry);
1917 dentry = ERR_PTR(-ENOENT);
1918 fail:
1919 return dentry;
1921 EXPORT_SYMBOL_GPL(lookup_create);
1923 int vfs_mknod(struct inode *dir, struct dentry *dentry, int mode, dev_t dev)
1925 int error = may_create(dir, dentry, NULL);
1927 if (error)
1928 return error;
1930 if ((S_ISCHR(mode) || S_ISBLK(mode)) && !capable(CAP_MKNOD))
1931 return -EPERM;
1933 if (!dir->i_op || !dir->i_op->mknod)
1934 return -EPERM;
1936 error = security_inode_mknod(dir, dentry, mode, dev);
1937 if (error)
1938 return error;
1940 DQUOT_INIT(dir);
1941 error = dir->i_op->mknod(dir, dentry, mode, dev);
1942 if (!error)
1943 fsnotify_create(dir, dentry);
1944 return error;
1947 asmlinkage long sys_mknodat(int dfd, const char __user *filename, int mode,
1948 unsigned dev)
1950 int error = 0;
1951 char * tmp;
1952 struct dentry * dentry;
1953 struct nameidata nd;
1955 if (S_ISDIR(mode))
1956 return -EPERM;
1957 tmp = getname(filename);
1958 if (IS_ERR(tmp))
1959 return PTR_ERR(tmp);
1961 error = do_path_lookup(dfd, tmp, LOOKUP_PARENT, &nd);
1962 if (error)
1963 goto out;
1964 dentry = lookup_create(&nd, 0);
1965 error = PTR_ERR(dentry);
1967 if (!IS_POSIXACL(nd.path.dentry->d_inode))
1968 mode &= ~current->fs->umask;
1969 if (!IS_ERR(dentry)) {
1970 switch (mode & S_IFMT) {
1971 case 0: case S_IFREG:
1972 error = vfs_create(nd.path.dentry->d_inode,dentry,mode,&nd);
1973 break;
1974 case S_IFCHR: case S_IFBLK:
1975 error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode,
1976 new_decode_dev(dev));
1977 break;
1978 case S_IFIFO: case S_IFSOCK:
1979 error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode,0);
1980 break;
1981 case S_IFDIR:
1982 error = -EPERM;
1983 break;
1984 default:
1985 error = -EINVAL;
1987 dput(dentry);
1989 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
1990 path_put(&nd.path);
1991 out:
1992 putname(tmp);
1994 return error;
1997 asmlinkage long sys_mknod(const char __user *filename, int mode, unsigned dev)
1999 return sys_mknodat(AT_FDCWD, filename, mode, dev);
2002 int vfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
2004 int error = may_create(dir, dentry, NULL);
2006 if (error)
2007 return error;
2009 if (!dir->i_op || !dir->i_op->mkdir)
2010 return -EPERM;
2012 mode &= (S_IRWXUGO|S_ISVTX);
2013 error = security_inode_mkdir(dir, dentry, mode);
2014 if (error)
2015 return error;
2017 DQUOT_INIT(dir);
2018 error = dir->i_op->mkdir(dir, dentry, mode);
2019 if (!error)
2020 fsnotify_mkdir(dir, dentry);
2021 return error;
2024 asmlinkage long sys_mkdirat(int dfd, const char __user *pathname, int mode)
2026 int error = 0;
2027 char * tmp;
2028 struct dentry *dentry;
2029 struct nameidata nd;
2031 tmp = getname(pathname);
2032 error = PTR_ERR(tmp);
2033 if (IS_ERR(tmp))
2034 goto out_err;
2036 error = do_path_lookup(dfd, tmp, LOOKUP_PARENT, &nd);
2037 if (error)
2038 goto out;
2039 dentry = lookup_create(&nd, 1);
2040 error = PTR_ERR(dentry);
2041 if (IS_ERR(dentry))
2042 goto out_unlock;
2044 if (!IS_POSIXACL(nd.path.dentry->d_inode))
2045 mode &= ~current->fs->umask;
2046 error = vfs_mkdir(nd.path.dentry->d_inode, dentry, mode);
2047 dput(dentry);
2048 out_unlock:
2049 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2050 path_put(&nd.path);
2051 out:
2052 putname(tmp);
2053 out_err:
2054 return error;
2057 asmlinkage long sys_mkdir(const char __user *pathname, int mode)
2059 return sys_mkdirat(AT_FDCWD, pathname, mode);
2063 * We try to drop the dentry early: we should have
2064 * a usage count of 2 if we're the only user of this
2065 * dentry, and if that is true (possibly after pruning
2066 * the dcache), then we drop the dentry now.
2068 * A low-level filesystem can, if it choses, legally
2069 * do a
2071 * if (!d_unhashed(dentry))
2072 * return -EBUSY;
2074 * if it cannot handle the case of removing a directory
2075 * that is still in use by something else..
2077 void dentry_unhash(struct dentry *dentry)
2079 dget(dentry);
2080 shrink_dcache_parent(dentry);
2081 spin_lock(&dcache_lock);
2082 spin_lock(&dentry->d_lock);
2083 if (atomic_read(&dentry->d_count) == 2)
2084 __d_drop(dentry);
2085 spin_unlock(&dentry->d_lock);
2086 spin_unlock(&dcache_lock);
2089 int vfs_rmdir(struct inode *dir, struct dentry *dentry)
2091 int error = may_delete(dir, dentry, 1);
2093 if (error)
2094 return error;
2096 if (!dir->i_op || !dir->i_op->rmdir)
2097 return -EPERM;
2099 DQUOT_INIT(dir);
2101 mutex_lock(&dentry->d_inode->i_mutex);
2102 dentry_unhash(dentry);
2103 if (d_mountpoint(dentry))
2104 error = -EBUSY;
2105 else {
2106 error = security_inode_rmdir(dir, dentry);
2107 if (!error) {
2108 error = dir->i_op->rmdir(dir, dentry);
2109 if (!error)
2110 dentry->d_inode->i_flags |= S_DEAD;
2113 mutex_unlock(&dentry->d_inode->i_mutex);
2114 if (!error) {
2115 d_delete(dentry);
2117 dput(dentry);
2119 return error;
2122 static long do_rmdir(int dfd, const char __user *pathname)
2124 int error = 0;
2125 char * name;
2126 struct dentry *dentry;
2127 struct nameidata nd;
2129 name = getname(pathname);
2130 if(IS_ERR(name))
2131 return PTR_ERR(name);
2133 error = do_path_lookup(dfd, name, LOOKUP_PARENT, &nd);
2134 if (error)
2135 goto exit;
2137 switch(nd.last_type) {
2138 case LAST_DOTDOT:
2139 error = -ENOTEMPTY;
2140 goto exit1;
2141 case LAST_DOT:
2142 error = -EINVAL;
2143 goto exit1;
2144 case LAST_ROOT:
2145 error = -EBUSY;
2146 goto exit1;
2148 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2149 dentry = lookup_hash(&nd);
2150 error = PTR_ERR(dentry);
2151 if (IS_ERR(dentry))
2152 goto exit2;
2153 error = vfs_rmdir(nd.path.dentry->d_inode, dentry);
2154 dput(dentry);
2155 exit2:
2156 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2157 exit1:
2158 path_put(&nd.path);
2159 exit:
2160 putname(name);
2161 return error;
2164 asmlinkage long sys_rmdir(const char __user *pathname)
2166 return do_rmdir(AT_FDCWD, pathname);
2169 int vfs_unlink(struct inode *dir, struct dentry *dentry)
2171 int error = may_delete(dir, dentry, 0);
2173 if (error)
2174 return error;
2176 if (!dir->i_op || !dir->i_op->unlink)
2177 return -EPERM;
2179 DQUOT_INIT(dir);
2181 mutex_lock(&dentry->d_inode->i_mutex);
2182 if (d_mountpoint(dentry))
2183 error = -EBUSY;
2184 else {
2185 error = security_inode_unlink(dir, dentry);
2186 if (!error)
2187 error = dir->i_op->unlink(dir, dentry);
2189 mutex_unlock(&dentry->d_inode->i_mutex);
2191 /* We don't d_delete() NFS sillyrenamed files--they still exist. */
2192 if (!error && !(dentry->d_flags & DCACHE_NFSFS_RENAMED)) {
2193 fsnotify_link_count(dentry->d_inode);
2194 d_delete(dentry);
2197 return error;
2201 * Make sure that the actual truncation of the file will occur outside its
2202 * directory's i_mutex. Truncate can take a long time if there is a lot of
2203 * writeout happening, and we don't want to prevent access to the directory
2204 * while waiting on the I/O.
2206 static long do_unlinkat(int dfd, const char __user *pathname)
2208 int error = 0;
2209 char * name;
2210 struct dentry *dentry;
2211 struct nameidata nd;
2212 struct inode *inode = NULL;
2214 name = getname(pathname);
2215 if(IS_ERR(name))
2216 return PTR_ERR(name);
2218 error = do_path_lookup(dfd, name, LOOKUP_PARENT, &nd);
2219 if (error)
2220 goto exit;
2221 error = -EISDIR;
2222 if (nd.last_type != LAST_NORM)
2223 goto exit1;
2224 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2225 dentry = lookup_hash(&nd);
2226 error = PTR_ERR(dentry);
2227 if (!IS_ERR(dentry)) {
2228 /* Why not before? Because we want correct error value */
2229 if (nd.last.name[nd.last.len])
2230 goto slashes;
2231 inode = dentry->d_inode;
2232 if (inode)
2233 atomic_inc(&inode->i_count);
2234 error = vfs_unlink(nd.path.dentry->d_inode, dentry);
2235 exit2:
2236 dput(dentry);
2238 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2239 if (inode)
2240 iput(inode); /* truncate the inode here */
2241 exit1:
2242 path_put(&nd.path);
2243 exit:
2244 putname(name);
2245 return error;
2247 slashes:
2248 error = !dentry->d_inode ? -ENOENT :
2249 S_ISDIR(dentry->d_inode->i_mode) ? -EISDIR : -ENOTDIR;
2250 goto exit2;
2253 asmlinkage long sys_unlinkat(int dfd, const char __user *pathname, int flag)
2255 if ((flag & ~AT_REMOVEDIR) != 0)
2256 return -EINVAL;
2258 if (flag & AT_REMOVEDIR)
2259 return do_rmdir(dfd, pathname);
2261 return do_unlinkat(dfd, pathname);
2264 asmlinkage long sys_unlink(const char __user *pathname)
2266 return do_unlinkat(AT_FDCWD, pathname);
2269 int vfs_symlink(struct inode *dir, struct dentry *dentry, const char *oldname, int mode)
2271 int error = may_create(dir, dentry, NULL);
2273 if (error)
2274 return error;
2276 if (!dir->i_op || !dir->i_op->symlink)
2277 return -EPERM;
2279 error = security_inode_symlink(dir, dentry, oldname);
2280 if (error)
2281 return error;
2283 DQUOT_INIT(dir);
2284 error = dir->i_op->symlink(dir, dentry, oldname);
2285 if (!error)
2286 fsnotify_create(dir, dentry);
2287 return error;
2290 asmlinkage long sys_symlinkat(const char __user *oldname,
2291 int newdfd, const char __user *newname)
2293 int error = 0;
2294 char * from;
2295 char * to;
2296 struct dentry *dentry;
2297 struct nameidata nd;
2299 from = getname(oldname);
2300 if(IS_ERR(from))
2301 return PTR_ERR(from);
2302 to = getname(newname);
2303 error = PTR_ERR(to);
2304 if (IS_ERR(to))
2305 goto out_putname;
2307 error = do_path_lookup(newdfd, to, LOOKUP_PARENT, &nd);
2308 if (error)
2309 goto out;
2310 dentry = lookup_create(&nd, 0);
2311 error = PTR_ERR(dentry);
2312 if (IS_ERR(dentry))
2313 goto out_unlock;
2315 error = vfs_symlink(nd.path.dentry->d_inode, dentry, from, S_IALLUGO);
2316 dput(dentry);
2317 out_unlock:
2318 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2319 path_put(&nd.path);
2320 out:
2321 putname(to);
2322 out_putname:
2323 putname(from);
2324 return error;
2327 asmlinkage long sys_symlink(const char __user *oldname, const char __user *newname)
2329 return sys_symlinkat(oldname, AT_FDCWD, newname);
2332 int vfs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *new_dentry)
2334 struct inode *inode = old_dentry->d_inode;
2335 int error;
2337 if (!inode)
2338 return -ENOENT;
2340 error = may_create(dir, new_dentry, NULL);
2341 if (error)
2342 return error;
2344 if (dir->i_sb != inode->i_sb)
2345 return -EXDEV;
2348 * A link to an append-only or immutable file cannot be created.
2350 if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
2351 return -EPERM;
2352 if (!dir->i_op || !dir->i_op->link)
2353 return -EPERM;
2354 if (S_ISDIR(old_dentry->d_inode->i_mode))
2355 return -EPERM;
2357 error = security_inode_link(old_dentry, dir, new_dentry);
2358 if (error)
2359 return error;
2361 mutex_lock(&old_dentry->d_inode->i_mutex);
2362 DQUOT_INIT(dir);
2363 error = dir->i_op->link(old_dentry, dir, new_dentry);
2364 mutex_unlock(&old_dentry->d_inode->i_mutex);
2365 if (!error)
2366 fsnotify_link(dir, old_dentry->d_inode, new_dentry);
2367 return error;
2371 * Hardlinks are often used in delicate situations. We avoid
2372 * security-related surprises by not following symlinks on the
2373 * newname. --KAB
2375 * We don't follow them on the oldname either to be compatible
2376 * with linux 2.0, and to avoid hard-linking to directories
2377 * and other special files. --ADM
2379 asmlinkage long sys_linkat(int olddfd, const char __user *oldname,
2380 int newdfd, const char __user *newname,
2381 int flags)
2383 struct dentry *new_dentry;
2384 struct nameidata nd, old_nd;
2385 int error;
2386 char * to;
2388 if ((flags & ~AT_SYMLINK_FOLLOW) != 0)
2389 return -EINVAL;
2391 to = getname(newname);
2392 if (IS_ERR(to))
2393 return PTR_ERR(to);
2395 error = __user_walk_fd(olddfd, oldname,
2396 flags & AT_SYMLINK_FOLLOW ? LOOKUP_FOLLOW : 0,
2397 &old_nd);
2398 if (error)
2399 goto exit;
2400 error = do_path_lookup(newdfd, to, LOOKUP_PARENT, &nd);
2401 if (error)
2402 goto out;
2403 error = -EXDEV;
2404 if (old_nd.path.mnt != nd.path.mnt)
2405 goto out_release;
2406 new_dentry = lookup_create(&nd, 0);
2407 error = PTR_ERR(new_dentry);
2408 if (IS_ERR(new_dentry))
2409 goto out_unlock;
2410 error = vfs_link(old_nd.path.dentry, nd.path.dentry->d_inode, new_dentry);
2411 dput(new_dentry);
2412 out_unlock:
2413 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2414 out_release:
2415 path_put(&nd.path);
2416 out:
2417 path_put(&old_nd.path);
2418 exit:
2419 putname(to);
2421 return error;
2424 asmlinkage long sys_link(const char __user *oldname, const char __user *newname)
2426 return sys_linkat(AT_FDCWD, oldname, AT_FDCWD, newname, 0);
2430 * The worst of all namespace operations - renaming directory. "Perverted"
2431 * doesn't even start to describe it. Somebody in UCB had a heck of a trip...
2432 * Problems:
2433 * a) we can get into loop creation. Check is done in is_subdir().
2434 * b) race potential - two innocent renames can create a loop together.
2435 * That's where 4.4 screws up. Current fix: serialization on
2436 * sb->s_vfs_rename_mutex. We might be more accurate, but that's another
2437 * story.
2438 * c) we have to lock _three_ objects - parents and victim (if it exists).
2439 * And that - after we got ->i_mutex on parents (until then we don't know
2440 * whether the target exists). Solution: try to be smart with locking
2441 * order for inodes. We rely on the fact that tree topology may change
2442 * only under ->s_vfs_rename_mutex _and_ that parent of the object we
2443 * move will be locked. Thus we can rank directories by the tree
2444 * (ancestors first) and rank all non-directories after them.
2445 * That works since everybody except rename does "lock parent, lookup,
2446 * lock child" and rename is under ->s_vfs_rename_mutex.
2447 * HOWEVER, it relies on the assumption that any object with ->lookup()
2448 * has no more than 1 dentry. If "hybrid" objects will ever appear,
2449 * we'd better make sure that there's no link(2) for them.
2450 * d) some filesystems don't support opened-but-unlinked directories,
2451 * either because of layout or because they are not ready to deal with
2452 * all cases correctly. The latter will be fixed (taking this sort of
2453 * stuff into VFS), but the former is not going away. Solution: the same
2454 * trick as in rmdir().
2455 * e) conversion from fhandle to dentry may come in the wrong moment - when
2456 * we are removing the target. Solution: we will have to grab ->i_mutex
2457 * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on
2458 * ->i_mutex on parents, which works but leads to some truely excessive
2459 * locking].
2461 static int vfs_rename_dir(struct inode *old_dir, struct dentry *old_dentry,
2462 struct inode *new_dir, struct dentry *new_dentry)
2464 int error = 0;
2465 struct inode *target;
2468 * If we are going to change the parent - check write permissions,
2469 * we'll need to flip '..'.
2471 if (new_dir != old_dir) {
2472 error = permission(old_dentry->d_inode, MAY_WRITE, NULL);
2473 if (error)
2474 return error;
2477 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2478 if (error)
2479 return error;
2481 target = new_dentry->d_inode;
2482 if (target) {
2483 mutex_lock(&target->i_mutex);
2484 dentry_unhash(new_dentry);
2486 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2487 error = -EBUSY;
2488 else
2489 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2490 if (target) {
2491 if (!error)
2492 target->i_flags |= S_DEAD;
2493 mutex_unlock(&target->i_mutex);
2494 if (d_unhashed(new_dentry))
2495 d_rehash(new_dentry);
2496 dput(new_dentry);
2498 if (!error)
2499 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
2500 d_move(old_dentry,new_dentry);
2501 return error;
2504 static int vfs_rename_other(struct inode *old_dir, struct dentry *old_dentry,
2505 struct inode *new_dir, struct dentry *new_dentry)
2507 struct inode *target;
2508 int error;
2510 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2511 if (error)
2512 return error;
2514 dget(new_dentry);
2515 target = new_dentry->d_inode;
2516 if (target)
2517 mutex_lock(&target->i_mutex);
2518 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2519 error = -EBUSY;
2520 else
2521 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2522 if (!error) {
2523 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
2524 d_move(old_dentry, new_dentry);
2526 if (target)
2527 mutex_unlock(&target->i_mutex);
2528 dput(new_dentry);
2529 return error;
2532 int vfs_rename(struct inode *old_dir, struct dentry *old_dentry,
2533 struct inode *new_dir, struct dentry *new_dentry)
2535 int error;
2536 int is_dir = S_ISDIR(old_dentry->d_inode->i_mode);
2537 const char *old_name;
2539 if (old_dentry->d_inode == new_dentry->d_inode)
2540 return 0;
2542 error = may_delete(old_dir, old_dentry, is_dir);
2543 if (error)
2544 return error;
2546 if (!new_dentry->d_inode)
2547 error = may_create(new_dir, new_dentry, NULL);
2548 else
2549 error = may_delete(new_dir, new_dentry, is_dir);
2550 if (error)
2551 return error;
2553 if (!old_dir->i_op || !old_dir->i_op->rename)
2554 return -EPERM;
2556 DQUOT_INIT(old_dir);
2557 DQUOT_INIT(new_dir);
2559 old_name = fsnotify_oldname_init(old_dentry->d_name.name);
2561 if (is_dir)
2562 error = vfs_rename_dir(old_dir,old_dentry,new_dir,new_dentry);
2563 else
2564 error = vfs_rename_other(old_dir,old_dentry,new_dir,new_dentry);
2565 if (!error) {
2566 const char *new_name = old_dentry->d_name.name;
2567 fsnotify_move(old_dir, new_dir, old_name, new_name, is_dir,
2568 new_dentry->d_inode, old_dentry);
2570 fsnotify_oldname_free(old_name);
2572 return error;
2575 static int do_rename(int olddfd, const char *oldname,
2576 int newdfd, const char *newname)
2578 int error = 0;
2579 struct dentry * old_dir, * new_dir;
2580 struct dentry * old_dentry, *new_dentry;
2581 struct dentry * trap;
2582 struct nameidata oldnd, newnd;
2584 error = do_path_lookup(olddfd, oldname, LOOKUP_PARENT, &oldnd);
2585 if (error)
2586 goto exit;
2588 error = do_path_lookup(newdfd, newname, LOOKUP_PARENT, &newnd);
2589 if (error)
2590 goto exit1;
2592 error = -EXDEV;
2593 if (oldnd.path.mnt != newnd.path.mnt)
2594 goto exit2;
2596 old_dir = oldnd.path.dentry;
2597 error = -EBUSY;
2598 if (oldnd.last_type != LAST_NORM)
2599 goto exit2;
2601 new_dir = newnd.path.dentry;
2602 if (newnd.last_type != LAST_NORM)
2603 goto exit2;
2605 trap = lock_rename(new_dir, old_dir);
2607 old_dentry = lookup_hash(&oldnd);
2608 error = PTR_ERR(old_dentry);
2609 if (IS_ERR(old_dentry))
2610 goto exit3;
2611 /* source must exist */
2612 error = -ENOENT;
2613 if (!old_dentry->d_inode)
2614 goto exit4;
2615 /* unless the source is a directory trailing slashes give -ENOTDIR */
2616 if (!S_ISDIR(old_dentry->d_inode->i_mode)) {
2617 error = -ENOTDIR;
2618 if (oldnd.last.name[oldnd.last.len])
2619 goto exit4;
2620 if (newnd.last.name[newnd.last.len])
2621 goto exit4;
2623 /* source should not be ancestor of target */
2624 error = -EINVAL;
2625 if (old_dentry == trap)
2626 goto exit4;
2627 new_dentry = lookup_hash(&newnd);
2628 error = PTR_ERR(new_dentry);
2629 if (IS_ERR(new_dentry))
2630 goto exit4;
2631 /* target should not be an ancestor of source */
2632 error = -ENOTEMPTY;
2633 if (new_dentry == trap)
2634 goto exit5;
2636 error = vfs_rename(old_dir->d_inode, old_dentry,
2637 new_dir->d_inode, new_dentry);
2638 exit5:
2639 dput(new_dentry);
2640 exit4:
2641 dput(old_dentry);
2642 exit3:
2643 unlock_rename(new_dir, old_dir);
2644 exit2:
2645 path_put(&newnd.path);
2646 exit1:
2647 path_put(&oldnd.path);
2648 exit:
2649 return error;
2652 asmlinkage long sys_renameat(int olddfd, const char __user *oldname,
2653 int newdfd, const char __user *newname)
2655 int error;
2656 char * from;
2657 char * to;
2659 from = getname(oldname);
2660 if(IS_ERR(from))
2661 return PTR_ERR(from);
2662 to = getname(newname);
2663 error = PTR_ERR(to);
2664 if (!IS_ERR(to)) {
2665 error = do_rename(olddfd, from, newdfd, to);
2666 putname(to);
2668 putname(from);
2669 return error;
2672 asmlinkage long sys_rename(const char __user *oldname, const char __user *newname)
2674 return sys_renameat(AT_FDCWD, oldname, AT_FDCWD, newname);
2677 int vfs_readlink(struct dentry *dentry, char __user *buffer, int buflen, const char *link)
2679 int len;
2681 len = PTR_ERR(link);
2682 if (IS_ERR(link))
2683 goto out;
2685 len = strlen(link);
2686 if (len > (unsigned) buflen)
2687 len = buflen;
2688 if (copy_to_user(buffer, link, len))
2689 len = -EFAULT;
2690 out:
2691 return len;
2695 * A helper for ->readlink(). This should be used *ONLY* for symlinks that
2696 * have ->follow_link() touching nd only in nd_set_link(). Using (or not
2697 * using) it for any given inode is up to filesystem.
2699 int generic_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2701 struct nameidata nd;
2702 void *cookie;
2704 nd.depth = 0;
2705 cookie = dentry->d_inode->i_op->follow_link(dentry, &nd);
2706 if (!IS_ERR(cookie)) {
2707 int res = vfs_readlink(dentry, buffer, buflen, nd_get_link(&nd));
2708 if (dentry->d_inode->i_op->put_link)
2709 dentry->d_inode->i_op->put_link(dentry, &nd, cookie);
2710 cookie = ERR_PTR(res);
2712 return PTR_ERR(cookie);
2715 int vfs_follow_link(struct nameidata *nd, const char *link)
2717 return __vfs_follow_link(nd, link);
2720 /* get the link contents into pagecache */
2721 static char *page_getlink(struct dentry * dentry, struct page **ppage)
2723 struct page * page;
2724 struct address_space *mapping = dentry->d_inode->i_mapping;
2725 page = read_mapping_page(mapping, 0, NULL);
2726 if (IS_ERR(page))
2727 return (char*)page;
2728 *ppage = page;
2729 return kmap(page);
2732 int page_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2734 struct page *page = NULL;
2735 char *s = page_getlink(dentry, &page);
2736 int res = vfs_readlink(dentry,buffer,buflen,s);
2737 if (page) {
2738 kunmap(page);
2739 page_cache_release(page);
2741 return res;
2744 void *page_follow_link_light(struct dentry *dentry, struct nameidata *nd)
2746 struct page *page = NULL;
2747 nd_set_link(nd, page_getlink(dentry, &page));
2748 return page;
2751 void page_put_link(struct dentry *dentry, struct nameidata *nd, void *cookie)
2753 struct page *page = cookie;
2755 if (page) {
2756 kunmap(page);
2757 page_cache_release(page);
2761 int __page_symlink(struct inode *inode, const char *symname, int len,
2762 gfp_t gfp_mask)
2764 struct address_space *mapping = inode->i_mapping;
2765 struct page *page;
2766 void *fsdata;
2767 int err;
2768 char *kaddr;
2770 retry:
2771 err = pagecache_write_begin(NULL, mapping, 0, len-1,
2772 AOP_FLAG_UNINTERRUPTIBLE, &page, &fsdata);
2773 if (err)
2774 goto fail;
2776 kaddr = kmap_atomic(page, KM_USER0);
2777 memcpy(kaddr, symname, len-1);
2778 kunmap_atomic(kaddr, KM_USER0);
2780 err = pagecache_write_end(NULL, mapping, 0, len-1, len-1,
2781 page, fsdata);
2782 if (err < 0)
2783 goto fail;
2784 if (err < len-1)
2785 goto retry;
2787 mark_inode_dirty(inode);
2788 return 0;
2789 fail:
2790 return err;
2793 int page_symlink(struct inode *inode, const char *symname, int len)
2795 return __page_symlink(inode, symname, len,
2796 mapping_gfp_mask(inode->i_mapping));
2799 const struct inode_operations page_symlink_inode_operations = {
2800 .readlink = generic_readlink,
2801 .follow_link = page_follow_link_light,
2802 .put_link = page_put_link,
2805 EXPORT_SYMBOL(__user_walk);
2806 EXPORT_SYMBOL(__user_walk_fd);
2807 EXPORT_SYMBOL(follow_down);
2808 EXPORT_SYMBOL(follow_up);
2809 EXPORT_SYMBOL(get_write_access); /* binfmt_aout */
2810 EXPORT_SYMBOL(getname);
2811 EXPORT_SYMBOL(lock_rename);
2812 EXPORT_SYMBOL(lookup_one_len);
2813 EXPORT_SYMBOL(page_follow_link_light);
2814 EXPORT_SYMBOL(page_put_link);
2815 EXPORT_SYMBOL(page_readlink);
2816 EXPORT_SYMBOL(__page_symlink);
2817 EXPORT_SYMBOL(page_symlink);
2818 EXPORT_SYMBOL(page_symlink_inode_operations);
2819 EXPORT_SYMBOL(path_lookup);
2820 EXPORT_SYMBOL(vfs_path_lookup);
2821 EXPORT_SYMBOL(permission);
2822 EXPORT_SYMBOL(vfs_permission);
2823 EXPORT_SYMBOL(file_permission);
2824 EXPORT_SYMBOL(unlock_rename);
2825 EXPORT_SYMBOL(vfs_create);
2826 EXPORT_SYMBOL(vfs_follow_link);
2827 EXPORT_SYMBOL(vfs_link);
2828 EXPORT_SYMBOL(vfs_mkdir);
2829 EXPORT_SYMBOL(vfs_mknod);
2830 EXPORT_SYMBOL(generic_permission);
2831 EXPORT_SYMBOL(vfs_readlink);
2832 EXPORT_SYMBOL(vfs_rename);
2833 EXPORT_SYMBOL(vfs_rmdir);
2834 EXPORT_SYMBOL(vfs_symlink);
2835 EXPORT_SYMBOL(vfs_unlink);
2836 EXPORT_SYMBOL(dentry_unhash);
2837 EXPORT_SYMBOL(generic_readlink);