121 int dm_btree_empty(struct dm_btree_info *info, dm_block_t *root)  in dm_btree_empty()  argument
143 	*root = dm_block_location(b);  in dm_btree_empty()
253 int dm_btree_del(struct dm_btree_info *info, dm_block_t root)  in dm_btree_del()  argument
265 	r = push_frame(s, root, 0);  in dm_btree_del()
348 int dm_btree_lookup(struct dm_btree_info *info, dm_block_t root,  in dm_btree_lookup()  argument
371 		r = btree_lookup_raw(&spine, root, keys[level],  in dm_btree_lookup()
385 		root = le64_to_cpu(internal_value_le);  in dm_btree_lookup()
423 static int btree_split_sibling(struct shadow_spine *s, dm_block_t root,  in btree_split_sibling()  argument
595 static int btree_insert_raw(struct shadow_spine *s, dm_block_t root,  in btree_insert_raw()  argument
603 		r = shadow_step(s, root, vt);  in btree_insert_raw()
628 				r = btree_split_sibling(s, root, i, key);  in btree_insert_raw()
647 		root = value64(node, i);  in btree_insert_raw()
658 static int insert(struct dm_btree_info *info, dm_block_t root,  in insert()  argument
665 	dm_block_t block = root;  in insert()
749 int dm_btree_insert(struct dm_btree_info *info, dm_block_t root,  in dm_btree_insert()  argument
753 	return insert(info, root, keys, value, new_root, NULL);  in dm_btree_insert()
757 int dm_btree_insert_notify(struct dm_btree_info *info, dm_block_t root,  in dm_btree_insert_notify()  argument
762 	return insert(info, root, keys, value, new_root, inserted);  in dm_btree_insert_notify()
801 static int dm_btree_find_key(struct dm_btree_info *info, dm_block_t root,  in dm_btree_find_key()  argument
809 		r = find_key(&spine, root, find_highest, result_keys + level,  in dm_btree_find_key()
810 			     level == info->levels - 1 ? NULL : &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()  argument
828 	return dm_btree_find_key(info, root, true, result_keys);  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()  argument
835 	return dm_btree_find_key(info, root, false, result_keys);  in dm_btree_find_lowest_key()
880 int dm_btree_walk(struct dm_btree_info *info, dm_block_t root,  in dm_btree_walk()  argument
885 	return walk_node(info, root, fn, context);  in dm_btree_walk()