Lines Matching defs:center
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,
324 node_copy(left, center, -shift);
336 node_copy(center, right, shift);
353 struct btree_node *left, struct btree_node *center, struct btree_node *right,
371 ret = shift(left, center, -nr_center);
382 ret = shift(left, center, s);
387 ret = shift(center, right, target_right - nr_right);
394 ret = shift(center, right, nr_center);
403 ret = shift(center, right, s);
408 ret = shift(left, center, nr_left - target_left);
413 *key_ptr(parent, c->index) = center->keys[0];
422 struct btree_node *center = c->n;
426 uint32_t nr_center = le32_to_cpu(center->header.nr_entries);
431 if ((left->header.max_entries != center->header.max_entries) ||
432 (center->header.max_entries != right->header.max_entries)) {
438 return delete_center_node(info, parent, l, c, r, left, center, right,
442 return redistribute3(info, parent, l, c, r, left, center, right,
451 struct child left, center, right;
460 r = init_child(info, vt, parent, left_index + 1, ¢er);
469 exit_child(info, ¢er);
473 r = __rebalance3(info, parent, &left, ¢er, &right);
476 exit_child(info, ¢er);