1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef _BCACHEFS_BTREE_KEY_CACHE_H
3 #define _BCACHEFS_BTREE_KEY_CACHE_H
5 static inline size_t bch2_nr_btree_keys_need_flush(struct bch_fs *c)
7 size_t nr_dirty = atomic_long_read(&c->btree_key_cache.nr_dirty);
8 size_t nr_keys = atomic_long_read(&c->btree_key_cache.nr_keys);
9 size_t max_dirty = 1024 + nr_keys / 2;
11 return max_t(ssize_t, 0, nr_dirty - max_dirty);
14 static inline ssize_t __bch2_btree_key_cache_must_wait(struct bch_fs *c)
16 size_t nr_dirty = atomic_long_read(&c->btree_key_cache.nr_dirty);
17 size_t nr_keys = atomic_long_read(&c->btree_key_cache.nr_keys);
18 size_t max_dirty = 4096 + (nr_keys * 3) / 4;
20 return nr_dirty - max_dirty;
23 static inline bool bch2_btree_key_cache_must_wait(struct bch_fs *c)
25 return __bch2_btree_key_cache_must_wait(c) > 0;
28 static inline bool bch2_btree_key_cache_wait_done(struct bch_fs *c)
30 size_t nr_dirty = atomic_long_read(&c->btree_key_cache.nr_dirty);
31 size_t nr_keys = atomic_long_read(&c->btree_key_cache.nr_keys);
32 size_t max_dirty = 2048 + (nr_keys * 5) / 8;
34 return nr_dirty <= max_dirty;
37 int bch2_btree_key_cache_journal_flush(struct journal *,
38 struct journal_entry_pin *, u64);
41 bch2_btree_key_cache_find(struct bch_fs *, enum btree_id, struct bpos);
43 int bch2_btree_path_traverse_cached(struct btree_trans *, struct btree_path *,
46 bool bch2_btree_insert_key_cached(struct btree_trans *, unsigned,
47 struct btree_insert_entry *);
48 void bch2_btree_key_cache_drop(struct btree_trans *,
51 void bch2_fs_btree_key_cache_exit(struct btree_key_cache *);
52 void bch2_fs_btree_key_cache_init_early(struct btree_key_cache *);
53 int bch2_fs_btree_key_cache_init(struct btree_key_cache *);
55 void bch2_btree_key_cache_to_text(struct printbuf *, struct btree_key_cache *);
57 void bch2_btree_key_cache_exit(void);
58 int __init bch2_btree_key_cache_init(void);
60 #endif /* _BCACHEFS_BTREE_KEY_CACHE_H */