Lines Matching refs:nodes

100  * maple tree's internal nodes, is 24K.
166 * don't operate on stale extent buffers for nodes (level >= 1) or on
946 ii = btrfs_item_ptr(path->nodes[0], path->slots[0],
948 info->size = btrfs_inode_size(path->nodes[0], ii);
949 info->gen = btrfs_inode_generation(path->nodes[0], ii);
950 info->mode = btrfs_inode_mode(path->nodes[0], ii);
951 info->uid = btrfs_inode_uid(path->nodes[0], ii);
952 info->gid = btrfs_inode_gid(path->nodes[0], ii);
953 info->rdev = btrfs_inode_rdev(path->nodes[0], ii);
954 info->nlink = btrfs_inode_nlink(path->nodes[0], ii);
959 info->fileattr = btrfs_inode_flags(path->nodes[0], ii);
994 struct extent_buffer *eb = path->nodes[0];
1138 eb = path->nodes[0];
1259 btrfs_item_key_to_cpu(p->nodes[0], &found_key, p->slots[0]);
1415 * read-only roots, their leaves and nodes may have been reallocated and
1416 * now be used for different nodes/leaves of the same tree or some other
1582 struct extent_buffer *eb = path->nodes[0];
1774 ei = btrfs_item_ptr(path->nodes[0], path->slots[0],
1776 type = btrfs_file_extent_type(path->nodes[0], ei);
1784 compression = btrfs_file_extent_compression(path->nodes[0], ei);
1794 len = btrfs_file_extent_ram_bytes(path->nodes[0], ei);
1796 ret = fs_path_add_from_extent_buffer(dest, path->nodes[0], off, len);
2000 btrfs_dir_item_key_to_cpu(path->nodes[0], di, &key);
2038 btrfs_item_key_to_cpu(path->nodes[0], &found_key,
2049 iref = btrfs_item_ptr(path->nodes[0], path->slots[0],
2051 len = btrfs_inode_ref_name_len(path->nodes[0], iref);
2052 ret = fs_path_add_from_extent_buffer(name, path->nodes[0],
2058 extref = btrfs_item_ptr(path->nodes[0], path->slots[0],
2060 len = btrfs_inode_extref_name_len(path->nodes[0], extref);
2061 ret = fs_path_add_from_extent_buffer(name, path->nodes[0],
2063 parent_dir = btrfs_inode_extref_parent(path->nodes[0], extref);
2536 leaf = path->nodes[0];
2746 eb = path->nodes[0];
2962 struct extent_buffer *eb = path->nodes[0];
3243 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
3250 di = btrfs_item_ptr(path->nodes[0], path->slots[0],
3252 btrfs_dir_item_key_to_cpu(path->nodes[0], di, &loc);
3273 di = btrfs_item_ptr(path->nodes[0], path->slots[0],
3275 btrfs_dir_item_key_to_cpu(path->nodes[0], di, &loc);
3802 btrfs_dir_item_key_to_cpu(path->nodes[0], di, &di_key);
3908 struct extent_buffer *leaf = path->nodes[0];
5529 struct extent_buffer *leaf = path->nodes[0];
5594 struct extent_buffer *leaf = path->nodes[0];
5696 struct extent_buffer *leaf = path->nodes[0];
5840 leaf = path->nodes[0];
5938 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0] - 1);
5945 struct extent_buffer *leaf = path->nodes[0];
6154 ei = btrfs_item_ptr(path->nodes[0], path->slots[0],
6156 disk_byte = btrfs_file_extent_disk_bytenr(path->nodes[0], ei);
6157 data_offset = btrfs_file_extent_offset(path->nodes[0], ei);
6194 eb = left_path->nodes[0];
6243 eb = path->nodes[0];
6326 eb = path->nodes[0];
6377 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
6411 struct extent_buffer *leaf = path->nodes[0];
6518 ei = btrfs_item_ptr(path->nodes[0], path->slots[0],
6520 type = btrfs_file_extent_type(path->nodes[0], ei);
6535 if (btrfs_file_extent_disk_bytenr(path->nodes[0], ei) == 0) {
6853 left_ii = btrfs_item_ptr(sctx->left_path->nodes[0],
6856 left_gen = btrfs_inode_generation(sctx->left_path->nodes[0],
6859 right_ii = btrfs_item_ptr(sctx->right_path->nodes[0],
6862 right_gen = btrfs_inode_generation(sctx->right_path->nodes[0],
6866 right_ii = btrfs_item_ptr(sctx->right_path->nodes[0],
6870 right_gen = btrfs_inode_generation(sctx->right_path->nodes[0],
6918 if (btrfs_inode_nlink(sctx->left_path->nodes[0], left_ii) == 0) {
6926 sctx->left_path->nodes[0], left_ii);
6928 sctx->left_path->nodes[0], left_ii);
6930 sctx->left_path->nodes[0], left_ii);
6938 sctx->right_path->nodes[0], right_ii);
6940 sctx->right_path->nodes[0], right_ii);
6944 new_nlinks = btrfs_inode_nlink(sctx->left_path->nodes[0], left_ii);
6945 old_nlinks = btrfs_inode_nlink(sctx->right_path->nodes[0], right_ii);
6968 sctx->right_path->nodes[0], right_ii);
6970 sctx->right_path->nodes[0], right_ii);
6985 sctx->left_path->nodes[0],
6988 sctx->left_path->nodes[0],
6991 sctx->left_path->nodes[0],
7024 sctx->left_path->nodes[0], left_ii);
7026 sctx->left_path->nodes[0], left_ii);
7176 leaf = path->nodes[0];
7240 if (left_path->nodes[0])
7242 &left_path->nodes[0]->bflags));
7248 if (right_path && right_path->nodes[0])
7250 &right_path->nodes[0]->bflags));
7321 btrfs_print_tree(path->nodes[path->lowest_level], false);
7362 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
7412 clone = btrfs_clone_extent_buffer(path->nodes[level]);
7416 free_extent_buffer(path->nodes[level]);
7417 path->nodes[level] = clone;
7425 struct extent_buffer *parent = path->nodes[*level];
7441 * will not block on disk IO. For nodes we only do readahead for one,
7442 * since the time window between processing nodes is typically larger.
7453 path->nodes[*level - 1] = eb;
7468 nritems = btrfs_header_nritems(path->nodes[*level]);
7480 free_extent_buffer(path->nodes[*level]);
7481 path->nodes[*level] = NULL;
7485 nritems = btrfs_header_nritems(path->nodes[*level]);
7516 btrfs_item_key_to_cpu(path->nodes[*level], key,
7519 btrfs_node_key_to_cpu(path->nodes[*level], key,
7533 len1 = btrfs_item_size(left_path->nodes[0], left_path->slots[0]);
7534 len2 = btrfs_item_size(right_path->nodes[0], right_path->slots[0]);
7538 off1 = btrfs_item_ptr_offset(left_path->nodes[0], left_path->slots[0]);
7539 off2 = btrfs_item_ptr_offset(right_path->nodes[0],
7542 read_extent_buffer(left_path->nodes[0], tmp_buf, off1, len1);
7544 cmp = memcmp_extent_buffer(right_path->nodes[0], tmp_buf, off2, len1);
7558 * The exception are the root nodes, for which we always have a clone, see
7602 * If the lowest level nodes are leaves, clone them so that they can be
7620 * Now clone the root nodes (unless they happen to be the leaves we have
7713 * Compare keys of current nodes/leafs
7716 * If left == right compare blockptrs of the next nodes/leafs
7747 left_path->nodes[left_level] =
7749 if (!left_path->nodes[left_level]) {
7756 right_path->nodes[right_level] =
7758 if (!right_path->nodes[right_level]) {
7764 * root. We know that all new nodes/leaves in the left root must have
7766 * readahead for those nodes and leaves of the left root, as we know we
7772 btrfs_item_key_to_cpu(left_path->nodes[left_level],
7775 btrfs_node_key_to_cpu(left_path->nodes[left_level],
7778 btrfs_item_key_to_cpu(right_path->nodes[right_level],
7781 btrfs_node_key_to_cpu(right_path->nodes[right_level],
7876 WARN_ON(!extent_buffer_uptodate(left_path->nodes[0]));
7900 left_path->nodes[left_level],
7903 right_path->nodes[right_level],
7906 left_path->nodes[left_level],
7909 right_path->nodes[right_level],