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 void inc_children(struct dm_transaction_manager *tm, struct btree_node *n,  in inc_children()
80 static int insert_at(size_t value_size, struct btree_node *node, unsigned index,  in insert_at()
125 	struct btree_node *n;  in dm_btree_empty()
157 	struct btree_node *n;
319 			    int (*search_fn)(struct btree_node *, uint64_t),  in btree_lookup_raw()  argument
430 	struct btree_node *ln, *rn, *pn;  in btree_split_sibling()
515 	struct btree_node *pn, *ln, *rn;  in btree_split_beneath()
600 	struct btree_node *node;  in btree_insert_raw()
667 	struct btree_node *n;  in insert()
852 	struct btree_node *n;  in walk_node()