143 		      struct btree_node *parent,  in init_child()  argument
150 	root = value64(parent, index);  in init_child()
162 	*((__le64 *) value_ptr(parent, index)) =  in init_child()
199 static void __rebalance2(struct dm_btree_info *info, struct btree_node *parent,  in __rebalance2()  argument
214 		delete_at(parent, r->index);  in __rebalance2()
227 		*key_ptr(parent, r->index) = right->keys[0];  in __rebalance2()
235 	struct btree_node *parent;  in rebalance2()  local
238 	parent = dm_block_data(shadow_current(s));  in rebalance2()
240 	r = init_child(info, vt, parent, left_index, &left);  in rebalance2()
244 	r = init_child(info, vt, parent, left_index + 1, &right);  in rebalance2()
250 	__rebalance2(info, parent, &left, &right);  in rebalance2()
263 static void delete_center_node(struct dm_btree_info *info, struct btree_node *parent,  in delete_center_node()  argument
282 	*key_ptr(parent, r->index) = right->keys[0];  in delete_center_node()
284 	delete_at(parent, c->index);  in delete_center_node()
288 	__rebalance2(info, parent, l, r);  in delete_center_node()
294 static void redistribute3(struct dm_btree_info *info, struct btree_node *parent,  in redistribute3()  argument
337 	*key_ptr(parent, c->index) = center->keys[0];  in redistribute3()
338 	*key_ptr(parent, r->index) = right->keys[0];  in redistribute3()
341 static void __rebalance3(struct dm_btree_info *info, struct btree_node *parent,  in __rebalance3()  argument
358 		delete_center_node(info, parent, l, c, r, left, center, right,  in __rebalance3()
361 		redistribute3(info, parent, l, c, r, left, center, right,  in __rebalance3()
369 	struct btree_node *parent = dm_block_data(shadow_current(s));  in rebalance3()  local
375 	r = init_child(info, vt, parent, left_index, &left);  in rebalance3()
379 	r = init_child(info, vt, parent, left_index + 1, &center);  in rebalance3()
385 	r = init_child(info, vt, parent, left_index + 2, &right);  in rebalance3()
392 	__rebalance3(info, parent, &left, &center, &right);  in rebalance3()