1 // SPDX-License-Identifier: GPL-2.0
4 #include "alloc_background.h"
5 #include "btree_iter.h"
6 #include "btree_update.h"
11 int bch2_lru_invalid(const struct bch_fs *c, struct bkey_s_c k,
12 int rw, struct printbuf *err)
14 const struct bch_lru *lru = bkey_s_c_to_lru(k).v;
16 if (bkey_val_bytes(k.k) < sizeof(*lru)) {
17 pr_buf(err, "incorrect value size (%zu < %zu)",
18 bkey_val_bytes(k.k), sizeof(*lru));
25 void bch2_lru_to_text(struct printbuf *out, struct bch_fs *c,
28 const struct bch_lru *lru = bkey_s_c_to_lru(k).v;
30 pr_buf(out, "idx %llu", le64_to_cpu(lru->idx));
33 int bch2_lru_delete(struct btree_trans *trans, u64 id, u64 idx, u64 time,
34 struct bkey_s_c orig_k)
36 struct btree_iter iter;
39 struct printbuf buf = PRINTBUF;
45 bch2_trans_iter_init(trans, &iter, BTREE_ID_lru,
48 BTREE_ITER_WITH_UPDATES);
49 k = bch2_btree_iter_peek_slot(&iter);
54 if (k.k->type != KEY_TYPE_lru) {
55 bch2_bkey_val_to_text(&buf, trans->c, orig_k);
56 bch2_trans_inconsistent(trans,
57 "pointer to nonexistent lru %llu:%llu\n%s",
63 existing_idx = le64_to_cpu(bkey_s_c_to_lru(k).v->idx);
64 if (existing_idx != idx) {
65 bch2_bkey_val_to_text(&buf, trans->c, orig_k);
66 bch2_trans_inconsistent(trans,
67 "lru %llu:%llu with wrong backpointer: got %llu, should be %llu\n%s",
68 id, time, existing_idx, idx, buf.buf);
73 ret = bch2_btree_delete_at(trans, &iter, 0);
75 bch2_trans_iter_exit(trans, &iter);
80 int bch2_lru_set(struct btree_trans *trans, u64 lru_id, u64 idx, u64 *time)
82 struct btree_iter iter;
84 struct bkey_i_lru *lru;
90 for_each_btree_key_norestart(trans, iter, BTREE_ID_lru,
94 BTREE_ITER_WITH_UPDATES, k, ret)
95 if (bkey_deleted(k.k))
101 BUG_ON(iter.pos.inode != lru_id);
102 *time = iter.pos.offset;
104 lru = bch2_trans_kmalloc(trans, sizeof(*lru));
105 ret = PTR_ERR_OR_ZERO(lru);
109 bkey_lru_init(&lru->k_i);
111 lru->v.idx = cpu_to_le64(idx);
113 ret = bch2_trans_update(trans, &iter, &lru->k_i, 0);
117 bch2_trans_iter_exit(trans, &iter);
121 int bch2_lru_change(struct btree_trans *trans, u64 id, u64 idx,
122 u64 old_time, u64 *new_time,
125 if (old_time == *new_time)
128 return bch2_lru_delete(trans, id, idx, old_time, k) ?:
129 bch2_lru_set(trans, id, idx, new_time);
132 static int bch2_check_lru_key(struct btree_trans *trans,
133 struct btree_iter *lru_iter, bool initial)
135 struct bch_fs *c = trans->c;
136 struct btree_iter iter;
137 struct bkey_s_c lru_k, k;
138 struct bch_alloc_v4 a;
139 struct printbuf buf1 = PRINTBUF;
140 struct printbuf buf2 = PRINTBUF;
141 struct bpos alloc_pos;
144 lru_k = bch2_btree_iter_peek(lru_iter);
148 ret = bkey_err(lru_k);
152 alloc_pos = POS(lru_k.k->p.inode,
153 le64_to_cpu(bkey_s_c_to_lru(lru_k).v->idx));
155 if (fsck_err_on(!bch2_dev_bucket_exists(c, alloc_pos), c,
156 "lru key points to nonexistent device:bucket %llu:%llu",
157 alloc_pos.inode, alloc_pos.offset))
158 return bch2_btree_delete_at(trans, lru_iter, 0);
160 bch2_trans_iter_init(trans, &iter, BTREE_ID_alloc, alloc_pos, 0);
161 k = bch2_btree_iter_peek_slot(&iter);
166 bch2_alloc_to_v4(k, &a);
168 if (fsck_err_on(a.data_type != BCH_DATA_cached ||
169 a.io_time[READ] != lru_k.k->p.offset, c,
170 "incorrect lru entry %s\n"
172 (bch2_bkey_val_to_text(&buf1, c, lru_k), buf1.buf),
173 (bch2_bkey_val_to_text(&buf2, c, k), buf2.buf))) {
174 struct bkey_i *update =
175 bch2_trans_kmalloc(trans, sizeof(*update));
177 ret = PTR_ERR_OR_ZERO(update);
181 bkey_init(&update->k);
182 update->k.p = lru_iter->pos;
184 ret = bch2_trans_update(trans, lru_iter, update, 0);
190 bch2_trans_iter_exit(trans, &iter);
191 printbuf_exit(&buf2);
192 printbuf_exit(&buf1);
196 int bch2_check_lrus(struct bch_fs *c, bool initial)
198 struct btree_trans trans;
199 struct btree_iter iter;
203 bch2_trans_init(&trans, c, 0, 0);
205 for_each_btree_key(&trans, iter, BTREE_ID_lru, POS_MIN,
206 BTREE_ITER_PREFETCH, k, ret) {
207 ret = __bch2_trans_do(&trans, NULL, NULL, 0,
208 bch2_check_lru_key(&trans, &iter, initial));
212 bch2_trans_iter_exit(&trans, &iter);
214 bch2_trans_exit(&trans);