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"
13 #include "buckets_waiting_for_journal.h"
22 #include <linux/kthread.h>
23 #include <linux/math64.h>
24 #include <linux/random.h>
25 #include <linux/rculist.h>
26 #include <linux/rcupdate.h>
27 #include <linux/sched/task.h>
28 #include <linux/sort.h>
29 #include <trace/events/bcachefs.h>
31 /* Persistent alloc info: */
33 static const unsigned BCH_ALLOC_V1_FIELD_BYTES[] = {
34 #define x(name, bits) [BCH_ALLOC_FIELD_V1_##name] = bits / 8,
39 struct bkey_alloc_unpacked {
46 #define x(_name, _bits) u##_bits _name;
51 static inline u64 alloc_field_v1_get(const struct bch_alloc *a,
52 const void **p, unsigned field)
54 unsigned bytes = BCH_ALLOC_V1_FIELD_BYTES[field];
57 if (!(a->fields & (1 << field)))
62 v = *((const u8 *) *p);
81 static inline void alloc_field_v1_put(struct bkey_i_alloc *a, void **p,
82 unsigned field, u64 v)
84 unsigned bytes = BCH_ALLOC_V1_FIELD_BYTES[field];
89 a->v.fields |= 1 << field;
96 *((__le16 *) *p) = cpu_to_le16(v);
99 *((__le32 *) *p) = cpu_to_le32(v);
102 *((__le64 *) *p) = cpu_to_le64(v);
111 static void bch2_alloc_unpack_v1(struct bkey_alloc_unpacked *out,
114 const struct bch_alloc *in = bkey_s_c_to_alloc(k).v;
115 const void *d = in->data;
120 #define x(_name, _bits) out->_name = alloc_field_v1_get(in, &d, idx++);
121 BCH_ALLOC_FIELDS_V1()
125 static int bch2_alloc_unpack_v2(struct bkey_alloc_unpacked *out,
128 struct bkey_s_c_alloc_v2 a = bkey_s_c_to_alloc_v2(k);
129 const u8 *in = a.v->data;
130 const u8 *end = bkey_val_end(a);
131 unsigned fieldnr = 0;
136 out->oldest_gen = a.v->oldest_gen;
137 out->data_type = a.v->data_type;
139 #define x(_name, _bits) \
140 if (fieldnr < a.v->nr_fields) { \
141 ret = bch2_varint_decode_fast(in, end, &v); \
149 if (v != out->_name) \
153 BCH_ALLOC_FIELDS_V2()
158 static int bch2_alloc_unpack_v3(struct bkey_alloc_unpacked *out,
161 struct bkey_s_c_alloc_v3 a = bkey_s_c_to_alloc_v3(k);
162 const u8 *in = a.v->data;
163 const u8 *end = bkey_val_end(a);
164 unsigned fieldnr = 0;
169 out->oldest_gen = a.v->oldest_gen;
170 out->data_type = a.v->data_type;
171 out->need_discard = BCH_ALLOC_V3_NEED_DISCARD(a.v);
172 out->need_inc_gen = BCH_ALLOC_V3_NEED_INC_GEN(a.v);
173 out->journal_seq = le64_to_cpu(a.v->journal_seq);
175 #define x(_name, _bits) \
176 if (fieldnr < a.v->nr_fields) { \
177 ret = bch2_varint_decode_fast(in, end, &v); \
185 if (v != out->_name) \
189 BCH_ALLOC_FIELDS_V2()
194 static struct bkey_alloc_unpacked bch2_alloc_unpack(struct bkey_s_c k)
196 struct bkey_alloc_unpacked ret = { .gen = 0 };
200 bch2_alloc_unpack_v1(&ret, k);
202 case KEY_TYPE_alloc_v2:
203 bch2_alloc_unpack_v2(&ret, k);
205 case KEY_TYPE_alloc_v3:
206 bch2_alloc_unpack_v3(&ret, k);
213 static unsigned bch_alloc_v1_val_u64s(const struct bch_alloc *a)
215 unsigned i, bytes = offsetof(struct bch_alloc, data);
217 for (i = 0; i < ARRAY_SIZE(BCH_ALLOC_V1_FIELD_BYTES); i++)
218 if (a->fields & (1 << i))
219 bytes += BCH_ALLOC_V1_FIELD_BYTES[i];
221 return DIV_ROUND_UP(bytes, sizeof(u64));
224 int bch2_alloc_v1_invalid(const struct bch_fs *c, struct bkey_s_c k,
225 int rw, struct printbuf *err)
227 struct bkey_s_c_alloc a = bkey_s_c_to_alloc(k);
229 /* allow for unknown fields */
230 if (bkey_val_u64s(a.k) < bch_alloc_v1_val_u64s(a.v)) {
231 prt_printf(err, "incorrect value size (%zu < %u)",
232 bkey_val_u64s(a.k), bch_alloc_v1_val_u64s(a.v));
233 return -BCH_ERR_invalid_bkey;
239 int bch2_alloc_v2_invalid(const struct bch_fs *c, struct bkey_s_c k,
240 int rw, struct printbuf *err)
242 struct bkey_alloc_unpacked u;
244 if (bch2_alloc_unpack_v2(&u, k)) {
245 prt_printf(err, "unpack error");
246 return -BCH_ERR_invalid_bkey;
252 int bch2_alloc_v3_invalid(const struct bch_fs *c, struct bkey_s_c k,
253 int rw, struct printbuf *err)
255 struct bkey_alloc_unpacked u;
257 if (bch2_alloc_unpack_v3(&u, k)) {
258 prt_printf(err, "unpack error");
259 return -BCH_ERR_invalid_bkey;
265 int bch2_alloc_v4_invalid(const struct bch_fs *c, struct bkey_s_c k,
266 int rw, struct printbuf *err)
268 struct bkey_s_c_alloc_v4 a = bkey_s_c_to_alloc_v4(k);
270 if (alloc_v4_u64s(a.v) != bkey_val_u64s(k.k)) {
271 prt_printf(err, "bad val size (%lu != %u)",
272 bkey_val_u64s(k.k), alloc_v4_u64s(a.v));
273 return -BCH_ERR_invalid_bkey;
276 if (!BCH_ALLOC_V4_BACKPOINTERS_START(a.v) &&
277 BCH_ALLOC_V4_NR_BACKPOINTERS(a.v)) {
278 prt_printf(err, "invalid backpointers_start");
279 return -BCH_ERR_invalid_bkey;
283 * XXX this is wrong, we'll be checking updates that happened from
284 * before BCH_FS_CHECK_BACKPOINTERS_DONE
286 if (rw == WRITE && test_bit(BCH_FS_CHECK_BACKPOINTERS_DONE, &c->flags)) {
287 unsigned i, bp_len = 0;
289 for (i = 0; i < BCH_ALLOC_V4_NR_BACKPOINTERS(a.v); i++)
290 bp_len += alloc_v4_backpointers_c(a.v)[i].bucket_len;
292 if (bp_len > a.v->dirty_sectors) {
293 prt_printf(err, "too many backpointers");
294 return -BCH_ERR_invalid_bkey;
299 if (alloc_data_type(*a.v, a.v->data_type) != a.v->data_type) {
300 prt_printf(err, "invalid data type (got %u should be %u)",
301 a.v->data_type, alloc_data_type(*a.v, a.v->data_type));
302 return -BCH_ERR_invalid_bkey;
305 switch (a.v->data_type) {
307 case BCH_DATA_need_gc_gens:
308 case BCH_DATA_need_discard:
309 if (a.v->dirty_sectors ||
310 a.v->cached_sectors ||
312 prt_printf(err, "empty data type free but have data");
313 return -BCH_ERR_invalid_bkey;
317 case BCH_DATA_journal:
320 case BCH_DATA_parity:
321 if (!a.v->dirty_sectors) {
322 prt_printf(err, "data_type %s but dirty_sectors==0",
323 bch2_data_types[a.v->data_type]);
324 return -BCH_ERR_invalid_bkey;
327 case BCH_DATA_cached:
328 if (!a.v->cached_sectors ||
329 a.v->dirty_sectors ||
331 prt_printf(err, "data type inconsistency");
332 return -BCH_ERR_invalid_bkey;
335 if (!a.v->io_time[READ] &&
336 test_bit(BCH_FS_CHECK_ALLOC_TO_LRU_REFS_DONE, &c->flags)) {
337 prt_printf(err, "cached bucket with read_time == 0");
338 return -BCH_ERR_invalid_bkey;
341 case BCH_DATA_stripe:
343 prt_printf(err, "data_type %s but stripe==0",
344 bch2_data_types[a.v->data_type]);
345 return -BCH_ERR_invalid_bkey;
354 static inline u64 swab40(u64 x)
356 return (((x & 0x00000000ffULL) << 32)|
357 ((x & 0x000000ff00ULL) << 16)|
358 ((x & 0x0000ff0000ULL) >> 0)|
359 ((x & 0x00ff000000ULL) >> 16)|
360 ((x & 0xff00000000ULL) >> 32));
363 void bch2_alloc_v4_swab(struct bkey_s k)
365 struct bch_alloc_v4 *a = bkey_s_to_alloc_v4(k).v;
366 struct bch_backpointer *bp, *bps;
368 a->journal_seq = swab64(a->journal_seq);
369 a->flags = swab32(a->flags);
370 a->dirty_sectors = swab32(a->dirty_sectors);
371 a->cached_sectors = swab32(a->cached_sectors);
372 a->io_time[0] = swab64(a->io_time[0]);
373 a->io_time[1] = swab64(a->io_time[1]);
374 a->stripe = swab32(a->stripe);
375 a->nr_external_backpointers = swab32(a->nr_external_backpointers);
377 bps = alloc_v4_backpointers(a);
378 for (bp = bps; bp < bps + BCH_ALLOC_V4_NR_BACKPOINTERS(a); bp++) {
379 bp->bucket_offset = swab40(bp->bucket_offset);
380 bp->bucket_len = swab32(bp->bucket_len);
381 bch2_bpos_swab(&bp->pos);
385 void bch2_alloc_to_text(struct printbuf *out, struct bch_fs *c, struct bkey_s_c k)
387 struct bch_alloc_v4 _a;
388 const struct bch_alloc_v4 *a = bch2_alloc_to_v4(k, &_a);
392 printbuf_indent_add(out, 2);
394 prt_printf(out, "gen %u oldest_gen %u data_type %s",
395 a->gen, a->oldest_gen, bch2_data_types[a->data_type]);
397 prt_printf(out, "journal_seq %llu", a->journal_seq);
399 prt_printf(out, "need_discard %llu", BCH_ALLOC_V4_NEED_DISCARD(a));
401 prt_printf(out, "need_inc_gen %llu", BCH_ALLOC_V4_NEED_INC_GEN(a));
403 prt_printf(out, "dirty_sectors %u", a->dirty_sectors);
405 prt_printf(out, "cached_sectors %u", a->cached_sectors);
407 prt_printf(out, "stripe %u", a->stripe);
409 prt_printf(out, "stripe_redundancy %u", a->stripe_redundancy);
411 prt_printf(out, "io_time[READ] %llu", a->io_time[READ]);
413 prt_printf(out, "io_time[WRITE] %llu", a->io_time[WRITE]);
416 if (k.k->type == KEY_TYPE_alloc_v4) {
417 struct bkey_s_c_alloc_v4 a_raw = bkey_s_c_to_alloc_v4(k);
418 const struct bch_backpointer *bps = alloc_v4_backpointers_c(a_raw.v);
420 prt_printf(out, "bp_start %llu", BCH_ALLOC_V4_BACKPOINTERS_START(a_raw.v));
423 prt_printf(out, "backpointers: %llu", BCH_ALLOC_V4_NR_BACKPOINTERS(a_raw.v));
424 printbuf_indent_add(out, 2);
426 for (i = 0; i < BCH_ALLOC_V4_NR_BACKPOINTERS(a_raw.v); i++) {
428 bch2_backpointer_to_text(out, &bps[i]);
431 printbuf_indent_sub(out, 2);
434 printbuf_indent_sub(out, 2);
437 void __bch2_alloc_to_v4(struct bkey_s_c k, struct bch_alloc_v4 *out)
439 if (k.k->type == KEY_TYPE_alloc_v4) {
442 *out = *bkey_s_c_to_alloc_v4(k).v;
444 src = alloc_v4_backpointers(out);
445 SET_BCH_ALLOC_V4_BACKPOINTERS_START(out, BCH_ALLOC_V4_U64s);
446 dst = alloc_v4_backpointers(out);
449 memset(src, 0, dst - src);
451 struct bkey_alloc_unpacked u = bch2_alloc_unpack(k);
453 *out = (struct bch_alloc_v4) {
454 .journal_seq = u.journal_seq,
455 .flags = u.need_discard,
457 .oldest_gen = u.oldest_gen,
458 .data_type = u.data_type,
459 .stripe_redundancy = u.stripe_redundancy,
460 .dirty_sectors = u.dirty_sectors,
461 .cached_sectors = u.cached_sectors,
462 .io_time[READ] = u.read_time,
463 .io_time[WRITE] = u.write_time,
467 SET_BCH_ALLOC_V4_BACKPOINTERS_START(out, BCH_ALLOC_V4_U64s);
471 static noinline struct bkey_i_alloc_v4 *
472 __bch2_alloc_to_v4_mut(struct btree_trans *trans, struct bkey_s_c k)
474 struct bkey_i_alloc_v4 *ret;
475 if (k.k->type == KEY_TYPE_alloc_v4) {
476 struct bkey_s_c_alloc_v4 a = bkey_s_c_to_alloc_v4(k);
477 unsigned bytes = sizeof(struct bkey_i_alloc_v4) +
478 BCH_ALLOC_V4_NR_BACKPOINTERS(a.v) *
479 sizeof(struct bch_backpointer);
483 * Reserve space for one more backpointer here:
484 * Not sketchy at doing it this way, nope...
486 ret = bch2_trans_kmalloc(trans, bytes + sizeof(struct bch_backpointer));
490 bkey_reassemble(&ret->k_i, k);
492 src = alloc_v4_backpointers(&ret->v);
493 SET_BCH_ALLOC_V4_BACKPOINTERS_START(&ret->v, BCH_ALLOC_V4_U64s);
494 dst = alloc_v4_backpointers(&ret->v);
496 memmove(dst, src, BCH_ALLOC_V4_NR_BACKPOINTERS(&ret->v) *
497 sizeof(struct bch_backpointer));
499 memset(src, 0, dst - src);
500 set_alloc_v4_u64s(ret);
502 ret = bch2_trans_kmalloc(trans, sizeof(struct bkey_i_alloc_v4) +
503 sizeof(struct bch_backpointer));
507 bkey_alloc_v4_init(&ret->k_i);
509 bch2_alloc_to_v4(k, &ret->v);
514 static inline struct bkey_i_alloc_v4 *bch2_alloc_to_v4_mut_inlined(struct btree_trans *trans, struct bkey_s_c k)
516 if (likely(k.k->type == KEY_TYPE_alloc_v4) &&
517 BCH_ALLOC_V4_BACKPOINTERS_START(bkey_s_c_to_alloc_v4(k).v) == BCH_ALLOC_V4_U64s) {
519 * Reserve space for one more backpointer here:
520 * Not sketchy at doing it this way, nope...
522 struct bkey_i_alloc_v4 *ret =
523 bch2_trans_kmalloc_nomemzero(trans, bkey_bytes(k.k) + sizeof(struct bch_backpointer));
525 bkey_reassemble(&ret->k_i, k);
529 return __bch2_alloc_to_v4_mut(trans, k);
532 struct bkey_i_alloc_v4 *bch2_alloc_to_v4_mut(struct btree_trans *trans, struct bkey_s_c k)
534 return bch2_alloc_to_v4_mut_inlined(trans, k);
537 struct bkey_i_alloc_v4 *
538 bch2_trans_start_alloc_update(struct btree_trans *trans, struct btree_iter *iter,
542 struct bkey_i_alloc_v4 *a;
545 bch2_trans_iter_init(trans, iter, BTREE_ID_alloc, pos,
546 BTREE_ITER_WITH_UPDATES|
549 k = bch2_btree_iter_peek_slot(iter);
554 a = bch2_alloc_to_v4_mut_inlined(trans, k);
555 ret = PTR_ERR_OR_ZERO(a);
560 bch2_trans_iter_exit(trans, iter);
564 int bch2_alloc_read(struct bch_fs *c)
566 struct btree_trans trans;
567 struct btree_iter iter;
569 struct bch_alloc_v4 a;
573 bch2_trans_init(&trans, c, 0, 0);
575 for_each_btree_key(&trans, iter, BTREE_ID_alloc, POS_MIN,
576 BTREE_ITER_PREFETCH, k, ret) {
578 * Not a fsck error because this is checked/repaired by
579 * bch2_check_alloc_key() which runs later:
581 if (!bch2_dev_bucket_exists(c, k.k->p))
584 ca = bch_dev_bkey_exists(c, k.k->p.inode);
586 *bucket_gen(ca, k.k->p.offset) = bch2_alloc_to_v4(k, &a)->gen;
588 bch2_trans_iter_exit(&trans, &iter);
590 bch2_trans_exit(&trans);
593 bch_err(c, "error reading alloc info: %s", bch2_err_str(ret));
598 static struct bpos alloc_gens_pos(struct bpos pos, unsigned *offset)
600 *offset = pos.offset & KEY_TYPE_BUCKET_GENS_MASK;
602 pos.offset >>= KEY_TYPE_BUCKET_GENS_BITS;
606 static struct bpos bucket_gens_pos_to_alloc(struct bpos pos, unsigned offset)
608 pos.offset <<= KEY_TYPE_BUCKET_GENS_BITS;
609 pos.offset += offset;
613 static unsigned alloc_gen(struct bkey_s_c k, unsigned offset)
615 return k.k->type == KEY_TYPE_bucket_gens
616 ? bkey_s_c_to_bucket_gens(k).v->gens[offset]
620 int bch2_bucket_gens_invalid(const struct bch_fs *c, struct bkey_s_c k,
621 int rw, struct printbuf *err)
623 if (bkey_val_bytes(k.k) != sizeof(struct bch_bucket_gens)) {
624 prt_printf(err, "bad val size (%lu != %zu)",
625 bkey_val_bytes(k.k), sizeof(struct bch_bucket_gens));
626 return -BCH_ERR_invalid_bkey;
632 void bch2_bucket_gens_to_text(struct printbuf *out, struct bch_fs *c, struct bkey_s_c k)
634 struct bkey_s_c_bucket_gens g = bkey_s_c_to_bucket_gens(k);
637 for (i = 0; i < ARRAY_SIZE(g.v->gens); i++) {
640 prt_printf(out, "%u", g.v->gens[i]);
644 int bch2_bucket_gens_init(struct bch_fs *c)
646 struct btree_trans trans;
647 struct btree_iter iter;
649 struct bch_alloc_v4 a;
650 struct bkey_i_bucket_gens g;
651 bool have_bucket_gens_key = false;
657 bch2_trans_init(&trans, c, 0, 0);
659 for_each_btree_key(&trans, iter, BTREE_ID_alloc, POS_MIN,
660 BTREE_ITER_PREFETCH, k, ret) {
662 * Not a fsck error because this is checked/repaired by
663 * bch2_check_alloc_key() which runs later:
665 if (!bch2_dev_bucket_exists(c, k.k->p))
668 gen = bch2_alloc_to_v4(k, &a)->gen;
669 pos = alloc_gens_pos(iter.pos, &offset);
671 if (have_bucket_gens_key && bkey_cmp(iter.pos, pos)) {
672 ret = commit_do(&trans, NULL, NULL,
674 BTREE_INSERT_LAZY_RW,
675 __bch2_btree_insert(&trans, BTREE_ID_bucket_gens, &g.k_i));
678 have_bucket_gens_key = false;
681 if (!have_bucket_gens_key) {
682 bkey_bucket_gens_init(&g.k_i);
684 have_bucket_gens_key = true;
687 g.v.gens[offset] = gen;
689 bch2_trans_iter_exit(&trans, &iter);
691 if (have_bucket_gens_key && !ret)
692 ret = commit_do(&trans, NULL, NULL,
694 BTREE_INSERT_LAZY_RW,
695 __bch2_btree_insert(&trans, BTREE_ID_bucket_gens, &g.k_i));
697 bch2_trans_exit(&trans);
700 bch_err(c, "%s: error %s", __func__, bch2_err_str(ret));
705 int bch2_bucket_gens_read(struct bch_fs *c)
707 struct btree_trans trans;
708 struct btree_iter iter;
710 const struct bch_bucket_gens *g;
715 bch2_trans_init(&trans, c, 0, 0);
717 for_each_btree_key(&trans, iter, BTREE_ID_bucket_gens, POS_MIN,
718 BTREE_ITER_PREFETCH, k, ret) {
719 u64 start = bucket_gens_pos_to_alloc(k.k->p, 0).offset;
720 u64 end = bucket_gens_pos_to_alloc(bpos_nosnap_successor(k.k->p), 0).offset;
722 if (k.k->type != KEY_TYPE_bucket_gens)
725 g = bkey_s_c_to_bucket_gens(k).v;
728 * Not a fsck error because this is checked/repaired by
729 * bch2_check_alloc_key() which runs later:
731 if (!bch2_dev_exists2(c, k.k->p.inode))
734 ca = bch_dev_bkey_exists(c, k.k->p.inode);
736 for (b = max_t(u64, ca->mi.first_bucket, start);
737 b < min_t(u64, ca->mi.nbuckets, end);
739 *bucket_gen(ca, b) = g->gens[b & KEY_TYPE_BUCKET_GENS_MASK];
741 bch2_trans_iter_exit(&trans, &iter);
743 bch2_trans_exit(&trans);
746 bch_err(c, "error reading alloc info: %s", bch2_err_str(ret));
751 /* Free space/discard btree: */
753 static int bch2_bucket_do_index(struct btree_trans *trans,
754 struct bkey_s_c alloc_k,
755 const struct bch_alloc_v4 *a,
758 struct bch_fs *c = trans->c;
759 struct bch_dev *ca = bch_dev_bkey_exists(c, alloc_k.k->p.inode);
760 struct btree_iter iter;
764 enum bch_bkey_type old_type = !set ? KEY_TYPE_set : KEY_TYPE_deleted;
765 enum bch_bkey_type new_type = set ? KEY_TYPE_set : KEY_TYPE_deleted;
766 struct printbuf buf = PRINTBUF;
769 if (a->data_type != BCH_DATA_free &&
770 a->data_type != BCH_DATA_need_discard)
773 k = bch2_trans_kmalloc_nomemzero(trans, sizeof(*k));
778 k->k.type = new_type;
780 switch (a->data_type) {
782 btree = BTREE_ID_freespace;
783 k->k.p = alloc_freespace_pos(alloc_k.k->p, *a);
784 bch2_key_resize(&k->k, 1);
786 case BCH_DATA_need_discard:
787 btree = BTREE_ID_need_discard;
788 k->k.p = alloc_k.k->p;
794 bch2_trans_iter_init(trans, &iter, btree,
795 bkey_start_pos(&k->k),
797 old = bch2_btree_iter_peek_slot(&iter);
802 if (ca->mi.freespace_initialized &&
803 test_bit(BCH_FS_CHECK_ALLOC_DONE, &c->flags) &&
804 bch2_trans_inconsistent_on(old.k->type != old_type, trans,
805 "incorrect key when %s %s btree (got %s should be %s)\n"
807 set ? "setting" : "clearing",
808 bch2_btree_ids[btree],
809 bch2_bkey_types[old.k->type],
810 bch2_bkey_types[old_type],
811 (bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf))) {
816 ret = bch2_trans_update(trans, &iter, k, 0);
818 bch2_trans_iter_exit(trans, &iter);
823 static noinline int bch2_bucket_gen_update(struct btree_trans *trans,
824 struct bpos bucket, u8 gen)
826 struct btree_iter iter;
828 struct bpos pos = alloc_gens_pos(bucket, &offset);
829 struct bkey_i_bucket_gens *g;
833 g = bch2_trans_kmalloc(trans, sizeof(*g));
834 ret = PTR_ERR_OR_ZERO(g);
838 bch2_trans_iter_init(trans, &iter, BTREE_ID_bucket_gens, pos,
840 BTREE_ITER_WITH_UPDATES);
841 k = bch2_btree_iter_peek_slot(&iter);
846 if (k.k->type != KEY_TYPE_bucket_gens) {
847 bkey_bucket_gens_init(&g->k_i);
850 bkey_reassemble(&g->k_i, k);
853 g->v.gens[offset] = gen;
855 ret = bch2_trans_update(trans, &iter, &g->k_i, 0);
857 bch2_trans_iter_exit(trans, &iter);
861 int bch2_trans_mark_alloc(struct btree_trans *trans,
862 enum btree_id btree_id, unsigned level,
863 struct bkey_s_c old, struct bkey_i *new,
866 struct bch_fs *c = trans->c;
867 struct bch_alloc_v4 old_a_convert, *new_a;
868 const struct bch_alloc_v4 *old_a;
869 u64 old_lru, new_lru;
873 * Deletion only happens in the device removal path, with
874 * BTREE_TRIGGER_NORUN:
876 BUG_ON(new->k.type != KEY_TYPE_alloc_v4);
878 old_a = bch2_alloc_to_v4(old, &old_a_convert);
879 new_a = &bkey_i_to_alloc_v4(new)->v;
881 new_a->data_type = alloc_data_type(*new_a, new_a->data_type);
883 if (new_a->dirty_sectors > old_a->dirty_sectors ||
884 new_a->cached_sectors > old_a->cached_sectors) {
885 new_a->io_time[READ] = max_t(u64, 1, atomic64_read(&c->io_clock[READ].now));
886 new_a->io_time[WRITE]= max_t(u64, 1, atomic64_read(&c->io_clock[WRITE].now));
887 SET_BCH_ALLOC_V4_NEED_INC_GEN(new_a, true);
888 SET_BCH_ALLOC_V4_NEED_DISCARD(new_a, true);
891 if (data_type_is_empty(new_a->data_type) &&
892 BCH_ALLOC_V4_NEED_INC_GEN(new_a) &&
893 !bch2_bucket_is_open_safe(c, new->k.p.inode, new->k.p.offset)) {
895 SET_BCH_ALLOC_V4_NEED_INC_GEN(new_a, false);
898 if (old_a->data_type != new_a->data_type ||
899 (new_a->data_type == BCH_DATA_free &&
900 alloc_freespace_genbits(*old_a) != alloc_freespace_genbits(*new_a))) {
901 ret = bch2_bucket_do_index(trans, old, old_a, false) ?:
902 bch2_bucket_do_index(trans, bkey_i_to_s_c(new), new_a, true);
907 if (new_a->data_type == BCH_DATA_cached &&
908 !new_a->io_time[READ])
909 new_a->io_time[READ] = max_t(u64, 1, atomic64_read(&c->io_clock[READ].now));
911 old_lru = alloc_lru_idx(*old_a);
912 new_lru = alloc_lru_idx(*new_a);
914 if (old_lru != new_lru) {
915 ret = bch2_lru_change(trans, new->k.p.inode, new->k.p.offset,
916 old_lru, &new_lru, old);
920 if (new_a->data_type == BCH_DATA_cached)
921 new_a->io_time[READ] = new_lru;
924 if (old_a->gen != new_a->gen) {
925 ret = bch2_bucket_gen_update(trans, new->k.p, new_a->gen);
934 * This synthesizes deleted extents for holes, similar to BTREE_ITER_SLOTS for
935 * extents style btrees, but works on non-extents btrees:
937 struct bkey_s_c bch2_get_key_or_hole(struct btree_iter *iter, struct bpos end, struct bkey *hole)
939 struct bkey_s_c k = bch2_btree_iter_peek_slot(iter);
947 struct btree_iter iter2;
950 bch2_trans_copy_iter(&iter2, iter);
951 k = bch2_btree_iter_peek_upto(&iter2,
952 bkey_min(bkey_min(end,
953 iter->path->l[0].b->key.k.p),
954 POS(iter->pos.inode, iter->pos.offset + U32_MAX - 1)));
956 bch2_trans_iter_exit(iter->trans, &iter2);
958 BUG_ON(next.offset >= iter->pos.offset + U32_MAX);
966 bch2_key_resize(hole, next.offset - iter->pos.offset);
967 return (struct bkey_s_c) { hole, NULL };
971 static bool next_bucket(struct bch_fs *c, struct bpos *bucket)
976 if (bch2_dev_bucket_exists(c, *bucket))
979 if (bch2_dev_exists2(c, bucket->inode)) {
980 ca = bch_dev_bkey_exists(c, bucket->inode);
982 if (bucket->offset < ca->mi.first_bucket) {
983 bucket->offset = ca->mi.first_bucket;
992 iter = bucket->inode;
993 ca = __bch2_next_dev(c, &iter, NULL);
995 bucket->offset = ca->mi.first_bucket;
1001 struct bkey_s_c bch2_get_key_or_real_bucket_hole(struct btree_iter *iter, struct bkey *hole)
1003 struct bch_fs *c = iter->trans->c;
1006 k = bch2_get_key_or_hole(iter, POS_MAX, hole);
1011 struct bpos bucket = bkey_start_pos(k.k);
1013 if (!bch2_dev_bucket_exists(c, bucket)) {
1014 if (!next_bucket(c, &bucket))
1015 return bkey_s_c_null;
1017 bch2_btree_iter_set_pos(iter, bucket);
1021 if (!bch2_dev_bucket_exists(c, k.k->p)) {
1022 struct bch_dev *ca = bch_dev_bkey_exists(c, bucket.inode);
1024 bch2_key_resize(hole, ca->mi.nbuckets - bucket.offset);
1031 static int bch2_check_alloc_key(struct btree_trans *trans,
1032 struct bkey_s_c alloc_k,
1033 struct btree_iter *alloc_iter,
1034 struct btree_iter *discard_iter,
1035 struct btree_iter *freespace_iter,
1036 struct btree_iter *bucket_gens_iter)
1038 struct bch_fs *c = trans->c;
1040 struct bch_alloc_v4 a_convert;
1041 const struct bch_alloc_v4 *a;
1042 unsigned discard_key_type, freespace_key_type;
1043 unsigned gens_offset;
1045 struct printbuf buf = PRINTBUF;
1048 if (fsck_err_on(!bch2_dev_bucket_exists(c, alloc_k.k->p), c,
1049 "alloc key for invalid device:bucket %llu:%llu",
1050 alloc_k.k->p.inode, alloc_k.k->p.offset))
1051 return bch2_btree_delete_at(trans, alloc_iter, 0);
1053 ca = bch_dev_bkey_exists(c, alloc_k.k->p.inode);
1054 if (!ca->mi.freespace_initialized)
1057 a = bch2_alloc_to_v4(alloc_k, &a_convert);
1059 discard_key_type = a->data_type == BCH_DATA_need_discard ? KEY_TYPE_set : 0;
1060 bch2_btree_iter_set_pos(discard_iter, alloc_k.k->p);
1061 k = bch2_btree_iter_peek_slot(discard_iter);
1066 if (k.k->type != discard_key_type &&
1067 (c->opts.reconstruct_alloc ||
1068 fsck_err(c, "incorrect key in need_discard btree (got %s should be %s)\n"
1070 bch2_bkey_types[k.k->type],
1071 bch2_bkey_types[discard_key_type],
1072 (bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf)))) {
1073 struct bkey_i *update =
1074 bch2_trans_kmalloc(trans, sizeof(*update));
1076 ret = PTR_ERR_OR_ZERO(update);
1080 bkey_init(&update->k);
1081 update->k.type = discard_key_type;
1082 update->k.p = discard_iter->pos;
1084 ret = bch2_trans_update(trans, discard_iter, update, 0);
1089 freespace_key_type = a->data_type == BCH_DATA_free ? KEY_TYPE_set : 0;
1090 bch2_btree_iter_set_pos(freespace_iter, alloc_freespace_pos(alloc_k.k->p, *a));
1091 k = bch2_btree_iter_peek_slot(freespace_iter);
1096 if (k.k->type != freespace_key_type &&
1097 (c->opts.reconstruct_alloc ||
1098 fsck_err(c, "incorrect key in freespace btree (got %s should be %s)\n"
1100 bch2_bkey_types[k.k->type],
1101 bch2_bkey_types[freespace_key_type],
1102 (printbuf_reset(&buf),
1103 bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf)))) {
1104 struct bkey_i *update =
1105 bch2_trans_kmalloc(trans, sizeof(*update));
1107 ret = PTR_ERR_OR_ZERO(update);
1111 bkey_init(&update->k);
1112 update->k.type = freespace_key_type;
1113 update->k.p = freespace_iter->pos;
1114 bch2_key_resize(&update->k, 1);
1116 ret = bch2_trans_update(trans, freespace_iter, update, 0);
1121 bch2_btree_iter_set_pos(bucket_gens_iter, alloc_gens_pos(alloc_k.k->p, &gens_offset));
1122 k = bch2_btree_iter_peek_slot(bucket_gens_iter);
1127 if (a->gen != alloc_gen(k, gens_offset) &&
1128 (c->opts.reconstruct_alloc ||
1129 fsck_err(c, "incorrect gen in bucket_gens btree (got %u should be %u)\n"
1131 alloc_gen(k, gens_offset), a->gen,
1132 (printbuf_reset(&buf),
1133 bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf)))) {
1134 struct bkey_i_bucket_gens *g =
1135 bch2_trans_kmalloc(trans, sizeof(*g));
1137 ret = PTR_ERR_OR_ZERO(g);
1141 if (k.k->type == KEY_TYPE_bucket_gens) {
1142 bkey_reassemble(&g->k_i, k);
1144 bkey_bucket_gens_init(&g->k_i);
1145 g->k.p = alloc_gens_pos(alloc_k.k->p, &gens_offset);
1148 g->v.gens[gens_offset] = a->gen;
1150 ret = bch2_trans_update(trans, bucket_gens_iter, &g->k_i, 0);
1156 printbuf_exit(&buf);
1160 static int bch2_check_alloc_hole_freespace(struct btree_trans *trans,
1163 struct btree_iter *freespace_iter)
1165 struct bch_fs *c = trans->c;
1168 struct printbuf buf = PRINTBUF;
1171 ca = bch_dev_bkey_exists(c, start.inode);
1172 if (!ca->mi.freespace_initialized)
1175 bch2_btree_iter_set_pos(freespace_iter, start);
1177 k = bch2_btree_iter_peek_slot(freespace_iter);
1182 *end = bkey_min(k.k->p, *end);
1184 if (k.k->type != KEY_TYPE_set &&
1185 (c->opts.reconstruct_alloc ||
1186 fsck_err(c, "hole in alloc btree missing in freespace btree\n"
1187 " device %llu buckets %llu-%llu",
1188 freespace_iter->pos.inode,
1189 freespace_iter->pos.offset,
1191 struct bkey_i *update =
1192 bch2_trans_kmalloc(trans, sizeof(*update));
1194 ret = PTR_ERR_OR_ZERO(update);
1198 bkey_init(&update->k);
1199 update->k.type = KEY_TYPE_set;
1200 update->k.p = freespace_iter->pos;
1201 bch2_key_resize(&update->k,
1202 min_t(u64, U32_MAX, end->offset -
1203 freespace_iter->pos.offset));
1205 ret = bch2_trans_update(trans, freespace_iter, update, 0);
1211 printbuf_exit(&buf);
1215 static int bch2_check_alloc_hole_bucket_gens(struct btree_trans *trans,
1218 struct btree_iter *bucket_gens_iter)
1220 struct bch_fs *c = trans->c;
1222 struct printbuf buf = PRINTBUF;
1223 unsigned i, gens_offset, gens_end_offset;
1226 if (c->sb.version < bcachefs_metadata_version_bucket_gens &&
1227 !c->opts.version_upgrade)
1230 bch2_btree_iter_set_pos(bucket_gens_iter, alloc_gens_pos(start, &gens_offset));
1232 k = bch2_btree_iter_peek_slot(bucket_gens_iter);
1237 if (bkey_cmp(alloc_gens_pos(start, &gens_offset),
1238 alloc_gens_pos(*end, &gens_end_offset)))
1239 gens_end_offset = KEY_TYPE_BUCKET_GENS_NR;
1241 if (k.k->type == KEY_TYPE_bucket_gens) {
1242 struct bkey_i_bucket_gens g;
1243 bool need_update = false;
1245 bkey_reassemble(&g.k_i, k);
1247 for (i = gens_offset; i < gens_end_offset; i++) {
1248 if (fsck_err_on(g.v.gens[i], c,
1249 "hole in alloc btree at %llu:%llu with nonzero gen in bucket_gens btree (%u)",
1250 bucket_gens_pos_to_alloc(k.k->p, i).inode,
1251 bucket_gens_pos_to_alloc(k.k->p, i).offset,
1259 struct bkey_i *k = bch2_trans_kmalloc(trans, sizeof(g));
1261 ret = PTR_ERR_OR_ZERO(k);
1265 memcpy(k, &g, sizeof(g));
1267 ret = bch2_trans_update(trans, bucket_gens_iter, k, 0);
1273 *end = bkey_min(*end, bucket_gens_pos_to_alloc(bpos_nosnap_successor(k.k->p), 0));
1276 printbuf_exit(&buf);
1280 static int bch2_check_discard_freespace_key(struct btree_trans *trans,
1281 struct btree_iter *iter)
1283 struct bch_fs *c = trans->c;
1284 struct btree_iter alloc_iter;
1285 struct bkey_s_c alloc_k;
1286 struct bch_alloc_v4 a_convert;
1287 const struct bch_alloc_v4 *a;
1290 enum bch_data_type state = iter->btree_id == BTREE_ID_need_discard
1291 ? BCH_DATA_need_discard
1293 struct printbuf buf = PRINTBUF;
1297 pos.offset &= ~(~0ULL << 56);
1298 genbits = iter->pos.offset & (~0ULL << 56);
1300 bch2_trans_iter_init(trans, &alloc_iter, BTREE_ID_alloc, pos, 0);
1302 if (fsck_err_on(!bch2_dev_bucket_exists(c, pos), c,
1303 "entry in %s btree for nonexistant dev:bucket %llu:%llu",
1304 bch2_btree_ids[iter->btree_id], pos.inode, pos.offset))
1307 alloc_k = bch2_btree_iter_peek_slot(&alloc_iter);
1308 ret = bkey_err(alloc_k);
1312 a = bch2_alloc_to_v4(alloc_k, &a_convert);
1314 if (fsck_err_on(a->data_type != state ||
1315 (state == BCH_DATA_free &&
1316 genbits != alloc_freespace_genbits(*a)), c,
1317 "%s\n incorrectly set in %s index (free %u, genbits %llu should be %llu)",
1318 (bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf),
1319 bch2_btree_ids[iter->btree_id],
1320 a->data_type == state,
1321 genbits >> 56, alloc_freespace_genbits(*a) >> 56))
1326 bch2_trans_iter_exit(trans, &alloc_iter);
1327 printbuf_exit(&buf);
1330 ret = bch2_btree_delete_extent_at(trans, iter,
1331 iter->btree_id == BTREE_ID_freespace ? 1 : 0, 0);
1336 * We've already checked that generation numbers in the bucket_gens btree are
1337 * valid for buckets that exist; this just checks for keys for nonexistent
1340 static int bch2_check_bucket_gens_key(struct btree_trans *trans,
1341 struct btree_iter *iter,
1344 struct bch_fs *c = trans->c;
1345 struct bkey_i_bucket_gens g;
1347 u64 start = bucket_gens_pos_to_alloc(k.k->p, 0).offset;
1348 u64 end = bucket_gens_pos_to_alloc(bpos_nosnap_successor(k.k->p), 0).offset;
1350 bool need_update = false;
1351 struct printbuf buf = PRINTBUF;
1354 BUG_ON(k.k->type != KEY_TYPE_bucket_gens);
1355 bkey_reassemble(&g.k_i, k);
1357 if (fsck_err_on(!bch2_dev_exists2(c, k.k->p.inode), c,
1358 "bucket_gens key for invalid device:\n %s",
1359 (bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
1360 ret = bch2_btree_delete_at(trans, iter, 0);
1364 ca = bch_dev_bkey_exists(c, k.k->p.inode);
1365 if (fsck_err_on(end <= ca->mi.first_bucket ||
1366 start >= ca->mi.nbuckets, c,
1367 "bucket_gens key for invalid buckets:\n %s",
1368 (bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
1369 ret = bch2_btree_delete_at(trans, iter, 0);
1373 for (b = start; b < ca->mi.first_bucket; b++)
1374 if (fsck_err_on(g.v.gens[b & KEY_TYPE_BUCKET_GENS_MASK], c,
1375 "bucket_gens key has nonzero gen for invalid bucket")) {
1376 g.v.gens[b & KEY_TYPE_BUCKET_GENS_MASK] = 0;
1380 for (b = ca->mi.nbuckets; b < end; b++)
1381 if (fsck_err_on(g.v.gens[b & KEY_TYPE_BUCKET_GENS_MASK], c,
1382 "bucket_gens key has nonzero gen for invalid bucket")) {
1383 g.v.gens[b & KEY_TYPE_BUCKET_GENS_MASK] = 0;
1390 k = bch2_trans_kmalloc(trans, sizeof(g));
1391 ret = PTR_ERR_OR_ZERO(k);
1395 memcpy(k, &g, sizeof(g));
1396 ret = bch2_trans_update(trans, iter, k, 0);
1400 printbuf_exit(&buf);
1404 int bch2_check_alloc_info(struct bch_fs *c)
1406 struct btree_trans trans;
1407 struct btree_iter iter, discard_iter, freespace_iter, bucket_gens_iter;
1412 bch2_trans_init(&trans, c, 0, 0);
1414 bch2_trans_iter_init(&trans, &iter, BTREE_ID_alloc, POS_MIN,
1415 BTREE_ITER_PREFETCH);
1416 bch2_trans_iter_init(&trans, &discard_iter, BTREE_ID_need_discard, POS_MIN,
1417 BTREE_ITER_PREFETCH);
1418 bch2_trans_iter_init(&trans, &freespace_iter, BTREE_ID_freespace, POS_MIN,
1419 BTREE_ITER_PREFETCH);
1420 bch2_trans_iter_init(&trans, &bucket_gens_iter, BTREE_ID_bucket_gens, POS_MIN,
1421 BTREE_ITER_PREFETCH);
1426 bch2_trans_begin(&trans);
1428 k = bch2_get_key_or_real_bucket_hole(&iter, &hole);
1437 next = bpos_nosnap_successor(k.k->p);
1439 ret = bch2_check_alloc_key(&trans,
1449 ret = bch2_check_alloc_hole_freespace(&trans,
1450 bkey_start_pos(k.k),
1453 bch2_check_alloc_hole_bucket_gens(&trans,
1454 bkey_start_pos(k.k),
1461 ret = bch2_trans_commit(&trans, NULL, NULL,
1462 BTREE_INSERT_NOFAIL|
1463 BTREE_INSERT_LAZY_RW);
1467 bch2_btree_iter_set_pos(&iter, next);
1469 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
1474 bch2_trans_iter_exit(&trans, &bucket_gens_iter);
1475 bch2_trans_iter_exit(&trans, &freespace_iter);
1476 bch2_trans_iter_exit(&trans, &discard_iter);
1477 bch2_trans_iter_exit(&trans, &iter);
1482 ret = for_each_btree_key_commit(&trans, iter,
1483 BTREE_ID_need_discard, POS_MIN,
1484 BTREE_ITER_PREFETCH, k,
1485 NULL, NULL, BTREE_INSERT_NOFAIL|BTREE_INSERT_LAZY_RW,
1486 bch2_check_discard_freespace_key(&trans, &iter)) ?:
1487 for_each_btree_key_commit(&trans, iter,
1488 BTREE_ID_freespace, POS_MIN,
1489 BTREE_ITER_PREFETCH, k,
1490 NULL, NULL, BTREE_INSERT_NOFAIL|BTREE_INSERT_LAZY_RW,
1491 bch2_check_discard_freespace_key(&trans, &iter)) ?:
1492 for_each_btree_key_commit(&trans, iter,
1493 BTREE_ID_bucket_gens, POS_MIN,
1494 BTREE_ITER_PREFETCH, k,
1495 NULL, NULL, BTREE_INSERT_NOFAIL|BTREE_INSERT_LAZY_RW,
1496 bch2_check_bucket_gens_key(&trans, &iter, k));
1498 bch2_trans_exit(&trans);
1499 return ret < 0 ? ret : 0;
1502 static int bch2_check_alloc_to_lru_ref(struct btree_trans *trans,
1503 struct btree_iter *alloc_iter)
1505 struct bch_fs *c = trans->c;
1506 struct btree_iter lru_iter;
1507 struct bch_alloc_v4 a_convert;
1508 const struct bch_alloc_v4 *a;
1509 struct bkey_s_c alloc_k, k;
1510 struct printbuf buf = PRINTBUF;
1511 struct printbuf buf2 = PRINTBUF;
1514 alloc_k = bch2_btree_iter_peek(alloc_iter);
1518 ret = bkey_err(alloc_k);
1522 a = bch2_alloc_to_v4(alloc_k, &a_convert);
1524 if (a->data_type != BCH_DATA_cached)
1527 bch2_trans_iter_init(trans, &lru_iter, BTREE_ID_lru,
1528 POS(alloc_k.k->p.inode, a->io_time[READ]), 0);
1530 k = bch2_btree_iter_peek_slot(&lru_iter);
1535 if (fsck_err_on(!a->io_time[READ], c,
1536 "cached bucket with read_time 0\n"
1538 (printbuf_reset(&buf),
1539 bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf)) ||
1540 fsck_err_on(k.k->type != KEY_TYPE_lru ||
1541 le64_to_cpu(bkey_s_c_to_lru(k).v->idx) != alloc_k.k->p.offset, c,
1542 "incorrect/missing lru entry\n"
1545 (printbuf_reset(&buf),
1546 bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf),
1547 (bch2_bkey_val_to_text(&buf2, c, k), buf2.buf))) {
1548 u64 read_time = a->io_time[READ] ?:
1549 atomic64_read(&c->io_clock[READ].now);
1551 ret = bch2_lru_set(trans,
1553 alloc_k.k->p.offset,
1558 if (a->io_time[READ] != read_time) {
1559 struct bkey_i_alloc_v4 *a_mut =
1560 bch2_alloc_to_v4_mut(trans, alloc_k);
1561 ret = PTR_ERR_OR_ZERO(a_mut);
1565 a_mut->v.io_time[READ] = read_time;
1566 ret = bch2_trans_update(trans, alloc_iter,
1567 &a_mut->k_i, BTREE_TRIGGER_NORUN);
1574 bch2_trans_iter_exit(trans, &lru_iter);
1575 printbuf_exit(&buf2);
1576 printbuf_exit(&buf);
1580 int bch2_check_alloc_to_lru_refs(struct bch_fs *c)
1582 struct btree_trans trans;
1583 struct btree_iter iter;
1587 bch2_trans_init(&trans, c, 0, 0);
1589 for_each_btree_key_commit(&trans, iter, BTREE_ID_alloc,
1590 POS_MIN, BTREE_ITER_PREFETCH, k,
1591 NULL, NULL, BTREE_INSERT_NOFAIL|BTREE_INSERT_LAZY_RW,
1592 bch2_check_alloc_to_lru_ref(&trans, &iter));
1594 bch2_trans_exit(&trans);
1595 return ret < 0 ? ret : 0;
1598 static int bch2_discard_one_bucket(struct btree_trans *trans,
1599 struct btree_iter *need_discard_iter,
1600 struct bpos *discard_pos_done,
1603 u64 *need_journal_commit,
1606 struct bch_fs *c = trans->c;
1607 struct bpos pos = need_discard_iter->pos;
1608 struct btree_iter iter = { NULL };
1611 struct bkey_i_alloc_v4 *a;
1612 struct printbuf buf = PRINTBUF;
1613 bool did_discard = false;
1616 ca = bch_dev_bkey_exists(c, pos.inode);
1617 if (!percpu_ref_tryget(&ca->io_ref)) {
1618 bch2_btree_iter_set_pos(need_discard_iter, POS(pos.inode + 1, 0));
1622 if (bch2_bucket_is_open_safe(c, pos.inode, pos.offset)) {
1627 if (bch2_bucket_needs_journal_commit(&c->buckets_waiting_for_journal,
1628 c->journal.flushed_seq_ondisk,
1629 pos.inode, pos.offset)) {
1630 (*need_journal_commit)++;
1634 bch2_trans_iter_init(trans, &iter, BTREE_ID_alloc,
1635 need_discard_iter->pos,
1637 k = bch2_btree_iter_peek_slot(&iter);
1642 a = bch2_alloc_to_v4_mut(trans, k);
1643 ret = PTR_ERR_OR_ZERO(a);
1647 if (BCH_ALLOC_V4_NEED_INC_GEN(&a->v)) {
1649 SET_BCH_ALLOC_V4_NEED_INC_GEN(&a->v, false);
1653 if (a->v.journal_seq > c->journal.flushed_seq_ondisk) {
1654 if (test_bit(BCH_FS_CHECK_ALLOC_DONE, &c->flags)) {
1655 bch2_trans_inconsistent(trans,
1656 "clearing need_discard but journal_seq %llu > flushed_seq %llu\n"
1659 c->journal.flushed_seq_ondisk,
1660 (bch2_bkey_val_to_text(&buf, c, k), buf.buf));
1666 if (a->v.data_type != BCH_DATA_need_discard) {
1667 if (test_bit(BCH_FS_CHECK_ALLOC_DONE, &c->flags)) {
1668 bch2_trans_inconsistent(trans,
1669 "bucket incorrectly set in need_discard btree\n"
1671 (bch2_bkey_val_to_text(&buf, c, k), buf.buf));
1678 if (!bkey_eq(*discard_pos_done, iter.pos) &&
1679 ca->mi.discard && !c->opts.nochanges) {
1681 * This works without any other locks because this is the only
1682 * thread that removes items from the need_discard tree
1684 bch2_trans_unlock(trans);
1685 blkdev_issue_discard(ca->disk_sb.bdev,
1686 k.k->p.offset * ca->mi.bucket_size,
1690 ret = bch2_trans_relock(trans);
1695 *discard_pos_done = iter.pos;
1698 SET_BCH_ALLOC_V4_NEED_DISCARD(&a->v, false);
1699 a->v.data_type = alloc_data_type(a->v, a->v.data_type);
1701 ret = bch2_trans_update(trans, &iter, &a->k_i, 0) ?:
1702 bch2_trans_commit(trans, NULL, NULL,
1703 BTREE_INSERT_USE_RESERVE|BTREE_INSERT_NOFAIL);
1708 this_cpu_inc(c->counters[BCH_COUNTER_bucket_discard]);
1712 bch2_trans_iter_exit(trans, &iter);
1713 percpu_ref_put(&ca->io_ref);
1714 printbuf_exit(&buf);
1718 static void bch2_do_discards_work(struct work_struct *work)
1720 struct bch_fs *c = container_of(work, struct bch_fs, discard_work);
1721 struct btree_trans trans;
1722 struct btree_iter iter;
1724 u64 seen = 0, open = 0, need_journal_commit = 0, discarded = 0;
1725 struct bpos discard_pos_done = POS_MAX;
1728 bch2_trans_init(&trans, c, 0, 0);
1731 * We're doing the commit in bch2_discard_one_bucket instead of using
1732 * for_each_btree_key_commit() so that we can increment counters after
1733 * successful commit:
1735 ret = for_each_btree_key2(&trans, iter,
1736 BTREE_ID_need_discard, POS_MIN, 0, k,
1737 bch2_discard_one_bucket(&trans, &iter, &discard_pos_done,
1740 &need_journal_commit,
1743 bch2_trans_exit(&trans);
1745 if (need_journal_commit * 2 > seen)
1746 bch2_journal_flush_async(&c->journal, NULL);
1748 percpu_ref_put(&c->writes);
1750 trace_discard_buckets(c, seen, open, need_journal_commit, discarded,
1754 void bch2_do_discards(struct bch_fs *c)
1756 if (percpu_ref_tryget_live(&c->writes) &&
1757 !queue_work(system_long_wq, &c->discard_work))
1758 percpu_ref_put(&c->writes);
1761 static int invalidate_one_bucket(struct btree_trans *trans,
1762 struct btree_iter *lru_iter, struct bkey_s_c k,
1763 unsigned dev_idx, s64 *nr_to_invalidate)
1765 struct bch_fs *c = trans->c;
1766 struct btree_iter alloc_iter = { NULL };
1767 struct bkey_i_alloc_v4 *a;
1769 struct printbuf buf = PRINTBUF;
1770 unsigned cached_sectors;
1773 if (*nr_to_invalidate <= 0 || k.k->p.inode != dev_idx)
1776 if (k.k->type != KEY_TYPE_lru) {
1777 prt_printf(&buf, "non lru key in lru btree:\n ");
1778 bch2_bkey_val_to_text(&buf, c, k);
1780 if (!test_bit(BCH_FS_CHECK_LRUS_DONE, &c->flags)) {
1781 bch_err(c, "%s", buf.buf);
1783 bch2_trans_inconsistent(trans, "%s", buf.buf);
1790 bucket = POS(dev_idx, le64_to_cpu(bkey_s_c_to_lru(k).v->idx));
1792 a = bch2_trans_start_alloc_update(trans, &alloc_iter, bucket);
1793 ret = PTR_ERR_OR_ZERO(a);
1797 if (k.k->p.offset != alloc_lru_idx(a->v)) {
1798 prt_printf(&buf, "alloc key does not point back to lru entry when invalidating bucket:\n ");
1799 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&a->k_i));
1800 prt_printf(&buf, "\n ");
1801 bch2_bkey_val_to_text(&buf, c, k);
1803 if (!test_bit(BCH_FS_CHECK_LRUS_DONE, &c->flags)) {
1804 bch_err(c, "%s", buf.buf);
1806 bch2_trans_inconsistent(trans, "%s", buf.buf);
1813 if (!a->v.cached_sectors)
1814 bch_err(c, "invalidating empty bucket, confused");
1816 cached_sectors = a->v.cached_sectors;
1818 SET_BCH_ALLOC_V4_NEED_INC_GEN(&a->v, false);
1821 a->v.dirty_sectors = 0;
1822 a->v.cached_sectors = 0;
1823 a->v.io_time[READ] = atomic64_read(&c->io_clock[READ].now);
1824 a->v.io_time[WRITE] = atomic64_read(&c->io_clock[WRITE].now);
1826 ret = bch2_trans_update(trans, &alloc_iter, &a->k_i,
1827 BTREE_TRIGGER_BUCKET_INVALIDATE) ?:
1828 bch2_trans_commit(trans, NULL, NULL,
1829 BTREE_INSERT_USE_RESERVE|BTREE_INSERT_NOFAIL);
1833 trace_and_count(c, bucket_invalidate, c, bucket.inode, bucket.offset, cached_sectors);
1834 --*nr_to_invalidate;
1836 bch2_trans_iter_exit(trans, &alloc_iter);
1837 printbuf_exit(&buf);
1841 static void bch2_do_invalidates_work(struct work_struct *work)
1843 struct bch_fs *c = container_of(work, struct bch_fs, invalidate_work);
1845 struct btree_trans trans;
1846 struct btree_iter iter;
1851 bch2_trans_init(&trans, c, 0, 0);
1853 for_each_member_device(ca, c, i) {
1854 s64 nr_to_invalidate =
1855 should_invalidate_buckets(ca, bch2_dev_usage_read(ca));
1857 ret = for_each_btree_key2(&trans, iter, BTREE_ID_lru,
1858 POS(ca->dev_idx, 0), BTREE_ITER_INTENT, k,
1859 invalidate_one_bucket(&trans, &iter, k, ca->dev_idx, &nr_to_invalidate));
1862 percpu_ref_put(&ca->ref);
1867 bch2_trans_exit(&trans);
1868 percpu_ref_put(&c->writes);
1871 void bch2_do_invalidates(struct bch_fs *c)
1873 if (percpu_ref_tryget_live(&c->writes) &&
1874 !queue_work(system_long_wq, &c->invalidate_work))
1875 percpu_ref_put(&c->writes);
1878 static int bch2_dev_freespace_init(struct bch_fs *c, struct bch_dev *ca)
1880 struct btree_trans trans;
1881 struct btree_iter iter;
1884 struct bpos end = POS(ca->dev_idx, ca->mi.nbuckets);
1885 struct bch_member *m;
1888 bch2_trans_init(&trans, c, 0, 0);
1890 bch2_trans_iter_init(&trans, &iter, BTREE_ID_alloc,
1891 POS(ca->dev_idx, ca->mi.first_bucket),
1892 BTREE_ITER_PREFETCH);
1894 * Scan the alloc btree for every bucket on @ca, and add buckets to the
1895 * freespace/need_discard/need_gc_gens btrees as needed:
1898 bch2_trans_begin(&trans);
1900 if (bkey_ge(iter.pos, end)) {
1905 k = bch2_get_key_or_hole(&iter, end, &hole);
1912 * We process live keys in the alloc btree one at a
1915 struct bch_alloc_v4 a_convert;
1916 const struct bch_alloc_v4 *a = bch2_alloc_to_v4(k, &a_convert);
1918 ret = bch2_bucket_do_index(&trans, k, a, true) ?:
1919 bch2_trans_commit(&trans, NULL, NULL,
1920 BTREE_INSERT_LAZY_RW|
1921 BTREE_INSERT_NOFAIL);
1925 bch2_btree_iter_advance(&iter);
1927 struct bkey_i *freespace;
1929 freespace = bch2_trans_kmalloc(&trans, sizeof(*freespace));
1930 ret = PTR_ERR_OR_ZERO(freespace);
1934 bkey_init(&freespace->k);
1935 freespace->k.type = KEY_TYPE_set;
1936 freespace->k.p = k.k->p;
1937 freespace->k.size = k.k->size;
1939 ret = __bch2_btree_insert(&trans, BTREE_ID_freespace, freespace) ?:
1940 bch2_trans_commit(&trans, NULL, NULL,
1941 BTREE_INSERT_LAZY_RW|
1942 BTREE_INSERT_NOFAIL);
1946 bch2_btree_iter_set_pos(&iter, k.k->p);
1949 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
1955 bch2_trans_iter_exit(&trans, &iter);
1956 bch2_trans_exit(&trans);
1959 bch_err(ca, "error initializing free space: %s", bch2_err_str(ret));
1963 mutex_lock(&c->sb_lock);
1964 m = bch2_sb_get_members(c->disk_sb.sb)->members + ca->dev_idx;
1965 SET_BCH_MEMBER_FREESPACE_INITIALIZED(m, true);
1966 mutex_unlock(&c->sb_lock);
1971 int bch2_fs_freespace_init(struct bch_fs *c)
1976 bool doing_init = false;
1979 * We can crash during the device add path, so we need to check this on
1983 for_each_member_device(ca, c, i) {
1984 if (ca->mi.freespace_initialized)
1988 bch_info(c, "initializing freespace");
1992 ret = bch2_dev_freespace_init(c, ca);
1994 percpu_ref_put(&ca->ref);
2000 mutex_lock(&c->sb_lock);
2001 bch2_write_super(c);
2002 mutex_unlock(&c->sb_lock);
2004 bch_verbose(c, "done initializing freespace");
2010 /* Bucket IO clocks: */
2012 int bch2_bucket_io_time_reset(struct btree_trans *trans, unsigned dev,
2013 size_t bucket_nr, int rw)
2015 struct bch_fs *c = trans->c;
2016 struct btree_iter iter;
2017 struct bkey_i_alloc_v4 *a;
2021 a = bch2_trans_start_alloc_update(trans, &iter, POS(dev, bucket_nr));
2022 ret = PTR_ERR_OR_ZERO(a);
2026 now = atomic64_read(&c->io_clock[rw].now);
2027 if (a->v.io_time[rw] == now)
2030 a->v.io_time[rw] = now;
2032 ret = bch2_trans_update(trans, &iter, &a->k_i, 0) ?:
2033 bch2_trans_commit(trans, NULL, NULL, 0);
2035 bch2_trans_iter_exit(trans, &iter);
2039 /* Startup/shutdown (ro/rw): */
2041 void bch2_recalc_capacity(struct bch_fs *c)
2044 u64 capacity = 0, reserved_sectors = 0, gc_reserve;
2045 unsigned bucket_size_max = 0;
2046 unsigned long ra_pages = 0;
2049 lockdep_assert_held(&c->state_lock);
2051 for_each_online_member(ca, c, i) {
2052 struct backing_dev_info *bdi = ca->disk_sb.bdev->bd_disk->bdi;
2054 ra_pages += bdi->ra_pages;
2057 bch2_set_ra_pages(c, ra_pages);
2059 for_each_rw_member(ca, c, i) {
2060 u64 dev_reserve = 0;
2063 * We need to reserve buckets (from the number
2064 * of currently available buckets) against
2065 * foreground writes so that mainly copygc can
2066 * make forward progress.
2068 * We need enough to refill the various reserves
2069 * from scratch - copygc will use its entire
2070 * reserve all at once, then run against when
2071 * its reserve is refilled (from the formerly
2072 * available buckets).
2074 * This reserve is just used when considering if
2075 * allocations for foreground writes must wait -
2076 * not -ENOSPC calculations.
2079 dev_reserve += ca->nr_btree_reserve * 2;
2080 dev_reserve += ca->mi.nbuckets >> 6; /* copygc reserve */
2082 dev_reserve += 1; /* btree write point */
2083 dev_reserve += 1; /* copygc write point */
2084 dev_reserve += 1; /* rebalance write point */
2086 dev_reserve *= ca->mi.bucket_size;
2088 capacity += bucket_to_sector(ca, ca->mi.nbuckets -
2089 ca->mi.first_bucket);
2091 reserved_sectors += dev_reserve * 2;
2093 bucket_size_max = max_t(unsigned, bucket_size_max,
2094 ca->mi.bucket_size);
2097 gc_reserve = c->opts.gc_reserve_bytes
2098 ? c->opts.gc_reserve_bytes >> 9
2099 : div64_u64(capacity * c->opts.gc_reserve_percent, 100);
2101 reserved_sectors = max(gc_reserve, reserved_sectors);
2103 reserved_sectors = min(reserved_sectors, capacity);
2105 c->capacity = capacity - reserved_sectors;
2107 c->bucket_size_max = bucket_size_max;
2109 /* Wake up case someone was waiting for buckets */
2110 closure_wake_up(&c->freelist_wait);
2113 static bool bch2_dev_has_open_write_point(struct bch_fs *c, struct bch_dev *ca)
2115 struct open_bucket *ob;
2118 for (ob = c->open_buckets;
2119 ob < c->open_buckets + ARRAY_SIZE(c->open_buckets);
2121 spin_lock(&ob->lock);
2122 if (ob->valid && !ob->on_partial_list &&
2123 ob->dev == ca->dev_idx)
2125 spin_unlock(&ob->lock);
2131 /* device goes ro: */
2132 void bch2_dev_allocator_remove(struct bch_fs *c, struct bch_dev *ca)
2136 /* First, remove device from allocation groups: */
2138 for (i = 0; i < ARRAY_SIZE(c->rw_devs); i++)
2139 clear_bit(ca->dev_idx, c->rw_devs[i].d);
2142 * Capacity is calculated based off of devices in allocation groups:
2144 bch2_recalc_capacity(c);
2146 /* Next, close write points that point to this device... */
2147 for (i = 0; i < ARRAY_SIZE(c->write_points); i++)
2148 bch2_writepoint_stop(c, ca, &c->write_points[i]);
2150 bch2_writepoint_stop(c, ca, &c->copygc_write_point);
2151 bch2_writepoint_stop(c, ca, &c->rebalance_write_point);
2152 bch2_writepoint_stop(c, ca, &c->btree_write_point);
2154 mutex_lock(&c->btree_reserve_cache_lock);
2155 while (c->btree_reserve_cache_nr) {
2156 struct btree_alloc *a =
2157 &c->btree_reserve_cache[--c->btree_reserve_cache_nr];
2159 bch2_open_buckets_put(c, &a->ob);
2161 mutex_unlock(&c->btree_reserve_cache_lock);
2164 struct open_bucket *ob;
2166 spin_lock(&c->freelist_lock);
2167 if (!ca->open_buckets_partial_nr) {
2168 spin_unlock(&c->freelist_lock);
2171 ob = c->open_buckets +
2172 ca->open_buckets_partial[--ca->open_buckets_partial_nr];
2173 ob->on_partial_list = false;
2174 spin_unlock(&c->freelist_lock);
2176 bch2_open_bucket_put(c, ob);
2179 bch2_ec_stop_dev(c, ca);
2182 * Wake up threads that were blocked on allocation, so they can notice
2183 * the device can no longer be removed and the capacity has changed:
2185 closure_wake_up(&c->freelist_wait);
2188 * journal_res_get() can block waiting for free space in the journal -
2189 * it needs to notice there may not be devices to allocate from anymore:
2191 wake_up(&c->journal.wait);
2193 /* Now wait for any in flight writes: */
2195 closure_wait_event(&c->open_buckets_wait,
2196 !bch2_dev_has_open_write_point(c, ca));
2199 /* device goes rw: */
2200 void bch2_dev_allocator_add(struct bch_fs *c, struct bch_dev *ca)
2204 for (i = 0; i < ARRAY_SIZE(c->rw_devs); i++)
2205 if (ca->mi.data_allowed & (1 << i))
2206 set_bit(ca->dev_idx, c->rw_devs[i].d);
2209 void bch2_fs_allocator_background_init(struct bch_fs *c)
2211 spin_lock_init(&c->freelist_lock);
2212 INIT_WORK(&c->discard_work, bch2_do_discards_work);
2213 INIT_WORK(&c->invalidate_work, bch2_do_invalidates_work);