Home
last modified time | relevance | path

Searched refs:bset_tree (Results 1 – 11 of 11) sorted by relevance

/linux-6.15/fs/bcachefs/
H A Dbset.h209 for (struct bset_tree *_t = (_b)->set; _t < (_b)->set + (_b)->nsets; _t++)
219 static inline bool bset_has_ro_aux_tree(const struct bset_tree *t) in bset_has_ro_aux_tree()
224 static inline bool bset_has_rw_aux_tree(struct bset_tree *t) in bset_has_rw_aux_tree()
230 struct bset_tree *t) in bch2_bset_set_no_aux_tree()
271 void bch2_bset_build_aux_tree(struct btree *, struct bset_tree *, bool);
296 static inline struct bset_tree *
310 struct bset_tree *bch2_bkey_to_bset(struct btree *, struct bkey_packed *);
312 struct bkey_packed *bch2_bkey_prev_filter(struct btree *, struct bset_tree *,
322 bch2_bkey_prev(struct btree *b, struct bset_tree *t, struct bkey_packed *k) in bch2_bkey_prev()
338 struct bset_tree *);
[all …]
H A Dbset.c481 struct bset_tree *t, in rw_aux_to_bkey()
499 struct bset_tree *t) in bch2_bset_verify_rw_aux_tree()
535 struct bset_tree *t, in rw_aux_tree_bsearch()
749 struct bset_tree *i; in bset_alloc_tree()
786 struct bset_tree *t; in bch2_bset_init_first()
801 struct bset_tree *t; in bch2_bset_init_next()
858 struct bset_tree *t, in bch2_bkey_prev_filter()
1043 struct bset_tree *t, in bset_search_write_set()
1147 struct bset_tree *t, in __bch2_bset_search()
1181 struct bset_tree *t, in bch2_bset_search_linear()
[all …]
H A Dbtree_types.h37 struct bset_tree { struct
96 struct bset_tree set[MAX_BSETS];
641 static inline struct bset_tree *bset_tree_last(struct btree *b) in bset_tree_last()
663 const struct bset_tree *t) in bset()
668 static inline void set_btree_bset_end(struct btree *b, struct bset_tree *t) in set_btree_bset_end()
674 static inline void set_btree_bset(struct btree *b, struct bset_tree *t, in set_btree_bset()
703 static inline unsigned btree_bkey_first_offset(const struct bset_tree *t) in btree_bkey_first_offset()
724 static inline unsigned bset_u64s(struct bset_tree *t) in bset_u64s()
730 static inline unsigned bset_dead_u64s(struct btree *b, struct bset_tree *t) in bset_dead_u64s()
H A Dbtree_io.h75 struct bset_tree *t) in should_compact_bset_lazy()
H A Dbtree_update_interior.h286 struct bset_tree *t = bset_tree_last(b); in want_new_bset()
H A Dbtree_trans_commit.c295 struct bset_tree *t = bset_tree_last(b); in bch2_btree_insert_key_leaf()
H A Dbtree_iter.c378 struct bset_tree *t, in btree_node_iter_set_set_pos()
422 struct bset_tree *t, in __bch2_btree_node_iter_fix()
518 struct bset_tree *t = bch2_bkey_to_bset_inlined(b, where); in bch2_btree_node_iter_fix()
H A Dbtree_io.c208 static bool should_compact_bset(struct btree *b, struct bset_tree *t, in should_compact_bset()
301 struct bset_tree *t; in btree_node_sort()
/linux-6.15/drivers/md/bcache/
H A Dbset.c298 struct bset_tree *t = b->set; in bch_btree_keys_free()
323 struct bset_tree *t = b->set; in bch_btree_keys_alloc()
529 static struct bkey *cacheline_to_bkey(struct bset_tree *t, in cacheline_to_bkey()
596 static void make_bfloat(struct bset_tree *t, unsigned int j) in make_bfloat()
657 struct bset_tree *t = bset_tree_last(b); in bch_bset_build_unwritten_tree()
696 struct bset_tree *t = bset_tree_last(b); in bch_bset_build_written_tree()
744 struct bset_tree *t; in bch_bset_fix_invalidated_key()
788 struct bset_tree *t, in bch_bset_fix_lookup_table()
864 struct bset_tree *t = bset_tree_last(b); in bch_bset_insert()
1119 struct bset_tree *start) in __bch_btree_iter_init()
[all …]
H A Dbset.h157 struct bset_tree { struct
232 struct bset_tree set[MAX_BSETS];
235 static inline struct bset_tree *bset_tree_last(struct btree_keys *b) in bset_tree_last()
240 static inline bool bset_written(struct btree_keys *b, struct bset_tree *t) in bset_written()
272 struct bset_tree *t = bset_tree_last(b); in bch_btree_keys_u64s_remaining()
342 struct bkey *__bch_bset_search(struct btree_keys *b, struct bset_tree *t,
349 struct bset_tree *t, in bch_bset_search()
H A Dbtree.c1313 struct bset_tree *t; in btree_gc_mark_node()