142 static int init_child(struct dm_btree_info *info, struct dm_btree_value_type *vt,  in init_child()  argument
160 		inc_children(info->tm, result->n, vt);  in init_child()
232 		      struct dm_btree_value_type *vt, unsigned left_index)  in rebalance2()  argument
240 	r = init_child(info, vt, parent, left_index, &left);  in rebalance2()
244 	r = init_child(info, vt, parent, left_index + 1, &right);  in rebalance2()
366 		      struct dm_btree_value_type *vt, unsigned left_index)  in rebalance3()  argument
375 	r = init_child(info, vt, parent, left_index, &left);  in rebalance3()
379 	r = init_child(info, vt, parent, left_index + 1, &center);  in rebalance3()
385 	r = init_child(info, vt, parent, left_index + 2, &right);  in rebalance3()
403 			      struct dm_btree_value_type *vt, uint64_t key)  in rebalance_children()  argument
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()
464 		      struct dm_btree_value_type *vt, dm_block_t root,  in remove_raw()  argument
471 		r = shadow_step(s, root, vt);  in remove_raw()
491 		r = rebalance_children(s, info, vt, key);  in remove_raw()
556 			  struct dm_btree_value_type *vt, dm_block_t root,  in remove_nearest()  argument
563 		r = shadow_step(s, root, vt);  in remove_nearest()
585 		r = rebalance_children(s, info, vt, key);  in remove_nearest()