ovl: propagate ovl_fs to ovl_decode_real_fh and ovl_encode_real_fh
[linux-2.6-block.git] / fs / overlayfs / readdir.c
CommitLineData
d2912cb1 1// SPDX-License-Identifier: GPL-2.0-only
e9be9d5e
MS
2/*
3 *
4 * Copyright (C) 2011 Novell Inc.
e9be9d5e
MS
5 */
6
7#include <linux/fs.h>
8#include <linux/slab.h>
9#include <linux/namei.h>
10#include <linux/file.h>
11#include <linux/xattr.h>
12#include <linux/rbtree.h>
13#include <linux/security.h>
14#include <linux/cred.h>
b5efccbe 15#include <linux/ratelimit.h>
e9be9d5e
MS
16#include "overlayfs.h"
17
18struct ovl_cache_entry {
e9be9d5e
MS
19 unsigned int len;
20 unsigned int type;
b5efccbe 21 u64 real_ino;
e9be9d5e 22 u64 ino;
e9be9d5e
MS
23 struct list_head l_node;
24 struct rb_node node;
cdb67279 25 struct ovl_cache_entry *next_maybe_whiteout;
95e598e7 26 bool is_upper;
c2096537 27 bool is_whiteout;
68bf8611 28 char name[];
e9be9d5e
MS
29};
30
31struct ovl_dir_cache {
32 long refcount;
33 u64 version;
34 struct list_head entries;
4edb83bb 35 struct rb_root root;
e9be9d5e
MS
36};
37
38struct ovl_readdir_data {
39 struct dir_context ctx;
3fe6e52f 40 struct dentry *dentry;
56656e96 41 bool is_lowest;
4edb83bb 42 struct rb_root *root;
e9be9d5e 43 struct list_head *list;
db6ec212 44 struct list_head middle;
cdb67279 45 struct ovl_cache_entry *first_maybe_whiteout;
e9be9d5e
MS
46 int count;
47 int err;
b5efccbe 48 bool is_upper;
45aebeaf 49 bool d_type_supported;
e9be9d5e
MS
50};
51
52struct ovl_dir_file {
53 bool is_real;
54 bool is_upper;
55 struct ovl_dir_cache *cache;
4330397e 56 struct list_head *cursor;
e9be9d5e
MS
57 struct file *realfile;
58 struct file *upperfile;
59};
60
61static struct ovl_cache_entry *ovl_cache_entry_from_node(struct rb_node *n)
62{
4edb83bb
MS
63 return rb_entry(n, struct ovl_cache_entry, node);
64}
65
66static bool ovl_cache_entry_find_link(const char *name, int len,
67 struct rb_node ***link,
68 struct rb_node **parent)
69{
70 bool found = false;
71 struct rb_node **newp = *link;
72
73 while (!found && *newp) {
74 int cmp;
75 struct ovl_cache_entry *tmp;
76
77 *parent = *newp;
78 tmp = ovl_cache_entry_from_node(*newp);
79 cmp = strncmp(name, tmp->name, len);
80 if (cmp > 0)
81 newp = &tmp->node.rb_right;
82 else if (cmp < 0 || len < tmp->len)
83 newp = &tmp->node.rb_left;
84 else
85 found = true;
86 }
87 *link = newp;
88
89 return found;
e9be9d5e
MS
90}
91
92static struct ovl_cache_entry *ovl_cache_entry_find(struct rb_root *root,
93 const char *name, int len)
94{
95 struct rb_node *node = root->rb_node;
96 int cmp;
97
98 while (node) {
99 struct ovl_cache_entry *p = ovl_cache_entry_from_node(node);
100
101 cmp = strncmp(name, p->name, len);
102 if (cmp > 0)
103 node = p->node.rb_right;
104 else if (cmp < 0 || len < p->len)
105 node = p->node.rb_left;
106 else
107 return p;
108 }
109
110 return NULL;
111}
112
b5efccbe
AG
113static bool ovl_calc_d_ino(struct ovl_readdir_data *rdd,
114 struct ovl_cache_entry *p)
115{
116 /* Don't care if not doing ovl_iter() */
117 if (!rdd->dentry)
118 return false;
119
adbf4f7e
AG
120 /* Always recalc d_ino when remapping lower inode numbers */
121 if (ovl_xino_bits(rdd->dentry->d_sb))
122 return true;
123
b5efccbe
AG
124 /* Always recalc d_ino for parent */
125 if (strcmp(p->name, "..") == 0)
126 return true;
127
128 /* If this is lower, then native d_ino will do */
129 if (!rdd->is_upper)
130 return false;
131
132 /*
133 * Recalc d_ino for '.' and for all entries if dir is impure (contains
134 * copied up entries)
135 */
136 if ((p->name[0] == '.' && p->len == 1) ||
137 ovl_test_flag(OVL_IMPURE, d_inode(rdd->dentry)))
138 return true;
139
140 return false;
141}
142
cdb67279 143static struct ovl_cache_entry *ovl_cache_entry_new(struct ovl_readdir_data *rdd,
3e01cee3 144 const char *name, int len,
e9be9d5e
MS
145 u64 ino, unsigned int d_type)
146{
147 struct ovl_cache_entry *p;
68bf8611 148 size_t size = offsetof(struct ovl_cache_entry, name[len + 1]);
e9be9d5e 149
68bf8611 150 p = kmalloc(size, GFP_KERNEL);
3e01cee3
MS
151 if (!p)
152 return NULL;
153
154 memcpy(p->name, name, len);
155 p->name[len] = '\0';
156 p->len = len;
157 p->type = d_type;
b5efccbe 158 p->real_ino = ino;
3e01cee3 159 p->ino = ino;
b5efccbe
AG
160 /* Defer setting d_ino for upper entry to ovl_iterate() */
161 if (ovl_calc_d_ino(rdd, p))
162 p->ino = 0;
95e598e7 163 p->is_upper = rdd->is_upper;
3e01cee3 164 p->is_whiteout = false;
3e01cee3
MS
165
166 if (d_type == DT_CHR) {
cdb67279
MS
167 p->next_maybe_whiteout = rdd->first_maybe_whiteout;
168 rdd->first_maybe_whiteout = p;
3e01cee3 169 }
e9be9d5e
MS
170 return p;
171}
172
173static int ovl_cache_entry_add_rb(struct ovl_readdir_data *rdd,
174 const char *name, int len, u64 ino,
175 unsigned int d_type)
176{
4edb83bb 177 struct rb_node **newp = &rdd->root->rb_node;
e9be9d5e
MS
178 struct rb_node *parent = NULL;
179 struct ovl_cache_entry *p;
180
4edb83bb
MS
181 if (ovl_cache_entry_find_link(name, len, &newp, &parent))
182 return 0;
e9be9d5e 183
cdb67279 184 p = ovl_cache_entry_new(rdd, name, len, ino, d_type);
31e8ccea
MS
185 if (p == NULL) {
186 rdd->err = -ENOMEM;
e9be9d5e 187 return -ENOMEM;
31e8ccea 188 }
e9be9d5e
MS
189
190 list_add_tail(&p->l_node, rdd->list);
191 rb_link_node(&p->node, parent, newp);
4edb83bb 192 rb_insert_color(&p->node, rdd->root);
e9be9d5e
MS
193
194 return 0;
195}
196
56656e96
MS
197static int ovl_fill_lowest(struct ovl_readdir_data *rdd,
198 const char *name, int namelen,
199 loff_t offset, u64 ino, unsigned int d_type)
e9be9d5e
MS
200{
201 struct ovl_cache_entry *p;
202
4edb83bb 203 p = ovl_cache_entry_find(rdd->root, name, namelen);
e9be9d5e 204 if (p) {
db6ec212 205 list_move_tail(&p->l_node, &rdd->middle);
e9be9d5e 206 } else {
cdb67279 207 p = ovl_cache_entry_new(rdd, name, namelen, ino, d_type);
e9be9d5e
MS
208 if (p == NULL)
209 rdd->err = -ENOMEM;
210 else
db6ec212 211 list_add_tail(&p->l_node, &rdd->middle);
e9be9d5e
MS
212 }
213
214 return rdd->err;
215}
216
217void ovl_cache_free(struct list_head *list)
218{
219 struct ovl_cache_entry *p;
220 struct ovl_cache_entry *n;
221
222 list_for_each_entry_safe(p, n, list, l_node)
223 kfree(p);
224
225 INIT_LIST_HEAD(list);
226}
227
4edb83bb
MS
228void ovl_dir_cache_free(struct inode *inode)
229{
230 struct ovl_dir_cache *cache = ovl_dir_cache(inode);
231
232 if (cache) {
233 ovl_cache_free(&cache->entries);
234 kfree(cache);
235 }
236}
237
e9be9d5e
MS
238static void ovl_cache_put(struct ovl_dir_file *od, struct dentry *dentry)
239{
240 struct ovl_dir_cache *cache = od->cache;
241
e9be9d5e
MS
242 WARN_ON(cache->refcount <= 0);
243 cache->refcount--;
244 if (!cache->refcount) {
4edb83bb
MS
245 if (ovl_dir_cache(d_inode(dentry)) == cache)
246 ovl_set_dir_cache(d_inode(dentry), NULL);
e9be9d5e
MS
247
248 ovl_cache_free(&cache->entries);
249 kfree(cache);
250 }
251}
252
ac7576f4
MS
253static int ovl_fill_merge(struct dir_context *ctx, const char *name,
254 int namelen, loff_t offset, u64 ino,
255 unsigned int d_type)
e9be9d5e 256{
ac7576f4
MS
257 struct ovl_readdir_data *rdd =
258 container_of(ctx, struct ovl_readdir_data, ctx);
e9be9d5e
MS
259
260 rdd->count++;
56656e96 261 if (!rdd->is_lowest)
e9be9d5e
MS
262 return ovl_cache_entry_add_rb(rdd, name, namelen, ino, d_type);
263 else
56656e96 264 return ovl_fill_lowest(rdd, name, namelen, offset, ino, d_type);
e9be9d5e
MS
265}
266
cdb67279
MS
267static int ovl_check_whiteouts(struct dentry *dir, struct ovl_readdir_data *rdd)
268{
269 int err;
270 struct ovl_cache_entry *p;
271 struct dentry *dentry;
272 const struct cred *old_cred;
cdb67279 273
3fe6e52f 274 old_cred = ovl_override_creds(rdd->dentry->d_sb);
cdb67279 275
00235411 276 err = down_write_killable(&dir->d_inode->i_rwsem);
cdb67279
MS
277 if (!err) {
278 while (rdd->first_maybe_whiteout) {
279 p = rdd->first_maybe_whiteout;
280 rdd->first_maybe_whiteout = p->next_maybe_whiteout;
281 dentry = lookup_one_len(p->name, dir, p->len);
282 if (!IS_ERR(dentry)) {
283 p->is_whiteout = ovl_is_whiteout(dentry);
284 dput(dentry);
285 }
286 }
5955102c 287 inode_unlock(dir->d_inode);
cdb67279
MS
288 }
289 revert_creds(old_cred);
cdb67279
MS
290
291 return err;
292}
293
e9be9d5e
MS
294static inline int ovl_dir_read(struct path *realpath,
295 struct ovl_readdir_data *rdd)
296{
297 struct file *realfile;
298 int err;
299
130fdbc3 300 realfile = ovl_path_open(realpath, O_RDONLY | O_LARGEFILE);
e9be9d5e
MS
301 if (IS_ERR(realfile))
302 return PTR_ERR(realfile);
303
cdb67279 304 rdd->first_maybe_whiteout = NULL;
e9be9d5e
MS
305 rdd->ctx.pos = 0;
306 do {
307 rdd->count = 0;
308 rdd->err = 0;
309 err = iterate_dir(realfile, &rdd->ctx);
310 if (err >= 0)
311 err = rdd->err;
312 } while (!err && rdd->count);
cdb67279 313
eea2fb48 314 if (!err && rdd->first_maybe_whiteout && rdd->dentry)
cdb67279
MS
315 err = ovl_check_whiteouts(realpath->dentry, rdd);
316
e9be9d5e
MS
317 fput(realfile);
318
319 return err;
320}
321
b79e05aa
AG
322/*
323 * Can we iterate real dir directly?
324 *
325 * Non-merge dir may contain whiteouts from a time it was a merge upper, before
326 * lower dir was removed under it and possibly before it was rotated from upper
327 * to lower layer.
328 */
329static bool ovl_dir_is_real(struct dentry *dir)
330{
331 return !ovl_test_flag(OVL_WHITEOUTS, d_inode(dir));
332}
333
e9be9d5e
MS
334static void ovl_dir_reset(struct file *file)
335{
336 struct ovl_dir_file *od = file->private_data;
337 struct ovl_dir_cache *cache = od->cache;
338 struct dentry *dentry = file->f_path.dentry;
b79e05aa 339 bool is_real;
e9be9d5e
MS
340
341 if (cache && ovl_dentry_version_get(dentry) != cache->version) {
342 ovl_cache_put(od, dentry);
343 od->cache = NULL;
4330397e 344 od->cursor = NULL;
e9be9d5e 345 }
b79e05aa
AG
346 is_real = ovl_dir_is_real(dentry);
347 if (od->is_real != is_real) {
348 /* is_real can only become false when dir is copied up */
349 if (WARN_ON(is_real))
350 return;
e9be9d5e 351 od->is_real = false;
b79e05aa 352 }
e9be9d5e
MS
353}
354
4edb83bb
MS
355static int ovl_dir_read_merged(struct dentry *dentry, struct list_head *list,
356 struct rb_root *root)
e9be9d5e
MS
357{
358 int err;
9d7459d8 359 struct path realpath;
e9be9d5e
MS
360 struct ovl_readdir_data rdd = {
361 .ctx.actor = ovl_fill_merge,
3fe6e52f 362 .dentry = dentry,
e9be9d5e 363 .list = list,
4edb83bb 364 .root = root,
56656e96 365 .is_lowest = false,
e9be9d5e 366 };
9d7459d8 367 int idx, next;
e9be9d5e 368
9d7459d8
MS
369 for (idx = 0; idx != -1; idx = next) {
370 next = ovl_path_next(idx, dentry, &realpath);
b5efccbe 371 rdd.is_upper = ovl_dentry_upper(dentry) == realpath.dentry;
c9f00fdb 372
9d7459d8 373 if (next != -1) {
9d7459d8 374 err = ovl_dir_read(&realpath, &rdd);
e9be9d5e 375 if (err)
9d7459d8
MS
376 break;
377 } else {
378 /*
379 * Insert lowest layer entries before upper ones, this
380 * allows offsets to be reasonably constant
381 */
382 list_add(&rdd.middle, rdd.list);
56656e96 383 rdd.is_lowest = true;
9d7459d8
MS
384 err = ovl_dir_read(&realpath, &rdd);
385 list_del(&rdd.middle);
e9be9d5e
MS
386 }
387 }
e9be9d5e 388 return err;
e9be9d5e
MS
389}
390
391static void ovl_seek_cursor(struct ovl_dir_file *od, loff_t pos)
392{
4330397e 393 struct list_head *p;
e9be9d5e
MS
394 loff_t off = 0;
395
4330397e 396 list_for_each(p, &od->cache->entries) {
e9be9d5e
MS
397 if (off >= pos)
398 break;
399 off++;
400 }
4330397e 401 /* Cursor is safe since the cache is stable */
402 od->cursor = p;
e9be9d5e
MS
403}
404
405static struct ovl_dir_cache *ovl_cache_get(struct dentry *dentry)
406{
407 int res;
e9be9d5e
MS
408 struct ovl_dir_cache *cache;
409
4edb83bb 410 cache = ovl_dir_cache(d_inode(dentry));
e9be9d5e 411 if (cache && ovl_dentry_version_get(dentry) == cache->version) {
4edb83bb 412 WARN_ON(!cache->refcount);
e9be9d5e
MS
413 cache->refcount++;
414 return cache;
415 }
4edb83bb 416 ovl_set_dir_cache(d_inode(dentry), NULL);
e9be9d5e
MS
417
418 cache = kzalloc(sizeof(struct ovl_dir_cache), GFP_KERNEL);
419 if (!cache)
420 return ERR_PTR(-ENOMEM);
421
422 cache->refcount = 1;
423 INIT_LIST_HEAD(&cache->entries);
4edb83bb 424 cache->root = RB_ROOT;
e9be9d5e 425
4edb83bb 426 res = ovl_dir_read_merged(dentry, &cache->entries, &cache->root);
e9be9d5e
MS
427 if (res) {
428 ovl_cache_free(&cache->entries);
429 kfree(cache);
430 return ERR_PTR(res);
431 }
432
433 cache->version = ovl_dentry_version_get(dentry);
4edb83bb 434 ovl_set_dir_cache(d_inode(dentry), cache);
e9be9d5e
MS
435
436 return cache;
437}
438
adbf4f7e
AG
439/* Map inode number to lower fs unique range */
440static u64 ovl_remap_lower_ino(u64 ino, int xinobits, int fsid,
926e94d7 441 const char *name, int namelen, bool warn)
adbf4f7e 442{
dfe51d47
AG
443 unsigned int xinoshift = 64 - xinobits;
444
445 if (unlikely(ino >> xinoshift)) {
926e94d7
AG
446 if (warn) {
447 pr_warn_ratelimited("d_ino too big (%.*s, ino=%llu, xinobits=%d)\n",
448 namelen, name, ino, xinobits);
449 }
adbf4f7e
AG
450 return ino;
451 }
452
dfe51d47
AG
453 /*
454 * The lowest xinobit is reserved for mapping the non-peresistent inode
455 * numbers range, but this range is only exposed via st_ino, not here.
456 */
457 return ino | ((u64)fsid) << (xinoshift + 1);
adbf4f7e
AG
458}
459
b5efccbe
AG
460/*
461 * Set d_ino for upper entries. Non-upper entries should always report
462 * the uppermost real inode ino and should not call this function.
463 *
464 * When not all layer are on same fs, report real ino also for upper.
465 *
466 * When all layers are on the same fs, and upper has a reference to
467 * copy up origin, call vfs_getattr() on the overlay entry to make
468 * sure that d_ino will be consistent with st_ino from stat(2).
469 */
470static int ovl_cache_update_ino(struct path *path, struct ovl_cache_entry *p)
471
472{
473 struct dentry *dir = path->dentry;
474 struct dentry *this = NULL;
475 enum ovl_path_type type;
476 u64 ino = p->real_ino;
adbf4f7e 477 int xinobits = ovl_xino_bits(dir->d_sb);
b5efccbe
AG
478 int err = 0;
479
0f831ec8 480 if (!ovl_same_dev(dir->d_sb))
b5efccbe
AG
481 goto out;
482
483 if (p->name[0] == '.') {
484 if (p->len == 1) {
485 this = dget(dir);
486 goto get;
487 }
488 if (p->len == 2 && p->name[1] == '.') {
489 /* we shall not be moved */
490 this = dget(dir->d_parent);
491 goto get;
492 }
493 }
494 this = lookup_one_len(p->name, dir, p->len);
495 if (IS_ERR_OR_NULL(this) || !this->d_inode) {
496 if (IS_ERR(this)) {
497 err = PTR_ERR(this);
498 this = NULL;
499 goto fail;
500 }
501 goto out;
502 }
503
504get:
505 type = ovl_path_type(this);
506 if (OVL_TYPE_ORIGIN(type)) {
507 struct kstat stat;
508 struct path statpath = *path;
509
510 statpath.dentry = this;
511 err = vfs_getattr(&statpath, &stat, STATX_INO, 0);
512 if (err)
513 goto fail;
514
4c37e71b
AG
515 /*
516 * Directory inode is always on overlay st_dev.
517 * Non-dir with ovl_same_dev() could be on pseudo st_dev in case
518 * of xino bits overflow.
519 */
520 WARN_ON_ONCE(S_ISDIR(stat.mode) &&
521 dir->d_sb->s_dev != stat.dev);
b5efccbe 522 ino = stat.ino;
adbf4f7e
AG
523 } else if (xinobits && !OVL_TYPE_UPPER(type)) {
524 ino = ovl_remap_lower_ino(ino, xinobits,
525 ovl_layer_lower(this)->fsid,
926e94d7
AG
526 p->name, p->len,
527 ovl_xino_warn(dir->d_sb));
b5efccbe
AG
528 }
529
530out:
531 p->ino = ino;
532 dput(this);
533 return err;
534
535fail:
1bd0a3ae 536 pr_warn_ratelimited("failed to look up (%s) for ino (%i)\n",
b5efccbe
AG
537 p->name, err);
538 goto out;
539}
540
4edb83bb
MS
541static int ovl_fill_plain(struct dir_context *ctx, const char *name,
542 int namelen, loff_t offset, u64 ino,
543 unsigned int d_type)
544{
545 struct ovl_cache_entry *p;
546 struct ovl_readdir_data *rdd =
547 container_of(ctx, struct ovl_readdir_data, ctx);
548
549 rdd->count++;
550 p = ovl_cache_entry_new(rdd, name, namelen, ino, d_type);
551 if (p == NULL) {
552 rdd->err = -ENOMEM;
553 return -ENOMEM;
554 }
555 list_add_tail(&p->l_node, rdd->list);
556
557 return 0;
558}
559
560static int ovl_dir_read_impure(struct path *path, struct list_head *list,
561 struct rb_root *root)
562{
563 int err;
564 struct path realpath;
565 struct ovl_cache_entry *p, *n;
566 struct ovl_readdir_data rdd = {
567 .ctx.actor = ovl_fill_plain,
568 .list = list,
569 .root = root,
570 };
571
572 INIT_LIST_HEAD(list);
573 *root = RB_ROOT;
574 ovl_path_upper(path->dentry, &realpath);
575
576 err = ovl_dir_read(&realpath, &rdd);
577 if (err)
578 return err;
579
580 list_for_each_entry_safe(p, n, list, l_node) {
581 if (strcmp(p->name, ".") != 0 &&
582 strcmp(p->name, "..") != 0) {
583 err = ovl_cache_update_ino(path, p);
584 if (err)
585 return err;
586 }
587 if (p->ino == p->real_ino) {
588 list_del(&p->l_node);
589 kfree(p);
590 } else {
591 struct rb_node **newp = &root->rb_node;
592 struct rb_node *parent = NULL;
593
594 if (WARN_ON(ovl_cache_entry_find_link(p->name, p->len,
595 &newp, &parent)))
596 return -EIO;
597
598 rb_link_node(&p->node, parent, newp);
599 rb_insert_color(&p->node, root);
600 }
601 }
602 return 0;
603}
604
605static struct ovl_dir_cache *ovl_cache_get_impure(struct path *path)
606{
607 int res;
608 struct dentry *dentry = path->dentry;
610afc0b 609 struct ovl_fs *ofs = OVL_FS(dentry->d_sb);
4edb83bb
MS
610 struct ovl_dir_cache *cache;
611
612 cache = ovl_dir_cache(d_inode(dentry));
613 if (cache && ovl_dentry_version_get(dentry) == cache->version)
614 return cache;
615
616 /* Impure cache is not refcounted, free it here */
617 ovl_dir_cache_free(d_inode(dentry));
618 ovl_set_dir_cache(d_inode(dentry), NULL);
619
620 cache = kzalloc(sizeof(struct ovl_dir_cache), GFP_KERNEL);
621 if (!cache)
622 return ERR_PTR(-ENOMEM);
623
624 res = ovl_dir_read_impure(path, &cache->entries, &cache->root);
625 if (res) {
626 ovl_cache_free(&cache->entries);
627 kfree(cache);
628 return ERR_PTR(res);
629 }
630 if (list_empty(&cache->entries)) {
a5a927a7
AG
631 /*
632 * A good opportunity to get rid of an unneeded "impure" flag.
633 * Removing the "impure" xattr is best effort.
634 */
635 if (!ovl_want_write(dentry)) {
610afc0b 636 ovl_do_removexattr(ofs, ovl_dentry_upper(dentry),
a5a927a7
AG
637 OVL_XATTR_IMPURE);
638 ovl_drop_write(dentry);
639 }
4edb83bb
MS
640 ovl_clear_flag(OVL_IMPURE, d_inode(dentry));
641 kfree(cache);
642 return NULL;
643 }
644
645 cache->version = ovl_dentry_version_get(dentry);
646 ovl_set_dir_cache(d_inode(dentry), cache);
647
648 return cache;
649}
650
651struct ovl_readdir_translate {
652 struct dir_context *orig_ctx;
653 struct ovl_dir_cache *cache;
654 struct dir_context ctx;
655 u64 parent_ino;
adbf4f7e
AG
656 int fsid;
657 int xinobits;
926e94d7 658 bool xinowarn;
4edb83bb
MS
659};
660
661static int ovl_fill_real(struct dir_context *ctx, const char *name,
662 int namelen, loff_t offset, u64 ino,
663 unsigned int d_type)
664{
665 struct ovl_readdir_translate *rdt =
666 container_of(ctx, struct ovl_readdir_translate, ctx);
667 struct dir_context *orig_ctx = rdt->orig_ctx;
668
adbf4f7e 669 if (rdt->parent_ino && strcmp(name, "..") == 0) {
4edb83bb 670 ino = rdt->parent_ino;
adbf4f7e 671 } else if (rdt->cache) {
4edb83bb
MS
672 struct ovl_cache_entry *p;
673
674 p = ovl_cache_entry_find(&rdt->cache->root, name, namelen);
675 if (p)
676 ino = p->ino;
adbf4f7e
AG
677 } else if (rdt->xinobits) {
678 ino = ovl_remap_lower_ino(ino, rdt->xinobits, rdt->fsid,
926e94d7 679 name, namelen, rdt->xinowarn);
4edb83bb
MS
680 }
681
682 return orig_ctx->actor(orig_ctx, name, namelen, offset, ino, d_type);
683}
684
67810693
AG
685static bool ovl_is_impure_dir(struct file *file)
686{
687 struct ovl_dir_file *od = file->private_data;
688 struct inode *dir = d_inode(file->f_path.dentry);
689
690 /*
691 * Only upper dir can be impure, but if we are in the middle of
692 * iterating a lower real dir, dir could be copied up and marked
693 * impure. We only want the impure cache if we started iterating
694 * a real upper dir to begin with.
695 */
696 return od->is_upper && ovl_test_flag(OVL_IMPURE, dir);
697
698}
699
4edb83bb
MS
700static int ovl_iterate_real(struct file *file, struct dir_context *ctx)
701{
702 int err;
703 struct ovl_dir_file *od = file->private_data;
704 struct dentry *dir = file->f_path.dentry;
13464165 705 const struct ovl_layer *lower_layer = ovl_layer_lower(dir);
4edb83bb
MS
706 struct ovl_readdir_translate rdt = {
707 .ctx.actor = ovl_fill_real,
708 .orig_ctx = ctx,
adbf4f7e 709 .xinobits = ovl_xino_bits(dir->d_sb),
926e94d7 710 .xinowarn = ovl_xino_warn(dir->d_sb),
4edb83bb
MS
711 };
712
adbf4f7e
AG
713 if (rdt.xinobits && lower_layer)
714 rdt.fsid = lower_layer->fsid;
715
4edb83bb
MS
716 if (OVL_TYPE_MERGE(ovl_path_type(dir->d_parent))) {
717 struct kstat stat;
718 struct path statpath = file->f_path;
719
720 statpath.dentry = dir->d_parent;
721 err = vfs_getattr(&statpath, &stat, STATX_INO, 0);
722 if (err)
723 return err;
724
725 WARN_ON_ONCE(dir->d_sb->s_dev != stat.dev);
726 rdt.parent_ino = stat.ino;
727 }
728
67810693 729 if (ovl_is_impure_dir(file)) {
4edb83bb
MS
730 rdt.cache = ovl_cache_get_impure(&file->f_path);
731 if (IS_ERR(rdt.cache))
732 return PTR_ERR(rdt.cache);
733 }
734
b02a16e6
AG
735 err = iterate_dir(od->realfile, &rdt.ctx);
736 ctx->pos = rdt.ctx.pos;
737
738 return err;
4edb83bb
MS
739}
740
741
e9be9d5e
MS
742static int ovl_iterate(struct file *file, struct dir_context *ctx)
743{
744 struct ovl_dir_file *od = file->private_data;
745 struct dentry *dentry = file->f_path.dentry;
4330397e 746 struct ovl_cache_entry *p;
48bd024b 747 const struct cred *old_cred;
b5efccbe 748 int err;
e9be9d5e 749
48bd024b 750 old_cred = ovl_override_creds(dentry->d_sb);
e9be9d5e
MS
751 if (!ctx->pos)
752 ovl_dir_reset(file);
753
4edb83bb
MS
754 if (od->is_real) {
755 /*
756 * If parent is merge, then need to adjust d_ino for '..', if
757 * dir is impure then need to adjust d_ino for copied up
758 * entries.
759 */
adbf4f7e 760 if (ovl_xino_bits(dentry->d_sb) ||
0f831ec8 761 (ovl_same_fs(dentry->d_sb) &&
67810693 762 (ovl_is_impure_dir(file) ||
adbf4f7e 763 OVL_TYPE_MERGE(ovl_path_type(dentry->d_parent))))) {
48bd024b
MS
764 err = ovl_iterate_real(file, ctx);
765 } else {
766 err = iterate_dir(od->realfile, ctx);
4edb83bb 767 }
48bd024b 768 goto out;
4edb83bb 769 }
e9be9d5e
MS
770
771 if (!od->cache) {
772 struct ovl_dir_cache *cache;
773
774 cache = ovl_cache_get(dentry);
48bd024b 775 err = PTR_ERR(cache);
e9be9d5e 776 if (IS_ERR(cache))
48bd024b 777 goto out;
e9be9d5e
MS
778
779 od->cache = cache;
780 ovl_seek_cursor(od, ctx->pos);
781 }
782
4330397e 783 while (od->cursor != &od->cache->entries) {
784 p = list_entry(od->cursor, struct ovl_cache_entry, l_node);
b5efccbe
AG
785 if (!p->is_whiteout) {
786 if (!p->ino) {
787 err = ovl_cache_update_ino(&file->f_path, p);
788 if (err)
48bd024b 789 goto out;
b5efccbe 790 }
4330397e 791 if (!dir_emit(ctx, p->name, p->len, p->ino, p->type))
792 break;
b5efccbe 793 }
4330397e 794 od->cursor = p->l_node.next;
795 ctx->pos++;
e9be9d5e 796 }
48bd024b
MS
797 err = 0;
798out:
799 revert_creds(old_cred);
800 return err;
e9be9d5e
MS
801}
802
803static loff_t ovl_dir_llseek(struct file *file, loff_t offset, int origin)
804{
805 loff_t res;
806 struct ovl_dir_file *od = file->private_data;
807
5955102c 808 inode_lock(file_inode(file));
e9be9d5e
MS
809 if (!file->f_pos)
810 ovl_dir_reset(file);
811
812 if (od->is_real) {
813 res = vfs_llseek(od->realfile, offset, origin);
814 file->f_pos = od->realfile->f_pos;
815 } else {
816 res = -EINVAL;
817
818 switch (origin) {
819 case SEEK_CUR:
820 offset += file->f_pos;
821 break;
822 case SEEK_SET:
823 break;
824 default:
825 goto out_unlock;
826 }
827 if (offset < 0)
828 goto out_unlock;
829
830 if (offset != file->f_pos) {
831 file->f_pos = offset;
832 if (od->cache)
833 ovl_seek_cursor(od, offset);
834 }
835 res = offset;
836 }
837out_unlock:
5955102c 838 inode_unlock(file_inode(file));
e9be9d5e
MS
839
840 return res;
841}
842
61536bed 843static struct file *ovl_dir_open_realfile(const struct file *file,
130fdbc3
MS
844 struct path *realpath)
845{
48bd024b
MS
846 struct file *res;
847 const struct cred *old_cred;
848
849 old_cred = ovl_override_creds(file_inode(file)->i_sb);
850 res = ovl_path_open(realpath, O_RDONLY | (file->f_flags & O_LARGEFILE));
851 revert_creds(old_cred);
852
853 return res;
130fdbc3
MS
854}
855
61536bed
AG
856/*
857 * Like ovl_real_fdget(), returns upperfile if dir was copied up since open.
858 * Unlike ovl_real_fdget(), this caches upperfile in file->private_data.
859 *
860 * TODO: use same abstract type for file->private_data of dir and file so
861 * upperfile could also be cached for files as well.
862 */
863struct file *ovl_dir_real_file(const struct file *file, bool want_upper)
e9be9d5e 864{
61536bed 865
e9be9d5e
MS
866 struct ovl_dir_file *od = file->private_data;
867 struct dentry *dentry = file->f_path.dentry;
868 struct file *realfile = od->realfile;
869
d796e77f 870 if (!OVL_TYPE_UPPER(ovl_path_type(dentry)))
61536bed 871 return want_upper ? NULL : realfile;
c86243b0 872
e9be9d5e
MS
873 /*
874 * Need to check if we started out being a lower dir, but got copied up
875 */
d796e77f 876 if (!od->is_upper) {
e9be9d5e
MS
877 struct inode *inode = file_inode(file);
878
506458ef 879 realfile = READ_ONCE(od->upperfile);
e9be9d5e
MS
880 if (!realfile) {
881 struct path upperpath;
882
883 ovl_path_upper(dentry, &upperpath);
130fdbc3 884 realfile = ovl_dir_open_realfile(file, &upperpath);
ff7a5fb0 885
5955102c 886 inode_lock(inode);
3d268c9b
AV
887 if (!od->upperfile) {
888 if (IS_ERR(realfile)) {
5955102c 889 inode_unlock(inode);
61536bed 890 return realfile;
3d268c9b 891 }
ff7a5fb0 892 smp_store_release(&od->upperfile, realfile);
3d268c9b
AV
893 } else {
894 /* somebody has beaten us to it */
895 if (!IS_ERR(realfile))
896 fput(realfile);
897 realfile = od->upperfile;
e9be9d5e 898 }
5955102c 899 inode_unlock(inode);
e9be9d5e 900 }
e9be9d5e
MS
901 }
902
61536bed
AG
903 return realfile;
904}
905
906static int ovl_dir_fsync(struct file *file, loff_t start, loff_t end,
907 int datasync)
908{
909 struct file *realfile;
910 int err;
911
912 if (!ovl_should_sync(OVL_FS(file->f_path.dentry->d_sb)))
913 return 0;
914
915 realfile = ovl_dir_real_file(file, true);
916 err = PTR_ERR_OR_ZERO(realfile);
917
918 /* Nothing to sync for lower */
919 if (!realfile || err)
920 return err;
921
e9be9d5e
MS
922 return vfs_fsync_range(realfile, start, end, datasync);
923}
924
925static int ovl_dir_release(struct inode *inode, struct file *file)
926{
927 struct ovl_dir_file *od = file->private_data;
928
929 if (od->cache) {
5955102c 930 inode_lock(inode);
e9be9d5e 931 ovl_cache_put(od, file->f_path.dentry);
5955102c 932 inode_unlock(inode);
e9be9d5e
MS
933 }
934 fput(od->realfile);
935 if (od->upperfile)
936 fput(od->upperfile);
937 kfree(od);
938
939 return 0;
940}
941
942static int ovl_dir_open(struct inode *inode, struct file *file)
943{
944 struct path realpath;
945 struct file *realfile;
946 struct ovl_dir_file *od;
947 enum ovl_path_type type;
948
949 od = kzalloc(sizeof(struct ovl_dir_file), GFP_KERNEL);
950 if (!od)
951 return -ENOMEM;
952
953 type = ovl_path_real(file->f_path.dentry, &realpath);
130fdbc3 954 realfile = ovl_dir_open_realfile(file, &realpath);
e9be9d5e
MS
955 if (IS_ERR(realfile)) {
956 kfree(od);
957 return PTR_ERR(realfile);
958 }
e9be9d5e 959 od->realfile = realfile;
b79e05aa 960 od->is_real = ovl_dir_is_real(file->f_path.dentry);
1afaba1e 961 od->is_upper = OVL_TYPE_UPPER(type);
e9be9d5e
MS
962 file->private_data = od;
963
964 return 0;
965}
966
967const struct file_operations ovl_dir_operations = {
968 .read = generic_read_dir,
969 .open = ovl_dir_open,
970 .iterate = ovl_iterate,
971 .llseek = ovl_dir_llseek,
972 .fsync = ovl_dir_fsync,
973 .release = ovl_dir_release,
61536bed
AG
974 .unlocked_ioctl = ovl_ioctl,
975#ifdef CONFIG_COMPAT
976 .compat_ioctl = ovl_compat_ioctl,
977#endif
e9be9d5e
MS
978};
979
980int ovl_check_empty_dir(struct dentry *dentry, struct list_head *list)
981{
982 int err;
95e598e7 983 struct ovl_cache_entry *p, *n;
4edb83bb 984 struct rb_root root = RB_ROOT;
6d0a8a90 985 const struct cred *old_cred;
e9be9d5e 986
6d0a8a90 987 old_cred = ovl_override_creds(dentry->d_sb);
4edb83bb 988 err = ovl_dir_read_merged(dentry, list, &root);
6d0a8a90 989 revert_creds(old_cred);
e9be9d5e
MS
990 if (err)
991 return err;
992
993 err = 0;
994
95e598e7 995 list_for_each_entry_safe(p, n, list, l_node) {
996 /*
997 * Select whiteouts in upperdir, they should
998 * be cleared when deleting this directory.
999 */
1000 if (p->is_whiteout) {
1001 if (p->is_upper)
1002 continue;
1003 goto del_entry;
1004 }
e9be9d5e
MS
1005
1006 if (p->name[0] == '.') {
1007 if (p->len == 1)
95e598e7 1008 goto del_entry;
e9be9d5e 1009 if (p->len == 2 && p->name[1] == '.')
95e598e7 1010 goto del_entry;
e9be9d5e
MS
1011 }
1012 err = -ENOTEMPTY;
1013 break;
95e598e7 1014
1015del_entry:
1016 list_del(&p->l_node);
1017 kfree(p);
e9be9d5e
MS
1018 }
1019
1020 return err;
1021}
1022
1023void ovl_cleanup_whiteouts(struct dentry *upper, struct list_head *list)
1024{
1025 struct ovl_cache_entry *p;
1026
5955102c 1027 inode_lock_nested(upper->d_inode, I_MUTEX_CHILD);
e9be9d5e
MS
1028 list_for_each_entry(p, list, l_node) {
1029 struct dentry *dentry;
1030
95e598e7 1031 if (WARN_ON(!p->is_whiteout || !p->is_upper))
e9be9d5e
MS
1032 continue;
1033
1034 dentry = lookup_one_len(p->name, upper, p->len);
1035 if (IS_ERR(dentry)) {
1bd0a3ae 1036 pr_err("lookup '%s/%.*s' failed (%i)\n",
e9be9d5e
MS
1037 upper->d_name.name, p->len, p->name,
1038 (int) PTR_ERR(dentry));
1039 continue;
1040 }
84889d49
KK
1041 if (dentry->d_inode)
1042 ovl_cleanup(upper->d_inode, dentry);
e9be9d5e
MS
1043 dput(dentry);
1044 }
5955102c 1045 inode_unlock(upper->d_inode);
e9be9d5e 1046}
45aebeaf
VG
1047
1048static int ovl_check_d_type(struct dir_context *ctx, const char *name,
1049 int namelen, loff_t offset, u64 ino,
1050 unsigned int d_type)
1051{
1052 struct ovl_readdir_data *rdd =
1053 container_of(ctx, struct ovl_readdir_data, ctx);
1054
1055 /* Even if d_type is not supported, DT_DIR is returned for . and .. */
1056 if (!strncmp(name, ".", namelen) || !strncmp(name, "..", namelen))
1057 return 0;
1058
1059 if (d_type != DT_UNKNOWN)
1060 rdd->d_type_supported = true;
1061
1062 return 0;
1063}
1064
1065/*
1066 * Returns 1 if d_type is supported, 0 not supported/unknown. Negative values
1067 * if error is encountered.
1068 */
1069int ovl_check_d_type_supported(struct path *realpath)
1070{
1071 int err;
1072 struct ovl_readdir_data rdd = {
1073 .ctx.actor = ovl_check_d_type,
1074 .d_type_supported = false,
1075 };
1076
1077 err = ovl_dir_read(realpath, &rdd);
1078 if (err)
1079 return err;
1080
1081 return rdd.d_type_supported;
1082}
eea2fb48 1083
235ce9ed
AG
1084#define OVL_INCOMPATDIR_NAME "incompat"
1085
1086static int ovl_workdir_cleanup_recurse(struct path *path, int level)
eea2fb48
MS
1087{
1088 int err;
1089 struct inode *dir = path->dentry->d_inode;
1090 LIST_HEAD(list);
4edb83bb 1091 struct rb_root root = RB_ROOT;
eea2fb48
MS
1092 struct ovl_cache_entry *p;
1093 struct ovl_readdir_data rdd = {
1094 .ctx.actor = ovl_fill_merge,
1095 .dentry = NULL,
1096 .list = &list,
4edb83bb 1097 .root = &root,
eea2fb48
MS
1098 .is_lowest = false,
1099 };
235ce9ed
AG
1100 bool incompat = false;
1101
1102 /*
1103 * The "work/incompat" directory is treated specially - if it is not
1104 * empty, instead of printing a generic error and mounting read-only,
1105 * we will error about incompat features and fail the mount.
1106 *
1107 * When called from ovl_indexdir_cleanup(), path->dentry->d_name.name
1108 * starts with '#'.
1109 */
1110 if (level == 2 &&
1111 !strcmp(path->dentry->d_name.name, OVL_INCOMPATDIR_NAME))
1112 incompat = true;
eea2fb48
MS
1113
1114 err = ovl_dir_read(path, &rdd);
1115 if (err)
1116 goto out;
1117
1118 inode_lock_nested(dir, I_MUTEX_PARENT);
1119 list_for_each_entry(p, &list, l_node) {
1120 struct dentry *dentry;
1121
1122 if (p->name[0] == '.') {
1123 if (p->len == 1)
1124 continue;
1125 if (p->len == 2 && p->name[1] == '.')
1126 continue;
235ce9ed
AG
1127 } else if (incompat) {
1128 pr_err("overlay with incompat feature '%s' cannot be mounted\n",
1129 p->name);
1130 err = -EINVAL;
1131 break;
eea2fb48
MS
1132 }
1133 dentry = lookup_one_len(p->name, path->dentry, p->len);
1134 if (IS_ERR(dentry))
1135 continue;
1136 if (dentry->d_inode)
235ce9ed 1137 err = ovl_workdir_cleanup(dir, path->mnt, dentry, level);
eea2fb48 1138 dput(dentry);
235ce9ed
AG
1139 if (err)
1140 break;
eea2fb48
MS
1141 }
1142 inode_unlock(dir);
1143out:
1144 ovl_cache_free(&list);
235ce9ed 1145 return err;
eea2fb48
MS
1146}
1147
3011645b 1148int ovl_workdir_cleanup(struct inode *dir, struct vfsmount *mnt,
eea2fb48
MS
1149 struct dentry *dentry, int level)
1150{
1151 int err;
1152
1153 if (!d_is_dir(dentry) || level > 1) {
3011645b 1154 return ovl_cleanup(dir, dentry);
eea2fb48
MS
1155 }
1156
1157 err = ovl_do_rmdir(dir, dentry);
1158 if (err) {
1159 struct path path = { .mnt = mnt, .dentry = dentry };
1160
1161 inode_unlock(dir);
235ce9ed 1162 err = ovl_workdir_cleanup_recurse(&path, level + 1);
eea2fb48 1163 inode_lock_nested(dir, I_MUTEX_PARENT);
235ce9ed
AG
1164 if (!err)
1165 err = ovl_cleanup(dir, dentry);
eea2fb48 1166 }
3011645b
AG
1167
1168 return err;
eea2fb48 1169}
415543d5 1170
1eff1a1d 1171int ovl_indexdir_cleanup(struct ovl_fs *ofs)
415543d5
AG
1172{
1173 int err;
1eff1a1d 1174 struct dentry *indexdir = ofs->indexdir;
dc7ab677 1175 struct dentry *index = NULL;
1eff1a1d 1176 struct inode *dir = indexdir->d_inode;
08f4c7c8 1177 struct path path = { .mnt = ovl_upper_mnt(ofs), .dentry = indexdir };
415543d5 1178 LIST_HEAD(list);
4edb83bb 1179 struct rb_root root = RB_ROOT;
415543d5
AG
1180 struct ovl_cache_entry *p;
1181 struct ovl_readdir_data rdd = {
1182 .ctx.actor = ovl_fill_merge,
1183 .dentry = NULL,
1184 .list = &list,
4edb83bb 1185 .root = &root,
415543d5
AG
1186 .is_lowest = false,
1187 };
1188
1189 err = ovl_dir_read(&path, &rdd);
1190 if (err)
1191 goto out;
1192
1193 inode_lock_nested(dir, I_MUTEX_PARENT);
1194 list_for_each_entry(p, &list, l_node) {
415543d5
AG
1195 if (p->name[0] == '.') {
1196 if (p->len == 1)
1197 continue;
1198 if (p->len == 2 && p->name[1] == '.')
1199 continue;
1200 }
1eff1a1d 1201 index = lookup_one_len(p->name, indexdir, p->len);
415543d5
AG
1202 if (IS_ERR(index)) {
1203 err = PTR_ERR(index);
dc7ab677 1204 index = NULL;
415543d5
AG
1205 break;
1206 }
3011645b
AG
1207 /* Cleanup leftover from index create/cleanup attempt */
1208 if (index->d_name.name[0] == '#') {
1209 err = ovl_workdir_cleanup(dir, path.mnt, index, 1);
1210 if (err)
1211 break;
1212 goto next;
1213 }
1eff1a1d 1214 err = ovl_verify_index(ofs, index);
24f0b172
AG
1215 if (!err) {
1216 goto next;
1217 } else if (err == -ESTALE) {
1218 /* Cleanup stale index entries */
415543d5 1219 err = ovl_cleanup(dir, index);
24f0b172
AG
1220 } else if (err != -ENOENT) {
1221 /*
1222 * Abort mount to avoid corrupting the index if
1223 * an incompatible index entry was found or on out
1224 * of memory.
1225 */
1226 break;
1227 } else if (ofs->config.nfs_export) {
1228 /*
1229 * Whiteout orphan index to block future open by
1230 * handle after overlay nlink dropped to zero.
1231 */
c21c839b 1232 err = ovl_cleanup_and_whiteout(ofs, dir, index);
24f0b172
AG
1233 } else {
1234 /* Cleanup orphan index entries */
1235 err = ovl_cleanup(dir, index);
1236 }
1237
fa0096e3
AG
1238 if (err)
1239 break;
1240
24f0b172 1241next:
415543d5 1242 dput(index);
dc7ab677 1243 index = NULL;
415543d5 1244 }
dc7ab677 1245 dput(index);
415543d5
AG
1246 inode_unlock(dir);
1247out:
1248 ovl_cache_free(&list);
1249 if (err)
1bd0a3ae 1250 pr_err("failed index dir cleanup (%i)\n", err);
415543d5
AG
1251 return err;
1252}