Lines Matching defs:leaf
93 * cloning roots that lead down to a leaf is more than 17.
105 * A backref cache entry maps a leaf to a list of IDs of roots from which the
106 * leaf is accessible and we can use for clone operations.
1127 * space, which can happen for xattrs on a fs with a leaf size greater
1488 * backref walking to determine which roots have a path to the leaf.
1512 const struct extent_buffer *leaf, void *ctx)
1514 const u64 refs = btrfs_extent_refs(leaf, ei);
1519 const u64 flags = btrfs_extent_flags(leaf, ei);
1660 * ranges can't overlap and in case the leaf is shared through a subtree
2509 struct extent_buffer *leaf;
2536 leaf = path->nodes[0];
2537 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
2543 ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref);
2544 namelen = btrfs_root_ref_name_len(leaf, ref);
2545 read_extent_buffer(leaf, name, (unsigned long)(ref + 1), namelen);
3908 struct extent_buffer *leaf = path->nodes[0];
3919 item_size = btrfs_item_size(leaf, slot);
3928 ptr = btrfs_item_ptr_offset(leaf, slot);
3931 parent = btrfs_inode_extref_parent(leaf,
3934 cur_offset += btrfs_inode_extref_name_len(leaf,
5529 struct extent_buffer *leaf = path->nodes[0];
5554 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
5555 ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_file_extent_item);
5556 ram_bytes = btrfs_file_extent_ram_bytes(leaf, ei);
5557 inline_size = btrfs_file_extent_inline_item_len(leaf, path->slots[0]);
5566 btrfs_file_extent_compression(leaf, ei));
5574 read_extent_buffer(leaf, sctx->send_buf + sctx->send_size,
5594 struct extent_buffer *leaf = path->nodes[0];
5621 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
5622 ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_file_extent_item);
5623 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, ei);
5624 disk_num_bytes = btrfs_file_extent_disk_num_bytes(leaf, ei);
5629 min(key.offset + btrfs_file_extent_num_bytes(leaf, ei) - offset,
5632 btrfs_file_extent_ram_bytes(leaf, ei));
5634 offset - key.offset + btrfs_file_extent_offset(leaf, ei));
5636 btrfs_file_extent_compression(leaf, ei));
5696 struct extent_buffer *leaf = path->nodes[0];
5704 ei = btrfs_item_ptr(leaf, path->slots[0],
5707 btrfs_file_extent_compression(leaf, ei) != BTRFS_COMPRESS_NONE) {
5708 bool is_inline = (btrfs_file_extent_type(leaf, ei) ==
5719 btrfs_file_extent_inline_item_len(leaf,
5724 btrfs_file_extent_disk_num_bytes(leaf, ei) <= len) {
5820 struct extent_buffer *leaf;
5840 leaf = path->nodes[0];
5841 buf_len = btrfs_dir_data_len(leaf, di);
5854 data_ptr = (unsigned long)(di + 1) + btrfs_dir_name_len(leaf, di);
5855 read_extent_buffer(leaf, buf, data_ptr, buf_len);
5945 struct extent_buffer *leaf = path->nodes[0];
5954 if (slot >= btrfs_header_nritems(leaf)) {
5963 btrfs_item_key_to_cpu(leaf, &key, slot);
5973 ei = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
5974 type = btrfs_file_extent_type(leaf, ei);
5976 ext_len = btrfs_file_extent_ram_bytes(leaf, ei);
5979 ext_len = btrfs_file_extent_num_bytes(leaf, ei);
6015 clone_data_offset = btrfs_file_extent_offset(leaf, ei);
6016 if (btrfs_file_extent_disk_bytenr(leaf, ei) == disk_byte) {
6031 if (btrfs_file_extent_disk_bytenr(leaf, ei) == disk_byte &&
6411 struct extent_buffer *leaf = path->nodes[0];
6416 if (slot >= btrfs_header_nritems(leaf)) {
6425 btrfs_item_key_to_cpu(leaf, &key, slot);
6434 fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
6438 if (btrfs_file_extent_disk_bytenr(leaf, fi) == 0) {
6473 * current leaf and the leaf our last extent came from, and
7160 struct extent_buffer *leaf;
7176 leaf = path->nodes[0];
7177 item_size = btrfs_item_size(leaf, path->slots[0]);
7178 ptr = btrfs_item_ptr_offset(leaf, path->slots[0]);
7182 dirid = btrfs_inode_extref_parent(leaf, extref);
7183 ref_name_len = btrfs_inode_extref_name_len(leaf, extref);
7237 * have a leaf when we have reached the end of the send root but have
7246 * the parent root already, so we don't have a leaf at right_path.
7376 * our path (leaf) and restart the search, so that we
7728 * node or a leaf.