Merge branch 'for-linus' of git://git.open-osd.org/linux-open-osd
[deliverable/linux.git] / fs / namei.c
... / ...
CommitLineData
1/*
2 * linux/fs/namei.c
3 *
4 * Copyright (C) 1991, 1992 Linus Torvalds
5 */
6
7/*
8 * Some corrections by tytso.
9 */
10
11/* [Feb 1997 T. Schoebel-Theuer] Complete rewrite of the pathname
12 * lookup logic.
13 */
14/* [Feb-Apr 2000, AV] Rewrite to the new namespace architecture.
15 */
16
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>
37
38#include "internal.h"
39
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).
45 *
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.
52 *
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.
56 *
57 * [29-Apr-1998 C. Scott Ananian] Updated above description of symlink
58 * resolution to correspond with current state of the code.
59 *
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.
66 */
67
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.
75 *
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.
83 */
84
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.
87 *
88 * [10-Sep-98 Alan Modra] Another symlink change.
89 */
90
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).
98 *
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...
104 */
105/*
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...
109 */
110
111/* In order to reduce some races, while at the same time doing additional
112 * checking and hopefully speeding things up, we copy filenames to the
113 * kernel data space before using them..
114 *
115 * POSIX.1 2.4: an empty pathname is invalid (ENOENT).
116 * PATH_MAX includes the nul terminator --RR.
117 */
118static int do_getname(const char __user *filename, char *page)
119{
120 int retval;
121 unsigned long len = PATH_MAX;
122
123 if (!segment_eq(get_fs(), KERNEL_DS)) {
124 if ((unsigned long) filename >= TASK_SIZE)
125 return -EFAULT;
126 if (TASK_SIZE - (unsigned long) filename < PATH_MAX)
127 len = TASK_SIZE - (unsigned long) filename;
128 }
129
130 retval = strncpy_from_user(page, filename, len);
131 if (retval > 0) {
132 if (retval < len)
133 return 0;
134 return -ENAMETOOLONG;
135 } else if (!retval)
136 retval = -ENOENT;
137 return retval;
138}
139
140char * getname(const char __user * filename)
141{
142 char *tmp, *result;
143
144 result = ERR_PTR(-ENOMEM);
145 tmp = __getname();
146 if (tmp) {
147 int retval = do_getname(filename, tmp);
148
149 result = tmp;
150 if (retval < 0) {
151 __putname(tmp);
152 result = ERR_PTR(retval);
153 }
154 }
155 audit_getname(result);
156 return result;
157}
158
159#ifdef CONFIG_AUDITSYSCALL
160void putname(const char *name)
161{
162 if (unlikely(!audit_dummy_context()))
163 audit_putname(name);
164 else
165 __putname(name);
166}
167EXPORT_SYMBOL(putname);
168#endif
169
170/*
171 * This does basic POSIX ACL permission checking
172 */
173static int acl_permission_check(struct inode *inode, int mask,
174 int (*check_acl)(struct inode *inode, int mask))
175{
176 umode_t mode = inode->i_mode;
177
178 mask &= MAY_READ | MAY_WRITE | MAY_EXEC;
179
180 if (current_fsuid() == inode->i_uid)
181 mode >>= 6;
182 else {
183 if (IS_POSIXACL(inode) && (mode & S_IRWXG) && check_acl) {
184 int error = check_acl(inode, mask);
185 if (error != -EAGAIN)
186 return error;
187 }
188
189 if (in_group_p(inode->i_gid))
190 mode >>= 3;
191 }
192
193 /*
194 * If the DACs are ok we don't need any capability check.
195 */
196 if ((mask & ~mode) == 0)
197 return 0;
198 return -EACCES;
199}
200
201/**
202 * generic_permission - check for access rights on a Posix-like filesystem
203 * @inode: inode to check access rights for
204 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
205 * @check_acl: optional callback to check for Posix ACLs
206 *
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..
211 */
212int generic_permission(struct inode *inode, int mask,
213 int (*check_acl)(struct inode *inode, int mask))
214{
215 int ret;
216
217 /*
218 * Do the basic POSIX ACL permission checks.
219 */
220 ret = acl_permission_check(inode, mask, check_acl);
221 if (ret != -EACCES)
222 return ret;
223
224 /*
225 * Read/write DACs are always overridable.
226 * Executable DACs are overridable if at least one exec bit is set.
227 */
228 if (!(mask & MAY_EXEC) || execute_ok(inode))
229 if (capable(CAP_DAC_OVERRIDE))
230 return 0;
231
232 /*
233 * Searching includes executable on directories, else just read.
234 */
235 mask &= MAY_READ | MAY_WRITE | MAY_EXEC;
236 if (mask == MAY_READ || (S_ISDIR(inode->i_mode) && !(mask & MAY_WRITE)))
237 if (capable(CAP_DAC_READ_SEARCH))
238 return 0;
239
240 return -EACCES;
241}
242
243/**
244 * inode_permission - check for access rights to a given inode
245 * @inode: inode to check permission on
246 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
247 *
248 * Used to check for read/write/execute permissions on an inode.
249 * We use "fsuid" for this, letting us set arbitrary permissions
250 * for filesystem access without changing the "normal" uids which
251 * are used for other things.
252 */
253int inode_permission(struct inode *inode, int mask)
254{
255 int retval;
256
257 if (mask & MAY_WRITE) {
258 umode_t mode = inode->i_mode;
259
260 /*
261 * Nobody gets write access to a read-only fs.
262 */
263 if (IS_RDONLY(inode) &&
264 (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode)))
265 return -EROFS;
266
267 /*
268 * Nobody gets write access to an immutable file.
269 */
270 if (IS_IMMUTABLE(inode))
271 return -EACCES;
272 }
273
274 if (inode->i_op->permission)
275 retval = inode->i_op->permission(inode, mask);
276 else
277 retval = generic_permission(inode, mask, inode->i_op->check_acl);
278
279 if (retval)
280 return retval;
281
282 retval = devcgroup_inode_permission(inode, mask);
283 if (retval)
284 return retval;
285
286 return security_inode_permission(inode,
287 mask & (MAY_READ|MAY_WRITE|MAY_EXEC|MAY_APPEND));
288}
289
290/**
291 * file_permission - check for additional access rights to a given file
292 * @file: file to check access rights for
293 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
294 *
295 * Used to check for read/write/execute permissions on an already opened
296 * file.
297 *
298 * Note:
299 * Do not use this function in new code. All access checks should
300 * be done using inode_permission().
301 */
302int file_permission(struct file *file, int mask)
303{
304 return inode_permission(file->f_path.dentry->d_inode, mask);
305}
306
307/*
308 * get_write_access() gets write permission for a file.
309 * put_write_access() releases this write permission.
310 * This is used for regular files.
311 * We cannot support write (and maybe mmap read-write shared) accesses and
312 * MAP_DENYWRITE mmappings simultaneously. The i_writecount field of an inode
313 * can have the following values:
314 * 0: no writers, no VM_DENYWRITE mappings
315 * < 0: (-i_writecount) vm_area_structs with VM_DENYWRITE set exist
316 * > 0: (i_writecount) users are writing to the file.
317 *
318 * Normally we operate on that counter with atomic_{inc,dec} and it's safe
319 * except for the cases where we don't hold i_writecount yet. Then we need to
320 * use {get,deny}_write_access() - these functions check the sign and refuse
321 * to do the change if sign is wrong. Exclusion between them is provided by
322 * the inode->i_lock spinlock.
323 */
324
325int get_write_access(struct inode * inode)
326{
327 spin_lock(&inode->i_lock);
328 if (atomic_read(&inode->i_writecount) < 0) {
329 spin_unlock(&inode->i_lock);
330 return -ETXTBSY;
331 }
332 atomic_inc(&inode->i_writecount);
333 spin_unlock(&inode->i_lock);
334
335 return 0;
336}
337
338int deny_write_access(struct file * file)
339{
340 struct inode *inode = file->f_path.dentry->d_inode;
341
342 spin_lock(&inode->i_lock);
343 if (atomic_read(&inode->i_writecount) > 0) {
344 spin_unlock(&inode->i_lock);
345 return -ETXTBSY;
346 }
347 atomic_dec(&inode->i_writecount);
348 spin_unlock(&inode->i_lock);
349
350 return 0;
351}
352
353/**
354 * path_get - get a reference to a path
355 * @path: path to get the reference to
356 *
357 * Given a path increment the reference count to the dentry and the vfsmount.
358 */
359void path_get(struct path *path)
360{
361 mntget(path->mnt);
362 dget(path->dentry);
363}
364EXPORT_SYMBOL(path_get);
365
366/**
367 * path_put - put a reference to a path
368 * @path: path to put the reference to
369 *
370 * Given a path decrement the reference count to the dentry and the vfsmount.
371 */
372void path_put(struct path *path)
373{
374 dput(path->dentry);
375 mntput(path->mnt);
376}
377EXPORT_SYMBOL(path_put);
378
379/**
380 * release_open_intent - free up open intent resources
381 * @nd: pointer to nameidata
382 */
383void release_open_intent(struct nameidata *nd)
384{
385 if (nd->intent.open.file->f_path.dentry == NULL)
386 put_filp(nd->intent.open.file);
387 else
388 fput(nd->intent.open.file);
389}
390
391static inline struct dentry *
392do_revalidate(struct dentry *dentry, struct nameidata *nd)
393{
394 int status = dentry->d_op->d_revalidate(dentry, nd);
395 if (unlikely(status <= 0)) {
396 /*
397 * The dentry failed validation.
398 * If d_revalidate returned 0 attempt to invalidate
399 * the dentry otherwise d_revalidate is asking us
400 * to return a fail status.
401 */
402 if (!status) {
403 if (!d_invalidate(dentry)) {
404 dput(dentry);
405 dentry = NULL;
406 }
407 } else {
408 dput(dentry);
409 dentry = ERR_PTR(status);
410 }
411 }
412 return dentry;
413}
414
415/*
416 * force_reval_path - force revalidation of a dentry
417 *
418 * In some situations the path walking code will trust dentries without
419 * revalidating them. This causes problems for filesystems that depend on
420 * d_revalidate to handle file opens (e.g. NFSv4). When FS_REVAL_DOT is set
421 * (which indicates that it's possible for the dentry to go stale), force
422 * a d_revalidate call before proceeding.
423 *
424 * Returns 0 if the revalidation was successful. If the revalidation fails,
425 * either return the error returned by d_revalidate or -ESTALE if the
426 * revalidation it just returned 0. If d_revalidate returns 0, we attempt to
427 * invalidate the dentry. It's up to the caller to handle putting references
428 * to the path if necessary.
429 */
430static int
431force_reval_path(struct path *path, struct nameidata *nd)
432{
433 int status;
434 struct dentry *dentry = path->dentry;
435
436 /*
437 * only check on filesystems where it's possible for the dentry to
438 * become stale. It's assumed that if this flag is set then the
439 * d_revalidate op will also be defined.
440 */
441 if (!(dentry->d_sb->s_type->fs_flags & FS_REVAL_DOT))
442 return 0;
443
444 status = dentry->d_op->d_revalidate(dentry, nd);
445 if (status > 0)
446 return 0;
447
448 if (!status) {
449 d_invalidate(dentry);
450 status = -ESTALE;
451 }
452 return status;
453}
454
455/*
456 * Short-cut version of permission(), for calling on directories
457 * during pathname resolution. Combines parts of permission()
458 * and generic_permission(), and tests ONLY for MAY_EXEC permission.
459 *
460 * If appropriate, check DAC only. If not appropriate, or
461 * short-cut DAC fails, then call ->permission() to do more
462 * complete permission check.
463 */
464static int exec_permission(struct inode *inode)
465{
466 int ret;
467
468 if (inode->i_op->permission) {
469 ret = inode->i_op->permission(inode, MAY_EXEC);
470 if (!ret)
471 goto ok;
472 return ret;
473 }
474 ret = acl_permission_check(inode, MAY_EXEC, inode->i_op->check_acl);
475 if (!ret)
476 goto ok;
477
478 if (capable(CAP_DAC_OVERRIDE) || capable(CAP_DAC_READ_SEARCH))
479 goto ok;
480
481 return ret;
482ok:
483 return security_inode_permission(inode, MAY_EXEC);
484}
485
486static __always_inline void set_root(struct nameidata *nd)
487{
488 if (!nd->root.mnt) {
489 struct fs_struct *fs = current->fs;
490 read_lock(&fs->lock);
491 nd->root = fs->root;
492 path_get(&nd->root);
493 read_unlock(&fs->lock);
494 }
495}
496
497static int link_path_walk(const char *, struct nameidata *);
498
499static __always_inline int __vfs_follow_link(struct nameidata *nd, const char *link)
500{
501 int res = 0;
502 char *name;
503 if (IS_ERR(link))
504 goto fail;
505
506 if (*link == '/') {
507 set_root(nd);
508 path_put(&nd->path);
509 nd->path = nd->root;
510 path_get(&nd->root);
511 }
512
513 res = link_path_walk(link, nd);
514 if (nd->depth || res || nd->last_type!=LAST_NORM)
515 return res;
516 /*
517 * If it is an iterative symlinks resolution in open_namei() we
518 * have to copy the last component. And all that crap because of
519 * bloody create() on broken symlinks. Furrfu...
520 */
521 name = __getname();
522 if (unlikely(!name)) {
523 path_put(&nd->path);
524 return -ENOMEM;
525 }
526 strcpy(name, nd->last.name);
527 nd->last.name = name;
528 return 0;
529fail:
530 path_put(&nd->path);
531 return PTR_ERR(link);
532}
533
534static void path_put_conditional(struct path *path, struct nameidata *nd)
535{
536 dput(path->dentry);
537 if (path->mnt != nd->path.mnt)
538 mntput(path->mnt);
539}
540
541static inline void path_to_nameidata(struct path *path, struct nameidata *nd)
542{
543 dput(nd->path.dentry);
544 if (nd->path.mnt != path->mnt)
545 mntput(nd->path.mnt);
546 nd->path.mnt = path->mnt;
547 nd->path.dentry = path->dentry;
548}
549
550static __always_inline int __do_follow_link(struct path *path, struct nameidata *nd)
551{
552 int error;
553 void *cookie;
554 struct dentry *dentry = path->dentry;
555
556 touch_atime(path->mnt, dentry);
557 nd_set_link(nd, NULL);
558
559 if (path->mnt != nd->path.mnt) {
560 path_to_nameidata(path, nd);
561 dget(dentry);
562 }
563 mntget(path->mnt);
564 nd->last_type = LAST_BIND;
565 cookie = dentry->d_inode->i_op->follow_link(dentry, nd);
566 error = PTR_ERR(cookie);
567 if (!IS_ERR(cookie)) {
568 char *s = nd_get_link(nd);
569 error = 0;
570 if (s)
571 error = __vfs_follow_link(nd, s);
572 else if (nd->last_type == LAST_BIND) {
573 error = force_reval_path(&nd->path, nd);
574 if (error)
575 path_put(&nd->path);
576 }
577 if (dentry->d_inode->i_op->put_link)
578 dentry->d_inode->i_op->put_link(dentry, nd, cookie);
579 }
580 return error;
581}
582
583/*
584 * This limits recursive symlink follows to 8, while
585 * limiting consecutive symlinks to 40.
586 *
587 * Without that kind of total limit, nasty chains of consecutive
588 * symlinks can cause almost arbitrarily long lookups.
589 */
590static inline int do_follow_link(struct path *path, struct nameidata *nd)
591{
592 int err = -ELOOP;
593 if (current->link_count >= MAX_NESTED_LINKS)
594 goto loop;
595 if (current->total_link_count >= 40)
596 goto loop;
597 BUG_ON(nd->depth >= MAX_NESTED_LINKS);
598 cond_resched();
599 err = security_inode_follow_link(path->dentry, nd);
600 if (err)
601 goto loop;
602 current->link_count++;
603 current->total_link_count++;
604 nd->depth++;
605 err = __do_follow_link(path, nd);
606 path_put(path);
607 current->link_count--;
608 nd->depth--;
609 return err;
610loop:
611 path_put_conditional(path, nd);
612 path_put(&nd->path);
613 return err;
614}
615
616int follow_up(struct path *path)
617{
618 struct vfsmount *parent;
619 struct dentry *mountpoint;
620 spin_lock(&vfsmount_lock);
621 parent = path->mnt->mnt_parent;
622 if (parent == path->mnt) {
623 spin_unlock(&vfsmount_lock);
624 return 0;
625 }
626 mntget(parent);
627 mountpoint = dget(path->mnt->mnt_mountpoint);
628 spin_unlock(&vfsmount_lock);
629 dput(path->dentry);
630 path->dentry = mountpoint;
631 mntput(path->mnt);
632 path->mnt = parent;
633 return 1;
634}
635
636/* no need for dcache_lock, as serialization is taken care in
637 * namespace.c
638 */
639static int __follow_mount(struct path *path)
640{
641 int res = 0;
642 while (d_mountpoint(path->dentry)) {
643 struct vfsmount *mounted = lookup_mnt(path);
644 if (!mounted)
645 break;
646 dput(path->dentry);
647 if (res)
648 mntput(path->mnt);
649 path->mnt = mounted;
650 path->dentry = dget(mounted->mnt_root);
651 res = 1;
652 }
653 return res;
654}
655
656static void follow_mount(struct path *path)
657{
658 while (d_mountpoint(path->dentry)) {
659 struct vfsmount *mounted = lookup_mnt(path);
660 if (!mounted)
661 break;
662 dput(path->dentry);
663 mntput(path->mnt);
664 path->mnt = mounted;
665 path->dentry = dget(mounted->mnt_root);
666 }
667}
668
669/* no need for dcache_lock, as serialization is taken care in
670 * namespace.c
671 */
672int follow_down(struct path *path)
673{
674 struct vfsmount *mounted;
675
676 mounted = lookup_mnt(path);
677 if (mounted) {
678 dput(path->dentry);
679 mntput(path->mnt);
680 path->mnt = mounted;
681 path->dentry = dget(mounted->mnt_root);
682 return 1;
683 }
684 return 0;
685}
686
687static __always_inline void follow_dotdot(struct nameidata *nd)
688{
689 set_root(nd);
690
691 while(1) {
692 struct dentry *old = nd->path.dentry;
693
694 if (nd->path.dentry == nd->root.dentry &&
695 nd->path.mnt == nd->root.mnt) {
696 break;
697 }
698 if (nd->path.dentry != nd->path.mnt->mnt_root) {
699 /* rare case of legitimate dget_parent()... */
700 nd->path.dentry = dget_parent(nd->path.dentry);
701 dput(old);
702 break;
703 }
704 if (!follow_up(&nd->path))
705 break;
706 }
707 follow_mount(&nd->path);
708}
709
710/*
711 * It's more convoluted than I'd like it to be, but... it's still fairly
712 * small and for now I'd prefer to have fast path as straight as possible.
713 * It _is_ time-critical.
714 */
715static int do_lookup(struct nameidata *nd, struct qstr *name,
716 struct path *path)
717{
718 struct vfsmount *mnt = nd->path.mnt;
719 struct dentry *dentry, *parent;
720 struct inode *dir;
721 /*
722 * See if the low-level filesystem might want
723 * to use its own hash..
724 */
725 if (nd->path.dentry->d_op && nd->path.dentry->d_op->d_hash) {
726 int err = nd->path.dentry->d_op->d_hash(nd->path.dentry, name);
727 if (err < 0)
728 return err;
729 }
730
731 dentry = __d_lookup(nd->path.dentry, name);
732 if (!dentry)
733 goto need_lookup;
734 if (dentry->d_op && dentry->d_op->d_revalidate)
735 goto need_revalidate;
736done:
737 path->mnt = mnt;
738 path->dentry = dentry;
739 __follow_mount(path);
740 return 0;
741
742need_lookup:
743 parent = nd->path.dentry;
744 dir = parent->d_inode;
745
746 mutex_lock(&dir->i_mutex);
747 /*
748 * First re-do the cached lookup just in case it was created
749 * while we waited for the directory semaphore..
750 *
751 * FIXME! This could use version numbering or similar to
752 * avoid unnecessary cache lookups.
753 *
754 * The "dcache_lock" is purely to protect the RCU list walker
755 * from concurrent renames at this point (we mustn't get false
756 * negatives from the RCU list walk here, unlike the optimistic
757 * fast walk).
758 *
759 * so doing d_lookup() (with seqlock), instead of lockfree __d_lookup
760 */
761 dentry = d_lookup(parent, name);
762 if (!dentry) {
763 struct dentry *new;
764
765 /* Don't create child dentry for a dead directory. */
766 dentry = ERR_PTR(-ENOENT);
767 if (IS_DEADDIR(dir))
768 goto out_unlock;
769
770 new = d_alloc(parent, name);
771 dentry = ERR_PTR(-ENOMEM);
772 if (new) {
773 dentry = dir->i_op->lookup(dir, new, nd);
774 if (dentry)
775 dput(new);
776 else
777 dentry = new;
778 }
779out_unlock:
780 mutex_unlock(&dir->i_mutex);
781 if (IS_ERR(dentry))
782 goto fail;
783 goto done;
784 }
785
786 /*
787 * Uhhuh! Nasty case: the cache was re-populated while
788 * we waited on the semaphore. Need to revalidate.
789 */
790 mutex_unlock(&dir->i_mutex);
791 if (dentry->d_op && dentry->d_op->d_revalidate) {
792 dentry = do_revalidate(dentry, nd);
793 if (!dentry)
794 dentry = ERR_PTR(-ENOENT);
795 }
796 if (IS_ERR(dentry))
797 goto fail;
798 goto done;
799
800need_revalidate:
801 dentry = do_revalidate(dentry, nd);
802 if (!dentry)
803 goto need_lookup;
804 if (IS_ERR(dentry))
805 goto fail;
806 goto done;
807
808fail:
809 return PTR_ERR(dentry);
810}
811
812/*
813 * This is a temporary kludge to deal with "automount" symlinks; proper
814 * solution is to trigger them on follow_mount(), so that do_lookup()
815 * would DTRT. To be killed before 2.6.34-final.
816 */
817static inline int follow_on_final(struct inode *inode, unsigned lookup_flags)
818{
819 return inode && unlikely(inode->i_op->follow_link) &&
820 ((lookup_flags & LOOKUP_FOLLOW) || S_ISDIR(inode->i_mode));
821}
822
823/*
824 * Name resolution.
825 * This is the basic name resolution function, turning a pathname into
826 * the final dentry. We expect 'base' to be positive and a directory.
827 *
828 * Returns 0 and nd will have valid dentry and mnt on success.
829 * Returns error and drops reference to input namei data on failure.
830 */
831static int link_path_walk(const char *name, struct nameidata *nd)
832{
833 struct path next;
834 struct inode *inode;
835 int err;
836 unsigned int lookup_flags = nd->flags;
837
838 while (*name=='/')
839 name++;
840 if (!*name)
841 goto return_reval;
842
843 inode = nd->path.dentry->d_inode;
844 if (nd->depth)
845 lookup_flags = LOOKUP_FOLLOW | (nd->flags & LOOKUP_CONTINUE);
846
847 /* At this point we know we have a real path component. */
848 for(;;) {
849 unsigned long hash;
850 struct qstr this;
851 unsigned int c;
852
853 nd->flags |= LOOKUP_CONTINUE;
854 err = exec_permission(inode);
855 if (err)
856 break;
857
858 this.name = name;
859 c = *(const unsigned char *)name;
860
861 hash = init_name_hash();
862 do {
863 name++;
864 hash = partial_name_hash(c, hash);
865 c = *(const unsigned char *)name;
866 } while (c && (c != '/'));
867 this.len = name - (const char *) this.name;
868 this.hash = end_name_hash(hash);
869
870 /* remove trailing slashes? */
871 if (!c)
872 goto last_component;
873 while (*++name == '/');
874 if (!*name)
875 goto last_with_slashes;
876
877 /*
878 * "." and ".." are special - ".." especially so because it has
879 * to be able to know about the current root directory and
880 * parent relationships.
881 */
882 if (this.name[0] == '.') switch (this.len) {
883 default:
884 break;
885 case 2:
886 if (this.name[1] != '.')
887 break;
888 follow_dotdot(nd);
889 inode = nd->path.dentry->d_inode;
890 /* fallthrough */
891 case 1:
892 continue;
893 }
894 /* This does the actual lookups.. */
895 err = do_lookup(nd, &this, &next);
896 if (err)
897 break;
898
899 err = -ENOENT;
900 inode = next.dentry->d_inode;
901 if (!inode)
902 goto out_dput;
903
904 if (inode->i_op->follow_link) {
905 err = do_follow_link(&next, nd);
906 if (err)
907 goto return_err;
908 err = -ENOENT;
909 inode = nd->path.dentry->d_inode;
910 if (!inode)
911 break;
912 } else
913 path_to_nameidata(&next, nd);
914 err = -ENOTDIR;
915 if (!inode->i_op->lookup)
916 break;
917 continue;
918 /* here ends the main loop */
919
920last_with_slashes:
921 lookup_flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY;
922last_component:
923 /* Clear LOOKUP_CONTINUE iff it was previously unset */
924 nd->flags &= lookup_flags | ~LOOKUP_CONTINUE;
925 if (lookup_flags & LOOKUP_PARENT)
926 goto lookup_parent;
927 if (this.name[0] == '.') switch (this.len) {
928 default:
929 break;
930 case 2:
931 if (this.name[1] != '.')
932 break;
933 follow_dotdot(nd);
934 inode = nd->path.dentry->d_inode;
935 /* fallthrough */
936 case 1:
937 goto return_reval;
938 }
939 err = do_lookup(nd, &this, &next);
940 if (err)
941 break;
942 inode = next.dentry->d_inode;
943 if (follow_on_final(inode, lookup_flags)) {
944 err = do_follow_link(&next, nd);
945 if (err)
946 goto return_err;
947 inode = nd->path.dentry->d_inode;
948 } else
949 path_to_nameidata(&next, nd);
950 err = -ENOENT;
951 if (!inode)
952 break;
953 if (lookup_flags & LOOKUP_DIRECTORY) {
954 err = -ENOTDIR;
955 if (!inode->i_op->lookup)
956 break;
957 }
958 goto return_base;
959lookup_parent:
960 nd->last = this;
961 nd->last_type = LAST_NORM;
962 if (this.name[0] != '.')
963 goto return_base;
964 if (this.len == 1)
965 nd->last_type = LAST_DOT;
966 else if (this.len == 2 && this.name[1] == '.')
967 nd->last_type = LAST_DOTDOT;
968 else
969 goto return_base;
970return_reval:
971 /*
972 * We bypassed the ordinary revalidation routines.
973 * We may need to check the cached dentry for staleness.
974 */
975 if (nd->path.dentry && nd->path.dentry->d_sb &&
976 (nd->path.dentry->d_sb->s_type->fs_flags & FS_REVAL_DOT)) {
977 err = -ESTALE;
978 /* Note: we do not d_invalidate() */
979 if (!nd->path.dentry->d_op->d_revalidate(
980 nd->path.dentry, nd))
981 break;
982 }
983return_base:
984 return 0;
985out_dput:
986 path_put_conditional(&next, nd);
987 break;
988 }
989 path_put(&nd->path);
990return_err:
991 return err;
992}
993
994static int path_walk(const char *name, struct nameidata *nd)
995{
996 struct path save = nd->path;
997 int result;
998
999 current->total_link_count = 0;
1000
1001 /* make sure the stuff we saved doesn't go away */
1002 path_get(&save);
1003
1004 result = link_path_walk(name, nd);
1005 if (result == -ESTALE) {
1006 /* nd->path had been dropped */
1007 current->total_link_count = 0;
1008 nd->path = save;
1009 path_get(&nd->path);
1010 nd->flags |= LOOKUP_REVAL;
1011 result = link_path_walk(name, nd);
1012 }
1013
1014 path_put(&save);
1015
1016 return result;
1017}
1018
1019static int path_init(int dfd, const char *name, unsigned int flags, struct nameidata *nd)
1020{
1021 int retval = 0;
1022 int fput_needed;
1023 struct file *file;
1024
1025 nd->last_type = LAST_ROOT; /* if there are only slashes... */
1026 nd->flags = flags;
1027 nd->depth = 0;
1028 nd->root.mnt = NULL;
1029
1030 if (*name=='/') {
1031 set_root(nd);
1032 nd->path = nd->root;
1033 path_get(&nd->root);
1034 } else if (dfd == AT_FDCWD) {
1035 struct fs_struct *fs = current->fs;
1036 read_lock(&fs->lock);
1037 nd->path = fs->pwd;
1038 path_get(&fs->pwd);
1039 read_unlock(&fs->lock);
1040 } else {
1041 struct dentry *dentry;
1042
1043 file = fget_light(dfd, &fput_needed);
1044 retval = -EBADF;
1045 if (!file)
1046 goto out_fail;
1047
1048 dentry = file->f_path.dentry;
1049
1050 retval = -ENOTDIR;
1051 if (!S_ISDIR(dentry->d_inode->i_mode))
1052 goto fput_fail;
1053
1054 retval = file_permission(file, MAY_EXEC);
1055 if (retval)
1056 goto fput_fail;
1057
1058 nd->path = file->f_path;
1059 path_get(&file->f_path);
1060
1061 fput_light(file, fput_needed);
1062 }
1063 return 0;
1064
1065fput_fail:
1066 fput_light(file, fput_needed);
1067out_fail:
1068 return retval;
1069}
1070
1071/* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
1072static int do_path_lookup(int dfd, const char *name,
1073 unsigned int flags, struct nameidata *nd)
1074{
1075 int retval = path_init(dfd, name, flags, nd);
1076 if (!retval)
1077 retval = path_walk(name, nd);
1078 if (unlikely(!retval && !audit_dummy_context() && nd->path.dentry &&
1079 nd->path.dentry->d_inode))
1080 audit_inode(name, nd->path.dentry);
1081 if (nd->root.mnt) {
1082 path_put(&nd->root);
1083 nd->root.mnt = NULL;
1084 }
1085 return retval;
1086}
1087
1088int path_lookup(const char *name, unsigned int flags,
1089 struct nameidata *nd)
1090{
1091 return do_path_lookup(AT_FDCWD, name, flags, nd);
1092}
1093
1094int kern_path(const char *name, unsigned int flags, struct path *path)
1095{
1096 struct nameidata nd;
1097 int res = do_path_lookup(AT_FDCWD, name, flags, &nd);
1098 if (!res)
1099 *path = nd.path;
1100 return res;
1101}
1102
1103/**
1104 * vfs_path_lookup - lookup a file path relative to a dentry-vfsmount pair
1105 * @dentry: pointer to dentry of the base directory
1106 * @mnt: pointer to vfs mount of the base directory
1107 * @name: pointer to file name
1108 * @flags: lookup flags
1109 * @nd: pointer to nameidata
1110 */
1111int vfs_path_lookup(struct dentry *dentry, struct vfsmount *mnt,
1112 const char *name, unsigned int flags,
1113 struct nameidata *nd)
1114{
1115 int retval;
1116
1117 /* same as do_path_lookup */
1118 nd->last_type = LAST_ROOT;
1119 nd->flags = flags;
1120 nd->depth = 0;
1121
1122 nd->path.dentry = dentry;
1123 nd->path.mnt = mnt;
1124 path_get(&nd->path);
1125 nd->root = nd->path;
1126 path_get(&nd->root);
1127
1128 retval = path_walk(name, nd);
1129 if (unlikely(!retval && !audit_dummy_context() && nd->path.dentry &&
1130 nd->path.dentry->d_inode))
1131 audit_inode(name, nd->path.dentry);
1132
1133 path_put(&nd->root);
1134 nd->root.mnt = NULL;
1135
1136 return retval;
1137}
1138
1139static struct dentry *__lookup_hash(struct qstr *name,
1140 struct dentry *base, struct nameidata *nd)
1141{
1142 struct dentry *dentry;
1143 struct inode *inode;
1144 int err;
1145
1146 inode = base->d_inode;
1147
1148 /*
1149 * See if the low-level filesystem might want
1150 * to use its own hash..
1151 */
1152 if (base->d_op && base->d_op->d_hash) {
1153 err = base->d_op->d_hash(base, name);
1154 dentry = ERR_PTR(err);
1155 if (err < 0)
1156 goto out;
1157 }
1158
1159 dentry = __d_lookup(base, name);
1160
1161 /* lockess __d_lookup may fail due to concurrent d_move()
1162 * in some unrelated directory, so try with d_lookup
1163 */
1164 if (!dentry)
1165 dentry = d_lookup(base, name);
1166
1167 if (dentry && dentry->d_op && dentry->d_op->d_revalidate)
1168 dentry = do_revalidate(dentry, nd);
1169
1170 if (!dentry) {
1171 struct dentry *new;
1172
1173 /* Don't create child dentry for a dead directory. */
1174 dentry = ERR_PTR(-ENOENT);
1175 if (IS_DEADDIR(inode))
1176 goto out;
1177
1178 new = d_alloc(base, name);
1179 dentry = ERR_PTR(-ENOMEM);
1180 if (!new)
1181 goto out;
1182 dentry = inode->i_op->lookup(inode, new, nd);
1183 if (!dentry)
1184 dentry = new;
1185 else
1186 dput(new);
1187 }
1188out:
1189 return dentry;
1190}
1191
1192/*
1193 * Restricted form of lookup. Doesn't follow links, single-component only,
1194 * needs parent already locked. Doesn't follow mounts.
1195 * SMP-safe.
1196 */
1197static struct dentry *lookup_hash(struct nameidata *nd)
1198{
1199 int err;
1200
1201 err = exec_permission(nd->path.dentry->d_inode);
1202 if (err)
1203 return ERR_PTR(err);
1204 return __lookup_hash(&nd->last, nd->path.dentry, nd);
1205}
1206
1207static int __lookup_one_len(const char *name, struct qstr *this,
1208 struct dentry *base, int len)
1209{
1210 unsigned long hash;
1211 unsigned int c;
1212
1213 this->name = name;
1214 this->len = len;
1215 if (!len)
1216 return -EACCES;
1217
1218 hash = init_name_hash();
1219 while (len--) {
1220 c = *(const unsigned char *)name++;
1221 if (c == '/' || c == '\0')
1222 return -EACCES;
1223 hash = partial_name_hash(c, hash);
1224 }
1225 this->hash = end_name_hash(hash);
1226 return 0;
1227}
1228
1229/**
1230 * lookup_one_len - filesystem helper to lookup single pathname component
1231 * @name: pathname component to lookup
1232 * @base: base directory to lookup from
1233 * @len: maximum length @len should be interpreted to
1234 *
1235 * Note that this routine is purely a helper for filesystem usage and should
1236 * not be called by generic code. Also note that by using this function the
1237 * nameidata argument is passed to the filesystem methods and a filesystem
1238 * using this helper needs to be prepared for that.
1239 */
1240struct dentry *lookup_one_len(const char *name, struct dentry *base, int len)
1241{
1242 int err;
1243 struct qstr this;
1244
1245 WARN_ON_ONCE(!mutex_is_locked(&base->d_inode->i_mutex));
1246
1247 err = __lookup_one_len(name, &this, base, len);
1248 if (err)
1249 return ERR_PTR(err);
1250
1251 err = exec_permission(base->d_inode);
1252 if (err)
1253 return ERR_PTR(err);
1254 return __lookup_hash(&this, base, NULL);
1255}
1256
1257int user_path_at(int dfd, const char __user *name, unsigned flags,
1258 struct path *path)
1259{
1260 struct nameidata nd;
1261 char *tmp = getname(name);
1262 int err = PTR_ERR(tmp);
1263 if (!IS_ERR(tmp)) {
1264
1265 BUG_ON(flags & LOOKUP_PARENT);
1266
1267 err = do_path_lookup(dfd, tmp, flags, &nd);
1268 putname(tmp);
1269 if (!err)
1270 *path = nd.path;
1271 }
1272 return err;
1273}
1274
1275static int user_path_parent(int dfd, const char __user *path,
1276 struct nameidata *nd, char **name)
1277{
1278 char *s = getname(path);
1279 int error;
1280
1281 if (IS_ERR(s))
1282 return PTR_ERR(s);
1283
1284 error = do_path_lookup(dfd, s, LOOKUP_PARENT, nd);
1285 if (error)
1286 putname(s);
1287 else
1288 *name = s;
1289
1290 return error;
1291}
1292
1293/*
1294 * It's inline, so penalty for filesystems that don't use sticky bit is
1295 * minimal.
1296 */
1297static inline int check_sticky(struct inode *dir, struct inode *inode)
1298{
1299 uid_t fsuid = current_fsuid();
1300
1301 if (!(dir->i_mode & S_ISVTX))
1302 return 0;
1303 if (inode->i_uid == fsuid)
1304 return 0;
1305 if (dir->i_uid == fsuid)
1306 return 0;
1307 return !capable(CAP_FOWNER);
1308}
1309
1310/*
1311 * Check whether we can remove a link victim from directory dir, check
1312 * whether the type of victim is right.
1313 * 1. We can't do it if dir is read-only (done in permission())
1314 * 2. We should have write and exec permissions on dir
1315 * 3. We can't remove anything from append-only dir
1316 * 4. We can't do anything with immutable dir (done in permission())
1317 * 5. If the sticky bit on dir is set we should either
1318 * a. be owner of dir, or
1319 * b. be owner of victim, or
1320 * c. have CAP_FOWNER capability
1321 * 6. If the victim is append-only or immutable we can't do antyhing with
1322 * links pointing to it.
1323 * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR.
1324 * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR.
1325 * 9. We can't remove a root or mountpoint.
1326 * 10. We don't allow removal of NFS sillyrenamed files; it's handled by
1327 * nfs_async_unlink().
1328 */
1329static int may_delete(struct inode *dir,struct dentry *victim,int isdir)
1330{
1331 int error;
1332
1333 if (!victim->d_inode)
1334 return -ENOENT;
1335
1336 BUG_ON(victim->d_parent->d_inode != dir);
1337 audit_inode_child(victim, dir);
1338
1339 error = inode_permission(dir, MAY_WRITE | MAY_EXEC);
1340 if (error)
1341 return error;
1342 if (IS_APPEND(dir))
1343 return -EPERM;
1344 if (check_sticky(dir, victim->d_inode)||IS_APPEND(victim->d_inode)||
1345 IS_IMMUTABLE(victim->d_inode) || IS_SWAPFILE(victim->d_inode))
1346 return -EPERM;
1347 if (isdir) {
1348 if (!S_ISDIR(victim->d_inode->i_mode))
1349 return -ENOTDIR;
1350 if (IS_ROOT(victim))
1351 return -EBUSY;
1352 } else if (S_ISDIR(victim->d_inode->i_mode))
1353 return -EISDIR;
1354 if (IS_DEADDIR(dir))
1355 return -ENOENT;
1356 if (victim->d_flags & DCACHE_NFSFS_RENAMED)
1357 return -EBUSY;
1358 return 0;
1359}
1360
1361/* Check whether we can create an object with dentry child in directory
1362 * dir.
1363 * 1. We can't do it if child already exists (open has special treatment for
1364 * this case, but since we are inlined it's OK)
1365 * 2. We can't do it if dir is read-only (done in permission())
1366 * 3. We should have write and exec permissions on dir
1367 * 4. We can't do it if dir is immutable (done in permission())
1368 */
1369static inline int may_create(struct inode *dir, struct dentry *child)
1370{
1371 if (child->d_inode)
1372 return -EEXIST;
1373 if (IS_DEADDIR(dir))
1374 return -ENOENT;
1375 return inode_permission(dir, MAY_WRITE | MAY_EXEC);
1376}
1377
1378/*
1379 * O_DIRECTORY translates into forcing a directory lookup.
1380 */
1381static inline int lookup_flags(unsigned int f)
1382{
1383 unsigned long retval = LOOKUP_FOLLOW;
1384
1385 if (f & O_NOFOLLOW)
1386 retval &= ~LOOKUP_FOLLOW;
1387
1388 if (f & O_DIRECTORY)
1389 retval |= LOOKUP_DIRECTORY;
1390
1391 return retval;
1392}
1393
1394/*
1395 * p1 and p2 should be directories on the same fs.
1396 */
1397struct dentry *lock_rename(struct dentry *p1, struct dentry *p2)
1398{
1399 struct dentry *p;
1400
1401 if (p1 == p2) {
1402 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1403 return NULL;
1404 }
1405
1406 mutex_lock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1407
1408 p = d_ancestor(p2, p1);
1409 if (p) {
1410 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_PARENT);
1411 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_CHILD);
1412 return p;
1413 }
1414
1415 p = d_ancestor(p1, p2);
1416 if (p) {
1417 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1418 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1419 return p;
1420 }
1421
1422 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
1423 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
1424 return NULL;
1425}
1426
1427void unlock_rename(struct dentry *p1, struct dentry *p2)
1428{
1429 mutex_unlock(&p1->d_inode->i_mutex);
1430 if (p1 != p2) {
1431 mutex_unlock(&p2->d_inode->i_mutex);
1432 mutex_unlock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
1433 }
1434}
1435
1436int vfs_create(struct inode *dir, struct dentry *dentry, int mode,
1437 struct nameidata *nd)
1438{
1439 int error = may_create(dir, dentry);
1440
1441 if (error)
1442 return error;
1443
1444 if (!dir->i_op->create)
1445 return -EACCES; /* shouldn't it be ENOSYS? */
1446 mode &= S_IALLUGO;
1447 mode |= S_IFREG;
1448 error = security_inode_create(dir, dentry, mode);
1449 if (error)
1450 return error;
1451 vfs_dq_init(dir);
1452 error = dir->i_op->create(dir, dentry, mode, nd);
1453 if (!error)
1454 fsnotify_create(dir, dentry);
1455 return error;
1456}
1457
1458int may_open(struct path *path, int acc_mode, int flag)
1459{
1460 struct dentry *dentry = path->dentry;
1461 struct inode *inode = dentry->d_inode;
1462 int error;
1463
1464 if (!inode)
1465 return -ENOENT;
1466
1467 switch (inode->i_mode & S_IFMT) {
1468 case S_IFLNK:
1469 return -ELOOP;
1470 case S_IFDIR:
1471 if (acc_mode & MAY_WRITE)
1472 return -EISDIR;
1473 break;
1474 case S_IFBLK:
1475 case S_IFCHR:
1476 if (path->mnt->mnt_flags & MNT_NODEV)
1477 return -EACCES;
1478 /*FALLTHRU*/
1479 case S_IFIFO:
1480 case S_IFSOCK:
1481 flag &= ~O_TRUNC;
1482 break;
1483 }
1484
1485 error = inode_permission(inode, acc_mode);
1486 if (error)
1487 return error;
1488
1489 /*
1490 * An append-only file must be opened in append mode for writing.
1491 */
1492 if (IS_APPEND(inode)) {
1493 if ((flag & O_ACCMODE) != O_RDONLY && !(flag & O_APPEND))
1494 return -EPERM;
1495 if (flag & O_TRUNC)
1496 return -EPERM;
1497 }
1498
1499 /* O_NOATIME can only be set by the owner or superuser */
1500 if (flag & O_NOATIME && !is_owner_or_cap(inode))
1501 return -EPERM;
1502
1503 /*
1504 * Ensure there are no outstanding leases on the file.
1505 */
1506 return break_lease(inode, flag);
1507}
1508
1509static int handle_truncate(struct path *path)
1510{
1511 struct inode *inode = path->dentry->d_inode;
1512 int error = get_write_access(inode);
1513 if (error)
1514 return error;
1515 /*
1516 * Refuse to truncate files with mandatory locks held on them.
1517 */
1518 error = locks_verify_locked(inode);
1519 if (!error)
1520 error = security_path_truncate(path, 0,
1521 ATTR_MTIME|ATTR_CTIME|ATTR_OPEN);
1522 if (!error) {
1523 error = do_truncate(path->dentry, 0,
1524 ATTR_MTIME|ATTR_CTIME|ATTR_OPEN,
1525 NULL);
1526 }
1527 put_write_access(inode);
1528 return error;
1529}
1530
1531/*
1532 * Be careful about ever adding any more callers of this
1533 * function. Its flags must be in the namei format, not
1534 * what get passed to sys_open().
1535 */
1536static int __open_namei_create(struct nameidata *nd, struct path *path,
1537 int open_flag, int mode)
1538{
1539 int error;
1540 struct dentry *dir = nd->path.dentry;
1541
1542 if (!IS_POSIXACL(dir->d_inode))
1543 mode &= ~current_umask();
1544 error = security_path_mknod(&nd->path, path->dentry, mode, 0);
1545 if (error)
1546 goto out_unlock;
1547 error = vfs_create(dir->d_inode, path->dentry, mode, nd);
1548out_unlock:
1549 mutex_unlock(&dir->d_inode->i_mutex);
1550 dput(nd->path.dentry);
1551 nd->path.dentry = path->dentry;
1552 if (error)
1553 return error;
1554 /* Don't check for write permission, don't truncate */
1555 return may_open(&nd->path, 0, open_flag & ~O_TRUNC);
1556}
1557
1558/*
1559 * Note that while the flag value (low two bits) for sys_open means:
1560 * 00 - read-only
1561 * 01 - write-only
1562 * 10 - read-write
1563 * 11 - special
1564 * it is changed into
1565 * 00 - no permissions needed
1566 * 01 - read-permission
1567 * 10 - write-permission
1568 * 11 - read-write
1569 * for the internal routines (ie open_namei()/follow_link() etc)
1570 * This is more logical, and also allows the 00 "no perm needed"
1571 * to be used for symlinks (where the permissions are checked
1572 * later).
1573 *
1574*/
1575static inline int open_to_namei_flags(int flag)
1576{
1577 if ((flag+1) & O_ACCMODE)
1578 flag++;
1579 return flag;
1580}
1581
1582static int open_will_truncate(int flag, struct inode *inode)
1583{
1584 /*
1585 * We'll never write to the fs underlying
1586 * a device file.
1587 */
1588 if (special_file(inode->i_mode))
1589 return 0;
1590 return (flag & O_TRUNC);
1591}
1592
1593/*
1594 * Note that the low bits of the passed in "open_flag"
1595 * are not the same as in the local variable "flag". See
1596 * open_to_namei_flags() for more details.
1597 */
1598struct file *do_filp_open(int dfd, const char *pathname,
1599 int open_flag, int mode, int acc_mode)
1600{
1601 struct file *filp;
1602 struct nameidata nd;
1603 int error;
1604 struct path path;
1605 struct dentry *dir;
1606 int count = 0;
1607 int will_truncate;
1608 int flag = open_to_namei_flags(open_flag);
1609 int force_reval = 0;
1610
1611 /*
1612 * O_SYNC is implemented as __O_SYNC|O_DSYNC. As many places only
1613 * check for O_DSYNC if the need any syncing at all we enforce it's
1614 * always set instead of having to deal with possibly weird behaviour
1615 * for malicious applications setting only __O_SYNC.
1616 */
1617 if (open_flag & __O_SYNC)
1618 open_flag |= O_DSYNC;
1619
1620 if (!acc_mode)
1621 acc_mode = MAY_OPEN | ACC_MODE(open_flag);
1622
1623 /* O_TRUNC implies we need access checks for write permissions */
1624 if (flag & O_TRUNC)
1625 acc_mode |= MAY_WRITE;
1626
1627 /* Allow the LSM permission hook to distinguish append
1628 access from general write access. */
1629 if (flag & O_APPEND)
1630 acc_mode |= MAY_APPEND;
1631
1632 /*
1633 * The simplest case - just a plain lookup.
1634 */
1635 if (!(flag & O_CREAT)) {
1636 filp = get_empty_filp();
1637
1638 if (filp == NULL)
1639 return ERR_PTR(-ENFILE);
1640 nd.intent.open.file = filp;
1641 filp->f_flags = open_flag;
1642 nd.intent.open.flags = flag;
1643 nd.intent.open.create_mode = 0;
1644 error = do_path_lookup(dfd, pathname,
1645 lookup_flags(flag)|LOOKUP_OPEN, &nd);
1646 if (IS_ERR(nd.intent.open.file)) {
1647 if (error == 0) {
1648 error = PTR_ERR(nd.intent.open.file);
1649 path_put(&nd.path);
1650 }
1651 } else if (error)
1652 release_open_intent(&nd);
1653 if (error)
1654 return ERR_PTR(error);
1655 goto ok;
1656 }
1657
1658 /*
1659 * Create - we need to know the parent.
1660 */
1661reval:
1662 error = path_init(dfd, pathname, LOOKUP_PARENT, &nd);
1663 if (error)
1664 return ERR_PTR(error);
1665 if (force_reval)
1666 nd.flags |= LOOKUP_REVAL;
1667 error = path_walk(pathname, &nd);
1668 if (error) {
1669 if (nd.root.mnt)
1670 path_put(&nd.root);
1671 return ERR_PTR(error);
1672 }
1673 if (unlikely(!audit_dummy_context()))
1674 audit_inode(pathname, nd.path.dentry);
1675
1676 /*
1677 * We have the parent and last component. First of all, check
1678 * that we are not asked to creat(2) an obvious directory - that
1679 * will not do.
1680 */
1681 error = -EISDIR;
1682 if (nd.last_type != LAST_NORM || nd.last.name[nd.last.len])
1683 goto exit_parent;
1684
1685 error = -ENFILE;
1686 filp = get_empty_filp();
1687 if (filp == NULL)
1688 goto exit_parent;
1689 nd.intent.open.file = filp;
1690 filp->f_flags = open_flag;
1691 nd.intent.open.flags = flag;
1692 nd.intent.open.create_mode = mode;
1693 dir = nd.path.dentry;
1694 nd.flags &= ~LOOKUP_PARENT;
1695 nd.flags |= LOOKUP_CREATE | LOOKUP_OPEN;
1696 if (flag & O_EXCL)
1697 nd.flags |= LOOKUP_EXCL;
1698 mutex_lock(&dir->d_inode->i_mutex);
1699 path.dentry = lookup_hash(&nd);
1700 path.mnt = nd.path.mnt;
1701
1702do_last:
1703 error = PTR_ERR(path.dentry);
1704 if (IS_ERR(path.dentry)) {
1705 mutex_unlock(&dir->d_inode->i_mutex);
1706 goto exit;
1707 }
1708
1709 if (IS_ERR(nd.intent.open.file)) {
1710 error = PTR_ERR(nd.intent.open.file);
1711 goto exit_mutex_unlock;
1712 }
1713
1714 /* Negative dentry, just create the file */
1715 if (!path.dentry->d_inode) {
1716 /*
1717 * This write is needed to ensure that a
1718 * ro->rw transition does not occur between
1719 * the time when the file is created and when
1720 * a permanent write count is taken through
1721 * the 'struct file' in nameidata_to_filp().
1722 */
1723 error = mnt_want_write(nd.path.mnt);
1724 if (error)
1725 goto exit_mutex_unlock;
1726 error = __open_namei_create(&nd, &path, open_flag, mode);
1727 if (error) {
1728 mnt_drop_write(nd.path.mnt);
1729 goto exit;
1730 }
1731 filp = nameidata_to_filp(&nd);
1732 mnt_drop_write(nd.path.mnt);
1733 if (nd.root.mnt)
1734 path_put(&nd.root);
1735 if (!IS_ERR(filp)) {
1736 error = ima_file_check(filp, acc_mode);
1737 if (error) {
1738 fput(filp);
1739 filp = ERR_PTR(error);
1740 }
1741 }
1742 return filp;
1743 }
1744
1745 /*
1746 * It already exists.
1747 */
1748 mutex_unlock(&dir->d_inode->i_mutex);
1749 audit_inode(pathname, path.dentry);
1750
1751 error = -EEXIST;
1752 if (flag & O_EXCL)
1753 goto exit_dput;
1754
1755 if (__follow_mount(&path)) {
1756 error = -ELOOP;
1757 if (flag & O_NOFOLLOW)
1758 goto exit_dput;
1759 }
1760
1761 error = -ENOENT;
1762 if (!path.dentry->d_inode)
1763 goto exit_dput;
1764 if (path.dentry->d_inode->i_op->follow_link)
1765 goto do_link;
1766
1767 path_to_nameidata(&path, &nd);
1768 error = -EISDIR;
1769 if (S_ISDIR(path.dentry->d_inode->i_mode))
1770 goto exit;
1771ok:
1772 /*
1773 * Consider:
1774 * 1. may_open() truncates a file
1775 * 2. a rw->ro mount transition occurs
1776 * 3. nameidata_to_filp() fails due to
1777 * the ro mount.
1778 * That would be inconsistent, and should
1779 * be avoided. Taking this mnt write here
1780 * ensures that (2) can not occur.
1781 */
1782 will_truncate = open_will_truncate(flag, nd.path.dentry->d_inode);
1783 if (will_truncate) {
1784 error = mnt_want_write(nd.path.mnt);
1785 if (error)
1786 goto exit;
1787 }
1788 error = may_open(&nd.path, acc_mode, open_flag);
1789 if (error) {
1790 if (will_truncate)
1791 mnt_drop_write(nd.path.mnt);
1792 goto exit;
1793 }
1794 filp = nameidata_to_filp(&nd);
1795 if (!IS_ERR(filp)) {
1796 error = ima_file_check(filp, acc_mode);
1797 if (error) {
1798 fput(filp);
1799 filp = ERR_PTR(error);
1800 }
1801 }
1802 if (!IS_ERR(filp)) {
1803 if (acc_mode & MAY_WRITE)
1804 vfs_dq_init(nd.path.dentry->d_inode);
1805
1806 if (will_truncate) {
1807 error = handle_truncate(&nd.path);
1808 if (error) {
1809 fput(filp);
1810 filp = ERR_PTR(error);
1811 }
1812 }
1813 }
1814 /*
1815 * It is now safe to drop the mnt write
1816 * because the filp has had a write taken
1817 * on its behalf.
1818 */
1819 if (will_truncate)
1820 mnt_drop_write(nd.path.mnt);
1821 if (nd.root.mnt)
1822 path_put(&nd.root);
1823 return filp;
1824
1825exit_mutex_unlock:
1826 mutex_unlock(&dir->d_inode->i_mutex);
1827exit_dput:
1828 path_put_conditional(&path, &nd);
1829exit:
1830 if (!IS_ERR(nd.intent.open.file))
1831 release_open_intent(&nd);
1832exit_parent:
1833 if (nd.root.mnt)
1834 path_put(&nd.root);
1835 path_put(&nd.path);
1836 return ERR_PTR(error);
1837
1838do_link:
1839 error = -ELOOP;
1840 if (flag & O_NOFOLLOW)
1841 goto exit_dput;
1842 /*
1843 * This is subtle. Instead of calling do_follow_link() we do the
1844 * thing by hands. The reason is that this way we have zero link_count
1845 * and path_walk() (called from ->follow_link) honoring LOOKUP_PARENT.
1846 * After that we have the parent and last component, i.e.
1847 * we are in the same situation as after the first path_walk().
1848 * Well, almost - if the last component is normal we get its copy
1849 * stored in nd->last.name and we will have to putname() it when we
1850 * are done. Procfs-like symlinks just set LAST_BIND.
1851 */
1852 nd.flags |= LOOKUP_PARENT;
1853 error = security_inode_follow_link(path.dentry, &nd);
1854 if (error)
1855 goto exit_dput;
1856 error = __do_follow_link(&path, &nd);
1857 path_put(&path);
1858 if (error) {
1859 /* Does someone understand code flow here? Or it is only
1860 * me so stupid? Anathema to whoever designed this non-sense
1861 * with "intent.open".
1862 */
1863 release_open_intent(&nd);
1864 if (nd.root.mnt)
1865 path_put(&nd.root);
1866 if (error == -ESTALE && !force_reval) {
1867 force_reval = 1;
1868 goto reval;
1869 }
1870 return ERR_PTR(error);
1871 }
1872 nd.flags &= ~LOOKUP_PARENT;
1873 if (nd.last_type == LAST_BIND)
1874 goto ok;
1875 error = -EISDIR;
1876 if (nd.last_type != LAST_NORM)
1877 goto exit;
1878 if (nd.last.name[nd.last.len]) {
1879 __putname(nd.last.name);
1880 goto exit;
1881 }
1882 error = -ELOOP;
1883 if (count++==32) {
1884 __putname(nd.last.name);
1885 goto exit;
1886 }
1887 dir = nd.path.dentry;
1888 mutex_lock(&dir->d_inode->i_mutex);
1889 path.dentry = lookup_hash(&nd);
1890 path.mnt = nd.path.mnt;
1891 __putname(nd.last.name);
1892 goto do_last;
1893}
1894
1895/**
1896 * filp_open - open file and return file pointer
1897 *
1898 * @filename: path to open
1899 * @flags: open flags as per the open(2) second argument
1900 * @mode: mode for the new file if O_CREAT is set, else ignored
1901 *
1902 * This is the helper to open a file from kernelspace if you really
1903 * have to. But in generally you should not do this, so please move
1904 * along, nothing to see here..
1905 */
1906struct file *filp_open(const char *filename, int flags, int mode)
1907{
1908 return do_filp_open(AT_FDCWD, filename, flags, mode, 0);
1909}
1910EXPORT_SYMBOL(filp_open);
1911
1912/**
1913 * lookup_create - lookup a dentry, creating it if it doesn't exist
1914 * @nd: nameidata info
1915 * @is_dir: directory flag
1916 *
1917 * Simple function to lookup and return a dentry and create it
1918 * if it doesn't exist. Is SMP-safe.
1919 *
1920 * Returns with nd->path.dentry->d_inode->i_mutex locked.
1921 */
1922struct dentry *lookup_create(struct nameidata *nd, int is_dir)
1923{
1924 struct dentry *dentry = ERR_PTR(-EEXIST);
1925
1926 mutex_lock_nested(&nd->path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
1927 /*
1928 * Yucky last component or no last component at all?
1929 * (foo/., foo/.., /////)
1930 */
1931 if (nd->last_type != LAST_NORM)
1932 goto fail;
1933 nd->flags &= ~LOOKUP_PARENT;
1934 nd->flags |= LOOKUP_CREATE | LOOKUP_EXCL;
1935 nd->intent.open.flags = O_EXCL;
1936
1937 /*
1938 * Do the final lookup.
1939 */
1940 dentry = lookup_hash(nd);
1941 if (IS_ERR(dentry))
1942 goto fail;
1943
1944 if (dentry->d_inode)
1945 goto eexist;
1946 /*
1947 * Special case - lookup gave negative, but... we had foo/bar/
1948 * From the vfs_mknod() POV we just have a negative dentry -
1949 * all is fine. Let's be bastards - you had / on the end, you've
1950 * been asking for (non-existent) directory. -ENOENT for you.
1951 */
1952 if (unlikely(!is_dir && nd->last.name[nd->last.len])) {
1953 dput(dentry);
1954 dentry = ERR_PTR(-ENOENT);
1955 }
1956 return dentry;
1957eexist:
1958 dput(dentry);
1959 dentry = ERR_PTR(-EEXIST);
1960fail:
1961 return dentry;
1962}
1963EXPORT_SYMBOL_GPL(lookup_create);
1964
1965int vfs_mknod(struct inode *dir, struct dentry *dentry, int mode, dev_t dev)
1966{
1967 int error = may_create(dir, dentry);
1968
1969 if (error)
1970 return error;
1971
1972 if ((S_ISCHR(mode) || S_ISBLK(mode)) && !capable(CAP_MKNOD))
1973 return -EPERM;
1974
1975 if (!dir->i_op->mknod)
1976 return -EPERM;
1977
1978 error = devcgroup_inode_mknod(mode, dev);
1979 if (error)
1980 return error;
1981
1982 error = security_inode_mknod(dir, dentry, mode, dev);
1983 if (error)
1984 return error;
1985
1986 vfs_dq_init(dir);
1987 error = dir->i_op->mknod(dir, dentry, mode, dev);
1988 if (!error)
1989 fsnotify_create(dir, dentry);
1990 return error;
1991}
1992
1993static int may_mknod(mode_t mode)
1994{
1995 switch (mode & S_IFMT) {
1996 case S_IFREG:
1997 case S_IFCHR:
1998 case S_IFBLK:
1999 case S_IFIFO:
2000 case S_IFSOCK:
2001 case 0: /* zero mode translates to S_IFREG */
2002 return 0;
2003 case S_IFDIR:
2004 return -EPERM;
2005 default:
2006 return -EINVAL;
2007 }
2008}
2009
2010SYSCALL_DEFINE4(mknodat, int, dfd, const char __user *, filename, int, mode,
2011 unsigned, dev)
2012{
2013 int error;
2014 char *tmp;
2015 struct dentry *dentry;
2016 struct nameidata nd;
2017
2018 if (S_ISDIR(mode))
2019 return -EPERM;
2020
2021 error = user_path_parent(dfd, filename, &nd, &tmp);
2022 if (error)
2023 return error;
2024
2025 dentry = lookup_create(&nd, 0);
2026 if (IS_ERR(dentry)) {
2027 error = PTR_ERR(dentry);
2028 goto out_unlock;
2029 }
2030 if (!IS_POSIXACL(nd.path.dentry->d_inode))
2031 mode &= ~current_umask();
2032 error = may_mknod(mode);
2033 if (error)
2034 goto out_dput;
2035 error = mnt_want_write(nd.path.mnt);
2036 if (error)
2037 goto out_dput;
2038 error = security_path_mknod(&nd.path, dentry, mode, dev);
2039 if (error)
2040 goto out_drop_write;
2041 switch (mode & S_IFMT) {
2042 case 0: case S_IFREG:
2043 error = vfs_create(nd.path.dentry->d_inode,dentry,mode,&nd);
2044 break;
2045 case S_IFCHR: case S_IFBLK:
2046 error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode,
2047 new_decode_dev(dev));
2048 break;
2049 case S_IFIFO: case S_IFSOCK:
2050 error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode,0);
2051 break;
2052 }
2053out_drop_write:
2054 mnt_drop_write(nd.path.mnt);
2055out_dput:
2056 dput(dentry);
2057out_unlock:
2058 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2059 path_put(&nd.path);
2060 putname(tmp);
2061
2062 return error;
2063}
2064
2065SYSCALL_DEFINE3(mknod, const char __user *, filename, int, mode, unsigned, dev)
2066{
2067 return sys_mknodat(AT_FDCWD, filename, mode, dev);
2068}
2069
2070int vfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
2071{
2072 int error = may_create(dir, dentry);
2073
2074 if (error)
2075 return error;
2076
2077 if (!dir->i_op->mkdir)
2078 return -EPERM;
2079
2080 mode &= (S_IRWXUGO|S_ISVTX);
2081 error = security_inode_mkdir(dir, dentry, mode);
2082 if (error)
2083 return error;
2084
2085 vfs_dq_init(dir);
2086 error = dir->i_op->mkdir(dir, dentry, mode);
2087 if (!error)
2088 fsnotify_mkdir(dir, dentry);
2089 return error;
2090}
2091
2092SYSCALL_DEFINE3(mkdirat, int, dfd, const char __user *, pathname, int, mode)
2093{
2094 int error = 0;
2095 char * tmp;
2096 struct dentry *dentry;
2097 struct nameidata nd;
2098
2099 error = user_path_parent(dfd, pathname, &nd, &tmp);
2100 if (error)
2101 goto out_err;
2102
2103 dentry = lookup_create(&nd, 1);
2104 error = PTR_ERR(dentry);
2105 if (IS_ERR(dentry))
2106 goto out_unlock;
2107
2108 if (!IS_POSIXACL(nd.path.dentry->d_inode))
2109 mode &= ~current_umask();
2110 error = mnt_want_write(nd.path.mnt);
2111 if (error)
2112 goto out_dput;
2113 error = security_path_mkdir(&nd.path, dentry, mode);
2114 if (error)
2115 goto out_drop_write;
2116 error = vfs_mkdir(nd.path.dentry->d_inode, dentry, mode);
2117out_drop_write:
2118 mnt_drop_write(nd.path.mnt);
2119out_dput:
2120 dput(dentry);
2121out_unlock:
2122 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2123 path_put(&nd.path);
2124 putname(tmp);
2125out_err:
2126 return error;
2127}
2128
2129SYSCALL_DEFINE2(mkdir, const char __user *, pathname, int, mode)
2130{
2131 return sys_mkdirat(AT_FDCWD, pathname, mode);
2132}
2133
2134/*
2135 * We try to drop the dentry early: we should have
2136 * a usage count of 2 if we're the only user of this
2137 * dentry, and if that is true (possibly after pruning
2138 * the dcache), then we drop the dentry now.
2139 *
2140 * A low-level filesystem can, if it choses, legally
2141 * do a
2142 *
2143 * if (!d_unhashed(dentry))
2144 * return -EBUSY;
2145 *
2146 * if it cannot handle the case of removing a directory
2147 * that is still in use by something else..
2148 */
2149void dentry_unhash(struct dentry *dentry)
2150{
2151 dget(dentry);
2152 shrink_dcache_parent(dentry);
2153 spin_lock(&dcache_lock);
2154 spin_lock(&dentry->d_lock);
2155 if (atomic_read(&dentry->d_count) == 2)
2156 __d_drop(dentry);
2157 spin_unlock(&dentry->d_lock);
2158 spin_unlock(&dcache_lock);
2159}
2160
2161int vfs_rmdir(struct inode *dir, struct dentry *dentry)
2162{
2163 int error = may_delete(dir, dentry, 1);
2164
2165 if (error)
2166 return error;
2167
2168 if (!dir->i_op->rmdir)
2169 return -EPERM;
2170
2171 vfs_dq_init(dir);
2172
2173 mutex_lock(&dentry->d_inode->i_mutex);
2174 dentry_unhash(dentry);
2175 if (d_mountpoint(dentry))
2176 error = -EBUSY;
2177 else {
2178 error = security_inode_rmdir(dir, dentry);
2179 if (!error) {
2180 error = dir->i_op->rmdir(dir, dentry);
2181 if (!error)
2182 dentry->d_inode->i_flags |= S_DEAD;
2183 }
2184 }
2185 mutex_unlock(&dentry->d_inode->i_mutex);
2186 if (!error) {
2187 d_delete(dentry);
2188 }
2189 dput(dentry);
2190
2191 return error;
2192}
2193
2194static long do_rmdir(int dfd, const char __user *pathname)
2195{
2196 int error = 0;
2197 char * name;
2198 struct dentry *dentry;
2199 struct nameidata nd;
2200
2201 error = user_path_parent(dfd, pathname, &nd, &name);
2202 if (error)
2203 return error;
2204
2205 switch(nd.last_type) {
2206 case LAST_DOTDOT:
2207 error = -ENOTEMPTY;
2208 goto exit1;
2209 case LAST_DOT:
2210 error = -EINVAL;
2211 goto exit1;
2212 case LAST_ROOT:
2213 error = -EBUSY;
2214 goto exit1;
2215 }
2216
2217 nd.flags &= ~LOOKUP_PARENT;
2218
2219 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2220 dentry = lookup_hash(&nd);
2221 error = PTR_ERR(dentry);
2222 if (IS_ERR(dentry))
2223 goto exit2;
2224 error = mnt_want_write(nd.path.mnt);
2225 if (error)
2226 goto exit3;
2227 error = security_path_rmdir(&nd.path, dentry);
2228 if (error)
2229 goto exit4;
2230 error = vfs_rmdir(nd.path.dentry->d_inode, dentry);
2231exit4:
2232 mnt_drop_write(nd.path.mnt);
2233exit3:
2234 dput(dentry);
2235exit2:
2236 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2237exit1:
2238 path_put(&nd.path);
2239 putname(name);
2240 return error;
2241}
2242
2243SYSCALL_DEFINE1(rmdir, const char __user *, pathname)
2244{
2245 return do_rmdir(AT_FDCWD, pathname);
2246}
2247
2248int vfs_unlink(struct inode *dir, struct dentry *dentry)
2249{
2250 int error = may_delete(dir, dentry, 0);
2251
2252 if (error)
2253 return error;
2254
2255 if (!dir->i_op->unlink)
2256 return -EPERM;
2257
2258 vfs_dq_init(dir);
2259
2260 mutex_lock(&dentry->d_inode->i_mutex);
2261 if (d_mountpoint(dentry))
2262 error = -EBUSY;
2263 else {
2264 error = security_inode_unlink(dir, dentry);
2265 if (!error) {
2266 error = dir->i_op->unlink(dir, dentry);
2267 if (!error)
2268 dentry->d_inode->i_flags |= S_DEAD;
2269 }
2270 }
2271 mutex_unlock(&dentry->d_inode->i_mutex);
2272
2273 /* We don't d_delete() NFS sillyrenamed files--they still exist. */
2274 if (!error && !(dentry->d_flags & DCACHE_NFSFS_RENAMED)) {
2275 fsnotify_link_count(dentry->d_inode);
2276 d_delete(dentry);
2277 }
2278
2279 return error;
2280}
2281
2282/*
2283 * Make sure that the actual truncation of the file will occur outside its
2284 * directory's i_mutex. Truncate can take a long time if there is a lot of
2285 * writeout happening, and we don't want to prevent access to the directory
2286 * while waiting on the I/O.
2287 */
2288static long do_unlinkat(int dfd, const char __user *pathname)
2289{
2290 int error;
2291 char *name;
2292 struct dentry *dentry;
2293 struct nameidata nd;
2294 struct inode *inode = NULL;
2295
2296 error = user_path_parent(dfd, pathname, &nd, &name);
2297 if (error)
2298 return error;
2299
2300 error = -EISDIR;
2301 if (nd.last_type != LAST_NORM)
2302 goto exit1;
2303
2304 nd.flags &= ~LOOKUP_PARENT;
2305
2306 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2307 dentry = lookup_hash(&nd);
2308 error = PTR_ERR(dentry);
2309 if (!IS_ERR(dentry)) {
2310 /* Why not before? Because we want correct error value */
2311 if (nd.last.name[nd.last.len])
2312 goto slashes;
2313 inode = dentry->d_inode;
2314 if (inode)
2315 atomic_inc(&inode->i_count);
2316 error = mnt_want_write(nd.path.mnt);
2317 if (error)
2318 goto exit2;
2319 error = security_path_unlink(&nd.path, dentry);
2320 if (error)
2321 goto exit3;
2322 error = vfs_unlink(nd.path.dentry->d_inode, dentry);
2323exit3:
2324 mnt_drop_write(nd.path.mnt);
2325 exit2:
2326 dput(dentry);
2327 }
2328 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2329 if (inode)
2330 iput(inode); /* truncate the inode here */
2331exit1:
2332 path_put(&nd.path);
2333 putname(name);
2334 return error;
2335
2336slashes:
2337 error = !dentry->d_inode ? -ENOENT :
2338 S_ISDIR(dentry->d_inode->i_mode) ? -EISDIR : -ENOTDIR;
2339 goto exit2;
2340}
2341
2342SYSCALL_DEFINE3(unlinkat, int, dfd, const char __user *, pathname, int, flag)
2343{
2344 if ((flag & ~AT_REMOVEDIR) != 0)
2345 return -EINVAL;
2346
2347 if (flag & AT_REMOVEDIR)
2348 return do_rmdir(dfd, pathname);
2349
2350 return do_unlinkat(dfd, pathname);
2351}
2352
2353SYSCALL_DEFINE1(unlink, const char __user *, pathname)
2354{
2355 return do_unlinkat(AT_FDCWD, pathname);
2356}
2357
2358int vfs_symlink(struct inode *dir, struct dentry *dentry, const char *oldname)
2359{
2360 int error = may_create(dir, dentry);
2361
2362 if (error)
2363 return error;
2364
2365 if (!dir->i_op->symlink)
2366 return -EPERM;
2367
2368 error = security_inode_symlink(dir, dentry, oldname);
2369 if (error)
2370 return error;
2371
2372 vfs_dq_init(dir);
2373 error = dir->i_op->symlink(dir, dentry, oldname);
2374 if (!error)
2375 fsnotify_create(dir, dentry);
2376 return error;
2377}
2378
2379SYSCALL_DEFINE3(symlinkat, const char __user *, oldname,
2380 int, newdfd, const char __user *, newname)
2381{
2382 int error;
2383 char *from;
2384 char *to;
2385 struct dentry *dentry;
2386 struct nameidata nd;
2387
2388 from = getname(oldname);
2389 if (IS_ERR(from))
2390 return PTR_ERR(from);
2391
2392 error = user_path_parent(newdfd, newname, &nd, &to);
2393 if (error)
2394 goto out_putname;
2395
2396 dentry = lookup_create(&nd, 0);
2397 error = PTR_ERR(dentry);
2398 if (IS_ERR(dentry))
2399 goto out_unlock;
2400
2401 error = mnt_want_write(nd.path.mnt);
2402 if (error)
2403 goto out_dput;
2404 error = security_path_symlink(&nd.path, dentry, from);
2405 if (error)
2406 goto out_drop_write;
2407 error = vfs_symlink(nd.path.dentry->d_inode, dentry, from);
2408out_drop_write:
2409 mnt_drop_write(nd.path.mnt);
2410out_dput:
2411 dput(dentry);
2412out_unlock:
2413 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2414 path_put(&nd.path);
2415 putname(to);
2416out_putname:
2417 putname(from);
2418 return error;
2419}
2420
2421SYSCALL_DEFINE2(symlink, const char __user *, oldname, const char __user *, newname)
2422{
2423 return sys_symlinkat(oldname, AT_FDCWD, newname);
2424}
2425
2426int vfs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *new_dentry)
2427{
2428 struct inode *inode = old_dentry->d_inode;
2429 int error;
2430
2431 if (!inode)
2432 return -ENOENT;
2433
2434 error = may_create(dir, new_dentry);
2435 if (error)
2436 return error;
2437
2438 if (dir->i_sb != inode->i_sb)
2439 return -EXDEV;
2440
2441 /*
2442 * A link to an append-only or immutable file cannot be created.
2443 */
2444 if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
2445 return -EPERM;
2446 if (!dir->i_op->link)
2447 return -EPERM;
2448 if (S_ISDIR(inode->i_mode))
2449 return -EPERM;
2450
2451 error = security_inode_link(old_dentry, dir, new_dentry);
2452 if (error)
2453 return error;
2454
2455 mutex_lock(&inode->i_mutex);
2456 vfs_dq_init(dir);
2457 error = dir->i_op->link(old_dentry, dir, new_dentry);
2458 mutex_unlock(&inode->i_mutex);
2459 if (!error)
2460 fsnotify_link(dir, inode, new_dentry);
2461 return error;
2462}
2463
2464/*
2465 * Hardlinks are often used in delicate situations. We avoid
2466 * security-related surprises by not following symlinks on the
2467 * newname. --KAB
2468 *
2469 * We don't follow them on the oldname either to be compatible
2470 * with linux 2.0, and to avoid hard-linking to directories
2471 * and other special files. --ADM
2472 */
2473SYSCALL_DEFINE5(linkat, int, olddfd, const char __user *, oldname,
2474 int, newdfd, const char __user *, newname, int, flags)
2475{
2476 struct dentry *new_dentry;
2477 struct nameidata nd;
2478 struct path old_path;
2479 int error;
2480 char *to;
2481
2482 if ((flags & ~AT_SYMLINK_FOLLOW) != 0)
2483 return -EINVAL;
2484
2485 error = user_path_at(olddfd, oldname,
2486 flags & AT_SYMLINK_FOLLOW ? LOOKUP_FOLLOW : 0,
2487 &old_path);
2488 if (error)
2489 return error;
2490
2491 error = user_path_parent(newdfd, newname, &nd, &to);
2492 if (error)
2493 goto out;
2494 error = -EXDEV;
2495 if (old_path.mnt != nd.path.mnt)
2496 goto out_release;
2497 new_dentry = lookup_create(&nd, 0);
2498 error = PTR_ERR(new_dentry);
2499 if (IS_ERR(new_dentry))
2500 goto out_unlock;
2501 error = mnt_want_write(nd.path.mnt);
2502 if (error)
2503 goto out_dput;
2504 error = security_path_link(old_path.dentry, &nd.path, new_dentry);
2505 if (error)
2506 goto out_drop_write;
2507 error = vfs_link(old_path.dentry, nd.path.dentry->d_inode, new_dentry);
2508out_drop_write:
2509 mnt_drop_write(nd.path.mnt);
2510out_dput:
2511 dput(new_dentry);
2512out_unlock:
2513 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
2514out_release:
2515 path_put(&nd.path);
2516 putname(to);
2517out:
2518 path_put(&old_path);
2519
2520 return error;
2521}
2522
2523SYSCALL_DEFINE2(link, const char __user *, oldname, const char __user *, newname)
2524{
2525 return sys_linkat(AT_FDCWD, oldname, AT_FDCWD, newname, 0);
2526}
2527
2528/*
2529 * The worst of all namespace operations - renaming directory. "Perverted"
2530 * doesn't even start to describe it. Somebody in UCB had a heck of a trip...
2531 * Problems:
2532 * a) we can get into loop creation. Check is done in is_subdir().
2533 * b) race potential - two innocent renames can create a loop together.
2534 * That's where 4.4 screws up. Current fix: serialization on
2535 * sb->s_vfs_rename_mutex. We might be more accurate, but that's another
2536 * story.
2537 * c) we have to lock _three_ objects - parents and victim (if it exists).
2538 * And that - after we got ->i_mutex on parents (until then we don't know
2539 * whether the target exists). Solution: try to be smart with locking
2540 * order for inodes. We rely on the fact that tree topology may change
2541 * only under ->s_vfs_rename_mutex _and_ that parent of the object we
2542 * move will be locked. Thus we can rank directories by the tree
2543 * (ancestors first) and rank all non-directories after them.
2544 * That works since everybody except rename does "lock parent, lookup,
2545 * lock child" and rename is under ->s_vfs_rename_mutex.
2546 * HOWEVER, it relies on the assumption that any object with ->lookup()
2547 * has no more than 1 dentry. If "hybrid" objects will ever appear,
2548 * we'd better make sure that there's no link(2) for them.
2549 * d) some filesystems don't support opened-but-unlinked directories,
2550 * either because of layout or because they are not ready to deal with
2551 * all cases correctly. The latter will be fixed (taking this sort of
2552 * stuff into VFS), but the former is not going away. Solution: the same
2553 * trick as in rmdir().
2554 * e) conversion from fhandle to dentry may come in the wrong moment - when
2555 * we are removing the target. Solution: we will have to grab ->i_mutex
2556 * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on
2557 * ->i_mutex on parents, which works but leads to some truely excessive
2558 * locking].
2559 */
2560static int vfs_rename_dir(struct inode *old_dir, struct dentry *old_dentry,
2561 struct inode *new_dir, struct dentry *new_dentry)
2562{
2563 int error = 0;
2564 struct inode *target;
2565
2566 /*
2567 * If we are going to change the parent - check write permissions,
2568 * we'll need to flip '..'.
2569 */
2570 if (new_dir != old_dir) {
2571 error = inode_permission(old_dentry->d_inode, MAY_WRITE);
2572 if (error)
2573 return error;
2574 }
2575
2576 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2577 if (error)
2578 return error;
2579
2580 target = new_dentry->d_inode;
2581 if (target) {
2582 mutex_lock(&target->i_mutex);
2583 dentry_unhash(new_dentry);
2584 }
2585 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2586 error = -EBUSY;
2587 else
2588 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2589 if (target) {
2590 if (!error)
2591 target->i_flags |= S_DEAD;
2592 mutex_unlock(&target->i_mutex);
2593 if (d_unhashed(new_dentry))
2594 d_rehash(new_dentry);
2595 dput(new_dentry);
2596 }
2597 if (!error)
2598 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
2599 d_move(old_dentry,new_dentry);
2600 return error;
2601}
2602
2603static int vfs_rename_other(struct inode *old_dir, struct dentry *old_dentry,
2604 struct inode *new_dir, struct dentry *new_dentry)
2605{
2606 struct inode *target;
2607 int error;
2608
2609 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
2610 if (error)
2611 return error;
2612
2613 dget(new_dentry);
2614 target = new_dentry->d_inode;
2615 if (target)
2616 mutex_lock(&target->i_mutex);
2617 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
2618 error = -EBUSY;
2619 else
2620 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
2621 if (!error) {
2622 if (target)
2623 target->i_flags |= S_DEAD;
2624 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
2625 d_move(old_dentry, new_dentry);
2626 }
2627 if (target)
2628 mutex_unlock(&target->i_mutex);
2629 dput(new_dentry);
2630 return error;
2631}
2632
2633int vfs_rename(struct inode *old_dir, struct dentry *old_dentry,
2634 struct inode *new_dir, struct dentry *new_dentry)
2635{
2636 int error;
2637 int is_dir = S_ISDIR(old_dentry->d_inode->i_mode);
2638 const char *old_name;
2639
2640 if (old_dentry->d_inode == new_dentry->d_inode)
2641 return 0;
2642
2643 error = may_delete(old_dir, old_dentry, is_dir);
2644 if (error)
2645 return error;
2646
2647 if (!new_dentry->d_inode)
2648 error = may_create(new_dir, new_dentry);
2649 else
2650 error = may_delete(new_dir, new_dentry, is_dir);
2651 if (error)
2652 return error;
2653
2654 if (!old_dir->i_op->rename)
2655 return -EPERM;
2656
2657 vfs_dq_init(old_dir);
2658 vfs_dq_init(new_dir);
2659
2660 old_name = fsnotify_oldname_init(old_dentry->d_name.name);
2661
2662 if (is_dir)
2663 error = vfs_rename_dir(old_dir,old_dentry,new_dir,new_dentry);
2664 else
2665 error = vfs_rename_other(old_dir,old_dentry,new_dir,new_dentry);
2666 if (!error)
2667 fsnotify_move(old_dir, new_dir, old_name, is_dir,
2668 new_dentry->d_inode, old_dentry);
2669 fsnotify_oldname_free(old_name);
2670
2671 return error;
2672}
2673
2674SYSCALL_DEFINE4(renameat, int, olddfd, const char __user *, oldname,
2675 int, newdfd, const char __user *, newname)
2676{
2677 struct dentry *old_dir, *new_dir;
2678 struct dentry *old_dentry, *new_dentry;
2679 struct dentry *trap;
2680 struct nameidata oldnd, newnd;
2681 char *from;
2682 char *to;
2683 int error;
2684
2685 error = user_path_parent(olddfd, oldname, &oldnd, &from);
2686 if (error)
2687 goto exit;
2688
2689 error = user_path_parent(newdfd, newname, &newnd, &to);
2690 if (error)
2691 goto exit1;
2692
2693 error = -EXDEV;
2694 if (oldnd.path.mnt != newnd.path.mnt)
2695 goto exit2;
2696
2697 old_dir = oldnd.path.dentry;
2698 error = -EBUSY;
2699 if (oldnd.last_type != LAST_NORM)
2700 goto exit2;
2701
2702 new_dir = newnd.path.dentry;
2703 if (newnd.last_type != LAST_NORM)
2704 goto exit2;
2705
2706 oldnd.flags &= ~LOOKUP_PARENT;
2707 newnd.flags &= ~LOOKUP_PARENT;
2708 newnd.flags |= LOOKUP_RENAME_TARGET;
2709
2710 trap = lock_rename(new_dir, old_dir);
2711
2712 old_dentry = lookup_hash(&oldnd);
2713 error = PTR_ERR(old_dentry);
2714 if (IS_ERR(old_dentry))
2715 goto exit3;
2716 /* source must exist */
2717 error = -ENOENT;
2718 if (!old_dentry->d_inode)
2719 goto exit4;
2720 /* unless the source is a directory trailing slashes give -ENOTDIR */
2721 if (!S_ISDIR(old_dentry->d_inode->i_mode)) {
2722 error = -ENOTDIR;
2723 if (oldnd.last.name[oldnd.last.len])
2724 goto exit4;
2725 if (newnd.last.name[newnd.last.len])
2726 goto exit4;
2727 }
2728 /* source should not be ancestor of target */
2729 error = -EINVAL;
2730 if (old_dentry == trap)
2731 goto exit4;
2732 new_dentry = lookup_hash(&newnd);
2733 error = PTR_ERR(new_dentry);
2734 if (IS_ERR(new_dentry))
2735 goto exit4;
2736 /* target should not be an ancestor of source */
2737 error = -ENOTEMPTY;
2738 if (new_dentry == trap)
2739 goto exit5;
2740
2741 error = mnt_want_write(oldnd.path.mnt);
2742 if (error)
2743 goto exit5;
2744 error = security_path_rename(&oldnd.path, old_dentry,
2745 &newnd.path, new_dentry);
2746 if (error)
2747 goto exit6;
2748 error = vfs_rename(old_dir->d_inode, old_dentry,
2749 new_dir->d_inode, new_dentry);
2750exit6:
2751 mnt_drop_write(oldnd.path.mnt);
2752exit5:
2753 dput(new_dentry);
2754exit4:
2755 dput(old_dentry);
2756exit3:
2757 unlock_rename(new_dir, old_dir);
2758exit2:
2759 path_put(&newnd.path);
2760 putname(to);
2761exit1:
2762 path_put(&oldnd.path);
2763 putname(from);
2764exit:
2765 return error;
2766}
2767
2768SYSCALL_DEFINE2(rename, const char __user *, oldname, const char __user *, newname)
2769{
2770 return sys_renameat(AT_FDCWD, oldname, AT_FDCWD, newname);
2771}
2772
2773int vfs_readlink(struct dentry *dentry, char __user *buffer, int buflen, const char *link)
2774{
2775 int len;
2776
2777 len = PTR_ERR(link);
2778 if (IS_ERR(link))
2779 goto out;
2780
2781 len = strlen(link);
2782 if (len > (unsigned) buflen)
2783 len = buflen;
2784 if (copy_to_user(buffer, link, len))
2785 len = -EFAULT;
2786out:
2787 return len;
2788}
2789
2790/*
2791 * A helper for ->readlink(). This should be used *ONLY* for symlinks that
2792 * have ->follow_link() touching nd only in nd_set_link(). Using (or not
2793 * using) it for any given inode is up to filesystem.
2794 */
2795int generic_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2796{
2797 struct nameidata nd;
2798 void *cookie;
2799 int res;
2800
2801 nd.depth = 0;
2802 cookie = dentry->d_inode->i_op->follow_link(dentry, &nd);
2803 if (IS_ERR(cookie))
2804 return PTR_ERR(cookie);
2805
2806 res = vfs_readlink(dentry, buffer, buflen, nd_get_link(&nd));
2807 if (dentry->d_inode->i_op->put_link)
2808 dentry->d_inode->i_op->put_link(dentry, &nd, cookie);
2809 return res;
2810}
2811
2812int vfs_follow_link(struct nameidata *nd, const char *link)
2813{
2814 return __vfs_follow_link(nd, link);
2815}
2816
2817/* get the link contents into pagecache */
2818static char *page_getlink(struct dentry * dentry, struct page **ppage)
2819{
2820 char *kaddr;
2821 struct page *page;
2822 struct address_space *mapping = dentry->d_inode->i_mapping;
2823 page = read_mapping_page(mapping, 0, NULL);
2824 if (IS_ERR(page))
2825 return (char*)page;
2826 *ppage = page;
2827 kaddr = kmap(page);
2828 nd_terminate_link(kaddr, dentry->d_inode->i_size, PAGE_SIZE - 1);
2829 return kaddr;
2830}
2831
2832int page_readlink(struct dentry *dentry, char __user *buffer, int buflen)
2833{
2834 struct page *page = NULL;
2835 char *s = page_getlink(dentry, &page);
2836 int res = vfs_readlink(dentry,buffer,buflen,s);
2837 if (page) {
2838 kunmap(page);
2839 page_cache_release(page);
2840 }
2841 return res;
2842}
2843
2844void *page_follow_link_light(struct dentry *dentry, struct nameidata *nd)
2845{
2846 struct page *page = NULL;
2847 nd_set_link(nd, page_getlink(dentry, &page));
2848 return page;
2849}
2850
2851void page_put_link(struct dentry *dentry, struct nameidata *nd, void *cookie)
2852{
2853 struct page *page = cookie;
2854
2855 if (page) {
2856 kunmap(page);
2857 page_cache_release(page);
2858 }
2859}
2860
2861/*
2862 * The nofs argument instructs pagecache_write_begin to pass AOP_FLAG_NOFS
2863 */
2864int __page_symlink(struct inode *inode, const char *symname, int len, int nofs)
2865{
2866 struct address_space *mapping = inode->i_mapping;
2867 struct page *page;
2868 void *fsdata;
2869 int err;
2870 char *kaddr;
2871 unsigned int flags = AOP_FLAG_UNINTERRUPTIBLE;
2872 if (nofs)
2873 flags |= AOP_FLAG_NOFS;
2874
2875retry:
2876 err = pagecache_write_begin(NULL, mapping, 0, len-1,
2877 flags, &page, &fsdata);
2878 if (err)
2879 goto fail;
2880
2881 kaddr = kmap_atomic(page, KM_USER0);
2882 memcpy(kaddr, symname, len-1);
2883 kunmap_atomic(kaddr, KM_USER0);
2884
2885 err = pagecache_write_end(NULL, mapping, 0, len-1, len-1,
2886 page, fsdata);
2887 if (err < 0)
2888 goto fail;
2889 if (err < len-1)
2890 goto retry;
2891
2892 mark_inode_dirty(inode);
2893 return 0;
2894fail:
2895 return err;
2896}
2897
2898int page_symlink(struct inode *inode, const char *symname, int len)
2899{
2900 return __page_symlink(inode, symname, len,
2901 !(mapping_gfp_mask(inode->i_mapping) & __GFP_FS));
2902}
2903
2904const struct inode_operations page_symlink_inode_operations = {
2905 .readlink = generic_readlink,
2906 .follow_link = page_follow_link_light,
2907 .put_link = page_put_link,
2908};
2909
2910EXPORT_SYMBOL(user_path_at);
2911EXPORT_SYMBOL(follow_down);
2912EXPORT_SYMBOL(follow_up);
2913EXPORT_SYMBOL(get_write_access); /* binfmt_aout */
2914EXPORT_SYMBOL(getname);
2915EXPORT_SYMBOL(lock_rename);
2916EXPORT_SYMBOL(lookup_one_len);
2917EXPORT_SYMBOL(page_follow_link_light);
2918EXPORT_SYMBOL(page_put_link);
2919EXPORT_SYMBOL(page_readlink);
2920EXPORT_SYMBOL(__page_symlink);
2921EXPORT_SYMBOL(page_symlink);
2922EXPORT_SYMBOL(page_symlink_inode_operations);
2923EXPORT_SYMBOL(path_lookup);
2924EXPORT_SYMBOL(kern_path);
2925EXPORT_SYMBOL(vfs_path_lookup);
2926EXPORT_SYMBOL(inode_permission);
2927EXPORT_SYMBOL(file_permission);
2928EXPORT_SYMBOL(unlock_rename);
2929EXPORT_SYMBOL(vfs_create);
2930EXPORT_SYMBOL(vfs_follow_link);
2931EXPORT_SYMBOL(vfs_link);
2932EXPORT_SYMBOL(vfs_mkdir);
2933EXPORT_SYMBOL(vfs_mknod);
2934EXPORT_SYMBOL(generic_permission);
2935EXPORT_SYMBOL(vfs_readlink);
2936EXPORT_SYMBOL(vfs_rename);
2937EXPORT_SYMBOL(vfs_rmdir);
2938EXPORT_SYMBOL(vfs_symlink);
2939EXPORT_SYMBOL(vfs_unlink);
2940EXPORT_SYMBOL(dentry_unhash);
2941EXPORT_SYMBOL(generic_readlink);
This page took 0.032608 seconds and 5 git commands to generate.