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