Lines Matching defs:leaf
169 struct extent_buffer *leaf;
183 leaf = path->nodes[0];
184 item = btrfs_item_ptr(leaf, path->slots[0],
186 btrfs_set_file_extent_disk_bytenr(leaf, item, 0);
187 btrfs_set_file_extent_disk_num_bytes(leaf, item, 0);
188 btrfs_set_file_extent_offset(leaf, item, 0);
189 btrfs_set_file_extent_num_bytes(leaf, item, num_bytes);
190 btrfs_set_file_extent_ram_bytes(leaf, item, num_bytes);
191 btrfs_set_file_extent_generation(leaf, item, trans->transid);
192 btrfs_set_file_extent_type(leaf, item, BTRFS_FILE_EXTENT_REG);
193 btrfs_set_file_extent_compression(leaf, item, 0);
194 btrfs_set_file_extent_encryption(leaf, item, 0);
195 btrfs_set_file_extent_other_encoding(leaf, item, 0);
197 btrfs_mark_buffer_dirty(trans, leaf);
214 struct extent_buffer *leaf;
225 leaf = path->nodes[0];
231 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
237 csums_in_item = btrfs_item_size(leaf, path->slots[0]);
247 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
390 * If requested number of sectors is larger than one leaf can contain,
464 struct extent_buffer *leaf;
492 leaf = path->nodes[0];
493 btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1);
513 btrfs_item_size(leaf, path->slots[0] - 1))
521 leaf = path->nodes[0];
522 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
528 leaf = path->nodes[0];
531 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
541 btrfs_item_size(leaf, path->slots[0]));
606 struct extent_buffer *leaf;
641 leaf = path->nodes[0];
642 btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1);
662 btrfs_item_size(leaf, path->slots[0] - 1))
671 leaf = path->nodes[0];
672 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
678 leaf = path->nodes[0];
681 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
691 btrfs_item_size(leaf, path->slots[0]));
820 struct extent_buffer *leaf;
826 leaf = path->nodes[0];
827 csum_end = btrfs_item_size(leaf, path->slots[0]) / csum_size;
872 struct extent_buffer *leaf;
899 leaf = path->nodes[0];
900 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
910 csum_end = btrfs_item_size(leaf, path->slots[0]) / csum_size;
924 * leaf correspond to our range and then delete them all
933 btrfs_item_key_to_cpu(leaf, &pk, slot);
978 item_offset = btrfs_item_ptr_offset(leaf,
981 memzero_extent_buffer(leaf, item_offset + offset,
1049 struct extent_buffer *leaf = NULL;
1074 leaf = path->nodes[0];
1075 item_end = btrfs_item_ptr(leaf, path->slots[0],
1078 btrfs_item_size(leaf, path->slots[0]));
1088 leaf = path->nodes[0];
1089 item_size = btrfs_item_size(leaf, path->slots[0]);
1110 * First check if the leaf has enough free space for at least one
1114 if (btrfs_leaf_free_space(leaf) >= csum_size) {
1115 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
1135 leaf = path->nodes[0];
1136 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
1146 if (csum_offset == btrfs_item_size(leaf, path->slots[0]) /
1171 * checksum item. If we are at the last item in the leaf, then
1174 * getting the first key for the next leaf, repeat the btree
1176 * would only save a few bytes of leaf space.
1201 diff = diff - btrfs_item_size(leaf, path->slots[0]);
1202 diff = min_t(u32, btrfs_leaf_free_space(leaf), diff);
1234 leaf = path->nodes[0];
1236 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
1238 btrfs_item_size(leaf, path->slots[0]));
1246 write_extent_buffer(leaf, sums->sums + index, (unsigned long)item,
1271 struct extent_buffer *leaf = path->nodes[0];
1276 u8 type = btrfs_file_extent_type(leaf, fi);
1277 int compress_type = btrfs_file_extent_compression(leaf, fi);
1279 btrfs_item_key_to_cpu(leaf, &key, slot);
1282 em->ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi);
1283 em->generation = btrfs_file_extent_generation(leaf, fi);
1289 btrfs_file_extent_offset(leaf, fi);
1290 em->orig_block_len = btrfs_file_extent_disk_num_bytes(leaf, fi);
1291 bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
1302 bytenr += btrfs_file_extent_offset(leaf, fi);
1336 const struct extent_buffer *leaf = path->nodes[0];
1342 btrfs_item_key_to_cpu(leaf, &key, slot);
1344 fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
1346 if (btrfs_file_extent_type(leaf, fi) == BTRFS_FILE_EXTENT_INLINE) {
1347 end = btrfs_file_extent_ram_bytes(leaf, fi);
1348 end = ALIGN(key.offset + end, leaf->fs_info->sectorsize);
1350 end = key.offset + btrfs_file_extent_num_bytes(leaf, fi);