1 // SPDX-License-Identifier: GPL-2.0
4 #include "alloc_background.h"
5 #include "btree_iter.h"
6 #include "btree_update.h"
7 #include "btree_write_buffer.h"
12 /* KEY_TYPE_lru is obsolete: */
13 int bch2_lru_invalid(const struct bch_fs *c, struct bkey_s_c k,
14 enum bkey_invalid_flags flags,
17 if (!lru_pos_time(k.k->p)) {
18 prt_printf(err, "lru entry at time=0");
19 return -BCH_ERR_invalid_bkey;
26 void bch2_lru_to_text(struct printbuf *out, struct bch_fs *c,
29 const struct bch_lru *lru = bkey_s_c_to_lru(k).v;
31 prt_printf(out, "idx %llu", le64_to_cpu(lru->idx));
34 void bch2_lru_pos_to_text(struct printbuf *out, struct bpos lru)
36 prt_printf(out, "%llu:%llu -> %llu:%llu",
39 u64_to_bucket(lru.offset).inode,
40 u64_to_bucket(lru.offset).offset);
43 static int __bch2_lru_set(struct btree_trans *trans, u16 lru_id,
44 u64 dev_bucket, u64 time, unsigned key_type)
52 k = bch2_trans_kmalloc_nomemzero(trans, sizeof(*k));
53 ret = PTR_ERR_OR_ZERO(k);
59 k->k.p = lru_pos(lru_id, dev_bucket, time);
61 EBUG_ON(lru_pos_id(k->k.p) != lru_id);
62 EBUG_ON(lru_pos_time(k->k.p) != time);
63 EBUG_ON(k->k.p.offset != dev_bucket);
65 return bch2_trans_update_buffered(trans, BTREE_ID_lru, k);
68 int bch2_lru_del(struct btree_trans *trans, u16 lru_id, u64 dev_bucket, u64 time)
70 return __bch2_lru_set(trans, lru_id, dev_bucket, time, KEY_TYPE_deleted);
73 int bch2_lru_set(struct btree_trans *trans, u16 lru_id, u64 dev_bucket, u64 time)
75 return __bch2_lru_set(trans, lru_id, dev_bucket, time, KEY_TYPE_set);
78 int bch2_lru_change(struct btree_trans *trans,
79 u16 lru_id, u64 dev_bucket,
80 u64 old_time, u64 new_time)
82 if (old_time == new_time)
85 return bch2_lru_del(trans, lru_id, dev_bucket, old_time) ?:
86 bch2_lru_set(trans, lru_id, dev_bucket, new_time);
89 static const char * const bch2_lru_types[] = {
96 static int bch2_check_lru_key(struct btree_trans *trans,
97 struct btree_iter *lru_iter,
98 struct bkey_s_c lru_k,
99 struct bpos *last_flushed_pos)
101 struct bch_fs *c = trans->c;
102 struct btree_iter iter;
104 struct bch_alloc_v4 a_convert;
105 const struct bch_alloc_v4 *a;
106 struct printbuf buf1 = PRINTBUF;
107 struct printbuf buf2 = PRINTBUF;
108 enum bch_lru_type type = lru_type(lru_k);
109 struct bpos alloc_pos = u64_to_bucket(lru_k.k->p.offset);
113 if (fsck_err_on(!bch2_dev_bucket_exists(c, alloc_pos), c,
114 "lru key points to nonexistent device:bucket %llu:%llu",
115 alloc_pos.inode, alloc_pos.offset))
116 return bch2_btree_delete_at(trans, lru_iter, 0);
118 k = bch2_bkey_get_iter(trans, &iter, BTREE_ID_alloc, alloc_pos, 0);
123 a = bch2_alloc_to_v4(k, &a_convert);
127 idx = alloc_lru_idx_read(*a);
129 case BCH_LRU_fragmentation:
130 idx = a->fragmentation_lru;
134 if (lru_k.k->type != KEY_TYPE_set ||
135 lru_pos_time(lru_k.k->p) != idx) {
136 if (!bpos_eq(*last_flushed_pos, lru_k.k->p)) {
137 *last_flushed_pos = lru_k.k->p;
138 ret = bch2_btree_write_buffer_flush_sync(trans) ?:
139 -BCH_ERR_transaction_restart_write_buffer_flush;
143 if (c->opts.reconstruct_alloc ||
144 fsck_err(c, "incorrect lru entry: lru %s time %llu\n"
147 bch2_lru_types[type],
148 lru_pos_time(lru_k.k->p),
149 (bch2_bkey_val_to_text(&buf1, c, lru_k), buf1.buf),
150 (bch2_bkey_val_to_text(&buf2, c, k), buf2.buf)))
151 ret = bch2_btree_delete_at(trans, lru_iter, 0);
156 bch2_trans_iter_exit(trans, &iter);
157 printbuf_exit(&buf2);
158 printbuf_exit(&buf1);
162 int bch2_check_lrus(struct bch_fs *c)
164 struct btree_iter iter;
166 struct bpos last_flushed_pos = POS_MIN;
169 ret = bch2_trans_run(c,
170 for_each_btree_key_commit(&trans, iter,
171 BTREE_ID_lru, POS_MIN, BTREE_ITER_PREFETCH, k,
172 NULL, NULL, BTREE_INSERT_NOFAIL|BTREE_INSERT_LAZY_RW,
173 bch2_check_lru_key(&trans, &iter, k, &last_flushed_pos)));