121 int dm_btree_empty(struct dm_btree_info *info, dm_block_t *root)  in dm_btree_empty()
201 static int push_frame(struct del_stack *s, dm_block_t b, unsigned level)  in push_frame()
253 int dm_btree_del(struct dm_btree_info *info, dm_block_t root)  in dm_btree_del()
272 		dm_block_t b;  in dm_btree_del()
318 static int btree_lookup_raw(struct ro_spine *s, dm_block_t block, uint64_t key,  in btree_lookup_raw()
348 int dm_btree_lookup(struct dm_btree_info *info, dm_block_t root,  in dm_btree_lookup()
423 static int btree_split_sibling(struct shadow_spine *s, dm_block_t root,  in btree_split_sibling()
595 static int btree_insert_raw(struct shadow_spine *s, dm_block_t root,  in btree_insert_raw()
658 static int insert(struct dm_btree_info *info, dm_block_t root,  in insert()
659 		  uint64_t *keys, void *value, dm_block_t *new_root,  in insert()
665 	dm_block_t block = root;  in insert()
683 			dm_block_t new_tree;  in insert()
749 int dm_btree_insert(struct dm_btree_info *info, dm_block_t root,  in dm_btree_insert()
750 		    uint64_t *keys, void *value, dm_block_t *new_root)  in dm_btree_insert()
757 int dm_btree_insert_notify(struct dm_btree_info *info, dm_block_t root,  in dm_btree_insert_notify()
758 			   uint64_t *keys, void *value, dm_block_t *new_root,  in dm_btree_insert_notify()
768 static int find_key(struct ro_spine *s, dm_block_t block, bool find_highest,  in find_key()
769 		    uint64_t *result_key, dm_block_t *next_block)  in find_key()
801 static int dm_btree_find_key(struct dm_btree_info *info, dm_block_t root,  in dm_btree_find_key()
825 int dm_btree_find_highest_key(struct dm_btree_info *info, dm_block_t root,  in dm_btree_find_highest_key()
832 int dm_btree_find_lowest_key(struct dm_btree_info *info, dm_block_t root,  in dm_btree_find_lowest_key()
845 static int walk_node(struct dm_btree_info *info, dm_block_t block,  in walk_node()
880 int dm_btree_walk(struct dm_btree_info *info, dm_block_t root,  in dm_btree_walk()