307  * We dump as many entries from center as possible into left, then the rest
313 			      struct btree_node *left, struct btree_node *center, struct btree_node *right,  in delete_center_node()  argument
324 	node_copy(left, center, -shift);  in delete_center_node()
336 		node_copy(center, right, shift);  in delete_center_node()
353 			 struct btree_node *left, struct btree_node *center, struct btree_node *right,  in redistribute3()  argument
371 			ret = shift(left, center, -nr_center);  in redistribute3()
382 			ret = shift(left, center, s);  in redistribute3()
387 		ret = shift(center, right, target_right - nr_right);  in redistribute3()
394 			ret = shift(center, right, nr_center);  in redistribute3()
403 			ret = shift(center, right, s);  in redistribute3()
408 		ret = shift(left, center, nr_left - target_left);  in redistribute3()
413 	*key_ptr(parent, c->index) = center->keys[0];  in redistribute3()
422 	struct btree_node *center = c->n;  in __rebalance3()  local
426 	uint32_t nr_center = le32_to_cpu(center->header.nr_entries);  in __rebalance3()
431 	if ((left->header.max_entries != center->header.max_entries) ||  in __rebalance3()
432 	    (center->header.max_entries != right->header.max_entries)) {  in __rebalance3()
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()
451 	struct child left, center, right;  in rebalance3()  local
460 	r = init_child(info, vt, parent, left_index + 1, &center);  in rebalance3()
469 		exit_child(info, &center);  in rebalance3()
473 	r = __rebalance3(info, parent, &left, &center, &right);  in rebalance3()
476 	exit_child(info, &center);  in rebalance3()