265 			       struct btree_node *left, struct btree_node *center, struct btree_node *right,  in delete_center_node()  argument
272 	node_copy(left, center, -shift);  in delete_center_node()
279 		node_copy(center, right, shift);  in delete_center_node()
296 			  struct btree_node *left, struct btree_node *center, struct btree_node *right,  in redistribute3()  argument
314 			shift(left, center, -nr_center);  in redistribute3()
319 			shift(left, center, s);  in redistribute3()
321 		shift(center, right, target_right - nr_right);  in redistribute3()
327 			shift(center, right, nr_center);  in redistribute3()
332 			shift(center, right, s);  in redistribute3()
334 		shift(left, center, nr_left - target_left);  in redistribute3()
337 	*key_ptr(parent, c->index) = center->keys[0];  in redistribute3()
345 	struct btree_node *center = c->n;  in __rebalance3()  local
349 	uint32_t nr_center = le32_to_cpu(center->header.nr_entries);  in __rebalance3()
354 	BUG_ON(left->header.max_entries != center->header.max_entries);  in __rebalance3()
355 	BUG_ON(center->header.max_entries != right->header.max_entries);  in __rebalance3()
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()
370 	struct child left, center, right;  in rebalance3()  local
379 	r = init_child(info, vt, parent, left_index + 1, &center);  in rebalance3()
388 		exit_child(info, &center);  in rebalance3()
392 	__rebalance3(info, parent, &left, &center, &right);  in rebalance3()
395 	exit_child(info, &center);  in rebalance3()