md/persistent-data/dm-array.c

43 					  size_t size_of_block)
49 						 size_of_block - sizeof(__le32),
55 			     size_t size_of_block)
68 					       size_of_block - sizeof(__le32),
144 static uint32_t calc_max_entries(size_t value_size, size_t size_of_block)
146 	return (size_of_block - sizeof(struct array_block)) / value_size;
152 static int alloc_ablock(struct dm_array_info *info, size_t size_of_block,
349 static int insert_new_ablock(struct dm_array_info *info, size_t size_of_block,
358 	r = alloc_ablock(info, size_of_block, max_entries, &block, &ab);
369 static int insert_full_ablocks(struct dm_array_info *info, size_t size_of_block,
377 		r = insert_new_ablock(info, size_of_block, max_entries, begin_block, max_entries, value, root);
402 	size_t size_of_block;
523 	return insert_new_ablock(resize->info, resize->size_of_block,
543 	r = insert_full_ablocks(resize->info, resize->size_of_block,
677 	resize.size_of_block = dm_bm_block_size(dm_tm_get_bm(info->btree_info.tm));
679 					      resize.size_of_block);
737 	unsigned int block_index, end_block, size_of_block, max_entries;
743 	size_of_block = dm_bm_block_size(dm_tm_get_bm(info->btree_info.tm));
744 	max_entries = calc_max_entries(info->value_type.size, size_of_block);
748 		r = alloc_ablock(info, size_of_block, max_entries, &block, &ab);
784 	size_t size_of_block;
787 	size_of_block = dm_bm_block_size(dm_tm_get_bm(info->btree_info.tm));
788 	max_entries = calc_max_entries(info->value_type.size, size_of_block);
812 	size_t size_of_block;
818 	size_of_block = dm_bm_block_size(dm_tm_get_bm(info->btree_info.tm));
819 	max_entries = calc_max_entries(info->value_type.size, size_of_block);