git.sesse.net Git - bcachefs-tools-debian/blob - libbcachefs/buckets.c

   1 // SPDX-License-Identifier: GPL-2.0
   2 /*
   3  * Code for manipulating bucket marks for garbage collection.
   4  *
   5  * Copyright 2014 Datera, Inc.
   6  */
   7
   8 #include "bcachefs.h"
   9 #include "alloc_background.h"
  10 #include "backpointers.h"
  11 #include "bset.h"
  12 #include "btree_gc.h"
  13 #include "btree_update.h"
  14 #include "buckets.h"
  15 #include "buckets_waiting_for_journal.h"
  16 #include "ec.h"
  17 #include "error.h"
  18 #include "inode.h"
  19 #include "movinggc.h"
  20 #include "recovery.h"
  21 #include "reflink.h"
  22 #include "replicas.h"
  23 #include "subvolume.h"
  24
  25 #include <linux/preempt.h>
  26 #include <trace/events/bcachefs.h>
  27
  28 static inline void fs_usage_data_type_to_base(struct bch_fs_usage *fs_usage,
  29                                               enum bch_data_type data_type,
  30                                               s64 sectors)
  31 {
  32         switch (data_type) {
  33         case BCH_DATA_btree:
  34                 fs_usage->btree         += sectors;
  35                 break;
  36         case BCH_DATA_user:
  37         case BCH_DATA_parity:
  38                 fs_usage->data          += sectors;
  39                 break;
  40         case BCH_DATA_cached:
  41                 fs_usage->cached        += sectors;
  42                 break;
  43         default:
  44                 break;
  45         }
  46 }
  47
  48 void bch2_fs_usage_initialize(struct bch_fs *c)
  49 {
  50         struct bch_fs_usage *usage;
  51         struct bch_dev *ca;
  52         unsigned i;
  53
  54         percpu_down_write(&c->mark_lock);
  55         usage = c->usage_base;
  56
  57         for (i = 0; i < ARRAY_SIZE(c->usage); i++)
  58                 bch2_fs_usage_acc_to_base(c, i);
  59
  60         for (i = 0; i < BCH_REPLICAS_MAX; i++)
  61                 usage->reserved += usage->persistent_reserved[i];
  62
  63         for (i = 0; i < c->replicas.nr; i++) {
  64                 struct bch_replicas_entry *e =
  65                         cpu_replicas_entry(&c->replicas, i);
  66
  67                 fs_usage_data_type_to_base(usage, e->data_type, usage->replicas[i]);
  68         }
  69
  70         for_each_member_device(ca, c, i) {
  71                 struct bch_dev_usage dev = bch2_dev_usage_read(ca);
  72
  73                 usage->hidden += (dev.d[BCH_DATA_sb].buckets +
  74                                   dev.d[BCH_DATA_journal].buckets) *
  75                         ca->mi.bucket_size;
  76         }
  77
  78         percpu_up_write(&c->mark_lock);
  79 }
  80
  81 static inline struct bch_dev_usage *dev_usage_ptr(struct bch_dev *ca,
  82                                                   unsigned journal_seq,
  83                                                   bool gc)
  84 {
  85         BUG_ON(!gc && !journal_seq);
  86
  87         return this_cpu_ptr(gc
  88                             ? ca->usage_gc
  89                             : ca->usage[journal_seq & JOURNAL_BUF_MASK]);
  90 }
  91
  92 void bch2_dev_usage_read_fast(struct bch_dev *ca, struct bch_dev_usage *usage)
  93 {
  94         struct bch_fs *c = ca->fs;
  95         unsigned seq, i, u64s = dev_usage_u64s();
  96
  97         do {
  98                 seq = read_seqcount_begin(&c->usage_lock);
  99                 memcpy(usage, ca->usage_base, u64s * sizeof(u64));
 100                 for (i = 0; i < ARRAY_SIZE(ca->usage); i++)
 101                         acc_u64s_percpu((u64 *) usage, (u64 __percpu *) ca->usage[i], u64s);
 102         } while (read_seqcount_retry(&c->usage_lock, seq));
 103 }
 104
 105 static inline struct bch_fs_usage *fs_usage_ptr(struct bch_fs *c,
 106                                                 unsigned journal_seq,
 107                                                 bool gc)
 108 {
 109         percpu_rwsem_assert_held(&c->mark_lock);
 110         BUG_ON(!gc && !journal_seq);
 111
 112         return this_cpu_ptr(gc
 113                             ? c->usage_gc
 114                             : c->usage[journal_seq & JOURNAL_BUF_MASK]);
 115 }
 116
 117 u64 bch2_fs_usage_read_one(struct bch_fs *c, u64 *v)
 118 {
 119         ssize_t offset = v - (u64 *) c->usage_base;
 120         unsigned i, seq;
 121         u64 ret;
 122
 123         BUG_ON(offset < 0 || offset >= fs_usage_u64s(c));
 124         percpu_rwsem_assert_held(&c->mark_lock);
 125
 126         do {
 127                 seq = read_seqcount_begin(&c->usage_lock);
 128                 ret = *v;
 129
 130                 for (i = 0; i < ARRAY_SIZE(c->usage); i++)
 131                         ret += percpu_u64_get((u64 __percpu *) c->usage[i] + offset);
 132         } while (read_seqcount_retry(&c->usage_lock, seq));
 133
 134         return ret;
 135 }
 136
 137 struct bch_fs_usage_online *bch2_fs_usage_read(struct bch_fs *c)
 138 {
 139         struct bch_fs_usage_online *ret;
 140         unsigned seq, i, u64s;
 141
 142         percpu_down_read(&c->mark_lock);
 143
 144         ret = kmalloc(sizeof(struct bch_fs_usage_online) +
 145                       sizeof(u64) * c->replicas.nr, GFP_NOFS);
 146         if (unlikely(!ret)) {
 147                 percpu_up_read(&c->mark_lock);
 148                 return NULL;
 149         }
 150
 151         ret->online_reserved = percpu_u64_get(c->online_reserved);
 152
 153         u64s = fs_usage_u64s(c);
 154         do {
 155                 seq = read_seqcount_begin(&c->usage_lock);
 156                 memcpy(&ret->u, c->usage_base, u64s * sizeof(u64));
 157                 for (i = 0; i < ARRAY_SIZE(c->usage); i++)
 158                         acc_u64s_percpu((u64 *) &ret->u, (u64 __percpu *) c->usage[i], u64s);
 159         } while (read_seqcount_retry(&c->usage_lock, seq));
 160
 161         return ret;
 162 }
 163
 164 void bch2_fs_usage_acc_to_base(struct bch_fs *c, unsigned idx)
 165 {
 166         struct bch_dev *ca;
 167         unsigned i, u64s = fs_usage_u64s(c);
 168
 169         BUG_ON(idx >= ARRAY_SIZE(c->usage));
 170
 171         preempt_disable();
 172         write_seqcount_begin(&c->usage_lock);
 173
 174         acc_u64s_percpu((u64 *) c->usage_base,
 175                         (u64 __percpu *) c->usage[idx], u64s);
 176         percpu_memset(c->usage[idx], 0, u64s * sizeof(u64));
 177
 178         rcu_read_lock();
 179         for_each_member_device_rcu(ca, c, i, NULL) {
 180                 u64s = dev_usage_u64s();
 181
 182                 acc_u64s_percpu((u64 *) ca->usage_base,
 183                                 (u64 __percpu *) ca->usage[idx], u64s);
 184                 percpu_memset(ca->usage[idx], 0, u64s * sizeof(u64));
 185         }
 186         rcu_read_unlock();
 187
 188         write_seqcount_end(&c->usage_lock);
 189         preempt_enable();
 190 }
 191
 192 void bch2_fs_usage_to_text(struct printbuf *out,
 193                            struct bch_fs *c,
 194                            struct bch_fs_usage_online *fs_usage)
 195 {
 196         unsigned i;
 197
 198         prt_printf(out, "capacity:\t\t\t%llu\n", c->capacity);
 199
 200         prt_printf(out, "hidden:\t\t\t\t%llu\n",
 201                fs_usage->u.hidden);
 202         prt_printf(out, "data:\t\t\t\t%llu\n",
 203                fs_usage->u.data);
 204         prt_printf(out, "cached:\t\t\t\t%llu\n",
 205                fs_usage->u.cached);
 206         prt_printf(out, "reserved:\t\t\t%llu\n",
 207                fs_usage->u.reserved);
 208         prt_printf(out, "nr_inodes:\t\t\t%llu\n",
 209                fs_usage->u.nr_inodes);
 210         prt_printf(out, "online reserved:\t\t%llu\n",
 211                fs_usage->online_reserved);
 212
 213         for (i = 0;
 214              i < ARRAY_SIZE(fs_usage->u.persistent_reserved);
 215              i++) {
 216                 prt_printf(out, "%u replicas:\n", i + 1);
 217                 prt_printf(out, "\treserved:\t\t%llu\n",
 218                        fs_usage->u.persistent_reserved[i]);
 219         }
 220
 221         for (i = 0; i < c->replicas.nr; i++) {
 222                 struct bch_replicas_entry *e =
 223                         cpu_replicas_entry(&c->replicas, i);
 224
 225                 prt_printf(out, "\t");
 226                 bch2_replicas_entry_to_text(out, e);
 227                 prt_printf(out, ":\t%llu\n", fs_usage->u.replicas[i]);
 228         }
 229 }
 230
 231 static u64 reserve_factor(u64 r)
 232 {
 233         return r + (round_up(r, (1 << RESERVE_FACTOR)) >> RESERVE_FACTOR);
 234 }
 235
 236 u64 bch2_fs_sectors_used(struct bch_fs *c, struct bch_fs_usage_online *fs_usage)
 237 {
 238         return min(fs_usage->u.hidden +
 239                    fs_usage->u.btree +
 240                    fs_usage->u.data +
 241                    reserve_factor(fs_usage->u.reserved +
 242                                   fs_usage->online_reserved),
 243                    c->capacity);
 244 }
 245
 246 static struct bch_fs_usage_short
 247 __bch2_fs_usage_read_short(struct bch_fs *c)
 248 {
 249         struct bch_fs_usage_short ret;
 250         u64 data, reserved;
 251
 252         ret.capacity = c->capacity -
 253                 bch2_fs_usage_read_one(c, &c->usage_base->hidden);
 254
 255         data            = bch2_fs_usage_read_one(c, &c->usage_base->data) +
 256                 bch2_fs_usage_read_one(c, &c->usage_base->btree);
 257         reserved        = bch2_fs_usage_read_one(c, &c->usage_base->reserved) +
 258                 percpu_u64_get(c->online_reserved);
 259
 260         ret.used        = min(ret.capacity, data + reserve_factor(reserved));
 261         ret.free        = ret.capacity - ret.used;
 262
 263         ret.nr_inodes   = bch2_fs_usage_read_one(c, &c->usage_base->nr_inodes);
 264
 265         return ret;
 266 }
 267
 268 struct bch_fs_usage_short
 269 bch2_fs_usage_read_short(struct bch_fs *c)
 270 {
 271         struct bch_fs_usage_short ret;
 272
 273         percpu_down_read(&c->mark_lock);
 274         ret = __bch2_fs_usage_read_short(c);
 275         percpu_up_read(&c->mark_lock);
 276
 277         return ret;
 278 }
 279
 280 void bch2_dev_usage_init(struct bch_dev *ca)
 281 {
 282         ca->usage_base->d[BCH_DATA_free].buckets = ca->mi.nbuckets - ca->mi.first_bucket;
 283 }
 284
 285 static inline int bucket_sectors_fragmented(struct bch_dev *ca,
 286                                             struct bch_alloc_v4 a)
 287 {
 288         return a.dirty_sectors
 289                 ? max(0, (int) ca->mi.bucket_size - (int) a.dirty_sectors)
 290                 : 0;
 291 }
 292
 293 static void bch2_dev_usage_update(struct bch_fs *c, struct bch_dev *ca,
 294                                   struct bch_alloc_v4 old,
 295                                   struct bch_alloc_v4 new,
 296                                   u64 journal_seq, bool gc)
 297 {
 298         struct bch_fs_usage *fs_usage;
 299         struct bch_dev_usage *u;
 300
 301         preempt_disable();
 302         fs_usage = fs_usage_ptr(c, journal_seq, gc);
 303
 304         if (data_type_is_hidden(old.data_type))
 305                 fs_usage->hidden -= ca->mi.bucket_size;
 306         if (data_type_is_hidden(new.data_type))
 307                 fs_usage->hidden += ca->mi.bucket_size;
 308
 309         u = dev_usage_ptr(ca, journal_seq, gc);
 310
 311         u->d[old.data_type].buckets--;
 312         u->d[new.data_type].buckets++;
 313
 314         u->buckets_ec -= (int) !!old.stripe;
 315         u->buckets_ec += (int) !!new.stripe;
 316
 317         u->d[old.data_type].sectors -= old.dirty_sectors;
 318         u->d[new.data_type].sectors += new.dirty_sectors;
 319
 320         u->d[BCH_DATA_cached].sectors += new.cached_sectors;
 321         u->d[BCH_DATA_cached].sectors -= old.cached_sectors;
 322
 323         u->d[old.data_type].fragmented -= bucket_sectors_fragmented(ca, old);
 324         u->d[new.data_type].fragmented += bucket_sectors_fragmented(ca, new);
 325
 326         preempt_enable();
 327 }
 328
 329 static void bch2_dev_usage_update_m(struct bch_fs *c, struct bch_dev *ca,
 330                                     struct bucket old, struct bucket new,
 331                                     u64 journal_seq, bool gc)
 332 {
 333         struct bch_alloc_v4 old_a = {
 334                 .gen            = old.gen,
 335                 .data_type      = old.data_type,
 336                 .dirty_sectors  = old.dirty_sectors,
 337                 .cached_sectors = old.cached_sectors,
 338                 .stripe         = old.stripe,
 339         };
 340         struct bch_alloc_v4 new_a = {
 341                 .gen            = new.gen,
 342                 .data_type      = new.data_type,
 343                 .dirty_sectors  = new.dirty_sectors,
 344                 .cached_sectors = new.cached_sectors,
 345                 .stripe         = new.stripe,
 346         };
 347
 348         bch2_dev_usage_update(c, ca, old_a, new_a, journal_seq, gc);
 349 }
 350
 351 static inline int __update_replicas(struct bch_fs *c,
 352                                     struct bch_fs_usage *fs_usage,
 353                                     struct bch_replicas_entry *r,
 354                                     s64 sectors)
 355 {
 356         int idx = bch2_replicas_entry_idx(c, r);
 357
 358         if (idx < 0)
 359                 return -1;
 360
 361         fs_usage_data_type_to_base(fs_usage, r->data_type, sectors);
 362         fs_usage->replicas[idx]         += sectors;
 363         return 0;
 364 }
 365
 366 static inline int update_replicas(struct bch_fs *c, struct bkey_s_c k,
 367                         struct bch_replicas_entry *r, s64 sectors,
 368                         unsigned journal_seq, bool gc)
 369 {
 370         struct bch_fs_usage __percpu *fs_usage;
 371         int idx, ret = 0;
 372         struct printbuf buf = PRINTBUF;
 373
 374         percpu_down_read(&c->mark_lock);
 375         buf.atomic++;
 376
 377         idx = bch2_replicas_entry_idx(c, r);
 378         if (idx < 0 &&
 379             fsck_err(c, "no replicas entry\n"
 380                      "  while marking %s",
 381                      (bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
 382                 percpu_up_read(&c->mark_lock);
 383                 ret = bch2_mark_replicas(c, r);
 384                 percpu_down_read(&c->mark_lock);
 385
 386                 if (ret)
 387                         goto err;
 388                 idx = bch2_replicas_entry_idx(c, r);
 389         }
 390         if (idx < 0) {
 391                 ret = -1;
 392                 goto err;
 393         }
 394
 395         preempt_disable();
 396         fs_usage = fs_usage_ptr(c, journal_seq, gc);
 397         fs_usage_data_type_to_base(fs_usage, r->data_type, sectors);
 398         fs_usage->replicas[idx]         += sectors;
 399         preempt_enable();
 400 err:
 401 fsck_err:
 402         percpu_up_read(&c->mark_lock);
 403         printbuf_exit(&buf);
 404         return ret;
 405 }
 406
 407 static inline int update_cached_sectors(struct bch_fs *c,
 408                         struct bkey_s_c k,
 409                         unsigned dev, s64 sectors,
 410                         unsigned journal_seq, bool gc)
 411 {
 412         struct bch_replicas_padded r;
 413
 414         bch2_replicas_entry_cached(&r.e, dev);
 415
 416         return update_replicas(c, k, &r.e, sectors, journal_seq, gc);
 417 }
 418
 419 static struct replicas_delta_list *
 420 replicas_deltas_realloc(struct btree_trans *trans, unsigned more)
 421 {
 422         struct replicas_delta_list *d = trans->fs_usage_deltas;
 423         unsigned new_size = d ? (d->size + more) * 2 : 128;
 424         unsigned alloc_size = sizeof(*d) + new_size;
 425
 426         WARN_ON_ONCE(alloc_size > REPLICAS_DELTA_LIST_MAX);
 427
 428         if (!d || d->used + more > d->size) {
 429                 d = krealloc(d, alloc_size, GFP_NOIO|__GFP_ZERO);
 430
 431                 BUG_ON(!d && alloc_size > REPLICAS_DELTA_LIST_MAX);
 432
 433                 if (!d) {
 434                         d = mempool_alloc(&trans->c->replicas_delta_pool, GFP_NOIO);
 435                         memset(d, 0, REPLICAS_DELTA_LIST_MAX);
 436
 437                         if (trans->fs_usage_deltas)
 438                                 memcpy(d, trans->fs_usage_deltas,
 439                                        trans->fs_usage_deltas->size + sizeof(*d));
 440
 441                         new_size = REPLICAS_DELTA_LIST_MAX - sizeof(*d);
 442                         kfree(trans->fs_usage_deltas);
 443                 }
 444
 445                 d->size = new_size;
 446                 trans->fs_usage_deltas = d;
 447         }
 448         return d;
 449 }
 450
 451 static inline void update_replicas_list(struct btree_trans *trans,
 452                                         struct bch_replicas_entry *r,
 453                                         s64 sectors)
 454 {
 455         struct replicas_delta_list *d;
 456         struct replicas_delta *n;
 457         unsigned b;
 458
 459         if (!sectors)
 460                 return;
 461
 462         b = replicas_entry_bytes(r) + 8;
 463         d = replicas_deltas_realloc(trans, b);
 464
 465         n = (void *) d->d + d->used;
 466         n->delta = sectors;
 467         memcpy((void *) n + offsetof(struct replicas_delta, r),
 468                r, replicas_entry_bytes(r));
 469         bch2_replicas_entry_sort(&n->r);
 470         d->used += b;
 471 }
 472
 473 static inline void update_cached_sectors_list(struct btree_trans *trans,
 474                                               unsigned dev, s64 sectors)
 475 {
 476         struct bch_replicas_padded r;
 477
 478         bch2_replicas_entry_cached(&r.e, dev);
 479
 480         update_replicas_list(trans, &r.e, sectors);
 481 }
 482
 483 int bch2_mark_alloc(struct btree_trans *trans,
 484                     struct bkey_s_c old, struct bkey_s_c new,
 485                     unsigned flags)
 486 {
 487         bool gc = flags & BTREE_TRIGGER_GC;
 488         u64 journal_seq = trans->journal_res.seq;
 489         struct bch_fs *c = trans->c;
 490         struct bch_alloc_v4 old_a, new_a;
 491         struct bch_dev *ca;
 492         int ret = 0;
 493
 494         /*
 495          * alloc btree is read in by bch2_alloc_read, not gc:
 496          */
 497         if ((flags & BTREE_TRIGGER_GC) &&
 498             !(flags & BTREE_TRIGGER_BUCKET_INVALIDATE))
 499                 return 0;
 500
 501         if (bch2_trans_inconsistent_on(!bch2_dev_bucket_exists(c, new.k->p), trans,
 502                                        "alloc key for invalid device or bucket"))
 503                 return -EIO;
 504
 505         ca = bch_dev_bkey_exists(c, new.k->p.inode);
 506
 507         bch2_alloc_to_v4(old, &old_a);
 508         bch2_alloc_to_v4(new, &new_a);
 509
 510         if ((flags & BTREE_TRIGGER_INSERT) &&
 511             data_type_is_empty(old_a.data_type) !=
 512             data_type_is_empty(new_a.data_type) &&
 513             new.k->type == KEY_TYPE_alloc_v4) {
 514                 struct bch_alloc_v4 *v = (struct bch_alloc_v4 *) new.v;
 515
 516                 BUG_ON(!journal_seq);
 517
 518                 /*
 519                  * If the btree updates referring to a bucket weren't flushed
 520                  * before the bucket became empty again, then the we don't have
 521                  * to wait on a journal flush before we can reuse the bucket:
 522                  */
 523                 new_a.journal_seq = data_type_is_empty(new_a.data_type) &&
 524                         (journal_seq == v->journal_seq ||
 525                          bch2_journal_noflush_seq(&c->journal, v->journal_seq))
 526                         ? 0 : journal_seq;
 527                 v->journal_seq = new_a.journal_seq;
 528         }
 529
 530         if (!data_type_is_empty(old_a.data_type) &&
 531             data_type_is_empty(new_a.data_type) &&
 532             new_a.journal_seq) {
 533                 ret = bch2_set_bucket_needs_journal_commit(&c->buckets_waiting_for_journal,
 534                                 c->journal.flushed_seq_ondisk,
 535                                 new.k->p.inode, new.k->p.offset,
 536                                 new_a.journal_seq);
 537                 if (ret) {
 538                         bch2_fs_fatal_error(c,
 539                                 "error setting bucket_needs_journal_commit: %i", ret);
 540                         return ret;
 541                 }
 542         }
 543
 544         percpu_down_read(&c->mark_lock);
 545         if (!gc && new_a.gen != old_a.gen)
 546                 *bucket_gen(ca, new.k->p.offset) = new_a.gen;
 547
 548         bch2_dev_usage_update(c, ca, old_a, new_a, journal_seq, gc);
 549
 550         if (gc) {
 551                 struct bucket *g = gc_bucket(ca, new.k->p.offset);
 552
 553                 bucket_lock(g);
 554
 555                 g->gen_valid            = 1;
 556                 g->gen                  = new_a.gen;
 557                 g->data_type            = new_a.data_type;
 558                 g->stripe               = new_a.stripe;
 559                 g->stripe_redundancy    = new_a.stripe_redundancy;
 560                 g->dirty_sectors        = new_a.dirty_sectors;
 561                 g->cached_sectors       = new_a.cached_sectors;
 562
 563                 bucket_unlock(g);
 564         }
 565         percpu_up_read(&c->mark_lock);
 566
 567         /*
 568          * need to know if we're getting called from the invalidate path or
 569          * not:
 570          */
 571
 572         if ((flags & BTREE_TRIGGER_BUCKET_INVALIDATE) &&
 573             old_a.cached_sectors) {
 574                 ret = update_cached_sectors(c, new, ca->dev_idx,
 575                                             -((s64) old_a.cached_sectors),
 576                                             journal_seq, gc);
 577                 if (ret) {
 578                         bch2_fs_fatal_error(c, "%s(): no replicas entry while updating cached sectors",
 579                                             __func__);
 580                         return ret;
 581                 }
 582         }
 583
 584         if (new_a.data_type == BCH_DATA_free &&
 585             (!new_a.journal_seq || new_a.journal_seq < c->journal.flushed_seq_ondisk))
 586                 closure_wake_up(&c->freelist_wait);
 587
 588         if (new_a.data_type == BCH_DATA_need_discard &&
 589             (!new_a.journal_seq || new_a.journal_seq < c->journal.flushed_seq_ondisk))
 590                 bch2_do_discards(c);
 591
 592         if (old_a.data_type != BCH_DATA_cached &&
 593             new_a.data_type == BCH_DATA_cached &&
 594             should_invalidate_buckets(ca, bch2_dev_usage_read(ca)))
 595                 bch2_do_invalidates(c);
 596
 597         if (new_a.data_type == BCH_DATA_need_gc_gens)
 598                 bch2_do_gc_gens(c);
 599
 600         return 0;
 601 }
 602
 603 int bch2_mark_metadata_bucket(struct bch_fs *c, struct bch_dev *ca,
 604                               size_t b, enum bch_data_type data_type,
 605                               unsigned sectors, struct gc_pos pos,
 606                               unsigned flags)
 607 {
 608         struct bucket old, new, *g;
 609         int ret = 0;
 610
 611         BUG_ON(!(flags & BTREE_TRIGGER_GC));
 612         BUG_ON(data_type != BCH_DATA_sb &&
 613                data_type != BCH_DATA_journal);
 614
 615         /*
 616          * Backup superblock might be past the end of our normal usable space:
 617          */
 618         if (b >= ca->mi.nbuckets)
 619                 return 0;
 620
 621         percpu_down_read(&c->mark_lock);
 622         g = gc_bucket(ca, b);
 623
 624         bucket_lock(g);
 625         old = *g;
 626
 627         if (bch2_fs_inconsistent_on(g->data_type &&
 628                         g->data_type != data_type, c,
 629                         "different types of data in same bucket: %s, %s",
 630                         bch2_data_types[g->data_type],
 631                         bch2_data_types[data_type])) {
 632                 ret = -EIO;
 633                 goto err;
 634         }
 635
 636         if (bch2_fs_inconsistent_on((u64) g->dirty_sectors + sectors > ca->mi.bucket_size, c,
 637                         "bucket %u:%zu gen %u data type %s sector count overflow: %u + %u > bucket size",
 638                         ca->dev_idx, b, g->gen,
 639                         bch2_data_types[g->data_type ?: data_type],
 640                         g->dirty_sectors, sectors)) {
 641                 ret = -EIO;
 642                 goto err;
 643         }
 644
 645
 646         g->data_type = data_type;
 647         g->dirty_sectors += sectors;
 648         new = *g;
 649 err:
 650         bucket_unlock(g);
 651         if (!ret)
 652                 bch2_dev_usage_update_m(c, ca, old, new, 0, true);
 653         percpu_up_read(&c->mark_lock);
 654         return ret;
 655 }
 656
 657 static int check_bucket_ref(struct bch_fs *c,
 658                             struct bkey_s_c k,
 659                             const struct bch_extent_ptr *ptr,
 660                             s64 sectors, enum bch_data_type ptr_data_type,
 661                             u8 b_gen, u8 bucket_data_type,
 662                             u32 dirty_sectors, u32 cached_sectors)
 663 {
 664         struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev);
 665         size_t bucket_nr = PTR_BUCKET_NR(ca, ptr);
 666         u16 bucket_sectors = !ptr->cached
 667                 ? dirty_sectors
 668                 : cached_sectors;
 669         struct printbuf buf = PRINTBUF;
 670         int ret = 0;
 671
 672         if (bucket_data_type == BCH_DATA_cached)
 673                 bucket_data_type = BCH_DATA_user;
 674
 675         if ((bucket_data_type == BCH_DATA_stripe && ptr_data_type == BCH_DATA_user) ||
 676             (bucket_data_type == BCH_DATA_user   && ptr_data_type == BCH_DATA_stripe))
 677                 bucket_data_type = ptr_data_type = BCH_DATA_stripe;
 678
 679         if (gen_after(ptr->gen, b_gen)) {
 680                 bch2_fsck_err(c, FSCK_CAN_IGNORE|FSCK_NEED_FSCK,
 681                         "bucket %u:%zu gen %u data type %s: ptr gen %u newer than bucket gen\n"
 682                         "while marking %s",
 683                         ptr->dev, bucket_nr, b_gen,
 684                         bch2_data_types[bucket_data_type ?: ptr_data_type],
 685                         ptr->gen,
 686                         (bch2_bkey_val_to_text(&buf, c, k), buf.buf));
 687                 ret = -EIO;
 688                 goto err;
 689         }
 690
 691         if (gen_cmp(b_gen, ptr->gen) > BUCKET_GC_GEN_MAX) {
 692                 bch2_fsck_err(c, FSCK_CAN_IGNORE|FSCK_NEED_FSCK,
 693                         "bucket %u:%zu gen %u data type %s: ptr gen %u too stale\n"
 694                         "while marking %s",
 695                         ptr->dev, bucket_nr, b_gen,
 696                         bch2_data_types[bucket_data_type ?: ptr_data_type],
 697                         ptr->gen,
 698                         (printbuf_reset(&buf),
 699                          bch2_bkey_val_to_text(&buf, c, k), buf.buf));
 700                 ret = -EIO;
 701                 goto err;
 702         }
 703
 704         if (b_gen != ptr->gen && !ptr->cached) {
 705                 bch2_fsck_err(c, FSCK_CAN_IGNORE|FSCK_NEED_FSCK,
 706                         "bucket %u:%zu gen %u (mem gen %u) data type %s: stale dirty ptr (gen %u)\n"
 707                         "while marking %s",
 708                         ptr->dev, bucket_nr, b_gen,
 709                         *bucket_gen(ca, bucket_nr),
 710                         bch2_data_types[bucket_data_type ?: ptr_data_type],
 711                         ptr->gen,
 712                         (printbuf_reset(&buf),
 713                          bch2_bkey_val_to_text(&buf, c, k), buf.buf));
 714                 ret = -EIO;
 715                 goto err;
 716         }
 717
 718         if (b_gen != ptr->gen) {
 719                 ret = 1;
 720                 goto err;
 721         }
 722
 723         if (!data_type_is_empty(bucket_data_type) &&
 724             ptr_data_type &&
 725             bucket_data_type != ptr_data_type) {
 726                 bch2_fsck_err(c, FSCK_CAN_IGNORE|FSCK_NEED_FSCK,
 727                         "bucket %u:%zu gen %u different types of data in same bucket: %s, %s\n"
 728                         "while marking %s",
 729                         ptr->dev, bucket_nr, b_gen,
 730                         bch2_data_types[bucket_data_type],
 731                         bch2_data_types[ptr_data_type],
 732                         (printbuf_reset(&buf),
 733                          bch2_bkey_val_to_text(&buf, c, k), buf.buf));
 734                 ret = -EIO;
 735                 goto err;
 736         }
 737
 738         if ((unsigned) (bucket_sectors + sectors) > U32_MAX) {
 739                 bch2_fsck_err(c, FSCK_CAN_IGNORE|FSCK_NEED_FSCK,
 740                         "bucket %u:%zu gen %u data type %s sector count overflow: %u + %lli > U16_MAX\n"
 741                         "while marking %s",
 742                         ptr->dev, bucket_nr, b_gen,
 743                         bch2_data_types[bucket_data_type ?: ptr_data_type],
 744                         bucket_sectors, sectors,
 745                         (printbuf_reset(&buf),
 746                          bch2_bkey_val_to_text(&buf, c, k), buf.buf));
 747                 ret = -EIO;
 748                 goto err;
 749         }
 750 err:
 751         printbuf_exit(&buf);
 752         return ret;
 753 }
 754
 755 static int mark_stripe_bucket(struct btree_trans *trans,
 756                               struct bkey_s_c k,
 757                               unsigned ptr_idx,
 758                               unsigned flags)
 759 {
 760         struct bch_fs *c = trans->c;
 761         u64 journal_seq = trans->journal_res.seq;
 762         const struct bch_stripe *s = bkey_s_c_to_stripe(k).v;
 763         unsigned nr_data = s->nr_blocks - s->nr_redundant;
 764         bool parity = ptr_idx >= nr_data;
 765         enum bch_data_type data_type = parity ? BCH_DATA_parity : 0;
 766         s64 sectors = parity ? le16_to_cpu(s->sectors) : 0;
 767         const struct bch_extent_ptr *ptr = s->ptrs + ptr_idx;
 768         struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev);
 769         struct bucket old, new, *g;
 770         struct printbuf buf = PRINTBUF;
 771         int ret = 0;
 772
 773         BUG_ON(!(flags & BTREE_TRIGGER_GC));
 774
 775         /* * XXX doesn't handle deletion */
 776
 777         percpu_down_read(&c->mark_lock);
 778         buf.atomic++;
 779         g = PTR_GC_BUCKET(ca, ptr);
 780
 781         if (g->dirty_sectors ||
 782             (g->stripe && g->stripe != k.k->p.offset)) {
 783                 bch2_fs_inconsistent(c,
 784                               "bucket %u:%zu gen %u: multiple stripes using same bucket\n%s",
 785                               ptr->dev, PTR_BUCKET_NR(ca, ptr), g->gen,
 786                               (bch2_bkey_val_to_text(&buf, c, k), buf.buf));
 787                 ret = -EINVAL;
 788                 goto err;
 789         }
 790
 791         bucket_lock(g);
 792         old = *g;
 793
 794         ret = check_bucket_ref(c, k, ptr, sectors, data_type,
 795                                g->gen, g->data_type,
 796                                g->dirty_sectors, g->cached_sectors);
 797         if (ret)
 798                 goto err;
 799
 800         if (data_type)
 801                 g->data_type = data_type;
 802         g->dirty_sectors += sectors;
 803
 804         g->stripe               = k.k->p.offset;
 805         g->stripe_redundancy    = s->nr_redundant;
 806         new = *g;
 807 err:
 808         bucket_unlock(g);
 809         if (!ret)
 810                 bch2_dev_usage_update_m(c, ca, old, new, journal_seq, true);
 811         percpu_up_read(&c->mark_lock);
 812         printbuf_exit(&buf);
 813         return ret;
 814 }
 815
 816 static int __mark_pointer(struct btree_trans *trans,
 817                           struct bkey_s_c k,
 818                           const struct bch_extent_ptr *ptr,
 819                           s64 sectors, enum bch_data_type ptr_data_type,
 820                           u8 bucket_gen, u8 *bucket_data_type,
 821                           u32 *dirty_sectors, u32 *cached_sectors)
 822 {
 823         u32 *dst_sectors = !ptr->cached
 824                 ? dirty_sectors
 825                 : cached_sectors;
 826         int ret = check_bucket_ref(trans->c, k, ptr, sectors, ptr_data_type,
 827                                    bucket_gen, *bucket_data_type,
 828                                    *dirty_sectors, *cached_sectors);
 829
 830         if (ret)
 831                 return ret;
 832
 833         *dst_sectors += sectors;
 834         *bucket_data_type = *dirty_sectors || *cached_sectors
 835                 ? ptr_data_type : 0;
 836         return 0;
 837 }
 838
 839 static int bch2_mark_pointer(struct btree_trans *trans,
 840                              struct bkey_s_c k,
 841                              struct extent_ptr_decoded p,
 842                              s64 sectors, enum bch_data_type data_type,
 843                              unsigned flags)
 844 {
 845         u64 journal_seq = trans->journal_res.seq;
 846         struct bch_fs *c = trans->c;
 847         struct bch_dev *ca = bch_dev_bkey_exists(c, p.ptr.dev);
 848         struct bucket old, new, *g;
 849         u8 bucket_data_type;
 850         int ret = 0;
 851
 852         BUG_ON(!(flags & BTREE_TRIGGER_GC));
 853
 854         percpu_down_read(&c->mark_lock);
 855         g = PTR_GC_BUCKET(ca, &p.ptr);
 856         bucket_lock(g);
 857         old = *g;
 858
 859         bucket_data_type = g->data_type;
 860         ret = __mark_pointer(trans, k, &p.ptr, sectors,
 861                              data_type, g->gen,
 862                              &bucket_data_type,
 863                              &g->dirty_sectors,
 864                              &g->cached_sectors);
 865         if (!ret)
 866                 g->data_type = bucket_data_type;
 867
 868         new = *g;
 869         bucket_unlock(g);
 870         if (!ret)
 871                 bch2_dev_usage_update_m(c, ca, old, new, journal_seq, true);
 872         percpu_up_read(&c->mark_lock);
 873
 874         return ret;
 875 }
 876
 877 static int bch2_mark_stripe_ptr(struct btree_trans *trans,
 878                                 struct bkey_s_c k,
 879                                 struct bch_extent_stripe_ptr p,
 880                                 enum bch_data_type data_type,
 881                                 s64 sectors,
 882                                 unsigned flags)
 883 {
 884         struct bch_fs *c = trans->c;
 885         struct bch_replicas_padded r;
 886         struct gc_stripe *m;
 887
 888         BUG_ON(!(flags & BTREE_TRIGGER_GC));
 889
 890         m = genradix_ptr_alloc(&c->gc_stripes, p.idx, GFP_KERNEL);
 891         if (!m) {
 892                 bch_err(c, "error allocating memory for gc_stripes, idx %llu",
 893                         (u64) p.idx);
 894                 return -ENOMEM;
 895         }
 896
 897         spin_lock(&c->ec_stripes_heap_lock);
 898
 899         if (!m || !m->alive) {
 900                 spin_unlock(&c->ec_stripes_heap_lock);
 901                 bch_err_ratelimited(c, "pointer to nonexistent stripe %llu",
 902                                     (u64) p.idx);
 903                 bch2_inconsistent_error(c);
 904                 return -EIO;
 905         }
 906
 907         m->block_sectors[p.block] += sectors;
 908
 909         r = m->r;
 910         spin_unlock(&c->ec_stripes_heap_lock);
 911
 912         r.e.data_type = data_type;
 913         update_replicas(c, k, &r.e, sectors, trans->journal_res.seq, true);
 914
 915         return 0;
 916 }
 917
 918 int bch2_mark_extent(struct btree_trans *trans,
 919                      struct bkey_s_c old, struct bkey_s_c new,
 920                      unsigned flags)
 921 {
 922         u64 journal_seq = trans->journal_res.seq;
 923         struct bch_fs *c = trans->c;
 924         struct bkey_s_c k = flags & BTREE_TRIGGER_OVERWRITE ? old : new;
 925         struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
 926         const union bch_extent_entry *entry;
 927         struct extent_ptr_decoded p;
 928         struct bch_replicas_padded r;
 929         enum bch_data_type data_type = bkey_is_btree_ptr(k.k)
 930                 ? BCH_DATA_btree
 931                 : BCH_DATA_user;
 932         s64 sectors = bkey_is_btree_ptr(k.k)
 933                 ? btree_sectors(c)
 934                 : k.k->size;
 935         s64 dirty_sectors = 0;
 936         bool stale;
 937         int ret;
 938
 939         BUG_ON(!(flags & BTREE_TRIGGER_GC));
 940
 941         r.e.data_type   = data_type;
 942         r.e.nr_devs     = 0;
 943         r.e.nr_required = 1;
 944
 945         bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
 946                 s64 disk_sectors = ptr_disk_sectors(sectors, p);
 947
 948                 if (flags & BTREE_TRIGGER_OVERWRITE)
 949                         disk_sectors = -disk_sectors;
 950
 951                 ret = bch2_mark_pointer(trans, k, p, disk_sectors,
 952                                         data_type, flags);
 953                 if (ret < 0)
 954                         return ret;
 955
 956                 stale = ret > 0;
 957
 958                 if (p.ptr.cached) {
 959                         if (!stale) {
 960                                 ret = update_cached_sectors(c, k, p.ptr.dev,
 961                                                 disk_sectors, journal_seq, true);
 962                                 if (ret) {
 963                                         bch2_fs_fatal_error(c, "%s(): no replicas entry while updating cached sectors",
 964                                                             __func__);
 965                                         return ret;
 966                                 }
 967                         }
 968                 } else if (!p.has_ec) {
 969                         dirty_sectors          += disk_sectors;
 970                         r.e.devs[r.e.nr_devs++] = p.ptr.dev;
 971                 } else {
 972                         ret = bch2_mark_stripe_ptr(trans, k, p.ec, data_type,
 973                                         disk_sectors, flags);
 974                         if (ret)
 975                                 return ret;
 976
 977                         /*
 978                          * There may be other dirty pointers in this extent, but
 979                          * if so they're not required for mounting if we have an
 980                          * erasure coded pointer in this extent:
 981                          */
 982                         r.e.nr_required = 0;
 983                 }
 984         }
 985
 986         if (r.e.nr_devs) {
 987                 ret = update_replicas(c, k, &r.e, dirty_sectors, journal_seq, true);
 988                 if (ret) {
 989                         struct printbuf buf = PRINTBUF;
 990
 991                         bch2_bkey_val_to_text(&buf, c, k);
 992                         bch2_fs_fatal_error(c, "%s(): no replicas entry for %s", __func__, buf.buf);
 993                         printbuf_exit(&buf);
 994                         return ret;
 995                 }
 996         }
 997
 998         return 0;
 999 }
