Lines Matching refs:nodes
60 if (!p->nodes[i] || !p->locks[i]) in btrfs_set_path_blocking()
62 btrfs_set_lock_blocking_rw(p->nodes[i], p->locks[i]); in btrfs_set_path_blocking()
93 if (p->nodes[i] && p->locks[i]) { in btrfs_clear_path_blocking()
94 btrfs_clear_lock_blocking_rw(p->nodes[i], p->locks[i]); in btrfs_clear_path_blocking()
127 if (!p->nodes[i]) in btrfs_release_path()
130 btrfs_tree_unlock_rw(p->nodes[i], p->locks[i]); in btrfs_release_path()
133 free_extent_buffer(p->nodes[i]); in btrfs_release_path()
134 p->nodes[i] = NULL; in btrfs_release_path()
1903 mid = path->nodes[level]; in balance_level()
1912 parent = path->nodes[level + 1]; in balance_level()
1950 path->nodes[level] = NULL; in balance_level()
2071 path->nodes[level] = left; in balance_level()
2085 btrfs_node_blockptr(path->nodes[level], path->slots[level])) in balance_level()
2093 if (path->nodes[level] != left) in balance_level()
2120 mid = path->nodes[level]; in push_nodes_for_insert()
2124 parent = path->nodes[level + 1]; in push_nodes_for_insert()
2164 path->nodes[level] = left; in push_nodes_for_insert()
2218 path->nodes[level] = right; in push_nodes_for_insert()
2260 if (!path->nodes[level]) in reada_for_search()
2263 node = path->nodes[level]; in reada_for_search()
2317 parent = path->nodes[level + 1]; in reada_for_balance()
2376 if (!path->nodes[i]) in unlock_up()
2386 t = path->nodes[i]; in unlock_up()
2396 t = path->nodes[i]; in unlock_up()
2426 if (!path->nodes[i]) in btrfs_unlock_up_safe()
2430 btrfs_tree_unlock_rw(path->nodes[i], path->locks[i]); in btrfs_unlock_up_safe()
2553 b = p->nodes[level]; in setup_nodes_for_search()
2573 b = p->nodes[level]; in setup_nodes_for_search()
2641 eb = path->nodes[0]; in btrfs_find_item()
2646 eb = path->nodes[0]; in btrfs_find_item()
2689 WARN_ON(p->nodes[0] != NULL); in btrfs_search_slot()
2759 p->nodes[level] = b; in btrfs_search_slot()
2786 p->nodes[level + 1])) { in btrfs_search_slot()
2794 p->nodes[level + 1], in btrfs_search_slot()
2802 p->nodes[level] = b; in btrfs_search_slot()
2820 btrfs_tree_unlock_rw(p->nodes[u], p->locks[u]); in btrfs_search_slot()
2842 b = p->nodes[level]; in btrfs_search_slot()
2897 p->nodes[level] = b; in btrfs_search_slot()
2963 WARN_ON(p->nodes[0] != NULL); in btrfs_search_old_slot()
2977 p->nodes[level] = b; in btrfs_search_old_slot()
3033 p->nodes[level] = b; in btrfs_search_old_slot()
3080 leaf = p->nodes[0]; in btrfs_search_slot_for_read()
3104 leaf = p->nodes[0]; in btrfs_search_slot_for_read()
3143 if (!path->nodes[i]) in fixup_low_keys()
3145 t = path->nodes[i]; in fixup_low_keys()
3148 btrfs_mark_buffer_dirty(path->nodes[i]); in fixup_low_keys()
3168 eb = path->nodes[0]; in btrfs_set_item_key_safe()
3341 BUG_ON(path->nodes[level]); in insert_new_root()
3342 BUG_ON(path->nodes[level-1] != root->node); in insert_new_root()
3344 lower = path->nodes[level-1]; in insert_new_root()
3389 path->nodes[level] = c; in insert_new_root()
3411 BUG_ON(!path->nodes[level]); in insert_ptr()
3412 btrfs_assert_tree_locked(path->nodes[level]); in insert_ptr()
3413 lower = path->nodes[level]; in insert_ptr()
3459 c = path->nodes[level]; in split_node()
3477 c = path->nodes[level]; in split_node()
3532 path->nodes[level] = split; in split_node()
3600 struct extent_buffer *left = path->nodes[0]; in __push_leaf_right()
3601 struct extent_buffer *upper = path->nodes[1]; in __push_leaf_right()
3713 if (btrfs_header_nritems(path->nodes[0]) == 0) in __push_leaf_right()
3714 clean_tree_block(trans, root->fs_info, path->nodes[0]); in __push_leaf_right()
3715 btrfs_tree_unlock(path->nodes[0]); in __push_leaf_right()
3716 free_extent_buffer(path->nodes[0]); in __push_leaf_right()
3717 path->nodes[0] = right; in __push_leaf_right()
3746 struct extent_buffer *left = path->nodes[0]; in push_leaf_right()
3754 if (!path->nodes[1]) in push_leaf_right()
3758 upper = path->nodes[1]; in push_leaf_right()
3762 btrfs_assert_tree_locked(path->nodes[1]); in push_leaf_right()
3796 path->nodes[0] = right; in push_leaf_right()
3826 struct extent_buffer *right = path->nodes[0]; in __push_leaf_left()
3946 btrfs_tree_unlock(path->nodes[0]); in __push_leaf_left()
3947 free_extent_buffer(path->nodes[0]); in __push_leaf_left()
3948 path->nodes[0] = left; in __push_leaf_left()
3975 struct extent_buffer *right = path->nodes[0]; in push_leaf_left()
3985 if (!path->nodes[1]) in push_leaf_left()
3992 btrfs_assert_tree_locked(path->nodes[1]); in push_leaf_left()
3994 left = read_node_slot(root, path->nodes[1], slot - 1); in push_leaf_left()
4009 path->nodes[1], slot - 1, &left); in push_leaf_left()
4086 btrfs_tree_unlock(path->nodes[0]); in copy_for_split()
4087 free_extent_buffer(path->nodes[0]); in copy_for_split()
4088 path->nodes[0] = right; in copy_for_split()
4121 if (slot < btrfs_header_nritems(path->nodes[0])) in push_for_double_split()
4122 space_needed -= btrfs_leaf_free_space(root, path->nodes[0]); in push_for_double_split()
4135 nritems = btrfs_header_nritems(path->nodes[0]); in push_for_double_split()
4143 if (btrfs_leaf_free_space(root, path->nodes[0]) >= data_size) in push_for_double_split()
4185 l = path->nodes[0]; in split_leaf()
4192 if (data_size && path->nodes[1]) { in split_leaf()
4208 l = path->nodes[0]; in split_leaf()
4215 if (!path->nodes[1]) { in split_leaf()
4222 l = path->nodes[0]; in split_leaf()
4294 btrfs_tree_unlock(path->nodes[0]); in split_leaf()
4295 free_extent_buffer(path->nodes[0]); in split_leaf()
4296 path->nodes[0] = right; in split_leaf()
4303 btrfs_tree_unlock(path->nodes[0]); in split_leaf()
4304 free_extent_buffer(path->nodes[0]); in split_leaf()
4305 path->nodes[0] = right; in split_leaf()
4327 if (btrfs_leaf_free_space(root, path->nodes[0]) >= data_size) in split_leaf()
4343 leaf = path->nodes[0]; in setup_leaf_for_split()
4370 leaf = path->nodes[0]; in setup_leaf_for_split()
4376 if (btrfs_leaf_free_space(root, path->nodes[0]) >= ins_len) in setup_leaf_for_split()
4415 leaf = path->nodes[0]; in split_item()
4518 leaf = path->nodes[0]; in btrfs_duplicate_item()
4529 leaf = path->nodes[0]; in btrfs_duplicate_item()
4559 leaf = path->nodes[0]; in btrfs_truncate_item()
4657 leaf = path->nodes[0]; in btrfs_extend_item()
4733 leaf = path->nodes[0]; in setup_items_for_insert()
4851 leaf = path->nodes[0]; in btrfs_insert_item()
4869 struct extent_buffer *parent = path->nodes[level]; in del_ptr()
4953 leaf = path->nodes[0]; in btrfs_del_items()
5019 if (path->nodes[0] == leaf && in btrfs_del_items()
5038 if (path->nodes[0] == leaf) in btrfs_del_items()
5063 btrfs_item_key_to_cpu(path->nodes[0], &key, 0); in btrfs_prev_leaf()
5082 btrfs_item_key(path->nodes[0], &found_key, 0); in btrfs_prev_leaf()
5138 WARN_ON(path->nodes[level]); in btrfs_search_forward()
5139 path->nodes[level] = cur; in btrfs_search_forward()
5207 path->nodes[level - 1] = cur; in btrfs_search_forward()
5226 path->nodes[*level - 1] = read_node_slot(root, path->nodes[*level], in tree_move_down()
5238 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
5248 free_extent_buffer(path->nodes[*level]); in tree_move_next_or_upnext()
5249 path->nodes[*level] = NULL; in tree_move_next_or_upnext()
5253 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
5279 btrfs_item_key_to_cpu(path->nodes[*level], key, in tree_advance()
5282 btrfs_node_key_to_cpu(path->nodes[*level], key, in tree_advance()
5297 len1 = btrfs_item_size_nr(left_path->nodes[0], left_path->slots[0]); in tree_compare_item()
5298 len2 = btrfs_item_size_nr(right_path->nodes[0], right_path->slots[0]); in tree_compare_item()
5302 off1 = btrfs_item_ptr_offset(left_path->nodes[0], left_path->slots[0]); in tree_compare_item()
5303 off2 = btrfs_item_ptr_offset(right_path->nodes[0], in tree_compare_item()
5306 read_extent_buffer(left_path->nodes[0], tmp_buf, off1, len1); in tree_compare_item()
5308 cmp = memcmp_extent_buffer(right_path->nodes[0], tmp_buf, off2, len1); in tree_compare_item()
5415 left_path->nodes[left_level] = left_root->commit_root; in btrfs_compare_trees()
5416 extent_buffer_get(left_path->nodes[left_level]); in btrfs_compare_trees()
5420 right_path->nodes[right_level] = right_root->commit_root; in btrfs_compare_trees()
5421 extent_buffer_get(right_path->nodes[right_level]); in btrfs_compare_trees()
5425 btrfs_item_key_to_cpu(left_path->nodes[left_level], in btrfs_compare_trees()
5428 btrfs_node_key_to_cpu(left_path->nodes[left_level], in btrfs_compare_trees()
5431 btrfs_item_key_to_cpu(right_path->nodes[right_level], in btrfs_compare_trees()
5434 btrfs_node_key_to_cpu(right_path->nodes[right_level], in btrfs_compare_trees()
5512 WARN_ON(!extent_buffer_uptodate(left_path->nodes[0])); in btrfs_compare_trees()
5535 left_path->nodes[left_level], in btrfs_compare_trees()
5538 right_path->nodes[right_level], in btrfs_compare_trees()
5541 left_path->nodes[left_level], in btrfs_compare_trees()
5544 right_path->nodes[right_level], in btrfs_compare_trees()
5592 if (!path->nodes[level]) in btrfs_find_next_key()
5596 c = path->nodes[level]; in btrfs_find_next_key()
5603 !path->nodes[level + 1]) in btrfs_find_next_key()
5626 c = path->nodes[level]; in btrfs_find_next_key()
5672 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_next_old_leaf()
5676 btrfs_item_key_to_cpu(path->nodes[0], &key, nritems - 1); in btrfs_next_old_leaf()
5695 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_next_old_leaf()
5728 if (!path->nodes[level]) { in btrfs_next_old_leaf()
5734 c = path->nodes[level]; in btrfs_next_old_leaf()
5789 c = path->nodes[level]; in btrfs_next_old_leaf()
5794 path->nodes[level] = next; in btrfs_next_old_leaf()
5856 leaf = path->nodes[0]; in btrfs_previous_item()
5898 leaf = path->nodes[0]; in btrfs_previous_extent_item()