2 * Copyright (C) 2010 Kent Overstreet <kent.overstreet@gmail.com>
3 * Copyright (C) 2014 Datera Inc.
7 #include "alloc_background.h"
8 #include "alloc_foreground.h"
9 #include "bkey_methods.h"
10 #include "btree_locking.h"
11 #include "btree_update_interior.h"
21 #include "journal_io.h"
27 #include <linux/slab.h>
28 #include <linux/bitops.h>
29 #include <linux/freezer.h>
30 #include <linux/kthread.h>
31 #include <linux/preempt.h>
32 #include <linux/rcupdate.h>
33 #include <linux/sched/task.h>
34 #include <trace/events/bcachefs.h>
36 static inline void __gc_pos_set(struct bch_fs *c, struct gc_pos new_pos)
38 write_seqcount_begin(&c->gc_pos_lock);
40 write_seqcount_end(&c->gc_pos_lock);
43 static inline void gc_pos_set(struct bch_fs *c, struct gc_pos new_pos)
45 BUG_ON(gc_pos_cmp(new_pos, c->gc_pos) <= 0);
46 __gc_pos_set(c, new_pos);
49 /* range_checks - for validating min/max pos of each btree node: */
59 static void btree_node_range_checks_init(struct range_checks *r, unsigned depth)
63 for (i = 0; i < BTREE_MAX_DEPTH; i++)
64 r->l[i].min = r->l[i].max = POS_MIN;
68 static void btree_node_range_checks(struct bch_fs *c, struct btree *b,
69 struct range_checks *r)
71 struct range_level *l = &r->l[b->level];
73 struct bpos expected_min = bkey_cmp(l->min, l->max)
74 ? btree_type_successor(b->btree_id, l->max)
77 bch2_fs_inconsistent_on(bkey_cmp(b->data->min_key, expected_min), c,
78 "btree node has incorrect min key: %llu:%llu != %llu:%llu",
79 b->data->min_key.inode,
80 b->data->min_key.offset,
84 l->max = b->data->max_key;
86 if (b->level > r->depth) {
87 l = &r->l[b->level - 1];
89 bch2_fs_inconsistent_on(bkey_cmp(b->data->min_key, l->min), c,
90 "btree node min doesn't match min of child nodes: %llu:%llu != %llu:%llu",
91 b->data->min_key.inode,
92 b->data->min_key.offset,
96 bch2_fs_inconsistent_on(bkey_cmp(b->data->max_key, l->max), c,
97 "btree node max doesn't match max of child nodes: %llu:%llu != %llu:%llu",
98 b->data->max_key.inode,
99 b->data->max_key.offset,
103 if (bkey_cmp(b->data->max_key, POS_MAX))
105 btree_type_successor(b->btree_id,
110 /* marking of btree keys/nodes: */
112 static int bch2_gc_mark_key(struct bch_fs *c, struct bkey_s_c k,
113 u8 *max_stale, bool initial)
115 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
116 const struct bch_extent_ptr *ptr;
117 struct gc_pos pos = { 0 };
120 (initial ? BCH_BUCKET_MARK_NOATOMIC : 0);
124 BUG_ON(journal_seq_verify(c) &&
125 k.k->version.lo > journal_cur_seq(&c->journal));
127 if (k.k->version.lo > atomic64_read(&c->key_version))
128 atomic64_set(&c->key_version, k.k->version.lo);
130 if (test_bit(BCH_FS_REBUILD_REPLICAS, &c->flags) ||
131 fsck_err_on(!bch2_bkey_replicas_marked(c, k, false), c,
132 "superblock not marked as containing replicas (type %u)",
134 ret = bch2_mark_bkey_replicas(c, k);
139 bkey_for_each_ptr(ptrs, ptr) {
140 struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev);
141 size_t b = PTR_BUCKET_NR(ca, ptr);
142 struct bucket *g = PTR_BUCKET(ca, ptr);
144 if (mustfix_fsck_err_on(!g->mark.gen_valid, c,
145 "found ptr with missing gen in alloc btree,\n"
147 k.k->type, ptr->gen)) {
148 g->_mark.gen = ptr->gen;
149 g->_mark.gen_valid = 1;
150 set_bit(b, ca->buckets_dirty);
153 if (mustfix_fsck_err_on(gen_cmp(ptr->gen, g->mark.gen) > 0, c,
154 "%u ptr gen in the future: %u > %u",
155 k.k->type, ptr->gen, g->mark.gen)) {
156 g->_mark.gen = ptr->gen;
157 g->_mark.gen_valid = 1;
158 set_bit(b, ca->buckets_dirty);
159 set_bit(BCH_FS_FIXED_GENS, &c->flags);
164 bkey_for_each_ptr(ptrs, ptr) {
165 struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev);
166 size_t b = PTR_BUCKET_NR(ca, ptr);
168 if (gen_after(ca->oldest_gens[b], ptr->gen))
169 ca->oldest_gens[b] = ptr->gen;
171 *max_stale = max(*max_stale, ptr_stale(ca, ptr));
174 bch2_mark_key(c, k, true, k.k->size, pos, NULL, 0, flags);
179 static int btree_gc_mark_node(struct bch_fs *c, struct btree *b,
180 u8 *max_stale, bool initial)
182 struct btree_node_iter iter;
183 struct bkey unpacked;
189 if (!btree_node_type_needs_gc(btree_node_type(b)))
192 for_each_btree_node_key_unpack(b, k, &iter,
194 bch2_bkey_debugcheck(c, b, k);
196 ret = bch2_gc_mark_key(c, k, max_stale, initial);
204 static int bch2_gc_btree(struct bch_fs *c, enum btree_id btree_id,
207 struct btree_iter iter;
209 struct range_checks r;
210 unsigned depth = btree_node_type_needs_gc(btree_id) ? 0 : 1;
214 gc_pos_set(c, gc_pos_btree(btree_id, POS_MIN, 0));
217 * if expensive_debug_checks is on, run range_checks on all leaf nodes:
219 * and on startup, we have to read every btree node (XXX: only if it was
220 * an unclean shutdown)
222 if (initial || expensive_debug_checks(c))
225 btree_node_range_checks_init(&r, depth);
227 __for_each_btree_node(&iter, c, btree_id, POS_MIN,
228 0, depth, BTREE_ITER_PREFETCH, b) {
229 btree_node_range_checks(c, b, &r);
231 bch2_verify_btree_nr_keys(b);
233 ret = btree_gc_mark_node(c, b, &max_stale, initial);
237 gc_pos_set(c, gc_pos_btree_node(b));
241 bch2_btree_node_rewrite(c, &iter,
243 BTREE_INSERT_USE_RESERVE|
245 BTREE_INSERT_GC_LOCK_HELD);
246 else if (!btree_gc_rewrite_disabled(c) &&
247 (btree_gc_always_rewrite(c) || max_stale > 16))
248 bch2_btree_node_rewrite(c, &iter,
251 BTREE_INSERT_GC_LOCK_HELD);
254 bch2_btree_iter_cond_resched(&iter);
256 ret = bch2_btree_iter_unlock(&iter) ?: ret;
260 mutex_lock(&c->btree_root_lock);
262 b = c->btree_roots[btree_id].b;
263 if (!btree_node_fake(b))
264 bch2_gc_mark_key(c, bkey_i_to_s_c(&b->key),
265 &max_stale, initial);
266 gc_pos_set(c, gc_pos_btree_root(b->btree_id));
268 mutex_unlock(&c->btree_root_lock);
272 static inline int btree_id_gc_phase_cmp(enum btree_id l, enum btree_id r)
274 return (int) btree_id_to_gc_phase(l) -
275 (int) btree_id_to_gc_phase(r);
278 static int bch2_gc_btrees(struct bch_fs *c, struct list_head *journal,
281 enum btree_id ids[BTREE_ID_NR];
285 for (i = 0; i < BTREE_ID_NR; i++)
287 bubble_sort(ids, BTREE_ID_NR, btree_id_gc_phase_cmp);
289 for (i = 0; i < BTREE_ID_NR; i++) {
290 enum btree_id id = ids[i];
291 enum btree_node_type type = __btree_node_type(0, id);
293 int ret = bch2_gc_btree(c, id, initial);
297 if (journal && btree_node_type_needs_gc(type)) {
298 struct bkey_i *k, *n;
299 struct jset_entry *j;
300 struct journal_replay *r;
303 list_for_each_entry(r, journal, list)
304 for_each_jset_key(k, n, j, &r->j) {
305 if (type == __btree_node_type(j->level, j->btree_id)) {
306 ret = bch2_gc_mark_key(c,
308 &max_stale, initial);
319 static void mark_metadata_sectors(struct bch_fs *c, struct bch_dev *ca,
321 enum bch_data_type type,
324 u64 b = sector_to_bucket(ca, start);
328 min_t(u64, bucket_to_sector(ca, b + 1), end) - start;
330 bch2_mark_metadata_bucket(c, ca, b, type, sectors,
331 gc_phase(GC_PHASE_SB), flags);
334 } while (start < end);
337 void bch2_mark_dev_superblock(struct bch_fs *c, struct bch_dev *ca,
340 struct bch_sb_layout *layout = &ca->disk_sb.sb->layout;
345 * This conditional is kind of gross, but we may be called from the
346 * device add path, before the new device has actually been added to the
347 * running filesystem:
350 lockdep_assert_held(&c->sb_lock);
351 percpu_down_read_preempt_disable(&c->usage_lock);
356 for (i = 0; i < layout->nr_superblocks; i++) {
357 u64 offset = le64_to_cpu(layout->sb_offset[i]);
359 if (offset == BCH_SB_SECTOR)
360 mark_metadata_sectors(c, ca, 0, BCH_SB_SECTOR,
363 mark_metadata_sectors(c, ca, offset,
364 offset + (1 << layout->sb_max_size_bits),
368 for (i = 0; i < ca->journal.nr; i++) {
369 b = ca->journal.buckets[i];
370 bch2_mark_metadata_bucket(c, ca, b, BCH_DATA_JOURNAL,
372 gc_phase(GC_PHASE_SB), flags);
376 percpu_up_read_preempt_enable(&c->usage_lock);
382 static void bch2_mark_superblocks(struct bch_fs *c)
387 mutex_lock(&c->sb_lock);
388 gc_pos_set(c, gc_phase(GC_PHASE_SB));
390 for_each_online_member(ca, c, i)
391 bch2_mark_dev_superblock(c, ca, BCH_BUCKET_MARK_GC);
392 mutex_unlock(&c->sb_lock);
395 /* Also see bch2_pending_btree_node_free_insert_done() */
396 static void bch2_mark_pending_btree_node_frees(struct bch_fs *c)
398 struct gc_pos pos = { 0 };
399 struct btree_update *as;
400 struct pending_btree_node_free *d;
402 mutex_lock(&c->btree_interior_update_lock);
403 gc_pos_set(c, gc_phase(GC_PHASE_PENDING_DELETE));
405 for_each_pending_btree_node_free(c, as, d)
406 if (d->index_update_done)
407 bch2_mark_key(c, bkey_i_to_s_c(&d->key),
412 mutex_unlock(&c->btree_interior_update_lock);
415 static void bch2_mark_allocator_buckets(struct bch_fs *c)
418 struct open_bucket *ob;
422 percpu_down_read_preempt_disable(&c->usage_lock);
424 spin_lock(&c->freelist_lock);
425 gc_pos_set(c, gc_pos_alloc(c, NULL));
427 for_each_member_device(ca, c, ci) {
428 fifo_for_each_entry(i, &ca->free_inc, iter)
429 bch2_mark_alloc_bucket(c, ca, i, true,
430 gc_pos_alloc(c, NULL),
435 for (j = 0; j < RESERVE_NR; j++)
436 fifo_for_each_entry(i, &ca->free[j], iter)
437 bch2_mark_alloc_bucket(c, ca, i, true,
438 gc_pos_alloc(c, NULL),
442 spin_unlock(&c->freelist_lock);
444 for (ob = c->open_buckets;
445 ob < c->open_buckets + ARRAY_SIZE(c->open_buckets);
447 spin_lock(&ob->lock);
449 gc_pos_set(c, gc_pos_alloc(c, ob));
450 ca = bch_dev_bkey_exists(c, ob->ptr.dev);
451 bch2_mark_alloc_bucket(c, ca, PTR_BUCKET_NR(ca, &ob->ptr), true,
455 spin_unlock(&ob->lock);
458 percpu_up_read_preempt_enable(&c->usage_lock);
461 static void bch2_gc_free(struct bch_fs *c)
466 genradix_free(&c->stripes[1]);
468 for_each_member_device(ca, c, i) {
469 kvpfree(rcu_dereference_protected(ca->buckets[1], 1),
470 sizeof(struct bucket_array) +
471 ca->mi.nbuckets * sizeof(struct bucket));
472 ca->buckets[1] = NULL;
474 free_percpu(ca->usage[1]);
478 free_percpu(c->usage[1]);
482 static void bch2_gc_done_nocheck(struct bch_fs *c)
489 struct genradix_iter dst_iter = genradix_iter_init(&c->stripes[0], 0);
490 struct genradix_iter src_iter = genradix_iter_init(&c->stripes[1], 0);
491 struct stripe *dst, *src;
493 c->ec_stripes_heap.used = 0;
495 while ((dst = genradix_iter_peek(&dst_iter, &c->stripes[0])) &&
496 (src = genradix_iter_peek(&src_iter, &c->stripes[1]))) {
500 bch2_stripes_heap_insert(c, dst, dst_iter.pos);
502 genradix_iter_advance(&dst_iter, &c->stripes[0]);
503 genradix_iter_advance(&src_iter, &c->stripes[1]);
507 for_each_member_device(ca, c, i) {
508 struct bucket_array *src = __bucket_array(ca, 1);
510 memcpy(__bucket_array(ca, 0), src,
511 sizeof(struct bucket_array) +
512 sizeof(struct bucket) * src->nbuckets);
515 for_each_member_device(ca, c, i) {
516 struct bch_dev_usage *p;
518 for_each_possible_cpu(cpu) {
519 p = per_cpu_ptr(ca->usage[0], cpu);
520 memset(p, 0, sizeof(*p));
524 *this_cpu_ptr(ca->usage[0]) = __bch2_dev_usage_read(ca, 1);
529 struct bch_fs_usage src = __bch2_fs_usage_read(c, 1);
530 struct bch_fs_usage *p;
532 for_each_possible_cpu(cpu) {
533 p = per_cpu_ptr(c->usage[0], cpu);
534 memset(p, 0, offsetof(typeof(*p), online_reserved));
538 memcpy(this_cpu_ptr(c->usage[0]),
540 offsetof(typeof(*p), online_reserved));
546 static void bch2_gc_done(struct bch_fs *c, bool initial)
552 #define copy_field(_f, _msg, ...) \
553 if (dst._f != src._f) { \
554 bch_err(c, _msg ": got %llu, should be %llu, fixing"\
555 , ##__VA_ARGS__, dst._f, src._f); \
558 #define copy_stripe_field(_f, _msg, ...) \
559 if (dst->_f != src->_f) { \
560 bch_err_ratelimited(c, "stripe %zu has wrong "_msg \
561 ": got %u, should be %u, fixing", \
562 dst_iter.pos, ##__VA_ARGS__, \
566 #define copy_bucket_field(_f) \
567 if (dst->b[b].mark._f != src->b[b].mark._f) { \
568 bch_err_ratelimited(c, "dev %u bucket %zu has wrong " #_f\
569 ": got %u, should be %u, fixing", \
570 i, b, dst->b[b].mark._f, src->b[b].mark._f); \
571 dst->b[b]._mark._f = src->b[b].mark._f; \
573 #define copy_dev_field(_f, _msg, ...) \
574 copy_field(_f, "dev %u has wrong " _msg, i, ##__VA_ARGS__)
575 #define copy_fs_field(_f, _msg, ...) \
576 copy_field(_f, "fs has wrong " _msg, ##__VA_ARGS__)
578 percpu_down_write(&c->usage_lock);
581 bch2_gc_done_nocheck(c);
586 struct genradix_iter dst_iter = genradix_iter_init(&c->stripes[0], 0);
587 struct genradix_iter src_iter = genradix_iter_init(&c->stripes[1], 0);
588 struct stripe *dst, *src;
591 c->ec_stripes_heap.used = 0;
593 while ((dst = genradix_iter_peek(&dst_iter, &c->stripes[0])) &&
594 (src = genradix_iter_peek(&src_iter, &c->stripes[1]))) {
595 copy_stripe_field(alive, "alive");
596 copy_stripe_field(sectors, "sectors");
597 copy_stripe_field(algorithm, "algorithm");
598 copy_stripe_field(nr_blocks, "nr_blocks");
599 copy_stripe_field(nr_redundant, "nr_redundant");
600 copy_stripe_field(blocks_nonempty.counter,
603 for (i = 0; i < ARRAY_SIZE(dst->block_sectors); i++)
604 copy_stripe_field(block_sectors[i].counter,
605 "block_sectors[%u]", i);
608 bch2_stripes_heap_insert(c, dst, dst_iter.pos);
610 genradix_iter_advance(&dst_iter, &c->stripes[0]);
611 genradix_iter_advance(&src_iter, &c->stripes[1]);
615 for_each_member_device(ca, c, i) {
616 struct bucket_array *dst = __bucket_array(ca, 0);
617 struct bucket_array *src = __bucket_array(ca, 1);
622 sizeof(struct bucket_array) +
623 sizeof(struct bucket) * dst->nbuckets);
626 for (b = 0; b < src->nbuckets; b++) {
627 copy_bucket_field(gen);
628 copy_bucket_field(data_type);
629 copy_bucket_field(owned_by_allocator);
630 copy_bucket_field(stripe);
631 copy_bucket_field(dirty_sectors);
632 copy_bucket_field(cached_sectors);
636 for_each_member_device(ca, c, i) {
637 struct bch_dev_usage dst = __bch2_dev_usage_read(ca, 0);
638 struct bch_dev_usage src = __bch2_dev_usage_read(ca, 1);
639 struct bch_dev_usage *p;
642 for (b = 0; b < BCH_DATA_NR; b++)
643 copy_dev_field(buckets[b],
644 "buckets[%s]", bch2_data_types[b]);
645 copy_dev_field(buckets_alloc, "buckets_alloc");
646 copy_dev_field(buckets_ec, "buckets_ec");
648 for (b = 0; b < BCH_DATA_NR; b++)
649 copy_dev_field(sectors[b],
650 "sectors[%s]", bch2_data_types[b]);
651 copy_dev_field(sectors_fragmented,
652 "sectors_fragmented");
654 for_each_possible_cpu(cpu) {
655 p = per_cpu_ptr(ca->usage[0], cpu);
656 memset(p, 0, sizeof(*p));
660 p = this_cpu_ptr(ca->usage[0]);
666 struct bch_fs_usage dst = __bch2_fs_usage_read(c, 0);
667 struct bch_fs_usage src = __bch2_fs_usage_read(c, 1);
668 struct bch_fs_usage *p;
671 for (r = 0; r < BCH_REPLICAS_MAX; r++) {
672 for (b = 0; b < BCH_DATA_NR; b++)
673 copy_fs_field(replicas[r].data[b],
674 "replicas[%i].data[%s]",
675 r, bch2_data_types[b]);
676 copy_fs_field(replicas[r].ec_data,
677 "replicas[%i].ec_data", r);
678 copy_fs_field(replicas[r].persistent_reserved,
679 "replicas[%i].persistent_reserved", r);
682 for (b = 0; b < BCH_DATA_NR; b++)
683 copy_fs_field(buckets[b],
684 "buckets[%s]", bch2_data_types[b]);
686 for_each_possible_cpu(cpu) {
687 p = per_cpu_ptr(c->usage[0], cpu);
688 memset(p, 0, offsetof(typeof(*p), online_reserved));
692 p = this_cpu_ptr(c->usage[0]);
693 memcpy(p, &dst, offsetof(typeof(*p), online_reserved));
697 percpu_up_write(&c->usage_lock);
700 #undef copy_dev_field
701 #undef copy_bucket_field
702 #undef copy_stripe_field
706 static int bch2_gc_start(struct bch_fs *c)
712 * indicate to stripe code that we need to allocate for the gc stripes
715 gc_pos_set(c, gc_phase(GC_PHASE_START));
719 c->usage[1] = alloc_percpu(struct bch_fs_usage);
723 for_each_member_device(ca, c, i) {
724 BUG_ON(ca->buckets[1]);
725 BUG_ON(ca->usage[1]);
727 ca->buckets[1] = kvpmalloc(sizeof(struct bucket_array) +
728 ca->mi.nbuckets * sizeof(struct bucket),
729 GFP_KERNEL|__GFP_ZERO);
730 if (!ca->buckets[1]) {
731 percpu_ref_put(&ca->ref);
735 ca->usage[1] = alloc_percpu(struct bch_dev_usage);
737 percpu_ref_put(&ca->ref);
742 percpu_down_write(&c->usage_lock);
744 for_each_member_device(ca, c, i) {
745 struct bucket_array *dst = __bucket_array(ca, 1);
746 struct bucket_array *src = __bucket_array(ca, 0);
749 dst->first_bucket = src->first_bucket;
750 dst->nbuckets = src->nbuckets;
752 for (b = 0; b < src->nbuckets; b++)
753 dst->b[b]._mark.gen = src->b[b].mark.gen;
756 percpu_up_write(&c->usage_lock);
758 return bch2_ec_mem_alloc(c, true);
762 * bch2_gc - walk _all_ references to buckets, and recompute them:
764 * Order matters here:
765 * - Concurrent GC relies on the fact that we have a total ordering for
766 * everything that GC walks - see gc_will_visit_node(),
767 * gc_will_visit_root()
769 * - also, references move around in the course of index updates and
770 * various other crap: everything needs to agree on the ordering
771 * references are allowed to move around in - e.g., we're allowed to
772 * start with a reference owned by an open_bucket (the allocator) and
773 * move it to the btree, but not the reverse.
775 * This is necessary to ensure that gc doesn't miss references that
776 * move around - if references move backwards in the ordering GC
777 * uses, GC could skip past them
779 int bch2_gc(struct bch_fs *c, struct list_head *journal, bool initial)
782 u64 start_time = local_clock();
783 unsigned i, iter = 0;
788 down_write(&c->gc_lock);
790 ret = bch2_gc_start(c);
794 bch2_mark_superblocks(c);
796 ret = bch2_gc_btrees(c, journal, initial);
800 bch2_mark_pending_btree_node_frees(c);
801 bch2_mark_allocator_buckets(c);
805 if (!ret && test_bit(BCH_FS_FIXED_GENS, &c->flags)) {
807 * XXX: make sure gens we fixed got saved
810 bch_info(c, "Fixed gens, restarting mark and sweep:");
811 clear_bit(BCH_FS_FIXED_GENS, &c->flags);
815 bch_info(c, "Unable to fix bucket gens, looping");
820 bch2_gc_done(c, initial);
822 /* Indicates that gc is no longer in progress: */
823 __gc_pos_set(c, gc_phase(GC_PHASE_NOT_RUNNING));
826 up_write(&c->gc_lock);
829 set_bit(BCH_FS_INITIAL_GC_DONE, &c->flags);
832 bch2_time_stats_update(&c->times[BCH_TIME_btree_gc], start_time);
835 * Wake up allocator in case it was waiting for buckets
836 * because of not being able to inc gens
838 for_each_member_device(ca, c, i)
839 bch2_wake_allocator(ca);
842 * At startup, allocations can happen directly instead of via the
843 * allocator thread - issue wakeup in case they blocked on gc_lock:
845 closure_wake_up(&c->freelist_wait);
849 /* Btree coalescing */
851 static void recalc_packed_keys(struct btree *b)
853 struct bset *i = btree_bset_first(b);
854 struct bkey_packed *k;
856 memset(&b->nr, 0, sizeof(b->nr));
858 BUG_ON(b->nsets != 1);
860 vstruct_for_each(i, k)
861 btree_keys_account_key_add(&b->nr, 0, k);
864 static void bch2_coalesce_nodes(struct bch_fs *c, struct btree_iter *iter,
865 struct btree *old_nodes[GC_MERGE_NODES])
867 struct btree *parent = btree_node_parent(iter, old_nodes[0]);
868 unsigned i, nr_old_nodes, nr_new_nodes, u64s = 0;
869 unsigned blocks = btree_blocks(c) * 2 / 3;
870 struct btree *new_nodes[GC_MERGE_NODES];
871 struct btree_update *as;
872 struct keylist keylist;
873 struct bkey_format_state format_state;
874 struct bkey_format new_format;
876 memset(new_nodes, 0, sizeof(new_nodes));
877 bch2_keylist_init(&keylist, NULL);
879 /* Count keys that are not deleted */
880 for (i = 0; i < GC_MERGE_NODES && old_nodes[i]; i++)
881 u64s += old_nodes[i]->nr.live_u64s;
883 nr_old_nodes = nr_new_nodes = i;
885 /* Check if all keys in @old_nodes could fit in one fewer node */
886 if (nr_old_nodes <= 1 ||
887 __vstruct_blocks(struct btree_node, c->block_bits,
888 DIV_ROUND_UP(u64s, nr_old_nodes - 1)) > blocks)
891 /* Find a format that all keys in @old_nodes can pack into */
892 bch2_bkey_format_init(&format_state);
894 for (i = 0; i < nr_old_nodes; i++)
895 __bch2_btree_calc_format(&format_state, old_nodes[i]);
897 new_format = bch2_bkey_format_done(&format_state);
899 /* Check if repacking would make any nodes too big to fit */
900 for (i = 0; i < nr_old_nodes; i++)
901 if (!bch2_btree_node_format_fits(c, old_nodes[i], &new_format)) {
902 trace_btree_gc_coalesce_fail(c,
903 BTREE_GC_COALESCE_FAIL_FORMAT_FITS);
907 if (bch2_keylist_realloc(&keylist, NULL, 0,
908 (BKEY_U64s + BKEY_EXTENT_U64s_MAX) * nr_old_nodes)) {
909 trace_btree_gc_coalesce_fail(c,
910 BTREE_GC_COALESCE_FAIL_KEYLIST_REALLOC);
914 as = bch2_btree_update_start(c, iter->btree_id,
915 btree_update_reserve_required(c, parent) + nr_old_nodes,
917 BTREE_INSERT_USE_RESERVE,
920 trace_btree_gc_coalesce_fail(c,
921 BTREE_GC_COALESCE_FAIL_RESERVE_GET);
922 bch2_keylist_free(&keylist, NULL);
926 trace_btree_gc_coalesce(c, old_nodes[0]);
928 for (i = 0; i < nr_old_nodes; i++)
929 bch2_btree_interior_update_will_free_node(as, old_nodes[i]);
931 /* Repack everything with @new_format and sort down to one bset */
932 for (i = 0; i < nr_old_nodes; i++)
934 __bch2_btree_node_alloc_replacement(as, old_nodes[i],
938 * Conceptually we concatenate the nodes together and slice them
939 * up at different boundaries.
941 for (i = nr_new_nodes - 1; i > 0; --i) {
942 struct btree *n1 = new_nodes[i];
943 struct btree *n2 = new_nodes[i - 1];
945 struct bset *s1 = btree_bset_first(n1);
946 struct bset *s2 = btree_bset_first(n2);
947 struct bkey_packed *k, *last = NULL;
949 /* Calculate how many keys from @n2 we could fit inside @n1 */
953 k < vstruct_last(s2) &&
954 vstruct_blocks_plus(n1->data, c->block_bits,
955 u64s + k->u64s) <= blocks;
961 if (u64s == le16_to_cpu(s2->u64s)) {
962 /* n2 fits entirely in n1 */
963 n1->key.k.p = n1->data->max_key = n2->data->max_key;
965 memcpy_u64s(vstruct_last(s1),
967 le16_to_cpu(s2->u64s));
968 le16_add_cpu(&s1->u64s, le16_to_cpu(s2->u64s));
970 set_btree_bset_end(n1, n1->set);
972 six_unlock_write(&n2->lock);
973 bch2_btree_node_free_never_inserted(c, n2);
974 six_unlock_intent(&n2->lock);
976 memmove(new_nodes + i - 1,
978 sizeof(new_nodes[0]) * (nr_new_nodes - i));
979 new_nodes[--nr_new_nodes] = NULL;
981 /* move part of n2 into n1 */
982 n1->key.k.p = n1->data->max_key =
983 bkey_unpack_pos(n1, last);
986 btree_type_successor(iter->btree_id,
989 memcpy_u64s(vstruct_last(s1),
991 le16_add_cpu(&s1->u64s, u64s);
994 vstruct_idx(s2, u64s),
995 (le16_to_cpu(s2->u64s) - u64s) * sizeof(u64));
996 s2->u64s = cpu_to_le16(le16_to_cpu(s2->u64s) - u64s);
998 set_btree_bset_end(n1, n1->set);
999 set_btree_bset_end(n2, n2->set);
1003 for (i = 0; i < nr_new_nodes; i++) {
1004 struct btree *n = new_nodes[i];
1006 recalc_packed_keys(n);
1007 btree_node_reset_sib_u64s(n);
1009 bch2_btree_build_aux_trees(n);
1010 six_unlock_write(&n->lock);
1012 bch2_btree_node_write(c, n, SIX_LOCK_intent);
1016 * The keys for the old nodes get deleted. We don't want to insert keys
1017 * that compare equal to the keys for the new nodes we'll also be
1018 * inserting - we can't because keys on a keylist must be strictly
1019 * greater than the previous keys, and we also don't need to since the
1020 * key for the new node will serve the same purpose (overwriting the key
1021 * for the old node).
1023 for (i = 0; i < nr_old_nodes; i++) {
1024 struct bkey_i delete;
1027 for (j = 0; j < nr_new_nodes; j++)
1028 if (!bkey_cmp(old_nodes[i]->key.k.p,
1029 new_nodes[j]->key.k.p))
1032 bkey_init(&delete.k);
1033 delete.k.p = old_nodes[i]->key.k.p;
1034 bch2_keylist_add_in_order(&keylist, &delete);
1040 * Keys for the new nodes get inserted: bch2_btree_insert_keys() only
1041 * does the lookup once and thus expects the keys to be in sorted order
1042 * so we have to make sure the new keys are correctly ordered with
1043 * respect to the deleted keys added in the previous loop
1045 for (i = 0; i < nr_new_nodes; i++)
1046 bch2_keylist_add_in_order(&keylist, &new_nodes[i]->key);
1048 /* Insert the newly coalesced nodes */
1049 bch2_btree_insert_node(as, parent, iter, &keylist, 0);
1051 BUG_ON(!bch2_keylist_empty(&keylist));
1053 BUG_ON(iter->l[old_nodes[0]->level].b != old_nodes[0]);
1055 bch2_btree_iter_node_replace(iter, new_nodes[0]);
1057 for (i = 0; i < nr_new_nodes; i++)
1058 bch2_open_buckets_put(c, &new_nodes[i]->ob);
1060 /* Free the old nodes and update our sliding window */
1061 for (i = 0; i < nr_old_nodes; i++) {
1062 bch2_btree_node_free_inmem(c, old_nodes[i], iter);
1065 * the index update might have triggered a split, in which case
1066 * the nodes we coalesced - the new nodes we just created -
1067 * might not be sibling nodes anymore - don't add them to the
1068 * sliding window (except the first):
1071 old_nodes[i] = new_nodes[i];
1073 old_nodes[i] = NULL;
1075 six_unlock_intent(&new_nodes[i]->lock);
1079 bch2_btree_update_done(as);
1080 bch2_keylist_free(&keylist, NULL);
1083 static int bch2_coalesce_btree(struct bch_fs *c, enum btree_id btree_id)
1085 struct btree_iter iter;
1087 bool kthread = (current->flags & PF_KTHREAD) != 0;
1090 /* Sliding window of adjacent btree nodes */
1091 struct btree *merge[GC_MERGE_NODES];
1092 u32 lock_seq[GC_MERGE_NODES];
1095 * XXX: We don't have a good way of positively matching on sibling nodes
1096 * that have the same parent - this code works by handling the cases
1097 * where they might not have the same parent, and is thus fragile. Ugh.
1099 * Perhaps redo this to use multiple linked iterators?
1101 memset(merge, 0, sizeof(merge));
1103 __for_each_btree_node(&iter, c, btree_id, POS_MIN,
1105 BTREE_ITER_PREFETCH, b) {
1106 memmove(merge + 1, merge,
1107 sizeof(merge) - sizeof(merge[0]));
1108 memmove(lock_seq + 1, lock_seq,
1109 sizeof(lock_seq) - sizeof(lock_seq[0]));
1113 for (i = 1; i < GC_MERGE_NODES; i++) {
1115 !six_relock_intent(&merge[i]->lock, lock_seq[i]))
1118 if (merge[i]->level != merge[0]->level) {
1119 six_unlock_intent(&merge[i]->lock);
1123 memset(merge + i, 0, (GC_MERGE_NODES - i) * sizeof(merge[0]));
1125 bch2_coalesce_nodes(c, &iter, merge);
1127 for (i = 1; i < GC_MERGE_NODES && merge[i]; i++) {
1128 lock_seq[i] = merge[i]->lock.state.seq;
1129 six_unlock_intent(&merge[i]->lock);
1132 lock_seq[0] = merge[0]->lock.state.seq;
1134 if (kthread && kthread_should_stop()) {
1135 bch2_btree_iter_unlock(&iter);
1139 bch2_btree_iter_cond_resched(&iter);
1142 * If the parent node wasn't relocked, it might have been split
1143 * and the nodes in our sliding window might not have the same
1144 * parent anymore - blow away the sliding window:
1146 if (btree_iter_node(&iter, iter.level + 1) &&
1147 !btree_node_intent_locked(&iter, iter.level + 1))
1148 memset(merge + 1, 0,
1149 (GC_MERGE_NODES - 1) * sizeof(merge[0]));
1151 return bch2_btree_iter_unlock(&iter);
1155 * bch_coalesce - coalesce adjacent nodes with low occupancy
1157 void bch2_coalesce(struct bch_fs *c)
1161 down_read(&c->gc_lock);
1162 trace_gc_coalesce_start(c);
1164 for (id = 0; id < BTREE_ID_NR; id++) {
1165 int ret = c->btree_roots[id].b
1166 ? bch2_coalesce_btree(c, id)
1170 if (ret != -ESHUTDOWN)
1171 bch_err(c, "btree coalescing failed: %d", ret);
1176 trace_gc_coalesce_end(c);
1177 up_read(&c->gc_lock);
1180 static int bch2_gc_thread(void *arg)
1182 struct bch_fs *c = arg;
1183 struct io_clock *clock = &c->io_clock[WRITE];
1184 unsigned long last = atomic_long_read(&clock->now);
1185 unsigned last_kick = atomic_read(&c->kick_gc);
1192 set_current_state(TASK_INTERRUPTIBLE);
1194 if (kthread_should_stop()) {
1195 __set_current_state(TASK_RUNNING);
1199 if (atomic_read(&c->kick_gc) != last_kick)
1202 if (c->btree_gc_periodic) {
1203 unsigned long next = last + c->capacity / 16;
1205 if (atomic_long_read(&clock->now) >= next)
1208 bch2_io_clock_schedule_timeout(clock, next);
1215 __set_current_state(TASK_RUNNING);
1217 last = atomic_long_read(&clock->now);
1218 last_kick = atomic_read(&c->kick_gc);
1220 ret = bch2_gc(c, NULL, false);
1222 bch_err(c, "btree gc failed: %i", ret);
1224 debug_check_no_locks_held();
1230 void bch2_gc_thread_stop(struct bch_fs *c)
1232 struct task_struct *p;
1235 c->gc_thread = NULL;
1243 int bch2_gc_thread_start(struct bch_fs *c)
1245 struct task_struct *p;
1247 BUG_ON(c->gc_thread);
1249 p = kthread_create(bch2_gc_thread, c, "bch_gc");
1259 /* Initial GC computes bucket marks during startup */
1261 int bch2_initial_gc(struct bch_fs *c, struct list_head *journal)
1263 int ret = bch2_gc(c, journal, true);
1266 * Skip past versions that might have possibly been used (as nonces),
1267 * but hadn't had their pointers written:
1269 if (c->sb.encryption_type)
1270 atomic64_add(1 << 16, &c->key_version);