HID: ACRUX - activate the device immediately after binding
[linux-2.6/kvm.git] / fs / namei.c
blob0b14f6910fc68363cfd6da4799d9a0782b342be0
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/pagemap.h>
23 #include <linux/fsnotify.h>
24 #include <linux/personality.h>
25 #include <linux/security.h>
26 #include <linux/ima.h>
27 #include <linux/syscalls.h>
28 #include <linux/mount.h>
29 #include <linux/audit.h>
30 #include <linux/capability.h>
31 #include <linux/file.h>
32 #include <linux/fcntl.h>
33 #include <linux/device_cgroup.h>
34 #include <linux/fs_struct.h>
35 #include <asm/uaccess.h>
37 #include "internal.h"
39 /* [Feb-1997 T. Schoebel-Theuer]
40 * Fundamental changes in the pathname lookup mechanisms (namei)
41 * were necessary because of omirr. The reason is that omirr needs
42 * to know the _real_ pathname, not the user-supplied one, in case
43 * of symlinks (and also when transname replacements occur).
45 * The new code replaces the old recursive symlink resolution with
46 * an iterative one (in case of non-nested symlink chains). It does
47 * this with calls to <fs>_follow_link().
48 * As a side effect, dir_namei(), _namei() and follow_link() are now
49 * replaced with a single function lookup_dentry() that can handle all
50 * the special cases of the former code.
52 * With the new dcache, the pathname is stored at each inode, at least as
53 * long as the refcount of the inode is positive. As a side effect, the
54 * size of the dcache depends on the inode cache and thus is dynamic.
56 * [29-Apr-1998 C. Scott Ananian] Updated above description of symlink
57 * resolution to correspond with current state of the code.
59 * Note that the symlink resolution is not *completely* iterative.
60 * There is still a significant amount of tail- and mid- recursion in
61 * the algorithm. Also, note that <fs>_readlink() is not used in
62 * lookup_dentry(): lookup_dentry() on the result of <fs>_readlink()
63 * may return different results than <fs>_follow_link(). Many virtual
64 * filesystems (including /proc) exhibit this behavior.
67 /* [24-Feb-97 T. Schoebel-Theuer] Side effects caused by new implementation:
68 * New symlink semantics: when open() is called with flags O_CREAT | O_EXCL
69 * and the name already exists in form of a symlink, try to create the new
70 * name indicated by the symlink. The old code always complained that the
71 * name already exists, due to not following the symlink even if its target
72 * is nonexistent. The new semantics affects also mknod() and link() when
73 * the name is a symlink pointing to a non-existant name.
75 * I don't know which semantics is the right one, since I have no access
76 * to standards. But I found by trial that HP-UX 9.0 has the full "new"
77 * semantics implemented, while SunOS 4.1.1 and Solaris (SunOS 5.4) have the
78 * "old" one. Personally, I think the new semantics is much more logical.
79 * Note that "ln old new" where "new" is a symlink pointing to a non-existing
80 * file does succeed in both HP-UX and SunOs, but not in Solaris
81 * and in the old Linux semantics.
84 /* [16-Dec-97 Kevin Buhr] For security reasons, we change some symlink
85 * semantics. See the comments in "open_namei" and "do_link" below.
87 * [10-Sep-98 Alan Modra] Another symlink change.
90 /* [Feb-Apr 2000 AV] Complete rewrite. Rules for symlinks:
91 * inside the path - always follow.
92 * in the last component in creation/removal/renaming - never follow.
93 * if LOOKUP_FOLLOW passed - follow.
94 * if the pathname has trailing slashes - follow.
95 * otherwise - don't follow.
96 * (applied in that order).
98 * [Jun 2000 AV] Inconsistent behaviour of open() in case if flags==O_CREAT
99 * restored for 2.4. This is the last surviving part of old 4.2BSD bug.
100 * During the 2.4 we need to fix the userland stuff depending on it -
101 * hopefully we will be able to get rid of that wart in 2.5. So far only
102 * XEmacs seems to be relying on it...
105 * [Sep 2001 AV] Single-semaphore locking scheme (kudos to David Holland)
106 * implemented. Let's see if raised priority of ->s_vfs_rename_mutex gives
107 * any extra contention...
110 /* In order to reduce some races, while at the same time doing additional
111 * checking and hopefully speeding things up, we copy filenames to the
112 * kernel data space before using them..
114 * POSIX.1 2.4: an empty pathname is invalid (ENOENT).
115 * PATH_MAX includes the nul terminator --RR.
117 static int do_getname(const char __user *filename, char *page)
119 int retval;
120 unsigned long len = PATH_MAX;
122 if (!segment_eq(get_fs(), KERNEL_DS)) {
123 if ((unsigned long) filename >= TASK_SIZE)
124 return -EFAULT;
125 if (TASK_SIZE - (unsigned long) filename < PATH_MAX)
126 len = TASK_SIZE - (unsigned long) filename;
129 retval = strncpy_from_user(page, filename, len);
130 if (retval > 0) {
131 if (retval < len)
132 return 0;
133 return -ENAMETOOLONG;
134 } else if (!retval)
135 retval = -ENOENT;
136 return retval;
139 char * getname(const char __user * filename)
141 char *tmp, *result;
143 result = ERR_PTR(-ENOMEM);
144 tmp = __getname();
145 if (tmp) {
146 int retval = do_getname(filename, tmp);
148 result = tmp;
149 if (retval < 0) {
150 __putname(tmp);
151 result = ERR_PTR(retval);
154 audit_getname(result);
155 return result;
158 #ifdef CONFIG_AUDITSYSCALL
159 void putname(const char *name)
161 if (unlikely(!audit_dummy_context()))
162 audit_putname(name);
163 else
164 __putname(name);
166 EXPORT_SYMBOL(putname);
167 #endif
170 * This does basic POSIX ACL permission checking
172 static int acl_permission_check(struct inode *inode, int mask, unsigned int flags,
173 int (*check_acl)(struct inode *inode, int mask, unsigned int flags))
175 umode_t mode = inode->i_mode;
177 mask &= MAY_READ | MAY_WRITE | MAY_EXEC;
179 if (current_fsuid() == inode->i_uid)
180 mode >>= 6;
181 else {
182 if (IS_POSIXACL(inode) && (mode & S_IRWXG) && check_acl) {
183 int error = check_acl(inode, mask, flags);
184 if (error != -EAGAIN)
185 return error;
188 if (in_group_p(inode->i_gid))
189 mode >>= 3;
193 * If the DACs are ok we don't need any capability check.
195 if ((mask & ~mode) == 0)
196 return 0;
197 return -EACCES;
201 * generic_permission - check for access rights on a Posix-like filesystem
202 * @inode: inode to check access rights for
203 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
204 * @check_acl: optional callback to check for Posix ACLs
205 * @flags: IPERM_FLAG_ flags.
207 * Used to check for read/write/execute permissions on a file.
208 * We use "fsuid" for this, letting us set arbitrary permissions
209 * for filesystem access without changing the "normal" uids which
210 * are used for other things.
212 * generic_permission is rcu-walk aware. It returns -ECHILD in case an rcu-walk
213 * request cannot be satisfied (eg. requires blocking or too much complexity).
214 * It would then be called again in ref-walk mode.
216 int generic_permission(struct inode *inode, int mask, unsigned int flags,
217 int (*check_acl)(struct inode *inode, int mask, unsigned int flags))
219 int ret;
222 * Do the basic POSIX ACL permission checks.
224 ret = acl_permission_check(inode, mask, flags, check_acl);
225 if (ret != -EACCES)
226 return ret;
229 * Read/write DACs are always overridable.
230 * Executable DACs are overridable if at least one exec bit is set.
232 if (!(mask & MAY_EXEC) || execute_ok(inode))
233 if (capable(CAP_DAC_OVERRIDE))
234 return 0;
237 * Searching includes executable on directories, else just read.
239 mask &= MAY_READ | MAY_WRITE | MAY_EXEC;
240 if (mask == MAY_READ || (S_ISDIR(inode->i_mode) && !(mask & MAY_WRITE)))
241 if (capable(CAP_DAC_READ_SEARCH))
242 return 0;
244 return -EACCES;
248 * inode_permission - check for access rights to a given inode
249 * @inode: inode to check permission on
250 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
252 * Used to check for read/write/execute permissions on an inode.
253 * We use "fsuid" for this, letting us set arbitrary permissions
254 * for filesystem access without changing the "normal" uids which
255 * are used for other things.
257 int inode_permission(struct inode *inode, int mask)
259 int retval;
261 if (mask & MAY_WRITE) {
262 umode_t mode = inode->i_mode;
265 * Nobody gets write access to a read-only fs.
267 if (IS_RDONLY(inode) &&
268 (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode)))
269 return -EROFS;
272 * Nobody gets write access to an immutable file.
274 if (IS_IMMUTABLE(inode))
275 return -EACCES;
278 if (inode->i_op->permission)
279 retval = inode->i_op->permission(inode, mask, 0);
280 else
281 retval = generic_permission(inode, mask, 0,
282 inode->i_op->check_acl);
284 if (retval)
285 return retval;
287 retval = devcgroup_inode_permission(inode, mask);
288 if (retval)
289 return retval;
291 return security_inode_permission(inode, mask);
295 * file_permission - check for additional access rights to a given file
296 * @file: file to check access rights for
297 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
299 * Used to check for read/write/execute permissions on an already opened
300 * file.
302 * Note:
303 * Do not use this function in new code. All access checks should
304 * be done using inode_permission().
306 int file_permission(struct file *file, int mask)
308 return inode_permission(file->f_path.dentry->d_inode, mask);
312 * get_write_access() gets write permission for a file.
313 * put_write_access() releases this write permission.
314 * This is used for regular files.
315 * We cannot support write (and maybe mmap read-write shared) accesses and
316 * MAP_DENYWRITE mmappings simultaneously. The i_writecount field of an inode
317 * can have the following values:
318 * 0: no writers, no VM_DENYWRITE mappings
319 * < 0: (-i_writecount) vm_area_structs with VM_DENYWRITE set exist
320 * > 0: (i_writecount) users are writing to the file.
322 * Normally we operate on that counter with atomic_{inc,dec} and it's safe
323 * except for the cases where we don't hold i_writecount yet. Then we need to
324 * use {get,deny}_write_access() - these functions check the sign and refuse
325 * to do the change if sign is wrong. Exclusion between them is provided by
326 * the inode->i_lock spinlock.
329 int get_write_access(struct inode * inode)
331 spin_lock(&inode->i_lock);
332 if (atomic_read(&inode->i_writecount) < 0) {
333 spin_unlock(&inode->i_lock);
334 return -ETXTBSY;
336 atomic_inc(&inode->i_writecount);
337 spin_unlock(&inode->i_lock);
339 return 0;
342 int deny_write_access(struct file * file)
344 struct inode *inode = file->f_path.dentry->d_inode;
346 spin_lock(&inode->i_lock);
347 if (atomic_read(&inode->i_writecount) > 0) {
348 spin_unlock(&inode->i_lock);
349 return -ETXTBSY;
351 atomic_dec(&inode->i_writecount);
352 spin_unlock(&inode->i_lock);
354 return 0;
358 * path_get - get a reference to a path
359 * @path: path to get the reference to
361 * Given a path increment the reference count to the dentry and the vfsmount.
363 void path_get(struct path *path)
365 mntget(path->mnt);
366 dget(path->dentry);
368 EXPORT_SYMBOL(path_get);
371 * path_get_long - get a long reference to a path
372 * @path: path to get the reference to
374 * Given a path increment the reference count to the dentry and the vfsmount.
376 void path_get_long(struct path *path)
378 mntget_long(path->mnt);
379 dget(path->dentry);
383 * path_put - put a reference to a path
384 * @path: path to put the reference to
386 * Given a path decrement the reference count to the dentry and the vfsmount.
388 void path_put(struct path *path)
390 dput(path->dentry);
391 mntput(path->mnt);
393 EXPORT_SYMBOL(path_put);
396 * path_put_long - put a long reference to a path
397 * @path: path to put the reference to
399 * Given a path decrement the reference count to the dentry and the vfsmount.
401 void path_put_long(struct path *path)
403 dput(path->dentry);
404 mntput_long(path->mnt);
408 * nameidata_drop_rcu - drop this nameidata out of rcu-walk
409 * @nd: nameidata pathwalk data to drop
410 * Returns: 0 on success, -ECHILD on failure
412 * Path walking has 2 modes, rcu-walk and ref-walk (see
413 * Documentation/filesystems/path-lookup.txt). __drop_rcu* functions attempt
414 * to drop out of rcu-walk mode and take normal reference counts on dentries
415 * and vfsmounts to transition to rcu-walk mode. __drop_rcu* functions take
416 * refcounts at the last known good point before rcu-walk got stuck, so
417 * ref-walk may continue from there. If this is not successful (eg. a seqcount
418 * has changed), then failure is returned and path walk restarts from the
419 * beginning in ref-walk mode.
421 * nameidata_drop_rcu attempts to drop the current nd->path and nd->root into
422 * ref-walk. Must be called from rcu-walk context.
424 static int nameidata_drop_rcu(struct nameidata *nd)
426 struct fs_struct *fs = current->fs;
427 struct dentry *dentry = nd->path.dentry;
429 BUG_ON(!(nd->flags & LOOKUP_RCU));
430 if (nd->root.mnt) {
431 spin_lock(&fs->lock);
432 if (nd->root.mnt != fs->root.mnt ||
433 nd->root.dentry != fs->root.dentry)
434 goto err_root;
436 spin_lock(&dentry->d_lock);
437 if (!__d_rcu_to_refcount(dentry, nd->seq))
438 goto err;
439 BUG_ON(nd->inode != dentry->d_inode);
440 spin_unlock(&dentry->d_lock);
441 if (nd->root.mnt) {
442 path_get(&nd->root);
443 spin_unlock(&fs->lock);
445 mntget(nd->path.mnt);
447 rcu_read_unlock();
448 br_read_unlock(vfsmount_lock);
449 nd->flags &= ~LOOKUP_RCU;
450 return 0;
451 err:
452 spin_unlock(&dentry->d_lock);
453 err_root:
454 if (nd->root.mnt)
455 spin_unlock(&fs->lock);
456 return -ECHILD;
459 /* Try to drop out of rcu-walk mode if we were in it, otherwise do nothing. */
460 static inline int nameidata_drop_rcu_maybe(struct nameidata *nd)
462 if (nd->flags & LOOKUP_RCU)
463 return nameidata_drop_rcu(nd);
464 return 0;
468 * nameidata_dentry_drop_rcu - drop nameidata and dentry out of rcu-walk
469 * @nd: nameidata pathwalk data to drop
470 * @dentry: dentry to drop
471 * Returns: 0 on success, -ECHILD on failure
473 * nameidata_dentry_drop_rcu attempts to drop the current nd->path and nd->root,
474 * and dentry into ref-walk. @dentry must be a path found by a do_lookup call on
475 * @nd. Must be called from rcu-walk context.
477 static int nameidata_dentry_drop_rcu(struct nameidata *nd, struct dentry *dentry)
479 struct fs_struct *fs = current->fs;
480 struct dentry *parent = nd->path.dentry;
482 BUG_ON(!(nd->flags & LOOKUP_RCU));
483 if (nd->root.mnt) {
484 spin_lock(&fs->lock);
485 if (nd->root.mnt != fs->root.mnt ||
486 nd->root.dentry != fs->root.dentry)
487 goto err_root;
489 spin_lock(&parent->d_lock);
490 spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
491 if (!__d_rcu_to_refcount(dentry, nd->seq))
492 goto err;
494 * If the sequence check on the child dentry passed, then the child has
495 * not been removed from its parent. This means the parent dentry must
496 * be valid and able to take a reference at this point.
498 BUG_ON(!IS_ROOT(dentry) && dentry->d_parent != parent);
499 BUG_ON(!parent->d_count);
500 parent->d_count++;
501 spin_unlock(&dentry->d_lock);
502 spin_unlock(&parent->d_lock);
503 if (nd->root.mnt) {
504 path_get(&nd->root);
505 spin_unlock(&fs->lock);
507 mntget(nd->path.mnt);
509 rcu_read_unlock();
510 br_read_unlock(vfsmount_lock);
511 nd->flags &= ~LOOKUP_RCU;
512 return 0;
513 err:
514 spin_unlock(&dentry->d_lock);
515 spin_unlock(&parent->d_lock);
516 err_root:
517 if (nd->root.mnt)
518 spin_unlock(&fs->lock);
519 return -ECHILD;
522 /* Try to drop out of rcu-walk mode if we were in it, otherwise do nothing. */
523 static inline int nameidata_dentry_drop_rcu_maybe(struct nameidata *nd, struct dentry *dentry)
525 if (nd->flags & LOOKUP_RCU)
526 return nameidata_dentry_drop_rcu(nd, dentry);
527 return 0;
531 * nameidata_drop_rcu_last - drop nameidata ending path walk out of rcu-walk
532 * @nd: nameidata pathwalk data to drop
533 * Returns: 0 on success, -ECHILD on failure
535 * nameidata_drop_rcu_last attempts to drop the current nd->path into ref-walk.
536 * nd->path should be the final element of the lookup, so nd->root is discarded.
537 * Must be called from rcu-walk context.
539 static int nameidata_drop_rcu_last(struct nameidata *nd)
541 struct dentry *dentry = nd->path.dentry;
543 BUG_ON(!(nd->flags & LOOKUP_RCU));
544 nd->flags &= ~LOOKUP_RCU;
545 nd->root.mnt = NULL;
546 spin_lock(&dentry->d_lock);
547 if (!__d_rcu_to_refcount(dentry, nd->seq))
548 goto err_unlock;
549 BUG_ON(nd->inode != dentry->d_inode);
550 spin_unlock(&dentry->d_lock);
552 mntget(nd->path.mnt);
554 rcu_read_unlock();
555 br_read_unlock(vfsmount_lock);
557 return 0;
559 err_unlock:
560 spin_unlock(&dentry->d_lock);
561 rcu_read_unlock();
562 br_read_unlock(vfsmount_lock);
563 return -ECHILD;
566 /* Try to drop out of rcu-walk mode if we were in it, otherwise do nothing. */
567 static inline int nameidata_drop_rcu_last_maybe(struct nameidata *nd)
569 if (likely(nd->flags & LOOKUP_RCU))
570 return nameidata_drop_rcu_last(nd);
571 return 0;
575 * release_open_intent - free up open intent resources
576 * @nd: pointer to nameidata
578 void release_open_intent(struct nameidata *nd)
580 if (nd->intent.open.file->f_path.dentry == NULL)
581 put_filp(nd->intent.open.file);
582 else
583 fput(nd->intent.open.file);
586 static int d_revalidate(struct dentry *dentry, struct nameidata *nd)
588 int status;
590 status = dentry->d_op->d_revalidate(dentry, nd);
591 if (status == -ECHILD) {
592 if (nameidata_dentry_drop_rcu(nd, dentry))
593 return status;
594 status = dentry->d_op->d_revalidate(dentry, nd);
597 return status;
600 static inline struct dentry *
601 do_revalidate(struct dentry *dentry, struct nameidata *nd)
603 int status;
605 status = d_revalidate(dentry, nd);
606 if (unlikely(status <= 0)) {
608 * The dentry failed validation.
609 * If d_revalidate returned 0 attempt to invalidate
610 * the dentry otherwise d_revalidate is asking us
611 * to return a fail status.
613 if (status < 0) {
614 /* If we're in rcu-walk, we don't have a ref */
615 if (!(nd->flags & LOOKUP_RCU))
616 dput(dentry);
617 dentry = ERR_PTR(status);
619 } else {
620 /* Don't d_invalidate in rcu-walk mode */
621 if (nameidata_dentry_drop_rcu_maybe(nd, dentry))
622 return ERR_PTR(-ECHILD);
623 if (!d_invalidate(dentry)) {
624 dput(dentry);
625 dentry = NULL;
629 return dentry;
632 static inline int need_reval_dot(struct dentry *dentry)
634 if (likely(!(dentry->d_flags & DCACHE_OP_REVALIDATE)))
635 return 0;
637 if (likely(!(dentry->d_sb->s_type->fs_flags & FS_REVAL_DOT)))
638 return 0;
640 return 1;
644 * force_reval_path - force revalidation of a dentry
646 * In some situations the path walking code will trust dentries without
647 * revalidating them. This causes problems for filesystems that depend on
648 * d_revalidate to handle file opens (e.g. NFSv4). When FS_REVAL_DOT is set
649 * (which indicates that it's possible for the dentry to go stale), force
650 * a d_revalidate call before proceeding.
652 * Returns 0 if the revalidation was successful. If the revalidation fails,
653 * either return the error returned by d_revalidate or -ESTALE if the
654 * revalidation it just returned 0. If d_revalidate returns 0, we attempt to
655 * invalidate the dentry. It's up to the caller to handle putting references
656 * to the path if necessary.
658 static int
659 force_reval_path(struct path *path, struct nameidata *nd)
661 int status;
662 struct dentry *dentry = path->dentry;
665 * only check on filesystems where it's possible for the dentry to
666 * become stale.
668 if (!need_reval_dot(dentry))
669 return 0;
671 status = d_revalidate(dentry, nd);
672 if (status > 0)
673 return 0;
675 if (!status) {
676 d_invalidate(dentry);
677 status = -ESTALE;
679 return status;
683 * Short-cut version of permission(), for calling on directories
684 * during pathname resolution. Combines parts of permission()
685 * and generic_permission(), and tests ONLY for MAY_EXEC permission.
687 * If appropriate, check DAC only. If not appropriate, or
688 * short-cut DAC fails, then call ->permission() to do more
689 * complete permission check.
691 static inline int exec_permission(struct inode *inode, unsigned int flags)
693 int ret;
695 if (inode->i_op->permission) {
696 ret = inode->i_op->permission(inode, MAY_EXEC, flags);
697 } else {
698 ret = acl_permission_check(inode, MAY_EXEC, flags,
699 inode->i_op->check_acl);
701 if (likely(!ret))
702 goto ok;
703 if (ret == -ECHILD)
704 return ret;
706 if (capable(CAP_DAC_OVERRIDE) || capable(CAP_DAC_READ_SEARCH))
707 goto ok;
709 return ret;
711 return security_inode_exec_permission(inode, flags);
714 static __always_inline void set_root(struct nameidata *nd)
716 if (!nd->root.mnt)
717 get_fs_root(current->fs, &nd->root);
720 static int link_path_walk(const char *, struct nameidata *);
722 static __always_inline void set_root_rcu(struct nameidata *nd)
724 if (!nd->root.mnt) {
725 struct fs_struct *fs = current->fs;
726 unsigned seq;
728 do {
729 seq = read_seqcount_begin(&fs->seq);
730 nd->root = fs->root;
731 } while (read_seqcount_retry(&fs->seq, seq));
735 static __always_inline int __vfs_follow_link(struct nameidata *nd, const char *link)
737 int ret;
739 if (IS_ERR(link))
740 goto fail;
742 if (*link == '/') {
743 set_root(nd);
744 path_put(&nd->path);
745 nd->path = nd->root;
746 path_get(&nd->root);
748 nd->inode = nd->path.dentry->d_inode;
750 ret = link_path_walk(link, nd);
751 return ret;
752 fail:
753 path_put(&nd->path);
754 return PTR_ERR(link);
757 static void path_put_conditional(struct path *path, struct nameidata *nd)
759 dput(path->dentry);
760 if (path->mnt != nd->path.mnt)
761 mntput(path->mnt);
764 static inline void path_to_nameidata(struct path *path, struct nameidata *nd)
766 if (!(nd->flags & LOOKUP_RCU)) {
767 dput(nd->path.dentry);
768 if (nd->path.mnt != path->mnt)
769 mntput(nd->path.mnt);
771 nd->path.mnt = path->mnt;
772 nd->path.dentry = path->dentry;
775 static __always_inline int
776 __do_follow_link(struct path *path, struct nameidata *nd, void **p)
778 int error;
779 struct dentry *dentry = path->dentry;
781 touch_atime(path->mnt, dentry);
782 nd_set_link(nd, NULL);
784 if (path->mnt != nd->path.mnt) {
785 path_to_nameidata(path, nd);
786 nd->inode = nd->path.dentry->d_inode;
787 dget(dentry);
789 mntget(path->mnt);
791 nd->last_type = LAST_BIND;
792 *p = dentry->d_inode->i_op->follow_link(dentry, nd);
793 error = PTR_ERR(*p);
794 if (!IS_ERR(*p)) {
795 char *s = nd_get_link(nd);
796 error = 0;
797 if (s)
798 error = __vfs_follow_link(nd, s);
799 else if (nd->last_type == LAST_BIND) {
800 error = force_reval_path(&nd->path, nd);
801 if (error)
802 path_put(&nd->path);
805 return error;
809 * This limits recursive symlink follows to 8, while
810 * limiting consecutive symlinks to 40.
812 * Without that kind of total limit, nasty chains of consecutive
813 * symlinks can cause almost arbitrarily long lookups.
815 static inline int do_follow_link(struct path *path, struct nameidata *nd)
817 void *cookie;
818 int err = -ELOOP;
819 if (current->link_count >= MAX_NESTED_LINKS)
820 goto loop;
821 if (current->total_link_count >= 40)
822 goto loop;
823 BUG_ON(nd->depth >= MAX_NESTED_LINKS);
824 cond_resched();
825 err = security_inode_follow_link(path->dentry, nd);
826 if (err)
827 goto loop;
828 current->link_count++;
829 current->total_link_count++;
830 nd->depth++;
831 err = __do_follow_link(path, nd, &cookie);
832 if (!IS_ERR(cookie) && path->dentry->d_inode->i_op->put_link)
833 path->dentry->d_inode->i_op->put_link(path->dentry, nd, cookie);
834 path_put(path);
835 current->link_count--;
836 nd->depth--;
837 return err;
838 loop:
839 path_put_conditional(path, nd);
840 path_put(&nd->path);
841 return err;
844 static int follow_up_rcu(struct path *path)
846 struct vfsmount *parent;
847 struct dentry *mountpoint;
849 parent = path->mnt->mnt_parent;
850 if (parent == path->mnt)
851 return 0;
852 mountpoint = path->mnt->mnt_mountpoint;
853 path->dentry = mountpoint;
854 path->mnt = parent;
855 return 1;
858 int follow_up(struct path *path)
860 struct vfsmount *parent;
861 struct dentry *mountpoint;
863 br_read_lock(vfsmount_lock);
864 parent = path->mnt->mnt_parent;
865 if (parent == path->mnt) {
866 br_read_unlock(vfsmount_lock);
867 return 0;
869 mntget(parent);
870 mountpoint = dget(path->mnt->mnt_mountpoint);
871 br_read_unlock(vfsmount_lock);
872 dput(path->dentry);
873 path->dentry = mountpoint;
874 mntput(path->mnt);
875 path->mnt = parent;
876 return 1;
880 * serialization is taken care of in namespace.c
882 static void __follow_mount_rcu(struct nameidata *nd, struct path *path,
883 struct inode **inode)
885 while (d_mountpoint(path->dentry)) {
886 struct vfsmount *mounted;
887 mounted = __lookup_mnt(path->mnt, path->dentry, 1);
888 if (!mounted)
889 return;
890 path->mnt = mounted;
891 path->dentry = mounted->mnt_root;
892 nd->seq = read_seqcount_begin(&path->dentry->d_seq);
893 *inode = path->dentry->d_inode;
897 static int __follow_mount(struct path *path)
899 int res = 0;
900 while (d_mountpoint(path->dentry)) {
901 struct vfsmount *mounted = lookup_mnt(path);
902 if (!mounted)
903 break;
904 dput(path->dentry);
905 if (res)
906 mntput(path->mnt);
907 path->mnt = mounted;
908 path->dentry = dget(mounted->mnt_root);
909 res = 1;
911 return res;
914 static void follow_mount(struct path *path)
916 while (d_mountpoint(path->dentry)) {
917 struct vfsmount *mounted = lookup_mnt(path);
918 if (!mounted)
919 break;
920 dput(path->dentry);
921 mntput(path->mnt);
922 path->mnt = mounted;
923 path->dentry = dget(mounted->mnt_root);
927 int follow_down(struct path *path)
929 struct vfsmount *mounted;
931 mounted = lookup_mnt(path);
932 if (mounted) {
933 dput(path->dentry);
934 mntput(path->mnt);
935 path->mnt = mounted;
936 path->dentry = dget(mounted->mnt_root);
937 return 1;
939 return 0;
942 static int follow_dotdot_rcu(struct nameidata *nd)
944 struct inode *inode = nd->inode;
946 set_root_rcu(nd);
948 while(1) {
949 if (nd->path.dentry == nd->root.dentry &&
950 nd->path.mnt == nd->root.mnt) {
951 break;
953 if (nd->path.dentry != nd->path.mnt->mnt_root) {
954 struct dentry *old = nd->path.dentry;
955 struct dentry *parent = old->d_parent;
956 unsigned seq;
958 seq = read_seqcount_begin(&parent->d_seq);
959 if (read_seqcount_retry(&old->d_seq, nd->seq))
960 return -ECHILD;
961 inode = parent->d_inode;
962 nd->path.dentry = parent;
963 nd->seq = seq;
964 break;
966 if (!follow_up_rcu(&nd->path))
967 break;
968 nd->seq = read_seqcount_begin(&nd->path.dentry->d_seq);
969 inode = nd->path.dentry->d_inode;
971 __follow_mount_rcu(nd, &nd->path, &inode);
972 nd->inode = inode;
974 return 0;
977 static void follow_dotdot(struct nameidata *nd)
979 set_root(nd);
981 while(1) {
982 struct dentry *old = nd->path.dentry;
984 if (nd->path.dentry == nd->root.dentry &&
985 nd->path.mnt == nd->root.mnt) {
986 break;
988 if (nd->path.dentry != nd->path.mnt->mnt_root) {
989 /* rare case of legitimate dget_parent()... */
990 nd->path.dentry = dget_parent(nd->path.dentry);
991 dput(old);
992 break;
994 if (!follow_up(&nd->path))
995 break;
997 follow_mount(&nd->path);
998 nd->inode = nd->path.dentry->d_inode;
1002 * Allocate a dentry with name and parent, and perform a parent
1003 * directory ->lookup on it. Returns the new dentry, or ERR_PTR
1004 * on error. parent->d_inode->i_mutex must be held. d_lookup must
1005 * have verified that no child exists while under i_mutex.
1007 static struct dentry *d_alloc_and_lookup(struct dentry *parent,
1008 struct qstr *name, struct nameidata *nd)
1010 struct inode *inode = parent->d_inode;
1011 struct dentry *dentry;
1012 struct dentry *old;
1014 /* Don't create child dentry for a dead directory. */
1015 if (unlikely(IS_DEADDIR(inode)))
1016 return ERR_PTR(-ENOENT);
1018 dentry = d_alloc(parent, name);
1019 if (unlikely(!dentry))
1020 return ERR_PTR(-ENOMEM);
1022 old = inode->i_op->lookup(inode, dentry, nd);
1023 if (unlikely(old)) {
1024 dput(dentry);
1025 dentry = old;
1027 return dentry;
1031 * It's more convoluted than I'd like it to be, but... it's still fairly
1032 * small and for now I'd prefer to have fast path as straight as possible.
1033 * It _is_ time-critical.
1035 static int do_lookup(struct nameidata *nd, struct qstr *name,
1036 struct path *path, struct inode **inode)
1038 struct vfsmount *mnt = nd->path.mnt;
1039 struct dentry *dentry, *parent = nd->path.dentry;
1040 struct inode *dir;
1042 * See if the low-level filesystem might want
1043 * to use its own hash..
1045 if (unlikely(parent->d_flags & DCACHE_OP_HASH)) {
1046 int err = parent->d_op->d_hash(parent, nd->inode, name);
1047 if (err < 0)
1048 return err;
1052 * Rename seqlock is not required here because in the off chance
1053 * of a false negative due to a concurrent rename, we're going to
1054 * do the non-racy lookup, below.
1056 if (nd->flags & LOOKUP_RCU) {
1057 unsigned seq;
1059 *inode = nd->inode;
1060 dentry = __d_lookup_rcu(parent, name, &seq, inode);
1061 if (!dentry) {
1062 if (nameidata_drop_rcu(nd))
1063 return -ECHILD;
1064 goto need_lookup;
1066 /* Memory barrier in read_seqcount_begin of child is enough */
1067 if (__read_seqcount_retry(&parent->d_seq, nd->seq))
1068 return -ECHILD;
1070 nd->seq = seq;
1071 if (dentry->d_flags & DCACHE_OP_REVALIDATE)
1072 goto need_revalidate;
1073 path->mnt = mnt;
1074 path->dentry = dentry;
1075 __follow_mount_rcu(nd, path, inode);
1076 } else {
1077 dentry = __d_lookup(parent, name);
1078 if (!dentry)
1079 goto need_lookup;
1080 found:
1081 if (dentry->d_flags & DCACHE_OP_REVALIDATE)
1082 goto need_revalidate;
1083 done:
1084 path->mnt = mnt;
1085 path->dentry = dentry;
1086 __follow_mount(path);
1087 *inode = path->dentry->d_inode;
1089 return 0;
1091 need_lookup:
1092 dir = parent->d_inode;
1093 BUG_ON(nd->inode != dir);
1095 mutex_lock(&dir->i_mutex);
1097 * First re-do the cached lookup just in case it was created
1098 * while we waited for the directory semaphore, or the first
1099 * lookup failed due to an unrelated rename.
1101 * This could use version numbering or similar to avoid unnecessary
1102 * cache lookups, but then we'd have to do the first lookup in the
1103 * non-racy way. However in the common case here, everything should
1104 * be hot in cache, so would it be a big win?
1106 dentry = d_lookup(parent, name);
1107 if (likely(!dentry)) {
1108 dentry = d_alloc_and_lookup(parent, name, nd);
1109 mutex_unlock(&dir->i_mutex);
1110 if (IS_ERR(dentry))
1111 goto fail;
1112 goto done;
1115 * Uhhuh! Nasty case: the cache was re-populated while
1116 * we waited on the semaphore. Need to revalidate.
1118 mutex_unlock(&dir->i_mutex);
1119 goto found;
1121 need_revalidate:
1122 dentry = do_revalidate(dentry, nd);
1123 if (!dentry)
1124 goto need_lookup;
1125 if (IS_ERR(dentry))
1126 goto fail;
1127 goto done;
1129 fail:
1130 return PTR_ERR(dentry);
1134 * This is a temporary kludge to deal with "automount" symlinks; proper
1135 * solution is to trigger them on follow_mount(), so that do_lookup()
1136 * would DTRT. To be killed before 2.6.34-final.
1138 static inline int follow_on_final(struct inode *inode, unsigned lookup_flags)
1140 return inode && unlikely(inode->i_op->follow_link) &&
1141 ((lookup_flags & LOOKUP_FOLLOW) || S_ISDIR(inode->i_mode));
1145 * Name resolution.
1146 * This is the basic name resolution function, turning a pathname into
1147 * the final dentry. We expect 'base' to be positive and a directory.
1149 * Returns 0 and nd will have valid dentry and mnt on success.
1150 * Returns error and drops reference to input namei data on failure.
1152 static int link_path_walk(const char *name, struct nameidata *nd)
1154 struct path next;
1155 int err;
1156 unsigned int lookup_flags = nd->flags;
1158 while (*name=='/')
1159 name++;
1160 if (!*name)
1161 goto return_reval;
1163 if (nd->depth)
1164 lookup_flags = LOOKUP_FOLLOW | (nd->flags & LOOKUP_CONTINUE);
1166 /* At this point we know we have a real path component. */
1167 for(;;) {
1168 struct inode *inode;
1169 unsigned long hash;
1170 struct qstr this;
1171 unsigned int c;
1173 nd->flags |= LOOKUP_CONTINUE;
1174 if (nd->flags & LOOKUP_RCU) {
1175 err = exec_permission(nd->inode, IPERM_FLAG_RCU);
1176 if (err == -ECHILD) {
1177 if (nameidata_drop_rcu(nd))
1178 return -ECHILD;
1179 goto exec_again;
1181 } else {
1182 exec_again:
1183 err = exec_permission(nd->inode, 0);
1185 if (err)
1186 break;
1188 this.name = name;
1189 c = *(const unsigned char *)name;
1191 hash = init_name_hash();
1192 do {
1193 name++;
1194 hash = partial_name_hash(c, hash);
1195 c = *(const unsigned char *)name;
1196 } while (c && (c != '/'));
1197 this.len = name - (const char *) this.name;
1198 this.hash = end_name_hash(hash);
1200 /* remove trailing slashes? */
1201 if (!c)
1202 goto last_component;
1203 while (*++name == '/');
1204 if (!*name)
1205 goto last_with_slashes;
1208 * "." and ".." are special - ".." especially so because it has
1209 * to be able to know about the current root directory and
1210 * parent relationships.
1212 if (this.name[0] == '.') switch (this.len) {
1213 default:
1214 break;
1215 case 2:
1216 if (this.name[1] != '.')
1217 break;
1218 if (nd->flags & LOOKUP_RCU) {
1219 if (follow_dotdot_rcu(nd))
1220 return -ECHILD;
1221 } else
1222 follow_dotdot(nd);
1223 /* fallthrough */
1224 case 1:
1225 continue;
1227 /* This does the actual lookups.. */
1228 err = do_lookup(nd, &this, &next, &inode);
1229 if (err)
1230 break;
1231 err = -ENOENT;
1232 if (!inode)
1233 goto out_dput;
1235 if (inode->i_op->follow_link) {
1236 /* We commonly drop rcu-walk here */
1237 if (nameidata_dentry_drop_rcu_maybe(nd, next.dentry))
1238 return -ECHILD;
1239 BUG_ON(inode != next.dentry->d_inode);
1240 err = do_follow_link(&next, nd);
1241 if (err)
1242 goto return_err;
1243 nd->inode = nd->path.dentry->d_inode;
1244 err = -ENOENT;
1245 if (!nd->inode)
1246 break;
1247 } else {
1248 path_to_nameidata(&next, nd);
1249 nd->inode = inode;
1251 err = -ENOTDIR;
1252 if (!nd->inode->i_op->lookup)
1253 break;
1254 continue;
1255 /* here ends the main loop */
1257 last_with_slashes:
1258 lookup_flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY;
1259 last_component:
1260 /* Clear LOOKUP_CONTINUE iff it was previously unset */
1261 nd->flags &= lookup_flags | ~LOOKUP_CONTINUE;
1262 if (lookup_flags & LOOKUP_PARENT)
1263 goto lookup_parent;
1264 if (this.name[0] == '.') switch (this.len) {
1265 default:
1266 break;
1267 case 2:
1268 if (this.name[1] != '.')
1269 break;
1270 if (nd->flags & LOOKUP_RCU) {
1271 if (follow_dotdot_rcu(nd))
1272 return -ECHILD;
1273 } else
1274 follow_dotdot(nd);
1275 /* fallthrough */
1276 case 1:
1277 goto return_reval;
1279 err = do_lookup(nd, &this, &next, &inode);
1280 if (err)
1281 break;
1282 if (follow_on_final(inode, lookup_flags)) {
1283 if (nameidata_dentry_drop_rcu_maybe(nd, next.dentry))
1284 return -ECHILD;
1285 BUG_ON(inode != next.dentry->d_inode);
1286 err = do_follow_link(&next, nd);
1287 if (err)
1288 goto return_err;
1289 nd->inode = nd->path.dentry->d_inode;
1290 } else {
1291 path_to_nameidata(&next, nd);
1292 nd->inode = inode;
1294 err = -ENOENT;
1295 if (!nd->inode)
1296 break;
1297 if (lookup_flags & LOOKUP_DIRECTORY) {
1298 err = -ENOTDIR;
1299 if (!nd->inode->i_op->lookup)
1300 break;
1302 goto return_base;
1303 lookup_parent:
1304 nd->last = this;
1305 nd->last_type = LAST_NORM;
1306 if (this.name[0] != '.')
1307 goto return_base;
1308 if (this.len == 1)
1309 nd->last_type = LAST_DOT;
1310 else if (this.len == 2 && this.name[1] == '.')
1311 nd->last_type = LAST_DOTDOT;
1312 else
1313 goto return_base;
1314 return_reval:
1316 * We bypassed the ordinary revalidation routines.
1317 * We may need to check the cached dentry for staleness.
1319 if (need_reval_dot(nd->path.dentry)) {
1320 /* Note: we do not d_invalidate() */
1321 err = d_revalidate(nd->path.dentry, nd);
1322 if (!err)
1323 err = -ESTALE;
1324 if (err < 0)
1325 break;
1327 return_base:
1328 if (nameidata_drop_rcu_last_maybe(nd))
1329 return -ECHILD;
1330 return 0;
1331 out_dput:
1332 if (!(nd->flags & LOOKUP_RCU))
1333 path_put_conditional(&next, nd);
1334 break;
1336 if (!(nd->flags & LOOKUP_RCU))
1337 path_put(&nd->path);
1338 return_err:
1339 return err;
1342 static inline int path_walk_rcu(const char *name, struct nameidata *nd)
1344 current->total_link_count = 0;
1346 return link_path_walk(name, nd);
1349 static inline int path_walk_simple(const char *name, struct nameidata *nd)
1351 current->total_link_count = 0;
1353 return link_path_walk(name, nd);
1356 static int path_walk(const char *name, struct nameidata *nd)
1358 struct path save = nd->path;
1359 int result;
1361 current->total_link_count = 0;
1363 /* make sure the stuff we saved doesn't go away */
1364 path_get(&save);
1366 result = link_path_walk(name, nd);
1367 if (result == -ESTALE) {
1368 /* nd->path had been dropped */
1369 current->total_link_count = 0;
1370 nd->path = save;
1371 path_get(&nd->path);
1372 nd->flags |= LOOKUP_REVAL;
1373 result = link_path_walk(name, nd);
1376 path_put(&save);
1378 return result;
1381 static void path_finish_rcu(struct nameidata *nd)
1383 if (nd->flags & LOOKUP_RCU) {
1384 /* RCU dangling. Cancel it. */
1385 nd->flags &= ~LOOKUP_RCU;
1386 nd->root.mnt = NULL;
1387 rcu_read_unlock();
1388 br_read_unlock(vfsmount_lock);
1390 if (nd->file)
1391 fput(nd->file);
1394 static int path_init_rcu(int dfd, const char *name, unsigned int flags, struct nameidata *nd)
1396 int retval = 0;
1397 int fput_needed;
1398 struct file *file;
1400 nd->last_type = LAST_ROOT; /* if there are only slashes... */
1401 nd->flags = flags | LOOKUP_RCU;
1402 nd->depth = 0;
1403 nd->root.mnt = NULL;
1404 nd->file = NULL;
1406 if (*name=='/') {
1407 struct fs_struct *fs = current->fs;
1408 unsigned seq;
1410 br_read_lock(vfsmount_lock);
1411 rcu_read_lock();
1413 do {
1414 seq = read_seqcount_begin(&fs->seq);
1415 nd->root = fs->root;
1416 nd->path = nd->root;
1417 nd->seq = __read_seqcount_begin(&nd->path.dentry->d_seq);
1418 } while (read_seqcount_retry(&fs->seq, seq));
1420 } else if (dfd == AT_FDCWD) {
1421 struct fs_struct *fs = current->fs;
1422 unsigned seq;
1424 br_read_lock(vfsmount_lock);
1425 rcu_read_lock();
1427 do {
1428 seq = read_seqcount_begin(&fs->seq);
1429 nd->path = fs->pwd;
1430 nd->seq = __read_seqcount_begin(&nd->path.dentry->d_seq);
1431 } while (read_seqcount_retry(&fs->seq, seq));
1433 } else {
1434 struct dentry *dentry;
1436 file = fget_light(dfd, &fput_needed);
1437 retval = -EBADF;
1438 if (!file)
1439 goto out_fail;
1441 dentry = file->f_path.dentry;
1443 retval = -ENOTDIR;
1444 if (!S_ISDIR(dentry->d_inode->i_mode))
1445 goto fput_fail;
1447 retval = file_permission(file, MAY_EXEC);
1448 if (retval)
1449 goto fput_fail;
1451 nd->path = file->f_path;
1452 if (fput_needed)
1453 nd->file = file;
1455 nd->seq = __read_seqcount_begin(&nd->path.dentry->d_seq);
1456 br_read_lock(vfsmount_lock);
1457 rcu_read_lock();
1459 nd->inode = nd->path.dentry->d_inode;
1460 return 0;
1462 fput_fail:
1463 fput_light(file, fput_needed);
1464 out_fail:
1465 return retval;
1468 static int path_init(int dfd, const char *name, unsigned int flags, struct nameidata *nd)
1470 int retval = 0;
1471 int fput_needed;
1472 struct file *file;
1474 nd->last_type = LAST_ROOT; /* if there are only slashes... */
1475 nd->flags = flags;
1476 nd->depth = 0;
1477 nd->root.mnt = NULL;
1479 if (*name=='/') {
1480 set_root(nd);
1481 nd->path = nd->root;
1482 path_get(&nd->root);
1483 } else if (dfd == AT_FDCWD) {
1484 get_fs_pwd(current->fs, &nd->path);
1485 } else {
1486 struct dentry *dentry;
1488 file = fget_light(dfd, &fput_needed);
1489 retval = -EBADF;
1490 if (!file)
1491 goto out_fail;
1493 dentry = file->f_path.dentry;
1495 retval = -ENOTDIR;
1496 if (!S_ISDIR(dentry->d_inode->i_mode))
1497 goto fput_fail;
1499 retval = file_permission(file, MAY_EXEC);
1500 if (retval)
1501 goto fput_fail;
1503 nd->path = file->f_path;
1504 path_get(&file->f_path);
1506 fput_light(file, fput_needed);
1508 nd->inode = nd->path.dentry->d_inode;
1509 return 0;
1511 fput_fail:
1512 fput_light(file, fput_needed);
1513 out_fail:
1514 return retval;
1517 /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
1518 static int do_path_lookup(int dfd, const char *name,
1519 unsigned int flags, struct nameidata *nd)
1521 int retval;
1524 * Path walking is largely split up into 2 different synchronisation
1525 * schemes, rcu-walk and ref-walk (explained in
1526 * Documentation/filesystems/path-lookup.txt). These share much of the
1527 * path walk code, but some things particularly setup, cleanup, and
1528 * following mounts are sufficiently divergent that functions are
1529 * duplicated. Typically there is a function foo(), and its RCU
1530 * analogue, foo_rcu().
1532 * -ECHILD is the error number of choice (just to avoid clashes) that
1533 * is returned if some aspect of an rcu-walk fails. Such an error must
1534 * be handled by restarting a traditional ref-walk (which will always
1535 * be able to complete).
1537 retval = path_init_rcu(dfd, name, flags, nd);
1538 if (unlikely(retval))
1539 return retval;
1540 retval = path_walk_rcu(name, nd);
1541 path_finish_rcu(nd);
1542 if (nd->root.mnt) {
1543 path_put(&nd->root);
1544 nd->root.mnt = NULL;
1547 if (unlikely(retval == -ECHILD || retval == -ESTALE)) {
1548 /* slower, locked walk */
1549 if (retval == -ESTALE)
1550 flags |= LOOKUP_REVAL;
1551 retval = path_init(dfd, name, flags, nd);
1552 if (unlikely(retval))
1553 return retval;
1554 retval = path_walk(name, nd);
1555 if (nd->root.mnt) {
1556 path_put(&nd->root);
1557 nd->root.mnt = NULL;
1561 if (likely(!retval)) {
1562 if (unlikely(!audit_dummy_context())) {
1563 if (nd->path.dentry && nd->inode)
1564 audit_inode(name, nd->path.dentry);
1568 return retval;
1571 int path_lookup(const char *name, unsigned int flags,
1572 struct nameidata *nd)
1574 return do_path_lookup(AT_FDCWD, name, flags, nd);
1577 int kern_path(const char *name, unsigned int flags, struct path *path)
1579 struct nameidata nd;
1580 int res = do_path_lookup(AT_FDCWD, name, flags, &nd);
1581 if (!res)
1582 *path = nd.path;
1583 return res;
1587 * vfs_path_lookup - lookup a file path relative to a dentry-vfsmount pair
1588 * @dentry: pointer to dentry of the base directory
1589 * @mnt: pointer to vfs mount of the base directory
1590 * @name: pointer to file name
1591 * @flags: lookup flags
1592 * @nd: pointer to nameidata
1594 int vfs_path_lookup(struct dentry *dentry, struct vfsmount *mnt,
1595 const char *name, unsigned int flags,
1596 struct nameidata *nd)
1598 int retval;
1600 /* same as do_path_lookup */
1601 nd->last_type = LAST_ROOT;
1602 nd->flags = flags;
1603 nd->depth = 0;
1605 nd->path.dentry = dentry;
1606 nd->path.mnt = mnt;
1607 path_get(&nd->path);
1608 nd->root = nd->path;
1609 path_get(&nd->root);
1610 nd->inode = nd->path.dentry->d_inode;
1612 retval = path_walk(name, nd);
1613 if (unlikely(!retval && !audit_dummy_context() && nd->path.dentry &&
1614 nd->inode))
1615 audit_inode(name, nd->path.dentry);
1617 path_put(&nd->root);
1618 nd->root.mnt = NULL;
1620 return retval;
1623 static struct dentry *__lookup_hash(struct qstr *name,
1624 struct dentry *base, struct nameidata *nd)
1626 struct inode *inode = base->d_inode;
1627 struct dentry *dentry;
1628 int err;
1630 err = exec_permission(inode, 0);
1631 if (err)
1632 return ERR_PTR(err);
1635 * See if the low-level filesystem might want
1636 * to use its own hash..
1638 if (base->d_flags & DCACHE_OP_HASH) {
1639 err = base->d_op->d_hash(base, inode, name);
1640 dentry = ERR_PTR(err);
1641 if (err < 0)
1642 goto out;
1646 * Don't bother with __d_lookup: callers are for creat as
1647 * well as unlink, so a lot of the time it would cost
1648 * a double lookup.
1650 dentry = d_lookup(base, name);
1652 if (dentry && (dentry->d_flags & DCACHE_OP_REVALIDATE))
1653 dentry = do_revalidate(dentry, nd);
1655 if (!dentry)
1656 dentry = d_alloc_and_lookup(base, name, nd);
1657 out:
1658 return dentry;
1662 * Restricted form of lookup. Doesn't follow links, single-component only,
1663 * needs parent already locked. Doesn't follow mounts.
1664 * SMP-safe.
1666 static struct dentry *lookup_hash(struct nameidata *nd)
1668 return __lookup_hash(&nd->last, nd->path.dentry, nd);
1671 static int __lookup_one_len(const char *name, struct qstr *this,
1672 struct dentry *base, int len)
1674 unsigned long hash;
1675 unsigned int c;
1677 this->name = name;
1678 this->len = len;
1679 if (!len)
1680 return -EACCES;
1682 hash = init_name_hash();
1683 while (len--) {
1684 c = *(const unsigned char *)name++;
1685 if (c == '/' || c == '\0')
1686 return -EACCES;
1687 hash = partial_name_hash(c, hash);
1689 this->hash = end_name_hash(hash);
1690 return 0;
1694 * lookup_one_len - filesystem helper to lookup single pathname component
1695 * @name: pathname component to lookup
1696 * @base: base directory to lookup from
1697 * @len: maximum length @len should be interpreted to
1699 * Note that this routine is purely a helper for filesystem usage and should
1700 * not be called by generic code. Also note that by using this function the
1701 * nameidata argument is passed to the filesystem methods and a filesystem
1702 * using this helper needs to be prepared for that.
1704 struct dentry *lookup_one_len(const char *name, struct dentry *base, int len)
1706 int err;
1707 struct qstr this;
1709 WARN_ON_ONCE(!mutex_is_locked(&base->d_inode->i_mutex));
1711 err = __lookup_one_len(name, &this, base, len);
1712 if (err)
1713 return ERR_PTR(err);
1715 return __lookup_hash(&this, base, NULL);
1718 int user_path_at(int dfd, const char __user *name, unsigned flags,
1719 struct path *path)
1721 struct nameidata nd;
1722 char *tmp = getname(name);
1723 int err = PTR_ERR(tmp);
1724 if (!IS_ERR(tmp)) {
1726 BUG_ON(flags & LOOKUP_PARENT);
1728 err = do_path_lookup(dfd, tmp, flags, &nd);
1729 putname(tmp);
1730 if (!err)
1731 *path = nd.path;
1733 return err;
1736 static int user_path_parent(int dfd, const char __user *path,
1737 struct nameidata *nd, char **name)
1739 char *s = getname(path);
1740 int error;
1742 if (IS_ERR(s))
1743 return PTR_ERR(s);
1745 error = do_path_lookup(dfd, s, LOOKUP_PARENT, nd);
1746 if (error)
1747 putname(s);
1748 else
1749 *name = s;
1751 return error;
1755 * It's inline, so penalty for filesystems that don't use sticky bit is
1756 * minimal.
1758 static inline int check_sticky(struct inode *dir, struct inode *inode)
1760 uid_t fsuid = current_fsuid();
1762 if (!(dir->i_mode & S_ISVTX))
1763 return 0;
1764 if (inode->i_uid == fsuid)
1765 return 0;
1766 if (dir->i_uid == fsuid)
1767 return 0;
1768 return !capable(CAP_FOWNER);
1772 * Check whether we can remove a link victim from directory dir, check
1773 * whether the type of victim is right.
1774 * 1. We can't do it if dir is read-only (done in permission())
1775 * 2. We should have write and exec permissions on dir
1776 * 3. We can't remove anything from append-only dir
1777 * 4. We can't do anything with immutable dir (done in permission())
1778 * 5. If the sticky bit on dir is set we should either
1779 * a. be owner of dir, or
1780 * b. be owner of victim, or
1781 * c. have CAP_FOWNER capability
1782 * 6. If the victim is append-only or immutable we can't do antyhing with
1783 * links pointing to it.
1784 * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR.
1785 * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR.
1786 * 9. We can't remove a root or mountpoint.
1787 * 10. We don't allow removal of NFS sillyrenamed files; it's handled by
1788 * nfs_async_unlink().
1790 static int may_delete(struct inode *dir,struct dentry *victim,int isdir)
1792 int error;
1794 if (!victim->d_inode)
1795 return -ENOENT;
1797 BUG_ON(victim->d_parent->d_inode != dir);
1798 audit_inode_child(victim, dir);
1800 error = inode_permission(dir, MAY_WRITE | MAY_EXEC);
1801 if (error)
1802 return error;
1803 if (IS_APPEND(dir))
1804 return -EPERM;
1805 if (check_sticky(dir, victim->d_inode)||IS_APPEND(victim->d_inode)||
1806 IS_IMMUTABLE(victim->d_inode) || IS_SWAPFILE(victim->d_inode))
1807 return -EPERM;
1808 if (isdir) {
1809 if (!S_ISDIR(victim->d_inode->i_mode))
1810 return -ENOTDIR;
1811 if (IS_ROOT(victim))
1812 return -EBUSY;
1813 } else if (S_ISDIR(victim->d_inode->i_mode))
1814 return -EISDIR;
1815 if (IS_DEADDIR(dir))
1816 return -ENOENT;
1817 if (victim->d_flags & DCACHE_NFSFS_RENAMED)
1818 return -EBUSY;
1819 return 0;
1822 /* Check whether we can create an object with dentry child in directory
1823 * dir.
1824 * 1. We can't do it if child already exists (open has special treatment for
1825 * this case, but since we are inlined it's OK)
1826 * 2. We can't do it if dir is read-only (done in permission())
1827 * 3. We should have write and exec permissions on dir
1828 * 4. We can't do it if dir is immutable (done in permission())
1830 static inline int may_create(struct inode *dir, struct dentry *child)
1832 if (child->d_inode)
1833 return -EEXIST;
1834 if (IS_DEADDIR(dir))
1835 return -ENOENT;
1836 return inode_permission(dir, MAY_WRITE | MAY_EXEC);
1840 * p1 and p2 should be directories on the same fs.
1842 struct dentry *lock_rename(struct dentry *p1, struct dentry *p2)
1844 struct dentry *p;
1846 if (p1 == p2) {
1847 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1848 return NULL;
1851 mutex_lock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1853 p = d_ancestor(p2, p1);
1854 if (p) {
1855 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_PARENT);
1856 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_CHILD);
1857 return p;
1860 p = d_ancestor(p1, p2);
1861 if (p) {
1862 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1863 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1864 return p;
1867 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1868 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1869 return NULL;
1872 void unlock_rename(struct dentry *p1, struct dentry *p2)
1874 mutex_unlock(&p1->d_inode->i_mutex);
1875 if (p1 != p2) {
1876 mutex_unlock(&p2->d_inode->i_mutex);
1877 mutex_unlock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1881 int vfs_create(struct inode *dir, struct dentry *dentry, int mode,
1882 struct nameidata *nd)
1884 int error = may_create(dir, dentry);
1886 if (error)
1887 return error;
1889 if (!dir->i_op->create)
1890 return -EACCES; /* shouldn't it be ENOSYS? */
1891 mode &= S_IALLUGO;
1892 mode |= S_IFREG;
1893 error = security_inode_create(dir, dentry, mode);
1894 if (error)
1895 return error;
1896 error = dir->i_op->create(dir, dentry, mode, nd);
1897 if (!error)
1898 fsnotify_create(dir, dentry);
1899 return error;
1902 int may_open(struct path *path, int acc_mode, int flag)
1904 struct dentry *dentry = path->dentry;
1905 struct inode *inode = dentry->d_inode;
1906 int error;
1908 if (!inode)
1909 return -ENOENT;
1911 switch (inode->i_mode & S_IFMT) {
1912 case S_IFLNK:
1913 return -ELOOP;
1914 case S_IFDIR:
1915 if (acc_mode & MAY_WRITE)
1916 return -EISDIR;
1917 break;
1918 case S_IFBLK:
1919 case S_IFCHR:
1920 if (path->mnt->mnt_flags & MNT_NODEV)
1921 return -EACCES;
1922 /*FALLTHRU*/
1923 case S_IFIFO:
1924 case S_IFSOCK:
1925 flag &= ~O_TRUNC;
1926 break;
1929 error = inode_permission(inode, acc_mode);
1930 if (error)
1931 return error;
1934 * An append-only file must be opened in append mode for writing.
1936 if (IS_APPEND(inode)) {
1937 if ((flag & O_ACCMODE) != O_RDONLY && !(flag & O_APPEND))
1938 return -EPERM;
1939 if (flag & O_TRUNC)
1940 return -EPERM;
1943 /* O_NOATIME can only be set by the owner or superuser */
1944 if (flag & O_NOATIME && !is_owner_or_cap(inode))
1945 return -EPERM;
1948 * Ensure there are no outstanding leases on the file.
1950 return break_lease(inode, flag);
1953 static int handle_truncate(struct file *filp)
1955 struct path *path = &filp->f_path;
1956 struct inode *inode = path->dentry->d_inode;
1957 int error = get_write_access(inode);
1958 if (error)
1959 return error;
1961 * Refuse to truncate files with mandatory locks held on them.
1963 error = locks_verify_locked(inode);
1964 if (!error)
1965 error = security_path_truncate(path);
1966 if (!error) {
1967 error = do_truncate(path->dentry, 0,
1968 ATTR_MTIME|ATTR_CTIME|ATTR_OPEN,
1969 filp);
1971 put_write_access(inode);
1972 return error;
1976 * Be careful about ever adding any more callers of this
1977 * function. Its flags must be in the namei format, not
1978 * what get passed to sys_open().
1980 static int __open_namei_create(struct nameidata *nd, struct path *path,
1981 int open_flag, int mode)
1983 int error;
1984 struct dentry *dir = nd->path.dentry;
1986 if (!IS_POSIXACL(dir->d_inode))
1987 mode &= ~current_umask();
1988 error = security_path_mknod(&nd->path, path->dentry, mode, 0);
1989 if (error)
1990 goto out_unlock;
1991 error = vfs_create(dir->d_inode, path->dentry, mode, nd);
1992 out_unlock:
1993 mutex_unlock(&dir->d_inode->i_mutex);
1994 dput(nd->path.dentry);
1995 nd->path.dentry = path->dentry;
1997 if (error)
1998 return error;
1999 /* Don't check for write permission, don't truncate */
2000 return may_open(&nd->path, 0, open_flag & ~O_TRUNC);
2004 * Note that while the flag value (low two bits) for sys_open means:
2005 * 00 - read-only
2006 * 01 - write-only
2007 * 10 - read-write
2008 * 11 - special
2009 * it is changed into
2010 * 00 - no permissions needed
2011 * 01 - read-permission
2012 * 10 - write-permission
2013 * 11 - read-write
2014 * for the internal routines (ie open_namei()/follow_link() etc)
2015 * This is more logical, and also allows the 00 "no perm needed"
2016 * to be used for symlinks (where the permissions are checked
2017 * later).
2020 static inline int open_to_namei_flags(int flag)
2022 if ((flag+1) & O_ACCMODE)
2023 flag++;
2024 return flag;
2027 static int open_will_truncate(int flag, struct inode *inode)
2030 * We'll never write to the fs underlying
2031 * a device file.
2033 if (special_file(inode->i_mode))
2034 return 0;
2035 return (flag & O_TRUNC);
2038 static struct file *finish_open(struct nameidata *nd,
2039 int open_flag, int acc_mode)
2041 struct file *filp;
2042 int will_truncate;
2043 int error;
2045 will_truncate = open_will_truncate(open_flag, nd->path.dentry->d_inode);
2046 if (will_truncate) {
2047 error = mnt_want_write(nd->path.mnt);
2048 if (error)
2049 goto exit;
2051 error = may_open(&nd->path, acc_mode, open_flag);
2052 if (error) {
2053 if (will_truncate)
2054 mnt_drop_write(nd->path.mnt);
2055 goto exit;
2057 filp = nameidata_to_filp(nd);
2058 if (!IS_ERR(filp)) {
2059 error = ima_file_check(filp, acc_mode);
2060 if (error) {
2061 fput(filp);
2062 filp = ERR_PTR(error);
2065 if (!IS_ERR(filp)) {
2066 if (will_truncate) {
2067 error = handle_truncate(filp);
2068 if (error) {
2069 fput(filp);
2070 filp = ERR_PTR(error);
2075 * It is now safe to drop the mnt write
2076 * because the filp has had a write taken
2077 * on its behalf.
2079 if (will_truncate)
2080 mnt_drop_write(nd->path.mnt);
2081 path_put(&nd->path);
2082 return filp;
2084 exit:
2085 if (!IS_ERR(nd->intent.open.file))
2086 release_open_intent(nd);
2087 path_put(&nd->path);
2088 return ERR_PTR(error);
2092 * Handle O_CREAT case for do_filp_open
2094 static struct file *do_last(struct nameidata *nd, struct path *path,
2095 int open_flag, int acc_mode,
2096 int mode, const char *pathname)
2098 struct dentry *dir = nd->path.dentry;
2099 struct file *filp;
2100 int error = -EISDIR;
2102 switch (nd->last_type) {
2103 case LAST_DOTDOT:
2104 follow_dotdot(nd);
2105 dir = nd->path.dentry;
2106 case LAST_DOT:
2107 if (need_reval_dot(dir)) {
2108 error = d_revalidate(nd->path.dentry, nd);
2109 if (!error)
2110 error = -ESTALE;
2111 if (error < 0)
2112 goto exit;
2114 /* fallthrough */
2115 case LAST_ROOT:
2116 goto exit;
2117 case LAST_BIND:
2118 audit_inode(pathname, dir);
2119 goto ok;
2122 /* trailing slashes? */
2123 if (nd->last.name[nd->last.len])
2124 goto exit;
2126 mutex_lock(&dir->d_inode->i_mutex);
2128 path->dentry = lookup_hash(nd);
2129 path->mnt = nd->path.mnt;
2131 error = PTR_ERR(path->dentry);
2132 if (IS_ERR(path->dentry)) {
2133 mutex_unlock(&dir->d_inode->i_mutex);
2134 goto exit;
2137 if (IS_ERR(nd->intent.open.file)) {
2138 error = PTR_ERR(nd->intent.open.file);
2139 goto exit_mutex_unlock;
2142 /* Negative dentry, just create the file */
2143 if (!path->dentry->d_inode) {
2145 * This write is needed to ensure that a
2146 * ro->rw transition does not occur between
2147 * the time when the file is created and when
2148 * a permanent write count is taken through
2149 * the 'struct file' in nameidata_to_filp().
2151 error = mnt_want_write(nd->path.mnt);
2152 if (error)
2153 goto exit_mutex_unlock;
2154 error = __open_namei_create(nd, path, open_flag, mode);
2155 if (error) {
2156 mnt_drop_write(nd->path.mnt);
2157 goto exit;
2159 filp = nameidata_to_filp(nd);
2160 mnt_drop_write(nd->path.mnt);
2161 path_put(&nd->path);
2162 if (!IS_ERR(filp)) {
2163 error = ima_file_check(filp, acc_mode);
2164 if (error) {
2165 fput(filp);
2166 filp = ERR_PTR(error);
2169 return filp;
2173 * It already exists.
2175 mutex_unlock(&dir->d_inode->i_mutex);
2176 audit_inode(pathname, path->dentry);
2178 error = -EEXIST;
2179 if (open_flag & O_EXCL)
2180 goto exit_dput;
2182 if (__follow_mount(path)) {
2183 error = -ELOOP;
2184 if (open_flag & O_NOFOLLOW)
2185 goto exit_dput;
2188 error = -ENOENT;
2189 if (!path->dentry->d_inode)
2190 goto exit_dput;
2192 if (path->dentry->d_inode->i_op->follow_link)
2193 return NULL;
2195 path_to_nameidata(path, nd);
2196 nd->inode = path->dentry->d_inode;
2197 error = -EISDIR;
2198 if (S_ISDIR(nd->inode->i_mode))
2199 goto exit;
2201 filp = finish_open(nd, open_flag, acc_mode);
2202 return filp;
2204 exit_mutex_unlock:
2205 mutex_unlock(&dir->d_inode->i_mutex);
2206 exit_dput:
2207 path_put_conditional(path, nd);
2208 exit:
2209 if (!IS_ERR(nd->intent.open.file))
2210 release_open_intent(nd);
2211 path_put(&nd->path);
2212 return ERR_PTR(error);
2216 * Note that the low bits of the passed in "open_flag"
2217 * are not the same as in the local variable "flag". See
2218 * open_to_namei_flags() for more details.
2220 struct file *do_filp_open(int dfd, const char *pathname,
2221 int open_flag, int mode, int acc_mode)
2223 struct file *filp;
2224 struct nameidata nd;
2225 int error;
2226 struct path path;
2227 int count = 0;
2228 int flag = open_to_namei_flags(open_flag);
2229 int flags;
2231 if (!(open_flag & O_CREAT))
2232 mode = 0;
2234 /* Must never be set by userspace */
2235 open_flag &= ~FMODE_NONOTIFY;
2238 * O_SYNC is implemented as __O_SYNC|O_DSYNC. As many places only
2239 * check for O_DSYNC if the need any syncing at all we enforce it's
2240 * always set instead of having to deal with possibly weird behaviour
2241 * for malicious applications setting only __O_SYNC.
2243 if (open_flag & __O_SYNC)
2244 open_flag |= O_DSYNC;
2246 if (!acc_mode)
2247 acc_mode = MAY_OPEN | ACC_MODE(open_flag);
2249 /* O_TRUNC implies we need access checks for write permissions */
2250 if (open_flag & O_TRUNC)
2251 acc_mode |= MAY_WRITE;
2253 /* Allow the LSM permission hook to distinguish append
2254 access from general write access. */
2255 if (open_flag & O_APPEND)
2256 acc_mode |= MAY_APPEND;
2258 flags = LOOKUP_OPEN;
2259 if (open_flag & O_CREAT) {
2260 flags |= LOOKUP_CREATE;
2261 if (open_flag & O_EXCL)
2262 flags |= LOOKUP_EXCL;
2264 if (open_flag & O_DIRECTORY)
2265 flags |= LOOKUP_DIRECTORY;
2266 if (!(open_flag & O_NOFOLLOW))
2267 flags |= LOOKUP_FOLLOW;
2269 filp = get_empty_filp();
2270 if (!filp)
2271 return ERR_PTR(-ENFILE);
2273 filp->f_flags = open_flag;
2274 nd.intent.open.file = filp;
2275 nd.intent.open.flags = flag;
2276 nd.intent.open.create_mode = mode;
2278 if (open_flag & O_CREAT)
2279 goto creat;
2281 /* !O_CREAT, simple open */
2282 error = do_path_lookup(dfd, pathname, flags, &nd);
2283 if (unlikely(error))
2284 goto out_filp;
2285 error = -ELOOP;
2286 if (!(nd.flags & LOOKUP_FOLLOW)) {
2287 if (nd.inode->i_op->follow_link)
2288 goto out_path;
2290 error = -ENOTDIR;
2291 if (nd.flags & LOOKUP_DIRECTORY) {
2292 if (!nd.inode->i_op->lookup)
2293 goto out_path;
2295 audit_inode(pathname, nd.path.dentry);
2296 filp = finish_open(&nd, open_flag, acc_mode);
2297 return filp;
2299 creat:
2300 /* OK, have to create the file. Find the parent. */
2301 error = path_init_rcu(dfd, pathname,
2302 LOOKUP_PARENT | (flags & LOOKUP_REVAL), &nd);
2303 if (error)
2304 goto out_filp;
2305 error = path_walk_rcu(pathname, &nd);
2306 path_finish_rcu(&nd);
2307 if (unlikely(error == -ECHILD || error == -ESTALE)) {
2308 /* slower, locked walk */
2309 if (error == -ESTALE) {
2310 reval:
2311 flags |= LOOKUP_REVAL;
2313 error = path_init(dfd, pathname,
2314 LOOKUP_PARENT | (flags & LOOKUP_REVAL), &nd);
2315 if (error)
2316 goto out_filp;
2318 error = path_walk_simple(pathname, &nd);
2320 if (unlikely(error))
2321 goto out_filp;
2322 if (unlikely(!audit_dummy_context()))
2323 audit_inode(pathname, nd.path.dentry);
2326 * We have the parent and last component.
2328 nd.flags = flags;
2329 filp = do_last(&nd, &path, open_flag, acc_mode, mode, pathname);
2330 while (unlikely(!filp)) { /* trailing symlink */
2331 struct path holder;
2332 void *cookie;
2333 error = -ELOOP;
2334 /* S_ISDIR part is a temporary automount kludge */
2335 if (!(nd.flags & LOOKUP_FOLLOW) && !S_ISDIR(nd.inode->i_mode))
2336 goto exit_dput;
2337 if (count++ == 32)
2338 goto exit_dput;
2340 * This is subtle. Instead of calling do_follow_link() we do
2341 * the thing by hands. The reason is that this way we have zero
2342 * link_count and path_walk() (called from ->follow_link)
2343 * honoring LOOKUP_PARENT. After that we have the parent and
2344 * last component, i.e. we are in the same situation as after
2345 * the first path_walk(). Well, almost - if the last component
2346 * is normal we get its copy stored in nd->last.name and we will
2347 * have to putname() it when we are done. Procfs-like symlinks
2348 * just set LAST_BIND.
2350 nd.flags |= LOOKUP_PARENT;
2351 error = security_inode_follow_link(path.dentry, &nd);
2352 if (error)
2353 goto exit_dput;
2354 error = __do_follow_link(&path, &nd, &cookie);
2355 if (unlikely(error)) {
2356 if (!IS_ERR(cookie) && nd.inode->i_op->put_link)
2357 nd.inode->i_op->put_link(path.dentry, &nd, cookie);
2358 /* nd.path had been dropped */
2359 nd.path = path;
2360 goto out_path;
2362 holder = path;
2363 nd.flags &= ~LOOKUP_PARENT;
2364 filp = do_last(&nd, &path, open_flag, acc_mode, mode, pathname);
2365 if (nd.inode->i_op->put_link)
2366 nd.inode->i_op->put_link(holder.dentry, &nd, cookie);
2367 path_put(&holder);
2369 out:
2370 if (nd.root.mnt)
2371 path_put(&nd.root);
2372 if (filp == ERR_PTR(-ESTALE) && !(flags & LOOKUP_REVAL))
2373 goto reval;
2374 return filp;
2376 exit_dput:
2377 path_put_conditional(&path, &nd);
2378 out_path:
2379 path_put(&nd.path);
2380 out_filp:
2381 if (!IS_ERR(nd.intent.open.file))
2382 release_open_intent(&nd);
2383 filp = ERR_PTR(error);
2384 goto out;
2388 * filp_open - open file and return file pointer
2390 * @filename: path to open
2391 * @flags: open flags as per the open(2) second argument
2392 * @mode: mode for the new file if O_CREAT is set, else ignored
2394 * This is the helper to open a file from kernelspace if you really
2395 * have to. But in generally you should not do this, so please move
2396 * along, nothing to see here..
2398 struct file *filp_open(const char *filename, int flags, int mode)
2400 return do_filp_open(AT_FDCWD, filename, flags, mode, 0);
2402 EXPORT_SYMBOL(filp_open);
2405 * lookup_create - lookup a dentry, creating it if it doesn't exist
2406 * @nd: nameidata info
2407 * @is_dir: directory flag
2409 * Simple function to lookup and return a dentry and create it
2410 * if it doesn't exist. Is SMP-safe.
2412 * Returns with nd->path.dentry->d_inode->i_mutex locked.
2414 struct dentry *lookup_create(struct nameidata *nd, int is_dir)
2416 struct dentry *dentry = ERR_PTR(-EEXIST);
2418 mutex_lock_nested(&nd->path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2420 * Yucky last component or no last component at all?
2421 * (foo/., foo/.., /////)
2423 if (nd->last_type != LAST_NORM)
2424 goto fail;
2425 nd->flags &= ~LOOKUP_PARENT;
2426 nd->flags |= LOOKUP_CREATE | LOOKUP_EXCL;
2427 nd->intent.open.flags = O_EXCL;
2430 * Do the final lookup.
2432 dentry = lookup_hash(nd);
2433 if (IS_ERR(dentry))
2434 goto fail;
2436 if (dentry->d_inode)
2437 goto eexist;
2439 * Special case - lookup gave negative, but... we had foo/bar/
2440 * From the vfs_mknod() POV we just have a negative dentry -
2441 * all is fine. Let's be bastards - you had / on the end, you've
2442 * been asking for (non-existent) directory. -ENOENT for you.
2444 if (unlikely(!is_dir && nd->last.name[nd->last.len])) {
2445 dput(dentry);
2446 dentry = ERR_PTR(-ENOENT);
2448 return dentry;
2449 eexist:
2450 dput(dentry);
2451 dentry = ERR_PTR(-EEXIST);
2452 fail:
2453 return dentry;
2455 EXPORT_SYMBOL_GPL(lookup_create);
2457 int vfs_mknod(struct inode *dir, struct dentry *dentry, int mode, dev_t dev)
2459 int error = may_create(dir, dentry);
2461 if (error)
2462 return error;
2464 if ((S_ISCHR(mode) || S_ISBLK(mode)) && !capable(CAP_MKNOD))
2465 return -EPERM;
2467 if (!dir->i_op->mknod)
2468 return -EPERM;
2470 error = devcgroup_inode_mknod(mode, dev);
2471 if (error)
2472 return error;
2474 error = security_inode_mknod(dir, dentry, mode, dev);
2475 if (error)
2476 return error;
2478 error = dir->i_op->mknod(dir, dentry, mode, dev);
2479 if (!error)
2480 fsnotify_create(dir, dentry);
2481 return error;
2484 static int may_mknod(mode_t mode)
2486 switch (mode & S_IFMT) {
2487 case S_IFREG:
2488 case S_IFCHR:
2489 case S_IFBLK:
2490 case S_IFIFO:
2491 case S_IFSOCK:
2492 case 0: /* zero mode translates to S_IFREG */
2493 return 0;
2494 case S_IFDIR:
2495 return -EPERM;
2496 default:
2497 return -EINVAL;
2501 SYSCALL_DEFINE4(mknodat, int, dfd, const char __user *, filename, int, mode,
2502 unsigned, dev)
2504 int error;
2505 char *tmp;
2506 struct dentry *dentry;
2507 struct nameidata nd;
2509 if (S_ISDIR(mode))
2510 return -EPERM;
2512 error = user_path_parent(dfd, filename, &nd, &tmp);
2513 if (error)
2514 return error;
2516 dentry = lookup_create(&nd, 0);
2517 if (IS_ERR(dentry)) {
2518 error = PTR_ERR(dentry);
2519 goto out_unlock;
2521 if (!IS_POSIXACL(nd.path.dentry->d_inode))
2522 mode &= ~current_umask();
2523 error = may_mknod(mode);
2524 if (error)
2525 goto out_dput;
2526 error = mnt_want_write(nd.path.mnt);
2527 if (error)
2528 goto out_dput;
2529 error = security_path_mknod(&nd.path, dentry, mode, dev);
2530 if (error)
2531 goto out_drop_write;
2532 switch (mode & S_IFMT) {
2533 case 0: case S_IFREG:
2534 error = vfs_create(nd.path.dentry->d_inode,dentry,mode,&nd);
2535 break;
2536 case S_IFCHR: case S_IFBLK:
2537 error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode,
2538 new_decode_dev(dev));
2539 break;
2540 case S_IFIFO: case S_IFSOCK:
2541 error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode,0);
2542 break;
2544 out_drop_write:
2545 mnt_drop_write(nd.path.mnt);
2546 out_dput:
2547 dput(dentry);
2548 out_unlock:
2549 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2550 path_put(&nd.path);
2551 putname(tmp);
2553 return error;
2556 SYSCALL_DEFINE3(mknod, const char __user *, filename, int, mode, unsigned, dev)
2558 return sys_mknodat(AT_FDCWD, filename, mode, dev);
2561 int vfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
2563 int error = may_create(dir, dentry);
2565 if (error)
2566 return error;
2568 if (!dir->i_op->mkdir)
2569 return -EPERM;
2571 mode &= (S_IRWXUGO|S_ISVTX);
2572 error = security_inode_mkdir(dir, dentry, mode);
2573 if (error)
2574 return error;
2576 error = dir->i_op->mkdir(dir, dentry, mode);
2577 if (!error)
2578 fsnotify_mkdir(dir, dentry);
2579 return error;
2582 SYSCALL_DEFINE3(mkdirat, int, dfd, const char __user *, pathname, int, mode)
2584 int error = 0;
2585 char * tmp;
2586 struct dentry *dentry;
2587 struct nameidata nd;
2589 error = user_path_parent(dfd, pathname, &nd, &tmp);
2590 if (error)
2591 goto out_err;
2593 dentry = lookup_create(&nd, 1);
2594 error = PTR_ERR(dentry);
2595 if (IS_ERR(dentry))
2596 goto out_unlock;
2598 if (!IS_POSIXACL(nd.path.dentry->d_inode))
2599 mode &= ~current_umask();
2600 error = mnt_want_write(nd.path.mnt);
2601 if (error)
2602 goto out_dput;
2603 error = security_path_mkdir(&nd.path, dentry, mode);
2604 if (error)
2605 goto out_drop_write;
2606 error = vfs_mkdir(nd.path.dentry->d_inode, dentry, mode);
2607 out_drop_write:
2608 mnt_drop_write(nd.path.mnt);
2609 out_dput:
2610 dput(dentry);
2611 out_unlock:
2612 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2613 path_put(&nd.path);
2614 putname(tmp);
2615 out_err:
2616 return error;
2619 SYSCALL_DEFINE2(mkdir, const char __user *, pathname, int, mode)
2621 return sys_mkdirat(AT_FDCWD, pathname, mode);
2625 * We try to drop the dentry early: we should have
2626 * a usage count of 2 if we're the only user of this
2627 * dentry, and if that is true (possibly after pruning
2628 * the dcache), then we drop the dentry now.
2630 * A low-level filesystem can, if it choses, legally
2631 * do a
2633 * if (!d_unhashed(dentry))
2634 * return -EBUSY;
2636 * if it cannot handle the case of removing a directory
2637 * that is still in use by something else..
2639 void dentry_unhash(struct dentry *dentry)
2641 dget(dentry);
2642 shrink_dcache_parent(dentry);
2643 spin_lock(&dentry->d_lock);
2644 if (dentry->d_count == 2)
2645 __d_drop(dentry);
2646 spin_unlock(&dentry->d_lock);
2649 int vfs_rmdir(struct inode *dir, struct dentry *dentry)
2651 int error = may_delete(dir, dentry, 1);
2653 if (error)
2654 return error;
2656 if (!dir->i_op->rmdir)
2657 return -EPERM;
2659 mutex_lock(&dentry->d_inode->i_mutex);
2660 dentry_unhash(dentry);
2661 if (d_mountpoint(dentry))
2662 error = -EBUSY;
2663 else {
2664 error = security_inode_rmdir(dir, dentry);
2665 if (!error) {
2666 error = dir->i_op->rmdir(dir, dentry);
2667 if (!error) {
2668 dentry->d_inode->i_flags |= S_DEAD;
2669 dont_mount(dentry);
2673 mutex_unlock(&dentry->d_inode->i_mutex);
2674 if (!error) {
2675 d_delete(dentry);
2677 dput(dentry);
2679 return error;
2682 static long do_rmdir(int dfd, const char __user *pathname)
2684 int error = 0;
2685 char * name;
2686 struct dentry *dentry;
2687 struct nameidata nd;
2689 error = user_path_parent(dfd, pathname, &nd, &name);
2690 if (error)
2691 return error;
2693 switch(nd.last_type) {
2694 case LAST_DOTDOT:
2695 error = -ENOTEMPTY;
2696 goto exit1;
2697 case LAST_DOT:
2698 error = -EINVAL;
2699 goto exit1;
2700 case LAST_ROOT:
2701 error = -EBUSY;
2702 goto exit1;
2705 nd.flags &= ~LOOKUP_PARENT;
2707 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2708 dentry = lookup_hash(&nd);
2709 error = PTR_ERR(dentry);
2710 if (IS_ERR(dentry))
2711 goto exit2;
2712 error = mnt_want_write(nd.path.mnt);
2713 if (error)
2714 goto exit3;
2715 error = security_path_rmdir(&nd.path, dentry);
2716 if (error)
2717 goto exit4;
2718 error = vfs_rmdir(nd.path.dentry->d_inode, dentry);
2719 exit4:
2720 mnt_drop_write(nd.path.mnt);
2721 exit3:
2722 dput(dentry);
2723 exit2:
2724 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2725 exit1:
2726 path_put(&nd.path);
2727 putname(name);
2728 return error;
2731 SYSCALL_DEFINE1(rmdir, const char __user *, pathname)
2733 return do_rmdir(AT_FDCWD, pathname);
2736 int vfs_unlink(struct inode *dir, struct dentry *dentry)
2738 int error = may_delete(dir, dentry, 0);
2740 if (error)
2741 return error;
2743 if (!dir->i_op->unlink)
2744 return -EPERM;
2746 mutex_lock(&dentry->d_inode->i_mutex);
2747 if (d_mountpoint(dentry))
2748 error = -EBUSY;
2749 else {
2750 error = security_inode_unlink(dir, dentry);
2751 if (!error) {
2752 error = dir->i_op->unlink(dir, dentry);
2753 if (!error)
2754 dont_mount(dentry);
2757 mutex_unlock(&dentry->d_inode->i_mutex);
2759 /* We don't d_delete() NFS sillyrenamed files--they still exist. */
2760 if (!error && !(dentry->d_flags & DCACHE_NFSFS_RENAMED)) {
2761 fsnotify_link_count(dentry->d_inode);
2762 d_delete(dentry);
2765 return error;
2769 * Make sure that the actual truncation of the file will occur outside its
2770 * directory's i_mutex. Truncate can take a long time if there is a lot of
2771 * writeout happening, and we don't want to prevent access to the directory
2772 * while waiting on the I/O.
2774 static long do_unlinkat(int dfd, const char __user *pathname)
2776 int error;
2777 char *name;
2778 struct dentry *dentry;
2779 struct nameidata nd;
2780 struct inode *inode = NULL;
2782 error = user_path_parent(dfd, pathname, &nd, &name);
2783 if (error)
2784 return error;
2786 error = -EISDIR;
2787 if (nd.last_type != LAST_NORM)
2788 goto exit1;
2790 nd.flags &= ~LOOKUP_PARENT;
2792 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2793 dentry = lookup_hash(&nd);
2794 error = PTR_ERR(dentry);
2795 if (!IS_ERR(dentry)) {
2796 /* Why not before? Because we want correct error value */
2797 if (nd.last.name[nd.last.len])
2798 goto slashes;
2799 inode = dentry->d_inode;
2800 if (inode)
2801 ihold(inode);
2802 error = mnt_want_write(nd.path.mnt);
2803 if (error)
2804 goto exit2;
2805 error = security_path_unlink(&nd.path, dentry);
2806 if (error)
2807 goto exit3;
2808 error = vfs_unlink(nd.path.dentry->d_inode, dentry);
2809 exit3:
2810 mnt_drop_write(nd.path.mnt);
2811 exit2:
2812 dput(dentry);
2814 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2815 if (inode)
2816 iput(inode); /* truncate the inode here */
2817 exit1:
2818 path_put(&nd.path);
2819 putname(name);
2820 return error;
2822 slashes:
2823 error = !dentry->d_inode ? -ENOENT :
2824 S_ISDIR(dentry->d_inode->i_mode) ? -EISDIR : -ENOTDIR;
2825 goto exit2;
2828 SYSCALL_DEFINE3(unlinkat, int, dfd, const char __user *, pathname, int, flag)
2830 if ((flag & ~AT_REMOVEDIR) != 0)
2831 return -EINVAL;
2833 if (flag & AT_REMOVEDIR)
2834 return do_rmdir(dfd, pathname);
2836 return do_unlinkat(dfd, pathname);
2839 SYSCALL_DEFINE1(unlink, const char __user *, pathname)
2841 return do_unlinkat(AT_FDCWD, pathname);
2844 int vfs_symlink(struct inode *dir, struct dentry *dentry, const char *oldname)
2846 int error = may_create(dir, dentry);
2848 if (error)
2849 return error;
2851 if (!dir->i_op->symlink)
2852 return -EPERM;
2854 error = security_inode_symlink(dir, dentry, oldname);
2855 if (error)
2856 return error;
2858 error = dir->i_op->symlink(dir, dentry, oldname);
2859 if (!error)
2860 fsnotify_create(dir, dentry);
2861 return error;
2864 SYSCALL_DEFINE3(symlinkat, const char __user *, oldname,
2865 int, newdfd, const char __user *, newname)
2867 int error;
2868 char *from;
2869 char *to;
2870 struct dentry *dentry;
2871 struct nameidata nd;
2873 from = getname(oldname);
2874 if (IS_ERR(from))
2875 return PTR_ERR(from);
2877 error = user_path_parent(newdfd, newname, &nd, &to);
2878 if (error)
2879 goto out_putname;
2881 dentry = lookup_create(&nd, 0);
2882 error = PTR_ERR(dentry);
2883 if (IS_ERR(dentry))
2884 goto out_unlock;
2886 error = mnt_want_write(nd.path.mnt);
2887 if (error)
2888 goto out_dput;
2889 error = security_path_symlink(&nd.path, dentry, from);
2890 if (error)
2891 goto out_drop_write;
2892 error = vfs_symlink(nd.path.dentry->d_inode, dentry, from);
2893 out_drop_write:
2894 mnt_drop_write(nd.path.mnt);
2895 out_dput:
2896 dput(dentry);
2897 out_unlock:
2898 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2899 path_put(&nd.path);
2900 putname(to);
2901 out_putname:
2902 putname(from);
2903 return error;
2906 SYSCALL_DEFINE2(symlink, const char __user *, oldname, const char __user *, newname)
2908 return sys_symlinkat(oldname, AT_FDCWD, newname);
2911 int vfs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *new_dentry)
2913 struct inode *inode = old_dentry->d_inode;
2914 int error;
2916 if (!inode)
2917 return -ENOENT;
2919 error = may_create(dir, new_dentry);
2920 if (error)
2921 return error;
2923 if (dir->i_sb != inode->i_sb)
2924 return -EXDEV;
2927 * A link to an append-only or immutable file cannot be created.
2929 if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
2930 return -EPERM;
2931 if (!dir->i_op->link)
2932 return -EPERM;
2933 if (S_ISDIR(inode->i_mode))
2934 return -EPERM;
2936 error = security_inode_link(old_dentry, dir, new_dentry);
2937 if (error)
2938 return error;
2940 mutex_lock(&inode->i_mutex);
2941 error = dir->i_op->link(old_dentry, dir, new_dentry);
2942 mutex_unlock(&inode->i_mutex);
2943 if (!error)
2944 fsnotify_link(dir, inode, new_dentry);
2945 return error;
2949 * Hardlinks are often used in delicate situations. We avoid
2950 * security-related surprises by not following symlinks on the
2951 * newname. --KAB
2953 * We don't follow them on the oldname either to be compatible
2954 * with linux 2.0, and to avoid hard-linking to directories
2955 * and other special files. --ADM
2957 SYSCALL_DEFINE5(linkat, int, olddfd, const char __user *, oldname,
2958 int, newdfd, const char __user *, newname, int, flags)
2960 struct dentry *new_dentry;
2961 struct nameidata nd;
2962 struct path old_path;
2963 int error;
2964 char *to;
2966 if ((flags & ~AT_SYMLINK_FOLLOW) != 0)
2967 return -EINVAL;
2969 error = user_path_at(olddfd, oldname,
2970 flags & AT_SYMLINK_FOLLOW ? LOOKUP_FOLLOW : 0,
2971 &old_path);
2972 if (error)
2973 return error;
2975 error = user_path_parent(newdfd, newname, &nd, &to);
2976 if (error)
2977 goto out;
2978 error = -EXDEV;
2979 if (old_path.mnt != nd.path.mnt)
2980 goto out_release;
2981 new_dentry = lookup_create(&nd, 0);
2982 error = PTR_ERR(new_dentry);
2983 if (IS_ERR(new_dentry))
2984 goto out_unlock;
2985 error = mnt_want_write(nd.path.mnt);
2986 if (error)
2987 goto out_dput;
2988 error = security_path_link(old_path.dentry, &nd.path, new_dentry);
2989 if (error)
2990 goto out_drop_write;
2991 error = vfs_link(old_path.dentry, nd.path.dentry->d_inode, new_dentry);
2992 out_drop_write:
2993 mnt_drop_write(nd.path.mnt);
2994 out_dput:
2995 dput(new_dentry);
2996 out_unlock:
2997 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2998 out_release:
2999 path_put(&nd.path);
3000 putname(to);
3001 out:
3002 path_put(&old_path);
3004 return error;
3007 SYSCALL_DEFINE2(link, const char __user *, oldname, const char __user *, newname)
3009 return sys_linkat(AT_FDCWD, oldname, AT_FDCWD, newname, 0);
3013 * The worst of all namespace operations - renaming directory. "Perverted"
3014 * doesn't even start to describe it. Somebody in UCB had a heck of a trip...
3015 * Problems:
3016 * a) we can get into loop creation. Check is done in is_subdir().
3017 * b) race potential - two innocent renames can create a loop together.
3018 * That's where 4.4 screws up. Current fix: serialization on
3019 * sb->s_vfs_rename_mutex. We might be more accurate, but that's another
3020 * story.
3021 * c) we have to lock _three_ objects - parents and victim (if it exists).
3022 * And that - after we got ->i_mutex on parents (until then we don't know
3023 * whether the target exists). Solution: try to be smart with locking
3024 * order for inodes. We rely on the fact that tree topology may change
3025 * only under ->s_vfs_rename_mutex _and_ that parent of the object we
3026 * move will be locked. Thus we can rank directories by the tree
3027 * (ancestors first) and rank all non-directories after them.
3028 * That works since everybody except rename does "lock parent, lookup,
3029 * lock child" and rename is under ->s_vfs_rename_mutex.
3030 * HOWEVER, it relies on the assumption that any object with ->lookup()
3031 * has no more than 1 dentry. If "hybrid" objects will ever appear,
3032 * we'd better make sure that there's no link(2) for them.
3033 * d) some filesystems don't support opened-but-unlinked directories,
3034 * either because of layout or because they are not ready to deal with
3035 * all cases correctly. The latter will be fixed (taking this sort of
3036 * stuff into VFS), but the former is not going away. Solution: the same
3037 * trick as in rmdir().
3038 * e) conversion from fhandle to dentry may come in the wrong moment - when
3039 * we are removing the target. Solution: we will have to grab ->i_mutex
3040 * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on
3041 * ->i_mutex on parents, which works but leads to some truly excessive
3042 * locking].
3044 static int vfs_rename_dir(struct inode *old_dir, struct dentry *old_dentry,
3045 struct inode *new_dir, struct dentry *new_dentry)
3047 int error = 0;
3048 struct inode *target;
3051 * If we are going to change the parent - check write permissions,
3052 * we'll need to flip '..'.
3054 if (new_dir != old_dir) {
3055 error = inode_permission(old_dentry->d_inode, MAY_WRITE);
3056 if (error)
3057 return error;
3060 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
3061 if (error)
3062 return error;
3064 target = new_dentry->d_inode;
3065 if (target)
3066 mutex_lock(&target->i_mutex);
3067 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
3068 error = -EBUSY;
3069 else {
3070 if (target)
3071 dentry_unhash(new_dentry);
3072 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
3074 if (target) {
3075 if (!error) {
3076 target->i_flags |= S_DEAD;
3077 dont_mount(new_dentry);
3079 mutex_unlock(&target->i_mutex);
3080 if (d_unhashed(new_dentry))
3081 d_rehash(new_dentry);
3082 dput(new_dentry);
3084 if (!error)
3085 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
3086 d_move(old_dentry,new_dentry);
3087 return error;
3090 static int vfs_rename_other(struct inode *old_dir, struct dentry *old_dentry,
3091 struct inode *new_dir, struct dentry *new_dentry)
3093 struct inode *target;
3094 int error;
3096 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
3097 if (error)
3098 return error;
3100 dget(new_dentry);
3101 target = new_dentry->d_inode;
3102 if (target)
3103 mutex_lock(&target->i_mutex);
3104 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
3105 error = -EBUSY;
3106 else
3107 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
3108 if (!error) {
3109 if (target)
3110 dont_mount(new_dentry);
3111 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
3112 d_move(old_dentry, new_dentry);
3114 if (target)
3115 mutex_unlock(&target->i_mutex);
3116 dput(new_dentry);
3117 return error;
3120 int vfs_rename(struct inode *old_dir, struct dentry *old_dentry,
3121 struct inode *new_dir, struct dentry *new_dentry)
3123 int error;
3124 int is_dir = S_ISDIR(old_dentry->d_inode->i_mode);
3125 const unsigned char *old_name;
3127 if (old_dentry->d_inode == new_dentry->d_inode)
3128 return 0;
3130 error = may_delete(old_dir, old_dentry, is_dir);
3131 if (error)
3132 return error;
3134 if (!new_dentry->d_inode)
3135 error = may_create(new_dir, new_dentry);
3136 else
3137 error = may_delete(new_dir, new_dentry, is_dir);
3138 if (error)
3139 return error;
3141 if (!old_dir->i_op->rename)
3142 return -EPERM;
3144 old_name = fsnotify_oldname_init(old_dentry->d_name.name);
3146 if (is_dir)
3147 error = vfs_rename_dir(old_dir,old_dentry,new_dir,new_dentry);
3148 else
3149 error = vfs_rename_other(old_dir,old_dentry,new_dir,new_dentry);
3150 if (!error)
3151 fsnotify_move(old_dir, new_dir, old_name, is_dir,
3152 new_dentry->d_inode, old_dentry);
3153 fsnotify_oldname_free(old_name);
3155 return error;
3158 SYSCALL_DEFINE4(renameat, int, olddfd, const char __user *, oldname,
3159 int, newdfd, const char __user *, newname)
3161 struct dentry *old_dir, *new_dir;
3162 struct dentry *old_dentry, *new_dentry;
3163 struct dentry *trap;
3164 struct nameidata oldnd, newnd;
3165 char *from;
3166 char *to;
3167 int error;
3169 error = user_path_parent(olddfd, oldname, &oldnd, &from);
3170 if (error)
3171 goto exit;
3173 error = user_path_parent(newdfd, newname, &newnd, &to);
3174 if (error)
3175 goto exit1;
3177 error = -EXDEV;
3178 if (oldnd.path.mnt != newnd.path.mnt)
3179 goto exit2;
3181 old_dir = oldnd.path.dentry;
3182 error = -EBUSY;
3183 if (oldnd.last_type != LAST_NORM)
3184 goto exit2;
3186 new_dir = newnd.path.dentry;
3187 if (newnd.last_type != LAST_NORM)
3188 goto exit2;
3190 oldnd.flags &= ~LOOKUP_PARENT;
3191 newnd.flags &= ~LOOKUP_PARENT;
3192 newnd.flags |= LOOKUP_RENAME_TARGET;
3194 trap = lock_rename(new_dir, old_dir);
3196 old_dentry = lookup_hash(&oldnd);
3197 error = PTR_ERR(old_dentry);
3198 if (IS_ERR(old_dentry))
3199 goto exit3;
3200 /* source must exist */
3201 error = -ENOENT;
3202 if (!old_dentry->d_inode)
3203 goto exit4;
3204 /* unless the source is a directory trailing slashes give -ENOTDIR */
3205 if (!S_ISDIR(old_dentry->d_inode->i_mode)) {
3206 error = -ENOTDIR;
3207 if (oldnd.last.name[oldnd.last.len])
3208 goto exit4;
3209 if (newnd.last.name[newnd.last.len])
3210 goto exit4;
3212 /* source should not be ancestor of target */
3213 error = -EINVAL;
3214 if (old_dentry == trap)
3215 goto exit4;
3216 new_dentry = lookup_hash(&newnd);
3217 error = PTR_ERR(new_dentry);
3218 if (IS_ERR(new_dentry))
3219 goto exit4;
3220 /* target should not be an ancestor of source */
3221 error = -ENOTEMPTY;
3222 if (new_dentry == trap)
3223 goto exit5;
3225 error = mnt_want_write(oldnd.path.mnt);
3226 if (error)
3227 goto exit5;
3228 error = security_path_rename(&oldnd.path, old_dentry,
3229 &newnd.path, new_dentry);
3230 if (error)
3231 goto exit6;
3232 error = vfs_rename(old_dir->d_inode, old_dentry,
3233 new_dir->d_inode, new_dentry);
3234 exit6:
3235 mnt_drop_write(oldnd.path.mnt);
3236 exit5:
3237 dput(new_dentry);
3238 exit4:
3239 dput(old_dentry);
3240 exit3:
3241 unlock_rename(new_dir, old_dir);
3242 exit2:
3243 path_put(&newnd.path);
3244 putname(to);
3245 exit1:
3246 path_put(&oldnd.path);
3247 putname(from);
3248 exit:
3249 return error;
3252 SYSCALL_DEFINE2(rename, const char __user *, oldname, const char __user *, newname)
3254 return sys_renameat(AT_FDCWD, oldname, AT_FDCWD, newname);
3257 int vfs_readlink(struct dentry *dentry, char __user *buffer, int buflen, const char *link)
3259 int len;
3261 len = PTR_ERR(link);
3262 if (IS_ERR(link))
3263 goto out;
3265 len = strlen(link);
3266 if (len > (unsigned) buflen)
3267 len = buflen;
3268 if (copy_to_user(buffer, link, len))
3269 len = -EFAULT;
3270 out:
3271 return len;
3275 * A helper for ->readlink(). This should be used *ONLY* for symlinks that
3276 * have ->follow_link() touching nd only in nd_set_link(). Using (or not
3277 * using) it for any given inode is up to filesystem.
3279 int generic_readlink(struct dentry *dentry, char __user *buffer, int buflen)
3281 struct nameidata nd;
3282 void *cookie;
3283 int res;
3285 nd.depth = 0;
3286 cookie = dentry->d_inode->i_op->follow_link(dentry, &nd);
3287 if (IS_ERR(cookie))
3288 return PTR_ERR(cookie);
3290 res = vfs_readlink(dentry, buffer, buflen, nd_get_link(&nd));
3291 if (dentry->d_inode->i_op->put_link)
3292 dentry->d_inode->i_op->put_link(dentry, &nd, cookie);
3293 return res;
3296 int vfs_follow_link(struct nameidata *nd, const char *link)
3298 return __vfs_follow_link(nd, link);
3301 /* get the link contents into pagecache */
3302 static char *page_getlink(struct dentry * dentry, struct page **ppage)
3304 char *kaddr;
3305 struct page *page;
3306 struct address_space *mapping = dentry->d_inode->i_mapping;
3307 page = read_mapping_page(mapping, 0, NULL);
3308 if (IS_ERR(page))
3309 return (char*)page;
3310 *ppage = page;
3311 kaddr = kmap(page);
3312 nd_terminate_link(kaddr, dentry->d_inode->i_size, PAGE_SIZE - 1);
3313 return kaddr;
3316 int page_readlink(struct dentry *dentry, char __user *buffer, int buflen)
3318 struct page *page = NULL;
3319 char *s = page_getlink(dentry, &page);
3320 int res = vfs_readlink(dentry,buffer,buflen,s);
3321 if (page) {
3322 kunmap(page);
3323 page_cache_release(page);
3325 return res;
3328 void *page_follow_link_light(struct dentry *dentry, struct nameidata *nd)
3330 struct page *page = NULL;
3331 nd_set_link(nd, page_getlink(dentry, &page));
3332 return page;
3335 void page_put_link(struct dentry *dentry, struct nameidata *nd, void *cookie)
3337 struct page *page = cookie;
3339 if (page) {
3340 kunmap(page);
3341 page_cache_release(page);
3346 * The nofs argument instructs pagecache_write_begin to pass AOP_FLAG_NOFS
3348 int __page_symlink(struct inode *inode, const char *symname, int len, int nofs)
3350 struct address_space *mapping = inode->i_mapping;
3351 struct page *page;
3352 void *fsdata;
3353 int err;
3354 char *kaddr;
3355 unsigned int flags = AOP_FLAG_UNINTERRUPTIBLE;
3356 if (nofs)
3357 flags |= AOP_FLAG_NOFS;
3359 retry:
3360 err = pagecache_write_begin(NULL, mapping, 0, len-1,
3361 flags, &page, &fsdata);
3362 if (err)
3363 goto fail;
3365 kaddr = kmap_atomic(page, KM_USER0);
3366 memcpy(kaddr, symname, len-1);
3367 kunmap_atomic(kaddr, KM_USER0);
3369 err = pagecache_write_end(NULL, mapping, 0, len-1, len-1,
3370 page, fsdata);
3371 if (err < 0)
3372 goto fail;
3373 if (err < len-1)
3374 goto retry;
3376 mark_inode_dirty(inode);
3377 return 0;
3378 fail:
3379 return err;
3382 int page_symlink(struct inode *inode, const char *symname, int len)
3384 return __page_symlink(inode, symname, len,
3385 !(mapping_gfp_mask(inode->i_mapping) & __GFP_FS));
3388 const struct inode_operations page_symlink_inode_operations = {
3389 .readlink = generic_readlink,
3390 .follow_link = page_follow_link_light,
3391 .put_link = page_put_link,
3394 EXPORT_SYMBOL(user_path_at);
3395 EXPORT_SYMBOL(follow_down);
3396 EXPORT_SYMBOL(follow_up);
3397 EXPORT_SYMBOL(get_write_access); /* binfmt_aout */
3398 EXPORT_SYMBOL(getname);
3399 EXPORT_SYMBOL(lock_rename);
3400 EXPORT_SYMBOL(lookup_one_len);
3401 EXPORT_SYMBOL(page_follow_link_light);
3402 EXPORT_SYMBOL(page_put_link);
3403 EXPORT_SYMBOL(page_readlink);
3404 EXPORT_SYMBOL(__page_symlink);
3405 EXPORT_SYMBOL(page_symlink);
3406 EXPORT_SYMBOL(page_symlink_inode_operations);
3407 EXPORT_SYMBOL(path_lookup);
3408 EXPORT_SYMBOL(kern_path);
3409 EXPORT_SYMBOL(vfs_path_lookup);
3410 EXPORT_SYMBOL(inode_permission);
3411 EXPORT_SYMBOL(file_permission);
3412 EXPORT_SYMBOL(unlock_rename);
3413 EXPORT_SYMBOL(vfs_create);
3414 EXPORT_SYMBOL(vfs_follow_link);
3415 EXPORT_SYMBOL(vfs_link);
3416 EXPORT_SYMBOL(vfs_mkdir);
3417 EXPORT_SYMBOL(vfs_mknod);
3418 EXPORT_SYMBOL(generic_permission);
3419 EXPORT_SYMBOL(vfs_readlink);
3420 EXPORT_SYMBOL(vfs_rename);
3421 EXPORT_SYMBOL(vfs_rmdir);
3422 EXPORT_SYMBOL(vfs_symlink);
3423 EXPORT_SYMBOL(vfs_unlink);
3424 EXPORT_SYMBOL(dentry_unhash);
3425 EXPORT_SYMBOL(generic_readlink);