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()
252 r = exit_child(info, &left); in rebalance2()
253 if (r) { in rebalance2()
255 return r; in rebalance2()
267 struct child *l, struct child *c, struct child *r, in delete_center_node() argument
285 *key_ptr(parent, r->index) = right->keys[0]; in delete_center_node()
288 r->index--; in delete_center_node()
291 __rebalance2(info, parent, l, r); in delete_center_node()
298 struct child *l, struct child *c, struct child *r, in redistribute3() argument
341 *key_ptr(parent, r->index) = right->keys[0]; in redistribute3()
345 struct child *l, struct child *c, struct child *r) in __rebalance3() argument
349 struct btree_node *right = r->n; in __rebalance3()
361 delete_center_node(info, parent, l, c, r, left, center, right, in __rebalance3()
364 redistribute3(info, parent, l, c, r, left, center, right, in __rebalance3()
371 int r; in rebalance3() local
378 r = init_child(info, vt, parent, left_index, &left); in rebalance3()
379 if (r) in rebalance3()
380 return r; in rebalance3()
382 r = init_child(info, vt, parent, left_index + 1, ¢er); in rebalance3()
383 if (r) { in rebalance3()
385 return r; in rebalance3()
388 r = init_child(info, vt, parent, left_index + 2, &right); in rebalance3()
389 if (r) { in rebalance3()
392 return r; in rebalance3()
397 r = exit_child(info, &left); in rebalance3()
398 if (r) { in rebalance3()
401 return r; in rebalance3()
404 r = exit_child(info, ¢er); in rebalance3()
405 if (r) { in rebalance3()
407 return r; in rebalance3()
410 r = exit_child(info, &right); in rebalance3()
411 if (r) in rebalance3()
412 return r; in rebalance3()
420 int r; in get_nr_entries() local
424 r = dm_tm_read_lock(tm, b, &btree_node_validator, &block); in get_nr_entries()
425 if (r) in get_nr_entries()
426 return r; in get_nr_entries()
438 int i, r, has_left_sibling, has_right_sibling; in rebalance_children() local
448 r = dm_tm_read_lock(info->tm, b, &btree_node_validator, &child); in rebalance_children()
449 if (r) in rebalance_children()
450 return r; in rebalance_children()
454 r = dm_tm_unlock(info->tm, child); in rebalance_children()
455 if (r) in rebalance_children()
456 return r; in rebalance_children()
466 r = get_nr_entries(info->tm, value64(n, i), &child_entries); in rebalance_children()
467 if (r) in rebalance_children()
468 return r; in rebalance_children()
474 r = rebalance2(s, info, vt, i); in rebalance_children()
477 r = rebalance2(s, info, vt, i - 1); in rebalance_children()
480 r = rebalance3(s, info, vt, i - 1); in rebalance_children()
482 return r; in rebalance_children()
507 int i = *index, r; in remove_raw() local
511 r = shadow_step(s, root, vt); in remove_raw()
512 if (r < 0) in remove_raw()
531 r = rebalance_children(s, info, vt, key); in remove_raw()
532 if (r) in remove_raw()
549 return r; in remove_raw()
556 int index = 0, r = 0; in dm_btree_remove() local
564 r = remove_raw(&spine, info, in dm_btree_remove()
568 if (r < 0) in dm_btree_remove()
589 return r; in dm_btree_remove()