162 		      struct btree_node *parent,  in init_child()  argument
169 	root = value64(parent, index);  in init_child()
181 	*((__le64 *) value_ptr(parent, index)) =  in init_child()
236 static int __rebalance2(struct dm_btree_info *info, struct btree_node *parent,  in __rebalance2()  argument
258 		delete_at(parent, r->index);  in __rebalance2()
274 		*key_ptr(parent, r->index) = right->keys[0];  in __rebalance2()
283 	struct btree_node *parent;  in rebalance2()  local
286 	parent = dm_block_data(shadow_current(s));  in rebalance2()
288 	r = init_child(info, vt, parent, left_index, &left);  in rebalance2()
292 	r = init_child(info, vt, parent, left_index + 1, &right);  in rebalance2()
298 	r = __rebalance2(info, parent, &left, &right);  in rebalance2()
311 static int delete_center_node(struct dm_btree_info *info, struct btree_node *parent,  in delete_center_node()  argument
339 	*key_ptr(parent, r->index) = right->keys[0];  in delete_center_node()
341 	delete_at(parent, c->index);  in delete_center_node()
345 	return __rebalance2(info, parent, l, r);  in delete_center_node()
351 static int redistribute3(struct dm_btree_info *info, struct btree_node *parent,  in redistribute3()  argument
413 	*key_ptr(parent, c->index) = center->keys[0];  in redistribute3()
414 	*key_ptr(parent, r->index) = right->keys[0];  in redistribute3()
418 static int __rebalance3(struct dm_btree_info *info, struct btree_node *parent,  in __rebalance3()  argument
438 		return delete_center_node(info, parent, l, c, r, left, center, right,  in __rebalance3()
442 	return redistribute3(info, parent, l, c, r, left, center, right,  in __rebalance3()
450 	struct btree_node *parent = dm_block_data(shadow_current(s));  in rebalance3()  local
456 	r = init_child(info, vt, parent, left_index, &left);  in rebalance3()
460 	r = init_child(info, vt, parent, left_index + 1, &center);  in rebalance3()
466 	r = init_child(info, vt, parent, left_index + 2, &right);  in rebalance3()
473 	r = __rebalance3(info, parent, &left, &center, &right);  in rebalance3()