D | dm-btree-remove.c | 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, in delete_center_node() argument 278 node_copy(left, center, -shift); in delete_center_node() 285 node_copy(center, right, shift); in delete_center_node() 302 struct btree_node *left, struct btree_node *center, struct btree_node *right, in redistribute3() argument 320 shift(left, center, -nr_center); in redistribute3() 325 shift(left, center, s); in redistribute3() 327 shift(center, right, target_right - nr_right); in redistribute3() 333 shift(center, right, nr_center); in redistribute3() 338 shift(center, right, s); in redistribute3() [all …]
|