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()
1897 mid = path->nodes[level]; in balance_level()
1906 parent = path->nodes[level + 1]; in balance_level()
1944 path->nodes[level] = NULL; in balance_level()
2065 path->nodes[level] = left; in balance_level()
2079 btrfs_node_blockptr(path->nodes[level], path->slots[level])) in balance_level()
2087 if (path->nodes[level] != left) in balance_level()
2114 mid = path->nodes[level]; in push_nodes_for_insert()
2118 parent = path->nodes[level + 1]; in push_nodes_for_insert()
2158 path->nodes[level] = left; in push_nodes_for_insert()
2212 path->nodes[level] = right; in push_nodes_for_insert()
2254 if (!path->nodes[level]) in reada_for_search()
2257 node = path->nodes[level]; in reada_for_search()
2311 parent = path->nodes[level + 1]; in reada_for_balance()
2370 if (!path->nodes[i]) in unlock_up()
2380 t = path->nodes[i]; in unlock_up()
2390 t = path->nodes[i]; in unlock_up()
2420 if (!path->nodes[i]) in btrfs_unlock_up_safe()
2424 btrfs_tree_unlock_rw(path->nodes[i], path->locks[i]); in btrfs_unlock_up_safe()
2547 b = p->nodes[level]; in setup_nodes_for_search()
2567 b = p->nodes[level]; in setup_nodes_for_search()
2635 eb = path->nodes[0]; in btrfs_find_item()
2640 eb = path->nodes[0]; in btrfs_find_item()
2683 WARN_ON(p->nodes[0] != NULL); in btrfs_search_slot()
2753 p->nodes[level] = b; in btrfs_search_slot()
2780 p->nodes[level + 1])) { in btrfs_search_slot()
2788 p->nodes[level + 1], in btrfs_search_slot()
2796 p->nodes[level] = b; in btrfs_search_slot()
2814 btrfs_tree_unlock_rw(p->nodes[u], p->locks[u]); in btrfs_search_slot()
2836 b = p->nodes[level]; in btrfs_search_slot()
2891 p->nodes[level] = b; in btrfs_search_slot()
2957 WARN_ON(p->nodes[0] != NULL); in btrfs_search_old_slot()
2971 p->nodes[level] = b; in btrfs_search_old_slot()
3027 p->nodes[level] = b; in btrfs_search_old_slot()
3074 leaf = p->nodes[0]; in btrfs_search_slot_for_read()
3098 leaf = p->nodes[0]; in btrfs_search_slot_for_read()
3137 if (!path->nodes[i]) in fixup_low_keys()
3139 t = path->nodes[i]; in fixup_low_keys()
3142 btrfs_mark_buffer_dirty(path->nodes[i]); in fixup_low_keys()
3162 eb = path->nodes[0]; in btrfs_set_item_key_safe()
3335 BUG_ON(path->nodes[level]); in insert_new_root()
3336 BUG_ON(path->nodes[level-1] != root->node); in insert_new_root()
3338 lower = path->nodes[level-1]; in insert_new_root()
3383 path->nodes[level] = c; in insert_new_root()
3405 BUG_ON(!path->nodes[level]); in insert_ptr()
3406 btrfs_assert_tree_locked(path->nodes[level]); in insert_ptr()
3407 lower = path->nodes[level]; in insert_ptr()
3453 c = path->nodes[level]; in split_node()
3471 c = path->nodes[level]; in split_node()
3526 path->nodes[level] = split; in split_node()
3594 struct extent_buffer *left = path->nodes[0]; in __push_leaf_right()
3595 struct extent_buffer *upper = path->nodes[1]; in __push_leaf_right()
3707 if (btrfs_header_nritems(path->nodes[0]) == 0) in __push_leaf_right()
3708 clean_tree_block(trans, root->fs_info, path->nodes[0]); in __push_leaf_right()
3709 btrfs_tree_unlock(path->nodes[0]); in __push_leaf_right()
3710 free_extent_buffer(path->nodes[0]); in __push_leaf_right()
3711 path->nodes[0] = right; in __push_leaf_right()
3740 struct extent_buffer *left = path->nodes[0]; in push_leaf_right()
3748 if (!path->nodes[1]) in push_leaf_right()
3752 upper = path->nodes[1]; in push_leaf_right()
3756 btrfs_assert_tree_locked(path->nodes[1]); in push_leaf_right()
3790 path->nodes[0] = right; in push_leaf_right()
3820 struct extent_buffer *right = path->nodes[0]; in __push_leaf_left()
3940 btrfs_tree_unlock(path->nodes[0]); in __push_leaf_left()
3941 free_extent_buffer(path->nodes[0]); in __push_leaf_left()
3942 path->nodes[0] = left; in __push_leaf_left()
3969 struct extent_buffer *right = path->nodes[0]; in push_leaf_left()
3979 if (!path->nodes[1]) in push_leaf_left()
3986 btrfs_assert_tree_locked(path->nodes[1]); in push_leaf_left()
3988 left = read_node_slot(root, path->nodes[1], slot - 1); in push_leaf_left()
4003 path->nodes[1], slot - 1, &left); in push_leaf_left()
4080 btrfs_tree_unlock(path->nodes[0]); in copy_for_split()
4081 free_extent_buffer(path->nodes[0]); in copy_for_split()
4082 path->nodes[0] = right; in copy_for_split()
4115 if (slot < btrfs_header_nritems(path->nodes[0])) in push_for_double_split()
4116 space_needed -= btrfs_leaf_free_space(root, path->nodes[0]); in push_for_double_split()
4129 nritems = btrfs_header_nritems(path->nodes[0]); in push_for_double_split()
4137 if (btrfs_leaf_free_space(root, path->nodes[0]) >= data_size) in push_for_double_split()
4179 l = path->nodes[0]; in split_leaf()
4186 if (data_size && path->nodes[1]) { in split_leaf()
4202 l = path->nodes[0]; in split_leaf()
4209 if (!path->nodes[1]) { in split_leaf()
4216 l = path->nodes[0]; in split_leaf()
4288 btrfs_tree_unlock(path->nodes[0]); in split_leaf()
4289 free_extent_buffer(path->nodes[0]); in split_leaf()
4290 path->nodes[0] = right; in split_leaf()
4297 btrfs_tree_unlock(path->nodes[0]); in split_leaf()
4298 free_extent_buffer(path->nodes[0]); in split_leaf()
4299 path->nodes[0] = right; in split_leaf()
4321 if (btrfs_leaf_free_space(root, path->nodes[0]) >= data_size) in split_leaf()
4337 leaf = path->nodes[0]; in setup_leaf_for_split()
4364 leaf = path->nodes[0]; in setup_leaf_for_split()
4370 if (btrfs_leaf_free_space(root, path->nodes[0]) >= ins_len) in setup_leaf_for_split()
4409 leaf = path->nodes[0]; in split_item()
4512 leaf = path->nodes[0]; in btrfs_duplicate_item()
4523 leaf = path->nodes[0]; in btrfs_duplicate_item()
4553 leaf = path->nodes[0]; in btrfs_truncate_item()
4651 leaf = path->nodes[0]; in btrfs_extend_item()
4727 leaf = path->nodes[0]; in setup_items_for_insert()
4845 leaf = path->nodes[0]; in btrfs_insert_item()
4863 struct extent_buffer *parent = path->nodes[level]; in del_ptr()
4947 leaf = path->nodes[0]; in btrfs_del_items()
5013 if (path->nodes[0] == leaf && in btrfs_del_items()
5032 if (path->nodes[0] == leaf) in btrfs_del_items()
5057 btrfs_item_key_to_cpu(path->nodes[0], &key, 0); in btrfs_prev_leaf()
5076 btrfs_item_key(path->nodes[0], &found_key, 0); in btrfs_prev_leaf()
5132 WARN_ON(path->nodes[level]); in btrfs_search_forward()
5133 path->nodes[level] = cur; in btrfs_search_forward()
5201 path->nodes[level - 1] = cur; in btrfs_search_forward()
5220 path->nodes[*level - 1] = read_node_slot(root, path->nodes[*level], in tree_move_down()
5232 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
5242 free_extent_buffer(path->nodes[*level]); in tree_move_next_or_upnext()
5243 path->nodes[*level] = NULL; in tree_move_next_or_upnext()
5247 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
5273 btrfs_item_key_to_cpu(path->nodes[*level], key, in tree_advance()
5276 btrfs_node_key_to_cpu(path->nodes[*level], key, in tree_advance()
5291 len1 = btrfs_item_size_nr(left_path->nodes[0], left_path->slots[0]); in tree_compare_item()
5292 len2 = btrfs_item_size_nr(right_path->nodes[0], right_path->slots[0]); in tree_compare_item()
5296 off1 = btrfs_item_ptr_offset(left_path->nodes[0], left_path->slots[0]); in tree_compare_item()
5297 off2 = btrfs_item_ptr_offset(right_path->nodes[0], in tree_compare_item()
5300 read_extent_buffer(left_path->nodes[0], tmp_buf, off1, len1); in tree_compare_item()
5302 cmp = memcmp_extent_buffer(right_path->nodes[0], tmp_buf, off2, len1); in tree_compare_item()
5409 left_path->nodes[left_level] = left_root->commit_root; in btrfs_compare_trees()
5410 extent_buffer_get(left_path->nodes[left_level]); in btrfs_compare_trees()
5414 right_path->nodes[right_level] = right_root->commit_root; in btrfs_compare_trees()
5415 extent_buffer_get(right_path->nodes[right_level]); in btrfs_compare_trees()
5419 btrfs_item_key_to_cpu(left_path->nodes[left_level], in btrfs_compare_trees()
5422 btrfs_node_key_to_cpu(left_path->nodes[left_level], in btrfs_compare_trees()
5425 btrfs_item_key_to_cpu(right_path->nodes[right_level], in btrfs_compare_trees()
5428 btrfs_node_key_to_cpu(right_path->nodes[right_level], in btrfs_compare_trees()
5506 WARN_ON(!extent_buffer_uptodate(left_path->nodes[0])); in btrfs_compare_trees()
5529 left_path->nodes[left_level], in btrfs_compare_trees()
5532 right_path->nodes[right_level], in btrfs_compare_trees()
5535 left_path->nodes[left_level], in btrfs_compare_trees()
5538 right_path->nodes[right_level], in btrfs_compare_trees()
5586 if (!path->nodes[level]) in btrfs_find_next_key()
5590 c = path->nodes[level]; in btrfs_find_next_key()
5597 !path->nodes[level + 1]) in btrfs_find_next_key()
5620 c = path->nodes[level]; in btrfs_find_next_key()
5666 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_next_old_leaf()
5670 btrfs_item_key_to_cpu(path->nodes[0], &key, nritems - 1); in btrfs_next_old_leaf()
5689 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_next_old_leaf()
5722 if (!path->nodes[level]) { in btrfs_next_old_leaf()
5728 c = path->nodes[level]; in btrfs_next_old_leaf()
5783 c = path->nodes[level]; in btrfs_next_old_leaf()
5788 path->nodes[level] = next; in btrfs_next_old_leaf()
5850 leaf = path->nodes[0]; in btrfs_previous_item()
5892 leaf = path->nodes[0]; in btrfs_previous_extent_item()