131 	int r;  in dm_btree_empty()  local
213 	int r;  in push_frame()  local
275 	int r;  in dm_btree_del()  local
347 	int i, r;  in btree_lookup_raw()  local
378 	int r = -ENODATA;  in dm_btree_lookup()  local
422 	int r, i;  in dm_btree_lookup_next_single()  local
474 	int r = -ENODATA;  in dm_btree_lookup_next()  local
553 static void redistribute2(struct btree_node *left, struct btree_node *right)  in redistribute2()
582 static void redistribute3(struct btree_node *left, struct btree_node *center,  in redistribute3()
657 	int r;  in split_one_into_two()  local
658 	struct dm_block *left, *right, *parent;  in split_one_into_two()  local
711 	int r, inc;  in shadow_child()  local
740 	int r;  in split_two_into_three()  local
742 	struct dm_block *left, *middle, *right, *parent;  in split_two_into_three()  local
840 	int r;  in btree_split_beneath()  local
843 	struct dm_block *left, *right, *new_parent;  in btree_split_beneath()  local
918 	int r;  in rebalance_left()  local
920 	struct btree_node *left, *right, *parent = dm_block_data(shadow_parent(s));  in rebalance_left()  local
947 	int r;  in rebalance_right()  local
949 	struct btree_node *left, *right, *parent = dm_block_data(shadow_parent(s));  in rebalance_right()  local
975 	int r;  in get_node_free_space()  local
1004 	int r;  in rebalance_or_split()  local
1096 	int r, i = *index, top = 1;  in btree_insert_raw()  local
1159 	int r, i = -1;  in __btree_get_overwrite_leaf()  local
1206 	int r;  in btree_get_overwrite_leaf()  local
1239 	int r;  in insert()  local
1343 	int i, r;  in find_key()  local
1380 	int r = 0, count = 0, level;  in dm_btree_find_key()  local
1425 	int r;  in walk_node()  local
1494 	int r;  in push_node()  local
1545 	int r = 0;  in find_leaf()  local
1574 	int r;  in dm_btree_cursor_begin()  local
1598 	int r = inc_or_backtrack(c);  in dm_btree_cursor_next()  local
1612 	int r = 0;  in dm_btree_cursor_skip()  local