Lines Matching +defs:r +defs:left
86 static int node_copy(struct btree_node *left, struct btree_node *right, int shift) in node_copy()
165 int r, inc; in init_child() local
192 static int shift(struct btree_node *left, struct btree_node *right, int count) in shift()
194 int r; in shift() local
237 struct child *l, struct child *r) in __rebalance2()
240 struct btree_node *left = l->n; in __rebalance2() local
282 int r; in rebalance2() local
284 struct child left, right; in rebalance2() local
312 struct child *l, struct child *c, struct child *r, in delete_center_node()
313 struct btree_node *left, struct btree_node *center, struct btree_node *right, in delete_center_node()
352 struct child *l, struct child *c, struct child *r, in redistribute3()
353 struct btree_node *left, struct btree_node *center, struct btree_node *right, in redistribute3()
419 struct child *l, struct child *c, struct child *r) in __rebalance3()
421 struct btree_node *left = l->n; in __rebalance3() local
449 int r; in rebalance3() local
451 struct child left, center, right; in rebalance3() local
486 int i, r, has_left_sibling, has_right_sibling; in rebalance_children() local
548 int i = *index, r; in remove_raw() local
598 int index = 0, r = 0; in dm_btree_remove() local
642 int i = *index, r; in remove_nearest() local
697 int index = 0, r = 0; in remove_one() local
753 int r; in dm_btree_remove_leaves() local