Lines Matching defs:root
129 int dm_btree_empty(struct dm_btree_info *info, dm_block_t *root)
151 *root = dm_block_location(b);
273 int dm_btree_del(struct dm_btree_info *info, dm_block_t root)
290 r = push_frame(s, root, 0);
374 int dm_btree_lookup(struct dm_btree_info *info, dm_block_t root,
397 r = btree_lookup_raw(&spine, root, keys[level],
411 root = le64_to_cpu(internal_value_le);
419 static int dm_btree_lookup_next_single(struct dm_btree_info *info, dm_block_t root,
427 r = bn_read_lock(info, root, &node);
470 int dm_btree_lookup_next(struct dm_btree_info *info, dm_block_t root,
480 r = btree_lookup_raw(&spine, root, keys[level],
491 root = le64_to_cpu(internal_value_le);
494 r = dm_btree_lookup_next_single(info, root, keys[level], rkey, value_le);
712 dm_block_t root;
715 root = value64(parent, index);
717 r = dm_tm_shadow_block(info->tm, root, &btree_node_validator,
1092 static int btree_insert_raw(struct shadow_spine *s, dm_block_t root,
1100 r = shadow_step(s, root, vt);
1145 root = value64(node, i);
1156 static int __btree_get_overwrite_leaf(struct shadow_spine *s, dm_block_t root,
1164 r = shadow_step(s, root, &s->info->value_type);
1195 root = value64(node, i);
1202 int btree_get_overwrite_leaf(struct dm_btree_info *info, dm_block_t root,
1211 r = __btree_get_overwrite_leaf(&spine, root, key, index);
1234 static int insert(struct dm_btree_info *info, dm_block_t root,
1241 dm_block_t block = root;
1321 int dm_btree_insert(struct dm_btree_info *info, dm_block_t root,
1325 return insert(info, root, keys, value, new_root, NULL);
1329 int dm_btree_insert_notify(struct dm_btree_info *info, dm_block_t root,
1334 return insert(info, root, keys, value, new_root, inserted);
1377 static int dm_btree_find_key(struct dm_btree_info *info, dm_block_t root,
1385 r = find_key(&spine, root, find_highest, result_keys + level,
1386 level == info->levels - 1 ? NULL : &root);
1401 int dm_btree_find_highest_key(struct dm_btree_info *info, dm_block_t root,
1404 return dm_btree_find_key(info, root, true, result_keys);
1408 int dm_btree_find_lowest_key(struct dm_btree_info *info, dm_block_t root,
1411 return dm_btree_find_key(info, root, false, result_keys);
1456 int dm_btree_walk(struct dm_btree_info *info, dm_block_t root,
1461 return walk_node(info, root, fn, context);
1571 int dm_btree_cursor_begin(struct dm_btree_info *info, dm_block_t root,
1577 c->root = root;
1581 r = push_node(c, root);