Lines Matching refs:dm_block_t

129 int dm_btree_empty(struct dm_btree_info *info, dm_block_t *root)  in dm_btree_empty()
211 static int push_frame(struct del_stack *s, dm_block_t b, unsigned int level) in push_frame()
273 int dm_btree_del(struct dm_btree_info *info, dm_block_t root) in dm_btree_del()
297 dm_block_t b; in dm_btree_del()
343 static int btree_lookup_raw(struct ro_spine *s, dm_block_t block, uint64_t key, in btree_lookup_raw()
374 int dm_btree_lookup(struct dm_btree_info *info, dm_block_t root, in dm_btree_lookup()
419 static int dm_btree_lookup_next_single(struct dm_btree_info *info, dm_block_t root, in dm_btree_lookup_next_single()
470 int dm_btree_lookup_next(struct dm_btree_info *info, dm_block_t root, in dm_btree_lookup_next()
712 dm_block_t root; in shadow_child()
973 static int get_node_free_space(struct dm_btree_info *info, dm_block_t b, unsigned int *space) in get_node_free_space()
1012 dm_block_t left_b = value64(parent, parent_index - 1); in rebalance_or_split()
1030 dm_block_t right_b = value64(parent, parent_index + 1); in rebalance_or_split()
1092 static int btree_insert_raw(struct shadow_spine *s, dm_block_t root, in btree_insert_raw()
1156 static int __btree_get_overwrite_leaf(struct shadow_spine *s, dm_block_t root, in __btree_get_overwrite_leaf()
1202 int btree_get_overwrite_leaf(struct dm_btree_info *info, dm_block_t root, in btree_get_overwrite_leaf()
1204 dm_block_t *new_root, struct dm_block **leaf) in btree_get_overwrite_leaf()
1234 static int insert(struct dm_btree_info *info, dm_block_t root, in insert()
1235 uint64_t *keys, void *value, dm_block_t *new_root, in insert()
1241 dm_block_t block = root; in insert()
1257 dm_block_t new_tree; in insert()
1321 int dm_btree_insert(struct dm_btree_info *info, dm_block_t root, in dm_btree_insert()
1322 uint64_t *keys, void *value, dm_block_t *new_root) in dm_btree_insert()
1329 int dm_btree_insert_notify(struct dm_btree_info *info, dm_block_t root, in dm_btree_insert_notify()
1330 uint64_t *keys, void *value, dm_block_t *new_root, in dm_btree_insert_notify()
1340 static int find_key(struct ro_spine *s, dm_block_t block, bool find_highest, in find_key()
1341 uint64_t *result_key, dm_block_t *next_block) in find_key()
1377 static int dm_btree_find_key(struct dm_btree_info *info, dm_block_t root, in dm_btree_find_key()
1401 int dm_btree_find_highest_key(struct dm_btree_info *info, dm_block_t root, in dm_btree_find_highest_key()
1408 int dm_btree_find_lowest_key(struct dm_btree_info *info, dm_block_t root, in dm_btree_find_lowest_key()
1421 static int walk_node(struct dm_btree_info *info, dm_block_t block, in walk_node()
1456 int dm_btree_walk(struct dm_btree_info *info, dm_block_t root, in dm_btree_walk()
1492 static int push_node(struct dm_btree_cursor *c, dm_block_t b) in push_node()
1571 int dm_btree_cursor_begin(struct dm_btree_info *info, dm_block_t root, in dm_btree_cursor_begin()