1 // SPDX-License-Identifier: GPL-2.0
3 #include "alloc_background.h"
4 #include "alloc_foreground.h"
5 #include "backpointers.h"
6 #include "btree_cache.h"
8 #include "btree_key_cache.h"
9 #include "btree_update.h"
10 #include "btree_update_interior.h"
12 #include "btree_write_buffer.h"
14 #include "buckets_waiting_for_journal.h"
24 #include <linux/kthread.h>
25 #include <linux/math64.h>
26 #include <linux/random.h>
27 #include <linux/rculist.h>
28 #include <linux/rcupdate.h>
29 #include <linux/sched/task.h>
30 #include <linux/sort.h>
32 /* Persistent alloc info: */
34 static const unsigned BCH_ALLOC_V1_FIELD_BYTES[] = {
35 #define x(name, bits) [BCH_ALLOC_FIELD_V1_##name] = bits / 8,
40 struct bkey_alloc_unpacked {
47 #define x(_name, _bits) u##_bits _name;
52 static inline u64 alloc_field_v1_get(const struct bch_alloc *a,
53 const void **p, unsigned field)
55 unsigned bytes = BCH_ALLOC_V1_FIELD_BYTES[field];
58 if (!(a->fields & (1 << field)))
63 v = *((const u8 *) *p);
82 static void bch2_alloc_unpack_v1(struct bkey_alloc_unpacked *out,
85 const struct bch_alloc *in = bkey_s_c_to_alloc(k).v;
86 const void *d = in->data;
91 #define x(_name, _bits) out->_name = alloc_field_v1_get(in, &d, idx++);
96 static int bch2_alloc_unpack_v2(struct bkey_alloc_unpacked *out,
99 struct bkey_s_c_alloc_v2 a = bkey_s_c_to_alloc_v2(k);
100 const u8 *in = a.v->data;
101 const u8 *end = bkey_val_end(a);
102 unsigned fieldnr = 0;
107 out->oldest_gen = a.v->oldest_gen;
108 out->data_type = a.v->data_type;
110 #define x(_name, _bits) \
111 if (fieldnr < a.v->nr_fields) { \
112 ret = bch2_varint_decode_fast(in, end, &v); \
120 if (v != out->_name) \
124 BCH_ALLOC_FIELDS_V2()
129 static int bch2_alloc_unpack_v3(struct bkey_alloc_unpacked *out,
132 struct bkey_s_c_alloc_v3 a = bkey_s_c_to_alloc_v3(k);
133 const u8 *in = a.v->data;
134 const u8 *end = bkey_val_end(a);
135 unsigned fieldnr = 0;
140 out->oldest_gen = a.v->oldest_gen;
141 out->data_type = a.v->data_type;
142 out->need_discard = BCH_ALLOC_V3_NEED_DISCARD(a.v);
143 out->need_inc_gen = BCH_ALLOC_V3_NEED_INC_GEN(a.v);
144 out->journal_seq = le64_to_cpu(a.v->journal_seq);
146 #define x(_name, _bits) \
147 if (fieldnr < a.v->nr_fields) { \
148 ret = bch2_varint_decode_fast(in, end, &v); \
156 if (v != out->_name) \
160 BCH_ALLOC_FIELDS_V2()
165 static struct bkey_alloc_unpacked bch2_alloc_unpack(struct bkey_s_c k)
167 struct bkey_alloc_unpacked ret = { .gen = 0 };
171 bch2_alloc_unpack_v1(&ret, k);
173 case KEY_TYPE_alloc_v2:
174 bch2_alloc_unpack_v2(&ret, k);
176 case KEY_TYPE_alloc_v3:
177 bch2_alloc_unpack_v3(&ret, k);
184 static unsigned bch_alloc_v1_val_u64s(const struct bch_alloc *a)
186 unsigned i, bytes = offsetof(struct bch_alloc, data);
188 for (i = 0; i < ARRAY_SIZE(BCH_ALLOC_V1_FIELD_BYTES); i++)
189 if (a->fields & (1 << i))
190 bytes += BCH_ALLOC_V1_FIELD_BYTES[i];
192 return DIV_ROUND_UP(bytes, sizeof(u64));
195 int bch2_alloc_v1_invalid(struct bch_fs *c, struct bkey_s_c k,
196 enum bkey_invalid_flags flags,
197 struct printbuf *err)
199 struct bkey_s_c_alloc a = bkey_s_c_to_alloc(k);
202 /* allow for unknown fields */
203 bkey_fsck_err_on(bkey_val_u64s(a.k) < bch_alloc_v1_val_u64s(a.v), c, err,
204 alloc_v1_val_size_bad,
205 "incorrect value size (%zu < %u)",
206 bkey_val_u64s(a.k), bch_alloc_v1_val_u64s(a.v));
211 int bch2_alloc_v2_invalid(struct bch_fs *c, struct bkey_s_c k,
212 enum bkey_invalid_flags flags,
213 struct printbuf *err)
215 struct bkey_alloc_unpacked u;
218 bkey_fsck_err_on(bch2_alloc_unpack_v2(&u, k), c, err,
219 alloc_v2_unpack_error,
225 int bch2_alloc_v3_invalid(struct bch_fs *c, struct bkey_s_c k,
226 enum bkey_invalid_flags flags,
227 struct printbuf *err)
229 struct bkey_alloc_unpacked u;
232 bkey_fsck_err_on(bch2_alloc_unpack_v3(&u, k), c, err,
233 alloc_v2_unpack_error,
239 int bch2_alloc_v4_invalid(struct bch_fs *c, struct bkey_s_c k,
240 enum bkey_invalid_flags flags, struct printbuf *err)
242 struct bkey_s_c_alloc_v4 a = bkey_s_c_to_alloc_v4(k);
245 bkey_fsck_err_on(alloc_v4_u64s(a.v) > bkey_val_u64s(k.k), c, err,
246 alloc_v4_val_size_bad,
247 "bad val size (%u > %zu)",
248 alloc_v4_u64s(a.v), bkey_val_u64s(k.k));
250 bkey_fsck_err_on(!BCH_ALLOC_V4_BACKPOINTERS_START(a.v) &&
251 BCH_ALLOC_V4_NR_BACKPOINTERS(a.v), c, err,
252 alloc_v4_backpointers_start_bad,
253 "invalid backpointers_start");
255 bkey_fsck_err_on(alloc_data_type(*a.v, a.v->data_type) != a.v->data_type, c, err,
256 alloc_key_data_type_bad,
257 "invalid data type (got %u should be %u)",
258 a.v->data_type, alloc_data_type(*a.v, a.v->data_type));
260 switch (a.v->data_type) {
262 case BCH_DATA_need_gc_gens:
263 case BCH_DATA_need_discard:
264 bkey_fsck_err_on(bch2_bucket_sectors(*a.v) || a.v->stripe,
265 c, err, alloc_key_empty_but_have_data,
266 "empty data type free but have data");
269 case BCH_DATA_journal:
272 case BCH_DATA_parity:
273 bkey_fsck_err_on(!bch2_bucket_sectors_dirty(*a.v),
274 c, err, alloc_key_dirty_sectors_0,
275 "data_type %s but dirty_sectors==0",
276 bch2_data_types[a.v->data_type]);
278 case BCH_DATA_cached:
279 bkey_fsck_err_on(!a.v->cached_sectors ||
280 bch2_bucket_sectors_dirty(*a.v) ||
282 c, err, alloc_key_cached_inconsistency,
283 "data type inconsistency");
285 bkey_fsck_err_on(!a.v->io_time[READ] &&
286 c->curr_recovery_pass > BCH_RECOVERY_PASS_check_alloc_to_lru_refs,
287 c, err, alloc_key_cached_but_read_time_zero,
288 "cached bucket with read_time == 0");
290 case BCH_DATA_stripe:
297 void bch2_alloc_v4_swab(struct bkey_s k)
299 struct bch_alloc_v4 *a = bkey_s_to_alloc_v4(k).v;
300 struct bch_backpointer *bp, *bps;
302 a->journal_seq = swab64(a->journal_seq);
303 a->flags = swab32(a->flags);
304 a->dirty_sectors = swab32(a->dirty_sectors);
305 a->cached_sectors = swab32(a->cached_sectors);
306 a->io_time[0] = swab64(a->io_time[0]);
307 a->io_time[1] = swab64(a->io_time[1]);
308 a->stripe = swab32(a->stripe);
309 a->nr_external_backpointers = swab32(a->nr_external_backpointers);
310 a->fragmentation_lru = swab64(a->fragmentation_lru);
312 bps = alloc_v4_backpointers(a);
313 for (bp = bps; bp < bps + BCH_ALLOC_V4_NR_BACKPOINTERS(a); bp++) {
314 bp->bucket_offset = swab40(bp->bucket_offset);
315 bp->bucket_len = swab32(bp->bucket_len);
316 bch2_bpos_swab(&bp->pos);
320 void bch2_alloc_to_text(struct printbuf *out, struct bch_fs *c, struct bkey_s_c k)
322 struct bch_alloc_v4 _a;
323 const struct bch_alloc_v4 *a = bch2_alloc_to_v4(k, &_a);
327 printbuf_indent_add(out, 2);
329 prt_printf(out, "gen %u oldest_gen %u data_type %s",
330 a->gen, a->oldest_gen,
331 a->data_type < BCH_DATA_NR
332 ? bch2_data_types[a->data_type]
333 : "(invalid data type)");
335 prt_printf(out, "journal_seq %llu", a->journal_seq);
337 prt_printf(out, "need_discard %llu", BCH_ALLOC_V4_NEED_DISCARD(a));
339 prt_printf(out, "need_inc_gen %llu", BCH_ALLOC_V4_NEED_INC_GEN(a));
341 prt_printf(out, "dirty_sectors %u", a->dirty_sectors);
343 prt_printf(out, "cached_sectors %u", a->cached_sectors);
345 prt_printf(out, "stripe %u", a->stripe);
347 prt_printf(out, "stripe_redundancy %u", a->stripe_redundancy);
349 prt_printf(out, "io_time[READ] %llu", a->io_time[READ]);
351 prt_printf(out, "io_time[WRITE] %llu", a->io_time[WRITE]);
353 prt_printf(out, "fragmentation %llu", a->fragmentation_lru);
355 prt_printf(out, "bp_start %llu", BCH_ALLOC_V4_BACKPOINTERS_START(a));
358 if (BCH_ALLOC_V4_NR_BACKPOINTERS(a)) {
359 struct bkey_s_c_alloc_v4 a_raw = bkey_s_c_to_alloc_v4(k);
360 const struct bch_backpointer *bps = alloc_v4_backpointers_c(a_raw.v);
362 prt_printf(out, "backpointers: %llu", BCH_ALLOC_V4_NR_BACKPOINTERS(a_raw.v));
363 printbuf_indent_add(out, 2);
365 for (i = 0; i < BCH_ALLOC_V4_NR_BACKPOINTERS(a_raw.v); i++) {
367 bch2_backpointer_to_text(out, &bps[i]);
370 printbuf_indent_sub(out, 2);
373 printbuf_indent_sub(out, 2);
376 void __bch2_alloc_to_v4(struct bkey_s_c k, struct bch_alloc_v4 *out)
378 if (k.k->type == KEY_TYPE_alloc_v4) {
381 *out = *bkey_s_c_to_alloc_v4(k).v;
383 src = alloc_v4_backpointers(out);
384 SET_BCH_ALLOC_V4_BACKPOINTERS_START(out, BCH_ALLOC_V4_U64s);
385 dst = alloc_v4_backpointers(out);
388 memset(src, 0, dst - src);
390 SET_BCH_ALLOC_V4_NR_BACKPOINTERS(out, 0);
392 struct bkey_alloc_unpacked u = bch2_alloc_unpack(k);
394 *out = (struct bch_alloc_v4) {
395 .journal_seq = u.journal_seq,
396 .flags = u.need_discard,
398 .oldest_gen = u.oldest_gen,
399 .data_type = u.data_type,
400 .stripe_redundancy = u.stripe_redundancy,
401 .dirty_sectors = u.dirty_sectors,
402 .cached_sectors = u.cached_sectors,
403 .io_time[READ] = u.read_time,
404 .io_time[WRITE] = u.write_time,
408 SET_BCH_ALLOC_V4_BACKPOINTERS_START(out, BCH_ALLOC_V4_U64s);
412 static noinline struct bkey_i_alloc_v4 *
413 __bch2_alloc_to_v4_mut(struct btree_trans *trans, struct bkey_s_c k)
415 struct bkey_i_alloc_v4 *ret;
417 ret = bch2_trans_kmalloc(trans, max(bkey_bytes(k.k), sizeof(struct bkey_i_alloc_v4)));
421 if (k.k->type == KEY_TYPE_alloc_v4) {
424 bkey_reassemble(&ret->k_i, k);
426 src = alloc_v4_backpointers(&ret->v);
427 SET_BCH_ALLOC_V4_BACKPOINTERS_START(&ret->v, BCH_ALLOC_V4_U64s);
428 dst = alloc_v4_backpointers(&ret->v);
431 memset(src, 0, dst - src);
433 SET_BCH_ALLOC_V4_NR_BACKPOINTERS(&ret->v, 0);
434 set_alloc_v4_u64s(ret);
436 bkey_alloc_v4_init(&ret->k_i);
438 bch2_alloc_to_v4(k, &ret->v);
443 static inline struct bkey_i_alloc_v4 *bch2_alloc_to_v4_mut_inlined(struct btree_trans *trans, struct bkey_s_c k)
445 struct bkey_s_c_alloc_v4 a;
447 if (likely(k.k->type == KEY_TYPE_alloc_v4) &&
448 ((a = bkey_s_c_to_alloc_v4(k), true) &&
449 BCH_ALLOC_V4_NR_BACKPOINTERS(a.v) == 0))
450 return bch2_bkey_make_mut_noupdate_typed(trans, k, alloc_v4);
452 return __bch2_alloc_to_v4_mut(trans, k);
455 struct bkey_i_alloc_v4 *bch2_alloc_to_v4_mut(struct btree_trans *trans, struct bkey_s_c k)
457 return bch2_alloc_to_v4_mut_inlined(trans, k);
460 struct bkey_i_alloc_v4 *
461 bch2_trans_start_alloc_update(struct btree_trans *trans, struct btree_iter *iter,
465 struct bkey_i_alloc_v4 *a;
468 k = bch2_bkey_get_iter(trans, iter, BTREE_ID_alloc, pos,
469 BTREE_ITER_WITH_UPDATES|
476 a = bch2_alloc_to_v4_mut_inlined(trans, k);
477 ret = PTR_ERR_OR_ZERO(a);
482 bch2_trans_iter_exit(trans, iter);
486 static struct bpos alloc_gens_pos(struct bpos pos, unsigned *offset)
488 *offset = pos.offset & KEY_TYPE_BUCKET_GENS_MASK;
490 pos.offset >>= KEY_TYPE_BUCKET_GENS_BITS;
494 static struct bpos bucket_gens_pos_to_alloc(struct bpos pos, unsigned offset)
496 pos.offset <<= KEY_TYPE_BUCKET_GENS_BITS;
497 pos.offset += offset;
501 static unsigned alloc_gen(struct bkey_s_c k, unsigned offset)
503 return k.k->type == KEY_TYPE_bucket_gens
504 ? bkey_s_c_to_bucket_gens(k).v->gens[offset]
508 int bch2_bucket_gens_invalid(struct bch_fs *c, struct bkey_s_c k,
509 enum bkey_invalid_flags flags,
510 struct printbuf *err)
514 bkey_fsck_err_on(bkey_val_bytes(k.k) != sizeof(struct bch_bucket_gens), c, err,
515 bucket_gens_val_size_bad,
516 "bad val size (%zu != %zu)",
517 bkey_val_bytes(k.k), sizeof(struct bch_bucket_gens));
522 void bch2_bucket_gens_to_text(struct printbuf *out, struct bch_fs *c, struct bkey_s_c k)
524 struct bkey_s_c_bucket_gens g = bkey_s_c_to_bucket_gens(k);
527 for (i = 0; i < ARRAY_SIZE(g.v->gens); i++) {
530 prt_printf(out, "%u", g.v->gens[i]);
534 int bch2_bucket_gens_init(struct bch_fs *c)
536 struct btree_trans *trans = bch2_trans_get(c);
537 struct bkey_i_bucket_gens g;
538 bool have_bucket_gens_key = false;
541 ret = for_each_btree_key(trans, iter, BTREE_ID_alloc, POS_MIN,
542 BTREE_ITER_PREFETCH, k, ({
544 * Not a fsck error because this is checked/repaired by
545 * bch2_check_alloc_key() which runs later:
547 if (!bch2_dev_bucket_exists(c, k.k->p))
550 struct bch_alloc_v4 a;
551 u8 gen = bch2_alloc_to_v4(k, &a)->gen;
553 struct bpos pos = alloc_gens_pos(iter.pos, &offset);
555 if (have_bucket_gens_key && bkey_cmp(iter.pos, pos)) {
556 ret = commit_do(trans, NULL, NULL,
557 BCH_TRANS_COMMIT_no_enospc,
558 bch2_btree_insert_trans(trans, BTREE_ID_bucket_gens, &g.k_i, 0));
561 have_bucket_gens_key = false;
564 if (!have_bucket_gens_key) {
565 bkey_bucket_gens_init(&g.k_i);
567 have_bucket_gens_key = true;
570 g.v.gens[offset] = gen;
574 if (have_bucket_gens_key && !ret)
575 ret = commit_do(trans, NULL, NULL,
576 BCH_TRANS_COMMIT_no_enospc,
577 bch2_btree_insert_trans(trans, BTREE_ID_bucket_gens, &g.k_i, 0));
579 bch2_trans_put(trans);
585 int bch2_alloc_read(struct bch_fs *c)
587 struct btree_trans *trans = bch2_trans_get(c);
590 down_read(&c->gc_lock);
592 if (c->sb.version_upgrade_complete >= bcachefs_metadata_version_bucket_gens) {
593 ret = for_each_btree_key(trans, iter, BTREE_ID_bucket_gens, POS_MIN,
594 BTREE_ITER_PREFETCH, k, ({
595 u64 start = bucket_gens_pos_to_alloc(k.k->p, 0).offset;
596 u64 end = bucket_gens_pos_to_alloc(bpos_nosnap_successor(k.k->p), 0).offset;
598 if (k.k->type != KEY_TYPE_bucket_gens)
601 const struct bch_bucket_gens *g = bkey_s_c_to_bucket_gens(k).v;
604 * Not a fsck error because this is checked/repaired by
605 * bch2_check_alloc_key() which runs later:
607 if (!bch2_dev_exists2(c, k.k->p.inode))
610 struct bch_dev *ca = bch_dev_bkey_exists(c, k.k->p.inode);
612 for (u64 b = max_t(u64, ca->mi.first_bucket, start);
613 b < min_t(u64, ca->mi.nbuckets, end);
615 *bucket_gen(ca, b) = g->gens[b & KEY_TYPE_BUCKET_GENS_MASK];
619 ret = for_each_btree_key(trans, iter, BTREE_ID_alloc, POS_MIN,
620 BTREE_ITER_PREFETCH, k, ({
622 * Not a fsck error because this is checked/repaired by
623 * bch2_check_alloc_key() which runs later:
625 if (!bch2_dev_bucket_exists(c, k.k->p))
628 struct bch_dev *ca = bch_dev_bkey_exists(c, k.k->p.inode);
630 struct bch_alloc_v4 a;
631 *bucket_gen(ca, k.k->p.offset) = bch2_alloc_to_v4(k, &a)->gen;
636 bch2_trans_put(trans);
637 up_read(&c->gc_lock);
643 /* Free space/discard btree: */
645 static int bch2_bucket_do_index(struct btree_trans *trans,
646 struct bkey_s_c alloc_k,
647 const struct bch_alloc_v4 *a,
650 struct bch_fs *c = trans->c;
651 struct bch_dev *ca = bch_dev_bkey_exists(c, alloc_k.k->p.inode);
652 struct btree_iter iter;
656 enum bch_bkey_type old_type = !set ? KEY_TYPE_set : KEY_TYPE_deleted;
657 enum bch_bkey_type new_type = set ? KEY_TYPE_set : KEY_TYPE_deleted;
658 struct printbuf buf = PRINTBUF;
661 if (a->data_type != BCH_DATA_free &&
662 a->data_type != BCH_DATA_need_discard)
665 k = bch2_trans_kmalloc_nomemzero(trans, sizeof(*k));
670 k->k.type = new_type;
672 switch (a->data_type) {
674 btree = BTREE_ID_freespace;
675 k->k.p = alloc_freespace_pos(alloc_k.k->p, *a);
676 bch2_key_resize(&k->k, 1);
678 case BCH_DATA_need_discard:
679 btree = BTREE_ID_need_discard;
680 k->k.p = alloc_k.k->p;
686 old = bch2_bkey_get_iter(trans, &iter, btree,
687 bkey_start_pos(&k->k),
693 if (ca->mi.freespace_initialized &&
694 c->curr_recovery_pass > BCH_RECOVERY_PASS_check_alloc_info &&
695 bch2_trans_inconsistent_on(old.k->type != old_type, trans,
696 "incorrect key when %s %s:%llu:%llu:0 (got %s should be %s)\n"
698 set ? "setting" : "clearing",
699 bch2_btree_id_str(btree),
702 bch2_bkey_types[old.k->type],
703 bch2_bkey_types[old_type],
704 (bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf))) {
709 ret = bch2_trans_update(trans, &iter, k, 0);
711 bch2_trans_iter_exit(trans, &iter);
716 static noinline int bch2_bucket_gen_update(struct btree_trans *trans,
717 struct bpos bucket, u8 gen)
719 struct btree_iter iter;
721 struct bpos pos = alloc_gens_pos(bucket, &offset);
722 struct bkey_i_bucket_gens *g;
726 g = bch2_trans_kmalloc(trans, sizeof(*g));
727 ret = PTR_ERR_OR_ZERO(g);
731 k = bch2_bkey_get_iter(trans, &iter, BTREE_ID_bucket_gens, pos,
733 BTREE_ITER_WITH_UPDATES);
738 if (k.k->type != KEY_TYPE_bucket_gens) {
739 bkey_bucket_gens_init(&g->k_i);
742 bkey_reassemble(&g->k_i, k);
745 g->v.gens[offset] = gen;
747 ret = bch2_trans_update(trans, &iter, &g->k_i, 0);
748 bch2_trans_iter_exit(trans, &iter);
752 int bch2_trans_mark_alloc(struct btree_trans *trans,
753 enum btree_id btree_id, unsigned level,
754 struct bkey_s_c old, struct bkey_i *new,
757 struct bch_fs *c = trans->c;
758 struct bch_alloc_v4 old_a_convert, *new_a;
759 const struct bch_alloc_v4 *old_a;
760 u64 old_lru, new_lru;
764 * Deletion only happens in the device removal path, with
765 * BTREE_TRIGGER_NORUN:
767 BUG_ON(new->k.type != KEY_TYPE_alloc_v4);
769 old_a = bch2_alloc_to_v4(old, &old_a_convert);
770 new_a = &bkey_i_to_alloc_v4(new)->v;
772 new_a->data_type = alloc_data_type(*new_a, new_a->data_type);
774 if (bch2_bucket_sectors(*new_a) > bch2_bucket_sectors(*old_a)) {
775 new_a->io_time[READ] = max_t(u64, 1, atomic64_read(&c->io_clock[READ].now));
776 new_a->io_time[WRITE]= max_t(u64, 1, atomic64_read(&c->io_clock[WRITE].now));
777 SET_BCH_ALLOC_V4_NEED_INC_GEN(new_a, true);
778 SET_BCH_ALLOC_V4_NEED_DISCARD(new_a, true);
781 if (data_type_is_empty(new_a->data_type) &&
782 BCH_ALLOC_V4_NEED_INC_GEN(new_a) &&
783 !bch2_bucket_is_open_safe(c, new->k.p.inode, new->k.p.offset)) {
785 SET_BCH_ALLOC_V4_NEED_INC_GEN(new_a, false);
788 if (old_a->data_type != new_a->data_type ||
789 (new_a->data_type == BCH_DATA_free &&
790 alloc_freespace_genbits(*old_a) != alloc_freespace_genbits(*new_a))) {
791 ret = bch2_bucket_do_index(trans, old, old_a, false) ?:
792 bch2_bucket_do_index(trans, bkey_i_to_s_c(new), new_a, true);
797 if (new_a->data_type == BCH_DATA_cached &&
798 !new_a->io_time[READ])
799 new_a->io_time[READ] = max_t(u64, 1, atomic64_read(&c->io_clock[READ].now));
801 old_lru = alloc_lru_idx_read(*old_a);
802 new_lru = alloc_lru_idx_read(*new_a);
804 if (old_lru != new_lru) {
805 ret = bch2_lru_change(trans, new->k.p.inode,
806 bucket_to_u64(new->k.p),
812 new_a->fragmentation_lru = alloc_lru_idx_fragmentation(*new_a,
813 bch_dev_bkey_exists(c, new->k.p.inode));
815 if (old_a->fragmentation_lru != new_a->fragmentation_lru) {
816 ret = bch2_lru_change(trans,
817 BCH_LRU_FRAGMENTATION_START,
818 bucket_to_u64(new->k.p),
819 old_a->fragmentation_lru, new_a->fragmentation_lru);
824 if (old_a->gen != new_a->gen) {
825 ret = bch2_bucket_gen_update(trans, new->k.p, new_a->gen);
831 * need to know if we're getting called from the invalidate path or
835 if ((flags & BTREE_TRIGGER_BUCKET_INVALIDATE) &&
836 old_a->cached_sectors) {
837 ret = bch2_update_cached_sectors_list(trans, new->k.p.inode,
838 -((s64) old_a->cached_sectors));
847 * This synthesizes deleted extents for holes, similar to BTREE_ITER_SLOTS for
848 * extents style btrees, but works on non-extents btrees:
850 static struct bkey_s_c bch2_get_key_or_hole(struct btree_iter *iter, struct bpos end, struct bkey *hole)
852 struct bkey_s_c k = bch2_btree_iter_peek_slot(iter);
860 struct btree_iter iter2;
863 bch2_trans_copy_iter(&iter2, iter);
865 struct btree_path *path = btree_iter_path(iter->trans, iter);
866 if (!bpos_eq(path->l[0].b->key.k.p, SPOS_MAX))
867 end = bkey_min(end, bpos_nosnap_successor(path->l[0].b->key.k.p));
869 end = bkey_min(end, POS(iter->pos.inode, iter->pos.offset + U32_MAX - 1));
872 * btree node min/max is a closed interval, upto takes a half
875 k = bch2_btree_iter_peek_upto(&iter2, end);
877 bch2_trans_iter_exit(iter->trans, &iter2);
879 BUG_ON(next.offset >= iter->pos.offset + U32_MAX);
887 bch2_key_resize(hole, next.offset - iter->pos.offset);
888 return (struct bkey_s_c) { hole, NULL };
892 static bool next_bucket(struct bch_fs *c, struct bpos *bucket)
896 if (bch2_dev_bucket_exists(c, *bucket))
899 if (bch2_dev_exists2(c, bucket->inode)) {
900 ca = bch_dev_bkey_exists(c, bucket->inode);
902 if (bucket->offset < ca->mi.first_bucket) {
903 bucket->offset = ca->mi.first_bucket;
912 ca = __bch2_next_dev_idx(c, bucket->inode, NULL);
914 *bucket = POS(ca->dev_idx, ca->mi.first_bucket);
920 static struct bkey_s_c bch2_get_key_or_real_bucket_hole(struct btree_iter *iter, struct bkey *hole)
922 struct bch_fs *c = iter->trans->c;
925 k = bch2_get_key_or_hole(iter, POS_MAX, hole);
930 struct bpos bucket = bkey_start_pos(k.k);
932 if (!bch2_dev_bucket_exists(c, bucket)) {
933 if (!next_bucket(c, &bucket))
934 return bkey_s_c_null;
936 bch2_btree_iter_set_pos(iter, bucket);
940 if (!bch2_dev_bucket_exists(c, k.k->p)) {
941 struct bch_dev *ca = bch_dev_bkey_exists(c, bucket.inode);
943 bch2_key_resize(hole, ca->mi.nbuckets - bucket.offset);
950 static noinline_for_stack
951 int bch2_check_alloc_key(struct btree_trans *trans,
952 struct bkey_s_c alloc_k,
953 struct btree_iter *alloc_iter,
954 struct btree_iter *discard_iter,
955 struct btree_iter *freespace_iter,
956 struct btree_iter *bucket_gens_iter)
958 struct bch_fs *c = trans->c;
960 struct bch_alloc_v4 a_convert;
961 const struct bch_alloc_v4 *a;
962 unsigned discard_key_type, freespace_key_type;
963 unsigned gens_offset;
965 struct printbuf buf = PRINTBUF;
968 if (fsck_err_on(!bch2_dev_bucket_exists(c, alloc_k.k->p), c,
969 alloc_key_to_missing_dev_bucket,
970 "alloc key for invalid device:bucket %llu:%llu",
971 alloc_k.k->p.inode, alloc_k.k->p.offset))
972 return bch2_btree_delete_at(trans, alloc_iter, 0);
974 ca = bch_dev_bkey_exists(c, alloc_k.k->p.inode);
975 if (!ca->mi.freespace_initialized)
978 a = bch2_alloc_to_v4(alloc_k, &a_convert);
980 discard_key_type = a->data_type == BCH_DATA_need_discard ? KEY_TYPE_set : 0;
981 bch2_btree_iter_set_pos(discard_iter, alloc_k.k->p);
982 k = bch2_btree_iter_peek_slot(discard_iter);
987 if (k.k->type != discard_key_type &&
988 (c->opts.reconstruct_alloc ||
989 fsck_err(c, need_discard_key_wrong,
990 "incorrect key in need_discard btree (got %s should be %s)\n"
992 bch2_bkey_types[k.k->type],
993 bch2_bkey_types[discard_key_type],
994 (bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf)))) {
995 struct bkey_i *update =
996 bch2_trans_kmalloc(trans, sizeof(*update));
998 ret = PTR_ERR_OR_ZERO(update);
1002 bkey_init(&update->k);
1003 update->k.type = discard_key_type;
1004 update->k.p = discard_iter->pos;
1006 ret = bch2_trans_update(trans, discard_iter, update, 0);
1011 freespace_key_type = a->data_type == BCH_DATA_free ? KEY_TYPE_set : 0;
1012 bch2_btree_iter_set_pos(freespace_iter, alloc_freespace_pos(alloc_k.k->p, *a));
1013 k = bch2_btree_iter_peek_slot(freespace_iter);
1018 if (k.k->type != freespace_key_type &&
1019 (c->opts.reconstruct_alloc ||
1020 fsck_err(c, freespace_key_wrong,
1021 "incorrect key in freespace btree (got %s should be %s)\n"
1023 bch2_bkey_types[k.k->type],
1024 bch2_bkey_types[freespace_key_type],
1025 (printbuf_reset(&buf),
1026 bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf)))) {
1027 struct bkey_i *update =
1028 bch2_trans_kmalloc(trans, sizeof(*update));
1030 ret = PTR_ERR_OR_ZERO(update);
1034 bkey_init(&update->k);
1035 update->k.type = freespace_key_type;
1036 update->k.p = freespace_iter->pos;
1037 bch2_key_resize(&update->k, 1);
1039 ret = bch2_trans_update(trans, freespace_iter, update, 0);
1044 bch2_btree_iter_set_pos(bucket_gens_iter, alloc_gens_pos(alloc_k.k->p, &gens_offset));
1045 k = bch2_btree_iter_peek_slot(bucket_gens_iter);
1050 if (a->gen != alloc_gen(k, gens_offset) &&
1051 (c->opts.reconstruct_alloc ||
1052 fsck_err(c, bucket_gens_key_wrong,
1053 "incorrect gen in bucket_gens btree (got %u should be %u)\n"
1055 alloc_gen(k, gens_offset), a->gen,
1056 (printbuf_reset(&buf),
1057 bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf)))) {
1058 struct bkey_i_bucket_gens *g =
1059 bch2_trans_kmalloc(trans, sizeof(*g));
1061 ret = PTR_ERR_OR_ZERO(g);
1065 if (k.k->type == KEY_TYPE_bucket_gens) {
1066 bkey_reassemble(&g->k_i, k);
1068 bkey_bucket_gens_init(&g->k_i);
1069 g->k.p = alloc_gens_pos(alloc_k.k->p, &gens_offset);
1072 g->v.gens[gens_offset] = a->gen;
1074 ret = bch2_trans_update(trans, bucket_gens_iter, &g->k_i, 0);
1080 printbuf_exit(&buf);
1084 static noinline_for_stack
1085 int bch2_check_alloc_hole_freespace(struct btree_trans *trans,
1088 struct btree_iter *freespace_iter)
1090 struct bch_fs *c = trans->c;
1093 struct printbuf buf = PRINTBUF;
1096 ca = bch_dev_bkey_exists(c, start.inode);
1097 if (!ca->mi.freespace_initialized)
1100 bch2_btree_iter_set_pos(freespace_iter, start);
1102 k = bch2_btree_iter_peek_slot(freespace_iter);
1107 *end = bkey_min(k.k->p, *end);
1109 if (k.k->type != KEY_TYPE_set &&
1110 (c->opts.reconstruct_alloc ||
1111 fsck_err(c, freespace_hole_missing,
1112 "hole in alloc btree missing in freespace btree\n"
1113 " device %llu buckets %llu-%llu",
1114 freespace_iter->pos.inode,
1115 freespace_iter->pos.offset,
1117 struct bkey_i *update =
1118 bch2_trans_kmalloc(trans, sizeof(*update));
1120 ret = PTR_ERR_OR_ZERO(update);
1124 bkey_init(&update->k);
1125 update->k.type = KEY_TYPE_set;
1126 update->k.p = freespace_iter->pos;
1127 bch2_key_resize(&update->k,
1128 min_t(u64, U32_MAX, end->offset -
1129 freespace_iter->pos.offset));
1131 ret = bch2_trans_update(trans, freespace_iter, update, 0);
1137 printbuf_exit(&buf);
1141 static noinline_for_stack
1142 int bch2_check_alloc_hole_bucket_gens(struct btree_trans *trans,
1145 struct btree_iter *bucket_gens_iter)
1147 struct bch_fs *c = trans->c;
1149 struct printbuf buf = PRINTBUF;
1150 unsigned i, gens_offset, gens_end_offset;
1153 if (c->sb.version < bcachefs_metadata_version_bucket_gens)
1156 bch2_btree_iter_set_pos(bucket_gens_iter, alloc_gens_pos(start, &gens_offset));
1158 k = bch2_btree_iter_peek_slot(bucket_gens_iter);
1163 if (bkey_cmp(alloc_gens_pos(start, &gens_offset),
1164 alloc_gens_pos(*end, &gens_end_offset)))
1165 gens_end_offset = KEY_TYPE_BUCKET_GENS_NR;
1167 if (k.k->type == KEY_TYPE_bucket_gens) {
1168 struct bkey_i_bucket_gens g;
1169 bool need_update = false;
1171 bkey_reassemble(&g.k_i, k);
1173 for (i = gens_offset; i < gens_end_offset; i++) {
1174 if (fsck_err_on(g.v.gens[i], c,
1175 bucket_gens_hole_wrong,
1176 "hole in alloc btree at %llu:%llu with nonzero gen in bucket_gens btree (%u)",
1177 bucket_gens_pos_to_alloc(k.k->p, i).inode,
1178 bucket_gens_pos_to_alloc(k.k->p, i).offset,
1186 struct bkey_i *u = bch2_trans_kmalloc(trans, sizeof(g));
1188 ret = PTR_ERR_OR_ZERO(u);
1192 memcpy(u, &g, sizeof(g));
1194 ret = bch2_trans_update(trans, bucket_gens_iter, u, 0);
1200 *end = bkey_min(*end, bucket_gens_pos_to_alloc(bpos_nosnap_successor(k.k->p), 0));
1203 printbuf_exit(&buf);
1207 static noinline_for_stack int bch2_check_discard_freespace_key(struct btree_trans *trans,
1208 struct btree_iter *iter)
1210 struct bch_fs *c = trans->c;
1211 struct btree_iter alloc_iter;
1212 struct bkey_s_c alloc_k;
1213 struct bch_alloc_v4 a_convert;
1214 const struct bch_alloc_v4 *a;
1217 enum bch_data_type state = iter->btree_id == BTREE_ID_need_discard
1218 ? BCH_DATA_need_discard
1220 struct printbuf buf = PRINTBUF;
1224 pos.offset &= ~(~0ULL << 56);
1225 genbits = iter->pos.offset & (~0ULL << 56);
1227 alloc_k = bch2_bkey_get_iter(trans, &alloc_iter, BTREE_ID_alloc, pos, 0);
1228 ret = bkey_err(alloc_k);
1232 if (fsck_err_on(!bch2_dev_bucket_exists(c, pos), c,
1233 need_discard_freespace_key_to_invalid_dev_bucket,
1234 "entry in %s btree for nonexistant dev:bucket %llu:%llu",
1235 bch2_btree_id_str(iter->btree_id), pos.inode, pos.offset))
1238 a = bch2_alloc_to_v4(alloc_k, &a_convert);
1240 if (fsck_err_on(a->data_type != state ||
1241 (state == BCH_DATA_free &&
1242 genbits != alloc_freespace_genbits(*a)), c,
1243 need_discard_freespace_key_bad,
1244 "%s\n incorrectly set at %s:%llu:%llu:0 (free %u, genbits %llu should be %llu)",
1245 (bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf),
1246 bch2_btree_id_str(iter->btree_id),
1249 a->data_type == state,
1250 genbits >> 56, alloc_freespace_genbits(*a) >> 56))
1254 set_btree_iter_dontneed(&alloc_iter);
1255 bch2_trans_iter_exit(trans, &alloc_iter);
1256 printbuf_exit(&buf);
1259 ret = bch2_btree_delete_extent_at(trans, iter,
1260 iter->btree_id == BTREE_ID_freespace ? 1 : 0, 0) ?:
1261 bch2_trans_commit(trans, NULL, NULL,
1262 BCH_TRANS_COMMIT_no_enospc);
1267 * We've already checked that generation numbers in the bucket_gens btree are
1268 * valid for buckets that exist; this just checks for keys for nonexistent
1271 static noinline_for_stack
1272 int bch2_check_bucket_gens_key(struct btree_trans *trans,
1273 struct btree_iter *iter,
1276 struct bch_fs *c = trans->c;
1277 struct bkey_i_bucket_gens g;
1279 u64 start = bucket_gens_pos_to_alloc(k.k->p, 0).offset;
1280 u64 end = bucket_gens_pos_to_alloc(bpos_nosnap_successor(k.k->p), 0).offset;
1282 bool need_update = false, dev_exists;
1283 struct printbuf buf = PRINTBUF;
1286 BUG_ON(k.k->type != KEY_TYPE_bucket_gens);
1287 bkey_reassemble(&g.k_i, k);
1289 /* if no bch_dev, skip out whether we repair or not */
1290 dev_exists = bch2_dev_exists2(c, k.k->p.inode);
1292 if (fsck_err_on(!dev_exists, c,
1293 bucket_gens_to_invalid_dev,
1294 "bucket_gens key for invalid device:\n %s",
1295 (bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
1296 ret = bch2_btree_delete_at(trans, iter, 0);
1301 ca = bch_dev_bkey_exists(c, k.k->p.inode);
1302 if (fsck_err_on(end <= ca->mi.first_bucket ||
1303 start >= ca->mi.nbuckets, c,
1304 bucket_gens_to_invalid_buckets,
1305 "bucket_gens key for invalid buckets:\n %s",
1306 (bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
1307 ret = bch2_btree_delete_at(trans, iter, 0);
1311 for (b = start; b < ca->mi.first_bucket; b++)
1312 if (fsck_err_on(g.v.gens[b & KEY_TYPE_BUCKET_GENS_MASK], c,
1313 bucket_gens_nonzero_for_invalid_buckets,
1314 "bucket_gens key has nonzero gen for invalid bucket")) {
1315 g.v.gens[b & KEY_TYPE_BUCKET_GENS_MASK] = 0;
1319 for (b = ca->mi.nbuckets; b < end; b++)
1320 if (fsck_err_on(g.v.gens[b & KEY_TYPE_BUCKET_GENS_MASK], c,
1321 bucket_gens_nonzero_for_invalid_buckets,
1322 "bucket_gens key has nonzero gen for invalid bucket")) {
1323 g.v.gens[b & KEY_TYPE_BUCKET_GENS_MASK] = 0;
1328 struct bkey_i *u = bch2_trans_kmalloc(trans, sizeof(g));
1330 ret = PTR_ERR_OR_ZERO(u);
1334 memcpy(u, &g, sizeof(g));
1335 ret = bch2_trans_update(trans, iter, u, 0);
1339 printbuf_exit(&buf);
1343 int bch2_check_alloc_info(struct bch_fs *c)
1345 struct btree_trans *trans = bch2_trans_get(c);
1346 struct btree_iter iter, discard_iter, freespace_iter, bucket_gens_iter;
1351 bch2_trans_iter_init(trans, &iter, BTREE_ID_alloc, POS_MIN,
1352 BTREE_ITER_PREFETCH);
1353 bch2_trans_iter_init(trans, &discard_iter, BTREE_ID_need_discard, POS_MIN,
1354 BTREE_ITER_PREFETCH);
1355 bch2_trans_iter_init(trans, &freespace_iter, BTREE_ID_freespace, POS_MIN,
1356 BTREE_ITER_PREFETCH);
1357 bch2_trans_iter_init(trans, &bucket_gens_iter, BTREE_ID_bucket_gens, POS_MIN,
1358 BTREE_ITER_PREFETCH);
1363 bch2_trans_begin(trans);
1365 k = bch2_get_key_or_real_bucket_hole(&iter, &hole);
1374 next = bpos_nosnap_successor(k.k->p);
1376 ret = bch2_check_alloc_key(trans,
1386 ret = bch2_check_alloc_hole_freespace(trans,
1387 bkey_start_pos(k.k),
1390 bch2_check_alloc_hole_bucket_gens(trans,
1391 bkey_start_pos(k.k),
1398 ret = bch2_trans_commit(trans, NULL, NULL,
1399 BCH_TRANS_COMMIT_no_enospc);
1403 bch2_btree_iter_set_pos(&iter, next);
1405 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
1410 bch2_trans_iter_exit(trans, &bucket_gens_iter);
1411 bch2_trans_iter_exit(trans, &freespace_iter);
1412 bch2_trans_iter_exit(trans, &discard_iter);
1413 bch2_trans_iter_exit(trans, &iter);
1418 ret = for_each_btree_key(trans, iter,
1419 BTREE_ID_need_discard, POS_MIN,
1420 BTREE_ITER_PREFETCH, k,
1421 bch2_check_discard_freespace_key(trans, &iter));
1425 bch2_trans_iter_init(trans, &iter, BTREE_ID_freespace, POS_MIN,
1426 BTREE_ITER_PREFETCH);
1428 bch2_trans_begin(trans);
1429 k = bch2_btree_iter_peek(&iter);
1433 ret = bkey_err(k) ?:
1434 bch2_check_discard_freespace_key(trans, &iter);
1435 if (bch2_err_matches(ret, BCH_ERR_transaction_restart)) {
1440 struct printbuf buf = PRINTBUF;
1441 bch2_bkey_val_to_text(&buf, c, k);
1443 bch_err(c, "while checking %s", buf.buf);
1444 printbuf_exit(&buf);
1448 bch2_btree_iter_set_pos(&iter, bpos_nosnap_successor(iter.pos));
1450 bch2_trans_iter_exit(trans, &iter);
1454 ret = for_each_btree_key_commit(trans, iter,
1455 BTREE_ID_bucket_gens, POS_MIN,
1456 BTREE_ITER_PREFETCH, k,
1457 NULL, NULL, BCH_TRANS_COMMIT_no_enospc,
1458 bch2_check_bucket_gens_key(trans, &iter, k));
1460 bch2_trans_put(trans);
1465 static int bch2_check_alloc_to_lru_ref(struct btree_trans *trans,
1466 struct btree_iter *alloc_iter)
1468 struct bch_fs *c = trans->c;
1469 struct btree_iter lru_iter;
1470 struct bch_alloc_v4 a_convert;
1471 const struct bch_alloc_v4 *a;
1472 struct bkey_s_c alloc_k, lru_k;
1473 struct printbuf buf = PRINTBUF;
1476 alloc_k = bch2_btree_iter_peek(alloc_iter);
1480 ret = bkey_err(alloc_k);
1484 a = bch2_alloc_to_v4(alloc_k, &a_convert);
1486 if (a->data_type != BCH_DATA_cached)
1489 if (fsck_err_on(!a->io_time[READ], c,
1490 alloc_key_cached_but_read_time_zero,
1491 "cached bucket with read_time 0\n"
1493 (printbuf_reset(&buf),
1494 bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf))) {
1495 struct bkey_i_alloc_v4 *a_mut =
1496 bch2_alloc_to_v4_mut(trans, alloc_k);
1497 ret = PTR_ERR_OR_ZERO(a_mut);
1501 a_mut->v.io_time[READ] = atomic64_read(&c->io_clock[READ].now);
1502 ret = bch2_trans_update(trans, alloc_iter,
1503 &a_mut->k_i, BTREE_TRIGGER_NORUN);
1510 lru_k = bch2_bkey_get_iter(trans, &lru_iter, BTREE_ID_lru,
1511 lru_pos(alloc_k.k->p.inode,
1512 bucket_to_u64(alloc_k.k->p),
1513 a->io_time[READ]), 0);
1514 ret = bkey_err(lru_k);
1518 if (fsck_err_on(lru_k.k->type != KEY_TYPE_set, c,
1519 alloc_key_to_missing_lru_entry,
1520 "missing lru entry\n"
1522 (printbuf_reset(&buf),
1523 bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf))) {
1524 ret = bch2_lru_set(trans,
1526 bucket_to_u64(alloc_k.k->p),
1533 bch2_trans_iter_exit(trans, &lru_iter);
1534 printbuf_exit(&buf);
1538 int bch2_check_alloc_to_lru_refs(struct bch_fs *c)
1540 int ret = bch2_trans_run(c,
1541 for_each_btree_key_commit(trans, iter, BTREE_ID_alloc,
1542 POS_MIN, BTREE_ITER_PREFETCH, k,
1543 NULL, NULL, BCH_TRANS_COMMIT_no_enospc,
1544 bch2_check_alloc_to_lru_ref(trans, &iter)));
1549 static int bch2_discard_one_bucket(struct btree_trans *trans,
1550 struct btree_iter *need_discard_iter,
1551 struct bpos *discard_pos_done,
1554 u64 *need_journal_commit,
1557 struct bch_fs *c = trans->c;
1558 struct bpos pos = need_discard_iter->pos;
1559 struct btree_iter iter = { NULL };
1562 struct bkey_i_alloc_v4 *a;
1563 struct printbuf buf = PRINTBUF;
1566 ca = bch_dev_bkey_exists(c, pos.inode);
1567 if (!percpu_ref_tryget(&ca->io_ref)) {
1568 bch2_btree_iter_set_pos(need_discard_iter, POS(pos.inode + 1, 0));
1572 if (bch2_bucket_is_open_safe(c, pos.inode, pos.offset)) {
1577 if (bch2_bucket_needs_journal_commit(&c->buckets_waiting_for_journal,
1578 c->journal.flushed_seq_ondisk,
1579 pos.inode, pos.offset)) {
1580 (*need_journal_commit)++;
1584 k = bch2_bkey_get_iter(trans, &iter, BTREE_ID_alloc,
1585 need_discard_iter->pos,
1591 a = bch2_alloc_to_v4_mut(trans, k);
1592 ret = PTR_ERR_OR_ZERO(a);
1596 if (BCH_ALLOC_V4_NEED_INC_GEN(&a->v)) {
1598 SET_BCH_ALLOC_V4_NEED_INC_GEN(&a->v, false);
1602 if (a->v.journal_seq > c->journal.flushed_seq_ondisk) {
1603 if (c->curr_recovery_pass > BCH_RECOVERY_PASS_check_alloc_info) {
1604 bch2_trans_inconsistent(trans,
1605 "clearing need_discard but journal_seq %llu > flushed_seq %llu\n"
1608 c->journal.flushed_seq_ondisk,
1609 (bch2_bkey_val_to_text(&buf, c, k), buf.buf));
1615 if (a->v.data_type != BCH_DATA_need_discard) {
1616 if (c->curr_recovery_pass > BCH_RECOVERY_PASS_check_alloc_info) {
1617 bch2_trans_inconsistent(trans,
1618 "bucket incorrectly set in need_discard btree\n"
1620 (bch2_bkey_val_to_text(&buf, c, k), buf.buf));
1627 if (!bkey_eq(*discard_pos_done, iter.pos) &&
1628 ca->mi.discard && !c->opts.nochanges) {
1630 * This works without any other locks because this is the only
1631 * thread that removes items from the need_discard tree
1633 bch2_trans_unlock(trans);
1634 blkdev_issue_discard(ca->disk_sb.bdev,
1635 k.k->p.offset * ca->mi.bucket_size,
1638 *discard_pos_done = iter.pos;
1640 ret = bch2_trans_relock_notrace(trans);
1645 SET_BCH_ALLOC_V4_NEED_DISCARD(&a->v, false);
1646 a->v.data_type = alloc_data_type(a->v, a->v.data_type);
1648 ret = bch2_trans_update(trans, &iter, &a->k_i, 0) ?:
1649 bch2_trans_commit(trans, NULL, NULL,
1650 BCH_WATERMARK_btree|
1651 BCH_TRANS_COMMIT_no_enospc);
1655 count_event(c, bucket_discard);
1659 bch2_trans_iter_exit(trans, &iter);
1660 percpu_ref_put(&ca->io_ref);
1661 printbuf_exit(&buf);
1665 static void bch2_do_discards_work(struct work_struct *work)
1667 struct bch_fs *c = container_of(work, struct bch_fs, discard_work);
1668 u64 seen = 0, open = 0, need_journal_commit = 0, discarded = 0;
1669 struct bpos discard_pos_done = POS_MAX;
1673 * We're doing the commit in bch2_discard_one_bucket instead of using
1674 * for_each_btree_key_commit() so that we can increment counters after
1675 * successful commit:
1677 ret = bch2_trans_run(c,
1678 for_each_btree_key(trans, iter,
1679 BTREE_ID_need_discard, POS_MIN, 0, k,
1680 bch2_discard_one_bucket(trans, &iter, &discard_pos_done,
1683 &need_journal_commit,
1686 if (need_journal_commit * 2 > seen)
1687 bch2_journal_flush_async(&c->journal, NULL);
1689 bch2_write_ref_put(c, BCH_WRITE_REF_discard);
1691 trace_discard_buckets(c, seen, open, need_journal_commit, discarded,
1695 void bch2_do_discards(struct bch_fs *c)
1697 if (bch2_write_ref_tryget(c, BCH_WRITE_REF_discard) &&
1698 !queue_work(c->write_ref_wq, &c->discard_work))
1699 bch2_write_ref_put(c, BCH_WRITE_REF_discard);
1702 static int invalidate_one_bucket(struct btree_trans *trans,
1703 struct btree_iter *lru_iter,
1704 struct bkey_s_c lru_k,
1705 s64 *nr_to_invalidate)
1707 struct bch_fs *c = trans->c;
1708 struct btree_iter alloc_iter = { NULL };
1709 struct bkey_i_alloc_v4 *a = NULL;
1710 struct printbuf buf = PRINTBUF;
1711 struct bpos bucket = u64_to_bucket(lru_k.k->p.offset);
1712 unsigned cached_sectors;
1715 if (*nr_to_invalidate <= 0)
1718 if (!bch2_dev_bucket_exists(c, bucket)) {
1719 prt_str(&buf, "lru entry points to invalid bucket");
1723 if (bch2_bucket_is_open_safe(c, bucket.inode, bucket.offset))
1726 a = bch2_trans_start_alloc_update(trans, &alloc_iter, bucket);
1727 ret = PTR_ERR_OR_ZERO(a);
1731 /* We expect harmless races here due to the btree write buffer: */
1732 if (lru_pos_time(lru_iter->pos) != alloc_lru_idx_read(a->v))
1735 BUG_ON(a->v.data_type != BCH_DATA_cached);
1737 if (!a->v.cached_sectors)
1738 bch_err(c, "invalidating empty bucket, confused");
1740 cached_sectors = a->v.cached_sectors;
1742 SET_BCH_ALLOC_V4_NEED_INC_GEN(&a->v, false);
1745 a->v.dirty_sectors = 0;
1746 a->v.cached_sectors = 0;
1747 a->v.io_time[READ] = atomic64_read(&c->io_clock[READ].now);
1748 a->v.io_time[WRITE] = atomic64_read(&c->io_clock[WRITE].now);
1750 ret = bch2_trans_update(trans, &alloc_iter, &a->k_i,
1751 BTREE_TRIGGER_BUCKET_INVALIDATE) ?:
1752 bch2_trans_commit(trans, NULL, NULL,
1753 BCH_WATERMARK_btree|
1754 BCH_TRANS_COMMIT_no_enospc);
1758 trace_and_count(c, bucket_invalidate, c, bucket.inode, bucket.offset, cached_sectors);
1759 --*nr_to_invalidate;
1761 bch2_trans_iter_exit(trans, &alloc_iter);
1762 printbuf_exit(&buf);
1765 prt_str(&buf, "\n lru key: ");
1766 bch2_bkey_val_to_text(&buf, c, lru_k);
1768 prt_str(&buf, "\n lru entry: ");
1769 bch2_lru_pos_to_text(&buf, lru_iter->pos);
1771 prt_str(&buf, "\n alloc key: ");
1773 bch2_bpos_to_text(&buf, bucket);
1775 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&a->k_i));
1777 bch_err(c, "%s", buf.buf);
1778 if (c->curr_recovery_pass > BCH_RECOVERY_PASS_check_lrus) {
1779 bch2_inconsistent_error(c);
1786 static void bch2_do_invalidates_work(struct work_struct *work)
1788 struct bch_fs *c = container_of(work, struct bch_fs, invalidate_work);
1789 struct btree_trans *trans = bch2_trans_get(c);
1792 ret = bch2_btree_write_buffer_tryflush(trans);
1796 for_each_member_device(c, ca) {
1797 s64 nr_to_invalidate =
1798 should_invalidate_buckets(ca, bch2_dev_usage_read(ca));
1800 ret = for_each_btree_key_upto(trans, iter, BTREE_ID_lru,
1801 lru_pos(ca->dev_idx, 0, 0),
1802 lru_pos(ca->dev_idx, U64_MAX, LRU_TIME_MAX),
1803 BTREE_ITER_INTENT, k,
1804 invalidate_one_bucket(trans, &iter, k, &nr_to_invalidate));
1807 percpu_ref_put(&ca->ref);
1812 bch2_trans_put(trans);
1813 bch2_write_ref_put(c, BCH_WRITE_REF_invalidate);
1816 void bch2_do_invalidates(struct bch_fs *c)
1818 if (bch2_write_ref_tryget(c, BCH_WRITE_REF_invalidate) &&
1819 !queue_work(c->write_ref_wq, &c->invalidate_work))
1820 bch2_write_ref_put(c, BCH_WRITE_REF_invalidate);
1823 int bch2_dev_freespace_init(struct bch_fs *c, struct bch_dev *ca,
1824 u64 bucket_start, u64 bucket_end)
1826 struct btree_trans *trans = bch2_trans_get(c);
1827 struct btree_iter iter;
1830 struct bpos end = POS(ca->dev_idx, bucket_end);
1831 struct bch_member *m;
1832 unsigned long last_updated = jiffies;
1835 BUG_ON(bucket_start > bucket_end);
1836 BUG_ON(bucket_end > ca->mi.nbuckets);
1838 bch2_trans_iter_init(trans, &iter, BTREE_ID_alloc,
1839 POS(ca->dev_idx, max_t(u64, ca->mi.first_bucket, bucket_start)),
1840 BTREE_ITER_PREFETCH);
1842 * Scan the alloc btree for every bucket on @ca, and add buckets to the
1843 * freespace/need_discard/need_gc_gens btrees as needed:
1846 if (last_updated + HZ * 10 < jiffies) {
1847 bch_info(ca, "%s: currently at %llu/%llu",
1848 __func__, iter.pos.offset, ca->mi.nbuckets);
1849 last_updated = jiffies;
1852 bch2_trans_begin(trans);
1854 if (bkey_ge(iter.pos, end)) {
1859 k = bch2_get_key_or_hole(&iter, end, &hole);
1866 * We process live keys in the alloc btree one at a
1869 struct bch_alloc_v4 a_convert;
1870 const struct bch_alloc_v4 *a = bch2_alloc_to_v4(k, &a_convert);
1872 ret = bch2_bucket_do_index(trans, k, a, true) ?:
1873 bch2_trans_commit(trans, NULL, NULL,
1874 BCH_TRANS_COMMIT_no_enospc);
1878 bch2_btree_iter_advance(&iter);
1880 struct bkey_i *freespace;
1882 freespace = bch2_trans_kmalloc(trans, sizeof(*freespace));
1883 ret = PTR_ERR_OR_ZERO(freespace);
1887 bkey_init(&freespace->k);
1888 freespace->k.type = KEY_TYPE_set;
1889 freespace->k.p = k.k->p;
1890 freespace->k.size = k.k->size;
1892 ret = bch2_btree_insert_trans(trans, BTREE_ID_freespace, freespace, 0) ?:
1893 bch2_trans_commit(trans, NULL, NULL,
1894 BCH_TRANS_COMMIT_no_enospc);
1898 bch2_btree_iter_set_pos(&iter, k.k->p);
1901 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
1907 bch2_trans_iter_exit(trans, &iter);
1908 bch2_trans_put(trans);
1911 bch_err_msg(ca, ret, "initializing free space");
1915 mutex_lock(&c->sb_lock);
1916 m = bch2_members_v2_get_mut(c->disk_sb.sb, ca->dev_idx);
1917 SET_BCH_MEMBER_FREESPACE_INITIALIZED(m, true);
1918 mutex_unlock(&c->sb_lock);
1923 int bch2_fs_freespace_init(struct bch_fs *c)
1926 bool doing_init = false;
1929 * We can crash during the device add path, so we need to check this on
1933 for_each_member_device(c, ca) {
1934 if (ca->mi.freespace_initialized)
1938 bch_info(c, "initializing freespace");
1942 ret = bch2_dev_freespace_init(c, ca, 0, ca->mi.nbuckets);
1944 percpu_ref_put(&ca->ref);
1951 mutex_lock(&c->sb_lock);
1952 bch2_write_super(c);
1953 mutex_unlock(&c->sb_lock);
1954 bch_verbose(c, "done initializing freespace");
1960 /* Bucket IO clocks: */
1962 int bch2_bucket_io_time_reset(struct btree_trans *trans, unsigned dev,
1963 size_t bucket_nr, int rw)
1965 struct bch_fs *c = trans->c;
1966 struct btree_iter iter;
1967 struct bkey_i_alloc_v4 *a;
1971 a = bch2_trans_start_alloc_update(trans, &iter, POS(dev, bucket_nr));
1972 ret = PTR_ERR_OR_ZERO(a);
1976 now = atomic64_read(&c->io_clock[rw].now);
1977 if (a->v.io_time[rw] == now)
1980 a->v.io_time[rw] = now;
1982 ret = bch2_trans_update(trans, &iter, &a->k_i, 0) ?:
1983 bch2_trans_commit(trans, NULL, NULL, 0);
1985 bch2_trans_iter_exit(trans, &iter);
1989 /* Startup/shutdown (ro/rw): */
1991 void bch2_recalc_capacity(struct bch_fs *c)
1993 u64 capacity = 0, reserved_sectors = 0, gc_reserve;
1994 unsigned bucket_size_max = 0;
1995 unsigned long ra_pages = 0;
1997 lockdep_assert_held(&c->state_lock);
1999 for_each_online_member(c, ca) {
2000 struct backing_dev_info *bdi = ca->disk_sb.bdev->bd_disk->bdi;
2002 ra_pages += bdi->ra_pages;
2005 bch2_set_ra_pages(c, ra_pages);
2007 for_each_rw_member(c, ca) {
2008 u64 dev_reserve = 0;
2011 * We need to reserve buckets (from the number
2012 * of currently available buckets) against
2013 * foreground writes so that mainly copygc can
2014 * make forward progress.
2016 * We need enough to refill the various reserves
2017 * from scratch - copygc will use its entire
2018 * reserve all at once, then run against when
2019 * its reserve is refilled (from the formerly
2020 * available buckets).
2022 * This reserve is just used when considering if
2023 * allocations for foreground writes must wait -
2024 * not -ENOSPC calculations.
2027 dev_reserve += ca->nr_btree_reserve * 2;
2028 dev_reserve += ca->mi.nbuckets >> 6; /* copygc reserve */
2030 dev_reserve += 1; /* btree write point */
2031 dev_reserve += 1; /* copygc write point */
2032 dev_reserve += 1; /* rebalance write point */
2034 dev_reserve *= ca->mi.bucket_size;
2036 capacity += bucket_to_sector(ca, ca->mi.nbuckets -
2037 ca->mi.first_bucket);
2039 reserved_sectors += dev_reserve * 2;
2041 bucket_size_max = max_t(unsigned, bucket_size_max,
2042 ca->mi.bucket_size);
2045 gc_reserve = c->opts.gc_reserve_bytes
2046 ? c->opts.gc_reserve_bytes >> 9
2047 : div64_u64(capacity * c->opts.gc_reserve_percent, 100);
2049 reserved_sectors = max(gc_reserve, reserved_sectors);
2051 reserved_sectors = min(reserved_sectors, capacity);
2053 c->capacity = capacity - reserved_sectors;
2055 c->bucket_size_max = bucket_size_max;
2057 /* Wake up case someone was waiting for buckets */
2058 closure_wake_up(&c->freelist_wait);
2061 u64 bch2_min_rw_member_capacity(struct bch_fs *c)
2065 for_each_rw_member(c, ca)
2066 ret = min(ret, ca->mi.nbuckets * ca->mi.bucket_size);
2070 static bool bch2_dev_has_open_write_point(struct bch_fs *c, struct bch_dev *ca)
2072 struct open_bucket *ob;
2075 for (ob = c->open_buckets;
2076 ob < c->open_buckets + ARRAY_SIZE(c->open_buckets);
2078 spin_lock(&ob->lock);
2079 if (ob->valid && !ob->on_partial_list &&
2080 ob->dev == ca->dev_idx)
2082 spin_unlock(&ob->lock);
2088 /* device goes ro: */
2089 void bch2_dev_allocator_remove(struct bch_fs *c, struct bch_dev *ca)
2093 /* First, remove device from allocation groups: */
2095 for (i = 0; i < ARRAY_SIZE(c->rw_devs); i++)
2096 clear_bit(ca->dev_idx, c->rw_devs[i].d);
2099 * Capacity is calculated based off of devices in allocation groups:
2101 bch2_recalc_capacity(c);
2103 bch2_open_buckets_stop(c, ca, false);
2106 * Wake up threads that were blocked on allocation, so they can notice
2107 * the device can no longer be removed and the capacity has changed:
2109 closure_wake_up(&c->freelist_wait);
2112 * journal_res_get() can block waiting for free space in the journal -
2113 * it needs to notice there may not be devices to allocate from anymore:
2115 wake_up(&c->journal.wait);
2117 /* Now wait for any in flight writes: */
2119 closure_wait_event(&c->open_buckets_wait,
2120 !bch2_dev_has_open_write_point(c, ca));
2123 /* device goes rw: */
2124 void bch2_dev_allocator_add(struct bch_fs *c, struct bch_dev *ca)
2128 for (i = 0; i < ARRAY_SIZE(c->rw_devs); i++)
2129 if (ca->mi.data_allowed & (1 << i))
2130 set_bit(ca->dev_idx, c->rw_devs[i].d);
2133 void bch2_fs_allocator_background_init(struct bch_fs *c)
2135 spin_lock_init(&c->freelist_lock);
2136 INIT_WORK(&c->discard_work, bch2_do_discards_work);
2137 INIT_WORK(&c->invalidate_work, bch2_do_invalidates_work);