1/* SPDX-License-Identifier: GPL-2.0 */
2#ifndef _BCACHEFS_LRU_H
3#define _BCACHEFS_LRU_H
4
5#define LRU_TIME_BITS	48
6#define LRU_TIME_MAX	((1ULL << LRU_TIME_BITS) - 1)
7
8static inline u64 lru_pos_id(struct bpos pos)
9{
10	return pos.inode >> LRU_TIME_BITS;
11}
12
13static inline u64 lru_pos_time(struct bpos pos)
14{
15	return pos.inode & ~(~0ULL << LRU_TIME_BITS);
16}
17
18static inline struct bpos lru_pos(u16 lru_id, u64 dev_bucket, u64 time)
19{
20	struct bpos pos = POS(((u64) lru_id << LRU_TIME_BITS)|time, dev_bucket);
21
22	EBUG_ON(time > LRU_TIME_MAX);
23	EBUG_ON(lru_pos_id(pos) != lru_id);
24	EBUG_ON(lru_pos_time(pos) != time);
25	EBUG_ON(pos.offset != dev_bucket);
26
27	return pos;
28}
29
30#define BCH_LRU_TYPES()		\
31	x(read)			\
32	x(fragmentation)
33
34enum bch_lru_type {
35#define x(n) BCH_LRU_##n,
36	BCH_LRU_TYPES()
37#undef x
38};
39
40#define BCH_LRU_FRAGMENTATION_START	((1U << 16) - 1)
41
42static inline enum bch_lru_type lru_type(struct bkey_s_c l)
43{
44	u16 lru_id = l.k->p.inode >> 48;
45
46	if (lru_id == BCH_LRU_FRAGMENTATION_START)
47		return BCH_LRU_fragmentation;
48	return BCH_LRU_read;
49}
50
51int bch2_lru_invalid(struct bch_fs *, struct bkey_s_c,
52		     enum bkey_invalid_flags, struct printbuf *);
53void bch2_lru_to_text(struct printbuf *, struct bch_fs *, struct bkey_s_c);
54
55void bch2_lru_pos_to_text(struct printbuf *, struct bpos);
56
57#define bch2_bkey_ops_lru ((struct bkey_ops) {	\
58	.key_invalid	= bch2_lru_invalid,	\
59	.val_to_text	= bch2_lru_to_text,	\
60	.min_val_size	= 8,			\
61})
62
63int bch2_lru_del(struct btree_trans *, u16, u64, u64);
64int bch2_lru_set(struct btree_trans *, u16, u64, u64);
65int bch2_lru_change(struct btree_trans *, u16, u64, u64, u64);
66
67int bch2_check_lrus(struct bch_fs *);
68
69#endif /* _BCACHEFS_LRU_H */
70