Lines Matching refs:nodes
400 l = path->nodes[0];
494 l = path->nodes[0];
626 btrfs_mark_buffer_dirty(trans, path->nodes[0]);
695 leaf = path->nodes[0];
714 leaf = path->nodes[0];
803 l = path->nodes[0];
849 l = path->nodes[0];
891 l = path->nodes[0];
931 leaf = path->nodes[0];
1062 leaf = path->nodes[0];
1090 leaf = path->nodes[0];
1968 * nodes which have had all slots visited. If a node (leaf or
1977 * If we increment the root nodes slot counter past the number of
1990 eb = path->nodes[level];
2005 path->nodes[level] = NULL;
2012 * new nodes.
2020 eb = path->nodes[root_level];
2047 * @dst_path = [ nodes[1] = NN(a), nodes[0] = NN(c) ]
2058 * The key for search can be extracted from @dst_path->nodes[dst_level]
2098 btrfs_node_key_to_cpu(dst_path->nodes[dst_level], &key, 0);
2100 btrfs_item_key_to_cpu(dst_path->nodes[dst_level], &key, 0);
2104 src_path->nodes[root_level] = src_eb;
2113 if (src_path->nodes[cur_level] == NULL) {
2117 eb = src_path->nodes[cur_level + 1];
2126 src_path->nodes[cur_level] = eb;
2134 btrfs_node_key_to_cpu(dst_path->nodes[cur_level],
2136 btrfs_node_key_to_cpu(src_path->nodes[cur_level],
2139 btrfs_item_key_to_cpu(dst_path->nodes[cur_level],
2141 btrfs_item_key_to_cpu(src_path->nodes[cur_level],
2156 ret = btrfs_qgroup_trace_extent(trans, src_path->nodes[dst_level]->start,
2160 ret = btrfs_qgroup_trace_extent(trans, dst_path->nodes[dst_level]->start,
2167 ret = btrfs_qgroup_trace_leaf_items(trans, src_path->nodes[0]);
2170 ret = btrfs_qgroup_trace_leaf_items(trans, dst_path->nodes[0]);
2190 * @dst_path = [ nodes[1] = NN(b), nodes[0] = NULL ],
2222 if (dst_path->nodes[cur_level] == NULL) {
2227 * dst_path->nodes[root_level] must be initialized before
2232 "%s: dst_path->nodes[%d] not initialized, root_level=%d cur_level=%d",
2241 eb = dst_path->nodes[cur_level + 1];
2255 dst_path->nodes[cur_level] = eb;
2269 eb = dst_path->nodes[cur_level];
2291 btrfs_tree_unlock_rw(dst_path->nodes[cur_level],
2293 free_extent_buffer(dst_path->nodes[cur_level]);
2294 dst_path->nodes[cur_level] = NULL;
2337 dst_path->nodes[level] = dst_eb;
2420 path->nodes[root_level] = root_eb;
2426 if (path->nodes[level] == NULL) {
2434 eb = path->nodes[level + 1];
2444 path->nodes[level] = eb;
2458 path->nodes[level]);
3286 for (i = 1; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) {
3287 if (path->slots[i] != btrfs_header_nritems(path->nodes[i]) - 1)
3338 btrfs_item_key_to_cpu(path->nodes[0], &found,
3339 btrfs_header_nritems(path->nodes[0]) - 1);
3342 scratch_leaf = btrfs_clone_extent_buffer(path->nodes[0]);