fs/btrfs/send.c

92  * cloning roots that lead down to a leaf is more than 17.
104  * A backref cache entry maps a leaf to a list of IDs of roots from which the
105  * leaf is accessible and we can use for clone operations.
1138 	 * space, which can happen for xattrs on a fs with a leaf size greater
1499 	 * backref walking to determine which roots have a path to the leaf.
1523 			     const struct extent_buffer *leaf, void *ctx)
1525 	const u64 refs = btrfs_extent_refs(leaf, ei);
1530 		const u64 flags = btrfs_extent_flags(leaf, ei);
1671 	 * ranges can't overlap and in case the leaf is shared through a subtree
2520 	struct extent_buffer *leaf;
2547 	leaf = path->nodes[0];
2548 	btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
2554 	ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref);
2555 	namelen = btrfs_root_ref_name_len(leaf, ref);
2556 	read_extent_buffer(leaf, name, (unsigned long)(ref + 1), namelen);
3918 		struct extent_buffer *leaf = path->nodes[0];
3929 		item_size = btrfs_item_size(leaf, slot);
3938 				ptr = btrfs_item_ptr_offset(leaf, slot);
3941 				parent = btrfs_inode_extref_parent(leaf,
3944 				cur_offset += btrfs_inode_extref_name_len(leaf,
5546 	struct extent_buffer *leaf = path->nodes[0];
5571 	btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
5572 	ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_file_extent_item);
5573 	ram_bytes = btrfs_file_extent_ram_bytes(leaf, ei);
5574 	inline_size = btrfs_file_extent_inline_item_len(leaf, path->slots[0]);
5583 				btrfs_file_extent_compression(leaf, ei));
5591 	read_extent_buffer(leaf, sctx->send_buf + sctx->send_size,
5611 	struct extent_buffer *leaf = path->nodes[0];
5638 	btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
5639 	ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_file_extent_item);
5640 	disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, ei);
5641 	disk_num_bytes = btrfs_file_extent_disk_num_bytes(leaf, ei);
5646 		    min(key.offset + btrfs_file_extent_num_bytes(leaf, ei) - offset,
5649 		    btrfs_file_extent_ram_bytes(leaf, ei));
5651 		    offset - key.offset + btrfs_file_extent_offset(leaf, ei));
5653 				btrfs_file_extent_compression(leaf, ei));
5713 	struct extent_buffer *leaf = path->nodes[0];
5721 	ei = btrfs_item_ptr(leaf, path->slots[0],
5724 	    btrfs_file_extent_compression(leaf, ei) != BTRFS_COMPRESS_NONE) {
5725 		bool is_inline = (btrfs_file_extent_type(leaf, ei) ==
5736 		    btrfs_file_extent_inline_item_len(leaf,
5741 			   btrfs_file_extent_disk_num_bytes(leaf, ei) <= len) {
5837 	struct extent_buffer *leaf;
5857 	leaf = path->nodes[0];
5858 	buf_len = btrfs_dir_data_len(leaf, di);
5871 	data_ptr = (unsigned long)(di + 1) + btrfs_dir_name_len(leaf, di);
5872 	read_extent_buffer(leaf, buf, data_ptr, buf_len);
5962 		struct extent_buffer *leaf = path->nodes[0];
5971 		if (slot >= btrfs_header_nritems(leaf)) {
5980 		btrfs_item_key_to_cpu(leaf, &key, slot);
5990 		ei = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
5991 		type = btrfs_file_extent_type(leaf, ei);
5993 			ext_len = btrfs_file_extent_ram_bytes(leaf, ei);
5996 			ext_len = btrfs_file_extent_num_bytes(leaf, ei);
6032 		clone_data_offset = btrfs_file_extent_offset(leaf, ei);
6033 		if (btrfs_file_extent_disk_bytenr(leaf, ei) == disk_byte) {
6048 		if (btrfs_file_extent_disk_bytenr(leaf, ei) == disk_byte &&
6428 		struct extent_buffer *leaf = path->nodes[0];
6433 		if (slot >= btrfs_header_nritems(leaf)) {
6442 		btrfs_item_key_to_cpu(leaf, &key, slot);
6451 		fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
6455 		if (btrfs_file_extent_disk_bytenr(leaf, fi) == 0) {
6481 	 * we're at the first slot of a leaf and the last extent's end is less
6485 	 * one in the current leaf and the leaf our last extent came from, and
7174 	struct extent_buffer *leaf;
7190 	leaf = path->nodes[0];
7191 	item_size = btrfs_item_size(leaf, path->slots[0]);
7192 	ptr = btrfs_item_ptr_offset(leaf, path->slots[0]);
7196 		dirid = btrfs_inode_extref_parent(leaf, extref);
7197 		ref_name_len = btrfs_inode_extref_name_len(leaf, extref);
7251 	 * have a leaf when we have reached the end of the send root but have
7260 	 * the parent root already, so we don't have a leaf at right_path.
7390 			 * our path (leaf) and restart the search, so that we
7742 	 *   node or a leaf.