Lines Matching defs:root
22 * root, may have fewer than a certain number of entries.
33 * [A] No siblings => this can only happen if the node is the root, in which
34 * case we copy the childs contents over the root.
51 * having a special case for the root.
166 dm_block_t root;
169 root = value64(parent, index);
171 r = dm_tm_shadow_block(info->tm, root, &btree_node_validator,
545 struct dm_btree_value_type *vt, dm_block_t root,
552 r = shadow_step(s, root, vt);
588 root = value64(n, i);
594 int dm_btree_remove(struct dm_btree_info *info, dm_block_t root,
609 root, keys[level], (unsigned int *)&index);
615 root = value64(n, index);
639 struct dm_btree_value_type *vt, dm_block_t root,
646 r = shadow_step(s, root, vt);
686 root = value64(n, i);
692 static int remove_one(struct dm_btree_info *info, dm_block_t root,
707 root, keys[level], (unsigned int *) &index);
712 root = value64(n, index);
716 root, keys[last_level], &index);
749 int dm_btree_remove_leaves(struct dm_btree_info *info, dm_block_t root,
757 r = remove_one(info, root, first_key, end_key, &root, nr_removed);
762 *new_root = root;