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 unsigned flags, struct printbuf *err)
16 const struct bch_lru *lru = bkey_s_c_to_lru(k).v;
18 if (bkey_val_bytes(k.k) < sizeof(*lru)) {
19 prt_printf(err, "incorrect value size (%zu < %zu)",
20 bkey_val_bytes(k.k), sizeof(*lru));
21 return -BCH_ERR_invalid_bkey;
24 if (!lru_pos_time(k.k->p)) {
25 prt_printf(err, "lru entry at time=0");
26 return -BCH_ERR_invalid_bkey;
33 void bch2_lru_to_text(struct printbuf *out, struct bch_fs *c,
36 const struct bch_lru *lru = bkey_s_c_to_lru(k).v;
38 prt_printf(out, "idx %llu", le64_to_cpu(lru->idx));
41 void bch2_lru_pos_to_text(struct printbuf *out, struct bpos lru)
43 prt_printf(out, "%llu:%llu -> %llu:%llu",
46 u64_to_bucket(lru.offset).inode,
47 u64_to_bucket(lru.offset).offset);
50 static int __bch2_lru_set(struct btree_trans *trans, u16 lru_id,
51 u64 dev_bucket, u64 time, unsigned key_type)
59 k = bch2_trans_kmalloc_nomemzero(trans, sizeof(*k));
60 ret = PTR_ERR_OR_ZERO(k);
66 k->k.p = lru_pos(lru_id, dev_bucket, time);
68 EBUG_ON(lru_pos_id(k->k.p) != lru_id);
69 EBUG_ON(lru_pos_time(k->k.p) != time);
70 EBUG_ON(k->k.p.offset != dev_bucket);
72 return bch2_trans_update_buffered(trans, BTREE_ID_lru, k);
75 int bch2_lru_del(struct btree_trans *trans, u16 lru_id, u64 dev_bucket, u64 time)
77 return __bch2_lru_set(trans, lru_id, dev_bucket, time, KEY_TYPE_deleted);
80 int bch2_lru_set(struct btree_trans *trans, u16 lru_id, u64 dev_bucket, u64 time)
82 return __bch2_lru_set(trans, lru_id, dev_bucket, time, KEY_TYPE_set);
85 int bch2_lru_change(struct btree_trans *trans,
86 u16 lru_id, u64 dev_bucket,
87 u64 old_time, u64 new_time)
89 if (old_time == new_time)
92 return bch2_lru_del(trans, lru_id, dev_bucket, old_time) ?:
93 bch2_lru_set(trans, lru_id, dev_bucket, new_time);
96 static const char * const bch2_lru_types[] = {
103 static int bch2_check_lru_key(struct btree_trans *trans,
104 struct btree_iter *lru_iter,
105 struct bkey_s_c lru_k,
106 struct bpos *last_flushed_pos)
108 struct bch_fs *c = trans->c;
109 struct btree_iter iter;
111 struct bch_alloc_v4 a_convert;
112 const struct bch_alloc_v4 *a;
113 struct printbuf buf1 = PRINTBUF;
114 struct printbuf buf2 = PRINTBUF;
115 enum bch_lru_type type = lru_type(lru_k);
116 struct bpos alloc_pos = u64_to_bucket(lru_k.k->p.offset);
120 if (fsck_err_on(!bch2_dev_bucket_exists(c, alloc_pos), c,
121 "lru key points to nonexistent device:bucket %llu:%llu",
122 alloc_pos.inode, alloc_pos.offset))
123 return bch2_btree_delete_at(trans, lru_iter, 0);
125 bch2_trans_iter_init(trans, &iter, BTREE_ID_alloc, alloc_pos, 0);
126 k = bch2_btree_iter_peek_slot(&iter);
131 a = bch2_alloc_to_v4(k, &a_convert);
135 idx = alloc_lru_idx_read(*a);
137 case BCH_LRU_fragmentation:
138 idx = a->fragmentation_lru;
142 if (lru_k.k->type != KEY_TYPE_set ||
143 lru_pos_time(lru_k.k->p) != idx) {
144 if (!bpos_eq(*last_flushed_pos, lru_k.k->p)) {
145 *last_flushed_pos = lru_k.k->p;
146 ret = bch2_btree_write_buffer_flush_sync(trans) ?:
147 -BCH_ERR_transaction_restart_write_buffer_flush;
151 if (c->opts.reconstruct_alloc ||
152 fsck_err(c, "incorrect lru entry: lru %s time %llu\n"
155 bch2_lru_types[type],
156 lru_pos_time(lru_k.k->p),
157 (bch2_bkey_val_to_text(&buf1, c, lru_k), buf1.buf),
158 (bch2_bkey_val_to_text(&buf2, c, k), buf2.buf)))
159 ret = bch2_btree_delete_at(trans, lru_iter, 0);
164 bch2_trans_iter_exit(trans, &iter);
165 printbuf_exit(&buf2);
166 printbuf_exit(&buf1);
170 int bch2_check_lrus(struct bch_fs *c)
172 struct btree_trans trans;
173 struct btree_iter iter;
175 struct bpos last_flushed_pos = POS_MIN;
178 bch2_trans_init(&trans, c, 0, 0);
180 ret = for_each_btree_key_commit(&trans, iter,
181 BTREE_ID_lru, POS_MIN, BTREE_ITER_PREFETCH, k,
182 NULL, NULL, BTREE_INSERT_NOFAIL|BTREE_INSERT_LAZY_RW,
183 bch2_check_lru_key(&trans, &iter, k, &last_flushed_pos));
185 bch2_trans_exit(&trans);