Lines Matching refs:right

886 	struct extent_buffer *right = NULL;  in balance_level()  local
976 right = btrfs_read_node_slot(parent, pslot + 1); in balance_level()
977 if (IS_ERR(right)) in balance_level()
978 right = NULL; in balance_level()
980 if (right) { in balance_level()
981 __btrfs_tree_lock(right, BTRFS_NESTING_RIGHT); in balance_level()
982 wret = btrfs_cow_block(trans, root, right, in balance_level()
983 parent, pslot + 1, &right, in balance_level()
1002 if (right) { in balance_level()
1003 wret = push_node_left(trans, mid, right, 1); in balance_level()
1006 if (btrfs_header_nritems(right) == 0) { in balance_level()
1007 btrfs_clean_tree_block(right); in balance_level()
1008 btrfs_tree_unlock(right); in balance_level()
1010 root_sub_used(root, right->len); in balance_level()
1011 btrfs_free_tree_block(trans, btrfs_root_id(root), right, in balance_level()
1013 free_extent_buffer_stale(right); in balance_level()
1014 right = NULL; in balance_level()
1017 btrfs_node_key(right, &right_key, 0); in balance_level()
1093 if (right) { in balance_level()
1094 btrfs_tree_unlock(right); in balance_level()
1095 free_extent_buffer(right); in balance_level()
1114 struct extent_buffer *right = NULL; in push_nodes_for_insert() local
1189 right = btrfs_read_node_slot(parent, pslot + 1); in push_nodes_for_insert()
1190 if (IS_ERR(right)) in push_nodes_for_insert()
1191 right = NULL; in push_nodes_for_insert()
1196 if (right) { in push_nodes_for_insert()
1199 __btrfs_tree_lock(right, BTRFS_NESTING_RIGHT); in push_nodes_for_insert()
1201 right_nr = btrfs_header_nritems(right); in push_nodes_for_insert()
1205 ret = btrfs_cow_block(trans, root, right, in push_nodes_for_insert()
1207 &right, BTRFS_NESTING_RIGHT_COW); in push_nodes_for_insert()
1211 wret = balance_node_right(trans, right, mid); in push_nodes_for_insert()
1219 btrfs_node_key(right, &disk_key, 0); in push_nodes_for_insert()
1227 path->nodes[level] = right; in push_nodes_for_insert()
1234 btrfs_tree_unlock(right); in push_nodes_for_insert()
1235 free_extent_buffer(right); in push_nodes_for_insert()
1239 btrfs_tree_unlock(right); in push_nodes_for_insert()
1240 free_extent_buffer(right); in push_nodes_for_insert()
2501 struct extent_buffer *right) in check_sibling_keys() argument
2507 int nr_right = btrfs_header_nritems(right); in check_sibling_keys()
2515 btrfs_node_key_to_cpu(right, &right_first, 0); in check_sibling_keys()
2518 btrfs_item_key_to_cpu(right, &right_first, 0); in check_sibling_keys()
2930 struct extent_buffer *right, in __push_leaf_right() argument
2934 struct btrfs_fs_info *fs_info = right->fs_info; in __push_leaf_right()
2991 right_nritems = btrfs_header_nritems(right); in __push_leaf_right()
2997 data_end = leaf_data_end(right); in __push_leaf_right()
2998 memmove_extent_buffer(right, in __push_leaf_right()
3004 copy_extent_buffer(right, left, BTRFS_LEAF_DATA_OFFSET + in __push_leaf_right()
3009 memmove_extent_buffer(right, btrfs_item_nr_offset(push_items), in __push_leaf_right()
3014 copy_extent_buffer(right, left, btrfs_item_nr_offset(0), in __push_leaf_right()
3019 btrfs_init_map_token(&token, right); in __push_leaf_right()
3021 btrfs_set_header_nritems(right, right_nritems); in __push_leaf_right()
3036 btrfs_mark_buffer_dirty(right); in __push_leaf_right()
3038 btrfs_item_key(right, &disk_key, 0); in __push_leaf_right()
3049 path->nodes[0] = right; in __push_leaf_right()
3052 btrfs_tree_unlock(right); in __push_leaf_right()
3053 free_extent_buffer(right); in __push_leaf_right()
3058 btrfs_tree_unlock(right); in __push_leaf_right()
3059 free_extent_buffer(right); in __push_leaf_right()
3079 struct extent_buffer *right; in push_leaf_right() local
3096 right = btrfs_read_node_slot(upper, slot + 1); in push_leaf_right()
3101 if (IS_ERR(right)) in push_leaf_right()
3104 __btrfs_tree_lock(right, BTRFS_NESTING_RIGHT); in push_leaf_right()
3106 free_space = btrfs_leaf_free_space(right); in push_leaf_right()
3110 ret = btrfs_cow_block(trans, root, right, upper, in push_leaf_right()
3111 slot + 1, &right, BTRFS_NESTING_RIGHT_COW); in push_leaf_right()
3119 if (check_sibling_keys(left, right)) { in push_leaf_right()
3121 btrfs_tree_unlock(right); in push_leaf_right()
3122 free_extent_buffer(right); in push_leaf_right()
3132 path->nodes[0] = right; in push_leaf_right()
3139 right, free_space, left_nritems, min_slot); in push_leaf_right()
3141 btrfs_tree_unlock(right); in push_leaf_right()
3142 free_extent_buffer(right); in push_leaf_right()
3161 struct extent_buffer *right = path->nodes[0]; in __push_leaf_left() local
3182 int space = btrfs_leaf_free_space(right); in __push_leaf_left()
3192 this_item_size = btrfs_item_size(right, i); in __push_leaf_left()
3205 WARN_ON(!empty && push_items == btrfs_header_nritems(right)); in __push_leaf_left()
3208 copy_extent_buffer(left, right, in __push_leaf_left()
3214 btrfs_item_offset(right, push_items - 1); in __push_leaf_left()
3216 copy_extent_buffer(left, right, BTRFS_LEAF_DATA_OFFSET + in __push_leaf_left()
3219 btrfs_item_offset(right, push_items - 1), in __push_leaf_left()
3241 push_space = btrfs_item_offset(right, push_items - 1) - in __push_leaf_left()
3242 leaf_data_end(right); in __push_leaf_left()
3243 memmove_extent_buffer(right, BTRFS_LEAF_DATA_OFFSET + in __push_leaf_left()
3246 leaf_data_end(right), push_space); in __push_leaf_left()
3248 memmove_extent_buffer(right, btrfs_item_nr_offset(0), in __push_leaf_left()
3250 (btrfs_header_nritems(right) - push_items) * in __push_leaf_left()
3254 btrfs_init_map_token(&token, right); in __push_leaf_left()
3256 btrfs_set_header_nritems(right, right_nritems); in __push_leaf_left()
3265 btrfs_mark_buffer_dirty(right); in __push_leaf_left()
3267 btrfs_clean_tree_block(right); in __push_leaf_left()
3269 btrfs_item_key(right, &disk_key, 0); in __push_leaf_left()
3304 struct extent_buffer *right = path->nodes[0]; in push_leaf_left() local
3317 right_nritems = btrfs_header_nritems(right); in push_leaf_left()
3349 if (check_sibling_keys(left, right)) { in push_leaf_left()
3369 struct extent_buffer *right, in copy_for_split() argument
3380 btrfs_set_header_nritems(right, nritems); in copy_for_split()
3383 copy_extent_buffer(right, l, btrfs_item_nr_offset(0), in copy_for_split()
3387 copy_extent_buffer(right, l, in copy_for_split()
3394 btrfs_init_map_token(&token, right); in copy_for_split()
3403 btrfs_item_key(right, &disk_key, 0); in copy_for_split()
3404 insert_ptr(trans, path, &disk_key, right->start, path->slots[1] + 1, 1); in copy_for_split()
3406 btrfs_mark_buffer_dirty(right); in copy_for_split()
3413 path->nodes[0] = right; in copy_for_split()
3417 btrfs_tree_unlock(right); in copy_for_split()
3418 free_extent_buffer(right); in copy_for_split()
3505 struct extent_buffer *right; in split_leaf() local
3608 right = btrfs_alloc_tree_block(trans, root, 0, root->root_key.objectid, in split_leaf()
3612 if (IS_ERR(right)) in split_leaf()
3613 return PTR_ERR(right); in split_leaf()
3619 btrfs_set_header_nritems(right, 0); in split_leaf()
3621 right->start, path->slots[1] + 1, 1); in split_leaf()
3624 path->nodes[0] = right; in split_leaf()
3628 btrfs_set_header_nritems(right, 0); in split_leaf()
3630 right->start, path->slots[1], 1); in split_leaf()
3633 path->nodes[0] = right; in split_leaf()
3646 copy_for_split(trans, path, l, right, slot, mid, nritems); in split_leaf()