1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) 2010 Kent Overstreet <kent.overstreet@gmail.com>
4 * Copyright (C) 2014 Datera Inc.
8 #include "alloc_background.h"
9 #include "alloc_foreground.h"
10 #include "bkey_methods.h"
12 #include "btree_key_cache.h"
13 #include "btree_locking.h"
14 #include "btree_update_interior.h"
31 #include <linux/slab.h>
32 #include <linux/bitops.h>
33 #include <linux/freezer.h>
34 #include <linux/kthread.h>
35 #include <linux/preempt.h>
36 #include <linux/rcupdate.h>
37 #include <linux/sched/task.h>
38 #include <trace/events/bcachefs.h>
40 #define DROP_THIS_NODE 10
41 #define DROP_PREV_NODE 11
43 static inline void __gc_pos_set(struct bch_fs *c, struct gc_pos new_pos)
46 write_seqcount_begin(&c->gc_pos_lock);
48 write_seqcount_end(&c->gc_pos_lock);
52 static inline void gc_pos_set(struct bch_fs *c, struct gc_pos new_pos)
54 BUG_ON(gc_pos_cmp(new_pos, c->gc_pos) <= 0);
55 __gc_pos_set(c, new_pos);
59 * Missing: if an interior btree node is empty, we need to do something -
60 * perhaps just kill it
62 static int bch2_gc_check_topology(struct bch_fs *c,
64 struct bkey_buf *prev,
68 struct bpos node_start = b->data->min_key;
69 struct bpos node_end = b->data->max_key;
70 struct bpos expected_start = bkey_deleted(&prev->k->k)
72 : bpos_successor(prev->k->k.p);
73 struct printbuf buf1 = PRINTBUF, buf2 = PRINTBUF;
76 if (cur.k->k.type == KEY_TYPE_btree_ptr_v2) {
77 struct bkey_i_btree_ptr_v2 *bp = bkey_i_to_btree_ptr_v2(cur.k);
79 if (bpos_cmp(expected_start, bp->v.min_key)) {
80 bch2_topology_error(c);
82 if (bkey_deleted(&prev->k->k)) {
83 pr_buf(&buf1, "start of node: ");
84 bch2_bpos_to_text(&buf1, node_start);
86 bch2_bkey_val_to_text(&buf1, c, bkey_i_to_s_c(prev->k));
88 bch2_bkey_val_to_text(&buf2, c, bkey_i_to_s_c(cur.k));
94 "btree node with incorrect min_key at btree %s level %u:\n"
97 bch2_btree_ids[b->c.btree_id], b->c.level,
98 buf1.buf, buf2.buf) &&
99 !test_bit(BCH_FS_TOPOLOGY_REPAIR_DONE, &c->flags)) {
100 bch_info(c, "Halting mark and sweep to start topology repair pass");
101 ret = FSCK_ERR_START_TOPOLOGY_REPAIR;
104 set_bit(BCH_FS_INITIAL_GC_UNFIXED, &c->flags);
109 if (is_last && bpos_cmp(cur.k->k.p, node_end)) {
110 bch2_topology_error(c);
112 printbuf_reset(&buf1);
113 printbuf_reset(&buf2);
115 bch2_bkey_val_to_text(&buf1, c, bkey_i_to_s_c(cur.k));
116 bch2_bpos_to_text(&buf2, node_end);
122 "btree node with incorrect max_key at btree %s level %u:\n"
125 bch2_btree_ids[b->c.btree_id], b->c.level,
126 buf1.buf, buf2.buf) &&
127 !test_bit(BCH_FS_TOPOLOGY_REPAIR_DONE, &c->flags)) {
128 bch_info(c, "Halting mark and sweep to start topology repair pass");
129 ret = FSCK_ERR_START_TOPOLOGY_REPAIR;
132 set_bit(BCH_FS_INITIAL_GC_UNFIXED, &c->flags);
136 bch2_bkey_buf_copy(prev, c, cur.k);
139 printbuf_exit(&buf2);
140 printbuf_exit(&buf1);
144 static void btree_ptr_to_v2(struct btree *b, struct bkey_i_btree_ptr_v2 *dst)
146 switch (b->key.k.type) {
147 case KEY_TYPE_btree_ptr: {
148 struct bkey_i_btree_ptr *src = bkey_i_to_btree_ptr(&b->key);
152 dst->v.seq = b->data->keys.seq;
153 dst->v.sectors_written = 0;
155 dst->v.min_key = b->data->min_key;
156 set_bkey_val_bytes(&dst->k, sizeof(dst->v) + bkey_val_bytes(&src->k));
157 memcpy(dst->v.start, src->v.start, bkey_val_bytes(&src->k));
160 case KEY_TYPE_btree_ptr_v2:
161 bkey_copy(&dst->k_i, &b->key);
168 static void bch2_btree_node_update_key_early(struct bch_fs *c,
169 enum btree_id btree, unsigned level,
170 struct bkey_s_c old, struct bkey_i *new)
176 bch2_bkey_buf_init(&tmp);
177 bch2_bkey_buf_reassemble(&tmp, c, old);
179 b = bch2_btree_node_get_noiter(c, tmp.k, btree, level, true);
180 if (!IS_ERR_OR_NULL(b)) {
181 mutex_lock(&c->btree_cache.lock);
183 bch2_btree_node_hash_remove(&c->btree_cache, b);
185 bkey_copy(&b->key, new);
186 ret = __bch2_btree_node_hash_insert(&c->btree_cache, b);
189 mutex_unlock(&c->btree_cache.lock);
190 six_unlock_read(&b->c.lock);
193 bch2_bkey_buf_exit(&tmp, c);
196 static int set_node_min(struct bch_fs *c, struct btree *b, struct bpos new_min)
198 struct bkey_i_btree_ptr_v2 *new;
201 new = kmalloc(BKEY_BTREE_PTR_U64s_MAX * sizeof(u64), GFP_KERNEL);
205 btree_ptr_to_v2(b, new);
206 b->data->min_key = new_min;
207 new->v.min_key = new_min;
208 SET_BTREE_PTR_RANGE_UPDATED(&new->v, true);
210 ret = bch2_journal_key_insert_take(c, b->c.btree_id, b->c.level + 1, &new->k_i);
216 bch2_btree_node_drop_keys_outside_node(b);
221 static int set_node_max(struct bch_fs *c, struct btree *b, struct bpos new_max)
223 struct bkey_i_btree_ptr_v2 *new;
226 ret = bch2_journal_key_delete(c, b->c.btree_id, b->c.level + 1, b->key.k.p);
230 new = kmalloc(BKEY_BTREE_PTR_U64s_MAX * sizeof(u64), GFP_KERNEL);
234 btree_ptr_to_v2(b, new);
235 b->data->max_key = new_max;
237 SET_BTREE_PTR_RANGE_UPDATED(&new->v, true);
239 ret = bch2_journal_key_insert_take(c, b->c.btree_id, b->c.level + 1, &new->k_i);
245 bch2_btree_node_drop_keys_outside_node(b);
247 mutex_lock(&c->btree_cache.lock);
248 bch2_btree_node_hash_remove(&c->btree_cache, b);
250 bkey_copy(&b->key, &new->k_i);
251 ret = __bch2_btree_node_hash_insert(&c->btree_cache, b);
253 mutex_unlock(&c->btree_cache.lock);
257 static int btree_repair_node_boundaries(struct bch_fs *c, struct btree *b,
258 struct btree *prev, struct btree *cur)
260 struct bpos expected_start = !prev
262 : bpos_successor(prev->key.k.p);
263 struct printbuf buf1 = PRINTBUF, buf2 = PRINTBUF;
267 pr_buf(&buf1, "start of node: ");
268 bch2_bpos_to_text(&buf1, b->data->min_key);
270 bch2_bkey_val_to_text(&buf1, c, bkey_i_to_s_c(&prev->key));
273 bch2_bkey_val_to_text(&buf2, c, bkey_i_to_s_c(&cur->key));
276 bpos_cmp(expected_start, cur->data->min_key) > 0 &&
277 BTREE_NODE_SEQ(cur->data) > BTREE_NODE_SEQ(prev->data)) {
278 /* cur overwrites prev: */
280 if (mustfix_fsck_err_on(bpos_cmp(prev->data->min_key,
281 cur->data->min_key) >= 0, c,
282 "btree node overwritten by next node at btree %s level %u:\n"
285 bch2_btree_ids[b->c.btree_id], b->c.level,
286 buf1.buf, buf2.buf)) {
287 ret = DROP_PREV_NODE;
291 if (mustfix_fsck_err_on(bpos_cmp(prev->key.k.p,
292 bpos_predecessor(cur->data->min_key)), c,
293 "btree node with incorrect max_key at btree %s level %u:\n"
296 bch2_btree_ids[b->c.btree_id], b->c.level,
298 ret = set_node_max(c, prev,
299 bpos_predecessor(cur->data->min_key));
301 /* prev overwrites cur: */
303 if (mustfix_fsck_err_on(bpos_cmp(expected_start,
304 cur->data->max_key) >= 0, c,
305 "btree node overwritten by prev node at btree %s level %u:\n"
308 bch2_btree_ids[b->c.btree_id], b->c.level,
309 buf1.buf, buf2.buf)) {
310 ret = DROP_THIS_NODE;
314 if (mustfix_fsck_err_on(bpos_cmp(expected_start, cur->data->min_key), c,
315 "btree node with incorrect min_key at btree %s level %u:\n"
318 bch2_btree_ids[b->c.btree_id], b->c.level,
320 ret = set_node_min(c, cur, expected_start);
324 printbuf_exit(&buf2);
325 printbuf_exit(&buf1);
329 static int btree_repair_node_end(struct bch_fs *c, struct btree *b,
332 struct printbuf buf1 = PRINTBUF, buf2 = PRINTBUF;
335 bch2_bkey_val_to_text(&buf1, c, bkey_i_to_s_c(&child->key));
336 bch2_bpos_to_text(&buf2, b->key.k.p);
338 if (mustfix_fsck_err_on(bpos_cmp(child->key.k.p, b->key.k.p), c,
339 "btree node with incorrect max_key at btree %s level %u:\n"
342 bch2_btree_ids[b->c.btree_id], b->c.level,
343 buf1.buf, buf2.buf)) {
344 ret = set_node_max(c, child, b->key.k.p);
350 printbuf_exit(&buf2);
351 printbuf_exit(&buf1);
355 static int bch2_btree_repair_topology_recurse(struct bch_fs *c, struct btree *b)
357 struct btree_and_journal_iter iter;
359 struct bkey_buf prev_k, cur_k;
360 struct btree *prev = NULL, *cur = NULL;
361 bool have_child, dropped_children = false;
369 have_child = dropped_children = false;
370 bch2_bkey_buf_init(&prev_k);
371 bch2_bkey_buf_init(&cur_k);
372 bch2_btree_and_journal_iter_init_node_iter(&iter, c, b);
374 while ((k = bch2_btree_and_journal_iter_peek(&iter)).k) {
375 BUG_ON(bpos_cmp(k.k->p, b->data->min_key) < 0);
376 BUG_ON(bpos_cmp(k.k->p, b->data->max_key) > 0);
378 bch2_btree_and_journal_iter_advance(&iter);
379 bch2_bkey_buf_reassemble(&cur_k, c, k);
381 cur = bch2_btree_node_get_noiter(c, cur_k.k,
382 b->c.btree_id, b->c.level - 1,
384 ret = PTR_ERR_OR_ZERO(cur);
386 printbuf_reset(&buf);
387 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(cur_k.k));
389 if (mustfix_fsck_err_on(ret == -EIO, c,
390 "Unreadable btree node at btree %s level %u:\n"
392 bch2_btree_ids[b->c.btree_id],
395 bch2_btree_node_evict(c, cur_k.k);
396 ret = bch2_journal_key_delete(c, b->c.btree_id,
397 b->c.level, cur_k.k->k.p);
404 bch_err(c, "%s: error %i getting btree node",
409 ret = btree_repair_node_boundaries(c, b, prev, cur);
411 if (ret == DROP_THIS_NODE) {
412 six_unlock_read(&cur->c.lock);
413 bch2_btree_node_evict(c, cur_k.k);
414 ret = bch2_journal_key_delete(c, b->c.btree_id,
415 b->c.level, cur_k.k->k.p);
422 six_unlock_read(&prev->c.lock);
425 if (ret == DROP_PREV_NODE) {
426 bch2_btree_node_evict(c, prev_k.k);
427 ret = bch2_journal_key_delete(c, b->c.btree_id,
428 b->c.level, prev_k.k->k.p);
432 bch2_btree_and_journal_iter_exit(&iter);
433 bch2_bkey_buf_exit(&prev_k, c);
434 bch2_bkey_buf_exit(&cur_k, c);
441 bch2_bkey_buf_copy(&prev_k, c, cur_k.k);
444 if (!ret && !IS_ERR_OR_NULL(prev)) {
446 ret = btree_repair_node_end(c, b, prev);
449 if (!IS_ERR_OR_NULL(prev))
450 six_unlock_read(&prev->c.lock);
452 if (!IS_ERR_OR_NULL(cur))
453 six_unlock_read(&cur->c.lock);
459 bch2_btree_and_journal_iter_exit(&iter);
460 bch2_btree_and_journal_iter_init_node_iter(&iter, c, b);
462 while ((k = bch2_btree_and_journal_iter_peek(&iter)).k) {
463 bch2_bkey_buf_reassemble(&cur_k, c, k);
464 bch2_btree_and_journal_iter_advance(&iter);
466 cur = bch2_btree_node_get_noiter(c, cur_k.k,
467 b->c.btree_id, b->c.level - 1,
469 ret = PTR_ERR_OR_ZERO(cur);
472 bch_err(c, "%s: error %i getting btree node",
477 ret = bch2_btree_repair_topology_recurse(c, cur);
478 six_unlock_read(&cur->c.lock);
481 if (ret == DROP_THIS_NODE) {
482 bch2_btree_node_evict(c, cur_k.k);
483 ret = bch2_journal_key_delete(c, b->c.btree_id,
484 b->c.level, cur_k.k->k.p);
485 dropped_children = true;
494 printbuf_reset(&buf);
495 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&b->key));
497 if (mustfix_fsck_err_on(!have_child, c,
498 "empty interior btree node at btree %s level %u\n"
500 bch2_btree_ids[b->c.btree_id],
501 b->c.level, buf.buf))
502 ret = DROP_THIS_NODE;
505 if (!IS_ERR_OR_NULL(prev))
506 six_unlock_read(&prev->c.lock);
507 if (!IS_ERR_OR_NULL(cur))
508 six_unlock_read(&cur->c.lock);
510 bch2_btree_and_journal_iter_exit(&iter);
511 bch2_bkey_buf_exit(&prev_k, c);
512 bch2_bkey_buf_exit(&cur_k, c);
514 if (!ret && dropped_children)
521 static int bch2_repair_topology(struct bch_fs *c)
527 for (i = 0; i < BTREE_ID_NR && !ret; i++) {
528 b = c->btree_roots[i].b;
529 if (btree_node_fake(b))
532 six_lock_read(&b->c.lock, NULL, NULL);
533 ret = bch2_btree_repair_topology_recurse(c, b);
534 six_unlock_read(&b->c.lock);
536 if (ret == DROP_THIS_NODE) {
537 bch_err(c, "empty btree root - repair unimplemented");
545 static int bch2_check_fix_ptrs(struct bch_fs *c, enum btree_id btree_id,
546 unsigned level, bool is_root,
549 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(*k);
550 const union bch_extent_entry *entry;
551 struct extent_ptr_decoded p = { 0 };
552 bool do_update = false;
553 struct printbuf buf = PRINTBUF;
558 * use check_bucket_ref here
560 bkey_for_each_ptr_decode(k->k, ptrs, p, entry) {
561 struct bch_dev *ca = bch_dev_bkey_exists(c, p.ptr.dev);
562 struct bucket *g = PTR_GC_BUCKET(ca, &p.ptr);
563 enum bch_data_type data_type = bch2_bkey_ptr_data_type(*k, &entry->ptr);
565 if (fsck_err_on(!g->gen_valid, c,
566 "bucket %u:%zu data type %s ptr gen %u missing in alloc btree\n"
568 p.ptr.dev, PTR_BUCKET_NR(ca, &p.ptr),
569 bch2_data_types[ptr_data_type(k->k, &p.ptr)],
571 (printbuf_reset(&buf),
572 bch2_bkey_val_to_text(&buf, c, *k), buf.buf))) {
574 g->_mark.gen = p.ptr.gen;
581 if (fsck_err_on(gen_cmp(p.ptr.gen, g->mark.gen) > 0, c,
582 "bucket %u:%zu data type %s ptr gen in the future: %u > %u\n"
584 p.ptr.dev, PTR_BUCKET_NR(ca, &p.ptr),
585 bch2_data_types[ptr_data_type(k->k, &p.ptr)],
586 p.ptr.gen, g->mark.gen,
587 (printbuf_reset(&buf),
588 bch2_bkey_val_to_text(&buf, c, *k), buf.buf))) {
590 g->_mark.gen = p.ptr.gen;
592 g->_mark.data_type = 0;
593 g->_mark.dirty_sectors = 0;
594 g->_mark.cached_sectors = 0;
595 set_bit(BCH_FS_NEED_ANOTHER_GC, &c->flags);
601 if (fsck_err_on(gen_cmp(g->mark.gen, p.ptr.gen) > BUCKET_GC_GEN_MAX, c,
602 "bucket %u:%zu gen %u data type %s: ptr gen %u too stale\n"
604 p.ptr.dev, PTR_BUCKET_NR(ca, &p.ptr), g->mark.gen,
605 bch2_data_types[ptr_data_type(k->k, &p.ptr)],
607 (printbuf_reset(&buf),
608 bch2_bkey_val_to_text(&buf, c, *k), buf.buf)))
611 if (fsck_err_on(!p.ptr.cached &&
612 gen_cmp(p.ptr.gen, g->mark.gen) < 0, c,
613 "bucket %u:%zu data type %s stale dirty ptr: %u < %u\n"
615 p.ptr.dev, PTR_BUCKET_NR(ca, &p.ptr),
616 bch2_data_types[ptr_data_type(k->k, &p.ptr)],
617 p.ptr.gen, g->mark.gen,
618 (printbuf_reset(&buf),
619 bch2_bkey_val_to_text(&buf, c, *k), buf.buf)))
622 if (data_type != BCH_DATA_btree && p.ptr.gen != g->mark.gen)
625 if (fsck_err_on(g->mark.data_type &&
626 g->mark.data_type != data_type, c,
627 "bucket %u:%zu different types of data in same bucket: %s, %s\n"
629 p.ptr.dev, PTR_BUCKET_NR(ca, &p.ptr),
630 bch2_data_types[g->mark.data_type],
631 bch2_data_types[data_type],
632 (printbuf_reset(&buf),
633 bch2_bkey_val_to_text(&buf, c, *k), buf.buf))) {
634 if (data_type == BCH_DATA_btree) {
635 g->_mark.data_type = data_type;
636 set_bit(BCH_FS_NEED_ANOTHER_GC, &c->flags);
643 struct gc_stripe *m = genradix_ptr(&c->gc_stripes, p.ec.idx);
645 if (fsck_err_on(!m || !m->alive, c,
646 "pointer to nonexistent stripe %llu\n"
649 (printbuf_reset(&buf),
650 bch2_bkey_val_to_text(&buf, c, *k), buf.buf)))
653 if (fsck_err_on(!bch2_ptr_matches_stripe_m(m, p), c,
654 "pointer does not match stripe %llu\n"
657 (printbuf_reset(&buf),
658 bch2_bkey_val_to_text(&buf, c, *k), buf.buf)))
664 struct bkey_ptrs ptrs;
665 union bch_extent_entry *entry;
666 struct bch_extent_ptr *ptr;
670 bch_err(c, "cannot update btree roots yet");
675 new = kmalloc(bkey_bytes(k->k), GFP_KERNEL);
677 bch_err(c, "%s: error allocating new key", __func__);
682 bkey_reassemble(new, *k);
686 * We don't want to drop btree node pointers - if the
687 * btree node isn't there anymore, the read path will
690 ptrs = bch2_bkey_ptrs(bkey_i_to_s(new));
691 bkey_for_each_ptr(ptrs, ptr) {
692 struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev);
693 struct bucket *g = PTR_GC_BUCKET(ca, ptr);
695 ptr->gen = g->mark.gen;
698 bch2_bkey_drop_ptrs(bkey_i_to_s(new), ptr, ({
699 struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev);
700 struct bucket *g = PTR_GC_BUCKET(ca, ptr);
701 enum bch_data_type data_type = bch2_bkey_ptr_data_type(*k, ptr);
704 (!g->gen_valid || gen_cmp(ptr->gen, g->mark.gen) > 0)) ||
706 gen_cmp(ptr->gen, g->mark.gen) < 0) ||
707 gen_cmp(g->mark.gen, ptr->gen) > BUCKET_GC_GEN_MAX ||
708 (g->mark.data_type &&
709 g->mark.data_type != data_type);
712 ptrs = bch2_bkey_ptrs(bkey_i_to_s(new));
713 bkey_extent_entry_for_each(ptrs, entry) {
714 if (extent_entry_type(entry) == BCH_EXTENT_ENTRY_stripe_ptr) {
715 struct gc_stripe *m = genradix_ptr(&c->gc_stripes,
716 entry->stripe_ptr.idx);
717 union bch_extent_entry *next_ptr;
719 bkey_extent_entry_for_each_from(ptrs, next_ptr, entry)
720 if (extent_entry_type(next_ptr) == BCH_EXTENT_ENTRY_ptr)
725 bch_err(c, "aieee, found stripe ptr with no data ptr");
729 if (!m || !m->alive ||
730 !__bch2_ptr_matches_stripe(&m->ptrs[entry->stripe_ptr.block],
733 bch2_bkey_extent_entry_drop(new, entry);
740 ret = bch2_journal_key_insert_take(c, btree_id, level, new);
747 bch2_btree_node_update_key_early(c, btree_id, level - 1, *k, new);
749 printbuf_reset(&buf);
750 bch2_bkey_val_to_text(&buf, c, *k);
751 bch_info(c, "updated %s", buf.buf);
753 printbuf_reset(&buf);
754 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(new));
755 bch_info(c, "new key %s", buf.buf);
757 *k = bkey_i_to_s_c(new);
765 /* marking of btree keys/nodes: */
767 static int bch2_gc_mark_key(struct btree_trans *trans, enum btree_id btree_id,
768 unsigned level, bool is_root,
772 struct bch_fs *c = trans->c;
773 struct bkey deleted = KEY(0, 0, 0);
774 struct bkey_s_c old = (struct bkey_s_c) { &deleted, NULL };
777 (initial ? BTREE_TRIGGER_NOATOMIC : 0);
783 BUG_ON(bch2_journal_seq_verify &&
784 k->k->version.lo > journal_cur_seq(&c->journal));
786 ret = bch2_check_fix_ptrs(c, btree_id, level, is_root, k);
790 if (fsck_err_on(k->k->version.lo > atomic64_read(&c->key_version), c,
791 "key version number higher than recorded: %llu > %llu",
793 atomic64_read(&c->key_version)))
794 atomic64_set(&c->key_version, k->k->version.lo);
797 ret = __bch2_trans_do(trans, NULL, NULL, 0,
798 bch2_mark_key(trans, old, *k, flags));
802 bch_err(c, "%s: ret %i", __func__, ret);
806 static int btree_gc_mark_node(struct btree_trans *trans, struct btree *b, bool initial)
808 struct bch_fs *c = trans->c;
809 struct btree_node_iter iter;
810 struct bkey unpacked;
812 struct bkey_buf prev, cur;
815 if (!btree_node_type_needs_gc(btree_node_type(b)))
818 bch2_btree_node_iter_init_from_start(&iter, b);
819 bch2_bkey_buf_init(&prev);
820 bch2_bkey_buf_init(&cur);
821 bkey_init(&prev.k->k);
823 while ((k = bch2_btree_node_iter_peek_unpack(&iter, b, &unpacked)).k) {
824 ret = bch2_gc_mark_key(trans, b->c.btree_id, b->c.level, false,
829 bch2_btree_node_iter_advance(&iter, b);
832 bch2_bkey_buf_reassemble(&cur, c, k);
834 ret = bch2_gc_check_topology(c, b, &prev, cur,
835 bch2_btree_node_iter_end(&iter));
841 bch2_bkey_buf_exit(&cur, c);
842 bch2_bkey_buf_exit(&prev, c);
846 static int bch2_gc_btree(struct btree_trans *trans, enum btree_id btree_id,
847 bool initial, bool metadata_only)
849 struct bch_fs *c = trans->c;
850 struct btree_iter iter;
852 unsigned depth = metadata_only ? 1
853 : bch2_expensive_debug_checks ? 0
854 : !btree_node_type_needs_gc(btree_id) ? 1
858 gc_pos_set(c, gc_pos_btree(btree_id, POS_MIN, 0));
860 __for_each_btree_node(trans, iter, btree_id, POS_MIN,
861 0, depth, BTREE_ITER_PREFETCH, b, ret) {
862 bch2_verify_btree_nr_keys(b);
864 gc_pos_set(c, gc_pos_btree_node(b));
866 ret = btree_gc_mark_node(trans, b, initial);
870 bch2_trans_iter_exit(trans, &iter);
875 mutex_lock(&c->btree_root_lock);
876 b = c->btree_roots[btree_id].b;
877 if (!btree_node_fake(b)) {
878 struct bkey_s_c k = bkey_i_to_s_c(&b->key);
880 ret = bch2_gc_mark_key(trans, b->c.btree_id, b->c.level,
883 gc_pos_set(c, gc_pos_btree_root(b->c.btree_id));
884 mutex_unlock(&c->btree_root_lock);
889 static int bch2_gc_btree_init_recurse(struct btree_trans *trans, struct btree *b,
890 unsigned target_depth)
892 struct bch_fs *c = trans->c;
893 struct btree_and_journal_iter iter;
895 struct bkey_buf cur, prev;
896 struct printbuf buf = PRINTBUF;
899 bch2_btree_and_journal_iter_init_node_iter(&iter, c, b);
900 bch2_bkey_buf_init(&prev);
901 bch2_bkey_buf_init(&cur);
902 bkey_init(&prev.k->k);
904 while ((k = bch2_btree_and_journal_iter_peek(&iter)).k) {
905 BUG_ON(bpos_cmp(k.k->p, b->data->min_key) < 0);
906 BUG_ON(bpos_cmp(k.k->p, b->data->max_key) > 0);
908 ret = bch2_gc_mark_key(trans, b->c.btree_id, b->c.level,
911 bch_err(c, "%s: error %i from bch2_gc_mark_key", __func__, ret);
916 bch2_bkey_buf_reassemble(&cur, c, k);
917 k = bkey_i_to_s_c(cur.k);
919 bch2_btree_and_journal_iter_advance(&iter);
921 ret = bch2_gc_check_topology(c, b,
923 !bch2_btree_and_journal_iter_peek(&iter).k);
927 bch2_btree_and_journal_iter_advance(&iter);
931 if (b->c.level > target_depth) {
932 bch2_btree_and_journal_iter_exit(&iter);
933 bch2_btree_and_journal_iter_init_node_iter(&iter, c, b);
935 while ((k = bch2_btree_and_journal_iter_peek(&iter)).k) {
938 bch2_bkey_buf_reassemble(&cur, c, k);
939 bch2_btree_and_journal_iter_advance(&iter);
941 child = bch2_btree_node_get_noiter(c, cur.k,
942 b->c.btree_id, b->c.level - 1,
944 ret = PTR_ERR_OR_ZERO(child);
947 bch2_topology_error(c);
953 "Unreadable btree node at btree %s level %u:\n"
955 bch2_btree_ids[b->c.btree_id],
957 (printbuf_reset(&buf),
958 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(cur.k)), buf.buf)) &&
959 !test_bit(BCH_FS_TOPOLOGY_REPAIR_DONE, &c->flags)) {
960 ret = FSCK_ERR_START_TOPOLOGY_REPAIR;
961 bch_info(c, "Halting mark and sweep to start topology repair pass");
964 /* Continue marking when opted to not
967 set_bit(BCH_FS_INITIAL_GC_UNFIXED, &c->flags);
971 bch_err(c, "%s: error %i getting btree node",
976 ret = bch2_gc_btree_init_recurse(trans, child,
978 six_unlock_read(&child->c.lock);
985 bch2_bkey_buf_exit(&cur, c);
986 bch2_bkey_buf_exit(&prev, c);
987 bch2_btree_and_journal_iter_exit(&iter);
992 static int bch2_gc_btree_init(struct btree_trans *trans,
993 enum btree_id btree_id,
996 struct bch_fs *c = trans->c;
998 unsigned target_depth = metadata_only ? 1
999 : bch2_expensive_debug_checks ? 0
1000 : !btree_node_type_needs_gc(btree_id) ? 1
1002 struct printbuf buf = PRINTBUF;
1005 b = c->btree_roots[btree_id].b;
1007 if (btree_node_fake(b))
1010 six_lock_read(&b->c.lock, NULL, NULL);
1011 printbuf_reset(&buf);
1012 bch2_bpos_to_text(&buf, b->data->min_key);
1013 if (mustfix_fsck_err_on(bpos_cmp(b->data->min_key, POS_MIN), c,
1014 "btree root with incorrect min_key: %s", buf.buf)) {
1015 bch_err(c, "repair unimplemented");
1016 ret = FSCK_ERR_EXIT;
1020 printbuf_reset(&buf);
1021 bch2_bpos_to_text(&buf, b->data->max_key);
1022 if (mustfix_fsck_err_on(bpos_cmp(b->data->max_key, SPOS_MAX), c,
1023 "btree root with incorrect max_key: %s", buf.buf)) {
1024 bch_err(c, "repair unimplemented");
1025 ret = FSCK_ERR_EXIT;
1029 if (b->c.level >= target_depth)
1030 ret = bch2_gc_btree_init_recurse(trans, b, target_depth);
1033 struct bkey_s_c k = bkey_i_to_s_c(&b->key);
1035 ret = bch2_gc_mark_key(trans, b->c.btree_id, b->c.level, true,
1039 six_unlock_read(&b->c.lock);
1042 bch_err(c, "%s: ret %i", __func__, ret);
1043 printbuf_exit(&buf);
1047 static inline int btree_id_gc_phase_cmp(enum btree_id l, enum btree_id r)
1049 return (int) btree_id_to_gc_phase(l) -
1050 (int) btree_id_to_gc_phase(r);
1053 static int bch2_gc_btrees(struct bch_fs *c, bool initial, bool metadata_only)
1055 struct btree_trans trans;
1056 enum btree_id ids[BTREE_ID_NR];
1060 bch2_trans_init(&trans, c, 0, 0);
1062 for (i = 0; i < BTREE_ID_NR; i++)
1064 bubble_sort(ids, BTREE_ID_NR, btree_id_gc_phase_cmp);
1066 for (i = 0; i < BTREE_ID_NR && !ret; i++)
1068 ? bch2_gc_btree_init(&trans, ids[i], metadata_only)
1069 : bch2_gc_btree(&trans, ids[i], initial, metadata_only);
1072 bch_err(c, "%s: ret %i", __func__, ret);
1074 bch2_trans_exit(&trans);
1078 static void mark_metadata_sectors(struct bch_fs *c, struct bch_dev *ca,
1080 enum bch_data_type type,
1083 u64 b = sector_to_bucket(ca, start);
1087 min_t(u64, bucket_to_sector(ca, b + 1), end) - start;
1089 bch2_mark_metadata_bucket(c, ca, b, type, sectors,
1090 gc_phase(GC_PHASE_SB), flags);
1093 } while (start < end);
1096 static void bch2_mark_dev_superblock(struct bch_fs *c, struct bch_dev *ca,
1099 struct bch_sb_layout *layout = &ca->disk_sb.sb->layout;
1103 for (i = 0; i < layout->nr_superblocks; i++) {
1104 u64 offset = le64_to_cpu(layout->sb_offset[i]);
1106 if (offset == BCH_SB_SECTOR)
1107 mark_metadata_sectors(c, ca, 0, BCH_SB_SECTOR,
1108 BCH_DATA_sb, flags);
1110 mark_metadata_sectors(c, ca, offset,
1111 offset + (1 << layout->sb_max_size_bits),
1112 BCH_DATA_sb, flags);
1115 for (i = 0; i < ca->journal.nr; i++) {
1116 b = ca->journal.buckets[i];
1117 bch2_mark_metadata_bucket(c, ca, b, BCH_DATA_journal,
1119 gc_phase(GC_PHASE_SB), flags);
1123 static void bch2_mark_superblocks(struct bch_fs *c)
1128 mutex_lock(&c->sb_lock);
1129 gc_pos_set(c, gc_phase(GC_PHASE_SB));
1131 for_each_online_member(ca, c, i)
1132 bch2_mark_dev_superblock(c, ca, BTREE_TRIGGER_GC);
1133 mutex_unlock(&c->sb_lock);
1137 /* Also see bch2_pending_btree_node_free_insert_done() */
1138 static void bch2_mark_pending_btree_node_frees(struct bch_fs *c)
1140 struct btree_update *as;
1141 struct pending_btree_node_free *d;
1143 mutex_lock(&c->btree_interior_update_lock);
1144 gc_pos_set(c, gc_phase(GC_PHASE_PENDING_DELETE));
1146 for_each_pending_btree_node_free(c, as, d)
1147 if (d->index_update_done)
1148 bch2_mark_key(c, bkey_i_to_s_c(&d->key), BTREE_TRIGGER_GC);
1150 mutex_unlock(&c->btree_interior_update_lock);
1154 static void bch2_gc_free(struct bch_fs *c)
1159 genradix_free(&c->reflink_gc_table);
1160 genradix_free(&c->gc_stripes);
1162 for_each_member_device(ca, c, i) {
1163 kvpfree(rcu_dereference_protected(ca->buckets[1], 1),
1164 sizeof(struct bucket_array) +
1165 ca->mi.nbuckets * sizeof(struct bucket));
1166 ca->buckets[1] = NULL;
1168 free_percpu(ca->usage_gc);
1169 ca->usage_gc = NULL;
1172 free_percpu(c->usage_gc);
1176 static int bch2_gc_done(struct bch_fs *c,
1177 bool initial, bool metadata_only)
1179 struct bch_dev *ca = NULL;
1180 struct printbuf buf = PRINTBUF;
1181 bool verify = !metadata_only && (!initial ||
1182 (c->sb.compat & (1ULL << BCH_COMPAT_alloc_info)));
1186 percpu_down_write(&c->mark_lock);
1188 #define copy_field(_f, _msg, ...) \
1189 if (dst->_f != src->_f) { \
1191 fsck_err(c, _msg ": got %llu, should be %llu" \
1192 , ##__VA_ARGS__, dst->_f, src->_f); \
1193 dst->_f = src->_f; \
1195 #define copy_stripe_field(_f, _msg, ...) \
1196 if (dst->_f != src->_f) { \
1198 fsck_err(c, "stripe %zu has wrong "_msg \
1199 ": got %u, should be %u", \
1200 iter.pos, ##__VA_ARGS__, \
1201 dst->_f, src->_f); \
1202 dst->_f = src->_f; \
1204 #define copy_dev_field(_f, _msg, ...) \
1205 copy_field(_f, "dev %u has wrong " _msg, dev, ##__VA_ARGS__)
1206 #define copy_fs_field(_f, _msg, ...) \
1207 copy_field(_f, "fs has wrong " _msg, ##__VA_ARGS__)
1209 for (i = 0; i < ARRAY_SIZE(c->usage); i++)
1210 bch2_fs_usage_acc_to_base(c, i);
1212 for_each_member_device(ca, c, dev) {
1213 struct bch_dev_usage *dst = ca->usage_base;
1214 struct bch_dev_usage *src = (void *)
1215 bch2_acc_percpu_u64s((void *) ca->usage_gc,
1218 copy_dev_field(buckets_ec, "buckets_ec");
1219 copy_dev_field(buckets_unavailable, "buckets_unavailable");
1221 for (i = 0; i < BCH_DATA_NR; i++) {
1222 copy_dev_field(d[i].buckets, "%s buckets", bch2_data_types[i]);
1223 copy_dev_field(d[i].sectors, "%s sectors", bch2_data_types[i]);
1224 copy_dev_field(d[i].fragmented, "%s fragmented", bch2_data_types[i]);
1229 unsigned nr = fs_usage_u64s(c);
1230 struct bch_fs_usage *dst = c->usage_base;
1231 struct bch_fs_usage *src = (void *)
1232 bch2_acc_percpu_u64s((void *) c->usage_gc, nr);
1234 copy_fs_field(hidden, "hidden");
1235 copy_fs_field(btree, "btree");
1237 if (!metadata_only) {
1238 copy_fs_field(data, "data");
1239 copy_fs_field(cached, "cached");
1240 copy_fs_field(reserved, "reserved");
1241 copy_fs_field(nr_inodes,"nr_inodes");
1243 for (i = 0; i < BCH_REPLICAS_MAX; i++)
1244 copy_fs_field(persistent_reserved[i],
1245 "persistent_reserved[%i]", i);
1248 for (i = 0; i < c->replicas.nr; i++) {
1249 struct bch_replicas_entry *e =
1250 cpu_replicas_entry(&c->replicas, i);
1252 if (metadata_only &&
1253 (e->data_type == BCH_DATA_user ||
1254 e->data_type == BCH_DATA_cached))
1257 printbuf_reset(&buf);
1258 bch2_replicas_entry_to_text(&buf, e);
1260 copy_fs_field(replicas[i], "%s", buf.buf);
1264 #undef copy_fs_field
1265 #undef copy_dev_field
1266 #undef copy_stripe_field
1270 percpu_ref_put(&ca->ref);
1272 bch_err(c, "%s: ret %i", __func__, ret);
1274 percpu_up_write(&c->mark_lock);
1275 printbuf_exit(&buf);
1279 static int bch2_gc_start(struct bch_fs *c,
1282 struct bch_dev *ca = NULL;
1285 BUG_ON(c->usage_gc);
1287 c->usage_gc = __alloc_percpu_gfp(fs_usage_u64s(c) * sizeof(u64),
1288 sizeof(u64), GFP_KERNEL);
1290 bch_err(c, "error allocating c->usage_gc");
1294 for_each_member_device(ca, c, i) {
1295 BUG_ON(ca->buckets[1]);
1296 BUG_ON(ca->usage_gc);
1298 ca->usage_gc = alloc_percpu(struct bch_dev_usage);
1299 if (!ca->usage_gc) {
1300 bch_err(c, "error allocating ca->usage_gc");
1301 percpu_ref_put(&ca->ref);
1309 static int bch2_alloc_write_key(struct btree_trans *trans,
1310 struct btree_iter *iter,
1313 struct bch_fs *c = trans->c;
1314 struct bch_dev *ca = bch_dev_bkey_exists(c, iter->pos.inode);
1317 struct bkey_alloc_unpacked old_u, new_u, gc_u;
1318 struct bkey_alloc_buf *a;
1321 k = bch2_btree_iter_peek_slot(iter);
1326 old_u = new_u = bch2_alloc_unpack(k);
1328 percpu_down_read(&c->mark_lock);
1329 g = gc_bucket(ca, iter->pos.offset);
1330 gc_u = (struct bkey_alloc_unpacked) {
1331 .dev = iter->pos.inode,
1332 .bucket = iter->pos.offset,
1334 .data_type = g->mark.data_type,
1335 .dirty_sectors = g->mark.dirty_sectors,
1336 .cached_sectors = g->mark.cached_sectors,
1337 .read_time = g->io_time[READ],
1338 .write_time = g->io_time[WRITE],
1339 .stripe = g->stripe,
1340 .stripe_redundancy = g->stripe_redundancy,
1342 percpu_up_read(&c->mark_lock);
1344 if (metadata_only &&
1345 gc_u.data_type != BCH_DATA_sb &&
1346 gc_u.data_type != BCH_DATA_journal &&
1347 gc_u.data_type != BCH_DATA_btree)
1350 if (gen_after(old_u.gen, gc_u.gen))
1353 #define copy_bucket_field(_f) \
1354 if (fsck_err_on(new_u._f != gc_u._f, c, \
1355 "bucket %llu:%llu gen %u data type %s has wrong " #_f \
1356 ": got %u, should be %u", \
1357 iter->pos.inode, iter->pos.offset, \
1359 bch2_data_types[new_u.data_type], \
1360 new_u._f, gc_u._f)) \
1361 new_u._f = gc_u._f; \
1363 copy_bucket_field(gen);
1364 copy_bucket_field(data_type);
1365 copy_bucket_field(stripe);
1366 copy_bucket_field(dirty_sectors);
1367 copy_bucket_field(cached_sectors);
1368 copy_bucket_field(stripe_redundancy);
1369 copy_bucket_field(stripe);
1370 #undef copy_bucket_field
1372 if (!bkey_alloc_unpacked_cmp(old_u, new_u))
1375 a = bch2_alloc_pack(trans, new_u);
1379 ret = bch2_trans_update(trans, iter, &a->k, BTREE_TRIGGER_NORUN);
1384 static int bch2_gc_alloc_done(struct bch_fs *c, bool metadata_only)
1386 struct btree_trans trans;
1387 struct btree_iter iter;
1393 bch2_trans_init(&trans, c, 0, 0);
1395 for_each_member_device(ca, c, i) {
1396 for_each_btree_key(&trans, iter, BTREE_ID_alloc,
1397 POS(ca->dev_idx, ca->mi.first_bucket),
1399 BTREE_ITER_PREFETCH, k, ret) {
1400 if (bkey_cmp(iter.pos, POS(ca->dev_idx, ca->mi.nbuckets)) >= 0)
1403 ret = __bch2_trans_do(&trans, NULL, NULL,
1404 BTREE_INSERT_LAZY_RW,
1405 bch2_alloc_write_key(&trans, &iter,
1410 bch2_trans_iter_exit(&trans, &iter);
1413 bch_err(c, "error writing alloc info: %i", ret);
1414 percpu_ref_put(&ca->ref);
1419 bch2_trans_exit(&trans);
1423 static int bch2_gc_alloc_start(struct bch_fs *c, bool metadata_only)
1428 for_each_member_device(ca, c, i) {
1429 struct bucket_array *buckets = kvpmalloc(sizeof(struct bucket_array) +
1430 ca->mi.nbuckets * sizeof(struct bucket),
1431 GFP_KERNEL|__GFP_ZERO);
1433 percpu_ref_put(&ca->ref);
1434 percpu_up_write(&c->mark_lock);
1435 bch_err(c, "error allocating ca->buckets[gc]");
1439 buckets->first_bucket = ca->mi.first_bucket;
1440 buckets->nbuckets = ca->mi.nbuckets;
1441 rcu_assign_pointer(ca->buckets[1], buckets);
1444 return bch2_alloc_read(c, true, metadata_only);
1447 static void bch2_gc_alloc_reset(struct bch_fs *c, bool metadata_only)
1452 for_each_member_device(ca, c, i) {
1453 struct bucket_array *buckets = __bucket_array(ca, true);
1456 for_each_bucket(g, buckets) {
1457 if (metadata_only &&
1458 (g->mark.data_type == BCH_DATA_user ||
1459 g->mark.data_type == BCH_DATA_cached ||
1460 g->mark.data_type == BCH_DATA_parity))
1462 g->_mark.dirty_sectors = 0;
1463 g->_mark.cached_sectors = 0;
1468 static int bch2_gc_reflink_done(struct bch_fs *c, bool metadata_only)
1470 struct btree_trans trans;
1471 struct btree_iter iter;
1473 struct reflink_gc *r;
1475 struct printbuf buf = PRINTBUF;
1481 bch2_trans_init(&trans, c, 0, 0);
1483 for_each_btree_key(&trans, iter, BTREE_ID_reflink, POS_MIN,
1484 BTREE_ITER_PREFETCH, k, ret) {
1485 const __le64 *refcount = bkey_refcount_c(k);
1490 r = genradix_ptr(&c->reflink_gc_table, idx++);
1492 r->offset != k.k->p.offset ||
1493 r->size != k.k->size) {
1494 bch_err(c, "unexpected inconsistency walking reflink table at gc finish");
1499 if (fsck_err_on(r->refcount != le64_to_cpu(*refcount), c,
1500 "reflink key has wrong refcount:\n"
1503 (printbuf_reset(&buf),
1504 bch2_bkey_val_to_text(&buf, c, k), buf.buf),
1508 new = kmalloc(bkey_bytes(k.k), GFP_KERNEL);
1514 bkey_reassemble(new, k);
1517 new->k.type = KEY_TYPE_deleted;
1519 *bkey_refcount(new) = cpu_to_le64(r->refcount);
1521 ret = __bch2_trans_do(&trans, NULL, NULL, 0,
1522 __bch2_btree_insert(&trans, BTREE_ID_reflink, new));
1530 bch2_trans_iter_exit(&trans, &iter);
1531 c->reflink_gc_nr = 0;
1532 bch2_trans_exit(&trans);
1533 printbuf_exit(&buf);
1537 static int bch2_gc_reflink_start(struct bch_fs *c,
1540 struct btree_trans trans;
1541 struct btree_iter iter;
1543 struct reflink_gc *r;
1549 bch2_trans_init(&trans, c, 0, 0);
1550 c->reflink_gc_nr = 0;
1552 for_each_btree_key(&trans, iter, BTREE_ID_reflink, POS_MIN,
1553 BTREE_ITER_PREFETCH, k, ret) {
1554 const __le64 *refcount = bkey_refcount_c(k);
1559 r = genradix_ptr_alloc(&c->reflink_gc_table, c->reflink_gc_nr++,
1566 r->offset = k.k->p.offset;
1567 r->size = k.k->size;
1570 bch2_trans_iter_exit(&trans, &iter);
1572 bch2_trans_exit(&trans);
1576 static void bch2_gc_reflink_reset(struct bch_fs *c, bool metadata_only)
1578 struct genradix_iter iter;
1579 struct reflink_gc *r;
1581 genradix_for_each(&c->reflink_gc_table, iter, r)
1585 static int bch2_gc_stripes_done(struct bch_fs *c, bool metadata_only)
1587 struct btree_trans trans;
1588 struct btree_iter iter;
1590 struct gc_stripe *m;
1591 const struct bch_stripe *s;
1592 struct printbuf buf = PRINTBUF;
1599 bch2_trans_init(&trans, c, 0, 0);
1601 for_each_btree_key(&trans, iter, BTREE_ID_stripes, POS_MIN,
1602 BTREE_ITER_PREFETCH, k, ret) {
1603 if (k.k->type != KEY_TYPE_stripe)
1606 s = bkey_s_c_to_stripe(k).v;
1607 m = genradix_ptr(&c->gc_stripes, k.k->p.offset);
1609 for (i = 0; i < s->nr_blocks; i++)
1610 if (stripe_blockcount_get(s, i) != (m ? m->block_sectors[i] : 0))
1614 if (fsck_err_on(true, c,
1615 "stripe has wrong block sector count %u:\n"
1618 (printbuf_reset(&buf),
1619 bch2_bkey_val_to_text(&buf, c, k), buf.buf),
1620 m ? m->block_sectors[i] : 0)) {
1621 struct bkey_i_stripe *new;
1623 new = kmalloc(bkey_bytes(k.k), GFP_KERNEL);
1629 bkey_reassemble(&new->k_i, k);
1631 for (i = 0; i < new->v.nr_blocks; i++)
1632 stripe_blockcount_set(&new->v, i, m ? m->block_sectors[i] : 0);
1634 ret = __bch2_trans_do(&trans, NULL, NULL, 0,
1635 __bch2_btree_insert(&trans, BTREE_ID_reflink, &new->k_i));
1640 bch2_trans_iter_exit(&trans, &iter);
1642 bch2_trans_exit(&trans);
1644 printbuf_exit(&buf);
1648 static void bch2_gc_stripes_reset(struct bch_fs *c, bool metadata_only)
1650 genradix_free(&c->gc_stripes);
1654 * bch2_gc - walk _all_ references to buckets, and recompute them:
1656 * Order matters here:
1657 * - Concurrent GC relies on the fact that we have a total ordering for
1658 * everything that GC walks - see gc_will_visit_node(),
1659 * gc_will_visit_root()
1661 * - also, references move around in the course of index updates and
1662 * various other crap: everything needs to agree on the ordering
1663 * references are allowed to move around in - e.g., we're allowed to
1664 * start with a reference owned by an open_bucket (the allocator) and
1665 * move it to the btree, but not the reverse.
1667 * This is necessary to ensure that gc doesn't miss references that
1668 * move around - if references move backwards in the ordering GC
1669 * uses, GC could skip past them
1671 int bch2_gc(struct bch_fs *c, bool initial, bool metadata_only)
1674 u64 start_time = local_clock();
1675 unsigned i, iter = 0;
1678 lockdep_assert_held(&c->state_lock);
1681 down_write(&c->gc_lock);
1683 /* flush interior btree updates: */
1684 closure_wait_event(&c->btree_interior_update_wait,
1685 !bch2_btree_interior_updates_nr_pending(c));
1687 ret = bch2_gc_start(c, metadata_only) ?:
1688 bch2_gc_alloc_start(c, metadata_only) ?:
1689 bch2_gc_reflink_start(c, metadata_only);
1693 gc_pos_set(c, gc_phase(GC_PHASE_START));
1695 bch2_mark_superblocks(c);
1697 if (BCH_SB_HAS_TOPOLOGY_ERRORS(c->disk_sb.sb) &&
1698 !test_bit(BCH_FS_INITIAL_GC_DONE, &c->flags) &&
1699 c->opts.fix_errors != FSCK_OPT_NO) {
1700 bch_info(c, "starting topology repair pass");
1701 ret = bch2_repair_topology(c);
1704 bch_info(c, "topology repair pass done");
1706 set_bit(BCH_FS_TOPOLOGY_REPAIR_DONE, &c->flags);
1709 ret = bch2_gc_btrees(c, initial, metadata_only);
1711 if (ret == FSCK_ERR_START_TOPOLOGY_REPAIR &&
1712 !test_bit(BCH_FS_TOPOLOGY_REPAIR_DONE, &c->flags) &&
1713 !test_bit(BCH_FS_INITIAL_GC_DONE, &c->flags)) {
1714 set_bit(BCH_FS_NEED_ANOTHER_GC, &c->flags);
1718 if (ret == FSCK_ERR_START_TOPOLOGY_REPAIR)
1719 ret = FSCK_ERR_EXIT;
1725 bch2_mark_pending_btree_node_frees(c);
1729 if (test_bit(BCH_FS_NEED_ANOTHER_GC, &c->flags) ||
1730 (!iter && bch2_test_restart_gc)) {
1732 bch_info(c, "Unable to fix bucket gens, looping");
1738 * XXX: make sure gens we fixed got saved
1740 bch_info(c, "Second GC pass needed, restarting:");
1741 clear_bit(BCH_FS_NEED_ANOTHER_GC, &c->flags);
1742 __gc_pos_set(c, gc_phase(GC_PHASE_NOT_RUNNING));
1744 bch2_gc_stripes_reset(c, metadata_only);
1745 bch2_gc_alloc_reset(c, metadata_only);
1746 bch2_gc_reflink_reset(c, metadata_only);
1748 /* flush fsck errors, reset counters */
1749 bch2_flush_fsck_errs(c);
1754 bch2_journal_block(&c->journal);
1756 ret = bch2_gc_stripes_done(c, metadata_only) ?:
1757 bch2_gc_reflink_done(c, metadata_only) ?:
1758 bch2_gc_alloc_done(c, metadata_only) ?:
1759 bch2_gc_done(c, initial, metadata_only);
1761 bch2_journal_unblock(&c->journal);
1764 percpu_down_write(&c->mark_lock);
1765 /* Indicates that gc is no longer in progress: */
1766 __gc_pos_set(c, gc_phase(GC_PHASE_NOT_RUNNING));
1769 percpu_up_write(&c->mark_lock);
1771 up_write(&c->gc_lock);
1774 bch2_time_stats_update(&c->times[BCH_TIME_btree_gc], start_time);
1777 * Wake up allocator in case it was waiting for buckets
1778 * because of not being able to inc gens
1780 for_each_member_device(ca, c, i)
1781 bch2_wake_allocator(ca);
1784 * At startup, allocations can happen directly instead of via the
1785 * allocator thread - issue wakeup in case they blocked on gc_lock:
1787 closure_wake_up(&c->freelist_wait);
1791 static bool gc_btree_gens_key(struct bch_fs *c, struct bkey_s_c k)
1793 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
1794 const struct bch_extent_ptr *ptr;
1796 percpu_down_read(&c->mark_lock);
1797 bkey_for_each_ptr(ptrs, ptr) {
1798 struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev);
1800 if (ptr_stale(ca, ptr) > 16) {
1801 percpu_up_read(&c->mark_lock);
1806 bkey_for_each_ptr(ptrs, ptr) {
1807 struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev);
1808 u8 *gen = &ca->oldest_gen[PTR_BUCKET_NR(ca, ptr)];
1810 if (gen_after(*gen, ptr->gen))
1813 percpu_up_read(&c->mark_lock);
1819 * For recalculating oldest gen, we only need to walk keys in leaf nodes; btree
1820 * node pointers currently never have cached pointers that can become stale:
1822 static int bch2_gc_btree_gens(struct btree_trans *trans, enum btree_id btree_id)
1824 struct bch_fs *c = trans->c;
1825 struct btree_iter iter;
1828 int ret = 0, commit_err = 0;
1830 bch2_bkey_buf_init(&sk);
1832 bch2_trans_iter_init(trans, &iter, btree_id, POS_MIN,
1833 BTREE_ITER_PREFETCH|
1834 BTREE_ITER_NOT_EXTENTS|
1835 BTREE_ITER_ALL_SNAPSHOTS);
1837 while ((bch2_trans_begin(trans),
1838 k = bch2_btree_iter_peek(&iter)).k) {
1846 c->gc_gens_pos = iter.pos;
1848 if (gc_btree_gens_key(c, k) && !commit_err) {
1849 bch2_bkey_buf_reassemble(&sk, c, k);
1850 bch2_extent_normalize(c, bkey_i_to_s(sk.k));
1853 bch2_trans_update(trans, &iter, sk.k, 0) ?:
1854 bch2_trans_commit(trans, NULL, NULL,
1855 BTREE_INSERT_NOWAIT|
1856 BTREE_INSERT_NOFAIL);
1857 if (commit_err == -EINTR) {
1863 bch2_btree_iter_advance(&iter);
1865 bch2_trans_iter_exit(trans, &iter);
1867 bch2_bkey_buf_exit(&sk, c);
1872 static int bch2_alloc_write_oldest_gen(struct btree_trans *trans, struct btree_iter *iter)
1874 struct bch_dev *ca = bch_dev_bkey_exists(trans->c, iter->pos.inode);
1876 struct bkey_alloc_unpacked u;
1879 k = bch2_btree_iter_peek_slot(iter);
1884 u = bch2_alloc_unpack(k);
1886 if (u.oldest_gen == ca->oldest_gen[iter->pos.offset])
1889 u.oldest_gen = ca->oldest_gen[iter->pos.offset];
1891 return bch2_alloc_write(trans, iter, &u, BTREE_TRIGGER_NORUN);
1894 int bch2_gc_gens(struct bch_fs *c)
1896 struct btree_trans trans;
1897 struct btree_iter iter;
1900 u64 b, start_time = local_clock();
1905 * Ideally we would be using state_lock and not gc_lock here, but that
1906 * introduces a deadlock in the RO path - we currently take the state
1907 * lock at the start of going RO, thus the gc thread may get stuck:
1909 if (!mutex_trylock(&c->gc_gens_lock))
1912 down_read(&c->gc_lock);
1913 bch2_trans_init(&trans, c, 0, 0);
1915 for_each_member_device(ca, c, i) {
1916 struct bucket_gens *gens;
1918 BUG_ON(ca->oldest_gen);
1920 ca->oldest_gen = kvmalloc(ca->mi.nbuckets, GFP_KERNEL);
1921 if (!ca->oldest_gen) {
1922 percpu_ref_put(&ca->ref);
1927 gens = bucket_gens(ca);
1929 for (b = gens->first_bucket;
1930 b < gens->nbuckets; b++)
1931 ca->oldest_gen[b] = gens->b[b];
1934 for (i = 0; i < BTREE_ID_NR; i++)
1935 if ((1 << i) & BTREE_ID_HAS_PTRS) {
1936 c->gc_gens_btree = i;
1937 c->gc_gens_pos = POS_MIN;
1938 ret = bch2_gc_btree_gens(&trans, i);
1940 bch_err(c, "error recalculating oldest_gen: %i", ret);
1945 for_each_btree_key(&trans, iter, BTREE_ID_alloc, POS_MIN,
1946 BTREE_ITER_PREFETCH, k, ret) {
1947 ret = __bch2_trans_do(&trans, NULL, NULL,
1948 BTREE_INSERT_NOFAIL,
1949 bch2_alloc_write_oldest_gen(&trans, &iter));
1951 bch_err(c, "error writing oldest_gen: %i", ret);
1955 bch2_trans_iter_exit(&trans, &iter);
1957 c->gc_gens_btree = 0;
1958 c->gc_gens_pos = POS_MIN;
1962 bch2_time_stats_update(&c->times[BCH_TIME_btree_gc], start_time);
1964 for_each_member_device(ca, c, i) {
1965 kvfree(ca->oldest_gen);
1966 ca->oldest_gen = NULL;
1969 bch2_trans_exit(&trans);
1970 up_read(&c->gc_lock);
1971 mutex_unlock(&c->gc_gens_lock);
1975 static int bch2_gc_thread(void *arg)
1977 struct bch_fs *c = arg;
1978 struct io_clock *clock = &c->io_clock[WRITE];
1979 unsigned long last = atomic64_read(&clock->now);
1980 unsigned last_kick = atomic_read(&c->kick_gc);
1987 set_current_state(TASK_INTERRUPTIBLE);
1989 if (kthread_should_stop()) {
1990 __set_current_state(TASK_RUNNING);
1994 if (atomic_read(&c->kick_gc) != last_kick)
1997 if (c->btree_gc_periodic) {
1998 unsigned long next = last + c->capacity / 16;
2000 if (atomic64_read(&clock->now) >= next)
2003 bch2_io_clock_schedule_timeout(clock, next);
2010 __set_current_state(TASK_RUNNING);
2012 last = atomic64_read(&clock->now);
2013 last_kick = atomic_read(&c->kick_gc);
2016 * Full gc is currently incompatible with btree key cache:
2019 ret = bch2_gc(c, false, false);
2021 ret = bch2_gc_gens(c);
2024 bch_err(c, "btree gc failed: %i", ret);
2026 debug_check_no_locks_held();
2032 void bch2_gc_thread_stop(struct bch_fs *c)
2034 struct task_struct *p;
2037 c->gc_thread = NULL;
2045 int bch2_gc_thread_start(struct bch_fs *c)
2047 struct task_struct *p;
2052 p = kthread_create(bch2_gc_thread, c, "bch-gc/%s", c->name);
2054 bch_err(c, "error creating gc thread: %li", PTR_ERR(p));