1 // SPDX-License-Identifier: GPL-2.0
4 #include "alloc_background.h"
5 #include "btree_iter.h"
6 #include "btree_update.h"
11 /* KEY_TYPE_lru is obsolete: */
12 int bch2_lru_invalid(const struct bch_fs *c, struct bkey_s_c k,
13 int rw, struct printbuf *err)
15 const struct bch_lru *lru = bkey_s_c_to_lru(k).v;
17 if (bkey_val_bytes(k.k) < sizeof(*lru)) {
18 prt_printf(err, "incorrect value size (%zu < %zu)",
19 bkey_val_bytes(k.k), sizeof(*lru));
20 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 static int __bch2_lru_set(struct btree_trans *trans, u16 lru_id,
35 u64 dev_bucket, u64 time, unsigned key_type)
37 struct btree_iter iter;
44 k = bch2_trans_kmalloc_nomemzero(trans, sizeof(*k));
45 ret = PTR_ERR_OR_ZERO(k);
51 k->k.p = lru_pos(lru_id, dev_bucket, time);
53 EBUG_ON(lru_pos_id(k->k.p) != lru_id);
54 EBUG_ON(lru_pos_time(k->k.p) != time);
55 EBUG_ON(k->k.p.offset != dev_bucket);
57 bch2_trans_iter_init(trans, &iter, BTREE_ID_lru,
58 k->k.p, BTREE_ITER_INTENT);
60 ret = bch2_btree_iter_traverse(&iter) ?:
61 bch2_trans_update(trans, &iter, k, 0);
62 bch2_trans_iter_exit(trans, &iter);
66 int bch2_lru_del(struct btree_trans *trans, u16 lru_id, u64 dev_bucket, u64 time)
68 return __bch2_lru_set(trans, lru_id, dev_bucket, time, KEY_TYPE_deleted);
71 int bch2_lru_set(struct btree_trans *trans, u16 lru_id, u64 dev_bucket, u64 time)
73 return __bch2_lru_set(trans, lru_id, dev_bucket, time, KEY_TYPE_set);
76 int bch2_lru_change(struct btree_trans *trans,
77 u16 lru_id, u64 dev_bucket,
78 u64 old_time, u64 new_time)
80 if (old_time == new_time)
83 return bch2_lru_del(trans, lru_id, dev_bucket, old_time) ?:
84 bch2_lru_set(trans, lru_id, dev_bucket, new_time);
87 static int bch2_check_lru_key(struct btree_trans *trans,
88 struct btree_iter *lru_iter,
89 struct bkey_s_c lru_k)
91 struct bch_fs *c = trans->c;
92 struct btree_iter iter;
94 struct bch_alloc_v4 a_convert;
95 const struct bch_alloc_v4 *a;
96 struct printbuf buf1 = PRINTBUF;
97 struct printbuf buf2 = PRINTBUF;
98 struct bpos alloc_pos = u64_to_bucket(lru_k.k->p.offset);
101 if (fsck_err_on(!bch2_dev_bucket_exists(c, alloc_pos), c,
102 "lru key points to nonexistent device:bucket %llu:%llu",
103 alloc_pos.inode, alloc_pos.offset))
104 return bch2_btree_delete_at(trans, lru_iter, 0);
106 bch2_trans_iter_init(trans, &iter, BTREE_ID_alloc, alloc_pos, 0);
107 k = bch2_btree_iter_peek_slot(&iter);
112 a = bch2_alloc_to_v4(k, &a_convert);
114 if (fsck_err_on(lru_k.k->type != KEY_TYPE_set ||
115 a->data_type != BCH_DATA_cached ||
116 a->io_time[READ] != lru_pos_time(lru_k.k->p), c,
117 "incorrect lru entry (time %llu) %s\n"
119 lru_pos_time(lru_k.k->p),
120 (bch2_bkey_val_to_text(&buf1, c, lru_k), buf1.buf),
121 (bch2_bkey_val_to_text(&buf2, c, k), buf2.buf))) {
122 ret = bch2_btree_delete_at(trans, lru_iter, 0);
128 bch2_trans_iter_exit(trans, &iter);
129 printbuf_exit(&buf2);
130 printbuf_exit(&buf1);
134 int bch2_check_lrus(struct bch_fs *c)
136 struct btree_trans trans;
137 struct btree_iter iter;
141 bch2_trans_init(&trans, c, 0, 0);
143 ret = for_each_btree_key_commit(&trans, iter,
144 BTREE_ID_lru, POS_MIN, BTREE_ITER_PREFETCH, k,
145 NULL, NULL, BTREE_INSERT_NOFAIL|BTREE_INSERT_LAZY_RW,
146 bch2_check_lru_key(&trans, &iter, k));
148 bch2_trans_exit(&trans);