at for-next 1.5 kB view raw
1/* SPDX-License-Identifier: GPL-2.0 */ 2#ifndef _BCACHEFS_LRU_H 3#define _BCACHEFS_LRU_H 4 5static inline u64 lru_pos_id(struct bpos pos) 6{ 7 return pos.inode >> LRU_TIME_BITS; 8} 9 10static inline u64 lru_pos_time(struct bpos pos) 11{ 12 return pos.inode & ~(~0ULL << LRU_TIME_BITS); 13} 14 15static inline struct bpos lru_pos(u16 lru_id, u64 dev_bucket, u64 time) 16{ 17 struct bpos pos = POS(((u64) lru_id << LRU_TIME_BITS)|time, dev_bucket); 18 19 EBUG_ON(time > LRU_TIME_MAX); 20 EBUG_ON(lru_pos_id(pos) != lru_id); 21 EBUG_ON(lru_pos_time(pos) != time); 22 EBUG_ON(pos.offset != dev_bucket); 23 24 return pos; 25} 26 27static inline enum bch_lru_type lru_type(struct bkey_s_c l) 28{ 29 u16 lru_id = l.k->p.inode >> 48; 30 31 if (lru_id == BCH_LRU_FRAGMENTATION_START) 32 return BCH_LRU_fragmentation; 33 return BCH_LRU_read; 34} 35 36int bch2_lru_validate(struct bch_fs *, struct bkey_s_c, enum bch_validate_flags); 37void bch2_lru_to_text(struct printbuf *, struct bch_fs *, struct bkey_s_c); 38 39void bch2_lru_pos_to_text(struct printbuf *, struct bpos); 40 41#define bch2_bkey_ops_lru ((struct bkey_ops) { \ 42 .key_validate = bch2_lru_validate, \ 43 .val_to_text = bch2_lru_to_text, \ 44 .min_val_size = 8, \ 45}) 46 47int bch2_lru_del(struct btree_trans *, u16, u64, u64); 48int bch2_lru_set(struct btree_trans *, u16, u64, u64); 49int bch2_lru_change(struct btree_trans *, u16, u64, u64, u64); 50 51struct bkey_buf; 52int bch2_lru_check_set(struct btree_trans *, u16, u64, struct bkey_s_c, struct bkey_buf *); 53 54int bch2_check_lrus(struct bch_fs *); 55 56#endif /* _BCACHEFS_LRU_H */