Lines Matching refs:r
146 int r, inc; in init_child() local
152 r = dm_tm_shadow_block(info->tm, root, &btree_node_validator, in init_child()
154 if (r) in init_child()
155 return r; in init_child()
200 struct child *l, struct child *r) in __rebalance2() argument
203 struct btree_node *right = r->n; in __rebalance2()
214 delete_at(parent, r->index); in __rebalance2()
220 dm_tm_dec(info->tm, dm_block_location(r->block)); in __rebalance2()
227 *key_ptr(parent, r->index) = right->keys[0]; in __rebalance2()
234 int r; in rebalance2() local
240 r = init_child(info, vt, parent, left_index, &left); in rebalance2()
241 if (r) in rebalance2()
242 return r; in rebalance2()
244 r = init_child(info, vt, parent, left_index + 1, &right); in rebalance2()
245 if (r) { in rebalance2()
247 return r; in rebalance2()
264 struct child *l, struct child *c, struct child *r, in delete_center_node() argument
282 *key_ptr(parent, r->index) = right->keys[0]; in delete_center_node()
285 r->index--; in delete_center_node()
288 __rebalance2(info, parent, l, r); in delete_center_node()
295 struct child *l, struct child *c, struct child *r, in redistribute3() argument
338 *key_ptr(parent, r->index) = right->keys[0]; in redistribute3()
342 struct child *l, struct child *c, struct child *r) in __rebalance3() argument
346 struct btree_node *right = r->n; in __rebalance3()
358 delete_center_node(info, parent, l, c, r, left, center, right, in __rebalance3()
361 redistribute3(info, parent, l, c, r, left, center, right, in __rebalance3()
368 int r; in rebalance3() local
375 r = init_child(info, vt, parent, left_index, &left); in rebalance3()
376 if (r) in rebalance3()
377 return r; in rebalance3()
379 r = init_child(info, vt, parent, left_index + 1, ¢er); in rebalance3()
380 if (r) { in rebalance3()
382 return r; in rebalance3()
385 r = init_child(info, vt, parent, left_index + 2, &right); in rebalance3()
386 if (r) { in rebalance3()
389 return r; in rebalance3()
405 int i, r, has_left_sibling, has_right_sibling; in rebalance_children() local
414 r = dm_tm_read_lock(info->tm, b, &btree_node_validator, &child); in rebalance_children()
415 if (r) in rebalance_children()
416 return r; in rebalance_children()
434 r = rebalance2(s, info, vt, i); in rebalance_children()
437 r = rebalance2(s, info, vt, i - 1); in rebalance_children()
440 r = rebalance3(s, info, vt, i - 1); in rebalance_children()
442 return r; in rebalance_children()
467 int i = *index, r; in remove_raw() local
471 r = shadow_step(s, root, vt); in remove_raw()
472 if (r < 0) in remove_raw()
491 r = rebalance_children(s, info, vt, key); in remove_raw()
492 if (r) in remove_raw()
509 return r; in remove_raw()
516 int index = 0, r = 0; in dm_btree_remove() local
524 r = remove_raw(&spine, info, in dm_btree_remove()
528 if (r < 0) in dm_btree_remove()
549 return r; in dm_btree_remove()
559 int i = *index, r; in remove_nearest() local
563 r = shadow_step(s, root, vt); in remove_nearest()
564 if (r < 0) in remove_nearest()
585 r = rebalance_children(s, info, vt, key); in remove_nearest()
586 if (r) in remove_nearest()
605 return r; in remove_nearest()
613 int index = 0, r = 0; in remove_one() local
622 r = remove_raw(&spine, info, &le64_vt, in remove_one()
624 if (r < 0) in remove_one()
631 r = remove_nearest(&spine, info, &info->value_type, in remove_one()
633 if (r < 0) in remove_one()
642 r = -ENODATA; in remove_one()
656 r = -ENODATA; in remove_one()
662 return r; in remove_one()
669 int r; in dm_btree_remove_leaves() local
673 r = remove_one(info, root, first_key, end_key, &root, nr_removed); in dm_btree_remove_leaves()
674 if (!r) in dm_btree_remove_leaves()
676 } while (!r); in dm_btree_remove_leaves()
679 return r == -ENODATA ? 0 : r; in dm_btree_remove_leaves()