md/persistent-data/dm-array.c

251 static int lookup_ablock(struct dm_array_info *info, dm_block_t root,
259 	r = dm_btree_lookup(&info->btree_info, root, &key, &block_le);
270 			 struct dm_block *block, dm_block_t *root)
275 	return dm_btree_insert(&info->btree_info, *root, &index, &block_le, root);
302 			     dm_block_t *root)
314 		r = insert_ablock(info, index, block, root);
322  * btree to point to this new shadow.  'root' is an input/output parameter
323  * for both the current root block, and the new one.
325 static int shadow_ablock(struct dm_array_info *info, dm_block_t *root,
334 	r = dm_btree_lookup(&info->btree_info, *root, &key, &block_le);
343 	return __reinsert_ablock(info, index, *block, b, root);
352 			     const void *value, dm_block_t *root)
363 	r = insert_ablock(info, block_index, block, root);
372 			       dm_block_t *root)
377 		r = insert_new_ablock(info, size_of_block, max_entries, begin_block, max_entries, value, root);
394 	 * The current root of the array.  This gets updated.
396 	dm_block_t root;
443 		r = dm_btree_remove(&resize->info->btree_info, resize->root,
444 				    &key, &resize->root);
489 		r = shadow_ablock(resize->info, &resize->root,
510 	r = shadow_ablock(resize->info, &resize->root,
527 				 resize->value, &resize->root);
547 				&resize->root);
657 int dm_array_empty(struct dm_array_info *info, dm_block_t *root)
659 	return dm_btree_empty(&info->btree_info, root);
663 static int array_resize(struct dm_array_info *info, dm_block_t root,
671 		*new_root = root;
676 	resize.root = root;
691 	*new_root = resize.root;
695 int dm_array_resize(struct dm_array_info *info, dm_block_t root,
700 	int r = array_resize(info, root, old_size, new_size, value, new_root);
731 int dm_array_new(struct dm_array_info *info, dm_block_t *root,
739 	r = dm_array_empty(info, root);
760 		r = insert_ablock(info, block_index, block, root);
772 int dm_array_del(struct dm_array_info *info, dm_block_t root)
774 	return dm_btree_del(&info->btree_info, root);
778 int dm_array_get_value(struct dm_array_info *info, dm_block_t root,
790 	r = lookup_ablock(info, root, index / max_entries, &block, &ab);
806 static int array_set_value(struct dm_array_info *info, dm_block_t root,
821 	r = shadow_ablock(info, &root, index / max_entries, &block, &ab);
824 	*new_root = root;
847 int dm_array_set_value(struct dm_array_info *info, dm_block_t root,
853 	r = array_set_value(info, root, index, value, new_root);
895 int dm_array_walk(struct dm_array_info *info, dm_block_t root,
905 	return dm_btree_walk(&info->btree_info, root, walk_ablock, &wi);
940 int dm_array_cursor_begin(struct dm_array_info *info, dm_block_t root,
947 	r = dm_btree_cursor_begin(&info->btree_info, root, true, &c->cursor);