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>
12 #include "transaction.h"
14 #include "print-tree.h"
15 #include "compression.h"
17 #define __MAX_CSUM_ITEMS(r, size) ((unsigned long)(((BTRFS_LEAF_DATA_SIZE(r) - \
18 sizeof(struct btrfs_item) * 2) / \
21 #define MAX_CSUM_ITEMS(r, size) (min_t(u32, __MAX_CSUM_ITEMS(r, size), \
24 #define MAX_ORDERED_SUM_BYTES(fs_info) ((PAGE_SIZE - \
25 sizeof(struct btrfs_ordered_sum)) / \
26 sizeof(u32) * (fs_info)->sectorsize)
28 int btrfs_insert_file_extent(struct btrfs_trans_handle *trans,
29 struct btrfs_root *root,
30 u64 objectid, u64 pos,
31 u64 disk_offset, u64 disk_num_bytes,
32 u64 num_bytes, u64 offset, u64 ram_bytes,
33 u8 compression, u8 encryption, u16 other_encoding)
36 struct btrfs_file_extent_item *item;
37 struct btrfs_key file_key;
38 struct btrfs_path *path;
39 struct extent_buffer *leaf;
41 path = btrfs_alloc_path();
44 file_key.objectid = objectid;
45 file_key.offset = pos;
46 file_key.type = BTRFS_EXTENT_DATA_KEY;
48 path->leave_spinning = 1;
49 ret = btrfs_insert_empty_item(trans, root, path, &file_key,
53 BUG_ON(ret); /* Can't happen */
54 leaf = path->nodes[0];
55 item = btrfs_item_ptr(leaf, path->slots[0],
56 struct btrfs_file_extent_item);
57 btrfs_set_file_extent_disk_bytenr(leaf, item, disk_offset);
58 btrfs_set_file_extent_disk_num_bytes(leaf, item, disk_num_bytes);
59 btrfs_set_file_extent_offset(leaf, item, offset);
60 btrfs_set_file_extent_num_bytes(leaf, item, num_bytes);
61 btrfs_set_file_extent_ram_bytes(leaf, item, ram_bytes);
62 btrfs_set_file_extent_generation(leaf, item, trans->transid);
63 btrfs_set_file_extent_type(leaf, item, BTRFS_FILE_EXTENT_REG);
64 btrfs_set_file_extent_compression(leaf, item, compression);
65 btrfs_set_file_extent_encryption(leaf, item, encryption);
66 btrfs_set_file_extent_other_encoding(leaf, item, other_encoding);
68 btrfs_mark_buffer_dirty(leaf);
70 btrfs_free_path(path);
74 static struct btrfs_csum_item *
75 btrfs_lookup_csum(struct btrfs_trans_handle *trans,
76 struct btrfs_root *root,
77 struct btrfs_path *path,
80 struct btrfs_fs_info *fs_info = root->fs_info;
82 struct btrfs_key file_key;
83 struct btrfs_key found_key;
84 struct btrfs_csum_item *item;
85 struct extent_buffer *leaf;
87 u16 csum_size = btrfs_super_csum_size(fs_info->super_copy);
90 file_key.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
91 file_key.offset = bytenr;
92 file_key.type = BTRFS_EXTENT_CSUM_KEY;
93 ret = btrfs_search_slot(trans, root, &file_key, path, 0, cow);
96 leaf = path->nodes[0];
99 if (path->slots[0] == 0)
102 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
103 if (found_key.type != BTRFS_EXTENT_CSUM_KEY)
106 csum_offset = (bytenr - found_key.offset) >>
107 fs_info->sb->s_blocksize_bits;
108 csums_in_item = btrfs_item_size_nr(leaf, path->slots[0]);
109 csums_in_item /= csum_size;
111 if (csum_offset == csums_in_item) {
114 } else if (csum_offset > csums_in_item) {
118 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
119 item = (struct btrfs_csum_item *)((unsigned char *)item +
120 csum_offset * csum_size);
128 int btrfs_lookup_file_extent(struct btrfs_trans_handle *trans,
129 struct btrfs_root *root,
130 struct btrfs_path *path, u64 objectid,
134 struct btrfs_key file_key;
135 int ins_len = mod < 0 ? -1 : 0;
138 file_key.objectid = objectid;
139 file_key.offset = offset;
140 file_key.type = BTRFS_EXTENT_DATA_KEY;
141 ret = btrfs_search_slot(trans, root, &file_key, path, ins_len, cow);
145 static void btrfs_io_bio_endio_readpage(struct btrfs_io_bio *bio, int err)
147 kfree(bio->csum_allocated);
150 static blk_status_t __btrfs_lookup_bio_sums(struct inode *inode, struct bio *bio,
151 u64 logical_offset, u32 *dst, int dio)
153 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
155 struct bvec_iter iter;
156 struct btrfs_io_bio *btrfs_bio = btrfs_io_bio(bio);
157 struct btrfs_csum_item *item = NULL;
158 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
159 struct btrfs_path *path;
162 u64 item_start_offset = 0;
163 u64 item_last_offset = 0;
169 u16 csum_size = btrfs_super_csum_size(fs_info->super_copy);
171 path = btrfs_alloc_path();
173 return BLK_STS_RESOURCE;
175 nblocks = bio->bi_iter.bi_size >> inode->i_sb->s_blocksize_bits;
177 if (nblocks * csum_size > BTRFS_BIO_INLINE_CSUM_SIZE) {
178 btrfs_bio->csum_allocated = kmalloc_array(nblocks,
179 csum_size, GFP_NOFS);
180 if (!btrfs_bio->csum_allocated) {
181 btrfs_free_path(path);
182 return BLK_STS_RESOURCE;
184 btrfs_bio->csum = btrfs_bio->csum_allocated;
185 btrfs_bio->end_io = btrfs_io_bio_endio_readpage;
187 btrfs_bio->csum = btrfs_bio->csum_inline;
189 csum = btrfs_bio->csum;
194 if (bio->bi_iter.bi_size > PAGE_SIZE * 8)
195 path->reada = READA_FORWARD;
198 * the free space stuff is only read when it hasn't been
199 * updated in the current transaction. So, we can safely
200 * read from the commit root and sidestep a nasty deadlock
201 * between reading the free space cache and updating the csum tree.
203 if (btrfs_is_free_space_inode(BTRFS_I(inode))) {
204 path->search_commit_root = 1;
205 path->skip_locking = 1;
208 disk_bytenr = (u64)bio->bi_iter.bi_sector << 9;
210 offset = logical_offset;
212 bio_for_each_segment(bvec, bio, iter) {
213 page_bytes_left = bvec.bv_len;
218 offset = page_offset(bvec.bv_page) + bvec.bv_offset;
219 count = btrfs_find_ordered_sum(inode, offset, disk_bytenr,
220 (u32 *)csum, nblocks);
224 if (!item || disk_bytenr < item_start_offset ||
225 disk_bytenr >= item_last_offset) {
226 struct btrfs_key found_key;
230 btrfs_release_path(path);
231 item = btrfs_lookup_csum(NULL, fs_info->csum_root,
232 path, disk_bytenr, 0);
235 memset(csum, 0, csum_size);
236 if (BTRFS_I(inode)->root->root_key.objectid ==
237 BTRFS_DATA_RELOC_TREE_OBJECTID) {
238 set_extent_bits(io_tree, offset,
239 offset + fs_info->sectorsize - 1,
242 btrfs_info_rl(fs_info,
243 "no csum found for inode %llu start %llu",
244 btrfs_ino(BTRFS_I(inode)), offset);
247 btrfs_release_path(path);
250 btrfs_item_key_to_cpu(path->nodes[0], &found_key,
253 item_start_offset = found_key.offset;
254 item_size = btrfs_item_size_nr(path->nodes[0],
256 item_last_offset = item_start_offset +
257 (item_size / csum_size) *
259 item = btrfs_item_ptr(path->nodes[0], path->slots[0],
260 struct btrfs_csum_item);
263 * this byte range must be able to fit inside
264 * a single leaf so it will also fit inside a u32
266 diff = disk_bytenr - item_start_offset;
267 diff = diff / fs_info->sectorsize;
268 diff = diff * csum_size;
269 count = min_t(int, nblocks, (item_last_offset - disk_bytenr) >>
270 inode->i_sb->s_blocksize_bits);
271 read_extent_buffer(path->nodes[0], csum,
272 ((unsigned long)item) + diff,
275 csum += count * csum_size;
279 disk_bytenr += fs_info->sectorsize;
280 offset += fs_info->sectorsize;
281 page_bytes_left -= fs_info->sectorsize;
282 if (!page_bytes_left)
283 break; /* move to next bio */
288 btrfs_free_path(path);
292 blk_status_t btrfs_lookup_bio_sums(struct inode *inode, struct bio *bio, u32 *dst)
294 return __btrfs_lookup_bio_sums(inode, bio, 0, dst, 0);
297 blk_status_t btrfs_lookup_bio_sums_dio(struct inode *inode, struct bio *bio, u64 offset)
299 return __btrfs_lookup_bio_sums(inode, bio, offset, NULL, 1);
302 int btrfs_lookup_csums_range(struct btrfs_root *root, u64 start, u64 end,
303 struct list_head *list, int search_commit)
305 struct btrfs_fs_info *fs_info = root->fs_info;
306 struct btrfs_key key;
307 struct btrfs_path *path;
308 struct extent_buffer *leaf;
309 struct btrfs_ordered_sum *sums;
310 struct btrfs_csum_item *item;
312 unsigned long offset;
316 u16 csum_size = btrfs_super_csum_size(fs_info->super_copy);
318 ASSERT(IS_ALIGNED(start, fs_info->sectorsize) &&
319 IS_ALIGNED(end + 1, fs_info->sectorsize));
321 path = btrfs_alloc_path();
326 path->skip_locking = 1;
327 path->reada = READA_FORWARD;
328 path->search_commit_root = 1;
331 key.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
333 key.type = BTRFS_EXTENT_CSUM_KEY;
335 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
338 if (ret > 0 && path->slots[0] > 0) {
339 leaf = path->nodes[0];
340 btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1);
341 if (key.objectid == BTRFS_EXTENT_CSUM_OBJECTID &&
342 key.type == BTRFS_EXTENT_CSUM_KEY) {
343 offset = (start - key.offset) >>
344 fs_info->sb->s_blocksize_bits;
345 if (offset * csum_size <
346 btrfs_item_size_nr(leaf, path->slots[0] - 1))
351 while (start <= end) {
352 leaf = path->nodes[0];
353 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
354 ret = btrfs_next_leaf(root, path);
359 leaf = path->nodes[0];
362 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
363 if (key.objectid != BTRFS_EXTENT_CSUM_OBJECTID ||
364 key.type != BTRFS_EXTENT_CSUM_KEY ||
368 if (key.offset > start)
371 size = btrfs_item_size_nr(leaf, path->slots[0]);
372 csum_end = key.offset + (size / csum_size) * fs_info->sectorsize;
373 if (csum_end <= start) {
378 csum_end = min(csum_end, end + 1);
379 item = btrfs_item_ptr(path->nodes[0], path->slots[0],
380 struct btrfs_csum_item);
381 while (start < csum_end) {
382 size = min_t(size_t, csum_end - start,
383 MAX_ORDERED_SUM_BYTES(fs_info));
384 sums = kzalloc(btrfs_ordered_sum_size(fs_info, size),
391 sums->bytenr = start;
392 sums->len = (int)size;
394 offset = (start - key.offset) >>
395 fs_info->sb->s_blocksize_bits;
397 size >>= fs_info->sb->s_blocksize_bits;
399 read_extent_buffer(path->nodes[0],
401 ((unsigned long)item) + offset,
404 start += fs_info->sectorsize * size;
405 list_add_tail(&sums->list, &tmplist);
411 while (ret < 0 && !list_empty(&tmplist)) {
412 sums = list_entry(tmplist.next, struct btrfs_ordered_sum, list);
413 list_del(&sums->list);
416 list_splice_tail(&tmplist, list);
418 btrfs_free_path(path);
422 blk_status_t btrfs_csum_one_bio(struct inode *inode, struct bio *bio,
423 u64 file_start, int contig)
425 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
426 struct btrfs_ordered_sum *sums;
427 struct btrfs_ordered_extent *ordered = NULL;
429 struct bvec_iter iter;
433 unsigned long total_bytes = 0;
434 unsigned long this_sum_bytes = 0;
438 sums = kzalloc(btrfs_ordered_sum_size(fs_info, bio->bi_iter.bi_size),
441 return BLK_STS_RESOURCE;
443 sums->len = bio->bi_iter.bi_size;
444 INIT_LIST_HEAD(&sums->list);
449 offset = 0; /* shut up gcc */
451 sums->bytenr = (u64)bio->bi_iter.bi_sector << 9;
454 bio_for_each_segment(bvec, bio, iter) {
456 offset = page_offset(bvec.bv_page) + bvec.bv_offset;
459 ordered = btrfs_lookup_ordered_extent(inode, offset);
460 BUG_ON(!ordered); /* Logic error */
463 data = kmap_atomic(bvec.bv_page);
465 nr_sectors = BTRFS_BYTES_TO_BLKS(fs_info,
466 bvec.bv_len + fs_info->sectorsize
469 for (i = 0; i < nr_sectors; i++) {
470 if (offset >= ordered->file_offset + ordered->len ||
471 offset < ordered->file_offset) {
472 unsigned long bytes_left;
475 sums->len = this_sum_bytes;
477 btrfs_add_ordered_sum(inode, ordered, sums);
478 btrfs_put_ordered_extent(ordered);
480 bytes_left = bio->bi_iter.bi_size - total_bytes;
482 sums = kzalloc(btrfs_ordered_sum_size(fs_info, bytes_left),
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_root *root, u64 bytenr, u64 len)
582 struct btrfs_fs_info *fs_info = trans->fs_info;
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 ASSERT(root == fs_info->csum_root ||
593 root->root_key.objectid == BTRFS_TREE_LOG_OBJECTID);
595 path = btrfs_alloc_path();
600 key.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
601 key.offset = end_byte - 1;
602 key.type = BTRFS_EXTENT_CSUM_KEY;
604 path->leave_spinning = 1;
605 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
607 if (path->slots[0] == 0)
610 } else if (ret < 0) {
614 leaf = path->nodes[0];
615 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
617 if (key.objectid != BTRFS_EXTENT_CSUM_OBJECTID ||
618 key.type != BTRFS_EXTENT_CSUM_KEY) {
622 if (key.offset >= end_byte)
625 csum_end = btrfs_item_size_nr(leaf, path->slots[0]) / csum_size;
626 csum_end <<= blocksize_bits;
627 csum_end += key.offset;
629 /* this csum ends before we start, we're done */
630 if (csum_end <= bytenr)
633 /* delete the entire item, it is inside our range */
634 if (key.offset >= bytenr && csum_end <= end_byte) {
638 * Check how many csum items preceding this one in this
639 * leaf correspond to our range and then delete them all
642 if (key.offset > bytenr && path->slots[0] > 0) {
643 int slot = path->slots[0] - 1;
648 btrfs_item_key_to_cpu(leaf, &pk, slot);
649 if (pk.offset < bytenr ||
650 pk.type != BTRFS_EXTENT_CSUM_KEY ||
652 BTRFS_EXTENT_CSUM_OBJECTID)
654 path->slots[0] = slot;
656 key.offset = pk.offset;
660 ret = btrfs_del_items(trans, root, path,
661 path->slots[0], del_nr);
664 if (key.offset == bytenr)
666 } else if (key.offset < bytenr && csum_end > end_byte) {
667 unsigned long offset;
668 unsigned long shift_len;
669 unsigned long item_offset;
674 * Our bytes are in the middle of the csum,
675 * we need to split this item and insert a new one.
677 * But we can't drop the path because the
678 * csum could change, get removed, extended etc.
680 * The trick here is the max size of a csum item leaves
681 * enough room in the tree block for a single
682 * item header. So, we split the item in place,
683 * adding a new header pointing to the existing
684 * bytes. Then we loop around again and we have
685 * a nicely formed csum item that we can neatly
688 offset = (bytenr - key.offset) >> blocksize_bits;
691 shift_len = (len >> blocksize_bits) * csum_size;
693 item_offset = btrfs_item_ptr_offset(leaf,
696 memzero_extent_buffer(leaf, item_offset + offset,
701 * btrfs_split_item returns -EAGAIN when the
702 * item changed size or key
704 ret = btrfs_split_item(trans, root, path, &key, offset);
705 if (ret && ret != -EAGAIN) {
706 btrfs_abort_transaction(trans, ret);
710 key.offset = end_byte - 1;
712 truncate_one_csum(fs_info, path, &key, bytenr, len);
713 if (key.offset < bytenr)
716 btrfs_release_path(path);
720 btrfs_free_path(path);
724 int btrfs_csum_file_blocks(struct btrfs_trans_handle *trans,
725 struct btrfs_root *root,
726 struct btrfs_ordered_sum *sums)
728 struct btrfs_fs_info *fs_info = root->fs_info;
729 struct btrfs_key file_key;
730 struct btrfs_key found_key;
731 struct btrfs_path *path;
732 struct btrfs_csum_item *item;
733 struct btrfs_csum_item *item_end;
734 struct extent_buffer *leaf = NULL;
744 u16 csum_size = btrfs_super_csum_size(fs_info->super_copy);
746 path = btrfs_alloc_path();
750 next_offset = (u64)-1;
752 bytenr = sums->bytenr + total_bytes;
753 file_key.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
754 file_key.offset = bytenr;
755 file_key.type = BTRFS_EXTENT_CSUM_KEY;
757 item = btrfs_lookup_csum(trans, root, path, bytenr, 1);
760 leaf = path->nodes[0];
761 item_end = btrfs_item_ptr(leaf, path->slots[0],
762 struct btrfs_csum_item);
763 item_end = (struct btrfs_csum_item *)((char *)item_end +
764 btrfs_item_size_nr(leaf, path->slots[0]));
768 if (ret != -EFBIG && ret != -ENOENT)
773 /* we found one, but it isn't big enough yet */
774 leaf = path->nodes[0];
775 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
776 if ((item_size / csum_size) >=
777 MAX_CSUM_ITEMS(fs_info, csum_size)) {
778 /* already at max size, make a new one */
782 int slot = path->slots[0] + 1;
783 /* we didn't find a csum item, insert one */
784 nritems = btrfs_header_nritems(path->nodes[0]);
785 if (!nritems || (path->slots[0] >= nritems - 1)) {
786 ret = btrfs_next_leaf(root, path);
791 slot = path->slots[0];
793 btrfs_item_key_to_cpu(path->nodes[0], &found_key, slot);
794 if (found_key.objectid != BTRFS_EXTENT_CSUM_OBJECTID ||
795 found_key.type != BTRFS_EXTENT_CSUM_KEY) {
799 next_offset = found_key.offset;
805 * at this point, we know the tree has an item, but it isn't big
806 * enough yet to put our csum in. Grow it
808 btrfs_release_path(path);
809 ret = btrfs_search_slot(trans, root, &file_key, path,
815 if (path->slots[0] == 0)
820 leaf = path->nodes[0];
821 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
822 csum_offset = (bytenr - found_key.offset) >>
823 fs_info->sb->s_blocksize_bits;
825 if (found_key.type != BTRFS_EXTENT_CSUM_KEY ||
826 found_key.objectid != BTRFS_EXTENT_CSUM_OBJECTID ||
827 csum_offset >= MAX_CSUM_ITEMS(fs_info, csum_size)) {
831 if (csum_offset == btrfs_item_size_nr(leaf, path->slots[0]) /
838 if (btrfs_leaf_free_space(fs_info, leaf) <
839 sizeof(struct btrfs_item) + csum_size * 2)
842 free_space = btrfs_leaf_free_space(fs_info, leaf) -
843 sizeof(struct btrfs_item) - csum_size;
844 tmp = sums->len - total_bytes;
845 tmp >>= fs_info->sb->s_blocksize_bits;
848 extend_nr = max_t(int, 1, (int)tmp);
849 diff = (csum_offset + extend_nr) * csum_size;
851 MAX_CSUM_ITEMS(fs_info, csum_size) * csum_size);
853 diff = diff - btrfs_item_size_nr(leaf, path->slots[0]);
854 diff = min(free_space, diff);
858 btrfs_extend_item(fs_info, path, diff);
864 btrfs_release_path(path);
869 tmp = sums->len - total_bytes;
870 tmp >>= fs_info->sb->s_blocksize_bits;
871 tmp = min(tmp, (next_offset - file_key.offset) >>
872 fs_info->sb->s_blocksize_bits);
874 tmp = max_t(u64, 1, tmp);
875 tmp = min_t(u64, tmp, MAX_CSUM_ITEMS(fs_info, csum_size));
876 ins_size = csum_size * tmp;
878 ins_size = csum_size;
880 path->leave_spinning = 1;
881 ret = btrfs_insert_empty_item(trans, root, path, &file_key,
883 path->leave_spinning = 0;
886 if (WARN_ON(ret != 0))
888 leaf = path->nodes[0];
890 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
891 item_end = (struct btrfs_csum_item *)((unsigned char *)item +
892 btrfs_item_size_nr(leaf, path->slots[0]));
893 item = (struct btrfs_csum_item *)((unsigned char *)item +
894 csum_offset * csum_size);
896 ins_size = (u32)(sums->len - total_bytes) >>
897 fs_info->sb->s_blocksize_bits;
898 ins_size *= csum_size;
899 ins_size = min_t(u32, (unsigned long)item_end - (unsigned long)item,
901 write_extent_buffer(leaf, sums->sums + index, (unsigned long)item,
904 ins_size /= csum_size;
905 total_bytes += ins_size * fs_info->sectorsize;
908 btrfs_mark_buffer_dirty(path->nodes[0]);
909 if (total_bytes < sums->len) {
910 btrfs_release_path(path);
915 btrfs_free_path(path);
922 void btrfs_extent_item_to_extent_map(struct btrfs_inode *inode,
923 const struct btrfs_path *path,
924 struct btrfs_file_extent_item *fi,
925 const bool new_inline,
926 struct extent_map *em)
928 struct btrfs_fs_info *fs_info = inode->root->fs_info;
929 struct btrfs_root *root = inode->root;
930 struct extent_buffer *leaf = path->nodes[0];
931 const int slot = path->slots[0];
932 struct btrfs_key key;
933 u64 extent_start, extent_end;
935 u8 type = btrfs_file_extent_type(leaf, fi);
936 int compress_type = btrfs_file_extent_compression(leaf, fi);
938 em->bdev = fs_info->fs_devices->latest_bdev;
939 btrfs_item_key_to_cpu(leaf, &key, slot);
940 extent_start = key.offset;
942 if (type == BTRFS_FILE_EXTENT_REG ||
943 type == BTRFS_FILE_EXTENT_PREALLOC) {
944 extent_end = extent_start +
945 btrfs_file_extent_num_bytes(leaf, fi);
946 } else if (type == BTRFS_FILE_EXTENT_INLINE) {
948 size = btrfs_file_extent_ram_bytes(leaf, fi);
949 extent_end = ALIGN(extent_start + size,
950 fs_info->sectorsize);
953 em->ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi);
954 if (type == BTRFS_FILE_EXTENT_REG ||
955 type == BTRFS_FILE_EXTENT_PREALLOC) {
956 em->start = extent_start;
957 em->len = extent_end - extent_start;
958 em->orig_start = extent_start -
959 btrfs_file_extent_offset(leaf, fi);
960 em->orig_block_len = btrfs_file_extent_disk_num_bytes(leaf, fi);
961 bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
963 em->block_start = EXTENT_MAP_HOLE;
966 if (compress_type != BTRFS_COMPRESS_NONE) {
967 set_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
968 em->compress_type = compress_type;
969 em->block_start = bytenr;
970 em->block_len = em->orig_block_len;
972 bytenr += btrfs_file_extent_offset(leaf, fi);
973 em->block_start = bytenr;
974 em->block_len = em->len;
975 if (type == BTRFS_FILE_EXTENT_PREALLOC)
976 set_bit(EXTENT_FLAG_PREALLOC, &em->flags);
978 } else if (type == BTRFS_FILE_EXTENT_INLINE) {
979 em->block_start = EXTENT_MAP_INLINE;
980 em->start = extent_start;
981 em->len = extent_end - extent_start;
983 * Initialize orig_start and block_len with the same values
984 * as in inode.c:btrfs_get_extent().
986 em->orig_start = EXTENT_MAP_HOLE;
987 em->block_len = (u64)-1;
988 if (!new_inline && compress_type != BTRFS_COMPRESS_NONE) {
989 set_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
990 em->compress_type = compress_type;
994 "unknown file extent item type %d, inode %llu, offset %llu, "
995 "root %llu", type, btrfs_ino(inode), extent_start,
996 root->root_key.objectid);