audit: set the name_len in audit_inode for parent lookups
[deliverable/linux.git] / fs / namei.c
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/export.h>
19 #include <linux/kernel.h>
20 #include <linux/slab.h>
21 #include <linux/fs.h>
22 #include <linux/namei.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 <linux/posix_acl.h>
37 #include <asm/uaccess.h>
38
39 #include "internal.h"
40 #include "mount.h"
41
42 /* [Feb-1997 T. Schoebel-Theuer]
43 * Fundamental changes in the pathname lookup mechanisms (namei)
44 * were necessary because of omirr. The reason is that omirr needs
45 * to know the _real_ pathname, not the user-supplied one, in case
46 * of symlinks (and also when transname replacements occur).
47 *
48 * The new code replaces the old recursive symlink resolution with
49 * an iterative one (in case of non-nested symlink chains). It does
50 * this with calls to <fs>_follow_link().
51 * As a side effect, dir_namei(), _namei() and follow_link() are now
52 * replaced with a single function lookup_dentry() that can handle all
53 * the special cases of the former code.
54 *
55 * With the new dcache, the pathname is stored at each inode, at least as
56 * long as the refcount of the inode is positive. As a side effect, the
57 * size of the dcache depends on the inode cache and thus is dynamic.
58 *
59 * [29-Apr-1998 C. Scott Ananian] Updated above description of symlink
60 * resolution to correspond with current state of the code.
61 *
62 * Note that the symlink resolution is not *completely* iterative.
63 * There is still a significant amount of tail- and mid- recursion in
64 * the algorithm. Also, note that <fs>_readlink() is not used in
65 * lookup_dentry(): lookup_dentry() on the result of <fs>_readlink()
66 * may return different results than <fs>_follow_link(). Many virtual
67 * filesystems (including /proc) exhibit this behavior.
68 */
69
70 /* [24-Feb-97 T. Schoebel-Theuer] Side effects caused by new implementation:
71 * New symlink semantics: when open() is called with flags O_CREAT | O_EXCL
72 * and the name already exists in form of a symlink, try to create the new
73 * name indicated by the symlink. The old code always complained that the
74 * name already exists, due to not following the symlink even if its target
75 * is nonexistent. The new semantics affects also mknod() and link() when
76 * the name is a symlink pointing to a non-existent name.
77 *
78 * I don't know which semantics is the right one, since I have no access
79 * to standards. But I found by trial that HP-UX 9.0 has the full "new"
80 * semantics implemented, while SunOS 4.1.1 and Solaris (SunOS 5.4) have the
81 * "old" one. Personally, I think the new semantics is much more logical.
82 * Note that "ln old new" where "new" is a symlink pointing to a non-existing
83 * file does succeed in both HP-UX and SunOs, but not in Solaris
84 * and in the old Linux semantics.
85 */
86
87 /* [16-Dec-97 Kevin Buhr] For security reasons, we change some symlink
88 * semantics. See the comments in "open_namei" and "do_link" below.
89 *
90 * [10-Sep-98 Alan Modra] Another symlink change.
91 */
92
93 /* [Feb-Apr 2000 AV] Complete rewrite. Rules for symlinks:
94 * inside the path - always follow.
95 * in the last component in creation/removal/renaming - never follow.
96 * if LOOKUP_FOLLOW passed - follow.
97 * if the pathname has trailing slashes - follow.
98 * otherwise - don't follow.
99 * (applied in that order).
100 *
101 * [Jun 2000 AV] Inconsistent behaviour of open() in case if flags==O_CREAT
102 * restored for 2.4. This is the last surviving part of old 4.2BSD bug.
103 * During the 2.4 we need to fix the userland stuff depending on it -
104 * hopefully we will be able to get rid of that wart in 2.5. So far only
105 * XEmacs seems to be relying on it...
106 */
107 /*
108 * [Sep 2001 AV] Single-semaphore locking scheme (kudos to David Holland)
109 * implemented. Let's see if raised priority of ->s_vfs_rename_mutex gives
110 * any extra contention...
111 */
112
113 /* In order to reduce some races, while at the same time doing additional
114 * checking and hopefully speeding things up, we copy filenames to the
115 * kernel data space before using them..
116 *
117 * POSIX.1 2.4: an empty pathname is invalid (ENOENT).
118 * PATH_MAX includes the nul terminator --RR.
119 */
120 static char *getname_flags(const char __user *filename, int flags, int *empty)
121 {
122 char *result = __getname(), *err;
123 int len;
124
125 if (unlikely(!result))
126 return ERR_PTR(-ENOMEM);
127
128 len = strncpy_from_user(result, filename, PATH_MAX);
129 err = ERR_PTR(len);
130 if (unlikely(len < 0))
131 goto error;
132
133 /* The empty path is special. */
134 if (unlikely(!len)) {
135 if (empty)
136 *empty = 1;
137 err = ERR_PTR(-ENOENT);
138 if (!(flags & LOOKUP_EMPTY))
139 goto error;
140 }
141
142 err = ERR_PTR(-ENAMETOOLONG);
143 if (likely(len < PATH_MAX)) {
144 audit_getname(result);
145 return result;
146 }
147
148 error:
149 __putname(result);
150 return err;
151 }
152
153 char *getname(const char __user * filename)
154 {
155 return getname_flags(filename, 0, NULL);
156 }
157
158 #ifdef CONFIG_AUDITSYSCALL
159 void putname(const char *name)
160 {
161 if (unlikely(!audit_dummy_context()))
162 audit_putname(name);
163 else
164 __putname(name);
165 }
166 EXPORT_SYMBOL(putname);
167 #endif
168
169 static int check_acl(struct inode *inode, int mask)
170 {
171 #ifdef CONFIG_FS_POSIX_ACL
172 struct posix_acl *acl;
173
174 if (mask & MAY_NOT_BLOCK) {
175 acl = get_cached_acl_rcu(inode, ACL_TYPE_ACCESS);
176 if (!acl)
177 return -EAGAIN;
178 /* no ->get_acl() calls in RCU mode... */
179 if (acl == ACL_NOT_CACHED)
180 return -ECHILD;
181 return posix_acl_permission(inode, acl, mask & ~MAY_NOT_BLOCK);
182 }
183
184 acl = get_cached_acl(inode, ACL_TYPE_ACCESS);
185
186 /*
187 * A filesystem can force a ACL callback by just never filling the
188 * ACL cache. But normally you'd fill the cache either at inode
189 * instantiation time, or on the first ->get_acl call.
190 *
191 * If the filesystem doesn't have a get_acl() function at all, we'll
192 * just create the negative cache entry.
193 */
194 if (acl == ACL_NOT_CACHED) {
195 if (inode->i_op->get_acl) {
196 acl = inode->i_op->get_acl(inode, ACL_TYPE_ACCESS);
197 if (IS_ERR(acl))
198 return PTR_ERR(acl);
199 } else {
200 set_cached_acl(inode, ACL_TYPE_ACCESS, NULL);
201 return -EAGAIN;
202 }
203 }
204
205 if (acl) {
206 int error = posix_acl_permission(inode, acl, mask);
207 posix_acl_release(acl);
208 return error;
209 }
210 #endif
211
212 return -EAGAIN;
213 }
214
215 /*
216 * This does the basic permission checking
217 */
218 static int acl_permission_check(struct inode *inode, int mask)
219 {
220 unsigned int mode = inode->i_mode;
221
222 if (likely(uid_eq(current_fsuid(), inode->i_uid)))
223 mode >>= 6;
224 else {
225 if (IS_POSIXACL(inode) && (mode & S_IRWXG)) {
226 int error = check_acl(inode, mask);
227 if (error != -EAGAIN)
228 return error;
229 }
230
231 if (in_group_p(inode->i_gid))
232 mode >>= 3;
233 }
234
235 /*
236 * If the DACs are ok we don't need any capability check.
237 */
238 if ((mask & ~mode & (MAY_READ | MAY_WRITE | MAY_EXEC)) == 0)
239 return 0;
240 return -EACCES;
241 }
242
243 /**
244 * generic_permission - check for access rights on a Posix-like filesystem
245 * @inode: inode to check access rights for
246 * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC, ...)
247 *
248 * Used to check for read/write/execute permissions on a file.
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 *
253 * generic_permission is rcu-walk aware. It returns -ECHILD in case an rcu-walk
254 * request cannot be satisfied (eg. requires blocking or too much complexity).
255 * It would then be called again in ref-walk mode.
256 */
257 int generic_permission(struct inode *inode, int mask)
258 {
259 int ret;
260
261 /*
262 * Do the basic permission checks.
263 */
264 ret = acl_permission_check(inode, mask);
265 if (ret != -EACCES)
266 return ret;
267
268 if (S_ISDIR(inode->i_mode)) {
269 /* DACs are overridable for directories */
270 if (inode_capable(inode, CAP_DAC_OVERRIDE))
271 return 0;
272 if (!(mask & MAY_WRITE))
273 if (inode_capable(inode, CAP_DAC_READ_SEARCH))
274 return 0;
275 return -EACCES;
276 }
277 /*
278 * Read/write DACs are always overridable.
279 * Executable DACs are overridable when there is
280 * at least one exec bit set.
281 */
282 if (!(mask & MAY_EXEC) || (inode->i_mode & S_IXUGO))
283 if (inode_capable(inode, CAP_DAC_OVERRIDE))
284 return 0;
285
286 /*
287 * Searching includes executable on directories, else just read.
288 */
289 mask &= MAY_READ | MAY_WRITE | MAY_EXEC;
290 if (mask == MAY_READ)
291 if (inode_capable(inode, CAP_DAC_READ_SEARCH))
292 return 0;
293
294 return -EACCES;
295 }
296
297 /*
298 * We _really_ want to just do "generic_permission()" without
299 * even looking at the inode->i_op values. So we keep a cache
300 * flag in inode->i_opflags, that says "this has not special
301 * permission function, use the fast case".
302 */
303 static inline int do_inode_permission(struct inode *inode, int mask)
304 {
305 if (unlikely(!(inode->i_opflags & IOP_FASTPERM))) {
306 if (likely(inode->i_op->permission))
307 return inode->i_op->permission(inode, mask);
308
309 /* This gets set once for the inode lifetime */
310 spin_lock(&inode->i_lock);
311 inode->i_opflags |= IOP_FASTPERM;
312 spin_unlock(&inode->i_lock);
313 }
314 return generic_permission(inode, mask);
315 }
316
317 /**
318 * __inode_permission - Check for access rights to a given inode
319 * @inode: Inode to check permission on
320 * @mask: Right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
321 *
322 * Check for read/write/execute permissions on an inode.
323 *
324 * When checking for MAY_APPEND, MAY_WRITE must also be set in @mask.
325 *
326 * This does not check for a read-only file system. You probably want
327 * inode_permission().
328 */
329 int __inode_permission(struct inode *inode, int mask)
330 {
331 int retval;
332
333 if (unlikely(mask & MAY_WRITE)) {
334 /*
335 * Nobody gets write access to an immutable file.
336 */
337 if (IS_IMMUTABLE(inode))
338 return -EACCES;
339 }
340
341 retval = do_inode_permission(inode, mask);
342 if (retval)
343 return retval;
344
345 retval = devcgroup_inode_permission(inode, mask);
346 if (retval)
347 return retval;
348
349 return security_inode_permission(inode, mask);
350 }
351
352 /**
353 * sb_permission - Check superblock-level permissions
354 * @sb: Superblock of inode to check permission on
355 * @inode: Inode to check permission on
356 * @mask: Right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
357 *
358 * Separate out file-system wide checks from inode-specific permission checks.
359 */
360 static int sb_permission(struct super_block *sb, struct inode *inode, int mask)
361 {
362 if (unlikely(mask & MAY_WRITE)) {
363 umode_t mode = inode->i_mode;
364
365 /* Nobody gets write access to a read-only fs. */
366 if ((sb->s_flags & MS_RDONLY) &&
367 (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode)))
368 return -EROFS;
369 }
370 return 0;
371 }
372
373 /**
374 * inode_permission - Check for access rights to a given inode
375 * @inode: Inode to check permission on
376 * @mask: Right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
377 *
378 * Check for read/write/execute permissions on an inode. We use fs[ug]id for
379 * this, letting us set arbitrary permissions for filesystem access without
380 * changing the "normal" UIDs which are used for other things.
381 *
382 * When checking for MAY_APPEND, MAY_WRITE must also be set in @mask.
383 */
384 int inode_permission(struct inode *inode, int mask)
385 {
386 int retval;
387
388 retval = sb_permission(inode->i_sb, inode, mask);
389 if (retval)
390 return retval;
391 return __inode_permission(inode, mask);
392 }
393
394 /**
395 * path_get - get a reference to a path
396 * @path: path to get the reference to
397 *
398 * Given a path increment the reference count to the dentry and the vfsmount.
399 */
400 void path_get(struct path *path)
401 {
402 mntget(path->mnt);
403 dget(path->dentry);
404 }
405 EXPORT_SYMBOL(path_get);
406
407 /**
408 * path_put - put a reference to a path
409 * @path: path to put the reference to
410 *
411 * Given a path decrement the reference count to the dentry and the vfsmount.
412 */
413 void path_put(struct path *path)
414 {
415 dput(path->dentry);
416 mntput(path->mnt);
417 }
418 EXPORT_SYMBOL(path_put);
419
420 /*
421 * Path walking has 2 modes, rcu-walk and ref-walk (see
422 * Documentation/filesystems/path-lookup.txt). In situations when we can't
423 * continue in RCU mode, we attempt to drop out of rcu-walk mode and grab
424 * normal reference counts on dentries and vfsmounts to transition to rcu-walk
425 * mode. Refcounts are grabbed at the last known good point before rcu-walk
426 * got stuck, so ref-walk may continue from there. If this is not successful
427 * (eg. a seqcount has changed), then failure is returned and it's up to caller
428 * to restart the path walk from the beginning in ref-walk mode.
429 */
430
431 static inline void lock_rcu_walk(void)
432 {
433 br_read_lock(&vfsmount_lock);
434 rcu_read_lock();
435 }
436
437 static inline void unlock_rcu_walk(void)
438 {
439 rcu_read_unlock();
440 br_read_unlock(&vfsmount_lock);
441 }
442
443 /**
444 * unlazy_walk - try to switch to ref-walk mode.
445 * @nd: nameidata pathwalk data
446 * @dentry: child of nd->path.dentry or NULL
447 * Returns: 0 on success, -ECHILD on failure
448 *
449 * unlazy_walk attempts to legitimize the current nd->path, nd->root and dentry
450 * for ref-walk mode. @dentry must be a path found by a do_lookup call on
451 * @nd or NULL. Must be called from rcu-walk context.
452 */
453 static int unlazy_walk(struct nameidata *nd, struct dentry *dentry)
454 {
455 struct fs_struct *fs = current->fs;
456 struct dentry *parent = nd->path.dentry;
457 int want_root = 0;
458
459 BUG_ON(!(nd->flags & LOOKUP_RCU));
460 if (nd->root.mnt && !(nd->flags & LOOKUP_ROOT)) {
461 want_root = 1;
462 spin_lock(&fs->lock);
463 if (nd->root.mnt != fs->root.mnt ||
464 nd->root.dentry != fs->root.dentry)
465 goto err_root;
466 }
467 spin_lock(&parent->d_lock);
468 if (!dentry) {
469 if (!__d_rcu_to_refcount(parent, nd->seq))
470 goto err_parent;
471 BUG_ON(nd->inode != parent->d_inode);
472 } else {
473 if (dentry->d_parent != parent)
474 goto err_parent;
475 spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
476 if (!__d_rcu_to_refcount(dentry, nd->seq))
477 goto err_child;
478 /*
479 * If the sequence check on the child dentry passed, then
480 * the child has not been removed from its parent. This
481 * means the parent dentry must be valid and able to take
482 * a reference at this point.
483 */
484 BUG_ON(!IS_ROOT(dentry) && dentry->d_parent != parent);
485 BUG_ON(!parent->d_count);
486 parent->d_count++;
487 spin_unlock(&dentry->d_lock);
488 }
489 spin_unlock(&parent->d_lock);
490 if (want_root) {
491 path_get(&nd->root);
492 spin_unlock(&fs->lock);
493 }
494 mntget(nd->path.mnt);
495
496 unlock_rcu_walk();
497 nd->flags &= ~LOOKUP_RCU;
498 return 0;
499
500 err_child:
501 spin_unlock(&dentry->d_lock);
502 err_parent:
503 spin_unlock(&parent->d_lock);
504 err_root:
505 if (want_root)
506 spin_unlock(&fs->lock);
507 return -ECHILD;
508 }
509
510 static inline int d_revalidate(struct dentry *dentry, unsigned int flags)
511 {
512 return dentry->d_op->d_revalidate(dentry, flags);
513 }
514
515 /**
516 * complete_walk - successful completion of path walk
517 * @nd: pointer nameidata
518 *
519 * If we had been in RCU mode, drop out of it and legitimize nd->path.
520 * Revalidate the final result, unless we'd already done that during
521 * the path walk or the filesystem doesn't ask for it. Return 0 on
522 * success, -error on failure. In case of failure caller does not
523 * need to drop nd->path.
524 */
525 static int complete_walk(struct nameidata *nd)
526 {
527 struct dentry *dentry = nd->path.dentry;
528 int status;
529
530 if (nd->flags & LOOKUP_RCU) {
531 nd->flags &= ~LOOKUP_RCU;
532 if (!(nd->flags & LOOKUP_ROOT))
533 nd->root.mnt = NULL;
534 spin_lock(&dentry->d_lock);
535 if (unlikely(!__d_rcu_to_refcount(dentry, nd->seq))) {
536 spin_unlock(&dentry->d_lock);
537 unlock_rcu_walk();
538 return -ECHILD;
539 }
540 BUG_ON(nd->inode != dentry->d_inode);
541 spin_unlock(&dentry->d_lock);
542 mntget(nd->path.mnt);
543 unlock_rcu_walk();
544 }
545
546 if (likely(!(nd->flags & LOOKUP_JUMPED)))
547 return 0;
548
549 if (likely(!(dentry->d_flags & DCACHE_OP_REVALIDATE)))
550 return 0;
551
552 if (likely(!(dentry->d_sb->s_type->fs_flags & FS_REVAL_DOT)))
553 return 0;
554
555 /* Note: we do not d_invalidate() */
556 status = d_revalidate(dentry, nd->flags);
557 if (status > 0)
558 return 0;
559
560 if (!status)
561 status = -ESTALE;
562
563 path_put(&nd->path);
564 return status;
565 }
566
567 static __always_inline void set_root(struct nameidata *nd)
568 {
569 if (!nd->root.mnt)
570 get_fs_root(current->fs, &nd->root);
571 }
572
573 static int link_path_walk(const char *, struct nameidata *);
574
575 static __always_inline void set_root_rcu(struct nameidata *nd)
576 {
577 if (!nd->root.mnt) {
578 struct fs_struct *fs = current->fs;
579 unsigned seq;
580
581 do {
582 seq = read_seqcount_begin(&fs->seq);
583 nd->root = fs->root;
584 nd->seq = __read_seqcount_begin(&nd->root.dentry->d_seq);
585 } while (read_seqcount_retry(&fs->seq, seq));
586 }
587 }
588
589 static __always_inline int __vfs_follow_link(struct nameidata *nd, const char *link)
590 {
591 int ret;
592
593 if (IS_ERR(link))
594 goto fail;
595
596 if (*link == '/') {
597 set_root(nd);
598 path_put(&nd->path);
599 nd->path = nd->root;
600 path_get(&nd->root);
601 nd->flags |= LOOKUP_JUMPED;
602 }
603 nd->inode = nd->path.dentry->d_inode;
604
605 ret = link_path_walk(link, nd);
606 return ret;
607 fail:
608 path_put(&nd->path);
609 return PTR_ERR(link);
610 }
611
612 static void path_put_conditional(struct path *path, struct nameidata *nd)
613 {
614 dput(path->dentry);
615 if (path->mnt != nd->path.mnt)
616 mntput(path->mnt);
617 }
618
619 static inline void path_to_nameidata(const struct path *path,
620 struct nameidata *nd)
621 {
622 if (!(nd->flags & LOOKUP_RCU)) {
623 dput(nd->path.dentry);
624 if (nd->path.mnt != path->mnt)
625 mntput(nd->path.mnt);
626 }
627 nd->path.mnt = path->mnt;
628 nd->path.dentry = path->dentry;
629 }
630
631 /*
632 * Helper to directly jump to a known parsed path from ->follow_link,
633 * caller must have taken a reference to path beforehand.
634 */
635 void nd_jump_link(struct nameidata *nd, struct path *path)
636 {
637 path_put(&nd->path);
638
639 nd->path = *path;
640 nd->inode = nd->path.dentry->d_inode;
641 nd->flags |= LOOKUP_JUMPED;
642
643 BUG_ON(nd->inode->i_op->follow_link);
644 }
645
646 static inline void put_link(struct nameidata *nd, struct path *link, void *cookie)
647 {
648 struct inode *inode = link->dentry->d_inode;
649 if (inode->i_op->put_link)
650 inode->i_op->put_link(link->dentry, nd, cookie);
651 path_put(link);
652 }
653
654 int sysctl_protected_symlinks __read_mostly = 1;
655 int sysctl_protected_hardlinks __read_mostly = 1;
656
657 /**
658 * may_follow_link - Check symlink following for unsafe situations
659 * @link: The path of the symlink
660 * @nd: nameidata pathwalk data
661 *
662 * In the case of the sysctl_protected_symlinks sysctl being enabled,
663 * CAP_DAC_OVERRIDE needs to be specifically ignored if the symlink is
664 * in a sticky world-writable directory. This is to protect privileged
665 * processes from failing races against path names that may change out
666 * from under them by way of other users creating malicious symlinks.
667 * It will permit symlinks to be followed only when outside a sticky
668 * world-writable directory, or when the uid of the symlink and follower
669 * match, or when the directory owner matches the symlink's owner.
670 *
671 * Returns 0 if following the symlink is allowed, -ve on error.
672 */
673 static inline int may_follow_link(struct path *link, struct nameidata *nd)
674 {
675 const struct inode *inode;
676 const struct inode *parent;
677
678 if (!sysctl_protected_symlinks)
679 return 0;
680
681 /* Allowed if owner and follower match. */
682 inode = link->dentry->d_inode;
683 if (uid_eq(current_cred()->fsuid, inode->i_uid))
684 return 0;
685
686 /* Allowed if parent directory not sticky and world-writable. */
687 parent = nd->path.dentry->d_inode;
688 if ((parent->i_mode & (S_ISVTX|S_IWOTH)) != (S_ISVTX|S_IWOTH))
689 return 0;
690
691 /* Allowed if parent directory and link owner match. */
692 if (uid_eq(parent->i_uid, inode->i_uid))
693 return 0;
694
695 audit_log_link_denied("follow_link", link);
696 path_put_conditional(link, nd);
697 path_put(&nd->path);
698 return -EACCES;
699 }
700
701 /**
702 * safe_hardlink_source - Check for safe hardlink conditions
703 * @inode: the source inode to hardlink from
704 *
705 * Return false if at least one of the following conditions:
706 * - inode is not a regular file
707 * - inode is setuid
708 * - inode is setgid and group-exec
709 * - access failure for read and write
710 *
711 * Otherwise returns true.
712 */
713 static bool safe_hardlink_source(struct inode *inode)
714 {
715 umode_t mode = inode->i_mode;
716
717 /* Special files should not get pinned to the filesystem. */
718 if (!S_ISREG(mode))
719 return false;
720
721 /* Setuid files should not get pinned to the filesystem. */
722 if (mode & S_ISUID)
723 return false;
724
725 /* Executable setgid files should not get pinned to the filesystem. */
726 if ((mode & (S_ISGID | S_IXGRP)) == (S_ISGID | S_IXGRP))
727 return false;
728
729 /* Hardlinking to unreadable or unwritable sources is dangerous. */
730 if (inode_permission(inode, MAY_READ | MAY_WRITE))
731 return false;
732
733 return true;
734 }
735
736 /**
737 * may_linkat - Check permissions for creating a hardlink
738 * @link: the source to hardlink from
739 *
740 * Block hardlink when all of:
741 * - sysctl_protected_hardlinks enabled
742 * - fsuid does not match inode
743 * - hardlink source is unsafe (see safe_hardlink_source() above)
744 * - not CAP_FOWNER
745 *
746 * Returns 0 if successful, -ve on error.
747 */
748 static int may_linkat(struct path *link)
749 {
750 const struct cred *cred;
751 struct inode *inode;
752
753 if (!sysctl_protected_hardlinks)
754 return 0;
755
756 cred = current_cred();
757 inode = link->dentry->d_inode;
758
759 /* Source inode owner (or CAP_FOWNER) can hardlink all they like,
760 * otherwise, it must be a safe source.
761 */
762 if (uid_eq(cred->fsuid, inode->i_uid) || safe_hardlink_source(inode) ||
763 capable(CAP_FOWNER))
764 return 0;
765
766 audit_log_link_denied("linkat", link);
767 return -EPERM;
768 }
769
770 static __always_inline int
771 follow_link(struct path *link, struct nameidata *nd, void **p)
772 {
773 struct dentry *dentry = link->dentry;
774 int error;
775 char *s;
776
777 BUG_ON(nd->flags & LOOKUP_RCU);
778
779 if (link->mnt == nd->path.mnt)
780 mntget(link->mnt);
781
782 error = -ELOOP;
783 if (unlikely(current->total_link_count >= 40))
784 goto out_put_nd_path;
785
786 cond_resched();
787 current->total_link_count++;
788
789 touch_atime(link);
790 nd_set_link(nd, NULL);
791
792 error = security_inode_follow_link(link->dentry, nd);
793 if (error)
794 goto out_put_nd_path;
795
796 nd->last_type = LAST_BIND;
797 *p = dentry->d_inode->i_op->follow_link(dentry, nd);
798 error = PTR_ERR(*p);
799 if (IS_ERR(*p))
800 goto out_put_nd_path;
801
802 error = 0;
803 s = nd_get_link(nd);
804 if (s) {
805 error = __vfs_follow_link(nd, s);
806 if (unlikely(error))
807 put_link(nd, link, *p);
808 }
809
810 return error;
811
812 out_put_nd_path:
813 *p = NULL;
814 path_put(&nd->path);
815 path_put(link);
816 return error;
817 }
818
819 static int follow_up_rcu(struct path *path)
820 {
821 struct mount *mnt = real_mount(path->mnt);
822 struct mount *parent;
823 struct dentry *mountpoint;
824
825 parent = mnt->mnt_parent;
826 if (&parent->mnt == path->mnt)
827 return 0;
828 mountpoint = mnt->mnt_mountpoint;
829 path->dentry = mountpoint;
830 path->mnt = &parent->mnt;
831 return 1;
832 }
833
834 /*
835 * follow_up - Find the mountpoint of path's vfsmount
836 *
837 * Given a path, find the mountpoint of its source file system.
838 * Replace @path with the path of the mountpoint in the parent mount.
839 * Up is towards /.
840 *
841 * Return 1 if we went up a level and 0 if we were already at the
842 * root.
843 */
844 int follow_up(struct path *path)
845 {
846 struct mount *mnt = real_mount(path->mnt);
847 struct mount *parent;
848 struct dentry *mountpoint;
849
850 br_read_lock(&vfsmount_lock);
851 parent = mnt->mnt_parent;
852 if (parent == mnt) {
853 br_read_unlock(&vfsmount_lock);
854 return 0;
855 }
856 mntget(&parent->mnt);
857 mountpoint = dget(mnt->mnt_mountpoint);
858 br_read_unlock(&vfsmount_lock);
859 dput(path->dentry);
860 path->dentry = mountpoint;
861 mntput(path->mnt);
862 path->mnt = &parent->mnt;
863 return 1;
864 }
865
866 /*
867 * Perform an automount
868 * - return -EISDIR to tell follow_managed() to stop and return the path we
869 * were called with.
870 */
871 static int follow_automount(struct path *path, unsigned flags,
872 bool *need_mntput)
873 {
874 struct vfsmount *mnt;
875 int err;
876
877 if (!path->dentry->d_op || !path->dentry->d_op->d_automount)
878 return -EREMOTE;
879
880 /* We don't want to mount if someone's just doing a stat -
881 * unless they're stat'ing a directory and appended a '/' to
882 * the name.
883 *
884 * We do, however, want to mount if someone wants to open or
885 * create a file of any type under the mountpoint, wants to
886 * traverse through the mountpoint or wants to open the
887 * mounted directory. Also, autofs may mark negative dentries
888 * as being automount points. These will need the attentions
889 * of the daemon to instantiate them before they can be used.
890 */
891 if (!(flags & (LOOKUP_PARENT | LOOKUP_DIRECTORY |
892 LOOKUP_OPEN | LOOKUP_CREATE | LOOKUP_AUTOMOUNT)) &&
893 path->dentry->d_inode)
894 return -EISDIR;
895
896 current->total_link_count++;
897 if (current->total_link_count >= 40)
898 return -ELOOP;
899
900 mnt = path->dentry->d_op->d_automount(path);
901 if (IS_ERR(mnt)) {
902 /*
903 * The filesystem is allowed to return -EISDIR here to indicate
904 * it doesn't want to automount. For instance, autofs would do
905 * this so that its userspace daemon can mount on this dentry.
906 *
907 * However, we can only permit this if it's a terminal point in
908 * the path being looked up; if it wasn't then the remainder of
909 * the path is inaccessible and we should say so.
910 */
911 if (PTR_ERR(mnt) == -EISDIR && (flags & LOOKUP_PARENT))
912 return -EREMOTE;
913 return PTR_ERR(mnt);
914 }
915
916 if (!mnt) /* mount collision */
917 return 0;
918
919 if (!*need_mntput) {
920 /* lock_mount() may release path->mnt on error */
921 mntget(path->mnt);
922 *need_mntput = true;
923 }
924 err = finish_automount(mnt, path);
925
926 switch (err) {
927 case -EBUSY:
928 /* Someone else made a mount here whilst we were busy */
929 return 0;
930 case 0:
931 path_put(path);
932 path->mnt = mnt;
933 path->dentry = dget(mnt->mnt_root);
934 return 0;
935 default:
936 return err;
937 }
938
939 }
940
941 /*
942 * Handle a dentry that is managed in some way.
943 * - Flagged for transit management (autofs)
944 * - Flagged as mountpoint
945 * - Flagged as automount point
946 *
947 * This may only be called in refwalk mode.
948 *
949 * Serialization is taken care of in namespace.c
950 */
951 static int follow_managed(struct path *path, unsigned flags)
952 {
953 struct vfsmount *mnt = path->mnt; /* held by caller, must be left alone */
954 unsigned managed;
955 bool need_mntput = false;
956 int ret = 0;
957
958 /* Given that we're not holding a lock here, we retain the value in a
959 * local variable for each dentry as we look at it so that we don't see
960 * the components of that value change under us */
961 while (managed = ACCESS_ONCE(path->dentry->d_flags),
962 managed &= DCACHE_MANAGED_DENTRY,
963 unlikely(managed != 0)) {
964 /* Allow the filesystem to manage the transit without i_mutex
965 * being held. */
966 if (managed & DCACHE_MANAGE_TRANSIT) {
967 BUG_ON(!path->dentry->d_op);
968 BUG_ON(!path->dentry->d_op->d_manage);
969 ret = path->dentry->d_op->d_manage(path->dentry, false);
970 if (ret < 0)
971 break;
972 }
973
974 /* Transit to a mounted filesystem. */
975 if (managed & DCACHE_MOUNTED) {
976 struct vfsmount *mounted = lookup_mnt(path);
977 if (mounted) {
978 dput(path->dentry);
979 if (need_mntput)
980 mntput(path->mnt);
981 path->mnt = mounted;
982 path->dentry = dget(mounted->mnt_root);
983 need_mntput = true;
984 continue;
985 }
986
987 /* Something is mounted on this dentry in another
988 * namespace and/or whatever was mounted there in this
989 * namespace got unmounted before we managed to get the
990 * vfsmount_lock */
991 }
992
993 /* Handle an automount point */
994 if (managed & DCACHE_NEED_AUTOMOUNT) {
995 ret = follow_automount(path, flags, &need_mntput);
996 if (ret < 0)
997 break;
998 continue;
999 }
1000
1001 /* We didn't change the current path point */
1002 break;
1003 }
1004
1005 if (need_mntput && path->mnt == mnt)
1006 mntput(path->mnt);
1007 if (ret == -EISDIR)
1008 ret = 0;
1009 return ret < 0 ? ret : need_mntput;
1010 }
1011
1012 int follow_down_one(struct path *path)
1013 {
1014 struct vfsmount *mounted;
1015
1016 mounted = lookup_mnt(path);
1017 if (mounted) {
1018 dput(path->dentry);
1019 mntput(path->mnt);
1020 path->mnt = mounted;
1021 path->dentry = dget(mounted->mnt_root);
1022 return 1;
1023 }
1024 return 0;
1025 }
1026
1027 static inline bool managed_dentry_might_block(struct dentry *dentry)
1028 {
1029 return (dentry->d_flags & DCACHE_MANAGE_TRANSIT &&
1030 dentry->d_op->d_manage(dentry, true) < 0);
1031 }
1032
1033 /*
1034 * Try to skip to top of mountpoint pile in rcuwalk mode. Fail if
1035 * we meet a managed dentry that would need blocking.
1036 */
1037 static bool __follow_mount_rcu(struct nameidata *nd, struct path *path,
1038 struct inode **inode)
1039 {
1040 for (;;) {
1041 struct mount *mounted;
1042 /*
1043 * Don't forget we might have a non-mountpoint managed dentry
1044 * that wants to block transit.
1045 */
1046 if (unlikely(managed_dentry_might_block(path->dentry)))
1047 return false;
1048
1049 if (!d_mountpoint(path->dentry))
1050 break;
1051
1052 mounted = __lookup_mnt(path->mnt, path->dentry, 1);
1053 if (!mounted)
1054 break;
1055 path->mnt = &mounted->mnt;
1056 path->dentry = mounted->mnt.mnt_root;
1057 nd->flags |= LOOKUP_JUMPED;
1058 nd->seq = read_seqcount_begin(&path->dentry->d_seq);
1059 /*
1060 * Update the inode too. We don't need to re-check the
1061 * dentry sequence number here after this d_inode read,
1062 * because a mount-point is always pinned.
1063 */
1064 *inode = path->dentry->d_inode;
1065 }
1066 return true;
1067 }
1068
1069 static void follow_mount_rcu(struct nameidata *nd)
1070 {
1071 while (d_mountpoint(nd->path.dentry)) {
1072 struct mount *mounted;
1073 mounted = __lookup_mnt(nd->path.mnt, nd->path.dentry, 1);
1074 if (!mounted)
1075 break;
1076 nd->path.mnt = &mounted->mnt;
1077 nd->path.dentry = mounted->mnt.mnt_root;
1078 nd->seq = read_seqcount_begin(&nd->path.dentry->d_seq);
1079 }
1080 }
1081
1082 static int follow_dotdot_rcu(struct nameidata *nd)
1083 {
1084 set_root_rcu(nd);
1085
1086 while (1) {
1087 if (nd->path.dentry == nd->root.dentry &&
1088 nd->path.mnt == nd->root.mnt) {
1089 break;
1090 }
1091 if (nd->path.dentry != nd->path.mnt->mnt_root) {
1092 struct dentry *old = nd->path.dentry;
1093 struct dentry *parent = old->d_parent;
1094 unsigned seq;
1095
1096 seq = read_seqcount_begin(&parent->d_seq);
1097 if (read_seqcount_retry(&old->d_seq, nd->seq))
1098 goto failed;
1099 nd->path.dentry = parent;
1100 nd->seq = seq;
1101 break;
1102 }
1103 if (!follow_up_rcu(&nd->path))
1104 break;
1105 nd->seq = read_seqcount_begin(&nd->path.dentry->d_seq);
1106 }
1107 follow_mount_rcu(nd);
1108 nd->inode = nd->path.dentry->d_inode;
1109 return 0;
1110
1111 failed:
1112 nd->flags &= ~LOOKUP_RCU;
1113 if (!(nd->flags & LOOKUP_ROOT))
1114 nd->root.mnt = NULL;
1115 unlock_rcu_walk();
1116 return -ECHILD;
1117 }
1118
1119 /*
1120 * Follow down to the covering mount currently visible to userspace. At each
1121 * point, the filesystem owning that dentry may be queried as to whether the
1122 * caller is permitted to proceed or not.
1123 */
1124 int follow_down(struct path *path)
1125 {
1126 unsigned managed;
1127 int ret;
1128
1129 while (managed = ACCESS_ONCE(path->dentry->d_flags),
1130 unlikely(managed & DCACHE_MANAGED_DENTRY)) {
1131 /* Allow the filesystem to manage the transit without i_mutex
1132 * being held.
1133 *
1134 * We indicate to the filesystem if someone is trying to mount
1135 * something here. This gives autofs the chance to deny anyone
1136 * other than its daemon the right to mount on its
1137 * superstructure.
1138 *
1139 * The filesystem may sleep at this point.
1140 */
1141 if (managed & DCACHE_MANAGE_TRANSIT) {
1142 BUG_ON(!path->dentry->d_op);
1143 BUG_ON(!path->dentry->d_op->d_manage);
1144 ret = path->dentry->d_op->d_manage(
1145 path->dentry, false);
1146 if (ret < 0)
1147 return ret == -EISDIR ? 0 : ret;
1148 }
1149
1150 /* Transit to a mounted filesystem. */
1151 if (managed & DCACHE_MOUNTED) {
1152 struct vfsmount *mounted = lookup_mnt(path);
1153 if (!mounted)
1154 break;
1155 dput(path->dentry);
1156 mntput(path->mnt);
1157 path->mnt = mounted;
1158 path->dentry = dget(mounted->mnt_root);
1159 continue;
1160 }
1161
1162 /* Don't handle automount points here */
1163 break;
1164 }
1165 return 0;
1166 }
1167
1168 /*
1169 * Skip to top of mountpoint pile in refwalk mode for follow_dotdot()
1170 */
1171 static void follow_mount(struct path *path)
1172 {
1173 while (d_mountpoint(path->dentry)) {
1174 struct vfsmount *mounted = lookup_mnt(path);
1175 if (!mounted)
1176 break;
1177 dput(path->dentry);
1178 mntput(path->mnt);
1179 path->mnt = mounted;
1180 path->dentry = dget(mounted->mnt_root);
1181 }
1182 }
1183
1184 static void follow_dotdot(struct nameidata *nd)
1185 {
1186 set_root(nd);
1187
1188 while(1) {
1189 struct dentry *old = nd->path.dentry;
1190
1191 if (nd->path.dentry == nd->root.dentry &&
1192 nd->path.mnt == nd->root.mnt) {
1193 break;
1194 }
1195 if (nd->path.dentry != nd->path.mnt->mnt_root) {
1196 /* rare case of legitimate dget_parent()... */
1197 nd->path.dentry = dget_parent(nd->path.dentry);
1198 dput(old);
1199 break;
1200 }
1201 if (!follow_up(&nd->path))
1202 break;
1203 }
1204 follow_mount(&nd->path);
1205 nd->inode = nd->path.dentry->d_inode;
1206 }
1207
1208 /*
1209 * This looks up the name in dcache, possibly revalidates the old dentry and
1210 * allocates a new one if not found or not valid. In the need_lookup argument
1211 * returns whether i_op->lookup is necessary.
1212 *
1213 * dir->d_inode->i_mutex must be held
1214 */
1215 static struct dentry *lookup_dcache(struct qstr *name, struct dentry *dir,
1216 unsigned int flags, bool *need_lookup)
1217 {
1218 struct dentry *dentry;
1219 int error;
1220
1221 *need_lookup = false;
1222 dentry = d_lookup(dir, name);
1223 if (dentry) {
1224 if (d_need_lookup(dentry)) {
1225 *need_lookup = true;
1226 } else if (dentry->d_flags & DCACHE_OP_REVALIDATE) {
1227 error = d_revalidate(dentry, flags);
1228 if (unlikely(error <= 0)) {
1229 if (error < 0) {
1230 dput(dentry);
1231 return ERR_PTR(error);
1232 } else if (!d_invalidate(dentry)) {
1233 dput(dentry);
1234 dentry = NULL;
1235 }
1236 }
1237 }
1238 }
1239
1240 if (!dentry) {
1241 dentry = d_alloc(dir, name);
1242 if (unlikely(!dentry))
1243 return ERR_PTR(-ENOMEM);
1244
1245 *need_lookup = true;
1246 }
1247 return dentry;
1248 }
1249
1250 /*
1251 * Call i_op->lookup on the dentry. The dentry must be negative but may be
1252 * hashed if it was pouplated with DCACHE_NEED_LOOKUP.
1253 *
1254 * dir->d_inode->i_mutex must be held
1255 */
1256 static struct dentry *lookup_real(struct inode *dir, struct dentry *dentry,
1257 unsigned int flags)
1258 {
1259 struct dentry *old;
1260
1261 /* Don't create child dentry for a dead directory. */
1262 if (unlikely(IS_DEADDIR(dir))) {
1263 dput(dentry);
1264 return ERR_PTR(-ENOENT);
1265 }
1266
1267 old = dir->i_op->lookup(dir, dentry, flags);
1268 if (unlikely(old)) {
1269 dput(dentry);
1270 dentry = old;
1271 }
1272 return dentry;
1273 }
1274
1275 static struct dentry *__lookup_hash(struct qstr *name,
1276 struct dentry *base, unsigned int flags)
1277 {
1278 bool need_lookup;
1279 struct dentry *dentry;
1280
1281 dentry = lookup_dcache(name, base, flags, &need_lookup);
1282 if (!need_lookup)
1283 return dentry;
1284
1285 return lookup_real(base->d_inode, dentry, flags);
1286 }
1287
1288 /*
1289 * It's more convoluted than I'd like it to be, but... it's still fairly
1290 * small and for now I'd prefer to have fast path as straight as possible.
1291 * It _is_ time-critical.
1292 */
1293 static int lookup_fast(struct nameidata *nd, struct qstr *name,
1294 struct path *path, struct inode **inode)
1295 {
1296 struct vfsmount *mnt = nd->path.mnt;
1297 struct dentry *dentry, *parent = nd->path.dentry;
1298 int need_reval = 1;
1299 int status = 1;
1300 int err;
1301
1302 /*
1303 * Rename seqlock is not required here because in the off chance
1304 * of a false negative due to a concurrent rename, we're going to
1305 * do the non-racy lookup, below.
1306 */
1307 if (nd->flags & LOOKUP_RCU) {
1308 unsigned seq;
1309 dentry = __d_lookup_rcu(parent, name, &seq, nd->inode);
1310 if (!dentry)
1311 goto unlazy;
1312
1313 /*
1314 * This sequence count validates that the inode matches
1315 * the dentry name information from lookup.
1316 */
1317 *inode = dentry->d_inode;
1318 if (read_seqcount_retry(&dentry->d_seq, seq))
1319 return -ECHILD;
1320
1321 /*
1322 * This sequence count validates that the parent had no
1323 * changes while we did the lookup of the dentry above.
1324 *
1325 * The memory barrier in read_seqcount_begin of child is
1326 * enough, we can use __read_seqcount_retry here.
1327 */
1328 if (__read_seqcount_retry(&parent->d_seq, nd->seq))
1329 return -ECHILD;
1330 nd->seq = seq;
1331
1332 if (unlikely(d_need_lookup(dentry)))
1333 goto unlazy;
1334 if (unlikely(dentry->d_flags & DCACHE_OP_REVALIDATE)) {
1335 status = d_revalidate(dentry, nd->flags);
1336 if (unlikely(status <= 0)) {
1337 if (status != -ECHILD)
1338 need_reval = 0;
1339 goto unlazy;
1340 }
1341 }
1342 path->mnt = mnt;
1343 path->dentry = dentry;
1344 if (unlikely(!__follow_mount_rcu(nd, path, inode)))
1345 goto unlazy;
1346 if (unlikely(path->dentry->d_flags & DCACHE_NEED_AUTOMOUNT))
1347 goto unlazy;
1348 return 0;
1349 unlazy:
1350 if (unlazy_walk(nd, dentry))
1351 return -ECHILD;
1352 } else {
1353 dentry = __d_lookup(parent, name);
1354 }
1355
1356 if (unlikely(!dentry))
1357 goto need_lookup;
1358
1359 if (unlikely(d_need_lookup(dentry))) {
1360 dput(dentry);
1361 goto need_lookup;
1362 }
1363
1364 if (unlikely(dentry->d_flags & DCACHE_OP_REVALIDATE) && need_reval)
1365 status = d_revalidate(dentry, nd->flags);
1366 if (unlikely(status <= 0)) {
1367 if (status < 0) {
1368 dput(dentry);
1369 return status;
1370 }
1371 if (!d_invalidate(dentry)) {
1372 dput(dentry);
1373 goto need_lookup;
1374 }
1375 }
1376
1377 path->mnt = mnt;
1378 path->dentry = dentry;
1379 err = follow_managed(path, nd->flags);
1380 if (unlikely(err < 0)) {
1381 path_put_conditional(path, nd);
1382 return err;
1383 }
1384 if (err)
1385 nd->flags |= LOOKUP_JUMPED;
1386 *inode = path->dentry->d_inode;
1387 return 0;
1388
1389 need_lookup:
1390 return 1;
1391 }
1392
1393 /* Fast lookup failed, do it the slow way */
1394 static int lookup_slow(struct nameidata *nd, struct qstr *name,
1395 struct path *path)
1396 {
1397 struct dentry *dentry, *parent;
1398 int err;
1399
1400 parent = nd->path.dentry;
1401 BUG_ON(nd->inode != parent->d_inode);
1402
1403 mutex_lock(&parent->d_inode->i_mutex);
1404 dentry = __lookup_hash(name, parent, nd->flags);
1405 mutex_unlock(&parent->d_inode->i_mutex);
1406 if (IS_ERR(dentry))
1407 return PTR_ERR(dentry);
1408 path->mnt = nd->path.mnt;
1409 path->dentry = dentry;
1410 err = follow_managed(path, nd->flags);
1411 if (unlikely(err < 0)) {
1412 path_put_conditional(path, nd);
1413 return err;
1414 }
1415 if (err)
1416 nd->flags |= LOOKUP_JUMPED;
1417 return 0;
1418 }
1419
1420 static inline int may_lookup(struct nameidata *nd)
1421 {
1422 if (nd->flags & LOOKUP_RCU) {
1423 int err = inode_permission(nd->inode, MAY_EXEC|MAY_NOT_BLOCK);
1424 if (err != -ECHILD)
1425 return err;
1426 if (unlazy_walk(nd, NULL))
1427 return -ECHILD;
1428 }
1429 return inode_permission(nd->inode, MAY_EXEC);
1430 }
1431
1432 static inline int handle_dots(struct nameidata *nd, int type)
1433 {
1434 if (type == LAST_DOTDOT) {
1435 if (nd->flags & LOOKUP_RCU) {
1436 if (follow_dotdot_rcu(nd))
1437 return -ECHILD;
1438 } else
1439 follow_dotdot(nd);
1440 }
1441 return 0;
1442 }
1443
1444 static void terminate_walk(struct nameidata *nd)
1445 {
1446 if (!(nd->flags & LOOKUP_RCU)) {
1447 path_put(&nd->path);
1448 } else {
1449 nd->flags &= ~LOOKUP_RCU;
1450 if (!(nd->flags & LOOKUP_ROOT))
1451 nd->root.mnt = NULL;
1452 unlock_rcu_walk();
1453 }
1454 }
1455
1456 /*
1457 * Do we need to follow links? We _really_ want to be able
1458 * to do this check without having to look at inode->i_op,
1459 * so we keep a cache of "no, this doesn't need follow_link"
1460 * for the common case.
1461 */
1462 static inline int should_follow_link(struct inode *inode, int follow)
1463 {
1464 if (unlikely(!(inode->i_opflags & IOP_NOFOLLOW))) {
1465 if (likely(inode->i_op->follow_link))
1466 return follow;
1467
1468 /* This gets set once for the inode lifetime */
1469 spin_lock(&inode->i_lock);
1470 inode->i_opflags |= IOP_NOFOLLOW;
1471 spin_unlock(&inode->i_lock);
1472 }
1473 return 0;
1474 }
1475
1476 static inline int walk_component(struct nameidata *nd, struct path *path,
1477 struct qstr *name, int type, int follow)
1478 {
1479 struct inode *inode;
1480 int err;
1481 /*
1482 * "." and ".." are special - ".." especially so because it has
1483 * to be able to know about the current root directory and
1484 * parent relationships.
1485 */
1486 if (unlikely(type != LAST_NORM))
1487 return handle_dots(nd, type);
1488 err = lookup_fast(nd, name, path, &inode);
1489 if (unlikely(err)) {
1490 if (err < 0)
1491 goto out_err;
1492
1493 err = lookup_slow(nd, name, path);
1494 if (err < 0)
1495 goto out_err;
1496
1497 inode = path->dentry->d_inode;
1498 }
1499 err = -ENOENT;
1500 if (!inode)
1501 goto out_path_put;
1502
1503 if (should_follow_link(inode, follow)) {
1504 if (nd->flags & LOOKUP_RCU) {
1505 if (unlikely(unlazy_walk(nd, path->dentry))) {
1506 err = -ECHILD;
1507 goto out_err;
1508 }
1509 }
1510 BUG_ON(inode != path->dentry->d_inode);
1511 return 1;
1512 }
1513 path_to_nameidata(path, nd);
1514 nd->inode = inode;
1515 return 0;
1516
1517 out_path_put:
1518 path_to_nameidata(path, nd);
1519 out_err:
1520 terminate_walk(nd);
1521 return err;
1522 }
1523
1524 /*
1525 * This limits recursive symlink follows to 8, while
1526 * limiting consecutive symlinks to 40.
1527 *
1528 * Without that kind of total limit, nasty chains of consecutive
1529 * symlinks can cause almost arbitrarily long lookups.
1530 */
1531 static inline int nested_symlink(struct path *path, struct nameidata *nd)
1532 {
1533 int res;
1534
1535 if (unlikely(current->link_count >= MAX_NESTED_LINKS)) {
1536 path_put_conditional(path, nd);
1537 path_put(&nd->path);
1538 return -ELOOP;
1539 }
1540 BUG_ON(nd->depth >= MAX_NESTED_LINKS);
1541
1542 nd->depth++;
1543 current->link_count++;
1544
1545 do {
1546 struct path link = *path;
1547 void *cookie;
1548
1549 res = follow_link(&link, nd, &cookie);
1550 if (res)
1551 break;
1552 res = walk_component(nd, path, &nd->last,
1553 nd->last_type, LOOKUP_FOLLOW);
1554 put_link(nd, &link, cookie);
1555 } while (res > 0);
1556
1557 current->link_count--;
1558 nd->depth--;
1559 return res;
1560 }
1561
1562 /*
1563 * We really don't want to look at inode->i_op->lookup
1564 * when we don't have to. So we keep a cache bit in
1565 * the inode ->i_opflags field that says "yes, we can
1566 * do lookup on this inode".
1567 */
1568 static inline int can_lookup(struct inode *inode)
1569 {
1570 if (likely(inode->i_opflags & IOP_LOOKUP))
1571 return 1;
1572 if (likely(!inode->i_op->lookup))
1573 return 0;
1574
1575 /* We do this once for the lifetime of the inode */
1576 spin_lock(&inode->i_lock);
1577 inode->i_opflags |= IOP_LOOKUP;
1578 spin_unlock(&inode->i_lock);
1579 return 1;
1580 }
1581
1582 /*
1583 * We can do the critical dentry name comparison and hashing
1584 * operations one word at a time, but we are limited to:
1585 *
1586 * - Architectures with fast unaligned word accesses. We could
1587 * do a "get_unaligned()" if this helps and is sufficiently
1588 * fast.
1589 *
1590 * - Little-endian machines (so that we can generate the mask
1591 * of low bytes efficiently). Again, we *could* do a byte
1592 * swapping load on big-endian architectures if that is not
1593 * expensive enough to make the optimization worthless.
1594 *
1595 * - non-CONFIG_DEBUG_PAGEALLOC configurations (so that we
1596 * do not trap on the (extremely unlikely) case of a page
1597 * crossing operation.
1598 *
1599 * - Furthermore, we need an efficient 64-bit compile for the
1600 * 64-bit case in order to generate the "number of bytes in
1601 * the final mask". Again, that could be replaced with a
1602 * efficient population count instruction or similar.
1603 */
1604 #ifdef CONFIG_DCACHE_WORD_ACCESS
1605
1606 #include <asm/word-at-a-time.h>
1607
1608 #ifdef CONFIG_64BIT
1609
1610 static inline unsigned int fold_hash(unsigned long hash)
1611 {
1612 hash += hash >> (8*sizeof(int));
1613 return hash;
1614 }
1615
1616 #else /* 32-bit case */
1617
1618 #define fold_hash(x) (x)
1619
1620 #endif
1621
1622 unsigned int full_name_hash(const unsigned char *name, unsigned int len)
1623 {
1624 unsigned long a, mask;
1625 unsigned long hash = 0;
1626
1627 for (;;) {
1628 a = load_unaligned_zeropad(name);
1629 if (len < sizeof(unsigned long))
1630 break;
1631 hash += a;
1632 hash *= 9;
1633 name += sizeof(unsigned long);
1634 len -= sizeof(unsigned long);
1635 if (!len)
1636 goto done;
1637 }
1638 mask = ~(~0ul << len*8);
1639 hash += mask & a;
1640 done:
1641 return fold_hash(hash);
1642 }
1643 EXPORT_SYMBOL(full_name_hash);
1644
1645 /*
1646 * Calculate the length and hash of the path component, and
1647 * return the length of the component;
1648 */
1649 static inline unsigned long hash_name(const char *name, unsigned int *hashp)
1650 {
1651 unsigned long a, b, adata, bdata, mask, hash, len;
1652 const struct word_at_a_time constants = WORD_AT_A_TIME_CONSTANTS;
1653
1654 hash = a = 0;
1655 len = -sizeof(unsigned long);
1656 do {
1657 hash = (hash + a) * 9;
1658 len += sizeof(unsigned long);
1659 a = load_unaligned_zeropad(name+len);
1660 b = a ^ REPEAT_BYTE('/');
1661 } while (!(has_zero(a, &adata, &constants) | has_zero(b, &bdata, &constants)));
1662
1663 adata = prep_zero_mask(a, adata, &constants);
1664 bdata = prep_zero_mask(b, bdata, &constants);
1665
1666 mask = create_zero_mask(adata | bdata);
1667
1668 hash += a & zero_bytemask(mask);
1669 *hashp = fold_hash(hash);
1670
1671 return len + find_zero(mask);
1672 }
1673
1674 #else
1675
1676 unsigned int full_name_hash(const unsigned char *name, unsigned int len)
1677 {
1678 unsigned long hash = init_name_hash();
1679 while (len--)
1680 hash = partial_name_hash(*name++, hash);
1681 return end_name_hash(hash);
1682 }
1683 EXPORT_SYMBOL(full_name_hash);
1684
1685 /*
1686 * We know there's a real path component here of at least
1687 * one character.
1688 */
1689 static inline unsigned long hash_name(const char *name, unsigned int *hashp)
1690 {
1691 unsigned long hash = init_name_hash();
1692 unsigned long len = 0, c;
1693
1694 c = (unsigned char)*name;
1695 do {
1696 len++;
1697 hash = partial_name_hash(c, hash);
1698 c = (unsigned char)name[len];
1699 } while (c && c != '/');
1700 *hashp = end_name_hash(hash);
1701 return len;
1702 }
1703
1704 #endif
1705
1706 /*
1707 * Name resolution.
1708 * This is the basic name resolution function, turning a pathname into
1709 * the final dentry. We expect 'base' to be positive and a directory.
1710 *
1711 * Returns 0 and nd will have valid dentry and mnt on success.
1712 * Returns error and drops reference to input namei data on failure.
1713 */
1714 static int link_path_walk(const char *name, struct nameidata *nd)
1715 {
1716 struct path next;
1717 int err;
1718
1719 while (*name=='/')
1720 name++;
1721 if (!*name)
1722 return 0;
1723
1724 /* At this point we know we have a real path component. */
1725 for(;;) {
1726 struct qstr this;
1727 long len;
1728 int type;
1729
1730 err = may_lookup(nd);
1731 if (err)
1732 break;
1733
1734 len = hash_name(name, &this.hash);
1735 this.name = name;
1736 this.len = len;
1737
1738 type = LAST_NORM;
1739 if (name[0] == '.') switch (len) {
1740 case 2:
1741 if (name[1] == '.') {
1742 type = LAST_DOTDOT;
1743 nd->flags |= LOOKUP_JUMPED;
1744 }
1745 break;
1746 case 1:
1747 type = LAST_DOT;
1748 }
1749 if (likely(type == LAST_NORM)) {
1750 struct dentry *parent = nd->path.dentry;
1751 nd->flags &= ~LOOKUP_JUMPED;
1752 if (unlikely(parent->d_flags & DCACHE_OP_HASH)) {
1753 err = parent->d_op->d_hash(parent, nd->inode,
1754 &this);
1755 if (err < 0)
1756 break;
1757 }
1758 }
1759
1760 if (!name[len])
1761 goto last_component;
1762 /*
1763 * If it wasn't NUL, we know it was '/'. Skip that
1764 * slash, and continue until no more slashes.
1765 */
1766 do {
1767 len++;
1768 } while (unlikely(name[len] == '/'));
1769 if (!name[len])
1770 goto last_component;
1771 name += len;
1772
1773 err = walk_component(nd, &next, &this, type, LOOKUP_FOLLOW);
1774 if (err < 0)
1775 return err;
1776
1777 if (err) {
1778 err = nested_symlink(&next, nd);
1779 if (err)
1780 return err;
1781 }
1782 if (can_lookup(nd->inode))
1783 continue;
1784 err = -ENOTDIR;
1785 break;
1786 /* here ends the main loop */
1787
1788 last_component:
1789 nd->last = this;
1790 nd->last_type = type;
1791 return 0;
1792 }
1793 terminate_walk(nd);
1794 return err;
1795 }
1796
1797 static int path_init(int dfd, const char *name, unsigned int flags,
1798 struct nameidata *nd, struct file **fp)
1799 {
1800 int retval = 0;
1801
1802 nd->last_type = LAST_ROOT; /* if there are only slashes... */
1803 nd->flags = flags | LOOKUP_JUMPED;
1804 nd->depth = 0;
1805 if (flags & LOOKUP_ROOT) {
1806 struct inode *inode = nd->root.dentry->d_inode;
1807 if (*name) {
1808 if (!inode->i_op->lookup)
1809 return -ENOTDIR;
1810 retval = inode_permission(inode, MAY_EXEC);
1811 if (retval)
1812 return retval;
1813 }
1814 nd->path = nd->root;
1815 nd->inode = inode;
1816 if (flags & LOOKUP_RCU) {
1817 lock_rcu_walk();
1818 nd->seq = __read_seqcount_begin(&nd->path.dentry->d_seq);
1819 } else {
1820 path_get(&nd->path);
1821 }
1822 return 0;
1823 }
1824
1825 nd->root.mnt = NULL;
1826
1827 if (*name=='/') {
1828 if (flags & LOOKUP_RCU) {
1829 lock_rcu_walk();
1830 set_root_rcu(nd);
1831 } else {
1832 set_root(nd);
1833 path_get(&nd->root);
1834 }
1835 nd->path = nd->root;
1836 } else if (dfd == AT_FDCWD) {
1837 if (flags & LOOKUP_RCU) {
1838 struct fs_struct *fs = current->fs;
1839 unsigned seq;
1840
1841 lock_rcu_walk();
1842
1843 do {
1844 seq = read_seqcount_begin(&fs->seq);
1845 nd->path = fs->pwd;
1846 nd->seq = __read_seqcount_begin(&nd->path.dentry->d_seq);
1847 } while (read_seqcount_retry(&fs->seq, seq));
1848 } else {
1849 get_fs_pwd(current->fs, &nd->path);
1850 }
1851 } else {
1852 struct fd f = fdget_raw(dfd);
1853 struct dentry *dentry;
1854
1855 if (!f.file)
1856 return -EBADF;
1857
1858 dentry = f.file->f_path.dentry;
1859
1860 if (*name) {
1861 if (!S_ISDIR(dentry->d_inode->i_mode)) {
1862 fdput(f);
1863 return -ENOTDIR;
1864 }
1865
1866 retval = inode_permission(dentry->d_inode, MAY_EXEC);
1867 if (retval) {
1868 fdput(f);
1869 return retval;
1870 }
1871 }
1872
1873 nd->path = f.file->f_path;
1874 if (flags & LOOKUP_RCU) {
1875 if (f.need_put)
1876 *fp = f.file;
1877 nd->seq = __read_seqcount_begin(&nd->path.dentry->d_seq);
1878 lock_rcu_walk();
1879 } else {
1880 path_get(&nd->path);
1881 fdput(f);
1882 }
1883 }
1884
1885 nd->inode = nd->path.dentry->d_inode;
1886 return 0;
1887 }
1888
1889 static inline int lookup_last(struct nameidata *nd, struct path *path)
1890 {
1891 if (nd->last_type == LAST_NORM && nd->last.name[nd->last.len])
1892 nd->flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY;
1893
1894 nd->flags &= ~LOOKUP_PARENT;
1895 return walk_component(nd, path, &nd->last, nd->last_type,
1896 nd->flags & LOOKUP_FOLLOW);
1897 }
1898
1899 /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
1900 static int path_lookupat(int dfd, const char *name,
1901 unsigned int flags, struct nameidata *nd)
1902 {
1903 struct file *base = NULL;
1904 struct path path;
1905 int err;
1906
1907 /*
1908 * Path walking is largely split up into 2 different synchronisation
1909 * schemes, rcu-walk and ref-walk (explained in
1910 * Documentation/filesystems/path-lookup.txt). These share much of the
1911 * path walk code, but some things particularly setup, cleanup, and
1912 * following mounts are sufficiently divergent that functions are
1913 * duplicated. Typically there is a function foo(), and its RCU
1914 * analogue, foo_rcu().
1915 *
1916 * -ECHILD is the error number of choice (just to avoid clashes) that
1917 * is returned if some aspect of an rcu-walk fails. Such an error must
1918 * be handled by restarting a traditional ref-walk (which will always
1919 * be able to complete).
1920 */
1921 err = path_init(dfd, name, flags | LOOKUP_PARENT, nd, &base);
1922
1923 if (unlikely(err))
1924 return err;
1925
1926 current->total_link_count = 0;
1927 err = link_path_walk(name, nd);
1928
1929 if (!err && !(flags & LOOKUP_PARENT)) {
1930 err = lookup_last(nd, &path);
1931 while (err > 0) {
1932 void *cookie;
1933 struct path link = path;
1934 err = may_follow_link(&link, nd);
1935 if (unlikely(err))
1936 break;
1937 nd->flags |= LOOKUP_PARENT;
1938 err = follow_link(&link, nd, &cookie);
1939 if (err)
1940 break;
1941 err = lookup_last(nd, &path);
1942 put_link(nd, &link, cookie);
1943 }
1944 }
1945
1946 if (!err)
1947 err = complete_walk(nd);
1948
1949 if (!err && nd->flags & LOOKUP_DIRECTORY) {
1950 if (!nd->inode->i_op->lookup) {
1951 path_put(&nd->path);
1952 err = -ENOTDIR;
1953 }
1954 }
1955
1956 if (base)
1957 fput(base);
1958
1959 if (nd->root.mnt && !(nd->flags & LOOKUP_ROOT)) {
1960 path_put(&nd->root);
1961 nd->root.mnt = NULL;
1962 }
1963 return err;
1964 }
1965
1966 static int do_path_lookup(int dfd, const char *name,
1967 unsigned int flags, struct nameidata *nd)
1968 {
1969 int retval = path_lookupat(dfd, name, flags | LOOKUP_RCU, nd);
1970 if (unlikely(retval == -ECHILD))
1971 retval = path_lookupat(dfd, name, flags, nd);
1972 if (unlikely(retval == -ESTALE))
1973 retval = path_lookupat(dfd, name, flags | LOOKUP_REVAL, nd);
1974
1975 if (likely(!retval))
1976 audit_inode(name, nd->path.dentry, flags & LOOKUP_PARENT);
1977 return retval;
1978 }
1979
1980 /* does lookup, returns the object with parent locked */
1981 struct dentry *kern_path_locked(const char *name, struct path *path)
1982 {
1983 struct nameidata nd;
1984 struct dentry *d;
1985 int err = do_path_lookup(AT_FDCWD, name, LOOKUP_PARENT, &nd);
1986 if (err)
1987 return ERR_PTR(err);
1988 if (nd.last_type != LAST_NORM) {
1989 path_put(&nd.path);
1990 return ERR_PTR(-EINVAL);
1991 }
1992 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
1993 d = __lookup_hash(&nd.last, nd.path.dentry, 0);
1994 if (IS_ERR(d)) {
1995 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
1996 path_put(&nd.path);
1997 return d;
1998 }
1999 *path = nd.path;
2000 return d;
2001 }
2002
2003 int kern_path(const char *name, unsigned int flags, struct path *path)
2004 {
2005 struct nameidata nd;
2006 int res = do_path_lookup(AT_FDCWD, name, flags, &nd);
2007 if (!res)
2008 *path = nd.path;
2009 return res;
2010 }
2011
2012 /**
2013 * vfs_path_lookup - lookup a file path relative to a dentry-vfsmount pair
2014 * @dentry: pointer to dentry of the base directory
2015 * @mnt: pointer to vfs mount of the base directory
2016 * @name: pointer to file name
2017 * @flags: lookup flags
2018 * @path: pointer to struct path to fill
2019 */
2020 int vfs_path_lookup(struct dentry *dentry, struct vfsmount *mnt,
2021 const char *name, unsigned int flags,
2022 struct path *path)
2023 {
2024 struct nameidata nd;
2025 int err;
2026 nd.root.dentry = dentry;
2027 nd.root.mnt = mnt;
2028 BUG_ON(flags & LOOKUP_PARENT);
2029 /* the first argument of do_path_lookup() is ignored with LOOKUP_ROOT */
2030 err = do_path_lookup(AT_FDCWD, name, flags | LOOKUP_ROOT, &nd);
2031 if (!err)
2032 *path = nd.path;
2033 return err;
2034 }
2035
2036 /*
2037 * Restricted form of lookup. Doesn't follow links, single-component only,
2038 * needs parent already locked. Doesn't follow mounts.
2039 * SMP-safe.
2040 */
2041 static struct dentry *lookup_hash(struct nameidata *nd)
2042 {
2043 return __lookup_hash(&nd->last, nd->path.dentry, nd->flags);
2044 }
2045
2046 /**
2047 * lookup_one_len - filesystem helper to lookup single pathname component
2048 * @name: pathname component to lookup
2049 * @base: base directory to lookup from
2050 * @len: maximum length @len should be interpreted to
2051 *
2052 * Note that this routine is purely a helper for filesystem usage and should
2053 * not be called by generic code. Also note that by using this function the
2054 * nameidata argument is passed to the filesystem methods and a filesystem
2055 * using this helper needs to be prepared for that.
2056 */
2057 struct dentry *lookup_one_len(const char *name, struct dentry *base, int len)
2058 {
2059 struct qstr this;
2060 unsigned int c;
2061 int err;
2062
2063 WARN_ON_ONCE(!mutex_is_locked(&base->d_inode->i_mutex));
2064
2065 this.name = name;
2066 this.len = len;
2067 this.hash = full_name_hash(name, len);
2068 if (!len)
2069 return ERR_PTR(-EACCES);
2070
2071 while (len--) {
2072 c = *(const unsigned char *)name++;
2073 if (c == '/' || c == '\0')
2074 return ERR_PTR(-EACCES);
2075 }
2076 /*
2077 * See if the low-level filesystem might want
2078 * to use its own hash..
2079 */
2080 if (base->d_flags & DCACHE_OP_HASH) {
2081 int err = base->d_op->d_hash(base, base->d_inode, &this);
2082 if (err < 0)
2083 return ERR_PTR(err);
2084 }
2085
2086 err = inode_permission(base->d_inode, MAY_EXEC);
2087 if (err)
2088 return ERR_PTR(err);
2089
2090 return __lookup_hash(&this, base, 0);
2091 }
2092
2093 int user_path_at_empty(int dfd, const char __user *name, unsigned flags,
2094 struct path *path, int *empty)
2095 {
2096 struct nameidata nd;
2097 char *tmp = getname_flags(name, flags, empty);
2098 int err = PTR_ERR(tmp);
2099 if (!IS_ERR(tmp)) {
2100
2101 BUG_ON(flags & LOOKUP_PARENT);
2102
2103 err = do_path_lookup(dfd, tmp, flags, &nd);
2104 putname(tmp);
2105 if (!err)
2106 *path = nd.path;
2107 }
2108 return err;
2109 }
2110
2111 int user_path_at(int dfd, const char __user *name, unsigned flags,
2112 struct path *path)
2113 {
2114 return user_path_at_empty(dfd, name, flags, path, NULL);
2115 }
2116
2117 static int user_path_parent(int dfd, const char __user *path,
2118 struct nameidata *nd, char **name)
2119 {
2120 char *s = getname(path);
2121 int error;
2122
2123 if (IS_ERR(s))
2124 return PTR_ERR(s);
2125
2126 error = do_path_lookup(dfd, s, LOOKUP_PARENT, nd);
2127 if (error)
2128 putname(s);
2129 else
2130 *name = s;
2131
2132 return error;
2133 }
2134
2135 /*
2136 * It's inline, so penalty for filesystems that don't use sticky bit is
2137 * minimal.
2138 */
2139 static inline int check_sticky(struct inode *dir, struct inode *inode)
2140 {
2141 kuid_t fsuid = current_fsuid();
2142
2143 if (!(dir->i_mode & S_ISVTX))
2144 return 0;
2145 if (uid_eq(inode->i_uid, fsuid))
2146 return 0;
2147 if (uid_eq(dir->i_uid, fsuid))
2148 return 0;
2149 return !inode_capable(inode, CAP_FOWNER);
2150 }
2151
2152 /*
2153 * Check whether we can remove a link victim from directory dir, check
2154 * whether the type of victim is right.
2155 * 1. We can't do it if dir is read-only (done in permission())
2156 * 2. We should have write and exec permissions on dir
2157 * 3. We can't remove anything from append-only dir
2158 * 4. We can't do anything with immutable dir (done in permission())
2159 * 5. If the sticky bit on dir is set we should either
2160 * a. be owner of dir, or
2161 * b. be owner of victim, or
2162 * c. have CAP_FOWNER capability
2163 * 6. If the victim is append-only or immutable we can't do antyhing with
2164 * links pointing to it.
2165 * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR.
2166 * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR.
2167 * 9. We can't remove a root or mountpoint.
2168 * 10. We don't allow removal of NFS sillyrenamed files; it's handled by
2169 * nfs_async_unlink().
2170 */
2171 static int may_delete(struct inode *dir,struct dentry *victim,int isdir)
2172 {
2173 int error;
2174
2175 if (!victim->d_inode)
2176 return -ENOENT;
2177
2178 BUG_ON(victim->d_parent->d_inode != dir);
2179 audit_inode_child(dir, victim);
2180
2181 error = inode_permission(dir, MAY_WRITE | MAY_EXEC);
2182 if (error)
2183 return error;
2184 if (IS_APPEND(dir))
2185 return -EPERM;
2186 if (check_sticky(dir, victim->d_inode)||IS_APPEND(victim->d_inode)||
2187 IS_IMMUTABLE(victim->d_inode) || IS_SWAPFILE(victim->d_inode))
2188 return -EPERM;
2189 if (isdir) {
2190 if (!S_ISDIR(victim->d_inode->i_mode))
2191 return -ENOTDIR;
2192 if (IS_ROOT(victim))
2193 return -EBUSY;
2194 } else if (S_ISDIR(victim->d_inode->i_mode))
2195 return -EISDIR;
2196 if (IS_DEADDIR(dir))
2197 return -ENOENT;
2198 if (victim->d_flags & DCACHE_NFSFS_RENAMED)
2199 return -EBUSY;
2200 return 0;
2201 }
2202
2203 /* Check whether we can create an object with dentry child in directory
2204 * dir.
2205 * 1. We can't do it if child already exists (open has special treatment for
2206 * this case, but since we are inlined it's OK)
2207 * 2. We can't do it if dir is read-only (done in permission())
2208 * 3. We should have write and exec permissions on dir
2209 * 4. We can't do it if dir is immutable (done in permission())
2210 */
2211 static inline int may_create(struct inode *dir, struct dentry *child)
2212 {
2213 if (child->d_inode)
2214 return -EEXIST;
2215 if (IS_DEADDIR(dir))
2216 return -ENOENT;
2217 return inode_permission(dir, MAY_WRITE | MAY_EXEC);
2218 }
2219
2220 /*
2221 * p1 and p2 should be directories on the same fs.
2222 */
2223 struct dentry *lock_rename(struct dentry *p1, struct dentry *p2)
2224 {
2225 struct dentry *p;
2226
2227 if (p1 == p2) {
2228 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
2229 return NULL;
2230 }
2231
2232 mutex_lock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
2233
2234 p = d_ancestor(p2, p1);
2235 if (p) {
2236 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_PARENT);
2237 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_CHILD);
2238 return p;
2239 }
2240
2241 p = d_ancestor(p1, p2);
2242 if (p) {
2243 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
2244 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
2245 return p;
2246 }
2247
2248 mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
2249 mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
2250 return NULL;
2251 }
2252
2253 void unlock_rename(struct dentry *p1, struct dentry *p2)
2254 {
2255 mutex_unlock(&p1->d_inode->i_mutex);
2256 if (p1 != p2) {
2257 mutex_unlock(&p2->d_inode->i_mutex);
2258 mutex_unlock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
2259 }
2260 }
2261
2262 int vfs_create(struct inode *dir, struct dentry *dentry, umode_t mode,
2263 bool want_excl)
2264 {
2265 int error = may_create(dir, dentry);
2266 if (error)
2267 return error;
2268
2269 if (!dir->i_op->create)
2270 return -EACCES; /* shouldn't it be ENOSYS? */
2271 mode &= S_IALLUGO;
2272 mode |= S_IFREG;
2273 error = security_inode_create(dir, dentry, mode);
2274 if (error)
2275 return error;
2276 error = dir->i_op->create(dir, dentry, mode, want_excl);
2277 if (!error)
2278 fsnotify_create(dir, dentry);
2279 return error;
2280 }
2281
2282 static int may_open(struct path *path, int acc_mode, int flag)
2283 {
2284 struct dentry *dentry = path->dentry;
2285 struct inode *inode = dentry->d_inode;
2286 int error;
2287
2288 /* O_PATH? */
2289 if (!acc_mode)
2290 return 0;
2291
2292 if (!inode)
2293 return -ENOENT;
2294
2295 switch (inode->i_mode & S_IFMT) {
2296 case S_IFLNK:
2297 return -ELOOP;
2298 case S_IFDIR:
2299 if (acc_mode & MAY_WRITE)
2300 return -EISDIR;
2301 break;
2302 case S_IFBLK:
2303 case S_IFCHR:
2304 if (path->mnt->mnt_flags & MNT_NODEV)
2305 return -EACCES;
2306 /*FALLTHRU*/
2307 case S_IFIFO:
2308 case S_IFSOCK:
2309 flag &= ~O_TRUNC;
2310 break;
2311 }
2312
2313 error = inode_permission(inode, acc_mode);
2314 if (error)
2315 return error;
2316
2317 /*
2318 * An append-only file must be opened in append mode for writing.
2319 */
2320 if (IS_APPEND(inode)) {
2321 if ((flag & O_ACCMODE) != O_RDONLY && !(flag & O_APPEND))
2322 return -EPERM;
2323 if (flag & O_TRUNC)
2324 return -EPERM;
2325 }
2326
2327 /* O_NOATIME can only be set by the owner or superuser */
2328 if (flag & O_NOATIME && !inode_owner_or_capable(inode))
2329 return -EPERM;
2330
2331 return 0;
2332 }
2333
2334 static int handle_truncate(struct file *filp)
2335 {
2336 struct path *path = &filp->f_path;
2337 struct inode *inode = path->dentry->d_inode;
2338 int error = get_write_access(inode);
2339 if (error)
2340 return error;
2341 /*
2342 * Refuse to truncate files with mandatory locks held on them.
2343 */
2344 error = locks_verify_locked(inode);
2345 if (!error)
2346 error = security_path_truncate(path);
2347 if (!error) {
2348 error = do_truncate(path->dentry, 0,
2349 ATTR_MTIME|ATTR_CTIME|ATTR_OPEN,
2350 filp);
2351 }
2352 put_write_access(inode);
2353 return error;
2354 }
2355
2356 static inline int open_to_namei_flags(int flag)
2357 {
2358 if ((flag & O_ACCMODE) == 3)
2359 flag--;
2360 return flag;
2361 }
2362
2363 static int may_o_create(struct path *dir, struct dentry *dentry, umode_t mode)
2364 {
2365 int error = security_path_mknod(dir, dentry, mode, 0);
2366 if (error)
2367 return error;
2368
2369 error = inode_permission(dir->dentry->d_inode, MAY_WRITE | MAY_EXEC);
2370 if (error)
2371 return error;
2372
2373 return security_inode_create(dir->dentry->d_inode, dentry, mode);
2374 }
2375
2376 /*
2377 * Attempt to atomically look up, create and open a file from a negative
2378 * dentry.
2379 *
2380 * Returns 0 if successful. The file will have been created and attached to
2381 * @file by the filesystem calling finish_open().
2382 *
2383 * Returns 1 if the file was looked up only or didn't need creating. The
2384 * caller will need to perform the open themselves. @path will have been
2385 * updated to point to the new dentry. This may be negative.
2386 *
2387 * Returns an error code otherwise.
2388 */
2389 static int atomic_open(struct nameidata *nd, struct dentry *dentry,
2390 struct path *path, struct file *file,
2391 const struct open_flags *op,
2392 bool got_write, bool need_lookup,
2393 int *opened)
2394 {
2395 struct inode *dir = nd->path.dentry->d_inode;
2396 unsigned open_flag = open_to_namei_flags(op->open_flag);
2397 umode_t mode;
2398 int error;
2399 int acc_mode;
2400 int create_error = 0;
2401 struct dentry *const DENTRY_NOT_SET = (void *) -1UL;
2402
2403 BUG_ON(dentry->d_inode);
2404
2405 /* Don't create child dentry for a dead directory. */
2406 if (unlikely(IS_DEADDIR(dir))) {
2407 error = -ENOENT;
2408 goto out;
2409 }
2410
2411 mode = op->mode;
2412 if ((open_flag & O_CREAT) && !IS_POSIXACL(dir))
2413 mode &= ~current_umask();
2414
2415 if ((open_flag & (O_EXCL | O_CREAT)) == (O_EXCL | O_CREAT)) {
2416 open_flag &= ~O_TRUNC;
2417 *opened |= FILE_CREATED;
2418 }
2419
2420 /*
2421 * Checking write permission is tricky, bacuse we don't know if we are
2422 * going to actually need it: O_CREAT opens should work as long as the
2423 * file exists. But checking existence breaks atomicity. The trick is
2424 * to check access and if not granted clear O_CREAT from the flags.
2425 *
2426 * Another problem is returing the "right" error value (e.g. for an
2427 * O_EXCL open we want to return EEXIST not EROFS).
2428 */
2429 if (((open_flag & (O_CREAT | O_TRUNC)) ||
2430 (open_flag & O_ACCMODE) != O_RDONLY) && unlikely(!got_write)) {
2431 if (!(open_flag & O_CREAT)) {
2432 /*
2433 * No O_CREATE -> atomicity not a requirement -> fall
2434 * back to lookup + open
2435 */
2436 goto no_open;
2437 } else if (open_flag & (O_EXCL | O_TRUNC)) {
2438 /* Fall back and fail with the right error */
2439 create_error = -EROFS;
2440 goto no_open;
2441 } else {
2442 /* No side effects, safe to clear O_CREAT */
2443 create_error = -EROFS;
2444 open_flag &= ~O_CREAT;
2445 }
2446 }
2447
2448 if (open_flag & O_CREAT) {
2449 error = may_o_create(&nd->path, dentry, mode);
2450 if (error) {
2451 create_error = error;
2452 if (open_flag & O_EXCL)
2453 goto no_open;
2454 open_flag &= ~O_CREAT;
2455 }
2456 }
2457
2458 if (nd->flags & LOOKUP_DIRECTORY)
2459 open_flag |= O_DIRECTORY;
2460
2461 file->f_path.dentry = DENTRY_NOT_SET;
2462 file->f_path.mnt = nd->path.mnt;
2463 error = dir->i_op->atomic_open(dir, dentry, file, open_flag, mode,
2464 opened);
2465 if (error < 0) {
2466 if (create_error && error == -ENOENT)
2467 error = create_error;
2468 goto out;
2469 }
2470
2471 acc_mode = op->acc_mode;
2472 if (*opened & FILE_CREATED) {
2473 fsnotify_create(dir, dentry);
2474 acc_mode = MAY_OPEN;
2475 }
2476
2477 if (error) { /* returned 1, that is */
2478 if (WARN_ON(file->f_path.dentry == DENTRY_NOT_SET)) {
2479 error = -EIO;
2480 goto out;
2481 }
2482 if (file->f_path.dentry) {
2483 dput(dentry);
2484 dentry = file->f_path.dentry;
2485 }
2486 if (create_error && dentry->d_inode == NULL) {
2487 error = create_error;
2488 goto out;
2489 }
2490 goto looked_up;
2491 }
2492
2493 /*
2494 * We didn't have the inode before the open, so check open permission
2495 * here.
2496 */
2497 error = may_open(&file->f_path, acc_mode, open_flag);
2498 if (error)
2499 fput(file);
2500
2501 out:
2502 dput(dentry);
2503 return error;
2504
2505 no_open:
2506 if (need_lookup) {
2507 dentry = lookup_real(dir, dentry, nd->flags);
2508 if (IS_ERR(dentry))
2509 return PTR_ERR(dentry);
2510
2511 if (create_error) {
2512 int open_flag = op->open_flag;
2513
2514 error = create_error;
2515 if ((open_flag & O_EXCL)) {
2516 if (!dentry->d_inode)
2517 goto out;
2518 } else if (!dentry->d_inode) {
2519 goto out;
2520 } else if ((open_flag & O_TRUNC) &&
2521 S_ISREG(dentry->d_inode->i_mode)) {
2522 goto out;
2523 }
2524 /* will fail later, go on to get the right error */
2525 }
2526 }
2527 looked_up:
2528 path->dentry = dentry;
2529 path->mnt = nd->path.mnt;
2530 return 1;
2531 }
2532
2533 /*
2534 * Look up and maybe create and open the last component.
2535 *
2536 * Must be called with i_mutex held on parent.
2537 *
2538 * Returns 0 if the file was successfully atomically created (if necessary) and
2539 * opened. In this case the file will be returned attached to @file.
2540 *
2541 * Returns 1 if the file was not completely opened at this time, though lookups
2542 * and creations will have been performed and the dentry returned in @path will
2543 * be positive upon return if O_CREAT was specified. If O_CREAT wasn't
2544 * specified then a negative dentry may be returned.
2545 *
2546 * An error code is returned otherwise.
2547 *
2548 * FILE_CREATE will be set in @*opened if the dentry was created and will be
2549 * cleared otherwise prior to returning.
2550 */
2551 static int lookup_open(struct nameidata *nd, struct path *path,
2552 struct file *file,
2553 const struct open_flags *op,
2554 bool got_write, int *opened)
2555 {
2556 struct dentry *dir = nd->path.dentry;
2557 struct inode *dir_inode = dir->d_inode;
2558 struct dentry *dentry;
2559 int error;
2560 bool need_lookup;
2561
2562 *opened &= ~FILE_CREATED;
2563 dentry = lookup_dcache(&nd->last, dir, nd->flags, &need_lookup);
2564 if (IS_ERR(dentry))
2565 return PTR_ERR(dentry);
2566
2567 /* Cached positive dentry: will open in f_op->open */
2568 if (!need_lookup && dentry->d_inode)
2569 goto out_no_open;
2570
2571 if ((nd->flags & LOOKUP_OPEN) && dir_inode->i_op->atomic_open) {
2572 return atomic_open(nd, dentry, path, file, op, got_write,
2573 need_lookup, opened);
2574 }
2575
2576 if (need_lookup) {
2577 BUG_ON(dentry->d_inode);
2578
2579 dentry = lookup_real(dir_inode, dentry, nd->flags);
2580 if (IS_ERR(dentry))
2581 return PTR_ERR(dentry);
2582 }
2583
2584 /* Negative dentry, just create the file */
2585 if (!dentry->d_inode && (op->open_flag & O_CREAT)) {
2586 umode_t mode = op->mode;
2587 if (!IS_POSIXACL(dir->d_inode))
2588 mode &= ~current_umask();
2589 /*
2590 * This write is needed to ensure that a
2591 * rw->ro transition does not occur between
2592 * the time when the file is created and when
2593 * a permanent write count is taken through
2594 * the 'struct file' in finish_open().
2595 */
2596 if (!got_write) {
2597 error = -EROFS;
2598 goto out_dput;
2599 }
2600 *opened |= FILE_CREATED;
2601 error = security_path_mknod(&nd->path, dentry, mode, 0);
2602 if (error)
2603 goto out_dput;
2604 error = vfs_create(dir->d_inode, dentry, mode,
2605 nd->flags & LOOKUP_EXCL);
2606 if (error)
2607 goto out_dput;
2608 }
2609 out_no_open:
2610 path->dentry = dentry;
2611 path->mnt = nd->path.mnt;
2612 return 1;
2613
2614 out_dput:
2615 dput(dentry);
2616 return error;
2617 }
2618
2619 /*
2620 * Handle the last step of open()
2621 */
2622 static int do_last(struct nameidata *nd, struct path *path,
2623 struct file *file, const struct open_flags *op,
2624 int *opened, const char *pathname)
2625 {
2626 struct dentry *dir = nd->path.dentry;
2627 int open_flag = op->open_flag;
2628 bool will_truncate = (open_flag & O_TRUNC) != 0;
2629 bool got_write = false;
2630 int acc_mode = op->acc_mode;
2631 struct inode *inode;
2632 bool symlink_ok = false;
2633 struct path save_parent = { .dentry = NULL, .mnt = NULL };
2634 bool retried = false;
2635 int error;
2636
2637 nd->flags &= ~LOOKUP_PARENT;
2638 nd->flags |= op->intent;
2639
2640 switch (nd->last_type) {
2641 case LAST_DOTDOT:
2642 case LAST_DOT:
2643 error = handle_dots(nd, nd->last_type);
2644 if (error)
2645 return error;
2646 /* fallthrough */
2647 case LAST_ROOT:
2648 error = complete_walk(nd);
2649 if (error)
2650 return error;
2651 audit_inode(pathname, nd->path.dentry, 0);
2652 if (open_flag & O_CREAT) {
2653 error = -EISDIR;
2654 goto out;
2655 }
2656 goto finish_open;
2657 case LAST_BIND:
2658 error = complete_walk(nd);
2659 if (error)
2660 return error;
2661 audit_inode(pathname, dir, 0);
2662 goto finish_open;
2663 }
2664
2665 if (!(open_flag & O_CREAT)) {
2666 if (nd->last.name[nd->last.len])
2667 nd->flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY;
2668 if (open_flag & O_PATH && !(nd->flags & LOOKUP_FOLLOW))
2669 symlink_ok = true;
2670 /* we _can_ be in RCU mode here */
2671 error = lookup_fast(nd, &nd->last, path, &inode);
2672 if (likely(!error))
2673 goto finish_lookup;
2674
2675 if (error < 0)
2676 goto out;
2677
2678 BUG_ON(nd->inode != dir->d_inode);
2679 } else {
2680 /* create side of things */
2681 /*
2682 * This will *only* deal with leaving RCU mode - LOOKUP_JUMPED
2683 * has been cleared when we got to the last component we are
2684 * about to look up
2685 */
2686 error = complete_walk(nd);
2687 if (error)
2688 return error;
2689
2690 audit_inode(pathname, dir, 0);
2691 error = -EISDIR;
2692 /* trailing slashes? */
2693 if (nd->last.name[nd->last.len])
2694 goto out;
2695 }
2696
2697 retry_lookup:
2698 if (op->open_flag & (O_CREAT | O_TRUNC | O_WRONLY | O_RDWR)) {
2699 error = mnt_want_write(nd->path.mnt);
2700 if (!error)
2701 got_write = true;
2702 /*
2703 * do _not_ fail yet - we might not need that or fail with
2704 * a different error; let lookup_open() decide; we'll be
2705 * dropping this one anyway.
2706 */
2707 }
2708 mutex_lock(&dir->d_inode->i_mutex);
2709 error = lookup_open(nd, path, file, op, got_write, opened);
2710 mutex_unlock(&dir->d_inode->i_mutex);
2711
2712 if (error <= 0) {
2713 if (error)
2714 goto out;
2715
2716 if ((*opened & FILE_CREATED) ||
2717 !S_ISREG(file->f_path.dentry->d_inode->i_mode))
2718 will_truncate = false;
2719
2720 audit_inode(pathname, file->f_path.dentry, 0);
2721 goto opened;
2722 }
2723
2724 if (*opened & FILE_CREATED) {
2725 /* Don't check for write permission, don't truncate */
2726 open_flag &= ~O_TRUNC;
2727 will_truncate = false;
2728 acc_mode = MAY_OPEN;
2729 path_to_nameidata(path, nd);
2730 goto finish_open_created;
2731 }
2732
2733 /*
2734 * create/update audit record if it already exists.
2735 */
2736 if (path->dentry->d_inode)
2737 audit_inode(pathname, path->dentry, 0);
2738
2739 /*
2740 * If atomic_open() acquired write access it is dropped now due to
2741 * possible mount and symlink following (this might be optimized away if
2742 * necessary...)
2743 */
2744 if (got_write) {
2745 mnt_drop_write(nd->path.mnt);
2746 got_write = false;
2747 }
2748
2749 error = -EEXIST;
2750 if ((open_flag & (O_EXCL | O_CREAT)) == (O_EXCL | O_CREAT))
2751 goto exit_dput;
2752
2753 error = follow_managed(path, nd->flags);
2754 if (error < 0)
2755 goto exit_dput;
2756
2757 if (error)
2758 nd->flags |= LOOKUP_JUMPED;
2759
2760 BUG_ON(nd->flags & LOOKUP_RCU);
2761 inode = path->dentry->d_inode;
2762 finish_lookup:
2763 /* we _can_ be in RCU mode here */
2764 error = -ENOENT;
2765 if (!inode) {
2766 path_to_nameidata(path, nd);
2767 goto out;
2768 }
2769
2770 if (should_follow_link(inode, !symlink_ok)) {
2771 if (nd->flags & LOOKUP_RCU) {
2772 if (unlikely(unlazy_walk(nd, path->dentry))) {
2773 error = -ECHILD;
2774 goto out;
2775 }
2776 }
2777 BUG_ON(inode != path->dentry->d_inode);
2778 return 1;
2779 }
2780
2781 if ((nd->flags & LOOKUP_RCU) || nd->path.mnt != path->mnt) {
2782 path_to_nameidata(path, nd);
2783 } else {
2784 save_parent.dentry = nd->path.dentry;
2785 save_parent.mnt = mntget(path->mnt);
2786 nd->path.dentry = path->dentry;
2787
2788 }
2789 nd->inode = inode;
2790 /* Why this, you ask? _Now_ we might have grown LOOKUP_JUMPED... */
2791 error = complete_walk(nd);
2792 if (error) {
2793 path_put(&save_parent);
2794 return error;
2795 }
2796 error = -EISDIR;
2797 if ((open_flag & O_CREAT) && S_ISDIR(nd->inode->i_mode))
2798 goto out;
2799 error = -ENOTDIR;
2800 if ((nd->flags & LOOKUP_DIRECTORY) && !nd->inode->i_op->lookup)
2801 goto out;
2802 audit_inode(pathname, nd->path.dentry, 0);
2803 finish_open:
2804 if (!S_ISREG(nd->inode->i_mode))
2805 will_truncate = false;
2806
2807 if (will_truncate) {
2808 error = mnt_want_write(nd->path.mnt);
2809 if (error)
2810 goto out;
2811 got_write = true;
2812 }
2813 finish_open_created:
2814 error = may_open(&nd->path, acc_mode, open_flag);
2815 if (error)
2816 goto out;
2817 file->f_path.mnt = nd->path.mnt;
2818 error = finish_open(file, nd->path.dentry, NULL, opened);
2819 if (error) {
2820 if (error == -EOPENSTALE)
2821 goto stale_open;
2822 goto out;
2823 }
2824 opened:
2825 error = open_check_o_direct(file);
2826 if (error)
2827 goto exit_fput;
2828 error = ima_file_check(file, op->acc_mode);
2829 if (error)
2830 goto exit_fput;
2831
2832 if (will_truncate) {
2833 error = handle_truncate(file);
2834 if (error)
2835 goto exit_fput;
2836 }
2837 out:
2838 if (got_write)
2839 mnt_drop_write(nd->path.mnt);
2840 path_put(&save_parent);
2841 terminate_walk(nd);
2842 return error;
2843
2844 exit_dput:
2845 path_put_conditional(path, nd);
2846 goto out;
2847 exit_fput:
2848 fput(file);
2849 goto out;
2850
2851 stale_open:
2852 /* If no saved parent or already retried then can't retry */
2853 if (!save_parent.dentry || retried)
2854 goto out;
2855
2856 BUG_ON(save_parent.dentry != dir);
2857 path_put(&nd->path);
2858 nd->path = save_parent;
2859 nd->inode = dir->d_inode;
2860 save_parent.mnt = NULL;
2861 save_parent.dentry = NULL;
2862 if (got_write) {
2863 mnt_drop_write(nd->path.mnt);
2864 got_write = false;
2865 }
2866 retried = true;
2867 goto retry_lookup;
2868 }
2869
2870 static struct file *path_openat(int dfd, const char *pathname,
2871 struct nameidata *nd, const struct open_flags *op, int flags)
2872 {
2873 struct file *base = NULL;
2874 struct file *file;
2875 struct path path;
2876 int opened = 0;
2877 int error;
2878
2879 file = get_empty_filp();
2880 if (!file)
2881 return ERR_PTR(-ENFILE);
2882
2883 file->f_flags = op->open_flag;
2884
2885 error = path_init(dfd, pathname, flags | LOOKUP_PARENT, nd, &base);
2886 if (unlikely(error))
2887 goto out;
2888
2889 current->total_link_count = 0;
2890 error = link_path_walk(pathname, nd);
2891 if (unlikely(error))
2892 goto out;
2893
2894 error = do_last(nd, &path, file, op, &opened, pathname);
2895 while (unlikely(error > 0)) { /* trailing symlink */
2896 struct path link = path;
2897 void *cookie;
2898 if (!(nd->flags & LOOKUP_FOLLOW)) {
2899 path_put_conditional(&path, nd);
2900 path_put(&nd->path);
2901 error = -ELOOP;
2902 break;
2903 }
2904 error = may_follow_link(&link, nd);
2905 if (unlikely(error))
2906 break;
2907 nd->flags |= LOOKUP_PARENT;
2908 nd->flags &= ~(LOOKUP_OPEN|LOOKUP_CREATE|LOOKUP_EXCL);
2909 error = follow_link(&link, nd, &cookie);
2910 if (unlikely(error))
2911 break;
2912 error = do_last(nd, &path, file, op, &opened, pathname);
2913 put_link(nd, &link, cookie);
2914 }
2915 out:
2916 if (nd->root.mnt && !(nd->flags & LOOKUP_ROOT))
2917 path_put(&nd->root);
2918 if (base)
2919 fput(base);
2920 if (!(opened & FILE_OPENED)) {
2921 BUG_ON(!error);
2922 put_filp(file);
2923 }
2924 if (unlikely(error)) {
2925 if (error == -EOPENSTALE) {
2926 if (flags & LOOKUP_RCU)
2927 error = -ECHILD;
2928 else
2929 error = -ESTALE;
2930 }
2931 file = ERR_PTR(error);
2932 }
2933 return file;
2934 }
2935
2936 struct file *do_filp_open(int dfd, const char *pathname,
2937 const struct open_flags *op, int flags)
2938 {
2939 struct nameidata nd;
2940 struct file *filp;
2941
2942 filp = path_openat(dfd, pathname, &nd, op, flags | LOOKUP_RCU);
2943 if (unlikely(filp == ERR_PTR(-ECHILD)))
2944 filp = path_openat(dfd, pathname, &nd, op, flags);
2945 if (unlikely(filp == ERR_PTR(-ESTALE)))
2946 filp = path_openat(dfd, pathname, &nd, op, flags | LOOKUP_REVAL);
2947 return filp;
2948 }
2949
2950 struct file *do_file_open_root(struct dentry *dentry, struct vfsmount *mnt,
2951 const char *name, const struct open_flags *op, int flags)
2952 {
2953 struct nameidata nd;
2954 struct file *file;
2955
2956 nd.root.mnt = mnt;
2957 nd.root.dentry = dentry;
2958
2959 flags |= LOOKUP_ROOT;
2960
2961 if (dentry->d_inode->i_op->follow_link && op->intent & LOOKUP_OPEN)
2962 return ERR_PTR(-ELOOP);
2963
2964 file = path_openat(-1, name, &nd, op, flags | LOOKUP_RCU);
2965 if (unlikely(file == ERR_PTR(-ECHILD)))
2966 file = path_openat(-1, name, &nd, op, flags);
2967 if (unlikely(file == ERR_PTR(-ESTALE)))
2968 file = path_openat(-1, name, &nd, op, flags | LOOKUP_REVAL);
2969 return file;
2970 }
2971
2972 struct dentry *kern_path_create(int dfd, const char *pathname, struct path *path, int is_dir)
2973 {
2974 struct dentry *dentry = ERR_PTR(-EEXIST);
2975 struct nameidata nd;
2976 int err2;
2977 int error = do_path_lookup(dfd, pathname, LOOKUP_PARENT, &nd);
2978 if (error)
2979 return ERR_PTR(error);
2980
2981 /*
2982 * Yucky last component or no last component at all?
2983 * (foo/., foo/.., /////)
2984 */
2985 if (nd.last_type != LAST_NORM)
2986 goto out;
2987 nd.flags &= ~LOOKUP_PARENT;
2988 nd.flags |= LOOKUP_CREATE | LOOKUP_EXCL;
2989
2990 /* don't fail immediately if it's r/o, at least try to report other errors */
2991 err2 = mnt_want_write(nd.path.mnt);
2992 /*
2993 * Do the final lookup.
2994 */
2995 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
2996 dentry = lookup_hash(&nd);
2997 if (IS_ERR(dentry))
2998 goto unlock;
2999
3000 error = -EEXIST;
3001 if (dentry->d_inode)
3002 goto fail;
3003 /*
3004 * Special case - lookup gave negative, but... we had foo/bar/
3005 * From the vfs_mknod() POV we just have a negative dentry -
3006 * all is fine. Let's be bastards - you had / on the end, you've
3007 * been asking for (non-existent) directory. -ENOENT for you.
3008 */
3009 if (unlikely(!is_dir && nd.last.name[nd.last.len])) {
3010 error = -ENOENT;
3011 goto fail;
3012 }
3013 if (unlikely(err2)) {
3014 error = err2;
3015 goto fail;
3016 }
3017 *path = nd.path;
3018 return dentry;
3019 fail:
3020 dput(dentry);
3021 dentry = ERR_PTR(error);
3022 unlock:
3023 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
3024 if (!err2)
3025 mnt_drop_write(nd.path.mnt);
3026 out:
3027 path_put(&nd.path);
3028 return dentry;
3029 }
3030 EXPORT_SYMBOL(kern_path_create);
3031
3032 void done_path_create(struct path *path, struct dentry *dentry)
3033 {
3034 dput(dentry);
3035 mutex_unlock(&path->dentry->d_inode->i_mutex);
3036 mnt_drop_write(path->mnt);
3037 path_put(path);
3038 }
3039 EXPORT_SYMBOL(done_path_create);
3040
3041 struct dentry *user_path_create(int dfd, const char __user *pathname, struct path *path, int is_dir)
3042 {
3043 char *tmp = getname(pathname);
3044 struct dentry *res;
3045 if (IS_ERR(tmp))
3046 return ERR_CAST(tmp);
3047 res = kern_path_create(dfd, tmp, path, is_dir);
3048 putname(tmp);
3049 return res;
3050 }
3051 EXPORT_SYMBOL(user_path_create);
3052
3053 int vfs_mknod(struct inode *dir, struct dentry *dentry, umode_t mode, dev_t dev)
3054 {
3055 int error = may_create(dir, dentry);
3056
3057 if (error)
3058 return error;
3059
3060 if ((S_ISCHR(mode) || S_ISBLK(mode)) && !capable(CAP_MKNOD))
3061 return -EPERM;
3062
3063 if (!dir->i_op->mknod)
3064 return -EPERM;
3065
3066 error = devcgroup_inode_mknod(mode, dev);
3067 if (error)
3068 return error;
3069
3070 error = security_inode_mknod(dir, dentry, mode, dev);
3071 if (error)
3072 return error;
3073
3074 error = dir->i_op->mknod(dir, dentry, mode, dev);
3075 if (!error)
3076 fsnotify_create(dir, dentry);
3077 return error;
3078 }
3079
3080 static int may_mknod(umode_t mode)
3081 {
3082 switch (mode & S_IFMT) {
3083 case S_IFREG:
3084 case S_IFCHR:
3085 case S_IFBLK:
3086 case S_IFIFO:
3087 case S_IFSOCK:
3088 case 0: /* zero mode translates to S_IFREG */
3089 return 0;
3090 case S_IFDIR:
3091 return -EPERM;
3092 default:
3093 return -EINVAL;
3094 }
3095 }
3096
3097 SYSCALL_DEFINE4(mknodat, int, dfd, const char __user *, filename, umode_t, mode,
3098 unsigned, dev)
3099 {
3100 struct dentry *dentry;
3101 struct path path;
3102 int error;
3103
3104 error = may_mknod(mode);
3105 if (error)
3106 return error;
3107
3108 dentry = user_path_create(dfd, filename, &path, 0);
3109 if (IS_ERR(dentry))
3110 return PTR_ERR(dentry);
3111
3112 if (!IS_POSIXACL(path.dentry->d_inode))
3113 mode &= ~current_umask();
3114 error = security_path_mknod(&path, dentry, mode, dev);
3115 if (error)
3116 goto out;
3117 switch (mode & S_IFMT) {
3118 case 0: case S_IFREG:
3119 error = vfs_create(path.dentry->d_inode,dentry,mode,true);
3120 break;
3121 case S_IFCHR: case S_IFBLK:
3122 error = vfs_mknod(path.dentry->d_inode,dentry,mode,
3123 new_decode_dev(dev));
3124 break;
3125 case S_IFIFO: case S_IFSOCK:
3126 error = vfs_mknod(path.dentry->d_inode,dentry,mode,0);
3127 break;
3128 }
3129 out:
3130 done_path_create(&path, dentry);
3131 return error;
3132 }
3133
3134 SYSCALL_DEFINE3(mknod, const char __user *, filename, umode_t, mode, unsigned, dev)
3135 {
3136 return sys_mknodat(AT_FDCWD, filename, mode, dev);
3137 }
3138
3139 int vfs_mkdir(struct inode *dir, struct dentry *dentry, umode_t mode)
3140 {
3141 int error = may_create(dir, dentry);
3142 unsigned max_links = dir->i_sb->s_max_links;
3143
3144 if (error)
3145 return error;
3146
3147 if (!dir->i_op->mkdir)
3148 return -EPERM;
3149
3150 mode &= (S_IRWXUGO|S_ISVTX);
3151 error = security_inode_mkdir(dir, dentry, mode);
3152 if (error)
3153 return error;
3154
3155 if (max_links && dir->i_nlink >= max_links)
3156 return -EMLINK;
3157
3158 error = dir->i_op->mkdir(dir, dentry, mode);
3159 if (!error)
3160 fsnotify_mkdir(dir, dentry);
3161 return error;
3162 }
3163
3164 SYSCALL_DEFINE3(mkdirat, int, dfd, const char __user *, pathname, umode_t, mode)
3165 {
3166 struct dentry *dentry;
3167 struct path path;
3168 int error;
3169
3170 dentry = user_path_create(dfd, pathname, &path, 1);
3171 if (IS_ERR(dentry))
3172 return PTR_ERR(dentry);
3173
3174 if (!IS_POSIXACL(path.dentry->d_inode))
3175 mode &= ~current_umask();
3176 error = security_path_mkdir(&path, dentry, mode);
3177 if (!error)
3178 error = vfs_mkdir(path.dentry->d_inode, dentry, mode);
3179 done_path_create(&path, dentry);
3180 return error;
3181 }
3182
3183 SYSCALL_DEFINE2(mkdir, const char __user *, pathname, umode_t, mode)
3184 {
3185 return sys_mkdirat(AT_FDCWD, pathname, mode);
3186 }
3187
3188 /*
3189 * The dentry_unhash() helper will try to drop the dentry early: we
3190 * should have a usage count of 1 if we're the only user of this
3191 * dentry, and if that is true (possibly after pruning the dcache),
3192 * then we drop the dentry now.
3193 *
3194 * A low-level filesystem can, if it choses, legally
3195 * do a
3196 *
3197 * if (!d_unhashed(dentry))
3198 * return -EBUSY;
3199 *
3200 * if it cannot handle the case of removing a directory
3201 * that is still in use by something else..
3202 */
3203 void dentry_unhash(struct dentry *dentry)
3204 {
3205 shrink_dcache_parent(dentry);
3206 spin_lock(&dentry->d_lock);
3207 if (dentry->d_count == 1)
3208 __d_drop(dentry);
3209 spin_unlock(&dentry->d_lock);
3210 }
3211
3212 int vfs_rmdir(struct inode *dir, struct dentry *dentry)
3213 {
3214 int error = may_delete(dir, dentry, 1);
3215
3216 if (error)
3217 return error;
3218
3219 if (!dir->i_op->rmdir)
3220 return -EPERM;
3221
3222 dget(dentry);
3223 mutex_lock(&dentry->d_inode->i_mutex);
3224
3225 error = -EBUSY;
3226 if (d_mountpoint(dentry))
3227 goto out;
3228
3229 error = security_inode_rmdir(dir, dentry);
3230 if (error)
3231 goto out;
3232
3233 shrink_dcache_parent(dentry);
3234 error = dir->i_op->rmdir(dir, dentry);
3235 if (error)
3236 goto out;
3237
3238 dentry->d_inode->i_flags |= S_DEAD;
3239 dont_mount(dentry);
3240
3241 out:
3242 mutex_unlock(&dentry->d_inode->i_mutex);
3243 dput(dentry);
3244 if (!error)
3245 d_delete(dentry);
3246 return error;
3247 }
3248
3249 static long do_rmdir(int dfd, const char __user *pathname)
3250 {
3251 int error = 0;
3252 char * name;
3253 struct dentry *dentry;
3254 struct nameidata nd;
3255
3256 error = user_path_parent(dfd, pathname, &nd, &name);
3257 if (error)
3258 return error;
3259
3260 switch(nd.last_type) {
3261 case LAST_DOTDOT:
3262 error = -ENOTEMPTY;
3263 goto exit1;
3264 case LAST_DOT:
3265 error = -EINVAL;
3266 goto exit1;
3267 case LAST_ROOT:
3268 error = -EBUSY;
3269 goto exit1;
3270 }
3271
3272 nd.flags &= ~LOOKUP_PARENT;
3273 error = mnt_want_write(nd.path.mnt);
3274 if (error)
3275 goto exit1;
3276
3277 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
3278 dentry = lookup_hash(&nd);
3279 error = PTR_ERR(dentry);
3280 if (IS_ERR(dentry))
3281 goto exit2;
3282 if (!dentry->d_inode) {
3283 error = -ENOENT;
3284 goto exit3;
3285 }
3286 error = security_path_rmdir(&nd.path, dentry);
3287 if (error)
3288 goto exit3;
3289 error = vfs_rmdir(nd.path.dentry->d_inode, dentry);
3290 exit3:
3291 dput(dentry);
3292 exit2:
3293 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
3294 mnt_drop_write(nd.path.mnt);
3295 exit1:
3296 path_put(&nd.path);
3297 putname(name);
3298 return error;
3299 }
3300
3301 SYSCALL_DEFINE1(rmdir, const char __user *, pathname)
3302 {
3303 return do_rmdir(AT_FDCWD, pathname);
3304 }
3305
3306 int vfs_unlink(struct inode *dir, struct dentry *dentry)
3307 {
3308 int error = may_delete(dir, dentry, 0);
3309
3310 if (error)
3311 return error;
3312
3313 if (!dir->i_op->unlink)
3314 return -EPERM;
3315
3316 mutex_lock(&dentry->d_inode->i_mutex);
3317 if (d_mountpoint(dentry))
3318 error = -EBUSY;
3319 else {
3320 error = security_inode_unlink(dir, dentry);
3321 if (!error) {
3322 error = dir->i_op->unlink(dir, dentry);
3323 if (!error)
3324 dont_mount(dentry);
3325 }
3326 }
3327 mutex_unlock(&dentry->d_inode->i_mutex);
3328
3329 /* We don't d_delete() NFS sillyrenamed files--they still exist. */
3330 if (!error && !(dentry->d_flags & DCACHE_NFSFS_RENAMED)) {
3331 fsnotify_link_count(dentry->d_inode);
3332 d_delete(dentry);
3333 }
3334
3335 return error;
3336 }
3337
3338 /*
3339 * Make sure that the actual truncation of the file will occur outside its
3340 * directory's i_mutex. Truncate can take a long time if there is a lot of
3341 * writeout happening, and we don't want to prevent access to the directory
3342 * while waiting on the I/O.
3343 */
3344 static long do_unlinkat(int dfd, const char __user *pathname)
3345 {
3346 int error;
3347 char *name;
3348 struct dentry *dentry;
3349 struct nameidata nd;
3350 struct inode *inode = NULL;
3351
3352 error = user_path_parent(dfd, pathname, &nd, &name);
3353 if (error)
3354 return error;
3355
3356 error = -EISDIR;
3357 if (nd.last_type != LAST_NORM)
3358 goto exit1;
3359
3360 nd.flags &= ~LOOKUP_PARENT;
3361 error = mnt_want_write(nd.path.mnt);
3362 if (error)
3363 goto exit1;
3364
3365 mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT);
3366 dentry = lookup_hash(&nd);
3367 error = PTR_ERR(dentry);
3368 if (!IS_ERR(dentry)) {
3369 /* Why not before? Because we want correct error value */
3370 if (nd.last.name[nd.last.len])
3371 goto slashes;
3372 inode = dentry->d_inode;
3373 if (!inode)
3374 goto slashes;
3375 ihold(inode);
3376 error = security_path_unlink(&nd.path, dentry);
3377 if (error)
3378 goto exit2;
3379 error = vfs_unlink(nd.path.dentry->d_inode, dentry);
3380 exit2:
3381 dput(dentry);
3382 }
3383 mutex_unlock(&nd.path.dentry->d_inode->i_mutex);
3384 if (inode)
3385 iput(inode); /* truncate the inode here */
3386 mnt_drop_write(nd.path.mnt);
3387 exit1:
3388 path_put(&nd.path);
3389 putname(name);
3390 return error;
3391
3392 slashes:
3393 error = !dentry->d_inode ? -ENOENT :
3394 S_ISDIR(dentry->d_inode->i_mode) ? -EISDIR : -ENOTDIR;
3395 goto exit2;
3396 }
3397
3398 SYSCALL_DEFINE3(unlinkat, int, dfd, const char __user *, pathname, int, flag)
3399 {
3400 if ((flag & ~AT_REMOVEDIR) != 0)
3401 return -EINVAL;
3402
3403 if (flag & AT_REMOVEDIR)
3404 return do_rmdir(dfd, pathname);
3405
3406 return do_unlinkat(dfd, pathname);
3407 }
3408
3409 SYSCALL_DEFINE1(unlink, const char __user *, pathname)
3410 {
3411 return do_unlinkat(AT_FDCWD, pathname);
3412 }
3413
3414 int vfs_symlink(struct inode *dir, struct dentry *dentry, const char *oldname)
3415 {
3416 int error = may_create(dir, dentry);
3417
3418 if (error)
3419 return error;
3420
3421 if (!dir->i_op->symlink)
3422 return -EPERM;
3423
3424 error = security_inode_symlink(dir, dentry, oldname);
3425 if (error)
3426 return error;
3427
3428 error = dir->i_op->symlink(dir, dentry, oldname);
3429 if (!error)
3430 fsnotify_create(dir, dentry);
3431 return error;
3432 }
3433
3434 SYSCALL_DEFINE3(symlinkat, const char __user *, oldname,
3435 int, newdfd, const char __user *, newname)
3436 {
3437 int error;
3438 char *from;
3439 struct dentry *dentry;
3440 struct path path;
3441
3442 from = getname(oldname);
3443 if (IS_ERR(from))
3444 return PTR_ERR(from);
3445
3446 dentry = user_path_create(newdfd, newname, &path, 0);
3447 error = PTR_ERR(dentry);
3448 if (IS_ERR(dentry))
3449 goto out_putname;
3450
3451 error = security_path_symlink(&path, dentry, from);
3452 if (!error)
3453 error = vfs_symlink(path.dentry->d_inode, dentry, from);
3454 done_path_create(&path, dentry);
3455 out_putname:
3456 putname(from);
3457 return error;
3458 }
3459
3460 SYSCALL_DEFINE2(symlink, const char __user *, oldname, const char __user *, newname)
3461 {
3462 return sys_symlinkat(oldname, AT_FDCWD, newname);
3463 }
3464
3465 int vfs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *new_dentry)
3466 {
3467 struct inode *inode = old_dentry->d_inode;
3468 unsigned max_links = dir->i_sb->s_max_links;
3469 int error;
3470
3471 if (!inode)
3472 return -ENOENT;
3473
3474 error = may_create(dir, new_dentry);
3475 if (error)
3476 return error;
3477
3478 if (dir->i_sb != inode->i_sb)
3479 return -EXDEV;
3480
3481 /*
3482 * A link to an append-only or immutable file cannot be created.
3483 */
3484 if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
3485 return -EPERM;
3486 if (!dir->i_op->link)
3487 return -EPERM;
3488 if (S_ISDIR(inode->i_mode))
3489 return -EPERM;
3490
3491 error = security_inode_link(old_dentry, dir, new_dentry);
3492 if (error)
3493 return error;
3494
3495 mutex_lock(&inode->i_mutex);
3496 /* Make sure we don't allow creating hardlink to an unlinked file */
3497 if (inode->i_nlink == 0)
3498 error = -ENOENT;
3499 else if (max_links && inode->i_nlink >= max_links)
3500 error = -EMLINK;
3501 else
3502 error = dir->i_op->link(old_dentry, dir, new_dentry);
3503 mutex_unlock(&inode->i_mutex);
3504 if (!error)
3505 fsnotify_link(dir, inode, new_dentry);
3506 return error;
3507 }
3508
3509 /*
3510 * Hardlinks are often used in delicate situations. We avoid
3511 * security-related surprises by not following symlinks on the
3512 * newname. --KAB
3513 *
3514 * We don't follow them on the oldname either to be compatible
3515 * with linux 2.0, and to avoid hard-linking to directories
3516 * and other special files. --ADM
3517 */
3518 SYSCALL_DEFINE5(linkat, int, olddfd, const char __user *, oldname,
3519 int, newdfd, const char __user *, newname, int, flags)
3520 {
3521 struct dentry *new_dentry;
3522 struct path old_path, new_path;
3523 int how = 0;
3524 int error;
3525
3526 if ((flags & ~(AT_SYMLINK_FOLLOW | AT_EMPTY_PATH)) != 0)
3527 return -EINVAL;
3528 /*
3529 * To use null names we require CAP_DAC_READ_SEARCH
3530 * This ensures that not everyone will be able to create
3531 * handlink using the passed filedescriptor.
3532 */
3533 if (flags & AT_EMPTY_PATH) {
3534 if (!capable(CAP_DAC_READ_SEARCH))
3535 return -ENOENT;
3536 how = LOOKUP_EMPTY;
3537 }
3538
3539 if (flags & AT_SYMLINK_FOLLOW)
3540 how |= LOOKUP_FOLLOW;
3541
3542 error = user_path_at(olddfd, oldname, how, &old_path);
3543 if (error)
3544 return error;
3545
3546 new_dentry = user_path_create(newdfd, newname, &new_path, 0);
3547 error = PTR_ERR(new_dentry);
3548 if (IS_ERR(new_dentry))
3549 goto out;
3550
3551 error = -EXDEV;
3552 if (old_path.mnt != new_path.mnt)
3553 goto out_dput;
3554 error = may_linkat(&old_path);
3555 if (unlikely(error))
3556 goto out_dput;
3557 error = security_path_link(old_path.dentry, &new_path, new_dentry);
3558 if (error)
3559 goto out_dput;
3560 error = vfs_link(old_path.dentry, new_path.dentry->d_inode, new_dentry);
3561 out_dput:
3562 done_path_create(&new_path, new_dentry);
3563 out:
3564 path_put(&old_path);
3565
3566 return error;
3567 }
3568
3569 SYSCALL_DEFINE2(link, const char __user *, oldname, const char __user *, newname)
3570 {
3571 return sys_linkat(AT_FDCWD, oldname, AT_FDCWD, newname, 0);
3572 }
3573
3574 /*
3575 * The worst of all namespace operations - renaming directory. "Perverted"
3576 * doesn't even start to describe it. Somebody in UCB had a heck of a trip...
3577 * Problems:
3578 * a) we can get into loop creation. Check is done in is_subdir().
3579 * b) race potential - two innocent renames can create a loop together.
3580 * That's where 4.4 screws up. Current fix: serialization on
3581 * sb->s_vfs_rename_mutex. We might be more accurate, but that's another
3582 * story.
3583 * c) we have to lock _three_ objects - parents and victim (if it exists).
3584 * And that - after we got ->i_mutex on parents (until then we don't know
3585 * whether the target exists). Solution: try to be smart with locking
3586 * order for inodes. We rely on the fact that tree topology may change
3587 * only under ->s_vfs_rename_mutex _and_ that parent of the object we
3588 * move will be locked. Thus we can rank directories by the tree
3589 * (ancestors first) and rank all non-directories after them.
3590 * That works since everybody except rename does "lock parent, lookup,
3591 * lock child" and rename is under ->s_vfs_rename_mutex.
3592 * HOWEVER, it relies on the assumption that any object with ->lookup()
3593 * has no more than 1 dentry. If "hybrid" objects will ever appear,
3594 * we'd better make sure that there's no link(2) for them.
3595 * d) conversion from fhandle to dentry may come in the wrong moment - when
3596 * we are removing the target. Solution: we will have to grab ->i_mutex
3597 * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on
3598 * ->i_mutex on parents, which works but leads to some truly excessive
3599 * locking].
3600 */
3601 static int vfs_rename_dir(struct inode *old_dir, struct dentry *old_dentry,
3602 struct inode *new_dir, struct dentry *new_dentry)
3603 {
3604 int error = 0;
3605 struct inode *target = new_dentry->d_inode;
3606 unsigned max_links = new_dir->i_sb->s_max_links;
3607
3608 /*
3609 * If we are going to change the parent - check write permissions,
3610 * we'll need to flip '..'.
3611 */
3612 if (new_dir != old_dir) {
3613 error = inode_permission(old_dentry->d_inode, MAY_WRITE);
3614 if (error)
3615 return error;
3616 }
3617
3618 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
3619 if (error)
3620 return error;
3621
3622 dget(new_dentry);
3623 if (target)
3624 mutex_lock(&target->i_mutex);
3625
3626 error = -EBUSY;
3627 if (d_mountpoint(old_dentry) || d_mountpoint(new_dentry))
3628 goto out;
3629
3630 error = -EMLINK;
3631 if (max_links && !target && new_dir != old_dir &&
3632 new_dir->i_nlink >= max_links)
3633 goto out;
3634
3635 if (target)
3636 shrink_dcache_parent(new_dentry);
3637 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
3638 if (error)
3639 goto out;
3640
3641 if (target) {
3642 target->i_flags |= S_DEAD;
3643 dont_mount(new_dentry);
3644 }
3645 out:
3646 if (target)
3647 mutex_unlock(&target->i_mutex);
3648 dput(new_dentry);
3649 if (!error)
3650 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
3651 d_move(old_dentry,new_dentry);
3652 return error;
3653 }
3654
3655 static int vfs_rename_other(struct inode *old_dir, struct dentry *old_dentry,
3656 struct inode *new_dir, struct dentry *new_dentry)
3657 {
3658 struct inode *target = new_dentry->d_inode;
3659 int error;
3660
3661 error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry);
3662 if (error)
3663 return error;
3664
3665 dget(new_dentry);
3666 if (target)
3667 mutex_lock(&target->i_mutex);
3668
3669 error = -EBUSY;
3670 if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry))
3671 goto out;
3672
3673 error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry);
3674 if (error)
3675 goto out;
3676
3677 if (target)
3678 dont_mount(new_dentry);
3679 if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE))
3680 d_move(old_dentry, new_dentry);
3681 out:
3682 if (target)
3683 mutex_unlock(&target->i_mutex);
3684 dput(new_dentry);
3685 return error;
3686 }
3687
3688 int vfs_rename(struct inode *old_dir, struct dentry *old_dentry,
3689 struct inode *new_dir, struct dentry *new_dentry)
3690 {
3691 int error;
3692 int is_dir = S_ISDIR(old_dentry->d_inode->i_mode);
3693 const unsigned char *old_name;
3694
3695 if (old_dentry->d_inode == new_dentry->d_inode)
3696 return 0;
3697
3698 error = may_delete(old_dir, old_dentry, is_dir);
3699 if (error)
3700 return error;
3701
3702 if (!new_dentry->d_inode)
3703 error = may_create(new_dir, new_dentry);
3704 else
3705 error = may_delete(new_dir, new_dentry, is_dir);
3706 if (error)
3707 return error;
3708
3709 if (!old_dir->i_op->rename)
3710 return -EPERM;
3711
3712 old_name = fsnotify_oldname_init(old_dentry->d_name.name);
3713
3714 if (is_dir)
3715 error = vfs_rename_dir(old_dir,old_dentry,new_dir,new_dentry);
3716 else
3717 error = vfs_rename_other(old_dir,old_dentry,new_dir,new_dentry);
3718 if (!error)
3719 fsnotify_move(old_dir, new_dir, old_name, is_dir,
3720 new_dentry->d_inode, old_dentry);
3721 fsnotify_oldname_free(old_name);
3722
3723 return error;
3724 }
3725
3726 SYSCALL_DEFINE4(renameat, int, olddfd, const char __user *, oldname,
3727 int, newdfd, const char __user *, newname)
3728 {
3729 struct dentry *old_dir, *new_dir;
3730 struct dentry *old_dentry, *new_dentry;
3731 struct dentry *trap;
3732 struct nameidata oldnd, newnd;
3733 char *from;
3734 char *to;
3735 int error;
3736
3737 error = user_path_parent(olddfd, oldname, &oldnd, &from);
3738 if (error)
3739 goto exit;
3740
3741 error = user_path_parent(newdfd, newname, &newnd, &to);
3742 if (error)
3743 goto exit1;
3744
3745 error = -EXDEV;
3746 if (oldnd.path.mnt != newnd.path.mnt)
3747 goto exit2;
3748
3749 old_dir = oldnd.path.dentry;
3750 error = -EBUSY;
3751 if (oldnd.last_type != LAST_NORM)
3752 goto exit2;
3753
3754 new_dir = newnd.path.dentry;
3755 if (newnd.last_type != LAST_NORM)
3756 goto exit2;
3757
3758 error = mnt_want_write(oldnd.path.mnt);
3759 if (error)
3760 goto exit2;
3761
3762 oldnd.flags &= ~LOOKUP_PARENT;
3763 newnd.flags &= ~LOOKUP_PARENT;
3764 newnd.flags |= LOOKUP_RENAME_TARGET;
3765
3766 trap = lock_rename(new_dir, old_dir);
3767
3768 old_dentry = lookup_hash(&oldnd);
3769 error = PTR_ERR(old_dentry);
3770 if (IS_ERR(old_dentry))
3771 goto exit3;
3772 /* source must exist */
3773 error = -ENOENT;
3774 if (!old_dentry->d_inode)
3775 goto exit4;
3776 /* unless the source is a directory trailing slashes give -ENOTDIR */
3777 if (!S_ISDIR(old_dentry->d_inode->i_mode)) {
3778 error = -ENOTDIR;
3779 if (oldnd.last.name[oldnd.last.len])
3780 goto exit4;
3781 if (newnd.last.name[newnd.last.len])
3782 goto exit4;
3783 }
3784 /* source should not be ancestor of target */
3785 error = -EINVAL;
3786 if (old_dentry == trap)
3787 goto exit4;
3788 new_dentry = lookup_hash(&newnd);
3789 error = PTR_ERR(new_dentry);
3790 if (IS_ERR(new_dentry))
3791 goto exit4;
3792 /* target should not be an ancestor of source */
3793 error = -ENOTEMPTY;
3794 if (new_dentry == trap)
3795 goto exit5;
3796
3797 error = security_path_rename(&oldnd.path, old_dentry,
3798 &newnd.path, new_dentry);
3799 if (error)
3800 goto exit5;
3801 error = vfs_rename(old_dir->d_inode, old_dentry,
3802 new_dir->d_inode, new_dentry);
3803 exit5:
3804 dput(new_dentry);
3805 exit4:
3806 dput(old_dentry);
3807 exit3:
3808 unlock_rename(new_dir, old_dir);
3809 mnt_drop_write(oldnd.path.mnt);
3810 exit2:
3811 path_put(&newnd.path);
3812 putname(to);
3813 exit1:
3814 path_put(&oldnd.path);
3815 putname(from);
3816 exit:
3817 return error;
3818 }
3819
3820 SYSCALL_DEFINE2(rename, const char __user *, oldname, const char __user *, newname)
3821 {
3822 return sys_renameat(AT_FDCWD, oldname, AT_FDCWD, newname);
3823 }
3824
3825 int vfs_readlink(struct dentry *dentry, char __user *buffer, int buflen, const char *link)
3826 {
3827 int len;
3828
3829 len = PTR_ERR(link);
3830 if (IS_ERR(link))
3831 goto out;
3832
3833 len = strlen(link);
3834 if (len > (unsigned) buflen)
3835 len = buflen;
3836 if (copy_to_user(buffer, link, len))
3837 len = -EFAULT;
3838 out:
3839 return len;
3840 }
3841
3842 /*
3843 * A helper for ->readlink(). This should be used *ONLY* for symlinks that
3844 * have ->follow_link() touching nd only in nd_set_link(). Using (or not
3845 * using) it for any given inode is up to filesystem.
3846 */
3847 int generic_readlink(struct dentry *dentry, char __user *buffer, int buflen)
3848 {
3849 struct nameidata nd;
3850 void *cookie;
3851 int res;
3852
3853 nd.depth = 0;
3854 cookie = dentry->d_inode->i_op->follow_link(dentry, &nd);
3855 if (IS_ERR(cookie))
3856 return PTR_ERR(cookie);
3857
3858 res = vfs_readlink(dentry, buffer, buflen, nd_get_link(&nd));
3859 if (dentry->d_inode->i_op->put_link)
3860 dentry->d_inode->i_op->put_link(dentry, &nd, cookie);
3861 return res;
3862 }
3863
3864 int vfs_follow_link(struct nameidata *nd, const char *link)
3865 {
3866 return __vfs_follow_link(nd, link);
3867 }
3868
3869 /* get the link contents into pagecache */
3870 static char *page_getlink(struct dentry * dentry, struct page **ppage)
3871 {
3872 char *kaddr;
3873 struct page *page;
3874 struct address_space *mapping = dentry->d_inode->i_mapping;
3875 page = read_mapping_page(mapping, 0, NULL);
3876 if (IS_ERR(page))
3877 return (char*)page;
3878 *ppage = page;
3879 kaddr = kmap(page);
3880 nd_terminate_link(kaddr, dentry->d_inode->i_size, PAGE_SIZE - 1);
3881 return kaddr;
3882 }
3883
3884 int page_readlink(struct dentry *dentry, char __user *buffer, int buflen)
3885 {
3886 struct page *page = NULL;
3887 char *s = page_getlink(dentry, &page);
3888 int res = vfs_readlink(dentry,buffer,buflen,s);
3889 if (page) {
3890 kunmap(page);
3891 page_cache_release(page);
3892 }
3893 return res;
3894 }
3895
3896 void *page_follow_link_light(struct dentry *dentry, struct nameidata *nd)
3897 {
3898 struct page *page = NULL;
3899 nd_set_link(nd, page_getlink(dentry, &page));
3900 return page;
3901 }
3902
3903 void page_put_link(struct dentry *dentry, struct nameidata *nd, void *cookie)
3904 {
3905 struct page *page = cookie;
3906
3907 if (page) {
3908 kunmap(page);
3909 page_cache_release(page);
3910 }
3911 }
3912
3913 /*
3914 * The nofs argument instructs pagecache_write_begin to pass AOP_FLAG_NOFS
3915 */
3916 int __page_symlink(struct inode *inode, const char *symname, int len, int nofs)
3917 {
3918 struct address_space *mapping = inode->i_mapping;
3919 struct page *page;
3920 void *fsdata;
3921 int err;
3922 char *kaddr;
3923 unsigned int flags = AOP_FLAG_UNINTERRUPTIBLE;
3924 if (nofs)
3925 flags |= AOP_FLAG_NOFS;
3926
3927 retry:
3928 err = pagecache_write_begin(NULL, mapping, 0, len-1,
3929 flags, &page, &fsdata);
3930 if (err)
3931 goto fail;
3932
3933 kaddr = kmap_atomic(page);
3934 memcpy(kaddr, symname, len-1);
3935 kunmap_atomic(kaddr);
3936
3937 err = pagecache_write_end(NULL, mapping, 0, len-1, len-1,
3938 page, fsdata);
3939 if (err < 0)
3940 goto fail;
3941 if (err < len-1)
3942 goto retry;
3943
3944 mark_inode_dirty(inode);
3945 return 0;
3946 fail:
3947 return err;
3948 }
3949
3950 int page_symlink(struct inode *inode, const char *symname, int len)
3951 {
3952 return __page_symlink(inode, symname, len,
3953 !(mapping_gfp_mask(inode->i_mapping) & __GFP_FS));
3954 }
3955
3956 const struct inode_operations page_symlink_inode_operations = {
3957 .readlink = generic_readlink,
3958 .follow_link = page_follow_link_light,
3959 .put_link = page_put_link,
3960 };
3961
3962 EXPORT_SYMBOL(user_path_at);
3963 EXPORT_SYMBOL(follow_down_one);
3964 EXPORT_SYMBOL(follow_down);
3965 EXPORT_SYMBOL(follow_up);
3966 EXPORT_SYMBOL(get_write_access); /* nfsd */
3967 EXPORT_SYMBOL(getname);
3968 EXPORT_SYMBOL(lock_rename);
3969 EXPORT_SYMBOL(lookup_one_len);
3970 EXPORT_SYMBOL(page_follow_link_light);
3971 EXPORT_SYMBOL(page_put_link);
3972 EXPORT_SYMBOL(page_readlink);
3973 EXPORT_SYMBOL(__page_symlink);
3974 EXPORT_SYMBOL(page_symlink);
3975 EXPORT_SYMBOL(page_symlink_inode_operations);
3976 EXPORT_SYMBOL(kern_path);
3977 EXPORT_SYMBOL(vfs_path_lookup);
3978 EXPORT_SYMBOL(inode_permission);
3979 EXPORT_SYMBOL(unlock_rename);
3980 EXPORT_SYMBOL(vfs_create);
3981 EXPORT_SYMBOL(vfs_follow_link);
3982 EXPORT_SYMBOL(vfs_link);
3983 EXPORT_SYMBOL(vfs_mkdir);
3984 EXPORT_SYMBOL(vfs_mknod);
3985 EXPORT_SYMBOL(generic_permission);
3986 EXPORT_SYMBOL(vfs_readlink);
3987 EXPORT_SYMBOL(vfs_rename);
3988 EXPORT_SYMBOL(vfs_rmdir);
3989 EXPORT_SYMBOL(vfs_symlink);
3990 EXPORT_SYMBOL(vfs_unlink);
3991 EXPORT_SYMBOL(dentry_unhash);
3992 EXPORT_SYMBOL(generic_readlink);
This page took 0.261084 seconds and 5 git commands to generate.