1// SPDX-License-Identifier: GPL-2.0
2
3#include "bcachefs.h"
4#include "alloc_background.h"
5#include "btree_iter.h"
6#include "btree_update.h"
7#include "btree_write_buffer.h"
8#include "error.h"
9#include "lru.h"
10#include "recovery.h"
11
12/* KEY_TYPE_lru is obsolete: */
13int bch2_lru_invalid(struct bch_fs *c, struct bkey_s_c k,
14		     enum bkey_invalid_flags flags,
15		     struct printbuf *err)
16{
17	int ret = 0;
18
19	bkey_fsck_err_on(!lru_pos_time(k.k->p), c, err,
20			 lru_entry_at_time_0,
21			 "lru entry at time=0");
22fsck_err:
23	return ret;
24}
25
26void bch2_lru_to_text(struct printbuf *out, struct bch_fs *c,
27		      struct bkey_s_c k)
28{
29	const struct bch_lru *lru = bkey_s_c_to_lru(k).v;
30
31	prt_printf(out, "idx %llu", le64_to_cpu(lru->idx));
32}
33
34void bch2_lru_pos_to_text(struct printbuf *out, struct bpos lru)
35{
36	prt_printf(out, "%llu:%llu -> %llu:%llu",
37		   lru_pos_id(lru),
38		   lru_pos_time(lru),
39		   u64_to_bucket(lru.offset).inode,
40		   u64_to_bucket(lru.offset).offset);
41}
42
43static int __bch2_lru_set(struct btree_trans *trans, u16 lru_id,
44			  u64 dev_bucket, u64 time, bool set)
45{
46	return time
47		? bch2_btree_bit_mod_buffered(trans, BTREE_ID_lru,
48					      lru_pos(lru_id, dev_bucket, time), set)
49		: 0;
50}
51
52int bch2_lru_del(struct btree_trans *trans, u16 lru_id, u64 dev_bucket, u64 time)
53{
54	return __bch2_lru_set(trans, lru_id, dev_bucket, time, KEY_TYPE_deleted);
55}
56
57int bch2_lru_set(struct btree_trans *trans, u16 lru_id, u64 dev_bucket, u64 time)
58{
59	return __bch2_lru_set(trans, lru_id, dev_bucket, time, KEY_TYPE_set);
60}
61
62int bch2_lru_change(struct btree_trans *trans,
63		    u16 lru_id, u64 dev_bucket,
64		    u64 old_time, u64 new_time)
65{
66	if (old_time == new_time)
67		return 0;
68
69	return  bch2_lru_del(trans, lru_id, dev_bucket, old_time) ?:
70		bch2_lru_set(trans, lru_id, dev_bucket, new_time);
71}
72
73static const char * const bch2_lru_types[] = {
74#define x(n) #n,
75	BCH_LRU_TYPES()
76#undef x
77	NULL
78};
79
80static int bch2_check_lru_key(struct btree_trans *trans,
81			      struct btree_iter *lru_iter,
82			      struct bkey_s_c lru_k,
83			      struct bpos *last_flushed_pos)
84{
85	struct bch_fs *c = trans->c;
86	struct btree_iter iter;
87	struct bkey_s_c k;
88	struct bch_alloc_v4 a_convert;
89	const struct bch_alloc_v4 *a;
90	struct printbuf buf1 = PRINTBUF;
91	struct printbuf buf2 = PRINTBUF;
92	enum bch_lru_type type = lru_type(lru_k);
93	struct bpos alloc_pos = u64_to_bucket(lru_k.k->p.offset);
94	u64 idx;
95	int ret;
96
97	if (fsck_err_on(!bch2_dev_bucket_exists(c, alloc_pos), c,
98			lru_entry_to_invalid_bucket,
99			"lru key points to nonexistent device:bucket %llu:%llu",
100			alloc_pos.inode, alloc_pos.offset))
101		return bch2_btree_delete_at(trans, lru_iter, 0);
102
103	k = bch2_bkey_get_iter(trans, &iter, BTREE_ID_alloc, alloc_pos, 0);
104	ret = bkey_err(k);
105	if (ret)
106		goto err;
107
108	a = bch2_alloc_to_v4(k, &a_convert);
109
110	switch (type) {
111	case BCH_LRU_read:
112		idx = alloc_lru_idx_read(*a);
113		break;
114	case BCH_LRU_fragmentation:
115		idx = a->fragmentation_lru;
116		break;
117	}
118
119	if (lru_k.k->type != KEY_TYPE_set ||
120	    lru_pos_time(lru_k.k->p) != idx) {
121		if (!bpos_eq(*last_flushed_pos, lru_k.k->p)) {
122			*last_flushed_pos = lru_k.k->p;
123			ret = bch2_btree_write_buffer_flush_sync(trans) ?:
124				-BCH_ERR_transaction_restart_write_buffer_flush;
125			goto out;
126		}
127
128		if (fsck_err(c, lru_entry_bad,
129			     "incorrect lru entry: lru %s time %llu\n"
130			     "  %s\n"
131			     "  for %s",
132			     bch2_lru_types[type],
133			     lru_pos_time(lru_k.k->p),
134			     (bch2_bkey_val_to_text(&buf1, c, lru_k), buf1.buf),
135			     (bch2_bkey_val_to_text(&buf2, c, k), buf2.buf)))
136			ret = bch2_btree_delete_at(trans, lru_iter, 0);
137	}
138out:
139err:
140fsck_err:
141	bch2_trans_iter_exit(trans, &iter);
142	printbuf_exit(&buf2);
143	printbuf_exit(&buf1);
144	return ret;
145}
146
147int bch2_check_lrus(struct bch_fs *c)
148{
149	struct bpos last_flushed_pos = POS_MIN;
150	int ret = bch2_trans_run(c,
151		for_each_btree_key_commit(trans, iter,
152				BTREE_ID_lru, POS_MIN, BTREE_ITER_PREFETCH, k,
153				NULL, NULL, BCH_TRANS_COMMIT_no_enospc|BCH_TRANS_COMMIT_lazy_rw,
154			bch2_check_lru_key(trans, &iter, k, &last_flushed_pos)));
155	bch_err_fn(c, ret);
156	return ret;
157
158}
159