Lines Matching refs:nodes
105 if (!p->nodes[i]) in btrfs_release_path()
108 btrfs_tree_unlock_rw(p->nodes[i], p->locks[i]); in btrfs_release_path()
111 free_extent_buffer(p->nodes[i]); in btrfs_release_path()
112 p->nodes[i] = NULL; in btrfs_release_path()
898 mid = path->nodes[level]; in balance_level()
906 parent = path->nodes[level + 1]; in balance_level()
945 path->nodes[level] = NULL; in balance_level()
1076 path->nodes[level] = left; in balance_level()
1090 btrfs_node_blockptr(path->nodes[level], path->slots[level])) in balance_level()
1098 if (path->nodes[level] != left) in balance_level()
1126 mid = path->nodes[level]; in push_nodes_for_insert()
1130 parent = path->nodes[level + 1]; in push_nodes_for_insert()
1172 path->nodes[level] = left; in push_nodes_for_insert()
1227 path->nodes[level] = right; in push_nodes_for_insert()
1267 if (!path->nodes[level]) in reada_for_search()
1270 node = path->nodes[level]; in reada_for_search()
1338 parent = path->nodes[level + 1]; in reada_for_balance()
1374 if (!path->nodes[i]) in unlock_up()
1388 nritems = btrfs_header_nritems(path->nodes[i]); in unlock_up()
1398 btrfs_tree_unlock_rw(path->nodes[i], path->locks[i]); in unlock_up()
1561 b = p->nodes[level]; in setup_nodes_for_search()
1576 b = p->nodes[level]; in setup_nodes_for_search()
1605 eb = path->nodes[0]; in btrfs_find_item()
1610 eb = path->nodes[0]; in btrfs_find_item()
1694 p->nodes[level] = b; in btrfs_search_slot_get_root()
1719 struct extent_buffer *lowest = path->nodes[i]; in finish_need_commit_sem_search()
1734 path->nodes[i] = clone; in finish_need_commit_sem_search()
1768 struct extent_buffer *leaf = path->nodes[0]; in search_leaf()
1939 WARN_ON(p->nodes[0] != NULL); in btrfs_search_slot()
2014 p->nodes[level + 1])) { in btrfs_search_slot()
2026 p->nodes[level + 1], in btrfs_search_slot()
2035 p->nodes[level] = b; in btrfs_search_slot()
2052 btrfs_tree_unlock_rw(p->nodes[u], p->locks[u]); in btrfs_search_slot()
2086 b = p->nodes[level]; in btrfs_search_slot()
2137 p->nodes[level] = b; in btrfs_search_slot()
2182 WARN_ON(p->nodes[0] != NULL); in btrfs_search_old_slot()
2203 p->nodes[level] = b; in btrfs_search_old_slot()
2252 p->nodes[level] = b; in btrfs_search_old_slot()
2293 leaf = p->nodes[0]; in btrfs_search_slot_for_read()
2317 leaf = p->nodes[0]; in btrfs_search_slot_for_read()
2355 btrfs_item_key_to_cpu(path->nodes[0], key, path->slots[0]); in btrfs_search_backwards()
2377 const struct extent_buffer *leaf = path->nodes[0]; in btrfs_get_next_valid_item()
2415 if (!path->nodes[i]) in fixup_low_keys()
2417 t = path->nodes[i]; in fixup_low_keys()
2422 btrfs_mark_buffer_dirty(path->nodes[i]); in fixup_low_keys()
2442 eb = path->nodes[0]; in btrfs_set_item_key_safe()
2702 BUG_ON(path->nodes[level]); in insert_new_root()
2703 BUG_ON(path->nodes[level-1] != root->node); in insert_new_root()
2705 lower = path->nodes[level-1]; in insert_new_root()
2739 path->nodes[level] = c; in insert_new_root()
2761 BUG_ON(!path->nodes[level]); in insert_ptr()
2762 btrfs_assert_tree_write_locked(path->nodes[level]); in insert_ptr()
2763 lower = path->nodes[level]; in insert_ptr()
2812 c = path->nodes[level]; in split_node()
2830 c = path->nodes[level]; in split_node()
2873 path->nodes[level] = split; in split_node()
2935 struct extent_buffer *left = path->nodes[0]; in __push_leaf_right()
2936 struct extent_buffer *upper = path->nodes[1]; in __push_leaf_right()
3045 if (btrfs_header_nritems(path->nodes[0]) == 0) in __push_leaf_right()
3046 btrfs_clean_tree_block(path->nodes[0]); in __push_leaf_right()
3047 btrfs_tree_unlock(path->nodes[0]); in __push_leaf_right()
3048 free_extent_buffer(path->nodes[0]); in __push_leaf_right()
3049 path->nodes[0] = right; in __push_leaf_right()
3078 struct extent_buffer *left = path->nodes[0]; in push_leaf_right()
3086 if (!path->nodes[1]) in push_leaf_right()
3090 upper = path->nodes[1]; in push_leaf_right()
3094 btrfs_assert_tree_write_locked(path->nodes[1]); in push_leaf_right()
3132 path->nodes[0] = right; in push_leaf_right()
3161 struct extent_buffer *right = path->nodes[0]; in __push_leaf_left()
3275 btrfs_tree_unlock(path->nodes[0]); in __push_leaf_left()
3276 free_extent_buffer(path->nodes[0]); in __push_leaf_left()
3277 path->nodes[0] = left; in __push_leaf_left()
3304 struct extent_buffer *right = path->nodes[0]; in push_leaf_left()
3314 if (!path->nodes[1]) in push_leaf_left()
3321 btrfs_assert_tree_write_locked(path->nodes[1]); in push_leaf_left()
3323 left = btrfs_read_node_slot(path->nodes[1], slot - 1); in push_leaf_left()
3340 path->nodes[1], slot - 1, &left, in push_leaf_left()
3411 btrfs_tree_unlock(path->nodes[0]); in copy_for_split()
3412 free_extent_buffer(path->nodes[0]); in copy_for_split()
3413 path->nodes[0] = right; in copy_for_split()
3446 if (slot < btrfs_header_nritems(path->nodes[0])) in push_for_double_split()
3447 space_needed -= btrfs_leaf_free_space(path->nodes[0]); in push_for_double_split()
3460 nritems = btrfs_header_nritems(path->nodes[0]); in push_for_double_split()
3468 if (btrfs_leaf_free_space(path->nodes[0]) >= data_size) in push_for_double_split()
3475 space_needed -= btrfs_leaf_free_space(path->nodes[0]); in push_for_double_split()
3513 l = path->nodes[0]; in split_leaf()
3520 if (data_size && path->nodes[1]) { in split_leaf()
3539 l = path->nodes[0]; in split_leaf()
3546 if (!path->nodes[1]) { in split_leaf()
3553 l = path->nodes[0]; in split_leaf()
3622 btrfs_tree_unlock(path->nodes[0]); in split_leaf()
3623 free_extent_buffer(path->nodes[0]); in split_leaf()
3624 path->nodes[0] = right; in split_leaf()
3631 btrfs_tree_unlock(path->nodes[0]); in split_leaf()
3632 free_extent_buffer(path->nodes[0]); in split_leaf()
3633 path->nodes[0] = right; in split_leaf()
3659 if (btrfs_leaf_free_space(path->nodes[0]) >= data_size) in split_leaf()
3675 leaf = path->nodes[0]; in setup_leaf_for_split()
3702 leaf = path->nodes[0]; in setup_leaf_for_split()
3708 if (btrfs_leaf_free_space(path->nodes[0]) >= ins_len) in setup_leaf_for_split()
3742 leaf = path->nodes[0]; in split_item()
3842 leaf = path->nodes[0]; in btrfs_truncate_item()
3934 leaf = path->nodes[0]; in btrfs_extend_item()
4015 leaf = path->nodes[0]; in setup_items_for_insert()
4150 leaf = path->nodes[0]; in btrfs_insert_item()
4176 leaf = path->nodes[0]; in btrfs_duplicate_item()
4185 leaf = path->nodes[0]; in btrfs_duplicate_item()
4202 struct extent_buffer *parent = path->nodes[level]; in del_ptr()
4282 leaf = path->nodes[0]; in btrfs_del_items()
4361 if (path->nodes[0] == leaf && in btrfs_del_items()
4392 if (path->nodes[0] == leaf) in btrfs_del_items()
4417 btrfs_item_key_to_cpu(path->nodes[0], &key, 0); in btrfs_prev_leaf()
4436 btrfs_item_key(path->nodes[0], &found_key, 0); in btrfs_prev_leaf()
4490 WARN_ON(path->nodes[level]); in btrfs_search_forward()
4491 path->nodes[level] = cur; in btrfs_search_forward()
4564 path->nodes[level - 1] = cur; in btrfs_search_forward()
4595 if (!path->nodes[level]) in btrfs_find_next_key()
4599 c = path->nodes[level]; in btrfs_find_next_key()
4606 !path->nodes[level + 1]) in btrfs_find_next_key()
4629 c = path->nodes[level]; in btrfs_find_next_key()
4673 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_next_old_leaf()
4677 btrfs_item_key_to_cpu(path->nodes[0], &key, nritems - 1); in btrfs_next_old_leaf()
4707 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_next_old_leaf()
4740 if (!path->nodes[level]) { in btrfs_next_old_leaf()
4746 c = path->nodes[level]; in btrfs_next_old_leaf()
4764 btrfs_tree_read_unlock(path->nodes[i]); in btrfs_next_old_leaf()
4767 free_extent_buffer(path->nodes[i]); in btrfs_next_old_leaf()
4768 path->nodes[i] = NULL; in btrfs_next_old_leaf()
4809 path->nodes[level] = next; in btrfs_next_old_leaf()
4876 leaf = path->nodes[0]; in btrfs_previous_item()
4917 leaf = path->nodes[0]; in btrfs_previous_extent_item()