Lines Matching full:leaf

167 	struct extent_buffer *leaf;  in btrfs_insert_hole_extent()  local
180 leaf = path->nodes[0]; in btrfs_insert_hole_extent()
181 item = btrfs_item_ptr(leaf, path->slots[0], in btrfs_insert_hole_extent()
183 btrfs_set_file_extent_disk_bytenr(leaf, item, 0); in btrfs_insert_hole_extent()
184 btrfs_set_file_extent_disk_num_bytes(leaf, item, 0); in btrfs_insert_hole_extent()
185 btrfs_set_file_extent_offset(leaf, item, 0); in btrfs_insert_hole_extent()
186 btrfs_set_file_extent_num_bytes(leaf, item, num_bytes); in btrfs_insert_hole_extent()
187 btrfs_set_file_extent_ram_bytes(leaf, item, num_bytes); in btrfs_insert_hole_extent()
188 btrfs_set_file_extent_generation(leaf, item, trans->transid); in btrfs_insert_hole_extent()
189 btrfs_set_file_extent_type(leaf, item, BTRFS_FILE_EXTENT_REG); in btrfs_insert_hole_extent()
190 btrfs_set_file_extent_compression(leaf, item, 0); in btrfs_insert_hole_extent()
191 btrfs_set_file_extent_encryption(leaf, item, 0); in btrfs_insert_hole_extent()
192 btrfs_set_file_extent_other_encoding(leaf, item, 0); in btrfs_insert_hole_extent()
209 struct extent_buffer *leaf; in btrfs_lookup_csum() local
220 leaf = path->nodes[0]; in btrfs_lookup_csum()
226 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); in btrfs_lookup_csum()
232 csums_in_item = btrfs_item_size(leaf, path->slots[0]); in btrfs_lookup_csum()
242 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item); in btrfs_lookup_csum()
385 * If requested number of sectors is larger than one leaf can contain, in btrfs_lookup_bio_sums()
471 struct extent_buffer *leaf; in btrfs_lookup_csums_list() local
494 leaf = path->nodes[0]; in btrfs_lookup_csums_list()
495 btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1); in btrfs_lookup_csums_list()
515 btrfs_item_size(leaf, path->slots[0] - 1)) in btrfs_lookup_csums_list()
523 leaf = path->nodes[0]; in btrfs_lookup_csums_list()
524 if (path->slots[0] >= btrfs_header_nritems(leaf)) { in btrfs_lookup_csums_list()
530 leaf = path->nodes[0]; in btrfs_lookup_csums_list()
533 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in btrfs_lookup_csums_list()
543 btrfs_item_size(leaf, path->slots[0])); in btrfs_lookup_csums_list()
615 struct extent_buffer *leaf; in btrfs_lookup_csums_bitmap() local
650 leaf = path->nodes[0]; in btrfs_lookup_csums_bitmap()
651 btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1); in btrfs_lookup_csums_bitmap()
671 btrfs_item_size(leaf, path->slots[0] - 1)) in btrfs_lookup_csums_bitmap()
680 leaf = path->nodes[0]; in btrfs_lookup_csums_bitmap()
681 if (path->slots[0] >= btrfs_header_nritems(leaf)) { in btrfs_lookup_csums_bitmap()
687 leaf = path->nodes[0]; in btrfs_lookup_csums_bitmap()
690 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in btrfs_lookup_csums_bitmap()
700 btrfs_item_size(leaf, path->slots[0])); in btrfs_lookup_csums_bitmap()
829 struct extent_buffer *leaf; in truncate_one_csum() local
835 leaf = path->nodes[0]; in truncate_one_csum()
836 csum_end = btrfs_item_size(leaf, path->slots[0]) / csum_size; in truncate_one_csum()
881 struct extent_buffer *leaf; in btrfs_del_csums() local
908 leaf = path->nodes[0]; in btrfs_del_csums()
909 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in btrfs_del_csums()
919 csum_end = btrfs_item_size(leaf, path->slots[0]) / csum_size; in btrfs_del_csums()
933 * leaf correspond to our range and then delete them all in btrfs_del_csums()
942 btrfs_item_key_to_cpu(leaf, &pk, slot); in btrfs_del_csums()
987 item_offset = btrfs_item_ptr_offset(leaf, in btrfs_del_csums()
990 memzero_extent_buffer(leaf, item_offset + offset, in btrfs_del_csums()
1058 struct extent_buffer *leaf = NULL; in btrfs_csum_file_blocks() local
1083 leaf = path->nodes[0]; in btrfs_csum_file_blocks()
1084 item_end = btrfs_item_ptr(leaf, path->slots[0], in btrfs_csum_file_blocks()
1087 btrfs_item_size(leaf, path->slots[0])); in btrfs_csum_file_blocks()
1097 leaf = path->nodes[0]; in btrfs_csum_file_blocks()
1098 item_size = btrfs_item_size(leaf, path->slots[0]); in btrfs_csum_file_blocks()
1119 * First check if the leaf has enough free space for at least one in btrfs_csum_file_blocks()
1123 if (btrfs_leaf_free_space(leaf) >= csum_size) { in btrfs_csum_file_blocks()
1124 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); in btrfs_csum_file_blocks()
1144 leaf = path->nodes[0]; in btrfs_csum_file_blocks()
1145 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); in btrfs_csum_file_blocks()
1155 if (csum_offset == btrfs_item_size(leaf, path->slots[0]) / in btrfs_csum_file_blocks()
1180 * checksum item. If we are at the last item in the leaf, then in btrfs_csum_file_blocks()
1183 * getting the first key for the next leaf, repeat the btree in btrfs_csum_file_blocks()
1185 * would only save a few bytes of leaf space. in btrfs_csum_file_blocks()
1210 diff = diff - btrfs_item_size(leaf, path->slots[0]); in btrfs_csum_file_blocks()
1211 diff = min_t(u32, btrfs_leaf_free_space(leaf), diff); in btrfs_csum_file_blocks()
1241 leaf = path->nodes[0]; in btrfs_csum_file_blocks()
1243 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item); in btrfs_csum_file_blocks()
1245 btrfs_item_size(leaf, path->slots[0])); in btrfs_csum_file_blocks()
1253 write_extent_buffer(leaf, sums->sums + index, (unsigned long)item, in btrfs_csum_file_blocks()
1277 struct extent_buffer *leaf = path->nodes[0]; in btrfs_extent_item_to_extent_map() local
1281 u8 type = btrfs_file_extent_type(leaf, fi); in btrfs_extent_item_to_extent_map()
1282 int compress_type = btrfs_file_extent_compression(leaf, fi); in btrfs_extent_item_to_extent_map()
1284 btrfs_item_key_to_cpu(leaf, &key, slot); in btrfs_extent_item_to_extent_map()
1286 em->ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi); in btrfs_extent_item_to_extent_map()
1287 em->generation = btrfs_file_extent_generation(leaf, fi); in btrfs_extent_item_to_extent_map()
1290 const u64 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); in btrfs_extent_item_to_extent_map()
1301 em->disk_num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); in btrfs_extent_item_to_extent_map()
1302 em->offset = btrfs_file_extent_offset(leaf, fi); in btrfs_extent_item_to_extent_map()
1340 const struct extent_buffer *leaf = path->nodes[0]; in btrfs_file_extent_end() local
1346 btrfs_item_key_to_cpu(leaf, &key, slot); in btrfs_file_extent_end()
1348 fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item); in btrfs_file_extent_end()
1350 if (btrfs_file_extent_type(leaf, fi) == BTRFS_FILE_EXTENT_INLINE) in btrfs_file_extent_end()
1351 end = leaf->fs_info->sectorsize; in btrfs_file_extent_end()
1353 end = key.offset + btrfs_file_extent_num_bytes(leaf, fi); in btrfs_file_extent_end()