1 // SPDX-License-Identifier: GPL-2.0
4 #include "alloc_background.h"
5 #include "alloc_foreground.h"
6 #include "backpointers.h"
9 #include "btree_update.h"
10 #include "btree_update_interior.h"
11 #include "btree_write_buffer.h"
12 #include "disk_groups.h"
18 #include "journal_reclaim.h"
24 #include <linux/ioprio.h>
25 #include <linux/kthread.h>
27 #include <trace/events/bcachefs.h>
29 static void progress_list_add(struct bch_fs *c, struct bch_move_stats *stats)
31 mutex_lock(&c->data_progress_lock);
32 list_add(&stats->list, &c->data_progress_list);
33 mutex_unlock(&c->data_progress_lock);
36 static void progress_list_del(struct bch_fs *c, struct bch_move_stats *stats)
38 mutex_lock(&c->data_progress_lock);
39 list_del(&stats->list);
40 mutex_unlock(&c->data_progress_lock);
44 struct list_head list;
48 unsigned read_sectors;
49 unsigned write_sectors;
51 struct bch_read_bio rbio;
53 struct data_update write;
54 /* Must be last since it is variable size */
55 struct bio_vec bi_inline_vecs[0];
58 static void move_free(struct moving_io *io)
60 struct moving_context *ctxt = io->write.ctxt;
61 struct bch_fs *c = ctxt->c;
63 bch2_data_update_exit(&io->write);
65 bch2_write_ref_put(c, BCH_WRITE_REF_move);
69 static void move_write_done(struct bch_write_op *op)
71 struct moving_io *io = container_of(op, struct moving_io, write.op);
72 struct moving_context *ctxt = io->write.ctxt;
74 if (io->write.op.error)
75 ctxt->write_error = true;
77 atomic_sub(io->write_sectors, &io->write.ctxt->write_sectors);
78 atomic_dec(&io->write.ctxt->write_ios);
80 closure_put(&ctxt->cl);
83 static void move_write(struct moving_io *io)
85 if (unlikely(io->rbio.bio.bi_status || io->rbio.hole)) {
90 closure_get(&io->write.ctxt->cl);
91 atomic_add(io->write_sectors, &io->write.ctxt->write_sectors);
92 atomic_inc(&io->write.ctxt->write_ios);
94 bch2_data_update_read_done(&io->write, io->rbio.pick.crc);
97 struct moving_io *bch2_moving_ctxt_next_pending_write(struct moving_context *ctxt)
99 struct moving_io *io =
100 list_first_entry_or_null(&ctxt->reads, struct moving_io, list);
102 return io && io->read_completed ? io : NULL;
105 static void move_read_endio(struct bio *bio)
107 struct moving_io *io = container_of(bio, struct moving_io, rbio.bio);
108 struct moving_context *ctxt = io->write.ctxt;
110 atomic_sub(io->read_sectors, &ctxt->read_sectors);
111 atomic_dec(&ctxt->read_ios);
112 io->read_completed = true;
114 wake_up(&ctxt->wait);
115 closure_put(&ctxt->cl);
118 void bch2_moving_ctxt_do_pending_writes(struct moving_context *ctxt,
119 struct btree_trans *trans)
121 struct moving_io *io;
124 bch2_trans_unlock(trans);
126 while ((io = bch2_moving_ctxt_next_pending_write(ctxt))) {
132 static void bch2_move_ctxt_wait_for_io(struct moving_context *ctxt,
133 struct btree_trans *trans)
135 unsigned sectors_pending = atomic_read(&ctxt->write_sectors);
137 move_ctxt_wait_event(ctxt, trans,
138 !atomic_read(&ctxt->write_sectors) ||
139 atomic_read(&ctxt->write_sectors) != sectors_pending);
142 void bch2_moving_ctxt_exit(struct moving_context *ctxt)
144 move_ctxt_wait_event(ctxt, NULL, list_empty(&ctxt->reads));
145 closure_sync(&ctxt->cl);
147 EBUG_ON(atomic_read(&ctxt->write_sectors));
148 EBUG_ON(atomic_read(&ctxt->write_ios));
149 EBUG_ON(atomic_read(&ctxt->read_sectors));
150 EBUG_ON(atomic_read(&ctxt->read_ios));
153 progress_list_del(ctxt->c, ctxt->stats);
155 trace_move_data(ctxt->c,
156 atomic64_read(&ctxt->stats->sectors_moved),
157 atomic64_read(&ctxt->stats->keys_moved));
161 void bch2_moving_ctxt_init(struct moving_context *ctxt,
163 struct bch_ratelimit *rate,
164 struct bch_move_stats *stats,
165 struct write_point_specifier wp,
168 memset(ctxt, 0, sizeof(*ctxt));
174 ctxt->wait_on_copygc = wait_on_copygc;
176 closure_init_stack(&ctxt->cl);
177 INIT_LIST_HEAD(&ctxt->reads);
178 init_waitqueue_head(&ctxt->wait);
181 progress_list_add(c, stats);
182 stats->data_type = BCH_DATA_user;
186 void bch2_move_stats_init(struct bch_move_stats *stats, char *name)
188 memset(stats, 0, sizeof(*stats));
189 scnprintf(stats->name, sizeof(stats->name), "%s", name);
192 static int bch2_extent_drop_ptrs(struct btree_trans *trans,
193 struct btree_iter *iter,
195 struct data_update_opts data_opts)
197 struct bch_fs *c = trans->c;
201 n = bch2_bkey_make_mut(trans, k);
202 ret = PTR_ERR_OR_ZERO(n);
206 while (data_opts.kill_ptrs) {
207 unsigned i = 0, drop = __fls(data_opts.kill_ptrs);
208 struct bch_extent_ptr *ptr;
210 bch2_bkey_drop_ptrs(bkey_i_to_s(n), ptr, i++ == drop);
211 data_opts.kill_ptrs ^= 1U << drop;
215 * If the new extent no longer has any pointers, bch2_extent_normalize()
216 * will do the appropriate thing with it (turning it into a
217 * KEY_TYPE_error key, or just a discard if it was a cached extent)
219 bch2_extent_normalize(c, bkey_i_to_s(n));
222 * Since we're not inserting through an extent iterator
223 * (BTREE_ITER_ALL_SNAPSHOTS iterators aren't extent iterators),
224 * we aren't using the extent overwrite path to delete, we're
225 * just using the normal key deletion path:
227 if (bkey_deleted(&n->k))
230 return bch2_trans_update(trans, iter, n, BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE) ?:
231 bch2_trans_commit(trans, NULL, NULL, BTREE_INSERT_NOFAIL);
234 static int bch2_move_extent(struct btree_trans *trans,
235 struct btree_iter *iter,
236 struct moving_context *ctxt,
237 struct bch_io_opts io_opts,
238 enum btree_id btree_id,
240 struct data_update_opts data_opts)
242 struct bch_fs *c = trans->c;
243 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
244 struct moving_io *io;
245 const union bch_extent_entry *entry;
246 struct extent_ptr_decoded p;
247 unsigned sectors = k.k->size, pages;
250 bch2_data_update_opts_normalize(k, &data_opts);
252 if (!data_opts.rewrite_ptrs &&
253 !data_opts.extra_replicas) {
254 if (data_opts.kill_ptrs)
255 return bch2_extent_drop_ptrs(trans, iter, k, data_opts);
259 if (!bch2_write_ref_tryget(c, BCH_WRITE_REF_move))
260 return -BCH_ERR_erofs_no_writes;
263 * Before memory allocations & taking nocow locks in
264 * bch2_data_update_init():
266 bch2_trans_unlock(trans);
268 /* write path might have to decompress data: */
269 bkey_for_each_ptr_decode(k.k, ptrs, p, entry)
270 sectors = max_t(unsigned, sectors, p.crc.uncompressed_size);
272 pages = DIV_ROUND_UP(sectors, PAGE_SECTORS);
273 io = kzalloc(sizeof(struct moving_io) +
274 sizeof(struct bio_vec) * pages, GFP_KERNEL);
278 io->write.ctxt = ctxt;
279 io->read_sectors = k.k->size;
280 io->write_sectors = k.k->size;
282 bio_init(&io->write.op.wbio.bio, NULL, io->bi_inline_vecs, pages, 0);
283 bio_set_prio(&io->write.op.wbio.bio,
284 IOPRIO_PRIO_VALUE(IOPRIO_CLASS_IDLE, 0));
286 if (bch2_bio_alloc_pages(&io->write.op.wbio.bio, sectors << 9,
291 io->rbio.opts = io_opts;
292 bio_init(&io->rbio.bio, NULL, io->bi_inline_vecs, pages, 0);
293 io->rbio.bio.bi_vcnt = pages;
294 bio_set_prio(&io->rbio.bio, IOPRIO_PRIO_VALUE(IOPRIO_CLASS_IDLE, 0));
295 io->rbio.bio.bi_iter.bi_size = sectors << 9;
297 bio_set_op_attrs(&io->rbio.bio, REQ_OP_READ, 0);
298 io->rbio.bio.bi_iter.bi_sector = bkey_start_offset(k.k);
299 io->rbio.bio.bi_end_io = move_read_endio;
301 ret = bch2_data_update_init(trans, ctxt, &io->write, ctxt->wp,
302 io_opts, data_opts, btree_id, k);
303 if (ret && ret != -BCH_ERR_unwritten_extent_update)
306 io->write.ctxt = ctxt;
307 io->write.op.end_io = move_write_done;
309 atomic64_inc(&ctxt->stats->keys_moved);
310 atomic64_add(k.k->size, &ctxt->stats->sectors_moved);
312 if (ret == -BCH_ERR_unwritten_extent_update) {
313 bch2_update_unwritten_extent(trans, &io->write);
320 this_cpu_add(c->counters[BCH_COUNTER_io_move], k.k->size);
321 this_cpu_add(c->counters[BCH_COUNTER_move_extent_read], k.k->size);
322 trace_move_extent_read(k.k);
324 atomic_add(io->read_sectors, &ctxt->read_sectors);
325 atomic_inc(&ctxt->read_ios);
326 list_add_tail(&io->list, &ctxt->reads);
329 * dropped by move_read_endio() - guards against use after free of
330 * ctxt when doing wakeup
332 closure_get(&ctxt->cl);
333 bch2_read_extent(trans, &io->rbio,
337 BCH_READ_LAST_FRAGMENT);
340 bio_free_pages(&io->write.op.wbio.bio);
344 bch2_write_ref_put(c, BCH_WRITE_REF_move);
345 trace_and_count(c, move_extent_alloc_mem_fail, k.k);
349 static int lookup_inode(struct btree_trans *trans, struct bpos pos,
350 struct bch_inode_unpacked *inode)
352 struct btree_iter iter;
356 bch2_trans_iter_init(trans, &iter, BTREE_ID_inodes, pos,
357 BTREE_ITER_ALL_SNAPSHOTS);
358 k = bch2_btree_iter_peek(&iter);
363 if (!k.k || !bkey_eq(k.k->p, pos)) {
368 ret = bkey_is_inode(k.k) ? 0 : -EIO;
372 ret = bch2_inode_unpack(k, inode);
376 bch2_trans_iter_exit(trans, &iter);
380 static int move_ratelimit(struct btree_trans *trans,
381 struct moving_context *ctxt)
383 struct bch_fs *c = trans->c;
386 if (ctxt->wait_on_copygc) {
387 bch2_trans_unlock(trans);
388 wait_event_killable(c->copygc_running_wq,
389 !c->copygc_running ||
390 kthread_should_stop());
394 delay = ctxt->rate ? bch2_ratelimit_delay(ctxt->rate) : 0;
397 bch2_trans_unlock(trans);
398 set_current_state(TASK_INTERRUPTIBLE);
401 if ((current->flags & PF_KTHREAD) && kthread_should_stop()) {
402 __set_current_state(TASK_RUNNING);
407 schedule_timeout(delay);
409 if (unlikely(freezing(current))) {
410 move_ctxt_wait_event(ctxt, trans, list_empty(&ctxt->reads));
416 * XXX: these limits really ought to be per device, SSDs and hard drives
417 * will want different limits
419 move_ctxt_wait_event(ctxt, trans,
420 atomic_read(&ctxt->write_sectors) < c->opts.move_bytes_in_flight >> 9 &&
421 atomic_read(&ctxt->read_sectors) < c->opts.move_bytes_in_flight >> 9 &&
422 atomic_read(&ctxt->write_ios) < c->opts.move_ios_in_flight &&
423 atomic_read(&ctxt->read_ios) < c->opts.move_ios_in_flight);
428 static int move_get_io_opts(struct btree_trans *trans,
429 struct bch_io_opts *io_opts,
430 struct bkey_s_c k, u64 *cur_inum)
432 struct bch_inode_unpacked inode;
435 if (*cur_inum == k.k->p.inode)
438 ret = lookup_inode(trans,
439 SPOS(0, k.k->p.inode, k.k->p.snapshot),
441 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
445 bch2_inode_opts_get(io_opts, trans->c, &inode);
447 *io_opts = bch2_opts_to_inode_opts(trans->c->opts);
448 *cur_inum = k.k->p.inode;
452 static int __bch2_move_data(struct moving_context *ctxt,
455 move_pred_fn pred, void *arg,
456 enum btree_id btree_id)
458 struct bch_fs *c = ctxt->c;
459 struct bch_io_opts io_opts = bch2_opts_to_inode_opts(c->opts);
461 struct btree_trans trans;
462 struct btree_iter iter;
464 struct data_update_opts data_opts;
465 u64 cur_inum = U64_MAX;
468 bch2_bkey_buf_init(&sk);
469 bch2_trans_init(&trans, c, 0, 0);
471 ctxt->stats->data_type = BCH_DATA_user;
472 ctxt->stats->btree_id = btree_id;
473 ctxt->stats->pos = start;
475 bch2_trans_iter_init(&trans, &iter, btree_id, start,
477 BTREE_ITER_ALL_SNAPSHOTS);
480 bch2_ratelimit_reset(ctxt->rate);
482 while (!move_ratelimit(&trans, ctxt)) {
483 bch2_trans_begin(&trans);
485 k = bch2_btree_iter_peek(&iter);
490 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
495 if (bkey_ge(bkey_start_pos(k.k), end))
498 ctxt->stats->pos = iter.pos;
500 if (!bkey_extent_is_direct_data(k.k))
503 ret = move_get_io_opts(&trans, &io_opts, k, &cur_inum);
507 memset(&data_opts, 0, sizeof(data_opts));
508 if (!pred(c, arg, k, &io_opts, &data_opts))
512 * The iterator gets unlocked by __bch2_read_extent - need to
513 * save a copy of @k elsewhere:
515 bch2_bkey_buf_reassemble(&sk, c, k);
516 k = bkey_i_to_s_c(sk.k);
517 bch2_trans_unlock(&trans);
519 ret2 = bch2_move_extent(&trans, &iter, ctxt, io_opts,
520 btree_id, k, data_opts);
522 if (bch2_err_matches(ret2, BCH_ERR_transaction_restart))
525 if (ret2 == -ENOMEM) {
526 /* memory allocation failure, wait for some IO to finish */
527 bch2_move_ctxt_wait_for_io(ctxt, &trans);
531 /* XXX signal failure */
536 bch2_ratelimit_increment(ctxt->rate, k.k->size);
538 atomic64_add(k.k->size, &ctxt->stats->sectors_seen);
540 bch2_btree_iter_advance(&iter);
543 bch2_trans_iter_exit(&trans, &iter);
544 bch2_trans_exit(&trans);
545 bch2_bkey_buf_exit(&sk, c);
550 int bch2_move_data(struct bch_fs *c,
551 enum btree_id start_btree_id, struct bpos start_pos,
552 enum btree_id end_btree_id, struct bpos end_pos,
553 struct bch_ratelimit *rate,
554 struct bch_move_stats *stats,
555 struct write_point_specifier wp,
557 move_pred_fn pred, void *arg)
559 struct moving_context ctxt;
563 bch2_moving_ctxt_init(&ctxt, c, rate, stats, wp, wait_on_copygc);
565 for (id = start_btree_id;
566 id <= min_t(unsigned, end_btree_id, BTREE_ID_NR - 1);
568 stats->btree_id = id;
570 if (id != BTREE_ID_extents &&
571 id != BTREE_ID_reflink)
574 ret = __bch2_move_data(&ctxt,
575 id == start_btree_id ? start_pos : POS_MIN,
576 id == end_btree_id ? end_pos : POS_MAX,
582 bch2_moving_ctxt_exit(&ctxt);
587 static noinline void verify_bucket_evacuated(struct btree_trans *trans, struct bpos bucket, int gen)
589 struct bch_fs *c = trans->c;
590 struct btree_iter iter;
592 struct printbuf buf = PRINTBUF;
593 struct bch_backpointer bp;
597 bch2_trans_iter_init(trans, &iter, BTREE_ID_alloc,
598 bucket, BTREE_ITER_CACHED);
600 ret = lockrestart_do(trans,
601 bkey_err(k = bch2_btree_iter_peek_slot(&iter)));
603 if (!ret && k.k->type == KEY_TYPE_alloc_v4) {
604 struct bkey_s_c_alloc_v4 a = bkey_s_c_to_alloc_v4(k);
606 if (a.v->gen == gen &&
607 a.v->dirty_sectors) {
608 if (a.v->data_type == BCH_DATA_btree) {
609 bch2_trans_unlock(trans);
610 if (bch2_btree_interior_updates_flush(c))
612 goto failed_to_evacuate;
617 bch2_trans_iter_exit(trans, &iter);
620 bch2_trans_iter_exit(trans, &iter);
622 prt_printf(&buf, bch2_log_msg(c, "failed to evacuate bucket "));
623 bch2_bkey_val_to_text(&buf, c, k);
626 bch2_trans_begin(trans);
628 ret = bch2_get_next_backpointer(trans, bucket, gen,
631 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
635 if (bp_offset == U64_MAX)
638 k = bch2_backpointer_get_key(trans, &iter,
639 bucket, bp_offset, bp);
641 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
648 bch2_bkey_val_to_text(&buf, c, k);
649 bch2_trans_iter_exit(trans, &iter);
652 bch2_print_string_as_lines(KERN_ERR, buf.buf);
656 int __bch2_evacuate_bucket(struct moving_context *ctxt,
657 struct bpos bucket, int gen,
658 struct data_update_opts _data_opts)
660 struct bch_fs *c = ctxt->c;
661 struct bch_io_opts io_opts = bch2_opts_to_inode_opts(c->opts);
662 struct btree_trans trans;
663 struct btree_iter iter;
665 struct bch_backpointer bp;
666 struct bch_alloc_v4 a_convert;
667 const struct bch_alloc_v4 *a;
669 struct data_update_opts data_opts;
670 unsigned dirty_sectors, bucket_size;
671 u64 bp_offset = 0, cur_inum = U64_MAX;
674 bch2_bkey_buf_init(&sk);
675 bch2_trans_init(&trans, c, 0, 0);
677 bch2_trans_iter_init(&trans, &iter, BTREE_ID_alloc,
678 bucket, BTREE_ITER_CACHED);
679 ret = lockrestart_do(&trans,
680 bkey_err(k = bch2_btree_iter_peek_slot(&iter)));
681 bch2_trans_iter_exit(&trans, &iter);
684 bch_err(c, "%s: error looking up alloc key: %s", __func__, bch2_err_str(ret));
688 a = bch2_alloc_to_v4(k, &a_convert);
689 dirty_sectors = a->dirty_sectors;
690 bucket_size = bch_dev_bkey_exists(c, bucket.inode)->mi.bucket_size;
692 ret = bch2_btree_write_buffer_flush(&trans);
694 bch_err(c, "%s: error flushing btree write buffer: %s", __func__, bch2_err_str(ret));
698 while (!(ret = move_ratelimit(&trans, ctxt))) {
699 bch2_trans_begin(&trans);
701 ret = bch2_get_next_backpointer(&trans, bucket, gen,
704 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
708 if (bp_offset == U64_MAX)
712 const struct bch_extent_ptr *ptr;
716 k = bch2_backpointer_get_key(&trans, &iter,
717 bucket, bp_offset, bp);
719 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
726 bch2_bkey_buf_reassemble(&sk, c, k);
727 k = bkey_i_to_s_c(sk.k);
729 ret = move_get_io_opts(&trans, &io_opts, k, &cur_inum);
731 bch2_trans_iter_exit(&trans, &iter);
735 data_opts = _data_opts;
736 data_opts.target = io_opts.background_target;
737 data_opts.rewrite_ptrs = 0;
739 bkey_for_each_ptr(bch2_bkey_ptrs_c(k), ptr) {
740 if (ptr->dev == bucket.inode)
741 data_opts.rewrite_ptrs |= 1U << i;
745 ret = bch2_move_extent(&trans, &iter, ctxt, io_opts,
746 bp.btree_id, k, data_opts);
747 bch2_trans_iter_exit(&trans, &iter);
749 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
751 if (ret == -ENOMEM) {
752 /* memory allocation failure, wait for some IO to finish */
753 bch2_move_ctxt_wait_for_io(ctxt, &trans);
760 bch2_ratelimit_increment(ctxt->rate, k.k->size);
761 atomic64_add(k.k->size, &ctxt->stats->sectors_seen);
765 b = bch2_backpointer_get_node(&trans, &iter,
766 bucket, bp_offset, bp);
767 ret = PTR_ERR_OR_ZERO(b);
768 if (ret == -BCH_ERR_backpointer_to_overwritten_btree_node)
770 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
777 ret = bch2_btree_node_rewrite(&trans, &iter, b, 0);
778 bch2_trans_iter_exit(&trans, &iter);
780 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
786 bch2_ratelimit_increment(ctxt->rate,
787 c->opts.btree_node_size >> 9);
788 atomic64_add(c->opts.btree_node_size >> 9, &ctxt->stats->sectors_seen);
789 atomic64_add(c->opts.btree_node_size >> 9, &ctxt->stats->sectors_moved);
795 trace_evacuate_bucket(c, &bucket, dirty_sectors, bucket_size, ret);
797 if (IS_ENABLED(CONFIG_BCACHEFS_DEBUG) && gen >= 0) {
798 bch2_trans_unlock(&trans);
799 move_ctxt_wait_event(ctxt, NULL, list_empty(&ctxt->reads));
800 closure_sync(&ctxt->cl);
801 if (!ctxt->write_error)
802 verify_bucket_evacuated(&trans, bucket, gen);
805 bch2_trans_exit(&trans);
806 bch2_bkey_buf_exit(&sk, c);
810 int bch2_evacuate_bucket(struct bch_fs *c,
811 struct bpos bucket, int gen,
812 struct data_update_opts data_opts,
813 struct bch_ratelimit *rate,
814 struct bch_move_stats *stats,
815 struct write_point_specifier wp,
818 struct moving_context ctxt;
821 bch2_moving_ctxt_init(&ctxt, c, rate, stats, wp, wait_on_copygc);
822 ret = __bch2_evacuate_bucket(&ctxt, bucket, gen, data_opts);
823 bch2_moving_ctxt_exit(&ctxt);
828 typedef bool (*move_btree_pred)(struct bch_fs *, void *,
829 struct btree *, struct bch_io_opts *,
830 struct data_update_opts *);
832 static int bch2_move_btree(struct bch_fs *c,
833 enum btree_id start_btree_id, struct bpos start_pos,
834 enum btree_id end_btree_id, struct bpos end_pos,
835 move_btree_pred pred, void *arg,
836 struct bch_move_stats *stats)
838 bool kthread = (current->flags & PF_KTHREAD) != 0;
839 struct bch_io_opts io_opts = bch2_opts_to_inode_opts(c->opts);
840 struct btree_trans trans;
841 struct btree_iter iter;
844 struct data_update_opts data_opts;
847 bch2_trans_init(&trans, c, 0, 0);
848 progress_list_add(c, stats);
850 stats->data_type = BCH_DATA_btree;
852 for (id = start_btree_id;
853 id <= min_t(unsigned, end_btree_id, BTREE_ID_NR - 1);
855 stats->btree_id = id;
857 bch2_trans_node_iter_init(&trans, &iter, id, POS_MIN, 0, 0,
858 BTREE_ITER_PREFETCH);
861 while (bch2_trans_begin(&trans),
862 (b = bch2_btree_iter_peek_node(&iter)) &&
863 !(ret = PTR_ERR_OR_ZERO(b))) {
864 if (kthread && kthread_should_stop())
867 if ((cmp_int(id, end_btree_id) ?:
868 bpos_cmp(b->key.k.p, end_pos)) > 0)
871 stats->pos = iter.pos;
873 if (!pred(c, arg, b, &io_opts, &data_opts))
876 ret = bch2_btree_node_rewrite(&trans, &iter, b, 0) ?: ret;
877 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
882 bch2_btree_iter_next_node(&iter);
884 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
887 bch2_trans_iter_exit(&trans, &iter);
889 if (kthread && kthread_should_stop())
893 bch2_trans_exit(&trans);
896 bch_err(c, "error in %s(): %s", __func__, bch2_err_str(ret));
898 bch2_btree_interior_updates_flush(c);
900 progress_list_del(c, stats);
904 static bool rereplicate_pred(struct bch_fs *c, void *arg,
906 struct bch_io_opts *io_opts,
907 struct data_update_opts *data_opts)
909 unsigned nr_good = bch2_bkey_durability(c, k);
910 unsigned replicas = bkey_is_btree_ptr(k.k)
911 ? c->opts.metadata_replicas
912 : io_opts->data_replicas;
914 if (!nr_good || nr_good >= replicas)
917 data_opts->target = 0;
918 data_opts->extra_replicas = replicas - nr_good;
919 data_opts->btree_insert_flags = 0;
923 static bool migrate_pred(struct bch_fs *c, void *arg,
925 struct bch_io_opts *io_opts,
926 struct data_update_opts *data_opts)
928 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
929 const struct bch_extent_ptr *ptr;
930 struct bch_ioctl_data *op = arg;
933 data_opts->rewrite_ptrs = 0;
934 data_opts->target = 0;
935 data_opts->extra_replicas = 0;
936 data_opts->btree_insert_flags = 0;
938 bkey_for_each_ptr(ptrs, ptr) {
939 if (ptr->dev == op->migrate.dev)
940 data_opts->rewrite_ptrs |= 1U << i;
944 return data_opts->rewrite_ptrs != 0;
947 static bool rereplicate_btree_pred(struct bch_fs *c, void *arg,
949 struct bch_io_opts *io_opts,
950 struct data_update_opts *data_opts)
952 return rereplicate_pred(c, arg, bkey_i_to_s_c(&b->key), io_opts, data_opts);
955 static bool migrate_btree_pred(struct bch_fs *c, void *arg,
957 struct bch_io_opts *io_opts,
958 struct data_update_opts *data_opts)
960 return migrate_pred(c, arg, bkey_i_to_s_c(&b->key), io_opts, data_opts);
963 static bool bformat_needs_redo(struct bkey_format *f)
967 for (i = 0; i < f->nr_fields; i++) {
968 unsigned unpacked_bits = bch2_bkey_format_current.bits_per_field[i];
969 u64 unpacked_mask = ~((~0ULL << 1) << (unpacked_bits - 1));
970 u64 field_offset = le64_to_cpu(f->field_offset[i]);
972 if (f->bits_per_field[i] > unpacked_bits)
975 if ((f->bits_per_field[i] == unpacked_bits) && field_offset)
978 if (((field_offset + ((1ULL << f->bits_per_field[i]) - 1)) &
987 static bool rewrite_old_nodes_pred(struct bch_fs *c, void *arg,
989 struct bch_io_opts *io_opts,
990 struct data_update_opts *data_opts)
992 if (b->version_ondisk != c->sb.version ||
993 btree_node_need_rewrite(b) ||
994 bformat_needs_redo(&b->format)) {
995 data_opts->target = 0;
996 data_opts->extra_replicas = 0;
997 data_opts->btree_insert_flags = 0;
1004 int bch2_scan_old_btree_nodes(struct bch_fs *c, struct bch_move_stats *stats)
1008 ret = bch2_move_btree(c,
1010 BTREE_ID_NR, SPOS_MAX,
1011 rewrite_old_nodes_pred, c, stats);
1013 mutex_lock(&c->sb_lock);
1014 c->disk_sb.sb->compat[0] |= cpu_to_le64(1ULL << BCH_COMPAT_extents_above_btree_updates_done);
1015 c->disk_sb.sb->compat[0] |= cpu_to_le64(1ULL << BCH_COMPAT_bformat_overflow_done);
1016 c->disk_sb.sb->version_min = c->disk_sb.sb->version;
1017 bch2_write_super(c);
1018 mutex_unlock(&c->sb_lock);
1024 int bch2_data_job(struct bch_fs *c,
1025 struct bch_move_stats *stats,
1026 struct bch_ioctl_data op)
1031 case BCH_DATA_OP_REREPLICATE:
1032 bch2_move_stats_init(stats, "rereplicate");
1033 stats->data_type = BCH_DATA_journal;
1034 ret = bch2_journal_flush_device_pins(&c->journal, -1);
1036 ret = bch2_move_btree(c,
1037 op.start_btree, op.start_pos,
1038 op.end_btree, op.end_pos,
1039 rereplicate_btree_pred, c, stats) ?: ret;
1040 ret = bch2_replicas_gc2(c) ?: ret;
1042 ret = bch2_move_data(c,
1043 op.start_btree, op.start_pos,
1044 op.end_btree, op.end_pos,
1047 writepoint_hashed((unsigned long) current),
1049 rereplicate_pred, c) ?: ret;
1050 ret = bch2_replicas_gc2(c) ?: ret;
1052 case BCH_DATA_OP_MIGRATE:
1053 if (op.migrate.dev >= c->sb.nr_devices)
1056 bch2_move_stats_init(stats, "migrate");
1057 stats->data_type = BCH_DATA_journal;
1058 ret = bch2_journal_flush_device_pins(&c->journal, op.migrate.dev);
1060 ret = bch2_move_btree(c,
1061 op.start_btree, op.start_pos,
1062 op.end_btree, op.end_pos,
1063 migrate_btree_pred, &op, stats) ?: ret;
1064 ret = bch2_replicas_gc2(c) ?: ret;
1066 ret = bch2_move_data(c,
1067 op.start_btree, op.start_pos,
1068 op.end_btree, op.end_pos,
1071 writepoint_hashed((unsigned long) current),
1073 migrate_pred, &op) ?: ret;
1074 ret = bch2_replicas_gc2(c) ?: ret;
1076 case BCH_DATA_OP_REWRITE_OLD_NODES:
1077 bch2_move_stats_init(stats, "rewrite_old_nodes");
1078 ret = bch2_scan_old_btree_nodes(c, stats);