Lines Matching defs:root
128 int dm_btree_empty(struct dm_btree_info *info, dm_block_t *root)
150 *root = dm_block_location(b);
272 int dm_btree_del(struct dm_btree_info *info, dm_block_t root)
289 r = push_frame(s, root, 0);
377 int dm_btree_lookup(struct dm_btree_info *info, dm_block_t root,
400 r = btree_lookup_raw(&spine, root, keys[level],
414 root = le64_to_cpu(internal_value_le);
422 static int dm_btree_lookup_next_single(struct dm_btree_info *info, dm_block_t root,
430 r = bn_read_lock(info, root, &node);
473 int dm_btree_lookup_next(struct dm_btree_info *info, dm_block_t root,
483 r = btree_lookup_raw(&spine, root, keys[level],
494 root = le64_to_cpu(internal_value_le);
497 r = dm_btree_lookup_next_single(info, root, keys[level], rkey, value_le);
695 static int btree_insert_raw(struct shadow_spine *s, dm_block_t root,
703 r = shadow_step(s, root, vt);
747 root = value64(node, i);
765 static int insert(struct dm_btree_info *info, dm_block_t root,
772 dm_block_t block = root;
852 int dm_btree_insert(struct dm_btree_info *info, dm_block_t root,
856 return insert(info, root, keys, value, new_root, NULL);
860 int dm_btree_insert_notify(struct dm_btree_info *info, dm_block_t root,
865 return insert(info, root, keys, value, new_root, inserted);
908 static int dm_btree_find_key(struct dm_btree_info *info, dm_block_t root,
916 r = find_key(&spine, root, find_highest, result_keys + level,
917 level == info->levels - 1 ? NULL : &root);
932 int dm_btree_find_highest_key(struct dm_btree_info *info, dm_block_t root,
935 return dm_btree_find_key(info, root, true, result_keys);
939 int dm_btree_find_lowest_key(struct dm_btree_info *info, dm_block_t root,
942 return dm_btree_find_key(info, root, false, result_keys);
987 int dm_btree_walk(struct dm_btree_info *info, dm_block_t root,
992 return walk_node(info, root, fn, context);
1102 int dm_btree_cursor_begin(struct dm_btree_info *info, dm_block_t root,
1108 c->root = root;
1112 r = push_node(c, root);