Lines Matching defs:leaf
136 struct extent_buffer *leaf;
151 leaf = path->nodes[0];
152 item = btrfs_item_ptr(leaf, path->slots[0],
154 btrfs_set_file_extent_disk_bytenr(leaf, item, disk_offset);
155 btrfs_set_file_extent_disk_num_bytes(leaf, item, disk_num_bytes);
156 btrfs_set_file_extent_offset(leaf, item, offset);
157 btrfs_set_file_extent_num_bytes(leaf, item, num_bytes);
158 btrfs_set_file_extent_ram_bytes(leaf, item, ram_bytes);
159 btrfs_set_file_extent_generation(leaf, item, trans->transid);
160 btrfs_set_file_extent_type(leaf, item, BTRFS_FILE_EXTENT_REG);
161 btrfs_set_file_extent_compression(leaf, item, compression);
162 btrfs_set_file_extent_encryption(leaf, item, encryption);
163 btrfs_set_file_extent_other_encoding(leaf, item, other_encoding);
165 btrfs_mark_buffer_dirty(leaf);
182 struct extent_buffer *leaf;
193 leaf = path->nodes[0];
199 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
205 csums_in_item = btrfs_item_size_nr(leaf, path->slots[0]);
215 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
366 * a single leaf so it will also fit inside a u32
401 struct extent_buffer *leaf;
432 leaf = path->nodes[0];
433 btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1);
439 btrfs_item_size_nr(leaf, path->slots[0] - 1))
445 leaf = path->nodes[0];
446 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
452 leaf = path->nodes[0];
455 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
464 size = btrfs_item_size_nr(leaf, path->slots[0]);
652 struct extent_buffer *leaf;
658 leaf = path->nodes[0];
659 csum_end = btrfs_item_size_nr(leaf, path->slots[0]) / csum_size;
705 struct extent_buffer *leaf;
733 leaf = path->nodes[0];
734 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
744 csum_end = btrfs_item_size_nr(leaf, path->slots[0]) / csum_size;
758 * leaf correspond to our range and then delete them all
767 btrfs_item_key_to_cpu(leaf, &pk, slot);
812 item_offset = btrfs_item_ptr_offset(leaf,
815 memzero_extent_buffer(leaf, item_offset + offset,
852 struct extent_buffer *leaf = NULL;
878 leaf = path->nodes[0];
879 item_end = btrfs_item_ptr(leaf, path->slots[0],
882 btrfs_item_size_nr(leaf, path->slots[0]));
892 leaf = path->nodes[0];
893 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
930 * First check if the leaf has enough free space for at least one
934 if (btrfs_leaf_free_space(leaf) >= csum_size) {
935 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
953 leaf = path->nodes[0];
954 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
965 if (csum_offset == btrfs_item_size_nr(leaf, path->slots[0]) /
980 diff = diff - btrfs_item_size_nr(leaf, path->slots[0]);
981 diff = min_t(u32, btrfs_leaf_free_space(leaf), diff);
1015 leaf = path->nodes[0];
1017 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
1019 btrfs_item_size_nr(leaf, path->slots[0]));
1028 write_extent_buffer(leaf, sums->sums + index, (unsigned long)item,
1054 struct extent_buffer *leaf = path->nodes[0];
1059 u8 type = btrfs_file_extent_type(leaf, fi);
1060 int compress_type = btrfs_file_extent_compression(leaf, fi);
1062 btrfs_item_key_to_cpu(leaf, &key, slot);
1065 em->ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi);
1071 btrfs_file_extent_offset(leaf, fi);
1072 em->orig_block_len = btrfs_file_extent_disk_num_bytes(leaf, fi);
1073 bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
1084 bytenr += btrfs_file_extent_offset(leaf, fi);
1119 const struct extent_buffer *leaf = path->nodes[0];
1125 btrfs_item_key_to_cpu(leaf, &key, slot);
1127 fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
1129 if (btrfs_file_extent_type(leaf, fi) == BTRFS_FILE_EXTENT_INLINE) {
1130 end = btrfs_file_extent_ram_bytes(leaf, fi);
1131 end = ALIGN(key.offset + end, leaf->fs_info->sectorsize);
1133 end = key.offset + btrfs_file_extent_num_bytes(leaf, fi);