41 static int bsearch(struct btree_node *n, uint64_t key, int want_hi)  in bsearch()
61 int lower_bound(struct btree_node *n, uint64_t key)  in lower_bound()
66 static int upper_bound(struct btree_node *n, uint64_t key)  in upper_bound()
71 void inc_children(struct dm_transaction_manager *tm, struct btree_node *n,  in inc_children()
85 static int insert_at(size_t value_size, struct btree_node *node, unsigned index,  in insert_at()
130 	struct btree_node *n;  in dm_btree_empty()
164 	struct btree_node *n;
345 			    int (*search_fn)(struct btree_node *, uint64_t),  in btree_lookup_raw()  argument
425 	struct btree_node *n;  in dm_btree_lookup_next_single()
539 	struct btree_node *ln, *rn, *pn;  in btree_split_sibling()
626 	struct btree_node *pn, *ln, *rn;  in btree_split_beneath()
697 	struct btree_node *node;  in btree_insert_raw()
755 static bool need_insert(struct btree_node *node, uint64_t *keys,  in need_insert()
771 	struct btree_node *n;  in insert()
956 	struct btree_node *n;  in walk_node()
1000 	struct btree_node *bn = dm_block_data(n->b);  in prefetch_values()
1015 	struct btree_node *bn = dm_block_data(n->b);  in leaf_node()
1052 	struct btree_node *bn;  in inc_or_backtrack()
1075 	struct btree_node *bn;  in find_leaf()
1152 		struct btree_node *bn = dm_block_data(n->b);  in dm_btree_cursor_get_value()