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

   1 // SPDX-License-Identifier: GPL-2.0
   2 #include "bcachefs.h"
   3 #include "alloc_background.h"
   4 #include "alloc_foreground.h"
   5 #include "backpointers.h"
   6 #include "btree_cache.h"
   7 #include "btree_io.h"
   8 #include "btree_key_cache.h"
   9 #include "btree_update.h"
  10 #include "btree_update_interior.h"
  11 #include "btree_gc.h"
  12 #include "buckets.h"
  13 #include "buckets_waiting_for_journal.h"
  14 #include "clock.h"
  15 #include "debug.h"
  16 #include "ec.h"
  17 #include "error.h"
  18 #include "lru.h"
  19 #include "recovery.h"
  20 #include "varint.h"
  21
  22 #include <linux/kthread.h>
  23 #include <linux/math64.h>
  24 #include <linux/random.h>
  25 #include <linux/rculist.h>
  26 #include <linux/rcupdate.h>
  27 #include <linux/sched/task.h>
  28 #include <linux/sort.h>
  29 #include <trace/events/bcachefs.h>
  30
  31 /* Persistent alloc info: */
  32
  33 static const unsigned BCH_ALLOC_V1_FIELD_BYTES[] = {
  34 #define x(name, bits) [BCH_ALLOC_FIELD_V1_##name] = bits / 8,
  35         BCH_ALLOC_FIELDS_V1()
  36 #undef x
  37 };
  38
  39 struct bkey_alloc_unpacked {
  40         u64             journal_seq;
  41         u8              gen;
  42         u8              oldest_gen;
  43         u8              data_type;
  44         bool            need_discard:1;
  45         bool            need_inc_gen:1;
  46 #define x(_name, _bits) u##_bits _name;
  47         BCH_ALLOC_FIELDS_V2()
  48 #undef  x
  49 };
  50
  51 static inline u64 alloc_field_v1_get(const struct bch_alloc *a,
  52                                      const void **p, unsigned field)
  53 {
  54         unsigned bytes = BCH_ALLOC_V1_FIELD_BYTES[field];
  55         u64 v;
  56
  57         if (!(a->fields & (1 << field)))
  58                 return 0;
  59
  60         switch (bytes) {
  61         case 1:
  62                 v = *((const u8 *) *p);
  63                 break;
  64         case 2:
  65                 v = le16_to_cpup(*p);
  66                 break;
  67         case 4:
  68                 v = le32_to_cpup(*p);
  69                 break;
  70         case 8:
  71                 v = le64_to_cpup(*p);
  72                 break;
  73         default:
  74                 BUG();
  75         }
  76
  77         *p += bytes;
  78         return v;
  79 }
  80
  81 static inline void alloc_field_v1_put(struct bkey_i_alloc *a, void **p,
  82                                       unsigned field, u64 v)
  83 {
  84         unsigned bytes = BCH_ALLOC_V1_FIELD_BYTES[field];
  85
  86         if (!v)
  87                 return;
  88
  89         a->v.fields |= 1 << field;
  90
  91         switch (bytes) {
  92         case 1:
  93                 *((u8 *) *p) = v;
  94                 break;
  95         case 2:
  96                 *((__le16 *) *p) = cpu_to_le16(v);
  97                 break;
  98         case 4:
  99                 *((__le32 *) *p) = cpu_to_le32(v);
 100                 break;
 101         case 8:
 102                 *((__le64 *) *p) = cpu_to_le64(v);
 103                 break;
 104         default:
 105                 BUG();
 106         }
 107
 108         *p += bytes;
 109 }
 110
 111 static void bch2_alloc_unpack_v1(struct bkey_alloc_unpacked *out,
 112                                  struct bkey_s_c k)
 113 {
 114         const struct bch_alloc *in = bkey_s_c_to_alloc(k).v;
 115         const void *d = in->data;
 116         unsigned idx = 0;
 117
 118         out->gen = in->gen;
 119
 120 #define x(_name, _bits) out->_name = alloc_field_v1_get(in, &d, idx++);
 121         BCH_ALLOC_FIELDS_V1()
 122 #undef  x
 123 }
 124
 125 static int bch2_alloc_unpack_v2(struct bkey_alloc_unpacked *out,
 126                                 struct bkey_s_c k)
 127 {
 128         struct bkey_s_c_alloc_v2 a = bkey_s_c_to_alloc_v2(k);
 129         const u8 *in = a.v->data;
 130         const u8 *end = bkey_val_end(a);
 131         unsigned fieldnr = 0;
 132         int ret;
 133         u64 v;
 134
 135         out->gen        = a.v->gen;
 136         out->oldest_gen = a.v->oldest_gen;
 137         out->data_type  = a.v->data_type;
 138
 139 #define x(_name, _bits)                                                 \
 140         if (fieldnr < a.v->nr_fields) {                                 \
 141                 ret = bch2_varint_decode_fast(in, end, &v);             \
 142                 if (ret < 0)                                            \
 143                         return ret;                                     \
 144                 in += ret;                                              \
 145         } else {                                                        \
 146                 v = 0;                                                  \
 147         }                                                               \
 148         out->_name = v;                                                 \
 149         if (v != out->_name)                                            \
 150                 return -1;                                              \
 151         fieldnr++;
 152
 153         BCH_ALLOC_FIELDS_V2()
 154 #undef  x
 155         return 0;
 156 }
 157
 158 static int bch2_alloc_unpack_v3(struct bkey_alloc_unpacked *out,
 159                                 struct bkey_s_c k)
 160 {
 161         struct bkey_s_c_alloc_v3 a = bkey_s_c_to_alloc_v3(k);
 162         const u8 *in = a.v->data;
 163         const u8 *end = bkey_val_end(a);
 164         unsigned fieldnr = 0;
 165         int ret;
 166         u64 v;
 167
 168         out->gen        = a.v->gen;
 169         out->oldest_gen = a.v->oldest_gen;
 170         out->data_type  = a.v->data_type;
 171         out->need_discard = BCH_ALLOC_V3_NEED_DISCARD(a.v);
 172         out->need_inc_gen = BCH_ALLOC_V3_NEED_INC_GEN(a.v);
 173         out->journal_seq = le64_to_cpu(a.v->journal_seq);
 174
 175 #define x(_name, _bits)                                                 \
 176         if (fieldnr < a.v->nr_fields) {                                 \
 177                 ret = bch2_varint_decode_fast(in, end, &v);             \
 178                 if (ret < 0)                                            \
 179                         return ret;                                     \
 180                 in += ret;                                              \
 181         } else {                                                        \
 182                 v = 0;                                                  \
 183         }                                                               \
 184         out->_name = v;                                                 \
 185         if (v != out->_name)                                            \
 186                 return -1;                                              \
 187         fieldnr++;
 188
 189         BCH_ALLOC_FIELDS_V2()
 190 #undef  x
 191         return 0;
 192 }
 193
 194 static struct bkey_alloc_unpacked bch2_alloc_unpack(struct bkey_s_c k)
 195 {
 196         struct bkey_alloc_unpacked ret = { .gen = 0 };
 197
 198         switch (k.k->type) {
 199         case KEY_TYPE_alloc:
 200                 bch2_alloc_unpack_v1(&ret, k);
 201                 break;
 202         case KEY_TYPE_alloc_v2:
 203                 bch2_alloc_unpack_v2(&ret, k);
 204                 break;
 205         case KEY_TYPE_alloc_v3:
 206                 bch2_alloc_unpack_v3(&ret, k);
 207                 break;
 208         }
 209
 210         return ret;
 211 }
 212
 213 static unsigned bch_alloc_v1_val_u64s(const struct bch_alloc *a)
 214 {
 215         unsigned i, bytes = offsetof(struct bch_alloc, data);
 216
 217         for (i = 0; i < ARRAY_SIZE(BCH_ALLOC_V1_FIELD_BYTES); i++)
 218                 if (a->fields & (1 << i))
 219                         bytes += BCH_ALLOC_V1_FIELD_BYTES[i];
 220
 221         return DIV_ROUND_UP(bytes, sizeof(u64));
 222 }
 223
 224 int bch2_alloc_v1_invalid(const struct bch_fs *c, struct bkey_s_c k,
 225                           int rw, struct printbuf *err)
 226 {
 227         struct bkey_s_c_alloc a = bkey_s_c_to_alloc(k);
 228
 229         /* allow for unknown fields */
 230         if (bkey_val_u64s(a.k) < bch_alloc_v1_val_u64s(a.v)) {
 231                 prt_printf(err, "incorrect value size (%zu < %u)",
 232                        bkey_val_u64s(a.k), bch_alloc_v1_val_u64s(a.v));
 233                 return -BCH_ERR_invalid_bkey;
 234         }
 235
 236         return 0;
 237 }
 238
 239 int bch2_alloc_v2_invalid(const struct bch_fs *c, struct bkey_s_c k,
 240                           int rw, struct printbuf *err)
 241 {
 242         struct bkey_alloc_unpacked u;
 243
 244         if (bch2_alloc_unpack_v2(&u, k)) {
 245                 prt_printf(err, "unpack error");
 246                 return -BCH_ERR_invalid_bkey;
 247         }
 248
 249         return 0;
 250 }
 251
 252 int bch2_alloc_v3_invalid(const struct bch_fs *c, struct bkey_s_c k,
 253                           int rw, struct printbuf *err)
 254 {
 255         struct bkey_alloc_unpacked u;
 256
 257         if (bch2_alloc_unpack_v3(&u, k)) {
 258                 prt_printf(err, "unpack error");
 259                 return -BCH_ERR_invalid_bkey;
 260         }
 261
 262         return 0;
 263 }
 264
 265 int bch2_alloc_v4_invalid(const struct bch_fs *c, struct bkey_s_c k,
 266                           int rw, struct printbuf *err)
 267 {
 268         struct bkey_s_c_alloc_v4 a = bkey_s_c_to_alloc_v4(k);
 269
 270         if (alloc_v4_u64s(a.v) != bkey_val_u64s(k.k)) {
 271                 prt_printf(err, "bad val size (%lu != %u)",
 272                        bkey_val_u64s(k.k), alloc_v4_u64s(a.v));
 273                 return -BCH_ERR_invalid_bkey;
 274         }
 275
 276         if (!BCH_ALLOC_V4_BACKPOINTERS_START(a.v) &&
 277             BCH_ALLOC_V4_NR_BACKPOINTERS(a.v)) {
 278                 prt_printf(err, "invalid backpointers_start");
 279                 return -BCH_ERR_invalid_bkey;
 280         }
 281
 282         /*
 283          * XXX this is wrong, we'll be checking updates that happened from
 284          * before BCH_FS_CHECK_BACKPOINTERS_DONE
 285          */
 286         if (rw == WRITE && test_bit(BCH_FS_CHECK_BACKPOINTERS_DONE, &c->flags)) {
 287                 unsigned i, bp_len = 0;
 288
 289                 for (i = 0; i < BCH_ALLOC_V4_NR_BACKPOINTERS(a.v); i++)
 290                         bp_len += alloc_v4_backpointers_c(a.v)[i].bucket_len;
 291
 292                 if (bp_len > a.v->dirty_sectors) {
 293                         prt_printf(err, "too many backpointers");
 294                         return -BCH_ERR_invalid_bkey;
 295                 }
 296         }
 297
 298         if (rw == WRITE) {
 299                 if (alloc_data_type(*a.v, a.v->data_type) != a.v->data_type) {
 300                         prt_printf(err, "invalid data type (got %u should be %u)",
 301                                a.v->data_type, alloc_data_type(*a.v, a.v->data_type));
 302                         return -BCH_ERR_invalid_bkey;
 303                 }
 304
 305                 switch (a.v->data_type) {
 306                 case BCH_DATA_free:
 307                 case BCH_DATA_need_gc_gens:
 308                 case BCH_DATA_need_discard:
 309                         if (a.v->dirty_sectors ||
 310                             a.v->cached_sectors ||
 311                             a.v->stripe) {
 312                                 prt_printf(err, "empty data type free but have data");
 313                                 return -BCH_ERR_invalid_bkey;
 314                         }
 315                         break;
 316                 case BCH_DATA_sb:
 317                 case BCH_DATA_journal:
 318                 case BCH_DATA_btree:
 319                 case BCH_DATA_user:
 320                 case BCH_DATA_parity:
 321                         if (!a.v->dirty_sectors) {
 322                                 prt_printf(err, "data_type %s but dirty_sectors==0",
 323                                        bch2_data_types[a.v->data_type]);
 324                                 return -BCH_ERR_invalid_bkey;
 325                         }
 326                         break;
 327                 case BCH_DATA_cached:
 328                         if (!a.v->cached_sectors ||
 329                             a.v->dirty_sectors ||
 330                             a.v->stripe) {
 331                                 prt_printf(err, "data type inconsistency");
 332                                 return -BCH_ERR_invalid_bkey;
 333                         }
 334
 335                         if (!a.v->io_time[READ] &&
 336                             test_bit(BCH_FS_CHECK_ALLOC_TO_LRU_REFS_DONE, &c->flags)) {
 337                                 prt_printf(err, "cached bucket with read_time == 0");
 338                                 return -BCH_ERR_invalid_bkey;
 339                         }
 340                         break;
 341                 case BCH_DATA_stripe:
 342                         if (!a.v->stripe) {
 343                                 prt_printf(err, "data_type %s but stripe==0",
 344                                        bch2_data_types[a.v->data_type]);
 345                                 return -BCH_ERR_invalid_bkey;
 346                         }
 347                         break;
 348                 }
 349         }
 350
 351         return 0;
 352 }
 353
 354 static inline u64 swab40(u64 x)
 355 {
 356         return (((x & 0x00000000ffULL) << 32)|
 357                 ((x & 0x000000ff00ULL) << 16)|
 358                 ((x & 0x0000ff0000ULL) >>  0)|
 359                 ((x & 0x00ff000000ULL) >> 16)|
 360                 ((x & 0xff00000000ULL) >> 32));
 361 }
 362
 363 void bch2_alloc_v4_swab(struct bkey_s k)
 364 {
 365         struct bch_alloc_v4 *a = bkey_s_to_alloc_v4(k).v;
 366         struct bch_backpointer *bp, *bps;
 367
 368         a->journal_seq          = swab64(a->journal_seq);
 369         a->flags                = swab32(a->flags);
 370         a->dirty_sectors        = swab32(a->dirty_sectors);
 371         a->cached_sectors       = swab32(a->cached_sectors);
 372         a->io_time[0]           = swab64(a->io_time[0]);
 373         a->io_time[1]           = swab64(a->io_time[1]);
 374         a->stripe               = swab32(a->stripe);
 375         a->nr_external_backpointers = swab32(a->nr_external_backpointers);
 376
 377         bps = alloc_v4_backpointers(a);
 378         for (bp = bps; bp < bps + BCH_ALLOC_V4_NR_BACKPOINTERS(a); bp++) {
 379                 bp->bucket_offset       = swab40(bp->bucket_offset);
 380                 bp->bucket_len          = swab32(bp->bucket_len);
 381                 bch2_bpos_swab(&bp->pos);
 382         }
 383 }
 384
 385 void bch2_alloc_to_text(struct printbuf *out, struct bch_fs *c, struct bkey_s_c k)
 386 {
 387         struct bch_alloc_v4 _a;
 388         const struct bch_alloc_v4 *a = bch2_alloc_to_v4(k, &_a);
 389         unsigned i;
 390
 391         prt_newline(out);
 392         printbuf_indent_add(out, 2);
 393
 394         prt_printf(out, "gen %u oldest_gen %u data_type %s",
 395                a->gen, a->oldest_gen, bch2_data_types[a->data_type]);
 396         prt_newline(out);
 397         prt_printf(out, "journal_seq       %llu",       a->journal_seq);
 398         prt_newline(out);
 399         prt_printf(out, "need_discard      %llu",       BCH_ALLOC_V4_NEED_DISCARD(a));
 400         prt_newline(out);
 401         prt_printf(out, "need_inc_gen      %llu",       BCH_ALLOC_V4_NEED_INC_GEN(a));
 402         prt_newline(out);
 403         prt_printf(out, "dirty_sectors     %u", a->dirty_sectors);
 404         prt_newline(out);
 405         prt_printf(out, "cached_sectors    %u", a->cached_sectors);
 406         prt_newline(out);
 407         prt_printf(out, "stripe            %u", a->stripe);
 408         prt_newline(out);
 409         prt_printf(out, "stripe_redundancy %u", a->stripe_redundancy);
 410         prt_newline(out);
 411         prt_printf(out, "io_time[READ]     %llu",       a->io_time[READ]);
 412         prt_newline(out);
 413         prt_printf(out, "io_time[WRITE]    %llu",       a->io_time[WRITE]);
 414         prt_newline(out);
 415
 416         if (k.k->type == KEY_TYPE_alloc_v4) {
 417                 struct bkey_s_c_alloc_v4 a_raw = bkey_s_c_to_alloc_v4(k);
 418                 const struct bch_backpointer *bps = alloc_v4_backpointers_c(a_raw.v);
 419
 420                 prt_printf(out, "bp_start          %llu", BCH_ALLOC_V4_BACKPOINTERS_START(a_raw.v));
 421                 prt_newline(out);
 422
 423                 prt_printf(out, "backpointers:     %llu", BCH_ALLOC_V4_NR_BACKPOINTERS(a_raw.v));
 424                 printbuf_indent_add(out, 2);
 425
 426                 for (i = 0; i < BCH_ALLOC_V4_NR_BACKPOINTERS(a_raw.v); i++) {
 427                         prt_newline(out);
 428                         bch2_backpointer_to_text(out, &bps[i]);
 429                 }
 430
 431                 printbuf_indent_sub(out, 2);
 432         }
 433
 434         printbuf_indent_sub(out, 2);
 435 }
 436
 437 void __bch2_alloc_to_v4(struct bkey_s_c k, struct bch_alloc_v4 *out)
 438 {
 439         if (k.k->type == KEY_TYPE_alloc_v4) {
 440                 void *src, *dst;
 441
 442                 *out = *bkey_s_c_to_alloc_v4(k).v;
 443
 444                 src = alloc_v4_backpointers(out);
 445                 SET_BCH_ALLOC_V4_BACKPOINTERS_START(out, BCH_ALLOC_V4_U64s);
 446                 dst = alloc_v4_backpointers(out);
 447
 448                 if (src < dst)
 449                         memset(src, 0, dst - src);
 450         } else {
 451                 struct bkey_alloc_unpacked u = bch2_alloc_unpack(k);
 452
 453                 *out = (struct bch_alloc_v4) {
 454                         .journal_seq            = u.journal_seq,
 455                         .flags                  = u.need_discard,
 456                         .gen                    = u.gen,
 457                         .oldest_gen             = u.oldest_gen,
 458                         .data_type              = u.data_type,
 459                         .stripe_redundancy      = u.stripe_redundancy,
 460                         .dirty_sectors          = u.dirty_sectors,
 461                         .cached_sectors         = u.cached_sectors,
 462                         .io_time[READ]          = u.read_time,
 463                         .io_time[WRITE]         = u.write_time,
 464                         .stripe                 = u.stripe,
 465                 };
 466
 467                 SET_BCH_ALLOC_V4_BACKPOINTERS_START(out, BCH_ALLOC_V4_U64s);
 468         }
 469 }
 470
 471 static noinline struct bkey_i_alloc_v4 *
 472 __bch2_alloc_to_v4_mut(struct btree_trans *trans, struct bkey_s_c k)
 473 {
 474         struct bkey_i_alloc_v4 *ret;
 475         if (k.k->type == KEY_TYPE_alloc_v4) {
 476                 struct bkey_s_c_alloc_v4 a = bkey_s_c_to_alloc_v4(k);
 477                 unsigned bytes = sizeof(struct bkey_i_alloc_v4) +
 478                         BCH_ALLOC_V4_NR_BACKPOINTERS(a.v) *
 479                         sizeof(struct bch_backpointer);
 480                 void *src, *dst;
 481
 482                 /*
 483                  * Reserve space for one more backpointer here:
 484                  * Not sketchy at doing it this way, nope...
 485                  */
 486                 ret = bch2_trans_kmalloc(trans, bytes + sizeof(struct bch_backpointer));
 487                 if (IS_ERR(ret))
 488                         return ret;
 489
 490                 bkey_reassemble(&ret->k_i, k);
 491
 492                 src = alloc_v4_backpointers(&ret->v);
 493                 SET_BCH_ALLOC_V4_BACKPOINTERS_START(&ret->v, BCH_ALLOC_V4_U64s);
 494                 dst = alloc_v4_backpointers(&ret->v);
 495
 496                 memmove(dst, src, BCH_ALLOC_V4_NR_BACKPOINTERS(&ret->v) *
 497                         sizeof(struct bch_backpointer));
 498                 if (src < dst)
 499                         memset(src, 0, dst - src);
 500                 set_alloc_v4_u64s(ret);
 501         } else {
 502                 ret = bch2_trans_kmalloc(trans, sizeof(struct bkey_i_alloc_v4) +
 503                                          sizeof(struct bch_backpointer));
 504                 if (IS_ERR(ret))
 505                         return ret;
 506
 507                 bkey_alloc_v4_init(&ret->k_i);
 508                 ret->k.p = k.k->p;
 509                 bch2_alloc_to_v4(k, &ret->v);
 510         }
 511         return ret;
 512 }
 513
 514 static inline struct bkey_i_alloc_v4 *bch2_alloc_to_v4_mut_inlined(struct btree_trans *trans, struct bkey_s_c k)
 515 {
 516         if (likely(k.k->type == KEY_TYPE_alloc_v4) &&
 517             BCH_ALLOC_V4_BACKPOINTERS_START(bkey_s_c_to_alloc_v4(k).v) == BCH_ALLOC_V4_U64s) {
 518                 /*
 519                  * Reserve space for one more backpointer here:
 520                  * Not sketchy at doing it this way, nope...
 521                  */
 522                 struct bkey_i_alloc_v4 *ret =
 523                         bch2_trans_kmalloc_nomemzero(trans, bkey_bytes(k.k) + sizeof(struct bch_backpointer));
 524                 if (!IS_ERR(ret))
 525                         bkey_reassemble(&ret->k_i, k);
 526                 return ret;
 527         }
 528
 529         return __bch2_alloc_to_v4_mut(trans, k);
 530 }
 531
 532 struct bkey_i_alloc_v4 *bch2_alloc_to_v4_mut(struct btree_trans *trans, struct bkey_s_c k)
 533 {
 534         return bch2_alloc_to_v4_mut_inlined(trans, k);
 535 }
 536
 537 struct bkey_i_alloc_v4 *
 538 bch2_trans_start_alloc_update(struct btree_trans *trans, struct btree_iter *iter,
 539                               struct bpos pos)
 540 {
 541         struct bkey_s_c k;
 542         struct bkey_i_alloc_v4 *a;
 543         int ret;
 544
 545         bch2_trans_iter_init(trans, iter, BTREE_ID_alloc, pos,
 546                              BTREE_ITER_WITH_UPDATES|
 547                              BTREE_ITER_CACHED|
 548                              BTREE_ITER_INTENT);
 549         k = bch2_btree_iter_peek_slot(iter);
 550         ret = bkey_err(k);
 551         if (unlikely(ret))
 552                 goto err;
 553
 554         a = bch2_alloc_to_v4_mut_inlined(trans, k);
 555         ret = PTR_ERR_OR_ZERO(a);
 556         if (unlikely(ret))
 557                 goto err;
 558         return a;
 559 err:
 560         bch2_trans_iter_exit(trans, iter);
 561         return ERR_PTR(ret);
 562 }
 563
 564 int bch2_alloc_read(struct bch_fs *c)
 565 {
 566         struct btree_trans trans;
 567         struct btree_iter iter;
 568         struct bkey_s_c k;
 569         struct bch_alloc_v4 a;
 570         struct bch_dev *ca;
 571         int ret;
 572
 573         bch2_trans_init(&trans, c, 0, 0);
 574
 575         for_each_btree_key(&trans, iter, BTREE_ID_alloc, POS_MIN,
 576                            BTREE_ITER_PREFETCH, k, ret) {
 577                 /*
 578                  * Not a fsck error because this is checked/repaired by
 579                  * bch2_check_alloc_key() which runs later:
 580                  */
 581                 if (!bch2_dev_bucket_exists(c, k.k->p))
 582                         continue;
 583
 584                 ca = bch_dev_bkey_exists(c, k.k->p.inode);
 585
 586                 *bucket_gen(ca, k.k->p.offset) = bch2_alloc_to_v4(k, &a)->gen;
 587         }
 588         bch2_trans_iter_exit(&trans, &iter);
 589
 590         bch2_trans_exit(&trans);
 591
 592         if (ret)
 593                 bch_err(c, "error reading alloc info: %s", bch2_err_str(ret));
 594
 595         return ret;
 596 }
 597
 598 static struct bpos alloc_gens_pos(struct bpos pos, unsigned *offset)
 599 {
 600         *offset = pos.offset & KEY_TYPE_BUCKET_GENS_MASK;
 601
 602         pos.offset >>= KEY_TYPE_BUCKET_GENS_BITS;
 603         return pos;
 604 }
 605
 606 static struct bpos bucket_gens_pos_to_alloc(struct bpos pos, unsigned offset)
 607 {
 608         pos.offset <<= KEY_TYPE_BUCKET_GENS_BITS;
 609         pos.offset += offset;
 610         return pos;
 611 }
 612
 613 static unsigned alloc_gen(struct bkey_s_c k, unsigned offset)
 614 {
 615         return k.k->type == KEY_TYPE_bucket_gens
 616                 ? bkey_s_c_to_bucket_gens(k).v->gens[offset]
 617                 : 0;
 618 }
 619
 620 int bch2_bucket_gens_invalid(const struct bch_fs *c, struct bkey_s_c k,
 621                              int rw, struct printbuf *err)
 622 {
 623         if (bkey_val_bytes(k.k) != sizeof(struct bch_bucket_gens)) {
 624                 prt_printf(err, "bad val size (%lu != %zu)",
 625                        bkey_val_bytes(k.k), sizeof(struct bch_bucket_gens));
 626                 return -BCH_ERR_invalid_bkey;
 627         }
 628
 629         return 0;
 630 }
 631
 632 void bch2_bucket_gens_to_text(struct printbuf *out, struct bch_fs *c, struct bkey_s_c k)
 633 {
 634         struct bkey_s_c_bucket_gens g = bkey_s_c_to_bucket_gens(k);
 635         unsigned i;
 636
 637         for (i = 0; i < ARRAY_SIZE(g.v->gens); i++) {
 638                 if (i)
 639                         prt_char(out, ' ');
 640                 prt_printf(out, "%u", g.v->gens[i]);
 641         }
 642 }
 643
 644 int bch2_bucket_gens_init(struct bch_fs *c)
 645 {
 646         struct btree_trans trans;
 647         struct btree_iter iter;
 648         struct bkey_s_c k;
 649         struct bch_alloc_v4 a;
 650         struct bkey_i_bucket_gens g;
 651         bool have_bucket_gens_key = false;
 652         unsigned offset;
 653         struct bpos pos;
 654         u8 gen;
 655         int ret;
 656
 657         bch2_trans_init(&trans, c, 0, 0);
 658
 659         for_each_btree_key(&trans, iter, BTREE_ID_alloc, POS_MIN,
 660                            BTREE_ITER_PREFETCH, k, ret) {
 661                 /*
 662                  * Not a fsck error because this is checked/repaired by
 663                  * bch2_check_alloc_key() which runs later:
 664                  */
 665                 if (!bch2_dev_bucket_exists(c, k.k->p))
 666                         continue;
 667
 668                 gen = bch2_alloc_to_v4(k, &a)->gen;
 669                 pos = alloc_gens_pos(iter.pos, &offset);
 670
 671                 if (have_bucket_gens_key && bkey_cmp(iter.pos, pos)) {
 672                         ret = commit_do(&trans, NULL, NULL,
 673                                         BTREE_INSERT_NOFAIL|
 674                                         BTREE_INSERT_LAZY_RW,
 675                                 __bch2_btree_insert(&trans, BTREE_ID_bucket_gens, &g.k_i));
 676                         if (ret)
 677                                 break;
 678                         have_bucket_gens_key = false;
 679                 }
 680
 681                 if (!have_bucket_gens_key) {
 682                         bkey_bucket_gens_init(&g.k_i);
 683                         g.k.p = pos;
 684                         have_bucket_gens_key = true;
 685                 }
 686
 687                 g.v.gens[offset] = gen;
 688         }
 689         bch2_trans_iter_exit(&trans, &iter);
 690
 691         if (have_bucket_gens_key && !ret)
 692                 ret = commit_do(&trans, NULL, NULL,
 693                                 BTREE_INSERT_NOFAIL|
 694                                 BTREE_INSERT_LAZY_RW,
 695                         __bch2_btree_insert(&trans, BTREE_ID_bucket_gens, &g.k_i));
 696
 697         bch2_trans_exit(&trans);
 698
 699         if (ret)
 700                 bch_err(c, "%s: error %s", __func__, bch2_err_str(ret));
 701
 702         return ret;
 703 }
 704
 705 int bch2_bucket_gens_read(struct bch_fs *c)
 706 {
 707         struct btree_trans trans;
 708         struct btree_iter iter;
 709         struct bkey_s_c k;
 710         const struct bch_bucket_gens *g;
 711         struct bch_dev *ca;
 712         u64 b;
 713         int ret;
 714
 715         bch2_trans_init(&trans, c, 0, 0);
 716
 717         for_each_btree_key(&trans, iter, BTREE_ID_bucket_gens, POS_MIN,
 718                            BTREE_ITER_PREFETCH, k, ret) {
 719                 u64 start = bucket_gens_pos_to_alloc(k.k->p, 0).offset;
 720                 u64 end = bucket_gens_pos_to_alloc(bpos_nosnap_successor(k.k->p), 0).offset;
 721
 722                 if (k.k->type != KEY_TYPE_bucket_gens)
 723                         continue;
 724
 725                 g = bkey_s_c_to_bucket_gens(k).v;
 726
 727                 /*
 728                  * Not a fsck error because this is checked/repaired by
 729                  * bch2_check_alloc_key() which runs later:
 730                  */
 731                 if (!bch2_dev_exists2(c, k.k->p.inode))
 732                         continue;
 733
 734                 ca = bch_dev_bkey_exists(c, k.k->p.inode);
 735
 736                 for (b = max_t(u64, ca->mi.first_bucket, start);
 737                      b < min_t(u64, ca->mi.nbuckets, end);
 738                      b++)
 739                         *bucket_gen(ca, b) = g->gens[b & KEY_TYPE_BUCKET_GENS_MASK];
 740         }
 741         bch2_trans_iter_exit(&trans, &iter);
 742
 743         bch2_trans_exit(&trans);
 744
 745         if (ret)
 746                 bch_err(c, "error reading alloc info: %s", bch2_err_str(ret));
 747
 748         return ret;
 749 }
 750
 751 /* Free space/discard btree: */
 752
 753 static int bch2_bucket_do_index(struct btree_trans *trans,
 754                                 struct bkey_s_c alloc_k,
 755                                 const struct bch_alloc_v4 *a,
 756                                 bool set)
 757 {
 758         struct bch_fs *c = trans->c;
 759         struct bch_dev *ca = bch_dev_bkey_exists(c, alloc_k.k->p.inode);
 760         struct btree_iter iter;
 761         struct bkey_s_c old;
 762         struct bkey_i *k;
 763         enum btree_id btree;
 764         enum bch_bkey_type old_type = !set ? KEY_TYPE_set : KEY_TYPE_deleted;
 765         enum bch_bkey_type new_type =  set ? KEY_TYPE_set : KEY_TYPE_deleted;
 766         struct printbuf buf = PRINTBUF;
 767         int ret;
 768
 769         if (a->data_type != BCH_DATA_free &&
 770             a->data_type != BCH_DATA_need_discard)
 771                 return 0;
 772
 773         k = bch2_trans_kmalloc_nomemzero(trans, sizeof(*k));
 774         if (IS_ERR(k))
 775                 return PTR_ERR(k);
 776
 777         bkey_init(&k->k);
 778         k->k.type = new_type;
 779
 780         switch (a->data_type) {
 781         case BCH_DATA_free:
 782                 btree = BTREE_ID_freespace;
 783                 k->k.p = alloc_freespace_pos(alloc_k.k->p, *a);
 784                 bch2_key_resize(&k->k, 1);
 785                 break;
 786         case BCH_DATA_need_discard:
 787                 btree = BTREE_ID_need_discard;
 788                 k->k.p = alloc_k.k->p;
 789                 break;
 790         default:
 791                 return 0;
 792         }
 793
 794         bch2_trans_iter_init(trans, &iter, btree,
 795                              bkey_start_pos(&k->k),
 796                              BTREE_ITER_INTENT);
 797         old = bch2_btree_iter_peek_slot(&iter);
 798         ret = bkey_err(old);
 799         if (ret)
 800                 goto err;
 801
 802         if (ca->mi.freespace_initialized &&
 803             bch2_trans_inconsistent_on(old.k->type != old_type, trans,
 804                         "incorrect key when %s %s btree (got %s should be %s)\n"
 805                         "  for %s",
 806                         set ? "setting" : "clearing",
 807                         bch2_btree_ids[btree],
 808                         bch2_bkey_types[old.k->type],
 809                         bch2_bkey_types[old_type],
 810                         (bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf))) {
 811                 ret = -EIO;
 812                 goto err;
 813         }
 814
 815         ret = bch2_trans_update(trans, &iter, k, 0);
 816 err:
 817         bch2_trans_iter_exit(trans, &iter);
 818         printbuf_exit(&buf);
 819         return ret;
 820 }
 821
 822 static noinline int bch2_bucket_gen_update(struct btree_trans *trans,
 823                                            struct bpos bucket, u8 gen)
 824 {
 825         struct btree_iter iter;
 826         unsigned offset;
 827         struct bpos pos = alloc_gens_pos(bucket, &offset);
 828         struct bkey_i_bucket_gens *g;
 829         struct bkey_s_c k;
 830         int ret;
 831
 832         g = bch2_trans_kmalloc(trans, sizeof(*g));
 833         ret = PTR_ERR_OR_ZERO(g);
 834         if (ret)
 835                 return ret;
 836
 837         bch2_trans_iter_init(trans, &iter, BTREE_ID_bucket_gens, pos,
 838                              BTREE_ITER_INTENT|
 839                              BTREE_ITER_WITH_UPDATES);
 840         k = bch2_btree_iter_peek_slot(&iter);
 841         ret = bkey_err(k);
 842         if (ret)
 843                 goto err;
 844
 845         if (k.k->type != KEY_TYPE_bucket_gens) {
 846                 bkey_bucket_gens_init(&g->k_i);
 847                 g->k.p = iter.pos;
 848         } else {
 849                 bkey_reassemble(&g->k_i, k);
 850         }
 851
 852         g->v.gens[offset] = gen;
 853
 854         ret = bch2_trans_update(trans, &iter, &g->k_i, 0);
 855 err:
 856         bch2_trans_iter_exit(trans, &iter);
 857         return ret;
 858 }
 859
 860 int bch2_trans_mark_alloc(struct btree_trans *trans,
 861                           enum btree_id btree_id, unsigned level,
 862                           struct bkey_s_c old, struct bkey_i *new,
 863                           unsigned flags)
 864 {
 865         struct bch_fs *c = trans->c;
 866         struct bch_alloc_v4 old_a_convert, *new_a;
 867         const struct bch_alloc_v4 *old_a;
 868         u64 old_lru, new_lru;
 869         int ret = 0;
 870
 871         /*
 872          * Deletion only happens in the device removal path, with
 873          * BTREE_TRIGGER_NORUN:
 874          */
 875         BUG_ON(new->k.type != KEY_TYPE_alloc_v4);
 876
 877         old_a = bch2_alloc_to_v4(old, &old_a_convert);
 878         new_a = &bkey_i_to_alloc_v4(new)->v;
 879
 880         new_a->data_type = alloc_data_type(*new_a, new_a->data_type);
 881
 882         if (new_a->dirty_sectors > old_a->dirty_sectors ||
 883             new_a->cached_sectors > old_a->cached_sectors) {
 884                 new_a->io_time[READ] = max_t(u64, 1, atomic64_read(&c->io_clock[READ].now));
 885                 new_a->io_time[WRITE]= max_t(u64, 1, atomic64_read(&c->io_clock[WRITE].now));
 886                 SET_BCH_ALLOC_V4_NEED_INC_GEN(new_a, true);
 887                 SET_BCH_ALLOC_V4_NEED_DISCARD(new_a, true);
 888         }
 889
 890         if (data_type_is_empty(new_a->data_type) &&
 891             BCH_ALLOC_V4_NEED_INC_GEN(new_a) &&
 892             !bch2_bucket_is_open_safe(c, new->k.p.inode, new->k.p.offset)) {
 893                 new_a->gen++;
 894                 SET_BCH_ALLOC_V4_NEED_INC_GEN(new_a, false);
 895         }
 896
 897         if (old_a->data_type != new_a->data_type ||
 898             (new_a->data_type == BCH_DATA_free &&
 899              alloc_freespace_genbits(*old_a) != alloc_freespace_genbits(*new_a))) {
 900                 ret =   bch2_bucket_do_index(trans, old, old_a, false) ?:
 901                         bch2_bucket_do_index(trans, bkey_i_to_s_c(new), new_a, true);
 902                 if (ret)
 903                         return ret;
 904         }
 905
 906         if (new_a->data_type == BCH_DATA_cached &&
 907             !new_a->io_time[READ])
 908                 new_a->io_time[READ] = max_t(u64, 1, atomic64_read(&c->io_clock[READ].now));
 909
 910         old_lru = alloc_lru_idx(*old_a);
 911         new_lru = alloc_lru_idx(*new_a);
 912
 913         if (old_lru != new_lru) {
 914                 ret = bch2_lru_change(trans, new->k.p.inode, new->k.p.offset,
 915                                       old_lru, &new_lru, old);
 916                 if (ret)
 917                         return ret;
 918
 919                 if (new_a->data_type == BCH_DATA_cached)
 920                         new_a->io_time[READ] = new_lru;
 921         }
 922
 923         if (old_a->gen != new_a->gen) {
 924                 ret = bch2_bucket_gen_update(trans, new->k.p, new_a->gen);
 925                 if (ret)
 926                         return ret;
 927         }
 928
 929         return 0;
 930 }
 931
 932 /*
 933  * This synthesizes deleted extents for holes, similar to BTREE_ITER_SLOTS for
 934  * extents style btrees, but works on non-extents btrees:
 935  */
 936 struct bkey_s_c bch2_get_key_or_hole(struct btree_iter *iter, struct bpos end, struct bkey *hole)
 937 {
 938         struct bkey_s_c k = bch2_btree_iter_peek_slot(iter);
 939
 940         if (bkey_err(k))
 941                 return k;
 942
 943         if (k.k->type) {
 944                 return k;
 945         } else {
 946                 struct btree_iter iter2;
 947                 struct bpos next;
 948
 949                 bch2_trans_copy_iter(&iter2, iter);
 950                 k = bch2_btree_iter_peek_upto(&iter2,
 951                                 bkey_min(bkey_min(end,
 952                                                   iter->path->l[0].b->key.k.p),
 953                                                   POS(iter->pos.inode, iter->pos.offset + U32_MAX - 1)));
 954                 next = iter2.pos;
 955                 bch2_trans_iter_exit(iter->trans, &iter2);
 956
 957                 BUG_ON(next.offset >= iter->pos.offset + U32_MAX);
 958
 959                 if (bkey_err(k))
 960                         return k;
 961
 962                 bkey_init(hole);
 963                 hole->p = iter->pos;
 964
 965                 bch2_key_resize(hole, next.offset - iter->pos.offset);
 966                 return (struct bkey_s_c) { hole, NULL };
 967         }
 968 }
 969
 970 static bool next_bucket(struct bch_fs *c, struct bpos *bucket)
 971 {
 972         struct bch_dev *ca;
 973         unsigned iter;
 974
 975         if (bch2_dev_bucket_exists(c, *bucket))
 976                 return true;
 977
 978         if (bch2_dev_exists2(c, bucket->inode)) {
 979                 ca = bch_dev_bkey_exists(c, bucket->inode);
 980
 981                 if (bucket->offset < ca->mi.first_bucket) {
 982                         bucket->offset = ca->mi.first_bucket;
 983                         return true;
 984                 }
 985
 986                 bucket->inode++;
 987                 bucket->offset = 0;
 988         }
 989
 990         rcu_read_lock();
 991         iter = bucket->inode;
 992         ca = __bch2_next_dev(c, &iter, NULL);
 993         if (ca)
 994                 bucket->offset = ca->mi.first_bucket;
 995         rcu_read_unlock();
 996
 997         return ca != NULL;
 998 }
 999
