fs/overlayfs/readdir.c

   1 // SPDX-License-Identifier: GPL-2.0-only
   2 /*
   3  *
   4  * Copyright (C) 2011 Novell Inc.
   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>
  15 #include <linux/ratelimit.h>
  16 #include "overlayfs.h"
  17
  18 struct ovl_cache_entry {
  19         unsigned int len;
  20         unsigned int type;
  21         u64 real_ino;
  22         u64 ino;
  23         struct list_head l_node;
  24         struct rb_node node;
  25         struct ovl_cache_entry *next_maybe_whiteout;
  26         bool is_upper;
  27         bool is_whiteout;
  28         char name[];
  29 };
  30
  31 struct ovl_dir_cache {
  32         long refcount;
  33         u64 version;
  34         struct list_head entries;
  35         struct rb_root root;
  36 };
  37
  38 struct ovl_readdir_data {
  39         struct dir_context ctx;
  40         struct dentry *dentry;
  41         bool is_lowest;
  42         struct rb_root *root;
  43         struct list_head *list;
  44         struct list_head middle;
  45         struct ovl_cache_entry *first_maybe_whiteout;
  46         int count;
  47         int err;
  48         bool is_upper;
  49         bool d_type_supported;
  50 };
  51
  52 struct ovl_dir_file {
  53         bool is_real;
  54         bool is_upper;
  55         struct ovl_dir_cache *cache;
  56         struct list_head *cursor;
  57         struct file *realfile;
  58         struct file *upperfile;
  59 };
  60
  61 static struct ovl_cache_entry *ovl_cache_entry_from_node(struct rb_node *n)
  62 {
  63         return rb_entry(n, struct ovl_cache_entry, node);
  64 }
  65
  66 static 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;
  90 }
  91
  92 static 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
 113 static 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
 120         /* Always recalc d_ino when remapping lower inode numbers */
 121         if (ovl_xino_bits(rdd->dentry->d_sb))
 122                 return true;
 123
 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
 143 static struct ovl_cache_entry *ovl_cache_entry_new(struct ovl_readdir_data *rdd,
 144                                                    const char *name, int len,
 145                                                    u64 ino, unsigned int d_type)
 146 {
 147         struct ovl_cache_entry *p;
 148         size_t size = offsetof(struct ovl_cache_entry, name[len + 1]);
 149
 150         p = kmalloc(size, GFP_KERNEL);
 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;
 158         p->real_ino = ino;
 159         p->ino = ino;
 160         /* Defer setting d_ino for upper entry to ovl_iterate() */
 161         if (ovl_calc_d_ino(rdd, p))
 162                 p->ino = 0;
 163         p->is_upper = rdd->is_upper;
 164         p->is_whiteout = false;
 165
 166         if (d_type == DT_CHR) {
 167                 p->next_maybe_whiteout = rdd->first_maybe_whiteout;
 168                 rdd->first_maybe_whiteout = p;
 169         }
 170         return p;
 171 }
 172
 173 static 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 {
 177         struct rb_node **newp = &rdd->root->rb_node;
 178         struct rb_node *parent = NULL;
 179         struct ovl_cache_entry *p;
 180
 181         if (ovl_cache_entry_find_link(name, len, &newp, &parent))
 182                 return 0;
 183
 184         p = ovl_cache_entry_new(rdd, name, len, ino, d_type);
 185         if (p == NULL) {
 186                 rdd->err = -ENOMEM;
 187                 return -ENOMEM;
 188         }
 189
 190         list_add_tail(&p->l_node, rdd->list);
 191         rb_link_node(&p->node, parent, newp);
 192         rb_insert_color(&p->node, rdd->root);
 193
 194         return 0;
 195 }
 196
 197 static 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)
 200 {
 201         struct ovl_cache_entry *p;
 202
 203         p = ovl_cache_entry_find(rdd->root, name, namelen);
 204         if (p) {
 205                 list_move_tail(&p->l_node, &rdd->middle);
 206         } else {
 207                 p = ovl_cache_entry_new(rdd, name, namelen, ino, d_type);
 208                 if (p == NULL)
 209                         rdd->err = -ENOMEM;
 210                 else
 211                         list_add_tail(&p->l_node, &rdd->middle);
 212         }
 213
 214         return rdd->err;
 215 }
 216
 217 void 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
 228 void 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
 238 static void ovl_cache_put(struct ovl_dir_file *od, struct dentry *dentry)
 239 {
 240         struct ovl_dir_cache *cache = od->cache;
 241
 242         WARN_ON(cache->refcount <= 0);
 243         cache->refcount--;
 244         if (!cache->refcount) {
 245                 if (ovl_dir_cache(d_inode(dentry)) == cache)
 246                         ovl_set_dir_cache(d_inode(dentry), NULL);
 247
 248                 ovl_cache_free(&cache->entries);
 249                 kfree(cache);
 250         }
 251 }
 252
 253 static int ovl_fill_merge(struct dir_context *ctx, const char *name,
 254                           int namelen, loff_t offset, u64 ino,
 255                           unsigned int d_type)
 256 {
 257         struct ovl_readdir_data *rdd =
 258                 container_of(ctx, struct ovl_readdir_data, ctx);
 259
 260         rdd->count++;
 261         if (!rdd->is_lowest)
 262                 return ovl_cache_entry_add_rb(rdd, name, namelen, ino, d_type);
 263         else
 264                 return ovl_fill_lowest(rdd, name, namelen, offset, ino, d_type);
 265 }
 266
 267 static 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;
 273
 274         old_cred = ovl_override_creds(rdd->dentry->d_sb);
 275
 276         err = down_write_killable(&dir->d_inode->i_rwsem);
 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                 }
 287                 inode_unlock(dir->d_inode);
 288         }
 289         revert_creds(old_cred);
 290
 291         return err;
 292 }
 293
 294 static inline int ovl_dir_read(struct path *realpath,
 295                                struct ovl_readdir_data *rdd)
 296 {
 297         struct file *realfile;
 298         int err;
 299
 300         realfile = ovl_path_open(realpath, O_RDONLY | O_DIRECTORY);
 301         if (IS_ERR(realfile))
 302                 return PTR_ERR(realfile);
 303
 304         rdd->first_maybe_whiteout = NULL;
 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);
 313
 314         if (!err && rdd->first_maybe_whiteout && rdd->dentry)
 315                 err = ovl_check_whiteouts(realpath->dentry, rdd);
 316
 317         fput(realfile);
 318
 319         return err;
 320 }
 321
 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  */
 329 static bool ovl_dir_is_real(struct dentry *dir)
 330 {
 331         return !ovl_test_flag(OVL_WHITEOUTS, d_inode(dir));
 332 }
 333
 334 static 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;
 339         bool is_real;
 340
 341         if (cache && ovl_dentry_version_get(dentry) != cache->version) {
 342                 ovl_cache_put(od, dentry);
 343                 od->cache = NULL;
 344                 od->cursor = NULL;
 345         }
 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;
 351                 od->is_real = false;
 352         }
 353 }
 354
 355 static int ovl_dir_read_merged(struct dentry *dentry, struct list_head *list,
 356         struct rb_root *root)
 357 {
 358         int err;
 359         struct path realpath;
 360         struct ovl_readdir_data rdd = {
 361                 .ctx.actor = ovl_fill_merge,
 362                 .dentry = dentry,
 363                 .list = list,
 364                 .root = root,
 365                 .is_lowest = false,
 366         };
 367         int idx, next;
 368
 369         for (idx = 0; idx != -1; idx = next) {
 370                 next = ovl_path_next(idx, dentry, &realpath);
 371                 rdd.is_upper = ovl_dentry_upper(dentry) == realpath.dentry;
 372
 373                 if (next != -1) {
 374                         err = ovl_dir_read(&realpath, &rdd);
 375                         if (err)
 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);
 383                         rdd.is_lowest = true;
 384                         err = ovl_dir_read(&realpath, &rdd);
 385                         list_del(&rdd.middle);
 386                 }
 387         }
 388         return err;
 389 }
 390
 391 static void ovl_seek_cursor(struct ovl_dir_file *od, loff_t pos)
 392 {
 393         struct list_head *p;
 394         loff_t off = 0;
 395
 396         list_for_each(p, &od->cache->entries) {
 397                 if (off >= pos)
 398                         break;
 399                 off++;
 400         }
 401         /* Cursor is safe since the cache is stable */
 402         od->cursor = p;
 403 }
 404
 405 static struct ovl_dir_cache *ovl_cache_get(struct dentry *dentry)
 406 {
 407         int res;
 408         struct ovl_dir_cache *cache;
 409
 410         cache = ovl_dir_cache(d_inode(dentry));
 411         if (cache && ovl_dentry_version_get(dentry) == cache->version) {
 412                 WARN_ON(!cache->refcount);
 413                 cache->refcount++;
 414                 return cache;
 415         }
 416         ovl_set_dir_cache(d_inode(dentry), NULL);
 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);
 424         cache->root = RB_ROOT;
 425
 426         res = ovl_dir_read_merged(dentry, &cache->entries, &cache->root);
 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);
 434         ovl_set_dir_cache(d_inode(dentry), cache);
 435
 436         return cache;
 437 }
 438
 439 /* Map inode number to lower fs unique range */
 440 static u64 ovl_remap_lower_ino(u64 ino, int xinobits, int fsid,
 441                                const char *name, int namelen, bool warn)
 442 {
 443         unsigned int xinoshift = 64 - xinobits;
 444
 445         if (unlikely(ino >> xinoshift)) {
 446                 if (warn) {
 447                         pr_warn_ratelimited("d_ino too big (%.*s, ino=%llu, xinobits=%d)\n",
 448                                             namelen, name, ino, xinobits);
 449                 }
 450                 return ino;
 451         }
 452
 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);
 458 }
 459
 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  */
 470 static 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;
 477         int xinobits = ovl_xino_bits(dir->d_sb);
 478         int err = 0;
 479
 480         if (!ovl_same_dev(dir->d_sb))
 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
 504 get:
 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
 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);
 522                 ino = stat.ino;
 523         } else if (xinobits && !OVL_TYPE_UPPER(type)) {
 524                 ino = ovl_remap_lower_ino(ino, xinobits,
 525                                           ovl_layer_lower(this)->fsid,
 526                                           p->name, p->len,
 527                                           ovl_xino_warn(dir->d_sb));
 528         }
 529
 530 out:
 531         p->ino = ino;
 532         dput(this);
 533         return err;
 534
 535 fail:
 536         pr_warn_ratelimited("failed to look up (%s) for ino (%i)\n",
 537                             p->name, err);
 538         goto out;
 539 }
 540
 541 static 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
 560 static 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
 605 static struct ovl_dir_cache *ovl_cache_get_impure(struct path *path)
 606 {
 607         int res;
 608         struct dentry *dentry = path->dentry;
 609         struct ovl_dir_cache *cache;
 610
 611         cache = ovl_dir_cache(d_inode(dentry));
 612         if (cache && ovl_dentry_version_get(dentry) == cache->version)
 613                 return cache;
 614
 615         /* Impure cache is not refcounted, free it here */
 616         ovl_dir_cache_free(d_inode(dentry));
 617         ovl_set_dir_cache(d_inode(dentry), NULL);
 618
 619         cache = kzalloc(sizeof(struct ovl_dir_cache), GFP_KERNEL);
 620         if (!cache)
 621                 return ERR_PTR(-ENOMEM);
 622
 623         res = ovl_dir_read_impure(path, &cache->entries, &cache->root);
 624         if (res) {
 625                 ovl_cache_free(&cache->entries);
 626                 kfree(cache);
 627                 return ERR_PTR(res);
 628         }
 629         if (list_empty(&cache->entries)) {
 630                 /*
 631                  * A good opportunity to get rid of an unneeded "impure" flag.
 632                  * Removing the "impure" xattr is best effort.
 633                  */
 634                 if (!ovl_want_write(dentry)) {
 635                         ovl_do_removexattr(ovl_dentry_upper(dentry),
 636                                            OVL_XATTR_IMPURE);
 637                         ovl_drop_write(dentry);
 638                 }
 639                 ovl_clear_flag(OVL_IMPURE, d_inode(dentry));
 640                 kfree(cache);
 641                 return NULL;
 642         }
 643
 644         cache->version = ovl_dentry_version_get(dentry);
 645         ovl_set_dir_cache(d_inode(dentry), cache);
 646
 647         return cache;
 648 }
 649
 650 struct ovl_readdir_translate {
 651         struct dir_context *orig_ctx;
 652         struct ovl_dir_cache *cache;
 653         struct dir_context ctx;
 654         u64 parent_ino;
 655         int fsid;
 656         int xinobits;
 657         bool xinowarn;
 658 };
 659
 660 static int ovl_fill_real(struct dir_context *ctx, const char *name,
 661                            int namelen, loff_t offset, u64 ino,
 662                            unsigned int d_type)
 663 {
 664         struct ovl_readdir_translate *rdt =
 665                 container_of(ctx, struct ovl_readdir_translate, ctx);
 666         struct dir_context *orig_ctx = rdt->orig_ctx;
 667
 668         if (rdt->parent_ino && strcmp(name, "..") == 0) {
 669                 ino = rdt->parent_ino;
 670         } else if (rdt->cache) {
 671                 struct ovl_cache_entry *p;
 672
 673                 p = ovl_cache_entry_find(&rdt->cache->root, name, namelen);
 674                 if (p)
 675                         ino = p->ino;
 676         } else if (rdt->xinobits) {
 677                 ino = ovl_remap_lower_ino(ino, rdt->xinobits, rdt->fsid,
 678                                           name, namelen, rdt->xinowarn);
 679         }
 680
 681         return orig_ctx->actor(orig_ctx, name, namelen, offset, ino, d_type);
 682 }
 683
 684 static bool ovl_is_impure_dir(struct file *file)
 685 {
 686         struct ovl_dir_file *od = file->private_data;
 687         struct inode *dir = d_inode(file->f_path.dentry);
 688
 689         /*
 690          * Only upper dir can be impure, but if we are in the middle of
 691          * iterating a lower real dir, dir could be copied up and marked
 692          * impure. We only want the impure cache if we started iterating
 693          * a real upper dir to begin with.
 694          */
 695         return od->is_upper && ovl_test_flag(OVL_IMPURE, dir);
 696
 697 }
 698
 699 static int ovl_iterate_real(struct file *file, struct dir_context *ctx)
 700 {
 701         int err;
 702         struct ovl_dir_file *od = file->private_data;
 703         struct dentry *dir = file->f_path.dentry;
 704         const struct ovl_layer *lower_layer = ovl_layer_lower(dir);
 705         struct ovl_readdir_translate rdt = {
 706                 .ctx.actor = ovl_fill_real,
 707                 .orig_ctx = ctx,
 708                 .xinobits = ovl_xino_bits(dir->d_sb),
 709                 .xinowarn = ovl_xino_warn(dir->d_sb),
 710         };
 711
 712         if (rdt.xinobits && lower_layer)
 713                 rdt.fsid = lower_layer->fsid;
 714
 715         if (OVL_TYPE_MERGE(ovl_path_type(dir->d_parent))) {
 716                 struct kstat stat;
 717                 struct path statpath = file->f_path;
 718
 719                 statpath.dentry = dir->d_parent;
 720                 err = vfs_getattr(&statpath, &stat, STATX_INO, 0);
 721                 if (err)
 722                         return err;
 723
 724                 WARN_ON_ONCE(dir->d_sb->s_dev != stat.dev);
 725                 rdt.parent_ino = stat.ino;
 726         }
 727
 728         if (ovl_is_impure_dir(file)) {
 729                 rdt.cache = ovl_cache_get_impure(&file->f_path);
 730                 if (IS_ERR(rdt.cache))
 731                         return PTR_ERR(rdt.cache);
 732         }
 733
 734         err = iterate_dir(od->realfile, &rdt.ctx);
 735         ctx->pos = rdt.ctx.pos;
 736
 737         return err;
 738 }
 739
 740
 741 static int ovl_iterate(struct file *file, struct dir_context *ctx)
 742 {
 743         struct ovl_dir_file *od = file->private_data;
 744         struct dentry *dentry = file->f_path.dentry;
 745         struct ovl_cache_entry *p;
 746         int err;
 747
 748         if (!ctx->pos)
 749                 ovl_dir_reset(file);
 750
 751         if (od->is_real) {
 752                 /*
 753                  * If parent is merge, then need to adjust d_ino for '..', if
 754                  * dir is impure then need to adjust d_ino for copied up
 755                  * entries.
 756                  */
 757                 if (ovl_xino_bits(dentry->d_sb) ||
 758                     (ovl_same_fs(dentry->d_sb) &&
 759                      (ovl_is_impure_dir(file) ||
 760                       OVL_TYPE_MERGE(ovl_path_type(dentry->d_parent))))) {
 761                         return ovl_iterate_real(file, ctx);
 762                 }
 763                 return iterate_dir(od->realfile, ctx);
 764         }
 765
 766         if (!od->cache) {
 767                 struct ovl_dir_cache *cache;
 768
 769                 cache = ovl_cache_get(dentry);
 770                 if (IS_ERR(cache))
 771                         return PTR_ERR(cache);
 772
 773                 od->cache = cache;
 774                 ovl_seek_cursor(od, ctx->pos);
 775         }
 776
 777         while (od->cursor != &od->cache->entries) {
 778                 p = list_entry(od->cursor, struct ovl_cache_entry, l_node);
 779                 if (!p->is_whiteout) {
 780                         if (!p->ino) {
 781                                 err = ovl_cache_update_ino(&file->f_path, p);
 782                                 if (err)
 783                                         return err;
 784                         }
 785                         if (!dir_emit(ctx, p->name, p->len, p->ino, p->type))
 786                                 break;
 787                 }
 788                 od->cursor = p->l_node.next;
 789                 ctx->pos++;
 790         }
 791         return 0;
 792 }
 793
 794 static loff_t ovl_dir_llseek(struct file *file, loff_t offset, int origin)
 795 {
 796         loff_t res;
 797         struct ovl_dir_file *od = file->private_data;
 798
 799         inode_lock(file_inode(file));
 800         if (!file->f_pos)
 801                 ovl_dir_reset(file);
 802
 803         if (od->is_real) {
 804                 res = vfs_llseek(od->realfile, offset, origin);
 805                 file->f_pos = od->realfile->f_pos;
 806         } else {
 807                 res = -EINVAL;
 808
 809                 switch (origin) {
 810                 case SEEK_CUR:
 811                         offset += file->f_pos;
 812                         break;
 813                 case SEEK_SET:
 814                         break;
 815                 default:
 816                         goto out_unlock;
 817                 }
 818                 if (offset < 0)
 819                         goto out_unlock;
 820
 821                 if (offset != file->f_pos) {
 822                         file->f_pos = offset;
 823                         if (od->cache)
 824                                 ovl_seek_cursor(od, offset);
 825                 }
 826                 res = offset;
 827         }
 828 out_unlock:
 829         inode_unlock(file_inode(file));
 830
 831         return res;
 832 }
 833
 834 static int ovl_dir_fsync(struct file *file, loff_t start, loff_t end,
 835                          int datasync)
 836 {
 837         struct ovl_dir_file *od = file->private_data;
 838         struct dentry *dentry = file->f_path.dentry;
 839         struct file *realfile = od->realfile;
 840
 841         /* Nothing to sync for lower */
 842         if (!OVL_TYPE_UPPER(ovl_path_type(dentry)))
 843                 return 0;
 844
 845         /*
 846          * Need to check if we started out being a lower dir, but got copied up
 847          */
 848         if (!od->is_upper) {
 849                 struct inode *inode = file_inode(file);
 850
 851                 realfile = READ_ONCE(od->upperfile);
 852                 if (!realfile) {
 853                         struct path upperpath;
 854
 855                         ovl_path_upper(dentry, &upperpath);
 856                         realfile = ovl_path_open(&upperpath, O_RDONLY);
 857
 858                         inode_lock(inode);
 859                         if (!od->upperfile) {
 860                                 if (IS_ERR(realfile)) {
 861                                         inode_unlock(inode);
 862                                         return PTR_ERR(realfile);
 863                                 }
 864                                 smp_store_release(&od->upperfile, realfile);
 865                         } else {
 866                                 /* somebody has beaten us to it */
 867                                 if (!IS_ERR(realfile))
 868                                         fput(realfile);
 869                                 realfile = od->upperfile;
 870                         }
 871                         inode_unlock(inode);
 872                 }
 873         }
 874
 875         return vfs_fsync_range(realfile, start, end, datasync);
 876 }
 877
 878 static int ovl_dir_release(struct inode *inode, struct file *file)
 879 {
 880         struct ovl_dir_file *od = file->private_data;
 881
 882         if (od->cache) {
 883                 inode_lock(inode);
 884                 ovl_cache_put(od, file->f_path.dentry);
 885                 inode_unlock(inode);
 886         }
 887         fput(od->realfile);
 888         if (od->upperfile)
 889                 fput(od->upperfile);
 890         kfree(od);
 891
 892         return 0;
 893 }
 894
 895 static int ovl_dir_open(struct inode *inode, struct file *file)
 896 {
 897         struct path realpath;
 898         struct file *realfile;
 899         struct ovl_dir_file *od;
 900         enum ovl_path_type type;
 901
 902         od = kzalloc(sizeof(struct ovl_dir_file), GFP_KERNEL);
 903         if (!od)
 904                 return -ENOMEM;
 905
 906         type = ovl_path_real(file->f_path.dentry, &realpath);
 907         realfile = ovl_path_open(&realpath, file->f_flags);
 908         if (IS_ERR(realfile)) {
 909                 kfree(od);
 910                 return PTR_ERR(realfile);
 911         }
 912         od->realfile = realfile;
 913         od->is_real = ovl_dir_is_real(file->f_path.dentry);
 914         od->is_upper = OVL_TYPE_UPPER(type);
 915         file->private_data = od;
 916
 917         return 0;
 918 }
 919
 920 const struct file_operations ovl_dir_operations = {
 921         .read           = generic_read_dir,
 922         .open           = ovl_dir_open,
 923         .iterate        = ovl_iterate,
 924         .llseek         = ovl_dir_llseek,
 925         .fsync          = ovl_dir_fsync,
 926         .release        = ovl_dir_release,
 927 };
 928
 929 int ovl_check_empty_dir(struct dentry *dentry, struct list_head *list)
 930 {
 931         int err;
 932         struct ovl_cache_entry *p, *n;
 933         struct rb_root root = RB_ROOT;
 934         const struct cred *old_cred;
 935
 936         old_cred = ovl_override_creds(dentry->d_sb);
 937         err = ovl_dir_read_merged(dentry, list, &root);
 938         revert_creds(old_cred);
 939         if (err)
 940                 return err;
 941
 942         err = 0;
 943
 944         list_for_each_entry_safe(p, n, list, l_node) {
 945                 /*
 946                  * Select whiteouts in upperdir, they should
 947                  * be cleared when deleting this directory.
 948                  */
 949                 if (p->is_whiteout) {
 950                         if (p->is_upper)
 951                                 continue;
 952                         goto del_entry;
 953                 }
 954
 955                 if (p->name[0] == '.') {
 956                         if (p->len == 1)
 957                                 goto del_entry;
 958                         if (p->len == 2 && p->name[1] == '.')
 959                                 goto del_entry;
 960                 }
 961                 err = -ENOTEMPTY;
 962                 break;
 963
 964 del_entry:
 965                 list_del(&p->l_node);
 966                 kfree(p);
 967         }
 968
 969         return err;
 970 }
 971
 972 void ovl_cleanup_whiteouts(struct dentry *upper, struct list_head *list)
 973 {
 974         struct ovl_cache_entry *p;
 975
 976         inode_lock_nested(upper->d_inode, I_MUTEX_CHILD);
 977         list_for_each_entry(p, list, l_node) {
 978                 struct dentry *dentry;
 979
 980                 if (WARN_ON(!p->is_whiteout || !p->is_upper))
 981                         continue;
 982
 983                 dentry = lookup_one_len(p->name, upper, p->len);
 984                 if (IS_ERR(dentry)) {
 985                         pr_err("lookup '%s/%.*s' failed (%i)\n",
 986                                upper->d_name.name, p->len, p->name,
 987                                (int) PTR_ERR(dentry));
 988                         continue;
 989                 }
 990                 if (dentry->d_inode)
 991                         ovl_cleanup(upper->d_inode, dentry);
 992                 dput(dentry);
 993         }
 994         inode_unlock(upper->d_inode);
 995 }
 996
 997 static int ovl_check_d_type(struct dir_context *ctx, const char *name,
 998                           int namelen, loff_t offset, u64 ino,
 999                           unsigned int d_type)
