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>
11 #include <crypto/hash.h>
14 #include "transaction.h"
16 #include "print-tree.h"
17 #include "compression.h"
19 #define __MAX_CSUM_ITEMS(r, size) ((unsigned long)(((BTRFS_LEAF_DATA_SIZE(r) - \
20 sizeof(struct btrfs_item) * 2) / \
23 #define MAX_CSUM_ITEMS(r, size) (min_t(u32, __MAX_CSUM_ITEMS(r, size), \
26 static inline u32 max_ordered_sum_bytes(struct btrfs_fs_info *fs_info,
29 u32 ncsums = (PAGE_SIZE - sizeof(struct btrfs_ordered_sum)) / csum_size;
31 return ncsums * fs_info->sectorsize;
34 int btrfs_insert_file_extent(struct btrfs_trans_handle *trans,
35 struct btrfs_root *root,
36 u64 objectid, u64 pos,
37 u64 disk_offset, u64 disk_num_bytes,
38 u64 num_bytes, u64 offset, u64 ram_bytes,
39 u8 compression, u8 encryption, u16 other_encoding)
42 struct btrfs_file_extent_item *item;
43 struct btrfs_key file_key;
44 struct btrfs_path *path;
45 struct extent_buffer *leaf;
47 path = btrfs_alloc_path();
50 file_key.objectid = objectid;
51 file_key.offset = pos;
52 file_key.type = BTRFS_EXTENT_DATA_KEY;
54 path->leave_spinning = 1;
55 ret = btrfs_insert_empty_item(trans, root, path, &file_key,
59 BUG_ON(ret); /* Can't happen */
60 leaf = path->nodes[0];
61 item = btrfs_item_ptr(leaf, path->slots[0],
62 struct btrfs_file_extent_item);
63 btrfs_set_file_extent_disk_bytenr(leaf, item, disk_offset);
64 btrfs_set_file_extent_disk_num_bytes(leaf, item, disk_num_bytes);
65 btrfs_set_file_extent_offset(leaf, item, offset);
66 btrfs_set_file_extent_num_bytes(leaf, item, num_bytes);
67 btrfs_set_file_extent_ram_bytes(leaf, item, ram_bytes);
68 btrfs_set_file_extent_generation(leaf, item, trans->transid);
69 btrfs_set_file_extent_type(leaf, item, BTRFS_FILE_EXTENT_REG);
70 btrfs_set_file_extent_compression(leaf, item, compression);
71 btrfs_set_file_extent_encryption(leaf, item, encryption);
72 btrfs_set_file_extent_other_encoding(leaf, item, other_encoding);
74 btrfs_mark_buffer_dirty(leaf);
76 btrfs_free_path(path);
80 static struct btrfs_csum_item *
81 btrfs_lookup_csum(struct btrfs_trans_handle *trans,
82 struct btrfs_root *root,
83 struct btrfs_path *path,
86 struct btrfs_fs_info *fs_info = root->fs_info;
88 struct btrfs_key file_key;
89 struct btrfs_key found_key;
90 struct btrfs_csum_item *item;
91 struct extent_buffer *leaf;
93 u16 csum_size = btrfs_super_csum_size(fs_info->super_copy);
96 file_key.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
97 file_key.offset = bytenr;
98 file_key.type = BTRFS_EXTENT_CSUM_KEY;
99 ret = btrfs_search_slot(trans, root, &file_key, path, 0, cow);
102 leaf = path->nodes[0];
105 if (path->slots[0] == 0)
108 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
109 if (found_key.type != BTRFS_EXTENT_CSUM_KEY)
112 csum_offset = (bytenr - found_key.offset) >>
113 fs_info->sb->s_blocksize_bits;
114 csums_in_item = btrfs_item_size_nr(leaf, path->slots[0]);
115 csums_in_item /= csum_size;
117 if (csum_offset == csums_in_item) {
120 } else if (csum_offset > csums_in_item) {
124 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
125 item = (struct btrfs_csum_item *)((unsigned char *)item +
126 csum_offset * csum_size);
134 int btrfs_lookup_file_extent(struct btrfs_trans_handle *trans,
135 struct btrfs_root *root,
136 struct btrfs_path *path, u64 objectid,
140 struct btrfs_key file_key;
141 int ins_len = mod < 0 ? -1 : 0;
144 file_key.objectid = objectid;
145 file_key.offset = offset;
146 file_key.type = BTRFS_EXTENT_DATA_KEY;
147 ret = btrfs_search_slot(trans, root, &file_key, path, ins_len, cow);
151 static blk_status_t __btrfs_lookup_bio_sums(struct inode *inode, struct bio *bio,
152 u64 logical_offset, u8 *dst, int dio)
154 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
156 struct bvec_iter iter;
157 struct btrfs_io_bio *btrfs_bio = btrfs_io_bio(bio);
158 struct btrfs_csum_item *item = NULL;
159 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
160 struct btrfs_path *path;
163 u64 item_start_offset = 0;
164 u64 item_last_offset = 0;
170 u16 csum_size = btrfs_super_csum_size(fs_info->super_copy);
172 path = btrfs_alloc_path();
174 return BLK_STS_RESOURCE;
176 nblocks = bio->bi_iter.bi_size >> inode->i_sb->s_blocksize_bits;
178 if (nblocks * csum_size > BTRFS_BIO_INLINE_CSUM_SIZE) {
179 btrfs_bio->csum = kmalloc_array(nblocks, csum_size,
181 if (!btrfs_bio->csum) {
182 btrfs_free_path(path);
183 return BLK_STS_RESOURCE;
186 btrfs_bio->csum = btrfs_bio->csum_inline;
188 csum = btrfs_bio->csum;
193 if (bio->bi_iter.bi_size > PAGE_SIZE * 8)
194 path->reada = READA_FORWARD;
197 * the free space stuff is only read when it hasn't been
198 * updated in the current transaction. So, we can safely
199 * read from the commit root and sidestep a nasty deadlock
200 * between reading the free space cache and updating the csum tree.
202 if (btrfs_is_free_space_inode(BTRFS_I(inode))) {
203 path->search_commit_root = 1;
204 path->skip_locking = 1;
207 disk_bytenr = (u64)bio->bi_iter.bi_sector << 9;
209 offset = logical_offset;
211 bio_for_each_segment(bvec, bio, iter) {
212 page_bytes_left = bvec.bv_len;
217 offset = page_offset(bvec.bv_page) + bvec.bv_offset;
218 count = btrfs_find_ordered_sum(inode, offset, disk_bytenr,
223 if (!item || disk_bytenr < item_start_offset ||
224 disk_bytenr >= item_last_offset) {
225 struct btrfs_key found_key;
229 btrfs_release_path(path);
230 item = btrfs_lookup_csum(NULL, fs_info->csum_root,
231 path, disk_bytenr, 0);
234 memset(csum, 0, csum_size);
235 if (BTRFS_I(inode)->root->root_key.objectid ==
236 BTRFS_DATA_RELOC_TREE_OBJECTID) {
237 set_extent_bits(io_tree, offset,
238 offset + fs_info->sectorsize - 1,
241 btrfs_info_rl(fs_info,
242 "no csum found for inode %llu start %llu",
243 btrfs_ino(BTRFS_I(inode)), offset);
246 btrfs_release_path(path);
249 btrfs_item_key_to_cpu(path->nodes[0], &found_key,
252 item_start_offset = found_key.offset;
253 item_size = btrfs_item_size_nr(path->nodes[0],
255 item_last_offset = item_start_offset +
256 (item_size / csum_size) *
258 item = btrfs_item_ptr(path->nodes[0], path->slots[0],
259 struct btrfs_csum_item);
262 * this byte range must be able to fit inside
263 * a single leaf so it will also fit inside a u32
265 diff = disk_bytenr - item_start_offset;
266 diff = diff / fs_info->sectorsize;
267 diff = diff * csum_size;
268 count = min_t(int, nblocks, (item_last_offset - disk_bytenr) >>
269 inode->i_sb->s_blocksize_bits);
270 read_extent_buffer(path->nodes[0], csum,
271 ((unsigned long)item) + diff,
274 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,
295 return __btrfs_lookup_bio_sums(inode, bio, 0, dst, 0);
298 blk_status_t btrfs_lookup_bio_sums_dio(struct inode *inode, struct bio *bio, u64 offset)
300 return __btrfs_lookup_bio_sums(inode, bio, offset, NULL, 1);
303 int btrfs_lookup_csums_range(struct btrfs_root *root, u64 start, u64 end,
304 struct list_head *list, int search_commit)
306 struct btrfs_fs_info *fs_info = root->fs_info;
307 struct btrfs_key key;
308 struct btrfs_path *path;
309 struct extent_buffer *leaf;
310 struct btrfs_ordered_sum *sums;
311 struct btrfs_csum_item *item;
313 unsigned long offset;
317 u16 csum_size = btrfs_super_csum_size(fs_info->super_copy);
319 ASSERT(IS_ALIGNED(start, fs_info->sectorsize) &&
320 IS_ALIGNED(end + 1, fs_info->sectorsize));
322 path = btrfs_alloc_path();
327 path->skip_locking = 1;
328 path->reada = READA_FORWARD;
329 path->search_commit_root = 1;
332 key.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
334 key.type = BTRFS_EXTENT_CSUM_KEY;
336 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
339 if (ret > 0 && path->slots[0] > 0) {
340 leaf = path->nodes[0];
341 btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1);
342 if (key.objectid == BTRFS_EXTENT_CSUM_OBJECTID &&
343 key.type == BTRFS_EXTENT_CSUM_KEY) {
344 offset = (start - key.offset) >>
345 fs_info->sb->s_blocksize_bits;
346 if (offset * csum_size <
347 btrfs_item_size_nr(leaf, path->slots[0] - 1))
352 while (start <= end) {
353 leaf = path->nodes[0];
354 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
355 ret = btrfs_next_leaf(root, path);
360 leaf = path->nodes[0];
363 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
364 if (key.objectid != BTRFS_EXTENT_CSUM_OBJECTID ||
365 key.type != BTRFS_EXTENT_CSUM_KEY ||
369 if (key.offset > start)
372 size = btrfs_item_size_nr(leaf, path->slots[0]);
373 csum_end = key.offset + (size / csum_size) * fs_info->sectorsize;
374 if (csum_end <= start) {
379 csum_end = min(csum_end, end + 1);
380 item = btrfs_item_ptr(path->nodes[0], path->slots[0],
381 struct btrfs_csum_item);
382 while (start < csum_end) {
383 size = min_t(size_t, csum_end - start,
384 max_ordered_sum_bytes(fs_info, csum_size));
385 sums = kzalloc(btrfs_ordered_sum_size(fs_info, size),
392 sums->bytenr = start;
393 sums->len = (int)size;
395 offset = (start - key.offset) >>
396 fs_info->sb->s_blocksize_bits;
398 size >>= fs_info->sb->s_blocksize_bits;
400 read_extent_buffer(path->nodes[0],
402 ((unsigned long)item) + offset,
405 start += fs_info->sectorsize * size;
406 list_add_tail(&sums->list, &tmplist);
412 while (ret < 0 && !list_empty(&tmplist)) {
413 sums = list_entry(tmplist.next, struct btrfs_ordered_sum, list);
414 list_del(&sums->list);
417 list_splice_tail(&tmplist, list);
419 btrfs_free_path(path);
424 * btrfs_csum_one_bio - Calculates checksums of the data contained inside a bio
425 * @inode: Owner of the data inside the bio
426 * @bio: Contains the data to be checksummed
427 * @file_start: offset in file this bio begins to describe
428 * @contig: Boolean. If true/1 means all bio vecs in this bio are
429 * contiguous and they begin at @file_start in the file. False/0
430 * means this bio can contains potentially discontigous bio vecs
431 * so the logical offset of each should be calculated separately.
433 blk_status_t btrfs_csum_one_bio(struct inode *inode, struct bio *bio,
434 u64 file_start, int contig)
436 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
437 SHASH_DESC_ON_STACK(shash, fs_info->csum_shash);
438 struct btrfs_ordered_sum *sums;
439 struct btrfs_ordered_extent *ordered = NULL;
441 struct bvec_iter iter;
445 unsigned long total_bytes = 0;
446 unsigned long this_sum_bytes = 0;
450 const u16 csum_size = btrfs_super_csum_size(fs_info->super_copy);
452 nofs_flag = memalloc_nofs_save();
453 sums = kvzalloc(btrfs_ordered_sum_size(fs_info, bio->bi_iter.bi_size),
455 memalloc_nofs_restore(nofs_flag);
458 return BLK_STS_RESOURCE;
460 sums->len = bio->bi_iter.bi_size;
461 INIT_LIST_HEAD(&sums->list);
466 offset = 0; /* shut up gcc */
468 sums->bytenr = (u64)bio->bi_iter.bi_sector << 9;
471 shash->tfm = fs_info->csum_shash;
473 bio_for_each_segment(bvec, bio, iter) {
475 offset = page_offset(bvec.bv_page) + bvec.bv_offset;
478 ordered = btrfs_lookup_ordered_extent(inode, offset);
479 BUG_ON(!ordered); /* Logic error */
482 nr_sectors = BTRFS_BYTES_TO_BLKS(fs_info,
483 bvec.bv_len + fs_info->sectorsize
486 for (i = 0; i < nr_sectors; i++) {
487 if (offset >= ordered->file_offset + ordered->len ||
488 offset < ordered->file_offset) {
489 unsigned long bytes_left;
491 sums->len = this_sum_bytes;
493 btrfs_add_ordered_sum(ordered, sums);
494 btrfs_put_ordered_extent(ordered);
496 bytes_left = bio->bi_iter.bi_size - total_bytes;
498 nofs_flag = memalloc_nofs_save();
499 sums = kvzalloc(btrfs_ordered_sum_size(fs_info,
500 bytes_left), GFP_KERNEL);
501 memalloc_nofs_restore(nofs_flag);
503 return BLK_STS_RESOURCE;
505 sums->len = bytes_left;
506 ordered = btrfs_lookup_ordered_extent(inode,
508 ASSERT(ordered); /* Logic error */
509 sums->bytenr = ((u64)bio->bi_iter.bi_sector << 9)
514 crypto_shash_init(shash);
515 data = kmap_atomic(bvec.bv_page);
516 crypto_shash_update(shash, data + bvec.bv_offset
517 + (i * fs_info->sectorsize),
518 fs_info->sectorsize);
520 crypto_shash_final(shash, (char *)(sums->sums + index));
522 offset += fs_info->sectorsize;
523 this_sum_bytes += fs_info->sectorsize;
524 total_bytes += fs_info->sectorsize;
529 btrfs_add_ordered_sum(ordered, sums);
530 btrfs_put_ordered_extent(ordered);
535 * helper function for csum removal, this expects the
536 * key to describe the csum pointed to by the path, and it expects
537 * the csum to overlap the range [bytenr, len]
539 * The csum should not be entirely contained in the range and the
540 * range should not be entirely contained in the csum.
542 * This calls btrfs_truncate_item with the correct args based on the
543 * overlap, and fixes up the key as required.
545 static noinline void truncate_one_csum(struct btrfs_fs_info *fs_info,
546 struct btrfs_path *path,
547 struct btrfs_key *key,
550 struct extent_buffer *leaf;
551 u16 csum_size = btrfs_super_csum_size(fs_info->super_copy);
553 u64 end_byte = bytenr + len;
554 u32 blocksize_bits = fs_info->sb->s_blocksize_bits;
556 leaf = path->nodes[0];
557 csum_end = btrfs_item_size_nr(leaf, path->slots[0]) / csum_size;
558 csum_end <<= fs_info->sb->s_blocksize_bits;
559 csum_end += key->offset;
561 if (key->offset < bytenr && csum_end <= end_byte) {
566 * A simple truncate off the end of the item
568 u32 new_size = (bytenr - key->offset) >> blocksize_bits;
569 new_size *= csum_size;
570 btrfs_truncate_item(path, new_size, 1);
571 } else if (key->offset >= bytenr && csum_end > end_byte &&
572 end_byte > key->offset) {
577 * we need to truncate from the beginning of the csum
579 u32 new_size = (csum_end - end_byte) >> blocksize_bits;
580 new_size *= csum_size;
582 btrfs_truncate_item(path, new_size, 0);
584 key->offset = end_byte;
585 btrfs_set_item_key_safe(fs_info, path, key);
592 * deletes the csum items from the csum tree for a given
595 int btrfs_del_csums(struct btrfs_trans_handle *trans,
596 struct btrfs_root *root, u64 bytenr, u64 len)
598 struct btrfs_fs_info *fs_info = trans->fs_info;
599 struct btrfs_path *path;
600 struct btrfs_key key;
601 u64 end_byte = bytenr + len;
603 struct extent_buffer *leaf;
605 u16 csum_size = btrfs_super_csum_size(fs_info->super_copy);
606 int blocksize_bits = fs_info->sb->s_blocksize_bits;
608 ASSERT(root == fs_info->csum_root ||
609 root->root_key.objectid == BTRFS_TREE_LOG_OBJECTID);
611 path = btrfs_alloc_path();
616 key.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
617 key.offset = end_byte - 1;
618 key.type = BTRFS_EXTENT_CSUM_KEY;
620 path->leave_spinning = 1;
621 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
624 if (path->slots[0] == 0)
627 } else if (ret < 0) {
631 leaf = path->nodes[0];
632 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
634 if (key.objectid != BTRFS_EXTENT_CSUM_OBJECTID ||
635 key.type != BTRFS_EXTENT_CSUM_KEY) {
639 if (key.offset >= end_byte)
642 csum_end = btrfs_item_size_nr(leaf, path->slots[0]) / csum_size;
643 csum_end <<= blocksize_bits;
644 csum_end += key.offset;
646 /* this csum ends before we start, we're done */
647 if (csum_end <= bytenr)
650 /* delete the entire item, it is inside our range */
651 if (key.offset >= bytenr && csum_end <= end_byte) {
655 * Check how many csum items preceding this one in this
656 * leaf correspond to our range and then delete them all
659 if (key.offset > bytenr && path->slots[0] > 0) {
660 int slot = path->slots[0] - 1;
665 btrfs_item_key_to_cpu(leaf, &pk, slot);
666 if (pk.offset < bytenr ||
667 pk.type != BTRFS_EXTENT_CSUM_KEY ||
669 BTRFS_EXTENT_CSUM_OBJECTID)
671 path->slots[0] = slot;
673 key.offset = pk.offset;
677 ret = btrfs_del_items(trans, root, path,
678 path->slots[0], del_nr);
681 if (key.offset == bytenr)
683 } else if (key.offset < bytenr && csum_end > end_byte) {
684 unsigned long offset;
685 unsigned long shift_len;
686 unsigned long item_offset;
691 * Our bytes are in the middle of the csum,
692 * we need to split this item and insert a new one.
694 * But we can't drop the path because the
695 * csum could change, get removed, extended etc.
697 * The trick here is the max size of a csum item leaves
698 * enough room in the tree block for a single
699 * item header. So, we split the item in place,
700 * adding a new header pointing to the existing
701 * bytes. Then we loop around again and we have
702 * a nicely formed csum item that we can neatly
705 offset = (bytenr - key.offset) >> blocksize_bits;
708 shift_len = (len >> blocksize_bits) * csum_size;
710 item_offset = btrfs_item_ptr_offset(leaf,
713 memzero_extent_buffer(leaf, item_offset + offset,
718 * btrfs_split_item returns -EAGAIN when the
719 * item changed size or key
721 ret = btrfs_split_item(trans, root, path, &key, offset);
722 if (ret && ret != -EAGAIN) {
723 btrfs_abort_transaction(trans, ret);
728 key.offset = end_byte - 1;
730 truncate_one_csum(fs_info, path, &key, bytenr, len);
731 if (key.offset < bytenr)
734 btrfs_release_path(path);
736 btrfs_free_path(path);
740 int btrfs_csum_file_blocks(struct btrfs_trans_handle *trans,
741 struct btrfs_root *root,
742 struct btrfs_ordered_sum *sums)
744 struct btrfs_fs_info *fs_info = root->fs_info;
745 struct btrfs_key file_key;
746 struct btrfs_key found_key;
747 struct btrfs_path *path;
748 struct btrfs_csum_item *item;
749 struct btrfs_csum_item *item_end;
750 struct extent_buffer *leaf = NULL;
760 u16 csum_size = btrfs_super_csum_size(fs_info->super_copy);
762 path = btrfs_alloc_path();
766 next_offset = (u64)-1;
768 bytenr = sums->bytenr + total_bytes;
769 file_key.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
770 file_key.offset = bytenr;
771 file_key.type = BTRFS_EXTENT_CSUM_KEY;
773 item = btrfs_lookup_csum(trans, root, path, bytenr, 1);
776 leaf = path->nodes[0];
777 item_end = btrfs_item_ptr(leaf, path->slots[0],
778 struct btrfs_csum_item);
779 item_end = (struct btrfs_csum_item *)((char *)item_end +
780 btrfs_item_size_nr(leaf, path->slots[0]));
784 if (ret != -EFBIG && ret != -ENOENT)
789 /* we found one, but it isn't big enough yet */
790 leaf = path->nodes[0];
791 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
792 if ((item_size / csum_size) >=
793 MAX_CSUM_ITEMS(fs_info, csum_size)) {
794 /* already at max size, make a new one */
798 int slot = path->slots[0] + 1;
799 /* we didn't find a csum item, insert one */
800 nritems = btrfs_header_nritems(path->nodes[0]);
801 if (!nritems || (path->slots[0] >= nritems - 1)) {
802 ret = btrfs_next_leaf(root, path);
805 } else if (ret > 0) {
809 slot = path->slots[0];
811 btrfs_item_key_to_cpu(path->nodes[0], &found_key, slot);
812 if (found_key.objectid != BTRFS_EXTENT_CSUM_OBJECTID ||
813 found_key.type != BTRFS_EXTENT_CSUM_KEY) {
817 next_offset = found_key.offset;
823 * at this point, we know the tree has an item, but it isn't big
824 * enough yet to put our csum in. Grow it
826 btrfs_release_path(path);
827 ret = btrfs_search_slot(trans, root, &file_key, path,
833 if (path->slots[0] == 0)
838 leaf = path->nodes[0];
839 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
840 csum_offset = (bytenr - found_key.offset) >>
841 fs_info->sb->s_blocksize_bits;
843 if (found_key.type != BTRFS_EXTENT_CSUM_KEY ||
844 found_key.objectid != BTRFS_EXTENT_CSUM_OBJECTID ||
845 csum_offset >= MAX_CSUM_ITEMS(fs_info, csum_size)) {
849 if (csum_offset == btrfs_item_size_nr(leaf, path->slots[0]) /
856 if (btrfs_leaf_free_space(leaf) <
857 sizeof(struct btrfs_item) + csum_size * 2)
860 free_space = btrfs_leaf_free_space(leaf) -
861 sizeof(struct btrfs_item) - csum_size;
862 tmp = sums->len - total_bytes;
863 tmp >>= fs_info->sb->s_blocksize_bits;
866 extend_nr = max_t(int, 1, (int)tmp);
867 diff = (csum_offset + extend_nr) * csum_size;
869 MAX_CSUM_ITEMS(fs_info, csum_size) * csum_size);
871 diff = diff - btrfs_item_size_nr(leaf, path->slots[0]);
872 diff = min(free_space, diff);
876 btrfs_extend_item(path, diff);
882 btrfs_release_path(path);
887 tmp = sums->len - total_bytes;
888 tmp >>= fs_info->sb->s_blocksize_bits;
889 tmp = min(tmp, (next_offset - file_key.offset) >>
890 fs_info->sb->s_blocksize_bits);
892 tmp = max_t(u64, 1, tmp);
893 tmp = min_t(u64, tmp, MAX_CSUM_ITEMS(fs_info, csum_size));
894 ins_size = csum_size * tmp;
896 ins_size = csum_size;
898 path->leave_spinning = 1;
899 ret = btrfs_insert_empty_item(trans, root, path, &file_key,
901 path->leave_spinning = 0;
904 if (WARN_ON(ret != 0))
906 leaf = path->nodes[0];
908 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
909 item_end = (struct btrfs_csum_item *)((unsigned char *)item +
910 btrfs_item_size_nr(leaf, path->slots[0]));
911 item = (struct btrfs_csum_item *)((unsigned char *)item +
912 csum_offset * csum_size);
914 ins_size = (u32)(sums->len - total_bytes) >>
915 fs_info->sb->s_blocksize_bits;
916 ins_size *= csum_size;
917 ins_size = min_t(u32, (unsigned long)item_end - (unsigned long)item,
919 write_extent_buffer(leaf, sums->sums + index, (unsigned long)item,
923 ins_size /= csum_size;
924 total_bytes += ins_size * fs_info->sectorsize;
926 btrfs_mark_buffer_dirty(path->nodes[0]);
927 if (total_bytes < sums->len) {
928 btrfs_release_path(path);
933 btrfs_free_path(path);
940 void btrfs_extent_item_to_extent_map(struct btrfs_inode *inode,
941 const struct btrfs_path *path,
942 struct btrfs_file_extent_item *fi,
943 const bool new_inline,
944 struct extent_map *em)
946 struct btrfs_fs_info *fs_info = inode->root->fs_info;
947 struct btrfs_root *root = inode->root;
948 struct extent_buffer *leaf = path->nodes[0];
949 const int slot = path->slots[0];
950 struct btrfs_key key;
951 u64 extent_start, extent_end;
953 u8 type = btrfs_file_extent_type(leaf, fi);
954 int compress_type = btrfs_file_extent_compression(leaf, fi);
956 em->bdev = fs_info->fs_devices->latest_bdev;
957 btrfs_item_key_to_cpu(leaf, &key, slot);
958 extent_start = key.offset;
960 if (type == BTRFS_FILE_EXTENT_REG ||
961 type == BTRFS_FILE_EXTENT_PREALLOC) {
962 extent_end = extent_start +
963 btrfs_file_extent_num_bytes(leaf, fi);
964 } else if (type == BTRFS_FILE_EXTENT_INLINE) {
966 size = btrfs_file_extent_ram_bytes(leaf, fi);
967 extent_end = ALIGN(extent_start + size,
968 fs_info->sectorsize);
971 em->ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi);
972 if (type == BTRFS_FILE_EXTENT_REG ||
973 type == BTRFS_FILE_EXTENT_PREALLOC) {
974 em->start = extent_start;
975 em->len = extent_end - extent_start;
976 em->orig_start = extent_start -
977 btrfs_file_extent_offset(leaf, fi);
978 em->orig_block_len = btrfs_file_extent_disk_num_bytes(leaf, fi);
979 bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
981 em->block_start = EXTENT_MAP_HOLE;
984 if (compress_type != BTRFS_COMPRESS_NONE) {
985 set_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
986 em->compress_type = compress_type;
987 em->block_start = bytenr;
988 em->block_len = em->orig_block_len;
990 bytenr += btrfs_file_extent_offset(leaf, fi);
991 em->block_start = bytenr;
992 em->block_len = em->len;
993 if (type == BTRFS_FILE_EXTENT_PREALLOC)
994 set_bit(EXTENT_FLAG_PREALLOC, &em->flags);
996 } else if (type == BTRFS_FILE_EXTENT_INLINE) {
997 em->block_start = EXTENT_MAP_INLINE;
998 em->start = extent_start;
999 em->len = extent_end - extent_start;
1001 * Initialize orig_start and block_len with the same values
1002 * as in inode.c:btrfs_get_extent().
1004 em->orig_start = EXTENT_MAP_HOLE;
1005 em->block_len = (u64)-1;
1006 if (!new_inline && compress_type != BTRFS_COMPRESS_NONE) {
1007 set_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
1008 em->compress_type = compress_type;
1012 "unknown file extent item type %d, inode %llu, offset %llu, "
1013 "root %llu", type, btrfs_ino(inode), extent_start,
1014 root->root_key.objectid);