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.h"
  18 #include "journal_reclaim.h"
  19 #include "journal_seq_blacklist.h"
  20 #include "super-io.h"
  21
  22 #include <linux/sched/mm.h>
  23 #include <trace/events/bcachefs.h>
  24
  25 static void verify_no_dups(struct btree *b,
  26                            struct bkey_packed *start,
  27                            struct bkey_packed *end)
  28 {
  29 #ifdef CONFIG_BCACHEFS_DEBUG
  30         struct bkey_packed *k, *p;
  31
  32         if (start == end)
  33                 return;
  34
  35         for (p = start, k = bkey_next(start);
  36              k != end;
  37              p = k, k = bkey_next(k)) {
  38                 struct bkey l = bkey_unpack_key(b, p);
  39                 struct bkey r = bkey_unpack_key(b, k);
  40
  41                 BUG_ON(bpos_cmp(l.p, bkey_start_pos(&r)) >= 0);
  42         }
  43 #endif
  44 }
  45
  46 static void set_needs_whiteout(struct bset *i, int v)
  47 {
  48         struct bkey_packed *k;
  49
  50         for (k = i->start; k != vstruct_last(i); k = bkey_next(k))
  51                 k->needs_whiteout = v;
  52 }
  53
  54 static void btree_bounce_free(struct bch_fs *c, size_t size,
  55                               bool used_mempool, void *p)
  56 {
  57         if (used_mempool)
  58                 mempool_free(p, &c->btree_bounce_pool);
  59         else
  60                 vpfree(p, size);
  61 }
  62
  63 static void *btree_bounce_alloc(struct bch_fs *c, size_t size,
  64                                 bool *used_mempool)
  65 {
  66         unsigned flags = memalloc_nofs_save();
  67         void *p;
  68
  69         BUG_ON(size > btree_bytes(c));
  70
  71         *used_mempool = false;
  72         p = vpmalloc(size, __GFP_NOWARN|GFP_NOWAIT);
  73         if (!p) {
  74                 *used_mempool = true;
  75                 p = mempool_alloc(&c->btree_bounce_pool, GFP_NOIO);
  76         }
  77         memalloc_nofs_restore(flags);
  78         return p;
  79 }
  80
  81 static void sort_bkey_ptrs(const struct btree *bt,
  82                            struct bkey_packed **ptrs, unsigned nr)
  83 {
  84         unsigned n = nr, a = nr / 2, b, c, d;
  85
  86         if (!a)
  87                 return;
  88
  89         /* Heap sort: see lib/sort.c: */
  90         while (1) {
  91                 if (a)
  92                         a--;
  93                 else if (--n)
  94                         swap(ptrs[0], ptrs[n]);
  95                 else
  96                         break;
  97
  98                 for (b = a; c = 2 * b + 1, (d = c + 1) < n;)
  99                         b = bch2_bkey_cmp_packed(bt,
 100                                             ptrs[c],
 101                                             ptrs[d]) >= 0 ? c : d;
 102                 if (d == n)
 103                         b = c;
 104
 105                 while (b != a &&
 106                        bch2_bkey_cmp_packed(bt,
 107                                        ptrs[a],
 108                                        ptrs[b]) >= 0)
 109                         b = (b - 1) / 2;
 110                 c = b;
 111                 while (b != a) {
 112                         b = (b - 1) / 2;
 113                         swap(ptrs[b], ptrs[c]);
 114                 }
 115         }
 116 }
 117
 118 static void bch2_sort_whiteouts(struct bch_fs *c, struct btree *b)
 119 {
 120         struct bkey_packed *new_whiteouts, **ptrs, **ptrs_end, *k;
 121         bool used_mempool = false;
 122         size_t bytes = b->whiteout_u64s * sizeof(u64);
 123
 124         if (!b->whiteout_u64s)
 125                 return;
 126
 127         new_whiteouts = btree_bounce_alloc(c, bytes, &used_mempool);
 128
 129         ptrs = ptrs_end = ((void *) new_whiteouts + bytes);
 130
 131         for (k = unwritten_whiteouts_start(c, b);
 132              k != unwritten_whiteouts_end(c, b);
 133              k = bkey_next(k))
 134                 *--ptrs = k;
 135
 136         sort_bkey_ptrs(b, ptrs, ptrs_end - ptrs);
 137
 138         k = new_whiteouts;
 139
 140         while (ptrs != ptrs_end) {
 141                 bkey_copy(k, *ptrs);
 142                 k = bkey_next(k);
 143                 ptrs++;
 144         }
 145
 146         verify_no_dups(b, new_whiteouts,
 147                        (void *) ((u64 *) new_whiteouts + b->whiteout_u64s));
 148
 149         memcpy_u64s(unwritten_whiteouts_start(c, b),
 150                     new_whiteouts, b->whiteout_u64s);
 151
 152         btree_bounce_free(c, bytes, used_mempool, new_whiteouts);
 153 }
 154
 155 static bool should_compact_bset(struct btree *b, struct bset_tree *t,
 156                                 bool compacting, enum compact_mode mode)
 157 {
 158         if (!bset_dead_u64s(b, t))
 159                 return false;
 160
 161         switch (mode) {
 162         case COMPACT_LAZY:
 163                 return should_compact_bset_lazy(b, t) ||
 164                         (compacting && !bset_written(b, bset(b, t)));
 165         case COMPACT_ALL:
 166                 return true;
 167         default:
 168                 BUG();
 169         }
 170 }
 171
 172 static bool bch2_drop_whiteouts(struct btree *b, enum compact_mode mode)
 173 {
 174         struct bset_tree *t;
 175         bool ret = false;
 176
 177         for_each_bset(b, t) {
 178                 struct bset *i = bset(b, t);
 179                 struct bkey_packed *k, *n, *out, *start, *end;
 180                 struct btree_node_entry *src = NULL, *dst = NULL;
 181
 182                 if (t != b->set && !bset_written(b, i)) {
 183                         src = container_of(i, struct btree_node_entry, keys);
 184                         dst = max(write_block(b),
 185                                   (void *) btree_bkey_last(b, t - 1));
 186                 }
 187
 188                 if (src != dst)
 189                         ret = true;
 190
 191                 if (!should_compact_bset(b, t, ret, mode)) {
 192                         if (src != dst) {
 193                                 memmove(dst, src, sizeof(*src) +
 194                                         le16_to_cpu(src->keys.u64s) *
 195                                         sizeof(u64));
 196                                 i = &dst->keys;
 197                                 set_btree_bset(b, t, i);
 198                         }
 199                         continue;
 200                 }
 201
 202                 start   = btree_bkey_first(b, t);
 203                 end     = btree_bkey_last(b, t);
 204
 205                 if (src != dst) {
 206                         memmove(dst, src, sizeof(*src));
 207                         i = &dst->keys;
 208                         set_btree_bset(b, t, i);
 209                 }
 210
 211                 out = i->start;
 212
 213                 for (k = start; k != end; k = n) {
 214                         n = bkey_next(k);
 215
 216                         if (!bkey_deleted(k)) {
 217                                 bkey_copy(out, k);
 218                                 out = bkey_next(out);
 219                         } else {
 220                                 BUG_ON(k->needs_whiteout);
 221                         }
 222                 }
 223
 224                 i->u64s = cpu_to_le16((u64 *) out - i->_data);
 225                 set_btree_bset_end(b, t);
 226                 bch2_bset_set_no_aux_tree(b, t);
 227                 ret = true;
 228         }
 229
 230         bch2_verify_btree_nr_keys(b);
 231
 232         bch2_btree_build_aux_trees(b);
 233
 234         return ret;
 235 }
 236
 237 bool bch2_compact_whiteouts(struct bch_fs *c, struct btree *b,
 238                             enum compact_mode mode)
 239 {
 240         return bch2_drop_whiteouts(b, mode);
 241 }
 242
 243 static void btree_node_sort(struct bch_fs *c, struct btree *b,
 244                             unsigned start_idx,
 245                             unsigned end_idx,
 246                             bool filter_whiteouts)
 247 {
 248         struct btree_node *out;
 249         struct sort_iter sort_iter;
 250         struct bset_tree *t;
 251         struct bset *start_bset = bset(b, &b->set[start_idx]);
 252         bool used_mempool = false;
 253         u64 start_time, seq = 0;
 254         unsigned i, u64s = 0, bytes, shift = end_idx - start_idx - 1;
 255         bool sorting_entire_node = start_idx == 0 &&
 256                 end_idx == b->nsets;
 257
 258         sort_iter_init(&sort_iter, b);
 259
 260         for (t = b->set + start_idx;
 261              t < b->set + end_idx;
 262              t++) {
 263                 u64s += le16_to_cpu(bset(b, t)->u64s);
 264                 sort_iter_add(&sort_iter,
 265                               btree_bkey_first(b, t),
 266                               btree_bkey_last(b, t));
 267         }
 268
 269         bytes = sorting_entire_node
 270                 ? btree_bytes(c)
 271                 : __vstruct_bytes(struct btree_node, u64s);
 272
 273         out = btree_bounce_alloc(c, bytes, &used_mempool);
 274
 275         start_time = local_clock();
 276
 277         u64s = bch2_sort_keys(out->keys.start, &sort_iter, filter_whiteouts);
 278
 279         out->keys.u64s = cpu_to_le16(u64s);
 280
 281         BUG_ON(vstruct_end(&out->keys) > (void *) out + bytes);
 282
 283         if (sorting_entire_node)
 284                 bch2_time_stats_update(&c->times[BCH_TIME_btree_node_sort],
 285                                        start_time);
 286
 287         /* Make sure we preserve bset journal_seq: */
 288         for (t = b->set + start_idx; t < b->set + end_idx; t++)
 289                 seq = max(seq, le64_to_cpu(bset(b, t)->journal_seq));
 290         start_bset->journal_seq = cpu_to_le64(seq);
 291
 292         if (sorting_entire_node) {
 293                 unsigned u64s = le16_to_cpu(out->keys.u64s);
 294
 295                 BUG_ON(bytes != btree_bytes(c));
 296
 297                 /*
 298                  * Our temporary buffer is the same size as the btree node's
 299                  * buffer, we can just swap buffers instead of doing a big
 300                  * memcpy()
 301                  */
 302                 *out = *b->data;
 303                 out->keys.u64s = cpu_to_le16(u64s);
 304                 swap(out, b->data);
 305                 set_btree_bset(b, b->set, &b->data->keys);
 306         } else {
 307                 start_bset->u64s = out->keys.u64s;
 308                 memcpy_u64s(start_bset->start,
 309                             out->keys.start,
 310                             le16_to_cpu(out->keys.u64s));
 311         }
 312
 313         for (i = start_idx + 1; i < end_idx; i++)
 314                 b->nr.bset_u64s[start_idx] +=
 315                         b->nr.bset_u64s[i];
 316
 317         b->nsets -= shift;
 318
 319         for (i = start_idx + 1; i < b->nsets; i++) {
 320                 b->nr.bset_u64s[i]      = b->nr.bset_u64s[i + shift];
 321                 b->set[i]               = b->set[i + shift];
 322         }
 323
 324         for (i = b->nsets; i < MAX_BSETS; i++)
 325                 b->nr.bset_u64s[i] = 0;
 326
 327         set_btree_bset_end(b, &b->set[start_idx]);
 328         bch2_bset_set_no_aux_tree(b, &b->set[start_idx]);
 329
 330         btree_bounce_free(c, bytes, used_mempool, out);
 331
 332         bch2_verify_btree_nr_keys(b);
 333 }
 334
 335 void bch2_btree_sort_into(struct bch_fs *c,
 336                          struct btree *dst,
 337                          struct btree *src)
 338 {
 339         struct btree_nr_keys nr;
 340         struct btree_node_iter src_iter;
 341         u64 start_time = local_clock();
 342
 343         BUG_ON(dst->nsets != 1);
 344
 345         bch2_bset_set_no_aux_tree(dst, dst->set);
 346
 347         bch2_btree_node_iter_init_from_start(&src_iter, src);
 348
 349         if (btree_node_is_extents(src))
 350                 nr = bch2_sort_repack_merge(c, btree_bset_first(dst),
 351                                 src, &src_iter,
 352                                 &dst->format,
 353                                 true);
 354         else
 355                 nr = bch2_sort_repack(btree_bset_first(dst),
 356                                 src, &src_iter,
 357                                 &dst->format,
 358                                 true);
 359
 360         bch2_time_stats_update(&c->times[BCH_TIME_btree_node_sort],
 361                                start_time);
 362
 363         set_btree_bset_end(dst, dst->set);
 364
 365         dst->nr.live_u64s       += nr.live_u64s;
 366         dst->nr.bset_u64s[0]    += nr.bset_u64s[0];
 367         dst->nr.packed_keys     += nr.packed_keys;
 368         dst->nr.unpacked_keys   += nr.unpacked_keys;
 369
 370         bch2_verify_btree_nr_keys(dst);
 371 }
 372
 373 #define SORT_CRIT       (4096 / sizeof(u64))
 374
 375 /*
 376  * We're about to add another bset to the btree node, so if there's currently
 377  * too many bsets - sort some of them together:
 378  */
 379 static bool btree_node_compact(struct bch_fs *c, struct btree *b)
 380 {
 381         unsigned unwritten_idx;
 382         bool ret = false;
 383
 384         for (unwritten_idx = 0;
 385              unwritten_idx < b->nsets;
 386              unwritten_idx++)
 387                 if (!bset_written(b, bset(b, &b->set[unwritten_idx])))
 388                         break;
 389
 390         if (b->nsets - unwritten_idx > 1) {
 391                 btree_node_sort(c, b, unwritten_idx,
 392                                 b->nsets, false);
 393                 ret = true;
 394         }
 395
 396         if (unwritten_idx > 1) {
 397                 btree_node_sort(c, b, 0, unwritten_idx, false);
 398                 ret = true;
 399         }
 400
 401         return ret;
 402 }
 403
 404 void bch2_btree_build_aux_trees(struct btree *b)
 405 {
 406         struct bset_tree *t;
 407
 408         for_each_bset(b, t)
 409                 bch2_bset_build_aux_tree(b, t,
 410                                 !bset_written(b, bset(b, t)) &&
 411                                 t == bset_tree_last(b));
 412 }
 413
 414 /*
 415  * @bch_btree_init_next - initialize a new (unwritten) bset that can then be
 416  * inserted into
 417  *
 418  * Safe to call if there already is an unwritten bset - will only add a new bset
 419  * if @b doesn't already have one.
 420  *
 421  * Returns true if we sorted (i.e. invalidated iterators
 422  */
 423 void bch2_btree_init_next(struct bch_fs *c, struct btree *b,
 424                           struct btree_iter *iter)
 425 {
 426         struct btree_node_entry *bne;
 427         bool reinit_iter = false;
 428
 429         EBUG_ON(!(b->c.lock.state.seq & 1));
 430         EBUG_ON(iter && iter->l[b->c.level].b != b);
 431         BUG_ON(bset_written(b, bset(b, &b->set[1])));
 432
 433         if (b->nsets == MAX_BSETS) {
 434                 unsigned log_u64s[] = {
 435                         ilog2(bset_u64s(&b->set[0])),
 436                         ilog2(bset_u64s(&b->set[1])),
 437                         ilog2(bset_u64s(&b->set[2])),
 438                 };
 439
 440                 if (log_u64s[1] >= (log_u64s[0] + log_u64s[2]) / 2) {
 441                         bch2_btree_node_write(c, b, SIX_LOCK_write);
 442                         reinit_iter = true;
 443                 }
 444         }
 445
 446         if (b->nsets == MAX_BSETS &&
 447             btree_node_compact(c, b))
 448                 reinit_iter = true;
 449
 450         BUG_ON(b->nsets >= MAX_BSETS);
 451
 452         bne = want_new_bset(c, b);
 453         if (bne)
 454                 bch2_bset_init_next(c, b, bne);
 455
 456         bch2_btree_build_aux_trees(b);
 457
 458         if (iter && reinit_iter)
 459                 bch2_btree_iter_reinit_node(iter, b);
 460 }
 461
 462 static void btree_pos_to_text(struct printbuf *out, struct bch_fs *c,
 463                           struct btree *b)
 464 {
 465         pr_buf(out, "%s level %u/%u\n  ",
 466                bch2_btree_ids[b->c.btree_id],
 467                b->c.level,
 468                c->btree_roots[b->c.btree_id].level);
 469         bch2_bkey_val_to_text(out, c, bkey_i_to_s_c(&b->key));
 470 }
 471
 472 static void btree_err_msg(struct printbuf *out, struct bch_fs *c,
 473                           struct bch_dev *ca,
 474                           struct btree *b, struct bset *i,
 475                           unsigned offset, int write)
 476 {
 477         pr_buf(out, "error validating btree node ");
 478         if (write)
 479                 pr_buf(out, "before write ");
 480         if (ca)
 481                 pr_buf(out, "on %s ", ca->name);
 482         pr_buf(out, "at btree ");
 483         btree_pos_to_text(out, c, b);
 484
 485         pr_buf(out, "\n  node offset %u", b->written);
 486         if (i)
 487                 pr_buf(out, " bset u64s %u", le16_to_cpu(i->u64s));
 488 }
 489
 490 enum btree_err_type {
 491         BTREE_ERR_FIXABLE,
 492         BTREE_ERR_WANT_RETRY,
 493         BTREE_ERR_MUST_RETRY,
 494         BTREE_ERR_FATAL,
 495 };
 496
 497 enum btree_validate_ret {
 498         BTREE_RETRY_READ = 64,
 499 };
 500
 501 #define btree_err(type, c, ca, b, i, msg, ...)                          \
 502 ({                                                                      \
 503         __label__ out;                                                  \
 504         char _buf[300];                                                 \
 505         char *_buf2 = _buf;                                             \
 506         struct printbuf out = PBUF(_buf);                               \
 507                                                                         \
 508         _buf2 = kmalloc(4096, GFP_ATOMIC);                              \
 509         if (_buf2)                                                      \
 510                 out = _PBUF(_buf2, 4986);                               \
 511                                                                         \
 512         btree_err_msg(&out, c, ca, b, i, b->written, write);            \
 513         pr_buf(&out, ": " msg, ##__VA_ARGS__);                          \
 514                                                                         \
 515         if (type == BTREE_ERR_FIXABLE &&                                \
 516             write == READ &&                                            \
 517             !test_bit(BCH_FS_INITIAL_GC_DONE, &c->flags)) {             \
 518                 mustfix_fsck_err(c, "%s", _buf2);                       \
 519                 goto out;                                               \
 520         }                                                               \
 521                                                                         \
 522         switch (write) {                                                \
 523         case READ:                                                      \
 524                 bch_err(c, "%s", _buf2);                                        \
 525                                                                         \
 526                 switch (type) {                                         \
 527                 case BTREE_ERR_FIXABLE:                                 \
 528                         ret = BCH_FSCK_ERRORS_NOT_FIXED;                \
 529                         goto fsck_err;                                  \
 530                 case BTREE_ERR_WANT_RETRY:                              \
 531                         if (have_retry) {                               \
 532                                 ret = BTREE_RETRY_READ;                 \
 533                                 goto fsck_err;                          \
 534                         }                                               \
 535                         break;                                          \
 536                 case BTREE_ERR_MUST_RETRY:                              \
 537                         ret = BTREE_RETRY_READ;                         \
 538                         goto fsck_err;                                  \
 539                 case BTREE_ERR_FATAL:                                   \
 540                         ret = BCH_FSCK_ERRORS_NOT_FIXED;                \
 541                         goto fsck_err;                                  \
 542                 }                                                       \
 543                 break;                                                  \
 544         case WRITE:                                                     \
 545                 bch_err(c, "corrupt metadata before write: %s", _buf2); \
 546                                                                         \
 547                 if (bch2_fs_inconsistent(c)) {                          \
 548                         ret = BCH_FSCK_ERRORS_NOT_FIXED;                \
 549                         goto fsck_err;                                  \
 550                 }                                                       \
 551                 break;                                                  \
 552         }                                                               \
 553 out:                                                                    \
 554         if (_buf2 != _buf)                                              \
 555                 kfree(_buf2);                                           \
 556         true;                                                           \
 557 })
 558
 559 #define btree_err_on(cond, ...) ((cond) ? btree_err(__VA_ARGS__) : false)
 560
 561 /*
 562  * When btree topology repair changes the start or end of a node, that might
 563  * mean we have to drop keys that are no longer inside the node:
 564  */
 565 void bch2_btree_node_drop_keys_outside_node(struct btree *b)
 566 {
 567         struct bset_tree *t;
 568
 569         for_each_bset(b, t) {
 570                 struct bset *i = bset(b, t);
 571                 struct bkey_packed *k;
 572
 573                 for (k = i->start; k != vstruct_last(i); k = bkey_next(k))
 574                         if (bkey_cmp_left_packed(b, k, &b->data->min_key) < 0)
 575                                 break;
 576
 577                 if (k != i->start) {
 578                         unsigned shift = (u64 *) k - (u64 *) i->start;
 579
 580                         memmove_u64s_down(i->start, k,
 581                                           (u64 *) vstruct_end(i) - (u64 *) k);
 582                         i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - shift);
 583                         set_btree_bset_end(b, t);
 584                         bch2_bset_set_no_aux_tree(b, t);
 585                 }
 586
 587                 for (k = i->start; k != vstruct_last(i); k = bkey_next(k))
 588                         if (bkey_cmp_left_packed(b, k, &b->data->max_key) > 0)
 589                                 break;
 590
 591                 if (k != vstruct_last(i)) {
 592                         i->u64s = cpu_to_le16((u64 *) k - (u64 *) i->start);
 593                         set_btree_bset_end(b, t);
 594                         bch2_bset_set_no_aux_tree(b, t);
 595                 }
 596         }
 597
 598         bch2_btree_build_aux_trees(b);
 599 }
 600
 601 static int validate_bset(struct bch_fs *c, struct bch_dev *ca,
 602                          struct btree *b, struct bset *i,
 603                          unsigned sectors, int write, bool have_retry)
 604 {
 605         unsigned version = le16_to_cpu(i->version);
 606         const char *err;
 607         char buf1[100];
 608         char buf2[100];
 609         int ret = 0;
 610
 611         btree_err_on((version != BCH_BSET_VERSION_OLD &&
 612                       version < bcachefs_metadata_version_min) ||
 613                      version >= bcachefs_metadata_version_max,
 614                      BTREE_ERR_FATAL, c, ca, b, i,
 615                      "unsupported bset version");
 616
 617         if (btree_err_on(version < c->sb.version_min,
 618                          BTREE_ERR_FIXABLE, c, NULL, b, i,
 619                          "bset version %u older than superblock version_min %u",
 620                          version, c->sb.version_min)) {
 621                 mutex_lock(&c->sb_lock);
 622                 c->disk_sb.sb->version_min = cpu_to_le16(version);
 623                 bch2_write_super(c);
 624                 mutex_unlock(&c->sb_lock);
 625         }
 626
 627         if (btree_err_on(version > c->sb.version,
 628                          BTREE_ERR_FIXABLE, c, NULL, b, i,
 629                          "bset version %u newer than superblock version %u",
 630                          version, c->sb.version)) {
 631                 mutex_lock(&c->sb_lock);
 632                 c->disk_sb.sb->version = cpu_to_le16(version);
 633                 bch2_write_super(c);
 634                 mutex_unlock(&c->sb_lock);
 635         }
 636
 637         btree_err_on(BSET_SEPARATE_WHITEOUTS(i),
 638                      BTREE_ERR_FATAL, c, ca, b, i,
 639                      "BSET_SEPARATE_WHITEOUTS no longer supported");
 640
 641         if (btree_err_on(b->written + sectors > c->opts.btree_node_size,
 642                          BTREE_ERR_FIXABLE, c, ca, b, i,
 643                          "bset past end of btree node")) {
 644                 i->u64s = 0;
 645                 return 0;
 646         }
 647
 648         btree_err_on(b->written && !i->u64s,
 649                      BTREE_ERR_FIXABLE, c, ca, b, i,
 650                      "empty bset");
 651
 652         if (!b->written) {
 653                 struct btree_node *bn =
 654                         container_of(i, struct btree_node, keys);
 655                 /* These indicate that we read the wrong btree node: */
 656
 657                 if (b->key.k.type == KEY_TYPE_btree_ptr_v2) {
 658                         struct bch_btree_ptr_v2 *bp =
 659                                 &bkey_i_to_btree_ptr_v2(&b->key)->v;
 660
 661                         /* XXX endianness */
 662                         btree_err_on(bp->seq != bn->keys.seq,
 663                                      BTREE_ERR_MUST_RETRY, c, ca, b, NULL,
 664                                      "incorrect sequence number (wrong btree node)");
 665                 }
 666
 667                 btree_err_on(BTREE_NODE_ID(bn) != b->c.btree_id,
 668                              BTREE_ERR_MUST_RETRY, c, ca, b, i,
 669                              "incorrect btree id");
 670
 671                 btree_err_on(BTREE_NODE_LEVEL(bn) != b->c.level,
 672                              BTREE_ERR_MUST_RETRY, c, ca, b, i,
 673                              "incorrect level");
 674
 675                 if (!write)
 676                         compat_btree_node(b->c.level, b->c.btree_id, version,
 677                                           BSET_BIG_ENDIAN(i), write, bn);
 678
 679                 if (b->key.k.type == KEY_TYPE_btree_ptr_v2) {
 680                         struct bch_btree_ptr_v2 *bp =
 681                                 &bkey_i_to_btree_ptr_v2(&b->key)->v;
 682
 683                         if (BTREE_PTR_RANGE_UPDATED(bp)) {
 684                                 b->data->min_key = bp->min_key;
 685                                 b->data->max_key = b->key.k.p;
 686                         }
 687
 688                         btree_err_on(bpos_cmp(b->data->min_key, bp->min_key),
 689                                      BTREE_ERR_MUST_RETRY, c, ca, b, NULL,
 690                                      "incorrect min_key: got %s should be %s",
 691                                      (bch2_bpos_to_text(&PBUF(buf1), bn->min_key), buf1),
 692                                      (bch2_bpos_to_text(&PBUF(buf2), bp->min_key), buf2));
 693                 }
 694
 695                 btree_err_on(bpos_cmp(bn->max_key, b->key.k.p),
 696                              BTREE_ERR_MUST_RETRY, c, ca, b, i,
 697                              "incorrect max key %s",
 698                              (bch2_bpos_to_text(&PBUF(buf1), bn->max_key), buf1));
 699
 700                 if (write)
 701                         compat_btree_node(b->c.level, b->c.btree_id, version,
 702                                           BSET_BIG_ENDIAN(i), write, bn);
 703
 704                 err = bch2_bkey_format_validate(&bn->format);
 705                 btree_err_on(err,
 706                              BTREE_ERR_FATAL, c, ca, b, i,
 707                              "invalid bkey format: %s", err);
 708
 709                 compat_bformat(b->c.level, b->c.btree_id, version,
 710                                BSET_BIG_ENDIAN(i), write,
 711                                &bn->format);
 712         }
 713 fsck_err:
 714         return ret;
 715 }
 716
 717 static int validate_bset_keys(struct bch_fs *c, struct btree *b,
 718                          struct bset *i, unsigned *whiteout_u64s,
 719                          int write, bool have_retry)
 720 {
 721         unsigned version = le16_to_cpu(i->version);
 722         struct bkey_packed *k, *prev = NULL;
 723         bool updated_range = b->key.k.type == KEY_TYPE_btree_ptr_v2 &&
 724                 BTREE_PTR_RANGE_UPDATED(&bkey_i_to_btree_ptr_v2(&b->key)->v);
 725         int ret = 0;
 726
 727         for (k = i->start;
 728              k != vstruct_last(i);) {
 729                 struct bkey_s u;
 730                 struct bkey tmp;
 731                 const char *invalid;
 732
 733                 if (btree_err_on(bkey_next(k) > vstruct_last(i),
 734                                  BTREE_ERR_FIXABLE, c, NULL, b, i,
 735                                  "key extends past end of bset")) {
 736                         i->u64s = cpu_to_le16((u64 *) k - i->_data);
 737                         break;
 738                 }
 739
 740                 if (btree_err_on(k->format > KEY_FORMAT_CURRENT,
 741                                  BTREE_ERR_FIXABLE, c, NULL, b, i,
 742                                  "invalid bkey format %u", k->format)) {
 743                         i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - k->u64s);
 744                         memmove_u64s_down(k, bkey_next(k),
 745                                           (u64 *) vstruct_end(i) - (u64 *) k);
 746                         continue;
 747                 }
 748
 749                 /* XXX: validate k->u64s */
 750                 if (!write)
 751                         bch2_bkey_compat(b->c.level, b->c.btree_id, version,
 752                                     BSET_BIG_ENDIAN(i), write,
 753                                     &b->format, k);
 754
 755                 u = __bkey_disassemble(b, k, &tmp);
 756
 757                 invalid = __bch2_bkey_invalid(c, u.s_c, btree_node_type(b)) ?:
 758                         (!updated_range ?  bch2_bkey_in_btree_node(b, u.s_c) : NULL) ?:
 759                         (write ? bch2_bkey_val_invalid(c, u.s_c) : NULL);
 760                 if (invalid) {
 761                         char buf[160];
 762
 763                         bch2_bkey_val_to_text(&PBUF(buf), c, u.s_c);
 764                         btree_err(BTREE_ERR_FIXABLE, c, NULL, b, i,
 765                                   "invalid bkey: %s\n%s", invalid, buf);
 766
 767                         i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - k->u64s);
 768                         memmove_u64s_down(k, bkey_next(k),
 769                                           (u64 *) vstruct_end(i) - (u64 *) k);
 770                         continue;
 771                 }
 772
 773                 if (write)
 774                         bch2_bkey_compat(b->c.level, b->c.btree_id, version,
 775                                     BSET_BIG_ENDIAN(i), write,
 776                                     &b->format, k);
 777
 778                 if (prev && bkey_iter_cmp(b, prev, k) > 0) {
 779                         char buf1[80];
 780                         char buf2[80];
 781                         struct bkey up = bkey_unpack_key(b, prev);
 782
 783                         bch2_bkey_to_text(&PBUF(buf1), &up);
 784                         bch2_bkey_to_text(&PBUF(buf2), u.k);
 785
 786                         bch2_dump_bset(c, b, i, 0);
 787
 788                         if (btree_err(BTREE_ERR_FIXABLE, c, NULL, b, i,
 789                                       "keys out of order: %s > %s",
 790                                       buf1, buf2)) {
 791                                 i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - k->u64s);
 792                                 memmove_u64s_down(k, bkey_next(k),
 793                                                   (u64 *) vstruct_end(i) - (u64 *) k);
 794                                 continue;
 795                         }
 796                 }
 797
 798                 prev = k;
 799                 k = bkey_next(k);
 800         }
 801 fsck_err:
 802         return ret;
 803 }
 804
 805 int bch2_btree_node_read_done(struct bch_fs *c, struct bch_dev *ca,
 806                               struct btree *b, bool have_retry)
 807 {
 808         struct btree_node_entry *bne;
 809         struct sort_iter *iter;
 810         struct btree_node *sorted;
 811         struct bkey_packed *k;
 812         struct bch_extent_ptr *ptr;
 813         struct bset *i;
 814         bool used_mempool, blacklisted;
 815         bool updated_range = b->key.k.type == KEY_TYPE_btree_ptr_v2 &&
 816                 BTREE_PTR_RANGE_UPDATED(&bkey_i_to_btree_ptr_v2(&b->key)->v);
 817         unsigned u64s;
 818         int ret, retry_read = 0, write = READ;
 819
 820         b->version_ondisk = U16_MAX;
 821
 822         iter = mempool_alloc(&c->fill_iter, GFP_NOIO);
 823         sort_iter_init(iter, b);
 824         iter->size = (btree_blocks(c) + 1) * 2;
 825
 826         if (bch2_meta_read_fault("btree"))
 827                 btree_err(BTREE_ERR_MUST_RETRY, c, ca, b, NULL,
 828                           "dynamic fault");
 829
 830         btree_err_on(le64_to_cpu(b->data->magic) != bset_magic(c),
 831                      BTREE_ERR_MUST_RETRY, c, ca, b, NULL,
 832                      "bad magic");
 833
 834         btree_err_on(!b->data->keys.seq,
 835                      BTREE_ERR_MUST_RETRY, c, ca, b, NULL,
 836                      "bad btree header");
 837
 838         if (b->key.k.type == KEY_TYPE_btree_ptr_v2) {
 839                 struct bch_btree_ptr_v2 *bp =
 840                         &bkey_i_to_btree_ptr_v2(&b->key)->v;
 841
 842                 btree_err_on(b->data->keys.seq != bp->seq,
 843                              BTREE_ERR_MUST_RETRY, c, ca, b, NULL,
 844                              "got wrong btree node (seq %llx want %llx)",
 845                              b->data->keys.seq, bp->seq);
 846         }
 847
 848         while (b->written < c->opts.btree_node_size) {
 849                 unsigned sectors, whiteout_u64s = 0;
 850                 struct nonce nonce;
 851                 struct bch_csum csum;
 852                 bool first = !b->written;
 853
 854                 if (!b->written) {
 855                         i = &b->data->keys;
 856
 857                         btree_err_on(!bch2_checksum_type_valid(c, BSET_CSUM_TYPE(i)),
 858                                      BTREE_ERR_WANT_RETRY, c, ca, b, i,
 859                                      "unknown checksum type %llu",
 860                                      BSET_CSUM_TYPE(i));
 861
 862                         nonce = btree_nonce(i, b->written << 9);
 863                         csum = csum_vstruct(c, BSET_CSUM_TYPE(i), nonce, b->data);
 864
 865                         btree_err_on(bch2_crc_cmp(csum, b->data->csum),
 866                                      BTREE_ERR_WANT_RETRY, c, ca, b, i,
 867                                      "invalid checksum");
 868
 869                         bset_encrypt(c, i, b->written << 9);
 870
 871                         btree_err_on(btree_node_is_extents(b) &&
 872                                      !BTREE_NODE_NEW_EXTENT_OVERWRITE(b->data),
 873                                      BTREE_ERR_FATAL, c, NULL, b, NULL,
 874                                      "btree node does not have NEW_EXTENT_OVERWRITE set");
 875
 876                         sectors = vstruct_sectors(b->data, c->block_bits);
 877                 } else {
 878                         bne = write_block(b);
 879                         i = &bne->keys;
 880
 881                         if (i->seq != b->data->keys.seq)
 882                                 break;
 883
 884                         btree_err_on(!bch2_checksum_type_valid(c, BSET_CSUM_TYPE(i)),
 885                                      BTREE_ERR_WANT_RETRY, c, ca, b, i,
 886                                      "unknown checksum type %llu",
 887                                      BSET_CSUM_TYPE(i));
 888
 889                         nonce = btree_nonce(i, b->written << 9);
 890                         csum = csum_vstruct(c, BSET_CSUM_TYPE(i), nonce, bne);
 891
 892                         btree_err_on(bch2_crc_cmp(csum, bne->csum),
 893                                      BTREE_ERR_WANT_RETRY, c, ca, b, i,
 894                                      "invalid checksum");
 895
 896                         bset_encrypt(c, i, b->written << 9);
 897
 898                         sectors = vstruct_sectors(bne, c->block_bits);
 899                 }
 900
 901                 b->version_ondisk = min(b->version_ondisk,
 902                                         le16_to_cpu(i->version));
 903
 904                 ret = validate_bset(c, ca, b, i, sectors,
 905                                     READ, have_retry);
 906                 if (ret)
 907                         goto fsck_err;
 908
 909                 if (!b->written)
 910                         btree_node_set_format(b, b->data->format);
 911
 912                 ret = validate_bset_keys(c, b, i, &whiteout_u64s,
 913                                     READ, have_retry);
 914                 if (ret)
 915                         goto fsck_err;
 916
 917                 SET_BSET_BIG_ENDIAN(i, CPU_BIG_ENDIAN);
 918
 919                 b->written += sectors;
 920
 921                 blacklisted = bch2_journal_seq_is_blacklisted(c,
 922                                         le64_to_cpu(i->journal_seq),
 923                                         true);
 924
 925                 btree_err_on(blacklisted && first,
 926                              BTREE_ERR_FIXABLE, c, ca, b, i,
 927                              "first btree node bset has blacklisted journal seq");
 928                 if (blacklisted && !first)
 929                         continue;
 930
 931                 sort_iter_add(iter, i->start,
 932                               vstruct_idx(i, whiteout_u64s));
 933
 934                 sort_iter_add(iter,
 935                               vstruct_idx(i, whiteout_u64s),
 936                               vstruct_last(i));
 937         }
 938
 939         for (bne = write_block(b);
 940              bset_byte_offset(b, bne) < btree_bytes(c);
 941              bne = (void *) bne + block_bytes(c))
 942                 btree_err_on(bne->keys.seq == b->data->keys.seq,
 943                              BTREE_ERR_WANT_RETRY, c, ca, b, NULL,
 944                              "found bset signature after last bset");
 945
 946         sorted = btree_bounce_alloc(c, btree_bytes(c), &used_mempool);
 947         sorted->keys.u64s = 0;
 948
 949         set_btree_bset(b, b->set, &b->data->keys);
 950
 951         b->nr = bch2_key_sort_fix_overlapping(c, &sorted->keys, iter);
 952
 953         u64s = le16_to_cpu(sorted->keys.u64s);
 954         *sorted = *b->data;
 955         sorted->keys.u64s = cpu_to_le16(u64s);
 956         swap(sorted, b->data);
 957         set_btree_bset(b, b->set, &b->data->keys);
 958         b->nsets = 1;
 959
 960         BUG_ON(b->nr.live_u64s != u64s);
 961
 962         btree_bounce_free(c, btree_bytes(c), used_mempool, sorted);
 963
 964         if (updated_range)
 965                 bch2_btree_node_drop_keys_outside_node(b);
 966
 967         i = &b->data->keys;
 968         for (k = i->start; k != vstruct_last(i);) {
 969                 struct bkey tmp;
 970                 struct bkey_s u = __bkey_disassemble(b, k, &tmp);
 971                 const char *invalid = bch2_bkey_val_invalid(c, u.s_c);
 972
 973                 if (invalid ||
 974                     (bch2_inject_invalid_keys &&
 975                      !bversion_cmp(u.k->version, MAX_VERSION))) {
 976                         char buf[160];
 977
 978                         bch2_bkey_val_to_text(&PBUF(buf), c, u.s_c);
 979                         btree_err(BTREE_ERR_FIXABLE, c, NULL, b, i,
 980                                   "invalid bkey %s: %s", buf, invalid);
 981
 982                         btree_keys_account_key_drop(&b->nr, 0, k);
 983
 984                         i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - k->u64s);
 985                         memmove_u64s_down(k, bkey_next(k),
 986                                           (u64 *) vstruct_end(i) - (u64 *) k);
 987                         set_btree_bset_end(b, b->set);
 988                         continue;
 989                 }
 990
 991                 if (u.k->type == KEY_TYPE_btree_ptr_v2) {
 992                         struct bkey_s_btree_ptr_v2 bp = bkey_s_to_btree_ptr_v2(u);
 993
 994                         bp.v->mem_ptr = 0;
 995                 }
 996
 997                 k = bkey_next(k);
 998         }
 999