1000 {
1001         struct ovl_readdir_data *rdd =
1002                 container_of(ctx, struct ovl_readdir_data, ctx);
1003
1004         /* Even if d_type is not supported, DT_DIR is returned for . and .. */
1005         if (!strncmp(name, ".", namelen) || !strncmp(name, "..", namelen))
1006                 return 0;
1007
1008         if (d_type != DT_UNKNOWN)
1009                 rdd->d_type_supported = true;
1010
1011         return 0;
1012 }
1013
1014 /*
1015  * Returns 1 if d_type is supported, 0 not supported/unknown. Negative values
1016  * if error is encountered.
1017  */
1018 int ovl_check_d_type_supported(struct path *realpath)
1019 {
1020         int err;
1021         struct ovl_readdir_data rdd = {
1022                 .ctx.actor = ovl_check_d_type,
1023                 .d_type_supported = false,
1024         };
1025
1026         err = ovl_dir_read(realpath, &rdd);
1027         if (err)
1028                 return err;
1029
1030         return rdd.d_type_supported;
1031 }
1032
1033 static void ovl_workdir_cleanup_recurse(struct path *path, int level)
1034 {
1035         int err;
1036         struct inode *dir = path->dentry->d_inode;
1037         LIST_HEAD(list);
1038         struct rb_root root = RB_ROOT;
1039         struct ovl_cache_entry *p;
1040         struct ovl_readdir_data rdd = {
1041                 .ctx.actor = ovl_fill_merge,
1042                 .dentry = NULL,
1043                 .list = &list,
1044                 .root = &root,
1045                 .is_lowest = false,
1046         };
1047
1048         err = ovl_dir_read(path, &rdd);
1049         if (err)
1050                 goto out;
1051
1052         inode_lock_nested(dir, I_MUTEX_PARENT);
1053         list_for_each_entry(p, &list, l_node) {
1054                 struct dentry *dentry;
1055
1056                 if (p->name[0] == '.') {
1057                         if (p->len == 1)
1058                                 continue;
1059                         if (p->len == 2 && p->name[1] == '.')
1060                                 continue;
1061                 }
1062                 dentry = lookup_one_len(p->name, path->dentry, p->len);
1063                 if (IS_ERR(dentry))
1064                         continue;
1065                 if (dentry->d_inode)
1066                         ovl_workdir_cleanup(dir, path->mnt, dentry, level);
1067                 dput(dentry);
1068         }
1069         inode_unlock(dir);
1070 out:
1071         ovl_cache_free(&list);
1072 }
1073
1074 int ovl_workdir_cleanup(struct inode *dir, struct vfsmount *mnt,
1075                          struct dentry *dentry, int level)
1076 {
1077         int err;
1078
1079         if (!d_is_dir(dentry) || level > 1) {
1080                 return ovl_cleanup(dir, dentry);
1081         }
1082
1083         err = ovl_do_rmdir(dir, dentry);
1084         if (err) {
1085                 struct path path = { .mnt = mnt, .dentry = dentry };
1086
1087                 inode_unlock(dir);
1088                 ovl_workdir_cleanup_recurse(&path, level + 1);
1089                 inode_lock_nested(dir, I_MUTEX_PARENT);
1090                 err = ovl_cleanup(dir, dentry);
1091         }
1092
1093         return err;
1094 }
1095
1096 int ovl_indexdir_cleanup(struct ovl_fs *ofs)
1097 {
1098         int err;
1099         struct dentry *indexdir = ofs->indexdir;
1100         struct dentry *index = NULL;
1101         struct inode *dir = indexdir->d_inode;
1102         struct path path = { .mnt = ofs->upper_mnt, .dentry = indexdir };
1103         LIST_HEAD(list);
1104         struct rb_root root = RB_ROOT;
1105         struct ovl_cache_entry *p;
1106         struct ovl_readdir_data rdd = {
1107                 .ctx.actor = ovl_fill_merge,
1108                 .dentry = NULL,
1109                 .list = &list,
1110                 .root = &root,
1111                 .is_lowest = false,
1112         };
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                 if (p->name[0] == '.') {
1121                         if (p->len == 1)
1122                                 continue;
1123                         if (p->len == 2 && p->name[1] == '.')
1124                                 continue;
1125                 }
1126                 index = lookup_one_len(p->name, indexdir, p->len);
1127                 if (IS_ERR(index)) {
1128                         err = PTR_ERR(index);
1129                         index = NULL;
1130                         break;
1131                 }
1132                 /* Cleanup leftover from index create/cleanup attempt */
1133                 if (index->d_name.name[0] == '#') {
1134                         err = ovl_workdir_cleanup(dir, path.mnt, index, 1);
1135                         if (err)
1136                                 break;
1137                         goto next;
1138                 }
1139                 err = ovl_verify_index(ofs, index);
1140                 if (!err) {
1141                         goto next;
1142                 } else if (err == -ESTALE) {
1143                         /* Cleanup stale index entries */
1144                         err = ovl_cleanup(dir, index);
1145                 } else if (err != -ENOENT) {
1146                         /*
1147                          * Abort mount to avoid corrupting the index if
1148                          * an incompatible index entry was found or on out
1149                          * of memory.
1150                          */
1151                         break;
1152                 } else if (ofs->config.nfs_export) {
1153                         /*
1154                          * Whiteout orphan index to block future open by
1155                          * handle after overlay nlink dropped to zero.
1156                          */
1157                         err = ovl_cleanup_and_whiteout(indexdir, dir, index);
1158                 } else {
1159                         /* Cleanup orphan index entries */
1160                         err = ovl_cleanup(dir, index);
1161                 }
1162
1163                 if (err)
1164                         break;
1165
1166 next:
1167                 dput(index);
1168                 index = NULL;
1169         }
1170         dput(index);
1171         inode_unlock(dir);
1172 out:
1173         ovl_cache_free(&list);
1174         if (err)
1175                 pr_err("failed index dir cleanup (%i)\n", err);
1176         return err;
1177 }