253 static int lookup_ablock(struct dm_array_info *info, dm_block_t root,  in lookup_ablock()  argument
261 	r = dm_btree_lookup(&info->btree_info, root, &key, &block_le);  in lookup_ablock()
272 			 struct dm_block *block, dm_block_t *root)  in insert_ablock()  argument
277 	return dm_btree_insert(&info->btree_info, *root, &index, &block_le, root);  in insert_ablock()
285 static int shadow_ablock(struct dm_array_info *info, dm_block_t *root,  in shadow_ablock()  argument
297 	r = dm_btree_lookup(&info->btree_info, *root, &key, &block_le);  in shadow_ablock()
328 		r = insert_ablock(info, index, *block, root);  in shadow_ablock()
340 			     const void *value, dm_block_t *root)  in insert_new_ablock()  argument
351 	r = insert_ablock(info, block_index, block, root);  in insert_new_ablock()
360 			       dm_block_t *root)  in insert_full_ablocks()  argument
365 		r = insert_new_ablock(info, size_of_block, max_entries, begin_block, max_entries, value, root);  in insert_full_ablocks()
384 	dm_block_t root;  member
430 		r = dm_btree_remove(&resize->info->btree_info, resize->root,  in drop_blocks()
431 				    &key, &resize->root);  in drop_blocks()
476 		r = shadow_ablock(resize->info, &resize->root,  in shrink()
497 	r = shadow_ablock(resize->info, &resize->root,  in grow_extend_tail_block()
514 				 resize->value, &resize->root);  in grow_add_tail_block()
534 				&resize->root);  in grow_needs_more_blocks()
635 int dm_array_empty(struct dm_array_info *info, dm_block_t *root)  in dm_array_empty()  argument
637 	return dm_btree_empty(&info->btree_info, root);  in dm_array_empty()
641 static int array_resize(struct dm_array_info *info, dm_block_t root,  in array_resize()  argument
649 		*new_root = root;  in array_resize()
654 	resize.root = root;  in array_resize()
669 	*new_root = resize.root;  in array_resize()
673 int dm_array_resize(struct dm_array_info *info, dm_block_t root,  in dm_array_resize()  argument
678 	int r = array_resize(info, root, old_size, new_size, value, new_root);  in dm_array_resize()
684 int dm_array_del(struct dm_array_info *info, dm_block_t root)  in dm_array_del()  argument
686 	return dm_btree_del(&info->btree_info, root);  in dm_array_del()
690 int dm_array_get_value(struct dm_array_info *info, dm_block_t root,  in dm_array_get_value()  argument
702 	r = lookup_ablock(info, root, index / max_entries, &block, &ab);  in dm_array_get_value()
718 static int array_set_value(struct dm_array_info *info, dm_block_t root,  in array_set_value()  argument
733 	r = shadow_ablock(info, &root, index / max_entries, &block, &ab);  in array_set_value()
736 	*new_root = root;  in array_set_value()
759 int dm_array_set_value(struct dm_array_info *info, dm_block_t root,  in dm_array_set_value()  argument
765 	r = array_set_value(info, root, index, value, new_root);  in dm_array_set_value()
807 int dm_array_walk(struct dm_array_info *info, dm_block_t root,  in dm_array_walk()  argument
817 	return dm_btree_walk(&info->btree_info, root, walk_ablock, &wi);  in dm_array_walk()