367 static unsigned inorder_next(unsigned j, unsigned size)  in inorder_next()
380 static unsigned inorder_prev(unsigned j, unsigned size)  in inorder_prev()
406 static unsigned __to_inorder(unsigned j, unsigned size, unsigned extra)  in __to_inorder()
422 static unsigned to_inorder(unsigned j, struct bset_tree *t)  in to_inorder()
427 static unsigned __inorder_to_tree(unsigned j, unsigned size, unsigned extra)  in __inorder_to_tree()
442 static unsigned inorder_to_tree(unsigned j, struct bset_tree *t)  in inorder_to_tree()
521 static struct bkey *tree_to_bkey(struct bset_tree *t, unsigned j)  in tree_to_bkey()
526 static struct bkey *tree_to_prev_bkey(struct bset_tree *t, unsigned j)  in tree_to_prev_bkey()
554 static void make_bfloat(struct bset_tree *t, unsigned j)  in make_bfloat()
592 		unsigned j = roundup(t[-1].size,  in bset_alloc_tree()  local
638 	unsigned j, cacheline = 1;  in bch_bset_build_written_tree()  local
684 	unsigned inorder, j = 1;  in bch_bset_fix_invalidated_key()  local
732 	unsigned j = bkey_to_cacheline(t, k);  in bch_bset_fix_lookup_table()  local
896 	unsigned inorder, j, n = 1;  in bset_search_tree()  local
1315 		size_t j;  in bch_btree_keys_stats()  local