Lines Matching defs:center
265 * We dump as many entries from center as possible into left, then the rest
271 struct btree_node *left, struct btree_node *center, struct btree_node *right,
278 node_copy(left, center, -shift);
285 node_copy(center, right, shift);
302 struct btree_node *left, struct btree_node *center, struct btree_node *right,
320 shift(left, center, -nr_center);
325 shift(left, center, s);
327 shift(center, right, target_right - nr_right);
333 shift(center, right, nr_center);
338 shift(center, right, s);
340 shift(left, center, nr_left - target_left);
343 *key_ptr(parent, c->index) = center->keys[0];
351 struct btree_node *center = c->n;
355 uint32_t nr_center = le32_to_cpu(center->header.nr_entries);
360 BUG_ON(left->header.max_entries != center->header.max_entries);
361 BUG_ON(center->header.max_entries != right->header.max_entries);
364 delete_center_node(info, parent, l, c, r, left, center, right,
367 redistribute3(info, parent, l, c, r, left, center, right,
376 struct child left, center, right;
385 r = init_child(info, vt, parent, left_index + 1, ¢er);
394 exit_child(info, ¢er);
398 __rebalance3(info, parent, &left, ¢er, &right);
401 exit_child(info, ¢er);