372 static unsigned int inorder_next(unsigned int j, unsigned int size)  in inorder_next()
389 static unsigned int inorder_prev(unsigned int j, unsigned int size)  in inorder_prev()
416 static unsigned int __to_inorder(unsigned int j,  in __to_inorder()
438 static unsigned int to_inorder(unsigned int j, struct bset_tree *t)  in to_inorder()
443 static unsigned int __inorder_to_tree(unsigned int j,  in __inorder_to_tree()
464 static unsigned int inorder_to_tree(unsigned int j, struct bset_tree *t)  in inorder_to_tree()
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()
593 static void make_bfloat(struct bset_tree *t, unsigned int j)  in make_bfloat()
641 		unsigned int j = roundup(t[-1].size,  in bset_alloc_tree()  local
696 	unsigned int j, cacheline = 1;  in bch_bset_build_written_tree()  local
742 	unsigned int inorder, j = 1;  in bch_bset_fix_invalidated_key()  local
790 	unsigned int j = bkey_to_cacheline(t, k);  in bch_bset_fix_lookup_table()  local
967 	unsigned int inorder, j, n = 1;  in bset_search_tree()  local
1378 		size_t j;  in bch_btree_keys_stats()  local