1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) 2007 Oracle. All rights reserved.
7 #include <linux/slab.h>
8 #include <linux/pagemap.h>
9 #include <linux/highmem.h>
10 #include <linux/sched/mm.h>
13 #include "transaction.h"
15 #include "print-tree.h"
16 #include "compression.h"
18 #define __MAX_CSUM_ITEMS(r, size) ((unsigned long)(((BTRFS_LEAF_DATA_SIZE(r) - \
19 sizeof(struct btrfs_item) * 2) / \
22 #define MAX_CSUM_ITEMS(r, size) (min_t(u32, __MAX_CSUM_ITEMS(r, size), \
25 #define MAX_ORDERED_SUM_BYTES(fs_info) ((PAGE_SIZE - \
26 sizeof(struct btrfs_ordered_sum)) / \
27 sizeof(u32) * (fs_info)->sectorsize)
29 int btrfs_insert_file_extent(struct btrfs_trans_handle *trans,
30 struct btrfs_root *root,
31 u64 objectid, u64 pos,
32 u64 disk_offset, u64 disk_num_bytes,
33 u64 num_bytes, u64 offset, u64 ram_bytes,
34 u8 compression, u8 encryption, u16 other_encoding)
37 struct btrfs_file_extent_item *item;
38 struct btrfs_key file_key;
39 struct btrfs_path *path;
40 struct extent_buffer *leaf;
42 path = btrfs_alloc_path();
45 file_key.objectid = objectid;
46 file_key.offset = pos;
47 file_key.type = BTRFS_EXTENT_DATA_KEY;
49 path->leave_spinning = 1;
50 ret = btrfs_insert_empty_item(trans, root, path, &file_key,
54 BUG_ON(ret); /* Can't happen */
55 leaf = path->nodes[0];
56 item = btrfs_item_ptr(leaf, path->slots[0],
57 struct btrfs_file_extent_item);
58 btrfs_set_file_extent_disk_bytenr(leaf, item, disk_offset);
59 btrfs_set_file_extent_disk_num_bytes(leaf, item, disk_num_bytes);
60 btrfs_set_file_extent_offset(leaf, item, offset);
61 btrfs_set_file_extent_num_bytes(leaf, item, num_bytes);
62 btrfs_set_file_extent_ram_bytes(leaf, item, ram_bytes);
63 btrfs_set_file_extent_generation(leaf, item, trans->transid);
64 btrfs_set_file_extent_type(leaf, item, BTRFS_FILE_EXTENT_REG);
65 btrfs_set_file_extent_compression(leaf, item, compression);
66 btrfs_set_file_extent_encryption(leaf, item, encryption);
67 btrfs_set_file_extent_other_encoding(leaf, item, other_encoding);
69 btrfs_mark_buffer_dirty(leaf);
71 btrfs_free_path(path);
75 static struct btrfs_csum_item *
76 btrfs_lookup_csum(struct btrfs_trans_handle *trans,
77 struct btrfs_root *root,
78 struct btrfs_path *path,
81 struct btrfs_fs_info *fs_info = root->fs_info;
83 struct btrfs_key file_key;
84 struct btrfs_key found_key;
85 struct btrfs_csum_item *item;
86 struct extent_buffer *leaf;
88 u16 csum_size = btrfs_super_csum_size(fs_info->super_copy);
91 file_key.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
92 file_key.offset = bytenr;
93 file_key.type = BTRFS_EXTENT_CSUM_KEY;
94 ret = btrfs_search_slot(trans, root, &file_key, path, 0, cow);
97 leaf = path->nodes[0];
100 if (path->slots[0] == 0)
103 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
104 if (found_key.type != BTRFS_EXTENT_CSUM_KEY)
107 csum_offset = (bytenr - found_key.offset) >>
108 fs_info->sb->s_blocksize_bits;
109 csums_in_item = btrfs_item_size_nr(leaf, path->slots[0]);
110 csums_in_item /= csum_size;
112 if (csum_offset == csums_in_item) {
115 } else if (csum_offset > csums_in_item) {
119 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
120 item = (struct btrfs_csum_item *)((unsigned char *)item +
121 csum_offset * csum_size);
129 int btrfs_lookup_file_extent(struct btrfs_trans_handle *trans,
130 struct btrfs_root *root,
131 struct btrfs_path *path, u64 objectid,
135 struct btrfs_key file_key;
136 int ins_len = mod < 0 ? -1 : 0;
139 file_key.objectid = objectid;
140 file_key.offset = offset;
141 file_key.type = BTRFS_EXTENT_DATA_KEY;
142 ret = btrfs_search_slot(trans, root, &file_key, path, ins_len, cow);
146 static blk_status_t __btrfs_lookup_bio_sums(struct inode *inode, struct bio *bio,
147 u64 logical_offset, u32 *dst, int dio)
149 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
151 struct bvec_iter iter;
152 struct btrfs_io_bio *btrfs_bio = btrfs_io_bio(bio);
153 struct btrfs_csum_item *item = NULL;
154 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
155 struct btrfs_path *path;
158 u64 item_start_offset = 0;
159 u64 item_last_offset = 0;
165 u16 csum_size = btrfs_super_csum_size(fs_info->super_copy);
167 path = btrfs_alloc_path();
169 return BLK_STS_RESOURCE;
171 nblocks = bio->bi_iter.bi_size >> inode->i_sb->s_blocksize_bits;
173 if (nblocks * csum_size > BTRFS_BIO_INLINE_CSUM_SIZE) {
174 btrfs_bio->csum = kmalloc_array(nblocks, csum_size,
176 if (!btrfs_bio->csum) {
177 btrfs_free_path(path);
178 return BLK_STS_RESOURCE;
181 btrfs_bio->csum = btrfs_bio->csum_inline;
183 csum = btrfs_bio->csum;
188 if (bio->bi_iter.bi_size > PAGE_SIZE * 8)
189 path->reada = READA_FORWARD;
192 * the free space stuff is only read when it hasn't been
193 * updated in the current transaction. So, we can safely
194 * read from the commit root and sidestep a nasty deadlock
195 * between reading the free space cache and updating the csum tree.
197 if (btrfs_is_free_space_inode(BTRFS_I(inode))) {
198 path->search_commit_root = 1;
199 path->skip_locking = 1;
202 disk_bytenr = (u64)bio->bi_iter.bi_sector << 9;
204 offset = logical_offset;
206 bio_for_each_segment(bvec, bio, iter) {
207 page_bytes_left = bvec.bv_len;
212 offset = page_offset(bvec.bv_page) + bvec.bv_offset;
213 count = btrfs_find_ordered_sum(inode, offset, disk_bytenr,
214 (u32 *)csum, nblocks);
218 if (!item || disk_bytenr < item_start_offset ||
219 disk_bytenr >= item_last_offset) {
220 struct btrfs_key found_key;
224 btrfs_release_path(path);
225 item = btrfs_lookup_csum(NULL, fs_info->csum_root,
226 path, disk_bytenr, 0);
229 memset(csum, 0, csum_size);
230 if (BTRFS_I(inode)->root->root_key.objectid ==
231 BTRFS_DATA_RELOC_TREE_OBJECTID) {
232 set_extent_bits(io_tree, offset,
233 offset + fs_info->sectorsize - 1,
236 btrfs_info_rl(fs_info,
237 "no csum found for inode %llu start %llu",
238 btrfs_ino(BTRFS_I(inode)), offset);
241 btrfs_release_path(path);
244 btrfs_item_key_to_cpu(path->nodes[0], &found_key,
247 item_start_offset = found_key.offset;
248 item_size = btrfs_item_size_nr(path->nodes[0],
250 item_last_offset = item_start_offset +
251 (item_size / csum_size) *
253 item = btrfs_item_ptr(path->nodes[0], path->slots[0],
254 struct btrfs_csum_item);
257 * this byte range must be able to fit inside
258 * a single leaf so it will also fit inside a u32
260 diff = disk_bytenr - item_start_offset;
261 diff = diff / fs_info->sectorsize;
262 diff = diff * csum_size;
263 count = min_t(int, nblocks, (item_last_offset - disk_bytenr) >>
264 inode->i_sb->s_blocksize_bits);
265 read_extent_buffer(path->nodes[0], csum,
266 ((unsigned long)item) + diff,
269 csum += count * csum_size;
273 disk_bytenr += fs_info->sectorsize;
274 offset += fs_info->sectorsize;
275 page_bytes_left -= fs_info->sectorsize;
276 if (!page_bytes_left)
277 break; /* move to next bio */
282 btrfs_free_path(path);
286 blk_status_t btrfs_lookup_bio_sums(struct inode *inode, struct bio *bio, u32 *dst)
288 return __btrfs_lookup_bio_sums(inode, bio, 0, dst, 0);
291 blk_status_t btrfs_lookup_bio_sums_dio(struct inode *inode, struct bio *bio, u64 offset)
293 return __btrfs_lookup_bio_sums(inode, bio, offset, NULL, 1);
296 int btrfs_lookup_csums_range(struct btrfs_root *root, u64 start, u64 end,
297 struct list_head *list, int search_commit)
299 struct btrfs_fs_info *fs_info = root->fs_info;
300 struct btrfs_key key;
301 struct btrfs_path *path;
302 struct extent_buffer *leaf;
303 struct btrfs_ordered_sum *sums;
304 struct btrfs_csum_item *item;
306 unsigned long offset;
310 u16 csum_size = btrfs_super_csum_size(fs_info->super_copy);
312 ASSERT(IS_ALIGNED(start, fs_info->sectorsize) &&
313 IS_ALIGNED(end + 1, fs_info->sectorsize));
315 path = btrfs_alloc_path();
320 path->skip_locking = 1;
321 path->reada = READA_FORWARD;
322 path->search_commit_root = 1;
325 key.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
327 key.type = BTRFS_EXTENT_CSUM_KEY;
329 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
332 if (ret > 0 && path->slots[0] > 0) {
333 leaf = path->nodes[0];
334 btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1);
335 if (key.objectid == BTRFS_EXTENT_CSUM_OBJECTID &&
336 key.type == BTRFS_EXTENT_CSUM_KEY) {
337 offset = (start - key.offset) >>
338 fs_info->sb->s_blocksize_bits;
339 if (offset * csum_size <
340 btrfs_item_size_nr(leaf, path->slots[0] - 1))
345 while (start <= end) {
346 leaf = path->nodes[0];
347 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
348 ret = btrfs_next_leaf(root, path);
353 leaf = path->nodes[0];
356 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
357 if (key.objectid != BTRFS_EXTENT_CSUM_OBJECTID ||
358 key.type != BTRFS_EXTENT_CSUM_KEY ||
362 if (key.offset > start)
365 size = btrfs_item_size_nr(leaf, path->slots[0]);
366 csum_end = key.offset + (size / csum_size) * fs_info->sectorsize;
367 if (csum_end <= start) {
372 csum_end = min(csum_end, end + 1);
373 item = btrfs_item_ptr(path->nodes[0], path->slots[0],
374 struct btrfs_csum_item);
375 while (start < csum_end) {
376 size = min_t(size_t, csum_end - start,
377 MAX_ORDERED_SUM_BYTES(fs_info));
378 sums = kzalloc(btrfs_ordered_sum_size(fs_info, size),
385 sums->bytenr = start;
386 sums->len = (int)size;
388 offset = (start - key.offset) >>
389 fs_info->sb->s_blocksize_bits;
391 size >>= fs_info->sb->s_blocksize_bits;
393 read_extent_buffer(path->nodes[0],
395 ((unsigned long)item) + offset,
398 start += fs_info->sectorsize * size;
399 list_add_tail(&sums->list, &tmplist);
405 while (ret < 0 && !list_empty(&tmplist)) {
406 sums = list_entry(tmplist.next, struct btrfs_ordered_sum, list);
407 list_del(&sums->list);
410 list_splice_tail(&tmplist, list);
412 btrfs_free_path(path);
416 blk_status_t btrfs_csum_one_bio(struct inode *inode, struct bio *bio,
417 u64 file_start, int contig)
419 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
420 struct btrfs_ordered_sum *sums;
421 struct btrfs_ordered_extent *ordered = NULL;
423 struct bvec_iter iter;
427 unsigned long total_bytes = 0;
428 unsigned long this_sum_bytes = 0;
433 nofs_flag = memalloc_nofs_save();
434 sums = kvzalloc(btrfs_ordered_sum_size(fs_info, bio->bi_iter.bi_size),
436 memalloc_nofs_restore(nofs_flag);
439 return BLK_STS_RESOURCE;
441 sums->len = bio->bi_iter.bi_size;
442 INIT_LIST_HEAD(&sums->list);
447 offset = 0; /* shut up gcc */
449 sums->bytenr = (u64)bio->bi_iter.bi_sector << 9;
452 bio_for_each_segment(bvec, bio, iter) {
454 offset = page_offset(bvec.bv_page) + bvec.bv_offset;
457 ordered = btrfs_lookup_ordered_extent(inode, offset);
458 BUG_ON(!ordered); /* Logic error */
461 data = kmap_atomic(bvec.bv_page);
463 nr_sectors = BTRFS_BYTES_TO_BLKS(fs_info,
464 bvec.bv_len + fs_info->sectorsize
467 for (i = 0; i < nr_sectors; i++) {
468 if (offset >= ordered->file_offset + ordered->len ||
469 offset < ordered->file_offset) {
470 unsigned long bytes_left;
473 sums->len = this_sum_bytes;
475 btrfs_add_ordered_sum(inode, ordered, sums);
476 btrfs_put_ordered_extent(ordered);
478 bytes_left = bio->bi_iter.bi_size - total_bytes;
480 nofs_flag = memalloc_nofs_save();
481 sums = kvzalloc(btrfs_ordered_sum_size(fs_info,
482 bytes_left), GFP_KERNEL);
483 memalloc_nofs_restore(nofs_flag);
484 BUG_ON(!sums); /* -ENOMEM */
485 sums->len = bytes_left;
486 ordered = btrfs_lookup_ordered_extent(inode,
488 ASSERT(ordered); /* Logic error */
489 sums->bytenr = ((u64)bio->bi_iter.bi_sector << 9)
493 data = kmap_atomic(bvec.bv_page);
496 sums->sums[index] = ~(u32)0;
498 = btrfs_csum_data(data + bvec.bv_offset
499 + (i * fs_info->sectorsize),
501 fs_info->sectorsize);
502 btrfs_csum_final(sums->sums[index],
503 (char *)(sums->sums + index));
505 offset += fs_info->sectorsize;
506 this_sum_bytes += fs_info->sectorsize;
507 total_bytes += fs_info->sectorsize;
513 btrfs_add_ordered_sum(inode, ordered, sums);
514 btrfs_put_ordered_extent(ordered);
519 * helper function for csum removal, this expects the
520 * key to describe the csum pointed to by the path, and it expects
521 * the csum to overlap the range [bytenr, len]
523 * The csum should not be entirely contained in the range and the
524 * range should not be entirely contained in the csum.
526 * This calls btrfs_truncate_item with the correct args based on the
527 * overlap, and fixes up the key as required.
529 static noinline void truncate_one_csum(struct btrfs_fs_info *fs_info,
530 struct btrfs_path *path,
531 struct btrfs_key *key,
534 struct extent_buffer *leaf;
535 u16 csum_size = btrfs_super_csum_size(fs_info->super_copy);
537 u64 end_byte = bytenr + len;
538 u32 blocksize_bits = fs_info->sb->s_blocksize_bits;
540 leaf = path->nodes[0];
541 csum_end = btrfs_item_size_nr(leaf, path->slots[0]) / csum_size;
542 csum_end <<= fs_info->sb->s_blocksize_bits;
543 csum_end += key->offset;
545 if (key->offset < bytenr && csum_end <= end_byte) {
550 * A simple truncate off the end of the item
552 u32 new_size = (bytenr - key->offset) >> blocksize_bits;
553 new_size *= csum_size;
554 btrfs_truncate_item(fs_info, path, new_size, 1);
555 } else if (key->offset >= bytenr && csum_end > end_byte &&
556 end_byte > key->offset) {
561 * we need to truncate from the beginning of the csum
563 u32 new_size = (csum_end - end_byte) >> blocksize_bits;
564 new_size *= csum_size;
566 btrfs_truncate_item(fs_info, path, new_size, 0);
568 key->offset = end_byte;
569 btrfs_set_item_key_safe(fs_info, path, key);
576 * deletes the csum items from the csum tree for a given
579 int btrfs_del_csums(struct btrfs_trans_handle *trans,
580 struct btrfs_fs_info *fs_info, u64 bytenr, u64 len)
582 struct btrfs_root *root = fs_info->csum_root;
583 struct btrfs_path *path;
584 struct btrfs_key key;
585 u64 end_byte = bytenr + len;
587 struct extent_buffer *leaf;
589 u16 csum_size = btrfs_super_csum_size(fs_info->super_copy);
590 int blocksize_bits = fs_info->sb->s_blocksize_bits;
592 path = btrfs_alloc_path();
597 key.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
598 key.offset = end_byte - 1;
599 key.type = BTRFS_EXTENT_CSUM_KEY;
601 path->leave_spinning = 1;
602 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
604 if (path->slots[0] == 0)
607 } else if (ret < 0) {
611 leaf = path->nodes[0];
612 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
614 if (key.objectid != BTRFS_EXTENT_CSUM_OBJECTID ||
615 key.type != BTRFS_EXTENT_CSUM_KEY) {
619 if (key.offset >= end_byte)
622 csum_end = btrfs_item_size_nr(leaf, path->slots[0]) / csum_size;
623 csum_end <<= blocksize_bits;
624 csum_end += key.offset;
626 /* this csum ends before we start, we're done */
627 if (csum_end <= bytenr)
630 /* delete the entire item, it is inside our range */
631 if (key.offset >= bytenr && csum_end <= end_byte) {
635 * Check how many csum items preceding this one in this
636 * leaf correspond to our range and then delete them all
639 if (key.offset > bytenr && path->slots[0] > 0) {
640 int slot = path->slots[0] - 1;
645 btrfs_item_key_to_cpu(leaf, &pk, slot);
646 if (pk.offset < bytenr ||
647 pk.type != BTRFS_EXTENT_CSUM_KEY ||
649 BTRFS_EXTENT_CSUM_OBJECTID)
651 path->slots[0] = slot;
653 key.offset = pk.offset;
657 ret = btrfs_del_items(trans, root, path,
658 path->slots[0], del_nr);
661 if (key.offset == bytenr)
663 } else if (key.offset < bytenr && csum_end > end_byte) {
664 unsigned long offset;
665 unsigned long shift_len;
666 unsigned long item_offset;
671 * Our bytes are in the middle of the csum,
672 * we need to split this item and insert a new one.
674 * But we can't drop the path because the
675 * csum could change, get removed, extended etc.
677 * The trick here is the max size of a csum item leaves
678 * enough room in the tree block for a single
679 * item header. So, we split the item in place,
680 * adding a new header pointing to the existing
681 * bytes. Then we loop around again and we have
682 * a nicely formed csum item that we can neatly
685 offset = (bytenr - key.offset) >> blocksize_bits;
688 shift_len = (len >> blocksize_bits) * csum_size;
690 item_offset = btrfs_item_ptr_offset(leaf,
693 memzero_extent_buffer(leaf, item_offset + offset,
698 * btrfs_split_item returns -EAGAIN when the
699 * item changed size or key
701 ret = btrfs_split_item(trans, root, path, &key, offset);
702 if (ret && ret != -EAGAIN) {
703 btrfs_abort_transaction(trans, ret);
707 key.offset = end_byte - 1;
709 truncate_one_csum(fs_info, path, &key, bytenr, len);
710 if (key.offset < bytenr)
713 btrfs_release_path(path);
717 btrfs_free_path(path);
721 int btrfs_csum_file_blocks(struct btrfs_trans_handle *trans,
722 struct btrfs_root *root,
723 struct btrfs_ordered_sum *sums)
725 struct btrfs_fs_info *fs_info = root->fs_info;
726 struct btrfs_key file_key;
727 struct btrfs_key found_key;
728 struct btrfs_path *path;
729 struct btrfs_csum_item *item;
730 struct btrfs_csum_item *item_end;
731 struct extent_buffer *leaf = NULL;
741 u16 csum_size = btrfs_super_csum_size(fs_info->super_copy);
743 path = btrfs_alloc_path();
747 next_offset = (u64)-1;
749 bytenr = sums->bytenr + total_bytes;
750 file_key.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
751 file_key.offset = bytenr;
752 file_key.type = BTRFS_EXTENT_CSUM_KEY;
754 item = btrfs_lookup_csum(trans, root, path, bytenr, 1);
757 leaf = path->nodes[0];
758 item_end = btrfs_item_ptr(leaf, path->slots[0],
759 struct btrfs_csum_item);
760 item_end = (struct btrfs_csum_item *)((char *)item_end +
761 btrfs_item_size_nr(leaf, path->slots[0]));
765 if (ret != -EFBIG && ret != -ENOENT)
770 /* we found one, but it isn't big enough yet */
771 leaf = path->nodes[0];
772 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
773 if ((item_size / csum_size) >=
774 MAX_CSUM_ITEMS(fs_info, csum_size)) {
775 /* already at max size, make a new one */
779 int slot = path->slots[0] + 1;
780 /* we didn't find a csum item, insert one */
781 nritems = btrfs_header_nritems(path->nodes[0]);
782 if (!nritems || (path->slots[0] >= nritems - 1)) {
783 ret = btrfs_next_leaf(root, path);
788 slot = path->slots[0];
790 btrfs_item_key_to_cpu(path->nodes[0], &found_key, slot);
791 if (found_key.objectid != BTRFS_EXTENT_CSUM_OBJECTID ||
792 found_key.type != BTRFS_EXTENT_CSUM_KEY) {
796 next_offset = found_key.offset;
802 * at this point, we know the tree has an item, but it isn't big
803 * enough yet to put our csum in. Grow it
805 btrfs_release_path(path);
806 ret = btrfs_search_slot(trans, root, &file_key, path,
812 if (path->slots[0] == 0)
817 leaf = path->nodes[0];
818 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
819 csum_offset = (bytenr - found_key.offset) >>
820 fs_info->sb->s_blocksize_bits;
822 if (found_key.type != BTRFS_EXTENT_CSUM_KEY ||
823 found_key.objectid != BTRFS_EXTENT_CSUM_OBJECTID ||
824 csum_offset >= MAX_CSUM_ITEMS(fs_info, csum_size)) {
828 if (csum_offset == btrfs_item_size_nr(leaf, path->slots[0]) /
835 if (btrfs_leaf_free_space(fs_info, leaf) <
836 sizeof(struct btrfs_item) + csum_size * 2)
839 free_space = btrfs_leaf_free_space(fs_info, leaf) -
840 sizeof(struct btrfs_item) - csum_size;
841 tmp = sums->len - total_bytes;
842 tmp >>= fs_info->sb->s_blocksize_bits;
845 extend_nr = max_t(int, 1, (int)tmp);
846 diff = (csum_offset + extend_nr) * csum_size;
848 MAX_CSUM_ITEMS(fs_info, csum_size) * csum_size);
850 diff = diff - btrfs_item_size_nr(leaf, path->slots[0]);
851 diff = min(free_space, diff);
855 btrfs_extend_item(fs_info, path, diff);
861 btrfs_release_path(path);
866 tmp = sums->len - total_bytes;
867 tmp >>= fs_info->sb->s_blocksize_bits;
868 tmp = min(tmp, (next_offset - file_key.offset) >>
869 fs_info->sb->s_blocksize_bits);
871 tmp = max_t(u64, 1, tmp);
872 tmp = min_t(u64, tmp, MAX_CSUM_ITEMS(fs_info, csum_size));
873 ins_size = csum_size * tmp;
875 ins_size = csum_size;
877 path->leave_spinning = 1;
878 ret = btrfs_insert_empty_item(trans, root, path, &file_key,
880 path->leave_spinning = 0;
883 if (WARN_ON(ret != 0))
885 leaf = path->nodes[0];
887 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
888 item_end = (struct btrfs_csum_item *)((unsigned char *)item +
889 btrfs_item_size_nr(leaf, path->slots[0]));
890 item = (struct btrfs_csum_item *)((unsigned char *)item +
891 csum_offset * csum_size);
893 ins_size = (u32)(sums->len - total_bytes) >>
894 fs_info->sb->s_blocksize_bits;
895 ins_size *= csum_size;
896 ins_size = min_t(u32, (unsigned long)item_end - (unsigned long)item,
898 write_extent_buffer(leaf, sums->sums + index, (unsigned long)item,
901 ins_size /= csum_size;
902 total_bytes += ins_size * fs_info->sectorsize;
905 btrfs_mark_buffer_dirty(path->nodes[0]);
906 if (total_bytes < sums->len) {
907 btrfs_release_path(path);
912 btrfs_free_path(path);
919 void btrfs_extent_item_to_extent_map(struct btrfs_inode *inode,
920 const struct btrfs_path *path,
921 struct btrfs_file_extent_item *fi,
922 const bool new_inline,
923 struct extent_map *em)
925 struct btrfs_fs_info *fs_info = inode->root->fs_info;
926 struct btrfs_root *root = inode->root;
927 struct extent_buffer *leaf = path->nodes[0];
928 const int slot = path->slots[0];
929 struct btrfs_key key;
930 u64 extent_start, extent_end;
932 u8 type = btrfs_file_extent_type(leaf, fi);
933 int compress_type = btrfs_file_extent_compression(leaf, fi);
935 em->bdev = fs_info->fs_devices->latest_bdev;
936 btrfs_item_key_to_cpu(leaf, &key, slot);
937 extent_start = key.offset;
939 if (type == BTRFS_FILE_EXTENT_REG ||
940 type == BTRFS_FILE_EXTENT_PREALLOC) {
941 extent_end = extent_start +
942 btrfs_file_extent_num_bytes(leaf, fi);
943 } else if (type == BTRFS_FILE_EXTENT_INLINE) {
945 size = btrfs_file_extent_ram_bytes(leaf, fi);
946 extent_end = ALIGN(extent_start + size,
947 fs_info->sectorsize);
950 em->ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi);
951 if (type == BTRFS_FILE_EXTENT_REG ||
952 type == BTRFS_FILE_EXTENT_PREALLOC) {
953 em->start = extent_start;
954 em->len = extent_end - extent_start;
955 em->orig_start = extent_start -
956 btrfs_file_extent_offset(leaf, fi);
957 em->orig_block_len = btrfs_file_extent_disk_num_bytes(leaf, fi);
958 bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
960 em->block_start = EXTENT_MAP_HOLE;
963 if (compress_type != BTRFS_COMPRESS_NONE) {
964 set_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
965 em->compress_type = compress_type;
966 em->block_start = bytenr;
967 em->block_len = em->orig_block_len;
969 bytenr += btrfs_file_extent_offset(leaf, fi);
970 em->block_start = bytenr;
971 em->block_len = em->len;
972 if (type == BTRFS_FILE_EXTENT_PREALLOC)
973 set_bit(EXTENT_FLAG_PREALLOC, &em->flags);
975 } else if (type == BTRFS_FILE_EXTENT_INLINE) {
976 em->block_start = EXTENT_MAP_INLINE;
977 em->start = extent_start;
978 em->len = extent_end - extent_start;
980 * Initialize orig_start and block_len with the same values
981 * as in inode.c:btrfs_get_extent().
983 em->orig_start = EXTENT_MAP_HOLE;
984 em->block_len = (u64)-1;
985 if (!new_inline && compress_type != BTRFS_COMPRESS_NONE) {
986 set_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
987 em->compress_type = compress_type;
991 "unknown file extent item type %d, inode %llu, offset %llu, "
992 "root %llu", type, btrfs_ino(inode), extent_start,
993 root->root_key.objectid);