Lines Matching defs:child
53 * Once this rebalancing has occurred we can then step into the child node
155 struct child {
163 unsigned int index, struct child *result)
187 static void exit_child(struct dm_btree_info *info, struct child *c)
237 struct child *l, struct child *r)
245 * Ensure the number of entries in each child will be greater
247 * child is used for removal, the number will still be not
284 struct child left, right;
312 struct child *l, struct child *c, struct child *r,
352 struct child *l, struct child *c, struct child *r,
419 struct child *l, struct child *c, struct child *r)
451 struct child left, center, right;
492 struct dm_block *child;
495 r = dm_tm_read_lock(info->tm, b, &btree_node_validator, &child);
499 memcpy(n, dm_block_data(child),
502 dm_tm_dec(info->tm, dm_block_location(child));
503 dm_tm_unlock(info->tm, child);