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

   1 // SPDX-License-Identifier: GPL-2.0
   2
   3 #include "bcachefs.h"
   4 #include "alloc_foreground.h"
   5 #include "bkey_buf.h"
   6 #include "btree_gc.h"
   7 #include "btree_update.h"
   8 #include "btree_update_interior.h"
   9 #include "buckets.h"
  10 #include "disk_groups.h"
  11 #include "inode.h"
  12 #include "io.h"
  13 #include "journal_reclaim.h"
  14 #include "move.h"
  15 #include "replicas.h"
  16 #include "super-io.h"
  17 #include "keylist.h"
  18
  19 #include <linux/ioprio.h>
  20 #include <linux/kthread.h>
  21
  22 #include <trace/events/bcachefs.h>
  23
  24 #define SECTORS_IN_FLIGHT_PER_DEVICE    2048
  25
  26 struct moving_io {
  27         struct list_head        list;
  28         struct closure          cl;
  29         bool                    read_completed;
  30
  31         unsigned                read_sectors;
  32         unsigned                write_sectors;
  33
  34         struct bch_read_bio     rbio;
  35
  36         struct migrate_write    write;
  37         /* Must be last since it is variable size */
  38         struct bio_vec          bi_inline_vecs[0];
  39 };
  40
  41 struct moving_context {
  42         /* Closure for waiting on all reads and writes to complete */
  43         struct closure          cl;
  44
  45         struct bch_move_stats   *stats;
  46
  47         struct list_head        reads;
  48
  49         /* in flight sectors: */
  50         atomic_t                read_sectors;
  51         atomic_t                write_sectors;
  52
  53         wait_queue_head_t       wait;
  54 };
  55
  56 static int bch2_migrate_index_update(struct bch_write_op *op)
  57 {
  58         struct bch_fs *c = op->c;
  59         struct btree_trans trans;
  60         struct btree_iter *iter;
  61         struct migrate_write *m =
  62                 container_of(op, struct migrate_write, op);
  63         struct keylist *keys = &op->insert_keys;
  64         struct bkey_buf _new, _insert;
  65         int ret = 0;
  66
  67         bch2_bkey_buf_init(&_new);
  68         bch2_bkey_buf_init(&_insert);
  69         bch2_bkey_buf_realloc(&_insert, c, U8_MAX);
  70
  71         bch2_trans_init(&trans, c, BTREE_ITER_MAX, 0);
  72
  73         iter = bch2_trans_get_iter(&trans, m->btree_id,
  74                                    bkey_start_pos(&bch2_keylist_front(keys)->k),
  75                                    BTREE_ITER_SLOTS|BTREE_ITER_INTENT);
  76
  77         while (1) {
  78                 struct bkey_s_c k;
  79                 struct bkey_i *insert;
  80                 struct bkey_i_extent *new;
  81                 const union bch_extent_entry *entry;
  82                 struct extent_ptr_decoded p;
  83                 bool did_work = false;
  84                 bool extending = false, should_check_enospc;
  85                 s64 i_sectors_delta = 0, disk_sectors_delta = 0;
  86
  87                 bch2_trans_reset(&trans, 0);
  88
  89                 k = bch2_btree_iter_peek_slot(iter);
  90                 ret = bkey_err(k);
  91                 if (ret)
  92                         goto err;
  93
  94                 new = bkey_i_to_extent(bch2_keylist_front(keys));
  95
  96                 if (bversion_cmp(k.k->version, new->k.version) ||
  97                     !bch2_bkey_matches_ptr(c, k, m->ptr, m->offset))
  98                         goto nomatch;
  99
 100                 bkey_reassemble(_insert.k, k);
 101                 insert = _insert.k;
 102
 103                 bch2_bkey_buf_copy(&_new, c, bch2_keylist_front(keys));
 104                 new = bkey_i_to_extent(_new.k);
 105                 bch2_cut_front(iter->pos, &new->k_i);
 106
 107                 bch2_cut_front(iter->pos,       insert);
 108                 bch2_cut_back(new->k.p,         insert);
 109                 bch2_cut_back(insert->k.p,      &new->k_i);
 110
 111                 if (m->data_cmd == DATA_REWRITE) {
 112                         struct bch_extent_ptr *new_ptr, *old_ptr = (void *)
 113                                 bch2_bkey_has_device(bkey_i_to_s_c(insert),
 114                                                      m->data_opts.rewrite_dev);
 115                         if (!old_ptr)
 116                                 goto nomatch;
 117
 118                         if (old_ptr->cached)
 119                                 extent_for_each_ptr(extent_i_to_s(new), new_ptr)
 120                                         new_ptr->cached = true;
 121
 122                         bch2_bkey_drop_ptr(bkey_i_to_s(insert), old_ptr);
 123                 }
 124
 125                 extent_for_each_ptr_decode(extent_i_to_s(new), p, entry) {
 126                         if (bch2_bkey_has_device(bkey_i_to_s_c(insert), p.ptr.dev)) {
 127                                 /*
 128                                  * raced with another move op? extent already
 129                                  * has a pointer to the device we just wrote
 130                                  * data to
 131                                  */
 132                                 continue;
 133                         }
 134
 135                         bch2_extent_ptr_decoded_append(insert, &p);
 136                         did_work = true;
 137                 }
 138
 139                 if (!did_work)
 140                         goto nomatch;
 141
 142                 bch2_bkey_narrow_crcs(insert,
 143                                 (struct bch_extent_crc_unpacked) { 0 });
 144                 bch2_extent_normalize(c, bkey_i_to_s(insert));
 145                 bch2_bkey_mark_replicas_cached(c, bkey_i_to_s(insert),
 146                                                op->opts.background_target,
 147                                                op->opts.data_replicas);
 148
 149                 ret = bch2_sum_sector_overwrites(&trans, iter, insert,
 150                                                  &extending,
 151                                                  &should_check_enospc,
 152                                                  &i_sectors_delta,
 153                                                  &disk_sectors_delta);
 154                 if (ret)
 155                         goto err;
 156
 157                 if (disk_sectors_delta > (s64) op->res.sectors) {
 158                         ret = bch2_disk_reservation_add(c, &op->res,
 159                                                 disk_sectors_delta - op->res.sectors,
 160                                                 !should_check_enospc
 161                                                 ? BCH_DISK_RESERVATION_NOFAIL : 0);
 162                         if (ret)
 163                                 goto out;
 164                 }
 165
 166                 bch2_trans_update(&trans, iter, insert, 0);
 167
 168                 ret = bch2_trans_commit(&trans, &op->res,
 169                                 op_journal_seq(op),
 170                                 BTREE_INSERT_NOFAIL|
 171                                 m->data_opts.btree_insert_flags);
 172 err:
 173                 if (!ret)
 174                         atomic_long_inc(&c->extent_migrate_done);
 175                 if (ret == -EINTR)
 176                         ret = 0;
 177                 if (ret)
 178                         break;
 179 next:
 180                 while (bkey_cmp(iter->pos, bch2_keylist_front(keys)->k.p) >= 0) {
 181                         bch2_keylist_pop_front(keys);
 182                         if (bch2_keylist_empty(keys))
 183                                 goto out;
 184                 }
 185                 continue;
 186 nomatch:
 187                 if (m->ctxt) {
 188                         BUG_ON(k.k->p.offset <= iter->pos.offset);
 189                         atomic64_inc(&m->ctxt->stats->keys_raced);
 190                         atomic64_add(k.k->p.offset - iter->pos.offset,
 191                                      &m->ctxt->stats->sectors_raced);
 192                 }
 193                 atomic_long_inc(&c->extent_migrate_raced);
 194                 trace_move_race(&new->k);
 195                 bch2_btree_iter_next_slot(iter);
 196                 goto next;
 197         }
 198 out:
 199         bch2_trans_iter_put(&trans, iter);
 200         bch2_trans_exit(&trans);
 201         bch2_bkey_buf_exit(&_insert, c);
 202         bch2_bkey_buf_exit(&_new, c);
 203         BUG_ON(ret == -EINTR);
 204         return ret;
 205 }
 206
 207 void bch2_migrate_read_done(struct migrate_write *m, struct bch_read_bio *rbio)
 208 {
 209         /* write bio must own pages: */
 210         BUG_ON(!m->op.wbio.bio.bi_vcnt);
 211
 212         m->ptr          = rbio->pick.ptr;
 213         m->offset       = rbio->data_pos.offset - rbio->pick.crc.offset;
 214         m->op.devs_have = rbio->devs_have;
 215         m->op.pos       = rbio->data_pos;
 216         m->op.version   = rbio->version;
 217         m->op.crc       = rbio->pick.crc;
 218         m->op.wbio.bio.bi_iter.bi_size = m->op.crc.compressed_size << 9;
 219
 220         if (bch2_csum_type_is_encryption(m->op.crc.csum_type)) {
 221                 m->op.nonce     = m->op.crc.nonce + m->op.crc.offset;
 222                 m->op.csum_type = m->op.crc.csum_type;
 223         }
 224
 225         if (m->data_cmd == DATA_REWRITE)
 226                 bch2_dev_list_drop_dev(&m->op.devs_have, m->data_opts.rewrite_dev);
 227 }
 228
 229 int bch2_migrate_write_init(struct bch_fs *c, struct migrate_write *m,
 230                             struct write_point_specifier wp,
 231                             struct bch_io_opts io_opts,
 232                             enum data_cmd data_cmd,
 233                             struct data_opts data_opts,
 234                             enum btree_id btree_id,
 235                             struct bkey_s_c k)
 236 {
 237         struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
 238         const union bch_extent_entry *entry;
 239         struct extent_ptr_decoded p;
 240         int ret;
 241
 242         m->btree_id     = btree_id;
 243         m->data_cmd     = data_cmd;
 244         m->data_opts    = data_opts;
 245         m->nr_ptrs_reserved = 0;
 246
 247         bch2_write_op_init(&m->op, c, io_opts);
 248
 249         if (!bch2_bkey_is_incompressible(k))
 250                 m->op.compression_type =
 251                         bch2_compression_opt_to_type[io_opts.background_compression ?:
 252                                                      io_opts.compression];
 253         else
 254                 m->op.incompressible = true;
 255
 256         m->op.target    = data_opts.target,
 257         m->op.write_point = wp;
 258
 259         if (m->data_opts.btree_insert_flags & BTREE_INSERT_USE_RESERVE) {
 260                 m->op.alloc_reserve = RESERVE_MOVINGGC;
 261                 m->op.flags |= BCH_WRITE_ALLOC_NOWAIT;
 262         } else {
 263                 /* XXX: this should probably be passed in */
 264                 m->op.flags |= BCH_WRITE_ONLY_SPECIFIED_DEVS;
 265         }
 266
 267         m->op.flags |= BCH_WRITE_PAGES_STABLE|
 268                 BCH_WRITE_PAGES_OWNED|
 269                 BCH_WRITE_DATA_ENCODED|
 270                 BCH_WRITE_FROM_INTERNAL;
 271
 272         m->op.nr_replicas       = data_opts.nr_replicas;
 273         m->op.nr_replicas_required = data_opts.nr_replicas;
 274         m->op.index_update_fn   = bch2_migrate_index_update;
 275
 276         switch (data_cmd) {
 277         case DATA_ADD_REPLICAS: {
 278                 /*
 279                  * DATA_ADD_REPLICAS is used for moving data to a different
 280                  * device in the background, and due to compression the new copy
 281                  * might take up more space than the old copy:
 282                  */
 283 #if 0
 284                 int nr = (int) io_opts.data_replicas -
 285                         bch2_bkey_nr_ptrs_allocated(k);
 286 #endif
 287                 int nr = (int) io_opts.data_replicas;
 288
 289                 if (nr > 0) {
 290                         m->op.nr_replicas = m->nr_ptrs_reserved = nr;
 291
 292                         ret = bch2_disk_reservation_get(c, &m->op.res,
 293                                         k.k->size, m->op.nr_replicas, 0);
 294                         if (ret)
 295                                 return ret;
 296                 }
 297                 break;
 298         }
 299         case DATA_REWRITE: {
 300                 unsigned compressed_sectors = 0;
 301
 302                 bkey_for_each_ptr_decode(k.k, ptrs, p, entry)
 303                         if (p.ptr.dev == data_opts.rewrite_dev &&
 304                             !p.ptr.cached &&
 305                             crc_is_compressed(p.crc))
 306                                 compressed_sectors += p.crc.compressed_size;
 307
 308                 if (compressed_sectors) {
 309                         ret = bch2_disk_reservation_add(c, &m->op.res,
 310                                         k.k->size * m->op.nr_replicas,
 311                                         BCH_DISK_RESERVATION_NOFAIL);
 312                         if (ret)
 313                                 return ret;
 314                 }
 315                 break;
 316         }
 317         case DATA_PROMOTE:
 318                 m->op.flags     |= BCH_WRITE_ALLOC_NOWAIT;
 319                 m->op.flags     |= BCH_WRITE_CACHED;
 320                 break;
 321         default:
 322                 BUG();
 323         }
 324
 325         return 0;
 326 }
 327
 328 static void move_free(struct closure *cl)
 329 {
 330         struct moving_io *io = container_of(cl, struct moving_io, cl);
 331         struct moving_context *ctxt = io->write.ctxt;
 332         struct bvec_iter_all iter;
 333         struct bio_vec *bv;
 334
 335         bch2_disk_reservation_put(io->write.op.c, &io->write.op.res);
 336
 337         bio_for_each_segment_all(bv, &io->write.op.wbio.bio, iter)
 338                 if (bv->bv_page)
 339                         __free_page(bv->bv_page);
 340
 341         wake_up(&ctxt->wait);
 342
 343         kfree(io);
 344 }
 345
 346 static void move_write_done(struct closure *cl)
 347 {
 348         struct moving_io *io = container_of(cl, struct moving_io, cl);
 349
 350         atomic_sub(io->write_sectors, &io->write.ctxt->write_sectors);
 351         closure_return_with_destructor(cl, move_free);
 352 }
 353
 354 static void move_write(struct closure *cl)
 355 {
 356         struct moving_io *io = container_of(cl, struct moving_io, cl);
 357
 358         if (unlikely(io->rbio.bio.bi_status || io->rbio.hole)) {
 359                 closure_return_with_destructor(cl, move_free);
 360                 return;
 361         }
 362
 363         bch2_migrate_read_done(&io->write, &io->rbio);
 364
 365         atomic_add(io->write_sectors, &io->write.ctxt->write_sectors);
 366         closure_call(&io->write.op.cl, bch2_write, NULL, cl);
 367         continue_at(cl, move_write_done, NULL);
 368 }
 369
 370 static inline struct moving_io *next_pending_write(struct moving_context *ctxt)
 371 {
 372         struct moving_io *io =
 373                 list_first_entry_or_null(&ctxt->reads, struct moving_io, list);
 374
 375         return io && io->read_completed ? io : NULL;
 376 }
 377
 378 static void move_read_endio(struct bio *bio)
 379 {
 380         struct moving_io *io = container_of(bio, struct moving_io, rbio.bio);
 381         struct moving_context *ctxt = io->write.ctxt;
 382
 383         atomic_sub(io->read_sectors, &ctxt->read_sectors);
 384         io->read_completed = true;
 385
 386         if (next_pending_write(ctxt))
 387                 wake_up(&ctxt->wait);
 388
 389         closure_put(&ctxt->cl);
 390 }
 391
 392 static void do_pending_writes(struct moving_context *ctxt)
 393 {
 394         struct moving_io *io;
 395
 396         while ((io = next_pending_write(ctxt))) {
 397                 list_del(&io->list);
 398                 closure_call(&io->cl, move_write, NULL, &ctxt->cl);
 399         }
 400 }
 401
 402 #define move_ctxt_wait_event(_ctxt, _cond)                      \
 403 do {                                                            \
 404         do_pending_writes(_ctxt);                               \
 405                                                                 \
 406         if (_cond)                                              \
 407                 break;                                          \
 408         __wait_event((_ctxt)->wait,                             \
 409                      next_pending_write(_ctxt) || (_cond));     \
 410 } while (1)
 411
 412 static void bch2_move_ctxt_wait_for_io(struct moving_context *ctxt)
 413 {
 414         unsigned sectors_pending = atomic_read(&ctxt->write_sectors);
 415
 416         move_ctxt_wait_event(ctxt,
 417                 !atomic_read(&ctxt->write_sectors) ||
 418                 atomic_read(&ctxt->write_sectors) != sectors_pending);
 419 }
 420
 421 static int bch2_move_extent(struct btree_trans *trans,
 422                             struct moving_context *ctxt,
 423                             struct write_point_specifier wp,
 424                             struct bch_io_opts io_opts,
 425                             enum btree_id btree_id,
 426                             struct bkey_s_c k,
 427                             enum data_cmd data_cmd,
 428                             struct data_opts data_opts)
 429 {
 430         struct bch_fs *c = trans->c;
 431         struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
 432         struct moving_io *io;
 433         const union bch_extent_entry *entry;
 434         struct extent_ptr_decoded p;
 435         unsigned sectors = k.k->size, pages;
 436         int ret = -ENOMEM;
 437
 438         move_ctxt_wait_event(ctxt,
 439                 atomic_read(&ctxt->write_sectors) <
 440                 SECTORS_IN_FLIGHT_PER_DEVICE);
 441
 442         move_ctxt_wait_event(ctxt,
 443                 atomic_read(&ctxt->read_sectors) <
 444                 SECTORS_IN_FLIGHT_PER_DEVICE);
 445
 446         /* write path might have to decompress data: */
 447         bkey_for_each_ptr_decode(k.k, ptrs, p, entry)
 448                 sectors = max_t(unsigned, sectors, p.crc.uncompressed_size);
 449
 450         pages = DIV_ROUND_UP(sectors, PAGE_SECTORS);
 451         io = kzalloc(sizeof(struct moving_io) +
 452                      sizeof(struct bio_vec) * pages, GFP_KERNEL);
 453         if (!io)
 454                 goto err;
 455
 456         io->write.ctxt          = ctxt;
 457         io->read_sectors        = k.k->size;
 458         io->write_sectors       = k.k->size;
 459
 460         bio_init(&io->write.op.wbio.bio, io->bi_inline_vecs, pages);
 461         bio_set_prio(&io->write.op.wbio.bio,
 462                      IOPRIO_PRIO_VALUE(IOPRIO_CLASS_IDLE, 0));
 463
 464         if (bch2_bio_alloc_pages(&io->write.op.wbio.bio, sectors << 9,
 465                                  GFP_KERNEL))
 466                 goto err_free;
 467
 468         io->rbio.c              = c;
 469         io->rbio.opts           = io_opts;
 470         bio_init(&io->rbio.bio, io->bi_inline_vecs, pages);
 471         io->rbio.bio.bi_vcnt = pages;
 472         bio_set_prio(&io->rbio.bio, IOPRIO_PRIO_VALUE(IOPRIO_CLASS_IDLE, 0));
 473         io->rbio.bio.bi_iter.bi_size = sectors << 9;
 474
 475         bio_set_op_attrs(&io->rbio.bio, REQ_OP_READ, 0);
 476         io->rbio.bio.bi_iter.bi_sector  = bkey_start_offset(k.k);
 477         io->rbio.bio.bi_end_io          = move_read_endio;
 478
 479         ret = bch2_migrate_write_init(c, &io->write, wp, io_opts,
 480                                       data_cmd, data_opts, btree_id, k);
 481         if (ret)
 482                 goto err_free_pages;
 483
 484         atomic64_inc(&ctxt->stats->keys_moved);
 485         atomic64_add(k.k->size, &ctxt->stats->sectors_moved);
 486
 487         trace_move_extent(k.k);
 488
 489         atomic_add(io->read_sectors, &ctxt->read_sectors);
 490         list_add_tail(&io->list, &ctxt->reads);
 491
 492         /*
 493          * dropped by move_read_endio() - guards against use after free of
 494          * ctxt when doing wakeup
 495          */
 496         closure_get(&ctxt->cl);
 497         bch2_read_extent(trans, &io->rbio,
 498                          bkey_start_pos(k.k),
 499                          btree_id, k, 0,
 500                          BCH_READ_NODECODE|
 501                          BCH_READ_LAST_FRAGMENT);
 502         return 0;
 503 err_free_pages:
 504         bio_free_pages(&io->write.op.wbio.bio);
 505 err_free:
 506         kfree(io);
 507 err:
 508         trace_move_alloc_fail(k.k);
 509         return ret;
 510 }
 511
 512 static int __bch2_move_data(struct bch_fs *c,
 513                 struct moving_context *ctxt,
 514                 struct bch_ratelimit *rate,
 515                 struct write_point_specifier wp,
 516                 struct bpos start,
 517                 struct bpos end,
 518                 move_pred_fn pred, void *arg,
 519                 struct bch_move_stats *stats,
 520                 enum btree_id btree_id)
 521 {
 522         bool kthread = (current->flags & PF_KTHREAD) != 0;
 523         struct bch_io_opts io_opts = bch2_opts_to_inode_opts(c->opts);
 524         struct bkey_buf sk;
 525         struct btree_trans trans;
 526         struct btree_iter *iter;
 527         struct bkey_s_c k;
 528         struct data_opts data_opts;
 529         enum data_cmd data_cmd;
 530         u64 delay, cur_inum = U64_MAX;
 531         int ret = 0, ret2;
 532
 533         bch2_bkey_buf_init(&sk);
 534         bch2_trans_init(&trans, c, 0, 0);
 535
 536         stats->data_type = BCH_DATA_user;
 537         stats->btree_id = btree_id;
 538         stats->pos      = start;
 539
 540         iter = bch2_trans_get_iter(&trans, btree_id, start,
 541                                    BTREE_ITER_PREFETCH);
 542
 543         if (rate)
 544                 bch2_ratelimit_reset(rate);
 545
 546         while (1) {
 547                 do {
 548                         delay = rate ? bch2_ratelimit_delay(rate) : 0;
 549
 550                         if (delay) {
 551                                 bch2_trans_unlock(&trans);
 552                                 set_current_state(TASK_INTERRUPTIBLE);
 553                         }
 554
 555                         if (kthread && (ret = kthread_should_stop())) {
 556                                 __set_current_state(TASK_RUNNING);
 557                                 goto out;
 558                         }
 559
 560                         if (delay)
 561                                 schedule_timeout(delay);
 562
 563                         if (unlikely(freezing(current))) {
 564                                 bch2_trans_unlock(&trans);
 565                                 move_ctxt_wait_event(ctxt, list_empty(&ctxt->reads));
 566                                 try_to_freeze();
 567                         }
 568                 } while (delay);
 569 peek:
 570                 k = bch2_btree_iter_peek(iter);
 571
 572                 stats->pos = iter->pos;
 573
 574                 if (!k.k)
 575                         break;
 576                 ret = bkey_err(k);
 577                 if (ret)
 578                         break;
 579                 if (bkey_cmp(bkey_start_pos(k.k), end) >= 0)
 580                         break;
 581
 582                 if (!bkey_extent_is_direct_data(k.k))
 583                         goto next_nondata;
 584
 585                 if (btree_id == BTREE_ID_extents &&
 586                     cur_inum != k.k->p.inode) {
 587                         struct bch_inode_unpacked inode;
 588
 589                         /* don't hold btree locks while looking up inode: */
 590                         bch2_trans_unlock(&trans);
 591
 592                         io_opts = bch2_opts_to_inode_opts(c->opts);
 593                         if (!bch2_inode_find_by_inum(c, k.k->p.inode, &inode))
 594                                 bch2_io_opts_apply(&io_opts, bch2_inode_opts_get(&inode));
 595                         cur_inum = k.k->p.inode;
 596                         goto peek;
 597                 }
 598
 599                 switch ((data_cmd = pred(c, arg, k, &io_opts, &data_opts))) {
 600                 case DATA_SKIP:
 601                         goto next;
 602                 case DATA_SCRUB:
 603                         BUG();
 604                 case DATA_ADD_REPLICAS:
 605                 case DATA_REWRITE:
 606                 case DATA_PROMOTE:
 607                         break;
 608                 default:
 609                         BUG();
 610                 }
 611
 612                 /* unlock before doing IO: */
 613                 bch2_bkey_buf_reassemble(&sk, c, k);
 614                 k = bkey_i_to_s_c(sk.k);
 615                 bch2_trans_unlock(&trans);
 616
 617                 ret2 = bch2_move_extent(&trans, ctxt, wp, io_opts, btree_id, k,
 618                                         data_cmd, data_opts);
 619                 if (ret2) {
 620                         if (ret2 == -EINTR) {
 621                                 bch2_trans_reset(&trans, 0);
 622                                 bch2_trans_cond_resched(&trans);
 623                                 continue;
 624                         }
 625
 626                         if (ret2 == -ENOMEM) {
 627                                 /* memory allocation failure, wait for some IO to finish */
 628                                 bch2_move_ctxt_wait_for_io(ctxt);
 629                                 continue;
 630                         }
 631
 632                         /* XXX signal failure */
 633                         goto next;
 634                 }
 635
 636                 if (rate)
 637                         bch2_ratelimit_increment(rate, k.k->size);
 638 next:
 639                 atomic64_add(k.k->size * bch2_bkey_nr_ptrs_allocated(k),
 640                              &stats->sectors_seen);
 641 next_nondata:
 642                 bch2_btree_iter_advance(iter);
 643                 bch2_trans_cond_resched(&trans);
 644         }
 645 out:
 646
 647         bch2_trans_iter_put(&trans, iter);
 648         ret = bch2_trans_exit(&trans) ?: ret;
 649         bch2_bkey_buf_exit(&sk, c);
 650
 651         return ret;
 652 }
 653
 654 int bch2_move_data(struct bch_fs *c,
 655                    enum btree_id start_btree_id, struct bpos start_pos,
 656                    enum btree_id end_btree_id,   struct bpos end_pos,
 657                    struct bch_ratelimit *rate,
 658                    struct write_point_specifier wp,
 659                    move_pred_fn pred, void *arg,
 660                    struct bch_move_stats *stats)
 661 {
 662         struct moving_context ctxt = { .stats = stats };
 663         enum btree_id id;
 664         int ret;
 665
 666         closure_init_stack(&ctxt.cl);
 667         INIT_LIST_HEAD(&ctxt.reads);
 668         init_waitqueue_head(&ctxt.wait);
 669
 670         stats->data_type = BCH_DATA_user;
 671
 672         for (id = start_btree_id;
 673              id <= min_t(unsigned, end_btree_id, BTREE_ID_NR - 1);
 674              id++) {
 675                 stats->btree_id = id;
 676
 677                 if (id != BTREE_ID_extents &&
 678                     id != BTREE_ID_reflink)
 679                         continue;
 680
 681                 ret = __bch2_move_data(c, &ctxt, rate, wp,
 682                                        id == start_btree_id ? start_pos : POS_MIN,
 683                                        id == end_btree_id   ? end_pos   : POS_MAX,
 684                                        pred, arg, stats, id);
 685                 if (ret)
 686                         break;
 687         }
 688
 689
 690         move_ctxt_wait_event(&ctxt, list_empty(&ctxt.reads));
 691         closure_sync(&ctxt.cl);
 692
 693         EBUG_ON(atomic_read(&ctxt.write_sectors));
 694
 695         trace_move_data(c,
 696                         atomic64_read(&stats->sectors_moved),
 697                         atomic64_read(&stats->keys_moved));
 698
 699         return ret;
 700 }
 701
 702 typedef enum data_cmd (*move_btree_pred)(struct bch_fs *, void *,
 703                                          struct btree *, struct bch_io_opts *,
 704                                          struct data_opts *);
 705
 706 static int bch2_move_btree(struct bch_fs *c,
 707                            enum btree_id start_btree_id, struct bpos start_pos,
 708                            enum btree_id end_btree_id,   struct bpos end_pos,
 709                            move_btree_pred pred, void *arg,
 710                            struct bch_move_stats *stats)
 711 {
 712         bool kthread = (current->flags & PF_KTHREAD) != 0;
 713         struct bch_io_opts io_opts = bch2_opts_to_inode_opts(c->opts);
 714         struct btree_trans trans;
 715         struct btree_iter *iter;
 716         struct btree *b;
 717         enum btree_id id;
 718         struct data_opts data_opts;
 719         enum data_cmd cmd;
 720         int ret = 0;
 721
 722         bch2_trans_init(&trans, c, 0, 0);
 723
 724         stats->data_type = BCH_DATA_btree;
 725
 726         for (id = start_btree_id;
 727              id <= min_t(unsigned, end_btree_id, BTREE_ID_NR - 1);
 728              id++) {
 729                 stats->btree_id = id;
 730
 731                 for_each_btree_node(&trans, iter, id,
 732                                     id == start_btree_id ? start_pos : POS_MIN,
 733                                     BTREE_ITER_PREFETCH, b) {
 734                         if (kthread && kthread_should_stop())
 735                                 goto out;
 736
 737                         if ((cmp_int(id, end_btree_id) ?:
 738                              bkey_cmp(b->key.k.p, end_pos)) > 0)
 739                                 break;
 740
 741                         stats->pos = iter->pos;
 742
 743                         switch ((cmd = pred(c, arg, b, &io_opts, &data_opts))) {
 744                         case DATA_SKIP:
 745                                 goto next;
 746                         case DATA_SCRUB:
 747                                 BUG();
 748                         case DATA_ADD_REPLICAS:
 749                         case DATA_REWRITE:
 750                                 break;
 751                         default:
 752                                 BUG();
 753                         }
 754
 755                         ret = bch2_btree_node_rewrite(c, iter,
 756                                         b->data->keys.seq, 0) ?: ret;
 757 next:
 758                         bch2_trans_cond_resched(&trans);
 759                 }
 760
 761                 ret = bch2_trans_iter_free(&trans, iter) ?: ret;
 762         }
 763 out:
 764         bch2_trans_exit(&trans);
 765
 766         return ret;
 767 }
 768
 769 #if 0
 770 static enum data_cmd scrub_pred(struct bch_fs *c, void *arg,
 771                                 struct bkey_s_c k,
 772                                 struct bch_io_opts *io_opts,
 773                                 struct data_opts *data_opts)
 774 {
 775         return DATA_SCRUB;
 776 }
 777 #endif
 778
 779 static enum data_cmd rereplicate_pred(struct bch_fs *c, void *arg,
 780                                       struct bkey_s_c k,
 781                                       struct bch_io_opts *io_opts,
 782                                       struct data_opts *data_opts)
 783 {
 784         unsigned nr_good = bch2_bkey_durability(c, k);
 785         unsigned replicas = 0;
 786
 787         switch (k.k->type) {
 788         case KEY_TYPE_btree_ptr:
 789                 replicas = c->opts.metadata_replicas;
 790                 break;
 791         case KEY_TYPE_extent:
 792                 replicas = io_opts->data_replicas;
 793                 break;
 794         }
 795
 796         if (!nr_good || nr_good >= replicas)
 797                 return DATA_SKIP;
 798
 799         data_opts->target               = 0;
 800         data_opts->nr_replicas          = 1;
 801         data_opts->btree_insert_flags   = 0;
 802         return DATA_ADD_REPLICAS;
 803 }
 804
 805 static enum data_cmd migrate_pred(struct bch_fs *c, void *arg,
 806                                   struct bkey_s_c k,
 807                                   struct bch_io_opts *io_opts,
 808                                   struct data_opts *data_opts)
 809 {
 810         struct bch_ioctl_data *op = arg;
 811
 812         if (!bch2_bkey_has_device(k, op->migrate.dev))
 813                 return DATA_SKIP;
 814
 815         data_opts->target               = 0;
 816         data_opts->nr_replicas          = 1;
 817         data_opts->btree_insert_flags   = 0;
 818         data_opts->rewrite_dev          = op->migrate.dev;
 819         return DATA_REWRITE;
 820 }
 821
 822 static enum data_cmd rereplicate_btree_pred(struct bch_fs *c, void *arg,
 823                                             struct btree *b,
 824                                             struct bch_io_opts *io_opts,
 825                                             struct data_opts *data_opts)
 826 {
 827         return rereplicate_pred(c, arg, bkey_i_to_s_c(&b->key), io_opts, data_opts);
 828 }
 829
 830 static enum data_cmd migrate_btree_pred(struct bch_fs *c, void *arg,
 831                                         struct btree *b,
 832                                         struct bch_io_opts *io_opts,
 833                                         struct data_opts *data_opts)
 834 {
 835         return migrate_pred(c, arg, bkey_i_to_s_c(&b->key), io_opts, data_opts);
 836 }
 837
 838 static bool bformat_needs_redo(struct bkey_format *f)
 839 {
 840         unsigned i;
 841
 842         for (i = 0; i < f->nr_fields; i++) {
 843                 unsigned unpacked_bits = bch2_bkey_format_current.bits_per_field[i];
 844                 u64 unpacked_mask = ~((~0ULL << 1) << (unpacked_bits - 1));
 845                 u64 field_offset = le64_to_cpu(f->field_offset[i]);
 846
 847                 if (f->bits_per_field[i] > unpacked_bits)
 848                         return true;
 849
 850                 if ((f->bits_per_field[i] == unpacked_bits) && field_offset)
 851                         return true;
 852
 853                 if (((field_offset + ((1ULL << f->bits_per_field[i]) - 1)) &
 854                      unpacked_mask) <
 855                     field_offset)
 856                         return true;
 857         }
 858
 859         return false;
 860 }
 861
 862 static enum data_cmd rewrite_old_nodes_pred(struct bch_fs *c, void *arg,
 863                                             struct btree *b,
 864                                             struct bch_io_opts *io_opts,
 865                                             struct data_opts *data_opts)
 866 {
 867         if (b->version_ondisk != c->sb.version ||
 868             btree_node_need_rewrite(b) ||
 869             bformat_needs_redo(&b->format)) {
 870                 data_opts->target               = 0;
 871                 data_opts->nr_replicas          = 1;
 872                 data_opts->btree_insert_flags   = 0;
 873                 return DATA_REWRITE;
 874         }
 875
 876         return DATA_SKIP;
 877 }
 878
 879 int bch2_scan_old_btree_nodes(struct bch_fs *c, struct bch_move_stats *stats)
 880 {
 881         int ret;
 882
 883         ret = bch2_move_btree(c,
 884                               0,                POS_MIN,
 885                               BTREE_ID_NR,      POS_MAX,
 886                               rewrite_old_nodes_pred, c, stats);
 887         if (!ret) {
 888                 mutex_lock(&c->sb_lock);
 889                 c->disk_sb.sb->compat[0] |= 1ULL << BCH_COMPAT_FEAT_EXTENTS_ABOVE_BTREE_UPDATES_DONE;
 890                 c->disk_sb.sb->compat[0] |= 1ULL << BCH_COMPAT_FEAT_BFORMAT_OVERFLOW_DONE;
 891                 c->disk_sb.sb->version_min = c->disk_sb.sb->version;
 892                 bch2_write_super(c);
 893                 mutex_unlock(&c->sb_lock);
 894         }
 895
 896         return ret;
 897 }
 898
 899 int bch2_data_job(struct bch_fs *c,
 900                   struct bch_move_stats *stats,
 901                   struct bch_ioctl_data op)
 902 {
 903         int ret = 0;
 904
 905         switch (op.op) {
 906         case BCH_DATA_OP_REREPLICATE:
 907                 stats->data_type = BCH_DATA_journal;
 908                 ret = bch2_journal_flush_device_pins(&c->journal, -1);
 909
 910                 ret = bch2_move_btree(c,
 911                                       op.start_btree,   op.start_pos,
 912                                       op.end_btree,     op.end_pos,
 913                                       rereplicate_btree_pred, c, stats) ?: ret;
 914
 915                 closure_wait_event(&c->btree_interior_update_wait,
 916                                    !bch2_btree_interior_updates_nr_pending(c));
 917
 918                 ret = bch2_replicas_gc2(c) ?: ret;
 919
 920                 ret = bch2_move_data(c,
 921                                      op.start_btree,    op.start_pos,
 922                                      op.end_btree,      op.end_pos,
 923                                      NULL, writepoint_hashed((unsigned long) current),
 924                                      rereplicate_pred, c, stats) ?: ret;
 925                 ret = bch2_replicas_gc2(c) ?: ret;
 926                 break;
 927         case BCH_DATA_OP_MIGRATE:
 928                 if (op.migrate.dev >= c->sb.nr_devices)
 929                         return -EINVAL;
 930
 931                 stats->data_type = BCH_DATA_journal;
 932                 ret = bch2_journal_flush_device_pins(&c->journal, op.migrate.dev);
 933
 934                 ret = bch2_move_btree(c,
 935                                       op.start_btree,   op.start_pos,
 936                                       op.end_btree,     op.end_pos,
 937                                       migrate_btree_pred, &op, stats) ?: ret;
 938                 ret = bch2_replicas_gc2(c) ?: ret;
 939
 940                 ret = bch2_move_data(c,
 941                                      op.start_btree,    op.start_pos,
 942                                      op.end_btree,      op.end_pos,
 943                                      NULL, writepoint_hashed((unsigned long) current),
 944                                      migrate_pred, &op, stats) ?: ret;
 945                 ret = bch2_replicas_gc2(c) ?: ret;
 946                 break;
 947         case BCH_DATA_OP_REWRITE_OLD_NODES:
 948                 ret = bch2_scan_old_btree_nodes(c, stats);
 949                 break;
 950         default:
 951                 ret = -EINVAL;
 952         }
 953
 954         return ret;
 955 }