Merge branch 'for-linus' of git://git390.marist.edu/pub/scm/linux-2.6
[linux-2.6/mini2440.git] / fs / namei.c
blobb8433ebfae055424c5d953ff3ff9c96bc7c7a628
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/ima.h>
28 #include <linux/syscalls.h>
29 #include <linux/mount.h>
30 #include <linux/audit.h>
31 #include <linux/capability.h>
32 #include <linux/file.h>
33 #include <linux/fcntl.h>
34 #include <linux/device_cgroup.h>
35 #include <linux/fs_struct.h>
36 #include <asm/uaccess.h>
38 #define ACC_MODE(x) ("\000\004\002\006"[(x)&O_ACCMODE])
40 /* [Feb-1997 T. Schoebel-Theuer]
41 * Fundamental changes in the pathname lookup mechanisms (namei)
42 * were necessary because of omirr. The reason is that omirr needs
43 * to know the _real_ pathname, not the user-supplied one, in case
44 * of symlinks (and also when transname replacements occur).
46 * The new code replaces the old recursive symlink resolution with
47 * an iterative one (in case of non-nested symlink chains). It does
48 * this with calls to <fs>_follow_link().
49 * As a side effect, dir_namei(), _namei() and follow_link() are now
50 * replaced with a single function lookup_dentry() that can handle all
51 * the special cases of the former code.
53 * With the new dcache, the pathname is stored at each inode, at least as
54 * long as the refcount of the inode is positive. As a side effect, the
55 * size of the dcache depends on the inode cache and thus is dynamic.
57 * [29-Apr-1998 C. Scott Ananian] Updated above description of symlink
58 * resolution to correspond with current state of the code.
60 * Note that the symlink resolution is not *completely* iterative.
61 * There is still a significant amount of tail- and mid- recursion in
62 * the algorithm. Also, note that <fs>_readlink() is not used in
63 * lookup_dentry(): lookup_dentry() on the result of <fs>_readlink()
64 * may return different results than <fs>_follow_link(). Many virtual
65 * filesystems (including /proc) exhibit this behavior.
68 /* [24-Feb-97 T. Schoebel-Theuer] Side effects caused by new implementation:
69 * New symlink semantics: when open() is called with flags O_CREAT | O_EXCL
70 * and the name already exists in form of a symlink, try to create the new
71 * name indicated by the symlink. The old code always complained that the
72 * name already exists, due to not following the symlink even if its target
73 * is nonexistent. The new semantics affects also mknod() and link() when
74 * the name is a symlink pointing to a non-existant name.
76 * I don't know which semantics is the right one, since I have no access
77 * to standards. But I found by trial that HP-UX 9.0 has the full "new"
78 * semantics implemented, while SunOS 4.1.1 and Solaris (SunOS 5.4) have the
79 * "old" one. Personally, I think the new semantics is much more logical.
80 * Note that "ln old new" where "new" is a symlink pointing to a non-existing
81 * file does succeed in both HP-UX and SunOs, but not in Solaris
82 * and in the old Linux semantics.
85 /* [16-Dec-97 Kevin Buhr] For security reasons, we change some symlink
86 * semantics. See the comments in "open_namei" and "do_link" below.
88 * [10-Sep-98 Alan Modra] Another symlink change.
91 /* [Feb-Apr 2000 AV] Complete rewrite. Rules for symlinks:
92 * inside the path - always follow.
93 * in the last component in creation/removal/renaming - never follow.
94 * if LOOKUP_FOLLOW passed - follow.
95 * if the pathname has trailing slashes - follow.
96 * otherwise - don't follow.
97 * (applied in that order).
99 * [Jun 2000 AV] Inconsistent behaviour of open() in case if flags==O_CREAT
100 * restored for 2.4. This is the last surviving part of old 4.2BSD bug.
101 * During the 2.4 we need to fix the userland stuff depending on it -
102 * hopefully we will be able to get rid of that wart in 2.5. So far only
103 * XEmacs seems to be relying on it...
106 * [Sep 2001 AV] Single-semaphore locking scheme (kudos to David Holland)
107 * implemented. Let's see if raised priority of ->s_vfs_rename_mutex gives
108 * any extra contention...
111 static int __link_path_walk(const char *name, struct nameidata *nd);
113 /* In order to reduce some races, while at the same time doing additional
114 * checking and hopefully speeding things up, we copy filenames to the
115 * kernel data space before using them..
117 * POSIX.1 2.4: an empty pathname is invalid (ENOENT).
118 * PATH_MAX includes the nul terminator --RR.
120 static int do_getname(const char __user *filename, char *page)
122 int retval;
123 unsigned long len = PATH_MAX;
125 if (!segment_eq(get_fs(), KERNEL_DS)) {
126 if ((unsigned long) filename >= TASK_SIZE)
127 return -EFAULT;
128 if (TASK_SIZE - (unsigned long) filename < PATH_MAX)
129 len = TASK_SIZE - (unsigned long) filename;
132 retval = strncpy_from_user(page, filename, len);
133 if (retval > 0) {
134 if (retval < len)
135 return 0;
136 return -ENAMETOOLONG;
137 } else if (!retval)
138 retval = -ENOENT;
139 return retval;
142 char * getname(const char __user * filename)
144 char *tmp, *result;
146 result = ERR_PTR(-ENOMEM);
147 tmp = __getname();
148 if (tmp) {
149 int retval = do_getname(filename, tmp);
151 result = tmp;
152 if (retval < 0) {
153 __putname(tmp);
154 result = ERR_PTR(retval);
157 audit_getname(result);
158 return result;
161 #ifdef CONFIG_AUDITSYSCALL
162 void putname(const char *name)
164 if (unlikely(!audit_dummy_context()))
165 audit_putname(name);
166 else
167 __putname(name);
169 EXPORT_SYMBOL(putname);
170 #endif
174 * generic_permission - check for access rights on a Posix-like filesystem
175 * @inode: inode to check access rights for
176 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
177 * @check_acl: optional callback to check for Posix ACLs
179 * Used to check for read/write/execute permissions on a file.
180 * We use "fsuid" for this, letting us set arbitrary permissions
181 * for filesystem access without changing the "normal" uids which
182 * are used for other things..
184 int generic_permission(struct inode *inode, int mask,
185 int (*check_acl)(struct inode *inode, int mask))
187 umode_t mode = inode->i_mode;
189 mask &= MAY_READ | MAY_WRITE | MAY_EXEC;
191 if (current_fsuid() == inode->i_uid)
192 mode >>= 6;
193 else {
194 if (IS_POSIXACL(inode) && (mode & S_IRWXG) && check_acl) {
195 int error = check_acl(inode, mask);
196 if (error == -EACCES)
197 goto check_capabilities;
198 else if (error != -EAGAIN)
199 return error;
202 if (in_group_p(inode->i_gid))
203 mode >>= 3;
207 * If the DACs are ok we don't need any capability check.
209 if ((mask & ~mode) == 0)
210 return 0;
212 check_capabilities:
214 * Read/write DACs are always overridable.
215 * Executable DACs are overridable if at least one exec bit is set.
217 if (!(mask & MAY_EXEC) || execute_ok(inode))
218 if (capable(CAP_DAC_OVERRIDE))
219 return 0;
222 * Searching includes executable on directories, else just read.
224 if (mask == MAY_READ || (S_ISDIR(inode->i_mode) && !(mask & MAY_WRITE)))
225 if (capable(CAP_DAC_READ_SEARCH))
226 return 0;
228 return -EACCES;
232 * inode_permission - check for access rights to a given inode
233 * @inode: inode to check permission on
234 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
236 * Used to check for read/write/execute permissions on an inode.
237 * We use "fsuid" for this, letting us set arbitrary permissions
238 * for filesystem access without changing the "normal" uids which
239 * are used for other things.
241 int inode_permission(struct inode *inode, int mask)
243 int retval;
245 if (mask & MAY_WRITE) {
246 umode_t mode = inode->i_mode;
249 * Nobody gets write access to a read-only fs.
251 if (IS_RDONLY(inode) &&
252 (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode)))
253 return -EROFS;
256 * Nobody gets write access to an immutable file.
258 if (IS_IMMUTABLE(inode))
259 return -EACCES;
262 if (inode->i_op->permission)
263 retval = inode->i_op->permission(inode, mask);
264 else
265 retval = generic_permission(inode, mask, NULL);
267 if (retval)
268 return retval;
270 retval = devcgroup_inode_permission(inode, mask);
271 if (retval)
272 return retval;
274 return security_inode_permission(inode,
275 mask & (MAY_READ|MAY_WRITE|MAY_EXEC|MAY_APPEND));
279 * file_permission - check for additional access rights to a given file
280 * @file: file to check access rights for
281 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
283 * Used to check for read/write/execute permissions on an already opened
284 * file.
286 * Note:
287 * Do not use this function in new code. All access checks should
288 * be done using inode_permission().
290 int file_permission(struct file *file, int mask)
292 return inode_permission(file->f_path.dentry->d_inode, mask);
296 * get_write_access() gets write permission for a file.
297 * put_write_access() releases this write permission.
298 * This is used for regular files.
299 * We cannot support write (and maybe mmap read-write shared) accesses and
300 * MAP_DENYWRITE mmappings simultaneously. The i_writecount field of an inode
301 * can have the following values:
302 * 0: no writers, no VM_DENYWRITE mappings
303 * < 0: (-i_writecount) vm_area_structs with VM_DENYWRITE set exist
304 * > 0: (i_writecount) users are writing to the file.
306 * Normally we operate on that counter with atomic_{inc,dec} and it's safe
307 * except for the cases where we don't hold i_writecount yet. Then we need to
308 * use {get,deny}_write_access() - these functions check the sign and refuse
309 * to do the change if sign is wrong. Exclusion between them is provided by
310 * the inode->i_lock spinlock.
313 int get_write_access(struct inode * inode)
315 spin_lock(&inode->i_lock);
316 if (atomic_read(&inode->i_writecount) < 0) {
317 spin_unlock(&inode->i_lock);
318 return -ETXTBSY;
320 atomic_inc(&inode->i_writecount);
321 spin_unlock(&inode->i_lock);
323 return 0;
326 int deny_write_access(struct file * file)
328 struct inode *inode = file->f_path.dentry->d_inode;
330 spin_lock(&inode->i_lock);
331 if (atomic_read(&inode->i_writecount) > 0) {
332 spin_unlock(&inode->i_lock);
333 return -ETXTBSY;
335 atomic_dec(&inode->i_writecount);
336 spin_unlock(&inode->i_lock);
338 return 0;
342 * path_get - get a reference to a path
343 * @path: path to get the reference to
345 * Given a path increment the reference count to the dentry and the vfsmount.
347 void path_get(struct path *path)
349 mntget(path->mnt);
350 dget(path->dentry);
352 EXPORT_SYMBOL(path_get);
355 * path_put - put a reference to a path
356 * @path: path to put the reference to
358 * Given a path decrement the reference count to the dentry and the vfsmount.
360 void path_put(struct path *path)
362 dput(path->dentry);
363 mntput(path->mnt);
365 EXPORT_SYMBOL(path_put);
368 * release_open_intent - free up open intent resources
369 * @nd: pointer to nameidata
371 void release_open_intent(struct nameidata *nd)
373 if (nd->intent.open.file->f_path.dentry == NULL)
374 put_filp(nd->intent.open.file);
375 else
376 fput(nd->intent.open.file);
379 static inline struct dentry *
380 do_revalidate(struct dentry *dentry, struct nameidata *nd)
382 int status = dentry->d_op->d_revalidate(dentry, nd);
383 if (unlikely(status <= 0)) {
385 * The dentry failed validation.
386 * If d_revalidate returned 0 attempt to invalidate
387 * the dentry otherwise d_revalidate is asking us
388 * to return a fail status.
390 if (!status) {
391 if (!d_invalidate(dentry)) {
392 dput(dentry);
393 dentry = NULL;
395 } else {
396 dput(dentry);
397 dentry = ERR_PTR(status);
400 return dentry;
404 * Internal lookup() using the new generic dcache.
405 * SMP-safe
407 static struct dentry * cached_lookup(struct dentry * parent, struct qstr * name, struct nameidata *nd)
409 struct dentry * dentry = __d_lookup(parent, name);
411 /* lockess __d_lookup may fail due to concurrent d_move()
412 * in some unrelated directory, so try with d_lookup
414 if (!dentry)
415 dentry = d_lookup(parent, name);
417 if (dentry && dentry->d_op && dentry->d_op->d_revalidate)
418 dentry = do_revalidate(dentry, nd);
420 return dentry;
424 * Short-cut version of permission(), for calling by
425 * path_walk(), when dcache lock is held. Combines parts
426 * of permission() and generic_permission(), and tests ONLY for
427 * MAY_EXEC permission.
429 * If appropriate, check DAC only. If not appropriate, or
430 * short-cut DAC fails, then call permission() to do more
431 * complete permission check.
433 static int exec_permission_lite(struct inode *inode)
435 umode_t mode = inode->i_mode;
437 if (inode->i_op->permission)
438 return -EAGAIN;
440 if (current_fsuid() == inode->i_uid)
441 mode >>= 6;
442 else if (in_group_p(inode->i_gid))
443 mode >>= 3;
445 if (mode & MAY_EXEC)
446 goto ok;
448 if ((inode->i_mode & S_IXUGO) && capable(CAP_DAC_OVERRIDE))
449 goto ok;
451 if (S_ISDIR(inode->i_mode) && capable(CAP_DAC_OVERRIDE))
452 goto ok;
454 if (S_ISDIR(inode->i_mode) && capable(CAP_DAC_READ_SEARCH))
455 goto ok;
457 return -EACCES;
459 return security_inode_permission(inode, MAY_EXEC);
463 * This is called when everything else fails, and we actually have
464 * to go to the low-level filesystem to find out what we should do..
466 * We get the directory semaphore, and after getting that we also
467 * make sure that nobody added the entry to the dcache in the meantime..
468 * SMP-safe
470 static struct dentry * real_lookup(struct dentry * parent, struct qstr * name, struct nameidata *nd)
472 struct dentry * result;
473 struct inode *dir = parent->d_inode;
475 mutex_lock(&dir->i_mutex);
477 * First re-do the cached lookup just in case it was created
478 * while we waited for the directory semaphore..
480 * FIXME! This could use version numbering or similar to
481 * avoid unnecessary cache lookups.
483 * The "dcache_lock" is purely to protect the RCU list walker
484 * from concurrent renames at this point (we mustn't get false
485 * negatives from the RCU list walk here, unlike the optimistic
486 * fast walk).
488 * so doing d_lookup() (with seqlock), instead of lockfree __d_lookup
490 result = d_lookup(parent, name);
491 if (!result) {
492 struct dentry *dentry;
494 /* Don't create child dentry for a dead directory. */
495 result = ERR_PTR(-ENOENT);
496 if (IS_DEADDIR(dir))
497 goto out_unlock;
499 dentry = d_alloc(parent, name);
500 result = ERR_PTR(-ENOMEM);
501 if (dentry) {
502 result = dir->i_op->lookup(dir, dentry, nd);
503 if (result)
504 dput(dentry);
505 else
506 result = dentry;
508 out_unlock:
509 mutex_unlock(&dir->i_mutex);
510 return result;
514 * Uhhuh! Nasty case: the cache was re-populated while
515 * we waited on the semaphore. Need to revalidate.
517 mutex_unlock(&dir->i_mutex);
518 if (result->d_op && result->d_op->d_revalidate) {
519 result = do_revalidate(result, nd);
520 if (!result)
521 result = ERR_PTR(-ENOENT);
523 return result;
527 * Wrapper to retry pathname resolution whenever the underlying
528 * file system returns an ESTALE.
530 * Retry the whole path once, forcing real lookup requests
531 * instead of relying on the dcache.
533 static __always_inline int link_path_walk(const char *name, struct nameidata *nd)
535 struct path save = nd->path;
536 int result;
538 /* make sure the stuff we saved doesn't go away */
539 path_get(&save);
541 result = __link_path_walk(name, nd);
542 if (result == -ESTALE) {
543 /* nd->path had been dropped */
544 nd->path = save;
545 path_get(&nd->path);
546 nd->flags |= LOOKUP_REVAL;
547 result = __link_path_walk(name, nd);
550 path_put(&save);
552 return result;
555 static __always_inline int __vfs_follow_link(struct nameidata *nd, const char *link)
557 int res = 0;
558 char *name;
559 if (IS_ERR(link))
560 goto fail;
562 if (*link == '/') {
563 struct fs_struct *fs = current->fs;
565 path_put(&nd->path);
567 read_lock(&fs->lock);
568 nd->path = fs->root;
569 path_get(&fs->root);
570 read_unlock(&fs->lock);
573 res = link_path_walk(link, nd);
574 if (nd->depth || res || nd->last_type!=LAST_NORM)
575 return res;
577 * If it is an iterative symlinks resolution in open_namei() we
578 * have to copy the last component. And all that crap because of
579 * bloody create() on broken symlinks. Furrfu...
581 name = __getname();
582 if (unlikely(!name)) {
583 path_put(&nd->path);
584 return -ENOMEM;
586 strcpy(name, nd->last.name);
587 nd->last.name = name;
588 return 0;
589 fail:
590 path_put(&nd->path);
591 return PTR_ERR(link);
594 static void path_put_conditional(struct path *path, struct nameidata *nd)
596 dput(path->dentry);
597 if (path->mnt != nd->path.mnt)
598 mntput(path->mnt);
601 static inline void path_to_nameidata(struct path *path, struct nameidata *nd)
603 dput(nd->path.dentry);
604 if (nd->path.mnt != path->mnt)
605 mntput(nd->path.mnt);
606 nd->path.mnt = path->mnt;
607 nd->path.dentry = path->dentry;
610 static __always_inline int __do_follow_link(struct path *path, struct nameidata *nd)
612 int error;
613 void *cookie;
614 struct dentry *dentry = path->dentry;
616 touch_atime(path->mnt, dentry);
617 nd_set_link(nd, NULL);
619 if (path->mnt != nd->path.mnt) {
620 path_to_nameidata(path, nd);
621 dget(dentry);
623 mntget(path->mnt);
624 cookie = dentry->d_inode->i_op->follow_link(dentry, nd);
625 error = PTR_ERR(cookie);
626 if (!IS_ERR(cookie)) {
627 char *s = nd_get_link(nd);
628 error = 0;
629 if (s)
630 error = __vfs_follow_link(nd, s);
631 if (dentry->d_inode->i_op->put_link)
632 dentry->d_inode->i_op->put_link(dentry, nd, cookie);
634 path_put(path);
636 return error;
640 * This limits recursive symlink follows to 8, while
641 * limiting consecutive symlinks to 40.
643 * Without that kind of total limit, nasty chains of consecutive
644 * symlinks can cause almost arbitrarily long lookups.
646 static inline int do_follow_link(struct path *path, struct nameidata *nd)
648 int err = -ELOOP;
649 if (current->link_count >= MAX_NESTED_LINKS)
650 goto loop;
651 if (current->total_link_count >= 40)
652 goto loop;
653 BUG_ON(nd->depth >= MAX_NESTED_LINKS);
654 cond_resched();
655 err = security_inode_follow_link(path->dentry, nd);
656 if (err)
657 goto loop;
658 current->link_count++;
659 current->total_link_count++;
660 nd->depth++;
661 err = __do_follow_link(path, nd);
662 current->link_count--;
663 nd->depth--;
664 return err;
665 loop:
666 path_put_conditional(path, nd);
667 path_put(&nd->path);
668 return err;
671 int follow_up(struct vfsmount **mnt, struct dentry **dentry)
673 struct vfsmount *parent;
674 struct dentry *mountpoint;
675 spin_lock(&vfsmount_lock);
676 parent=(*mnt)->mnt_parent;
677 if (parent == *mnt) {
678 spin_unlock(&vfsmount_lock);
679 return 0;
681 mntget(parent);
682 mountpoint=dget((*mnt)->mnt_mountpoint);
683 spin_unlock(&vfsmount_lock);
684 dput(*dentry);
685 *dentry = mountpoint;
686 mntput(*mnt);
687 *mnt = parent;
688 return 1;
691 /* no need for dcache_lock, as serialization is taken care in
692 * namespace.c
694 static int __follow_mount(struct path *path)
696 int res = 0;
697 while (d_mountpoint(path->dentry)) {
698 struct vfsmount *mounted = lookup_mnt(path->mnt, path->dentry);
699 if (!mounted)
700 break;
701 dput(path->dentry);
702 if (res)
703 mntput(path->mnt);
704 path->mnt = mounted;
705 path->dentry = dget(mounted->mnt_root);
706 res = 1;
708 return res;
711 static void follow_mount(struct vfsmount **mnt, struct dentry **dentry)
713 while (d_mountpoint(*dentry)) {
714 struct vfsmount *mounted = lookup_mnt(*mnt, *dentry);
715 if (!mounted)
716 break;
717 dput(*dentry);
718 mntput(*mnt);
719 *mnt = mounted;
720 *dentry = dget(mounted->mnt_root);
724 /* no need for dcache_lock, as serialization is taken care in
725 * namespace.c
727 int follow_down(struct vfsmount **mnt, struct dentry **dentry)
729 struct vfsmount *mounted;
731 mounted = lookup_mnt(*mnt, *dentry);
732 if (mounted) {
733 dput(*dentry);
734 mntput(*mnt);
735 *mnt = mounted;
736 *dentry = dget(mounted->mnt_root);
737 return 1;
739 return 0;
742 static __always_inline void follow_dotdot(struct nameidata *nd)
744 struct fs_struct *fs = current->fs;
746 while(1) {
747 struct vfsmount *parent;
748 struct dentry *old = nd->path.dentry;
750 read_lock(&fs->lock);
751 if (nd->path.dentry == fs->root.dentry &&
752 nd->path.mnt == fs->root.mnt) {
753 read_unlock(&fs->lock);
754 break;
756 read_unlock(&fs->lock);
757 spin_lock(&dcache_lock);
758 if (nd->path.dentry != nd->path.mnt->mnt_root) {
759 nd->path.dentry = dget(nd->path.dentry->d_parent);
760 spin_unlock(&dcache_lock);
761 dput(old);
762 break;
764 spin_unlock(&dcache_lock);
765 spin_lock(&vfsmount_lock);
766 parent = nd->path.mnt->mnt_parent;
767 if (parent == nd->path.mnt) {
768 spin_unlock(&vfsmount_lock);
769 break;
771 mntget(parent);
772 nd->path.dentry = dget(nd->path.mnt->mnt_mountpoint);
773 spin_unlock(&vfsmount_lock);
774 dput(old);
775 mntput(nd->path.mnt);
776 nd->path.mnt = parent;
778 follow_mount(&nd->path.mnt, &nd->path.dentry);
782 * It's more convoluted than I'd like it to be, but... it's still fairly
783 * small and for now I'd prefer to have fast path as straight as possible.
784 * It _is_ time-critical.
786 static int do_lookup(struct nameidata *nd, struct qstr *name,
787 struct path *path)
789 struct vfsmount *mnt = nd->path.mnt;
790 struct dentry *dentry = __d_lookup(nd->path.dentry, name);
792 if (!dentry)
793 goto need_lookup;
794 if (dentry->d_op && dentry->d_op->d_revalidate)
795 goto need_revalidate;
796 done:
797 path->mnt = mnt;
798 path->dentry = dentry;
799 __follow_mount(path);
800 return 0;
802 need_lookup:
803 dentry = real_lookup(nd->path.dentry, name, nd);
804 if (IS_ERR(dentry))
805 goto fail;
806 goto done;
808 need_revalidate:
809 dentry = do_revalidate(dentry, nd);
810 if (!dentry)
811 goto need_lookup;
812 if (IS_ERR(dentry))
813 goto fail;
814 goto done;
816 fail:
817 return PTR_ERR(dentry);
821 * Name resolution.
822 * This is the basic name resolution function, turning a pathname into
823 * the final dentry. We expect 'base' to be positive and a directory.
825 * Returns 0 and nd will have valid dentry and mnt on success.
826 * Returns error and drops reference to input namei data on failure.
828 static int __link_path_walk(const char *name, struct nameidata *nd)
830 struct path next;
831 struct inode *inode;
832 int err;
833 unsigned int lookup_flags = nd->flags;
835 while (*name=='/')
836 name++;
837 if (!*name)
838 goto return_reval;
840 inode = nd->path.dentry->d_inode;
841 if (nd->depth)
842 lookup_flags = LOOKUP_FOLLOW | (nd->flags & LOOKUP_CONTINUE);
844 /* At this point we know we have a real path component. */
845 for(;;) {
846 unsigned long hash;
847 struct qstr this;
848 unsigned int c;
850 nd->flags |= LOOKUP_CONTINUE;
851 err = exec_permission_lite(inode);
852 if (err == -EAGAIN)
853 err = inode_permission(nd->path.dentry->d_inode,
854 MAY_EXEC);
855 if (!err)
856 err = ima_path_check(&nd->path, MAY_EXEC);
857 if (err)
858 break;
860 this.name = name;
861 c = *(const unsigned char *)name;
863 hash = init_name_hash();
864 do {
865 name++;
866 hash = partial_name_hash(c, hash);
867 c = *(const unsigned char *)name;
868 } while (c && (c != '/'));
869 this.len = name - (const char *) this.name;
870 this.hash = end_name_hash(hash);
872 /* remove trailing slashes? */
873 if (!c)
874 goto last_component;
875 while (*++name == '/');
876 if (!*name)
877 goto last_with_slashes;
880 * "." and ".." are special - ".." especially so because it has
881 * to be able to know about the current root directory and
882 * parent relationships.
884 if (this.name[0] == '.') switch (this.len) {
885 default:
886 break;
887 case 2:
888 if (this.name[1] != '.')
889 break;
890 follow_dotdot(nd);
891 inode = nd->path.dentry->d_inode;
892 /* fallthrough */
893 case 1:
894 continue;
897 * See if the low-level filesystem might want
898 * to use its own hash..
900 if (nd->path.dentry->d_op && nd->path.dentry->d_op->d_hash) {
901 err = nd->path.dentry->d_op->d_hash(nd->path.dentry,
902 &this);
903 if (err < 0)
904 break;
906 /* This does the actual lookups.. */
907 err = do_lookup(nd, &this, &next);
908 if (err)
909 break;
911 err = -ENOENT;
912 inode = next.dentry->d_inode;
913 if (!inode)
914 goto out_dput;
916 if (inode->i_op->follow_link) {
917 err = do_follow_link(&next, nd);
918 if (err)
919 goto return_err;
920 err = -ENOENT;
921 inode = nd->path.dentry->d_inode;
922 if (!inode)
923 break;
924 } else
925 path_to_nameidata(&next, nd);
926 err = -ENOTDIR;
927 if (!inode->i_op->lookup)
928 break;
929 continue;
930 /* here ends the main loop */
932 last_with_slashes:
933 lookup_flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY;
934 last_component:
935 /* Clear LOOKUP_CONTINUE iff it was previously unset */
936 nd->flags &= lookup_flags | ~LOOKUP_CONTINUE;
937 if (lookup_flags & LOOKUP_PARENT)
938 goto lookup_parent;
939 if (this.name[0] == '.') switch (this.len) {
940 default:
941 break;
942 case 2:
943 if (this.name[1] != '.')
944 break;
945 follow_dotdot(nd);
946 inode = nd->path.dentry->d_inode;
947 /* fallthrough */
948 case 1:
949 goto return_reval;
951 if (nd->path.dentry->d_op && nd->path.dentry->d_op->d_hash) {
952 err = nd->path.dentry->d_op->d_hash(nd->path.dentry,
953 &this);
954 if (err < 0)
955 break;
957 err = do_lookup(nd, &this, &next);
958 if (err)
959 break;
960 inode = next.dentry->d_inode;
961 if ((lookup_flags & LOOKUP_FOLLOW)
962 && inode && inode->i_op->follow_link) {
963 err = do_follow_link(&next, nd);
964 if (err)
965 goto return_err;
966 inode = nd->path.dentry->d_inode;
967 } else
968 path_to_nameidata(&next, nd);
969 err = -ENOENT;
970 if (!inode)
971 break;
972 if (lookup_flags & LOOKUP_DIRECTORY) {
973 err = -ENOTDIR;
974 if (!inode->i_op->lookup)
975 break;
977 goto return_base;
978 lookup_parent:
979 nd->last = this;
980 nd->last_type = LAST_NORM;
981 if (this.name[0] != '.')
982 goto return_base;
983 if (this.len == 1)
984 nd->last_type = LAST_DOT;
985 else if (this.len == 2 && this.name[1] == '.')
986 nd->last_type = LAST_DOTDOT;
987 else
988 goto return_base;
989 return_reval:
991 * We bypassed the ordinary revalidation routines.
992 * We may need to check the cached dentry for staleness.
994 if (nd->path.dentry && nd->path.dentry->d_sb &&
995 (nd->path.dentry->d_sb->s_type->fs_flags & FS_REVAL_DOT)) {
996 err = -ESTALE;
997 /* Note: we do not d_invalidate() */
998 if (!nd->path.dentry->d_op->d_revalidate(
999 nd->path.dentry, nd))
1000 break;
1002 return_base:
1003 return 0;
1004 out_dput:
1005 path_put_conditional(&next, nd);
1006 break;
1008 path_put(&nd->path);
1009 return_err:
1010 return err;
1013 static int path_walk(const char *name, struct nameidata *nd)
1015 current->total_link_count = 0;
1016 return link_path_walk(name, nd);
1019 /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
1020 static int do_path_lookup(int dfd, const char *name,
1021 unsigned int flags, struct nameidata *nd)
1023 int retval = 0;
1024 int fput_needed;
1025 struct file *file;
1026 struct fs_struct *fs = current->fs;
1028 nd->last_type = LAST_ROOT; /* if there are only slashes... */
1029 nd->flags = flags;
1030 nd->depth = 0;
1032 if (*name=='/') {
1033 read_lock(&fs->lock);
1034 nd->path = fs->root;
1035 path_get(&fs->root);
1036 read_unlock(&fs->lock);
1037 } else if (dfd == AT_FDCWD) {
1038 read_lock(&fs->lock);
1039 nd->path = fs->pwd;
1040 path_get(&fs->pwd);
1041 read_unlock(&fs->lock);
1042 } else {
1043 struct dentry *dentry;
1045 file = fget_light(dfd, &fput_needed);
1046 retval = -EBADF;
1047 if (!file)
1048 goto out_fail;
1050 dentry = file->f_path.dentry;
1052 retval = -ENOTDIR;
1053 if (!S_ISDIR(dentry->d_inode->i_mode))
1054 goto fput_fail;
1056 retval = file_permission(file, MAY_EXEC);
1057 if (retval)
1058 goto fput_fail;
1060 nd->path = file->f_path;
1061 path_get(&file->f_path);
1063 fput_light(file, fput_needed);
1066 retval = path_walk(name, nd);
1067 if (unlikely(!retval && !audit_dummy_context() && nd->path.dentry &&
1068 nd->path.dentry->d_inode))
1069 audit_inode(name, nd->path.dentry);
1070 out_fail:
1071 return retval;
1073 fput_fail:
1074 fput_light(file, fput_needed);
1075 goto out_fail;
1078 int path_lookup(const char *name, unsigned int flags,
1079 struct nameidata *nd)
1081 return do_path_lookup(AT_FDCWD, name, flags, nd);
1084 int kern_path(const char *name, unsigned int flags, struct path *path)
1086 struct nameidata nd;
1087 int res = do_path_lookup(AT_FDCWD, name, flags, &nd);
1088 if (!res)
1089 *path = nd.path;
1090 return res;
1094 * vfs_path_lookup - lookup a file path relative to a dentry-vfsmount pair
1095 * @dentry: pointer to dentry of the base directory
1096 * @mnt: pointer to vfs mount of the base directory
1097 * @name: pointer to file name
1098 * @flags: lookup flags
1099 * @nd: pointer to nameidata
1101 int vfs_path_lookup(struct dentry *dentry, struct vfsmount *mnt,
1102 const char *name, unsigned int flags,
1103 struct nameidata *nd)
1105 int retval;
1107 /* same as do_path_lookup */
1108 nd->last_type = LAST_ROOT;
1109 nd->flags = flags;
1110 nd->depth = 0;
1112 nd->path.dentry = dentry;
1113 nd->path.mnt = mnt;
1114 path_get(&nd->path);
1116 retval = path_walk(name, nd);
1117 if (unlikely(!retval && !audit_dummy_context() && nd->path.dentry &&
1118 nd->path.dentry->d_inode))
1119 audit_inode(name, nd->path.dentry);
1121 return retval;
1126 * path_lookup_open - lookup a file path with open intent
1127 * @dfd: the directory to use as base, or AT_FDCWD
1128 * @name: pointer to file name
1129 * @lookup_flags: lookup intent flags
1130 * @nd: pointer to nameidata
1131 * @open_flags: open intent flags
1133 int path_lookup_open(int dfd, const char *name, unsigned int lookup_flags,
1134 struct nameidata *nd, int open_flags)
1136 struct file *filp = get_empty_filp();
1137 int err;
1139 if (filp == NULL)
1140 return -ENFILE;
1141 nd->intent.open.file = filp;
1142 nd->intent.open.flags = open_flags;
1143 nd->intent.open.create_mode = 0;
1144 err = do_path_lookup(dfd, name, lookup_flags|LOOKUP_OPEN, nd);
1145 if (IS_ERR(nd->intent.open.file)) {
1146 if (err == 0) {
1147 err = PTR_ERR(nd->intent.open.file);
1148 path_put(&nd->path);
1150 } else if (err != 0)
1151 release_open_intent(nd);
1152 return err;
1155 static struct dentry *__lookup_hash(struct qstr *name,
1156 struct dentry *base, struct nameidata *nd)
1158 struct dentry *dentry;
1159 struct inode *inode;
1160 int err;
1162 inode = base->d_inode;
1165 * See if the low-level filesystem might want
1166 * to use its own hash..
1168 if (base->d_op && base->d_op->d_hash) {
1169 err = base->d_op->d_hash(base, name);
1170 dentry = ERR_PTR(err);
1171 if (err < 0)
1172 goto out;
1175 dentry = cached_lookup(base, name, nd);
1176 if (!dentry) {
1177 struct dentry *new;
1179 /* Don't create child dentry for a dead directory. */
1180 dentry = ERR_PTR(-ENOENT);
1181 if (IS_DEADDIR(inode))
1182 goto out;
1184 new = d_alloc(base, name);
1185 dentry = ERR_PTR(-ENOMEM);
1186 if (!new)
1187 goto out;
1188 dentry = inode->i_op->lookup(inode, new, nd);
1189 if (!dentry)
1190 dentry = new;
1191 else
1192 dput(new);
1194 out:
1195 return dentry;
1199 * Restricted form of lookup. Doesn't follow links, single-component only,
1200 * needs parent already locked. Doesn't follow mounts.
1201 * SMP-safe.
1203 static struct dentry *lookup_hash(struct nameidata *nd)
1205 int err;
1207 err = inode_permission(nd->path.dentry->d_inode, MAY_EXEC);
1208 if (err)
1209 return ERR_PTR(err);
1210 return __lookup_hash(&nd->last, nd->path.dentry, nd);
1213 static int __lookup_one_len(const char *name, struct qstr *this,
1214 struct dentry *base, int len)
1216 unsigned long hash;
1217 unsigned int c;
1219 this->name = name;
1220 this->len = len;
1221 if (!len)
1222 return -EACCES;
1224 hash = init_name_hash();
1225 while (len--) {
1226 c = *(const unsigned char *)name++;
1227 if (c == '/' || c == '\0')
1228 return -EACCES;
1229 hash = partial_name_hash(c, hash);
1231 this->hash = end_name_hash(hash);
1232 return 0;
1236 * lookup_one_len - filesystem helper to lookup single pathname component
1237 * @name: pathname component to lookup
1238 * @base: base directory to lookup from
1239 * @len: maximum length @len should be interpreted to
1241 * Note that this routine is purely a helper for filesystem usage and should
1242 * not be called by generic code. Also note that by using this function the
1243 * nameidata argument is passed to the filesystem methods and a filesystem
1244 * using this helper needs to be prepared for that.
1246 struct dentry *lookup_one_len(const char *name, struct dentry *base, int len)
1248 int err;
1249 struct qstr this;
1251 err = __lookup_one_len(name, &this, base, len);
1252 if (err)
1253 return ERR_PTR(err);
1255 err = inode_permission(base->d_inode, MAY_EXEC);
1256 if (err)
1257 return ERR_PTR(err);
1258 return __lookup_hash(&this, base, NULL);
1262 * lookup_one_noperm - bad hack for sysfs
1263 * @name: pathname component to lookup
1264 * @base: base directory to lookup from
1266 * This is a variant of lookup_one_len that doesn't perform any permission
1267 * checks. It's a horrible hack to work around the braindead sysfs
1268 * architecture and should not be used anywhere else.
1270 * DON'T USE THIS FUNCTION EVER, thanks.
1272 struct dentry *lookup_one_noperm(const char *name, struct dentry *base)
1274 int err;
1275 struct qstr this;
1277 err = __lookup_one_len(name, &this, base, strlen(name));
1278 if (err)
1279 return ERR_PTR(err);
1280 return __lookup_hash(&this, base, NULL);
1283 int user_path_at(int dfd, const char __user *name, unsigned flags,
1284 struct path *path)
1286 struct nameidata nd;
1287 char *tmp = getname(name);
1288 int err = PTR_ERR(tmp);
1289 if (!IS_ERR(tmp)) {
1291 BUG_ON(flags & LOOKUP_PARENT);
1293 err = do_path_lookup(dfd, tmp, flags, &nd);
1294 putname(tmp);
1295 if (!err)
1296 *path = nd.path;
1298 return err;
1301 static int user_path_parent(int dfd, const char __user *path,
1302 struct nameidata *nd, char **name)
1304 char *s = getname(path);
1305 int error;
1307 if (IS_ERR(s))
1308 return PTR_ERR(s);
1310 error = do_path_lookup(dfd, s, LOOKUP_PARENT, nd);
1311 if (error)
1312 putname(s);
1313 else
1314 *name = s;
1316 return error;
1320 * It's inline, so penalty for filesystems that don't use sticky bit is
1321 * minimal.
1323 static inline int check_sticky(struct inode *dir, struct inode *inode)
1325 uid_t fsuid = current_fsuid();
1327 if (!(dir->i_mode & S_ISVTX))
1328 return 0;
1329 if (inode->i_uid == fsuid)
1330 return 0;
1331 if (dir->i_uid == fsuid)
1332 return 0;
1333 return !capable(CAP_FOWNER);
1337 * Check whether we can remove a link victim from directory dir, check
1338 * whether the type of victim is right.
1339 * 1. We can't do it if dir is read-only (done in permission())
1340 * 2. We should have write and exec permissions on dir
1341 * 3. We can't remove anything from append-only dir
1342 * 4. We can't do anything with immutable dir (done in permission())
1343 * 5. If the sticky bit on dir is set we should either
1344 * a. be owner of dir, or
1345 * b. be owner of victim, or
1346 * c. have CAP_FOWNER capability
1347 * 6. If the victim is append-only or immutable we can't do antyhing with
1348 * links pointing to it.
1349 * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR.
1350 * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR.
1351 * 9. We can't remove a root or mountpoint.
1352 * 10. We don't allow removal of NFS sillyrenamed files; it's handled by
1353 * nfs_async_unlink().
1355 static int may_delete(struct inode *dir,struct dentry *victim,int isdir)
1357 int error;
1359 if (!victim->d_inode)
1360 return -ENOENT;
1362 BUG_ON(victim->d_parent->d_inode != dir);
1363 audit_inode_child(victim->d_name.name, victim, dir);
1365 error = inode_permission(dir, MAY_WRITE | MAY_EXEC);
1366 if (error)
1367 return error;
1368 if (IS_APPEND(dir))
1369 return -EPERM;
1370 if (check_sticky(dir, victim->d_inode)||IS_APPEND(victim->d_inode)||
1371 IS_IMMUTABLE(victim->d_inode) || IS_SWAPFILE(victim->d_inode))
1372 return -EPERM;
1373 if (isdir) {
1374 if (!S_ISDIR(victim->d_inode->i_mode))
1375 return -ENOTDIR;
1376 if (IS_ROOT(victim))
1377 return -EBUSY;
1378 } else if (S_ISDIR(victim->d_inode->i_mode))
1379 return -EISDIR;
1380 if (IS_DEADDIR(dir))
1381 return -ENOENT;
1382 if (victim->d_flags & DCACHE_NFSFS_RENAMED)
1383 return -EBUSY;
1384 return 0;
1387 /* Check whether we can create an object with dentry child in directory
1388 * dir.
1389 * 1. We can't do it if child already exists (open has special treatment for
1390 * this case, but since we are inlined it's OK)
1391 * 2. We can't do it if dir is read-only (done in permission())
1392 * 3. We should have write and exec permissions on dir
1393 * 4. We can't do it if dir is immutable (done in permission())
1395 static inline int may_create(struct inode *dir, struct dentry *child)
1397 if (child->d_inode)
1398 return -EEXIST;
1399 if (IS_DEADDIR(dir))
1400 return -ENOENT;
1401 return inode_permission(dir, MAY_WRITE | MAY_EXEC);
1405 * O_DIRECTORY translates into forcing a directory lookup.
1407 static inline int lookup_flags(unsigned int f)
1409 unsigned long retval = LOOKUP_FOLLOW;
1411 if (f & O_NOFOLLOW)
1412 retval &= ~LOOKUP_FOLLOW;
1414 if (f & O_DIRECTORY)
1415 retval |= LOOKUP_DIRECTORY;
1417 return retval;
1421 * p1 and p2 should be directories on the same fs.
1423 struct dentry *lock_rename(struct dentry *p1, struct dentry *p2)
1425 struct dentry *p;
1427 if (p1 == p2) {
1428 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1429 return NULL;
1432 mutex_lock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1434 p = d_ancestor(p2, p1);
1435 if (p) {
1436 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_PARENT);
1437 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_CHILD);
1438 return p;
1441 p = d_ancestor(p1, p2);
1442 if (p) {
1443 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1444 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1445 return p;
1448 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1449 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1450 return NULL;
1453 void unlock_rename(struct dentry *p1, struct dentry *p2)
1455 mutex_unlock(&p1->d_inode->i_mutex);
1456 if (p1 != p2) {
1457 mutex_unlock(&p2->d_inode->i_mutex);
1458 mutex_unlock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1462 int vfs_create(struct inode *dir, struct dentry *dentry, int mode,
1463 struct nameidata *nd)
1465 int error = may_create(dir, dentry);
1467 if (error)
1468 return error;
1470 if (!dir->i_op->create)
1471 return -EACCES; /* shouldn't it be ENOSYS? */
1472 mode &= S_IALLUGO;
1473 mode |= S_IFREG;
1474 error = security_inode_create(dir, dentry, mode);
1475 if (error)
1476 return error;
1477 vfs_dq_init(dir);
1478 error = dir->i_op->create(dir, dentry, mode, nd);
1479 if (!error)
1480 fsnotify_create(dir, dentry);
1481 return error;
1484 int may_open(struct path *path, int acc_mode, int flag)
1486 struct dentry *dentry = path->dentry;
1487 struct inode *inode = dentry->d_inode;
1488 int error;
1490 if (!inode)
1491 return -ENOENT;
1493 switch (inode->i_mode & S_IFMT) {
1494 case S_IFLNK:
1495 return -ELOOP;
1496 case S_IFDIR:
1497 if (acc_mode & MAY_WRITE)
1498 return -EISDIR;
1499 break;
1500 case S_IFBLK:
1501 case S_IFCHR:
1502 if (path->mnt->mnt_flags & MNT_NODEV)
1503 return -EACCES;
1504 /*FALLTHRU*/
1505 case S_IFIFO:
1506 case S_IFSOCK:
1507 flag &= ~O_TRUNC;
1508 break;
1511 error = inode_permission(inode, acc_mode);
1512 if (error)
1513 return error;
1515 error = ima_path_check(path,
1516 acc_mode & (MAY_READ | MAY_WRITE | MAY_EXEC));
1517 if (error)
1518 return error;
1520 * An append-only file must be opened in append mode for writing.
1522 if (IS_APPEND(inode)) {
1523 if ((flag & FMODE_WRITE) && !(flag & O_APPEND))
1524 return -EPERM;
1525 if (flag & O_TRUNC)
1526 return -EPERM;
1529 /* O_NOATIME can only be set by the owner or superuser */
1530 if (flag & O_NOATIME)
1531 if (!is_owner_or_cap(inode))
1532 return -EPERM;
1535 * Ensure there are no outstanding leases on the file.
1537 error = break_lease(inode, flag);
1538 if (error)
1539 return error;
1541 if (flag & O_TRUNC) {
1542 error = get_write_access(inode);
1543 if (error)
1544 return error;
1547 * Refuse to truncate files with mandatory locks held on them.
1549 error = locks_verify_locked(inode);
1550 if (!error)
1551 error = security_path_truncate(path, 0,
1552 ATTR_MTIME|ATTR_CTIME|ATTR_OPEN);
1553 if (!error) {
1554 vfs_dq_init(inode);
1556 error = do_truncate(dentry, 0,
1557 ATTR_MTIME|ATTR_CTIME|ATTR_OPEN,
1558 NULL);
1560 put_write_access(inode);
1561 if (error)
1562 return error;
1563 } else
1564 if (flag & FMODE_WRITE)
1565 vfs_dq_init(inode);
1567 return 0;
1571 * Be careful about ever adding any more callers of this
1572 * function. Its flags must be in the namei format, not
1573 * what get passed to sys_open().
1575 static int __open_namei_create(struct nameidata *nd, struct path *path,
1576 int flag, int mode)
1578 int error;
1579 struct dentry *dir = nd->path.dentry;
1581 if (!IS_POSIXACL(dir->d_inode))
1582 mode &= ~current_umask();
1583 error = security_path_mknod(&nd->path, path->dentry, mode, 0);
1584 if (error)
1585 goto out_unlock;
1586 error = vfs_create(dir->d_inode, path->dentry, mode, nd);
1587 out_unlock:
1588 mutex_unlock(&dir->d_inode->i_mutex);
1589 dput(nd->path.dentry);
1590 nd->path.dentry = path->dentry;
1591 if (error)
1592 return error;
1593 /* Don't check for write permission, don't truncate */
1594 return may_open(&nd->path, 0, flag & ~O_TRUNC);
1598 * Note that while the flag value (low two bits) for sys_open means:
1599 * 00 - read-only
1600 * 01 - write-only
1601 * 10 - read-write
1602 * 11 - special
1603 * it is changed into
1604 * 00 - no permissions needed
1605 * 01 - read-permission
1606 * 10 - write-permission
1607 * 11 - read-write
1608 * for the internal routines (ie open_namei()/follow_link() etc)
1609 * This is more logical, and also allows the 00 "no perm needed"
1610 * to be used for symlinks (where the permissions are checked
1611 * later).
1614 static inline int open_to_namei_flags(int flag)
1616 if ((flag+1) & O_ACCMODE)
1617 flag++;
1618 return flag;
1621 static int open_will_write_to_fs(int flag, struct inode *inode)
1624 * We'll never write to the fs underlying
1625 * a device file.
1627 if (special_file(inode->i_mode))
1628 return 0;
1629 return (flag & O_TRUNC);
1633 * Note that the low bits of the passed in "open_flag"
1634 * are not the same as in the local variable "flag". See
1635 * open_to_namei_flags() for more details.
1637 struct file *do_filp_open(int dfd, const char *pathname,
1638 int open_flag, int mode)
1640 struct file *filp;
1641 struct nameidata nd;
1642 int acc_mode, error;
1643 struct path path;
1644 struct dentry *dir;
1645 int count = 0;
1646 int will_write;
1647 int flag = open_to_namei_flags(open_flag);
1649 acc_mode = MAY_OPEN | ACC_MODE(flag);
1651 /* O_TRUNC implies we need access checks for write permissions */
1652 if (flag & O_TRUNC)
1653 acc_mode |= MAY_WRITE;
1655 /* Allow the LSM permission hook to distinguish append
1656 access from general write access. */
1657 if (flag & O_APPEND)
1658 acc_mode |= MAY_APPEND;
1661 * The simplest case - just a plain lookup.
1663 if (!(flag & O_CREAT)) {
1664 error = path_lookup_open(dfd, pathname, lookup_flags(flag),
1665 &nd, flag);
1666 if (error)
1667 return ERR_PTR(error);
1668 goto ok;
1672 * Create - we need to know the parent.
1674 error = do_path_lookup(dfd, pathname, LOOKUP_PARENT, &nd);
1675 if (error)
1676 return ERR_PTR(error);
1679 * We have the parent and last component. First of all, check
1680 * that we are not asked to creat(2) an obvious directory - that
1681 * will not do.
1683 error = -EISDIR;
1684 if (nd.last_type != LAST_NORM || nd.last.name[nd.last.len])
1685 goto exit_parent;
1687 error = -ENFILE;
1688 filp = get_empty_filp();
1689 if (filp == NULL)
1690 goto exit_parent;
1691 nd.intent.open.file = filp;
1692 nd.intent.open.flags = flag;
1693 nd.intent.open.create_mode = mode;
1694 dir = nd.path.dentry;
1695 nd.flags &= ~LOOKUP_PARENT;
1696 nd.flags |= LOOKUP_CREATE | LOOKUP_OPEN;
1697 if (flag & O_EXCL)
1698 nd.flags |= LOOKUP_EXCL;
1699 mutex_lock(&dir->d_inode->i_mutex);
1700 path.dentry = lookup_hash(&nd);
1701 path.mnt = nd.path.mnt;
1703 do_last:
1704 error = PTR_ERR(path.dentry);
1705 if (IS_ERR(path.dentry)) {
1706 mutex_unlock(&dir->d_inode->i_mutex);
1707 goto exit;
1710 if (IS_ERR(nd.intent.open.file)) {
1711 error = PTR_ERR(nd.intent.open.file);
1712 goto exit_mutex_unlock;
1715 /* Negative dentry, just create the file */
1716 if (!path.dentry->d_inode) {
1718 * This write is needed to ensure that a
1719 * ro->rw transition does not occur between
1720 * the time when the file is created and when
1721 * a permanent write count is taken through
1722 * the 'struct file' in nameidata_to_filp().
1724 error = mnt_want_write(nd.path.mnt);
1725 if (error)
1726 goto exit_mutex_unlock;
1727 error = __open_namei_create(&nd, &path, flag, mode);
1728 if (error) {
1729 mnt_drop_write(nd.path.mnt);
1730 goto exit;
1732 filp = nameidata_to_filp(&nd, open_flag);
1733 mnt_drop_write(nd.path.mnt);
1734 return filp;
1738 * It already exists.
1740 mutex_unlock(&dir->d_inode->i_mutex);
1741 audit_inode(pathname, path.dentry);
1743 error = -EEXIST;
1744 if (flag & O_EXCL)
1745 goto exit_dput;
1747 if (__follow_mount(&path)) {
1748 error = -ELOOP;
1749 if (flag & O_NOFOLLOW)
1750 goto exit_dput;
1753 error = -ENOENT;
1754 if (!path.dentry->d_inode)
1755 goto exit_dput;
1756 if (path.dentry->d_inode->i_op->follow_link)
1757 goto do_link;
1759 path_to_nameidata(&path, &nd);
1760 error = -EISDIR;
1761 if (path.dentry->d_inode && S_ISDIR(path.dentry->d_inode->i_mode))
1762 goto exit;
1765 * Consider:
1766 * 1. may_open() truncates a file
1767 * 2. a rw->ro mount transition occurs
1768 * 3. nameidata_to_filp() fails due to
1769 * the ro mount.
1770 * That would be inconsistent, and should
1771 * be avoided. Taking this mnt write here
1772 * ensures that (2) can not occur.
1774 will_write = open_will_write_to_fs(flag, nd.path.dentry->d_inode);
1775 if (will_write) {
1776 error = mnt_want_write(nd.path.mnt);
1777 if (error)
1778 goto exit;
1780 error = may_open(&nd.path, acc_mode, flag);
1781 if (error) {
1782 if (will_write)
1783 mnt_drop_write(nd.path.mnt);
1784 goto exit;
1786 filp = nameidata_to_filp(&nd, open_flag);
1788 * It is now safe to drop the mnt write
1789 * because the filp has had a write taken
1790 * on its behalf.
1792 if (will_write)
1793 mnt_drop_write(nd.path.mnt);
1794 return filp;
1796 exit_mutex_unlock:
1797 mutex_unlock(&dir->d_inode->i_mutex);
1798 exit_dput:
1799 path_put_conditional(&path, &nd);
1800 exit:
1801 if (!IS_ERR(nd.intent.open.file))
1802 release_open_intent(&nd);
1803 exit_parent:
1804 path_put(&nd.path);
1805 return ERR_PTR(error);
1807 do_link:
1808 error = -ELOOP;
1809 if (flag & O_NOFOLLOW)
1810 goto exit_dput;
1812 * This is subtle. Instead of calling do_follow_link() we do the
1813 * thing by hands. The reason is that this way we have zero link_count
1814 * and path_walk() (called from ->follow_link) honoring LOOKUP_PARENT.
1815 * After that we have the parent and last component, i.e.
1816 * we are in the same situation as after the first path_walk().
1817 * Well, almost - if the last component is normal we get its copy
1818 * stored in nd->last.name and we will have to putname() it when we
1819 * are done. Procfs-like symlinks just set LAST_BIND.
1821 nd.flags |= LOOKUP_PARENT;
1822 error = security_inode_follow_link(path.dentry, &nd);
1823 if (error)
1824 goto exit_dput;
1825 error = __do_follow_link(&path, &nd);
1826 if (error) {
1827 /* Does someone understand code flow here? Or it is only
1828 * me so stupid? Anathema to whoever designed this non-sense
1829 * with "intent.open".
1831 release_open_intent(&nd);
1832 return ERR_PTR(error);
1834 nd.flags &= ~LOOKUP_PARENT;
1835 if (nd.last_type == LAST_BIND)
1836 goto ok;
1837 error = -EISDIR;
1838 if (nd.last_type != LAST_NORM)
1839 goto exit;
1840 if (nd.last.name[nd.last.len]) {
1841 __putname(nd.last.name);
1842 goto exit;
1844 error = -ELOOP;
1845 if (count++==32) {
1846 __putname(nd.last.name);
1847 goto exit;
1849 dir = nd.path.dentry;
1850 mutex_lock(&dir->d_inode->i_mutex);
1851 path.dentry = lookup_hash(&nd);
1852 path.mnt = nd.path.mnt;
1853 __putname(nd.last.name);
1854 goto do_last;
1858 * filp_open - open file and return file pointer
1860 * @filename: path to open
1861 * @flags: open flags as per the open(2) second argument
1862 * @mode: mode for the new file if O_CREAT is set, else ignored
1864 * This is the helper to open a file from kernelspace if you really
1865 * have to. But in generally you should not do this, so please move
1866 * along, nothing to see here..
1868 struct file *filp_open(const char *filename, int flags, int mode)
1870 return do_filp_open(AT_FDCWD, filename, flags, mode);
1872 EXPORT_SYMBOL(filp_open);
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 | LOOKUP_EXCL;
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;
1906 if (dentry->d_inode)
1907 goto eexist;
1909 * Special case - lookup gave negative, but... we had foo/bar/
1910 * From the vfs_mknod() POV we just have a negative dentry -
1911 * all is fine. Let's be bastards - you had / on the end, you've
1912 * been asking for (non-existent) directory. -ENOENT for you.
1914 if (unlikely(!is_dir && nd->last.name[nd->last.len])) {
1915 dput(dentry);
1916 dentry = ERR_PTR(-ENOENT);
1918 return dentry;
1919 eexist:
1920 dput(dentry);
1921 dentry = ERR_PTR(-EEXIST);
1922 fail:
1923 return dentry;
1925 EXPORT_SYMBOL_GPL(lookup_create);
1927 int vfs_mknod(struct inode *dir, struct dentry *dentry, int mode, dev_t dev)
1929 int error = may_create(dir, dentry);
1931 if (error)
1932 return error;
1934 if ((S_ISCHR(mode) || S_ISBLK(mode)) && !capable(CAP_MKNOD))
1935 return -EPERM;
1937 if (!dir->i_op->mknod)
1938 return -EPERM;
1940 error = devcgroup_inode_mknod(mode, dev);
1941 if (error)
1942 return error;
1944 error = security_inode_mknod(dir, dentry, mode, dev);
1945 if (error)
1946 return error;
1948 vfs_dq_init(dir);
1949 error = dir->i_op->mknod(dir, dentry, mode, dev);
1950 if (!error)
1951 fsnotify_create(dir, dentry);
1952 return error;
1955 static int may_mknod(mode_t mode)
1957 switch (mode & S_IFMT) {
1958 case S_IFREG:
1959 case S_IFCHR:
1960 case S_IFBLK:
1961 case S_IFIFO:
1962 case S_IFSOCK:
1963 case 0: /* zero mode translates to S_IFREG */
1964 return 0;
1965 case S_IFDIR:
1966 return -EPERM;
1967 default:
1968 return -EINVAL;
1972 SYSCALL_DEFINE4(mknodat, int, dfd, const char __user *, filename, int, mode,
1973 unsigned, dev)
1975 int error;
1976 char *tmp;
1977 struct dentry *dentry;
1978 struct nameidata nd;
1980 if (S_ISDIR(mode))
1981 return -EPERM;
1983 error = user_path_parent(dfd, filename, &nd, &tmp);
1984 if (error)
1985 return error;
1987 dentry = lookup_create(&nd, 0);
1988 if (IS_ERR(dentry)) {
1989 error = PTR_ERR(dentry);
1990 goto out_unlock;
1992 if (!IS_POSIXACL(nd.path.dentry->d_inode))
1993 mode &= ~current_umask();
1994 error = may_mknod(mode);
1995 if (error)
1996 goto out_dput;
1997 error = mnt_want_write(nd.path.mnt);
1998 if (error)
1999 goto out_dput;
2000 error = security_path_mknod(&nd.path, dentry, mode, dev);
2001 if (error)
2002 goto out_drop_write;
2003 switch (mode & S_IFMT) {
2004 case 0: case S_IFREG:
2005 error = vfs_create(nd.path.dentry->d_inode,dentry,mode,&nd);
2006 break;
2007 case S_IFCHR: case S_IFBLK:
2008 error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode,
2009 new_decode_dev(dev));
2010 break;
2011 case S_IFIFO: case S_IFSOCK:
2012 error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode,0);
2013 break;
2015 out_drop_write:
2016 mnt_drop_write(nd.path.mnt);
2017 out_dput:
2018 dput(dentry);
2019 out_unlock:
2020 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2021 path_put(&nd.path);
2022 putname(tmp);
2024 return error;
2027 SYSCALL_DEFINE3(mknod, const char __user *, filename, int, mode, unsigned, dev)
2029 return sys_mknodat(AT_FDCWD, filename, mode, dev);
2032 int vfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
2034 int error = may_create(dir, dentry);
2036 if (error)
2037 return error;
2039 if (!dir->i_op->mkdir)
2040 return -EPERM;
2042 mode &= (S_IRWXUGO|S_ISVTX);
2043 error = security_inode_mkdir(dir, dentry, mode);
2044 if (error)
2045 return error;
2047 vfs_dq_init(dir);
2048 error = dir->i_op->mkdir(dir, dentry, mode);
2049 if (!error)
2050 fsnotify_mkdir(dir, dentry);
2051 return error;
2054 SYSCALL_DEFINE3(mkdirat, int, dfd, const char __user *, pathname, int, mode)
2056 int error = 0;
2057 char * tmp;
2058 struct dentry *dentry;
2059 struct nameidata nd;
2061 error = user_path_parent(dfd, pathname, &nd, &tmp);
2062 if (error)
2063 goto out_err;
2065 dentry = lookup_create(&nd, 1);
2066 error = PTR_ERR(dentry);
2067 if (IS_ERR(dentry))
2068 goto out_unlock;
2070 if (!IS_POSIXACL(nd.path.dentry->d_inode))
2071 mode &= ~current_umask();
2072 error = mnt_want_write(nd.path.mnt);
2073 if (error)
2074 goto out_dput;
2075 error = security_path_mkdir(&nd.path, dentry, mode);
2076 if (error)
2077 goto out_drop_write;
2078 error = vfs_mkdir(nd.path.dentry->d_inode, dentry, mode);
2079 out_drop_write:
2080 mnt_drop_write(nd.path.mnt);
2081 out_dput:
2082 dput(dentry);
2083 out_unlock:
2084 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2085 path_put(&nd.path);
2086 putname(tmp);
2087 out_err:
2088 return error;
2091 SYSCALL_DEFINE2(mkdir, const char __user *, pathname, int, mode)
2093 return sys_mkdirat(AT_FDCWD, pathname, mode);
2097 * We try to drop the dentry early: we should have
2098 * a usage count of 2 if we're the only user of this
2099 * dentry, and if that is true (possibly after pruning
2100 * the dcache), then we drop the dentry now.
2102 * A low-level filesystem can, if it choses, legally
2103 * do a
2105 * if (!d_unhashed(dentry))
2106 * return -EBUSY;
2108 * if it cannot handle the case of removing a directory
2109 * that is still in use by something else..
2111 void dentry_unhash(struct dentry *dentry)
2113 dget(dentry);
2114 shrink_dcache_parent(dentry);
2115 spin_lock(&dcache_lock);
2116 spin_lock(&dentry->d_lock);
2117 if (atomic_read(&dentry->d_count) == 2)
2118 __d_drop(dentry);
2119 spin_unlock(&dentry->d_lock);
2120 spin_unlock(&dcache_lock);
2123 int vfs_rmdir(struct inode *dir, struct dentry *dentry)
2125 int error = may_delete(dir, dentry, 1);
2127 if (error)
2128 return error;
2130 if (!dir->i_op->rmdir)
2131 return -EPERM;
2133 vfs_dq_init(dir);
2135 mutex_lock(&dentry->d_inode->i_mutex);
2136 dentry_unhash(dentry);
2137 if (d_mountpoint(dentry))
2138 error = -EBUSY;
2139 else {
2140 error = security_inode_rmdir(dir, dentry);
2141 if (!error) {
2142 error = dir->i_op->rmdir(dir, dentry);
2143 if (!error)
2144 dentry->d_inode->i_flags |= S_DEAD;
2147 mutex_unlock(&dentry->d_inode->i_mutex);
2148 if (!error) {
2149 d_delete(dentry);
2151 dput(dentry);
2153 return error;
2156 static long do_rmdir(int dfd, const char __user *pathname)
2158 int error = 0;
2159 char * name;
2160 struct dentry *dentry;
2161 struct nameidata nd;
2163 error = user_path_parent(dfd, pathname, &nd, &name);
2164 if (error)
2165 return error;
2167 switch(nd.last_type) {
2168 case LAST_DOTDOT:
2169 error = -ENOTEMPTY;
2170 goto exit1;
2171 case LAST_DOT:
2172 error = -EINVAL;
2173 goto exit1;
2174 case LAST_ROOT:
2175 error = -EBUSY;
2176 goto exit1;
2179 nd.flags &= ~LOOKUP_PARENT;
2181 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2182 dentry = lookup_hash(&nd);
2183 error = PTR_ERR(dentry);
2184 if (IS_ERR(dentry))
2185 goto exit2;
2186 error = mnt_want_write(nd.path.mnt);
2187 if (error)
2188 goto exit3;
2189 error = security_path_rmdir(&nd.path, dentry);
2190 if (error)
2191 goto exit4;
2192 error = vfs_rmdir(nd.path.dentry->d_inode, dentry);
2193 exit4:
2194 mnt_drop_write(nd.path.mnt);
2195 exit3:
2196 dput(dentry);
2197 exit2:
2198 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2199 exit1:
2200 path_put(&nd.path);
2201 putname(name);
2202 return error;
2205 SYSCALL_DEFINE1(rmdir, const char __user *, pathname)
2207 return do_rmdir(AT_FDCWD, pathname);
2210 int vfs_unlink(struct inode *dir, struct dentry *dentry)
2212 int error = may_delete(dir, dentry, 0);
2214 if (error)
2215 return error;
2217 if (!dir->i_op->unlink)
2218 return -EPERM;
2220 vfs_dq_init(dir);
2222 mutex_lock(&dentry->d_inode->i_mutex);
2223 if (d_mountpoint(dentry))
2224 error = -EBUSY;
2225 else {
2226 error = security_inode_unlink(dir, dentry);
2227 if (!error)
2228 error = dir->i_op->unlink(dir, dentry);
2230 mutex_unlock(&dentry->d_inode->i_mutex);
2232 /* We don't d_delete() NFS sillyrenamed files--they still exist. */
2233 if (!error && !(dentry->d_flags & DCACHE_NFSFS_RENAMED)) {
2234 fsnotify_link_count(dentry->d_inode);
2235 d_delete(dentry);
2238 return error;
2242 * Make sure that the actual truncation of the file will occur outside its
2243 * directory's i_mutex. Truncate can take a long time if there is a lot of
2244 * writeout happening, and we don't want to prevent access to the directory
2245 * while waiting on the I/O.
2247 static long do_unlinkat(int dfd, const char __user *pathname)
2249 int error;
2250 char *name;
2251 struct dentry *dentry;
2252 struct nameidata nd;
2253 struct inode *inode = NULL;
2255 error = user_path_parent(dfd, pathname, &nd, &name);
2256 if (error)
2257 return error;
2259 error = -EISDIR;
2260 if (nd.last_type != LAST_NORM)
2261 goto exit1;
2263 nd.flags &= ~LOOKUP_PARENT;
2265 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2266 dentry = lookup_hash(&nd);
2267 error = PTR_ERR(dentry);
2268 if (!IS_ERR(dentry)) {
2269 /* Why not before? Because we want correct error value */
2270 if (nd.last.name[nd.last.len])
2271 goto slashes;
2272 inode = dentry->d_inode;
2273 if (inode)
2274 atomic_inc(&inode->i_count);
2275 error = mnt_want_write(nd.path.mnt);
2276 if (error)
2277 goto exit2;
2278 error = security_path_unlink(&nd.path, dentry);
2279 if (error)
2280 goto exit3;
2281 error = vfs_unlink(nd.path.dentry->d_inode, dentry);
2282 exit3:
2283 mnt_drop_write(nd.path.mnt);
2284 exit2:
2285 dput(dentry);
2287 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2288 if (inode)
2289 iput(inode); /* truncate the inode here */
2290 exit1:
2291 path_put(&nd.path);
2292 putname(name);
2293 return error;
2295 slashes:
2296 error = !dentry->d_inode ? -ENOENT :
2297 S_ISDIR(dentry->d_inode->i_mode) ? -EISDIR : -ENOTDIR;
2298 goto exit2;
2301 SYSCALL_DEFINE3(unlinkat, int, dfd, const char __user *, pathname, int, flag)
2303 if ((flag & ~AT_REMOVEDIR) != 0)
2304 return -EINVAL;
2306 if (flag & AT_REMOVEDIR)
2307 return do_rmdir(dfd, pathname);
2309 return do_unlinkat(dfd, pathname);
2312 SYSCALL_DEFINE1(unlink, const char __user *, pathname)
2314 return do_unlinkat(AT_FDCWD, pathname);
2317 int vfs_symlink(struct inode *dir, struct dentry *dentry, const char *oldname)
2319 int error = may_create(dir, dentry);
2321 if (error)
2322 return error;
2324 if (!dir->i_op->symlink)
2325 return -EPERM;
2327 error = security_inode_symlink(dir, dentry, oldname);
2328 if (error)
2329 return error;
2331 vfs_dq_init(dir);
2332 error = dir->i_op->symlink(dir, dentry, oldname);
2333 if (!error)
2334 fsnotify_create(dir, dentry);
2335 return error;
2338 SYSCALL_DEFINE3(symlinkat, const char __user *, oldname,
2339 int, newdfd, const char __user *, newname)
2341 int error;
2342 char *from;
2343 char *to;
2344 struct dentry *dentry;
2345 struct nameidata nd;
2347 from = getname(oldname);
2348 if (IS_ERR(from))
2349 return PTR_ERR(from);
2351 error = user_path_parent(newdfd, newname, &nd, &to);
2352 if (error)
2353 goto out_putname;
2355 dentry = lookup_create(&nd, 0);
2356 error = PTR_ERR(dentry);
2357 if (IS_ERR(dentry))
2358 goto out_unlock;
2360 error = mnt_want_write(nd.path.mnt);
2361 if (error)
2362 goto out_dput;
2363 error = security_path_symlink(&nd.path, dentry, from);
2364 if (error)
2365 goto out_drop_write;
2366 error = vfs_symlink(nd.path.dentry->d_inode, dentry, from);
2367 out_drop_write:
2368 mnt_drop_write(nd.path.mnt);
2369 out_dput:
2370 dput(dentry);
2371 out_unlock:
2372 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2373 path_put(&nd.path);
2374 putname(to);
2375 out_putname:
2376 putname(from);
2377 return error;
2380 SYSCALL_DEFINE2(symlink, const char __user *, oldname, const char __user *, newname)
2382 return sys_symlinkat(oldname, AT_FDCWD, newname);
2385 int vfs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *new_dentry)
2387 struct inode *inode = old_dentry->d_inode;
2388 int error;
2390 if (!inode)
2391 return -ENOENT;
2393 error = may_create(dir, new_dentry);
2394 if (error)
2395 return error;
2397 if (dir->i_sb != inode->i_sb)
2398 return -EXDEV;
2401 * A link to an append-only or immutable file cannot be created.
2403 if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
2404 return -EPERM;
2405 if (!dir->i_op->link)
2406 return -EPERM;
2407 if (S_ISDIR(inode->i_mode))
2408 return -EPERM;
2410 error = security_inode_link(old_dentry, dir, new_dentry);
2411 if (error)
2412 return error;
2414 mutex_lock(&inode->i_mutex);
2415 vfs_dq_init(dir);
2416 error = dir->i_op->link(old_dentry, dir, new_dentry);
2417 mutex_unlock(&inode->i_mutex);
2418 if (!error)
2419 fsnotify_link(dir, inode, new_dentry);
2420 return error;
2424 * Hardlinks are often used in delicate situations. We avoid
2425 * security-related surprises by not following symlinks on the
2426 * newname. --KAB
2428 * We don't follow them on the oldname either to be compatible
2429 * with linux 2.0, and to avoid hard-linking to directories
2430 * and other special files. --ADM
2432 SYSCALL_DEFINE5(linkat, int, olddfd, const char __user *, oldname,
2433 int, newdfd, const char __user *, newname, int, flags)
2435 struct dentry *new_dentry;
2436 struct nameidata nd;
2437 struct path old_path;
2438 int error;
2439 char *to;
2441 if ((flags & ~AT_SYMLINK_FOLLOW) != 0)
2442 return -EINVAL;
2444 error = user_path_at(olddfd, oldname,
2445 flags & AT_SYMLINK_FOLLOW ? LOOKUP_FOLLOW : 0,
2446 &old_path);
2447 if (error)
2448 return error;
2450 error = user_path_parent(newdfd, newname, &nd, &to);
2451 if (error)
2452 goto out;
2453 error = -EXDEV;
2454 if (old_path.mnt != nd.path.mnt)
2455 goto out_release;
2456 new_dentry = lookup_create(&nd, 0);
2457 error = PTR_ERR(new_dentry);
2458 if (IS_ERR(new_dentry))
2459 goto out_unlock;
2460 error = mnt_want_write(nd.path.mnt);
2461 if (error)
2462 goto out_dput;
2463 error = security_path_link(old_path.dentry, &nd.path, new_dentry);
2464 if (error)
2465 goto out_drop_write;
2466 error = vfs_link(old_path.dentry, nd.path.dentry->d_inode, new_dentry);
2467 out_drop_write:
2468 mnt_drop_write(nd.path.mnt);
2469 out_dput:
2470 dput(new_dentry);
2471 out_unlock:
2472 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2473 out_release:
2474 path_put(&nd.path);
2475 putname(to);
2476 out:
2477 path_put(&old_path);
2479 return error;
2482 SYSCALL_DEFINE2(link, const char __user *, oldname, const char __user *, newname)
2484 return sys_linkat(AT_FDCWD, oldname, AT_FDCWD, newname, 0);
2488 * The worst of all namespace operations - renaming directory. "Perverted"
2489 * doesn't even start to describe it. Somebody in UCB had a heck of a trip...
2490 * Problems:
2491 * a) we can get into loop creation. Check is done in is_subdir().
2492 * b) race potential - two innocent renames can create a loop together.
2493 * That's where 4.4 screws up. Current fix: serialization on
2494 * sb->s_vfs_rename_mutex. We might be more accurate, but that's another
2495 * story.
2496 * c) we have to lock _three_ objects - parents and victim (if it exists).
2497 * And that - after we got ->i_mutex on parents (until then we don't know
2498 * whether the target exists). Solution: try to be smart with locking
2499 * order for inodes. We rely on the fact that tree topology may change
2500 * only under ->s_vfs_rename_mutex _and_ that parent of the object we
2501 * move will be locked. Thus we can rank directories by the tree
2502 * (ancestors first) and rank all non-directories after them.
2503 * That works since everybody except rename does "lock parent, lookup,
2504 * lock child" and rename is under ->s_vfs_rename_mutex.
2505 * HOWEVER, it relies on the assumption that any object with ->lookup()
2506 * has no more than 1 dentry. If "hybrid" objects will ever appear,
2507 * we'd better make sure that there's no link(2) for them.
2508 * d) some filesystems don't support opened-but-unlinked directories,
2509 * either because of layout or because they are not ready to deal with
2510 * all cases correctly. The latter will be fixed (taking this sort of
2511 * stuff into VFS), but the former is not going away. Solution: the same
2512 * trick as in rmdir().
2513 * e) conversion from fhandle to dentry may come in the wrong moment - when
2514 * we are removing the target. Solution: we will have to grab ->i_mutex
2515 * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on
2516 * ->i_mutex on parents, which works but leads to some truely excessive
2517 * locking].
2519 static int vfs_rename_dir(struct inode *old_dir, struct dentry *old_dentry,
2520 struct inode *new_dir, struct dentry *new_dentry)
2522 int error = 0;
2523 struct inode *target;
2526 * If we are going to change the parent - check write permissions,
2527 * we'll need to flip '..'.
2529 if (new_dir != old_dir) {
2530 error = inode_permission(old_dentry->d_inode, MAY_WRITE);
2531 if (error)
2532 return error;
2535 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2536 if (error)
2537 return error;
2539 target = new_dentry->d_inode;
2540 if (target) {
2541 mutex_lock(&target->i_mutex);
2542 dentry_unhash(new_dentry);
2544 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2545 error = -EBUSY;
2546 else
2547 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2548 if (target) {
2549 if (!error)
2550 target->i_flags |= S_DEAD;
2551 mutex_unlock(&target->i_mutex);
2552 if (d_unhashed(new_dentry))
2553 d_rehash(new_dentry);
2554 dput(new_dentry);
2556 if (!error)
2557 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
2558 d_move(old_dentry,new_dentry);
2559 return error;
2562 static int vfs_rename_other(struct inode *old_dir, struct dentry *old_dentry,
2563 struct inode *new_dir, struct dentry *new_dentry)
2565 struct inode *target;
2566 int error;
2568 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2569 if (error)
2570 return error;
2572 dget(new_dentry);
2573 target = new_dentry->d_inode;
2574 if (target)
2575 mutex_lock(&target->i_mutex);
2576 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2577 error = -EBUSY;
2578 else
2579 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2580 if (!error) {
2581 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
2582 d_move(old_dentry, new_dentry);
2584 if (target)
2585 mutex_unlock(&target->i_mutex);
2586 dput(new_dentry);
2587 return error;
2590 int vfs_rename(struct inode *old_dir, struct dentry *old_dentry,
2591 struct inode *new_dir, struct dentry *new_dentry)
2593 int error;
2594 int is_dir = S_ISDIR(old_dentry->d_inode->i_mode);
2595 const char *old_name;
2597 if (old_dentry->d_inode == new_dentry->d_inode)
2598 return 0;
2600 error = may_delete(old_dir, old_dentry, is_dir);
2601 if (error)
2602 return error;
2604 if (!new_dentry->d_inode)
2605 error = may_create(new_dir, new_dentry);
2606 else
2607 error = may_delete(new_dir, new_dentry, is_dir);
2608 if (error)
2609 return error;
2611 if (!old_dir->i_op->rename)
2612 return -EPERM;
2614 vfs_dq_init(old_dir);
2615 vfs_dq_init(new_dir);
2617 old_name = fsnotify_oldname_init(old_dentry->d_name.name);
2619 if (is_dir)
2620 error = vfs_rename_dir(old_dir,old_dentry,new_dir,new_dentry);
2621 else
2622 error = vfs_rename_other(old_dir,old_dentry,new_dir,new_dentry);
2623 if (!error) {
2624 const char *new_name = old_dentry->d_name.name;
2625 fsnotify_move(old_dir, new_dir, old_name, new_name, is_dir,
2626 new_dentry->d_inode, old_dentry);
2628 fsnotify_oldname_free(old_name);
2630 return error;
2633 SYSCALL_DEFINE4(renameat, int, olddfd, const char __user *, oldname,
2634 int, newdfd, const char __user *, newname)
2636 struct dentry *old_dir, *new_dir;
2637 struct dentry *old_dentry, *new_dentry;
2638 struct dentry *trap;
2639 struct nameidata oldnd, newnd;
2640 char *from;
2641 char *to;
2642 int error;
2644 error = user_path_parent(olddfd, oldname, &oldnd, &from);
2645 if (error)
2646 goto exit;
2648 error = user_path_parent(newdfd, newname, &newnd, &to);
2649 if (error)
2650 goto exit1;
2652 error = -EXDEV;
2653 if (oldnd.path.mnt != newnd.path.mnt)
2654 goto exit2;
2656 old_dir = oldnd.path.dentry;
2657 error = -EBUSY;
2658 if (oldnd.last_type != LAST_NORM)
2659 goto exit2;
2661 new_dir = newnd.path.dentry;
2662 if (newnd.last_type != LAST_NORM)
2663 goto exit2;
2665 oldnd.flags &= ~LOOKUP_PARENT;
2666 newnd.flags &= ~LOOKUP_PARENT;
2667 newnd.flags |= LOOKUP_RENAME_TARGET;
2669 trap = lock_rename(new_dir, old_dir);
2671 old_dentry = lookup_hash(&oldnd);
2672 error = PTR_ERR(old_dentry);
2673 if (IS_ERR(old_dentry))
2674 goto exit3;
2675 /* source must exist */
2676 error = -ENOENT;
2677 if (!old_dentry->d_inode)
2678 goto exit4;
2679 /* unless the source is a directory trailing slashes give -ENOTDIR */
2680 if (!S_ISDIR(old_dentry->d_inode->i_mode)) {
2681 error = -ENOTDIR;
2682 if (oldnd.last.name[oldnd.last.len])
2683 goto exit4;
2684 if (newnd.last.name[newnd.last.len])
2685 goto exit4;
2687 /* source should not be ancestor of target */
2688 error = -EINVAL;
2689 if (old_dentry == trap)
2690 goto exit4;
2691 new_dentry = lookup_hash(&newnd);
2692 error = PTR_ERR(new_dentry);
2693 if (IS_ERR(new_dentry))
2694 goto exit4;
2695 /* target should not be an ancestor of source */
2696 error = -ENOTEMPTY;
2697 if (new_dentry == trap)
2698 goto exit5;
2700 error = mnt_want_write(oldnd.path.mnt);
2701 if (error)
2702 goto exit5;
2703 error = security_path_rename(&oldnd.path, old_dentry,
2704 &newnd.path, new_dentry);
2705 if (error)
2706 goto exit6;
2707 error = vfs_rename(old_dir->d_inode, old_dentry,
2708 new_dir->d_inode, new_dentry);
2709 exit6:
2710 mnt_drop_write(oldnd.path.mnt);
2711 exit5:
2712 dput(new_dentry);
2713 exit4:
2714 dput(old_dentry);
2715 exit3:
2716 unlock_rename(new_dir, old_dir);
2717 exit2:
2718 path_put(&newnd.path);
2719 putname(to);
2720 exit1:
2721 path_put(&oldnd.path);
2722 putname(from);
2723 exit:
2724 return error;
2727 SYSCALL_DEFINE2(rename, const char __user *, oldname, const char __user *, newname)
2729 return sys_renameat(AT_FDCWD, oldname, AT_FDCWD, newname);
2732 int vfs_readlink(struct dentry *dentry, char __user *buffer, int buflen, const char *link)
2734 int len;
2736 len = PTR_ERR(link);
2737 if (IS_ERR(link))
2738 goto out;
2740 len = strlen(link);
2741 if (len > (unsigned) buflen)
2742 len = buflen;
2743 if (copy_to_user(buffer, link, len))
2744 len = -EFAULT;
2745 out:
2746 return len;
2750 * A helper for ->readlink(). This should be used *ONLY* for symlinks that
2751 * have ->follow_link() touching nd only in nd_set_link(). Using (or not
2752 * using) it for any given inode is up to filesystem.
2754 int generic_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2756 struct nameidata nd;
2757 void *cookie;
2758 int res;
2760 nd.depth = 0;
2761 cookie = dentry->d_inode->i_op->follow_link(dentry, &nd);
2762 if (IS_ERR(cookie))
2763 return PTR_ERR(cookie);
2765 res = vfs_readlink(dentry, buffer, buflen, nd_get_link(&nd));
2766 if (dentry->d_inode->i_op->put_link)
2767 dentry->d_inode->i_op->put_link(dentry, &nd, cookie);
2768 return res;
2771 int vfs_follow_link(struct nameidata *nd, const char *link)
2773 return __vfs_follow_link(nd, link);
2776 /* get the link contents into pagecache */
2777 static char *page_getlink(struct dentry * dentry, struct page **ppage)
2779 char *kaddr;
2780 struct page *page;
2781 struct address_space *mapping = dentry->d_inode->i_mapping;
2782 page = read_mapping_page(mapping, 0, NULL);
2783 if (IS_ERR(page))
2784 return (char*)page;
2785 *ppage = page;
2786 kaddr = kmap(page);
2787 nd_terminate_link(kaddr, dentry->d_inode->i_size, PAGE_SIZE - 1);
2788 return kaddr;
2791 int page_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2793 struct page *page = NULL;
2794 char *s = page_getlink(dentry, &page);
2795 int res = vfs_readlink(dentry,buffer,buflen,s);
2796 if (page) {
2797 kunmap(page);
2798 page_cache_release(page);
2800 return res;
2803 void *page_follow_link_light(struct dentry *dentry, struct nameidata *nd)
2805 struct page *page = NULL;
2806 nd_set_link(nd, page_getlink(dentry, &page));
2807 return page;
2810 void page_put_link(struct dentry *dentry, struct nameidata *nd, void *cookie)
2812 struct page *page = cookie;
2814 if (page) {
2815 kunmap(page);
2816 page_cache_release(page);
2821 * The nofs argument instructs pagecache_write_begin to pass AOP_FLAG_NOFS
2823 int __page_symlink(struct inode *inode, const char *symname, int len, int nofs)
2825 struct address_space *mapping = inode->i_mapping;
2826 struct page *page;
2827 void *fsdata;
2828 int err;
2829 char *kaddr;
2830 unsigned int flags = AOP_FLAG_UNINTERRUPTIBLE;
2831 if (nofs)
2832 flags |= AOP_FLAG_NOFS;
2834 retry:
2835 err = pagecache_write_begin(NULL, mapping, 0, len-1,
2836 flags, &page, &fsdata);
2837 if (err)
2838 goto fail;
2840 kaddr = kmap_atomic(page, KM_USER0);
2841 memcpy(kaddr, symname, len-1);
2842 kunmap_atomic(kaddr, KM_USER0);
2844 err = pagecache_write_end(NULL, mapping, 0, len-1, len-1,
2845 page, fsdata);
2846 if (err < 0)
2847 goto fail;
2848 if (err < len-1)
2849 goto retry;
2851 mark_inode_dirty(inode);
2852 return 0;
2853 fail:
2854 return err;
2857 int page_symlink(struct inode *inode, const char *symname, int len)
2859 return __page_symlink(inode, symname, len,
2860 !(mapping_gfp_mask(inode->i_mapping) & __GFP_FS));
2863 const struct inode_operations page_symlink_inode_operations = {
2864 .readlink = generic_readlink,
2865 .follow_link = page_follow_link_light,
2866 .put_link = page_put_link,
2869 EXPORT_SYMBOL(user_path_at);
2870 EXPORT_SYMBOL(follow_down);
2871 EXPORT_SYMBOL(follow_up);
2872 EXPORT_SYMBOL(get_write_access); /* binfmt_aout */
2873 EXPORT_SYMBOL(getname);
2874 EXPORT_SYMBOL(lock_rename);
2875 EXPORT_SYMBOL(lookup_one_len);
2876 EXPORT_SYMBOL(page_follow_link_light);
2877 EXPORT_SYMBOL(page_put_link);
2878 EXPORT_SYMBOL(page_readlink);
2879 EXPORT_SYMBOL(__page_symlink);
2880 EXPORT_SYMBOL(page_symlink);
2881 EXPORT_SYMBOL(page_symlink_inode_operations);
2882 EXPORT_SYMBOL(path_lookup);
2883 EXPORT_SYMBOL(kern_path);
2884 EXPORT_SYMBOL(vfs_path_lookup);
2885 EXPORT_SYMBOL(inode_permission);
2886 EXPORT_SYMBOL(file_permission);
2887 EXPORT_SYMBOL(unlock_rename);
2888 EXPORT_SYMBOL(vfs_create);
2889 EXPORT_SYMBOL(vfs_follow_link);
2890 EXPORT_SYMBOL(vfs_link);
2891 EXPORT_SYMBOL(vfs_mkdir);
2892 EXPORT_SYMBOL(vfs_mknod);
2893 EXPORT_SYMBOL(generic_permission);
2894 EXPORT_SYMBOL(vfs_readlink);
2895 EXPORT_SYMBOL(vfs_rename);
2896 EXPORT_SYMBOL(vfs_rmdir);
2897 EXPORT_SYMBOL(vfs_symlink);
2898 EXPORT_SYMBOL(vfs_unlink);
2899 EXPORT_SYMBOL(dentry_unhash);
2900 EXPORT_SYMBOL(generic_readlink);