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

   1 // SPDX-License-Identifier: GPL-2.0
   2
   3 #include "bcachefs.h"
   4 #include "bkey_methods.h"
   5 #include "bkey_sort.h"
   6 #include "btree_cache.h"
   7 #include "btree_io.h"
   8 #include "btree_iter.h"
   9 #include "btree_locking.h"
  10 #include "btree_update.h"
  11 #include "btree_update_interior.h"
  12 #include "buckets.h"
  13 #include "checksum.h"
  14 #include "debug.h"
  15 #include "error.h"
  16 #include "extents.h"
  17 #include "io_write.h"
  18 #include "journal_reclaim.h"
  19 #include "journal_seq_blacklist.h"
  20 #include "recovery.h"
  21 #include "super-io.h"
  22 #include "trace.h"
  23
  24 #include <linux/sched/mm.h>
  25
  26 void bch2_btree_node_io_unlock(struct btree *b)
  27 {
  28         EBUG_ON(!btree_node_write_in_flight(b));
  29
  30         clear_btree_node_write_in_flight_inner(b);
  31         clear_btree_node_write_in_flight(b);
  32         wake_up_bit(&b->flags, BTREE_NODE_write_in_flight);
  33 }
  34
  35 void bch2_btree_node_io_lock(struct btree *b)
  36 {
  37         bch2_assert_btree_nodes_not_locked();
  38
  39         wait_on_bit_lock_io(&b->flags, BTREE_NODE_write_in_flight,
  40                             TASK_UNINTERRUPTIBLE);
  41 }
  42
  43 void __bch2_btree_node_wait_on_read(struct btree *b)
  44 {
  45         wait_on_bit_io(&b->flags, BTREE_NODE_read_in_flight,
  46                        TASK_UNINTERRUPTIBLE);
  47 }
  48
  49 void __bch2_btree_node_wait_on_write(struct btree *b)
  50 {
  51         wait_on_bit_io(&b->flags, BTREE_NODE_write_in_flight,
  52                        TASK_UNINTERRUPTIBLE);
  53 }
  54
  55 void bch2_btree_node_wait_on_read(struct btree *b)
  56 {
  57         bch2_assert_btree_nodes_not_locked();
  58
  59         wait_on_bit_io(&b->flags, BTREE_NODE_read_in_flight,
  60                        TASK_UNINTERRUPTIBLE);
  61 }
  62
  63 void bch2_btree_node_wait_on_write(struct btree *b)
  64 {
  65         bch2_assert_btree_nodes_not_locked();
  66
  67         wait_on_bit_io(&b->flags, BTREE_NODE_write_in_flight,
  68                        TASK_UNINTERRUPTIBLE);
  69 }
  70
  71 static void verify_no_dups(struct btree *b,
  72                            struct bkey_packed *start,
  73                            struct bkey_packed *end)
  74 {
  75 #ifdef CONFIG_BCACHEFS_DEBUG
  76         struct bkey_packed *k, *p;
  77
  78         if (start == end)
  79                 return;
  80
  81         for (p = start, k = bkey_p_next(start);
  82              k != end;
  83              p = k, k = bkey_p_next(k)) {
  84                 struct bkey l = bkey_unpack_key(b, p);
  85                 struct bkey r = bkey_unpack_key(b, k);
  86
  87                 BUG_ON(bpos_ge(l.p, bkey_start_pos(&r)));
  88         }
  89 #endif
  90 }
  91
  92 static void set_needs_whiteout(struct bset *i, int v)
  93 {
  94         struct bkey_packed *k;
  95
  96         for (k = i->start; k != vstruct_last(i); k = bkey_p_next(k))
  97                 k->needs_whiteout = v;
  98 }
  99
 100 static void btree_bounce_free(struct bch_fs *c, size_t size,
 101                               bool used_mempool, void *p)
 102 {
 103         if (used_mempool)
 104                 mempool_free(p, &c->btree_bounce_pool);
 105         else
 106                 vpfree(p, size);
 107 }
 108
 109 static void *btree_bounce_alloc(struct bch_fs *c, size_t size,
 110                                 bool *used_mempool)
 111 {
 112         unsigned flags = memalloc_nofs_save();
 113         void *p;
 114
 115         BUG_ON(size > btree_bytes(c));
 116
 117         *used_mempool = false;
 118         p = vpmalloc(size, __GFP_NOWARN|GFP_NOWAIT);
 119         if (!p) {
 120                 *used_mempool = true;
 121                 p = mempool_alloc(&c->btree_bounce_pool, GFP_NOFS);
 122         }
 123         memalloc_nofs_restore(flags);
 124         return p;
 125 }
 126
 127 static void sort_bkey_ptrs(const struct btree *bt,
 128                            struct bkey_packed **ptrs, unsigned nr)
 129 {
 130         unsigned n = nr, a = nr / 2, b, c, d;
 131
 132         if (!a)
 133                 return;
 134
 135         /* Heap sort: see lib/sort.c: */
 136         while (1) {
 137                 if (a)
 138                         a--;
 139                 else if (--n)
 140                         swap(ptrs[0], ptrs[n]);
 141                 else
 142                         break;
 143
 144                 for (b = a; c = 2 * b + 1, (d = c + 1) < n;)
 145                         b = bch2_bkey_cmp_packed(bt,
 146                                             ptrs[c],
 147                                             ptrs[d]) >= 0 ? c : d;
 148                 if (d == n)
 149                         b = c;
 150
 151                 while (b != a &&
 152                        bch2_bkey_cmp_packed(bt,
 153                                        ptrs[a],
 154                                        ptrs[b]) >= 0)
 155                         b = (b - 1) / 2;
 156                 c = b;
 157                 while (b != a) {
 158                         b = (b - 1) / 2;
 159                         swap(ptrs[b], ptrs[c]);
 160                 }
 161         }
 162 }
 163
 164 static void bch2_sort_whiteouts(struct bch_fs *c, struct btree *b)
 165 {
 166         struct bkey_packed *new_whiteouts, **ptrs, **ptrs_end, *k;
 167         bool used_mempool = false;
 168         size_t bytes = b->whiteout_u64s * sizeof(u64);
 169
 170         if (!b->whiteout_u64s)
 171                 return;
 172
 173         new_whiteouts = btree_bounce_alloc(c, bytes, &used_mempool);
 174
 175         ptrs = ptrs_end = ((void *) new_whiteouts + bytes);
 176
 177         for (k = unwritten_whiteouts_start(c, b);
 178              k != unwritten_whiteouts_end(c, b);
 179              k = bkey_p_next(k))
 180                 *--ptrs = k;
 181
 182         sort_bkey_ptrs(b, ptrs, ptrs_end - ptrs);
 183
 184         k = new_whiteouts;
 185
 186         while (ptrs != ptrs_end) {
 187                 bkey_p_copy(k, *ptrs);
 188                 k = bkey_p_next(k);
 189                 ptrs++;
 190         }
 191
 192         verify_no_dups(b, new_whiteouts,
 193                        (void *) ((u64 *) new_whiteouts + b->whiteout_u64s));
 194
 195         memcpy_u64s(unwritten_whiteouts_start(c, b),
 196                     new_whiteouts, b->whiteout_u64s);
 197
 198         btree_bounce_free(c, bytes, used_mempool, new_whiteouts);
 199 }
 200
 201 static bool should_compact_bset(struct btree *b, struct bset_tree *t,
 202                                 bool compacting, enum compact_mode mode)
 203 {
 204         if (!bset_dead_u64s(b, t))
 205                 return false;
 206
 207         switch (mode) {
 208         case COMPACT_LAZY:
 209                 return should_compact_bset_lazy(b, t) ||
 210                         (compacting && !bset_written(b, bset(b, t)));
 211         case COMPACT_ALL:
 212                 return true;
 213         default:
 214                 BUG();
 215         }
 216 }
 217
 218 static bool bch2_drop_whiteouts(struct btree *b, enum compact_mode mode)
 219 {
 220         struct bset_tree *t;
 221         bool ret = false;
 222
 223         for_each_bset(b, t) {
 224                 struct bset *i = bset(b, t);
 225                 struct bkey_packed *k, *n, *out, *start, *end;
 226                 struct btree_node_entry *src = NULL, *dst = NULL;
 227
 228                 if (t != b->set && !bset_written(b, i)) {
 229                         src = container_of(i, struct btree_node_entry, keys);
 230                         dst = max(write_block(b),
 231                                   (void *) btree_bkey_last(b, t - 1));
 232                 }
 233
 234                 if (src != dst)
 235                         ret = true;
 236
 237                 if (!should_compact_bset(b, t, ret, mode)) {
 238                         if (src != dst) {
 239                                 memmove(dst, src, sizeof(*src) +
 240                                         le16_to_cpu(src->keys.u64s) *
 241                                         sizeof(u64));
 242                                 i = &dst->keys;
 243                                 set_btree_bset(b, t, i);
 244                         }
 245                         continue;
 246                 }
 247
 248                 start   = btree_bkey_first(b, t);
 249                 end     = btree_bkey_last(b, t);
 250
 251                 if (src != dst) {
 252                         memmove(dst, src, sizeof(*src));
 253                         i = &dst->keys;
 254                         set_btree_bset(b, t, i);
 255                 }
 256
 257                 out = i->start;
 258
 259                 for (k = start; k != end; k = n) {
 260                         n = bkey_p_next(k);
 261
 262                         if (!bkey_deleted(k)) {
 263                                 bkey_p_copy(out, k);
 264                                 out = bkey_p_next(out);
 265                         } else {
 266                                 BUG_ON(k->needs_whiteout);
 267                         }
 268                 }
 269
 270                 i->u64s = cpu_to_le16((u64 *) out - i->_data);
 271                 set_btree_bset_end(b, t);
 272                 bch2_bset_set_no_aux_tree(b, t);
 273                 ret = true;
 274         }
 275
 276         bch2_verify_btree_nr_keys(b);
 277
 278         bch2_btree_build_aux_trees(b);
 279
 280         return ret;
 281 }
 282
 283 bool bch2_compact_whiteouts(struct bch_fs *c, struct btree *b,
 284                             enum compact_mode mode)
 285 {
 286         return bch2_drop_whiteouts(b, mode);
 287 }
 288
 289 static void btree_node_sort(struct bch_fs *c, struct btree *b,
 290                             unsigned start_idx,
 291                             unsigned end_idx,
 292                             bool filter_whiteouts)
 293 {
 294         struct btree_node *out;
 295         struct sort_iter_stack sort_iter;
 296         struct bset_tree *t;
 297         struct bset *start_bset = bset(b, &b->set[start_idx]);
 298         bool used_mempool = false;
 299         u64 start_time, seq = 0;
 300         unsigned i, u64s = 0, bytes, shift = end_idx - start_idx - 1;
 301         bool sorting_entire_node = start_idx == 0 &&
 302                 end_idx == b->nsets;
 303
 304         sort_iter_stack_init(&sort_iter, b);
 305
 306         for (t = b->set + start_idx;
 307              t < b->set + end_idx;
 308              t++) {
 309                 u64s += le16_to_cpu(bset(b, t)->u64s);
 310                 sort_iter_add(&sort_iter.iter,
 311                               btree_bkey_first(b, t),
 312                               btree_bkey_last(b, t));
 313         }
 314
 315         bytes = sorting_entire_node
 316                 ? btree_bytes(c)
 317                 : __vstruct_bytes(struct btree_node, u64s);
 318
 319         out = btree_bounce_alloc(c, bytes, &used_mempool);
 320
 321         start_time = local_clock();
 322
 323         u64s = bch2_sort_keys(out->keys.start, &sort_iter.iter, filter_whiteouts);
 324
 325         out->keys.u64s = cpu_to_le16(u64s);
 326
 327         BUG_ON(vstruct_end(&out->keys) > (void *) out + bytes);
 328
 329         if (sorting_entire_node)
 330                 bch2_time_stats_update(&c->times[BCH_TIME_btree_node_sort],
 331                                        start_time);
 332
 333         /* Make sure we preserve bset journal_seq: */
 334         for (t = b->set + start_idx; t < b->set + end_idx; t++)
 335                 seq = max(seq, le64_to_cpu(bset(b, t)->journal_seq));
 336         start_bset->journal_seq = cpu_to_le64(seq);
 337
 338         if (sorting_entire_node) {
 339                 u64s = le16_to_cpu(out->keys.u64s);
 340
 341                 BUG_ON(bytes != btree_bytes(c));
 342
 343                 /*
 344                  * Our temporary buffer is the same size as the btree node's
 345                  * buffer, we can just swap buffers instead of doing a big
 346                  * memcpy()
 347                  */
 348                 *out = *b->data;
 349                 out->keys.u64s = cpu_to_le16(u64s);
 350                 swap(out, b->data);
 351                 set_btree_bset(b, b->set, &b->data->keys);
 352         } else {
 353                 start_bset->u64s = out->keys.u64s;
 354                 memcpy_u64s(start_bset->start,
 355                             out->keys.start,
 356                             le16_to_cpu(out->keys.u64s));
 357         }
 358
 359         for (i = start_idx + 1; i < end_idx; i++)
 360                 b->nr.bset_u64s[start_idx] +=
 361                         b->nr.bset_u64s[i];
 362
 363         b->nsets -= shift;
 364
 365         for (i = start_idx + 1; i < b->nsets; i++) {
 366                 b->nr.bset_u64s[i]      = b->nr.bset_u64s[i + shift];
 367                 b->set[i]               = b->set[i + shift];
 368         }
 369
 370         for (i = b->nsets; i < MAX_BSETS; i++)
 371                 b->nr.bset_u64s[i] = 0;
 372
 373         set_btree_bset_end(b, &b->set[start_idx]);
 374         bch2_bset_set_no_aux_tree(b, &b->set[start_idx]);
 375
 376         btree_bounce_free(c, bytes, used_mempool, out);
 377
 378         bch2_verify_btree_nr_keys(b);
 379 }
 380
 381 void bch2_btree_sort_into(struct bch_fs *c,
 382                          struct btree *dst,
 383                          struct btree *src)
 384 {
 385         struct btree_nr_keys nr;
 386         struct btree_node_iter src_iter;
 387         u64 start_time = local_clock();
 388
 389         BUG_ON(dst->nsets != 1);
 390
 391         bch2_bset_set_no_aux_tree(dst, dst->set);
 392
 393         bch2_btree_node_iter_init_from_start(&src_iter, src);
 394
 395         nr = bch2_sort_repack(btree_bset_first(dst),
 396                         src, &src_iter,
 397                         &dst->format,
 398                         true);
 399
 400         bch2_time_stats_update(&c->times[BCH_TIME_btree_node_sort],
 401                                start_time);
 402
 403         set_btree_bset_end(dst, dst->set);
 404
 405         dst->nr.live_u64s       += nr.live_u64s;
 406         dst->nr.bset_u64s[0]    += nr.bset_u64s[0];
 407         dst->nr.packed_keys     += nr.packed_keys;
 408         dst->nr.unpacked_keys   += nr.unpacked_keys;
 409
 410         bch2_verify_btree_nr_keys(dst);
 411 }
 412
 413 /*
 414  * We're about to add another bset to the btree node, so if there's currently
 415  * too many bsets - sort some of them together:
 416  */
 417 static bool btree_node_compact(struct bch_fs *c, struct btree *b)
 418 {
 419         unsigned unwritten_idx;
 420         bool ret = false;
 421
 422         for (unwritten_idx = 0;
 423              unwritten_idx < b->nsets;
 424              unwritten_idx++)
 425                 if (!bset_written(b, bset(b, &b->set[unwritten_idx])))
 426                         break;
 427
 428         if (b->nsets - unwritten_idx > 1) {
 429                 btree_node_sort(c, b, unwritten_idx,
 430                                 b->nsets, false);
 431                 ret = true;
 432         }
 433
 434         if (unwritten_idx > 1) {
 435                 btree_node_sort(c, b, 0, unwritten_idx, false);
 436                 ret = true;
 437         }
 438
 439         return ret;
 440 }
 441
 442 void bch2_btree_build_aux_trees(struct btree *b)
 443 {
 444         struct bset_tree *t;
 445
 446         for_each_bset(b, t)
 447                 bch2_bset_build_aux_tree(b, t,
 448                                 !bset_written(b, bset(b, t)) &&
 449                                 t == bset_tree_last(b));
 450 }
 451
 452 /*
 453  * If we have MAX_BSETS (3) bsets, should we sort them all down to just one?
 454  *
 455  * The first bset is going to be of similar order to the size of the node, the
 456  * last bset is bounded by btree_write_set_buffer(), which is set to keep the
 457  * memmove on insert from being too expensive: the middle bset should, ideally,
 458  * be the geometric mean of the first and the last.
 459  *
 460  * Returns true if the middle bset is greater than that geometric mean:
 461  */
 462 static inline bool should_compact_all(struct bch_fs *c, struct btree *b)
 463 {
 464         unsigned mid_u64s_bits =
 465                 (ilog2(btree_max_u64s(c)) + BTREE_WRITE_SET_U64s_BITS) / 2;
 466
 467         return bset_u64s(&b->set[1]) > 1U << mid_u64s_bits;
 468 }
 469
 470 /*
 471  * @bch_btree_init_next - initialize a new (unwritten) bset that can then be
 472  * inserted into
 473  *
 474  * Safe to call if there already is an unwritten bset - will only add a new bset
 475  * if @b doesn't already have one.
 476  *
 477  * Returns true if we sorted (i.e. invalidated iterators
 478  */
 479 void bch2_btree_init_next(struct btree_trans *trans, struct btree *b)
 480 {
 481         struct bch_fs *c = trans->c;
 482         struct btree_node_entry *bne;
 483         bool reinit_iter = false;
 484
 485         EBUG_ON(!six_lock_counts(&b->c.lock).n[SIX_LOCK_write]);
 486         BUG_ON(bset_written(b, bset(b, &b->set[1])));
 487         BUG_ON(btree_node_just_written(b));
 488
 489         if (b->nsets == MAX_BSETS &&
 490             !btree_node_write_in_flight(b) &&
 491             should_compact_all(c, b)) {
 492                 bch2_btree_node_write(c, b, SIX_LOCK_write,
 493                                       BTREE_WRITE_init_next_bset);
 494                 reinit_iter = true;
 495         }
 496
 497         if (b->nsets == MAX_BSETS &&
 498             btree_node_compact(c, b))
 499                 reinit_iter = true;
 500
 501         BUG_ON(b->nsets >= MAX_BSETS);
 502
 503         bne = want_new_bset(c, b);
 504         if (bne)
 505                 bch2_bset_init_next(c, b, bne);
 506
 507         bch2_btree_build_aux_trees(b);
 508
 509         if (reinit_iter)
 510                 bch2_trans_node_reinit_iter(trans, b);
 511 }
 512
 513 static void btree_err_msg(struct printbuf *out, struct bch_fs *c,
 514                           struct bch_dev *ca,
 515                           struct btree *b, struct bset *i,
 516                           unsigned offset, int write)
 517 {
 518         prt_printf(out, bch2_log_msg(c, "%s"),
 519                    write == READ
 520                    ? "error validating btree node "
 521                    : "corrupt btree node before write ");
 522         if (ca)
 523                 prt_printf(out, "on %s ", ca->name);
 524         prt_printf(out, "at btree ");
 525         bch2_btree_pos_to_text(out, c, b);
 526
 527         prt_printf(out, "\n  node offset %u", b->written);
 528         if (i)
 529                 prt_printf(out, " bset u64s %u", le16_to_cpu(i->u64s));
 530         prt_str(out, ": ");
 531 }
 532
 533 __printf(9, 10)
 534 static int __btree_err(int ret,
 535                        struct bch_fs *c,
 536                        struct bch_dev *ca,
 537                        struct btree *b,
 538                        struct bset *i,
 539                        int write,
 540                        bool have_retry,
 541                        enum bch_sb_error_id err_type,
 542                        const char *fmt, ...)
 543 {
 544         struct printbuf out = PRINTBUF;
 545         va_list args;
 546
 547         btree_err_msg(&out, c, ca, b, i, b->written, write);
 548
 549         va_start(args, fmt);
 550         prt_vprintf(&out, fmt, args);
 551         va_end(args);
 552
 553         if (write == WRITE) {
 554                 bch2_print_string_as_lines(KERN_ERR, out.buf);
 555                 ret = c->opts.errors == BCH_ON_ERROR_continue
 556                         ? 0
 557                         : -BCH_ERR_fsck_errors_not_fixed;
 558                 goto out;
 559         }
 560
 561         if (!have_retry && ret == -BCH_ERR_btree_node_read_err_want_retry)
 562                 ret = -BCH_ERR_btree_node_read_err_fixable;
 563         if (!have_retry && ret == -BCH_ERR_btree_node_read_err_must_retry)
 564                 ret = -BCH_ERR_btree_node_read_err_bad_node;
 565
 566         if (ret != -BCH_ERR_btree_node_read_err_fixable)
 567                 bch2_sb_error_count(c, err_type);
 568
 569         switch (ret) {
 570         case -BCH_ERR_btree_node_read_err_fixable:
 571                 ret = bch2_fsck_err(c, FSCK_CAN_FIX, err_type, "%s", out.buf);
 572                 if (ret != -BCH_ERR_fsck_fix &&
 573                     ret != -BCH_ERR_fsck_ignore)
 574                         goto fsck_err;
 575                 ret = -BCH_ERR_fsck_fix;
 576                 break;
 577         case -BCH_ERR_btree_node_read_err_want_retry:
 578         case -BCH_ERR_btree_node_read_err_must_retry:
 579                 bch2_print_string_as_lines(KERN_ERR, out.buf);
 580                 break;
 581         case -BCH_ERR_btree_node_read_err_bad_node:
 582                 bch2_print_string_as_lines(KERN_ERR, out.buf);
 583                 bch2_topology_error(c);
 584                 ret = bch2_run_explicit_recovery_pass(c, BCH_RECOVERY_PASS_check_topology) ?: -EIO;
 585                 break;
 586         case -BCH_ERR_btree_node_read_err_incompatible:
 587                 bch2_print_string_as_lines(KERN_ERR, out.buf);
 588                 ret = -BCH_ERR_fsck_errors_not_fixed;
 589                 break;
 590         default:
 591                 BUG();
 592         }
 593 out:
 594 fsck_err:
 595         printbuf_exit(&out);
 596         return ret;
 597 }
 598
 599 #define btree_err(type, c, ca, b, i, _err_type, msg, ...)               \
 600 ({                                                                      \
 601         int _ret = __btree_err(type, c, ca, b, i, write, have_retry,    \
 602                                BCH_FSCK_ERR_##_err_type,                \
 603                                msg, ##__VA_ARGS__);                     \
 604                                                                         \
 605         if (_ret != -BCH_ERR_fsck_fix) {                                \
 606                 ret = _ret;                                             \
 607                 goto fsck_err;                                          \
 608         }                                                               \
 609                                                                         \
 610         *saw_error = true;                                              \
 611 })
 612
 613 #define btree_err_on(cond, ...) ((cond) ? btree_err(__VA_ARGS__) : false)
 614
 615 /*
 616  * When btree topology repair changes the start or end of a node, that might
 617  * mean we have to drop keys that are no longer inside the node:
 618  */
 619 __cold
 620 void bch2_btree_node_drop_keys_outside_node(struct btree *b)
 621 {
 622         struct bset_tree *t;
 623
 624         for_each_bset(b, t) {
 625                 struct bset *i = bset(b, t);
 626                 struct bkey_packed *k;
 627
 628                 for (k = i->start; k != vstruct_last(i); k = bkey_p_next(k))
 629                         if (bkey_cmp_left_packed(b, k, &b->data->min_key) >= 0)
 630                                 break;
 631
 632                 if (k != i->start) {
 633                         unsigned shift = (u64 *) k - (u64 *) i->start;
 634
 635                         memmove_u64s_down(i->start, k,
 636                                           (u64 *) vstruct_end(i) - (u64 *) k);
 637                         i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - shift);
 638                         set_btree_bset_end(b, t);
 639                 }
 640
 641                 for (k = i->start; k != vstruct_last(i); k = bkey_p_next(k))
 642                         if (bkey_cmp_left_packed(b, k, &b->data->max_key) > 0)
 643                                 break;
 644
 645                 if (k != vstruct_last(i)) {
 646                         i->u64s = cpu_to_le16((u64 *) k - (u64 *) i->start);
 647                         set_btree_bset_end(b, t);
 648                 }
 649         }
 650
 651         /*
 652          * Always rebuild search trees: eytzinger search tree nodes directly
 653          * depend on the values of min/max key:
 654          */
 655         bch2_bset_set_no_aux_tree(b, b->set);
 656         bch2_btree_build_aux_trees(b);
 657
 658         struct bkey_s_c k;
 659         struct bkey unpacked;
 660         struct btree_node_iter iter;
 661         for_each_btree_node_key_unpack(b, k, &iter, &unpacked) {
 662                 BUG_ON(bpos_lt(k.k->p, b->data->min_key));
 663                 BUG_ON(bpos_gt(k.k->p, b->data->max_key));
 664         }
 665 }
 666
 667 static int validate_bset(struct bch_fs *c, struct bch_dev *ca,
 668                          struct btree *b, struct bset *i,
 669                          unsigned offset, unsigned sectors,
 670                          int write, bool have_retry, bool *saw_error)
 671 {
 672         unsigned version = le16_to_cpu(i->version);
 673         struct printbuf buf1 = PRINTBUF;
 674         struct printbuf buf2 = PRINTBUF;
 675         int ret = 0;
 676
 677         btree_err_on(!bch2_version_compatible(version),
 678                      -BCH_ERR_btree_node_read_err_incompatible,
 679                      c, ca, b, i,
 680                      btree_node_unsupported_version,
 681                      "unsupported bset version %u.%u",
 682                      BCH_VERSION_MAJOR(version),
 683                      BCH_VERSION_MINOR(version));
 684
 685         if (btree_err_on(version < c->sb.version_min,
 686                          -BCH_ERR_btree_node_read_err_fixable,
 687                          c, NULL, b, i,
 688                          btree_node_bset_older_than_sb_min,
 689                          "bset version %u older than superblock version_min %u",
 690                          version, c->sb.version_min)) {
 691                 mutex_lock(&c->sb_lock);
 692                 c->disk_sb.sb->version_min = cpu_to_le16(version);
 693                 bch2_write_super(c);
 694                 mutex_unlock(&c->sb_lock);
 695         }
 696
 697         if (btree_err_on(BCH_VERSION_MAJOR(version) >
 698                          BCH_VERSION_MAJOR(c->sb.version),
 699                          -BCH_ERR_btree_node_read_err_fixable,
 700                          c, NULL, b, i,
 701                          btree_node_bset_newer_than_sb,
 702                          "bset version %u newer than superblock version %u",
 703                          version, c->sb.version)) {
 704                 mutex_lock(&c->sb_lock);
 705                 c->disk_sb.sb->version = cpu_to_le16(version);
 706                 bch2_write_super(c);
 707                 mutex_unlock(&c->sb_lock);
 708         }
 709
 710         btree_err_on(BSET_SEPARATE_WHITEOUTS(i),
 711                      -BCH_ERR_btree_node_read_err_incompatible,
 712                      c, ca, b, i,
 713                      btree_node_unsupported_version,
 714                      "BSET_SEPARATE_WHITEOUTS no longer supported");
 715
 716         if (btree_err_on(offset + sectors > btree_sectors(c),
 717                          -BCH_ERR_btree_node_read_err_fixable,
 718                          c, ca, b, i,
 719                          bset_past_end_of_btree_node,
 720                          "bset past end of btree node")) {
 721                 i->u64s = 0;
 722                 ret = 0;
 723                 goto out;
 724         }
 725
 726         btree_err_on(offset && !i->u64s,
 727                      -BCH_ERR_btree_node_read_err_fixable,
 728                      c, ca, b, i,
 729                      bset_empty,
 730                      "empty bset");
 731
 732         btree_err_on(BSET_OFFSET(i) && BSET_OFFSET(i) != offset,
 733                      -BCH_ERR_btree_node_read_err_want_retry,
 734                      c, ca, b, i,
 735                      bset_wrong_sector_offset,
 736                      "bset at wrong sector offset");
 737
 738         if (!offset) {
 739                 struct btree_node *bn =
 740                         container_of(i, struct btree_node, keys);
 741                 /* These indicate that we read the wrong btree node: */
 742
 743                 if (b->key.k.type == KEY_TYPE_btree_ptr_v2) {
 744                         struct bch_btree_ptr_v2 *bp =
 745                                 &bkey_i_to_btree_ptr_v2(&b->key)->v;
 746
 747                         /* XXX endianness */
 748                         btree_err_on(bp->seq != bn->keys.seq,
 749                                      -BCH_ERR_btree_node_read_err_must_retry,
 750                                      c, ca, b, NULL,
 751                                      bset_bad_seq,
 752                                      "incorrect sequence number (wrong btree node)");
 753                 }
 754
 755                 btree_err_on(BTREE_NODE_ID(bn) != b->c.btree_id,
 756                              -BCH_ERR_btree_node_read_err_must_retry,
 757                              c, ca, b, i,
 758                              btree_node_bad_btree,
 759                              "incorrect btree id");
 760
 761                 btree_err_on(BTREE_NODE_LEVEL(bn) != b->c.level,
 762                              -BCH_ERR_btree_node_read_err_must_retry,
 763                              c, ca, b, i,
 764                              btree_node_bad_level,
 765                              "incorrect level");
 766
 767                 if (!write)
 768                         compat_btree_node(b->c.level, b->c.btree_id, version,
 769                                           BSET_BIG_ENDIAN(i), write, bn);
 770
 771                 if (b->key.k.type == KEY_TYPE_btree_ptr_v2) {
 772                         struct bch_btree_ptr_v2 *bp =
 773                                 &bkey_i_to_btree_ptr_v2(&b->key)->v;
 774
 775                         if (BTREE_PTR_RANGE_UPDATED(bp)) {
 776                                 b->data->min_key = bp->min_key;
 777                                 b->data->max_key = b->key.k.p;
 778                         }
 779
 780                         btree_err_on(!bpos_eq(b->data->min_key, bp->min_key),
 781                                      -BCH_ERR_btree_node_read_err_must_retry,
 782                                      c, ca, b, NULL,
 783                                      btree_node_bad_min_key,
 784                                      "incorrect min_key: got %s should be %s",
 785                                      (printbuf_reset(&buf1),
 786                                       bch2_bpos_to_text(&buf1, bn->min_key), buf1.buf),
 787                                      (printbuf_reset(&buf2),
 788                                       bch2_bpos_to_text(&buf2, bp->min_key), buf2.buf));
 789                 }
 790
 791                 btree_err_on(!bpos_eq(bn->max_key, b->key.k.p),
 792                              -BCH_ERR_btree_node_read_err_must_retry,
 793                              c, ca, b, i,
 794                              btree_node_bad_max_key,
 795                              "incorrect max key %s",
 796                              (printbuf_reset(&buf1),
 797                               bch2_bpos_to_text(&buf1, bn->max_key), buf1.buf));
 798
 799                 if (write)
 800                         compat_btree_node(b->c.level, b->c.btree_id, version,
 801                                           BSET_BIG_ENDIAN(i), write, bn);
 802
 803                 btree_err_on(bch2_bkey_format_invalid(c, &bn->format, write, &buf1),
 804                              -BCH_ERR_btree_node_read_err_bad_node,
 805                              c, ca, b, i,
 806                              btree_node_bad_format,
 807                              "invalid bkey format: %s\n  %s", buf1.buf,
 808                              (printbuf_reset(&buf2),
 809                               bch2_bkey_format_to_text(&buf2, &bn->format), buf2.buf));
 810                 printbuf_reset(&buf1);
 811
 812                 compat_bformat(b->c.level, b->c.btree_id, version,
 813                                BSET_BIG_ENDIAN(i), write,
 814                                &bn->format);
 815         }
 816 out:
 817 fsck_err:
 818         printbuf_exit(&buf2);
 819         printbuf_exit(&buf1);
 820         return ret;
 821 }
 822
 823 static int bset_key_invalid(struct bch_fs *c, struct btree *b,
 824                             struct bkey_s_c k,
 825                             bool updated_range, int rw,
 826                             struct printbuf *err)
 827 {
 828         return __bch2_bkey_invalid(c, k, btree_node_type(b), READ, err) ?:
 829                 (!updated_range ? bch2_bkey_in_btree_node(c, b, k, err) : 0) ?:
 830                 (rw == WRITE ? bch2_bkey_val_invalid(c, k, READ, err) : 0);
 831 }
 832
 833 static int validate_bset_keys(struct bch_fs *c, struct btree *b,
 834                          struct bset *i, int write,
 835                          bool have_retry, bool *saw_error)
 836 {
 837         unsigned version = le16_to_cpu(i->version);
 838         struct bkey_packed *k, *prev = NULL;
 839         struct printbuf buf = PRINTBUF;
 840         bool updated_range = b->key.k.type == KEY_TYPE_btree_ptr_v2 &&
 841                 BTREE_PTR_RANGE_UPDATED(&bkey_i_to_btree_ptr_v2(&b->key)->v);
 842         int ret = 0;
 843
 844         for (k = i->start;
 845              k != vstruct_last(i);) {
 846                 struct bkey_s u;
 847                 struct bkey tmp;
 848
 849                 if (btree_err_on(bkey_p_next(k) > vstruct_last(i),
 850                                  -BCH_ERR_btree_node_read_err_fixable,
 851                                  c, NULL, b, i,
 852                                  btree_node_bkey_past_bset_end,
 853                                  "key extends past end of bset")) {
 854                         i->u64s = cpu_to_le16((u64 *) k - i->_data);
 855                         break;
 856                 }
 857
 858                 if (btree_err_on(k->format > KEY_FORMAT_CURRENT,
 859                                  -BCH_ERR_btree_node_read_err_fixable,
 860                                  c, NULL, b, i,
 861                                  btree_node_bkey_bad_format,
 862                                  "invalid bkey format %u", k->format)) {
 863                         i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - k->u64s);
 864                         memmove_u64s_down(k, bkey_p_next(k),
 865                                           (u64 *) vstruct_end(i) - (u64 *) k);
 866                         continue;
 867                 }
 868
 869                 /* XXX: validate k->u64s */
 870                 if (!write)
 871                         bch2_bkey_compat(b->c.level, b->c.btree_id, version,
 872                                     BSET_BIG_ENDIAN(i), write,
 873                                     &b->format, k);
 874
 875                 u = __bkey_disassemble(b, k, &tmp);
 876
 877                 printbuf_reset(&buf);
 878                 if (bset_key_invalid(c, b, u.s_c, updated_range, write, &buf)) {
 879                         printbuf_reset(&buf);
 880                         bset_key_invalid(c, b, u.s_c, updated_range, write, &buf);
 881                         prt_printf(&buf, "\n  ");
 882                         bch2_bkey_val_to_text(&buf, c, u.s_c);
 883
 884                         btree_err(-BCH_ERR_btree_node_read_err_fixable,
 885                                   c, NULL, b, i,
 886                                   btree_node_bad_bkey,
 887                                   "invalid bkey: %s", buf.buf);
 888
 889                         i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - k->u64s);
 890                         memmove_u64s_down(k, bkey_p_next(k),
 891                                           (u64 *) vstruct_end(i) - (u64 *) k);
 892                         continue;
 893                 }
 894
 895                 if (write)
 896                         bch2_bkey_compat(b->c.level, b->c.btree_id, version,
 897                                     BSET_BIG_ENDIAN(i), write,
 898                                     &b->format, k);
 899
 900                 if (prev && bkey_iter_cmp(b, prev, k) > 0) {
 901                         struct bkey up = bkey_unpack_key(b, prev);
 902
 903                         printbuf_reset(&buf);
 904                         prt_printf(&buf, "keys out of order: ");
 905                         bch2_bkey_to_text(&buf, &up);
 906                         prt_printf(&buf, " > ");
 907                         bch2_bkey_to_text(&buf, u.k);
 908
 909                         bch2_dump_bset(c, b, i, 0);
 910
 911                         if (btree_err(-BCH_ERR_btree_node_read_err_fixable,
 912                                       c, NULL, b, i,
 913                                       btree_node_bkey_out_of_order,
 914                                       "%s", buf.buf)) {
 915                                 i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - k->u64s);
 916                                 memmove_u64s_down(k, bkey_p_next(k),
 917                                                   (u64 *) vstruct_end(i) - (u64 *) k);
 918                                 continue;
 919                         }
 920                 }
 921
 922                 prev = k;
 923                 k = bkey_p_next(k);
 924         }
 925 fsck_err:
 926         printbuf_exit(&buf);
 927         return ret;
 928 }
 929
 930 int bch2_btree_node_read_done(struct bch_fs *c, struct bch_dev *ca,
 931                               struct btree *b, bool have_retry, bool *saw_error)
 932 {
 933         struct btree_node_entry *bne;
 934         struct sort_iter *iter;
 935         struct btree_node *sorted;
 936         struct bkey_packed *k;
 937         struct bset *i;
 938         bool used_mempool, blacklisted;
 939         bool updated_range = b->key.k.type == KEY_TYPE_btree_ptr_v2 &&
 940                 BTREE_PTR_RANGE_UPDATED(&bkey_i_to_btree_ptr_v2(&b->key)->v);
 941         unsigned u64s;
 942         unsigned ptr_written = btree_ptr_sectors_written(&b->key);
 943         struct printbuf buf = PRINTBUF;
 944         int ret = 0, retry_read = 0, write = READ;
 945
 946         b->version_ondisk = U16_MAX;
 947         /* We might get called multiple times on read retry: */
 948         b->written = 0;
 949
 950         iter = mempool_alloc(&c->fill_iter, GFP_NOFS);
 951         sort_iter_init(iter, b, (btree_blocks(c) + 1) * 2);
 952
 953         if (bch2_meta_read_fault("btree"))
 954                 btree_err(-BCH_ERR_btree_node_read_err_must_retry,
 955                           c, ca, b, NULL,
 956                           btree_node_fault_injected,
 957                           "dynamic fault");
 958
 959         btree_err_on(le64_to_cpu(b->data->magic) != bset_magic(c),
 960                      -BCH_ERR_btree_node_read_err_must_retry,
 961                      c, ca, b, NULL,
 962                      btree_node_bad_magic,
 963                      "bad magic: want %llx, got %llx",
 964                      bset_magic(c), le64_to_cpu(b->data->magic));
 965
 966         if (b->key.k.type == KEY_TYPE_btree_ptr_v2) {
 967                 struct bch_btree_ptr_v2 *bp =
 968                         &bkey_i_to_btree_ptr_v2(&b->key)->v;
 969
 970                 bch2_bpos_to_text(&buf, b->data->min_key);
 971                 prt_str(&buf, "-");
 972                 bch2_bpos_to_text(&buf, b->data->max_key);
 973
 974                 btree_err_on(b->data->keys.seq != bp->seq,
 975                              -BCH_ERR_btree_node_read_err_must_retry,
 976                              c, ca, b, NULL,
 977                              btree_node_bad_seq,
 978                              "got wrong btree node (want %llx got %llx)\n"
 979                              "got btree %s level %llu pos %s",
 980                              bp->seq, b->data->keys.seq,
 981                              bch2_btree_id_str(BTREE_NODE_ID(b->data)),
 982                              BTREE_NODE_LEVEL(b->data),
 983                              buf.buf);
 984         } else {
 985                 btree_err_on(!b->data->keys.seq,
 986                              -BCH_ERR_btree_node_read_err_must_retry,
 987                              c, ca, b, NULL,
 988                              btree_node_bad_seq,
 989                              "bad btree header: seq 0");
 990         }
 991
 992         while (b->written < (ptr_written ?: btree_sectors(c))) {
 993                 unsigned sectors;
 994                 struct nonce nonce;
 995                 bool first = !b->written;
 996                 bool csum_bad;
 997
 998                 if (!b->written) {
 999                         i = &b->data->keys;
1000
1001                         btree_err_on(!bch2_checksum_type_valid(c, BSET_CSUM_TYPE(i)),
1002                                      -BCH_ERR_btree_node_read_err_want_retry,
1003                                      c, ca, b, i,
1004                                      bset_unknown_csum,
1005                                      "unknown checksum type %llu", BSET_CSUM_TYPE(i));
1006
1007                         nonce = btree_nonce(i, b->written << 9);
1008
1009                         csum_bad = bch2_crc_cmp(b->data->csum,
1010                                 csum_vstruct(c, BSET_CSUM_TYPE(i), nonce, b->data));
1011                         if (csum_bad)
1012                                 bch2_io_error(ca, BCH_MEMBER_ERROR_checksum);
1013
1014                         btree_err_on(csum_bad,
1015                                      -BCH_ERR_btree_node_read_err_want_retry,
1016                                      c, ca, b, i,
1017                                      bset_bad_csum,
1018                                      "invalid checksum");
1019
1020                         ret = bset_encrypt(c, i, b->written << 9);
1021                         if (bch2_fs_fatal_err_on(ret, c,
1022                                         "error decrypting btree node: %i", ret))
1023                                 goto fsck_err;
1024
1025                         btree_err_on(btree_node_type_is_extents(btree_node_type(b)) &&
1026                                      !BTREE_NODE_NEW_EXTENT_OVERWRITE(b->data),
1027                                      -BCH_ERR_btree_node_read_err_incompatible,
1028                                      c, NULL, b, NULL,
1029                                      btree_node_unsupported_version,
1030                                      "btree node does not have NEW_EXTENT_OVERWRITE set");
1031
1032                         sectors = vstruct_sectors(b->data, c->block_bits);
1033                 } else {
1034                         bne = write_block(b);
1035                         i = &bne->keys;
1036
1037                         if (i->seq != b->data->keys.seq)
1038                                 break;
1039
1040                         btree_err_on(!bch2_checksum_type_valid(c, BSET_CSUM_TYPE(i)),
1041                                      -BCH_ERR_btree_node_read_err_want_retry,
1042                                      c, ca, b, i,
1043                                      bset_unknown_csum,
1044                                      "unknown checksum type %llu", BSET_CSUM_TYPE(i));
1045
1046                         nonce = btree_nonce(i, b->written << 9);
1047                         csum_bad = bch2_crc_cmp(bne->csum,
1048                                 csum_vstruct(c, BSET_CSUM_TYPE(i), nonce, bne));
1049                         if (csum_bad)
1050                                 bch2_io_error(ca, BCH_MEMBER_ERROR_checksum);
1051
1052                         btree_err_on(csum_bad,
1053                                      -BCH_ERR_btree_node_read_err_want_retry,
1054                                      c, ca, b, i,
1055                                      bset_bad_csum,
1056                                      "invalid checksum");
1057
1058                         ret = bset_encrypt(c, i, b->written << 9);
1059                         if (bch2_fs_fatal_err_on(ret, c,
1060                                         "error decrypting btree node: %i\n", ret))
1061                                 goto fsck_err;
1062
1063                         sectors = vstruct_sectors(bne, c->block_bits);
1064                 }
1065
1066                 b->version_ondisk = min(b->version_ondisk,
1067                                         le16_to_cpu(i->version));
1068
1069                 ret = validate_bset(c, ca, b, i, b->written, sectors,
1070                                     READ, have_retry, saw_error);
1071                 if (ret)
1072                         goto fsck_err;
1073
1074                 if (!b->written)
1075                         btree_node_set_format(b, b->data->format);
1076
1077                 ret = validate_bset_keys(c, b, i, READ, have_retry, saw_error);
1078                 if (ret)
1079                         goto fsck_err;
1080
1081                 SET_BSET_BIG_ENDIAN(i, CPU_BIG_ENDIAN);
1082
1083                 blacklisted = bch2_journal_seq_is_blacklisted(c,
1084                                         le64_to_cpu(i->journal_seq),
1085                                         true);
1086
1087                 btree_err_on(blacklisted && first,
1088                              -BCH_ERR_btree_node_read_err_fixable,
1089                              c, ca, b, i,
1090                              bset_blacklisted_journal_seq,
1091                              "first btree node bset has blacklisted journal seq (%llu)",
1092                              le64_to_cpu(i->journal_seq));
1093
1094                 btree_err_on(blacklisted && ptr_written,
1095                              -BCH_ERR_btree_node_read_err_fixable,
1096                              c, ca, b, i,
1097                              first_bset_blacklisted_journal_seq,
1098                              "found blacklisted bset (journal seq %llu) in btree node at offset %u-%u/%u",
1099                              le64_to_cpu(i->journal_seq),
1100                              b->written, b->written + sectors, ptr_written);
1101
1102                 b->written += sectors;
1103
1104                 if (blacklisted && !first)
1105                         continue;
1106
1107                 sort_iter_add(iter,
1108                               vstruct_idx(i, 0),
1109                               vstruct_last(i));
1110         }
1111
1112         if (ptr_written) {
1113                 btree_err_on(b->written < ptr_written,
1114                              -BCH_ERR_btree_node_read_err_want_retry,
1115                              c, ca, b, NULL,
1116                              btree_node_data_missing,
1117                              "btree node data missing: expected %u sectors, found %u",
1118                              ptr_written, b->written);
1119         } else {
1120                 for (bne = write_block(b);
1121                      bset_byte_offset(b, bne) < btree_bytes(c);
1122                      bne = (void *) bne + block_bytes(c))
1123                         btree_err_on(bne->keys.seq == b->data->keys.seq &&
1124                                      !bch2_journal_seq_is_blacklisted(c,
1125                                                                       le64_to_cpu(bne->keys.journal_seq),
1126                                                                       true),
1127                                      -BCH_ERR_btree_node_read_err_want_retry,
1128                                      c, ca, b, NULL,
1129                                      btree_node_bset_after_end,
1130                                      "found bset signature after last bset");
1131         }
1132
1133         sorted = btree_bounce_alloc(c, btree_bytes(c), &used_mempool);
1134         sorted->keys.u64s = 0;
1135
1136         set_btree_bset(b, b->set, &b->data->keys);
1137
1138         b->nr = bch2_key_sort_fix_overlapping(c, &sorted->keys, iter);
1139
1140         u64s = le16_to_cpu(sorted->keys.u64s);
1141         *sorted = *b->data;
1142         sorted->keys.u64s = cpu_to_le16(u64s);
1143         swap(sorted, b->data);
1144         set_btree_bset(b, b->set, &b->data->keys);
1145         b->nsets = 1;
1146
1147         BUG_ON(b->nr.live_u64s != u64s);
1148
1149         btree_bounce_free(c, btree_bytes(c), used_mempool, sorted);
1150
1151         if (updated_range)
1152                 bch2_btree_node_drop_keys_outside_node(b);
1153
1154         i = &b->data->keys;
1155         for (k = i->start; k != vstruct_last(i);) {
1156                 struct bkey tmp;
1157                 struct bkey_s u = __bkey_disassemble(b, k, &tmp);
1158
1159                 printbuf_reset(&buf);
1160
1161                 if (bch2_bkey_val_invalid(c, u.s_c, READ, &buf) ||
1162                     (bch2_inject_invalid_keys &&
1163                      !bversion_cmp(u.k->version, MAX_VERSION))) {
1164                         printbuf_reset(&buf);
1165
1166                         prt_printf(&buf, "invalid bkey: ");
1167                         bch2_bkey_val_invalid(c, u.s_c, READ, &buf);
1168                         prt_printf(&buf, "\n  ");
1169                         bch2_bkey_val_to_text(&buf, c, u.s_c);
1170
1171                         btree_err(-BCH_ERR_btree_node_read_err_fixable,
1172                                   c, NULL, b, i,
1173                                   btree_node_bad_bkey,
1174                                   "%s", buf.buf);
1175
1176                         btree_keys_account_key_drop(&b->nr, 0, k);
1177
1178                         i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - k->u64s);
1179                         memmove_u64s_down(k, bkey_p_next(k),
1180                                           (u64 *) vstruct_end(i) - (u64 *) k);
1181                         set_btree_bset_end(b, b->set);
1182                         continue;
1183                 }
1184
1185                 if (u.k->type == KEY_TYPE_btree_ptr_v2) {
1186                         struct bkey_s_btree_ptr_v2 bp = bkey_s_to_btree_ptr_v2(u);
1187
1188                         bp.v->mem_ptr = 0;
1189                 }
1190
1191                 k = bkey_p_next(k);
1192         }
1193
1194         bch2_bset_build_aux_tree(b, b->set, false);
1195
1196         set_needs_whiteout(btree_bset_first(b), true);
1197
1198         btree_node_reset_sib_u64s(b);
1199
1200         bkey_for_each_ptr(bch2_bkey_ptrs(bkey_i_to_s(&b->key)), ptr) {
1201                 struct bch_dev *ca2 = bch_dev_bkey_exists(c, ptr->dev);
1202
1203                 if (ca2->mi.state != BCH_MEMBER_STATE_rw)
1204                         set_btree_node_need_rewrite(b);
1205         }
1206
1207         if (!ptr_written)
1208                 set_btree_node_need_rewrite(b);
1209 out:
1210         mempool_free(iter, &c->fill_iter);
1211         printbuf_exit(&buf);
1212         return retry_read;
1213 fsck_err:
1214         if (ret == -BCH_ERR_btree_node_read_err_want_retry ||
1215             ret == -BCH_ERR_btree_node_read_err_must_retry)
1216                 retry_read = 1;
1217         else
1218                 set_btree_node_read_error(b);
1219         goto out;
1220 }
1221
1222 static void btree_node_read_work(struct work_struct *work)
1223 {
1224         struct btree_read_bio *rb =
1225                 container_of(work, struct btree_read_bio, work);
1226         struct bch_fs *c        = rb->c;
1227         struct btree *b         = rb->b;
1228         struct bch_dev *ca      = bch_dev_bkey_exists(c, rb->pick.ptr.dev);
1229         struct bio *bio         = &rb->bio;
1230         struct bch_io_failures failed = { .nr = 0 };
1231         struct printbuf buf = PRINTBUF;
1232         bool saw_error = false;
1233         bool retry = false;
1234         bool can_retry;
1235
1236         goto start;
1237         while (1) {
1238                 retry = true;
1239                 bch_info(c, "retrying read");
1240                 ca = bch_dev_bkey_exists(c, rb->pick.ptr.dev);
1241                 rb->have_ioref          = bch2_dev_get_ioref(ca, READ);
1242                 bio_reset(bio, NULL, REQ_OP_READ|REQ_SYNC|REQ_META);
1243                 bio->bi_iter.bi_sector  = rb->pick.ptr.offset;
1244                 bio->bi_iter.bi_size    = btree_bytes(c);
1245
1246                 if (rb->have_ioref) {
1247                         bio_set_dev(bio, ca->disk_sb.bdev);
1248                         submit_bio_wait(bio);
1249                 } else {
1250                         bio->bi_status = BLK_STS_REMOVED;
1251                 }
1252 start:
1253                 printbuf_reset(&buf);
1254                 bch2_btree_pos_to_text(&buf, c, b);
1255                 bch2_dev_io_err_on(bio->bi_status, ca, BCH_MEMBER_ERROR_read,
1256                                    "btree read error %s for %s",
1257                                    bch2_blk_status_to_str(bio->bi_status), buf.buf);
1258                 if (rb->have_ioref)
1259                         percpu_ref_put(&ca->io_ref);
1260                 rb->have_ioref = false;
1261
1262                 bch2_mark_io_failure(&failed, &rb->pick);
1263
1264                 can_retry = bch2_bkey_pick_read_device(c,
1265                                 bkey_i_to_s_c(&b->key),
1266                                 &failed, &rb->pick) > 0;
1267
1268                 if (!bio->bi_status &&
1269                     !bch2_btree_node_read_done(c, ca, b, can_retry, &saw_error)) {
1270                         if (retry)
1271                                 bch_info(c, "retry success");
1272                         break;
1273                 }
1274
1275                 saw_error = true;
1276
1277                 if (!can_retry) {
1278                         set_btree_node_read_error(b);
1279                         break;
1280                 }
1281         }
1282
1283         bch2_time_stats_update(&c->times[BCH_TIME_btree_node_read],
1284                                rb->start_time);
1285         bio_put(&rb->bio);
1286
1287         if (saw_error && !btree_node_read_error(b)) {
1288                 printbuf_reset(&buf);
1289                 bch2_bpos_to_text(&buf, b->key.k.p);
1290                 bch_info(c, "%s: rewriting btree node at btree=%s level=%u %s due to error",
1291                          __func__, bch2_btree_id_str(b->c.btree_id), b->c.level, buf.buf);
1292
1293                 bch2_btree_node_rewrite_async(c, b);
1294         }
1295
1296         printbuf_exit(&buf);
1297         clear_btree_node_read_in_flight(b);
1298         wake_up_bit(&b->flags, BTREE_NODE_read_in_flight);
1299 }
1300
1301 static void btree_node_read_endio(struct bio *bio)
1302 {
1303         struct btree_read_bio *rb =
1304                 container_of(bio, struct btree_read_bio, bio);
1305         struct bch_fs *c        = rb->c;
1306
1307         if (rb->have_ioref) {
1308                 struct bch_dev *ca = bch_dev_bkey_exists(c, rb->pick.ptr.dev);
1309
1310                 bch2_latency_acct(ca, rb->start_time, READ);
1311         }
1312
1313         queue_work(c->io_complete_wq, &rb->work);
1314 }
1315
1316 struct btree_node_read_all {
1317         struct closure          cl;
1318         struct bch_fs           *c;
1319         struct btree            *b;
1320         unsigned                nr;
1321         void                    *buf[BCH_REPLICAS_MAX];
1322         struct bio              *bio[BCH_REPLICAS_MAX];
1323         blk_status_t            err[BCH_REPLICAS_MAX];
1324 };
1325
1326 static unsigned btree_node_sectors_written(struct bch_fs *c, void *data)
1327 {
1328         struct btree_node *bn = data;
1329         struct btree_node_entry *bne;
1330         unsigned offset = 0;
1331
1332         if (le64_to_cpu(bn->magic) !=  bset_magic(c))
1333                 return 0;
1334
1335         while (offset < btree_sectors(c)) {
1336                 if (!offset) {
1337                         offset += vstruct_sectors(bn, c->block_bits);
1338                 } else {
1339                         bne = data + (offset << 9);
1340                         if (bne->keys.seq != bn->keys.seq)
1341                                 break;
1342                         offset += vstruct_sectors(bne, c->block_bits);
1343                 }
1344         }
1345
1346         return offset;
1347 }
1348
1349 static bool btree_node_has_extra_bsets(struct bch_fs *c, unsigned offset, void *data)
1350 {
1351         struct btree_node *bn = data;
1352         struct btree_node_entry *bne;
1353
1354         if (!offset)
1355                 return false;
1356
1357         while (offset < btree_sectors(c)) {
1358                 bne = data + (offset << 9);
1359                 if (bne->keys.seq == bn->keys.seq)
1360                         return true;
1361                 offset++;
1362         }
1363
1364         return false;
1365         return offset;
1366 }
1367
1368 static CLOSURE_CALLBACK(btree_node_read_all_replicas_done)
1369 {
1370         closure_type(ra, struct btree_node_read_all, cl);
1371         struct bch_fs *c = ra->c;
1372         struct btree *b = ra->b;
1373         struct printbuf buf = PRINTBUF;
1374         bool dump_bset_maps = false;
1375         bool have_retry = false;
1376         int ret = 0, best = -1, write = READ;
1377         unsigned i, written = 0, written2 = 0;
1378         __le64 seq = b->key.k.type == KEY_TYPE_btree_ptr_v2
1379                 ? bkey_i_to_btree_ptr_v2(&b->key)->v.seq : 0;
1380         bool _saw_error = false, *saw_error = &_saw_error;
1381
1382         for (i = 0; i < ra->nr; i++) {
1383                 struct btree_node *bn = ra->buf[i];
1384
1385                 if (ra->err[i])
1386                         continue;
1387
1388                 if (le64_to_cpu(bn->magic) != bset_magic(c) ||
1389                     (seq && seq != bn->keys.seq))
1390                         continue;
1391
1392                 if (best < 0) {
1393                         best = i;
1394                         written = btree_node_sectors_written(c, bn);
1395                         continue;
1396                 }
1397
1398                 written2 = btree_node_sectors_written(c, ra->buf[i]);
1399                 if (btree_err_on(written2 != written, -BCH_ERR_btree_node_read_err_fixable,
1400                                  c, NULL, b, NULL,
1401                                  btree_node_replicas_sectors_written_mismatch,
1402                                  "btree node sectors written mismatch: %u != %u",
1403                                  written, written2) ||
1404                     btree_err_on(btree_node_has_extra_bsets(c, written2, ra->buf[i]),
1405                                  -BCH_ERR_btree_node_read_err_fixable,
1406                                  c, NULL, b, NULL,
1407                                  btree_node_bset_after_end,
1408                                  "found bset signature after last bset") ||
1409                     btree_err_on(memcmp(ra->buf[best], ra->buf[i], written << 9),
1410                                  -BCH_ERR_btree_node_read_err_fixable,
1411                                  c, NULL, b, NULL,
1412                                  btree_node_replicas_data_mismatch,
1413                                  "btree node replicas content mismatch"))
1414                         dump_bset_maps = true;
1415
1416                 if (written2 > written) {
1417                         written = written2;
1418                         best = i;
1419                 }
1420         }
1421 fsck_err:
1422         if (dump_bset_maps) {
1423                 for (i = 0; i < ra->nr; i++) {
1424                         struct btree_node *bn = ra->buf[i];
1425                         struct btree_node_entry *bne = NULL;
1426                         unsigned offset = 0, sectors;
1427                         bool gap = false;
1428
1429                         if (ra->err[i])
1430                                 continue;
1431
1432                         printbuf_reset(&buf);
1433
1434                         while (offset < btree_sectors(c)) {
1435                                 if (!offset) {
1436                                         sectors = vstruct_sectors(bn, c->block_bits);
1437                                 } else {
1438                                         bne = ra->buf[i] + (offset << 9);
1439                                         if (bne->keys.seq != bn->keys.seq)
1440                                                 break;
1441                                         sectors = vstruct_sectors(bne, c->block_bits);
1442                                 }
1443
1444                                 prt_printf(&buf, " %u-%u", offset, offset + sectors);
1445                                 if (bne && bch2_journal_seq_is_blacklisted(c,
1446                                                         le64_to_cpu(bne->keys.journal_seq), false))
1447                                         prt_printf(&buf, "*");
1448                                 offset += sectors;
1449                         }
1450
1451                         while (offset < btree_sectors(c)) {
1452                                 bne = ra->buf[i] + (offset << 9);
1453                                 if (bne->keys.seq == bn->keys.seq) {
1454                                         if (!gap)
1455                                                 prt_printf(&buf, " GAP");
1456                                         gap = true;
1457
1458                                         sectors = vstruct_sectors(bne, c->block_bits);
1459                                         prt_printf(&buf, " %u-%u", offset, offset + sectors);
1460                                         if (bch2_journal_seq_is_blacklisted(c,
1461                                                         le64_to_cpu(bne->keys.journal_seq), false))
1462                                                 prt_printf(&buf, "*");
1463                                 }
1464                                 offset++;
1465                         }
1466
1467                         bch_err(c, "replica %u:%s", i, buf.buf);
1468                 }
1469         }
1470
1471         if (best >= 0) {
1472                 memcpy(b->data, ra->buf[best], btree_bytes(c));
1473                 ret = bch2_btree_node_read_done(c, NULL, b, false, saw_error);
1474         } else {
1475                 ret = -1;
1476         }
1477
1478         if (ret)
1479                 set_btree_node_read_error(b);
1480         else if (*saw_error)
1481                 bch2_btree_node_rewrite_async(c, b);
1482
1483         for (i = 0; i < ra->nr; i++) {
1484                 mempool_free(ra->buf[i], &c->btree_bounce_pool);
1485                 bio_put(ra->bio[i]);
1486         }
1487
1488         closure_debug_destroy(&ra->cl);
1489         kfree(ra);
1490         printbuf_exit(&buf);
1491
1492         clear_btree_node_read_in_flight(b);
1493         wake_up_bit(&b->flags, BTREE_NODE_read_in_flight);
1494 }
1495
1496 static void btree_node_read_all_replicas_endio(struct bio *bio)
1497 {
1498         struct btree_read_bio *rb =
1499                 container_of(bio, struct btree_read_bio, bio);
1500         struct bch_fs *c        = rb->c;
1501         struct btree_node_read_all *ra = rb->ra;
1502
1503         if (rb->have_ioref) {
1504                 struct bch_dev *ca = bch_dev_bkey_exists(c, rb->pick.ptr.dev);
1505
1506                 bch2_latency_acct(ca, rb->start_time, READ);
1507         }
1508
1509         ra->err[rb->idx] = bio->bi_status;
1510         closure_put(&ra->cl);
1511 }
1512
1513 /*
1514  * XXX This allocates multiple times from the same mempools, and can deadlock
1515  * under sufficient memory pressure (but is only a debug path)
1516  */
1517 static int btree_node_read_all_replicas(struct bch_fs *c, struct btree *b, bool sync)
1518 {
1519         struct bkey_s_c k = bkey_i_to_s_c(&b->key);
1520         struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
1521         const union bch_extent_entry *entry;
1522         struct extent_ptr_decoded pick;
1523         struct btree_node_read_all *ra;
1524         unsigned i;
1525
1526         ra = kzalloc(sizeof(*ra), GFP_NOFS);
1527         if (!ra)
1528                 return -BCH_ERR_ENOMEM_btree_node_read_all_replicas;
1529
1530         closure_init(&ra->cl, NULL);
1531         ra->c   = c;
1532         ra->b   = b;
1533         ra->nr  = bch2_bkey_nr_ptrs(k);
1534
1535         for (i = 0; i < ra->nr; i++) {
1536                 ra->buf[i] = mempool_alloc(&c->btree_bounce_pool, GFP_NOFS);
1537                 ra->bio[i] = bio_alloc_bioset(NULL,
1538                                               buf_pages(ra->buf[i], btree_bytes(c)),
1539                                               REQ_OP_READ|REQ_SYNC|REQ_META,
1540                                               GFP_NOFS,
1541                                               &c->btree_bio);
1542         }
1543
1544         i = 0;
1545         bkey_for_each_ptr_decode(k.k, ptrs, pick, entry) {
1546                 struct bch_dev *ca = bch_dev_bkey_exists(c, pick.ptr.dev);
1547                 struct btree_read_bio *rb =
1548                         container_of(ra->bio[i], struct btree_read_bio, bio);
1549                 rb->c                   = c;
1550                 rb->b                   = b;
1551                 rb->ra                  = ra;
1552                 rb->start_time          = local_clock();
1553                 rb->have_ioref          = bch2_dev_get_ioref(ca, READ);
1554                 rb->idx                 = i;
1555                 rb->pick                = pick;
1556                 rb->bio.bi_iter.bi_sector = pick.ptr.offset;
1557                 rb->bio.bi_end_io       = btree_node_read_all_replicas_endio;
1558                 bch2_bio_map(&rb->bio, ra->buf[i], btree_bytes(c));
1559
1560                 if (rb->have_ioref) {
1561                         this_cpu_add(ca->io_done->sectors[READ][BCH_DATA_btree],
1562                                      bio_sectors(&rb->bio));
1563                         bio_set_dev(&rb->bio, ca->disk_sb.bdev);
1564
1565                         closure_get(&ra->cl);
1566                         submit_bio(&rb->bio);
1567                 } else {
1568                         ra->err[i] = BLK_STS_REMOVED;
1569                 }
1570
1571                 i++;
1572         }
1573
1574         if (sync) {
1575                 closure_sync(&ra->cl);
1576                 btree_node_read_all_replicas_done(&ra->cl.work);
1577         } else {
1578                 continue_at(&ra->cl, btree_node_read_all_replicas_done,
1579                             c->io_complete_wq);
1580         }
1581
1582         return 0;
1583 }
1584
1585 void bch2_btree_node_read(struct btree_trans *trans, struct btree *b,
1586                           bool sync)
1587 {
1588         struct bch_fs *c = trans->c;
1589         struct extent_ptr_decoded pick;
1590         struct btree_read_bio *rb;
1591         struct bch_dev *ca;
1592         struct bio *bio;
1593         int ret;
1594
1595         trace_and_count(c, btree_node_read, trans, b);
1596
1597         if (bch2_verify_all_btree_replicas &&
1598             !btree_node_read_all_replicas(c, b, sync))
1599                 return;
1600
1601         ret = bch2_bkey_pick_read_device(c, bkey_i_to_s_c(&b->key),
1602                                          NULL, &pick);
1603
1604         if (ret <= 0) {
1605                 struct printbuf buf = PRINTBUF;
1606
1607                 prt_str(&buf, "btree node read error: no device to read from\n at ");
1608                 bch2_btree_pos_to_text(&buf, c, b);
1609                 bch_err(c, "%s", buf.buf);
1610
1611                 if (c->recovery_passes_explicit & BIT_ULL(BCH_RECOVERY_PASS_check_topology) &&
1612                     c->curr_recovery_pass > BCH_RECOVERY_PASS_check_topology)
1613                         bch2_fatal_error(c);
1614
1615                 set_btree_node_read_error(b);
1616                 clear_btree_node_read_in_flight(b);
1617                 wake_up_bit(&b->flags, BTREE_NODE_read_in_flight);
1618                 printbuf_exit(&buf);
1619                 return;
1620         }
1621
1622         ca = bch_dev_bkey_exists(c, pick.ptr.dev);
1623
1624         bio = bio_alloc_bioset(NULL,
1625                                buf_pages(b->data, btree_bytes(c)),
1626                                REQ_OP_READ|REQ_SYNC|REQ_META,
1627                                GFP_NOFS,
1628                                &c->btree_bio);
1629         rb = container_of(bio, struct btree_read_bio, bio);
1630         rb->c                   = c;
1631         rb->b                   = b;
1632         rb->ra                  = NULL;
1633         rb->start_time          = local_clock();
1634         rb->have_ioref          = bch2_dev_get_ioref(ca, READ);
1635         rb->pick                = pick;
1636         INIT_WORK(&rb->work, btree_node_read_work);
1637         bio->bi_iter.bi_sector  = pick.ptr.offset;
1638         bio->bi_end_io          = btree_node_read_endio;
1639         bch2_bio_map(bio, b->data, btree_bytes(c));
1640
1641         if (rb->have_ioref) {
1642                 this_cpu_add(ca->io_done->sectors[READ][BCH_DATA_btree],
1643                              bio_sectors(bio));
1644                 bio_set_dev(bio, ca->disk_sb.bdev);
1645
1646                 if (sync) {
1647                         submit_bio_wait(bio);
1648
1649                         btree_node_read_work(&rb->work);
1650                 } else {
1651                         submit_bio(bio);
1652                 }
1653         } else {
1654                 bio->bi_status = BLK_STS_REMOVED;
1655
1656                 if (sync)
1657                         btree_node_read_work(&rb->work);
1658                 else
1659                         queue_work(c->io_complete_wq, &rb->work);
1660         }
1661 }
1662
1663 static int __bch2_btree_root_read(struct btree_trans *trans, enum btree_id id,
1664                                   const struct bkey_i *k, unsigned level)
1665 {
1666         struct bch_fs *c = trans->c;
1667         struct closure cl;
1668         struct btree *b;
1669         int ret;
1670
1671         closure_init_stack(&cl);
1672
1673         do {
1674                 ret = bch2_btree_cache_cannibalize_lock(trans, &cl);
1675                 closure_sync(&cl);
1676         } while (ret);
1677
1678         b = bch2_btree_node_mem_alloc(trans, level != 0);
1679         bch2_btree_cache_cannibalize_unlock(trans);
1680
1681         BUG_ON(IS_ERR(b));
1682
1683         bkey_copy(&b->key, k);
1684         BUG_ON(bch2_btree_node_hash_insert(&c->btree_cache, b, level, id));
1685
1686         set_btree_node_read_in_flight(b);
1687
1688         bch2_btree_node_read(trans, b, true);
1689
1690         if (btree_node_read_error(b)) {
1691                 bch2_btree_node_hash_remove(&c->btree_cache, b);
1692
1693                 mutex_lock(&c->btree_cache.lock);
1694                 list_move(&b->list, &c->btree_cache.freeable);
1695                 mutex_unlock(&c->btree_cache.lock);
1696
1697                 ret = -EIO;
1698                 goto err;
1699         }
1700
1701         bch2_btree_set_root_for_read(c, b);
1702 err:
1703         six_unlock_write(&b->c.lock);
1704         six_unlock_intent(&b->c.lock);
1705
1706         return ret;
1707 }
1708
1709 int bch2_btree_root_read(struct bch_fs *c, enum btree_id id,
1710                         const struct bkey_i *k, unsigned level)
1711 {
1712         return bch2_trans_run(c, __bch2_btree_root_read(trans, id, k, level));
1713 }
1714
1715 static void bch2_btree_complete_write(struct bch_fs *c, struct btree *b,
1716                                       struct btree_write *w)
1717 {
1718         unsigned long old, new, v = READ_ONCE(b->will_make_reachable);
1719
1720         do {
1721                 old = new = v;
1722                 if (!(old & 1))
1723                         break;
1724
1725                 new &= ~1UL;
1726         } while ((v = cmpxchg(&b->will_make_reachable, old, new)) != old);
1727
1728         if (old & 1)
1729                 closure_put(&((struct btree_update *) new)->cl);
1730
1731         bch2_journal_pin_drop(&c->journal, &w->journal);
1732 }
1733
1734 static void __btree_node_write_done(struct bch_fs *c, struct btree *b)
1735 {
1736         struct btree_write *w = btree_prev_write(b);
1737         unsigned long old, new, v;
1738         unsigned type = 0;
1739
1740         bch2_btree_complete_write(c, b, w);
1741
1742         v = READ_ONCE(b->flags);
1743         do {
1744                 old = new = v;
1745
1746                 if ((old & (1U << BTREE_NODE_dirty)) &&
1747                     (old & (1U << BTREE_NODE_need_write)) &&
1748                     !(old & (1U << BTREE_NODE_never_write)) &&
1749                     !(old & (1U << BTREE_NODE_write_blocked)) &&
1750                     !(old & (1U << BTREE_NODE_will_make_reachable))) {
1751                         new &= ~(1U << BTREE_NODE_dirty);
1752                         new &= ~(1U << BTREE_NODE_need_write);
1753                         new |=  (1U << BTREE_NODE_write_in_flight);
1754                         new |=  (1U << BTREE_NODE_write_in_flight_inner);
1755                         new |=  (1U << BTREE_NODE_just_written);
1756                         new ^=  (1U << BTREE_NODE_write_idx);
1757
1758                         type = new & BTREE_WRITE_TYPE_MASK;
1759                         new &= ~BTREE_WRITE_TYPE_MASK;
1760                 } else {
1761                         new &= ~(1U << BTREE_NODE_write_in_flight);
1762                         new &= ~(1U << BTREE_NODE_write_in_flight_inner);
1763                 }
1764         } while ((v = cmpxchg(&b->flags, old, new)) != old);
1765
1766         if (new & (1U << BTREE_NODE_write_in_flight))
1767                 __bch2_btree_node_write(c, b, BTREE_WRITE_ALREADY_STARTED|type);
1768         else
1769                 wake_up_bit(&b->flags, BTREE_NODE_write_in_flight);
1770 }
1771
1772 static void btree_node_write_done(struct bch_fs *c, struct btree *b)
1773 {
1774         struct btree_trans *trans = bch2_trans_get(c);
1775
1776         btree_node_lock_nopath_nofail(trans, &b->c, SIX_LOCK_read);
1777         __btree_node_write_done(c, b);
1778         six_unlock_read(&b->c.lock);
1779
1780         bch2_trans_put(trans);
1781 }
1782
1783 static void btree_node_write_work(struct work_struct *work)
1784 {
1785         struct btree_write_bio *wbio =
1786                 container_of(work, struct btree_write_bio, work);
1787         struct bch_fs *c        = wbio->wbio.c;
1788         struct btree *b         = wbio->wbio.bio.bi_private;
1789         struct bch_extent_ptr *ptr;
1790         int ret = 0;
1791
1792         btree_bounce_free(c,
1793                 wbio->data_bytes,
1794                 wbio->wbio.used_mempool,
1795                 wbio->data);
1796
1797         bch2_bkey_drop_ptrs(bkey_i_to_s(&wbio->key), ptr,
1798                 bch2_dev_list_has_dev(wbio->wbio.failed, ptr->dev));
1799
1800         if (!bch2_bkey_nr_ptrs(bkey_i_to_s_c(&wbio->key)))
1801                 goto err;
1802
1803         if (wbio->wbio.first_btree_write) {
1804                 if (wbio->wbio.failed.nr) {
1805
1806                 }
1807         } else {
1808                 ret = bch2_trans_do(c, NULL, NULL, 0,
1809                         bch2_btree_node_update_key_get_iter(trans, b, &wbio->key,
1810                                         BCH_WATERMARK_reclaim|
1811                                         BCH_TRANS_COMMIT_journal_reclaim|
1812                                         BCH_TRANS_COMMIT_no_enospc|
1813                                         BCH_TRANS_COMMIT_no_check_rw,
1814                                         !wbio->wbio.failed.nr));
1815                 if (ret)
1816                         goto err;
1817         }
1818 out:
1819         bio_put(&wbio->wbio.bio);
1820         btree_node_write_done(c, b);
1821         return;
1822 err:
1823         set_btree_node_noevict(b);
1824         if (!bch2_err_matches(ret, EROFS))
1825                 bch2_fs_fatal_error(c, "fatal error writing btree node: %s", bch2_err_str(ret));
1826         goto out;
1827 }
1828
1829 static void btree_node_write_endio(struct bio *bio)
1830 {
1831         struct bch_write_bio *wbio      = to_wbio(bio);
1832         struct bch_write_bio *parent    = wbio->split ? wbio->parent : NULL;
1833         struct bch_write_bio *orig      = parent ?: wbio;
1834         struct btree_write_bio *wb      = container_of(orig, struct btree_write_bio, wbio);
1835         struct bch_fs *c                = wbio->c;
1836         struct btree *b                 = wbio->bio.bi_private;
1837         struct bch_dev *ca              = bch_dev_bkey_exists(c, wbio->dev);
1838         unsigned long flags;
1839
1840         if (wbio->have_ioref)
1841                 bch2_latency_acct(ca, wbio->submit_time, WRITE);
1842
1843         if (bch2_dev_io_err_on(bio->bi_status, ca, BCH_MEMBER_ERROR_write,
1844                                "btree write error: %s",
1845                                bch2_blk_status_to_str(bio->bi_status)) ||
1846             bch2_meta_write_fault("btree")) {
1847                 spin_lock_irqsave(&c->btree_write_error_lock, flags);
1848                 bch2_dev_list_add_dev(&orig->failed, wbio->dev);
1849                 spin_unlock_irqrestore(&c->btree_write_error_lock, flags);
1850         }
1851
1852         if (wbio->have_ioref)
1853                 percpu_ref_put(&ca->io_ref);
1854
1855         if (parent) {
1856                 bio_put(bio);
1857                 bio_endio(&parent->bio);
1858                 return;
1859         }
1860
1861         clear_btree_node_write_in_flight_inner(b);
1862         wake_up_bit(&b->flags, BTREE_NODE_write_in_flight_inner);
1863         INIT_WORK(&wb->work, btree_node_write_work);
1864         queue_work(c->btree_io_complete_wq, &wb->work);
1865 }
1866
1867 static int validate_bset_for_write(struct bch_fs *c, struct btree *b,
1868                                    struct bset *i, unsigned sectors)
1869 {
1870         struct printbuf buf = PRINTBUF;
1871         bool saw_error;
1872         int ret;
1873
1874         ret = bch2_bkey_invalid(c, bkey_i_to_s_c(&b->key),
1875                                 BKEY_TYPE_btree, WRITE, &buf);
1876
1877         if (ret)
1878                 bch2_fs_inconsistent(c, "invalid btree node key before write: %s", buf.buf);
1879         printbuf_exit(&buf);
1880         if (ret)
1881                 return ret;
1882
1883         ret = validate_bset_keys(c, b, i, WRITE, false, &saw_error) ?:
1884                 validate_bset(c, NULL, b, i, b->written, sectors, WRITE, false, &saw_error);
1885         if (ret) {
1886                 bch2_inconsistent_error(c);
1887                 dump_stack();
1888         }
1889
1890         return ret;
1891 }
1892
1893 static void btree_write_submit(struct work_struct *work)
1894 {
1895         struct btree_write_bio *wbio = container_of(work, struct btree_write_bio, work);
1896         BKEY_PADDED_ONSTACK(k, BKEY_BTREE_PTR_VAL_U64s_MAX) tmp;
1897
1898         bkey_copy(&tmp.k, &wbio->key);
1899
1900         bkey_for_each_ptr(bch2_bkey_ptrs(bkey_i_to_s(&tmp.k)), ptr)
1901                 ptr->offset += wbio->sector_offset;
1902
1903         bch2_submit_wbio_replicas(&wbio->wbio, wbio->wbio.c, BCH_DATA_btree,
1904                                   &tmp.k, false);
1905 }
1906
1907 void __bch2_btree_node_write(struct bch_fs *c, struct btree *b, unsigned flags)
1908 {
1909         struct btree_write_bio *wbio;
1910         struct bset_tree *t;
1911         struct bset *i;
1912         struct btree_node *bn = NULL;
1913         struct btree_node_entry *bne = NULL;
1914         struct sort_iter_stack sort_iter;
1915         struct nonce nonce;
1916         unsigned bytes_to_write, sectors_to_write, bytes, u64s;
1917         u64 seq = 0;
1918         bool used_mempool;
1919         unsigned long old, new;
1920         bool validate_before_checksum = false;
1921         enum btree_write_type type = flags & BTREE_WRITE_TYPE_MASK;
1922         void *data;
1923         int ret;
1924
1925         if (flags & BTREE_WRITE_ALREADY_STARTED)
1926                 goto do_write;
1927
1928         /*
1929          * We may only have a read lock on the btree node - the dirty bit is our
1930          * "lock" against racing with other threads that may be trying to start
1931          * a write, we do a write iff we clear the dirty bit. Since setting the
1932          * dirty bit requires a write lock, we can't race with other threads
1933          * redirtying it:
1934          */
1935         do {
1936                 old = new = READ_ONCE(b->flags);
1937
1938                 if (!(old & (1 << BTREE_NODE_dirty)))
1939                         return;
1940
1941                 if ((flags & BTREE_WRITE_ONLY_IF_NEED) &&
1942                     !(old & (1 << BTREE_NODE_need_write)))
1943                         return;
1944
1945                 if (old &
1946                     ((1 << BTREE_NODE_never_write)|
1947                      (1 << BTREE_NODE_write_blocked)))
1948                         return;
1949
1950                 if (b->written &&
1951                     (old & (1 << BTREE_NODE_will_make_reachable)))
1952                         return;
1953
1954                 if (old & (1 << BTREE_NODE_write_in_flight))
1955                         return;
1956
1957                 if (flags & BTREE_WRITE_ONLY_IF_NEED)
1958                         type = new & BTREE_WRITE_TYPE_MASK;
1959                 new &= ~BTREE_WRITE_TYPE_MASK;
1960
1961                 new &= ~(1 << BTREE_NODE_dirty);
1962                 new &= ~(1 << BTREE_NODE_need_write);
1963                 new |=  (1 << BTREE_NODE_write_in_flight);
1964                 new |=  (1 << BTREE_NODE_write_in_flight_inner);
1965                 new |=  (1 << BTREE_NODE_just_written);
1966                 new ^=  (1 << BTREE_NODE_write_idx);
1967         } while (cmpxchg_acquire(&b->flags, old, new) != old);
1968
1969         if (new & (1U << BTREE_NODE_need_write))
1970                 return;
1971 do_write:
1972         BUG_ON((type == BTREE_WRITE_initial) != (b->written == 0));
1973
1974         atomic_dec(&c->btree_cache.dirty);
1975
1976         BUG_ON(btree_node_fake(b));
1977         BUG_ON((b->will_make_reachable != 0) != !b->written);
1978
1979         BUG_ON(b->written >= btree_sectors(c));
1980         BUG_ON(b->written & (block_sectors(c) - 1));
1981         BUG_ON(bset_written(b, btree_bset_last(b)));
1982         BUG_ON(le64_to_cpu(b->data->magic) != bset_magic(c));
1983         BUG_ON(memcmp(&b->data->format, &b->format, sizeof(b->format)));
1984
1985         bch2_sort_whiteouts(c, b);
1986
1987         sort_iter_stack_init(&sort_iter, b);
1988
1989         bytes = !b->written
1990                 ? sizeof(struct btree_node)
1991                 : sizeof(struct btree_node_entry);
1992
1993         bytes += b->whiteout_u64s * sizeof(u64);
1994
1995         for_each_bset(b, t) {
1996                 i = bset(b, t);
1997
1998                 if (bset_written(b, i))
1999                         continue;
2000
2001                 bytes += le16_to_cpu(i->u64s) * sizeof(u64);
2002                 sort_iter_add(&sort_iter.iter,
2003                               btree_bkey_first(b, t),
2004                               btree_bkey_last(b, t));
2005                 seq = max(seq, le64_to_cpu(i->journal_seq));
2006         }
2007
2008         BUG_ON(b->written && !seq);
2009
2010         /* bch2_varint_decode may read up to 7 bytes past the end of the buffer: */
2011         bytes += 8;
2012
2013         /* buffer must be a multiple of the block size */
2014         bytes = round_up(bytes, block_bytes(c));
2015
2016         data = btree_bounce_alloc(c, bytes, &used_mempool);
2017
2018         if (!b->written) {
2019                 bn = data;
2020                 *bn = *b->data;
2021                 i = &bn->keys;
2022         } else {
2023                 bne = data;
2024                 bne->keys = b->data->keys;
2025                 i = &bne->keys;
2026         }
2027
2028         i->journal_seq  = cpu_to_le64(seq);
2029         i->u64s         = 0;
2030
2031         sort_iter_add(&sort_iter.iter,
2032                       unwritten_whiteouts_start(c, b),
2033                       unwritten_whiteouts_end(c, b));
2034         SET_BSET_SEPARATE_WHITEOUTS(i, false);
2035
2036         b->whiteout_u64s = 0;
2037
2038         u64s = bch2_sort_keys(i->start, &sort_iter.iter, false);
2039         le16_add_cpu(&i->u64s, u64s);
2040
2041         BUG_ON(!b->written && i->u64s != b->data->keys.u64s);
2042
2043         set_needs_whiteout(i, false);
2044
2045         /* do we have data to write? */
2046         if (b->written && !i->u64s)
2047                 goto nowrite;
2048
2049         bytes_to_write = vstruct_end(i) - data;
2050         sectors_to_write = round_up(bytes_to_write, block_bytes(c)) >> 9;
2051
2052         if (!b->written &&
2053             b->key.k.type == KEY_TYPE_btree_ptr_v2)
2054                 BUG_ON(btree_ptr_sectors_written(&b->key) != sectors_to_write);
2055
2056         memset(data + bytes_to_write, 0,
2057                (sectors_to_write << 9) - bytes_to_write);
2058
2059         BUG_ON(b->written + sectors_to_write > btree_sectors(c));
2060         BUG_ON(BSET_BIG_ENDIAN(i) != CPU_BIG_ENDIAN);
2061         BUG_ON(i->seq != b->data->keys.seq);
2062
2063         i->version = cpu_to_le16(c->sb.version);
2064         SET_BSET_OFFSET(i, b->written);
2065         SET_BSET_CSUM_TYPE(i, bch2_meta_checksum_type(c));
2066
2067         if (bch2_csum_type_is_encryption(BSET_CSUM_TYPE(i)))
2068                 validate_before_checksum = true;
2069
2070         /* validate_bset will be modifying: */
2071         if (le16_to_cpu(i->version) < bcachefs_metadata_version_current)
2072                 validate_before_checksum = true;
2073
2074         /* if we're going to be encrypting, check metadata validity first: */
2075         if (validate_before_checksum &&
2076             validate_bset_for_write(c, b, i, sectors_to_write))
2077                 goto err;
2078
2079         ret = bset_encrypt(c, i, b->written << 9);
2080         if (bch2_fs_fatal_err_on(ret, c,
2081                         "error encrypting btree node: %i\n", ret))
2082                 goto err;
2083
2084         nonce = btree_nonce(i, b->written << 9);
2085
2086         if (bn)
2087                 bn->csum = csum_vstruct(c, BSET_CSUM_TYPE(i), nonce, bn);
2088         else
2089                 bne->csum = csum_vstruct(c, BSET_CSUM_TYPE(i), nonce, bne);
2090
2091         /* if we're not encrypting, check metadata after checksumming: */
2092         if (!validate_before_checksum &&
2093             validate_bset_for_write(c, b, i, sectors_to_write))
2094                 goto err;
2095
2096         /*
2097          * We handle btree write errors by immediately halting the journal -
2098          * after we've done that, we can't issue any subsequent btree writes
2099          * because they might have pointers to new nodes that failed to write.
2100          *
2101          * Furthermore, there's no point in doing any more btree writes because
2102          * with the journal stopped, we're never going to update the journal to
2103          * reflect that those writes were done and the data flushed from the
2104          * journal:
2105          *
2106          * Also on journal error, the pending write may have updates that were
2107          * never journalled (interior nodes, see btree_update_nodes_written()) -
2108          * it's critical that we don't do the write in that case otherwise we
2109          * will have updates visible that weren't in the journal:
2110          *
2111          * Make sure to update b->written so bch2_btree_init_next() doesn't
2112          * break:
2113          */
2114         if (bch2_journal_error(&c->journal) ||
2115             c->opts.nochanges)
2116                 goto err;
2117
2118         trace_and_count(c, btree_node_write, b, bytes_to_write, sectors_to_write);
2119
2120         wbio = container_of(bio_alloc_bioset(NULL,
2121                                 buf_pages(data, sectors_to_write << 9),
2122                                 REQ_OP_WRITE|REQ_META,
2123                                 GFP_NOFS,
2124                                 &c->btree_bio),
2125                             struct btree_write_bio, wbio.bio);
2126         wbio_init(&wbio->wbio.bio);
2127         wbio->data                      = data;
2128         wbio->data_bytes                = bytes;
2129         wbio->sector_offset             = b->written;
2130         wbio->wbio.c                    = c;
2131         wbio->wbio.used_mempool         = used_mempool;
2132         wbio->wbio.first_btree_write    = !b->written;
2133         wbio->wbio.bio.bi_end_io        = btree_node_write_endio;
2134         wbio->wbio.bio.bi_private       = b;
2135
2136         bch2_bio_map(&wbio->wbio.bio, data, sectors_to_write << 9);
2137
2138         bkey_copy(&wbio->key, &b->key);
2139
2140         b->written += sectors_to_write;
2141
2142         if (wbio->key.k.type == KEY_TYPE_btree_ptr_v2)
2143                 bkey_i_to_btree_ptr_v2(&wbio->key)->v.sectors_written =
2144                         cpu_to_le16(b->written);
2145
2146         atomic64_inc(&c->btree_write_stats[type].nr);
2147         atomic64_add(bytes_to_write, &c->btree_write_stats[type].bytes);
2148
2149         INIT_WORK(&wbio->work, btree_write_submit);
2150         queue_work(c->io_complete_wq, &wbio->work);
2151         return;
2152 err:
2153         set_btree_node_noevict(b);
2154         b->written += sectors_to_write;
2155 nowrite:
2156         btree_bounce_free(c, bytes, used_mempool, data);
2157         __btree_node_write_done(c, b);
2158 }
2159
2160 /*
2161  * Work that must be done with write lock held:
2162  */
2163 bool bch2_btree_post_write_cleanup(struct bch_fs *c, struct btree *b)
2164 {
2165         bool invalidated_iter = false;
2166         struct btree_node_entry *bne;
2167         struct bset_tree *t;
2168
2169         if (!btree_node_just_written(b))
2170                 return false;
2171
2172         BUG_ON(b->whiteout_u64s);
2173
2174         clear_btree_node_just_written(b);
2175
2176         /*
2177          * Note: immediately after write, bset_written() doesn't work - the
2178          * amount of data we had to write after compaction might have been
2179          * smaller than the offset of the last bset.
2180          *
2181          * However, we know that all bsets have been written here, as long as
2182          * we're still holding the write lock:
2183          */
2184
2185         /*
2186          * XXX: decide if we really want to unconditionally sort down to a
2187          * single bset:
2188          */
2189         if (b->nsets > 1) {
2190                 btree_node_sort(c, b, 0, b->nsets, true);
2191                 invalidated_iter = true;
2192         } else {
2193                 invalidated_iter = bch2_drop_whiteouts(b, COMPACT_ALL);
2194         }
2195
2196         for_each_bset(b, t)
2197                 set_needs_whiteout(bset(b, t), true);
2198
2199         bch2_btree_verify(c, b);
2200
2201         /*
2202          * If later we don't unconditionally sort down to a single bset, we have
2203          * to ensure this is still true:
2204          */
2205         BUG_ON((void *) btree_bkey_last(b, bset_tree_last(b)) > write_block(b));
2206
2207         bne = want_new_bset(c, b);
2208         if (bne)
2209                 bch2_bset_init_next(c, b, bne);
2210
2211         bch2_btree_build_aux_trees(b);
2212
2213         return invalidated_iter;
2214 }
2215
2216 /*
2217  * Use this one if the node is intent locked:
2218  */
2219 void bch2_btree_node_write(struct bch_fs *c, struct btree *b,
2220                            enum six_lock_type lock_type_held,
2221                            unsigned flags)
2222 {
2223         if (lock_type_held == SIX_LOCK_intent ||
2224             (lock_type_held == SIX_LOCK_read &&
2225              six_lock_tryupgrade(&b->c.lock))) {
2226                 __bch2_btree_node_write(c, b, flags);
2227
2228                 /* don't cycle lock unnecessarily: */
2229                 if (btree_node_just_written(b) &&
2230                     six_trylock_write(&b->c.lock)) {
2231                         bch2_btree_post_write_cleanup(c, b);
2232                         six_unlock_write(&b->c.lock);
2233                 }
2234
2235                 if (lock_type_held == SIX_LOCK_read)
2236                         six_lock_downgrade(&b->c.lock);
2237         } else {
2238                 __bch2_btree_node_write(c, b, flags);
2239                 if (lock_type_held == SIX_LOCK_write &&
2240                     btree_node_just_written(b))
2241                         bch2_btree_post_write_cleanup(c, b);
2242         }
2243 }
2244
2245 static bool __bch2_btree_flush_all(struct bch_fs *c, unsigned flag)
2246 {
2247         struct bucket_table *tbl;
2248         struct rhash_head *pos;
2249         struct btree *b;
2250         unsigned i;
2251         bool ret = false;
2252 restart:
2253         rcu_read_lock();
2254         for_each_cached_btree(b, c, tbl, i, pos)
2255                 if (test_bit(flag, &b->flags)) {
2256                         rcu_read_unlock();
2257                         wait_on_bit_io(&b->flags, flag, TASK_UNINTERRUPTIBLE);
2258                         ret = true;
2259                         goto restart;
2260                 }
2261         rcu_read_unlock();
2262
2263         return ret;
2264 }
2265
2266 bool bch2_btree_flush_all_reads(struct bch_fs *c)
2267 {
2268         return __bch2_btree_flush_all(c, BTREE_NODE_read_in_flight);
2269 }
2270
2271 bool bch2_btree_flush_all_writes(struct bch_fs *c)
2272 {
2273         return __bch2_btree_flush_all(c, BTREE_NODE_write_in_flight);
2274 }
2275
2276 static const char * const bch2_btree_write_types[] = {
2277 #define x(t, n) [n] = #t,
2278         BCH_BTREE_WRITE_TYPES()
2279         NULL
2280 };
2281
2282 void bch2_btree_write_stats_to_text(struct printbuf *out, struct bch_fs *c)
2283 {
2284         printbuf_tabstop_push(out, 20);
2285         printbuf_tabstop_push(out, 10);
2286
2287         prt_tab(out);
2288         prt_str(out, "nr");
2289         prt_tab(out);
2290         prt_str(out, "size");
2291         prt_newline(out);
2292
2293         for (unsigned i = 0; i < BTREE_WRITE_TYPE_NR; i++) {
2294                 u64 nr          = atomic64_read(&c->btree_write_stats[i].nr);
2295                 u64 bytes       = atomic64_read(&c->btree_write_stats[i].bytes);
2296
2297                 prt_printf(out, "%s:", bch2_btree_write_types[i]);
2298                 prt_tab(out);
2299                 prt_u64(out, nr);
2300                 prt_tab(out);
2301                 prt_human_readable_u64(out, nr ? div64_u64(bytes, nr) : 0);
2302                 prt_newline(out);
2303         }
2304 }