• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 // SPDX-License-Identifier: GPL-2.0-only
2 /*
3  * Overlayfs NFS export support.
4  *
5  * Amir Goldstein <amir73il@gmail.com>
6  *
7  * Copyright (C) 2017-2018 CTERA Networks. All Rights Reserved.
8  */
9 
10 #include <linux/fs.h>
11 #include <linux/cred.h>
12 #include <linux/mount.h>
13 #include <linux/namei.h>
14 #include <linux/xattr.h>
15 #include <linux/exportfs.h>
16 #include <linux/ratelimit.h>
17 #include "overlayfs.h"
18 
ovl_encode_maybe_copy_up(struct dentry * dentry)19 static int ovl_encode_maybe_copy_up(struct dentry *dentry)
20 {
21 	int err;
22 
23 	if (ovl_dentry_upper(dentry))
24 		return 0;
25 
26 	err = ovl_want_write(dentry);
27 	if (!err) {
28 		err = ovl_copy_up(dentry);
29 		ovl_drop_write(dentry);
30 	}
31 
32 	if (err) {
33 		pr_warn_ratelimited("failed to copy up on encode (%pd2, err=%i)\n",
34 				    dentry, err);
35 	}
36 
37 	return err;
38 }
39 
40 /*
41  * Before encoding a non-upper directory file handle from real layer N, we need
42  * to check if it will be possible to reconnect an overlay dentry from the real
43  * lower decoded dentry. This is done by following the overlay ancestry up to a
44  * "layer N connected" ancestor and verifying that all parents along the way are
45  * "layer N connectable". If an ancestor that is NOT "layer N connectable" is
46  * found, we need to copy up an ancestor, which is "layer N connectable", thus
47  * making that ancestor "layer N connected". For example:
48  *
49  * layer 1: /a
50  * layer 2: /a/b/c
51  *
52  * The overlay dentry /a is NOT "layer 2 connectable", because if dir /a is
53  * copied up and renamed, upper dir /a will be indexed by lower dir /a from
54  * layer 1. The dir /a from layer 2 will never be indexed, so the algorithm (*)
55  * in ovl_lookup_real_ancestor() will not be able to lookup a connected overlay
56  * dentry from the connected lower dentry /a/b/c.
57  *
58  * To avoid this problem on decode time, we need to copy up an ancestor of
59  * /a/b/c, which is "layer 2 connectable", on encode time. That ancestor is
60  * /a/b. After copy up (and index) of /a/b, it will become "layer 2 connected"
61  * and when the time comes to decode the file handle from lower dentry /a/b/c,
62  * ovl_lookup_real_ancestor() will find the indexed ancestor /a/b and decoding
63  * a connected overlay dentry will be accomplished.
64  *
65  * (*) the algorithm in ovl_lookup_real_ancestor() can be improved to lookup an
66  * entry /a in the lower layers above layer N and find the indexed dir /a from
67  * layer 1. If that improvement is made, then the check for "layer N connected"
68  * will need to verify there are no redirects in lower layers above N. In the
69  * example above, /a will be "layer 2 connectable". However, if layer 2 dir /a
70  * is a target of a layer 1 redirect, then /a will NOT be "layer 2 connectable":
71  *
72  * layer 1: /A (redirect = /a)
73  * layer 2: /a/b/c
74  */
75 
76 /* Return the lowest layer for encoding a connectable file handle */
ovl_connectable_layer(struct dentry * dentry)77 static int ovl_connectable_layer(struct dentry *dentry)
78 {
79 	struct ovl_entry *oe = OVL_E(dentry);
80 
81 	/* We can get overlay root from root of any layer */
82 	if (dentry == dentry->d_sb->s_root)
83 		return oe->numlower;
84 
85 	/*
86 	 * If it's an unindexed merge dir, then it's not connectable with any
87 	 * lower layer
88 	 */
89 	if (ovl_dentry_upper(dentry) &&
90 	    !ovl_test_flag(OVL_INDEX, d_inode(dentry)))
91 		return 0;
92 
93 	/* We can get upper/overlay path from indexed/lower dentry */
94 	return oe->lowerstack[0].layer->idx;
95 }
96 
97 /*
98  * @dentry is "connected" if all ancestors up to root or a "connected" ancestor
99  * have the same uppermost lower layer as the origin's layer. We may need to
100  * copy up a "connectable" ancestor to make it "connected". A "connected" dentry
101  * cannot become non "connected", so cache positive result in dentry flags.
102  *
103  * Return the connected origin layer or < 0 on error.
104  */
ovl_connect_layer(struct dentry * dentry)105 static int ovl_connect_layer(struct dentry *dentry)
106 {
107 	struct dentry *next, *parent = NULL;
108 	int origin_layer;
109 	int err = 0;
110 
111 	if (WARN_ON(dentry == dentry->d_sb->s_root) ||
112 	    WARN_ON(!ovl_dentry_lower(dentry)))
113 		return -EIO;
114 
115 	origin_layer = OVL_E(dentry)->lowerstack[0].layer->idx;
116 	if (ovl_dentry_test_flag(OVL_E_CONNECTED, dentry))
117 		return origin_layer;
118 
119 	/* Find the topmost origin layer connectable ancestor of @dentry */
120 	next = dget(dentry);
121 	for (;;) {
122 		parent = dget_parent(next);
123 		if (WARN_ON(parent == next)) {
124 			err = -EIO;
125 			break;
126 		}
127 
128 		/*
129 		 * If @parent is not origin layer connectable, then copy up
130 		 * @next which is origin layer connectable and we are done.
131 		 */
132 		if (ovl_connectable_layer(parent) < origin_layer) {
133 			err = ovl_encode_maybe_copy_up(next);
134 			break;
135 		}
136 
137 		/* If @parent is connected or indexed we are done */
138 		if (ovl_dentry_test_flag(OVL_E_CONNECTED, parent) ||
139 		    ovl_test_flag(OVL_INDEX, d_inode(parent)))
140 			break;
141 
142 		dput(next);
143 		next = parent;
144 	}
145 
146 	dput(parent);
147 	dput(next);
148 
149 	if (!err)
150 		ovl_dentry_set_flag(OVL_E_CONNECTED, dentry);
151 
152 	return err ?: origin_layer;
153 }
154 
155 /*
156  * We only need to encode origin if there is a chance that the same object was
157  * encoded pre copy up and then we need to stay consistent with the same
158  * encoding also after copy up. If non-pure upper is not indexed, then it was
159  * copied up before NFS export was enabled. In that case we don't need to worry
160  * about staying consistent with pre copy up encoding and we encode an upper
161  * file handle. Overlay root dentry is a private case of non-indexed upper.
162  *
163  * The following table summarizes the different file handle encodings used for
164  * different overlay object types:
165  *
166  *  Object type		| Encoding
167  * --------------------------------
168  *  Pure upper		| U
169  *  Non-indexed upper	| U
170  *  Indexed upper	| L (*)
171  *  Non-upper		| L (*)
172  *
173  * U = upper file handle
174  * L = lower file handle
175  *
176  * (*) Connecting an overlay dir from real lower dentry is not always
177  * possible when there are redirects in lower layers and non-indexed merge dirs.
178  * To mitigate those case, we may copy up the lower dir ancestor before encode
179  * a lower dir file handle.
180  *
181  * Return 0 for upper file handle, > 0 for lower file handle or < 0 on error.
182  */
ovl_check_encode_origin(struct dentry * dentry)183 static int ovl_check_encode_origin(struct dentry *dentry)
184 {
185 	struct ovl_fs *ofs = dentry->d_sb->s_fs_info;
186 
187 	/* Upper file handle for pure upper */
188 	if (!ovl_dentry_lower(dentry))
189 		return 0;
190 
191 	/*
192 	 * Upper file handle for non-indexed upper.
193 	 *
194 	 * Root is never indexed, so if there's an upper layer, encode upper for
195 	 * root.
196 	 */
197 	if (ovl_dentry_upper(dentry) &&
198 	    !ovl_test_flag(OVL_INDEX, d_inode(dentry)))
199 		return 0;
200 
201 	/*
202 	 * Decoding a merge dir, whose origin's ancestor is under a redirected
203 	 * lower dir or under a non-indexed upper is not always possible.
204 	 * ovl_connect_layer() will try to make origin's layer "connected" by
205 	 * copying up a "connectable" ancestor.
206 	 */
207 	if (d_is_dir(dentry) && ovl_upper_mnt(ofs))
208 		return ovl_connect_layer(dentry);
209 
210 	/* Lower file handle for indexed and non-upper dir/non-dir */
211 	return 1;
212 }
213 
ovl_dentry_to_fid(struct ovl_fs * ofs,struct dentry * dentry,u32 * fid,int buflen)214 static int ovl_dentry_to_fid(struct ovl_fs *ofs, struct dentry *dentry,
215 			     u32 *fid, int buflen)
216 {
217 	struct ovl_fh *fh = NULL;
218 	int err, enc_lower;
219 	int len;
220 
221 	/*
222 	 * Check if we should encode a lower or upper file handle and maybe
223 	 * copy up an ancestor to make lower file handle connectable.
224 	 */
225 	err = enc_lower = ovl_check_encode_origin(dentry);
226 	if (enc_lower < 0)
227 		goto fail;
228 
229 	/* Encode an upper or lower file handle */
230 	fh = ovl_encode_real_fh(ofs, enc_lower ? ovl_dentry_lower(dentry) :
231 				ovl_dentry_upper(dentry), !enc_lower);
232 	if (IS_ERR(fh))
233 		return PTR_ERR(fh);
234 
235 	len = OVL_FH_LEN(fh);
236 	if (len <= buflen)
237 		memcpy(fid, fh, len);
238 	err = len;
239 
240 out:
241 	kfree(fh);
242 	return err;
243 
244 fail:
245 	pr_warn_ratelimited("failed to encode file handle (%pd2, err=%i)\n",
246 			    dentry, err);
247 	goto out;
248 }
249 
ovl_encode_fh(struct inode * inode,u32 * fid,int * max_len,struct inode * parent)250 static int ovl_encode_fh(struct inode *inode, u32 *fid, int *max_len,
251 			 struct inode *parent)
252 {
253 	struct ovl_fs *ofs = OVL_FS(inode->i_sb);
254 	struct dentry *dentry;
255 	int bytes, buflen = *max_len << 2;
256 
257 	/* TODO: encode connectable file handles */
258 	if (parent)
259 		return FILEID_INVALID;
260 
261 	dentry = d_find_any_alias(inode);
262 	if (!dentry)
263 		return FILEID_INVALID;
264 
265 	bytes = ovl_dentry_to_fid(ofs, dentry, fid, buflen);
266 	dput(dentry);
267 	if (bytes <= 0)
268 		return FILEID_INVALID;
269 
270 	*max_len = bytes >> 2;
271 	if (bytes > buflen)
272 		return FILEID_INVALID;
273 
274 	return OVL_FILEID_V1;
275 }
276 
277 /*
278  * Find or instantiate an overlay dentry from real dentries and index.
279  */
ovl_obtain_alias(struct super_block * sb,struct dentry * upper_alias,struct ovl_path * lowerpath,struct dentry * index)280 static struct dentry *ovl_obtain_alias(struct super_block *sb,
281 				       struct dentry *upper_alias,
282 				       struct ovl_path *lowerpath,
283 				       struct dentry *index)
284 {
285 	struct dentry *lower = lowerpath ? lowerpath->dentry : NULL;
286 	struct dentry *upper = upper_alias ?: index;
287 	struct dentry *dentry;
288 	struct inode *inode;
289 	struct ovl_entry *oe;
290 	struct ovl_inode_params oip = {
291 		.lowerpath = lowerpath,
292 		.index = index,
293 		.numlower = !!lower
294 	};
295 
296 	/* We get overlay directory dentries with ovl_lookup_real() */
297 	if (d_is_dir(upper ?: lower))
298 		return ERR_PTR(-EIO);
299 
300 	oip.upperdentry = dget(upper);
301 	inode = ovl_get_inode(sb, &oip);
302 	if (IS_ERR(inode)) {
303 		dput(upper);
304 		return ERR_CAST(inode);
305 	}
306 
307 	if (upper)
308 		ovl_set_flag(OVL_UPPERDATA, inode);
309 
310 	dentry = d_find_any_alias(inode);
311 	if (dentry)
312 		goto out_iput;
313 
314 	dentry = d_alloc_anon(inode->i_sb);
315 	if (unlikely(!dentry))
316 		goto nomem;
317 	oe = ovl_alloc_entry(lower ? 1 : 0);
318 	if (!oe)
319 		goto nomem;
320 
321 	if (lower) {
322 		oe->lowerstack->dentry = dget(lower);
323 		oe->lowerstack->layer = lowerpath->layer;
324 	}
325 	dentry->d_fsdata = oe;
326 	if (upper_alias)
327 		ovl_dentry_set_upper_alias(dentry);
328 
329 	ovl_dentry_init_reval(dentry, upper);
330 
331 	return d_instantiate_anon(dentry, inode);
332 
333 nomem:
334 	dput(dentry);
335 	dentry = ERR_PTR(-ENOMEM);
336 out_iput:
337 	iput(inode);
338 	return dentry;
339 }
340 
341 /* Get the upper or lower dentry in stach whose on layer @idx */
ovl_dentry_real_at(struct dentry * dentry,int idx)342 static struct dentry *ovl_dentry_real_at(struct dentry *dentry, int idx)
343 {
344 	struct ovl_entry *oe = dentry->d_fsdata;
345 	int i;
346 
347 	if (!idx)
348 		return ovl_dentry_upper(dentry);
349 
350 	for (i = 0; i < oe->numlower; i++) {
351 		if (oe->lowerstack[i].layer->idx == idx)
352 			return oe->lowerstack[i].dentry;
353 	}
354 
355 	return NULL;
356 }
357 
358 /*
359  * Lookup a child overlay dentry to get a connected overlay dentry whose real
360  * dentry is @real. If @real is on upper layer, we lookup a child overlay
361  * dentry with the same name as the real dentry. Otherwise, we need to consult
362  * index for lookup.
363  */
ovl_lookup_real_one(struct dentry * connected,struct dentry * real,const struct ovl_layer * layer)364 static struct dentry *ovl_lookup_real_one(struct dentry *connected,
365 					  struct dentry *real,
366 					  const struct ovl_layer *layer)
367 {
368 	struct inode *dir = d_inode(connected);
369 	struct dentry *this, *parent = NULL;
370 	struct name_snapshot name;
371 	int err;
372 
373 	/*
374 	 * Lookup child overlay dentry by real name. The dir mutex protects us
375 	 * from racing with overlay rename. If the overlay dentry that is above
376 	 * real has already been moved to a parent that is not under the
377 	 * connected overlay dir, we return -ECHILD and restart the lookup of
378 	 * connected real path from the top.
379 	 */
380 	inode_lock_nested(dir, I_MUTEX_PARENT);
381 	err = -ECHILD;
382 	parent = dget_parent(real);
383 	if (ovl_dentry_real_at(connected, layer->idx) != parent)
384 		goto fail;
385 
386 	/*
387 	 * We also need to take a snapshot of real dentry name to protect us
388 	 * from racing with underlying layer rename. In this case, we don't
389 	 * care about returning ESTALE, only from dereferencing a free name
390 	 * pointer because we hold no lock on the real dentry.
391 	 */
392 	take_dentry_name_snapshot(&name, real);
393 	this = lookup_one_len(name.name.name, connected, name.name.len);
394 	release_dentry_name_snapshot(&name);
395 	err = PTR_ERR(this);
396 	if (IS_ERR(this)) {
397 		goto fail;
398 	} else if (!this || !this->d_inode) {
399 		dput(this);
400 		err = -ENOENT;
401 		goto fail;
402 	} else if (ovl_dentry_real_at(this, layer->idx) != real) {
403 		dput(this);
404 		err = -ESTALE;
405 		goto fail;
406 	}
407 
408 out:
409 	dput(parent);
410 	inode_unlock(dir);
411 	return this;
412 
413 fail:
414 	pr_warn_ratelimited("failed to lookup one by real (%pd2, layer=%d, connected=%pd2, err=%i)\n",
415 			    real, layer->idx, connected, err);
416 	this = ERR_PTR(err);
417 	goto out;
418 }
419 
420 static struct dentry *ovl_lookup_real(struct super_block *sb,
421 				      struct dentry *real,
422 				      const struct ovl_layer *layer);
423 
424 /*
425  * Lookup an indexed or hashed overlay dentry by real inode.
426  */
ovl_lookup_real_inode(struct super_block * sb,struct dentry * real,const struct ovl_layer * layer)427 static struct dentry *ovl_lookup_real_inode(struct super_block *sb,
428 					    struct dentry *real,
429 					    const struct ovl_layer *layer)
430 {
431 	struct ovl_fs *ofs = sb->s_fs_info;
432 	struct dentry *index = NULL;
433 	struct dentry *this = NULL;
434 	struct inode *inode;
435 
436 	/*
437 	 * Decoding upper dir from index is expensive, so first try to lookup
438 	 * overlay dentry in inode/dcache.
439 	 */
440 	inode = ovl_lookup_inode(sb, real, !layer->idx);
441 	if (IS_ERR(inode))
442 		return ERR_CAST(inode);
443 	if (inode) {
444 		this = d_find_any_alias(inode);
445 		iput(inode);
446 	}
447 
448 	/*
449 	 * For decoded lower dir file handle, lookup index by origin to check
450 	 * if lower dir was copied up and and/or removed.
451 	 */
452 	if (!this && layer->idx && ofs->indexdir && !WARN_ON(!d_is_dir(real))) {
453 		index = ovl_lookup_index(ofs, NULL, real, false);
454 		if (IS_ERR(index))
455 			return index;
456 	}
457 
458 	/* Get connected upper overlay dir from index */
459 	if (index) {
460 		struct dentry *upper = ovl_index_upper(ofs, index);
461 
462 		dput(index);
463 		if (IS_ERR_OR_NULL(upper))
464 			return upper;
465 
466 		/*
467 		 * ovl_lookup_real() in lower layer may call recursively once to
468 		 * ovl_lookup_real() in upper layer. The first level call walks
469 		 * back lower parents to the topmost indexed parent. The second
470 		 * recursive call walks back from indexed upper to the topmost
471 		 * connected/hashed upper parent (or up to root).
472 		 */
473 		this = ovl_lookup_real(sb, upper, &ofs->layers[0]);
474 		dput(upper);
475 	}
476 
477 	if (IS_ERR_OR_NULL(this))
478 		return this;
479 
480 	if (ovl_dentry_real_at(this, layer->idx) != real) {
481 		dput(this);
482 		this = ERR_PTR(-EIO);
483 	}
484 
485 	return this;
486 }
487 
488 /*
489  * Lookup an indexed or hashed overlay dentry, whose real dentry is an
490  * ancestor of @real.
491  */
ovl_lookup_real_ancestor(struct super_block * sb,struct dentry * real,const struct ovl_layer * layer)492 static struct dentry *ovl_lookup_real_ancestor(struct super_block *sb,
493 					       struct dentry *real,
494 					       const struct ovl_layer *layer)
495 {
496 	struct dentry *next, *parent = NULL;
497 	struct dentry *ancestor = ERR_PTR(-EIO);
498 
499 	if (real == layer->mnt->mnt_root)
500 		return dget(sb->s_root);
501 
502 	/* Find the topmost indexed or hashed ancestor */
503 	next = dget(real);
504 	for (;;) {
505 		parent = dget_parent(next);
506 
507 		/*
508 		 * Lookup a matching overlay dentry in inode/dentry
509 		 * cache or in index by real inode.
510 		 */
511 		ancestor = ovl_lookup_real_inode(sb, next, layer);
512 		if (ancestor)
513 			break;
514 
515 		if (parent == layer->mnt->mnt_root) {
516 			ancestor = dget(sb->s_root);
517 			break;
518 		}
519 
520 		/*
521 		 * If @real has been moved out of the layer root directory,
522 		 * we will eventully hit the real fs root. This cannot happen
523 		 * by legit overlay rename, so we return error in that case.
524 		 */
525 		if (parent == next) {
526 			ancestor = ERR_PTR(-EXDEV);
527 			break;
528 		}
529 
530 		dput(next);
531 		next = parent;
532 	}
533 
534 	dput(parent);
535 	dput(next);
536 
537 	return ancestor;
538 }
539 
540 /*
541  * Lookup a connected overlay dentry whose real dentry is @real.
542  * If @real is on upper layer, we lookup a child overlay dentry with the same
543  * path the real dentry. Otherwise, we need to consult index for lookup.
544  */
ovl_lookup_real(struct super_block * sb,struct dentry * real,const struct ovl_layer * layer)545 static struct dentry *ovl_lookup_real(struct super_block *sb,
546 				      struct dentry *real,
547 				      const struct ovl_layer *layer)
548 {
549 	struct dentry *connected;
550 	int err = 0;
551 
552 	connected = ovl_lookup_real_ancestor(sb, real, layer);
553 	if (IS_ERR(connected))
554 		return connected;
555 
556 	while (!err) {
557 		struct dentry *next, *this;
558 		struct dentry *parent = NULL;
559 		struct dentry *real_connected = ovl_dentry_real_at(connected,
560 								   layer->idx);
561 
562 		if (real_connected == real)
563 			break;
564 
565 		/* Find the topmost dentry not yet connected */
566 		next = dget(real);
567 		for (;;) {
568 			parent = dget_parent(next);
569 
570 			if (parent == real_connected)
571 				break;
572 
573 			/*
574 			 * If real has been moved out of 'real_connected',
575 			 * we will not find 'real_connected' and hit the layer
576 			 * root. In that case, we need to restart connecting.
577 			 * This game can go on forever in the worst case. We
578 			 * may want to consider taking s_vfs_rename_mutex if
579 			 * this happens more than once.
580 			 */
581 			if (parent == layer->mnt->mnt_root) {
582 				dput(connected);
583 				connected = dget(sb->s_root);
584 				break;
585 			}
586 
587 			/*
588 			 * If real file has been moved out of the layer root
589 			 * directory, we will eventully hit the real fs root.
590 			 * This cannot happen by legit overlay rename, so we
591 			 * return error in that case.
592 			 */
593 			if (parent == next) {
594 				err = -EXDEV;
595 				break;
596 			}
597 
598 			dput(next);
599 			next = parent;
600 		}
601 
602 		if (!err) {
603 			this = ovl_lookup_real_one(connected, next, layer);
604 			if (IS_ERR(this))
605 				err = PTR_ERR(this);
606 
607 			/*
608 			 * Lookup of child in overlay can fail when racing with
609 			 * overlay rename of child away from 'connected' parent.
610 			 * In this case, we need to restart the lookup from the
611 			 * top, because we cannot trust that 'real_connected' is
612 			 * still an ancestor of 'real'. There is a good chance
613 			 * that the renamed overlay ancestor is now in cache, so
614 			 * ovl_lookup_real_ancestor() will find it and we can
615 			 * continue to connect exactly from where lookup failed.
616 			 */
617 			if (err == -ECHILD) {
618 				this = ovl_lookup_real_ancestor(sb, real,
619 								layer);
620 				err = PTR_ERR_OR_ZERO(this);
621 			}
622 			if (!err) {
623 				dput(connected);
624 				connected = this;
625 			}
626 		}
627 
628 		dput(parent);
629 		dput(next);
630 	}
631 
632 	if (err)
633 		goto fail;
634 
635 	return connected;
636 
637 fail:
638 	pr_warn_ratelimited("failed to lookup by real (%pd2, layer=%d, connected=%pd2, err=%i)\n",
639 			    real, layer->idx, connected, err);
640 	dput(connected);
641 	return ERR_PTR(err);
642 }
643 
644 /*
645  * Get an overlay dentry from upper/lower real dentries and index.
646  */
ovl_get_dentry(struct super_block * sb,struct dentry * upper,struct ovl_path * lowerpath,struct dentry * index)647 static struct dentry *ovl_get_dentry(struct super_block *sb,
648 				     struct dentry *upper,
649 				     struct ovl_path *lowerpath,
650 				     struct dentry *index)
651 {
652 	struct ovl_fs *ofs = sb->s_fs_info;
653 	const struct ovl_layer *layer = upper ? &ofs->layers[0] : lowerpath->layer;
654 	struct dentry *real = upper ?: (index ?: lowerpath->dentry);
655 
656 	/*
657 	 * Obtain a disconnected overlay dentry from a non-dir real dentry
658 	 * and index.
659 	 */
660 	if (!d_is_dir(real))
661 		return ovl_obtain_alias(sb, upper, lowerpath, index);
662 
663 	/* Removed empty directory? */
664 	if ((real->d_flags & DCACHE_DISCONNECTED) || d_unhashed(real))
665 		return ERR_PTR(-ENOENT);
666 
667 	/*
668 	 * If real dentry is connected and hashed, get a connected overlay
669 	 * dentry whose real dentry is @real.
670 	 */
671 	return ovl_lookup_real(sb, real, layer);
672 }
673 
ovl_upper_fh_to_d(struct super_block * sb,struct ovl_fh * fh)674 static struct dentry *ovl_upper_fh_to_d(struct super_block *sb,
675 					struct ovl_fh *fh)
676 {
677 	struct ovl_fs *ofs = sb->s_fs_info;
678 	struct dentry *dentry;
679 	struct dentry *upper;
680 
681 	if (!ovl_upper_mnt(ofs))
682 		return ERR_PTR(-EACCES);
683 
684 	upper = ovl_decode_real_fh(ofs, fh, ovl_upper_mnt(ofs), true);
685 	if (IS_ERR_OR_NULL(upper))
686 		return upper;
687 
688 	dentry = ovl_get_dentry(sb, upper, NULL, NULL);
689 	dput(upper);
690 
691 	return dentry;
692 }
693 
ovl_lower_fh_to_d(struct super_block * sb,struct ovl_fh * fh)694 static struct dentry *ovl_lower_fh_to_d(struct super_block *sb,
695 					struct ovl_fh *fh)
696 {
697 	struct ovl_fs *ofs = sb->s_fs_info;
698 	struct ovl_path origin = { };
699 	struct ovl_path *stack = &origin;
700 	struct dentry *dentry = NULL;
701 	struct dentry *index = NULL;
702 	struct inode *inode;
703 	int err;
704 
705 	/* First lookup overlay inode in inode cache by origin fh */
706 	err = ovl_check_origin_fh(ofs, fh, false, NULL, &stack);
707 	if (err)
708 		return ERR_PTR(err);
709 
710 	if (!d_is_dir(origin.dentry) ||
711 	    !(origin.dentry->d_flags & DCACHE_DISCONNECTED)) {
712 		inode = ovl_lookup_inode(sb, origin.dentry, false);
713 		err = PTR_ERR(inode);
714 		if (IS_ERR(inode))
715 			goto out_err;
716 		if (inode) {
717 			dentry = d_find_any_alias(inode);
718 			iput(inode);
719 			if (dentry)
720 				goto out;
721 		}
722 	}
723 
724 	/* Then lookup indexed upper/whiteout by origin fh */
725 	if (ofs->indexdir) {
726 		index = ovl_get_index_fh(ofs, fh);
727 		err = PTR_ERR(index);
728 		if (IS_ERR(index)) {
729 			index = NULL;
730 			goto out_err;
731 		}
732 	}
733 
734 	/* Then try to get a connected upper dir by index */
735 	if (index && d_is_dir(index)) {
736 		struct dentry *upper = ovl_index_upper(ofs, index);
737 
738 		err = PTR_ERR(upper);
739 		if (IS_ERR_OR_NULL(upper))
740 			goto out_err;
741 
742 		dentry = ovl_get_dentry(sb, upper, NULL, NULL);
743 		dput(upper);
744 		goto out;
745 	}
746 
747 	/* Find origin.dentry again with ovl_acceptable() layer check */
748 	if (d_is_dir(origin.dentry)) {
749 		dput(origin.dentry);
750 		origin.dentry = NULL;
751 		err = ovl_check_origin_fh(ofs, fh, true, NULL, &stack);
752 		if (err)
753 			goto out_err;
754 	}
755 	if (index) {
756 		err = ovl_verify_origin(ofs, index, origin.dentry, false);
757 		if (err)
758 			goto out_err;
759 	}
760 
761 	/* Get a connected non-upper dir or disconnected non-dir */
762 	dentry = ovl_get_dentry(sb, NULL, &origin, index);
763 
764 out:
765 	dput(origin.dentry);
766 	dput(index);
767 	return dentry;
768 
769 out_err:
770 	dentry = ERR_PTR(err);
771 	goto out;
772 }
773 
ovl_fid_to_fh(struct fid * fid,int buflen,int fh_type)774 static struct ovl_fh *ovl_fid_to_fh(struct fid *fid, int buflen, int fh_type)
775 {
776 	struct ovl_fh *fh;
777 
778 	/* If on-wire inner fid is aligned - nothing to do */
779 	if (fh_type == OVL_FILEID_V1)
780 		return (struct ovl_fh *)fid;
781 
782 	if (fh_type != OVL_FILEID_V0)
783 		return ERR_PTR(-EINVAL);
784 
785 	if (buflen <= OVL_FH_WIRE_OFFSET)
786 		return ERR_PTR(-EINVAL);
787 
788 	fh = kzalloc(buflen, GFP_KERNEL);
789 	if (!fh)
790 		return ERR_PTR(-ENOMEM);
791 
792 	/* Copy unaligned inner fh into aligned buffer */
793 	memcpy(fh->buf, fid, buflen - OVL_FH_WIRE_OFFSET);
794 	return fh;
795 }
796 
ovl_fh_to_dentry(struct super_block * sb,struct fid * fid,int fh_len,int fh_type)797 static struct dentry *ovl_fh_to_dentry(struct super_block *sb, struct fid *fid,
798 				       int fh_len, int fh_type)
799 {
800 	struct dentry *dentry = NULL;
801 	struct ovl_fh *fh = NULL;
802 	int len = fh_len << 2;
803 	unsigned int flags = 0;
804 	int err;
805 
806 	fh = ovl_fid_to_fh(fid, len, fh_type);
807 	err = PTR_ERR(fh);
808 	if (IS_ERR(fh))
809 		goto out_err;
810 
811 	err = ovl_check_fh_len(fh, len);
812 	if (err)
813 		goto out_err;
814 
815 	flags = fh->fb.flags;
816 	dentry = (flags & OVL_FH_FLAG_PATH_UPPER) ?
817 		 ovl_upper_fh_to_d(sb, fh) :
818 		 ovl_lower_fh_to_d(sb, fh);
819 	err = PTR_ERR(dentry);
820 	if (IS_ERR(dentry) && err != -ESTALE)
821 		goto out_err;
822 
823 out:
824 	/* We may have needed to re-align OVL_FILEID_V0 */
825 	if (!IS_ERR_OR_NULL(fh) && fh != (void *)fid)
826 		kfree(fh);
827 
828 	return dentry;
829 
830 out_err:
831 	pr_warn_ratelimited("failed to decode file handle (len=%d, type=%d, flags=%x, err=%i)\n",
832 			    fh_len, fh_type, flags, err);
833 	dentry = ERR_PTR(err);
834 	goto out;
835 }
836 
ovl_fh_to_parent(struct super_block * sb,struct fid * fid,int fh_len,int fh_type)837 static struct dentry *ovl_fh_to_parent(struct super_block *sb, struct fid *fid,
838 				       int fh_len, int fh_type)
839 {
840 	pr_warn_ratelimited("connectable file handles not supported; use 'no_subtree_check' exportfs option.\n");
841 	return ERR_PTR(-EACCES);
842 }
843 
ovl_get_name(struct dentry * parent,char * name,struct dentry * child)844 static int ovl_get_name(struct dentry *parent, char *name,
845 			struct dentry *child)
846 {
847 	/*
848 	 * ovl_fh_to_dentry() returns connected dir overlay dentries and
849 	 * ovl_fh_to_parent() is not implemented, so we should not get here.
850 	 */
851 	WARN_ON_ONCE(1);
852 	return -EIO;
853 }
854 
ovl_get_parent(struct dentry * dentry)855 static struct dentry *ovl_get_parent(struct dentry *dentry)
856 {
857 	/*
858 	 * ovl_fh_to_dentry() returns connected dir overlay dentries, so we
859 	 * should not get here.
860 	 */
861 	WARN_ON_ONCE(1);
862 	return ERR_PTR(-EIO);
863 }
864 
865 const struct export_operations ovl_export_operations = {
866 	.encode_fh	= ovl_encode_fh,
867 	.fh_to_dentry	= ovl_fh_to_dentry,
868 	.fh_to_parent	= ovl_fh_to_parent,
869 	.get_name	= ovl_get_name,
870 	.get_parent	= ovl_get_parent,
871 };
872