292 	struct bset_tree *t = b->set;  in bch_btree_keys_free()  local
318 	struct bset_tree *t = b->set;  in bch_btree_keys_alloc()  local
438 static unsigned int to_inorder(unsigned int j, struct bset_tree *t)  in to_inorder()
464 static unsigned int inorder_to_tree(unsigned int j, struct bset_tree *t)  in inorder_to_tree()
526 static struct bkey *cacheline_to_bkey(struct bset_tree *t,  in cacheline_to_bkey()
533 static unsigned int bkey_to_cacheline(struct bset_tree *t, struct bkey *k)  in bkey_to_cacheline()
538 static unsigned int bkey_to_cacheline_offset(struct bset_tree *t,  in bkey_to_cacheline_offset()
545 static struct bkey *tree_to_bkey(struct bset_tree *t, unsigned int j)  in tree_to_bkey()
550 static struct bkey *tree_to_prev_bkey(struct bset_tree *t, unsigned int j)  in tree_to_prev_bkey()
559 static struct bkey *table_to_bkey(struct bset_tree *t, unsigned int cacheline)  in table_to_bkey()
593 static void make_bfloat(struct bset_tree *t, unsigned int j)  in make_bfloat()
638 static void bset_alloc_tree(struct btree_keys *b, struct bset_tree *t)  in bset_alloc_tree()
654 	struct bset_tree *t = bset_tree_last(b);  in bch_bset_build_unwritten_tree()  local
694 	struct bset_tree *t = bset_tree_last(b);  in bch_bset_build_written_tree()  local
741 	struct bset_tree *t;  in bch_bset_fix_invalidated_key()  local
786 				      struct bset_tree *t,  in bch_bset_fix_lookup_table()
863 	struct bset_tree *t = bset_tree_last(b);  in bch_bset_insert()  local
942 static struct bset_search_iter bset_search_write_set(struct bset_tree *t,  in bset_search_write_set()
962 static struct bset_search_iter bset_search_tree(struct bset_tree *t,  in bset_search_tree()
1018 struct bkey *__bch_bset_search(struct btree_keys *b, struct bset_tree *t,  in __bch_bset_search()
1376 		struct bset_tree *t = &b->set[i];  in bch_btree_keys_stats()  local