Lines Matching refs:nodes
375 l = path->nodes[0];
469 l = path->nodes[0];
601 btrfs_mark_buffer_dirty(path->nodes[0]);
670 leaf = path->nodes[0];
689 leaf = path->nodes[0];
778 l = path->nodes[0];
824 l = path->nodes[0];
866 l = path->nodes[0];
907 leaf = path->nodes[0];
1032 leaf = path->nodes[0];
1059 leaf = path->nodes[0];
1892 * nodes which have had all slots visited. If a node (leaf or
1901 * If we increment the root nodes slot counter past the number of
1914 eb = path->nodes[level];
1929 path->nodes[level] = NULL;
1936 * new nodes.
1944 eb = path->nodes[root_level];
1971 * @dst_path = [ nodes[1] = NN(a), nodes[0] = NN(c) ]
1982 * The key for search can be extracted from @dst_path->nodes[dst_level]
2022 btrfs_node_key_to_cpu(dst_path->nodes[dst_level], &key, 0);
2024 btrfs_item_key_to_cpu(dst_path->nodes[dst_level], &key, 0);
2028 src_path->nodes[root_level] = src_eb;
2037 if (src_path->nodes[cur_level] == NULL) {
2044 eb = src_path->nodes[cur_level + 1];
2061 src_path->nodes[cur_level] = eb;
2070 btrfs_node_key_to_cpu(dst_path->nodes[cur_level],
2072 btrfs_node_key_to_cpu(src_path->nodes[cur_level],
2075 btrfs_item_key_to_cpu(dst_path->nodes[cur_level],
2077 btrfs_item_key_to_cpu(src_path->nodes[cur_level],
2092 ret = btrfs_qgroup_trace_extent(trans, src_path->nodes[dst_level]->start,
2097 dst_path->nodes[dst_level]->start,
2104 ret = btrfs_qgroup_trace_leaf_items(trans, src_path->nodes[0]);
2107 ret = btrfs_qgroup_trace_leaf_items(trans, dst_path->nodes[0]);
2127 * @dst_path = [ nodes[1] = NN(b), nodes[0] = NULL ],
2159 if (dst_path->nodes[cur_level] == NULL) {
2166 * dst_path->nodes[root_level] must be initialized before
2171 "%s: dst_path->nodes[%d] not initialized, root_level=%d cur_level=%d",
2180 eb = dst_path->nodes[cur_level + 1];
2201 dst_path->nodes[cur_level] = eb;
2216 eb = dst_path->nodes[cur_level];
2238 btrfs_tree_unlock_rw(dst_path->nodes[cur_level],
2240 free_extent_buffer(dst_path->nodes[cur_level]);
2241 dst_path->nodes[cur_level] = NULL;
2284 dst_path->nodes[level] = dst_eb;
2343 path->nodes[root_level] = root_eb;
2349 if (path->nodes[level] == NULL) {
2359 eb = path->nodes[level + 1];
2376 path->nodes[level] = eb;
2392 path->nodes[level]);
3225 for (i = 1; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) {
3226 if (path->slots[i] != btrfs_header_nritems(path->nodes[i]) - 1)
3275 btrfs_item_key_to_cpu(path->nodes[0], &found,
3276 btrfs_header_nritems(path->nodes[0]) - 1);
3279 scratch_leaf = btrfs_clone_extent_buffer(path->nodes[0]);