1 | /* SPDX-License-Identifier: GPL-2.0 */ |
2 | #ifndef _BCACHEFS_BTREE_KEY_CACHE_H |
3 | #define _BCACHEFS_BTREE_KEY_CACHE_H |
4 | |
5 | static inline size_t bch2_nr_btree_keys_need_flush(struct bch_fs *c) |
6 | { |
7 | size_t nr_dirty = atomic_long_read(v: &c->btree_key_cache.nr_dirty); |
8 | size_t nr_keys = atomic_long_read(v: &c->btree_key_cache.nr_keys); |
9 | size_t max_dirty = 1024 + nr_keys / 2; |
10 | |
11 | return max_t(ssize_t, 0, nr_dirty - max_dirty); |
12 | } |
13 | |
14 | static inline bool bch2_btree_key_cache_must_wait(struct bch_fs *c) |
15 | { |
16 | size_t nr_dirty = atomic_long_read(v: &c->btree_key_cache.nr_dirty); |
17 | size_t nr_keys = atomic_long_read(v: &c->btree_key_cache.nr_keys); |
18 | size_t max_dirty = 4096 + (nr_keys * 3) / 4; |
19 | |
20 | return nr_dirty > max_dirty; |
21 | } |
22 | |
23 | int bch2_btree_key_cache_journal_flush(struct journal *, |
24 | struct journal_entry_pin *, u64); |
25 | |
26 | struct bkey_cached * |
27 | bch2_btree_key_cache_find(struct bch_fs *, enum btree_id, struct bpos); |
28 | |
29 | int bch2_btree_path_traverse_cached(struct btree_trans *, struct btree_path *, |
30 | unsigned); |
31 | |
32 | bool bch2_btree_insert_key_cached(struct btree_trans *, unsigned, |
33 | struct btree_insert_entry *); |
34 | void bch2_btree_key_cache_drop(struct btree_trans *, |
35 | struct btree_path *); |
36 | |
37 | void bch2_fs_btree_key_cache_exit(struct btree_key_cache *); |
38 | void bch2_fs_btree_key_cache_init_early(struct btree_key_cache *); |
39 | int bch2_fs_btree_key_cache_init(struct btree_key_cache *); |
40 | |
41 | void bch2_btree_key_cache_to_text(struct printbuf *, struct btree_key_cache *); |
42 | |
43 | void bch2_btree_key_cache_exit(void); |
44 | int __init bch2_btree_key_cache_init(void); |
45 | |
46 | #endif /* _BCACHEFS_BTREE_KEY_CACHE_H */ |
47 | |