Lines Matching refs:btree_info
158 r = dm_tm_new_block(info->btree_info.tm, &array_validator, block); in alloc_ablock()
223 r = dm_tm_read_lock(info->btree_info.tm, b, &array_validator, block); in get_ablock()
236 dm_tm_unlock(info->btree_info.tm, block); in unlock_ablock()
259 r = dm_btree_lookup(&info->btree_info, root, &key, &block_le); in lookup_ablock()
275 return dm_btree_insert(&info->btree_info, *root, &index, &block_le, root); in insert_ablock()
284 int r = dm_tm_shadow_block(info->btree_info.tm, b, in __shadow_ablock()
313 dm_tm_inc(info->btree_info.tm, b); in __reinsert_ablock()
334 r = dm_btree_lookup(&info->btree_info, *root, &key, &block_le); in shadow_ablock()
443 r = dm_btree_remove(&resize->info->btree_info, resize->root, in drop_blocks()
582 dm_tm_inc(info->btree_info.tm, le64_to_cpu(*block_le)); in block_inc()
598 r = dm_tm_ref(info->btree_info.tm, b, &ref_count); in __block_dec()
621 dm_tm_dec(info->btree_info.tm, b); in __block_dec()
643 struct dm_btree_value_type *bvt = &info->btree_info.value_type; in dm_array_info_init()
646 info->btree_info.tm = tm; in dm_array_info_init()
647 info->btree_info.levels = 1; in dm_array_info_init()
659 return dm_btree_empty(&info->btree_info, root); in dm_array_empty()
677 resize.size_of_block = dm_bm_block_size(dm_tm_get_bm(info->btree_info.tm)); in array_resize()
743 size_of_block = dm_bm_block_size(dm_tm_get_bm(info->btree_info.tm)); in dm_array_new()
774 return dm_btree_del(&info->btree_info, root); in dm_array_del()
787 size_of_block = dm_bm_block_size(dm_tm_get_bm(info->btree_info.tm)); in dm_array_get_value()
818 size_of_block = dm_bm_block_size(dm_tm_get_bm(info->btree_info.tm)); in array_set_value()
905 return dm_btree_walk(&info->btree_info, root, walk_ablock, &wi); in dm_array_walk()
947 r = dm_btree_cursor_begin(&info->btree_info, root, true, &c->cursor); in dm_array_cursor_begin()