126 int dm_btree_empty(struct dm_btree_info *info, dm_block_t *root)  in dm_btree_empty()  argument
148 	*root = dm_block_location(b);  in dm_btree_empty()
270 int dm_btree_del(struct dm_btree_info *info, dm_block_t root)  in dm_btree_del()  argument
282 	r = push_frame(s, root, 0);  in dm_btree_del()
369 int dm_btree_lookup(struct dm_btree_info *info, dm_block_t root,  in dm_btree_lookup()  argument
392 		r = btree_lookup_raw(&spine, root, keys[level],  in dm_btree_lookup()
406 		root = le64_to_cpu(internal_value_le);  in dm_btree_lookup()
414 static int dm_btree_lookup_next_single(struct dm_btree_info *info, dm_block_t root,  in dm_btree_lookup_next_single()  argument
422 	r = bn_read_lock(info, root, &node);  in dm_btree_lookup_next_single()
458 int dm_btree_lookup_next(struct dm_btree_info *info, dm_block_t root,  in dm_btree_lookup_next()  argument
468 		r = btree_lookup_raw(&spine, root, keys[level],  in dm_btree_lookup_next()
479 		root = le64_to_cpu(internal_value_le);  in dm_btree_lookup_next()
482 	r = dm_btree_lookup_next_single(info, root, keys[level], rkey, value_le);  in dm_btree_lookup_next()
694 static int btree_insert_raw(struct shadow_spine *s, dm_block_t root,  in btree_insert_raw()  argument
702 		r = shadow_step(s, root, vt);  in btree_insert_raw()
746 		root = value64(node, i);  in btree_insert_raw()
757 static int insert(struct dm_btree_info *info, dm_block_t root,  in insert()  argument
764 	dm_block_t block = root;  in insert()
848 int dm_btree_insert(struct dm_btree_info *info, dm_block_t root,  in dm_btree_insert()  argument
852 	return insert(info, root, keys, value, new_root, NULL);  in dm_btree_insert()
856 int dm_btree_insert_notify(struct dm_btree_info *info, dm_block_t root,  in dm_btree_insert_notify()  argument
861 	return insert(info, root, keys, value, new_root, inserted);  in dm_btree_insert_notify()
900 static int dm_btree_find_key(struct dm_btree_info *info, dm_block_t root,  in dm_btree_find_key()  argument
908 		r = find_key(&spine, root, find_highest, result_keys + level,  in dm_btree_find_key()
909 			     level == info->levels - 1 ? NULL : &root);  in dm_btree_find_key()
924 int dm_btree_find_highest_key(struct dm_btree_info *info, dm_block_t root,  in dm_btree_find_highest_key()  argument
927 	return dm_btree_find_key(info, root, true, result_keys);  in dm_btree_find_highest_key()
931 int dm_btree_find_lowest_key(struct dm_btree_info *info, dm_block_t root,  in dm_btree_find_lowest_key()  argument
934 	return dm_btree_find_key(info, root, false, result_keys);  in dm_btree_find_lowest_key()
979 int dm_btree_walk(struct dm_btree_info *info, dm_block_t root,  in dm_btree_walk()  argument
984 	return walk_node(info, root, fn, context);  in dm_btree_walk()