summaryrefslogblamecommitdiff
path: root/fs/bcachefs/btree_key_cache.h
blob: 4e1e5a9c765614a4cdd3da686f8e657965bf3707 (plain) (tree) 
2ca88e5ad9b2 ^



c5f51cdd5f1c ^









8a92e545597a ^


331194a230f5 ^


f51e84fe24d8 ^

8a92e545597a ^




d5425a3b220a ^


331194a230f5 ^


d5425a3b220a ^


e323edd6d390 ^


d5425a3b220a ^


8cad3e2f73f5 ^



2ca88e5ad9b2 ^



















d211b408abbc ^


14ba3706b3a8 ^



2ca88e5ad9b2 ^

1
2
3

4
5
6
7
8
9
10
11
12

13
14

15
16

17

18
19
20
21

22
23

24
25

26
27

28
29

30
31

32
33
34

35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53

54
55

56
57
58

59



                                   








                                                                         

                                                                    

                                                                         
                                               



                                                       

                                                                   

                                                                         

                                                    

                                                                     

 


                                                                       


















                                                                     

                                                                               


                                           
                                        
#ifndef _BCACHEFS_BTREE_KEY_CACHE_H
#define _BCACHEFS_BTREE_KEY_CACHE_H

static inline size_t bch2_nr_btree_keys_want_flush(struct bch_fs *c)
{
	size_t nr_dirty = atomic_long_read(&c->btree_key_cache.nr_dirty);
	size_t nr_keys = atomic_long_read(&c->btree_key_cache.nr_keys);
	size_t max_dirty = nr_keys / 4;

	return max_t(ssize_t, 0, nr_dirty - max_dirty);
}

static inline size_t bch2_nr_btree_keys_need_flush(struct bch_fs *c)
{
	size_t nr_dirty = atomic_long_read(&c->btree_key_cache.nr_dirty);
	size_t nr_keys = atomic_long_read(&c->btree_key_cache.nr_keys);
	size_t max_dirty = 1024 + nr_keys  / 2;

	return max_t(ssize_t, 0, nr_dirty - max_dirty);
}

static inline bool bch2_btree_key_cache_must_wait(struct bch_fs *c)
{
	size_t nr_dirty = atomic_long_read(&c->btree_key_cache.nr_dirty);
	size_t nr_keys = atomic_long_read(&c->btree_key_cache.nr_keys);
	size_t max_dirty = 4096 + (nr_keys * 3) / 4;

	return nr_dirty > max_dirty &&
		test_bit(JOURNAL_RECLAIM_STARTED, &c->journal.flags);
}

struct bkey_cached *
bch2_btree_key_cache_find(struct bch_fs *, enum btree_id, struct bpos);

int bch2_btree_iter_traverse_cached(struct btree_iter *);

bool bch2_btree_insert_key_cached(struct btree_trans *,
			struct btree_iter *, struct bkey_i *);
int bch2_btree_key_cache_flush(struct btree_trans *,
			       enum btree_id, struct bpos);
#ifdef CONFIG_BCACHEFS_DEBUG
void bch2_btree_key_cache_verify_clean(struct btree_trans *,
				enum btree_id, struct bpos);
#else
static inline void
bch2_btree_key_cache_verify_clean(struct btree_trans *trans,
				enum btree_id id, struct bpos pos) {}
#endif

void bch2_fs_btree_key_cache_exit(struct btree_key_cache *);
void bch2_fs_btree_key_cache_init_early(struct btree_key_cache *);
int bch2_fs_btree_key_cache_init(struct btree_key_cache *);

void bch2_btree_key_cache_to_text(struct printbuf *, struct btree_key_cache *);

void bch2_btree_key_cache_exit(void);
int __init bch2_btree_key_cache_init(void);

#endif /* _BCACHEFS_BTREE_KEY_CACHE_H */