fs/btrfs/file-item.c

166 	struct extent_buffer *leaf;
179 	leaf = path->nodes[0];
180 	item = btrfs_item_ptr(leaf, path->slots[0],
182 	btrfs_set_file_extent_disk_bytenr(leaf, item, 0);
183 	btrfs_set_file_extent_disk_num_bytes(leaf, item, 0);
184 	btrfs_set_file_extent_offset(leaf, item, 0);
185 	btrfs_set_file_extent_num_bytes(leaf, item, num_bytes);
186 	btrfs_set_file_extent_ram_bytes(leaf, item, num_bytes);
187 	btrfs_set_file_extent_generation(leaf, item, trans->transid);
188 	btrfs_set_file_extent_type(leaf, item, BTRFS_FILE_EXTENT_REG);
189 	btrfs_set_file_extent_compression(leaf, item, 0);
190 	btrfs_set_file_extent_encryption(leaf, item, 0);
191 	btrfs_set_file_extent_other_encoding(leaf, item, 0);
193 	btrfs_mark_buffer_dirty(trans, leaf);
210 	struct extent_buffer *leaf;
221 	leaf = path->nodes[0];
227 		btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
233 		csums_in_item = btrfs_item_size(leaf, path->slots[0]);
243 	item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
386 	 * If requested number of sectors is larger than one leaf can contain,
460 	struct extent_buffer *leaf;
488 		leaf = path->nodes[0];
489 		btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1);
509 			    btrfs_item_size(leaf, path->slots[0] - 1))
517 		leaf = path->nodes[0];
518 		if (path->slots[0] >= btrfs_header_nritems(leaf)) {
524 			leaf = path->nodes[0];
527 		btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
537 					btrfs_item_size(leaf, path->slots[0]));
602 	struct extent_buffer *leaf;
637 		leaf = path->nodes[0];
638 		btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1);
658 			    btrfs_item_size(leaf, path->slots[0] - 1))
667 		leaf = path->nodes[0];
668 		if (path->slots[0] >= btrfs_header_nritems(leaf)) {
674 			leaf = path->nodes[0];
677 		btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
687 					btrfs_item_size(leaf, path->slots[0]));
816 	struct extent_buffer *leaf;
822 	leaf = path->nodes[0];
823 	csum_end = btrfs_item_size(leaf, path->slots[0]) / csum_size;
868 	struct extent_buffer *leaf;
895 		leaf = path->nodes[0];
896 		btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
906 		csum_end = btrfs_item_size(leaf, path->slots[0]) / csum_size;
920 			 * leaf correspond to our range and then delete them all
929 					btrfs_item_key_to_cpu(leaf, &pk, slot);
974 			item_offset = btrfs_item_ptr_offset(leaf,
977 			memzero_extent_buffer(leaf, item_offset + offset,
1045 	struct extent_buffer *leaf = NULL;
1070 		leaf = path->nodes[0];
1071 		item_end = btrfs_item_ptr(leaf, path->slots[0],
1074 			   btrfs_item_size(leaf, path->slots[0]));
1084 		leaf = path->nodes[0];
1085 		item_size = btrfs_item_size(leaf, path->slots[0]);
1106 	 * First check if the leaf has enough free space for at least one
1110 	if (btrfs_leaf_free_space(leaf) >= csum_size) {
1111 		btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
1131 	leaf = path->nodes[0];
1132 	btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
1142 	if (csum_offset == btrfs_item_size(leaf, path->slots[0]) /
1167 		 * checksum item. If we are at the last item in the leaf, then
1170 		 * getting the first key for the next leaf, repeat the btree
1172 		 * would only save a few bytes of leaf space.
1197 		diff = diff - btrfs_item_size(leaf, path->slots[0]);
1198 		diff = min_t(u32, btrfs_leaf_free_space(leaf), diff);
1228 	leaf = path->nodes[0];
1230 	item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
1232 				      btrfs_item_size(leaf, path->slots[0]));
1240 	write_extent_buffer(leaf, sums->sums + index, (unsigned long)item,
1265 	struct extent_buffer *leaf = path->nodes[0];
1270 	u8 type = btrfs_file_extent_type(leaf, fi);
1271 	int compress_type = btrfs_file_extent_compression(leaf, fi);
1273 	btrfs_item_key_to_cpu(leaf, &key, slot);
1276 	em->ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi);
1277 	em->generation = btrfs_file_extent_generation(leaf, fi);
1283 			btrfs_file_extent_offset(leaf, fi);
1284 		em->orig_block_len = btrfs_file_extent_disk_num_bytes(leaf, fi);
1285 		bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
1295 			bytenr += btrfs_file_extent_offset(leaf, fi);
1327 	const struct extent_buffer *leaf = path->nodes[0];
1333 	btrfs_item_key_to_cpu(leaf, &key, slot);
1335 	fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
1337 	if (btrfs_file_extent_type(leaf, fi) == BTRFS_FILE_EXTENT_INLINE) {
1338 		end = btrfs_file_extent_ram_bytes(leaf, fi);
1339 		end = ALIGN(key.offset + end, leaf->fs_info->sectorsize);
1341 		end = key.offset + btrfs_file_extent_num_bytes(leaf, fi);