bset_tree
struct bkey *__bch_bset_search(struct btree_keys *b, struct bset_tree *t,
struct bset_tree *start)
struct bset_tree *t = &b->set[i];
struct bset_tree *t = b->set;
struct bset_tree *t = b->set;
static unsigned int to_inorder(unsigned int j, struct bset_tree *t)
static unsigned int inorder_to_tree(unsigned int j, struct bset_tree *t)
static struct bkey *cacheline_to_bkey(struct bset_tree *t,
static unsigned int bkey_to_cacheline(struct bset_tree *t, struct bkey *k)
static unsigned int bkey_to_cacheline_offset(struct bset_tree *t,
static struct bkey *tree_to_bkey(struct bset_tree *t, unsigned int j)
static struct bkey *tree_to_prev_bkey(struct bset_tree *t, unsigned int j)
static struct bkey *table_to_bkey(struct bset_tree *t, unsigned int cacheline)
static void make_bfloat(struct bset_tree *t, unsigned int j)
static void bset_alloc_tree(struct btree_keys *b, struct bset_tree *t)
struct bset_tree *t = bset_tree_last(b);
struct bset_tree *t = bset_tree_last(b);
struct bset_tree *t;
struct bset_tree *t,
struct bset_tree *t = bset_tree_last(b);
static struct bset_search_iter bset_search_write_set(struct bset_tree *t,
static struct bset_search_iter bset_search_tree(struct bset_tree *t,
struct bset_tree set[MAX_BSETS];
static inline struct bset_tree *bset_tree_last(struct btree_keys *b)
static inline bool bset_written(struct btree_keys *b, struct bset_tree *t)
struct bset_tree *t = bset_tree_last(b);
struct bkey *__bch_bset_search(struct btree_keys *b, struct bset_tree *t,
struct bset_tree *t,
struct bset_tree *t;