1000
1001 int bch2_mark_stripe(struct btree_trans *trans,
1002                      struct bkey_s_c old, struct bkey_s_c new,
1003                      unsigned flags)
1004 {
1005         bool gc = flags & BTREE_TRIGGER_GC;
1006         u64 journal_seq = trans->journal_res.seq;
1007         struct bch_fs *c = trans->c;
1008         u64 idx = new.k->p.offset;
1009         const struct bch_stripe *old_s = old.k->type == KEY_TYPE_stripe
1010                 ? bkey_s_c_to_stripe(old).v : NULL;
1011         const struct bch_stripe *new_s = new.k->type == KEY_TYPE_stripe
1012                 ? bkey_s_c_to_stripe(new).v : NULL;
1013         unsigned i;
1014         int ret;
1015
1016         BUG_ON(gc && old_s);
1017
1018         if (!gc) {
1019                 struct stripe *m = genradix_ptr(&c->stripes, idx);
1020
1021                 if (!m || (old_s && !m->alive)) {
1022                         struct printbuf buf1 = PRINTBUF;
1023                         struct printbuf buf2 = PRINTBUF;
1024
1025                         bch2_bkey_val_to_text(&buf1, c, old);
1026                         bch2_bkey_val_to_text(&buf2, c, new);
1027                         bch_err_ratelimited(c, "error marking nonexistent stripe %llu while marking\n"
1028                                             "old %s\n"
1029                                             "new %s", idx, buf1.buf, buf2.buf);
1030                         printbuf_exit(&buf2);
1031                         printbuf_exit(&buf1);
1032                         bch2_inconsistent_error(c);
1033                         return -1;
1034                 }
1035
1036                 if (!new_s) {
1037                         spin_lock(&c->ec_stripes_heap_lock);
1038                         bch2_stripes_heap_del(c, m, idx);
1039                         spin_unlock(&c->ec_stripes_heap_lock);
1040
1041                         memset(m, 0, sizeof(*m));
1042                 } else {
1043                         m->alive        = true;
1044                         m->sectors      = le16_to_cpu(new_s->sectors);
1045                         m->algorithm    = new_s->algorithm;
1046                         m->nr_blocks    = new_s->nr_blocks;
1047                         m->nr_redundant = new_s->nr_redundant;
1048                         m->blocks_nonempty = 0;
1049
1050                         for (i = 0; i < new_s->nr_blocks; i++)
1051                                 m->blocks_nonempty += !!stripe_blockcount_get(new_s, i);
1052
1053                         spin_lock(&c->ec_stripes_heap_lock);
1054                         bch2_stripes_heap_update(c, m, idx);
1055                         spin_unlock(&c->ec_stripes_heap_lock);
1056                 }
1057         } else {
1058                 struct gc_stripe *m =
1059                         genradix_ptr_alloc(&c->gc_stripes, idx, GFP_KERNEL);
1060
1061                 if (!m) {
1062                         bch_err(c, "error allocating memory for gc_stripes, idx %llu",
1063                                 idx);
1064                         return -ENOMEM;
1065                 }
1066                 /*
1067                  * This will be wrong when we bring back runtime gc: we should
1068                  * be unmarking the old key and then marking the new key
1069                  */
1070                 m->alive        = true;
1071                 m->sectors      = le16_to_cpu(new_s->sectors);
1072                 m->nr_blocks    = new_s->nr_blocks;
1073                 m->nr_redundant = new_s->nr_redundant;
1074
1075                 for (i = 0; i < new_s->nr_blocks; i++)
1076                         m->ptrs[i] = new_s->ptrs[i];
1077
1078                 bch2_bkey_to_replicas(&m->r.e, new);
1079
1080                 /*
1081                  * gc recalculates this field from stripe ptr
1082                  * references:
1083                  */
1084                 memset(m->block_sectors, 0, sizeof(m->block_sectors));
1085
1086                 for (i = 0; i < new_s->nr_blocks; i++) {
1087                         ret = mark_stripe_bucket(trans, new, i, flags);
1088                         if (ret)
1089                                 return ret;
1090                 }
1091
1092                 ret = update_replicas(c, new, &m->r.e,
1093                                       ((s64) m->sectors * m->nr_redundant),
1094                                       journal_seq, gc);
1095                 if (ret) {
1096                         struct printbuf buf = PRINTBUF;
1097
1098                         bch2_bkey_val_to_text(&buf, c, new);
1099                         bch2_fs_fatal_error(c, "no replicas entry for %s", buf.buf);
1100                         printbuf_exit(&buf);
1101                         return ret;
1102                 }
1103         }
1104
1105         return 0;
1106 }
1107
1108 int bch2_mark_inode(struct btree_trans *trans,
1109                     struct bkey_s_c old, struct bkey_s_c new,
1110                     unsigned flags)
1111 {
1112         struct bch_fs *c = trans->c;
1113         struct bch_fs_usage __percpu *fs_usage;
1114         u64 journal_seq = trans->journal_res.seq;
1115
1116         if (flags & BTREE_TRIGGER_INSERT) {
1117                 struct bch_inode_v3 *v = (struct bch_inode_v3 *) new.v;
1118
1119                 BUG_ON(!journal_seq);
1120                 BUG_ON(new.k->type != KEY_TYPE_inode_v3);
1121
1122                 v->bi_journal_seq = cpu_to_le64(journal_seq);
1123         }
1124
1125         if (flags & BTREE_TRIGGER_GC) {
1126                 percpu_down_read(&c->mark_lock);
1127                 preempt_disable();
1128
1129                 fs_usage = fs_usage_ptr(c, journal_seq, flags & BTREE_TRIGGER_GC);
1130                 fs_usage->nr_inodes += bkey_is_inode(new.k);
1131                 fs_usage->nr_inodes -= bkey_is_inode(old.k);
1132
1133                 preempt_enable();
1134                 percpu_up_read(&c->mark_lock);
1135         }
1136         return 0;
1137 }
1138
1139 int bch2_mark_reservation(struct btree_trans *trans,
1140                           struct bkey_s_c old, struct bkey_s_c new,
1141                           unsigned flags)
1142 {
1143         struct bch_fs *c = trans->c;
1144         struct bkey_s_c k = flags & BTREE_TRIGGER_OVERWRITE ? old : new;
1145         struct bch_fs_usage __percpu *fs_usage;
1146         unsigned replicas = bkey_s_c_to_reservation(k).v->nr_replicas;
1147         s64 sectors = (s64) k.k->size;
1148
1149         BUG_ON(!(flags & BTREE_TRIGGER_GC));
1150
1151         if (flags & BTREE_TRIGGER_OVERWRITE)
1152                 sectors = -sectors;
1153         sectors *= replicas;
1154
1155         percpu_down_read(&c->mark_lock);
1156         preempt_disable();
1157
1158         fs_usage = fs_usage_ptr(c, trans->journal_res.seq, flags & BTREE_TRIGGER_GC);
1159         replicas = clamp_t(unsigned, replicas, 1,
1160                            ARRAY_SIZE(fs_usage->persistent_reserved));
1161
1162         fs_usage->reserved                              += sectors;
1163         fs_usage->persistent_reserved[replicas - 1]     += sectors;
1164
1165         preempt_enable();
1166         percpu_up_read(&c->mark_lock);
1167
1168         return 0;
1169 }
1170
1171 static s64 __bch2_mark_reflink_p(struct btree_trans *trans,
1172                                  struct bkey_s_c_reflink_p p,
1173                                  u64 start, u64 end,
1174                                  u64 *idx, unsigned flags, size_t r_idx)
1175 {
1176         struct bch_fs *c = trans->c;
1177         struct reflink_gc *r;
1178         int add = !(flags & BTREE_TRIGGER_OVERWRITE) ? 1 : -1;
1179         u64 next_idx = end;
1180         s64 ret = 0;
1181         struct printbuf buf = PRINTBUF;
1182
1183         if (r_idx >= c->reflink_gc_nr)
1184                 goto not_found;
1185
1186         r = genradix_ptr(&c->reflink_gc_table, r_idx);
1187         next_idx = min(next_idx, r->offset - r->size);
1188         if (*idx < next_idx)
1189                 goto not_found;
1190
1191         BUG_ON((s64) r->refcount + add < 0);
1192
1193         r->refcount += add;
1194         *idx = r->offset;
1195         return 0;
1196 not_found:
1197         if (fsck_err(c, "pointer to missing indirect extent\n"
1198                      "  %s\n"
1199                      "  missing range %llu-%llu",
1200                      (bch2_bkey_val_to_text(&buf, c, p.s_c), buf.buf),
1201                      *idx, next_idx)) {
1202                 struct bkey_i_error new;
1203
1204                 bkey_init(&new.k);
1205                 new.k.type      = KEY_TYPE_error;
1206                 new.k.p         = bkey_start_pos(p.k);
1207                 new.k.p.offset += *idx - start;
1208                 bch2_key_resize(&new.k, next_idx - *idx);
1209                 ret = __bch2_btree_insert(trans, BTREE_ID_extents, &new.k_i);
1210         }
1211
1212         *idx = next_idx;
1213 fsck_err:
1214         printbuf_exit(&buf);
1215         return ret;
1216 }
1217
1218 int bch2_mark_reflink_p(struct btree_trans *trans,
1219                         struct bkey_s_c old, struct bkey_s_c new,
1220                         unsigned flags)
1221 {
1222         struct bch_fs *c = trans->c;
1223         struct bkey_s_c k = flags & BTREE_TRIGGER_OVERWRITE ? old : new;
1224         struct bkey_s_c_reflink_p p = bkey_s_c_to_reflink_p(k);
1225         struct reflink_gc *ref;
1226         size_t l, r, m;
1227         u64 idx = le64_to_cpu(p.v->idx), start = idx;
1228         u64 end = le64_to_cpu(p.v->idx) + p.k->size;
1229         int ret = 0;
1230
1231         BUG_ON(!(flags & BTREE_TRIGGER_GC));
1232
1233         if (c->sb.version >= bcachefs_metadata_version_reflink_p_fix) {
1234                 idx -= le32_to_cpu(p.v->front_pad);
1235                 end += le32_to_cpu(p.v->back_pad);
1236         }
1237
1238         l = 0;
1239         r = c->reflink_gc_nr;
1240         while (l < r) {
1241                 m = l + (r - l) / 2;
1242
1243                 ref = genradix_ptr(&c->reflink_gc_table, m);
1244                 if (ref->offset <= idx)
1245                         l = m + 1;
1246                 else
1247                         r = m;
1248         }
1249
1250         while (idx < end && !ret)
1251                 ret = __bch2_mark_reflink_p(trans, p, start, end,
1252                                             &idx, flags, l++);
1253
1254         return ret;
1255 }
1256
1257 static noinline __cold
1258 void fs_usage_apply_warn(struct btree_trans *trans,
1259                          unsigned disk_res_sectors,
1260                          s64 should_not_have_added)
1261 {
1262         struct bch_fs *c = trans->c;
1263         struct btree_insert_entry *i;
1264         struct printbuf buf = PRINTBUF;
1265
1266         prt_printf(&buf,
1267                    bch2_fmt(c, "disk usage increased %lli more than %u sectors reserved)"),
1268                    should_not_have_added, disk_res_sectors);
1269
1270         trans_for_each_update(trans, i) {
1271                 struct bkey_s_c old = { &i->old_k, i->old_v };
1272
1273                 prt_str(&buf, "new ");
1274                 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(i->k));
1275                 prt_newline(&buf);
1276
1277                 prt_str(&buf, "old ");
1278                 bch2_bkey_val_to_text(&buf, c, old);
1279                 prt_newline(&buf);
1280         }
1281
1282         __WARN();
1283         bch2_print_string_as_lines(KERN_ERR, buf.buf);
1284         printbuf_exit(&buf);
1285 }
1286
1287 int bch2_trans_fs_usage_apply(struct btree_trans *trans,
1288                               struct replicas_delta_list *deltas)
1289 {
1290         struct bch_fs *c = trans->c;
1291         static int warned_disk_usage = 0;
1292         bool warn = false;
1293         unsigned disk_res_sectors = trans->disk_res ? trans->disk_res->sectors : 0;
1294         struct replicas_delta *d = deltas->d, *d2;
1295         struct replicas_delta *top = (void *) deltas->d + deltas->used;
1296         struct bch_fs_usage *dst;
1297         s64 added = 0, should_not_have_added;
1298         unsigned i;
1299
1300         percpu_down_read(&c->mark_lock);
1301         preempt_disable();
1302         dst = fs_usage_ptr(c, trans->journal_res.seq, false);
1303
1304         for (d = deltas->d; d != top; d = replicas_delta_next(d)) {
1305                 switch (d->r.data_type) {
1306                 case BCH_DATA_btree:
1307                 case BCH_DATA_user:
1308                 case BCH_DATA_parity:
1309                         added += d->delta;
1310                 }
1311
1312                 if (__update_replicas(c, dst, &d->r, d->delta))
1313                         goto need_mark;
1314         }
1315
1316         dst->nr_inodes += deltas->nr_inodes;
1317
1318         for (i = 0; i < BCH_REPLICAS_MAX; i++) {
1319                 added                           += deltas->persistent_reserved[i];
1320                 dst->reserved                   += deltas->persistent_reserved[i];
1321                 dst->persistent_reserved[i]     += deltas->persistent_reserved[i];
1322         }
1323
1324         /*
1325          * Not allowed to reduce sectors_available except by getting a
1326          * reservation:
1327          */
1328         should_not_have_added = added - (s64) disk_res_sectors;
1329         if (unlikely(should_not_have_added > 0)) {
1330                 u64 old, new, v = atomic64_read(&c->sectors_available);
1331
1332                 do {
1333                         old = v;
1334                         new = max_t(s64, 0, old - should_not_have_added);
1335                 } while ((v = atomic64_cmpxchg(&c->sectors_available,
1336                                                old, new)) != old);
1337
1338                 added -= should_not_have_added;
1339                 warn = true;
1340         }
1341
1342         if (added > 0) {
1343                 trans->disk_res->sectors -= added;
1344                 this_cpu_sub(*c->online_reserved, added);
1345         }
1346
1347         preempt_enable();
1348         percpu_up_read(&c->mark_lock);
1349
1350         if (unlikely(warn) && !xchg(&warned_disk_usage, 1))
1351                 fs_usage_apply_warn(trans, disk_res_sectors, should_not_have_added);
1352         return 0;
1353 need_mark:
1354         /* revert changes: */
1355         for (d2 = deltas->d; d2 != d; d2 = replicas_delta_next(d2))
1356                 BUG_ON(__update_replicas(c, dst, &d2->r, -d2->delta));
1357
1358         preempt_enable();
1359         percpu_up_read(&c->mark_lock);
1360         return -1;
1361 }
1362
1363 /* trans_mark: */
1364
1365 static int bch2_trans_mark_pointer(struct btree_trans *trans,
1366                                    enum btree_id btree_id, unsigned level,
1367                                    struct bkey_s_c k, struct extent_ptr_decoded p,
1368                                    unsigned flags)
1369 {
1370         bool insert = !(flags & BTREE_TRIGGER_OVERWRITE);
1371         struct btree_iter iter;
1372         struct bkey_i_alloc_v4 *a;
1373         struct bpos bucket_pos;
1374         struct bch_backpointer bp;
1375         s64 sectors;
1376         int ret;
1377
1378         bch2_extent_ptr_to_bp(trans->c, btree_id, level, k, p, &bucket_pos, &bp);
1379         sectors = bp.bucket_len;
1380         if (!insert)
1381                 sectors = -sectors;
1382
1383         a = bch2_trans_start_alloc_update(trans, &iter, bucket_pos);
1384         if (IS_ERR(a))
1385                 return PTR_ERR(a);
1386
1387         ret = __mark_pointer(trans, k, &p.ptr, sectors, bp.data_type,
1388                              a->v.gen, &a->v.data_type,
1389                              &a->v.dirty_sectors, &a->v.cached_sectors);
1390         if (ret)
1391                 goto err;
1392
1393         if (!p.ptr.cached) {
1394                 ret = insert
1395                         ? bch2_bucket_backpointer_add(trans, a, bp, k)
1396                         : bch2_bucket_backpointer_del(trans, a, bp, k);
1397                 if (ret)
1398                         goto err;
1399         }
1400
1401         ret = bch2_trans_update(trans, &iter, &a->k_i, 0);
1402 err:
1403         bch2_trans_iter_exit(trans, &iter);
1404         return ret;
1405 }
1406
1407 static int bch2_trans_mark_stripe_ptr(struct btree_trans *trans,
1408                         struct extent_ptr_decoded p,
1409                         s64 sectors, enum bch_data_type data_type)
1410 {
1411         struct btree_iter iter;
1412         struct bkey_s_c k;
1413         struct bkey_i_stripe *s;
1414         struct bch_replicas_padded r;
1415         int ret = 0;
1416
1417         bch2_trans_iter_init(trans, &iter, BTREE_ID_stripes, POS(0, p.ec.idx),
1418                              BTREE_ITER_INTENT|
1419                              BTREE_ITER_WITH_UPDATES);
1420         k = bch2_btree_iter_peek_slot(&iter);
1421         ret = bkey_err(k);
1422         if (ret)
1423                 goto err;
1424
1425         if (k.k->type != KEY_TYPE_stripe) {
1426                 bch2_trans_inconsistent(trans,
1427                         "pointer to nonexistent stripe %llu",
1428                         (u64) p.ec.idx);
1429                 ret = -EIO;
1430                 goto err;
1431         }
1432
1433         if (!bch2_ptr_matches_stripe(bkey_s_c_to_stripe(k).v, p)) {
1434                 bch2_trans_inconsistent(trans,
1435                         "stripe pointer doesn't match stripe %llu",
1436                         (u64) p.ec.idx);
1437                 ret = -EIO;
1438                 goto err;
1439         }
1440
1441         s = bch2_trans_kmalloc(trans, bkey_bytes(k.k));
1442         ret = PTR_ERR_OR_ZERO(s);
1443         if (ret)
1444                 goto err;
1445
1446         bkey_reassemble(&s->k_i, k);
1447         stripe_blockcount_set(&s->v, p.ec.block,
1448                 stripe_blockcount_get(&s->v, p.ec.block) +
1449                 sectors);
1450
1451         ret = bch2_trans_update(trans, &iter, &s->k_i, 0);
1452         if (ret)
1453                 goto err;
1454
1455         bch2_bkey_to_replicas(&r.e, bkey_i_to_s_c(&s->k_i));
1456         r.e.data_type = data_type;
1457         update_replicas_list(trans, &r.e, sectors);
1458 err:
1459         bch2_trans_iter_exit(trans, &iter);
1460         return ret;
1461 }
1462
1463 int bch2_trans_mark_extent(struct btree_trans *trans,
1464                            enum btree_id btree_id, unsigned level,
1465                            struct bkey_s_c old, struct bkey_i *new,
1466                            unsigned flags)
1467 {
1468         struct bch_fs *c = trans->c;
1469         struct bkey_s_c k = flags & BTREE_TRIGGER_OVERWRITE
1470                 ? old
1471                 : bkey_i_to_s_c(new);
1472         struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
1473         const union bch_extent_entry *entry;
1474         struct extent_ptr_decoded p;
1475         struct bch_replicas_padded r;
1476         enum bch_data_type data_type = bkey_is_btree_ptr(k.k)
1477                 ? BCH_DATA_btree
1478                 : BCH_DATA_user;
1479         s64 sectors = bkey_is_btree_ptr(k.k)
1480                 ? btree_sectors(c)
1481                 : k.k->size;
1482         s64 dirty_sectors = 0;
1483         bool stale;
1484         int ret;
1485
1486         r.e.data_type   = data_type;
1487         r.e.nr_devs     = 0;
1488         r.e.nr_required = 1;
1489
1490         bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
1491                 s64 disk_sectors = ptr_disk_sectors(sectors, p);
1492
1493                 if (flags & BTREE_TRIGGER_OVERWRITE)
1494                         disk_sectors = -disk_sectors;
1495
1496                 ret = bch2_trans_mark_pointer(trans, btree_id, level, k, p, flags);
1497                 if (ret < 0)
1498                         return ret;
1499
1500                 stale = ret > 0;
1501
1502                 if (p.ptr.cached) {
1503                         if (!stale)
1504                                 update_cached_sectors_list(trans, p.ptr.dev,
1505                                                            disk_sectors);
1506                 } else if (!p.has_ec) {
1507                         dirty_sectors          += disk_sectors;
1508                         r.e.devs[r.e.nr_devs++] = p.ptr.dev;
1509                 } else {
1510                         ret = bch2_trans_mark_stripe_ptr(trans, p,
1511                                         disk_sectors, data_type);
1512                         if (ret)
1513                                 return ret;
1514
1515                         r.e.nr_required = 0;
1516                 }
1517         }
1518
1519         if (r.e.nr_devs)
1520                 update_replicas_list(trans, &r.e, dirty_sectors);
1521
1522         return 0;
1523 }
1524
1525 static int bch2_trans_mark_stripe_bucket(struct btree_trans *trans,
1526                                          struct bkey_s_c_stripe s,
1527                                          unsigned idx, bool deleting)
1528 {
1529         struct bch_fs *c = trans->c;
1530         const struct bch_extent_ptr *ptr = &s.v->ptrs[idx];
1531         struct btree_iter iter;
1532         struct bkey_i_alloc_v4 *a;
1533         enum bch_data_type data_type = idx >= s.v->nr_blocks - s.v->nr_redundant
1534                 ? BCH_DATA_parity : 0;
1535         s64 sectors = data_type ? le16_to_cpu(s.v->sectors) : 0;
1536         int ret = 0;
1537
1538         if (deleting)
1539                 sectors = -sectors;
1540
1541         a = bch2_trans_start_alloc_update(trans, &iter, PTR_BUCKET_POS(c, ptr));
1542         if (IS_ERR(a))
1543                 return PTR_ERR(a);
1544
1545         ret = check_bucket_ref(c, s.s_c, ptr, sectors, data_type,
1546                                a->v.gen, a->v.data_type,
1547                                a->v.dirty_sectors, a->v.cached_sectors);
1548         if (ret)
1549                 goto err;
1550
1551         if (!deleting) {
1552                 if (bch2_trans_inconsistent_on(a->v.stripe ||
1553                                                a->v.stripe_redundancy, trans,
1554                                 "bucket %llu:%llu gen %u data type %s dirty_sectors %u: multiple stripes using same bucket (%u, %llu)",
1555                                 iter.pos.inode, iter.pos.offset, a->v.gen,
1556                                 bch2_data_types[a->v.data_type],
1557                                 a->v.dirty_sectors,
1558                                 a->v.stripe, s.k->p.offset)) {
1559                         ret = -EIO;
1560                         goto err;
1561                 }
1562
1563                 if (bch2_trans_inconsistent_on(data_type && a->v.dirty_sectors, trans,
1564                                 "bucket %llu:%llu gen %u data type %s dirty_sectors %u: data already in stripe bucket %llu",
1565                                 iter.pos.inode, iter.pos.offset, a->v.gen,
1566                                 bch2_data_types[a->v.data_type],
1567                                 a->v.dirty_sectors,
1568                                 s.k->p.offset)) {
1569                         ret = -EIO;
1570                         goto err;
1571                 }
1572
1573                 a->v.stripe             = s.k->p.offset;
1574                 a->v.stripe_redundancy  = s.v->nr_redundant;
1575         } else {
1576                 if (bch2_trans_inconsistent_on(a->v.stripe != s.k->p.offset ||
1577                                                a->v.stripe_redundancy != s.v->nr_redundant, trans,
1578                                 "bucket %llu:%llu gen %u: not marked as stripe when deleting stripe %llu (got %u)",
1579                                 iter.pos.inode, iter.pos.offset, a->v.gen,
1580                                 s.k->p.offset, a->v.stripe)) {
1581                         ret = -EIO;
1582                         goto err;
1583                 }
1584
1585                 a->v.stripe             = 0;
1586                 a->v.stripe_redundancy  = 0;
1587         }
1588
1589         a->v.dirty_sectors += sectors;
1590         if (data_type)
1591                 a->v.data_type = !deleting ? data_type : 0;
1592
1593         ret = bch2_trans_update(trans, &iter, &a->k_i, 0);
1594         if (ret)
1595                 goto err;
1596 err:
1597         bch2_trans_iter_exit(trans, &iter);
1598         return ret;
1599 }
1600
1601 int bch2_trans_mark_stripe(struct btree_trans *trans,
1602                            enum btree_id btree_id, unsigned level,
1603                            struct bkey_s_c old, struct bkey_i *new,
1604                            unsigned flags)
1605 {
1606         const struct bch_stripe *old_s = NULL;
1607         struct bch_stripe *new_s = NULL;
1608         struct bch_replicas_padded r;
1609         unsigned i, nr_blocks;
1610         int ret = 0;
1611
1612         if (old.k->type == KEY_TYPE_stripe)
1613                 old_s = bkey_s_c_to_stripe(old).v;
1614         if (new->k.type == KEY_TYPE_stripe)
1615                 new_s = &bkey_i_to_stripe(new)->v;
1616
1617         /*
1618          * If the pointers aren't changing, we don't need to do anything:
1619          */
1620         if (new_s && old_s &&
1621             new_s->nr_blocks    == old_s->nr_blocks &&
1622             new_s->nr_redundant == old_s->nr_redundant &&
1623             !memcmp(old_s->ptrs, new_s->ptrs,
1624                     new_s->nr_blocks * sizeof(struct bch_extent_ptr)))
1625                 return 0;
1626
1627         BUG_ON(new_s && old_s &&
1628                (new_s->nr_blocks        != old_s->nr_blocks ||
1629                 new_s->nr_redundant     != old_s->nr_redundant));
1630
1631         nr_blocks = new_s ? new_s->nr_blocks : old_s->nr_blocks;
1632
1633         if (new_s) {
1634                 s64 sectors = le16_to_cpu(new_s->sectors);
1635
1636                 bch2_bkey_to_replicas(&r.e, bkey_i_to_s_c(new));
1637                 update_replicas_list(trans, &r.e, sectors * new_s->nr_redundant);
1638         }
1639
1640         if (old_s) {
1641                 s64 sectors = -((s64) le16_to_cpu(old_s->sectors));
1642
1643                 bch2_bkey_to_replicas(&r.e, old);
1644                 update_replicas_list(trans, &r.e, sectors * old_s->nr_redundant);
1645         }
1646
1647         for (i = 0; i < nr_blocks; i++) {
1648                 if (new_s && old_s &&
1649                     !memcmp(&new_s->ptrs[i],
1650                             &old_s->ptrs[i],
1651                             sizeof(new_s->ptrs[i])))
1652                         continue;
1653
1654                 if (new_s) {
1655                         ret = bch2_trans_mark_stripe_bucket(trans,
1656                                         bkey_i_to_s_c_stripe(new), i, false);
1657                         if (ret)
1658                                 break;
1659                 }
1660
1661                 if (old_s) {
1662                         ret = bch2_trans_mark_stripe_bucket(trans,
1663                                         bkey_s_c_to_stripe(old), i, true);
1664                         if (ret)
1665                                 break;
1666                 }
1667         }
1668
1669         return ret;
1670 }
1671
1672 int bch2_trans_mark_inode(struct btree_trans *trans,
1673                           enum btree_id btree_id, unsigned level,
1674                           struct bkey_s_c old,
1675                           struct bkey_i *new,
1676                           unsigned flags)
1677 {
1678         int nr = bkey_is_inode(&new->k) - bkey_is_inode(old.k);
1679
1680         if (nr) {
1681                 struct replicas_delta_list *d =
1682                         replicas_deltas_realloc(trans, 0);
1683                 d->nr_inodes += nr;
1684         }
1685
1686         return 0;
1687 }
1688
1689 int bch2_trans_mark_reservation(struct btree_trans *trans,
1690                                 enum btree_id btree_id, unsigned level,
1691                                 struct bkey_s_c old,
1692                                 struct bkey_i *new,
1693                                 unsigned flags)
1694 {
1695         struct bkey_s_c k = flags & BTREE_TRIGGER_OVERWRITE
1696                 ? old
1697                 : bkey_i_to_s_c(new);
1698         unsigned replicas = bkey_s_c_to_reservation(k).v->nr_replicas;
1699         s64 sectors = (s64) k.k->size;
1700         struct replicas_delta_list *d;
1701
1702         if (flags & BTREE_TRIGGER_OVERWRITE)
1703                 sectors = -sectors;
1704         sectors *= replicas;
1705
1706         d = replicas_deltas_realloc(trans, 0);
1707
1708         replicas = clamp_t(unsigned, replicas, 1,
1709                            ARRAY_SIZE(d->persistent_reserved));
1710
1711         d->persistent_reserved[replicas - 1] += sectors;
1712         return 0;
1713 }
1714
1715 static int __bch2_trans_mark_reflink_p(struct btree_trans *trans,
1716                         struct bkey_s_c_reflink_p p,
1717                         u64 *idx, unsigned flags)
1718 {
1719         struct bch_fs *c = trans->c;
1720         struct btree_iter iter;
1721         struct bkey_s_c k;
1722         struct bkey_i *n;
1723         __le64 *refcount;
1724         int add = !(flags & BTREE_TRIGGER_OVERWRITE) ? 1 : -1;
1725         struct printbuf buf = PRINTBUF;
1726         int ret;
1727
1728         bch2_trans_iter_init(trans, &iter, BTREE_ID_reflink, POS(0, *idx),
1729                              BTREE_ITER_INTENT|
1730                              BTREE_ITER_WITH_UPDATES);
1731         k = bch2_btree_iter_peek_slot(&iter);
1732         ret = bkey_err(k);
1733         if (ret)
1734                 goto err;
1735
1736         n = bch2_trans_kmalloc(trans, bkey_bytes(k.k));
1737         ret = PTR_ERR_OR_ZERO(n);
1738         if (ret)
1739                 goto err;
1740
1741         bkey_reassemble(n, k);
1742
1743         refcount = bkey_refcount(n);
1744         if (!refcount) {
1745                 bch2_bkey_val_to_text(&buf, c, p.s_c);
1746                 bch2_trans_inconsistent(trans,
1747                         "nonexistent indirect extent at %llu while marking\n  %s",
1748                         *idx, buf.buf);
1749                 ret = -EIO;
1750                 goto err;
1751         }
1752
1753         if (!*refcount && (flags & BTREE_TRIGGER_OVERWRITE)) {
1754                 bch2_bkey_val_to_text(&buf, c, p.s_c);
1755                 bch2_trans_inconsistent(trans,
1756                         "indirect extent refcount underflow at %llu while marking\n  %s",
1757                         *idx, buf.buf);
1758                 ret = -EIO;
1759                 goto err;
1760         }
1761
1762         if (flags & BTREE_TRIGGER_INSERT) {
1763                 struct bch_reflink_p *v = (struct bch_reflink_p *) p.v;
1764                 u64 pad;
1765
1766                 pad = max_t(s64, le32_to_cpu(v->front_pad),
1767                             le64_to_cpu(v->idx) - bkey_start_offset(k.k));
1768                 BUG_ON(pad > U32_MAX);
1769                 v->front_pad = cpu_to_le32(pad);
1770
1771                 pad = max_t(s64, le32_to_cpu(v->back_pad),
1772                             k.k->p.offset - p.k->size - le64_to_cpu(v->idx));
1773                 BUG_ON(pad > U32_MAX);
1774                 v->back_pad = cpu_to_le32(pad);
1775         }
1776
1777         le64_add_cpu(refcount, add);
1778
1779         bch2_btree_iter_set_pos_to_extent_start(&iter);
1780         ret = bch2_trans_update(trans, &iter, n, 0);
1781         if (ret)
1782                 goto err;
1783
1784         *idx = k.k->p.offset;
1785 err:
1786         bch2_trans_iter_exit(trans, &iter);
1787         printbuf_exit(&buf);
1788         return ret;
1789 }
1790
1791 int bch2_trans_mark_reflink_p(struct btree_trans *trans,
1792                               enum btree_id btree_id, unsigned level,
1793                               struct bkey_s_c old,
1794                               struct bkey_i *new,
1795                               unsigned flags)
1796 {
1797         struct bkey_s_c k = flags & BTREE_TRIGGER_OVERWRITE
1798                 ? old
1799                 : bkey_i_to_s_c(new);
1800         struct bkey_s_c_reflink_p p = bkey_s_c_to_reflink_p(k);
1801         u64 idx, end_idx;
1802         int ret = 0;
1803
1804         if (flags & BTREE_TRIGGER_INSERT) {
1805                 struct bch_reflink_p *v = (struct bch_reflink_p *) p.v;
1806
1807                 v->front_pad = v->back_pad = 0;
1808         }
1809
1810         idx     = le64_to_cpu(p.v->idx) - le32_to_cpu(p.v->front_pad);
1811         end_idx = le64_to_cpu(p.v->idx) + p.k->size +
1812                 le32_to_cpu(p.v->back_pad);
1813
1814         while (idx < end_idx && !ret)
1815                 ret = __bch2_trans_mark_reflink_p(trans, p, &idx, flags);
1816
1817         return ret;
1818 }
1819
1820 static int __bch2_trans_mark_metadata_bucket(struct btree_trans *trans,
1821                                     struct bch_dev *ca, size_t b,
1822                                     enum bch_data_type type,
1823                                     unsigned sectors)
1824 {
1825         struct bch_fs *c = trans->c;
1826         struct btree_iter iter;
1827         struct bkey_i_alloc_v4 *a;
1828         int ret = 0;
1829
1830         /*
1831          * Backup superblock might be past the end of our normal usable space:
1832          */
1833         if (b >= ca->mi.nbuckets)
1834                 return 0;
1835
1836         a = bch2_trans_start_alloc_update(trans, &iter, POS(ca->dev_idx, b));
1837         if (IS_ERR(a))
1838                 return PTR_ERR(a);
1839
1840         if (a->v.data_type && a->v.data_type != type) {
1841                 bch2_fsck_err(c, FSCK_CAN_IGNORE|FSCK_NEED_FSCK,
1842                         "bucket %llu:%llu gen %u different types of data in same bucket: %s, %s\n"
1843                         "while marking %s",
1844                         iter.pos.inode, iter.pos.offset, a->v.gen,
1845                         bch2_data_types[a->v.data_type],
1846                         bch2_data_types[type],
1847                         bch2_data_types[type]);
1848                 ret = -EIO;
1849                 goto out;
1850         }
1851
1852         a->v.data_type          = type;
1853         a->v.dirty_sectors      = sectors;
1854
1855         ret = bch2_trans_update(trans, &iter, &a->k_i, 0);
1856         if (ret)
1857                 goto out;
1858 out:
1859         bch2_trans_iter_exit(trans, &iter);
1860         return ret;
1861 }
1862
1863 int bch2_trans_mark_metadata_bucket(struct btree_trans *trans,
1864                                     struct bch_dev *ca, size_t b,
1865                                     enum bch_data_type type,
1866                                     unsigned sectors)
1867 {
1868         return commit_do(trans, NULL, NULL, 0,
1869                         __bch2_trans_mark_metadata_bucket(trans, ca, b, type, sectors));
1870 }
1871
1872 static int bch2_trans_mark_metadata_sectors(struct btree_trans *trans,
1873                                             struct bch_dev *ca,
1874                                             u64 start, u64 end,
1875                                             enum bch_data_type type,
1876                                             u64 *bucket, unsigned *bucket_sectors)
1877 {
1878         do {
1879                 u64 b = sector_to_bucket(ca, start);
1880                 unsigned sectors =
1881                         min_t(u64, bucket_to_sector(ca, b + 1), end) - start;
1882
1883                 if (b != *bucket && *bucket_sectors) {
1884                         int ret = bch2_trans_mark_metadata_bucket(trans, ca, *bucket,
1885                                                                   type, *bucket_sectors);
1886                         if (ret)
1887                                 return ret;
1888
1889                         *bucket_sectors = 0;
1890                 }
1891
1892                 *bucket         = b;
1893                 *bucket_sectors += sectors;
1894                 start += sectors;
1895         } while (start < end);
1896
1897         return 0;
1898 }
1899
1900 static int __bch2_trans_mark_dev_sb(struct btree_trans *trans,
1901                                     struct bch_dev *ca)
1902 {
1903         struct bch_sb_layout *layout = &ca->disk_sb.sb->layout;
1904         u64 bucket = 0;
1905         unsigned i, bucket_sectors = 0;
1906         int ret;
1907
1908         for (i = 0; i < layout->nr_superblocks; i++) {
1909                 u64 offset = le64_to_cpu(layout->sb_offset[i]);
1910
1911                 if (offset == BCH_SB_SECTOR) {
1912                         ret = bch2_trans_mark_metadata_sectors(trans, ca,
1913                                                 0, BCH_SB_SECTOR,
1914                                                 BCH_DATA_sb, &bucket, &bucket_sectors);
1915                         if (ret)
1916                                 return ret;
1917                 }
1918
1919                 ret = bch2_trans_mark_metadata_sectors(trans, ca, offset,
1920                                       offset + (1 << layout->sb_max_size_bits),
1921                                       BCH_DATA_sb, &bucket, &bucket_sectors);
1922                 if (ret)
1923                         return ret;
1924         }
1925
1926         if (bucket_sectors) {
1927                 ret = bch2_trans_mark_metadata_bucket(trans, ca,
1928                                 bucket, BCH_DATA_sb, bucket_sectors);
1929                 if (ret)
1930                         return ret;
1931         }
1932
1933         for (i = 0; i < ca->journal.nr; i++) {
1934                 ret = bch2_trans_mark_metadata_bucket(trans, ca,
1935                                 ca->journal.buckets[i],
1936                                 BCH_DATA_journal, ca->mi.bucket_size);
1937                 if (ret)
1938                         return ret;
1939         }
1940
1941         return 0;
1942 }
1943
1944 int bch2_trans_mark_dev_sb(struct bch_fs *c, struct bch_dev *ca)
1945 {
1946         return bch2_trans_run(c, __bch2_trans_mark_dev_sb(&trans, ca));
1947 }
1948
1949 /* Disk reservations: */
1950
1951 #define SECTORS_CACHE   1024
1952
1953 int __bch2_disk_reservation_add(struct bch_fs *c, struct disk_reservation *res,
1954                               u64 sectors, int flags)
1955 {
1956         struct bch_fs_pcpu *pcpu;
1957         u64 old, v, get;
1958         s64 sectors_available;
1959         int ret;
1960
1961         percpu_down_read(&c->mark_lock);
1962         preempt_disable();
1963         pcpu = this_cpu_ptr(c->pcpu);
1964
1965         if (sectors <= pcpu->sectors_available)
1966                 goto out;
1967
1968         v = atomic64_read(&c->sectors_available);
1969         do {
1970                 old = v;
1971                 get = min((u64) sectors + SECTORS_CACHE, old);
1972
1973                 if (get < sectors) {
1974                         preempt_enable();
1975                         goto recalculate;
1976                 }
1977         } while ((v = atomic64_cmpxchg(&c->sectors_available,
1978                                        old, old - get)) != old);
1979
1980         pcpu->sectors_available         += get;
1981
1982 out:
1983         pcpu->sectors_available         -= sectors;
1984         this_cpu_add(*c->online_reserved, sectors);
1985         res->sectors                    += sectors;
1986
1987         preempt_enable();
1988         percpu_up_read(&c->mark_lock);
1989         return 0;
1990
1991 recalculate:
1992         mutex_lock(&c->sectors_available_lock);
1993
1994         percpu_u64_set(&c->pcpu->sectors_available, 0);
1995         sectors_available = avail_factor(__bch2_fs_usage_read_short(c).free);
1996
1997         if (sectors <= sectors_available ||
1998             (flags & BCH_DISK_RESERVATION_NOFAIL)) {
1999                 atomic64_set(&c->sectors_available,
2000                              max_t(s64, 0, sectors_available - sectors));
2001                 this_cpu_add(*c->online_reserved, sectors);
2002                 res->sectors                    += sectors;
2003                 ret = 0;
2004         } else {
2005                 atomic64_set(&c->sectors_available, sectors_available);
2006                 ret = -BCH_ERR_ENOSPC_disk_reservation;
2007         }
2008
2009         mutex_unlock(&c->sectors_available_lock);
2010         percpu_up_read(&c->mark_lock);
2011
2012         return ret;
2013 }
2014
2015 /* Startup/shutdown: */
2016
2017 static void bucket_gens_free_rcu(struct rcu_head *rcu)
2018 {
2019         struct bucket_gens *buckets =
2020                 container_of(rcu, struct bucket_gens, rcu);
2021
2022         kvpfree(buckets, sizeof(*buckets) + buckets->nbuckets);
2023 }
2024
2025 int bch2_dev_buckets_resize(struct bch_fs *c, struct bch_dev *ca, u64 nbuckets)
2026 {
2027         struct bucket_gens *bucket_gens = NULL, *old_bucket_gens = NULL;
2028         unsigned long *buckets_nouse = NULL;
2029         bool resize = ca->bucket_gens != NULL;
2030         int ret = -ENOMEM;
2031
2032         if (!(bucket_gens       = kvpmalloc(sizeof(struct bucket_gens) + nbuckets,
2033                                             GFP_KERNEL|__GFP_ZERO)) ||
2034             (c->opts.buckets_nouse &&
2035              !(buckets_nouse    = kvpmalloc(BITS_TO_LONGS(nbuckets) *
2036                                             sizeof(unsigned long),
2037                                             GFP_KERNEL|__GFP_ZERO))))
2038                 goto err;
2039
2040         bucket_gens->first_bucket = ca->mi.first_bucket;
2041         bucket_gens->nbuckets   = nbuckets;
2042
2043         bch2_copygc_stop(c);
2044
2045         if (resize) {
2046                 down_write(&c->gc_lock);
2047                 down_write(&ca->bucket_lock);
2048                 percpu_down_write(&c->mark_lock);
2049         }
2050
2051         old_bucket_gens = rcu_dereference_protected(ca->bucket_gens, 1);
2052
2053         if (resize) {
2054                 size_t n = min(bucket_gens->nbuckets, old_bucket_gens->nbuckets);
2055
2056                 memcpy(bucket_gens->b,
2057                        old_bucket_gens->b,
2058                        n);
2059                 if (buckets_nouse)
2060                         memcpy(buckets_nouse,
2061                                ca->buckets_nouse,
2062                                BITS_TO_LONGS(n) * sizeof(unsigned long));
2063         }
2064
2065         rcu_assign_pointer(ca->bucket_gens, bucket_gens);
2066         bucket_gens     = old_bucket_gens;
2067
2068         swap(ca->buckets_nouse, buckets_nouse);
2069
2070         nbuckets = ca->mi.nbuckets;
2071
2072         if (resize) {
2073                 percpu_up_write(&c->mark_lock);
2074                 up_write(&ca->bucket_lock);
2075                 up_write(&c->gc_lock);
2076         }
2077
2078         ret = 0;
2079 err:
2080         kvpfree(buckets_nouse,
2081                 BITS_TO_LONGS(nbuckets) * sizeof(unsigned long));
2082         if (bucket_gens)
2083                 call_rcu(&bucket_gens->rcu, bucket_gens_free_rcu);
2084
2085         return ret;
2086 }
2087
2088 void bch2_dev_buckets_free(struct bch_dev *ca)
2089 {
2090         unsigned i;
2091
2092         kvpfree(ca->buckets_nouse,
2093                 BITS_TO_LONGS(ca->mi.nbuckets) * sizeof(unsigned long));
2094         kvpfree(rcu_dereference_protected(ca->bucket_gens, 1),
2095                 sizeof(struct bucket_gens) + ca->mi.nbuckets);
2096
2097         for (i = 0; i < ARRAY_SIZE(ca->usage); i++)
2098                 free_percpu(ca->usage[i]);
2099         kfree(ca->usage_base);
2100 }
2101
2102 int bch2_dev_buckets_alloc(struct bch_fs *c, struct bch_dev *ca)
2103 {
2104         unsigned i;
2105
2106         ca->usage_base = kzalloc(sizeof(struct bch_dev_usage), GFP_KERNEL);
2107         if (!ca->usage_base)
2108                 return -ENOMEM;
2109
2110         for (i = 0; i < ARRAY_SIZE(ca->usage); i++) {
2111                 ca->usage[i] = alloc_percpu(struct bch_dev_usage);
2112                 if (!ca->usage[i])
2113                         return -ENOMEM;
2114         }
2115
2116         return bch2_dev_buckets_resize(c, ca, ca->mi.nbuckets);
2117 }