126 int dm_btree_empty(struct dm_btree_info *info, dm_block_t *root)  in dm_btree_empty()
208 static int push_frame(struct del_stack *s, dm_block_t b, unsigned level)  in push_frame()
270 int dm_btree_del(struct dm_btree_info *info, dm_block_t root)  in dm_btree_del()
294 		dm_block_t b;  in dm_btree_del()
340 static int btree_lookup_raw(struct ro_spine *s, dm_block_t block, uint64_t key,  in btree_lookup_raw()
371 int dm_btree_lookup(struct dm_btree_info *info, dm_block_t root,  in dm_btree_lookup()
416 static int dm_btree_lookup_next_single(struct dm_btree_info *info, dm_block_t root,  in dm_btree_lookup_next_single()
467 int dm_btree_lookup_next(struct dm_btree_info *info, dm_block_t root,  in dm_btree_lookup_next()
703 	dm_block_t root;  in shadow_child()
964 static int get_node_free_space(struct dm_btree_info *info, dm_block_t b, unsigned *space)  in get_node_free_space()
1003 		dm_block_t left_b = value64(parent, parent_index - 1);  in rebalance_or_split()
1020 		dm_block_t right_b = value64(parent, parent_index + 1);  in rebalance_or_split()
1081 static int btree_insert_raw(struct shadow_spine *s, dm_block_t root,  in btree_insert_raw()
1145 static int __btree_get_overwrite_leaf(struct shadow_spine *s, dm_block_t root,  in __btree_get_overwrite_leaf()
1191 int btree_get_overwrite_leaf(struct dm_btree_info *info, dm_block_t root,  in btree_get_overwrite_leaf()
1193 			     dm_block_t *new_root, struct dm_block **leaf)  in btree_get_overwrite_leaf()
1223 static int insert(struct dm_btree_info *info, dm_block_t root,  in insert()
1224 		  uint64_t *keys, void *value, dm_block_t *new_root,  in insert()
1230 	dm_block_t block = root;  in insert()
1246 			dm_block_t new_tree;  in insert()
1310 int dm_btree_insert(struct dm_btree_info *info, dm_block_t root,  in dm_btree_insert()
1311 		    uint64_t *keys, void *value, dm_block_t *new_root)  in dm_btree_insert()
1318 int dm_btree_insert_notify(struct dm_btree_info *info, dm_block_t root,  in dm_btree_insert_notify()
1319 			   uint64_t *keys, void *value, dm_block_t *new_root,  in dm_btree_insert_notify()
1329 static int find_key(struct ro_spine *s, dm_block_t block, bool find_highest,  in find_key()
1330 		    uint64_t *result_key, dm_block_t *next_block)  in find_key()
1366 static int dm_btree_find_key(struct dm_btree_info *info, dm_block_t root,  in dm_btree_find_key()
1390 int dm_btree_find_highest_key(struct dm_btree_info *info, dm_block_t root,  in dm_btree_find_highest_key()
1397 int dm_btree_find_lowest_key(struct dm_btree_info *info, dm_block_t root,  in dm_btree_find_lowest_key()
1410 static int walk_node(struct dm_btree_info *info, dm_block_t block,  in walk_node()
1445 int dm_btree_walk(struct dm_btree_info *info, dm_block_t root,  in dm_btree_walk()
1481 static int push_node(struct dm_btree_cursor *c, dm_block_t b)  in push_node()
1560 int dm_btree_cursor_begin(struct dm_btree_info *info, dm_block_t root,  in dm_btree_cursor_begin()