Lines Matching refs:center
262 * We dump as many entries from center as possible into left, then the rest
268 struct btree_node *left, struct btree_node *center, struct btree_node *right,
275 node_copy(left, center, -shift);
282 node_copy(center, right, shift);
299 struct btree_node *left, struct btree_node *center, struct btree_node *right,
312 shift(left, center, nr_center);
317 shift(left, center, s);
319 shift(center, right, target - nr_right);
325 shift(center, right, nr_center);
330 shift(center, right, s);
332 shift(left, center, nr_left - target);
335 *key_ptr(parent, c->index) = center->keys[0];
343 struct btree_node *center = c->n;
347 uint32_t nr_center = le32_to_cpu(center->header.nr_entries);
352 BUG_ON(left->header.max_entries != center->header.max_entries);
353 BUG_ON(center->header.max_entries != right->header.max_entries);
356 delete_center_node(info, parent, l, c, r, left, center, right,
359 redistribute3(info, parent, l, c, r, left, center, right,
368 struct child left, center, right;
377 r = init_child(info, vt, parent, left_index + 1, ¢er);
386 exit_child(info, ¢er);
390 __rebalance3(info, parent, &left, ¢er, &right);
394 exit_child(info, ¢er);
399 r = exit_child(info, ¢er);