Linux 2.6.31-rc1
[linux-2.6/linux-acpi-2.6/ibm-acpi-2.6.git] / fs / namei.c
blob5b961eb71cbf9781988b50559ff10842f49e483a
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 void set_root(struct nameidata *nd)
557 if (!nd->root.mnt) {
558 struct fs_struct *fs = current->fs;
559 read_lock(&fs->lock);
560 nd->root = fs->root;
561 path_get(&nd->root);
562 read_unlock(&fs->lock);
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 set_root(nd);
575 path_put(&nd->path);
576 nd->path = nd->root;
577 path_get(&nd->root);
580 res = link_path_walk(link, nd);
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 path *path)
680 struct vfsmount *parent;
681 struct dentry *mountpoint;
682 spin_lock(&vfsmount_lock);
683 parent = path->mnt->mnt_parent;
684 if (parent == path->mnt) {
685 spin_unlock(&vfsmount_lock);
686 return 0;
688 mntget(parent);
689 mountpoint = dget(path->mnt->mnt_mountpoint);
690 spin_unlock(&vfsmount_lock);
691 dput(path->dentry);
692 path->dentry = mountpoint;
693 mntput(path->mnt);
694 path->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);
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 path *path)
720 while (d_mountpoint(path->dentry)) {
721 struct vfsmount *mounted = lookup_mnt(path);
722 if (!mounted)
723 break;
724 dput(path->dentry);
725 mntput(path->mnt);
726 path->mnt = mounted;
727 path->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 path *path)
736 struct vfsmount *mounted;
738 mounted = lookup_mnt(path);
739 if (mounted) {
740 dput(path->dentry);
741 mntput(path->mnt);
742 path->mnt = mounted;
743 path->dentry = dget(mounted->mnt_root);
744 return 1;
746 return 0;
749 static __always_inline void follow_dotdot(struct nameidata *nd)
751 set_root(nd);
753 while(1) {
754 struct vfsmount *parent;
755 struct dentry *old = nd->path.dentry;
757 if (nd->path.dentry == nd->root.dentry &&
758 nd->path.mnt == nd->root.mnt) {
759 break;
761 spin_lock(&dcache_lock);
762 if (nd->path.dentry != nd->path.mnt->mnt_root) {
763 nd->path.dentry = dget(nd->path.dentry->d_parent);
764 spin_unlock(&dcache_lock);
765 dput(old);
766 break;
768 spin_unlock(&dcache_lock);
769 spin_lock(&vfsmount_lock);
770 parent = nd->path.mnt->mnt_parent;
771 if (parent == nd->path.mnt) {
772 spin_unlock(&vfsmount_lock);
773 break;
775 mntget(parent);
776 nd->path.dentry = dget(nd->path.mnt->mnt_mountpoint);
777 spin_unlock(&vfsmount_lock);
778 dput(old);
779 mntput(nd->path.mnt);
780 nd->path.mnt = parent;
782 follow_mount(&nd->path);
786 * It's more convoluted than I'd like it to be, but... it's still fairly
787 * small and for now I'd prefer to have fast path as straight as possible.
788 * It _is_ time-critical.
790 static int do_lookup(struct nameidata *nd, struct qstr *name,
791 struct path *path)
793 struct vfsmount *mnt = nd->path.mnt;
794 struct dentry *dentry = __d_lookup(nd->path.dentry, name);
796 if (!dentry)
797 goto need_lookup;
798 if (dentry->d_op && dentry->d_op->d_revalidate)
799 goto need_revalidate;
800 done:
801 path->mnt = mnt;
802 path->dentry = dentry;
803 __follow_mount(path);
804 return 0;
806 need_lookup:
807 dentry = real_lookup(nd->path.dentry, name, nd);
808 if (IS_ERR(dentry))
809 goto fail;
810 goto done;
812 need_revalidate:
813 dentry = do_revalidate(dentry, nd);
814 if (!dentry)
815 goto need_lookup;
816 if (IS_ERR(dentry))
817 goto fail;
818 goto done;
820 fail:
821 return PTR_ERR(dentry);
825 * Name resolution.
826 * This is the basic name resolution function, turning a pathname into
827 * the final dentry. We expect 'base' to be positive and a directory.
829 * Returns 0 and nd will have valid dentry and mnt on success.
830 * Returns error and drops reference to input namei data on failure.
832 static int __link_path_walk(const char *name, struct nameidata *nd)
834 struct path next;
835 struct inode *inode;
836 int err;
837 unsigned int lookup_flags = nd->flags;
839 while (*name=='/')
840 name++;
841 if (!*name)
842 goto return_reval;
844 inode = nd->path.dentry->d_inode;
845 if (nd->depth)
846 lookup_flags = LOOKUP_FOLLOW | (nd->flags & LOOKUP_CONTINUE);
848 /* At this point we know we have a real path component. */
849 for(;;) {
850 unsigned long hash;
851 struct qstr this;
852 unsigned int c;
854 nd->flags |= LOOKUP_CONTINUE;
855 err = exec_permission_lite(inode);
856 if (err == -EAGAIN)
857 err = inode_permission(nd->path.dentry->d_inode,
858 MAY_EXEC);
859 if (!err)
860 err = ima_path_check(&nd->path, MAY_EXEC,
861 IMA_COUNT_UPDATE);
862 if (err)
863 break;
865 this.name = name;
866 c = *(const unsigned char *)name;
868 hash = init_name_hash();
869 do {
870 name++;
871 hash = partial_name_hash(c, hash);
872 c = *(const unsigned char *)name;
873 } while (c && (c != '/'));
874 this.len = name - (const char *) this.name;
875 this.hash = end_name_hash(hash);
877 /* remove trailing slashes? */
878 if (!c)
879 goto last_component;
880 while (*++name == '/');
881 if (!*name)
882 goto last_with_slashes;
885 * "." and ".." are special - ".." especially so because it has
886 * to be able to know about the current root directory and
887 * parent relationships.
889 if (this.name[0] == '.') switch (this.len) {
890 default:
891 break;
892 case 2:
893 if (this.name[1] != '.')
894 break;
895 follow_dotdot(nd);
896 inode = nd->path.dentry->d_inode;
897 /* fallthrough */
898 case 1:
899 continue;
902 * See if the low-level filesystem might want
903 * to use its own hash..
905 if (nd->path.dentry->d_op && nd->path.dentry->d_op->d_hash) {
906 err = nd->path.dentry->d_op->d_hash(nd->path.dentry,
907 &this);
908 if (err < 0)
909 break;
911 /* This does the actual lookups.. */
912 err = do_lookup(nd, &this, &next);
913 if (err)
914 break;
916 err = -ENOENT;
917 inode = next.dentry->d_inode;
918 if (!inode)
919 goto out_dput;
921 if (inode->i_op->follow_link) {
922 err = do_follow_link(&next, nd);
923 if (err)
924 goto return_err;
925 err = -ENOENT;
926 inode = nd->path.dentry->d_inode;
927 if (!inode)
928 break;
929 } else
930 path_to_nameidata(&next, nd);
931 err = -ENOTDIR;
932 if (!inode->i_op->lookup)
933 break;
934 continue;
935 /* here ends the main loop */
937 last_with_slashes:
938 lookup_flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY;
939 last_component:
940 /* Clear LOOKUP_CONTINUE iff it was previously unset */
941 nd->flags &= lookup_flags | ~LOOKUP_CONTINUE;
942 if (lookup_flags & LOOKUP_PARENT)
943 goto lookup_parent;
944 if (this.name[0] == '.') switch (this.len) {
945 default:
946 break;
947 case 2:
948 if (this.name[1] != '.')
949 break;
950 follow_dotdot(nd);
951 inode = nd->path.dentry->d_inode;
952 /* fallthrough */
953 case 1:
954 goto return_reval;
956 if (nd->path.dentry->d_op && nd->path.dentry->d_op->d_hash) {
957 err = nd->path.dentry->d_op->d_hash(nd->path.dentry,
958 &this);
959 if (err < 0)
960 break;
962 err = do_lookup(nd, &this, &next);
963 if (err)
964 break;
965 inode = next.dentry->d_inode;
966 if ((lookup_flags & LOOKUP_FOLLOW)
967 && inode && inode->i_op->follow_link) {
968 err = do_follow_link(&next, nd);
969 if (err)
970 goto return_err;
971 inode = nd->path.dentry->d_inode;
972 } else
973 path_to_nameidata(&next, nd);
974 err = -ENOENT;
975 if (!inode)
976 break;
977 if (lookup_flags & LOOKUP_DIRECTORY) {
978 err = -ENOTDIR;
979 if (!inode->i_op->lookup)
980 break;
982 goto return_base;
983 lookup_parent:
984 nd->last = this;
985 nd->last_type = LAST_NORM;
986 if (this.name[0] != '.')
987 goto return_base;
988 if (this.len == 1)
989 nd->last_type = LAST_DOT;
990 else if (this.len == 2 && this.name[1] == '.')
991 nd->last_type = LAST_DOTDOT;
992 else
993 goto return_base;
994 return_reval:
996 * We bypassed the ordinary revalidation routines.
997 * We may need to check the cached dentry for staleness.
999 if (nd->path.dentry && nd->path.dentry->d_sb &&
1000 (nd->path.dentry->d_sb->s_type->fs_flags & FS_REVAL_DOT)) {
1001 err = -ESTALE;
1002 /* Note: we do not d_invalidate() */
1003 if (!nd->path.dentry->d_op->d_revalidate(
1004 nd->path.dentry, nd))
1005 break;
1007 return_base:
1008 return 0;
1009 out_dput:
1010 path_put_conditional(&next, nd);
1011 break;
1013 path_put(&nd->path);
1014 return_err:
1015 return err;
1018 static int path_walk(const char *name, struct nameidata *nd)
1020 current->total_link_count = 0;
1021 return link_path_walk(name, nd);
1024 static int path_init(int dfd, const char *name, unsigned int flags, struct nameidata *nd)
1026 int retval = 0;
1027 int fput_needed;
1028 struct file *file;
1030 nd->last_type = LAST_ROOT; /* if there are only slashes... */
1031 nd->flags = flags;
1032 nd->depth = 0;
1033 nd->root.mnt = NULL;
1035 if (*name=='/') {
1036 set_root(nd);
1037 nd->path = nd->root;
1038 path_get(&nd->root);
1039 } else if (dfd == AT_FDCWD) {
1040 struct fs_struct *fs = current->fs;
1041 read_lock(&fs->lock);
1042 nd->path = fs->pwd;
1043 path_get(&fs->pwd);
1044 read_unlock(&fs->lock);
1045 } else {
1046 struct dentry *dentry;
1048 file = fget_light(dfd, &fput_needed);
1049 retval = -EBADF;
1050 if (!file)
1051 goto out_fail;
1053 dentry = file->f_path.dentry;
1055 retval = -ENOTDIR;
1056 if (!S_ISDIR(dentry->d_inode->i_mode))
1057 goto fput_fail;
1059 retval = file_permission(file, MAY_EXEC);
1060 if (retval)
1061 goto fput_fail;
1063 nd->path = file->f_path;
1064 path_get(&file->f_path);
1066 fput_light(file, fput_needed);
1068 return 0;
1070 fput_fail:
1071 fput_light(file, fput_needed);
1072 out_fail:
1073 return retval;
1076 /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
1077 static int do_path_lookup(int dfd, const char *name,
1078 unsigned int flags, struct nameidata *nd)
1080 int retval = path_init(dfd, name, flags, nd);
1081 if (!retval)
1082 retval = path_walk(name, nd);
1083 if (unlikely(!retval && !audit_dummy_context() && nd->path.dentry &&
1084 nd->path.dentry->d_inode))
1085 audit_inode(name, nd->path.dentry);
1086 if (nd->root.mnt) {
1087 path_put(&nd->root);
1088 nd->root.mnt = NULL;
1090 return retval;
1093 int path_lookup(const char *name, unsigned int flags,
1094 struct nameidata *nd)
1096 return do_path_lookup(AT_FDCWD, name, flags, nd);
1099 int kern_path(const char *name, unsigned int flags, struct path *path)
1101 struct nameidata nd;
1102 int res = do_path_lookup(AT_FDCWD, name, flags, &nd);
1103 if (!res)
1104 *path = nd.path;
1105 return res;
1109 * vfs_path_lookup - lookup a file path relative to a dentry-vfsmount pair
1110 * @dentry: pointer to dentry of the base directory
1111 * @mnt: pointer to vfs mount of the base directory
1112 * @name: pointer to file name
1113 * @flags: lookup flags
1114 * @nd: pointer to nameidata
1116 int vfs_path_lookup(struct dentry *dentry, struct vfsmount *mnt,
1117 const char *name, unsigned int flags,
1118 struct nameidata *nd)
1120 int retval;
1122 /* same as do_path_lookup */
1123 nd->last_type = LAST_ROOT;
1124 nd->flags = flags;
1125 nd->depth = 0;
1127 nd->path.dentry = dentry;
1128 nd->path.mnt = mnt;
1129 path_get(&nd->path);
1130 nd->root = nd->path;
1131 path_get(&nd->root);
1133 retval = path_walk(name, nd);
1134 if (unlikely(!retval && !audit_dummy_context() && nd->path.dentry &&
1135 nd->path.dentry->d_inode))
1136 audit_inode(name, nd->path.dentry);
1138 path_put(&nd->root);
1139 nd->root.mnt = NULL;
1141 return retval;
1145 * path_lookup_open - lookup a file path with open intent
1146 * @dfd: the directory to use as base, or AT_FDCWD
1147 * @name: pointer to file name
1148 * @lookup_flags: lookup intent flags
1149 * @nd: pointer to nameidata
1150 * @open_flags: open intent flags
1152 static int path_lookup_open(int dfd, const char *name,
1153 unsigned int lookup_flags, struct nameidata *nd, int open_flags)
1155 struct file *filp = get_empty_filp();
1156 int err;
1158 if (filp == NULL)
1159 return -ENFILE;
1160 nd->intent.open.file = filp;
1161 nd->intent.open.flags = open_flags;
1162 nd->intent.open.create_mode = 0;
1163 err = do_path_lookup(dfd, name, lookup_flags|LOOKUP_OPEN, nd);
1164 if (IS_ERR(nd->intent.open.file)) {
1165 if (err == 0) {
1166 err = PTR_ERR(nd->intent.open.file);
1167 path_put(&nd->path);
1169 } else if (err != 0)
1170 release_open_intent(nd);
1171 return err;
1174 static struct dentry *__lookup_hash(struct qstr *name,
1175 struct dentry *base, struct nameidata *nd)
1177 struct dentry *dentry;
1178 struct inode *inode;
1179 int err;
1181 inode = base->d_inode;
1184 * See if the low-level filesystem might want
1185 * to use its own hash..
1187 if (base->d_op && base->d_op->d_hash) {
1188 err = base->d_op->d_hash(base, name);
1189 dentry = ERR_PTR(err);
1190 if (err < 0)
1191 goto out;
1194 dentry = cached_lookup(base, name, nd);
1195 if (!dentry) {
1196 struct dentry *new;
1198 /* Don't create child dentry for a dead directory. */
1199 dentry = ERR_PTR(-ENOENT);
1200 if (IS_DEADDIR(inode))
1201 goto out;
1203 new = d_alloc(base, name);
1204 dentry = ERR_PTR(-ENOMEM);
1205 if (!new)
1206 goto out;
1207 dentry = inode->i_op->lookup(inode, new, nd);
1208 if (!dentry)
1209 dentry = new;
1210 else
1211 dput(new);
1213 out:
1214 return dentry;
1218 * Restricted form of lookup. Doesn't follow links, single-component only,
1219 * needs parent already locked. Doesn't follow mounts.
1220 * SMP-safe.
1222 static struct dentry *lookup_hash(struct nameidata *nd)
1224 int err;
1226 err = inode_permission(nd->path.dentry->d_inode, MAY_EXEC);
1227 if (err)
1228 return ERR_PTR(err);
1229 return __lookup_hash(&nd->last, nd->path.dentry, nd);
1232 static int __lookup_one_len(const char *name, struct qstr *this,
1233 struct dentry *base, int len)
1235 unsigned long hash;
1236 unsigned int c;
1238 this->name = name;
1239 this->len = len;
1240 if (!len)
1241 return -EACCES;
1243 hash = init_name_hash();
1244 while (len--) {
1245 c = *(const unsigned char *)name++;
1246 if (c == '/' || c == '\0')
1247 return -EACCES;
1248 hash = partial_name_hash(c, hash);
1250 this->hash = end_name_hash(hash);
1251 return 0;
1255 * lookup_one_len - filesystem helper to lookup single pathname component
1256 * @name: pathname component to lookup
1257 * @base: base directory to lookup from
1258 * @len: maximum length @len should be interpreted to
1260 * Note that this routine is purely a helper for filesystem usage and should
1261 * not be called by generic code. Also note that by using this function the
1262 * nameidata argument is passed to the filesystem methods and a filesystem
1263 * using this helper needs to be prepared for that.
1265 struct dentry *lookup_one_len(const char *name, struct dentry *base, int len)
1267 int err;
1268 struct qstr this;
1270 WARN_ON_ONCE(!mutex_is_locked(&base->d_inode->i_mutex));
1272 err = __lookup_one_len(name, &this, base, len);
1273 if (err)
1274 return ERR_PTR(err);
1276 err = inode_permission(base->d_inode, MAY_EXEC);
1277 if (err)
1278 return ERR_PTR(err);
1279 return __lookup_hash(&this, base, NULL);
1283 * lookup_one_noperm - bad hack for sysfs
1284 * @name: pathname component to lookup
1285 * @base: base directory to lookup from
1287 * This is a variant of lookup_one_len that doesn't perform any permission
1288 * checks. It's a horrible hack to work around the braindead sysfs
1289 * architecture and should not be used anywhere else.
1291 * DON'T USE THIS FUNCTION EVER, thanks.
1293 struct dentry *lookup_one_noperm(const char *name, struct dentry *base)
1295 int err;
1296 struct qstr this;
1298 err = __lookup_one_len(name, &this, base, strlen(name));
1299 if (err)
1300 return ERR_PTR(err);
1301 return __lookup_hash(&this, base, NULL);
1304 int user_path_at(int dfd, const char __user *name, unsigned flags,
1305 struct path *path)
1307 struct nameidata nd;
1308 char *tmp = getname(name);
1309 int err = PTR_ERR(tmp);
1310 if (!IS_ERR(tmp)) {
1312 BUG_ON(flags & LOOKUP_PARENT);
1314 err = do_path_lookup(dfd, tmp, flags, &nd);
1315 putname(tmp);
1316 if (!err)
1317 *path = nd.path;
1319 return err;
1322 static int user_path_parent(int dfd, const char __user *path,
1323 struct nameidata *nd, char **name)
1325 char *s = getname(path);
1326 int error;
1328 if (IS_ERR(s))
1329 return PTR_ERR(s);
1331 error = do_path_lookup(dfd, s, LOOKUP_PARENT, nd);
1332 if (error)
1333 putname(s);
1334 else
1335 *name = s;
1337 return error;
1341 * It's inline, so penalty for filesystems that don't use sticky bit is
1342 * minimal.
1344 static inline int check_sticky(struct inode *dir, struct inode *inode)
1346 uid_t fsuid = current_fsuid();
1348 if (!(dir->i_mode & S_ISVTX))
1349 return 0;
1350 if (inode->i_uid == fsuid)
1351 return 0;
1352 if (dir->i_uid == fsuid)
1353 return 0;
1354 return !capable(CAP_FOWNER);
1358 * Check whether we can remove a link victim from directory dir, check
1359 * whether the type of victim is right.
1360 * 1. We can't do it if dir is read-only (done in permission())
1361 * 2. We should have write and exec permissions on dir
1362 * 3. We can't remove anything from append-only dir
1363 * 4. We can't do anything with immutable dir (done in permission())
1364 * 5. If the sticky bit on dir is set we should either
1365 * a. be owner of dir, or
1366 * b. be owner of victim, or
1367 * c. have CAP_FOWNER capability
1368 * 6. If the victim is append-only or immutable we can't do antyhing with
1369 * links pointing to it.
1370 * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR.
1371 * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR.
1372 * 9. We can't remove a root or mountpoint.
1373 * 10. We don't allow removal of NFS sillyrenamed files; it's handled by
1374 * nfs_async_unlink().
1376 static int may_delete(struct inode *dir,struct dentry *victim,int isdir)
1378 int error;
1380 if (!victim->d_inode)
1381 return -ENOENT;
1383 BUG_ON(victim->d_parent->d_inode != dir);
1384 audit_inode_child(victim->d_name.name, victim, dir);
1386 error = inode_permission(dir, MAY_WRITE | MAY_EXEC);
1387 if (error)
1388 return error;
1389 if (IS_APPEND(dir))
1390 return -EPERM;
1391 if (check_sticky(dir, victim->d_inode)||IS_APPEND(victim->d_inode)||
1392 IS_IMMUTABLE(victim->d_inode) || IS_SWAPFILE(victim->d_inode))
1393 return -EPERM;
1394 if (isdir) {
1395 if (!S_ISDIR(victim->d_inode->i_mode))
1396 return -ENOTDIR;
1397 if (IS_ROOT(victim))
1398 return -EBUSY;
1399 } else if (S_ISDIR(victim->d_inode->i_mode))
1400 return -EISDIR;
1401 if (IS_DEADDIR(dir))
1402 return -ENOENT;
1403 if (victim->d_flags & DCACHE_NFSFS_RENAMED)
1404 return -EBUSY;
1405 return 0;
1408 /* Check whether we can create an object with dentry child in directory
1409 * dir.
1410 * 1. We can't do it if child already exists (open has special treatment for
1411 * this case, but since we are inlined it's OK)
1412 * 2. We can't do it if dir is read-only (done in permission())
1413 * 3. We should have write and exec permissions on dir
1414 * 4. We can't do it if dir is immutable (done in permission())
1416 static inline int may_create(struct inode *dir, struct dentry *child)
1418 if (child->d_inode)
1419 return -EEXIST;
1420 if (IS_DEADDIR(dir))
1421 return -ENOENT;
1422 return inode_permission(dir, MAY_WRITE | MAY_EXEC);
1426 * O_DIRECTORY translates into forcing a directory lookup.
1428 static inline int lookup_flags(unsigned int f)
1430 unsigned long retval = LOOKUP_FOLLOW;
1432 if (f & O_NOFOLLOW)
1433 retval &= ~LOOKUP_FOLLOW;
1435 if (f & O_DIRECTORY)
1436 retval |= LOOKUP_DIRECTORY;
1438 return retval;
1442 * p1 and p2 should be directories on the same fs.
1444 struct dentry *lock_rename(struct dentry *p1, struct dentry *p2)
1446 struct dentry *p;
1448 if (p1 == p2) {
1449 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1450 return NULL;
1453 mutex_lock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1455 p = d_ancestor(p2, p1);
1456 if (p) {
1457 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_PARENT);
1458 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_CHILD);
1459 return p;
1462 p = d_ancestor(p1, p2);
1463 if (p) {
1464 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1465 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1466 return p;
1469 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1470 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1471 return NULL;
1474 void unlock_rename(struct dentry *p1, struct dentry *p2)
1476 mutex_unlock(&p1->d_inode->i_mutex);
1477 if (p1 != p2) {
1478 mutex_unlock(&p2->d_inode->i_mutex);
1479 mutex_unlock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1483 int vfs_create(struct inode *dir, struct dentry *dentry, int mode,
1484 struct nameidata *nd)
1486 int error = may_create(dir, dentry);
1488 if (error)
1489 return error;
1491 if (!dir->i_op->create)
1492 return -EACCES; /* shouldn't it be ENOSYS? */
1493 mode &= S_IALLUGO;
1494 mode |= S_IFREG;
1495 error = security_inode_create(dir, dentry, mode);
1496 if (error)
1497 return error;
1498 vfs_dq_init(dir);
1499 error = dir->i_op->create(dir, dentry, mode, nd);
1500 if (!error)
1501 fsnotify_create(dir, dentry);
1502 return error;
1505 int may_open(struct path *path, int acc_mode, int flag)
1507 struct dentry *dentry = path->dentry;
1508 struct inode *inode = dentry->d_inode;
1509 int error;
1511 if (!inode)
1512 return -ENOENT;
1514 switch (inode->i_mode & S_IFMT) {
1515 case S_IFLNK:
1516 return -ELOOP;
1517 case S_IFDIR:
1518 if (acc_mode & MAY_WRITE)
1519 return -EISDIR;
1520 break;
1521 case S_IFBLK:
1522 case S_IFCHR:
1523 if (path->mnt->mnt_flags & MNT_NODEV)
1524 return -EACCES;
1525 /*FALLTHRU*/
1526 case S_IFIFO:
1527 case S_IFSOCK:
1528 flag &= ~O_TRUNC;
1529 break;
1532 error = inode_permission(inode, acc_mode);
1533 if (error)
1534 return error;
1536 error = ima_path_check(path,
1537 acc_mode & (MAY_READ | MAY_WRITE | MAY_EXEC),
1538 IMA_COUNT_UPDATE);
1539 if (error)
1540 return error;
1542 * An append-only file must be opened in append mode for writing.
1544 if (IS_APPEND(inode)) {
1545 if ((flag & FMODE_WRITE) && !(flag & O_APPEND))
1546 return -EPERM;
1547 if (flag & O_TRUNC)
1548 return -EPERM;
1551 /* O_NOATIME can only be set by the owner or superuser */
1552 if (flag & O_NOATIME)
1553 if (!is_owner_or_cap(inode))
1554 return -EPERM;
1557 * Ensure there are no outstanding leases on the file.
1559 error = break_lease(inode, flag);
1560 if (error)
1561 return error;
1563 if (flag & O_TRUNC) {
1564 error = get_write_access(inode);
1565 if (error)
1566 return error;
1569 * Refuse to truncate files with mandatory locks held on them.
1571 error = locks_verify_locked(inode);
1572 if (!error)
1573 error = security_path_truncate(path, 0,
1574 ATTR_MTIME|ATTR_CTIME|ATTR_OPEN);
1575 if (!error) {
1576 vfs_dq_init(inode);
1578 error = do_truncate(dentry, 0,
1579 ATTR_MTIME|ATTR_CTIME|ATTR_OPEN,
1580 NULL);
1582 put_write_access(inode);
1583 if (error)
1584 return error;
1585 } else
1586 if (flag & FMODE_WRITE)
1587 vfs_dq_init(inode);
1589 return 0;
1593 * Be careful about ever adding any more callers of this
1594 * function. Its flags must be in the namei format, not
1595 * what get passed to sys_open().
1597 static int __open_namei_create(struct nameidata *nd, struct path *path,
1598 int flag, int mode)
1600 int error;
1601 struct dentry *dir = nd->path.dentry;
1603 if (!IS_POSIXACL(dir->d_inode))
1604 mode &= ~current_umask();
1605 error = security_path_mknod(&nd->path, path->dentry, mode, 0);
1606 if (error)
1607 goto out_unlock;
1608 error = vfs_create(dir->d_inode, path->dentry, mode, nd);
1609 out_unlock:
1610 mutex_unlock(&dir->d_inode->i_mutex);
1611 dput(nd->path.dentry);
1612 nd->path.dentry = path->dentry;
1613 if (error)
1614 return error;
1615 /* Don't check for write permission, don't truncate */
1616 return may_open(&nd->path, 0, flag & ~O_TRUNC);
1620 * Note that while the flag value (low two bits) for sys_open means:
1621 * 00 - read-only
1622 * 01 - write-only
1623 * 10 - read-write
1624 * 11 - special
1625 * it is changed into
1626 * 00 - no permissions needed
1627 * 01 - read-permission
1628 * 10 - write-permission
1629 * 11 - read-write
1630 * for the internal routines (ie open_namei()/follow_link() etc)
1631 * This is more logical, and also allows the 00 "no perm needed"
1632 * to be used for symlinks (where the permissions are checked
1633 * later).
1636 static inline int open_to_namei_flags(int flag)
1638 if ((flag+1) & O_ACCMODE)
1639 flag++;
1640 return flag;
1643 static int open_will_write_to_fs(int flag, struct inode *inode)
1646 * We'll never write to the fs underlying
1647 * a device file.
1649 if (special_file(inode->i_mode))
1650 return 0;
1651 return (flag & O_TRUNC);
1655 * Note that the low bits of the passed in "open_flag"
1656 * are not the same as in the local variable "flag". See
1657 * open_to_namei_flags() for more details.
1659 struct file *do_filp_open(int dfd, const char *pathname,
1660 int open_flag, int mode, int acc_mode)
1662 struct file *filp;
1663 struct nameidata nd;
1664 int error;
1665 struct path path;
1666 struct dentry *dir;
1667 int count = 0;
1668 int will_write;
1669 int flag = open_to_namei_flags(open_flag);
1671 if (!acc_mode)
1672 acc_mode = MAY_OPEN | ACC_MODE(flag);
1674 /* O_TRUNC implies we need access checks for write permissions */
1675 if (flag & O_TRUNC)
1676 acc_mode |= MAY_WRITE;
1678 /* Allow the LSM permission hook to distinguish append
1679 access from general write access. */
1680 if (flag & O_APPEND)
1681 acc_mode |= MAY_APPEND;
1684 * The simplest case - just a plain lookup.
1686 if (!(flag & O_CREAT)) {
1687 error = path_lookup_open(dfd, pathname, lookup_flags(flag),
1688 &nd, flag);
1689 if (error)
1690 return ERR_PTR(error);
1691 goto ok;
1695 * Create - we need to know the parent.
1697 error = path_init(dfd, pathname, LOOKUP_PARENT, &nd);
1698 if (error)
1699 return ERR_PTR(error);
1700 error = path_walk(pathname, &nd);
1701 if (error) {
1702 if (nd.root.mnt)
1703 path_put(&nd.root);
1704 return ERR_PTR(error);
1706 if (unlikely(!audit_dummy_context()))
1707 audit_inode(pathname, nd.path.dentry);
1710 * We have the parent and last component. First of all, check
1711 * that we are not asked to creat(2) an obvious directory - that
1712 * will not do.
1714 error = -EISDIR;
1715 if (nd.last_type != LAST_NORM || nd.last.name[nd.last.len])
1716 goto exit_parent;
1718 error = -ENFILE;
1719 filp = get_empty_filp();
1720 if (filp == NULL)
1721 goto exit_parent;
1722 nd.intent.open.file = filp;
1723 nd.intent.open.flags = flag;
1724 nd.intent.open.create_mode = mode;
1725 dir = nd.path.dentry;
1726 nd.flags &= ~LOOKUP_PARENT;
1727 nd.flags |= LOOKUP_CREATE | LOOKUP_OPEN;
1728 if (flag & O_EXCL)
1729 nd.flags |= LOOKUP_EXCL;
1730 mutex_lock(&dir->d_inode->i_mutex);
1731 path.dentry = lookup_hash(&nd);
1732 path.mnt = nd.path.mnt;
1734 do_last:
1735 error = PTR_ERR(path.dentry);
1736 if (IS_ERR(path.dentry)) {
1737 mutex_unlock(&dir->d_inode->i_mutex);
1738 goto exit;
1741 if (IS_ERR(nd.intent.open.file)) {
1742 error = PTR_ERR(nd.intent.open.file);
1743 goto exit_mutex_unlock;
1746 /* Negative dentry, just create the file */
1747 if (!path.dentry->d_inode) {
1749 * This write is needed to ensure that a
1750 * ro->rw transition does not occur between
1751 * the time when the file is created and when
1752 * a permanent write count is taken through
1753 * the 'struct file' in nameidata_to_filp().
1755 error = mnt_want_write(nd.path.mnt);
1756 if (error)
1757 goto exit_mutex_unlock;
1758 error = __open_namei_create(&nd, &path, flag, mode);
1759 if (error) {
1760 mnt_drop_write(nd.path.mnt);
1761 goto exit;
1763 filp = nameidata_to_filp(&nd, open_flag);
1764 mnt_drop_write(nd.path.mnt);
1765 if (nd.root.mnt)
1766 path_put(&nd.root);
1767 return filp;
1771 * It already exists.
1773 mutex_unlock(&dir->d_inode->i_mutex);
1774 audit_inode(pathname, path.dentry);
1776 error = -EEXIST;
1777 if (flag & O_EXCL)
1778 goto exit_dput;
1780 if (__follow_mount(&path)) {
1781 error = -ELOOP;
1782 if (flag & O_NOFOLLOW)
1783 goto exit_dput;
1786 error = -ENOENT;
1787 if (!path.dentry->d_inode)
1788 goto exit_dput;
1789 if (path.dentry->d_inode->i_op->follow_link)
1790 goto do_link;
1792 path_to_nameidata(&path, &nd);
1793 error = -EISDIR;
1794 if (path.dentry->d_inode && S_ISDIR(path.dentry->d_inode->i_mode))
1795 goto exit;
1798 * Consider:
1799 * 1. may_open() truncates a file
1800 * 2. a rw->ro mount transition occurs
1801 * 3. nameidata_to_filp() fails due to
1802 * the ro mount.
1803 * That would be inconsistent, and should
1804 * be avoided. Taking this mnt write here
1805 * ensures that (2) can not occur.
1807 will_write = open_will_write_to_fs(flag, nd.path.dentry->d_inode);
1808 if (will_write) {
1809 error = mnt_want_write(nd.path.mnt);
1810 if (error)
1811 goto exit;
1813 error = may_open(&nd.path, acc_mode, flag);
1814 if (error) {
1815 if (will_write)
1816 mnt_drop_write(nd.path.mnt);
1817 goto exit;
1819 filp = nameidata_to_filp(&nd, open_flag);
1821 * It is now safe to drop the mnt write
1822 * because the filp has had a write taken
1823 * on its behalf.
1825 if (will_write)
1826 mnt_drop_write(nd.path.mnt);
1827 if (nd.root.mnt)
1828 path_put(&nd.root);
1829 return filp;
1831 exit_mutex_unlock:
1832 mutex_unlock(&dir->d_inode->i_mutex);
1833 exit_dput:
1834 path_put_conditional(&path, &nd);
1835 exit:
1836 if (!IS_ERR(nd.intent.open.file))
1837 release_open_intent(&nd);
1838 exit_parent:
1839 if (nd.root.mnt)
1840 path_put(&nd.root);
1841 path_put(&nd.path);
1842 return ERR_PTR(error);
1844 do_link:
1845 error = -ELOOP;
1846 if (flag & O_NOFOLLOW)
1847 goto exit_dput;
1849 * This is subtle. Instead of calling do_follow_link() we do the
1850 * thing by hands. The reason is that this way we have zero link_count
1851 * and path_walk() (called from ->follow_link) honoring LOOKUP_PARENT.
1852 * After that we have the parent and last component, i.e.
1853 * we are in the same situation as after the first path_walk().
1854 * Well, almost - if the last component is normal we get its copy
1855 * stored in nd->last.name and we will have to putname() it when we
1856 * are done. Procfs-like symlinks just set LAST_BIND.
1858 nd.flags |= LOOKUP_PARENT;
1859 error = security_inode_follow_link(path.dentry, &nd);
1860 if (error)
1861 goto exit_dput;
1862 error = __do_follow_link(&path, &nd);
1863 if (error) {
1864 /* Does someone understand code flow here? Or it is only
1865 * me so stupid? Anathema to whoever designed this non-sense
1866 * with "intent.open".
1868 release_open_intent(&nd);
1869 if (nd.root.mnt)
1870 path_put(&nd.root);
1871 return ERR_PTR(error);
1873 nd.flags &= ~LOOKUP_PARENT;
1874 if (nd.last_type == LAST_BIND)
1875 goto ok;
1876 error = -EISDIR;
1877 if (nd.last_type != LAST_NORM)
1878 goto exit;
1879 if (nd.last.name[nd.last.len]) {
1880 __putname(nd.last.name);
1881 goto exit;
1883 error = -ELOOP;
1884 if (count++==32) {
1885 __putname(nd.last.name);
1886 goto exit;
1888 dir = nd.path.dentry;
1889 mutex_lock(&dir->d_inode->i_mutex);
1890 path.dentry = lookup_hash(&nd);
1891 path.mnt = nd.path.mnt;
1892 __putname(nd.last.name);
1893 goto do_last;
1897 * filp_open - open file and return file pointer
1899 * @filename: path to open
1900 * @flags: open flags as per the open(2) second argument
1901 * @mode: mode for the new file if O_CREAT is set, else ignored
1903 * This is the helper to open a file from kernelspace if you really
1904 * have to. But in generally you should not do this, so please move
1905 * along, nothing to see here..
1907 struct file *filp_open(const char *filename, int flags, int mode)
1909 return do_filp_open(AT_FDCWD, filename, flags, mode, 0);
1911 EXPORT_SYMBOL(filp_open);
1914 * lookup_create - lookup a dentry, creating it if it doesn't exist
1915 * @nd: nameidata info
1916 * @is_dir: directory flag
1918 * Simple function to lookup and return a dentry and create it
1919 * if it doesn't exist. Is SMP-safe.
1921 * Returns with nd->path.dentry->d_inode->i_mutex locked.
1923 struct dentry *lookup_create(struct nameidata *nd, int is_dir)
1925 struct dentry *dentry = ERR_PTR(-EEXIST);
1927 mutex_lock_nested(&nd->path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
1929 * Yucky last component or no last component at all?
1930 * (foo/., foo/.., /////)
1932 if (nd->last_type != LAST_NORM)
1933 goto fail;
1934 nd->flags &= ~LOOKUP_PARENT;
1935 nd->flags |= LOOKUP_CREATE | LOOKUP_EXCL;
1936 nd->intent.open.flags = O_EXCL;
1939 * Do the final lookup.
1941 dentry = lookup_hash(nd);
1942 if (IS_ERR(dentry))
1943 goto fail;
1945 if (dentry->d_inode)
1946 goto eexist;
1948 * Special case - lookup gave negative, but... we had foo/bar/
1949 * From the vfs_mknod() POV we just have a negative dentry -
1950 * all is fine. Let's be bastards - you had / on the end, you've
1951 * been asking for (non-existent) directory. -ENOENT for you.
1953 if (unlikely(!is_dir && nd->last.name[nd->last.len])) {
1954 dput(dentry);
1955 dentry = ERR_PTR(-ENOENT);
1957 return dentry;
1958 eexist:
1959 dput(dentry);
1960 dentry = ERR_PTR(-EEXIST);
1961 fail:
1962 return dentry;
1964 EXPORT_SYMBOL_GPL(lookup_create);
1966 int vfs_mknod(struct inode *dir, struct dentry *dentry, int mode, dev_t dev)
1968 int error = may_create(dir, dentry);
1970 if (error)
1971 return error;
1973 if ((S_ISCHR(mode) || S_ISBLK(mode)) && !capable(CAP_MKNOD))
1974 return -EPERM;
1976 if (!dir->i_op->mknod)
1977 return -EPERM;
1979 error = devcgroup_inode_mknod(mode, dev);
1980 if (error)
1981 return error;
1983 error = security_inode_mknod(dir, dentry, mode, dev);
1984 if (error)
1985 return error;
1987 vfs_dq_init(dir);
1988 error = dir->i_op->mknod(dir, dentry, mode, dev);
1989 if (!error)
1990 fsnotify_create(dir, dentry);
1991 return error;
1994 static int may_mknod(mode_t mode)
1996 switch (mode & S_IFMT) {
1997 case S_IFREG:
1998 case S_IFCHR:
1999 case S_IFBLK:
2000 case S_IFIFO:
2001 case S_IFSOCK:
2002 case 0: /* zero mode translates to S_IFREG */
2003 return 0;
2004 case S_IFDIR:
2005 return -EPERM;
2006 default:
2007 return -EINVAL;
2011 SYSCALL_DEFINE4(mknodat, int, dfd, const char __user *, filename, int, mode,
2012 unsigned, dev)
2014 int error;
2015 char *tmp;
2016 struct dentry *dentry;
2017 struct nameidata nd;
2019 if (S_ISDIR(mode))
2020 return -EPERM;
2022 error = user_path_parent(dfd, filename, &nd, &tmp);
2023 if (error)
2024 return error;
2026 dentry = lookup_create(&nd, 0);
2027 if (IS_ERR(dentry)) {
2028 error = PTR_ERR(dentry);
2029 goto out_unlock;
2031 if (!IS_POSIXACL(nd.path.dentry->d_inode))
2032 mode &= ~current_umask();
2033 error = may_mknod(mode);
2034 if (error)
2035 goto out_dput;
2036 error = mnt_want_write(nd.path.mnt);
2037 if (error)
2038 goto out_dput;
2039 error = security_path_mknod(&nd.path, dentry, mode, dev);
2040 if (error)
2041 goto out_drop_write;
2042 switch (mode & S_IFMT) {
2043 case 0: case S_IFREG:
2044 error = vfs_create(nd.path.dentry->d_inode,dentry,mode,&nd);
2045 break;
2046 case S_IFCHR: case S_IFBLK:
2047 error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode,
2048 new_decode_dev(dev));
2049 break;
2050 case S_IFIFO: case S_IFSOCK:
2051 error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode,0);
2052 break;
2054 out_drop_write:
2055 mnt_drop_write(nd.path.mnt);
2056 out_dput:
2057 dput(dentry);
2058 out_unlock:
2059 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2060 path_put(&nd.path);
2061 putname(tmp);
2063 return error;
2066 SYSCALL_DEFINE3(mknod, const char __user *, filename, int, mode, unsigned, dev)
2068 return sys_mknodat(AT_FDCWD, filename, mode, dev);
2071 int vfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
2073 int error = may_create(dir, dentry);
2075 if (error)
2076 return error;
2078 if (!dir->i_op->mkdir)
2079 return -EPERM;
2081 mode &= (S_IRWXUGO|S_ISVTX);
2082 error = security_inode_mkdir(dir, dentry, mode);
2083 if (error)
2084 return error;
2086 vfs_dq_init(dir);
2087 error = dir->i_op->mkdir(dir, dentry, mode);
2088 if (!error)
2089 fsnotify_mkdir(dir, dentry);
2090 return error;
2093 SYSCALL_DEFINE3(mkdirat, int, dfd, const char __user *, pathname, int, mode)
2095 int error = 0;
2096 char * tmp;
2097 struct dentry *dentry;
2098 struct nameidata nd;
2100 error = user_path_parent(dfd, pathname, &nd, &tmp);
2101 if (error)
2102 goto out_err;
2104 dentry = lookup_create(&nd, 1);
2105 error = PTR_ERR(dentry);
2106 if (IS_ERR(dentry))
2107 goto out_unlock;
2109 if (!IS_POSIXACL(nd.path.dentry->d_inode))
2110 mode &= ~current_umask();
2111 error = mnt_want_write(nd.path.mnt);
2112 if (error)
2113 goto out_dput;
2114 error = security_path_mkdir(&nd.path, dentry, mode);
2115 if (error)
2116 goto out_drop_write;
2117 error = vfs_mkdir(nd.path.dentry->d_inode, dentry, mode);
2118 out_drop_write:
2119 mnt_drop_write(nd.path.mnt);
2120 out_dput:
2121 dput(dentry);
2122 out_unlock:
2123 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2124 path_put(&nd.path);
2125 putname(tmp);
2126 out_err:
2127 return error;
2130 SYSCALL_DEFINE2(mkdir, const char __user *, pathname, int, mode)
2132 return sys_mkdirat(AT_FDCWD, pathname, mode);
2136 * We try to drop the dentry early: we should have
2137 * a usage count of 2 if we're the only user of this
2138 * dentry, and if that is true (possibly after pruning
2139 * the dcache), then we drop the dentry now.
2141 * A low-level filesystem can, if it choses, legally
2142 * do a
2144 * if (!d_unhashed(dentry))
2145 * return -EBUSY;
2147 * if it cannot handle the case of removing a directory
2148 * that is still in use by something else..
2150 void dentry_unhash(struct dentry *dentry)
2152 dget(dentry);
2153 shrink_dcache_parent(dentry);
2154 spin_lock(&dcache_lock);
2155 spin_lock(&dentry->d_lock);
2156 if (atomic_read(&dentry->d_count) == 2)
2157 __d_drop(dentry);
2158 spin_unlock(&dentry->d_lock);
2159 spin_unlock(&dcache_lock);
2162 int vfs_rmdir(struct inode *dir, struct dentry *dentry)
2164 int error = may_delete(dir, dentry, 1);
2166 if (error)
2167 return error;
2169 if (!dir->i_op->rmdir)
2170 return -EPERM;
2172 vfs_dq_init(dir);
2174 mutex_lock(&dentry->d_inode->i_mutex);
2175 dentry_unhash(dentry);
2176 if (d_mountpoint(dentry))
2177 error = -EBUSY;
2178 else {
2179 error = security_inode_rmdir(dir, dentry);
2180 if (!error) {
2181 error = dir->i_op->rmdir(dir, dentry);
2182 if (!error)
2183 dentry->d_inode->i_flags |= S_DEAD;
2186 mutex_unlock(&dentry->d_inode->i_mutex);
2187 if (!error) {
2188 d_delete(dentry);
2190 dput(dentry);
2192 return error;
2195 static long do_rmdir(int dfd, const char __user *pathname)
2197 int error = 0;
2198 char * name;
2199 struct dentry *dentry;
2200 struct nameidata nd;
2202 error = user_path_parent(dfd, pathname, &nd, &name);
2203 if (error)
2204 return error;
2206 switch(nd.last_type) {
2207 case LAST_DOTDOT:
2208 error = -ENOTEMPTY;
2209 goto exit1;
2210 case LAST_DOT:
2211 error = -EINVAL;
2212 goto exit1;
2213 case LAST_ROOT:
2214 error = -EBUSY;
2215 goto exit1;
2218 nd.flags &= ~LOOKUP_PARENT;
2220 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2221 dentry = lookup_hash(&nd);
2222 error = PTR_ERR(dentry);
2223 if (IS_ERR(dentry))
2224 goto exit2;
2225 error = mnt_want_write(nd.path.mnt);
2226 if (error)
2227 goto exit3;
2228 error = security_path_rmdir(&nd.path, dentry);
2229 if (error)
2230 goto exit4;
2231 error = vfs_rmdir(nd.path.dentry->d_inode, dentry);
2232 exit4:
2233 mnt_drop_write(nd.path.mnt);
2234 exit3:
2235 dput(dentry);
2236 exit2:
2237 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2238 exit1:
2239 path_put(&nd.path);
2240 putname(name);
2241 return error;
2244 SYSCALL_DEFINE1(rmdir, const char __user *, pathname)
2246 return do_rmdir(AT_FDCWD, pathname);
2249 int vfs_unlink(struct inode *dir, struct dentry *dentry)
2251 int error = may_delete(dir, dentry, 0);
2253 if (error)
2254 return error;
2256 if (!dir->i_op->unlink)
2257 return -EPERM;
2259 vfs_dq_init(dir);
2261 mutex_lock(&dentry->d_inode->i_mutex);
2262 if (d_mountpoint(dentry))
2263 error = -EBUSY;
2264 else {
2265 error = security_inode_unlink(dir, dentry);
2266 if (!error)
2267 error = dir->i_op->unlink(dir, dentry);
2269 mutex_unlock(&dentry->d_inode->i_mutex);
2271 /* We don't d_delete() NFS sillyrenamed files--they still exist. */
2272 if (!error && !(dentry->d_flags & DCACHE_NFSFS_RENAMED)) {
2273 fsnotify_link_count(dentry->d_inode);
2274 d_delete(dentry);
2277 return error;
2281 * Make sure that the actual truncation of the file will occur outside its
2282 * directory's i_mutex. Truncate can take a long time if there is a lot of
2283 * writeout happening, and we don't want to prevent access to the directory
2284 * while waiting on the I/O.
2286 static long do_unlinkat(int dfd, const char __user *pathname)
2288 int error;
2289 char *name;
2290 struct dentry *dentry;
2291 struct nameidata nd;
2292 struct inode *inode = NULL;
2294 error = user_path_parent(dfd, pathname, &nd, &name);
2295 if (error)
2296 return error;
2298 error = -EISDIR;
2299 if (nd.last_type != LAST_NORM)
2300 goto exit1;
2302 nd.flags &= ~LOOKUP_PARENT;
2304 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2305 dentry = lookup_hash(&nd);
2306 error = PTR_ERR(dentry);
2307 if (!IS_ERR(dentry)) {
2308 /* Why not before? Because we want correct error value */
2309 if (nd.last.name[nd.last.len])
2310 goto slashes;
2311 inode = dentry->d_inode;
2312 if (inode)
2313 atomic_inc(&inode->i_count);
2314 error = mnt_want_write(nd.path.mnt);
2315 if (error)
2316 goto exit2;
2317 error = security_path_unlink(&nd.path, dentry);
2318 if (error)
2319 goto exit3;
2320 error = vfs_unlink(nd.path.dentry->d_inode, dentry);
2321 exit3:
2322 mnt_drop_write(nd.path.mnt);
2323 exit2:
2324 dput(dentry);
2326 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2327 if (inode)
2328 iput(inode); /* truncate the inode here */
2329 exit1:
2330 path_put(&nd.path);
2331 putname(name);
2332 return error;
2334 slashes:
2335 error = !dentry->d_inode ? -ENOENT :
2336 S_ISDIR(dentry->d_inode->i_mode) ? -EISDIR : -ENOTDIR;
2337 goto exit2;
2340 SYSCALL_DEFINE3(unlinkat, int, dfd, const char __user *, pathname, int, flag)
2342 if ((flag & ~AT_REMOVEDIR) != 0)
2343 return -EINVAL;
2345 if (flag & AT_REMOVEDIR)
2346 return do_rmdir(dfd, pathname);
2348 return do_unlinkat(dfd, pathname);
2351 SYSCALL_DEFINE1(unlink, const char __user *, pathname)
2353 return do_unlinkat(AT_FDCWD, pathname);
2356 int vfs_symlink(struct inode *dir, struct dentry *dentry, const char *oldname)
2358 int error = may_create(dir, dentry);
2360 if (error)
2361 return error;
2363 if (!dir->i_op->symlink)
2364 return -EPERM;
2366 error = security_inode_symlink(dir, dentry, oldname);
2367 if (error)
2368 return error;
2370 vfs_dq_init(dir);
2371 error = dir->i_op->symlink(dir, dentry, oldname);
2372 if (!error)
2373 fsnotify_create(dir, dentry);
2374 return error;
2377 SYSCALL_DEFINE3(symlinkat, const char __user *, oldname,
2378 int, newdfd, const char __user *, newname)
2380 int error;
2381 char *from;
2382 char *to;
2383 struct dentry *dentry;
2384 struct nameidata nd;
2386 from = getname(oldname);
2387 if (IS_ERR(from))
2388 return PTR_ERR(from);
2390 error = user_path_parent(newdfd, newname, &nd, &to);
2391 if (error)
2392 goto out_putname;
2394 dentry = lookup_create(&nd, 0);
2395 error = PTR_ERR(dentry);
2396 if (IS_ERR(dentry))
2397 goto out_unlock;
2399 error = mnt_want_write(nd.path.mnt);
2400 if (error)
2401 goto out_dput;
2402 error = security_path_symlink(&nd.path, dentry, from);
2403 if (error)
2404 goto out_drop_write;
2405 error = vfs_symlink(nd.path.dentry->d_inode, dentry, from);
2406 out_drop_write:
2407 mnt_drop_write(nd.path.mnt);
2408 out_dput:
2409 dput(dentry);
2410 out_unlock:
2411 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2412 path_put(&nd.path);
2413 putname(to);
2414 out_putname:
2415 putname(from);
2416 return error;
2419 SYSCALL_DEFINE2(symlink, const char __user *, oldname, const char __user *, newname)
2421 return sys_symlinkat(oldname, AT_FDCWD, newname);
2424 int vfs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *new_dentry)
2426 struct inode *inode = old_dentry->d_inode;
2427 int error;
2429 if (!inode)
2430 return -ENOENT;
2432 error = may_create(dir, new_dentry);
2433 if (error)
2434 return error;
2436 if (dir->i_sb != inode->i_sb)
2437 return -EXDEV;
2440 * A link to an append-only or immutable file cannot be created.
2442 if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
2443 return -EPERM;
2444 if (!dir->i_op->link)
2445 return -EPERM;
2446 if (S_ISDIR(inode->i_mode))
2447 return -EPERM;
2449 error = security_inode_link(old_dentry, dir, new_dentry);
2450 if (error)
2451 return error;
2453 mutex_lock(&inode->i_mutex);
2454 vfs_dq_init(dir);
2455 error = dir->i_op->link(old_dentry, dir, new_dentry);
2456 mutex_unlock(&inode->i_mutex);
2457 if (!error)
2458 fsnotify_link(dir, inode, new_dentry);
2459 return error;
2463 * Hardlinks are often used in delicate situations. We avoid
2464 * security-related surprises by not following symlinks on the
2465 * newname. --KAB
2467 * We don't follow them on the oldname either to be compatible
2468 * with linux 2.0, and to avoid hard-linking to directories
2469 * and other special files. --ADM
2471 SYSCALL_DEFINE5(linkat, int, olddfd, const char __user *, oldname,
2472 int, newdfd, const char __user *, newname, int, flags)
2474 struct dentry *new_dentry;
2475 struct nameidata nd;
2476 struct path old_path;
2477 int error;
2478 char *to;
2480 if ((flags & ~AT_SYMLINK_FOLLOW) != 0)
2481 return -EINVAL;
2483 error = user_path_at(olddfd, oldname,
2484 flags & AT_SYMLINK_FOLLOW ? LOOKUP_FOLLOW : 0,
2485 &old_path);
2486 if (error)
2487 return error;
2489 error = user_path_parent(newdfd, newname, &nd, &to);
2490 if (error)
2491 goto out;
2492 error = -EXDEV;
2493 if (old_path.mnt != nd.path.mnt)
2494 goto out_release;
2495 new_dentry = lookup_create(&nd, 0);
2496 error = PTR_ERR(new_dentry);
2497 if (IS_ERR(new_dentry))
2498 goto out_unlock;
2499 error = mnt_want_write(nd.path.mnt);
2500 if (error)
2501 goto out_dput;
2502 error = security_path_link(old_path.dentry, &nd.path, new_dentry);
2503 if (error)
2504 goto out_drop_write;
2505 error = vfs_link(old_path.dentry, nd.path.dentry->d_inode, new_dentry);
2506 out_drop_write:
2507 mnt_drop_write(nd.path.mnt);
2508 out_dput:
2509 dput(new_dentry);
2510 out_unlock:
2511 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2512 out_release:
2513 path_put(&nd.path);
2514 putname(to);
2515 out:
2516 path_put(&old_path);
2518 return error;
2521 SYSCALL_DEFINE2(link, const char __user *, oldname, const char __user *, newname)
2523 return sys_linkat(AT_FDCWD, oldname, AT_FDCWD, newname, 0);
2527 * The worst of all namespace operations - renaming directory. "Perverted"
2528 * doesn't even start to describe it. Somebody in UCB had a heck of a trip...
2529 * Problems:
2530 * a) we can get into loop creation. Check is done in is_subdir().
2531 * b) race potential - two innocent renames can create a loop together.
2532 * That's where 4.4 screws up. Current fix: serialization on
2533 * sb->s_vfs_rename_mutex. We might be more accurate, but that's another
2534 * story.
2535 * c) we have to lock _three_ objects - parents and victim (if it exists).
2536 * And that - after we got ->i_mutex on parents (until then we don't know
2537 * whether the target exists). Solution: try to be smart with locking
2538 * order for inodes. We rely on the fact that tree topology may change
2539 * only under ->s_vfs_rename_mutex _and_ that parent of the object we
2540 * move will be locked. Thus we can rank directories by the tree
2541 * (ancestors first) and rank all non-directories after them.
2542 * That works since everybody except rename does "lock parent, lookup,
2543 * lock child" and rename is under ->s_vfs_rename_mutex.
2544 * HOWEVER, it relies on the assumption that any object with ->lookup()
2545 * has no more than 1 dentry. If "hybrid" objects will ever appear,
2546 * we'd better make sure that there's no link(2) for them.
2547 * d) some filesystems don't support opened-but-unlinked directories,
2548 * either because of layout or because they are not ready to deal with
2549 * all cases correctly. The latter will be fixed (taking this sort of
2550 * stuff into VFS), but the former is not going away. Solution: the same
2551 * trick as in rmdir().
2552 * e) conversion from fhandle to dentry may come in the wrong moment - when
2553 * we are removing the target. Solution: we will have to grab ->i_mutex
2554 * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on
2555 * ->i_mutex on parents, which works but leads to some truely excessive
2556 * locking].
2558 static int vfs_rename_dir(struct inode *old_dir, struct dentry *old_dentry,
2559 struct inode *new_dir, struct dentry *new_dentry)
2561 int error = 0;
2562 struct inode *target;
2565 * If we are going to change the parent - check write permissions,
2566 * we'll need to flip '..'.
2568 if (new_dir != old_dir) {
2569 error = inode_permission(old_dentry->d_inode, MAY_WRITE);
2570 if (error)
2571 return error;
2574 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2575 if (error)
2576 return error;
2578 target = new_dentry->d_inode;
2579 if (target) {
2580 mutex_lock(&target->i_mutex);
2581 dentry_unhash(new_dentry);
2583 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2584 error = -EBUSY;
2585 else
2586 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2587 if (target) {
2588 if (!error)
2589 target->i_flags |= S_DEAD;
2590 mutex_unlock(&target->i_mutex);
2591 if (d_unhashed(new_dentry))
2592 d_rehash(new_dentry);
2593 dput(new_dentry);
2595 if (!error)
2596 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
2597 d_move(old_dentry,new_dentry);
2598 return error;
2601 static int vfs_rename_other(struct inode *old_dir, struct dentry *old_dentry,
2602 struct inode *new_dir, struct dentry *new_dentry)
2604 struct inode *target;
2605 int error;
2607 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2608 if (error)
2609 return error;
2611 dget(new_dentry);
2612 target = new_dentry->d_inode;
2613 if (target)
2614 mutex_lock(&target->i_mutex);
2615 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2616 error = -EBUSY;
2617 else
2618 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2619 if (!error) {
2620 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
2621 d_move(old_dentry, new_dentry);
2623 if (target)
2624 mutex_unlock(&target->i_mutex);
2625 dput(new_dentry);
2626 return error;
2629 int vfs_rename(struct inode *old_dir, struct dentry *old_dentry,
2630 struct inode *new_dir, struct dentry *new_dentry)
2632 int error;
2633 int is_dir = S_ISDIR(old_dentry->d_inode->i_mode);
2634 const char *old_name;
2636 if (old_dentry->d_inode == new_dentry->d_inode)
2637 return 0;
2639 error = may_delete(old_dir, old_dentry, is_dir);
2640 if (error)
2641 return error;
2643 if (!new_dentry->d_inode)
2644 error = may_create(new_dir, new_dentry);
2645 else
2646 error = may_delete(new_dir, new_dentry, is_dir);
2647 if (error)
2648 return error;
2650 if (!old_dir->i_op->rename)
2651 return -EPERM;
2653 vfs_dq_init(old_dir);
2654 vfs_dq_init(new_dir);
2656 old_name = fsnotify_oldname_init(old_dentry->d_name.name);
2658 if (is_dir)
2659 error = vfs_rename_dir(old_dir,old_dentry,new_dir,new_dentry);
2660 else
2661 error = vfs_rename_other(old_dir,old_dentry,new_dir,new_dentry);
2662 if (!error) {
2663 const char *new_name = old_dentry->d_name.name;
2664 fsnotify_move(old_dir, new_dir, old_name, new_name, is_dir,
2665 new_dentry->d_inode, old_dentry);
2667 fsnotify_oldname_free(old_name);
2669 return error;
2672 SYSCALL_DEFINE4(renameat, int, olddfd, const char __user *, oldname,
2673 int, newdfd, const char __user *, newname)
2675 struct dentry *old_dir, *new_dir;
2676 struct dentry *old_dentry, *new_dentry;
2677 struct dentry *trap;
2678 struct nameidata oldnd, newnd;
2679 char *from;
2680 char *to;
2681 int error;
2683 error = user_path_parent(olddfd, oldname, &oldnd, &from);
2684 if (error)
2685 goto exit;
2687 error = user_path_parent(newdfd, newname, &newnd, &to);
2688 if (error)
2689 goto exit1;
2691 error = -EXDEV;
2692 if (oldnd.path.mnt != newnd.path.mnt)
2693 goto exit2;
2695 old_dir = oldnd.path.dentry;
2696 error = -EBUSY;
2697 if (oldnd.last_type != LAST_NORM)
2698 goto exit2;
2700 new_dir = newnd.path.dentry;
2701 if (newnd.last_type != LAST_NORM)
2702 goto exit2;
2704 oldnd.flags &= ~LOOKUP_PARENT;
2705 newnd.flags &= ~LOOKUP_PARENT;
2706 newnd.flags |= LOOKUP_RENAME_TARGET;
2708 trap = lock_rename(new_dir, old_dir);
2710 old_dentry = lookup_hash(&oldnd);
2711 error = PTR_ERR(old_dentry);
2712 if (IS_ERR(old_dentry))
2713 goto exit3;
2714 /* source must exist */
2715 error = -ENOENT;
2716 if (!old_dentry->d_inode)
2717 goto exit4;
2718 /* unless the source is a directory trailing slashes give -ENOTDIR */
2719 if (!S_ISDIR(old_dentry->d_inode->i_mode)) {
2720 error = -ENOTDIR;
2721 if (oldnd.last.name[oldnd.last.len])
2722 goto exit4;
2723 if (newnd.last.name[newnd.last.len])
2724 goto exit4;
2726 /* source should not be ancestor of target */
2727 error = -EINVAL;
2728 if (old_dentry == trap)
2729 goto exit4;
2730 new_dentry = lookup_hash(&newnd);
2731 error = PTR_ERR(new_dentry);
2732 if (IS_ERR(new_dentry))
2733 goto exit4;
2734 /* target should not be an ancestor of source */
2735 error = -ENOTEMPTY;
2736 if (new_dentry == trap)
2737 goto exit5;
2739 error = mnt_want_write(oldnd.path.mnt);
2740 if (error)
2741 goto exit5;
2742 error = security_path_rename(&oldnd.path, old_dentry,
2743 &newnd.path, new_dentry);
2744 if (error)
2745 goto exit6;
2746 error = vfs_rename(old_dir->d_inode, old_dentry,
2747 new_dir->d_inode, new_dentry);
2748 exit6:
2749 mnt_drop_write(oldnd.path.mnt);
2750 exit5:
2751 dput(new_dentry);
2752 exit4:
2753 dput(old_dentry);
2754 exit3:
2755 unlock_rename(new_dir, old_dir);
2756 exit2:
2757 path_put(&newnd.path);
2758 putname(to);
2759 exit1:
2760 path_put(&oldnd.path);
2761 putname(from);
2762 exit:
2763 return error;
2766 SYSCALL_DEFINE2(rename, const char __user *, oldname, const char __user *, newname)
2768 return sys_renameat(AT_FDCWD, oldname, AT_FDCWD, newname);
2771 int vfs_readlink(struct dentry *dentry, char __user *buffer, int buflen, const char *link)
2773 int len;
2775 len = PTR_ERR(link);
2776 if (IS_ERR(link))
2777 goto out;
2779 len = strlen(link);
2780 if (len > (unsigned) buflen)
2781 len = buflen;
2782 if (copy_to_user(buffer, link, len))
2783 len = -EFAULT;
2784 out:
2785 return len;
2789 * A helper for ->readlink(). This should be used *ONLY* for symlinks that
2790 * have ->follow_link() touching nd only in nd_set_link(). Using (or not
2791 * using) it for any given inode is up to filesystem.
2793 int generic_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2795 struct nameidata nd;
2796 void *cookie;
2797 int res;
2799 nd.depth = 0;
2800 cookie = dentry->d_inode->i_op->follow_link(dentry, &nd);
2801 if (IS_ERR(cookie))
2802 return PTR_ERR(cookie);
2804 res = vfs_readlink(dentry, buffer, buflen, nd_get_link(&nd));
2805 if (dentry->d_inode->i_op->put_link)
2806 dentry->d_inode->i_op->put_link(dentry, &nd, cookie);
2807 return res;
2810 int vfs_follow_link(struct nameidata *nd, const char *link)
2812 return __vfs_follow_link(nd, link);
2815 /* get the link contents into pagecache */
2816 static char *page_getlink(struct dentry * dentry, struct page **ppage)
2818 char *kaddr;
2819 struct page *page;
2820 struct address_space *mapping = dentry->d_inode->i_mapping;
2821 page = read_mapping_page(mapping, 0, NULL);
2822 if (IS_ERR(page))
2823 return (char*)page;
2824 *ppage = page;
2825 kaddr = kmap(page);
2826 nd_terminate_link(kaddr, dentry->d_inode->i_size, PAGE_SIZE - 1);
2827 return kaddr;
2830 int page_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2832 struct page *page = NULL;
2833 char *s = page_getlink(dentry, &page);
2834 int res = vfs_readlink(dentry,buffer,buflen,s);
2835 if (page) {
2836 kunmap(page);
2837 page_cache_release(page);
2839 return res;
2842 void *page_follow_link_light(struct dentry *dentry, struct nameidata *nd)
2844 struct page *page = NULL;
2845 nd_set_link(nd, page_getlink(dentry, &page));
2846 return page;
2849 void page_put_link(struct dentry *dentry, struct nameidata *nd, void *cookie)
2851 struct page *page = cookie;
2853 if (page) {
2854 kunmap(page);
2855 page_cache_release(page);
2860 * The nofs argument instructs pagecache_write_begin to pass AOP_FLAG_NOFS
2862 int __page_symlink(struct inode *inode, const char *symname, int len, int nofs)
2864 struct address_space *mapping = inode->i_mapping;
2865 struct page *page;
2866 void *fsdata;
2867 int err;
2868 char *kaddr;
2869 unsigned int flags = AOP_FLAG_UNINTERRUPTIBLE;
2870 if (nofs)
2871 flags |= AOP_FLAG_NOFS;
2873 retry:
2874 err = pagecache_write_begin(NULL, mapping, 0, len-1,
2875 flags, &page, &fsdata);
2876 if (err)
2877 goto fail;
2879 kaddr = kmap_atomic(page, KM_USER0);
2880 memcpy(kaddr, symname, len-1);
2881 kunmap_atomic(kaddr, KM_USER0);
2883 err = pagecache_write_end(NULL, mapping, 0, len-1, len-1,
2884 page, fsdata);
2885 if (err < 0)
2886 goto fail;
2887 if (err < len-1)
2888 goto retry;
2890 mark_inode_dirty(inode);
2891 return 0;
2892 fail:
2893 return err;
2896 int page_symlink(struct inode *inode, const char *symname, int len)
2898 return __page_symlink(inode, symname, len,
2899 !(mapping_gfp_mask(inode->i_mapping) & __GFP_FS));
2902 const struct inode_operations page_symlink_inode_operations = {
2903 .readlink = generic_readlink,
2904 .follow_link = page_follow_link_light,
2905 .put_link = page_put_link,
2908 EXPORT_SYMBOL(user_path_at);
2909 EXPORT_SYMBOL(follow_down);
2910 EXPORT_SYMBOL(follow_up);
2911 EXPORT_SYMBOL(get_write_access); /* binfmt_aout */
2912 EXPORT_SYMBOL(getname);
2913 EXPORT_SYMBOL(lock_rename);
2914 EXPORT_SYMBOL(lookup_one_len);
2915 EXPORT_SYMBOL(page_follow_link_light);
2916 EXPORT_SYMBOL(page_put_link);
2917 EXPORT_SYMBOL(page_readlink);
2918 EXPORT_SYMBOL(__page_symlink);
2919 EXPORT_SYMBOL(page_symlink);
2920 EXPORT_SYMBOL(page_symlink_inode_operations);
2921 EXPORT_SYMBOL(path_lookup);
2922 EXPORT_SYMBOL(kern_path);
2923 EXPORT_SYMBOL(vfs_path_lookup);
2924 EXPORT_SYMBOL(inode_permission);
2925 EXPORT_SYMBOL(file_permission);
2926 EXPORT_SYMBOL(unlock_rename);
2927 EXPORT_SYMBOL(vfs_create);
2928 EXPORT_SYMBOL(vfs_follow_link);
2929 EXPORT_SYMBOL(vfs_link);
2930 EXPORT_SYMBOL(vfs_mkdir);
2931 EXPORT_SYMBOL(vfs_mknod);
2932 EXPORT_SYMBOL(generic_permission);
2933 EXPORT_SYMBOL(vfs_readlink);
2934 EXPORT_SYMBOL(vfs_rename);
2935 EXPORT_SYMBOL(vfs_rmdir);
2936 EXPORT_SYMBOL(vfs_symlink);
2937 EXPORT_SYMBOL(vfs_unlink);
2938 EXPORT_SYMBOL(dentry_unhash);
2939 EXPORT_SYMBOL(generic_readlink);