1000 struct bkey_s_c bch2_get_key_or_real_bucket_hole(struct btree_iter *iter, struct bkey *hole)
1001 {
1002         struct bch_fs *c = iter->trans->c;
1003         struct bkey_s_c k;
1004 again:
1005         k = bch2_get_key_or_hole(iter, POS_MAX, hole);
1006         if (bkey_err(k))
1007                 return k;
1008
1009         if (!k.k->type) {
1010                 struct bpos bucket = bkey_start_pos(k.k);
1011
1012                 if (!bch2_dev_bucket_exists(c, bucket)) {
1013                         if (!next_bucket(c, &bucket))
1014                                 return bkey_s_c_null;
1015
1016                         bch2_btree_iter_set_pos(iter, bucket);
1017                         goto again;
1018                 }
1019
1020                 if (!bch2_dev_bucket_exists(c, k.k->p)) {
1021                         struct bch_dev *ca = bch_dev_bkey_exists(c, bucket.inode);
1022
1023                         bch2_key_resize(hole, ca->mi.nbuckets - bucket.offset);
1024                 }
1025         }
1026
1027         return k;
1028 }
1029
1030 static int bch2_check_alloc_key(struct btree_trans *trans,
1031                                 struct bkey_s_c alloc_k,
1032                                 struct btree_iter *alloc_iter,
1033                                 struct btree_iter *discard_iter,
1034                                 struct btree_iter *freespace_iter,
1035                                 struct btree_iter *bucket_gens_iter)
1036 {
1037         struct bch_fs *c = trans->c;
1038         struct bch_dev *ca;
1039         struct bch_alloc_v4 a_convert;
1040         const struct bch_alloc_v4 *a;
1041         unsigned discard_key_type, freespace_key_type;
1042         unsigned gens_offset;
1043         struct bkey_s_c k;
1044         struct printbuf buf = PRINTBUF;
1045         int ret;
1046
1047         if (fsck_err_on(!bch2_dev_bucket_exists(c, alloc_k.k->p), c,
1048                         "alloc key for invalid device:bucket %llu:%llu",
1049                         alloc_k.k->p.inode, alloc_k.k->p.offset))
1050                 return bch2_btree_delete_at(trans, alloc_iter, 0);
1051
1052         ca = bch_dev_bkey_exists(c, alloc_k.k->p.inode);
1053         if (!ca->mi.freespace_initialized)
1054                 return 0;
1055
1056         a = bch2_alloc_to_v4(alloc_k, &a_convert);
1057
1058         discard_key_type = a->data_type == BCH_DATA_need_discard ? KEY_TYPE_set : 0;
1059         bch2_btree_iter_set_pos(discard_iter, alloc_k.k->p);
1060         k = bch2_btree_iter_peek_slot(discard_iter);
1061         ret = bkey_err(k);
1062         if (ret)
1063                 goto err;
1064
1065         if (k.k->type != discard_key_type &&
1066             (c->opts.reconstruct_alloc ||
1067              fsck_err(c, "incorrect key in need_discard btree (got %s should be %s)\n"
1068                       "  %s",
1069                       bch2_bkey_types[k.k->type],
1070                       bch2_bkey_types[discard_key_type],
1071                       (bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf)))) {
1072                 struct bkey_i *update =
1073                         bch2_trans_kmalloc(trans, sizeof(*update));
1074
1075                 ret = PTR_ERR_OR_ZERO(update);
1076                 if (ret)
1077                         goto err;
1078
1079                 bkey_init(&update->k);
1080                 update->k.type  = discard_key_type;
1081                 update->k.p     = discard_iter->pos;
1082
1083                 ret = bch2_trans_update(trans, discard_iter, update, 0);
1084                 if (ret)
1085                         goto err;
1086         }
1087
1088         freespace_key_type = a->data_type == BCH_DATA_free ? KEY_TYPE_set : 0;
1089         bch2_btree_iter_set_pos(freespace_iter, alloc_freespace_pos(alloc_k.k->p, *a));
1090         k = bch2_btree_iter_peek_slot(freespace_iter);
1091         ret = bkey_err(k);
1092         if (ret)
1093                 goto err;
1094
1095         if (k.k->type != freespace_key_type &&
1096             (c->opts.reconstruct_alloc ||
1097              fsck_err(c, "incorrect key in freespace btree (got %s should be %s)\n"
1098                       "  %s",
1099                       bch2_bkey_types[k.k->type],
1100                       bch2_bkey_types[freespace_key_type],
1101                       (printbuf_reset(&buf),
1102                        bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf)))) {
1103                 struct bkey_i *update =
1104                         bch2_trans_kmalloc(trans, sizeof(*update));
1105
1106                 ret = PTR_ERR_OR_ZERO(update);
1107                 if (ret)
1108                         goto err;
1109
1110                 bkey_init(&update->k);
1111                 update->k.type  = freespace_key_type;
1112                 update->k.p     = freespace_iter->pos;
1113                 bch2_key_resize(&update->k, 1);
1114
1115                 ret = bch2_trans_update(trans, freespace_iter, update, 0);
1116                 if (ret)
1117                         goto err;
1118         }
1119
1120         bch2_btree_iter_set_pos(bucket_gens_iter, alloc_gens_pos(alloc_k.k->p, &gens_offset));
1121         k = bch2_btree_iter_peek_slot(bucket_gens_iter);
1122         ret = bkey_err(k);
1123         if (ret)
1124                 goto err;
1125
1126         if (a->gen != alloc_gen(k, gens_offset) &&
1127             (c->opts.reconstruct_alloc ||
1128              fsck_err(c, "incorrect gen in bucket_gens btree (got %u should be %u)\n"
1129                       "  %s",
1130                       alloc_gen(k, gens_offset), a->gen,
1131                       (printbuf_reset(&buf),
1132                        bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf)))) {
1133                 struct bkey_i_bucket_gens *g =
1134                         bch2_trans_kmalloc(trans, sizeof(*g));
1135
1136                 ret = PTR_ERR_OR_ZERO(g);
1137                 if (ret)
1138                         goto err;
1139
1140                 if (k.k->type == KEY_TYPE_bucket_gens) {
1141                         bkey_reassemble(&g->k_i, k);
1142                 } else {
1143                         bkey_bucket_gens_init(&g->k_i);
1144                         g->k.p = alloc_gens_pos(alloc_k.k->p, &gens_offset);
1145                 }
1146
1147                 g->v.gens[gens_offset] = a->gen;
1148
1149                 ret = bch2_trans_update(trans, bucket_gens_iter, &g->k_i, 0);
1150                 if (ret)
1151                         goto err;
1152         }
1153 err:
1154 fsck_err:
1155         printbuf_exit(&buf);
1156         return ret;
1157 }
1158
1159 static int bch2_check_alloc_hole_freespace(struct btree_trans *trans,
1160                                  struct bpos start,
1161                                  struct bpos *end,
1162                                  struct btree_iter *freespace_iter)
1163 {
1164         struct bch_fs *c = trans->c;
1165         struct bch_dev *ca;
1166         struct bkey_s_c k;
1167         struct printbuf buf = PRINTBUF;
1168         int ret;
1169
1170         ca = bch_dev_bkey_exists(c, start.inode);
1171         if (!ca->mi.freespace_initialized)
1172                 return 0;
1173
1174         bch2_btree_iter_set_pos(freespace_iter, start);
1175
1176         k = bch2_btree_iter_peek_slot(freespace_iter);
1177         ret = bkey_err(k);
1178         if (ret)
1179                 goto err;
1180
1181         *end = bkey_min(k.k->p, *end);
1182
1183         if (k.k->type != KEY_TYPE_set &&
1184             (c->opts.reconstruct_alloc ||
1185              fsck_err(c, "hole in alloc btree missing in freespace btree\n"
1186                       "  device %llu buckets %llu-%llu",
1187                       freespace_iter->pos.inode,
1188                       freespace_iter->pos.offset,
1189                       end->offset))) {
1190                 struct bkey_i *update =
1191                         bch2_trans_kmalloc(trans, sizeof(*update));
1192
1193                 ret = PTR_ERR_OR_ZERO(update);
1194                 if (ret)
1195                         goto err;
1196
1197                 bkey_init(&update->k);
1198                 update->k.type  = KEY_TYPE_set;
1199                 update->k.p     = freespace_iter->pos;
1200                 bch2_key_resize(&update->k,
1201                                 min_t(u64, U32_MAX, end->offset -
1202                                       freespace_iter->pos.offset));
1203
1204                 ret = bch2_trans_update(trans, freespace_iter, update, 0);
1205                 if (ret)
1206                         goto err;
1207         }
1208 err:
1209 fsck_err:
1210         printbuf_exit(&buf);
1211         return ret;
1212 }
1213
1214 static int bch2_check_alloc_hole_bucket_gens(struct btree_trans *trans,
1215                                  struct bpos start,
1216                                  struct bpos *end,
1217                                  struct btree_iter *bucket_gens_iter)
1218 {
1219         struct bch_fs *c = trans->c;
1220         struct bkey_s_c k;
1221         struct printbuf buf = PRINTBUF;
1222         unsigned i, gens_offset, gens_end_offset;
1223         int ret;
1224
1225         if (c->sb.version < bcachefs_metadata_version_bucket_gens &&
1226             !c->opts.version_upgrade)
1227                 return 0;
1228
1229         bch2_btree_iter_set_pos(bucket_gens_iter, alloc_gens_pos(start, &gens_offset));
1230
1231         k = bch2_btree_iter_peek_slot(bucket_gens_iter);
1232         ret = bkey_err(k);
1233         if (ret)
1234                 goto err;
1235
1236         if (bkey_cmp(alloc_gens_pos(start, &gens_offset),
1237                      alloc_gens_pos(*end,  &gens_end_offset)))
1238                 gens_end_offset = KEY_TYPE_BUCKET_GENS_NR;
1239
1240         if (k.k->type == KEY_TYPE_bucket_gens) {
1241                 struct bkey_i_bucket_gens g;
1242                 bool need_update = false;
1243
1244                 bkey_reassemble(&g.k_i, k);
1245
1246                 for (i = gens_offset; i < gens_end_offset; i++) {
1247                         if (fsck_err_on(g.v.gens[i], c,
1248                                         "hole in alloc btree at %llu:%llu with nonzero gen in bucket_gens btree (%u)",
1249                                         bucket_gens_pos_to_alloc(k.k->p, i).inode,
1250                                         bucket_gens_pos_to_alloc(k.k->p, i).offset,
1251                                         g.v.gens[i])) {
1252                                 g.v.gens[i] = 0;
1253                                 need_update = true;
1254                         }
1255                 }
1256
1257                 if (need_update) {
1258                         struct bkey_i *k = bch2_trans_kmalloc(trans, sizeof(g));
1259
1260                         ret = PTR_ERR_OR_ZERO(k);
1261                         if (ret)
1262                                 goto err;
1263
1264                         memcpy(k, &g, sizeof(g));
1265
1266                         ret = bch2_trans_update(trans, bucket_gens_iter, k, 0);
1267                         if (ret)
1268                                 goto err;
1269                 }
1270         }
1271
1272         *end = bkey_min(*end, bucket_gens_pos_to_alloc(bpos_nosnap_successor(k.k->p), 0));
1273 err:
1274 fsck_err:
1275         printbuf_exit(&buf);
1276         return ret;
1277 }
1278
1279 static int bch2_check_discard_freespace_key(struct btree_trans *trans,
1280                                             struct btree_iter *iter)
1281 {
1282         struct bch_fs *c = trans->c;
1283         struct btree_iter alloc_iter;
1284         struct bkey_s_c alloc_k;
1285         struct bch_alloc_v4 a_convert;
1286         const struct bch_alloc_v4 *a;
1287         u64 genbits;
1288         struct bpos pos;
1289         enum bch_data_type state = iter->btree_id == BTREE_ID_need_discard
1290                 ? BCH_DATA_need_discard
1291                 : BCH_DATA_free;
1292         struct printbuf buf = PRINTBUF;
1293         int ret;
1294
1295         pos = iter->pos;
1296         pos.offset &= ~(~0ULL << 56);
1297         genbits = iter->pos.offset & (~0ULL << 56);
1298
1299         bch2_trans_iter_init(trans, &alloc_iter, BTREE_ID_alloc, pos, 0);
1300
1301         if (fsck_err_on(!bch2_dev_bucket_exists(c, pos), c,
1302                         "entry in %s btree for nonexistant dev:bucket %llu:%llu",
1303                         bch2_btree_ids[iter->btree_id], pos.inode, pos.offset))
1304                 goto delete;
1305
1306         alloc_k = bch2_btree_iter_peek_slot(&alloc_iter);
1307         ret = bkey_err(alloc_k);
1308         if (ret)
1309                 goto err;
1310
1311         a = bch2_alloc_to_v4(alloc_k, &a_convert);
1312
1313         if (fsck_err_on(a->data_type != state ||
1314                         (state == BCH_DATA_free &&
1315                          genbits != alloc_freespace_genbits(*a)), c,
1316                         "%s\n  incorrectly set in %s index (free %u, genbits %llu should be %llu)",
1317                         (bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf),
1318                         bch2_btree_ids[iter->btree_id],
1319                         a->data_type == state,
1320                         genbits >> 56, alloc_freespace_genbits(*a) >> 56))
1321                 goto delete;
1322 out:
1323 err:
1324 fsck_err:
1325         bch2_trans_iter_exit(trans, &alloc_iter);
1326         printbuf_exit(&buf);
1327         return ret;
1328 delete:
1329         ret = bch2_btree_delete_extent_at(trans, iter,
1330                         iter->btree_id == BTREE_ID_freespace ? 1 : 0, 0);
1331         goto out;
1332 }
1333
1334 /*
1335  * We've already checked that generation numbers in the bucket_gens btree are
1336  * valid for buckets that exist; this just checks for keys for nonexistent
1337  * buckets.
1338  */
1339 static int bch2_check_bucket_gens_key(struct btree_trans *trans,
1340                                       struct btree_iter *iter,
1341                                       struct bkey_s_c k)
1342 {
1343         struct bch_fs *c = trans->c;
1344         struct bkey_i_bucket_gens g;
1345         struct bch_dev *ca;
1346         u64 start = bucket_gens_pos_to_alloc(k.k->p, 0).offset;
1347         u64 end = bucket_gens_pos_to_alloc(bpos_nosnap_successor(k.k->p), 0).offset;
1348         u64 b;
1349         bool need_update = false;
1350         struct printbuf buf = PRINTBUF;
1351         int ret = 0;
1352
1353         BUG_ON(k.k->type != KEY_TYPE_bucket_gens);
1354         bkey_reassemble(&g.k_i, k);
1355
1356         if (fsck_err_on(!bch2_dev_exists2(c, k.k->p.inode), c,
1357                         "bucket_gens key for invalid device:\n  %s",
1358                         (bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
1359                 ret = bch2_btree_delete_at(trans, iter, 0);
1360                 goto out;
1361         }
1362
1363         ca = bch_dev_bkey_exists(c, k.k->p.inode);
1364         if (fsck_err_on(end <= ca->mi.first_bucket ||
1365                         start >= ca->mi.nbuckets, c,
1366                         "bucket_gens key for invalid buckets:\n  %s",
1367                         (bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
1368                 ret = bch2_btree_delete_at(trans, iter, 0);
1369                 goto out;
1370         }
1371
1372         for (b = start; b < ca->mi.first_bucket; b++)
1373                 if (fsck_err_on(g.v.gens[b & KEY_TYPE_BUCKET_GENS_MASK], c,
1374                                 "bucket_gens key has nonzero gen for invalid bucket")) {
1375                         g.v.gens[b & KEY_TYPE_BUCKET_GENS_MASK] = 0;
1376                         need_update = true;
1377                 }
1378
1379         for (b = ca->mi.nbuckets; b < end; b++)
1380                 if (fsck_err_on(g.v.gens[b & KEY_TYPE_BUCKET_GENS_MASK], c,
1381                                 "bucket_gens key has nonzero gen for invalid bucket")) {
1382                         g.v.gens[b & KEY_TYPE_BUCKET_GENS_MASK] = 0;
1383                         need_update = true;
1384                 }
1385
1386         if (need_update) {
1387                 struct bkey_i *k;
1388
1389                 k = bch2_trans_kmalloc(trans, sizeof(g));
1390                 ret = PTR_ERR_OR_ZERO(k);
1391                 if (ret)
1392                         goto out;
1393
1394                 memcpy(k, &g, sizeof(g));
1395                 ret = bch2_trans_update(trans, iter, k, 0);
1396         }
1397 out:
1398 fsck_err:
1399         printbuf_exit(&buf);
1400         return ret;
1401 }
1402
1403 int bch2_check_alloc_info(struct bch_fs *c)
1404 {
1405         struct btree_trans trans;
1406         struct btree_iter iter, discard_iter, freespace_iter, bucket_gens_iter;
1407         struct bkey hole;
1408         struct bkey_s_c k;
1409         int ret = 0;
1410
1411         bch2_trans_init(&trans, c, 0, 0);
1412
1413         bch2_trans_iter_init(&trans, &iter, BTREE_ID_alloc, POS_MIN,
1414                              BTREE_ITER_PREFETCH);
1415         bch2_trans_iter_init(&trans, &discard_iter, BTREE_ID_need_discard, POS_MIN,
1416                              BTREE_ITER_PREFETCH);
1417         bch2_trans_iter_init(&trans, &freespace_iter, BTREE_ID_freespace, POS_MIN,
1418                              BTREE_ITER_PREFETCH);
1419         bch2_trans_iter_init(&trans, &bucket_gens_iter, BTREE_ID_bucket_gens, POS_MIN,
1420                              BTREE_ITER_PREFETCH);
1421
1422         while (1) {
1423                 struct bpos next;
1424
1425                 bch2_trans_begin(&trans);
1426
1427                 k = bch2_get_key_or_real_bucket_hole(&iter, &hole);
1428                 ret = bkey_err(k);
1429                 if (ret)
1430                         goto bkey_err;
1431
1432                 if (!k.k)
1433                         break;
1434
1435                 if (k.k->type) {
1436                         next = bpos_nosnap_successor(k.k->p);
1437
1438                         ret = bch2_check_alloc_key(&trans,
1439                                                    k, &iter,
1440                                                    &discard_iter,
1441                                                    &freespace_iter,
1442                                                    &bucket_gens_iter);
1443                         if (ret)
1444                                 goto bkey_err;
1445                 } else {
1446                         next = k.k->p;
1447
1448                         ret = bch2_check_alloc_hole_freespace(&trans,
1449                                                     bkey_start_pos(k.k),
1450                                                     &next,
1451                                                     &freespace_iter) ?:
1452                                 bch2_check_alloc_hole_bucket_gens(&trans,
1453                                                     bkey_start_pos(k.k),
1454                                                     &next,
1455                                                     &bucket_gens_iter);
1456                         if (ret)
1457                                 goto bkey_err;
1458                 }
1459
1460                 ret = bch2_trans_commit(&trans, NULL, NULL,
1461                                         BTREE_INSERT_NOFAIL|
1462                                         BTREE_INSERT_LAZY_RW);
1463                 if (ret)
1464                         goto bkey_err;
1465
1466                 bch2_btree_iter_set_pos(&iter, next);
1467 bkey_err:
1468                 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
1469                         continue;
1470                 if (ret)
1471                         break;
1472         }
1473         bch2_trans_iter_exit(&trans, &bucket_gens_iter);
1474         bch2_trans_iter_exit(&trans, &freespace_iter);
1475         bch2_trans_iter_exit(&trans, &discard_iter);
1476         bch2_trans_iter_exit(&trans, &iter);
1477
1478         if (ret < 0)
1479                 goto err;
1480
1481         ret = for_each_btree_key_commit(&trans, iter,
1482                         BTREE_ID_need_discard, POS_MIN,
1483                         BTREE_ITER_PREFETCH, k,
1484                         NULL, NULL, BTREE_INSERT_NOFAIL|BTREE_INSERT_LAZY_RW,
1485                 bch2_check_discard_freespace_key(&trans, &iter)) ?:
1486               for_each_btree_key_commit(&trans, iter,
1487                         BTREE_ID_freespace, POS_MIN,
1488                         BTREE_ITER_PREFETCH, k,
1489                         NULL, NULL, BTREE_INSERT_NOFAIL|BTREE_INSERT_LAZY_RW,
1490                 bch2_check_discard_freespace_key(&trans, &iter)) ?:
1491               for_each_btree_key_commit(&trans, iter,
1492                         BTREE_ID_bucket_gens, POS_MIN,
1493                         BTREE_ITER_PREFETCH, k,
1494                         NULL, NULL, BTREE_INSERT_NOFAIL|BTREE_INSERT_LAZY_RW,
1495                 bch2_check_bucket_gens_key(&trans, &iter, k));
1496 err:
1497         bch2_trans_exit(&trans);
1498         return ret < 0 ? ret : 0;
1499 }
1500
1501 static int bch2_check_alloc_to_lru_ref(struct btree_trans *trans,
1502                                        struct btree_iter *alloc_iter)
1503 {
1504         struct bch_fs *c = trans->c;
1505         struct btree_iter lru_iter;
1506         struct bch_alloc_v4 a_convert;
1507         const struct bch_alloc_v4 *a;
1508         struct bkey_s_c alloc_k, k;
1509         struct printbuf buf = PRINTBUF;
1510         struct printbuf buf2 = PRINTBUF;
1511         int ret;
1512
1513         alloc_k = bch2_btree_iter_peek(alloc_iter);
1514         if (!alloc_k.k)
1515                 return 0;
1516
1517         ret = bkey_err(alloc_k);
1518         if (ret)
1519                 return ret;
1520
1521         a = bch2_alloc_to_v4(alloc_k, &a_convert);
1522
1523         if (a->data_type != BCH_DATA_cached)
1524                 return 0;
1525
1526         bch2_trans_iter_init(trans, &lru_iter, BTREE_ID_lru,
1527                              POS(alloc_k.k->p.inode, a->io_time[READ]), 0);
1528
1529         k = bch2_btree_iter_peek_slot(&lru_iter);
1530         ret = bkey_err(k);
1531         if (ret)
1532                 goto err;
1533
1534         if (fsck_err_on(!a->io_time[READ], c,
1535                         "cached bucket with read_time 0\n"
1536                         "  %s",
1537                 (printbuf_reset(&buf),
1538                  bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf)) ||
1539             fsck_err_on(k.k->type != KEY_TYPE_lru ||
1540                         le64_to_cpu(bkey_s_c_to_lru(k).v->idx) != alloc_k.k->p.offset, c,
1541                         "incorrect/missing lru entry\n"
1542                         "  %s\n"
1543                         "  %s",
1544                         (printbuf_reset(&buf),
1545                          bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf),
1546                         (bch2_bkey_val_to_text(&buf2, c, k), buf2.buf))) {
1547                 u64 read_time = a->io_time[READ] ?:
1548                         atomic64_read(&c->io_clock[READ].now);
1549
1550                 ret = bch2_lru_set(trans,
1551                                    alloc_k.k->p.inode,
1552                                    alloc_k.k->p.offset,
1553                                    &read_time);
1554                 if (ret)
1555                         goto err;
1556
1557                 if (a->io_time[READ] != read_time) {
1558                         struct bkey_i_alloc_v4 *a_mut =
1559                                 bch2_alloc_to_v4_mut(trans, alloc_k);
1560                         ret = PTR_ERR_OR_ZERO(a_mut);
1561                         if (ret)
1562                                 goto err;
1563
1564                         a_mut->v.io_time[READ] = read_time;
1565                         ret = bch2_trans_update(trans, alloc_iter,
1566                                                 &a_mut->k_i, BTREE_TRIGGER_NORUN);
1567                         if (ret)
1568                                 goto err;
1569                 }
1570         }
1571 err:
1572 fsck_err:
1573         bch2_trans_iter_exit(trans, &lru_iter);
1574         printbuf_exit(&buf2);
1575         printbuf_exit(&buf);
1576         return ret;
1577 }
1578
1579 int bch2_check_alloc_to_lru_refs(struct bch_fs *c)
1580 {
1581         struct btree_trans trans;
1582         struct btree_iter iter;
1583         struct bkey_s_c k;
1584         int ret = 0;
1585
1586         bch2_trans_init(&trans, c, 0, 0);
1587
1588         for_each_btree_key_commit(&trans, iter, BTREE_ID_alloc,
1589                         POS_MIN, BTREE_ITER_PREFETCH, k,
1590                         NULL, NULL, BTREE_INSERT_NOFAIL|BTREE_INSERT_LAZY_RW,
1591                 bch2_check_alloc_to_lru_ref(&trans, &iter));
1592
1593         bch2_trans_exit(&trans);
1594         return ret < 0 ? ret : 0;
1595 }
1596
1597 static int bch2_discard_one_bucket(struct btree_trans *trans,
1598                                    struct btree_iter *need_discard_iter,
1599                                    struct bpos *discard_pos_done,
1600                                    u64 *seen,
1601                                    u64 *open,
1602                                    u64 *need_journal_commit,
1603                                    u64 *discarded)
1604 {
1605         struct bch_fs *c = trans->c;
1606         struct bpos pos = need_discard_iter->pos;
1607         struct btree_iter iter = { NULL };
1608         struct bkey_s_c k;
1609         struct bch_dev *ca;
1610         struct bkey_i_alloc_v4 *a;
1611         struct printbuf buf = PRINTBUF;
1612         bool did_discard = false;
1613         int ret = 0;
1614
1615         ca = bch_dev_bkey_exists(c, pos.inode);
1616         if (!percpu_ref_tryget(&ca->io_ref)) {
1617                 bch2_btree_iter_set_pos(need_discard_iter, POS(pos.inode + 1, 0));
1618                 return 0;
1619         }
1620
1621         if (bch2_bucket_is_open_safe(c, pos.inode, pos.offset)) {
1622                 (*open)++;
1623                 goto out;
1624         }
1625
1626         if (bch2_bucket_needs_journal_commit(&c->buckets_waiting_for_journal,
1627                         c->journal.flushed_seq_ondisk,
1628                         pos.inode, pos.offset)) {
1629                 (*need_journal_commit)++;
1630                 goto out;
1631         }
1632
1633         bch2_trans_iter_init(trans, &iter, BTREE_ID_alloc,
1634                              need_discard_iter->pos,
1635                              BTREE_ITER_CACHED);
1636         k = bch2_btree_iter_peek_slot(&iter);
1637         ret = bkey_err(k);
1638         if (ret)
1639                 goto out;
1640
1641         a = bch2_alloc_to_v4_mut(trans, k);
1642         ret = PTR_ERR_OR_ZERO(a);
1643         if (ret)
1644                 goto out;
1645
1646         if (BCH_ALLOC_V4_NEED_INC_GEN(&a->v)) {
1647                 a->v.gen++;
1648                 SET_BCH_ALLOC_V4_NEED_INC_GEN(&a->v, false);
1649                 goto write;
1650         }
1651
1652         if (bch2_trans_inconsistent_on(a->v.journal_seq > c->journal.flushed_seq_ondisk, trans,
1653                         "clearing need_discard but journal_seq %llu > flushed_seq %llu\n"
1654                         "%s",
1655                         a->v.journal_seq,
1656                         c->journal.flushed_seq_ondisk,
1657                         (bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
1658                 ret = -EIO;
1659                 goto out;
1660         }
1661
1662         if (bch2_trans_inconsistent_on(a->v.data_type != BCH_DATA_need_discard, trans,
1663                         "bucket incorrectly set in need_discard btree\n"
1664                         "%s",
1665                         (bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
1666                 ret = -EIO;
1667                 goto out;
1668         }
1669
1670         if (!bkey_eq(*discard_pos_done, iter.pos) &&
1671             ca->mi.discard && !c->opts.nochanges) {
1672                 /*
1673                  * This works without any other locks because this is the only
1674                  * thread that removes items from the need_discard tree
1675                  */
1676                 bch2_trans_unlock(trans);
1677                 blkdev_issue_discard(ca->disk_sb.bdev,
1678                                      k.k->p.offset * ca->mi.bucket_size,
1679                                      ca->mi.bucket_size,
1680                                      GFP_KERNEL);
1681
1682                 ret = bch2_trans_relock(trans);
1683                 if (ret)
1684                         goto out;
1685         }
1686
1687         *discard_pos_done = iter.pos;
1688         did_discard = true;
1689
1690         SET_BCH_ALLOC_V4_NEED_DISCARD(&a->v, false);
1691         a->v.data_type = alloc_data_type(a->v, a->v.data_type);
1692 write:
1693         ret =   bch2_trans_update(trans, &iter, &a->k_i, 0) ?:
1694                 bch2_trans_commit(trans, NULL, NULL,
1695                                   BTREE_INSERT_USE_RESERVE|BTREE_INSERT_NOFAIL);
1696         if (ret)
1697                 goto out;
1698
1699         if (did_discard) {
1700                 this_cpu_inc(c->counters[BCH_COUNTER_bucket_discard]);
1701                 (*discarded)++;
1702         }
1703 out:
1704         bch2_trans_iter_exit(trans, &iter);
1705         percpu_ref_put(&ca->io_ref);
1706         printbuf_exit(&buf);
1707         return ret;
1708 }
1709
1710 static void bch2_do_discards_work(struct work_struct *work)
1711 {
1712         struct bch_fs *c = container_of(work, struct bch_fs, discard_work);
1713         struct btree_trans trans;
1714         struct btree_iter iter;
1715         struct bkey_s_c k;
1716         u64 seen = 0, open = 0, need_journal_commit = 0, discarded = 0;
1717         struct bpos discard_pos_done = POS_MAX;
1718         int ret;
1719
1720         bch2_trans_init(&trans, c, 0, 0);
1721
1722         /*
1723          * We're doing the commit in bch2_discard_one_bucket instead of using
1724          * for_each_btree_key_commit() so that we can increment counters after
1725          * successful commit:
1726          */
1727         ret = for_each_btree_key2(&trans, iter,
1728                         BTREE_ID_need_discard, POS_MIN, 0, k,
1729                 bch2_discard_one_bucket(&trans, &iter, &discard_pos_done,
1730                                         &seen,
1731                                         &open,
1732                                         &need_journal_commit,
1733                                         &discarded));
1734
1735         bch2_trans_exit(&trans);
1736
1737         if (need_journal_commit * 2 > seen)
1738                 bch2_journal_flush_async(&c->journal, NULL);
1739
1740         percpu_ref_put(&c->writes);
1741
1742         trace_discard_buckets(c, seen, open, need_journal_commit, discarded,
1743                               bch2_err_str(ret));
1744 }
1745
1746 void bch2_do_discards(struct bch_fs *c)
1747 {
1748         if (percpu_ref_tryget_live(&c->writes) &&
1749             !queue_work(system_long_wq, &c->discard_work))
1750                 percpu_ref_put(&c->writes);
1751 }
1752
1753 static int invalidate_one_bucket(struct btree_trans *trans,
1754                                  struct btree_iter *lru_iter, struct bkey_s_c k,
1755                                  unsigned dev_idx, s64 *nr_to_invalidate)
1756 {
1757         struct bch_fs *c = trans->c;
1758         struct btree_iter alloc_iter = { NULL };
1759         struct bkey_i_alloc_v4 *a;
1760         struct bpos bucket;
1761         struct printbuf buf = PRINTBUF;
1762         unsigned cached_sectors;
1763         int ret = 0;
1764
1765         if (*nr_to_invalidate <= 0 || k.k->p.inode != dev_idx)
1766                 return 1;
1767
1768         if (k.k->type != KEY_TYPE_lru) {
1769                 prt_printf(&buf, "non lru key in lru btree:\n  ");
1770                 bch2_bkey_val_to_text(&buf, c, k);
1771
1772                 if (!test_bit(BCH_FS_CHECK_LRUS_DONE, &c->flags)) {
1773                         bch_err(c, "%s", buf.buf);
1774                 } else {
1775                         bch2_trans_inconsistent(trans, "%s", buf.buf);
1776                         ret = -EINVAL;
1777                 }
1778
1779                 goto out;
1780         }
1781
1782         bucket = POS(dev_idx, le64_to_cpu(bkey_s_c_to_lru(k).v->idx));
1783
1784         a = bch2_trans_start_alloc_update(trans, &alloc_iter, bucket);
1785         ret = PTR_ERR_OR_ZERO(a);
1786         if (ret)
1787                 goto out;
1788
1789         if (k.k->p.offset != alloc_lru_idx(a->v)) {
1790                 prt_printf(&buf, "alloc key does not point back to lru entry when invalidating bucket:\n  ");
1791                 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&a->k_i));
1792                 prt_printf(&buf, "\n  ");
1793                 bch2_bkey_val_to_text(&buf, c, k);
1794
1795                 if (!test_bit(BCH_FS_CHECK_LRUS_DONE, &c->flags)) {
1796                         bch_err(c, "%s", buf.buf);
1797                 } else {
1798                         bch2_trans_inconsistent(trans, "%s", buf.buf);
1799                         ret = -EINVAL;
1800                 }
1801
1802                 goto out;
1803         }
1804
1805         if (!a->v.cached_sectors)
1806                 bch_err(c, "invalidating empty bucket, confused");
1807
1808         cached_sectors = a->v.cached_sectors;
1809
1810         SET_BCH_ALLOC_V4_NEED_INC_GEN(&a->v, false);
1811         a->v.gen++;
1812         a->v.data_type          = 0;
1813         a->v.dirty_sectors      = 0;
1814         a->v.cached_sectors     = 0;
1815         a->v.io_time[READ]      = atomic64_read(&c->io_clock[READ].now);
1816         a->v.io_time[WRITE]     = atomic64_read(&c->io_clock[WRITE].now);
1817
1818         ret =   bch2_trans_update(trans, &alloc_iter, &a->k_i,
1819                                 BTREE_TRIGGER_BUCKET_INVALIDATE) ?:
1820                 bch2_trans_commit(trans, NULL, NULL,
1821                                   BTREE_INSERT_USE_RESERVE|BTREE_INSERT_NOFAIL);
1822         if (ret)
1823                 goto out;
1824
1825         trace_and_count(c, bucket_invalidate, c, bucket.inode, bucket.offset, cached_sectors);
1826         --*nr_to_invalidate;
1827 out:
1828         bch2_trans_iter_exit(trans, &alloc_iter);
1829         printbuf_exit(&buf);
1830         return ret;
1831 }
1832
1833 static void bch2_do_invalidates_work(struct work_struct *work)
1834 {
1835         struct bch_fs *c = container_of(work, struct bch_fs, invalidate_work);
1836         struct bch_dev *ca;
1837         struct btree_trans trans;
1838         struct btree_iter iter;
1839         struct bkey_s_c k;
1840         unsigned i;
1841         int ret = 0;
1842
1843         bch2_trans_init(&trans, c, 0, 0);
1844
1845         for_each_member_device(ca, c, i) {
1846                 s64 nr_to_invalidate =
1847                         should_invalidate_buckets(ca, bch2_dev_usage_read(ca));
1848
1849                 ret = for_each_btree_key2(&trans, iter, BTREE_ID_lru,
1850                                 POS(ca->dev_idx, 0), BTREE_ITER_INTENT, k,
1851                         invalidate_one_bucket(&trans, &iter, k, ca->dev_idx, &nr_to_invalidate));
1852
1853                 if (ret < 0) {
1854                         percpu_ref_put(&ca->ref);
1855                         break;
1856                 }
1857         }
1858
1859         bch2_trans_exit(&trans);
1860         percpu_ref_put(&c->writes);
1861 }
1862
1863 void bch2_do_invalidates(struct bch_fs *c)
1864 {
1865         if (percpu_ref_tryget_live(&c->writes) &&
1866             !queue_work(system_long_wq, &c->invalidate_work))
1867                 percpu_ref_put(&c->writes);
1868 }
1869
1870 static int bch2_dev_freespace_init(struct bch_fs *c, struct bch_dev *ca)
1871 {
1872         struct btree_trans trans;
1873         struct btree_iter iter;
1874         struct bkey_s_c k;
1875         struct bkey hole;
1876         struct bpos end = POS(ca->dev_idx, ca->mi.nbuckets);
1877         struct bch_member *m;
1878         int ret;
1879
1880         bch2_trans_init(&trans, c, 0, 0);
1881
1882         bch2_trans_iter_init(&trans, &iter, BTREE_ID_alloc,
1883                              POS(ca->dev_idx, ca->mi.first_bucket),
1884                              BTREE_ITER_PREFETCH);
1885         /*
1886          * Scan the alloc btree for every bucket on @ca, and add buckets to the
1887          * freespace/need_discard/need_gc_gens btrees as needed:
1888          */
1889         while (1) {
1890                 bch2_trans_begin(&trans);
1891
1892                 if (bkey_ge(iter.pos, end)) {
1893                         ret = 0;
1894                         break;
1895                 }
1896
1897                 k = bch2_get_key_or_hole(&iter, end, &hole);
1898                 ret = bkey_err(k);
1899                 if (ret)
1900                         goto bkey_err;
1901
1902                 if (k.k->type) {
1903                         /*
1904                          * We process live keys in the alloc btree one at a
1905                          * time:
1906                          */
1907                         struct bch_alloc_v4 a_convert;
1908                         const struct bch_alloc_v4 *a = bch2_alloc_to_v4(k, &a_convert);
1909
1910                         ret =   bch2_bucket_do_index(&trans, k, a, true) ?:
1911                                 bch2_trans_commit(&trans, NULL, NULL,
1912                                                   BTREE_INSERT_LAZY_RW|
1913                                                   BTREE_INSERT_NOFAIL);
1914                         if (ret)
1915                                 goto bkey_err;
1916
1917                         bch2_btree_iter_advance(&iter);
1918                 } else {
1919                         struct bkey_i *freespace;
1920
1921                         freespace = bch2_trans_kmalloc(&trans, sizeof(*freespace));
1922                         ret = PTR_ERR_OR_ZERO(freespace);
1923                         if (ret)
1924                                 goto bkey_err;
1925
1926                         bkey_init(&freespace->k);
1927                         freespace->k.type       = KEY_TYPE_set;
1928                         freespace->k.p          = k.k->p;
1929                         freespace->k.size       = k.k->size;
1930
1931                         ret = __bch2_btree_insert(&trans, BTREE_ID_freespace, freespace) ?:
1932                                 bch2_trans_commit(&trans, NULL, NULL,
1933                                                   BTREE_INSERT_LAZY_RW|
1934                                                   BTREE_INSERT_NOFAIL);
1935                         if (ret)
1936                                 goto bkey_err;
1937
1938                         bch2_btree_iter_set_pos(&iter, k.k->p);
1939                 }
1940 bkey_err:
1941                 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
1942                         continue;
1943                 if (ret)
1944                         break;
1945         }
1946
1947         bch2_trans_iter_exit(&trans, &iter);
1948         bch2_trans_exit(&trans);
1949
1950         if (ret < 0) {
1951                 bch_err(ca, "error initializing free space: %s", bch2_err_str(ret));
1952                 return ret;
1953         }
1954
1955         mutex_lock(&c->sb_lock);
1956         m = bch2_sb_get_members(c->disk_sb.sb)->members + ca->dev_idx;
1957         SET_BCH_MEMBER_FREESPACE_INITIALIZED(m, true);
1958         mutex_unlock(&c->sb_lock);
1959
1960         return 0;
1961 }
1962
1963 int bch2_fs_freespace_init(struct bch_fs *c)
1964 {
1965         struct bch_dev *ca;
1966         unsigned i;
1967         int ret = 0;
1968         bool doing_init = false;
1969
1970         /*
1971          * We can crash during the device add path, so we need to check this on
1972          * every mount:
1973          */
1974
1975         for_each_member_device(ca, c, i) {
1976                 if (ca->mi.freespace_initialized)
1977                         continue;
1978
1979                 if (!doing_init) {
1980                         bch_info(c, "initializing freespace");
1981                         doing_init = true;
1982                 }
1983
1984                 ret = bch2_dev_freespace_init(c, ca);
1985                 if (ret) {
1986                         percpu_ref_put(&ca->ref);
1987                         return ret;
1988                 }
1989         }
1990
1991         if (doing_init) {
1992                 mutex_lock(&c->sb_lock);
1993                 bch2_write_super(c);
1994                 mutex_unlock(&c->sb_lock);
1995
1996                 bch_verbose(c, "done initializing freespace");
1997         }
1998
1999         return ret;
2000 }
2001
2002 /* Bucket IO clocks: */
2003
2004 int bch2_bucket_io_time_reset(struct btree_trans *trans, unsigned dev,
2005                               size_t bucket_nr, int rw)
2006 {
2007         struct bch_fs *c = trans->c;
2008         struct btree_iter iter;
2009         struct bkey_i_alloc_v4 *a;
2010         u64 now;
2011         int ret = 0;
2012
2013         a = bch2_trans_start_alloc_update(trans, &iter,  POS(dev, bucket_nr));
2014         ret = PTR_ERR_OR_ZERO(a);
2015         if (ret)
2016                 return ret;
2017
2018         now = atomic64_read(&c->io_clock[rw].now);
2019         if (a->v.io_time[rw] == now)
2020                 goto out;
2021
2022         a->v.io_time[rw] = now;
2023
2024         ret   = bch2_trans_update(trans, &iter, &a->k_i, 0) ?:
2025                 bch2_trans_commit(trans, NULL, NULL, 0);
2026 out:
2027         bch2_trans_iter_exit(trans, &iter);
2028         return ret;
2029 }
2030
2031 /* Startup/shutdown (ro/rw): */
2032
2033 void bch2_recalc_capacity(struct bch_fs *c)
2034 {
2035         struct bch_dev *ca;
2036         u64 capacity = 0, reserved_sectors = 0, gc_reserve;
2037         unsigned bucket_size_max = 0;
2038         unsigned long ra_pages = 0;
2039         unsigned i;
2040
2041         lockdep_assert_held(&c->state_lock);
2042
2043         for_each_online_member(ca, c, i) {
2044                 struct backing_dev_info *bdi = ca->disk_sb.bdev->bd_disk->bdi;
2045
2046                 ra_pages += bdi->ra_pages;
2047         }
2048
2049         bch2_set_ra_pages(c, ra_pages);
2050
2051         for_each_rw_member(ca, c, i) {
2052                 u64 dev_reserve = 0;
2053
2054                 /*
2055                  * We need to reserve buckets (from the number
2056                  * of currently available buckets) against
2057                  * foreground writes so that mainly copygc can
2058                  * make forward progress.
2059                  *
2060                  * We need enough to refill the various reserves
2061                  * from scratch - copygc will use its entire
2062                  * reserve all at once, then run against when
2063                  * its reserve is refilled (from the formerly
2064                  * available buckets).
2065                  *
2066                  * This reserve is just used when considering if
2067                  * allocations for foreground writes must wait -
2068                  * not -ENOSPC calculations.
2069                  */
2070
2071                 dev_reserve += ca->nr_btree_reserve * 2;
2072                 dev_reserve += ca->mi.nbuckets >> 6; /* copygc reserve */
2073
2074                 dev_reserve += 1;       /* btree write point */
2075                 dev_reserve += 1;       /* copygc write point */
2076                 dev_reserve += 1;       /* rebalance write point */
2077
2078                 dev_reserve *= ca->mi.bucket_size;
2079
2080                 capacity += bucket_to_sector(ca, ca->mi.nbuckets -
2081                                              ca->mi.first_bucket);
2082
2083                 reserved_sectors += dev_reserve * 2;
2084
2085                 bucket_size_max = max_t(unsigned, bucket_size_max,
2086                                         ca->mi.bucket_size);
2087         }
2088
2089         gc_reserve = c->opts.gc_reserve_bytes
2090                 ? c->opts.gc_reserve_bytes >> 9
2091                 : div64_u64(capacity * c->opts.gc_reserve_percent, 100);
2092
2093         reserved_sectors = max(gc_reserve, reserved_sectors);
2094
2095         reserved_sectors = min(reserved_sectors, capacity);
2096
2097         c->capacity = capacity - reserved_sectors;
2098
2099         c->bucket_size_max = bucket_size_max;
2100
2101         /* Wake up case someone was waiting for buckets */
2102         closure_wake_up(&c->freelist_wait);
2103 }
2104
2105 static bool bch2_dev_has_open_write_point(struct bch_fs *c, struct bch_dev *ca)
2106 {
2107         struct open_bucket *ob;
2108         bool ret = false;
2109
2110         for (ob = c->open_buckets;
2111              ob < c->open_buckets + ARRAY_SIZE(c->open_buckets);
2112              ob++) {
2113                 spin_lock(&ob->lock);
2114                 if (ob->valid && !ob->on_partial_list &&
2115                     ob->dev == ca->dev_idx)
2116                         ret = true;
2117                 spin_unlock(&ob->lock);
2118         }
2119
2120         return ret;
2121 }
2122
2123 /* device goes ro: */
2124 void bch2_dev_allocator_remove(struct bch_fs *c, struct bch_dev *ca)
2125 {
2126         unsigned i;
2127
2128         /* First, remove device from allocation groups: */
2129
2130         for (i = 0; i < ARRAY_SIZE(c->rw_devs); i++)
2131                 clear_bit(ca->dev_idx, c->rw_devs[i].d);
2132
2133         /*
2134          * Capacity is calculated based off of devices in allocation groups:
2135          */
2136         bch2_recalc_capacity(c);
2137
2138         /* Next, close write points that point to this device... */
2139         for (i = 0; i < ARRAY_SIZE(c->write_points); i++)
2140                 bch2_writepoint_stop(c, ca, &c->write_points[i]);
2141
2142         bch2_writepoint_stop(c, ca, &c->copygc_write_point);
2143         bch2_writepoint_stop(c, ca, &c->rebalance_write_point);
2144         bch2_writepoint_stop(c, ca, &c->btree_write_point);
2145
2146         mutex_lock(&c->btree_reserve_cache_lock);
2147         while (c->btree_reserve_cache_nr) {
2148                 struct btree_alloc *a =
2149                         &c->btree_reserve_cache[--c->btree_reserve_cache_nr];
2150
2151                 bch2_open_buckets_put(c, &a->ob);
2152         }
2153         mutex_unlock(&c->btree_reserve_cache_lock);
2154
2155         while (1) {
2156                 struct open_bucket *ob;
2157
2158                 spin_lock(&c->freelist_lock);
2159                 if (!ca->open_buckets_partial_nr) {
2160                         spin_unlock(&c->freelist_lock);
2161                         break;
2162                 }
2163                 ob = c->open_buckets +
2164                         ca->open_buckets_partial[--ca->open_buckets_partial_nr];
2165                 ob->on_partial_list = false;
2166                 spin_unlock(&c->freelist_lock);
2167
2168                 bch2_open_bucket_put(c, ob);
2169         }
2170
2171         bch2_ec_stop_dev(c, ca);
2172
2173         /*
2174          * Wake up threads that were blocked on allocation, so they can notice
2175          * the device can no longer be removed and the capacity has changed:
2176          */
2177         closure_wake_up(&c->freelist_wait);
2178
2179         /*
2180          * journal_res_get() can block waiting for free space in the journal -
2181          * it needs to notice there may not be devices to allocate from anymore:
2182          */
2183         wake_up(&c->journal.wait);
2184
2185         /* Now wait for any in flight writes: */
2186
2187         closure_wait_event(&c->open_buckets_wait,
2188                            !bch2_dev_has_open_write_point(c, ca));
2189 }
2190
2191 /* device goes rw: */
2192 void bch2_dev_allocator_add(struct bch_fs *c, struct bch_dev *ca)
2193 {
2194         unsigned i;
2195
2196         for (i = 0; i < ARRAY_SIZE(c->rw_devs); i++)
2197                 if (ca->mi.data_allowed & (1 << i))
2198                         set_bit(ca->dev_idx, c->rw_devs[i].d);
2199 }
2200
2201 void bch2_fs_allocator_background_init(struct bch_fs *c)
2202 {
2203         spin_lock_init(&c->freelist_lock);
2204         INIT_WORK(&c->discard_work, bch2_do_discards_work);
2205         INIT_WORK(&c->invalidate_work, bch2_do_invalidates_work);
2206 }