Line data Source code
1 : // SPDX-License-Identifier: GPL-2.0
2 : /*
3 : * linux/fs/namei.c
4 : *
5 : * Copyright (C) 1991, 1992 Linus Torvalds
6 : */
7 :
8 : /*
9 : * Some corrections by tytso.
10 : */
11 :
12 : /* [Feb 1997 T. Schoebel-Theuer] Complete rewrite of the pathname
13 : * lookup logic.
14 : */
15 : /* [Feb-Apr 2000, AV] Rewrite to the new namespace architecture.
16 : */
17 :
18 : #include <linux/init.h>
19 : #include <linux/export.h>
20 : #include <linux/kernel.h>
21 : #include <linux/slab.h>
22 : #include <linux/fs.h>
23 : #include <linux/filelock.h>
24 : #include <linux/namei.h>
25 : #include <linux/pagemap.h>
26 : #include <linux/sched/mm.h>
27 : #include <linux/fsnotify.h>
28 : #include <linux/personality.h>
29 : #include <linux/security.h>
30 : #include <linux/ima.h>
31 : #include <linux/syscalls.h>
32 : #include <linux/mount.h>
33 : #include <linux/audit.h>
34 : #include <linux/capability.h>
35 : #include <linux/file.h>
36 : #include <linux/fcntl.h>
37 : #include <linux/device_cgroup.h>
38 : #include <linux/fs_struct.h>
39 : #include <linux/posix_acl.h>
40 : #include <linux/hash.h>
41 : #include <linux/bitops.h>
42 : #include <linux/init_task.h>
43 : #include <linux/uaccess.h>
44 :
45 : #include "internal.h"
46 : #include "mount.h"
47 :
48 : /* [Feb-1997 T. Schoebel-Theuer]
49 : * Fundamental changes in the pathname lookup mechanisms (namei)
50 : * were necessary because of omirr. The reason is that omirr needs
51 : * to know the _real_ pathname, not the user-supplied one, in case
52 : * of symlinks (and also when transname replacements occur).
53 : *
54 : * The new code replaces the old recursive symlink resolution with
55 : * an iterative one (in case of non-nested symlink chains). It does
56 : * this with calls to <fs>_follow_link().
57 : * As a side effect, dir_namei(), _namei() and follow_link() are now
58 : * replaced with a single function lookup_dentry() that can handle all
59 : * the special cases of the former code.
60 : *
61 : * With the new dcache, the pathname is stored at each inode, at least as
62 : * long as the refcount of the inode is positive. As a side effect, the
63 : * size of the dcache depends on the inode cache and thus is dynamic.
64 : *
65 : * [29-Apr-1998 C. Scott Ananian] Updated above description of symlink
66 : * resolution to correspond with current state of the code.
67 : *
68 : * Note that the symlink resolution is not *completely* iterative.
69 : * There is still a significant amount of tail- and mid- recursion in
70 : * the algorithm. Also, note that <fs>_readlink() is not used in
71 : * lookup_dentry(): lookup_dentry() on the result of <fs>_readlink()
72 : * may return different results than <fs>_follow_link(). Many virtual
73 : * filesystems (including /proc) exhibit this behavior.
74 : */
75 :
76 : /* [24-Feb-97 T. Schoebel-Theuer] Side effects caused by new implementation:
77 : * New symlink semantics: when open() is called with flags O_CREAT | O_EXCL
78 : * and the name already exists in form of a symlink, try to create the new
79 : * name indicated by the symlink. The old code always complained that the
80 : * name already exists, due to not following the symlink even if its target
81 : * is nonexistent. The new semantics affects also mknod() and link() when
82 : * the name is a symlink pointing to a non-existent name.
83 : *
84 : * I don't know which semantics is the right one, since I have no access
85 : * to standards. But I found by trial that HP-UX 9.0 has the full "new"
86 : * semantics implemented, while SunOS 4.1.1 and Solaris (SunOS 5.4) have the
87 : * "old" one. Personally, I think the new semantics is much more logical.
88 : * Note that "ln old new" where "new" is a symlink pointing to a non-existing
89 : * file does succeed in both HP-UX and SunOs, but not in Solaris
90 : * and in the old Linux semantics.
91 : */
92 :
93 : /* [16-Dec-97 Kevin Buhr] For security reasons, we change some symlink
94 : * semantics. See the comments in "open_namei" and "do_link" below.
95 : *
96 : * [10-Sep-98 Alan Modra] Another symlink change.
97 : */
98 :
99 : /* [Feb-Apr 2000 AV] Complete rewrite. Rules for symlinks:
100 : * inside the path - always follow.
101 : * in the last component in creation/removal/renaming - never follow.
102 : * if LOOKUP_FOLLOW passed - follow.
103 : * if the pathname has trailing slashes - follow.
104 : * otherwise - don't follow.
105 : * (applied in that order).
106 : *
107 : * [Jun 2000 AV] Inconsistent behaviour of open() in case if flags==O_CREAT
108 : * restored for 2.4. This is the last surviving part of old 4.2BSD bug.
109 : * During the 2.4 we need to fix the userland stuff depending on it -
110 : * hopefully we will be able to get rid of that wart in 2.5. So far only
111 : * XEmacs seems to be relying on it...
112 : */
113 : /*
114 : * [Sep 2001 AV] Single-semaphore locking scheme (kudos to David Holland)
115 : * implemented. Let's see if raised priority of ->s_vfs_rename_mutex gives
116 : * any extra contention...
117 : */
118 :
119 : /* In order to reduce some races, while at the same time doing additional
120 : * checking and hopefully speeding things up, we copy filenames to the
121 : * kernel data space before using them..
122 : *
123 : * POSIX.1 2.4: an empty pathname is invalid (ENOENT).
124 : * PATH_MAX includes the nul terminator --RR.
125 : */
126 :
127 : #define EMBEDDED_NAME_MAX (PATH_MAX - offsetof(struct filename, iname))
128 :
129 : struct filename *
130 0 : getname_flags(const char __user *filename, int flags, int *empty)
131 : {
132 : struct filename *result;
133 : char *kname;
134 : int len;
135 :
136 0 : result = audit_reusename(filename);
137 : if (result)
138 : return result;
139 :
140 0 : result = __getname();
141 0 : if (unlikely(!result))
142 : return ERR_PTR(-ENOMEM);
143 :
144 : /*
145 : * First, try to embed the struct filename inside the names_cache
146 : * allocation
147 : */
148 0 : kname = (char *)result->iname;
149 0 : result->name = kname;
150 :
151 0 : len = strncpy_from_user(kname, filename, EMBEDDED_NAME_MAX);
152 0 : if (unlikely(len < 0)) {
153 0 : __putname(result);
154 0 : return ERR_PTR(len);
155 : }
156 :
157 : /*
158 : * Uh-oh. We have a name that's approaching PATH_MAX. Allocate a
159 : * separate struct filename so we can dedicate the entire
160 : * names_cache allocation for the pathname, and re-do the copy from
161 : * userland.
162 : */
163 0 : if (unlikely(len == EMBEDDED_NAME_MAX)) {
164 0 : const size_t size = offsetof(struct filename, iname[1]);
165 0 : kname = (char *)result;
166 :
167 : /*
168 : * size is chosen that way we to guarantee that
169 : * result->iname[0] is within the same object and that
170 : * kname can't be equal to result->iname, no matter what.
171 : */
172 0 : result = kzalloc(size, GFP_KERNEL);
173 0 : if (unlikely(!result)) {
174 0 : __putname(kname);
175 0 : return ERR_PTR(-ENOMEM);
176 : }
177 0 : result->name = kname;
178 0 : len = strncpy_from_user(kname, filename, PATH_MAX);
179 0 : if (unlikely(len < 0)) {
180 0 : __putname(kname);
181 0 : kfree(result);
182 0 : return ERR_PTR(len);
183 : }
184 0 : if (unlikely(len == PATH_MAX)) {
185 0 : __putname(kname);
186 0 : kfree(result);
187 0 : return ERR_PTR(-ENAMETOOLONG);
188 : }
189 : }
190 :
191 0 : result->refcnt = 1;
192 : /* The empty path is special. */
193 0 : if (unlikely(!len)) {
194 0 : if (empty)
195 0 : *empty = 1;
196 0 : if (!(flags & LOOKUP_EMPTY)) {
197 0 : putname(result);
198 0 : return ERR_PTR(-ENOENT);
199 : }
200 : }
201 :
202 0 : result->uptr = filename;
203 0 : result->aname = NULL;
204 0 : audit_getname(result);
205 0 : return result;
206 : }
207 :
208 : struct filename *
209 0 : getname_uflags(const char __user *filename, int uflags)
210 : {
211 0 : int flags = (uflags & AT_EMPTY_PATH) ? LOOKUP_EMPTY : 0;
212 :
213 0 : return getname_flags(filename, flags, NULL);
214 : }
215 :
216 : struct filename *
217 0 : getname(const char __user * filename)
218 : {
219 0 : return getname_flags(filename, 0, NULL);
220 : }
221 :
222 : struct filename *
223 3 : getname_kernel(const char * filename)
224 : {
225 : struct filename *result;
226 3 : int len = strlen(filename) + 1;
227 :
228 3 : result = __getname();
229 3 : if (unlikely(!result))
230 : return ERR_PTR(-ENOMEM);
231 :
232 3 : if (len <= EMBEDDED_NAME_MAX) {
233 3 : result->name = (char *)result->iname;
234 0 : } else if (len <= PATH_MAX) {
235 0 : const size_t size = offsetof(struct filename, iname[1]);
236 : struct filename *tmp;
237 :
238 0 : tmp = kmalloc(size, GFP_KERNEL);
239 0 : if (unlikely(!tmp)) {
240 0 : __putname(result);
241 0 : return ERR_PTR(-ENOMEM);
242 : }
243 0 : tmp->name = (char *)result;
244 0 : result = tmp;
245 : } else {
246 0 : __putname(result);
247 0 : return ERR_PTR(-ENAMETOOLONG);
248 : }
249 3 : memcpy((char *)result->name, filename, len);
250 3 : result->uptr = NULL;
251 3 : result->aname = NULL;
252 3 : result->refcnt = 1;
253 3 : audit_getname(result);
254 :
255 3 : return result;
256 : }
257 : EXPORT_SYMBOL(getname_kernel);
258 :
259 3 : void putname(struct filename *name)
260 : {
261 3 : if (IS_ERR(name))
262 : return;
263 :
264 3 : BUG_ON(name->refcnt <= 0);
265 :
266 3 : if (--name->refcnt > 0)
267 : return;
268 :
269 3 : if (name->name != name->iname) {
270 0 : __putname(name->name);
271 0 : kfree(name);
272 : } else
273 3 : __putname(name);
274 : }
275 : EXPORT_SYMBOL(putname);
276 :
277 : /**
278 : * check_acl - perform ACL permission checking
279 : * @idmap: idmap of the mount the inode was found from
280 : * @inode: inode to check permissions on
281 : * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC ...)
282 : *
283 : * This function performs the ACL permission checking. Since this function
284 : * retrieve POSIX acls it needs to know whether it is called from a blocking or
285 : * non-blocking context and thus cares about the MAY_NOT_BLOCK bit.
286 : *
287 : * If the inode has been found through an idmapped mount the idmap of
288 : * the vfsmount must be passed through @idmap. This function will then take
289 : * care to map the inode according to @idmap before checking permissions.
290 : * On non-idmapped mounts or if permission checking is to be performed on the
291 : * raw inode simply passs @nop_mnt_idmap.
292 : */
293 : static int check_acl(struct mnt_idmap *idmap,
294 : struct inode *inode, int mask)
295 : {
296 : #ifdef CONFIG_FS_POSIX_ACL
297 : struct posix_acl *acl;
298 :
299 : if (mask & MAY_NOT_BLOCK) {
300 : acl = get_cached_acl_rcu(inode, ACL_TYPE_ACCESS);
301 : if (!acl)
302 : return -EAGAIN;
303 : /* no ->get_inode_acl() calls in RCU mode... */
304 : if (is_uncached_acl(acl))
305 : return -ECHILD;
306 : return posix_acl_permission(idmap, inode, acl, mask);
307 : }
308 :
309 : acl = get_inode_acl(inode, ACL_TYPE_ACCESS);
310 : if (IS_ERR(acl))
311 : return PTR_ERR(acl);
312 : if (acl) {
313 : int error = posix_acl_permission(idmap, inode, acl, mask);
314 : posix_acl_release(acl);
315 : return error;
316 : }
317 : #endif
318 :
319 : return -EAGAIN;
320 : }
321 :
322 : /**
323 : * acl_permission_check - perform basic UNIX permission checking
324 : * @idmap: idmap of the mount the inode was found from
325 : * @inode: inode to check permissions on
326 : * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC ...)
327 : *
328 : * This function performs the basic UNIX permission checking. Since this
329 : * function may retrieve POSIX acls it needs to know whether it is called from a
330 : * blocking or non-blocking context and thus cares about the MAY_NOT_BLOCK bit.
331 : *
332 : * If the inode has been found through an idmapped mount the idmap of
333 : * the vfsmount must be passed through @idmap. This function will then take
334 : * care to map the inode according to @idmap before checking permissions.
335 : * On non-idmapped mounts or if permission checking is to be performed on the
336 : * raw inode simply passs @nop_mnt_idmap.
337 : */
338 7 : static int acl_permission_check(struct mnt_idmap *idmap,
339 : struct inode *inode, int mask)
340 : {
341 7 : unsigned int mode = inode->i_mode;
342 : vfsuid_t vfsuid;
343 :
344 : /* Are we the owner? If so, ACL's don't matter */
345 7 : vfsuid = i_uid_into_vfsuid(idmap, inode);
346 14 : if (likely(vfsuid_eq_kuid(vfsuid, current_fsuid()))) {
347 7 : mask &= 7;
348 7 : mode >>= 6;
349 7 : return (mask & ~mode) ? -EACCES : 0;
350 : }
351 :
352 : /* Do we have ACL's? */
353 0 : if (IS_POSIXACL(inode) && (mode & S_IRWXG)) {
354 : int error = check_acl(idmap, inode, mask);
355 : if (error != -EAGAIN)
356 : return error;
357 : }
358 :
359 : /* Only RWX matters for group/other mode bits */
360 0 : mask &= 7;
361 :
362 : /*
363 : * Are the group permissions different from
364 : * the other permissions in the bits we care
365 : * about? Need to check group ownership if so.
366 : */
367 0 : if (mask & (mode ^ (mode >> 3))) {
368 0 : vfsgid_t vfsgid = i_gid_into_vfsgid(idmap, inode);
369 0 : if (vfsgid_in_group_p(vfsgid))
370 0 : mode >>= 3;
371 : }
372 :
373 : /* Bits in 'mode' clear that we require? */
374 0 : return (mask & ~mode) ? -EACCES : 0;
375 : }
376 :
377 : /**
378 : * generic_permission - check for access rights on a Posix-like filesystem
379 : * @idmap: idmap of the mount the inode was found from
380 : * @inode: inode to check access rights for
381 : * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC,
382 : * %MAY_NOT_BLOCK ...)
383 : *
384 : * Used to check for read/write/execute permissions on a file.
385 : * We use "fsuid" for this, letting us set arbitrary permissions
386 : * for filesystem access without changing the "normal" uids which
387 : * are used for other things.
388 : *
389 : * generic_permission is rcu-walk aware. It returns -ECHILD in case an rcu-walk
390 : * request cannot be satisfied (eg. requires blocking or too much complexity).
391 : * It would then be called again in ref-walk mode.
392 : *
393 : * If the inode has been found through an idmapped mount the idmap of
394 : * the vfsmount must be passed through @idmap. This function will then take
395 : * care to map the inode according to @idmap before checking permissions.
396 : * On non-idmapped mounts or if permission checking is to be performed on the
397 : * raw inode simply passs @nop_mnt_idmap.
398 : */
399 7 : int generic_permission(struct mnt_idmap *idmap, struct inode *inode,
400 : int mask)
401 : {
402 : int ret;
403 :
404 : /*
405 : * Do the basic permission checks.
406 : */
407 7 : ret = acl_permission_check(idmap, inode, mask);
408 7 : if (ret != -EACCES)
409 : return ret;
410 :
411 0 : if (S_ISDIR(inode->i_mode)) {
412 : /* DACs are overridable for directories */
413 0 : if (!(mask & MAY_WRITE))
414 0 : if (capable_wrt_inode_uidgid(idmap, inode,
415 : CAP_DAC_READ_SEARCH))
416 : return 0;
417 0 : if (capable_wrt_inode_uidgid(idmap, inode,
418 : CAP_DAC_OVERRIDE))
419 : return 0;
420 0 : return -EACCES;
421 : }
422 :
423 : /*
424 : * Searching includes executable on directories, else just read.
425 : */
426 0 : mask &= MAY_READ | MAY_WRITE | MAY_EXEC;
427 0 : if (mask == MAY_READ)
428 0 : if (capable_wrt_inode_uidgid(idmap, inode,
429 : CAP_DAC_READ_SEARCH))
430 : return 0;
431 : /*
432 : * Read/write DACs are always overridable.
433 : * Executable DACs are overridable when there is
434 : * at least one exec bit set.
435 : */
436 0 : if (!(mask & MAY_EXEC) || (inode->i_mode & S_IXUGO))
437 0 : if (capable_wrt_inode_uidgid(idmap, inode,
438 : CAP_DAC_OVERRIDE))
439 : return 0;
440 :
441 : return -EACCES;
442 : }
443 : EXPORT_SYMBOL(generic_permission);
444 :
445 : /**
446 : * do_inode_permission - UNIX permission checking
447 : * @idmap: idmap of the mount the inode was found from
448 : * @inode: inode to check permissions on
449 : * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC ...)
450 : *
451 : * We _really_ want to just do "generic_permission()" without
452 : * even looking at the inode->i_op values. So we keep a cache
453 : * flag in inode->i_opflags, that says "this has not special
454 : * permission function, use the fast case".
455 : */
456 7 : static inline int do_inode_permission(struct mnt_idmap *idmap,
457 : struct inode *inode, int mask)
458 : {
459 7 : if (unlikely(!(inode->i_opflags & IOP_FASTPERM))) {
460 2 : if (likely(inode->i_op->permission))
461 0 : return inode->i_op->permission(idmap, inode, mask);
462 :
463 : /* This gets set once for the inode lifetime */
464 4 : spin_lock(&inode->i_lock);
465 2 : inode->i_opflags |= IOP_FASTPERM;
466 2 : spin_unlock(&inode->i_lock);
467 : }
468 7 : return generic_permission(idmap, inode, mask);
469 : }
470 :
471 : /**
472 : * sb_permission - Check superblock-level permissions
473 : * @sb: Superblock of inode to check permission on
474 : * @inode: Inode to check permission on
475 : * @mask: Right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
476 : *
477 : * Separate out file-system wide checks from inode-specific permission checks.
478 : */
479 : static int sb_permission(struct super_block *sb, struct inode *inode, int mask)
480 : {
481 7 : if (unlikely(mask & MAY_WRITE)) {
482 3 : umode_t mode = inode->i_mode;
483 :
484 : /* Nobody gets write access to a read-only fs. */
485 6 : if (sb_rdonly(sb) && (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode)))
486 : return -EROFS;
487 : }
488 : return 0;
489 : }
490 :
491 : /**
492 : * inode_permission - Check for access rights to a given inode
493 : * @idmap: idmap of the mount the inode was found from
494 : * @inode: Inode to check permission on
495 : * @mask: Right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC)
496 : *
497 : * Check for read/write/execute permissions on an inode. We use fs[ug]id for
498 : * this, letting us set arbitrary permissions for filesystem access without
499 : * changing the "normal" UIDs which are used for other things.
500 : *
501 : * When checking for MAY_APPEND, MAY_WRITE must also be set in @mask.
502 : */
503 7 : int inode_permission(struct mnt_idmap *idmap,
504 : struct inode *inode, int mask)
505 : {
506 : int retval;
507 :
508 14 : retval = sb_permission(inode->i_sb, inode, mask);
509 7 : if (retval)
510 : return retval;
511 :
512 7 : if (unlikely(mask & MAY_WRITE)) {
513 : /*
514 : * Nobody gets write access to an immutable file.
515 : */
516 3 : if (IS_IMMUTABLE(inode))
517 : return -EPERM;
518 :
519 : /*
520 : * Updating mtime will likely cause i_uid and i_gid to be
521 : * written back improperly if their true value is unknown
522 : * to the vfs.
523 : */
524 3 : if (HAS_UNMAPPED_ID(idmap, inode))
525 : return -EACCES;
526 : }
527 :
528 7 : retval = do_inode_permission(idmap, inode, mask);
529 7 : if (retval)
530 : return retval;
531 :
532 7 : retval = devcgroup_inode_permission(inode, mask);
533 : if (retval)
534 : return retval;
535 :
536 7 : return security_inode_permission(inode, mask);
537 : }
538 : EXPORT_SYMBOL(inode_permission);
539 :
540 : /**
541 : * path_get - get a reference to a path
542 : * @path: path to get the reference to
543 : *
544 : * Given a path increment the reference count to the dentry and the vfsmount.
545 : */
546 2 : void path_get(const struct path *path)
547 : {
548 2 : mntget(path->mnt);
549 4 : dget(path->dentry);
550 2 : }
551 : EXPORT_SYMBOL(path_get);
552 :
553 : /**
554 : * path_put - put a reference to a path
555 : * @path: path to put the reference to
556 : *
557 : * Given a path decrement the reference count to the dentry and the vfsmount.
558 : */
559 0 : void path_put(const struct path *path)
560 : {
561 6 : dput(path->dentry);
562 6 : mntput(path->mnt);
563 0 : }
564 : EXPORT_SYMBOL(path_put);
565 :
566 : #define EMBEDDED_LEVELS 2
567 : struct nameidata {
568 : struct path path;
569 : struct qstr last;
570 : struct path root;
571 : struct inode *inode; /* path.dentry.d_inode */
572 : unsigned int flags, state;
573 : unsigned seq, next_seq, m_seq, r_seq;
574 : int last_type;
575 : unsigned depth;
576 : int total_link_count;
577 : struct saved {
578 : struct path link;
579 : struct delayed_call done;
580 : const char *name;
581 : unsigned seq;
582 : } *stack, internal[EMBEDDED_LEVELS];
583 : struct filename *name;
584 : struct nameidata *saved;
585 : unsigned root_seq;
586 : int dfd;
587 : vfsuid_t dir_vfsuid;
588 : umode_t dir_mode;
589 : } __randomize_layout;
590 :
591 : #define ND_ROOT_PRESET 1
592 : #define ND_ROOT_GRABBED 2
593 : #define ND_JUMPED 4
594 :
595 : static void __set_nameidata(struct nameidata *p, int dfd, struct filename *name)
596 : {
597 3 : struct nameidata *old = current->nameidata;
598 3 : p->stack = p->internal;
599 3 : p->depth = 0;
600 3 : p->dfd = dfd;
601 3 : p->name = name;
602 3 : p->path.mnt = NULL;
603 3 : p->path.dentry = NULL;
604 3 : p->total_link_count = old ? old->total_link_count : 0;
605 3 : p->saved = old;
606 3 : current->nameidata = p;
607 : }
608 :
609 : static inline void set_nameidata(struct nameidata *p, int dfd, struct filename *name,
610 : const struct path *root)
611 : {
612 3 : __set_nameidata(p, dfd, name);
613 3 : p->state = 0;
614 3 : if (unlikely(root)) {
615 0 : p->state = ND_ROOT_PRESET;
616 0 : p->root = *root;
617 : }
618 : }
619 :
620 3 : static void restore_nameidata(void)
621 : {
622 3 : struct nameidata *now = current->nameidata, *old = now->saved;
623 :
624 3 : current->nameidata = old;
625 3 : if (old)
626 0 : old->total_link_count = now->total_link_count;
627 3 : if (now->stack != now->internal)
628 0 : kfree(now->stack);
629 3 : }
630 :
631 0 : static bool nd_alloc_stack(struct nameidata *nd)
632 : {
633 : struct saved *p;
634 :
635 0 : p= kmalloc_array(MAXSYMLINKS, sizeof(struct saved),
636 0 : nd->flags & LOOKUP_RCU ? GFP_ATOMIC : GFP_KERNEL);
637 0 : if (unlikely(!p))
638 : return false;
639 0 : memcpy(p, nd->internal, sizeof(nd->internal));
640 0 : nd->stack = p;
641 0 : return true;
642 : }
643 :
644 : /**
645 : * path_connected - Verify that a dentry is below mnt.mnt_root
646 : *
647 : * Rename can sometimes move a file or directory outside of a bind
648 : * mount, path_connected allows those cases to be detected.
649 : */
650 : static bool path_connected(struct vfsmount *mnt, struct dentry *dentry)
651 : {
652 0 : struct super_block *sb = mnt->mnt_sb;
653 :
654 : /* Bind mounts can have disconnected paths */
655 0 : if (mnt->mnt_root == sb->s_root)
656 : return true;
657 :
658 0 : return is_subdir(dentry, mnt->mnt_root);
659 : }
660 :
661 : static void drop_links(struct nameidata *nd)
662 : {
663 3 : int i = nd->depth;
664 3 : while (i--) {
665 0 : struct saved *last = nd->stack + i;
666 0 : do_delayed_call(&last->done);
667 0 : clear_delayed_call(&last->done);
668 : }
669 : }
670 :
671 : static void leave_rcu(struct nameidata *nd)
672 : {
673 3 : nd->flags &= ~LOOKUP_RCU;
674 3 : nd->seq = nd->next_seq = 0;
675 : rcu_read_unlock();
676 : }
677 :
678 3 : static void terminate_walk(struct nameidata *nd)
679 : {
680 6 : drop_links(nd);
681 3 : if (!(nd->flags & LOOKUP_RCU)) {
682 : int i;
683 6 : path_put(&nd->path);
684 3 : for (i = 0; i < nd->depth; i++)
685 0 : path_put(&nd->stack[i].link);
686 3 : if (nd->state & ND_ROOT_GRABBED) {
687 0 : path_put(&nd->root);
688 0 : nd->state &= ~ND_ROOT_GRABBED;
689 : }
690 : } else {
691 : leave_rcu(nd);
692 : }
693 3 : nd->depth = 0;
694 3 : nd->path.mnt = NULL;
695 3 : nd->path.dentry = NULL;
696 3 : }
697 :
698 : /* path_put is needed afterwards regardless of success or failure */
699 3 : static bool __legitimize_path(struct path *path, unsigned seq, unsigned mseq)
700 : {
701 3 : int res = __legitimize_mnt(path->mnt, mseq);
702 3 : if (unlikely(res)) {
703 0 : if (res > 0)
704 0 : path->mnt = NULL;
705 0 : path->dentry = NULL;
706 0 : return false;
707 : }
708 3 : if (unlikely(!lockref_get_not_dead(&path->dentry->d_lockref))) {
709 0 : path->dentry = NULL;
710 0 : return false;
711 : }
712 9 : return !read_seqcount_retry(&path->dentry->d_seq, seq);
713 : }
714 :
715 : static inline bool legitimize_path(struct nameidata *nd,
716 : struct path *path, unsigned seq)
717 : {
718 3 : return __legitimize_path(path, seq, nd->m_seq);
719 : }
720 :
721 3 : static bool legitimize_links(struct nameidata *nd)
722 : {
723 : int i;
724 3 : if (unlikely(nd->flags & LOOKUP_CACHED)) {
725 0 : drop_links(nd);
726 0 : nd->depth = 0;
727 0 : return false;
728 : }
729 0 : for (i = 0; i < nd->depth; i++) {
730 0 : struct saved *last = nd->stack + i;
731 0 : if (unlikely(!legitimize_path(nd, &last->link, last->seq))) {
732 0 : drop_links(nd);
733 0 : nd->depth = i + 1;
734 0 : return false;
735 : }
736 : }
737 : return true;
738 : }
739 :
740 3 : static bool legitimize_root(struct nameidata *nd)
741 : {
742 : /* Nothing to do if nd->root is zero or is managed by the VFS user. */
743 3 : if (!nd->root.mnt || (nd->state & ND_ROOT_PRESET))
744 : return true;
745 0 : nd->state |= ND_ROOT_GRABBED;
746 0 : return legitimize_path(nd, &nd->root, nd->root_seq);
747 : }
748 :
749 : /*
750 : * Path walking has 2 modes, rcu-walk and ref-walk (see
751 : * Documentation/filesystems/path-lookup.txt). In situations when we can't
752 : * continue in RCU mode, we attempt to drop out of rcu-walk mode and grab
753 : * normal reference counts on dentries and vfsmounts to transition to ref-walk
754 : * mode. Refcounts are grabbed at the last known good point before rcu-walk
755 : * got stuck, so ref-walk may continue from there. If this is not successful
756 : * (eg. a seqcount has changed), then failure is returned and it's up to caller
757 : * to restart the path walk from the beginning in ref-walk mode.
758 : */
759 :
760 : /**
761 : * try_to_unlazy - try to switch to ref-walk mode.
762 : * @nd: nameidata pathwalk data
763 : * Returns: true on success, false on failure
764 : *
765 : * try_to_unlazy attempts to legitimize the current nd->path and nd->root
766 : * for ref-walk mode.
767 : * Must be called from rcu-walk context.
768 : * Nothing should touch nameidata between try_to_unlazy() failure and
769 : * terminate_walk().
770 : */
771 3 : static bool try_to_unlazy(struct nameidata *nd)
772 : {
773 3 : struct dentry *parent = nd->path.dentry;
774 :
775 3 : BUG_ON(!(nd->flags & LOOKUP_RCU));
776 :
777 3 : if (unlikely(!legitimize_links(nd)))
778 : goto out1;
779 6 : if (unlikely(!legitimize_path(nd, &nd->path, nd->seq)))
780 : goto out;
781 3 : if (unlikely(!legitimize_root(nd)))
782 : goto out;
783 3 : leave_rcu(nd);
784 3 : BUG_ON(nd->inode != parent->d_inode);
785 : return true;
786 :
787 : out1:
788 0 : nd->path.mnt = NULL;
789 0 : nd->path.dentry = NULL;
790 : out:
791 0 : leave_rcu(nd);
792 0 : return false;
793 : }
794 :
795 : /**
796 : * try_to_unlazy_next - try to switch to ref-walk mode.
797 : * @nd: nameidata pathwalk data
798 : * @dentry: next dentry to step into
799 : * Returns: true on success, false on failure
800 : *
801 : * Similar to try_to_unlazy(), but here we have the next dentry already
802 : * picked by rcu-walk and want to legitimize that in addition to the current
803 : * nd->path and nd->root for ref-walk mode. Must be called from rcu-walk context.
804 : * Nothing should touch nameidata between try_to_unlazy_next() failure and
805 : * terminate_walk().
806 : */
807 0 : static bool try_to_unlazy_next(struct nameidata *nd, struct dentry *dentry)
808 : {
809 : int res;
810 0 : BUG_ON(!(nd->flags & LOOKUP_RCU));
811 :
812 0 : if (unlikely(!legitimize_links(nd)))
813 : goto out2;
814 0 : res = __legitimize_mnt(nd->path.mnt, nd->m_seq);
815 0 : if (unlikely(res)) {
816 0 : if (res > 0)
817 : goto out2;
818 : goto out1;
819 : }
820 0 : if (unlikely(!lockref_get_not_dead(&nd->path.dentry->d_lockref)))
821 : goto out1;
822 :
823 : /*
824 : * We need to move both the parent and the dentry from the RCU domain
825 : * to be properly refcounted. And the sequence number in the dentry
826 : * validates *both* dentry counters, since we checked the sequence
827 : * number of the parent after we got the child sequence number. So we
828 : * know the parent must still be valid if the child sequence number is
829 : */
830 0 : if (unlikely(!lockref_get_not_dead(&dentry->d_lockref)))
831 : goto out;
832 0 : if (read_seqcount_retry(&dentry->d_seq, nd->next_seq))
833 : goto out_dput;
834 : /*
835 : * Sequence counts matched. Now make sure that the root is
836 : * still valid and get it if required.
837 : */
838 0 : if (unlikely(!legitimize_root(nd)))
839 : goto out_dput;
840 0 : leave_rcu(nd);
841 0 : return true;
842 :
843 : out2:
844 0 : nd->path.mnt = NULL;
845 : out1:
846 0 : nd->path.dentry = NULL;
847 : out:
848 0 : leave_rcu(nd);
849 0 : return false;
850 : out_dput:
851 0 : leave_rcu(nd);
852 0 : dput(dentry);
853 0 : return false;
854 : }
855 :
856 : static inline int d_revalidate(struct dentry *dentry, unsigned int flags)
857 : {
858 1 : if (unlikely(dentry->d_flags & DCACHE_OP_REVALIDATE))
859 0 : return dentry->d_op->d_revalidate(dentry, flags);
860 : else
861 : return 1;
862 : }
863 :
864 : /**
865 : * complete_walk - successful completion of path walk
866 : * @nd: pointer nameidata
867 : *
868 : * If we had been in RCU mode, drop out of it and legitimize nd->path.
869 : * Revalidate the final result, unless we'd already done that during
870 : * the path walk or the filesystem doesn't ask for it. Return 0 on
871 : * success, -error on failure. In case of failure caller does not
872 : * need to drop nd->path.
873 : */
874 3 : static int complete_walk(struct nameidata *nd)
875 : {
876 3 : struct dentry *dentry = nd->path.dentry;
877 : int status;
878 :
879 3 : if (nd->flags & LOOKUP_RCU) {
880 : /*
881 : * We don't want to zero nd->root for scoped-lookups or
882 : * externally-managed nd->root.
883 : */
884 3 : if (!(nd->state & ND_ROOT_PRESET))
885 3 : if (!(nd->flags & LOOKUP_IS_SCOPED))
886 3 : nd->root.mnt = NULL;
887 3 : nd->flags &= ~LOOKUP_CACHED;
888 3 : if (!try_to_unlazy(nd))
889 : return -ECHILD;
890 : }
891 :
892 3 : if (unlikely(nd->flags & LOOKUP_IS_SCOPED)) {
893 : /*
894 : * While the guarantee of LOOKUP_IS_SCOPED is (roughly) "don't
895 : * ever step outside the root during lookup" and should already
896 : * be guaranteed by the rest of namei, we want to avoid a namei
897 : * BUG resulting in userspace being given a path that was not
898 : * scoped within the root at some point during the lookup.
899 : *
900 : * So, do a final sanity-check to make sure that in the
901 : * worst-case scenario (a complete bypass of LOOKUP_IS_SCOPED)
902 : * we won't silently return an fd completely outside of the
903 : * requested root to userspace.
904 : *
905 : * Userspace could move the path outside the root after this
906 : * check, but as discussed elsewhere this is not a concern (the
907 : * resolved file was inside the root at some point).
908 : */
909 0 : if (!path_is_under(&nd->path, &nd->root))
910 : return -EXDEV;
911 : }
912 :
913 3 : if (likely(!(nd->state & ND_JUMPED)))
914 : return 0;
915 :
916 0 : if (likely(!(dentry->d_flags & DCACHE_OP_WEAK_REVALIDATE)))
917 : return 0;
918 :
919 0 : status = dentry->d_op->d_weak_revalidate(dentry, nd->flags);
920 0 : if (status > 0)
921 : return 0;
922 :
923 0 : if (!status)
924 0 : status = -ESTALE;
925 :
926 : return status;
927 : }
928 :
929 3 : static int set_root(struct nameidata *nd)
930 : {
931 3 : struct fs_struct *fs = current->fs;
932 :
933 : /*
934 : * Jumping to the real root in a scoped-lookup is a BUG in namei, but we
935 : * still have to ensure it doesn't happen because it will cause a breakout
936 : * from the dirfd.
937 : */
938 3 : if (WARN_ON(nd->flags & LOOKUP_IS_SCOPED))
939 : return -ENOTRECOVERABLE;
940 :
941 3 : if (nd->flags & LOOKUP_RCU) {
942 : unsigned seq;
943 :
944 : do {
945 6 : seq = read_seqcount_begin(&fs->seq);
946 3 : nd->root = fs->root;
947 9 : nd->root_seq = __read_seqcount_begin(&nd->root.dentry->d_seq);
948 9 : } while (read_seqcount_retry(&fs->seq, seq));
949 : } else {
950 0 : get_fs_root(fs, &nd->root);
951 0 : nd->state |= ND_ROOT_GRABBED;
952 : }
953 : return 0;
954 : }
955 :
956 3 : static int nd_jump_root(struct nameidata *nd)
957 : {
958 3 : if (unlikely(nd->flags & LOOKUP_BENEATH))
959 : return -EXDEV;
960 3 : if (unlikely(nd->flags & LOOKUP_NO_XDEV)) {
961 : /* Absolute path arguments to path_init() are allowed. */
962 0 : if (nd->path.mnt != NULL && nd->path.mnt != nd->root.mnt)
963 : return -EXDEV;
964 : }
965 3 : if (!nd->root.mnt) {
966 3 : int error = set_root(nd);
967 3 : if (error)
968 : return error;
969 : }
970 3 : if (nd->flags & LOOKUP_RCU) {
971 : struct dentry *d;
972 3 : nd->path = nd->root;
973 3 : d = nd->path.dentry;
974 3 : nd->inode = d->d_inode;
975 3 : nd->seq = nd->root_seq;
976 9 : if (read_seqcount_retry(&d->d_seq, nd->seq))
977 : return -ECHILD;
978 : } else {
979 0 : path_put(&nd->path);
980 0 : nd->path = nd->root;
981 0 : path_get(&nd->path);
982 0 : nd->inode = nd->path.dentry->d_inode;
983 : }
984 3 : nd->state |= ND_JUMPED;
985 3 : return 0;
986 : }
987 :
988 : /*
989 : * Helper to directly jump to a known parsed path from ->get_link,
990 : * caller must have taken a reference to path beforehand.
991 : */
992 0 : int nd_jump_link(const struct path *path)
993 : {
994 0 : int error = -ELOOP;
995 0 : struct nameidata *nd = current->nameidata;
996 :
997 0 : if (unlikely(nd->flags & LOOKUP_NO_MAGICLINKS))
998 : goto err;
999 :
1000 0 : error = -EXDEV;
1001 0 : if (unlikely(nd->flags & LOOKUP_NO_XDEV)) {
1002 0 : if (nd->path.mnt != path->mnt)
1003 : goto err;
1004 : }
1005 : /* Not currently safe for scoped-lookups. */
1006 0 : if (unlikely(nd->flags & LOOKUP_IS_SCOPED))
1007 : goto err;
1008 :
1009 0 : path_put(&nd->path);
1010 0 : nd->path = *path;
1011 0 : nd->inode = nd->path.dentry->d_inode;
1012 0 : nd->state |= ND_JUMPED;
1013 0 : return 0;
1014 :
1015 : err:
1016 0 : path_put(path);
1017 0 : return error;
1018 : }
1019 :
1020 0 : static inline void put_link(struct nameidata *nd)
1021 : {
1022 0 : struct saved *last = nd->stack + --nd->depth;
1023 0 : do_delayed_call(&last->done);
1024 0 : if (!(nd->flags & LOOKUP_RCU))
1025 0 : path_put(&last->link);
1026 0 : }
1027 :
1028 : static int sysctl_protected_symlinks __read_mostly;
1029 : static int sysctl_protected_hardlinks __read_mostly;
1030 : static int sysctl_protected_fifos __read_mostly;
1031 : static int sysctl_protected_regular __read_mostly;
1032 :
1033 : #ifdef CONFIG_SYSCTL
1034 : static struct ctl_table namei_sysctls[] = {
1035 : {
1036 : .procname = "protected_symlinks",
1037 : .data = &sysctl_protected_symlinks,
1038 : .maxlen = sizeof(int),
1039 : .mode = 0644,
1040 : .proc_handler = proc_dointvec_minmax,
1041 : .extra1 = SYSCTL_ZERO,
1042 : .extra2 = SYSCTL_ONE,
1043 : },
1044 : {
1045 : .procname = "protected_hardlinks",
1046 : .data = &sysctl_protected_hardlinks,
1047 : .maxlen = sizeof(int),
1048 : .mode = 0644,
1049 : .proc_handler = proc_dointvec_minmax,
1050 : .extra1 = SYSCTL_ZERO,
1051 : .extra2 = SYSCTL_ONE,
1052 : },
1053 : {
1054 : .procname = "protected_fifos",
1055 : .data = &sysctl_protected_fifos,
1056 : .maxlen = sizeof(int),
1057 : .mode = 0644,
1058 : .proc_handler = proc_dointvec_minmax,
1059 : .extra1 = SYSCTL_ZERO,
1060 : .extra2 = SYSCTL_TWO,
1061 : },
1062 : {
1063 : .procname = "protected_regular",
1064 : .data = &sysctl_protected_regular,
1065 : .maxlen = sizeof(int),
1066 : .mode = 0644,
1067 : .proc_handler = proc_dointvec_minmax,
1068 : .extra1 = SYSCTL_ZERO,
1069 : .extra2 = SYSCTL_TWO,
1070 : },
1071 : { }
1072 : };
1073 :
1074 1 : static int __init init_fs_namei_sysctls(void)
1075 : {
1076 1 : register_sysctl_init("fs", namei_sysctls);
1077 1 : return 0;
1078 : }
1079 : fs_initcall(init_fs_namei_sysctls);
1080 :
1081 : #endif /* CONFIG_SYSCTL */
1082 :
1083 : /**
1084 : * may_follow_link - Check symlink following for unsafe situations
1085 : * @nd: nameidata pathwalk data
1086 : *
1087 : * In the case of the sysctl_protected_symlinks sysctl being enabled,
1088 : * CAP_DAC_OVERRIDE needs to be specifically ignored if the symlink is
1089 : * in a sticky world-writable directory. This is to protect privileged
1090 : * processes from failing races against path names that may change out
1091 : * from under them by way of other users creating malicious symlinks.
1092 : * It will permit symlinks to be followed only when outside a sticky
1093 : * world-writable directory, or when the uid of the symlink and follower
1094 : * match, or when the directory owner matches the symlink's owner.
1095 : *
1096 : * Returns 0 if following the symlink is allowed, -ve on error.
1097 : */
1098 0 : static inline int may_follow_link(struct nameidata *nd, const struct inode *inode)
1099 : {
1100 : struct mnt_idmap *idmap;
1101 : vfsuid_t vfsuid;
1102 :
1103 0 : if (!sysctl_protected_symlinks)
1104 : return 0;
1105 :
1106 0 : idmap = mnt_idmap(nd->path.mnt);
1107 0 : vfsuid = i_uid_into_vfsuid(idmap, inode);
1108 : /* Allowed if owner and follower match. */
1109 0 : if (vfsuid_eq_kuid(vfsuid, current_fsuid()))
1110 : return 0;
1111 :
1112 : /* Allowed if parent directory not sticky and world-writable. */
1113 0 : if ((nd->dir_mode & (S_ISVTX|S_IWOTH)) != (S_ISVTX|S_IWOTH))
1114 : return 0;
1115 :
1116 : /* Allowed if parent directory and link owner match. */
1117 0 : if (vfsuid_valid(nd->dir_vfsuid) && vfsuid_eq(nd->dir_vfsuid, vfsuid))
1118 : return 0;
1119 :
1120 0 : if (nd->flags & LOOKUP_RCU)
1121 : return -ECHILD;
1122 :
1123 0 : audit_inode(nd->name, nd->stack[0].link.dentry, 0);
1124 0 : audit_log_path_denied(AUDIT_ANOM_LINK, "follow_link");
1125 0 : return -EACCES;
1126 : }
1127 :
1128 : /**
1129 : * safe_hardlink_source - Check for safe hardlink conditions
1130 : * @idmap: idmap of the mount the inode was found from
1131 : * @inode: the source inode to hardlink from
1132 : *
1133 : * Return false if at least one of the following conditions:
1134 : * - inode is not a regular file
1135 : * - inode is setuid
1136 : * - inode is setgid and group-exec
1137 : * - access failure for read and write
1138 : *
1139 : * Otherwise returns true.
1140 : */
1141 0 : static bool safe_hardlink_source(struct mnt_idmap *idmap,
1142 : struct inode *inode)
1143 : {
1144 0 : umode_t mode = inode->i_mode;
1145 :
1146 : /* Special files should not get pinned to the filesystem. */
1147 0 : if (!S_ISREG(mode))
1148 : return false;
1149 :
1150 : /* Setuid files should not get pinned to the filesystem. */
1151 0 : if (mode & S_ISUID)
1152 : return false;
1153 :
1154 : /* Executable setgid files should not get pinned to the filesystem. */
1155 0 : if ((mode & (S_ISGID | S_IXGRP)) == (S_ISGID | S_IXGRP))
1156 : return false;
1157 :
1158 : /* Hardlinking to unreadable or unwritable sources is dangerous. */
1159 0 : if (inode_permission(idmap, inode, MAY_READ | MAY_WRITE))
1160 : return false;
1161 :
1162 0 : return true;
1163 : }
1164 :
1165 : /**
1166 : * may_linkat - Check permissions for creating a hardlink
1167 : * @idmap: idmap of the mount the inode was found from
1168 : * @link: the source to hardlink from
1169 : *
1170 : * Block hardlink when all of:
1171 : * - sysctl_protected_hardlinks enabled
1172 : * - fsuid does not match inode
1173 : * - hardlink source is unsafe (see safe_hardlink_source() above)
1174 : * - not CAP_FOWNER in a namespace with the inode owner uid mapped
1175 : *
1176 : * If the inode has been found through an idmapped mount the idmap of
1177 : * the vfsmount must be passed through @idmap. This function will then take
1178 : * care to map the inode according to @idmap before checking permissions.
1179 : * On non-idmapped mounts or if permission checking is to be performed on the
1180 : * raw inode simply pass @nop_mnt_idmap.
1181 : *
1182 : * Returns 0 if successful, -ve on error.
1183 : */
1184 0 : int may_linkat(struct mnt_idmap *idmap, const struct path *link)
1185 : {
1186 0 : struct inode *inode = link->dentry->d_inode;
1187 :
1188 : /* Inode writeback is not safe when the uid or gid are invalid. */
1189 0 : if (!vfsuid_valid(i_uid_into_vfsuid(idmap, inode)) ||
1190 0 : !vfsgid_valid(i_gid_into_vfsgid(idmap, inode)))
1191 : return -EOVERFLOW;
1192 :
1193 0 : if (!sysctl_protected_hardlinks)
1194 : return 0;
1195 :
1196 : /* Source inode owner (or CAP_FOWNER) can hardlink all they like,
1197 : * otherwise, it must be a safe source.
1198 : */
1199 0 : if (safe_hardlink_source(idmap, inode) ||
1200 0 : inode_owner_or_capable(idmap, inode))
1201 : return 0;
1202 :
1203 : audit_log_path_denied(AUDIT_ANOM_LINK, "linkat");
1204 : return -EPERM;
1205 : }
1206 :
1207 : /**
1208 : * may_create_in_sticky - Check whether an O_CREAT open in a sticky directory
1209 : * should be allowed, or not, on files that already
1210 : * exist.
1211 : * @idmap: idmap of the mount the inode was found from
1212 : * @nd: nameidata pathwalk data
1213 : * @inode: the inode of the file to open
1214 : *
1215 : * Block an O_CREAT open of a FIFO (or a regular file) when:
1216 : * - sysctl_protected_fifos (or sysctl_protected_regular) is enabled
1217 : * - the file already exists
1218 : * - we are in a sticky directory
1219 : * - we don't own the file
1220 : * - the owner of the directory doesn't own the file
1221 : * - the directory is world writable
1222 : * If the sysctl_protected_fifos (or sysctl_protected_regular) is set to 2
1223 : * the directory doesn't have to be world writable: being group writable will
1224 : * be enough.
1225 : *
1226 : * If the inode has been found through an idmapped mount the idmap of
1227 : * the vfsmount must be passed through @idmap. This function will then take
1228 : * care to map the inode according to @idmap before checking permissions.
1229 : * On non-idmapped mounts or if permission checking is to be performed on the
1230 : * raw inode simply pass @nop_mnt_idmap.
1231 : *
1232 : * Returns 0 if the open is allowed, -ve on error.
1233 : */
1234 0 : static int may_create_in_sticky(struct mnt_idmap *idmap,
1235 : struct nameidata *nd, struct inode *const inode)
1236 : {
1237 0 : umode_t dir_mode = nd->dir_mode;
1238 0 : vfsuid_t dir_vfsuid = nd->dir_vfsuid;
1239 :
1240 0 : if ((!sysctl_protected_fifos && S_ISFIFO(inode->i_mode)) ||
1241 0 : (!sysctl_protected_regular && S_ISREG(inode->i_mode)) ||
1242 0 : likely(!(dir_mode & S_ISVTX)) ||
1243 0 : vfsuid_eq(i_uid_into_vfsuid(idmap, inode), dir_vfsuid) ||
1244 0 : vfsuid_eq_kuid(i_uid_into_vfsuid(idmap, inode), current_fsuid()))
1245 : return 0;
1246 :
1247 0 : if (likely(dir_mode & 0002) ||
1248 0 : (dir_mode & 0020 &&
1249 0 : ((sysctl_protected_fifos >= 2 && S_ISFIFO(inode->i_mode)) ||
1250 0 : (sysctl_protected_regular >= 2 && S_ISREG(inode->i_mode))))) {
1251 0 : const char *operation = S_ISFIFO(inode->i_mode) ?
1252 : "sticky_create_fifo" :
1253 : "sticky_create_regular";
1254 : audit_log_path_denied(AUDIT_ANOM_CREAT, operation);
1255 : return -EACCES;
1256 : }
1257 : return 0;
1258 : }
1259 :
1260 : /*
1261 : * follow_up - Find the mountpoint of path's vfsmount
1262 : *
1263 : * Given a path, find the mountpoint of its source file system.
1264 : * Replace @path with the path of the mountpoint in the parent mount.
1265 : * Up is towards /.
1266 : *
1267 : * Return 1 if we went up a level and 0 if we were already at the
1268 : * root.
1269 : */
1270 0 : int follow_up(struct path *path)
1271 : {
1272 0 : struct mount *mnt = real_mount(path->mnt);
1273 : struct mount *parent;
1274 : struct dentry *mountpoint;
1275 :
1276 0 : read_seqlock_excl(&mount_lock);
1277 0 : parent = mnt->mnt_parent;
1278 0 : if (parent == mnt) {
1279 0 : read_sequnlock_excl(&mount_lock);
1280 0 : return 0;
1281 : }
1282 0 : mntget(&parent->mnt);
1283 0 : mountpoint = dget(mnt->mnt_mountpoint);
1284 0 : read_sequnlock_excl(&mount_lock);
1285 0 : dput(path->dentry);
1286 0 : path->dentry = mountpoint;
1287 0 : mntput(path->mnt);
1288 0 : path->mnt = &parent->mnt;
1289 0 : return 1;
1290 : }
1291 : EXPORT_SYMBOL(follow_up);
1292 :
1293 : static bool choose_mountpoint_rcu(struct mount *m, const struct path *root,
1294 : struct path *path, unsigned *seqp)
1295 : {
1296 0 : while (mnt_has_parent(m)) {
1297 0 : struct dentry *mountpoint = m->mnt_mountpoint;
1298 :
1299 0 : m = m->mnt_parent;
1300 0 : if (unlikely(root->dentry == mountpoint &&
1301 : root->mnt == &m->mnt))
1302 : break;
1303 0 : if (mountpoint != m->mnt.mnt_root) {
1304 0 : path->mnt = &m->mnt;
1305 0 : path->dentry = mountpoint;
1306 0 : *seqp = read_seqcount_begin(&mountpoint->d_seq);
1307 : return true;
1308 : }
1309 : }
1310 : return false;
1311 : }
1312 :
1313 0 : static bool choose_mountpoint(struct mount *m, const struct path *root,
1314 : struct path *path)
1315 : {
1316 : bool found;
1317 :
1318 : rcu_read_lock();
1319 : while (1) {
1320 0 : unsigned seq, mseq = read_seqbegin(&mount_lock);
1321 :
1322 0 : found = choose_mountpoint_rcu(m, root, path, &seq);
1323 0 : if (unlikely(!found)) {
1324 0 : if (!read_seqretry(&mount_lock, mseq))
1325 : break;
1326 : } else {
1327 0 : if (likely(__legitimize_path(path, seq, mseq)))
1328 : break;
1329 0 : rcu_read_unlock();
1330 0 : path_put(path);
1331 : rcu_read_lock();
1332 : }
1333 : }
1334 : rcu_read_unlock();
1335 0 : return found;
1336 : }
1337 :
1338 : /*
1339 : * Perform an automount
1340 : * - return -EISDIR to tell follow_managed() to stop and return the path we
1341 : * were called with.
1342 : */
1343 0 : static int follow_automount(struct path *path, int *count, unsigned lookup_flags)
1344 : {
1345 0 : struct dentry *dentry = path->dentry;
1346 :
1347 : /* We don't want to mount if someone's just doing a stat -
1348 : * unless they're stat'ing a directory and appended a '/' to
1349 : * the name.
1350 : *
1351 : * We do, however, want to mount if someone wants to open or
1352 : * create a file of any type under the mountpoint, wants to
1353 : * traverse through the mountpoint or wants to open the
1354 : * mounted directory. Also, autofs may mark negative dentries
1355 : * as being automount points. These will need the attentions
1356 : * of the daemon to instantiate them before they can be used.
1357 : */
1358 0 : if (!(lookup_flags & (LOOKUP_PARENT | LOOKUP_DIRECTORY |
1359 0 : LOOKUP_OPEN | LOOKUP_CREATE | LOOKUP_AUTOMOUNT)) &&
1360 0 : dentry->d_inode)
1361 : return -EISDIR;
1362 :
1363 0 : if (count && (*count)++ >= MAXSYMLINKS)
1364 : return -ELOOP;
1365 :
1366 0 : return finish_automount(dentry->d_op->d_automount(path), path);
1367 : }
1368 :
1369 : /*
1370 : * mount traversal - out-of-line part. One note on ->d_flags accesses -
1371 : * dentries are pinned but not locked here, so negative dentry can go
1372 : * positive right under us. Use of smp_load_acquire() provides a barrier
1373 : * sufficient for ->d_inode and ->d_flags consistency.
1374 : */
1375 0 : static int __traverse_mounts(struct path *path, unsigned flags, bool *jumped,
1376 : int *count, unsigned lookup_flags)
1377 : {
1378 0 : struct vfsmount *mnt = path->mnt;
1379 0 : bool need_mntput = false;
1380 0 : int ret = 0;
1381 :
1382 0 : while (flags & DCACHE_MANAGED_DENTRY) {
1383 : /* Allow the filesystem to manage the transit without i_mutex
1384 : * being held. */
1385 0 : if (flags & DCACHE_MANAGE_TRANSIT) {
1386 0 : ret = path->dentry->d_op->d_manage(path, false);
1387 0 : flags = smp_load_acquire(&path->dentry->d_flags);
1388 0 : if (ret < 0)
1389 : break;
1390 : }
1391 :
1392 0 : if (flags & DCACHE_MOUNTED) { // something's mounted on it..
1393 0 : struct vfsmount *mounted = lookup_mnt(path);
1394 0 : if (mounted) { // ... in our namespace
1395 0 : dput(path->dentry);
1396 0 : if (need_mntput)
1397 0 : mntput(path->mnt);
1398 0 : path->mnt = mounted;
1399 0 : path->dentry = dget(mounted->mnt_root);
1400 : // here we know it's positive
1401 0 : flags = path->dentry->d_flags;
1402 0 : need_mntput = true;
1403 0 : continue;
1404 : }
1405 : }
1406 :
1407 0 : if (!(flags & DCACHE_NEED_AUTOMOUNT))
1408 : break;
1409 :
1410 : // uncovered automount point
1411 0 : ret = follow_automount(path, count, lookup_flags);
1412 0 : flags = smp_load_acquire(&path->dentry->d_flags);
1413 0 : if (ret < 0)
1414 : break;
1415 : }
1416 :
1417 0 : if (ret == -EISDIR)
1418 0 : ret = 0;
1419 : // possible if you race with several mount --move
1420 0 : if (need_mntput && path->mnt == mnt)
1421 0 : mntput(path->mnt);
1422 0 : if (!ret && unlikely(d_flags_negative(flags)))
1423 0 : ret = -ENOENT;
1424 0 : *jumped = need_mntput;
1425 0 : return ret;
1426 : }
1427 :
1428 0 : static inline int traverse_mounts(struct path *path, bool *jumped,
1429 : int *count, unsigned lookup_flags)
1430 : {
1431 0 : unsigned flags = smp_load_acquire(&path->dentry->d_flags);
1432 :
1433 : /* fastpath */
1434 0 : if (likely(!(flags & DCACHE_MANAGED_DENTRY))) {
1435 0 : *jumped = false;
1436 0 : if (unlikely(d_flags_negative(flags)))
1437 : return -ENOENT;
1438 0 : return 0;
1439 : }
1440 0 : return __traverse_mounts(path, flags, jumped, count, lookup_flags);
1441 : }
1442 :
1443 0 : int follow_down_one(struct path *path)
1444 : {
1445 : struct vfsmount *mounted;
1446 :
1447 0 : mounted = lookup_mnt(path);
1448 0 : if (mounted) {
1449 0 : dput(path->dentry);
1450 0 : mntput(path->mnt);
1451 0 : path->mnt = mounted;
1452 0 : path->dentry = dget(mounted->mnt_root);
1453 0 : return 1;
1454 : }
1455 : return 0;
1456 : }
1457 : EXPORT_SYMBOL(follow_down_one);
1458 :
1459 : /*
1460 : * Follow down to the covering mount currently visible to userspace. At each
1461 : * point, the filesystem owning that dentry may be queried as to whether the
1462 : * caller is permitted to proceed or not.
1463 : */
1464 0 : int follow_down(struct path *path, unsigned int flags)
1465 : {
1466 0 : struct vfsmount *mnt = path->mnt;
1467 : bool jumped;
1468 0 : int ret = traverse_mounts(path, &jumped, NULL, flags);
1469 :
1470 0 : if (path->mnt != mnt)
1471 0 : mntput(mnt);
1472 0 : return ret;
1473 : }
1474 : EXPORT_SYMBOL(follow_down);
1475 :
1476 : /*
1477 : * Try to skip to top of mountpoint pile in rcuwalk mode. Fail if
1478 : * we meet a managed dentry that would need blocking.
1479 : */
1480 1 : static bool __follow_mount_rcu(struct nameidata *nd, struct path *path)
1481 : {
1482 1 : struct dentry *dentry = path->dentry;
1483 1 : unsigned int flags = dentry->d_flags;
1484 :
1485 1 : if (likely(!(flags & DCACHE_MANAGED_DENTRY)))
1486 : return true;
1487 :
1488 0 : if (unlikely(nd->flags & LOOKUP_NO_XDEV))
1489 : return false;
1490 :
1491 : for (;;) {
1492 : /*
1493 : * Don't forget we might have a non-mountpoint managed dentry
1494 : * that wants to block transit.
1495 : */
1496 0 : if (unlikely(flags & DCACHE_MANAGE_TRANSIT)) {
1497 0 : int res = dentry->d_op->d_manage(path, true);
1498 0 : if (res)
1499 0 : return res == -EISDIR;
1500 0 : flags = dentry->d_flags;
1501 : }
1502 :
1503 0 : if (flags & DCACHE_MOUNTED) {
1504 0 : struct mount *mounted = __lookup_mnt(path->mnt, dentry);
1505 0 : if (mounted) {
1506 0 : path->mnt = &mounted->mnt;
1507 0 : dentry = path->dentry = mounted->mnt.mnt_root;
1508 0 : nd->state |= ND_JUMPED;
1509 0 : nd->next_seq = read_seqcount_begin(&dentry->d_seq);
1510 0 : flags = dentry->d_flags;
1511 : // makes sure that non-RCU pathwalk could reach
1512 : // this state.
1513 0 : if (read_seqretry(&mount_lock, nd->m_seq))
1514 : return false;
1515 0 : continue;
1516 : }
1517 0 : if (read_seqretry(&mount_lock, nd->m_seq))
1518 : return false;
1519 : }
1520 0 : return !(flags & DCACHE_NEED_AUTOMOUNT);
1521 : }
1522 : }
1523 :
1524 1 : static inline int handle_mounts(struct nameidata *nd, struct dentry *dentry,
1525 : struct path *path)
1526 : {
1527 : bool jumped;
1528 : int ret;
1529 :
1530 1 : path->mnt = nd->path.mnt;
1531 1 : path->dentry = dentry;
1532 1 : if (nd->flags & LOOKUP_RCU) {
1533 1 : unsigned int seq = nd->next_seq;
1534 1 : if (likely(__follow_mount_rcu(nd, path)))
1535 : return 0;
1536 : // *path and nd->next_seq might've been clobbered
1537 0 : path->mnt = nd->path.mnt;
1538 0 : path->dentry = dentry;
1539 0 : nd->next_seq = seq;
1540 0 : if (!try_to_unlazy_next(nd, dentry))
1541 : return -ECHILD;
1542 : }
1543 0 : ret = traverse_mounts(path, &jumped, &nd->total_link_count, nd->flags);
1544 0 : if (jumped) {
1545 0 : if (unlikely(nd->flags & LOOKUP_NO_XDEV))
1546 : ret = -EXDEV;
1547 : else
1548 0 : nd->state |= ND_JUMPED;
1549 : }
1550 0 : if (unlikely(ret)) {
1551 0 : dput(path->dentry);
1552 0 : if (path->mnt != nd->path.mnt)
1553 0 : mntput(path->mnt);
1554 : }
1555 : return ret;
1556 : }
1557 :
1558 : /*
1559 : * This looks up the name in dcache and possibly revalidates the found dentry.
1560 : * NULL is returned if the dentry does not exist in the cache.
1561 : */
1562 3 : static struct dentry *lookup_dcache(const struct qstr *name,
1563 : struct dentry *dir,
1564 : unsigned int flags)
1565 : {
1566 3 : struct dentry *dentry = d_lookup(dir, name);
1567 3 : if (dentry) {
1568 0 : int error = d_revalidate(dentry, flags);
1569 0 : if (unlikely(error <= 0)) {
1570 0 : if (!error)
1571 0 : d_invalidate(dentry);
1572 0 : dput(dentry);
1573 0 : return ERR_PTR(error);
1574 : }
1575 : }
1576 : return dentry;
1577 : }
1578 :
1579 : /*
1580 : * Parent directory has inode locked exclusive. This is one
1581 : * and only case when ->lookup() gets called on non in-lookup
1582 : * dentries - as the matter of fact, this only gets called
1583 : * when directory is guaranteed to have no in-lookup children
1584 : * at all.
1585 : */
1586 3 : struct dentry *lookup_one_qstr_excl(const struct qstr *name,
1587 : struct dentry *base,
1588 : unsigned int flags)
1589 : {
1590 3 : struct dentry *dentry = lookup_dcache(name, base, flags);
1591 : struct dentry *old;
1592 3 : struct inode *dir = base->d_inode;
1593 :
1594 3 : if (dentry)
1595 : return dentry;
1596 :
1597 : /* Don't create child dentry for a dead directory. */
1598 3 : if (unlikely(IS_DEADDIR(dir)))
1599 : return ERR_PTR(-ENOENT);
1600 :
1601 3 : dentry = d_alloc(base, name);
1602 3 : if (unlikely(!dentry))
1603 : return ERR_PTR(-ENOMEM);
1604 :
1605 3 : old = dir->i_op->lookup(dir, dentry, flags);
1606 3 : if (unlikely(old)) {
1607 0 : dput(dentry);
1608 0 : dentry = old;
1609 : }
1610 : return dentry;
1611 : }
1612 : EXPORT_SYMBOL(lookup_one_qstr_excl);
1613 :
1614 1 : static struct dentry *lookup_fast(struct nameidata *nd)
1615 : {
1616 1 : struct dentry *dentry, *parent = nd->path.dentry;
1617 1 : int status = 1;
1618 :
1619 : /*
1620 : * Rename seqlock is not required here because in the off chance
1621 : * of a false negative due to a concurrent rename, the caller is
1622 : * going to fall back to non-racy lookup.
1623 : */
1624 1 : if (nd->flags & LOOKUP_RCU) {
1625 1 : dentry = __d_lookup_rcu(parent, &nd->last, &nd->next_seq);
1626 1 : if (unlikely(!dentry)) {
1627 0 : if (!try_to_unlazy(nd))
1628 : return ERR_PTR(-ECHILD);
1629 0 : return NULL;
1630 : }
1631 :
1632 : /*
1633 : * This sequence count validates that the parent had no
1634 : * changes while we did the lookup of the dentry above.
1635 : */
1636 3 : if (read_seqcount_retry(&parent->d_seq, nd->seq))
1637 : return ERR_PTR(-ECHILD);
1638 :
1639 2 : status = d_revalidate(dentry, nd->flags);
1640 1 : if (likely(status > 0))
1641 : return dentry;
1642 0 : if (!try_to_unlazy_next(nd, dentry))
1643 : return ERR_PTR(-ECHILD);
1644 0 : if (status == -ECHILD)
1645 : /* we'd been told to redo it in non-rcu mode */
1646 0 : status = d_revalidate(dentry, nd->flags);
1647 : } else {
1648 0 : dentry = __d_lookup(parent, &nd->last);
1649 0 : if (unlikely(!dentry))
1650 : return NULL;
1651 0 : status = d_revalidate(dentry, nd->flags);
1652 : }
1653 0 : if (unlikely(status <= 0)) {
1654 0 : if (!status)
1655 0 : d_invalidate(dentry);
1656 0 : dput(dentry);
1657 0 : return ERR_PTR(status);
1658 : }
1659 : return dentry;
1660 : }
1661 :
1662 : /* Fast lookup failed, do it the slow way */
1663 0 : static struct dentry *__lookup_slow(const struct qstr *name,
1664 : struct dentry *dir,
1665 : unsigned int flags)
1666 : {
1667 : struct dentry *dentry, *old;
1668 0 : struct inode *inode = dir->d_inode;
1669 0 : DECLARE_WAIT_QUEUE_HEAD_ONSTACK(wq);
1670 :
1671 : /* Don't go there if it's already dead */
1672 0 : if (unlikely(IS_DEADDIR(inode)))
1673 : return ERR_PTR(-ENOENT);
1674 : again:
1675 0 : dentry = d_alloc_parallel(dir, name, &wq);
1676 0 : if (IS_ERR(dentry))
1677 : return dentry;
1678 0 : if (unlikely(!d_in_lookup(dentry))) {
1679 0 : int error = d_revalidate(dentry, flags);
1680 0 : if (unlikely(error <= 0)) {
1681 0 : if (!error) {
1682 0 : d_invalidate(dentry);
1683 0 : dput(dentry);
1684 0 : goto again;
1685 : }
1686 0 : dput(dentry);
1687 0 : dentry = ERR_PTR(error);
1688 : }
1689 : } else {
1690 0 : old = inode->i_op->lookup(inode, dentry, flags);
1691 0 : d_lookup_done(dentry);
1692 0 : if (unlikely(old)) {
1693 0 : dput(dentry);
1694 0 : dentry = old;
1695 : }
1696 : }
1697 : return dentry;
1698 : }
1699 :
1700 0 : static struct dentry *lookup_slow(const struct qstr *name,
1701 : struct dentry *dir,
1702 : unsigned int flags)
1703 : {
1704 0 : struct inode *inode = dir->d_inode;
1705 : struct dentry *res;
1706 0 : inode_lock_shared(inode);
1707 0 : res = __lookup_slow(name, dir, flags);
1708 0 : inode_unlock_shared(inode);
1709 0 : return res;
1710 : }
1711 :
1712 4 : static inline int may_lookup(struct mnt_idmap *idmap,
1713 : struct nameidata *nd)
1714 : {
1715 4 : if (nd->flags & LOOKUP_RCU) {
1716 4 : int err = inode_permission(idmap, nd->inode, MAY_EXEC|MAY_NOT_BLOCK);
1717 4 : if (err != -ECHILD || !try_to_unlazy(nd))
1718 : return err;
1719 : }
1720 0 : return inode_permission(idmap, nd->inode, MAY_EXEC);
1721 : }
1722 :
1723 0 : static int reserve_stack(struct nameidata *nd, struct path *link)
1724 : {
1725 0 : if (unlikely(nd->total_link_count++ >= MAXSYMLINKS))
1726 : return -ELOOP;
1727 :
1728 0 : if (likely(nd->depth != EMBEDDED_LEVELS))
1729 : return 0;
1730 0 : if (likely(nd->stack != nd->internal))
1731 : return 0;
1732 0 : if (likely(nd_alloc_stack(nd)))
1733 : return 0;
1734 :
1735 0 : if (nd->flags & LOOKUP_RCU) {
1736 : // we need to grab link before we do unlazy. And we can't skip
1737 : // unlazy even if we fail to grab the link - cleanup needs it
1738 0 : bool grabbed_link = legitimize_path(nd, link, nd->next_seq);
1739 :
1740 0 : if (!try_to_unlazy(nd) || !grabbed_link)
1741 : return -ECHILD;
1742 :
1743 0 : if (nd_alloc_stack(nd))
1744 : return 0;
1745 : }
1746 : return -ENOMEM;
1747 : }
1748 :
1749 : enum {WALK_TRAILING = 1, WALK_MORE = 2, WALK_NOFOLLOW = 4};
1750 :
1751 0 : static const char *pick_link(struct nameidata *nd, struct path *link,
1752 : struct inode *inode, int flags)
1753 : {
1754 : struct saved *last;
1755 : const char *res;
1756 0 : int error = reserve_stack(nd, link);
1757 :
1758 0 : if (unlikely(error)) {
1759 0 : if (!(nd->flags & LOOKUP_RCU))
1760 : path_put(link);
1761 0 : return ERR_PTR(error);
1762 : }
1763 0 : last = nd->stack + nd->depth++;
1764 0 : last->link = *link;
1765 0 : clear_delayed_call(&last->done);
1766 0 : last->seq = nd->next_seq;
1767 :
1768 0 : if (flags & WALK_TRAILING) {
1769 0 : error = may_follow_link(nd, inode);
1770 0 : if (unlikely(error))
1771 0 : return ERR_PTR(error);
1772 : }
1773 :
1774 0 : if (unlikely(nd->flags & LOOKUP_NO_SYMLINKS) ||
1775 0 : unlikely(link->mnt->mnt_flags & MNT_NOSYMFOLLOW))
1776 : return ERR_PTR(-ELOOP);
1777 :
1778 0 : if (!(nd->flags & LOOKUP_RCU)) {
1779 0 : touch_atime(&last->link);
1780 0 : cond_resched();
1781 0 : } else if (atime_needs_update(&last->link, inode)) {
1782 0 : if (!try_to_unlazy(nd))
1783 : return ERR_PTR(-ECHILD);
1784 0 : touch_atime(&last->link);
1785 : }
1786 :
1787 0 : error = security_inode_follow_link(link->dentry, inode,
1788 0 : nd->flags & LOOKUP_RCU);
1789 : if (unlikely(error))
1790 : return ERR_PTR(error);
1791 :
1792 0 : res = READ_ONCE(inode->i_link);
1793 0 : if (!res) {
1794 : const char * (*get)(struct dentry *, struct inode *,
1795 : struct delayed_call *);
1796 0 : get = inode->i_op->get_link;
1797 0 : if (nd->flags & LOOKUP_RCU) {
1798 0 : res = get(NULL, inode, &last->done);
1799 0 : if (res == ERR_PTR(-ECHILD) && try_to_unlazy(nd))
1800 0 : res = get(link->dentry, inode, &last->done);
1801 : } else {
1802 0 : res = get(link->dentry, inode, &last->done);
1803 : }
1804 0 : if (!res)
1805 : goto all_done;
1806 0 : if (IS_ERR(res))
1807 : return res;
1808 : }
1809 0 : if (*res == '/') {
1810 0 : error = nd_jump_root(nd);
1811 0 : if (unlikely(error))
1812 0 : return ERR_PTR(error);
1813 0 : while (unlikely(*++res == '/'))
1814 : ;
1815 : }
1816 0 : if (*res)
1817 : return res;
1818 : all_done: // pure jump
1819 0 : put_link(nd);
1820 0 : return NULL;
1821 : }
1822 :
1823 : /*
1824 : * Do we need to follow links? We _really_ want to be able
1825 : * to do this check without having to look at inode->i_op,
1826 : * so we keep a cache of "no, this doesn't need follow_link"
1827 : * for the common case.
1828 : *
1829 : * NOTE: dentry must be what nd->next_seq had been sampled from.
1830 : */
1831 1 : static const char *step_into(struct nameidata *nd, int flags,
1832 : struct dentry *dentry)
1833 : {
1834 : struct path path;
1835 : struct inode *inode;
1836 1 : int err = handle_mounts(nd, dentry, &path);
1837 :
1838 1 : if (err < 0)
1839 0 : return ERR_PTR(err);
1840 1 : inode = path.dentry->d_inode;
1841 2 : if (likely(!d_is_symlink(path.dentry)) ||
1842 0 : ((flags & WALK_TRAILING) && !(nd->flags & LOOKUP_FOLLOW)) ||
1843 0 : (flags & WALK_NOFOLLOW)) {
1844 : /* not a symlink or should not follow */
1845 1 : if (nd->flags & LOOKUP_RCU) {
1846 3 : if (read_seqcount_retry(&path.dentry->d_seq, nd->next_seq))
1847 : return ERR_PTR(-ECHILD);
1848 1 : if (unlikely(!inode))
1849 : return ERR_PTR(-ENOENT);
1850 : } else {
1851 0 : dput(nd->path.dentry);
1852 0 : if (nd->path.mnt != path.mnt)
1853 0 : mntput(nd->path.mnt);
1854 : }
1855 1 : nd->path = path;
1856 1 : nd->inode = inode;
1857 1 : nd->seq = nd->next_seq;
1858 1 : return NULL;
1859 : }
1860 0 : if (nd->flags & LOOKUP_RCU) {
1861 : /* make sure that d_is_symlink above matches inode */
1862 0 : if (read_seqcount_retry(&path.dentry->d_seq, nd->next_seq))
1863 : return ERR_PTR(-ECHILD);
1864 : } else {
1865 0 : if (path.mnt == nd->path.mnt)
1866 0 : mntget(path.mnt);
1867 : }
1868 0 : return pick_link(nd, &path, inode, flags);
1869 : }
1870 :
1871 0 : static struct dentry *follow_dotdot_rcu(struct nameidata *nd)
1872 : {
1873 : struct dentry *parent, *old;
1874 :
1875 0 : if (path_equal(&nd->path, &nd->root))
1876 : goto in_root;
1877 0 : if (unlikely(nd->path.dentry == nd->path.mnt->mnt_root)) {
1878 : struct path path;
1879 : unsigned seq;
1880 0 : if (!choose_mountpoint_rcu(real_mount(nd->path.mnt),
1881 0 : &nd->root, &path, &seq))
1882 : goto in_root;
1883 0 : if (unlikely(nd->flags & LOOKUP_NO_XDEV))
1884 : return ERR_PTR(-ECHILD);
1885 0 : nd->path = path;
1886 0 : nd->inode = path.dentry->d_inode;
1887 0 : nd->seq = seq;
1888 : // makes sure that non-RCU pathwalk could reach this state
1889 0 : if (read_seqretry(&mount_lock, nd->m_seq))
1890 : return ERR_PTR(-ECHILD);
1891 : /* we know that mountpoint was pinned */
1892 : }
1893 0 : old = nd->path.dentry;
1894 0 : parent = old->d_parent;
1895 0 : nd->next_seq = read_seqcount_begin(&parent->d_seq);
1896 : // makes sure that non-RCU pathwalk could reach this state
1897 0 : if (read_seqcount_retry(&old->d_seq, nd->seq))
1898 : return ERR_PTR(-ECHILD);
1899 0 : if (unlikely(!path_connected(nd->path.mnt, parent)))
1900 : return ERR_PTR(-ECHILD);
1901 0 : return parent;
1902 : in_root:
1903 0 : if (read_seqretry(&mount_lock, nd->m_seq))
1904 : return ERR_PTR(-ECHILD);
1905 0 : if (unlikely(nd->flags & LOOKUP_BENEATH))
1906 : return ERR_PTR(-ECHILD);
1907 0 : nd->next_seq = nd->seq;
1908 0 : return nd->path.dentry;
1909 : }
1910 :
1911 0 : static struct dentry *follow_dotdot(struct nameidata *nd)
1912 : {
1913 : struct dentry *parent;
1914 :
1915 0 : if (path_equal(&nd->path, &nd->root))
1916 : goto in_root;
1917 0 : if (unlikely(nd->path.dentry == nd->path.mnt->mnt_root)) {
1918 : struct path path;
1919 :
1920 0 : if (!choose_mountpoint(real_mount(nd->path.mnt),
1921 0 : &nd->root, &path))
1922 : goto in_root;
1923 0 : path_put(&nd->path);
1924 0 : nd->path = path;
1925 0 : nd->inode = path.dentry->d_inode;
1926 0 : if (unlikely(nd->flags & LOOKUP_NO_XDEV))
1927 0 : return ERR_PTR(-EXDEV);
1928 : }
1929 : /* rare case of legitimate dget_parent()... */
1930 0 : parent = dget_parent(nd->path.dentry);
1931 0 : if (unlikely(!path_connected(nd->path.mnt, parent))) {
1932 0 : dput(parent);
1933 0 : return ERR_PTR(-ENOENT);
1934 : }
1935 : return parent;
1936 :
1937 : in_root:
1938 0 : if (unlikely(nd->flags & LOOKUP_BENEATH))
1939 : return ERR_PTR(-EXDEV);
1940 0 : return dget(nd->path.dentry);
1941 : }
1942 :
1943 0 : static const char *handle_dots(struct nameidata *nd, int type)
1944 : {
1945 0 : if (type == LAST_DOTDOT) {
1946 0 : const char *error = NULL;
1947 : struct dentry *parent;
1948 :
1949 0 : if (!nd->root.mnt) {
1950 0 : error = ERR_PTR(set_root(nd));
1951 0 : if (error)
1952 : return error;
1953 : }
1954 0 : if (nd->flags & LOOKUP_RCU)
1955 0 : parent = follow_dotdot_rcu(nd);
1956 : else
1957 0 : parent = follow_dotdot(nd);
1958 0 : if (IS_ERR(parent))
1959 : return ERR_CAST(parent);
1960 0 : error = step_into(nd, WALK_NOFOLLOW, parent);
1961 0 : if (unlikely(error))
1962 : return error;
1963 :
1964 0 : if (unlikely(nd->flags & LOOKUP_IS_SCOPED)) {
1965 : /*
1966 : * If there was a racing rename or mount along our
1967 : * path, then we can't be sure that ".." hasn't jumped
1968 : * above nd->root (and so userspace should retry or use
1969 : * some fallback).
1970 : */
1971 0 : smp_rmb();
1972 0 : if (__read_seqcount_retry(&mount_lock.seqcount, nd->m_seq))
1973 : return ERR_PTR(-EAGAIN);
1974 0 : if (__read_seqcount_retry(&rename_lock.seqcount, nd->r_seq))
1975 : return ERR_PTR(-EAGAIN);
1976 : }
1977 : }
1978 : return NULL;
1979 : }
1980 :
1981 1 : static const char *walk_component(struct nameidata *nd, int flags)
1982 : {
1983 : struct dentry *dentry;
1984 : /*
1985 : * "." and ".." are special - ".." especially so because it has
1986 : * to be able to know about the current root directory and
1987 : * parent relationships.
1988 : */
1989 1 : if (unlikely(nd->last_type != LAST_NORM)) {
1990 0 : if (!(flags & WALK_MORE) && nd->depth)
1991 0 : put_link(nd);
1992 0 : return handle_dots(nd, nd->last_type);
1993 : }
1994 1 : dentry = lookup_fast(nd);
1995 1 : if (IS_ERR(dentry))
1996 : return ERR_CAST(dentry);
1997 1 : if (unlikely(!dentry)) {
1998 0 : dentry = lookup_slow(&nd->last, nd->path.dentry, nd->flags);
1999 0 : if (IS_ERR(dentry))
2000 : return ERR_CAST(dentry);
2001 : }
2002 1 : if (!(flags & WALK_MORE) && nd->depth)
2003 0 : put_link(nd);
2004 1 : return step_into(nd, flags, dentry);
2005 : }
2006 :
2007 : /*
2008 : * We can do the critical dentry name comparison and hashing
2009 : * operations one word at a time, but we are limited to:
2010 : *
2011 : * - Architectures with fast unaligned word accesses. We could
2012 : * do a "get_unaligned()" if this helps and is sufficiently
2013 : * fast.
2014 : *
2015 : * - non-CONFIG_DEBUG_PAGEALLOC configurations (so that we
2016 : * do not trap on the (extremely unlikely) case of a page
2017 : * crossing operation.
2018 : *
2019 : * - Furthermore, we need an efficient 64-bit compile for the
2020 : * 64-bit case in order to generate the "number of bytes in
2021 : * the final mask". Again, that could be replaced with a
2022 : * efficient population count instruction or similar.
2023 : */
2024 : #ifdef CONFIG_DCACHE_WORD_ACCESS
2025 :
2026 : #include <asm/word-at-a-time.h>
2027 :
2028 : #ifdef HASH_MIX
2029 :
2030 : /* Architecture provides HASH_MIX and fold_hash() in <asm/hash.h> */
2031 :
2032 : #elif defined(CONFIG_64BIT)
2033 : /*
2034 : * Register pressure in the mixing function is an issue, particularly
2035 : * on 32-bit x86, but almost any function requires one state value and
2036 : * one temporary. Instead, use a function designed for two state values
2037 : * and no temporaries.
2038 : *
2039 : * This function cannot create a collision in only two iterations, so
2040 : * we have two iterations to achieve avalanche. In those two iterations,
2041 : * we have six layers of mixing, which is enough to spread one bit's
2042 : * influence out to 2^6 = 64 state bits.
2043 : *
2044 : * Rotate constants are scored by considering either 64 one-bit input
2045 : * deltas or 64*63/2 = 2016 two-bit input deltas, and finding the
2046 : * probability of that delta causing a change to each of the 128 output
2047 : * bits, using a sample of random initial states.
2048 : *
2049 : * The Shannon entropy of the computed probabilities is then summed
2050 : * to produce a score. Ideally, any input change has a 50% chance of
2051 : * toggling any given output bit.
2052 : *
2053 : * Mixing scores (in bits) for (12,45):
2054 : * Input delta: 1-bit 2-bit
2055 : * 1 round: 713.3 42542.6
2056 : * 2 rounds: 2753.7 140389.8
2057 : * 3 rounds: 5954.1 233458.2
2058 : * 4 rounds: 7862.6 256672.2
2059 : * Perfect: 8192 258048
2060 : * (64*128) (64*63/2 * 128)
2061 : */
2062 : #define HASH_MIX(x, y, a) \
2063 : ( x ^= (a), \
2064 : y ^= x, x = rol64(x,12),\
2065 : x += y, y = rol64(y,45),\
2066 : y *= 9 )
2067 :
2068 : /*
2069 : * Fold two longs into one 32-bit hash value. This must be fast, but
2070 : * latency isn't quite as critical, as there is a fair bit of additional
2071 : * work done before the hash value is used.
2072 : */
2073 : static inline unsigned int fold_hash(unsigned long x, unsigned long y)
2074 : {
2075 6 : y ^= x * GOLDEN_RATIO_64;
2076 6 : y *= GOLDEN_RATIO_64;
2077 6 : return y >> 32;
2078 : }
2079 :
2080 : #else /* 32-bit case */
2081 :
2082 : /*
2083 : * Mixing scores (in bits) for (7,20):
2084 : * Input delta: 1-bit 2-bit
2085 : * 1 round: 330.3 9201.6
2086 : * 2 rounds: 1246.4 25475.4
2087 : * 3 rounds: 1907.1 31295.1
2088 : * 4 rounds: 2042.3 31718.6
2089 : * Perfect: 2048 31744
2090 : * (32*64) (32*31/2 * 64)
2091 : */
2092 : #define HASH_MIX(x, y, a) \
2093 : ( x ^= (a), \
2094 : y ^= x, x = rol32(x, 7),\
2095 : x += y, y = rol32(y,20),\
2096 : y *= 9 )
2097 :
2098 : static inline unsigned int fold_hash(unsigned long x, unsigned long y)
2099 : {
2100 : /* Use arch-optimized multiply if one exists */
2101 : return __hash_32(y ^ __hash_32(x));
2102 : }
2103 :
2104 : #endif
2105 :
2106 : /*
2107 : * Return the hash of a string of known length. This is carfully
2108 : * designed to match hash_name(), which is the more critical function.
2109 : * In particular, we must end by hashing a final word containing 0..7
2110 : * payload bytes, to match the way that hash_name() iterates until it
2111 : * finds the delimiter after the name.
2112 : */
2113 0 : unsigned int full_name_hash(const void *salt, const char *name, unsigned int len)
2114 : {
2115 0 : unsigned long a, x = 0, y = (unsigned long)salt;
2116 :
2117 : for (;;) {
2118 0 : if (!len)
2119 : goto done;
2120 0 : a = load_unaligned_zeropad(name);
2121 0 : if (len < sizeof(unsigned long))
2122 : break;
2123 0 : HASH_MIX(x, y, a);
2124 0 : name += sizeof(unsigned long);
2125 0 : len -= sizeof(unsigned long);
2126 : }
2127 0 : x ^= a & bytemask_from_count(len);
2128 : done:
2129 0 : return fold_hash(x, y);
2130 : }
2131 : EXPORT_SYMBOL(full_name_hash);
2132 :
2133 : /* Return the "hash_len" (hash and length) of a null-terminated string */
2134 2 : u64 hashlen_string(const void *salt, const char *name)
2135 : {
2136 2 : unsigned long a = 0, x = 0, y = (unsigned long)salt;
2137 : unsigned long adata, mask, len;
2138 2 : const struct word_at_a_time constants = WORD_AT_A_TIME_CONSTANTS;
2139 :
2140 2 : len = 0;
2141 2 : goto inside;
2142 :
2143 : do {
2144 3 : HASH_MIX(x, y, a);
2145 1 : len += sizeof(unsigned long);
2146 : inside:
2147 6 : a = load_unaligned_zeropad(name+len);
2148 3 : } while (!has_zero(a, &adata, &constants));
2149 :
2150 2 : adata = prep_zero_mask(a, adata, &constants);
2151 4 : mask = create_zero_mask(adata);
2152 2 : x ^= a & zero_bytemask(mask);
2153 :
2154 4 : return hashlen_create(fold_hash(x, y), len + find_zero(mask));
2155 : }
2156 : EXPORT_SYMBOL(hashlen_string);
2157 :
2158 : /*
2159 : * Calculate the length and hash of the path component, and
2160 : * return the "hash_len" as the result.
2161 : */
2162 4 : static inline u64 hash_name(const void *salt, const char *name)
2163 : {
2164 4 : unsigned long a = 0, b, x = 0, y = (unsigned long)salt;
2165 : unsigned long adata, bdata, mask, len;
2166 4 : const struct word_at_a_time constants = WORD_AT_A_TIME_CONSTANTS;
2167 :
2168 4 : len = 0;
2169 4 : goto inside;
2170 :
2171 : do {
2172 0 : HASH_MIX(x, y, a);
2173 0 : len += sizeof(unsigned long);
2174 : inside:
2175 8 : a = load_unaligned_zeropad(name+len);
2176 4 : b = a ^ REPEAT_BYTE('/');
2177 8 : } while (!(has_zero(a, &adata, &constants) | has_zero(b, &bdata, &constants)));
2178 :
2179 4 : adata = prep_zero_mask(a, adata, &constants);
2180 4 : bdata = prep_zero_mask(b, bdata, &constants);
2181 8 : mask = create_zero_mask(adata | bdata);
2182 4 : x ^= a & zero_bytemask(mask);
2183 :
2184 8 : return hashlen_create(fold_hash(x, y), len + find_zero(mask));
2185 : }
2186 :
2187 : #else /* !CONFIG_DCACHE_WORD_ACCESS: Slow, byte-at-a-time version */
2188 :
2189 : /* Return the hash of a string of known length */
2190 : unsigned int full_name_hash(const void *salt, const char *name, unsigned int len)
2191 : {
2192 : unsigned long hash = init_name_hash(salt);
2193 : while (len--)
2194 : hash = partial_name_hash((unsigned char)*name++, hash);
2195 : return end_name_hash(hash);
2196 : }
2197 : EXPORT_SYMBOL(full_name_hash);
2198 :
2199 : /* Return the "hash_len" (hash and length) of a null-terminated string */
2200 : u64 hashlen_string(const void *salt, const char *name)
2201 : {
2202 : unsigned long hash = init_name_hash(salt);
2203 : unsigned long len = 0, c;
2204 :
2205 : c = (unsigned char)*name;
2206 : while (c) {
2207 : len++;
2208 : hash = partial_name_hash(c, hash);
2209 : c = (unsigned char)name[len];
2210 : }
2211 : return hashlen_create(end_name_hash(hash), len);
2212 : }
2213 : EXPORT_SYMBOL(hashlen_string);
2214 :
2215 : /*
2216 : * We know there's a real path component here of at least
2217 : * one character.
2218 : */
2219 : static inline u64 hash_name(const void *salt, const char *name)
2220 : {
2221 : unsigned long hash = init_name_hash(salt);
2222 : unsigned long len = 0, c;
2223 :
2224 : c = (unsigned char)*name;
2225 : do {
2226 : len++;
2227 : hash = partial_name_hash(c, hash);
2228 : c = (unsigned char)name[len];
2229 : } while (c && c != '/');
2230 : return hashlen_create(end_name_hash(hash), len);
2231 : }
2232 :
2233 : #endif
2234 :
2235 : /*
2236 : * Name resolution.
2237 : * This is the basic name resolution function, turning a pathname into
2238 : * the final dentry. We expect 'base' to be positive and a directory.
2239 : *
2240 : * Returns 0 and nd will have valid dentry and mnt on success.
2241 : * Returns error and drops reference to input namei data on failure.
2242 : */
2243 3 : static int link_path_walk(const char *name, struct nameidata *nd)
2244 : {
2245 3 : int depth = 0; // depth <= nd->depth
2246 : int err;
2247 :
2248 3 : nd->last_type = LAST_ROOT;
2249 3 : nd->flags |= LOOKUP_PARENT;
2250 3 : if (IS_ERR(name))
2251 0 : return PTR_ERR(name);
2252 6 : while (*name=='/')
2253 3 : name++;
2254 3 : if (!*name) {
2255 0 : nd->dir_mode = 0; // short-circuit the 'hardening' idiocy
2256 0 : return 0;
2257 : }
2258 :
2259 : /* At this point we know we have a real path component. */
2260 : for(;;) {
2261 : struct mnt_idmap *idmap;
2262 : const char *link;
2263 : u64 hash_len;
2264 : int type;
2265 :
2266 8 : idmap = mnt_idmap(nd->path.mnt);
2267 4 : err = may_lookup(idmap, nd);
2268 4 : if (err)
2269 : return err;
2270 :
2271 4 : hash_len = hash_name(nd->path.dentry, name);
2272 :
2273 4 : type = LAST_NORM;
2274 4 : if (name[0] == '.') switch (hashlen_len(hash_len)) {
2275 : case 2:
2276 0 : if (name[1] == '.') {
2277 0 : type = LAST_DOTDOT;
2278 0 : nd->state |= ND_JUMPED;
2279 : }
2280 : break;
2281 : case 1:
2282 0 : type = LAST_DOT;
2283 : }
2284 4 : if (likely(type == LAST_NORM)) {
2285 4 : struct dentry *parent = nd->path.dentry;
2286 4 : nd->state &= ~ND_JUMPED;
2287 4 : if (unlikely(parent->d_flags & DCACHE_OP_HASH)) {
2288 0 : struct qstr this = { { .hash_len = hash_len }, .name = name };
2289 0 : err = parent->d_op->d_hash(parent, &this);
2290 0 : if (err < 0)
2291 0 : return err;
2292 0 : hash_len = this.hash_len;
2293 0 : name = this.name;
2294 : }
2295 : }
2296 :
2297 4 : nd->last.hash_len = hash_len;
2298 4 : nd->last.name = name;
2299 4 : nd->last_type = type;
2300 :
2301 4 : name += hashlen_len(hash_len);
2302 4 : if (!*name)
2303 : goto OK;
2304 : /*
2305 : * If it wasn't NUL, we know it was '/'. Skip that
2306 : * slash, and continue until no more slashes.
2307 : */
2308 : do {
2309 1 : name++;
2310 1 : } while (unlikely(*name == '/'));
2311 1 : if (unlikely(!*name)) {
2312 : OK:
2313 : /* pathname or trailing symlink, done */
2314 3 : if (!depth) {
2315 6 : nd->dir_vfsuid = i_uid_into_vfsuid(idmap, nd->inode);
2316 3 : nd->dir_mode = nd->inode->i_mode;
2317 3 : nd->flags &= ~LOOKUP_PARENT;
2318 3 : return 0;
2319 : }
2320 : /* last component of nested symlink */
2321 0 : name = nd->stack[--depth].name;
2322 0 : link = walk_component(nd, 0);
2323 : } else {
2324 : /* not the last component */
2325 1 : link = walk_component(nd, WALK_MORE);
2326 : }
2327 1 : if (unlikely(link)) {
2328 0 : if (IS_ERR(link))
2329 0 : return PTR_ERR(link);
2330 : /* a symlink to follow */
2331 0 : nd->stack[depth++].name = name;
2332 0 : name = link;
2333 0 : continue;
2334 : }
2335 2 : if (unlikely(!d_can_lookup(nd->path.dentry))) {
2336 0 : if (nd->flags & LOOKUP_RCU) {
2337 0 : if (!try_to_unlazy(nd))
2338 : return -ECHILD;
2339 : }
2340 : return -ENOTDIR;
2341 : }
2342 : }
2343 : }
2344 :
2345 : /* must be paired with terminate_walk() */
2346 3 : static const char *path_init(struct nameidata *nd, unsigned flags)
2347 : {
2348 : int error;
2349 3 : const char *s = nd->name->name;
2350 :
2351 : /* LOOKUP_CACHED requires RCU, ask caller to retry */
2352 3 : if ((flags & (LOOKUP_RCU | LOOKUP_CACHED)) == LOOKUP_CACHED)
2353 : return ERR_PTR(-EAGAIN);
2354 :
2355 3 : if (!*s)
2356 0 : flags &= ~LOOKUP_RCU;
2357 3 : if (flags & LOOKUP_RCU)
2358 : rcu_read_lock();
2359 : else
2360 0 : nd->seq = nd->next_seq = 0;
2361 :
2362 3 : nd->flags = flags;
2363 3 : nd->state |= ND_JUMPED;
2364 :
2365 6 : nd->m_seq = __read_seqcount_begin(&mount_lock.seqcount);
2366 6 : nd->r_seq = __read_seqcount_begin(&rename_lock.seqcount);
2367 3 : smp_rmb();
2368 :
2369 3 : if (nd->state & ND_ROOT_PRESET) {
2370 0 : struct dentry *root = nd->root.dentry;
2371 0 : struct inode *inode = root->d_inode;
2372 0 : if (*s && unlikely(!d_can_lookup(root)))
2373 : return ERR_PTR(-ENOTDIR);
2374 0 : nd->path = nd->root;
2375 0 : nd->inode = inode;
2376 0 : if (flags & LOOKUP_RCU) {
2377 0 : nd->seq = read_seqcount_begin(&nd->path.dentry->d_seq);
2378 0 : nd->root_seq = nd->seq;
2379 : } else {
2380 0 : path_get(&nd->path);
2381 : }
2382 : return s;
2383 : }
2384 :
2385 3 : nd->root.mnt = NULL;
2386 :
2387 : /* Absolute pathname -- fetch the root (LOOKUP_IN_ROOT uses nd->dfd). */
2388 3 : if (*s == '/' && !(flags & LOOKUP_IN_ROOT)) {
2389 3 : error = nd_jump_root(nd);
2390 3 : if (unlikely(error))
2391 0 : return ERR_PTR(error);
2392 : return s;
2393 : }
2394 :
2395 : /* Relative pathname -- get the starting-point it is relative to. */
2396 0 : if (nd->dfd == AT_FDCWD) {
2397 0 : if (flags & LOOKUP_RCU) {
2398 0 : struct fs_struct *fs = current->fs;
2399 : unsigned seq;
2400 :
2401 : do {
2402 0 : seq = read_seqcount_begin(&fs->seq);
2403 0 : nd->path = fs->pwd;
2404 0 : nd->inode = nd->path.dentry->d_inode;
2405 0 : nd->seq = __read_seqcount_begin(&nd->path.dentry->d_seq);
2406 0 : } while (read_seqcount_retry(&fs->seq, seq));
2407 : } else {
2408 0 : get_fs_pwd(current->fs, &nd->path);
2409 0 : nd->inode = nd->path.dentry->d_inode;
2410 : }
2411 : } else {
2412 : /* Caller must check execute permissions on the starting path component */
2413 0 : struct fd f = fdget_raw(nd->dfd);
2414 : struct dentry *dentry;
2415 :
2416 0 : if (!f.file)
2417 0 : return ERR_PTR(-EBADF);
2418 :
2419 0 : dentry = f.file->f_path.dentry;
2420 :
2421 0 : if (*s && unlikely(!d_can_lookup(dentry))) {
2422 0 : fdput(f);
2423 : return ERR_PTR(-ENOTDIR);
2424 : }
2425 :
2426 0 : nd->path = f.file->f_path;
2427 0 : if (flags & LOOKUP_RCU) {
2428 0 : nd->inode = nd->path.dentry->d_inode;
2429 0 : nd->seq = read_seqcount_begin(&nd->path.dentry->d_seq);
2430 : } else {
2431 0 : path_get(&nd->path);
2432 0 : nd->inode = nd->path.dentry->d_inode;
2433 : }
2434 0 : fdput(f);
2435 : }
2436 :
2437 : /* For scoped-lookups we need to set the root to the dirfd as well. */
2438 0 : if (flags & LOOKUP_IS_SCOPED) {
2439 0 : nd->root = nd->path;
2440 0 : if (flags & LOOKUP_RCU) {
2441 0 : nd->root_seq = nd->seq;
2442 : } else {
2443 0 : path_get(&nd->root);
2444 0 : nd->state |= ND_ROOT_GRABBED;
2445 : }
2446 : }
2447 : return s;
2448 : }
2449 :
2450 0 : static inline const char *lookup_last(struct nameidata *nd)
2451 : {
2452 0 : if (nd->last_type == LAST_NORM && nd->last.name[nd->last.len])
2453 0 : nd->flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY;
2454 :
2455 0 : return walk_component(nd, WALK_TRAILING);
2456 : }
2457 :
2458 0 : static int handle_lookup_down(struct nameidata *nd)
2459 : {
2460 0 : if (!(nd->flags & LOOKUP_RCU))
2461 0 : dget(nd->path.dentry);
2462 0 : nd->next_seq = nd->seq;
2463 0 : return PTR_ERR(step_into(nd, WALK_NOFOLLOW, nd->path.dentry));
2464 : }
2465 :
2466 : /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
2467 0 : static int path_lookupat(struct nameidata *nd, unsigned flags, struct path *path)
2468 : {
2469 0 : const char *s = path_init(nd, flags);
2470 : int err;
2471 :
2472 0 : if (unlikely(flags & LOOKUP_DOWN) && !IS_ERR(s)) {
2473 0 : err = handle_lookup_down(nd);
2474 0 : if (unlikely(err < 0))
2475 0 : s = ERR_PTR(err);
2476 : }
2477 :
2478 0 : while (!(err = link_path_walk(s, nd)) &&
2479 : (s = lookup_last(nd)) != NULL)
2480 : ;
2481 0 : if (!err && unlikely(nd->flags & LOOKUP_MOUNTPOINT)) {
2482 0 : err = handle_lookup_down(nd);
2483 0 : nd->state &= ~ND_JUMPED; // no d_weak_revalidate(), please...
2484 : }
2485 0 : if (!err)
2486 0 : err = complete_walk(nd);
2487 :
2488 0 : if (!err && nd->flags & LOOKUP_DIRECTORY)
2489 0 : if (!d_can_lookup(nd->path.dentry))
2490 0 : err = -ENOTDIR;
2491 0 : if (!err) {
2492 0 : *path = nd->path;
2493 0 : nd->path.mnt = NULL;
2494 0 : nd->path.dentry = NULL;
2495 : }
2496 0 : terminate_walk(nd);
2497 0 : return err;
2498 : }
2499 :
2500 0 : int filename_lookup(int dfd, struct filename *name, unsigned flags,
2501 : struct path *path, struct path *root)
2502 : {
2503 : int retval;
2504 : struct nameidata nd;
2505 0 : if (IS_ERR(name))
2506 0 : return PTR_ERR(name);
2507 0 : set_nameidata(&nd, dfd, name, root);
2508 0 : retval = path_lookupat(&nd, flags | LOOKUP_RCU, path);
2509 0 : if (unlikely(retval == -ECHILD))
2510 0 : retval = path_lookupat(&nd, flags, path);
2511 0 : if (unlikely(retval == -ESTALE))
2512 0 : retval = path_lookupat(&nd, flags | LOOKUP_REVAL, path);
2513 :
2514 : if (likely(!retval))
2515 : audit_inode(name, path->dentry,
2516 : flags & LOOKUP_MOUNTPOINT ? AUDIT_INODE_NOEVAL : 0);
2517 0 : restore_nameidata();
2518 0 : return retval;
2519 : }
2520 :
2521 : /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
2522 3 : static int path_parentat(struct nameidata *nd, unsigned flags,
2523 : struct path *parent)
2524 : {
2525 3 : const char *s = path_init(nd, flags);
2526 3 : int err = link_path_walk(s, nd);
2527 3 : if (!err)
2528 3 : err = complete_walk(nd);
2529 3 : if (!err) {
2530 3 : *parent = nd->path;
2531 3 : nd->path.mnt = NULL;
2532 3 : nd->path.dentry = NULL;
2533 : }
2534 3 : terminate_walk(nd);
2535 3 : return err;
2536 : }
2537 :
2538 : /* Note: this does not consume "name" */
2539 3 : static int __filename_parentat(int dfd, struct filename *name,
2540 : unsigned int flags, struct path *parent,
2541 : struct qstr *last, int *type,
2542 : const struct path *root)
2543 : {
2544 : int retval;
2545 : struct nameidata nd;
2546 :
2547 3 : if (IS_ERR(name))
2548 0 : return PTR_ERR(name);
2549 3 : set_nameidata(&nd, dfd, name, root);
2550 3 : retval = path_parentat(&nd, flags | LOOKUP_RCU, parent);
2551 3 : if (unlikely(retval == -ECHILD))
2552 0 : retval = path_parentat(&nd, flags, parent);
2553 3 : if (unlikely(retval == -ESTALE))
2554 0 : retval = path_parentat(&nd, flags | LOOKUP_REVAL, parent);
2555 3 : if (likely(!retval)) {
2556 3 : *last = nd.last;
2557 3 : *type = nd.last_type;
2558 3 : audit_inode(name, parent->dentry, AUDIT_INODE_PARENT);
2559 : }
2560 3 : restore_nameidata();
2561 3 : return retval;
2562 : }
2563 :
2564 : static int filename_parentat(int dfd, struct filename *name,
2565 : unsigned int flags, struct path *parent,
2566 : struct qstr *last, int *type)
2567 : {
2568 3 : return __filename_parentat(dfd, name, flags, parent, last, type, NULL);
2569 : }
2570 :
2571 : /* does lookup, returns the object with parent locked */
2572 0 : static struct dentry *__kern_path_locked(struct filename *name, struct path *path)
2573 : {
2574 : struct dentry *d;
2575 : struct qstr last;
2576 : int type, error;
2577 :
2578 0 : error = filename_parentat(AT_FDCWD, name, 0, path, &last, &type);
2579 0 : if (error)
2580 0 : return ERR_PTR(error);
2581 0 : if (unlikely(type != LAST_NORM)) {
2582 0 : path_put(path);
2583 0 : return ERR_PTR(-EINVAL);
2584 : }
2585 0 : inode_lock_nested(path->dentry->d_inode, I_MUTEX_PARENT);
2586 0 : d = lookup_one_qstr_excl(&last, path->dentry, 0);
2587 0 : if (IS_ERR(d)) {
2588 0 : inode_unlock(path->dentry->d_inode);
2589 : path_put(path);
2590 : }
2591 : return d;
2592 : }
2593 :
2594 0 : struct dentry *kern_path_locked(const char *name, struct path *path)
2595 : {
2596 0 : struct filename *filename = getname_kernel(name);
2597 0 : struct dentry *res = __kern_path_locked(filename, path);
2598 :
2599 0 : putname(filename);
2600 0 : return res;
2601 : }
2602 :
2603 0 : int kern_path(const char *name, unsigned int flags, struct path *path)
2604 : {
2605 0 : struct filename *filename = getname_kernel(name);
2606 0 : int ret = filename_lookup(AT_FDCWD, filename, flags, path, NULL);
2607 :
2608 0 : putname(filename);
2609 0 : return ret;
2610 :
2611 : }
2612 : EXPORT_SYMBOL(kern_path);
2613 :
2614 : /**
2615 : * vfs_path_parent_lookup - lookup a parent path relative to a dentry-vfsmount pair
2616 : * @filename: filename structure
2617 : * @flags: lookup flags
2618 : * @parent: pointer to struct path to fill
2619 : * @last: last component
2620 : * @type: type of the last component
2621 : * @root: pointer to struct path of the base directory
2622 : */
2623 0 : int vfs_path_parent_lookup(struct filename *filename, unsigned int flags,
2624 : struct path *parent, struct qstr *last, int *type,
2625 : const struct path *root)
2626 : {
2627 0 : return __filename_parentat(AT_FDCWD, filename, flags, parent, last,
2628 : type, root);
2629 : }
2630 : EXPORT_SYMBOL(vfs_path_parent_lookup);
2631 :
2632 : /**
2633 : * vfs_path_lookup - lookup a file path relative to a dentry-vfsmount pair
2634 : * @dentry: pointer to dentry of the base directory
2635 : * @mnt: pointer to vfs mount of the base directory
2636 : * @name: pointer to file name
2637 : * @flags: lookup flags
2638 : * @path: pointer to struct path to fill
2639 : */
2640 0 : int vfs_path_lookup(struct dentry *dentry, struct vfsmount *mnt,
2641 : const char *name, unsigned int flags,
2642 : struct path *path)
2643 : {
2644 : struct filename *filename;
2645 0 : struct path root = {.mnt = mnt, .dentry = dentry};
2646 : int ret;
2647 :
2648 0 : filename = getname_kernel(name);
2649 : /* the first argument of filename_lookup() is ignored with root */
2650 0 : ret = filename_lookup(AT_FDCWD, filename, flags, path, &root);
2651 0 : putname(filename);
2652 0 : return ret;
2653 : }
2654 : EXPORT_SYMBOL(vfs_path_lookup);
2655 :
2656 0 : static int lookup_one_common(struct mnt_idmap *idmap,
2657 : const char *name, struct dentry *base, int len,
2658 : struct qstr *this)
2659 : {
2660 0 : this->name = name;
2661 0 : this->len = len;
2662 0 : this->hash = full_name_hash(base, name, len);
2663 0 : if (!len)
2664 : return -EACCES;
2665 :
2666 0 : if (unlikely(name[0] == '.')) {
2667 0 : if (len < 2 || (len == 2 && name[1] == '.'))
2668 : return -EACCES;
2669 : }
2670 :
2671 0 : while (len--) {
2672 0 : unsigned int c = *(const unsigned char *)name++;
2673 0 : if (c == '/' || c == '\0')
2674 : return -EACCES;
2675 : }
2676 : /*
2677 : * See if the low-level filesystem might want
2678 : * to use its own hash..
2679 : */
2680 0 : if (base->d_flags & DCACHE_OP_HASH) {
2681 0 : int err = base->d_op->d_hash(base, this);
2682 0 : if (err < 0)
2683 : return err;
2684 : }
2685 :
2686 0 : return inode_permission(idmap, base->d_inode, MAY_EXEC);
2687 : }
2688 :
2689 : /**
2690 : * try_lookup_one_len - filesystem helper to lookup single pathname component
2691 : * @name: pathname component to lookup
2692 : * @base: base directory to lookup from
2693 : * @len: maximum length @len should be interpreted to
2694 : *
2695 : * Look up a dentry by name in the dcache, returning NULL if it does not
2696 : * currently exist. The function does not try to create a dentry.
2697 : *
2698 : * Note that this routine is purely a helper for filesystem usage and should
2699 : * not be called by generic code.
2700 : *
2701 : * The caller must hold base->i_mutex.
2702 : */
2703 0 : struct dentry *try_lookup_one_len(const char *name, struct dentry *base, int len)
2704 : {
2705 : struct qstr this;
2706 : int err;
2707 :
2708 0 : WARN_ON_ONCE(!inode_is_locked(base->d_inode));
2709 :
2710 0 : err = lookup_one_common(&nop_mnt_idmap, name, base, len, &this);
2711 0 : if (err)
2712 0 : return ERR_PTR(err);
2713 :
2714 0 : return lookup_dcache(&this, base, 0);
2715 : }
2716 : EXPORT_SYMBOL(try_lookup_one_len);
2717 :
2718 : /**
2719 : * lookup_one_len - filesystem helper to lookup single pathname component
2720 : * @name: pathname component to lookup
2721 : * @base: base directory to lookup from
2722 : * @len: maximum length @len should be interpreted to
2723 : *
2724 : * Note that this routine is purely a helper for filesystem usage and should
2725 : * not be called by generic code.
2726 : *
2727 : * The caller must hold base->i_mutex.
2728 : */
2729 0 : struct dentry *lookup_one_len(const char *name, struct dentry *base, int len)
2730 : {
2731 : struct dentry *dentry;
2732 : struct qstr this;
2733 : int err;
2734 :
2735 0 : WARN_ON_ONCE(!inode_is_locked(base->d_inode));
2736 :
2737 0 : err = lookup_one_common(&nop_mnt_idmap, name, base, len, &this);
2738 0 : if (err)
2739 0 : return ERR_PTR(err);
2740 :
2741 0 : dentry = lookup_dcache(&this, base, 0);
2742 0 : return dentry ? dentry : __lookup_slow(&this, base, 0);
2743 : }
2744 : EXPORT_SYMBOL(lookup_one_len);
2745 :
2746 : /**
2747 : * lookup_one - filesystem helper to lookup single pathname component
2748 : * @idmap: idmap of the mount the lookup is performed from
2749 : * @name: pathname component to lookup
2750 : * @base: base directory to lookup from
2751 : * @len: maximum length @len should be interpreted to
2752 : *
2753 : * Note that this routine is purely a helper for filesystem usage and should
2754 : * not be called by generic code.
2755 : *
2756 : * The caller must hold base->i_mutex.
2757 : */
2758 0 : struct dentry *lookup_one(struct mnt_idmap *idmap, const char *name,
2759 : struct dentry *base, int len)
2760 : {
2761 : struct dentry *dentry;
2762 : struct qstr this;
2763 : int err;
2764 :
2765 0 : WARN_ON_ONCE(!inode_is_locked(base->d_inode));
2766 :
2767 0 : err = lookup_one_common(idmap, name, base, len, &this);
2768 0 : if (err)
2769 0 : return ERR_PTR(err);
2770 :
2771 0 : dentry = lookup_dcache(&this, base, 0);
2772 0 : return dentry ? dentry : __lookup_slow(&this, base, 0);
2773 : }
2774 : EXPORT_SYMBOL(lookup_one);
2775 :
2776 : /**
2777 : * lookup_one_unlocked - filesystem helper to lookup single pathname component
2778 : * @idmap: idmap of the mount the lookup is performed from
2779 : * @name: pathname component to lookup
2780 : * @base: base directory to lookup from
2781 : * @len: maximum length @len should be interpreted to
2782 : *
2783 : * Note that this routine is purely a helper for filesystem usage and should
2784 : * not be called by generic code.
2785 : *
2786 : * Unlike lookup_one_len, it should be called without the parent
2787 : * i_mutex held, and will take the i_mutex itself if necessary.
2788 : */
2789 0 : struct dentry *lookup_one_unlocked(struct mnt_idmap *idmap,
2790 : const char *name, struct dentry *base,
2791 : int len)
2792 : {
2793 : struct qstr this;
2794 : int err;
2795 : struct dentry *ret;
2796 :
2797 0 : err = lookup_one_common(idmap, name, base, len, &this);
2798 0 : if (err)
2799 0 : return ERR_PTR(err);
2800 :
2801 0 : ret = lookup_dcache(&this, base, 0);
2802 0 : if (!ret)
2803 0 : ret = lookup_slow(&this, base, 0);
2804 : return ret;
2805 : }
2806 : EXPORT_SYMBOL(lookup_one_unlocked);
2807 :
2808 : /**
2809 : * lookup_one_positive_unlocked - filesystem helper to lookup single
2810 : * pathname component
2811 : * @idmap: idmap of the mount the lookup is performed from
2812 : * @name: pathname component to lookup
2813 : * @base: base directory to lookup from
2814 : * @len: maximum length @len should be interpreted to
2815 : *
2816 : * This helper will yield ERR_PTR(-ENOENT) on negatives. The helper returns
2817 : * known positive or ERR_PTR(). This is what most of the users want.
2818 : *
2819 : * Note that pinned negative with unlocked parent _can_ become positive at any
2820 : * time, so callers of lookup_one_unlocked() need to be very careful; pinned
2821 : * positives have >d_inode stable, so this one avoids such problems.
2822 : *
2823 : * Note that this routine is purely a helper for filesystem usage and should
2824 : * not be called by generic code.
2825 : *
2826 : * The helper should be called without i_mutex held.
2827 : */
2828 0 : struct dentry *lookup_one_positive_unlocked(struct mnt_idmap *idmap,
2829 : const char *name,
2830 : struct dentry *base, int len)
2831 : {
2832 0 : struct dentry *ret = lookup_one_unlocked(idmap, name, base, len);
2833 :
2834 0 : if (!IS_ERR(ret) && d_flags_negative(smp_load_acquire(&ret->d_flags))) {
2835 0 : dput(ret);
2836 0 : ret = ERR_PTR(-ENOENT);
2837 : }
2838 0 : return ret;
2839 : }
2840 : EXPORT_SYMBOL(lookup_one_positive_unlocked);
2841 :
2842 : /**
2843 : * lookup_one_len_unlocked - filesystem helper to lookup single pathname component
2844 : * @name: pathname component to lookup
2845 : * @base: base directory to lookup from
2846 : * @len: maximum length @len should be interpreted to
2847 : *
2848 : * Note that this routine is purely a helper for filesystem usage and should
2849 : * not be called by generic code.
2850 : *
2851 : * Unlike lookup_one_len, it should be called without the parent
2852 : * i_mutex held, and will take the i_mutex itself if necessary.
2853 : */
2854 0 : struct dentry *lookup_one_len_unlocked(const char *name,
2855 : struct dentry *base, int len)
2856 : {
2857 0 : return lookup_one_unlocked(&nop_mnt_idmap, name, base, len);
2858 : }
2859 : EXPORT_SYMBOL(lookup_one_len_unlocked);
2860 :
2861 : /*
2862 : * Like lookup_one_len_unlocked(), except that it yields ERR_PTR(-ENOENT)
2863 : * on negatives. Returns known positive or ERR_PTR(); that's what
2864 : * most of the users want. Note that pinned negative with unlocked parent
2865 : * _can_ become positive at any time, so callers of lookup_one_len_unlocked()
2866 : * need to be very careful; pinned positives have ->d_inode stable, so
2867 : * this one avoids such problems.
2868 : */
2869 0 : struct dentry *lookup_positive_unlocked(const char *name,
2870 : struct dentry *base, int len)
2871 : {
2872 0 : return lookup_one_positive_unlocked(&nop_mnt_idmap, name, base, len);
2873 : }
2874 : EXPORT_SYMBOL(lookup_positive_unlocked);
2875 :
2876 : #ifdef CONFIG_UNIX98_PTYS
2877 0 : int path_pts(struct path *path)
2878 : {
2879 : /* Find something mounted on "pts" in the same directory as
2880 : * the input path.
2881 : */
2882 0 : struct dentry *parent = dget_parent(path->dentry);
2883 : struct dentry *child;
2884 0 : struct qstr this = QSTR_INIT("pts", 3);
2885 :
2886 0 : if (unlikely(!path_connected(path->mnt, parent))) {
2887 0 : dput(parent);
2888 0 : return -ENOENT;
2889 : }
2890 0 : dput(path->dentry);
2891 0 : path->dentry = parent;
2892 0 : child = d_hash_and_lookup(parent, &this);
2893 0 : if (!child)
2894 : return -ENOENT;
2895 :
2896 0 : path->dentry = child;
2897 0 : dput(parent);
2898 0 : follow_down(path, 0);
2899 0 : return 0;
2900 : }
2901 : #endif
2902 :
2903 0 : int user_path_at_empty(int dfd, const char __user *name, unsigned flags,
2904 : struct path *path, int *empty)
2905 : {
2906 0 : struct filename *filename = getname_flags(name, flags, empty);
2907 0 : int ret = filename_lookup(dfd, filename, flags, path, NULL);
2908 :
2909 0 : putname(filename);
2910 0 : return ret;
2911 : }
2912 : EXPORT_SYMBOL(user_path_at_empty);
2913 :
2914 0 : int __check_sticky(struct mnt_idmap *idmap, struct inode *dir,
2915 : struct inode *inode)
2916 : {
2917 0 : kuid_t fsuid = current_fsuid();
2918 :
2919 0 : if (vfsuid_eq_kuid(i_uid_into_vfsuid(idmap, inode), fsuid))
2920 : return 0;
2921 0 : if (vfsuid_eq_kuid(i_uid_into_vfsuid(idmap, dir), fsuid))
2922 : return 0;
2923 0 : return !capable_wrt_inode_uidgid(idmap, inode, CAP_FOWNER);
2924 : }
2925 : EXPORT_SYMBOL(__check_sticky);
2926 :
2927 : /*
2928 : * Check whether we can remove a link victim from directory dir, check
2929 : * whether the type of victim is right.
2930 : * 1. We can't do it if dir is read-only (done in permission())
2931 : * 2. We should have write and exec permissions on dir
2932 : * 3. We can't remove anything from append-only dir
2933 : * 4. We can't do anything with immutable dir (done in permission())
2934 : * 5. If the sticky bit on dir is set we should either
2935 : * a. be owner of dir, or
2936 : * b. be owner of victim, or
2937 : * c. have CAP_FOWNER capability
2938 : * 6. If the victim is append-only or immutable we can't do antyhing with
2939 : * links pointing to it.
2940 : * 7. If the victim has an unknown uid or gid we can't change the inode.
2941 : * 8. If we were asked to remove a directory and victim isn't one - ENOTDIR.
2942 : * 9. If we were asked to remove a non-directory and victim isn't one - EISDIR.
2943 : * 10. We can't remove a root or mountpoint.
2944 : * 11. We don't allow removal of NFS sillyrenamed files; it's handled by
2945 : * nfs_async_unlink().
2946 : */
2947 0 : static int may_delete(struct mnt_idmap *idmap, struct inode *dir,
2948 : struct dentry *victim, bool isdir)
2949 : {
2950 0 : struct inode *inode = d_backing_inode(victim);
2951 : int error;
2952 :
2953 0 : if (d_is_negative(victim))
2954 : return -ENOENT;
2955 0 : BUG_ON(!inode);
2956 :
2957 0 : BUG_ON(victim->d_parent->d_inode != dir);
2958 :
2959 : /* Inode writeback is not safe when the uid or gid are invalid. */
2960 0 : if (!vfsuid_valid(i_uid_into_vfsuid(idmap, inode)) ||
2961 0 : !vfsgid_valid(i_gid_into_vfsgid(idmap, inode)))
2962 : return -EOVERFLOW;
2963 :
2964 0 : audit_inode_child(dir, victim, AUDIT_TYPE_CHILD_DELETE);
2965 :
2966 0 : error = inode_permission(idmap, dir, MAY_WRITE | MAY_EXEC);
2967 0 : if (error)
2968 : return error;
2969 0 : if (IS_APPEND(dir))
2970 : return -EPERM;
2971 :
2972 0 : if (check_sticky(idmap, dir, inode) || IS_APPEND(inode) ||
2973 0 : IS_IMMUTABLE(inode) || IS_SWAPFILE(inode) ||
2974 0 : HAS_UNMAPPED_ID(idmap, inode))
2975 : return -EPERM;
2976 0 : if (isdir) {
2977 0 : if (!d_is_dir(victim))
2978 : return -ENOTDIR;
2979 0 : if (IS_ROOT(victim))
2980 : return -EBUSY;
2981 0 : } else if (d_is_dir(victim))
2982 : return -EISDIR;
2983 0 : if (IS_DEADDIR(dir))
2984 : return -ENOENT;
2985 0 : if (victim->d_flags & DCACHE_NFSFS_RENAMED)
2986 : return -EBUSY;
2987 0 : return 0;
2988 : }
2989 :
2990 : /* Check whether we can create an object with dentry child in directory
2991 : * dir.
2992 : * 1. We can't do it if child already exists (open has special treatment for
2993 : * this case, but since we are inlined it's OK)
2994 : * 2. We can't do it if dir is read-only (done in permission())
2995 : * 3. We can't do it if the fs can't represent the fsuid or fsgid.
2996 : * 4. We should have write and exec permissions on dir
2997 : * 5. We can't do it if dir is immutable (done in permission())
2998 : */
2999 3 : static inline int may_create(struct mnt_idmap *idmap,
3000 : struct inode *dir, struct dentry *child)
3001 : {
3002 3 : audit_inode_child(dir, child, AUDIT_TYPE_CHILD_CREATE);
3003 3 : if (child->d_inode)
3004 : return -EEXIST;
3005 3 : if (IS_DEADDIR(dir))
3006 : return -ENOENT;
3007 3 : if (!fsuidgid_has_mapping(dir->i_sb, idmap))
3008 : return -EOVERFLOW;
3009 :
3010 3 : return inode_permission(idmap, dir, MAY_WRITE | MAY_EXEC);
3011 : }
3012 :
3013 0 : static struct dentry *lock_two_directories(struct dentry *p1, struct dentry *p2)
3014 : {
3015 : struct dentry *p;
3016 :
3017 0 : p = d_ancestor(p2, p1);
3018 0 : if (p) {
3019 0 : inode_lock_nested(p2->d_inode, I_MUTEX_PARENT);
3020 0 : inode_lock_nested(p1->d_inode, I_MUTEX_CHILD);
3021 0 : return p;
3022 : }
3023 :
3024 0 : p = d_ancestor(p1, p2);
3025 0 : if (p) {
3026 0 : inode_lock_nested(p1->d_inode, I_MUTEX_PARENT);
3027 0 : inode_lock_nested(p2->d_inode, I_MUTEX_CHILD);
3028 0 : return p;
3029 : }
3030 :
3031 0 : inode_lock_nested(p1->d_inode, I_MUTEX_PARENT);
3032 0 : inode_lock_nested(p2->d_inode, I_MUTEX_PARENT2);
3033 0 : return NULL;
3034 : }
3035 :
3036 : /*
3037 : * p1 and p2 should be directories on the same fs.
3038 : */
3039 0 : struct dentry *lock_rename(struct dentry *p1, struct dentry *p2)
3040 : {
3041 0 : if (p1 == p2) {
3042 0 : inode_lock_nested(p1->d_inode, I_MUTEX_PARENT);
3043 0 : return NULL;
3044 : }
3045 :
3046 0 : mutex_lock(&p1->d_sb->s_vfs_rename_mutex);
3047 0 : return lock_two_directories(p1, p2);
3048 : }
3049 : EXPORT_SYMBOL(lock_rename);
3050 :
3051 : /*
3052 : * c1 and p2 should be on the same fs.
3053 : */
3054 0 : struct dentry *lock_rename_child(struct dentry *c1, struct dentry *p2)
3055 : {
3056 0 : if (READ_ONCE(c1->d_parent) == p2) {
3057 : /*
3058 : * hopefully won't need to touch ->s_vfs_rename_mutex at all.
3059 : */
3060 0 : inode_lock_nested(p2->d_inode, I_MUTEX_PARENT);
3061 : /*
3062 : * now that p2 is locked, nobody can move in or out of it,
3063 : * so the test below is safe.
3064 : */
3065 0 : if (likely(c1->d_parent == p2))
3066 : return NULL;
3067 :
3068 : /*
3069 : * c1 got moved out of p2 while we'd been taking locks;
3070 : * unlock and fall back to slow case.
3071 : */
3072 0 : inode_unlock(p2->d_inode);
3073 : }
3074 :
3075 0 : mutex_lock(&c1->d_sb->s_vfs_rename_mutex);
3076 : /*
3077 : * nobody can move out of any directories on this fs.
3078 : */
3079 0 : if (likely(c1->d_parent != p2))
3080 0 : return lock_two_directories(c1->d_parent, p2);
3081 :
3082 : /*
3083 : * c1 got moved into p2 while we were taking locks;
3084 : * we need p2 locked and ->s_vfs_rename_mutex unlocked,
3085 : * for consistency with lock_rename().
3086 : */
3087 0 : inode_lock_nested(p2->d_inode, I_MUTEX_PARENT);
3088 0 : mutex_unlock(&c1->d_sb->s_vfs_rename_mutex);
3089 0 : return NULL;
3090 : }
3091 : EXPORT_SYMBOL(lock_rename_child);
3092 :
3093 0 : void unlock_rename(struct dentry *p1, struct dentry *p2)
3094 : {
3095 0 : inode_unlock(p1->d_inode);
3096 0 : if (p1 != p2) {
3097 0 : inode_unlock(p2->d_inode);
3098 0 : mutex_unlock(&p1->d_sb->s_vfs_rename_mutex);
3099 : }
3100 0 : }
3101 : EXPORT_SYMBOL(unlock_rename);
3102 :
3103 : /**
3104 : * mode_strip_umask - handle vfs umask stripping
3105 : * @dir: parent directory of the new inode
3106 : * @mode: mode of the new inode to be created in @dir
3107 : *
3108 : * Umask stripping depends on whether or not the filesystem supports POSIX
3109 : * ACLs. If the filesystem doesn't support it umask stripping is done directly
3110 : * in here. If the filesystem does support POSIX ACLs umask stripping is
3111 : * deferred until the filesystem calls posix_acl_create().
3112 : *
3113 : * Returns: mode
3114 : */
3115 : static inline umode_t mode_strip_umask(const struct inode *dir, umode_t mode)
3116 : {
3117 3 : if (!IS_POSIXACL(dir))
3118 3 : mode &= ~current_umask();
3119 : return mode;
3120 : }
3121 :
3122 : /**
3123 : * vfs_prepare_mode - prepare the mode to be used for a new inode
3124 : * @idmap: idmap of the mount the inode was found from
3125 : * @dir: parent directory of the new inode
3126 : * @mode: mode of the new inode
3127 : * @mask_perms: allowed permission by the vfs
3128 : * @type: type of file to be created
3129 : *
3130 : * This helper consolidates and enforces vfs restrictions on the @mode of a new
3131 : * object to be created.
3132 : *
3133 : * Umask stripping depends on whether the filesystem supports POSIX ACLs (see
3134 : * the kernel documentation for mode_strip_umask()). Moving umask stripping
3135 : * after setgid stripping allows the same ordering for both non-POSIX ACL and
3136 : * POSIX ACL supporting filesystems.
3137 : *
3138 : * Note that it's currently valid for @type to be 0 if a directory is created.
3139 : * Filesystems raise that flag individually and we need to check whether each
3140 : * filesystem can deal with receiving S_IFDIR from the vfs before we enforce a
3141 : * non-zero type.
3142 : *
3143 : * Returns: mode to be passed to the filesystem
3144 : */
3145 3 : static inline umode_t vfs_prepare_mode(struct mnt_idmap *idmap,
3146 : const struct inode *dir, umode_t mode,
3147 : umode_t mask_perms, umode_t type)
3148 : {
3149 3 : mode = mode_strip_sgid(idmap, dir, mode);
3150 6 : mode = mode_strip_umask(dir, mode);
3151 :
3152 : /*
3153 : * Apply the vfs mandated allowed permission mask and set the type of
3154 : * file to be created before we call into the filesystem.
3155 : */
3156 3 : mode &= (mask_perms & ~S_IFMT);
3157 3 : mode |= (type & S_IFMT);
3158 :
3159 3 : return mode;
3160 : }
3161 :
3162 : /**
3163 : * vfs_create - create new file
3164 : * @idmap: idmap of the mount the inode was found from
3165 : * @dir: inode of @dentry
3166 : * @dentry: pointer to dentry of the base directory
3167 : * @mode: mode of the new file
3168 : * @want_excl: whether the file must not yet exist
3169 : *
3170 : * Create a new file.
3171 : *
3172 : * If the inode has been found through an idmapped mount the idmap of
3173 : * the vfsmount must be passed through @idmap. This function will then take
3174 : * care to map the inode according to @idmap before checking permissions.
3175 : * On non-idmapped mounts or if permission checking is to be performed on the
3176 : * raw inode simply passs @nop_mnt_idmap.
3177 : */
3178 0 : int vfs_create(struct mnt_idmap *idmap, struct inode *dir,
3179 : struct dentry *dentry, umode_t mode, bool want_excl)
3180 : {
3181 : int error;
3182 :
3183 0 : error = may_create(idmap, dir, dentry);
3184 0 : if (error)
3185 : return error;
3186 :
3187 0 : if (!dir->i_op->create)
3188 : return -EACCES; /* shouldn't it be ENOSYS? */
3189 :
3190 0 : mode = vfs_prepare_mode(idmap, dir, mode, S_IALLUGO, S_IFREG);
3191 0 : error = security_inode_create(dir, dentry, mode);
3192 : if (error)
3193 : return error;
3194 0 : error = dir->i_op->create(idmap, dir, dentry, mode, want_excl);
3195 0 : if (!error)
3196 : fsnotify_create(dir, dentry);
3197 : return error;
3198 : }
3199 : EXPORT_SYMBOL(vfs_create);
3200 :
3201 0 : int vfs_mkobj(struct dentry *dentry, umode_t mode,
3202 : int (*f)(struct dentry *, umode_t, void *),
3203 : void *arg)
3204 : {
3205 0 : struct inode *dir = dentry->d_parent->d_inode;
3206 0 : int error = may_create(&nop_mnt_idmap, dir, dentry);
3207 0 : if (error)
3208 : return error;
3209 :
3210 0 : mode &= S_IALLUGO;
3211 0 : mode |= S_IFREG;
3212 0 : error = security_inode_create(dir, dentry, mode);
3213 : if (error)
3214 : return error;
3215 0 : error = f(dentry, mode, arg);
3216 0 : if (!error)
3217 : fsnotify_create(dir, dentry);
3218 : return error;
3219 : }
3220 : EXPORT_SYMBOL(vfs_mkobj);
3221 :
3222 0 : bool may_open_dev(const struct path *path)
3223 : {
3224 0 : return !(path->mnt->mnt_flags & MNT_NODEV) &&
3225 0 : !(path->mnt->mnt_sb->s_iflags & SB_I_NODEV);
3226 : }
3227 :
3228 0 : static int may_open(struct mnt_idmap *idmap, const struct path *path,
3229 : int acc_mode, int flag)
3230 : {
3231 0 : struct dentry *dentry = path->dentry;
3232 0 : struct inode *inode = dentry->d_inode;
3233 : int error;
3234 :
3235 0 : if (!inode)
3236 : return -ENOENT;
3237 :
3238 0 : switch (inode->i_mode & S_IFMT) {
3239 : case S_IFLNK:
3240 : return -ELOOP;
3241 : case S_IFDIR:
3242 0 : if (acc_mode & MAY_WRITE)
3243 : return -EISDIR;
3244 0 : if (acc_mode & MAY_EXEC)
3245 : return -EACCES;
3246 : break;
3247 : case S_IFBLK:
3248 : case S_IFCHR:
3249 0 : if (!may_open_dev(path))
3250 : return -EACCES;
3251 : fallthrough;
3252 : case S_IFIFO:
3253 : case S_IFSOCK:
3254 0 : if (acc_mode & MAY_EXEC)
3255 : return -EACCES;
3256 0 : flag &= ~O_TRUNC;
3257 0 : break;
3258 : case S_IFREG:
3259 0 : if ((acc_mode & MAY_EXEC) && path_noexec(path))
3260 : return -EACCES;
3261 : break;
3262 : }
3263 :
3264 0 : error = inode_permission(idmap, inode, MAY_OPEN | acc_mode);
3265 0 : if (error)
3266 : return error;
3267 :
3268 : /*
3269 : * An append-only file must be opened in append mode for writing.
3270 : */
3271 0 : if (IS_APPEND(inode)) {
3272 0 : if ((flag & O_ACCMODE) != O_RDONLY && !(flag & O_APPEND))
3273 : return -EPERM;
3274 0 : if (flag & O_TRUNC)
3275 : return -EPERM;
3276 : }
3277 :
3278 : /* O_NOATIME can only be set by the owner or superuser */
3279 0 : if (flag & O_NOATIME && !inode_owner_or_capable(idmap, inode))
3280 : return -EPERM;
3281 :
3282 : return 0;
3283 : }
3284 :
3285 0 : static int handle_truncate(struct mnt_idmap *idmap, struct file *filp)
3286 : {
3287 0 : const struct path *path = &filp->f_path;
3288 0 : struct inode *inode = path->dentry->d_inode;
3289 0 : int error = get_write_access(inode);
3290 0 : if (error)
3291 : return error;
3292 :
3293 0 : error = security_file_truncate(filp);
3294 : if (!error) {
3295 0 : error = do_truncate(idmap, path->dentry, 0,
3296 : ATTR_MTIME|ATTR_CTIME|ATTR_OPEN,
3297 : filp);
3298 : }
3299 0 : put_write_access(inode);
3300 0 : return error;
3301 : }
3302 :
3303 : static inline int open_to_namei_flags(int flag)
3304 : {
3305 0 : if ((flag & O_ACCMODE) == 3)
3306 0 : flag--;
3307 : return flag;
3308 : }
3309 :
3310 0 : static int may_o_create(struct mnt_idmap *idmap,
3311 : const struct path *dir, struct dentry *dentry,
3312 : umode_t mode)
3313 : {
3314 0 : int error = security_path_mknod(dir, dentry, mode, 0);
3315 : if (error)
3316 : return error;
3317 :
3318 0 : if (!fsuidgid_has_mapping(dir->dentry->d_sb, idmap))
3319 : return -EOVERFLOW;
3320 :
3321 0 : error = inode_permission(idmap, dir->dentry->d_inode,
3322 : MAY_WRITE | MAY_EXEC);
3323 0 : if (error)
3324 : return error;
3325 :
3326 0 : return security_inode_create(dir->dentry->d_inode, dentry, mode);
3327 : }
3328 :
3329 : /*
3330 : * Attempt to atomically look up, create and open a file from a negative
3331 : * dentry.
3332 : *
3333 : * Returns 0 if successful. The file will have been created and attached to
3334 : * @file by the filesystem calling finish_open().
3335 : *
3336 : * If the file was looked up only or didn't need creating, FMODE_OPENED won't
3337 : * be set. The caller will need to perform the open themselves. @path will
3338 : * have been updated to point to the new dentry. This may be negative.
3339 : *
3340 : * Returns an error code otherwise.
3341 : */
3342 0 : static struct dentry *atomic_open(struct nameidata *nd, struct dentry *dentry,
3343 : struct file *file,
3344 : int open_flag, umode_t mode)
3345 : {
3346 0 : struct dentry *const DENTRY_NOT_SET = (void *) -1UL;
3347 0 : struct inode *dir = nd->path.dentry->d_inode;
3348 : int error;
3349 :
3350 0 : if (nd->flags & LOOKUP_DIRECTORY)
3351 0 : open_flag |= O_DIRECTORY;
3352 :
3353 0 : file->f_path.dentry = DENTRY_NOT_SET;
3354 0 : file->f_path.mnt = nd->path.mnt;
3355 0 : error = dir->i_op->atomic_open(dir, dentry, file,
3356 0 : open_to_namei_flags(open_flag), mode);
3357 0 : d_lookup_done(dentry);
3358 0 : if (!error) {
3359 0 : if (file->f_mode & FMODE_OPENED) {
3360 0 : if (unlikely(dentry != file->f_path.dentry)) {
3361 0 : dput(dentry);
3362 0 : dentry = dget(file->f_path.dentry);
3363 : }
3364 0 : } else if (WARN_ON(file->f_path.dentry == DENTRY_NOT_SET)) {
3365 : error = -EIO;
3366 : } else {
3367 0 : if (file->f_path.dentry) {
3368 0 : dput(dentry);
3369 0 : dentry = file->f_path.dentry;
3370 : }
3371 0 : if (unlikely(d_is_negative(dentry)))
3372 0 : error = -ENOENT;
3373 : }
3374 : }
3375 0 : if (error) {
3376 0 : dput(dentry);
3377 0 : dentry = ERR_PTR(error);
3378 : }
3379 0 : return dentry;
3380 : }
3381 :
3382 : /*
3383 : * Look up and maybe create and open the last component.
3384 : *
3385 : * Must be called with parent locked (exclusive in O_CREAT case).
3386 : *
3387 : * Returns 0 on success, that is, if
3388 : * the file was successfully atomically created (if necessary) and opened, or
3389 : * the file was not completely opened at this time, though lookups and
3390 : * creations were performed.
3391 : * These case are distinguished by presence of FMODE_OPENED on file->f_mode.
3392 : * In the latter case dentry returned in @path might be negative if O_CREAT
3393 : * hadn't been specified.
3394 : *
3395 : * An error code is returned on failure.
3396 : */
3397 0 : static struct dentry *lookup_open(struct nameidata *nd, struct file *file,
3398 : const struct open_flags *op,
3399 : bool got_write)
3400 : {
3401 : struct mnt_idmap *idmap;
3402 0 : struct dentry *dir = nd->path.dentry;
3403 0 : struct inode *dir_inode = dir->d_inode;
3404 0 : int open_flag = op->open_flag;
3405 : struct dentry *dentry;
3406 0 : int error, create_error = 0;
3407 0 : umode_t mode = op->mode;
3408 0 : DECLARE_WAIT_QUEUE_HEAD_ONSTACK(wq);
3409 :
3410 0 : if (unlikely(IS_DEADDIR(dir_inode)))
3411 : return ERR_PTR(-ENOENT);
3412 :
3413 0 : file->f_mode &= ~FMODE_CREATED;
3414 0 : dentry = d_lookup(dir, &nd->last);
3415 : for (;;) {
3416 0 : if (!dentry) {
3417 0 : dentry = d_alloc_parallel(dir, &nd->last, &wq);
3418 0 : if (IS_ERR(dentry))
3419 : return dentry;
3420 : }
3421 0 : if (d_in_lookup(dentry))
3422 : break;
3423 :
3424 0 : error = d_revalidate(dentry, nd->flags);
3425 0 : if (likely(error > 0))
3426 : break;
3427 0 : if (error)
3428 : goto out_dput;
3429 0 : d_invalidate(dentry);
3430 0 : dput(dentry);
3431 0 : dentry = NULL;
3432 : }
3433 0 : if (dentry->d_inode) {
3434 : /* Cached positive dentry: will open in f_op->open */
3435 : return dentry;
3436 : }
3437 :
3438 : /*
3439 : * Checking write permission is tricky, bacuse we don't know if we are
3440 : * going to actually need it: O_CREAT opens should work as long as the
3441 : * file exists. But checking existence breaks atomicity. The trick is
3442 : * to check access and if not granted clear O_CREAT from the flags.
3443 : *
3444 : * Another problem is returing the "right" error value (e.g. for an
3445 : * O_EXCL open we want to return EEXIST not EROFS).
3446 : */
3447 0 : if (unlikely(!got_write))
3448 0 : open_flag &= ~O_TRUNC;
3449 0 : idmap = mnt_idmap(nd->path.mnt);
3450 0 : if (open_flag & O_CREAT) {
3451 0 : if (open_flag & O_EXCL)
3452 0 : open_flag &= ~O_TRUNC;
3453 0 : mode = vfs_prepare_mode(idmap, dir->d_inode, mode, mode, mode);
3454 0 : if (likely(got_write))
3455 0 : create_error = may_o_create(idmap, &nd->path,
3456 : dentry, mode);
3457 : else
3458 : create_error = -EROFS;
3459 : }
3460 0 : if (create_error)
3461 0 : open_flag &= ~O_CREAT;
3462 0 : if (dir_inode->i_op->atomic_open) {
3463 0 : dentry = atomic_open(nd, dentry, file, open_flag, mode);
3464 0 : if (unlikely(create_error) && dentry == ERR_PTR(-ENOENT))
3465 0 : dentry = ERR_PTR(create_error);
3466 : return dentry;
3467 : }
3468 :
3469 0 : if (d_in_lookup(dentry)) {
3470 0 : struct dentry *res = dir_inode->i_op->lookup(dir_inode, dentry,
3471 : nd->flags);
3472 0 : d_lookup_done(dentry);
3473 0 : if (unlikely(res)) {
3474 0 : if (IS_ERR(res)) {
3475 0 : error = PTR_ERR(res);
3476 0 : goto out_dput;
3477 : }
3478 0 : dput(dentry);
3479 0 : dentry = res;
3480 : }
3481 : }
3482 :
3483 : /* Negative dentry, just create the file */
3484 0 : if (!dentry->d_inode && (open_flag & O_CREAT)) {
3485 0 : file->f_mode |= FMODE_CREATED;
3486 0 : audit_inode_child(dir_inode, dentry, AUDIT_TYPE_CHILD_CREATE);
3487 0 : if (!dir_inode->i_op->create) {
3488 : error = -EACCES;
3489 : goto out_dput;
3490 : }
3491 :
3492 0 : error = dir_inode->i_op->create(idmap, dir_inode, dentry,
3493 0 : mode, open_flag & O_EXCL);
3494 0 : if (error)
3495 : goto out_dput;
3496 : }
3497 0 : if (unlikely(create_error) && !dentry->d_inode) {
3498 : error = create_error;
3499 : goto out_dput;
3500 : }
3501 : return dentry;
3502 :
3503 : out_dput:
3504 0 : dput(dentry);
3505 0 : return ERR_PTR(error);
3506 : }
3507 :
3508 0 : static const char *open_last_lookups(struct nameidata *nd,
3509 : struct file *file, const struct open_flags *op)
3510 : {
3511 0 : struct dentry *dir = nd->path.dentry;
3512 0 : int open_flag = op->open_flag;
3513 0 : bool got_write = false;
3514 : struct dentry *dentry;
3515 : const char *res;
3516 :
3517 0 : nd->flags |= op->intent;
3518 :
3519 0 : if (nd->last_type != LAST_NORM) {
3520 0 : if (nd->depth)
3521 0 : put_link(nd);
3522 0 : return handle_dots(nd, nd->last_type);
3523 : }
3524 :
3525 0 : if (!(open_flag & O_CREAT)) {
3526 0 : if (nd->last.name[nd->last.len])
3527 0 : nd->flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY;
3528 : /* we _can_ be in RCU mode here */
3529 0 : dentry = lookup_fast(nd);
3530 0 : if (IS_ERR(dentry))
3531 : return ERR_CAST(dentry);
3532 0 : if (likely(dentry))
3533 : goto finish_lookup;
3534 :
3535 0 : BUG_ON(nd->flags & LOOKUP_RCU);
3536 : } else {
3537 : /* create side of things */
3538 0 : if (nd->flags & LOOKUP_RCU) {
3539 0 : if (!try_to_unlazy(nd))
3540 : return ERR_PTR(-ECHILD);
3541 : }
3542 0 : audit_inode(nd->name, dir, AUDIT_INODE_PARENT);
3543 : /* trailing slashes? */
3544 0 : if (unlikely(nd->last.name[nd->last.len]))
3545 : return ERR_PTR(-EISDIR);
3546 : }
3547 :
3548 0 : if (open_flag & (O_CREAT | O_TRUNC | O_WRONLY | O_RDWR)) {
3549 0 : got_write = !mnt_want_write(nd->path.mnt);
3550 : /*
3551 : * do _not_ fail yet - we might not need that or fail with
3552 : * a different error; let lookup_open() decide; we'll be
3553 : * dropping this one anyway.
3554 : */
3555 : }
3556 0 : if (open_flag & O_CREAT)
3557 0 : inode_lock(dir->d_inode);
3558 : else
3559 0 : inode_lock_shared(dir->d_inode);
3560 0 : dentry = lookup_open(nd, file, op, got_write);
3561 0 : if (!IS_ERR(dentry) && (file->f_mode & FMODE_CREATED))
3562 0 : fsnotify_create(dir->d_inode, dentry);
3563 0 : if (open_flag & O_CREAT)
3564 0 : inode_unlock(dir->d_inode);
3565 : else
3566 0 : inode_unlock_shared(dir->d_inode);
3567 :
3568 0 : if (got_write)
3569 0 : mnt_drop_write(nd->path.mnt);
3570 :
3571 0 : if (IS_ERR(dentry))
3572 : return ERR_CAST(dentry);
3573 :
3574 0 : if (file->f_mode & (FMODE_OPENED | FMODE_CREATED)) {
3575 0 : dput(nd->path.dentry);
3576 0 : nd->path.dentry = dentry;
3577 0 : return NULL;
3578 : }
3579 :
3580 : finish_lookup:
3581 0 : if (nd->depth)
3582 0 : put_link(nd);
3583 0 : res = step_into(nd, WALK_TRAILING, dentry);
3584 0 : if (unlikely(res))
3585 0 : nd->flags &= ~(LOOKUP_OPEN|LOOKUP_CREATE|LOOKUP_EXCL);
3586 : return res;
3587 : }
3588 :
3589 : /*
3590 : * Handle the last step of open()
3591 : */
3592 0 : static int do_open(struct nameidata *nd,
3593 : struct file *file, const struct open_flags *op)
3594 : {
3595 : struct mnt_idmap *idmap;
3596 0 : int open_flag = op->open_flag;
3597 : bool do_truncate;
3598 : int acc_mode;
3599 : int error;
3600 :
3601 0 : if (!(file->f_mode & (FMODE_OPENED | FMODE_CREATED))) {
3602 0 : error = complete_walk(nd);
3603 0 : if (error)
3604 : return error;
3605 : }
3606 : if (!(file->f_mode & FMODE_CREATED))
3607 : audit_inode(nd->name, nd->path.dentry, 0);
3608 0 : idmap = mnt_idmap(nd->path.mnt);
3609 0 : if (open_flag & O_CREAT) {
3610 0 : if ((open_flag & O_EXCL) && !(file->f_mode & FMODE_CREATED))
3611 : return -EEXIST;
3612 0 : if (d_is_dir(nd->path.dentry))
3613 : return -EISDIR;
3614 0 : error = may_create_in_sticky(idmap, nd,
3615 : d_backing_inode(nd->path.dentry));
3616 0 : if (unlikely(error))
3617 : return error;
3618 : }
3619 0 : if ((nd->flags & LOOKUP_DIRECTORY) && !d_can_lookup(nd->path.dentry))
3620 : return -ENOTDIR;
3621 :
3622 0 : do_truncate = false;
3623 0 : acc_mode = op->acc_mode;
3624 0 : if (file->f_mode & FMODE_CREATED) {
3625 : /* Don't check for write permission, don't truncate */
3626 0 : open_flag &= ~O_TRUNC;
3627 0 : acc_mode = 0;
3628 0 : } else if (d_is_reg(nd->path.dentry) && open_flag & O_TRUNC) {
3629 0 : error = mnt_want_write(nd->path.mnt);
3630 0 : if (error)
3631 : return error;
3632 : do_truncate = true;
3633 : }
3634 0 : error = may_open(idmap, &nd->path, acc_mode, open_flag);
3635 0 : if (!error && !(file->f_mode & FMODE_OPENED))
3636 0 : error = vfs_open(&nd->path, file);
3637 0 : if (!error)
3638 0 : error = ima_file_check(file, op->acc_mode);
3639 0 : if (!error && do_truncate)
3640 0 : error = handle_truncate(idmap, file);
3641 0 : if (unlikely(error > 0)) {
3642 0 : WARN_ON(1);
3643 0 : error = -EINVAL;
3644 : }
3645 0 : if (do_truncate)
3646 0 : mnt_drop_write(nd->path.mnt);
3647 : return error;
3648 : }
3649 :
3650 : /**
3651 : * vfs_tmpfile - create tmpfile
3652 : * @idmap: idmap of the mount the inode was found from
3653 : * @parentpath: pointer to the path of the base directory
3654 : * @file: file descriptor of the new tmpfile
3655 : * @mode: mode of the new tmpfile
3656 : *
3657 : * Create a temporary file.
3658 : *
3659 : * If the inode has been found through an idmapped mount the idmap of
3660 : * the vfsmount must be passed through @idmap. This function will then take
3661 : * care to map the inode according to @idmap before checking permissions.
3662 : * On non-idmapped mounts or if permission checking is to be performed on the
3663 : * raw inode simply passs @nop_mnt_idmap.
3664 : */
3665 0 : static int vfs_tmpfile(struct mnt_idmap *idmap,
3666 : const struct path *parentpath,
3667 : struct file *file, umode_t mode)
3668 : {
3669 : struct dentry *child;
3670 0 : struct inode *dir = d_inode(parentpath->dentry);
3671 : struct inode *inode;
3672 : int error;
3673 0 : int open_flag = file->f_flags;
3674 :
3675 : /* we want directory to be writable */
3676 0 : error = inode_permission(idmap, dir, MAY_WRITE | MAY_EXEC);
3677 0 : if (error)
3678 : return error;
3679 0 : if (!dir->i_op->tmpfile)
3680 : return -EOPNOTSUPP;
3681 0 : child = d_alloc(parentpath->dentry, &slash_name);
3682 0 : if (unlikely(!child))
3683 : return -ENOMEM;
3684 0 : file->f_path.mnt = parentpath->mnt;
3685 0 : file->f_path.dentry = child;
3686 0 : mode = vfs_prepare_mode(idmap, dir, mode, mode, mode);
3687 0 : error = dir->i_op->tmpfile(idmap, dir, file, mode);
3688 0 : dput(child);
3689 0 : if (error)
3690 : return error;
3691 : /* Don't check for other permissions, the inode was just created */
3692 0 : error = may_open(idmap, &file->f_path, 0, file->f_flags);
3693 0 : if (error)
3694 : return error;
3695 0 : inode = file_inode(file);
3696 0 : if (!(open_flag & O_EXCL)) {
3697 0 : spin_lock(&inode->i_lock);
3698 0 : inode->i_state |= I_LINKABLE;
3699 0 : spin_unlock(&inode->i_lock);
3700 : }
3701 : ima_post_create_tmpfile(idmap, inode);
3702 : return 0;
3703 : }
3704 :
3705 : /**
3706 : * vfs_tmpfile_open - open a tmpfile for kernel internal use
3707 : * @idmap: idmap of the mount the inode was found from
3708 : * @parentpath: path of the base directory
3709 : * @mode: mode of the new tmpfile
3710 : * @open_flag: flags
3711 : * @cred: credentials for open
3712 : *
3713 : * Create and open a temporary file. The file is not accounted in nr_files,
3714 : * hence this is only for kernel internal use, and must not be installed into
3715 : * file tables or such.
3716 : */
3717 0 : struct file *vfs_tmpfile_open(struct mnt_idmap *idmap,
3718 : const struct path *parentpath,
3719 : umode_t mode, int open_flag, const struct cred *cred)
3720 : {
3721 : struct file *file;
3722 : int error;
3723 :
3724 0 : file = alloc_empty_file_noaccount(open_flag, cred);
3725 0 : if (!IS_ERR(file)) {
3726 0 : error = vfs_tmpfile(idmap, parentpath, file, mode);
3727 0 : if (error) {
3728 0 : fput(file);
3729 0 : file = ERR_PTR(error);
3730 : }
3731 : }
3732 0 : return file;
3733 : }
3734 : EXPORT_SYMBOL(vfs_tmpfile_open);
3735 :
3736 0 : static int do_tmpfile(struct nameidata *nd, unsigned flags,
3737 : const struct open_flags *op,
3738 : struct file *file)
3739 : {
3740 : struct path path;
3741 0 : int error = path_lookupat(nd, flags | LOOKUP_DIRECTORY, &path);
3742 :
3743 0 : if (unlikely(error))
3744 : return error;
3745 0 : error = mnt_want_write(path.mnt);
3746 0 : if (unlikely(error))
3747 : goto out;
3748 0 : error = vfs_tmpfile(mnt_idmap(path.mnt), &path, file, op->mode);
3749 : if (error)
3750 : goto out2;
3751 : audit_inode(nd->name, file->f_path.dentry, 0);
3752 : out2:
3753 0 : mnt_drop_write(path.mnt);
3754 : out:
3755 0 : path_put(&path);
3756 : return error;
3757 : }
3758 :
3759 0 : static int do_o_path(struct nameidata *nd, unsigned flags, struct file *file)
3760 : {
3761 : struct path path;
3762 0 : int error = path_lookupat(nd, flags, &path);
3763 0 : if (!error) {
3764 0 : audit_inode(nd->name, path.dentry, 0);
3765 0 : error = vfs_open(&path, file);
3766 : path_put(&path);
3767 : }
3768 0 : return error;
3769 : }
3770 :
3771 0 : static struct file *path_openat(struct nameidata *nd,
3772 : const struct open_flags *op, unsigned flags)
3773 : {
3774 : struct file *file;
3775 : int error;
3776 :
3777 0 : file = alloc_empty_file(op->open_flag, current_cred());
3778 0 : if (IS_ERR(file))
3779 : return file;
3780 :
3781 0 : if (unlikely(file->f_flags & __O_TMPFILE)) {
3782 0 : error = do_tmpfile(nd, flags, op, file);
3783 0 : } else if (unlikely(file->f_flags & O_PATH)) {
3784 0 : error = do_o_path(nd, flags, file);
3785 : } else {
3786 0 : const char *s = path_init(nd, flags);
3787 0 : while (!(error = link_path_walk(s, nd)) &&
3788 : (s = open_last_lookups(nd, file, op)) != NULL)
3789 : ;
3790 0 : if (!error)
3791 0 : error = do_open(nd, file, op);
3792 0 : terminate_walk(nd);
3793 : }
3794 0 : if (likely(!error)) {
3795 0 : if (likely(file->f_mode & FMODE_OPENED))
3796 : return file;
3797 0 : WARN_ON(1);
3798 0 : error = -EINVAL;
3799 : }
3800 0 : fput(file);
3801 0 : if (error == -EOPENSTALE) {
3802 0 : if (flags & LOOKUP_RCU)
3803 : error = -ECHILD;
3804 : else
3805 0 : error = -ESTALE;
3806 : }
3807 0 : return ERR_PTR(error);
3808 : }
3809 :
3810 0 : struct file *do_filp_open(int dfd, struct filename *pathname,
3811 : const struct open_flags *op)
3812 : {
3813 : struct nameidata nd;
3814 0 : int flags = op->lookup_flags;
3815 : struct file *filp;
3816 :
3817 0 : set_nameidata(&nd, dfd, pathname, NULL);
3818 0 : filp = path_openat(&nd, op, flags | LOOKUP_RCU);
3819 0 : if (unlikely(filp == ERR_PTR(-ECHILD)))
3820 0 : filp = path_openat(&nd, op, flags);
3821 0 : if (unlikely(filp == ERR_PTR(-ESTALE)))
3822 0 : filp = path_openat(&nd, op, flags | LOOKUP_REVAL);
3823 0 : restore_nameidata();
3824 0 : return filp;
3825 : }
3826 :
3827 0 : struct file *do_file_open_root(const struct path *root,
3828 : const char *name, const struct open_flags *op)
3829 : {
3830 : struct nameidata nd;
3831 : struct file *file;
3832 : struct filename *filename;
3833 0 : int flags = op->lookup_flags;
3834 :
3835 0 : if (d_is_symlink(root->dentry) && op->intent & LOOKUP_OPEN)
3836 : return ERR_PTR(-ELOOP);
3837 :
3838 0 : filename = getname_kernel(name);
3839 0 : if (IS_ERR(filename))
3840 : return ERR_CAST(filename);
3841 :
3842 0 : set_nameidata(&nd, -1, filename, root);
3843 0 : file = path_openat(&nd, op, flags | LOOKUP_RCU);
3844 0 : if (unlikely(file == ERR_PTR(-ECHILD)))
3845 0 : file = path_openat(&nd, op, flags);
3846 0 : if (unlikely(file == ERR_PTR(-ESTALE)))
3847 0 : file = path_openat(&nd, op, flags | LOOKUP_REVAL);
3848 0 : restore_nameidata();
3849 0 : putname(filename);
3850 0 : return file;
3851 : }
3852 :
3853 3 : static struct dentry *filename_create(int dfd, struct filename *name,
3854 : struct path *path, unsigned int lookup_flags)
3855 : {
3856 3 : struct dentry *dentry = ERR_PTR(-EEXIST);
3857 : struct qstr last;
3858 3 : bool want_dir = lookup_flags & LOOKUP_DIRECTORY;
3859 3 : unsigned int reval_flag = lookup_flags & LOOKUP_REVAL;
3860 3 : unsigned int create_flags = LOOKUP_CREATE | LOOKUP_EXCL;
3861 : int type;
3862 : int err2;
3863 : int error;
3864 :
3865 3 : error = filename_parentat(dfd, name, reval_flag, path, &last, &type);
3866 3 : if (error)
3867 0 : return ERR_PTR(error);
3868 :
3869 : /*
3870 : * Yucky last component or no last component at all?
3871 : * (foo/., foo/.., /////)
3872 : */
3873 3 : if (unlikely(type != LAST_NORM))
3874 : goto out;
3875 :
3876 : /* don't fail immediately if it's r/o, at least try to report other errors */
3877 3 : err2 = mnt_want_write(path->mnt);
3878 : /*
3879 : * Do the final lookup. Suppress 'create' if there is a trailing
3880 : * '/', and a directory wasn't requested.
3881 : */
3882 3 : if (last.name[last.len] && !want_dir)
3883 0 : create_flags = 0;
3884 6 : inode_lock_nested(path->dentry->d_inode, I_MUTEX_PARENT);
3885 3 : dentry = lookup_one_qstr_excl(&last, path->dentry,
3886 : reval_flag | create_flags);
3887 3 : if (IS_ERR(dentry))
3888 : goto unlock;
3889 :
3890 3 : error = -EEXIST;
3891 3 : if (d_is_positive(dentry))
3892 : goto fail;
3893 :
3894 : /*
3895 : * Special case - lookup gave negative, but... we had foo/bar/
3896 : * From the vfs_mknod() POV we just have a negative dentry -
3897 : * all is fine. Let's be bastards - you had / on the end, you've
3898 : * been asking for (non-existent) directory. -ENOENT for you.
3899 : */
3900 3 : if (unlikely(!create_flags)) {
3901 : error = -ENOENT;
3902 : goto fail;
3903 : }
3904 3 : if (unlikely(err2)) {
3905 : error = err2;
3906 : goto fail;
3907 : }
3908 : return dentry;
3909 : fail:
3910 0 : dput(dentry);
3911 0 : dentry = ERR_PTR(error);
3912 : unlock:
3913 0 : inode_unlock(path->dentry->d_inode);
3914 0 : if (!err2)
3915 0 : mnt_drop_write(path->mnt);
3916 : out:
3917 0 : path_put(path);
3918 0 : return dentry;
3919 : }
3920 :
3921 3 : struct dentry *kern_path_create(int dfd, const char *pathname,
3922 : struct path *path, unsigned int lookup_flags)
3923 : {
3924 3 : struct filename *filename = getname_kernel(pathname);
3925 3 : struct dentry *res = filename_create(dfd, filename, path, lookup_flags);
3926 :
3927 3 : putname(filename);
3928 3 : return res;
3929 : }
3930 : EXPORT_SYMBOL(kern_path_create);
3931 :
3932 3 : void done_path_create(struct path *path, struct dentry *dentry)
3933 : {
3934 3 : dput(dentry);
3935 6 : inode_unlock(path->dentry->d_inode);
3936 3 : mnt_drop_write(path->mnt);
3937 3 : path_put(path);
3938 3 : }
3939 : EXPORT_SYMBOL(done_path_create);
3940 :
3941 0 : inline struct dentry *user_path_create(int dfd, const char __user *pathname,
3942 : struct path *path, unsigned int lookup_flags)
3943 : {
3944 0 : struct filename *filename = getname(pathname);
3945 0 : struct dentry *res = filename_create(dfd, filename, path, lookup_flags);
3946 :
3947 0 : putname(filename);
3948 0 : return res;
3949 : }
3950 : EXPORT_SYMBOL(user_path_create);
3951 :
3952 : /**
3953 : * vfs_mknod - create device node or file
3954 : * @idmap: idmap of the mount the inode was found from
3955 : * @dir: inode of @dentry
3956 : * @dentry: pointer to dentry of the base directory
3957 : * @mode: mode of the new device node or file
3958 : * @dev: device number of device to create
3959 : *
3960 : * Create a device node or file.
3961 : *
3962 : * If the inode has been found through an idmapped mount the idmap of
3963 : * the vfsmount must be passed through @idmap. This function will then take
3964 : * care to map the inode according to @idmap before checking permissions.
3965 : * On non-idmapped mounts or if permission checking is to be performed on the
3966 : * raw inode simply passs @nop_mnt_idmap.
3967 : */
3968 1 : int vfs_mknod(struct mnt_idmap *idmap, struct inode *dir,
3969 : struct dentry *dentry, umode_t mode, dev_t dev)
3970 : {
3971 1 : bool is_whiteout = S_ISCHR(mode) && dev == WHITEOUT_DEV;
3972 1 : int error = may_create(idmap, dir, dentry);
3973 :
3974 1 : if (error)
3975 : return error;
3976 :
3977 2 : if ((S_ISCHR(mode) || S_ISBLK(mode)) && !is_whiteout &&
3978 1 : !capable(CAP_MKNOD))
3979 : return -EPERM;
3980 :
3981 1 : if (!dir->i_op->mknod)
3982 : return -EPERM;
3983 :
3984 1 : mode = vfs_prepare_mode(idmap, dir, mode, mode, mode);
3985 1 : error = devcgroup_inode_mknod(mode, dev);
3986 : if (error)
3987 : return error;
3988 :
3989 1 : error = security_inode_mknod(dir, dentry, mode, dev);
3990 : if (error)
3991 : return error;
3992 :
3993 1 : error = dir->i_op->mknod(idmap, dir, dentry, mode, dev);
3994 1 : if (!error)
3995 : fsnotify_create(dir, dentry);
3996 : return error;
3997 : }
3998 : EXPORT_SYMBOL(vfs_mknod);
3999 :
4000 : static int may_mknod(umode_t mode)
4001 : {
4002 0 : switch (mode & S_IFMT) {
4003 : case S_IFREG:
4004 : case S_IFCHR:
4005 : case S_IFBLK:
4006 : case S_IFIFO:
4007 : case S_IFSOCK:
4008 : case 0: /* zero mode translates to S_IFREG */
4009 : return 0;
4010 : case S_IFDIR:
4011 : return -EPERM;
4012 : default:
4013 : return -EINVAL;
4014 : }
4015 : }
4016 :
4017 0 : static int do_mknodat(int dfd, struct filename *name, umode_t mode,
4018 : unsigned int dev)
4019 : {
4020 : struct mnt_idmap *idmap;
4021 : struct dentry *dentry;
4022 : struct path path;
4023 : int error;
4024 0 : unsigned int lookup_flags = 0;
4025 :
4026 0 : error = may_mknod(mode);
4027 0 : if (error)
4028 : goto out1;
4029 : retry:
4030 0 : dentry = filename_create(dfd, name, &path, lookup_flags);
4031 0 : error = PTR_ERR(dentry);
4032 0 : if (IS_ERR(dentry))
4033 : goto out1;
4034 :
4035 0 : error = security_path_mknod(&path, dentry,
4036 0 : mode_strip_umask(path.dentry->d_inode, mode), dev);
4037 : if (error)
4038 : goto out2;
4039 :
4040 0 : idmap = mnt_idmap(path.mnt);
4041 0 : switch (mode & S_IFMT) {
4042 : case 0: case S_IFREG:
4043 0 : error = vfs_create(idmap, path.dentry->d_inode,
4044 : dentry, mode, true);
4045 : if (!error)
4046 : ima_post_path_mknod(idmap, dentry);
4047 : break;
4048 : case S_IFCHR: case S_IFBLK:
4049 0 : error = vfs_mknod(idmap, path.dentry->d_inode,
4050 : dentry, mode, new_decode_dev(dev));
4051 0 : break;
4052 : case S_IFIFO: case S_IFSOCK:
4053 0 : error = vfs_mknod(idmap, path.dentry->d_inode,
4054 : dentry, mode, 0);
4055 0 : break;
4056 : }
4057 : out2:
4058 0 : done_path_create(&path, dentry);
4059 0 : if (retry_estale(error, lookup_flags)) {
4060 : lookup_flags |= LOOKUP_REVAL;
4061 : goto retry;
4062 : }
4063 : out1:
4064 0 : putname(name);
4065 0 : return error;
4066 : }
4067 :
4068 0 : SYSCALL_DEFINE4(mknodat, int, dfd, const char __user *, filename, umode_t, mode,
4069 : unsigned int, dev)
4070 : {
4071 0 : return do_mknodat(dfd, getname(filename), mode, dev);
4072 : }
4073 :
4074 0 : SYSCALL_DEFINE3(mknod, const char __user *, filename, umode_t, mode, unsigned, dev)
4075 : {
4076 0 : return do_mknodat(AT_FDCWD, getname(filename), mode, dev);
4077 : }
4078 :
4079 : /**
4080 : * vfs_mkdir - create directory
4081 : * @idmap: idmap of the mount the inode was found from
4082 : * @dir: inode of @dentry
4083 : * @dentry: pointer to dentry of the base directory
4084 : * @mode: mode of the new directory
4085 : *
4086 : * Create a directory.
4087 : *
4088 : * If the inode has been found through an idmapped mount the idmap of
4089 : * the vfsmount must be passed through @idmap. This function will then take
4090 : * care to map the inode according to @idmap before checking permissions.
4091 : * On non-idmapped mounts or if permission checking is to be performed on the
4092 : * raw inode simply passs @nop_mnt_idmap.
4093 : */
4094 2 : int vfs_mkdir(struct mnt_idmap *idmap, struct inode *dir,
4095 : struct dentry *dentry, umode_t mode)
4096 : {
4097 : int error;
4098 2 : unsigned max_links = dir->i_sb->s_max_links;
4099 :
4100 2 : error = may_create(idmap, dir, dentry);
4101 2 : if (error)
4102 : return error;
4103 :
4104 2 : if (!dir->i_op->mkdir)
4105 : return -EPERM;
4106 :
4107 2 : mode = vfs_prepare_mode(idmap, dir, mode, S_IRWXUGO | S_ISVTX, 0);
4108 2 : error = security_inode_mkdir(dir, dentry, mode);
4109 : if (error)
4110 : return error;
4111 :
4112 2 : if (max_links && dir->i_nlink >= max_links)
4113 : return -EMLINK;
4114 :
4115 2 : error = dir->i_op->mkdir(idmap, dir, dentry, mode);
4116 2 : if (!error)
4117 : fsnotify_mkdir(dir, dentry);
4118 : return error;
4119 : }
4120 : EXPORT_SYMBOL(vfs_mkdir);
4121 :
4122 0 : int do_mkdirat(int dfd, struct filename *name, umode_t mode)
4123 : {
4124 : struct dentry *dentry;
4125 : struct path path;
4126 : int error;
4127 0 : unsigned int lookup_flags = LOOKUP_DIRECTORY;
4128 :
4129 : retry:
4130 0 : dentry = filename_create(dfd, name, &path, lookup_flags);
4131 0 : error = PTR_ERR(dentry);
4132 0 : if (IS_ERR(dentry))
4133 : goto out_putname;
4134 :
4135 0 : error = security_path_mkdir(&path, dentry,
4136 0 : mode_strip_umask(path.dentry->d_inode, mode));
4137 : if (!error) {
4138 0 : error = vfs_mkdir(mnt_idmap(path.mnt), path.dentry->d_inode,
4139 : dentry, mode);
4140 : }
4141 0 : done_path_create(&path, dentry);
4142 0 : if (retry_estale(error, lookup_flags)) {
4143 : lookup_flags |= LOOKUP_REVAL;
4144 : goto retry;
4145 : }
4146 : out_putname:
4147 0 : putname(name);
4148 0 : return error;
4149 : }
4150 :
4151 0 : SYSCALL_DEFINE3(mkdirat, int, dfd, const char __user *, pathname, umode_t, mode)
4152 : {
4153 0 : return do_mkdirat(dfd, getname(pathname), mode);
4154 : }
4155 :
4156 0 : SYSCALL_DEFINE2(mkdir, const char __user *, pathname, umode_t, mode)
4157 : {
4158 0 : return do_mkdirat(AT_FDCWD, getname(pathname), mode);
4159 : }
4160 :
4161 : /**
4162 : * vfs_rmdir - remove directory
4163 : * @idmap: idmap of the mount the inode was found from
4164 : * @dir: inode of @dentry
4165 : * @dentry: pointer to dentry of the base directory
4166 : *
4167 : * Remove a directory.
4168 : *
4169 : * If the inode has been found through an idmapped mount the idmap of
4170 : * the vfsmount must be passed through @idmap. This function will then take
4171 : * care to map the inode according to @idmap before checking permissions.
4172 : * On non-idmapped mounts or if permission checking is to be performed on the
4173 : * raw inode simply passs @nop_mnt_idmap.
4174 : */
4175 0 : int vfs_rmdir(struct mnt_idmap *idmap, struct inode *dir,
4176 : struct dentry *dentry)
4177 : {
4178 0 : int error = may_delete(idmap, dir, dentry, 1);
4179 :
4180 0 : if (error)
4181 : return error;
4182 :
4183 0 : if (!dir->i_op->rmdir)
4184 : return -EPERM;
4185 :
4186 0 : dget(dentry);
4187 0 : inode_lock(dentry->d_inode);
4188 :
4189 0 : error = -EBUSY;
4190 0 : if (is_local_mountpoint(dentry) ||
4191 0 : (dentry->d_inode->i_flags & S_KERNEL_FILE))
4192 : goto out;
4193 :
4194 0 : error = security_inode_rmdir(dir, dentry);
4195 : if (error)
4196 : goto out;
4197 :
4198 0 : error = dir->i_op->rmdir(dir, dentry);
4199 0 : if (error)
4200 : goto out;
4201 :
4202 0 : shrink_dcache_parent(dentry);
4203 0 : dentry->d_inode->i_flags |= S_DEAD;
4204 0 : dont_mount(dentry);
4205 : detach_mounts(dentry);
4206 :
4207 : out:
4208 0 : inode_unlock(dentry->d_inode);
4209 0 : dput(dentry);
4210 0 : if (!error)
4211 0 : d_delete_notify(dir, dentry);
4212 : return error;
4213 : }
4214 : EXPORT_SYMBOL(vfs_rmdir);
4215 :
4216 0 : int do_rmdir(int dfd, struct filename *name)
4217 : {
4218 : int error;
4219 : struct dentry *dentry;
4220 : struct path path;
4221 : struct qstr last;
4222 : int type;
4223 0 : unsigned int lookup_flags = 0;
4224 : retry:
4225 0 : error = filename_parentat(dfd, name, lookup_flags, &path, &last, &type);
4226 0 : if (error)
4227 : goto exit1;
4228 :
4229 0 : switch (type) {
4230 : case LAST_DOTDOT:
4231 : error = -ENOTEMPTY;
4232 : goto exit2;
4233 : case LAST_DOT:
4234 0 : error = -EINVAL;
4235 0 : goto exit2;
4236 : case LAST_ROOT:
4237 0 : error = -EBUSY;
4238 0 : goto exit2;
4239 : }
4240 :
4241 0 : error = mnt_want_write(path.mnt);
4242 0 : if (error)
4243 : goto exit2;
4244 :
4245 0 : inode_lock_nested(path.dentry->d_inode, I_MUTEX_PARENT);
4246 0 : dentry = lookup_one_qstr_excl(&last, path.dentry, lookup_flags);
4247 0 : error = PTR_ERR(dentry);
4248 0 : if (IS_ERR(dentry))
4249 : goto exit3;
4250 0 : if (!dentry->d_inode) {
4251 : error = -ENOENT;
4252 : goto exit4;
4253 : }
4254 0 : error = security_path_rmdir(&path, dentry);
4255 : if (error)
4256 : goto exit4;
4257 0 : error = vfs_rmdir(mnt_idmap(path.mnt), path.dentry->d_inode, dentry);
4258 : exit4:
4259 0 : dput(dentry);
4260 : exit3:
4261 0 : inode_unlock(path.dentry->d_inode);
4262 0 : mnt_drop_write(path.mnt);
4263 : exit2:
4264 0 : path_put(&path);
4265 0 : if (retry_estale(error, lookup_flags)) {
4266 : lookup_flags |= LOOKUP_REVAL;
4267 : goto retry;
4268 : }
4269 : exit1:
4270 0 : putname(name);
4271 0 : return error;
4272 : }
4273 :
4274 0 : SYSCALL_DEFINE1(rmdir, const char __user *, pathname)
4275 : {
4276 0 : return do_rmdir(AT_FDCWD, getname(pathname));
4277 : }
4278 :
4279 : /**
4280 : * vfs_unlink - unlink a filesystem object
4281 : * @idmap: idmap of the mount the inode was found from
4282 : * @dir: parent directory
4283 : * @dentry: victim
4284 : * @delegated_inode: returns victim inode, if the inode is delegated.
4285 : *
4286 : * The caller must hold dir->i_mutex.
4287 : *
4288 : * If vfs_unlink discovers a delegation, it will return -EWOULDBLOCK and
4289 : * return a reference to the inode in delegated_inode. The caller
4290 : * should then break the delegation on that inode and retry. Because
4291 : * breaking a delegation may take a long time, the caller should drop
4292 : * dir->i_mutex before doing so.
4293 : *
4294 : * Alternatively, a caller may pass NULL for delegated_inode. This may
4295 : * be appropriate for callers that expect the underlying filesystem not
4296 : * to be NFS exported.
4297 : *
4298 : * If the inode has been found through an idmapped mount the idmap of
4299 : * the vfsmount must be passed through @idmap. This function will then take
4300 : * care to map the inode according to @idmap before checking permissions.
4301 : * On non-idmapped mounts or if permission checking is to be performed on the
4302 : * raw inode simply passs @nop_mnt_idmap.
4303 : */
4304 0 : int vfs_unlink(struct mnt_idmap *idmap, struct inode *dir,
4305 : struct dentry *dentry, struct inode **delegated_inode)
4306 : {
4307 0 : struct inode *target = dentry->d_inode;
4308 0 : int error = may_delete(idmap, dir, dentry, 0);
4309 :
4310 0 : if (error)
4311 : return error;
4312 :
4313 0 : if (!dir->i_op->unlink)
4314 : return -EPERM;
4315 :
4316 0 : inode_lock(target);
4317 0 : if (IS_SWAPFILE(target))
4318 : error = -EPERM;
4319 0 : else if (is_local_mountpoint(dentry))
4320 : error = -EBUSY;
4321 : else {
4322 0 : error = security_inode_unlink(dir, dentry);
4323 : if (!error) {
4324 0 : error = try_break_deleg(target, delegated_inode);
4325 0 : if (error)
4326 : goto out;
4327 0 : error = dir->i_op->unlink(dir, dentry);
4328 0 : if (!error) {
4329 0 : dont_mount(dentry);
4330 : detach_mounts(dentry);
4331 : }
4332 : }
4333 : }
4334 : out:
4335 0 : inode_unlock(target);
4336 :
4337 : /* We don't d_delete() NFS sillyrenamed files--they still exist. */
4338 0 : if (!error && dentry->d_flags & DCACHE_NFSFS_RENAMED) {
4339 0 : fsnotify_unlink(dir, dentry);
4340 0 : } else if (!error) {
4341 0 : fsnotify_link_count(target);
4342 0 : d_delete_notify(dir, dentry);
4343 : }
4344 :
4345 : return error;
4346 : }
4347 : EXPORT_SYMBOL(vfs_unlink);
4348 :
4349 : /*
4350 : * Make sure that the actual truncation of the file will occur outside its
4351 : * directory's i_mutex. Truncate can take a long time if there is a lot of
4352 : * writeout happening, and we don't want to prevent access to the directory
4353 : * while waiting on the I/O.
4354 : */
4355 0 : int do_unlinkat(int dfd, struct filename *name)
4356 : {
4357 : int error;
4358 : struct dentry *dentry;
4359 : struct path path;
4360 : struct qstr last;
4361 : int type;
4362 0 : struct inode *inode = NULL;
4363 0 : struct inode *delegated_inode = NULL;
4364 0 : unsigned int lookup_flags = 0;
4365 : retry:
4366 0 : error = filename_parentat(dfd, name, lookup_flags, &path, &last, &type);
4367 0 : if (error)
4368 : goto exit1;
4369 :
4370 0 : error = -EISDIR;
4371 0 : if (type != LAST_NORM)
4372 : goto exit2;
4373 :
4374 0 : error = mnt_want_write(path.mnt);
4375 0 : if (error)
4376 : goto exit2;
4377 : retry_deleg:
4378 0 : inode_lock_nested(path.dentry->d_inode, I_MUTEX_PARENT);
4379 0 : dentry = lookup_one_qstr_excl(&last, path.dentry, lookup_flags);
4380 0 : error = PTR_ERR(dentry);
4381 0 : if (!IS_ERR(dentry)) {
4382 :
4383 : /* Why not before? Because we want correct error value */
4384 0 : if (last.name[last.len])
4385 : goto slashes;
4386 0 : inode = dentry->d_inode;
4387 0 : if (d_is_negative(dentry))
4388 : goto slashes;
4389 0 : ihold(inode);
4390 0 : error = security_path_unlink(&path, dentry);
4391 : if (error)
4392 : goto exit3;
4393 0 : error = vfs_unlink(mnt_idmap(path.mnt), path.dentry->d_inode,
4394 : dentry, &delegated_inode);
4395 : exit3:
4396 0 : dput(dentry);
4397 : }
4398 0 : inode_unlock(path.dentry->d_inode);
4399 0 : if (inode)
4400 0 : iput(inode); /* truncate the inode here */
4401 0 : inode = NULL;
4402 0 : if (delegated_inode) {
4403 0 : error = break_deleg_wait(&delegated_inode);
4404 0 : if (!error)
4405 : goto retry_deleg;
4406 : }
4407 0 : mnt_drop_write(path.mnt);
4408 : exit2:
4409 0 : path_put(&path);
4410 0 : if (retry_estale(error, lookup_flags)) {
4411 : lookup_flags |= LOOKUP_REVAL;
4412 : inode = NULL;
4413 : goto retry;
4414 : }
4415 : exit1:
4416 0 : putname(name);
4417 0 : return error;
4418 :
4419 : slashes:
4420 0 : if (d_is_negative(dentry))
4421 : error = -ENOENT;
4422 0 : else if (d_is_dir(dentry))
4423 : error = -EISDIR;
4424 : else
4425 0 : error = -ENOTDIR;
4426 : goto exit3;
4427 : }
4428 :
4429 0 : SYSCALL_DEFINE3(unlinkat, int, dfd, const char __user *, pathname, int, flag)
4430 : {
4431 0 : if ((flag & ~AT_REMOVEDIR) != 0)
4432 : return -EINVAL;
4433 :
4434 0 : if (flag & AT_REMOVEDIR)
4435 0 : return do_rmdir(dfd, getname(pathname));
4436 0 : return do_unlinkat(dfd, getname(pathname));
4437 : }
4438 :
4439 0 : SYSCALL_DEFINE1(unlink, const char __user *, pathname)
4440 : {
4441 0 : return do_unlinkat(AT_FDCWD, getname(pathname));
4442 : }
4443 :
4444 : /**
4445 : * vfs_symlink - create symlink
4446 : * @idmap: idmap of the mount the inode was found from
4447 : * @dir: inode of @dentry
4448 : * @dentry: pointer to dentry of the base directory
4449 : * @oldname: name of the file to link to
4450 : *
4451 : * Create a symlink.
4452 : *
4453 : * If the inode has been found through an idmapped mount the idmap of
4454 : * the vfsmount must be passed through @idmap. This function will then take
4455 : * care to map the inode according to @idmap before checking permissions.
4456 : * On non-idmapped mounts or if permission checking is to be performed on the
4457 : * raw inode simply passs @nop_mnt_idmap.
4458 : */
4459 0 : int vfs_symlink(struct mnt_idmap *idmap, struct inode *dir,
4460 : struct dentry *dentry, const char *oldname)
4461 : {
4462 : int error;
4463 :
4464 0 : error = may_create(idmap, dir, dentry);
4465 0 : if (error)
4466 : return error;
4467 :
4468 0 : if (!dir->i_op->symlink)
4469 : return -EPERM;
4470 :
4471 0 : error = security_inode_symlink(dir, dentry, oldname);
4472 : if (error)
4473 : return error;
4474 :
4475 0 : error = dir->i_op->symlink(idmap, dir, dentry, oldname);
4476 0 : if (!error)
4477 : fsnotify_create(dir, dentry);
4478 : return error;
4479 : }
4480 : EXPORT_SYMBOL(vfs_symlink);
4481 :
4482 0 : int do_symlinkat(struct filename *from, int newdfd, struct filename *to)
4483 : {
4484 : int error;
4485 : struct dentry *dentry;
4486 : struct path path;
4487 0 : unsigned int lookup_flags = 0;
4488 :
4489 0 : if (IS_ERR(from)) {
4490 0 : error = PTR_ERR(from);
4491 0 : goto out_putnames;
4492 : }
4493 : retry:
4494 0 : dentry = filename_create(newdfd, to, &path, lookup_flags);
4495 0 : error = PTR_ERR(dentry);
4496 0 : if (IS_ERR(dentry))
4497 : goto out_putnames;
4498 :
4499 0 : error = security_path_symlink(&path, dentry, from->name);
4500 : if (!error)
4501 0 : error = vfs_symlink(mnt_idmap(path.mnt), path.dentry->d_inode,
4502 : dentry, from->name);
4503 0 : done_path_create(&path, dentry);
4504 0 : if (retry_estale(error, lookup_flags)) {
4505 : lookup_flags |= LOOKUP_REVAL;
4506 : goto retry;
4507 : }
4508 : out_putnames:
4509 0 : putname(to);
4510 0 : putname(from);
4511 0 : return error;
4512 : }
4513 :
4514 0 : SYSCALL_DEFINE3(symlinkat, const char __user *, oldname,
4515 : int, newdfd, const char __user *, newname)
4516 : {
4517 0 : return do_symlinkat(getname(oldname), newdfd, getname(newname));
4518 : }
4519 :
4520 0 : SYSCALL_DEFINE2(symlink, const char __user *, oldname, const char __user *, newname)
4521 : {
4522 0 : return do_symlinkat(getname(oldname), AT_FDCWD, getname(newname));
4523 : }
4524 :
4525 : /**
4526 : * vfs_link - create a new link
4527 : * @old_dentry: object to be linked
4528 : * @idmap: idmap of the mount
4529 : * @dir: new parent
4530 : * @new_dentry: where to create the new link
4531 : * @delegated_inode: returns inode needing a delegation break
4532 : *
4533 : * The caller must hold dir->i_mutex
4534 : *
4535 : * If vfs_link discovers a delegation on the to-be-linked file in need
4536 : * of breaking, it will return -EWOULDBLOCK and return a reference to the
4537 : * inode in delegated_inode. The caller should then break the delegation
4538 : * and retry. Because breaking a delegation may take a long time, the
4539 : * caller should drop the i_mutex before doing so.
4540 : *
4541 : * Alternatively, a caller may pass NULL for delegated_inode. This may
4542 : * be appropriate for callers that expect the underlying filesystem not
4543 : * to be NFS exported.
4544 : *
4545 : * If the inode has been found through an idmapped mount the idmap of
4546 : * the vfsmount must be passed through @idmap. This function will then take
4547 : * care to map the inode according to @idmap before checking permissions.
4548 : * On non-idmapped mounts or if permission checking is to be performed on the
4549 : * raw inode simply passs @nop_mnt_idmap.
4550 : */
4551 0 : int vfs_link(struct dentry *old_dentry, struct mnt_idmap *idmap,
4552 : struct inode *dir, struct dentry *new_dentry,
4553 : struct inode **delegated_inode)
4554 : {
4555 0 : struct inode *inode = old_dentry->d_inode;
4556 0 : unsigned max_links = dir->i_sb->s_max_links;
4557 : int error;
4558 :
4559 0 : if (!inode)
4560 : return -ENOENT;
4561 :
4562 0 : error = may_create(idmap, dir, new_dentry);
4563 0 : if (error)
4564 : return error;
4565 :
4566 0 : if (dir->i_sb != inode->i_sb)
4567 : return -EXDEV;
4568 :
4569 : /*
4570 : * A link to an append-only or immutable file cannot be created.
4571 : */
4572 0 : if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
4573 : return -EPERM;
4574 : /*
4575 : * Updating the link count will likely cause i_uid and i_gid to
4576 : * be writen back improperly if their true value is unknown to
4577 : * the vfs.
4578 : */
4579 0 : if (HAS_UNMAPPED_ID(idmap, inode))
4580 : return -EPERM;
4581 0 : if (!dir->i_op->link)
4582 : return -EPERM;
4583 0 : if (S_ISDIR(inode->i_mode))
4584 : return -EPERM;
4585 :
4586 0 : error = security_inode_link(old_dentry, dir, new_dentry);
4587 : if (error)
4588 : return error;
4589 :
4590 0 : inode_lock(inode);
4591 : /* Make sure we don't allow creating hardlink to an unlinked file */
4592 0 : if (inode->i_nlink == 0 && !(inode->i_state & I_LINKABLE))
4593 : error = -ENOENT;
4594 0 : else if (max_links && inode->i_nlink >= max_links)
4595 : error = -EMLINK;
4596 : else {
4597 0 : error = try_break_deleg(inode, delegated_inode);
4598 0 : if (!error)
4599 0 : error = dir->i_op->link(old_dentry, dir, new_dentry);
4600 : }
4601 :
4602 0 : if (!error && (inode->i_state & I_LINKABLE)) {
4603 0 : spin_lock(&inode->i_lock);
4604 0 : inode->i_state &= ~I_LINKABLE;
4605 0 : spin_unlock(&inode->i_lock);
4606 : }
4607 0 : inode_unlock(inode);
4608 0 : if (!error)
4609 0 : fsnotify_link(dir, inode, new_dentry);
4610 : return error;
4611 : }
4612 : EXPORT_SYMBOL(vfs_link);
4613 :
4614 : /*
4615 : * Hardlinks are often used in delicate situations. We avoid
4616 : * security-related surprises by not following symlinks on the
4617 : * newname. --KAB
4618 : *
4619 : * We don't follow them on the oldname either to be compatible
4620 : * with linux 2.0, and to avoid hard-linking to directories
4621 : * and other special files. --ADM
4622 : */
4623 0 : int do_linkat(int olddfd, struct filename *old, int newdfd,
4624 : struct filename *new, int flags)
4625 : {
4626 : struct mnt_idmap *idmap;
4627 : struct dentry *new_dentry;
4628 : struct path old_path, new_path;
4629 0 : struct inode *delegated_inode = NULL;
4630 0 : int how = 0;
4631 : int error;
4632 :
4633 0 : if ((flags & ~(AT_SYMLINK_FOLLOW | AT_EMPTY_PATH)) != 0) {
4634 : error = -EINVAL;
4635 : goto out_putnames;
4636 : }
4637 : /*
4638 : * To use null names we require CAP_DAC_READ_SEARCH
4639 : * This ensures that not everyone will be able to create
4640 : * handlink using the passed filedescriptor.
4641 : */
4642 0 : if (flags & AT_EMPTY_PATH && !capable(CAP_DAC_READ_SEARCH)) {
4643 : error = -ENOENT;
4644 : goto out_putnames;
4645 : }
4646 :
4647 0 : if (flags & AT_SYMLINK_FOLLOW)
4648 0 : how |= LOOKUP_FOLLOW;
4649 : retry:
4650 0 : error = filename_lookup(olddfd, old, how, &old_path, NULL);
4651 0 : if (error)
4652 : goto out_putnames;
4653 :
4654 0 : new_dentry = filename_create(newdfd, new, &new_path,
4655 : (how & LOOKUP_REVAL));
4656 0 : error = PTR_ERR(new_dentry);
4657 0 : if (IS_ERR(new_dentry))
4658 : goto out_putpath;
4659 :
4660 0 : error = -EXDEV;
4661 0 : if (old_path.mnt != new_path.mnt)
4662 : goto out_dput;
4663 0 : idmap = mnt_idmap(new_path.mnt);
4664 0 : error = may_linkat(idmap, &old_path);
4665 0 : if (unlikely(error))
4666 : goto out_dput;
4667 0 : error = security_path_link(old_path.dentry, &new_path, new_dentry);
4668 : if (error)
4669 : goto out_dput;
4670 0 : error = vfs_link(old_path.dentry, idmap, new_path.dentry->d_inode,
4671 : new_dentry, &delegated_inode);
4672 : out_dput:
4673 0 : done_path_create(&new_path, new_dentry);
4674 0 : if (delegated_inode) {
4675 0 : error = break_deleg_wait(&delegated_inode);
4676 0 : if (!error) {
4677 : path_put(&old_path);
4678 : goto retry;
4679 : }
4680 : }
4681 0 : if (retry_estale(error, how)) {
4682 0 : path_put(&old_path);
4683 0 : how |= LOOKUP_REVAL;
4684 0 : goto retry;
4685 : }
4686 : out_putpath:
4687 : path_put(&old_path);
4688 : out_putnames:
4689 0 : putname(old);
4690 0 : putname(new);
4691 :
4692 0 : return error;
4693 : }
4694 :
4695 0 : SYSCALL_DEFINE5(linkat, int, olddfd, const char __user *, oldname,
4696 : int, newdfd, const char __user *, newname, int, flags)
4697 : {
4698 0 : return do_linkat(olddfd, getname_uflags(oldname, flags),
4699 : newdfd, getname(newname), flags);
4700 : }
4701 :
4702 0 : SYSCALL_DEFINE2(link, const char __user *, oldname, const char __user *, newname)
4703 : {
4704 0 : return do_linkat(AT_FDCWD, getname(oldname), AT_FDCWD, getname(newname), 0);
4705 : }
4706 :
4707 : /**
4708 : * vfs_rename - rename a filesystem object
4709 : * @rd: pointer to &struct renamedata info
4710 : *
4711 : * The caller must hold multiple mutexes--see lock_rename()).
4712 : *
4713 : * If vfs_rename discovers a delegation in need of breaking at either
4714 : * the source or destination, it will return -EWOULDBLOCK and return a
4715 : * reference to the inode in delegated_inode. The caller should then
4716 : * break the delegation and retry. Because breaking a delegation may
4717 : * take a long time, the caller should drop all locks before doing
4718 : * so.
4719 : *
4720 : * Alternatively, a caller may pass NULL for delegated_inode. This may
4721 : * be appropriate for callers that expect the underlying filesystem not
4722 : * to be NFS exported.
4723 : *
4724 : * The worst of all namespace operations - renaming directory. "Perverted"
4725 : * doesn't even start to describe it. Somebody in UCB had a heck of a trip...
4726 : * Problems:
4727 : *
4728 : * a) we can get into loop creation.
4729 : * b) race potential - two innocent renames can create a loop together.
4730 : * That's where 4.4 screws up. Current fix: serialization on
4731 : * sb->s_vfs_rename_mutex. We might be more accurate, but that's another
4732 : * story.
4733 : * c) we have to lock _four_ objects - parents and victim (if it exists),
4734 : * and source (if it is not a directory).
4735 : * And that - after we got ->i_mutex on parents (until then we don't know
4736 : * whether the target exists). Solution: try to be smart with locking
4737 : * order for inodes. We rely on the fact that tree topology may change
4738 : * only under ->s_vfs_rename_mutex _and_ that parent of the object we
4739 : * move will be locked. Thus we can rank directories by the tree
4740 : * (ancestors first) and rank all non-directories after them.
4741 : * That works since everybody except rename does "lock parent, lookup,
4742 : * lock child" and rename is under ->s_vfs_rename_mutex.
4743 : * HOWEVER, it relies on the assumption that any object with ->lookup()
4744 : * has no more than 1 dentry. If "hybrid" objects will ever appear,
4745 : * we'd better make sure that there's no link(2) for them.
4746 : * d) conversion from fhandle to dentry may come in the wrong moment - when
4747 : * we are removing the target. Solution: we will have to grab ->i_mutex
4748 : * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on
4749 : * ->i_mutex on parents, which works but leads to some truly excessive
4750 : * locking].
4751 : */
4752 0 : int vfs_rename(struct renamedata *rd)
4753 : {
4754 : int error;
4755 0 : struct inode *old_dir = rd->old_dir, *new_dir = rd->new_dir;
4756 0 : struct dentry *old_dentry = rd->old_dentry;
4757 0 : struct dentry *new_dentry = rd->new_dentry;
4758 0 : struct inode **delegated_inode = rd->delegated_inode;
4759 0 : unsigned int flags = rd->flags;
4760 0 : bool is_dir = d_is_dir(old_dentry);
4761 0 : struct inode *source = old_dentry->d_inode;
4762 0 : struct inode *target = new_dentry->d_inode;
4763 0 : bool new_is_dir = false;
4764 0 : unsigned max_links = new_dir->i_sb->s_max_links;
4765 : struct name_snapshot old_name;
4766 :
4767 0 : if (source == target)
4768 : return 0;
4769 :
4770 0 : error = may_delete(rd->old_mnt_idmap, old_dir, old_dentry, is_dir);
4771 0 : if (error)
4772 : return error;
4773 :
4774 0 : if (!target) {
4775 0 : error = may_create(rd->new_mnt_idmap, new_dir, new_dentry);
4776 : } else {
4777 0 : new_is_dir = d_is_dir(new_dentry);
4778 :
4779 0 : if (!(flags & RENAME_EXCHANGE))
4780 0 : error = may_delete(rd->new_mnt_idmap, new_dir,
4781 : new_dentry, is_dir);
4782 : else
4783 0 : error = may_delete(rd->new_mnt_idmap, new_dir,
4784 : new_dentry, new_is_dir);
4785 : }
4786 0 : if (error)
4787 : return error;
4788 :
4789 0 : if (!old_dir->i_op->rename)
4790 : return -EPERM;
4791 :
4792 : /*
4793 : * If we are going to change the parent - check write permissions,
4794 : * we'll need to flip '..'.
4795 : */
4796 0 : if (new_dir != old_dir) {
4797 0 : if (is_dir) {
4798 0 : error = inode_permission(rd->old_mnt_idmap, source,
4799 : MAY_WRITE);
4800 0 : if (error)
4801 : return error;
4802 : }
4803 0 : if ((flags & RENAME_EXCHANGE) && new_is_dir) {
4804 0 : error = inode_permission(rd->new_mnt_idmap, target,
4805 : MAY_WRITE);
4806 0 : if (error)
4807 : return error;
4808 : }
4809 : }
4810 :
4811 0 : error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry,
4812 : flags);
4813 : if (error)
4814 : return error;
4815 :
4816 0 : take_dentry_name_snapshot(&old_name, old_dentry);
4817 0 : dget(new_dentry);
4818 0 : if (!is_dir || (flags & RENAME_EXCHANGE))
4819 0 : lock_two_nondirectories(source, target);
4820 0 : else if (target)
4821 : inode_lock(target);
4822 :
4823 0 : error = -EPERM;
4824 0 : if (IS_SWAPFILE(source) || (target && IS_SWAPFILE(target)))
4825 : goto out;
4826 :
4827 0 : error = -EBUSY;
4828 0 : if (is_local_mountpoint(old_dentry) || is_local_mountpoint(new_dentry))
4829 : goto out;
4830 :
4831 0 : if (max_links && new_dir != old_dir) {
4832 0 : error = -EMLINK;
4833 0 : if (is_dir && !new_is_dir && new_dir->i_nlink >= max_links)
4834 : goto out;
4835 0 : if ((flags & RENAME_EXCHANGE) && !is_dir && new_is_dir &&
4836 0 : old_dir->i_nlink >= max_links)
4837 : goto out;
4838 : }
4839 0 : if (!is_dir) {
4840 0 : error = try_break_deleg(source, delegated_inode);
4841 0 : if (error)
4842 : goto out;
4843 : }
4844 0 : if (target && !new_is_dir) {
4845 0 : error = try_break_deleg(target, delegated_inode);
4846 0 : if (error)
4847 : goto out;
4848 : }
4849 0 : error = old_dir->i_op->rename(rd->new_mnt_idmap, old_dir, old_dentry,
4850 : new_dir, new_dentry, flags);
4851 0 : if (error)
4852 : goto out;
4853 :
4854 0 : if (!(flags & RENAME_EXCHANGE) && target) {
4855 0 : if (is_dir) {
4856 0 : shrink_dcache_parent(new_dentry);
4857 0 : target->i_flags |= S_DEAD;
4858 : }
4859 0 : dont_mount(new_dentry);
4860 : detach_mounts(new_dentry);
4861 : }
4862 0 : if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE)) {
4863 0 : if (!(flags & RENAME_EXCHANGE))
4864 0 : d_move(old_dentry, new_dentry);
4865 : else
4866 0 : d_exchange(old_dentry, new_dentry);
4867 : }
4868 : out:
4869 0 : if (!is_dir || (flags & RENAME_EXCHANGE))
4870 0 : unlock_two_nondirectories(source, target);
4871 0 : else if (target)
4872 : inode_unlock(target);
4873 0 : dput(new_dentry);
4874 0 : if (!error) {
4875 0 : fsnotify_move(old_dir, new_dir, &old_name.name, is_dir,
4876 0 : !(flags & RENAME_EXCHANGE) ? target : NULL, old_dentry);
4877 0 : if (flags & RENAME_EXCHANGE) {
4878 0 : fsnotify_move(new_dir, old_dir, &old_dentry->d_name,
4879 : new_is_dir, NULL, new_dentry);
4880 : }
4881 : }
4882 0 : release_dentry_name_snapshot(&old_name);
4883 :
4884 0 : return error;
4885 : }
4886 : EXPORT_SYMBOL(vfs_rename);
4887 :
4888 0 : int do_renameat2(int olddfd, struct filename *from, int newdfd,
4889 : struct filename *to, unsigned int flags)
4890 : {
4891 : struct renamedata rd;
4892 : struct dentry *old_dentry, *new_dentry;
4893 : struct dentry *trap;
4894 : struct path old_path, new_path;
4895 : struct qstr old_last, new_last;
4896 : int old_type, new_type;
4897 0 : struct inode *delegated_inode = NULL;
4898 0 : unsigned int lookup_flags = 0, target_flags = LOOKUP_RENAME_TARGET;
4899 0 : bool should_retry = false;
4900 0 : int error = -EINVAL;
4901 :
4902 0 : if (flags & ~(RENAME_NOREPLACE | RENAME_EXCHANGE | RENAME_WHITEOUT))
4903 : goto put_names;
4904 :
4905 0 : if ((flags & (RENAME_NOREPLACE | RENAME_WHITEOUT)) &&
4906 0 : (flags & RENAME_EXCHANGE))
4907 : goto put_names;
4908 :
4909 0 : if (flags & RENAME_EXCHANGE)
4910 0 : target_flags = 0;
4911 :
4912 : retry:
4913 0 : error = filename_parentat(olddfd, from, lookup_flags, &old_path,
4914 : &old_last, &old_type);
4915 0 : if (error)
4916 : goto put_names;
4917 :
4918 0 : error = filename_parentat(newdfd, to, lookup_flags, &new_path, &new_last,
4919 : &new_type);
4920 0 : if (error)
4921 : goto exit1;
4922 :
4923 0 : error = -EXDEV;
4924 0 : if (old_path.mnt != new_path.mnt)
4925 : goto exit2;
4926 :
4927 0 : error = -EBUSY;
4928 0 : if (old_type != LAST_NORM)
4929 : goto exit2;
4930 :
4931 0 : if (flags & RENAME_NOREPLACE)
4932 0 : error = -EEXIST;
4933 0 : if (new_type != LAST_NORM)
4934 : goto exit2;
4935 :
4936 0 : error = mnt_want_write(old_path.mnt);
4937 0 : if (error)
4938 : goto exit2;
4939 :
4940 : retry_deleg:
4941 0 : trap = lock_rename(new_path.dentry, old_path.dentry);
4942 :
4943 0 : old_dentry = lookup_one_qstr_excl(&old_last, old_path.dentry,
4944 : lookup_flags);
4945 0 : error = PTR_ERR(old_dentry);
4946 0 : if (IS_ERR(old_dentry))
4947 : goto exit3;
4948 : /* source must exist */
4949 0 : error = -ENOENT;
4950 0 : if (d_is_negative(old_dentry))
4951 : goto exit4;
4952 0 : new_dentry = lookup_one_qstr_excl(&new_last, new_path.dentry,
4953 : lookup_flags | target_flags);
4954 0 : error = PTR_ERR(new_dentry);
4955 0 : if (IS_ERR(new_dentry))
4956 : goto exit4;
4957 0 : error = -EEXIST;
4958 0 : if ((flags & RENAME_NOREPLACE) && d_is_positive(new_dentry))
4959 : goto exit5;
4960 0 : if (flags & RENAME_EXCHANGE) {
4961 0 : error = -ENOENT;
4962 0 : if (d_is_negative(new_dentry))
4963 : goto exit5;
4964 :
4965 0 : if (!d_is_dir(new_dentry)) {
4966 0 : error = -ENOTDIR;
4967 0 : if (new_last.name[new_last.len])
4968 : goto exit5;
4969 : }
4970 : }
4971 : /* unless the source is a directory trailing slashes give -ENOTDIR */
4972 0 : if (!d_is_dir(old_dentry)) {
4973 0 : error = -ENOTDIR;
4974 0 : if (old_last.name[old_last.len])
4975 : goto exit5;
4976 0 : if (!(flags & RENAME_EXCHANGE) && new_last.name[new_last.len])
4977 : goto exit5;
4978 : }
4979 : /* source should not be ancestor of target */
4980 0 : error = -EINVAL;
4981 0 : if (old_dentry == trap)
4982 : goto exit5;
4983 : /* target should not be an ancestor of source */
4984 0 : if (!(flags & RENAME_EXCHANGE))
4985 0 : error = -ENOTEMPTY;
4986 0 : if (new_dentry == trap)
4987 : goto exit5;
4988 :
4989 0 : error = security_path_rename(&old_path, old_dentry,
4990 : &new_path, new_dentry, flags);
4991 : if (error)
4992 : goto exit5;
4993 :
4994 0 : rd.old_dir = old_path.dentry->d_inode;
4995 0 : rd.old_dentry = old_dentry;
4996 0 : rd.old_mnt_idmap = mnt_idmap(old_path.mnt);
4997 0 : rd.new_dir = new_path.dentry->d_inode;
4998 0 : rd.new_dentry = new_dentry;
4999 0 : rd.new_mnt_idmap = mnt_idmap(new_path.mnt);
5000 0 : rd.delegated_inode = &delegated_inode;
5001 0 : rd.flags = flags;
5002 0 : error = vfs_rename(&rd);
5003 : exit5:
5004 0 : dput(new_dentry);
5005 : exit4:
5006 0 : dput(old_dentry);
5007 : exit3:
5008 0 : unlock_rename(new_path.dentry, old_path.dentry);
5009 0 : if (delegated_inode) {
5010 0 : error = break_deleg_wait(&delegated_inode);
5011 0 : if (!error)
5012 : goto retry_deleg;
5013 : }
5014 0 : mnt_drop_write(old_path.mnt);
5015 : exit2:
5016 0 : if (retry_estale(error, lookup_flags))
5017 0 : should_retry = true;
5018 : path_put(&new_path);
5019 : exit1:
5020 0 : path_put(&old_path);
5021 0 : if (should_retry) {
5022 : should_retry = false;
5023 : lookup_flags |= LOOKUP_REVAL;
5024 : goto retry;
5025 : }
5026 : put_names:
5027 0 : putname(from);
5028 0 : putname(to);
5029 0 : return error;
5030 : }
5031 :
5032 0 : SYSCALL_DEFINE5(renameat2, int, olddfd, const char __user *, oldname,
5033 : int, newdfd, const char __user *, newname, unsigned int, flags)
5034 : {
5035 0 : return do_renameat2(olddfd, getname(oldname), newdfd, getname(newname),
5036 : flags);
5037 : }
5038 :
5039 0 : SYSCALL_DEFINE4(renameat, int, olddfd, const char __user *, oldname,
5040 : int, newdfd, const char __user *, newname)
5041 : {
5042 0 : return do_renameat2(olddfd, getname(oldname), newdfd, getname(newname),
5043 : 0);
5044 : }
5045 :
5046 0 : SYSCALL_DEFINE2(rename, const char __user *, oldname, const char __user *, newname)
5047 : {
5048 0 : return do_renameat2(AT_FDCWD, getname(oldname), AT_FDCWD,
5049 : getname(newname), 0);
5050 : }
5051 :
5052 0 : int readlink_copy(char __user *buffer, int buflen, const char *link)
5053 : {
5054 0 : int len = PTR_ERR(link);
5055 0 : if (IS_ERR(link))
5056 : goto out;
5057 :
5058 0 : len = strlen(link);
5059 0 : if (len > (unsigned) buflen)
5060 0 : len = buflen;
5061 0 : if (copy_to_user(buffer, link, len))
5062 0 : len = -EFAULT;
5063 : out:
5064 0 : return len;
5065 : }
5066 :
5067 : /**
5068 : * vfs_readlink - copy symlink body into userspace buffer
5069 : * @dentry: dentry on which to get symbolic link
5070 : * @buffer: user memory pointer
5071 : * @buflen: size of buffer
5072 : *
5073 : * Does not touch atime. That's up to the caller if necessary
5074 : *
5075 : * Does not call security hook.
5076 : */
5077 0 : int vfs_readlink(struct dentry *dentry, char __user *buffer, int buflen)
5078 : {
5079 0 : struct inode *inode = d_inode(dentry);
5080 0 : DEFINE_DELAYED_CALL(done);
5081 : const char *link;
5082 : int res;
5083 :
5084 0 : if (unlikely(!(inode->i_opflags & IOP_DEFAULT_READLINK))) {
5085 0 : if (unlikely(inode->i_op->readlink))
5086 0 : return inode->i_op->readlink(dentry, buffer, buflen);
5087 :
5088 0 : if (!d_is_symlink(dentry))
5089 : return -EINVAL;
5090 :
5091 0 : spin_lock(&inode->i_lock);
5092 0 : inode->i_opflags |= IOP_DEFAULT_READLINK;
5093 0 : spin_unlock(&inode->i_lock);
5094 : }
5095 :
5096 0 : link = READ_ONCE(inode->i_link);
5097 0 : if (!link) {
5098 0 : link = inode->i_op->get_link(dentry, inode, &done);
5099 0 : if (IS_ERR(link))
5100 0 : return PTR_ERR(link);
5101 : }
5102 0 : res = readlink_copy(buffer, buflen, link);
5103 : do_delayed_call(&done);
5104 : return res;
5105 : }
5106 : EXPORT_SYMBOL(vfs_readlink);
5107 :
5108 : /**
5109 : * vfs_get_link - get symlink body
5110 : * @dentry: dentry on which to get symbolic link
5111 : * @done: caller needs to free returned data with this
5112 : *
5113 : * Calls security hook and i_op->get_link() on the supplied inode.
5114 : *
5115 : * It does not touch atime. That's up to the caller if necessary.
5116 : *
5117 : * Does not work on "special" symlinks like /proc/$$/fd/N
5118 : */
5119 0 : const char *vfs_get_link(struct dentry *dentry, struct delayed_call *done)
5120 : {
5121 0 : const char *res = ERR_PTR(-EINVAL);
5122 0 : struct inode *inode = d_inode(dentry);
5123 :
5124 0 : if (d_is_symlink(dentry)) {
5125 0 : res = ERR_PTR(security_inode_readlink(dentry));
5126 : if (!res)
5127 0 : res = inode->i_op->get_link(dentry, inode, done);
5128 : }
5129 0 : return res;
5130 : }
5131 : EXPORT_SYMBOL(vfs_get_link);
5132 :
5133 : /* get the link contents into pagecache */
5134 0 : const char *page_get_link(struct dentry *dentry, struct inode *inode,
5135 : struct delayed_call *callback)
5136 : {
5137 : char *kaddr;
5138 : struct page *page;
5139 0 : struct address_space *mapping = inode->i_mapping;
5140 :
5141 0 : if (!dentry) {
5142 0 : page = find_get_page(mapping, 0);
5143 0 : if (!page)
5144 : return ERR_PTR(-ECHILD);
5145 0 : if (!PageUptodate(page)) {
5146 0 : put_page(page);
5147 0 : return ERR_PTR(-ECHILD);
5148 : }
5149 : } else {
5150 0 : page = read_mapping_page(mapping, 0, NULL);
5151 0 : if (IS_ERR(page))
5152 : return (char*)page;
5153 : }
5154 0 : set_delayed_call(callback, page_put_link, page);
5155 0 : BUG_ON(mapping_gfp_mask(mapping) & __GFP_HIGHMEM);
5156 0 : kaddr = page_address(page);
5157 0 : nd_terminate_link(kaddr, inode->i_size, PAGE_SIZE - 1);
5158 0 : return kaddr;
5159 : }
5160 :
5161 : EXPORT_SYMBOL(page_get_link);
5162 :
5163 0 : void page_put_link(void *arg)
5164 : {
5165 0 : put_page(arg);
5166 0 : }
5167 : EXPORT_SYMBOL(page_put_link);
5168 :
5169 0 : int page_readlink(struct dentry *dentry, char __user *buffer, int buflen)
5170 : {
5171 0 : DEFINE_DELAYED_CALL(done);
5172 0 : int res = readlink_copy(buffer, buflen,
5173 : page_get_link(dentry, d_inode(dentry),
5174 : &done));
5175 0 : do_delayed_call(&done);
5176 0 : return res;
5177 : }
5178 : EXPORT_SYMBOL(page_readlink);
5179 :
5180 0 : int page_symlink(struct inode *inode, const char *symname, int len)
5181 : {
5182 0 : struct address_space *mapping = inode->i_mapping;
5183 0 : const struct address_space_operations *aops = mapping->a_ops;
5184 0 : bool nofs = !mapping_gfp_constraint(mapping, __GFP_FS);
5185 : struct page *page;
5186 0 : void *fsdata = NULL;
5187 : int err;
5188 : unsigned int flags;
5189 :
5190 : retry:
5191 0 : if (nofs)
5192 0 : flags = memalloc_nofs_save();
5193 0 : err = aops->write_begin(NULL, mapping, 0, len-1, &page, &fsdata);
5194 0 : if (nofs)
5195 : memalloc_nofs_restore(flags);
5196 0 : if (err)
5197 : goto fail;
5198 :
5199 0 : memcpy(page_address(page), symname, len-1);
5200 :
5201 0 : err = aops->write_end(NULL, mapping, 0, len-1, len-1,
5202 : page, fsdata);
5203 0 : if (err < 0)
5204 : goto fail;
5205 0 : if (err < len-1)
5206 : goto retry;
5207 :
5208 0 : mark_inode_dirty(inode);
5209 0 : return 0;
5210 : fail:
5211 : return err;
5212 : }
5213 : EXPORT_SYMBOL(page_symlink);
5214 :
5215 : const struct inode_operations page_symlink_inode_operations = {
5216 : .get_link = page_get_link,
5217 : };
5218 : EXPORT_SYMBOL(page_symlink_inode_operations);
|