1000         bch2_bset_build_aux_tree(b, b->set, false);
1001
1002         set_needs_whiteout(btree_bset_first(b), true);
1003
1004         btree_node_reset_sib_u64s(b);
1005
1006         bkey_for_each_ptr(bch2_bkey_ptrs(bkey_i_to_s(&b->key)), ptr) {
1007                 struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev);
1008
1009                 if (ca->mi.state != BCH_MEMBER_STATE_rw)
1010                         set_btree_node_need_rewrite(b);
1011         }
1012 out:
1013         mempool_free(iter, &c->fill_iter);
1014         return retry_read;
1015 fsck_err:
1016         if (ret == BTREE_RETRY_READ) {
1017                 retry_read = 1;
1018         } else {
1019                 bch2_inconsistent_error(c);
1020                 set_btree_node_read_error(b);
1021         }
1022         goto out;
1023 }
1024
1025 static void btree_node_read_work(struct work_struct *work)
1026 {
1027         struct btree_read_bio *rb =
1028                 container_of(work, struct btree_read_bio, work);
1029         struct bch_fs *c        = rb->c;
1030         struct bch_dev *ca      = bch_dev_bkey_exists(c, rb->pick.ptr.dev);
1031         struct btree *b         = rb->bio.bi_private;
1032         struct bio *bio         = &rb->bio;
1033         struct bch_io_failures failed = { .nr = 0 };
1034         char buf[200];
1035         struct printbuf out;
1036         bool saw_error = false;
1037         bool can_retry;
1038
1039         goto start;
1040         while (1) {
1041                 bch_info(c, "retrying read");
1042                 ca = bch_dev_bkey_exists(c, rb->pick.ptr.dev);
1043                 rb->have_ioref          = bch2_dev_get_ioref(ca, READ);
1044                 bio_reset(bio);
1045                 bio->bi_opf             = REQ_OP_READ|REQ_SYNC|REQ_META;
1046                 bio->bi_iter.bi_sector  = rb->pick.ptr.offset;
1047                 bio->bi_iter.bi_size    = btree_bytes(c);
1048
1049                 if (rb->have_ioref) {
1050                         bio_set_dev(bio, ca->disk_sb.bdev);
1051                         submit_bio_wait(bio);
1052                 } else {
1053                         bio->bi_status = BLK_STS_REMOVED;
1054                 }
1055 start:
1056                 out = PBUF(buf);
1057                 btree_pos_to_text(&out, c, b);
1058                 bch2_dev_io_err_on(bio->bi_status, ca, "btree read error %s for %s",
1059                                    bch2_blk_status_to_str(bio->bi_status), buf);
1060                 if (rb->have_ioref)
1061                         percpu_ref_put(&ca->io_ref);
1062                 rb->have_ioref = false;
1063
1064                 bch2_mark_io_failure(&failed, &rb->pick);
1065
1066                 can_retry = bch2_bkey_pick_read_device(c,
1067                                 bkey_i_to_s_c(&b->key),
1068                                 &failed, &rb->pick) > 0;
1069
1070                 if (!bio->bi_status &&
1071                     !bch2_btree_node_read_done(c, ca, b, can_retry))
1072                         break;
1073
1074                 saw_error = true;
1075
1076                 if (!can_retry) {
1077                         set_btree_node_read_error(b);
1078                         break;
1079                 }
1080         }
1081
1082         bch2_time_stats_update(&c->times[BCH_TIME_btree_node_read],
1083                                rb->start_time);
1084         bio_put(&rb->bio);
1085
1086         if (saw_error && !btree_node_read_error(b))
1087                 bch2_btree_node_rewrite_async(c, b);
1088
1089         clear_btree_node_read_in_flight(b);
1090         wake_up_bit(&b->flags, BTREE_NODE_read_in_flight);
1091 }
1092
1093 static void btree_node_read_endio(struct bio *bio)
1094 {
1095         struct btree_read_bio *rb =
1096                 container_of(bio, struct btree_read_bio, bio);
1097         struct bch_fs *c        = rb->c;
1098
1099         if (rb->have_ioref) {
1100                 struct bch_dev *ca = bch_dev_bkey_exists(c, rb->pick.ptr.dev);
1101                 bch2_latency_acct(ca, rb->start_time, READ);
1102         }
1103
1104         queue_work(system_unbound_wq, &rb->work);
1105 }
1106
1107 void bch2_btree_node_read(struct bch_fs *c, struct btree *b,
1108                           bool sync)
1109 {
1110         struct extent_ptr_decoded pick;
1111         struct btree_read_bio *rb;
1112         struct bch_dev *ca;
1113         struct bio *bio;
1114         char buf[200];
1115         int ret;
1116
1117         btree_pos_to_text(&PBUF(buf), c, b);
1118         trace_btree_read(c, b);
1119
1120         ret = bch2_bkey_pick_read_device(c, bkey_i_to_s_c(&b->key),
1121                                          NULL, &pick);
1122         if (bch2_fs_fatal_err_on(ret <= 0, c,
1123                         "btree node read error: no device to read from\n"
1124                         " at %s", buf)) {
1125                 set_btree_node_read_error(b);
1126                 return;
1127         }
1128
1129         ca = bch_dev_bkey_exists(c, pick.ptr.dev);
1130
1131         bio = bio_alloc_bioset(GFP_NOIO, buf_pages(b->data,
1132                                                    btree_bytes(c)),
1133                                &c->btree_bio);
1134         rb = container_of(bio, struct btree_read_bio, bio);
1135         rb->c                   = c;
1136         rb->start_time          = local_clock();
1137         rb->have_ioref          = bch2_dev_get_ioref(ca, READ);
1138         rb->pick                = pick;
1139         INIT_WORK(&rb->work, btree_node_read_work);
1140         bio->bi_opf             = REQ_OP_READ|REQ_SYNC|REQ_META;
1141         bio->bi_iter.bi_sector  = pick.ptr.offset;
1142         bio->bi_end_io          = btree_node_read_endio;
1143         bio->bi_private         = b;
1144         bch2_bio_map(bio, b->data, btree_bytes(c));
1145
1146         set_btree_node_read_in_flight(b);
1147
1148         if (rb->have_ioref) {
1149                 this_cpu_add(ca->io_done->sectors[READ][BCH_DATA_btree],
1150                              bio_sectors(bio));
1151                 bio_set_dev(bio, ca->disk_sb.bdev);
1152
1153                 if (sync) {
1154                         submit_bio_wait(bio);
1155
1156                         bio->bi_private = b;
1157                         btree_node_read_work(&rb->work);
1158                 } else {
1159                         submit_bio(bio);
1160                 }
1161         } else {
1162                 bio->bi_status = BLK_STS_REMOVED;
1163
1164                 if (sync)
1165                         btree_node_read_work(&rb->work);
1166                 else
1167                         queue_work(system_unbound_wq, &rb->work);
1168
1169         }
1170 }
1171
1172 int bch2_btree_root_read(struct bch_fs *c, enum btree_id id,
1173                         const struct bkey_i *k, unsigned level)
1174 {
1175         struct closure cl;
1176         struct btree *b;
1177         int ret;
1178
1179         closure_init_stack(&cl);
1180
1181         do {
1182                 ret = bch2_btree_cache_cannibalize_lock(c, &cl);
1183                 closure_sync(&cl);
1184         } while (ret);
1185
1186         b = bch2_btree_node_mem_alloc(c);
1187         bch2_btree_cache_cannibalize_unlock(c);
1188
1189         BUG_ON(IS_ERR(b));
1190
1191         bkey_copy(&b->key, k);
1192         BUG_ON(bch2_btree_node_hash_insert(&c->btree_cache, b, level, id));
1193
1194         bch2_btree_node_read(c, b, true);
1195
1196         if (btree_node_read_error(b)) {
1197                 bch2_btree_node_hash_remove(&c->btree_cache, b);
1198
1199                 mutex_lock(&c->btree_cache.lock);
1200                 list_move(&b->list, &c->btree_cache.freeable);
1201                 mutex_unlock(&c->btree_cache.lock);
1202
1203                 ret = -EIO;
1204                 goto err;
1205         }
1206
1207         bch2_btree_set_root_for_read(c, b);
1208 err:
1209         six_unlock_write(&b->c.lock);
1210         six_unlock_intent(&b->c.lock);
1211
1212         return ret;
1213 }
1214
1215 void bch2_btree_complete_write(struct bch_fs *c, struct btree *b,
1216                               struct btree_write *w)
1217 {
1218         unsigned long old, new, v = READ_ONCE(b->will_make_reachable);
1219
1220         do {
1221                 old = new = v;
1222                 if (!(old & 1))
1223                         break;
1224
1225                 new &= ~1UL;
1226         } while ((v = cmpxchg(&b->will_make_reachable, old, new)) != old);
1227
1228         if (old & 1)
1229                 closure_put(&((struct btree_update *) new)->cl);
1230
1231         bch2_journal_pin_drop(&c->journal, &w->journal);
1232 }
1233
1234 static void btree_node_write_done(struct bch_fs *c, struct btree *b)
1235 {
1236         struct btree_write *w = btree_prev_write(b);
1237
1238         bch2_btree_complete_write(c, b, w);
1239         btree_node_io_unlock(b);
1240 }
1241
1242 static void bch2_btree_node_write_error(struct bch_fs *c,
1243                                         struct btree_write_bio *wbio)
1244 {
1245         struct btree *b         = wbio->wbio.bio.bi_private;
1246         struct bkey_buf k;
1247         struct bch_extent_ptr *ptr;
1248         struct btree_trans trans;
1249         struct btree_iter *iter;
1250         int ret;
1251
1252         bch2_bkey_buf_init(&k);
1253         bch2_trans_init(&trans, c, 0, 0);
1254
1255         iter = bch2_trans_get_node_iter(&trans, b->c.btree_id, b->key.k.p,
1256                                         BTREE_MAX_DEPTH, b->c.level, 0);
1257 retry:
1258         ret = bch2_btree_iter_traverse(iter);
1259         if (ret)
1260                 goto err;
1261
1262         /* has node been freed? */
1263         if (iter->l[b->c.level].b != b) {
1264                 /* node has been freed: */
1265                 BUG_ON(!btree_node_dying(b));
1266                 goto out;
1267         }
1268
1269         BUG_ON(!btree_node_hashed(b));
1270
1271         bch2_bkey_buf_copy(&k, c, &b->key);
1272
1273         bch2_bkey_drop_ptrs(bkey_i_to_s(k.k), ptr,
1274                 bch2_dev_list_has_dev(wbio->wbio.failed, ptr->dev));
1275
1276         if (!bch2_bkey_nr_ptrs(bkey_i_to_s_c(k.k)))
1277                 goto err;
1278
1279         ret = bch2_btree_node_update_key(c, iter, b, k.k);
1280         if (ret == -EINTR)
1281                 goto retry;
1282         if (ret)
1283                 goto err;
1284 out:
1285         bch2_trans_iter_put(&trans, iter);
1286         bch2_trans_exit(&trans);
1287         bch2_bkey_buf_exit(&k, c);
1288         bio_put(&wbio->wbio.bio);
1289         btree_node_write_done(c, b);
1290         return;
1291 err:
1292         set_btree_node_noevict(b);
1293         bch2_fs_fatal_error(c, "fatal error writing btree node");
1294         goto out;
1295 }
1296
1297 void bch2_btree_write_error_work(struct work_struct *work)
1298 {
1299         struct bch_fs *c = container_of(work, struct bch_fs,
1300                                         btree_write_error_work);
1301         struct bio *bio;
1302
1303         while (1) {
1304                 spin_lock_irq(&c->btree_write_error_lock);
1305                 bio = bio_list_pop(&c->btree_write_error_list);
1306                 spin_unlock_irq(&c->btree_write_error_lock);
1307
1308                 if (!bio)
1309                         break;
1310
1311                 bch2_btree_node_write_error(c,
1312                         container_of(bio, struct btree_write_bio, wbio.bio));
1313         }
1314 }
1315
1316 static void btree_node_write_work(struct work_struct *work)
1317 {
1318         struct btree_write_bio *wbio =
1319                 container_of(work, struct btree_write_bio, work);
1320         struct bch_fs *c        = wbio->wbio.c;
1321         struct btree *b         = wbio->wbio.bio.bi_private;
1322
1323         btree_bounce_free(c,
1324                 wbio->bytes,
1325                 wbio->wbio.used_mempool,
1326                 wbio->data);
1327
1328         if (wbio->wbio.failed.nr) {
1329                 unsigned long flags;
1330
1331                 spin_lock_irqsave(&c->btree_write_error_lock, flags);
1332                 bio_list_add(&c->btree_write_error_list, &wbio->wbio.bio);
1333                 spin_unlock_irqrestore(&c->btree_write_error_lock, flags);
1334
1335                 queue_work(c->wq, &c->btree_write_error_work);
1336                 return;
1337         }
1338
1339         bio_put(&wbio->wbio.bio);
1340         btree_node_write_done(c, b);
1341 }
1342
1343 static void btree_node_write_endio(struct bio *bio)
1344 {
1345         struct bch_write_bio *wbio      = to_wbio(bio);
1346         struct bch_write_bio *parent    = wbio->split ? wbio->parent : NULL;
1347         struct bch_write_bio *orig      = parent ?: wbio;
1348         struct bch_fs *c                = wbio->c;
1349         struct bch_dev *ca              = bch_dev_bkey_exists(c, wbio->dev);
1350         unsigned long flags;
1351
1352         if (wbio->have_ioref)
1353                 bch2_latency_acct(ca, wbio->submit_time, WRITE);
1354
1355         if (bch2_dev_io_err_on(bio->bi_status, ca, "btree write error: %s",
1356                                bch2_blk_status_to_str(bio->bi_status)) ||
1357             bch2_meta_write_fault("btree")) {
1358                 spin_lock_irqsave(&c->btree_write_error_lock, flags);
1359                 bch2_dev_list_add_dev(&orig->failed, wbio->dev);
1360                 spin_unlock_irqrestore(&c->btree_write_error_lock, flags);
1361         }
1362
1363         if (wbio->have_ioref)
1364                 percpu_ref_put(&ca->io_ref);
1365
1366         if (parent) {
1367                 bio_put(bio);
1368                 bio_endio(&parent->bio);
1369         } else {
1370                 struct btree_write_bio *wb =
1371                         container_of(orig, struct btree_write_bio, wbio);
1372
1373                 INIT_WORK(&wb->work, btree_node_write_work);
1374                 queue_work(system_unbound_wq, &wb->work);
1375         }
1376 }
1377
1378 static int validate_bset_for_write(struct bch_fs *c, struct btree *b,
1379                                    struct bset *i, unsigned sectors)
1380 {
1381         unsigned whiteout_u64s = 0;
1382         int ret;
1383
1384         if (bch2_bkey_invalid(c, bkey_i_to_s_c(&b->key), BKEY_TYPE_btree))
1385                 return -1;
1386
1387         ret = validate_bset_keys(c, b, i, &whiteout_u64s, WRITE, false) ?:
1388                 validate_bset(c, NULL, b, i, sectors, WRITE, false);
1389         if (ret) {
1390                 bch2_inconsistent_error(c);
1391                 dump_stack();
1392         }
1393
1394         return ret;
1395 }
1396
1397 static void btree_write_submit(struct work_struct *work)
1398 {
1399         struct btree_write_bio *wbio = container_of(work, struct btree_write_bio, work);
1400
1401         bch2_submit_wbio_replicas(&wbio->wbio, wbio->wbio.c, BCH_DATA_btree, &wbio->key);
1402 }
1403
1404 void __bch2_btree_node_write(struct bch_fs *c, struct btree *b)
1405 {
1406         struct btree_write_bio *wbio;
1407         struct bset_tree *t;
1408         struct bset *i;
1409         struct btree_node *bn = NULL;
1410         struct btree_node_entry *bne = NULL;
1411         struct bch_extent_ptr *ptr;
1412         struct sort_iter sort_iter;
1413         struct nonce nonce;
1414         unsigned bytes_to_write, sectors_to_write, bytes, u64s;
1415         u64 seq = 0;
1416         bool used_mempool;
1417         unsigned long old, new;
1418         bool validate_before_checksum = false;
1419         void *data;
1420
1421         if (test_bit(BCH_FS_HOLD_BTREE_WRITES, &c->flags))
1422                 return;
1423
1424         /*
1425          * We may only have a read lock on the btree node - the dirty bit is our
1426          * "lock" against racing with other threads that may be trying to start
1427          * a write, we do a write iff we clear the dirty bit. Since setting the
1428          * dirty bit requires a write lock, we can't race with other threads
1429          * redirtying it:
1430          */
1431         do {
1432                 old = new = READ_ONCE(b->flags);
1433
1434                 if (!(old & (1 << BTREE_NODE_dirty)))
1435                         return;
1436
1437                 if (!btree_node_may_write(b))
1438                         return;
1439
1440                 if (old & (1 << BTREE_NODE_never_write))
1441                         return;
1442
1443                 if (old & (1 << BTREE_NODE_write_in_flight)) {
1444                         btree_node_wait_on_io(b);
1445                         continue;
1446                 }
1447
1448                 new &= ~(1 << BTREE_NODE_dirty);
1449                 new &= ~(1 << BTREE_NODE_need_write);
1450                 new |=  (1 << BTREE_NODE_write_in_flight);
1451                 new |=  (1 << BTREE_NODE_just_written);
1452                 new ^=  (1 << BTREE_NODE_write_idx);
1453         } while (cmpxchg_acquire(&b->flags, old, new) != old);
1454
1455         atomic_dec(&c->btree_cache.dirty);
1456
1457         BUG_ON(btree_node_fake(b));
1458         BUG_ON((b->will_make_reachable != 0) != !b->written);
1459
1460         BUG_ON(b->written >= c->opts.btree_node_size);
1461         BUG_ON(b->written & (c->opts.block_size - 1));
1462         BUG_ON(bset_written(b, btree_bset_last(b)));
1463         BUG_ON(le64_to_cpu(b->data->magic) != bset_magic(c));
1464         BUG_ON(memcmp(&b->data->format, &b->format, sizeof(b->format)));
1465
1466         bch2_sort_whiteouts(c, b);
1467
1468         sort_iter_init(&sort_iter, b);
1469
1470         bytes = !b->written
1471                 ? sizeof(struct btree_node)
1472                 : sizeof(struct btree_node_entry);
1473
1474         bytes += b->whiteout_u64s * sizeof(u64);
1475
1476         for_each_bset(b, t) {
1477                 i = bset(b, t);
1478
1479                 if (bset_written(b, i))
1480                         continue;
1481
1482                 bytes += le16_to_cpu(i->u64s) * sizeof(u64);
1483                 sort_iter_add(&sort_iter,
1484                               btree_bkey_first(b, t),
1485                               btree_bkey_last(b, t));
1486                 seq = max(seq, le64_to_cpu(i->journal_seq));
1487         }
1488
1489         BUG_ON(b->written && !seq);
1490
1491         /* bch2_varint_decode may read up to 7 bytes past the end of the buffer: */
1492         bytes += 8;
1493
1494         data = btree_bounce_alloc(c, bytes, &used_mempool);
1495
1496         if (!b->written) {
1497                 bn = data;
1498                 *bn = *b->data;
1499                 i = &bn->keys;
1500         } else {
1501                 bne = data;
1502                 bne->keys = b->data->keys;
1503                 i = &bne->keys;
1504         }
1505
1506         i->journal_seq  = cpu_to_le64(seq);
1507         i->u64s         = 0;
1508
1509         sort_iter_add(&sort_iter,
1510                       unwritten_whiteouts_start(c, b),
1511                       unwritten_whiteouts_end(c, b));
1512         SET_BSET_SEPARATE_WHITEOUTS(i, false);
1513
1514         b->whiteout_u64s = 0;
1515
1516         u64s = bch2_sort_keys(i->start, &sort_iter, false);
1517         le16_add_cpu(&i->u64s, u64s);
1518
1519         set_needs_whiteout(i, false);
1520
1521         /* do we have data to write? */
1522         if (b->written && !i->u64s)
1523                 goto nowrite;
1524
1525         bytes_to_write = vstruct_end(i) - data;
1526         sectors_to_write = round_up(bytes_to_write, block_bytes(c)) >> 9;
1527
1528         memset(data + bytes_to_write, 0,
1529                (sectors_to_write << 9) - bytes_to_write);
1530
1531         BUG_ON(b->written + sectors_to_write > c->opts.btree_node_size);
1532         BUG_ON(BSET_BIG_ENDIAN(i) != CPU_BIG_ENDIAN);
1533         BUG_ON(i->seq != b->data->keys.seq);
1534
1535         i->version = c->sb.version < bcachefs_metadata_version_new_versioning
1536                 ? cpu_to_le16(BCH_BSET_VERSION_OLD)
1537                 : cpu_to_le16(c->sb.version);
1538         SET_BSET_CSUM_TYPE(i, bch2_meta_checksum_type(c));
1539
1540         if (bch2_csum_type_is_encryption(BSET_CSUM_TYPE(i)))
1541                 validate_before_checksum = true;
1542
1543         /* validate_bset will be modifying: */
1544         if (le16_to_cpu(i->version) < bcachefs_metadata_version_current)
1545                 validate_before_checksum = true;
1546
1547         /* if we're going to be encrypting, check metadata validity first: */
1548         if (validate_before_checksum &&
1549             validate_bset_for_write(c, b, i, sectors_to_write))
1550                 goto err;
1551
1552         bset_encrypt(c, i, b->written << 9);
1553
1554         nonce = btree_nonce(i, b->written << 9);
1555
1556         if (bn)
1557                 bn->csum = csum_vstruct(c, BSET_CSUM_TYPE(i), nonce, bn);
1558         else
1559                 bne->csum = csum_vstruct(c, BSET_CSUM_TYPE(i), nonce, bne);
1560
1561         /* if we're not encrypting, check metadata after checksumming: */
1562         if (!validate_before_checksum &&
1563             validate_bset_for_write(c, b, i, sectors_to_write))
1564                 goto err;
1565
1566         /*
1567          * We handle btree write errors by immediately halting the journal -
1568          * after we've done that, we can't issue any subsequent btree writes
1569          * because they might have pointers to new nodes that failed to write.
1570          *
1571          * Furthermore, there's no point in doing any more btree writes because
1572          * with the journal stopped, we're never going to update the journal to
1573          * reflect that those writes were done and the data flushed from the
1574          * journal:
1575          *
1576          * Also on journal error, the pending write may have updates that were
1577          * never journalled (interior nodes, see btree_update_nodes_written()) -
1578          * it's critical that we don't do the write in that case otherwise we
1579          * will have updates visible that weren't in the journal:
1580          *
1581          * Make sure to update b->written so bch2_btree_init_next() doesn't
1582          * break:
1583          */
1584         if (bch2_journal_error(&c->journal) ||
1585             c->opts.nochanges)
1586                 goto err;
1587
1588         trace_btree_write(b, bytes_to_write, sectors_to_write);
1589
1590         wbio = container_of(bio_alloc_bioset(GFP_NOIO,
1591                                 buf_pages(data, sectors_to_write << 9),
1592                                 &c->btree_bio),
1593                             struct btree_write_bio, wbio.bio);
1594         wbio_init(&wbio->wbio.bio);
1595         wbio->data                      = data;
1596         wbio->bytes                     = bytes;
1597         wbio->wbio.c                    = c;
1598         wbio->wbio.used_mempool         = used_mempool;
1599         wbio->wbio.bio.bi_opf           = REQ_OP_WRITE|REQ_META;
1600         wbio->wbio.bio.bi_end_io        = btree_node_write_endio;
1601         wbio->wbio.bio.bi_private       = b;
1602
1603         bch2_bio_map(&wbio->wbio.bio, data, sectors_to_write << 9);
1604
1605         /*
1606          * If we're appending to a leaf node, we don't technically need FUA -
1607          * this write just needs to be persisted before the next journal write,
1608          * which will be marked FLUSH|FUA.
1609          *
1610          * Similarly if we're writing a new btree root - the pointer is going to
1611          * be in the next journal entry.
1612          *
1613          * But if we're writing a new btree node (that isn't a root) or
1614          * appending to a non leaf btree node, we need either FUA or a flush
1615          * when we write the parent with the new pointer. FUA is cheaper than a
1616          * flush, and writes appending to leaf nodes aren't blocking anything so
1617          * just make all btree node writes FUA to keep things sane.
1618          */
1619
1620         bkey_copy(&wbio->key, &b->key);
1621
1622         bkey_for_each_ptr(bch2_bkey_ptrs(bkey_i_to_s(&wbio->key)), ptr)
1623                 ptr->offset += b->written;
1624
1625         b->written += sectors_to_write;
1626
1627         atomic64_inc(&c->btree_writes_nr);
1628         atomic64_add(sectors_to_write, &c->btree_writes_sectors);
1629
1630         INIT_WORK(&wbio->work, btree_write_submit);
1631         schedule_work(&wbio->work);
1632         return;
1633 err:
1634         set_btree_node_noevict(b);
1635         b->written += sectors_to_write;
1636 nowrite:
1637         btree_bounce_free(c, bytes, used_mempool, data);
1638         btree_node_write_done(c, b);
1639 }
1640
1641 /*
1642  * Work that must be done with write lock held:
1643  */
1644 bool bch2_btree_post_write_cleanup(struct bch_fs *c, struct btree *b)
1645 {
1646         bool invalidated_iter = false;
1647         struct btree_node_entry *bne;
1648         struct bset_tree *t;
1649
1650         if (!btree_node_just_written(b))
1651                 return false;
1652
1653         BUG_ON(b->whiteout_u64s);
1654
1655         clear_btree_node_just_written(b);
1656
1657         /*
1658          * Note: immediately after write, bset_written() doesn't work - the
1659          * amount of data we had to write after compaction might have been
1660          * smaller than the offset of the last bset.
1661          *
1662          * However, we know that all bsets have been written here, as long as
1663          * we're still holding the write lock:
1664          */
1665
1666         /*
1667          * XXX: decide if we really want to unconditionally sort down to a
1668          * single bset:
1669          */
1670         if (b->nsets > 1) {
1671                 btree_node_sort(c, b, 0, b->nsets, true);
1672                 invalidated_iter = true;
1673         } else {
1674                 invalidated_iter = bch2_drop_whiteouts(b, COMPACT_ALL);
1675         }
1676
1677         for_each_bset(b, t)
1678                 set_needs_whiteout(bset(b, t), true);
1679
1680         bch2_btree_verify(c, b);
1681
1682         /*
1683          * If later we don't unconditionally sort down to a single bset, we have
1684          * to ensure this is still true:
1685          */
1686         BUG_ON((void *) btree_bkey_last(b, bset_tree_last(b)) > write_block(b));
1687
1688         bne = want_new_bset(c, b);
1689         if (bne)
1690                 bch2_bset_init_next(c, b, bne);
1691
1692         bch2_btree_build_aux_trees(b);
1693
1694         return invalidated_iter;
1695 }
1696
1697 /*
1698  * Use this one if the node is intent locked:
1699  */
1700 void bch2_btree_node_write(struct bch_fs *c, struct btree *b,
1701                            enum six_lock_type lock_type_held)
1702 {
1703         if (lock_type_held == SIX_LOCK_intent ||
1704             (lock_type_held == SIX_LOCK_read &&
1705              six_lock_tryupgrade(&b->c.lock))) {
1706                 __bch2_btree_node_write(c, b);
1707
1708                 /* don't cycle lock unnecessarily: */
1709                 if (btree_node_just_written(b) &&
1710                     six_trylock_write(&b->c.lock)) {
1711                         bch2_btree_post_write_cleanup(c, b);
1712                         six_unlock_write(&b->c.lock);
1713                 }
1714
1715                 if (lock_type_held == SIX_LOCK_read)
1716                         six_lock_downgrade(&b->c.lock);
1717         } else {
1718                 __bch2_btree_node_write(c, b);
1719                 if (lock_type_held == SIX_LOCK_write &&
1720                     btree_node_just_written(b))
1721                         bch2_btree_post_write_cleanup(c, b);
1722         }
1723 }
1724
1725 static void __bch2_btree_flush_all(struct bch_fs *c, unsigned flag)
1726 {
1727         struct bucket_table *tbl;
1728         struct rhash_head *pos;
1729         struct btree *b;
1730         unsigned i;
1731 restart:
1732         rcu_read_lock();
1733         for_each_cached_btree(b, c, tbl, i, pos)
1734                 if (test_bit(flag, &b->flags)) {
1735                         rcu_read_unlock();
1736                         wait_on_bit_io(&b->flags, flag, TASK_UNINTERRUPTIBLE);
1737                         goto restart;
1738
1739                 }
1740         rcu_read_unlock();
1741 }
1742
1743 void bch2_btree_flush_all_reads(struct bch_fs *c)
1744 {
1745         __bch2_btree_flush_all(c, BTREE_NODE_read_in_flight);
1746 }
1747
1748 void bch2_btree_flush_all_writes(struct bch_fs *c)
1749 {
1750         __bch2_btree_flush_all(c, BTREE_NODE_write_in_flight);
1751 }
1752
1753 void bch2_dirty_btree_nodes_to_text(struct printbuf *out, struct bch_fs *c)
1754 {
1755         struct bucket_table *tbl;
1756         struct rhash_head *pos;
1757         struct btree *b;
1758         unsigned i;
1759
1760         rcu_read_lock();
1761         for_each_cached_btree(b, c, tbl, i, pos) {
1762                 unsigned long flags = READ_ONCE(b->flags);
1763
1764                 if (!(flags & (1 << BTREE_NODE_dirty)))
1765                         continue;
1766
1767                 pr_buf(out, "%p d %u n %u l %u w %u b %u r %u:%lu\n",
1768                        b,
1769                        (flags & (1 << BTREE_NODE_dirty)) != 0,
1770                        (flags & (1 << BTREE_NODE_need_write)) != 0,
1771                        b->c.level,
1772                        b->written,
1773                        !list_empty_careful(&b->write_blocked),
1774                        b->will_make_reachable != 0,
1775                        b->will_make_reachable & 1);
1776         }
1777         rcu_read_unlock();
1778 }