1c1d7c514SDavid Sterba // SPDX-License-Identifier: GPL-2.0 26cbd5570SChris Mason /* 36cbd5570SChris Mason * Copyright (C) 2007 Oracle. All rights reserved. 46cbd5570SChris Mason */ 56cbd5570SChris Mason 6065631f6SChris Mason #include <linux/bio.h> 75a0e3ad6STejun Heo #include <linux/slab.h> 8065631f6SChris Mason #include <linux/pagemap.h> 9065631f6SChris Mason #include <linux/highmem.h> 10a3d46aeaSNikolay Borisov #include <linux/sched/mm.h> 11d5178578SJohannes Thumshirn #include <crypto/hash.h> 129b569ea0SJosef Bacik #include "messages.h" 13cea62800SJohannes Thumshirn #include "misc.h" 141e1d2701SChris Mason #include "ctree.h" 15dee26a9fSChris Mason #include "disk-io.h" 169f5fae2fSChris Mason #include "transaction.h" 17103c1972SChristoph Hellwig #include "bio.h" 181de037a4SChris Mason #include "print-tree.h" 19ebb8765bSAnand Jain #include "compression.h" 20c7f13d42SJosef Bacik #include "fs.h" 2107e81dc9SJosef Bacik #include "accessors.h" 227c8ede16SJosef Bacik #include "file-item.h" 237f0add25SJosef Bacik #include "super.h" 241e1d2701SChris Mason 2542049bf6SChris Mason #define __MAX_CSUM_ITEMS(r, size) ((unsigned long)(((BTRFS_LEAF_DATA_SIZE(r) - \ 2642049bf6SChris Mason sizeof(struct btrfs_item) * 2) / \ 2742049bf6SChris Mason size) - 1)) 2807d400a6SYan Zheng 29221b8318SZach Brown #define MAX_CSUM_ITEMS(r, size) (min_t(u32, __MAX_CSUM_ITEMS(r, size), \ 3009cbfeafSKirill A. Shutemov PAGE_SIZE)) 317ca4be45SChris Mason 3243dd529aSDavid Sterba /* 3343dd529aSDavid Sterba * Set inode's size according to filesystem options. 34ca4207aeSNikolay Borisov * 35ca4207aeSNikolay Borisov * @inode: inode we want to update the disk_i_size for 36ca4207aeSNikolay Borisov * @new_i_size: i_size we want to set to, 0 if we use i_size 3741a2ee75SJosef Bacik * 3841a2ee75SJosef Bacik * With NO_HOLES set this simply sets the disk_is_size to whatever i_size_read() 3941a2ee75SJosef Bacik * returns as it is perfectly fine with a file that has holes without hole file 4041a2ee75SJosef Bacik * extent items. 4141a2ee75SJosef Bacik * 4241a2ee75SJosef Bacik * However without NO_HOLES we need to only return the area that is contiguous 4341a2ee75SJosef Bacik * from the 0 offset of the file. Otherwise we could end up adjust i_size up 4441a2ee75SJosef Bacik * to an extent that has a gap in between. 4541a2ee75SJosef Bacik * 4641a2ee75SJosef Bacik * Finally new_i_size should only be set in the case of truncate where we're not 4741a2ee75SJosef Bacik * ready to use i_size_read() as the limiter yet. 4841a2ee75SJosef Bacik */ 4976aea537SNikolay Borisov void btrfs_inode_safe_disk_i_size_write(struct btrfs_inode *inode, u64 new_i_size) 5041a2ee75SJosef Bacik { 5176aea537SNikolay Borisov struct btrfs_fs_info *fs_info = inode->root->fs_info; 5241a2ee75SJosef Bacik u64 start, end, i_size; 5341a2ee75SJosef Bacik int ret; 5441a2ee75SJosef Bacik 5576aea537SNikolay Borisov i_size = new_i_size ?: i_size_read(&inode->vfs_inode); 5641a2ee75SJosef Bacik if (btrfs_fs_incompat(fs_info, NO_HOLES)) { 5776aea537SNikolay Borisov inode->disk_i_size = i_size; 5841a2ee75SJosef Bacik return; 5941a2ee75SJosef Bacik } 6041a2ee75SJosef Bacik 6176aea537SNikolay Borisov spin_lock(&inode->lock); 6276aea537SNikolay Borisov ret = find_contiguous_extent_bit(&inode->file_extent_tree, 0, &start, 6376aea537SNikolay Borisov &end, EXTENT_DIRTY); 6441a2ee75SJosef Bacik if (!ret && start == 0) 6541a2ee75SJosef Bacik i_size = min(i_size, end + 1); 6641a2ee75SJosef Bacik else 6741a2ee75SJosef Bacik i_size = 0; 6876aea537SNikolay Borisov inode->disk_i_size = i_size; 6976aea537SNikolay Borisov spin_unlock(&inode->lock); 7041a2ee75SJosef Bacik } 7141a2ee75SJosef Bacik 7243dd529aSDavid Sterba /* 7343dd529aSDavid Sterba * Mark range within a file as having a new extent inserted. 74ca4207aeSNikolay Borisov * 75ca4207aeSNikolay Borisov * @inode: inode being modified 76ca4207aeSNikolay Borisov * @start: start file offset of the file extent we've inserted 77ca4207aeSNikolay Borisov * @len: logical length of the file extent item 7841a2ee75SJosef Bacik * 7941a2ee75SJosef Bacik * Call when we are inserting a new file extent where there was none before. 8041a2ee75SJosef Bacik * Does not need to call this in the case where we're replacing an existing file 8141a2ee75SJosef Bacik * extent, however if not sure it's fine to call this multiple times. 8241a2ee75SJosef Bacik * 8341a2ee75SJosef Bacik * The start and len must match the file extent item, so thus must be sectorsize 8441a2ee75SJosef Bacik * aligned. 8541a2ee75SJosef Bacik */ 8641a2ee75SJosef Bacik int btrfs_inode_set_file_extent_range(struct btrfs_inode *inode, u64 start, 8741a2ee75SJosef Bacik u64 len) 8841a2ee75SJosef Bacik { 8941a2ee75SJosef Bacik if (len == 0) 9041a2ee75SJosef Bacik return 0; 9141a2ee75SJosef Bacik 9241a2ee75SJosef Bacik ASSERT(IS_ALIGNED(start + len, inode->root->fs_info->sectorsize)); 9341a2ee75SJosef Bacik 9441a2ee75SJosef Bacik if (btrfs_fs_incompat(inode->root->fs_info, NO_HOLES)) 9541a2ee75SJosef Bacik return 0; 9641a2ee75SJosef Bacik return set_extent_bits(&inode->file_extent_tree, start, start + len - 1, 9741a2ee75SJosef Bacik EXTENT_DIRTY); 9841a2ee75SJosef Bacik } 9941a2ee75SJosef Bacik 10043dd529aSDavid Sterba /* 10143dd529aSDavid Sterba * Mark an inode range as not having a backing extent. 102ca4207aeSNikolay Borisov * 103ca4207aeSNikolay Borisov * @inode: inode being modified 104ca4207aeSNikolay Borisov * @start: start file offset of the file extent we've inserted 105ca4207aeSNikolay Borisov * @len: logical length of the file extent item 10641a2ee75SJosef Bacik * 10741a2ee75SJosef Bacik * Called when we drop a file extent, for example when we truncate. Doesn't 10841a2ee75SJosef Bacik * need to be called for cases where we're replacing a file extent, like when 10941a2ee75SJosef Bacik * we've COWed a file extent. 11041a2ee75SJosef Bacik * 11141a2ee75SJosef Bacik * The start and len must match the file extent item, so thus must be sectorsize 11241a2ee75SJosef Bacik * aligned. 11341a2ee75SJosef Bacik */ 11441a2ee75SJosef Bacik int btrfs_inode_clear_file_extent_range(struct btrfs_inode *inode, u64 start, 11541a2ee75SJosef Bacik u64 len) 11641a2ee75SJosef Bacik { 11741a2ee75SJosef Bacik if (len == 0) 11841a2ee75SJosef Bacik return 0; 11941a2ee75SJosef Bacik 12041a2ee75SJosef Bacik ASSERT(IS_ALIGNED(start + len, inode->root->fs_info->sectorsize) || 12141a2ee75SJosef Bacik len == (u64)-1); 12241a2ee75SJosef Bacik 12341a2ee75SJosef Bacik if (btrfs_fs_incompat(inode->root->fs_info, NO_HOLES)) 12441a2ee75SJosef Bacik return 0; 12541a2ee75SJosef Bacik return clear_extent_bit(&inode->file_extent_tree, start, 126bd015294SJosef Bacik start + len - 1, EXTENT_DIRTY, NULL); 12741a2ee75SJosef Bacik } 12841a2ee75SJosef Bacik 129cb649e81SQu Wenruo static size_t bytes_to_csum_size(const struct btrfs_fs_info *fs_info, u32 bytes) 1301e25a2e3SJohannes Thumshirn { 131cb649e81SQu Wenruo ASSERT(IS_ALIGNED(bytes, fs_info->sectorsize)); 1321e25a2e3SJohannes Thumshirn 133cb649e81SQu Wenruo return (bytes >> fs_info->sectorsize_bits) * fs_info->csum_size; 134cb649e81SQu Wenruo } 135cb649e81SQu Wenruo 136cb649e81SQu Wenruo static size_t csum_size_to_bytes(const struct btrfs_fs_info *fs_info, u32 csum_size) 137cb649e81SQu Wenruo { 138cb649e81SQu Wenruo ASSERT(IS_ALIGNED(csum_size, fs_info->csum_size)); 139cb649e81SQu Wenruo 140cb649e81SQu Wenruo return (csum_size / fs_info->csum_size) << fs_info->sectorsize_bits; 141cb649e81SQu Wenruo } 142cb649e81SQu Wenruo 143cb649e81SQu Wenruo static inline u32 max_ordered_sum_bytes(const struct btrfs_fs_info *fs_info) 144cb649e81SQu Wenruo { 145cb649e81SQu Wenruo u32 max_csum_size = round_down(PAGE_SIZE - sizeof(struct btrfs_ordered_sum), 146cb649e81SQu Wenruo fs_info->csum_size); 147cb649e81SQu Wenruo 148cb649e81SQu Wenruo return csum_size_to_bytes(fs_info, max_csum_size); 1491e25a2e3SJohannes Thumshirn } 15007d400a6SYan Zheng 1512b6433c7SJosef Bacik /* 1522b6433c7SJosef Bacik * Calculate the total size needed to allocate for an ordered sum structure 1532b6433c7SJosef Bacik * spanning @bytes in the file. 1542b6433c7SJosef Bacik */ 1552b6433c7SJosef Bacik static int btrfs_ordered_sum_size(struct btrfs_fs_info *fs_info, unsigned long bytes) 1562b6433c7SJosef Bacik { 157cb649e81SQu Wenruo return sizeof(struct btrfs_ordered_sum) + bytes_to_csum_size(fs_info, bytes); 1582b6433c7SJosef Bacik } 1592b6433c7SJosef Bacik 160d1f68ba0SOmar Sandoval int btrfs_insert_hole_extent(struct btrfs_trans_handle *trans, 161dee26a9fSChris Mason struct btrfs_root *root, 162d1f68ba0SOmar Sandoval u64 objectid, u64 pos, u64 num_bytes) 1639f5fae2fSChris Mason { 164dee26a9fSChris Mason int ret = 0; 165dee26a9fSChris Mason struct btrfs_file_extent_item *item; 166dee26a9fSChris Mason struct btrfs_key file_key; 1675caf2a00SChris Mason struct btrfs_path *path; 1685f39d397SChris Mason struct extent_buffer *leaf; 169dee26a9fSChris Mason 1705caf2a00SChris Mason path = btrfs_alloc_path(); 171db5b493aSTsutomu Itoh if (!path) 172db5b493aSTsutomu Itoh return -ENOMEM; 173dee26a9fSChris Mason file_key.objectid = objectid; 174b18c6685SChris Mason file_key.offset = pos; 175962a298fSDavid Sterba file_key.type = BTRFS_EXTENT_DATA_KEY; 176dee26a9fSChris Mason 1775caf2a00SChris Mason ret = btrfs_insert_empty_item(trans, root, path, &file_key, 178dee26a9fSChris Mason sizeof(*item)); 17954aa1f4dSChris Mason if (ret < 0) 18054aa1f4dSChris Mason goto out; 18179787eaaSJeff Mahoney BUG_ON(ret); /* Can't happen */ 1825f39d397SChris Mason leaf = path->nodes[0]; 1835f39d397SChris Mason item = btrfs_item_ptr(leaf, path->slots[0], 184dee26a9fSChris Mason struct btrfs_file_extent_item); 185d1f68ba0SOmar Sandoval btrfs_set_file_extent_disk_bytenr(leaf, item, 0); 186d1f68ba0SOmar Sandoval btrfs_set_file_extent_disk_num_bytes(leaf, item, 0); 187d1f68ba0SOmar Sandoval btrfs_set_file_extent_offset(leaf, item, 0); 188db94535dSChris Mason btrfs_set_file_extent_num_bytes(leaf, item, num_bytes); 189d1f68ba0SOmar Sandoval btrfs_set_file_extent_ram_bytes(leaf, item, num_bytes); 1905f39d397SChris Mason btrfs_set_file_extent_generation(leaf, item, trans->transid); 1915f39d397SChris Mason btrfs_set_file_extent_type(leaf, item, BTRFS_FILE_EXTENT_REG); 192d1f68ba0SOmar Sandoval btrfs_set_file_extent_compression(leaf, item, 0); 193d1f68ba0SOmar Sandoval btrfs_set_file_extent_encryption(leaf, item, 0); 194d1f68ba0SOmar Sandoval btrfs_set_file_extent_other_encoding(leaf, item, 0); 195c8b97818SChris Mason 1965f39d397SChris Mason btrfs_mark_buffer_dirty(leaf); 19754aa1f4dSChris Mason out: 1985caf2a00SChris Mason btrfs_free_path(path); 19954aa1f4dSChris Mason return ret; 2009f5fae2fSChris Mason } 201dee26a9fSChris Mason 20248a3b636SEric Sandeen static struct btrfs_csum_item * 20348a3b636SEric Sandeen btrfs_lookup_csum(struct btrfs_trans_handle *trans, 204b18c6685SChris Mason struct btrfs_root *root, 2056567e837SChris Mason struct btrfs_path *path, 206d20f7043SChris Mason u64 bytenr, int cow) 2076567e837SChris Mason { 2080b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 2096567e837SChris Mason int ret; 2106567e837SChris Mason struct btrfs_key file_key; 2116567e837SChris Mason struct btrfs_key found_key; 2126567e837SChris Mason struct btrfs_csum_item *item; 2135f39d397SChris Mason struct extent_buffer *leaf; 2146567e837SChris Mason u64 csum_offset = 0; 215223486c2SDavid Sterba const u32 csum_size = fs_info->csum_size; 216a429e513SChris Mason int csums_in_item; 2176567e837SChris Mason 218d20f7043SChris Mason file_key.objectid = BTRFS_EXTENT_CSUM_OBJECTID; 219d20f7043SChris Mason file_key.offset = bytenr; 220962a298fSDavid Sterba file_key.type = BTRFS_EXTENT_CSUM_KEY; 221b18c6685SChris Mason ret = btrfs_search_slot(trans, root, &file_key, path, 0, cow); 2226567e837SChris Mason if (ret < 0) 2236567e837SChris Mason goto fail; 2245f39d397SChris Mason leaf = path->nodes[0]; 2256567e837SChris Mason if (ret > 0) { 2266567e837SChris Mason ret = 1; 22770b2befdSChris Mason if (path->slots[0] == 0) 2286567e837SChris Mason goto fail; 2296567e837SChris Mason path->slots[0]--; 2305f39d397SChris Mason btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); 231962a298fSDavid Sterba if (found_key.type != BTRFS_EXTENT_CSUM_KEY) 2326567e837SChris Mason goto fail; 233d20f7043SChris Mason 234d20f7043SChris Mason csum_offset = (bytenr - found_key.offset) >> 235265fdfa6SDavid Sterba fs_info->sectorsize_bits; 2363212fa14SJosef Bacik csums_in_item = btrfs_item_size(leaf, path->slots[0]); 237607d432dSJosef Bacik csums_in_item /= csum_size; 238a429e513SChris Mason 23982d130ffSMiao Xie if (csum_offset == csums_in_item) { 240a429e513SChris Mason ret = -EFBIG; 2416567e837SChris Mason goto fail; 24282d130ffSMiao Xie } else if (csum_offset > csums_in_item) { 24382d130ffSMiao Xie goto fail; 2446567e837SChris Mason } 2456567e837SChris Mason } 2466567e837SChris Mason item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item); 247509659cdSChris Mason item = (struct btrfs_csum_item *)((unsigned char *)item + 248607d432dSJosef Bacik csum_offset * csum_size); 2496567e837SChris Mason return item; 2506567e837SChris Mason fail: 2516567e837SChris Mason if (ret > 0) 252b18c6685SChris Mason ret = -ENOENT; 2536567e837SChris Mason return ERR_PTR(ret); 2546567e837SChris Mason } 2556567e837SChris Mason 256dee26a9fSChris Mason int btrfs_lookup_file_extent(struct btrfs_trans_handle *trans, 257dee26a9fSChris Mason struct btrfs_root *root, 258dee26a9fSChris Mason struct btrfs_path *path, u64 objectid, 2599773a788SChris Mason u64 offset, int mod) 260dee26a9fSChris Mason { 261dee26a9fSChris Mason struct btrfs_key file_key; 262dee26a9fSChris Mason int ins_len = mod < 0 ? -1 : 0; 263dee26a9fSChris Mason int cow = mod != 0; 264dee26a9fSChris Mason 265dee26a9fSChris Mason file_key.objectid = objectid; 26670b2befdSChris Mason file_key.offset = offset; 267962a298fSDavid Sterba file_key.type = BTRFS_EXTENT_DATA_KEY; 268f8ee80deSMarcos Paulo de Souza 269f8ee80deSMarcos Paulo de Souza return btrfs_search_slot(trans, root, &file_key, path, ins_len, cow); 270dee26a9fSChris Mason } 271f254e52cSChris Mason 2726275193eSQu Wenruo /* 2736275193eSQu Wenruo * Find checksums for logical bytenr range [disk_bytenr, disk_bytenr + len) and 27443dd529aSDavid Sterba * store the result to @dst. 2756275193eSQu Wenruo * 2766275193eSQu Wenruo * Return >0 for the number of sectors we found. 2776275193eSQu Wenruo * Return 0 for the range [disk_bytenr, disk_bytenr + sectorsize) has no csum 2786275193eSQu Wenruo * for it. Caller may want to try next sector until one range is hit. 2796275193eSQu Wenruo * Return <0 for fatal error. 2806275193eSQu Wenruo */ 2816275193eSQu Wenruo static int search_csum_tree(struct btrfs_fs_info *fs_info, 2826275193eSQu Wenruo struct btrfs_path *path, u64 disk_bytenr, 2836275193eSQu Wenruo u64 len, u8 *dst) 2846275193eSQu Wenruo { 285fc28b25eSJosef Bacik struct btrfs_root *csum_root; 2866275193eSQu Wenruo struct btrfs_csum_item *item = NULL; 2876275193eSQu Wenruo struct btrfs_key key; 2886275193eSQu Wenruo const u32 sectorsize = fs_info->sectorsize; 2896275193eSQu Wenruo const u32 csum_size = fs_info->csum_size; 2906275193eSQu Wenruo u32 itemsize; 2916275193eSQu Wenruo int ret; 2926275193eSQu Wenruo u64 csum_start; 2936275193eSQu Wenruo u64 csum_len; 2946275193eSQu Wenruo 2956275193eSQu Wenruo ASSERT(IS_ALIGNED(disk_bytenr, sectorsize) && 2966275193eSQu Wenruo IS_ALIGNED(len, sectorsize)); 2976275193eSQu Wenruo 2986275193eSQu Wenruo /* Check if the current csum item covers disk_bytenr */ 2996275193eSQu Wenruo if (path->nodes[0]) { 3006275193eSQu Wenruo item = btrfs_item_ptr(path->nodes[0], path->slots[0], 3016275193eSQu Wenruo struct btrfs_csum_item); 3026275193eSQu Wenruo btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 3033212fa14SJosef Bacik itemsize = btrfs_item_size(path->nodes[0], path->slots[0]); 3046275193eSQu Wenruo 3056275193eSQu Wenruo csum_start = key.offset; 3066275193eSQu Wenruo csum_len = (itemsize / csum_size) * sectorsize; 3076275193eSQu Wenruo 3086275193eSQu Wenruo if (in_range(disk_bytenr, csum_start, csum_len)) 3096275193eSQu Wenruo goto found; 3106275193eSQu Wenruo } 3116275193eSQu Wenruo 3126275193eSQu Wenruo /* Current item doesn't contain the desired range, search again */ 3136275193eSQu Wenruo btrfs_release_path(path); 314fc28b25eSJosef Bacik csum_root = btrfs_csum_root(fs_info, disk_bytenr); 315fc28b25eSJosef Bacik item = btrfs_lookup_csum(NULL, csum_root, path, disk_bytenr, 0); 3166275193eSQu Wenruo if (IS_ERR(item)) { 3176275193eSQu Wenruo ret = PTR_ERR(item); 3186275193eSQu Wenruo goto out; 3196275193eSQu Wenruo } 3206275193eSQu Wenruo btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 3213212fa14SJosef Bacik itemsize = btrfs_item_size(path->nodes[0], path->slots[0]); 3226275193eSQu Wenruo 3236275193eSQu Wenruo csum_start = key.offset; 3246275193eSQu Wenruo csum_len = (itemsize / csum_size) * sectorsize; 3256275193eSQu Wenruo ASSERT(in_range(disk_bytenr, csum_start, csum_len)); 3266275193eSQu Wenruo 3276275193eSQu Wenruo found: 3286275193eSQu Wenruo ret = (min(csum_start + csum_len, disk_bytenr + len) - 3296275193eSQu Wenruo disk_bytenr) >> fs_info->sectorsize_bits; 3306275193eSQu Wenruo read_extent_buffer(path->nodes[0], dst, (unsigned long)item, 3316275193eSQu Wenruo ret * csum_size); 3326275193eSQu Wenruo out: 33303ddb19dSJosef Bacik if (ret == -ENOENT || ret == -EFBIG) 3346275193eSQu Wenruo ret = 0; 3356275193eSQu Wenruo return ret; 3366275193eSQu Wenruo } 3376275193eSQu Wenruo 3386275193eSQu Wenruo /* 3396275193eSQu Wenruo * Locate the file_offset of @cur_disk_bytenr of a @bio. 3406275193eSQu Wenruo * 3416275193eSQu Wenruo * Bio of btrfs represents read range of 3426275193eSQu Wenruo * [bi_sector << 9, bi_sector << 9 + bi_size). 3436275193eSQu Wenruo * Knowing this, we can iterate through each bvec to locate the page belong to 3446275193eSQu Wenruo * @cur_disk_bytenr and get the file offset. 3456275193eSQu Wenruo * 3466275193eSQu Wenruo * @inode is used to determine if the bvec page really belongs to @inode. 3476275193eSQu Wenruo * 3486275193eSQu Wenruo * Return 0 if we can't find the file offset 3496275193eSQu Wenruo * Return >0 if we find the file offset and restore it to @file_offset_ret 3506275193eSQu Wenruo */ 3516275193eSQu Wenruo static int search_file_offset_in_bio(struct bio *bio, struct inode *inode, 3526275193eSQu Wenruo u64 disk_bytenr, u64 *file_offset_ret) 3536275193eSQu Wenruo { 3546275193eSQu Wenruo struct bvec_iter iter; 3556275193eSQu Wenruo struct bio_vec bvec; 3566275193eSQu Wenruo u64 cur = bio->bi_iter.bi_sector << SECTOR_SHIFT; 3576275193eSQu Wenruo int ret = 0; 3586275193eSQu Wenruo 3596275193eSQu Wenruo bio_for_each_segment(bvec, bio, iter) { 3606275193eSQu Wenruo struct page *page = bvec.bv_page; 3616275193eSQu Wenruo 3626275193eSQu Wenruo if (cur > disk_bytenr) 3636275193eSQu Wenruo break; 3646275193eSQu Wenruo if (cur + bvec.bv_len <= disk_bytenr) { 3656275193eSQu Wenruo cur += bvec.bv_len; 3666275193eSQu Wenruo continue; 3676275193eSQu Wenruo } 3686275193eSQu Wenruo ASSERT(in_range(disk_bytenr, cur, bvec.bv_len)); 3696275193eSQu Wenruo if (page->mapping && page->mapping->host && 3706275193eSQu Wenruo page->mapping->host == inode) { 3716275193eSQu Wenruo ret = 1; 3726275193eSQu Wenruo *file_offset_ret = page_offset(page) + bvec.bv_offset + 3736275193eSQu Wenruo disk_bytenr - cur; 3746275193eSQu Wenruo break; 3756275193eSQu Wenruo } 3766275193eSQu Wenruo } 3776275193eSQu Wenruo return ret; 3786275193eSQu Wenruo } 3796275193eSQu Wenruo 38043dd529aSDavid Sterba /* 3816275193eSQu Wenruo * Lookup the checksum for the read bio in csum tree. 3829e46458aSQu Wenruo * 383e62958fcSOmar Sandoval * Return: BLK_STS_RESOURCE if allocating memory fails, BLK_STS_OK otherwise. 384e62958fcSOmar Sandoval */ 385*4ae2edf1SChristoph Hellwig blk_status_t btrfs_lookup_bio_sums(struct btrfs_bio *bbio) 38661b49440SChris Mason { 387*4ae2edf1SChristoph Hellwig struct btrfs_inode *inode = bbio->inode; 388*4ae2edf1SChristoph Hellwig struct btrfs_fs_info *fs_info = inode->root->fs_info; 389*4ae2edf1SChristoph Hellwig struct extent_io_tree *io_tree = &inode->io_tree; 390*4ae2edf1SChristoph Hellwig struct bio *bio = &bbio->bio; 391facc8a22SMiao Xie struct btrfs_path *path; 3926275193eSQu Wenruo const u32 sectorsize = fs_info->sectorsize; 393223486c2SDavid Sterba const u32 csum_size = fs_info->csum_size; 3946275193eSQu Wenruo u32 orig_len = bio->bi_iter.bi_size; 3956275193eSQu Wenruo u64 orig_disk_bytenr = bio->bi_iter.bi_sector << SECTOR_SHIFT; 3966275193eSQu Wenruo u64 cur_disk_bytenr; 3976275193eSQu Wenruo const unsigned int nblocks = orig_len >> fs_info->sectorsize_bits; 3986275193eSQu Wenruo int count = 0; 3991784b7d5SJosef Bacik blk_status_t ret = BLK_STS_OK; 40061b49440SChris Mason 401*4ae2edf1SChristoph Hellwig if ((inode->flags & BTRFS_INODE_NODATASUM) || 402056c8311SJosef Bacik test_bit(BTRFS_FS_STATE_NO_CSUMS, &fs_info->fs_state)) 403334c16d8SJosef Bacik return BLK_STS_OK; 404334c16d8SJosef Bacik 4059e46458aSQu Wenruo /* 4069e46458aSQu Wenruo * This function is only called for read bio. 4079e46458aSQu Wenruo * 4089e46458aSQu Wenruo * This means two things: 4099e46458aSQu Wenruo * - All our csums should only be in csum tree 4109e46458aSQu Wenruo * No ordered extents csums, as ordered extents are only for write 4119e46458aSQu Wenruo * path. 4126275193eSQu Wenruo * - No need to bother any other info from bvec 4136275193eSQu Wenruo * Since we're looking up csums, the only important info is the 4146275193eSQu Wenruo * disk_bytenr and the length, which can be extracted from bi_iter 4156275193eSQu Wenruo * directly. 4169e46458aSQu Wenruo */ 4179e46458aSQu Wenruo ASSERT(bio_op(bio) == REQ_OP_READ); 41861b49440SChris Mason path = btrfs_alloc_path(); 419c2db1073STsutomu Itoh if (!path) 4204e4cbee9SChristoph Hellwig return BLK_STS_RESOURCE; 421facc8a22SMiao Xie 422facc8a22SMiao Xie if (nblocks * csum_size > BTRFS_BIO_INLINE_CSUM_SIZE) { 423c3a3b19bSQu Wenruo bbio->csum = kmalloc_array(nblocks, csum_size, GFP_NOFS); 424c3a3b19bSQu Wenruo if (!bbio->csum) { 425facc8a22SMiao Xie btrfs_free_path(path); 4264e4cbee9SChristoph Hellwig return BLK_STS_RESOURCE; 427facc8a22SMiao Xie } 428facc8a22SMiao Xie } else { 429c3a3b19bSQu Wenruo bbio->csum = bbio->csum_inline; 430facc8a22SMiao Xie } 431facc8a22SMiao Xie 43235478d05SQu Wenruo /* 43335478d05SQu Wenruo * If requested number of sectors is larger than one leaf can contain, 43435478d05SQu Wenruo * kick the readahead for csum tree. 43535478d05SQu Wenruo */ 43635478d05SQu Wenruo if (nblocks > fs_info->csums_per_leaf) 437e4058b54SDavid Sterba path->reada = READA_FORWARD; 43861b49440SChris Mason 4392cf8572dSChris Mason /* 4402cf8572dSChris Mason * the free space stuff is only read when it hasn't been 4412cf8572dSChris Mason * updated in the current transaction. So, we can safely 4422cf8572dSChris Mason * read from the commit root and sidestep a nasty deadlock 4432cf8572dSChris Mason * between reading the free space cache and updating the csum tree. 4442cf8572dSChris Mason */ 445*4ae2edf1SChristoph Hellwig if (btrfs_is_free_space_inode(inode)) { 4462cf8572dSChris Mason path->search_commit_root = 1; 447ddf23b3fSJosef Bacik path->skip_locking = 1; 448ddf23b3fSJosef Bacik } 4492cf8572dSChris Mason 4506275193eSQu Wenruo for (cur_disk_bytenr = orig_disk_bytenr; 4516275193eSQu Wenruo cur_disk_bytenr < orig_disk_bytenr + orig_len; 4526275193eSQu Wenruo cur_disk_bytenr += (count * sectorsize)) { 4536275193eSQu Wenruo u64 search_len = orig_disk_bytenr + orig_len - cur_disk_bytenr; 4546275193eSQu Wenruo unsigned int sector_offset; 4556275193eSQu Wenruo u8 *csum_dst; 456c40a3d38SChandan Rajendra 4576275193eSQu Wenruo /* 4586275193eSQu Wenruo * Although both cur_disk_bytenr and orig_disk_bytenr is u64, 4596275193eSQu Wenruo * we're calculating the offset to the bio start. 4606275193eSQu Wenruo * 4616275193eSQu Wenruo * Bio size is limited to UINT_MAX, thus unsigned int is large 4626275193eSQu Wenruo * enough to contain the raw result, not to mention the right 4636275193eSQu Wenruo * shifted result. 4646275193eSQu Wenruo */ 4656275193eSQu Wenruo ASSERT(cur_disk_bytenr - orig_disk_bytenr < UINT_MAX); 4666275193eSQu Wenruo sector_offset = (cur_disk_bytenr - orig_disk_bytenr) >> 4676275193eSQu Wenruo fs_info->sectorsize_bits; 468*4ae2edf1SChristoph Hellwig csum_dst = bbio->csum + sector_offset * csum_size; 4694989d277SChristoph Hellwig 4706275193eSQu Wenruo count = search_csum_tree(fs_info, path, cur_disk_bytenr, 4716275193eSQu Wenruo search_len, csum_dst); 4721784b7d5SJosef Bacik if (count < 0) { 4731784b7d5SJosef Bacik ret = errno_to_blk_status(count); 474*4ae2edf1SChristoph Hellwig if (bbio->csum != bbio->csum_inline) 475*4ae2edf1SChristoph Hellwig kfree(bbio->csum); 476*4ae2edf1SChristoph Hellwig bbio->csum = NULL; 4771784b7d5SJosef Bacik break; 4781784b7d5SJosef Bacik } 4791784b7d5SJosef Bacik 4806275193eSQu Wenruo /* 4811784b7d5SJosef Bacik * We didn't find a csum for this range. We need to make sure 4821784b7d5SJosef Bacik * we complain loudly about this, because we are not NODATASUM. 4831784b7d5SJosef Bacik * 4841784b7d5SJosef Bacik * However for the DATA_RELOC inode we could potentially be 4851784b7d5SJosef Bacik * relocating data extents for a NODATASUM inode, so the inode 4861784b7d5SJosef Bacik * itself won't be marked with NODATASUM, but the extent we're 4871784b7d5SJosef Bacik * copying is in fact NODATASUM. If we don't find a csum we 4881784b7d5SJosef Bacik * assume this is the case. 4896275193eSQu Wenruo */ 4901784b7d5SJosef Bacik if (count == 0) { 4916275193eSQu Wenruo memset(csum_dst, 0, csum_size); 492e4100d98SMiao Xie count = 1; 4936275193eSQu Wenruo 494*4ae2edf1SChristoph Hellwig if (inode->root->root_key.objectid == 49517d217feSYan Zheng BTRFS_DATA_RELOC_TREE_OBJECTID) { 4966275193eSQu Wenruo u64 file_offset; 4976275193eSQu Wenruo int ret; 4986275193eSQu Wenruo 499*4ae2edf1SChristoph Hellwig ret = search_file_offset_in_bio(bio, 500*4ae2edf1SChristoph Hellwig &inode->vfs_inode, 5016275193eSQu Wenruo cur_disk_bytenr, &file_offset); 5026275193eSQu Wenruo if (ret) 5036275193eSQu Wenruo set_extent_bits(io_tree, file_offset, 5046275193eSQu Wenruo file_offset + sectorsize - 1, 505ceeb0ae7SDavid Sterba EXTENT_NODATASUM); 50617d217feSYan Zheng } else { 5076275193eSQu Wenruo btrfs_warn_rl(fs_info, 5086275193eSQu Wenruo "csum hole found for disk bytenr range [%llu, %llu)", 5096275193eSQu Wenruo cur_disk_bytenr, cur_disk_bytenr + sectorsize); 51017d217feSYan Zheng } 5114989d277SChristoph Hellwig } 5124989d277SChristoph Hellwig } 5134989d277SChristoph Hellwig 51461b49440SChris Mason btrfs_free_path(path); 5151784b7d5SJosef Bacik return ret; 5164b46fce2SJosef Bacik } 5174b46fce2SJosef Bacik 51897e38239SQu Wenruo int btrfs_lookup_csums_list(struct btrfs_root *root, u64 start, u64 end, 51926ce9114SJosef Bacik struct list_head *list, int search_commit, 52026ce9114SJosef Bacik bool nowait) 52117d217feSYan Zheng { 5220b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 52317d217feSYan Zheng struct btrfs_key key; 52417d217feSYan Zheng struct btrfs_path *path; 52517d217feSYan Zheng struct extent_buffer *leaf; 52617d217feSYan Zheng struct btrfs_ordered_sum *sums; 52717d217feSYan Zheng struct btrfs_csum_item *item; 5280678b618SMark Fasheh LIST_HEAD(tmplist); 52917d217feSYan Zheng int ret; 53017d217feSYan Zheng 5310b246afaSJeff Mahoney ASSERT(IS_ALIGNED(start, fs_info->sectorsize) && 5320b246afaSJeff Mahoney IS_ALIGNED(end + 1, fs_info->sectorsize)); 5334277a9c3SJosef Bacik 53417d217feSYan Zheng path = btrfs_alloc_path(); 535d8926bb3SMark Fasheh if (!path) 536d8926bb3SMark Fasheh return -ENOMEM; 53717d217feSYan Zheng 53826ce9114SJosef Bacik path->nowait = nowait; 539a2de733cSArne Jansen if (search_commit) { 540a2de733cSArne Jansen path->skip_locking = 1; 541e4058b54SDavid Sterba path->reada = READA_FORWARD; 542a2de733cSArne Jansen path->search_commit_root = 1; 543a2de733cSArne Jansen } 544a2de733cSArne Jansen 54517d217feSYan Zheng key.objectid = BTRFS_EXTENT_CSUM_OBJECTID; 54617d217feSYan Zheng key.offset = start; 54717d217feSYan Zheng key.type = BTRFS_EXTENT_CSUM_KEY; 54817d217feSYan Zheng 54907d400a6SYan Zheng ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); 55017d217feSYan Zheng if (ret < 0) 55117d217feSYan Zheng goto fail; 55217d217feSYan Zheng if (ret > 0 && path->slots[0] > 0) { 55317d217feSYan Zheng leaf = path->nodes[0]; 55417d217feSYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1); 555cb649e81SQu Wenruo 556cb649e81SQu Wenruo /* 557cb649e81SQu Wenruo * There are two cases we can hit here for the previous csum 558cb649e81SQu Wenruo * item: 559cb649e81SQu Wenruo * 560cb649e81SQu Wenruo * |<- search range ->| 561cb649e81SQu Wenruo * |<- csum item ->| 562cb649e81SQu Wenruo * 563cb649e81SQu Wenruo * Or 564cb649e81SQu Wenruo * |<- search range ->| 565cb649e81SQu Wenruo * |<- csum item ->| 566cb649e81SQu Wenruo * 567cb649e81SQu Wenruo * Check if the previous csum item covers the leading part of 568cb649e81SQu Wenruo * the search range. If so we have to start from previous csum 569cb649e81SQu Wenruo * item. 570cb649e81SQu Wenruo */ 57117d217feSYan Zheng if (key.objectid == BTRFS_EXTENT_CSUM_OBJECTID && 57217d217feSYan Zheng key.type == BTRFS_EXTENT_CSUM_KEY) { 573cb649e81SQu Wenruo if (bytes_to_csum_size(fs_info, start - key.offset) < 5743212fa14SJosef Bacik btrfs_item_size(leaf, path->slots[0] - 1)) 57517d217feSYan Zheng path->slots[0]--; 57617d217feSYan Zheng } 57717d217feSYan Zheng } 57817d217feSYan Zheng 57917d217feSYan Zheng while (start <= end) { 580cb649e81SQu Wenruo u64 csum_end; 581cb649e81SQu Wenruo 58217d217feSYan Zheng leaf = path->nodes[0]; 58317d217feSYan Zheng if (path->slots[0] >= btrfs_header_nritems(leaf)) { 58407d400a6SYan Zheng ret = btrfs_next_leaf(root, path); 58517d217feSYan Zheng if (ret < 0) 58617d217feSYan Zheng goto fail; 58717d217feSYan Zheng if (ret > 0) 58817d217feSYan Zheng break; 58917d217feSYan Zheng leaf = path->nodes[0]; 59017d217feSYan Zheng } 59117d217feSYan Zheng 59217d217feSYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 59317d217feSYan Zheng if (key.objectid != BTRFS_EXTENT_CSUM_OBJECTID || 594628c8282SZhi Yong Wu key.type != BTRFS_EXTENT_CSUM_KEY || 595628c8282SZhi Yong Wu key.offset > end) 59617d217feSYan Zheng break; 59717d217feSYan Zheng 59817d217feSYan Zheng if (key.offset > start) 59917d217feSYan Zheng start = key.offset; 60017d217feSYan Zheng 601cb649e81SQu Wenruo csum_end = key.offset + csum_size_to_bytes(fs_info, 602cb649e81SQu Wenruo btrfs_item_size(leaf, path->slots[0])); 60387b29b20SYan Zheng if (csum_end <= start) { 60487b29b20SYan Zheng path->slots[0]++; 60587b29b20SYan Zheng continue; 60687b29b20SYan Zheng } 60717d217feSYan Zheng 60807d400a6SYan Zheng csum_end = min(csum_end, end + 1); 60907d400a6SYan Zheng item = btrfs_item_ptr(path->nodes[0], path->slots[0], 61007d400a6SYan Zheng struct btrfs_csum_item); 61107d400a6SYan Zheng while (start < csum_end) { 612cb649e81SQu Wenruo unsigned long offset; 613cb649e81SQu Wenruo size_t size; 614cb649e81SQu Wenruo 61507d400a6SYan Zheng size = min_t(size_t, csum_end - start, 616cb649e81SQu Wenruo max_ordered_sum_bytes(fs_info)); 6170b246afaSJeff Mahoney sums = kzalloc(btrfs_ordered_sum_size(fs_info, size), 61807d400a6SYan Zheng GFP_NOFS); 6190678b618SMark Fasheh if (!sums) { 6200678b618SMark Fasheh ret = -ENOMEM; 6210678b618SMark Fasheh goto fail; 6220678b618SMark Fasheh } 62317d217feSYan Zheng 62417d217feSYan Zheng sums->bytenr = start; 625f51a4a18SMiao Xie sums->len = (int)size; 62617d217feSYan Zheng 627cb649e81SQu Wenruo offset = bytes_to_csum_size(fs_info, start - key.offset); 62817d217feSYan Zheng 62907d400a6SYan Zheng read_extent_buffer(path->nodes[0], 630f51a4a18SMiao Xie sums->sums, 631f51a4a18SMiao Xie ((unsigned long)item) + offset, 632cb649e81SQu Wenruo bytes_to_csum_size(fs_info, size)); 63317d217feSYan Zheng 634cb649e81SQu Wenruo start += size; 6350678b618SMark Fasheh list_add_tail(&sums->list, &tmplist); 63607d400a6SYan Zheng } 63717d217feSYan Zheng path->slots[0]++; 63817d217feSYan Zheng } 63917d217feSYan Zheng ret = 0; 64017d217feSYan Zheng fail: 6410678b618SMark Fasheh while (ret < 0 && !list_empty(&tmplist)) { 6426e5aafb2SChris Mason sums = list_entry(tmplist.next, struct btrfs_ordered_sum, list); 6430678b618SMark Fasheh list_del(&sums->list); 6440678b618SMark Fasheh kfree(sums); 6450678b618SMark Fasheh } 6460678b618SMark Fasheh list_splice_tail(&tmplist, list); 6470678b618SMark Fasheh 64817d217feSYan Zheng btrfs_free_path(path); 64917d217feSYan Zheng return ret; 65017d217feSYan Zheng } 65117d217feSYan Zheng 65243dd529aSDavid Sterba /* 65397e38239SQu Wenruo * Do the same work as btrfs_lookup_csums_list(), the difference is in how 65497e38239SQu Wenruo * we return the result. 65597e38239SQu Wenruo * 65697e38239SQu Wenruo * This version will set the corresponding bits in @csum_bitmap to represent 65797e38239SQu Wenruo * that there is a csum found. 65897e38239SQu Wenruo * Each bit represents a sector. Thus caller should ensure @csum_buf passed 65997e38239SQu Wenruo * in is large enough to contain all csums. 66097e38239SQu Wenruo */ 66197e38239SQu Wenruo int btrfs_lookup_csums_bitmap(struct btrfs_root *root, u64 start, u64 end, 66297e38239SQu Wenruo u8 *csum_buf, unsigned long *csum_bitmap) 66397e38239SQu Wenruo { 66497e38239SQu Wenruo struct btrfs_fs_info *fs_info = root->fs_info; 66597e38239SQu Wenruo struct btrfs_key key; 66697e38239SQu Wenruo struct btrfs_path *path; 66797e38239SQu Wenruo struct extent_buffer *leaf; 66897e38239SQu Wenruo struct btrfs_csum_item *item; 66997e38239SQu Wenruo const u64 orig_start = start; 67097e38239SQu Wenruo int ret; 67197e38239SQu Wenruo 67297e38239SQu Wenruo ASSERT(IS_ALIGNED(start, fs_info->sectorsize) && 67397e38239SQu Wenruo IS_ALIGNED(end + 1, fs_info->sectorsize)); 67497e38239SQu Wenruo 67597e38239SQu Wenruo path = btrfs_alloc_path(); 67697e38239SQu Wenruo if (!path) 67797e38239SQu Wenruo return -ENOMEM; 67897e38239SQu Wenruo 67997e38239SQu Wenruo key.objectid = BTRFS_EXTENT_CSUM_OBJECTID; 68097e38239SQu Wenruo key.type = BTRFS_EXTENT_CSUM_KEY; 68197e38239SQu Wenruo key.offset = start; 68297e38239SQu Wenruo 68397e38239SQu Wenruo ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); 68497e38239SQu Wenruo if (ret < 0) 68597e38239SQu Wenruo goto fail; 68697e38239SQu Wenruo if (ret > 0 && path->slots[0] > 0) { 68797e38239SQu Wenruo leaf = path->nodes[0]; 68897e38239SQu Wenruo btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1); 68997e38239SQu Wenruo 69097e38239SQu Wenruo /* 69197e38239SQu Wenruo * There are two cases we can hit here for the previous csum 69297e38239SQu Wenruo * item: 69397e38239SQu Wenruo * 69497e38239SQu Wenruo * |<- search range ->| 69597e38239SQu Wenruo * |<- csum item ->| 69697e38239SQu Wenruo * 69797e38239SQu Wenruo * Or 69897e38239SQu Wenruo * |<- search range ->| 69997e38239SQu Wenruo * |<- csum item ->| 70097e38239SQu Wenruo * 70197e38239SQu Wenruo * Check if the previous csum item covers the leading part of 70297e38239SQu Wenruo * the search range. If so we have to start from previous csum 70397e38239SQu Wenruo * item. 70497e38239SQu Wenruo */ 70597e38239SQu Wenruo if (key.objectid == BTRFS_EXTENT_CSUM_OBJECTID && 70697e38239SQu Wenruo key.type == BTRFS_EXTENT_CSUM_KEY) { 70797e38239SQu Wenruo if (bytes_to_csum_size(fs_info, start - key.offset) < 70897e38239SQu Wenruo btrfs_item_size(leaf, path->slots[0] - 1)) 70997e38239SQu Wenruo path->slots[0]--; 71097e38239SQu Wenruo } 71197e38239SQu Wenruo } 71297e38239SQu Wenruo 71397e38239SQu Wenruo while (start <= end) { 71497e38239SQu Wenruo u64 csum_end; 71597e38239SQu Wenruo 71697e38239SQu Wenruo leaf = path->nodes[0]; 71797e38239SQu Wenruo if (path->slots[0] >= btrfs_header_nritems(leaf)) { 71897e38239SQu Wenruo ret = btrfs_next_leaf(root, path); 71997e38239SQu Wenruo if (ret < 0) 72097e38239SQu Wenruo goto fail; 72197e38239SQu Wenruo if (ret > 0) 72297e38239SQu Wenruo break; 72397e38239SQu Wenruo leaf = path->nodes[0]; 72497e38239SQu Wenruo } 72597e38239SQu Wenruo 72697e38239SQu Wenruo btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 72797e38239SQu Wenruo if (key.objectid != BTRFS_EXTENT_CSUM_OBJECTID || 72897e38239SQu Wenruo key.type != BTRFS_EXTENT_CSUM_KEY || 72997e38239SQu Wenruo key.offset > end) 73097e38239SQu Wenruo break; 73197e38239SQu Wenruo 73297e38239SQu Wenruo if (key.offset > start) 73397e38239SQu Wenruo start = key.offset; 73497e38239SQu Wenruo 73597e38239SQu Wenruo csum_end = key.offset + csum_size_to_bytes(fs_info, 73697e38239SQu Wenruo btrfs_item_size(leaf, path->slots[0])); 73797e38239SQu Wenruo if (csum_end <= start) { 73897e38239SQu Wenruo path->slots[0]++; 73997e38239SQu Wenruo continue; 74097e38239SQu Wenruo } 74197e38239SQu Wenruo 74297e38239SQu Wenruo csum_end = min(csum_end, end + 1); 74397e38239SQu Wenruo item = btrfs_item_ptr(path->nodes[0], path->slots[0], 74497e38239SQu Wenruo struct btrfs_csum_item); 74597e38239SQu Wenruo while (start < csum_end) { 74697e38239SQu Wenruo unsigned long offset; 74797e38239SQu Wenruo size_t size; 74897e38239SQu Wenruo u8 *csum_dest = csum_buf + bytes_to_csum_size(fs_info, 74997e38239SQu Wenruo start - orig_start); 75097e38239SQu Wenruo 75197e38239SQu Wenruo size = min_t(size_t, csum_end - start, end + 1 - start); 75297e38239SQu Wenruo 75397e38239SQu Wenruo offset = bytes_to_csum_size(fs_info, start - key.offset); 75497e38239SQu Wenruo 75597e38239SQu Wenruo read_extent_buffer(path->nodes[0], csum_dest, 75697e38239SQu Wenruo ((unsigned long)item) + offset, 75797e38239SQu Wenruo bytes_to_csum_size(fs_info, size)); 75897e38239SQu Wenruo 75997e38239SQu Wenruo bitmap_set(csum_bitmap, 76097e38239SQu Wenruo (start - orig_start) >> fs_info->sectorsize_bits, 76197e38239SQu Wenruo size >> fs_info->sectorsize_bits); 76297e38239SQu Wenruo 76397e38239SQu Wenruo start += size; 76497e38239SQu Wenruo } 76597e38239SQu Wenruo path->slots[0]++; 76697e38239SQu Wenruo } 76797e38239SQu Wenruo ret = 0; 76897e38239SQu Wenruo fail: 76997e38239SQu Wenruo btrfs_free_path(path); 77097e38239SQu Wenruo return ret; 77197e38239SQu Wenruo } 77297e38239SQu Wenruo 77397e38239SQu Wenruo /* 77443dd529aSDavid Sterba * Calculate checksums of the data contained inside a bio. 775e331f6b1SOmar Sandoval * 77651d470aeSNikolay Borisov * @inode: Owner of the data inside the bio 77751d470aeSNikolay Borisov * @bio: Contains the data to be checksummed 778e331f6b1SOmar Sandoval * @offset: If (u64)-1, @bio may contain discontiguous bio vecs, so the 779e331f6b1SOmar Sandoval * file offsets are determined from the page offsets in the bio. 780e331f6b1SOmar Sandoval * Otherwise, this is the starting file offset of the bio vecs in 781e331f6b1SOmar Sandoval * @bio, which must be contiguous. 782e331f6b1SOmar Sandoval * @one_ordered: If true, @bio only refers to one ordered extent. 78351d470aeSNikolay Borisov */ 784bd242a08SNikolay Borisov blk_status_t btrfs_csum_one_bio(struct btrfs_inode *inode, struct bio *bio, 785e331f6b1SOmar Sandoval u64 offset, bool one_ordered) 786e015640fSChris Mason { 787c3504372SNikolay Borisov struct btrfs_fs_info *fs_info = inode->root->fs_info; 788d5178578SJohannes Thumshirn SHASH_DESC_ON_STACK(shash, fs_info->csum_shash); 789e6dcd2dcSChris Mason struct btrfs_ordered_sum *sums; 7906cd7ce49SChristoph Hellwig struct btrfs_ordered_extent *ordered = NULL; 791e331f6b1SOmar Sandoval const bool use_page_offsets = (offset == (u64)-1); 792e015640fSChris Mason char *data; 79317347cecSLiu Bo struct bvec_iter iter; 79417347cecSLiu Bo struct bio_vec bvec; 795f51a4a18SMiao Xie int index; 796e331f6b1SOmar Sandoval unsigned int blockcount; 7973edf7d33SChris Mason unsigned long total_bytes = 0; 7983edf7d33SChris Mason unsigned long this_sum_bytes = 0; 79917347cecSLiu Bo int i; 800a3d46aeaSNikolay Borisov unsigned nofs_flag; 801e015640fSChris Mason 802a3d46aeaSNikolay Borisov nofs_flag = memalloc_nofs_save(); 803a3d46aeaSNikolay Borisov sums = kvzalloc(btrfs_ordered_sum_size(fs_info, bio->bi_iter.bi_size), 804a3d46aeaSNikolay Borisov GFP_KERNEL); 805a3d46aeaSNikolay Borisov memalloc_nofs_restore(nofs_flag); 806a3d46aeaSNikolay Borisov 807e015640fSChris Mason if (!sums) 8084e4cbee9SChristoph Hellwig return BLK_STS_RESOURCE; 8093edf7d33SChris Mason 8104f024f37SKent Overstreet sums->len = bio->bi_iter.bi_size; 811e6dcd2dcSChris Mason INIT_LIST_HEAD(&sums->list); 812d20f7043SChris Mason 8131201b58bSDavid Sterba sums->bytenr = bio->bi_iter.bi_sector << 9; 814f51a4a18SMiao Xie index = 0; 815e015640fSChris Mason 816d5178578SJohannes Thumshirn shash->tfm = fs_info->csum_shash; 817d5178578SJohannes Thumshirn 81817347cecSLiu Bo bio_for_each_segment(bvec, bio, iter) { 819e331f6b1SOmar Sandoval if (use_page_offsets) 82017347cecSLiu Bo offset = page_offset(bvec.bv_page) + bvec.bv_offset; 821d20f7043SChris Mason 8226cd7ce49SChristoph Hellwig if (!ordered) { 8236cd7ce49SChristoph Hellwig ordered = btrfs_lookup_ordered_extent(inode, offset); 824bbc9a6ebSQu Wenruo /* 825bbc9a6ebSQu Wenruo * The bio range is not covered by any ordered extent, 826bbc9a6ebSQu Wenruo * must be a code logic error. 827bbc9a6ebSQu Wenruo */ 828bbc9a6ebSQu Wenruo if (unlikely(!ordered)) { 829bbc9a6ebSQu Wenruo WARN(1, KERN_WARNING 830bbc9a6ebSQu Wenruo "no ordered extent for root %llu ino %llu offset %llu\n", 831bbc9a6ebSQu Wenruo inode->root->root_key.objectid, 832bbc9a6ebSQu Wenruo btrfs_ino(inode), offset); 833bbc9a6ebSQu Wenruo kvfree(sums); 834bbc9a6ebSQu Wenruo return BLK_STS_IOERR; 835bbc9a6ebSQu Wenruo } 8366cd7ce49SChristoph Hellwig } 8376cd7ce49SChristoph Hellwig 838e331f6b1SOmar Sandoval blockcount = BTRFS_BYTES_TO_BLKS(fs_info, 83917347cecSLiu Bo bvec.bv_len + fs_info->sectorsize 840c40a3d38SChandan Rajendra - 1); 841c40a3d38SChandan Rajendra 842e331f6b1SOmar Sandoval for (i = 0; i < blockcount; i++) { 843e331f6b1SOmar Sandoval if (!one_ordered && 844e331f6b1SOmar Sandoval !in_range(offset, ordered->file_offset, 845e331f6b1SOmar Sandoval ordered->num_bytes)) { 8463edf7d33SChris Mason unsigned long bytes_left; 847c40a3d38SChandan Rajendra 8483edf7d33SChris Mason sums->len = this_sum_bytes; 8493edf7d33SChris Mason this_sum_bytes = 0; 850f9756261SNikolay Borisov btrfs_add_ordered_sum(ordered, sums); 8513edf7d33SChris Mason btrfs_put_ordered_extent(ordered); 8523edf7d33SChris Mason 8534f024f37SKent Overstreet bytes_left = bio->bi_iter.bi_size - total_bytes; 8543edf7d33SChris Mason 855a3d46aeaSNikolay Borisov nofs_flag = memalloc_nofs_save(); 856a3d46aeaSNikolay Borisov sums = kvzalloc(btrfs_ordered_sum_size(fs_info, 857a3d46aeaSNikolay Borisov bytes_left), GFP_KERNEL); 858a3d46aeaSNikolay Borisov memalloc_nofs_restore(nofs_flag); 85979787eaaSJeff Mahoney BUG_ON(!sums); /* -ENOMEM */ 8603edf7d33SChris Mason sums->len = bytes_left; 861c40a3d38SChandan Rajendra ordered = btrfs_lookup_ordered_extent(inode, 862c40a3d38SChandan Rajendra offset); 863c40a3d38SChandan Rajendra ASSERT(ordered); /* Logic error */ 8641201b58bSDavid Sterba sums->bytenr = (bio->bi_iter.bi_sector << 9) 865c40a3d38SChandan Rajendra + total_bytes; 866f51a4a18SMiao Xie index = 0; 867c40a3d38SChandan Rajendra } 868c40a3d38SChandan Rajendra 8693dcfbcceSChristoph Hellwig data = bvec_kmap_local(&bvec); 8703dcfbcceSChristoph Hellwig crypto_shash_digest(shash, 8713dcfbcceSChristoph Hellwig data + (i * fs_info->sectorsize), 872fd08001fSEric Biggers fs_info->sectorsize, 873fd08001fSEric Biggers sums->sums + index); 8743dcfbcceSChristoph Hellwig kunmap_local(data); 875713cebfbSDavid Sterba index += fs_info->csum_size; 8760b246afaSJeff Mahoney offset += fs_info->sectorsize; 8770b246afaSJeff Mahoney this_sum_bytes += fs_info->sectorsize; 8780b246afaSJeff Mahoney total_bytes += fs_info->sectorsize; 879c40a3d38SChandan Rajendra } 880c40a3d38SChandan Rajendra 881e015640fSChris Mason } 882ed98b56aSChris Mason this_sum_bytes = 0; 883f9756261SNikolay Borisov btrfs_add_ordered_sum(ordered, sums); 8843edf7d33SChris Mason btrfs_put_ordered_extent(ordered); 885e015640fSChris Mason return 0; 886e015640fSChris Mason } 887e015640fSChris Mason 888459931ecSChris Mason /* 88943dd529aSDavid Sterba * Remove one checksum overlapping a range. 890459931ecSChris Mason * 89143dd529aSDavid Sterba * This expects the key to describe the csum pointed to by the path, and it 89243dd529aSDavid Sterba * expects the csum to overlap the range [bytenr, len] 893459931ecSChris Mason * 89443dd529aSDavid Sterba * The csum should not be entirely contained in the range and the range should 89543dd529aSDavid Sterba * not be entirely contained in the csum. 89643dd529aSDavid Sterba * 89743dd529aSDavid Sterba * This calls btrfs_truncate_item with the correct args based on the overlap, 89843dd529aSDavid Sterba * and fixes up the key as required. 899459931ecSChris Mason */ 9002ff7e61eSJeff Mahoney static noinline void truncate_one_csum(struct btrfs_fs_info *fs_info, 901459931ecSChris Mason struct btrfs_path *path, 902459931ecSChris Mason struct btrfs_key *key, 903459931ecSChris Mason u64 bytenr, u64 len) 904459931ecSChris Mason { 905459931ecSChris Mason struct extent_buffer *leaf; 906223486c2SDavid Sterba const u32 csum_size = fs_info->csum_size; 907459931ecSChris Mason u64 csum_end; 908459931ecSChris Mason u64 end_byte = bytenr + len; 909265fdfa6SDavid Sterba u32 blocksize_bits = fs_info->sectorsize_bits; 910459931ecSChris Mason 911459931ecSChris Mason leaf = path->nodes[0]; 9123212fa14SJosef Bacik csum_end = btrfs_item_size(leaf, path->slots[0]) / csum_size; 913265fdfa6SDavid Sterba csum_end <<= blocksize_bits; 914459931ecSChris Mason csum_end += key->offset; 915459931ecSChris Mason 916459931ecSChris Mason if (key->offset < bytenr && csum_end <= end_byte) { 917459931ecSChris Mason /* 918459931ecSChris Mason * [ bytenr - len ] 919459931ecSChris Mason * [ ] 920459931ecSChris Mason * [csum ] 921459931ecSChris Mason * A simple truncate off the end of the item 922459931ecSChris Mason */ 923459931ecSChris Mason u32 new_size = (bytenr - key->offset) >> blocksize_bits; 924459931ecSChris Mason new_size *= csum_size; 92578ac4f9eSDavid Sterba btrfs_truncate_item(path, new_size, 1); 926459931ecSChris Mason } else if (key->offset >= bytenr && csum_end > end_byte && 927459931ecSChris Mason end_byte > key->offset) { 928459931ecSChris Mason /* 929459931ecSChris Mason * [ bytenr - len ] 930459931ecSChris Mason * [ ] 931459931ecSChris Mason * [csum ] 932459931ecSChris Mason * we need to truncate from the beginning of the csum 933459931ecSChris Mason */ 934459931ecSChris Mason u32 new_size = (csum_end - end_byte) >> blocksize_bits; 935459931ecSChris Mason new_size *= csum_size; 936459931ecSChris Mason 93778ac4f9eSDavid Sterba btrfs_truncate_item(path, new_size, 0); 938459931ecSChris Mason 939459931ecSChris Mason key->offset = end_byte; 9400b246afaSJeff Mahoney btrfs_set_item_key_safe(fs_info, path, key); 941459931ecSChris Mason } else { 942459931ecSChris Mason BUG(); 943459931ecSChris Mason } 944459931ecSChris Mason } 945459931ecSChris Mason 946459931ecSChris Mason /* 94743dd529aSDavid Sterba * Delete the csum items from the csum tree for a given range of bytes. 948459931ecSChris Mason */ 949459931ecSChris Mason int btrfs_del_csums(struct btrfs_trans_handle *trans, 95040e046acSFilipe Manana struct btrfs_root *root, u64 bytenr, u64 len) 951459931ecSChris Mason { 95240e046acSFilipe Manana struct btrfs_fs_info *fs_info = trans->fs_info; 953459931ecSChris Mason struct btrfs_path *path; 954459931ecSChris Mason struct btrfs_key key; 955459931ecSChris Mason u64 end_byte = bytenr + len; 956459931ecSChris Mason u64 csum_end; 957459931ecSChris Mason struct extent_buffer *leaf; 958b86652beSJosef Bacik int ret = 0; 959223486c2SDavid Sterba const u32 csum_size = fs_info->csum_size; 960265fdfa6SDavid Sterba u32 blocksize_bits = fs_info->sectorsize_bits; 961459931ecSChris Mason 96284d2d6c7SJosef Bacik ASSERT(root->root_key.objectid == BTRFS_CSUM_TREE_OBJECTID || 96340e046acSFilipe Manana root->root_key.objectid == BTRFS_TREE_LOG_OBJECTID); 96440e046acSFilipe Manana 965459931ecSChris Mason path = btrfs_alloc_path(); 9662a29edc6Sliubo if (!path) 9672a29edc6Sliubo return -ENOMEM; 968459931ecSChris Mason 969459931ecSChris Mason while (1) { 970459931ecSChris Mason key.objectid = BTRFS_EXTENT_CSUM_OBJECTID; 971459931ecSChris Mason key.offset = end_byte - 1; 972459931ecSChris Mason key.type = BTRFS_EXTENT_CSUM_KEY; 973459931ecSChris Mason 974459931ecSChris Mason ret = btrfs_search_slot(trans, root, &key, path, -1, 1); 975459931ecSChris Mason if (ret > 0) { 976b86652beSJosef Bacik ret = 0; 977459931ecSChris Mason if (path->slots[0] == 0) 97865a246c5STsutomu Itoh break; 979459931ecSChris Mason path->slots[0]--; 980ad0397a7SJosef Bacik } else if (ret < 0) { 98165a246c5STsutomu Itoh break; 982459931ecSChris Mason } 983ad0397a7SJosef Bacik 984459931ecSChris Mason leaf = path->nodes[0]; 985459931ecSChris Mason btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 986459931ecSChris Mason 987459931ecSChris Mason if (key.objectid != BTRFS_EXTENT_CSUM_OBJECTID || 988459931ecSChris Mason key.type != BTRFS_EXTENT_CSUM_KEY) { 989459931ecSChris Mason break; 990459931ecSChris Mason } 991459931ecSChris Mason 992459931ecSChris Mason if (key.offset >= end_byte) 993459931ecSChris Mason break; 994459931ecSChris Mason 9953212fa14SJosef Bacik csum_end = btrfs_item_size(leaf, path->slots[0]) / csum_size; 996459931ecSChris Mason csum_end <<= blocksize_bits; 997459931ecSChris Mason csum_end += key.offset; 998459931ecSChris Mason 999459931ecSChris Mason /* this csum ends before we start, we're done */ 1000459931ecSChris Mason if (csum_end <= bytenr) 1001459931ecSChris Mason break; 1002459931ecSChris Mason 1003459931ecSChris Mason /* delete the entire item, it is inside our range */ 1004459931ecSChris Mason if (key.offset >= bytenr && csum_end <= end_byte) { 10056f546216SFilipe Manana int del_nr = 1; 10066f546216SFilipe Manana 10076f546216SFilipe Manana /* 10086f546216SFilipe Manana * Check how many csum items preceding this one in this 10096f546216SFilipe Manana * leaf correspond to our range and then delete them all 10106f546216SFilipe Manana * at once. 10116f546216SFilipe Manana */ 10126f546216SFilipe Manana if (key.offset > bytenr && path->slots[0] > 0) { 10136f546216SFilipe Manana int slot = path->slots[0] - 1; 10146f546216SFilipe Manana 10156f546216SFilipe Manana while (slot >= 0) { 10166f546216SFilipe Manana struct btrfs_key pk; 10176f546216SFilipe Manana 10186f546216SFilipe Manana btrfs_item_key_to_cpu(leaf, &pk, slot); 10196f546216SFilipe Manana if (pk.offset < bytenr || 10206f546216SFilipe Manana pk.type != BTRFS_EXTENT_CSUM_KEY || 10216f546216SFilipe Manana pk.objectid != 10226f546216SFilipe Manana BTRFS_EXTENT_CSUM_OBJECTID) 10236f546216SFilipe Manana break; 10246f546216SFilipe Manana path->slots[0] = slot; 10256f546216SFilipe Manana del_nr++; 10266f546216SFilipe Manana key.offset = pk.offset; 10276f546216SFilipe Manana slot--; 10286f546216SFilipe Manana } 10296f546216SFilipe Manana } 10306f546216SFilipe Manana ret = btrfs_del_items(trans, root, path, 10316f546216SFilipe Manana path->slots[0], del_nr); 103265a246c5STsutomu Itoh if (ret) 1033b86652beSJosef Bacik break; 1034dcbdd4dcSChris Mason if (key.offset == bytenr) 1035dcbdd4dcSChris Mason break; 1036459931ecSChris Mason } else if (key.offset < bytenr && csum_end > end_byte) { 1037459931ecSChris Mason unsigned long offset; 1038459931ecSChris Mason unsigned long shift_len; 1039459931ecSChris Mason unsigned long item_offset; 1040459931ecSChris Mason /* 1041459931ecSChris Mason * [ bytenr - len ] 1042459931ecSChris Mason * [csum ] 1043459931ecSChris Mason * 1044459931ecSChris Mason * Our bytes are in the middle of the csum, 1045459931ecSChris Mason * we need to split this item and insert a new one. 1046459931ecSChris Mason * 1047459931ecSChris Mason * But we can't drop the path because the 1048459931ecSChris Mason * csum could change, get removed, extended etc. 1049459931ecSChris Mason * 1050459931ecSChris Mason * The trick here is the max size of a csum item leaves 1051459931ecSChris Mason * enough room in the tree block for a single 1052459931ecSChris Mason * item header. So, we split the item in place, 1053459931ecSChris Mason * adding a new header pointing to the existing 1054459931ecSChris Mason * bytes. Then we loop around again and we have 1055459931ecSChris Mason * a nicely formed csum item that we can neatly 1056459931ecSChris Mason * truncate. 1057459931ecSChris Mason */ 1058459931ecSChris Mason offset = (bytenr - key.offset) >> blocksize_bits; 1059459931ecSChris Mason offset *= csum_size; 1060459931ecSChris Mason 1061459931ecSChris Mason shift_len = (len >> blocksize_bits) * csum_size; 1062459931ecSChris Mason 1063459931ecSChris Mason item_offset = btrfs_item_ptr_offset(leaf, 1064459931ecSChris Mason path->slots[0]); 1065459931ecSChris Mason 1066b159fa28SDavid Sterba memzero_extent_buffer(leaf, item_offset + offset, 1067459931ecSChris Mason shift_len); 1068459931ecSChris Mason key.offset = bytenr; 1069459931ecSChris Mason 1070459931ecSChris Mason /* 1071459931ecSChris Mason * btrfs_split_item returns -EAGAIN when the 1072459931ecSChris Mason * item changed size or key 1073459931ecSChris Mason */ 1074459931ecSChris Mason ret = btrfs_split_item(trans, root, path, &key, offset); 107579787eaaSJeff Mahoney if (ret && ret != -EAGAIN) { 107666642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 1077b86652beSJosef Bacik break; 107879787eaaSJeff Mahoney } 1079b86652beSJosef Bacik ret = 0; 1080459931ecSChris Mason 1081459931ecSChris Mason key.offset = end_byte - 1; 1082459931ecSChris Mason } else { 10832ff7e61eSJeff Mahoney truncate_one_csum(fs_info, path, &key, bytenr, len); 1084dcbdd4dcSChris Mason if (key.offset < bytenr) 1085dcbdd4dcSChris Mason break; 1086459931ecSChris Mason } 1087b3b4aa74SDavid Sterba btrfs_release_path(path); 1088459931ecSChris Mason } 1089459931ecSChris Mason btrfs_free_path(path); 109065a246c5STsutomu Itoh return ret; 1091459931ecSChris Mason } 1092459931ecSChris Mason 1093ea7036deSFilipe Manana static int find_next_csum_offset(struct btrfs_root *root, 1094ea7036deSFilipe Manana struct btrfs_path *path, 1095ea7036deSFilipe Manana u64 *next_offset) 1096ea7036deSFilipe Manana { 1097ea7036deSFilipe Manana const u32 nritems = btrfs_header_nritems(path->nodes[0]); 1098ea7036deSFilipe Manana struct btrfs_key found_key; 1099ea7036deSFilipe Manana int slot = path->slots[0] + 1; 1100ea7036deSFilipe Manana int ret; 1101ea7036deSFilipe Manana 1102ea7036deSFilipe Manana if (nritems == 0 || slot >= nritems) { 1103ea7036deSFilipe Manana ret = btrfs_next_leaf(root, path); 1104ea7036deSFilipe Manana if (ret < 0) { 1105ea7036deSFilipe Manana return ret; 1106ea7036deSFilipe Manana } else if (ret > 0) { 1107ea7036deSFilipe Manana *next_offset = (u64)-1; 1108ea7036deSFilipe Manana return 0; 1109ea7036deSFilipe Manana } 1110ea7036deSFilipe Manana slot = path->slots[0]; 1111ea7036deSFilipe Manana } 1112ea7036deSFilipe Manana 1113ea7036deSFilipe Manana btrfs_item_key_to_cpu(path->nodes[0], &found_key, slot); 1114ea7036deSFilipe Manana 1115ea7036deSFilipe Manana if (found_key.objectid != BTRFS_EXTENT_CSUM_OBJECTID || 1116ea7036deSFilipe Manana found_key.type != BTRFS_EXTENT_CSUM_KEY) 1117ea7036deSFilipe Manana *next_offset = (u64)-1; 1118ea7036deSFilipe Manana else 1119ea7036deSFilipe Manana *next_offset = found_key.offset; 1120ea7036deSFilipe Manana 1121ea7036deSFilipe Manana return 0; 1122ea7036deSFilipe Manana } 1123ea7036deSFilipe Manana 1124065631f6SChris Mason int btrfs_csum_file_blocks(struct btrfs_trans_handle *trans, 1125d20f7043SChris Mason struct btrfs_root *root, 1126e6dcd2dcSChris Mason struct btrfs_ordered_sum *sums) 1127f254e52cSChris Mason { 11280b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 1129f254e52cSChris Mason struct btrfs_key file_key; 11306567e837SChris Mason struct btrfs_key found_key; 11315caf2a00SChris Mason struct btrfs_path *path; 1132f254e52cSChris Mason struct btrfs_csum_item *item; 1133065631f6SChris Mason struct btrfs_csum_item *item_end; 1134ff79f819SChris Mason struct extent_buffer *leaf = NULL; 1135f51a4a18SMiao Xie u64 next_offset; 1136f51a4a18SMiao Xie u64 total_bytes = 0; 11376567e837SChris Mason u64 csum_offset; 1138f51a4a18SMiao Xie u64 bytenr; 1139f578d4bdSChris Mason u32 ins_size; 1140f51a4a18SMiao Xie int index = 0; 1141f51a4a18SMiao Xie int found_next; 1142f51a4a18SMiao Xie int ret; 1143223486c2SDavid Sterba const u32 csum_size = fs_info->csum_size; 11446e92f5e6SChris Mason 11455caf2a00SChris Mason path = btrfs_alloc_path(); 1146d8926bb3SMark Fasheh if (!path) 1147d8926bb3SMark Fasheh return -ENOMEM; 1148065631f6SChris Mason again: 1149065631f6SChris Mason next_offset = (u64)-1; 1150065631f6SChris Mason found_next = 0; 1151f51a4a18SMiao Xie bytenr = sums->bytenr + total_bytes; 1152d20f7043SChris Mason file_key.objectid = BTRFS_EXTENT_CSUM_OBJECTID; 1153f51a4a18SMiao Xie file_key.offset = bytenr; 1154962a298fSDavid Sterba file_key.type = BTRFS_EXTENT_CSUM_KEY; 1155a429e513SChris Mason 1156f51a4a18SMiao Xie item = btrfs_lookup_csum(trans, root, path, bytenr, 1); 1157ff79f819SChris Mason if (!IS_ERR(item)) { 1158639cb586SChris Mason ret = 0; 1159f51a4a18SMiao Xie leaf = path->nodes[0]; 1160f51a4a18SMiao Xie item_end = btrfs_item_ptr(leaf, path->slots[0], 1161f51a4a18SMiao Xie struct btrfs_csum_item); 1162f51a4a18SMiao Xie item_end = (struct btrfs_csum_item *)((char *)item_end + 11633212fa14SJosef Bacik btrfs_item_size(leaf, path->slots[0])); 1164a429e513SChris Mason goto found; 1165ff79f819SChris Mason } 1166a429e513SChris Mason ret = PTR_ERR(item); 11674a500fd1SYan, Zheng if (ret != -EFBIG && ret != -ENOENT) 1168918cdf44SFilipe Manana goto out; 11694a500fd1SYan, Zheng 1170a429e513SChris Mason if (ret == -EFBIG) { 1171a429e513SChris Mason u32 item_size; 1172a429e513SChris Mason /* we found one, but it isn't big enough yet */ 11735f39d397SChris Mason leaf = path->nodes[0]; 11743212fa14SJosef Bacik item_size = btrfs_item_size(leaf, path->slots[0]); 1175607d432dSJosef Bacik if ((item_size / csum_size) >= 11760b246afaSJeff Mahoney MAX_CSUM_ITEMS(fs_info, csum_size)) { 1177a429e513SChris Mason /* already at max size, make a new one */ 1178a429e513SChris Mason goto insert; 1179a429e513SChris Mason } 1180a429e513SChris Mason } else { 1181ea7036deSFilipe Manana /* We didn't find a csum item, insert one. */ 1182ea7036deSFilipe Manana ret = find_next_csum_offset(root, path, &next_offset); 1183ea7036deSFilipe Manana if (ret < 0) 11847e4a3f7eSFilipe Manana goto out; 1185f578d4bdSChris Mason found_next = 1; 1186a429e513SChris Mason goto insert; 1187a429e513SChris Mason } 1188a429e513SChris Mason 1189a429e513SChris Mason /* 1190cc14600cSFilipe Manana * At this point, we know the tree has a checksum item that ends at an 1191cc14600cSFilipe Manana * offset matching the start of the checksum range we want to insert. 1192cc14600cSFilipe Manana * We try to extend that item as much as possible and then add as many 1193cc14600cSFilipe Manana * checksums to it as they fit. 1194cc14600cSFilipe Manana * 1195cc14600cSFilipe Manana * First check if the leaf has enough free space for at least one 1196cc14600cSFilipe Manana * checksum. If it has go directly to the item extension code, otherwise 1197cc14600cSFilipe Manana * release the path and do a search for insertion before the extension. 1198a429e513SChris Mason */ 1199cc14600cSFilipe Manana if (btrfs_leaf_free_space(leaf) >= csum_size) { 1200cc14600cSFilipe Manana btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); 1201cc14600cSFilipe Manana csum_offset = (bytenr - found_key.offset) >> 1202265fdfa6SDavid Sterba fs_info->sectorsize_bits; 1203cc14600cSFilipe Manana goto extend_csum; 1204cc14600cSFilipe Manana } 1205cc14600cSFilipe Manana 1206b3b4aa74SDavid Sterba btrfs_release_path(path); 12079a664971Sethanwu path->search_for_extension = 1; 12086567e837SChris Mason ret = btrfs_search_slot(trans, root, &file_key, path, 1209607d432dSJosef Bacik csum_size, 1); 12109a664971Sethanwu path->search_for_extension = 0; 12116567e837SChris Mason if (ret < 0) 1212918cdf44SFilipe Manana goto out; 1213459931ecSChris Mason 1214459931ecSChris Mason if (ret > 0) { 1215459931ecSChris Mason if (path->slots[0] == 0) 12166567e837SChris Mason goto insert; 12176567e837SChris Mason path->slots[0]--; 1218459931ecSChris Mason } 1219459931ecSChris Mason 12205f39d397SChris Mason leaf = path->nodes[0]; 12215f39d397SChris Mason btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); 1222265fdfa6SDavid Sterba csum_offset = (bytenr - found_key.offset) >> fs_info->sectorsize_bits; 1223459931ecSChris Mason 1224962a298fSDavid Sterba if (found_key.type != BTRFS_EXTENT_CSUM_KEY || 1225d20f7043SChris Mason found_key.objectid != BTRFS_EXTENT_CSUM_OBJECTID || 12260b246afaSJeff Mahoney csum_offset >= MAX_CSUM_ITEMS(fs_info, csum_size)) { 12276567e837SChris Mason goto insert; 12286567e837SChris Mason } 1229459931ecSChris Mason 1230cc14600cSFilipe Manana extend_csum: 12313212fa14SJosef Bacik if (csum_offset == btrfs_item_size(leaf, path->slots[0]) / 1232607d432dSJosef Bacik csum_size) { 12332f697dc6SLiu Bo int extend_nr; 12342f697dc6SLiu Bo u64 tmp; 12352f697dc6SLiu Bo u32 diff; 1236459931ecSChris Mason 1237f51a4a18SMiao Xie tmp = sums->len - total_bytes; 1238265fdfa6SDavid Sterba tmp >>= fs_info->sectorsize_bits; 12392f697dc6SLiu Bo WARN_ON(tmp < 1); 1240ea7036deSFilipe Manana extend_nr = max_t(int, 1, tmp); 12412f697dc6SLiu Bo 1242ea7036deSFilipe Manana /* 1243ea7036deSFilipe Manana * A log tree can already have checksum items with a subset of 1244ea7036deSFilipe Manana * the checksums we are trying to log. This can happen after 1245ea7036deSFilipe Manana * doing a sequence of partial writes into prealloc extents and 1246ea7036deSFilipe Manana * fsyncs in between, with a full fsync logging a larger subrange 1247ea7036deSFilipe Manana * of an extent for which a previous fast fsync logged a smaller 1248ea7036deSFilipe Manana * subrange. And this happens in particular due to merging file 1249ea7036deSFilipe Manana * extent items when we complete an ordered extent for a range 1250ea7036deSFilipe Manana * covered by a prealloc extent - this is done at 1251ea7036deSFilipe Manana * btrfs_mark_extent_written(). 1252ea7036deSFilipe Manana * 1253ea7036deSFilipe Manana * So if we try to extend the previous checksum item, which has 1254ea7036deSFilipe Manana * a range that ends at the start of the range we want to insert, 1255ea7036deSFilipe Manana * make sure we don't extend beyond the start offset of the next 1256ea7036deSFilipe Manana * checksum item. If we are at the last item in the leaf, then 1257ea7036deSFilipe Manana * forget the optimization of extending and add a new checksum 1258ea7036deSFilipe Manana * item - it is not worth the complexity of releasing the path, 1259ea7036deSFilipe Manana * getting the first key for the next leaf, repeat the btree 1260ea7036deSFilipe Manana * search, etc, because log trees are temporary anyway and it 1261ea7036deSFilipe Manana * would only save a few bytes of leaf space. 1262ea7036deSFilipe Manana */ 1263ea7036deSFilipe Manana if (root->root_key.objectid == BTRFS_TREE_LOG_OBJECTID) { 1264ea7036deSFilipe Manana if (path->slots[0] + 1 >= 1265ea7036deSFilipe Manana btrfs_header_nritems(path->nodes[0])) { 1266ea7036deSFilipe Manana ret = find_next_csum_offset(root, path, &next_offset); 1267ea7036deSFilipe Manana if (ret < 0) 1268ea7036deSFilipe Manana goto out; 1269ea7036deSFilipe Manana found_next = 1; 1270ea7036deSFilipe Manana goto insert; 1271ea7036deSFilipe Manana } 1272ea7036deSFilipe Manana 1273ea7036deSFilipe Manana ret = find_next_csum_offset(root, path, &next_offset); 1274ea7036deSFilipe Manana if (ret < 0) 1275ea7036deSFilipe Manana goto out; 1276ea7036deSFilipe Manana 1277ea7036deSFilipe Manana tmp = (next_offset - bytenr) >> fs_info->sectorsize_bits; 1278ea7036deSFilipe Manana if (tmp <= INT_MAX) 1279ea7036deSFilipe Manana extend_nr = min_t(int, extend_nr, tmp); 1280ea7036deSFilipe Manana } 1281ea7036deSFilipe Manana 12822f697dc6SLiu Bo diff = (csum_offset + extend_nr) * csum_size; 12830b246afaSJeff Mahoney diff = min(diff, 12840b246afaSJeff Mahoney MAX_CSUM_ITEMS(fs_info, csum_size) * csum_size); 1285459931ecSChris Mason 12863212fa14SJosef Bacik diff = diff - btrfs_item_size(leaf, path->slots[0]); 1287cc14600cSFilipe Manana diff = min_t(u32, btrfs_leaf_free_space(leaf), diff); 12882f697dc6SLiu Bo diff /= csum_size; 12892f697dc6SLiu Bo diff *= csum_size; 1290459931ecSChris Mason 1291c71dd880SDavid Sterba btrfs_extend_item(path, diff); 1292f51a4a18SMiao Xie ret = 0; 12936567e837SChris Mason goto csum; 12946567e837SChris Mason } 12956567e837SChris Mason 12966567e837SChris Mason insert: 1297b3b4aa74SDavid Sterba btrfs_release_path(path); 12986567e837SChris Mason csum_offset = 0; 1299f578d4bdSChris Mason if (found_next) { 13002f697dc6SLiu Bo u64 tmp; 1301d20f7043SChris Mason 1302f51a4a18SMiao Xie tmp = sums->len - total_bytes; 1303265fdfa6SDavid Sterba tmp >>= fs_info->sectorsize_bits; 13042f697dc6SLiu Bo tmp = min(tmp, (next_offset - file_key.offset) >> 1305265fdfa6SDavid Sterba fs_info->sectorsize_bits); 13062f697dc6SLiu Bo 130750d0446eSSeraphime Kirkovski tmp = max_t(u64, 1, tmp); 130850d0446eSSeraphime Kirkovski tmp = min_t(u64, tmp, MAX_CSUM_ITEMS(fs_info, csum_size)); 1309607d432dSJosef Bacik ins_size = csum_size * tmp; 1310f578d4bdSChris Mason } else { 1311607d432dSJosef Bacik ins_size = csum_size; 1312f578d4bdSChris Mason } 13135caf2a00SChris Mason ret = btrfs_insert_empty_item(trans, root, path, &file_key, 1314f578d4bdSChris Mason ins_size); 131554aa1f4dSChris Mason if (ret < 0) 1316918cdf44SFilipe Manana goto out; 1317fae7f21cSDulshani Gunawardhana if (WARN_ON(ret != 0)) 1318918cdf44SFilipe Manana goto out; 13195f39d397SChris Mason leaf = path->nodes[0]; 1320f51a4a18SMiao Xie csum: 13215f39d397SChris Mason item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item); 1322f51a4a18SMiao Xie item_end = (struct btrfs_csum_item *)((unsigned char *)item + 13233212fa14SJosef Bacik btrfs_item_size(leaf, path->slots[0])); 1324509659cdSChris Mason item = (struct btrfs_csum_item *)((unsigned char *)item + 1325607d432dSJosef Bacik csum_offset * csum_size); 1326b18c6685SChris Mason found: 1327265fdfa6SDavid Sterba ins_size = (u32)(sums->len - total_bytes) >> fs_info->sectorsize_bits; 1328f51a4a18SMiao Xie ins_size *= csum_size; 1329f51a4a18SMiao Xie ins_size = min_t(u32, (unsigned long)item_end - (unsigned long)item, 1330f51a4a18SMiao Xie ins_size); 1331f51a4a18SMiao Xie write_extent_buffer(leaf, sums->sums + index, (unsigned long)item, 1332f51a4a18SMiao Xie ins_size); 1333aadfeb6eSChris Mason 13341e25a2e3SJohannes Thumshirn index += ins_size; 1335f51a4a18SMiao Xie ins_size /= csum_size; 13360b246afaSJeff Mahoney total_bytes += ins_size * fs_info->sectorsize; 1337a6591715SChris Mason 13385caf2a00SChris Mason btrfs_mark_buffer_dirty(path->nodes[0]); 1339e6dcd2dcSChris Mason if (total_bytes < sums->len) { 1340b3b4aa74SDavid Sterba btrfs_release_path(path); 1341b9473439SChris Mason cond_resched(); 1342065631f6SChris Mason goto again; 1343065631f6SChris Mason } 134453863232SChris Mason out: 13455caf2a00SChris Mason btrfs_free_path(path); 1346f254e52cSChris Mason return ret; 1347f254e52cSChris Mason } 13487ffbb598SFilipe Manana 13499cdc5124SNikolay Borisov void btrfs_extent_item_to_extent_map(struct btrfs_inode *inode, 13507ffbb598SFilipe Manana const struct btrfs_path *path, 13517ffbb598SFilipe Manana struct btrfs_file_extent_item *fi, 13527ffbb598SFilipe Manana struct extent_map *em) 13537ffbb598SFilipe Manana { 13543ffbd68cSDavid Sterba struct btrfs_fs_info *fs_info = inode->root->fs_info; 13559cdc5124SNikolay Borisov struct btrfs_root *root = inode->root; 13567ffbb598SFilipe Manana struct extent_buffer *leaf = path->nodes[0]; 13577ffbb598SFilipe Manana const int slot = path->slots[0]; 13587ffbb598SFilipe Manana struct btrfs_key key; 13597ffbb598SFilipe Manana u64 extent_start, extent_end; 13607ffbb598SFilipe Manana u64 bytenr; 13617ffbb598SFilipe Manana u8 type = btrfs_file_extent_type(leaf, fi); 13627ffbb598SFilipe Manana int compress_type = btrfs_file_extent_compression(leaf, fi); 13637ffbb598SFilipe Manana 13647ffbb598SFilipe Manana btrfs_item_key_to_cpu(leaf, &key, slot); 13657ffbb598SFilipe Manana extent_start = key.offset; 1366a5eeb3d1SFilipe Manana extent_end = btrfs_file_extent_end(path); 13677ffbb598SFilipe Manana em->ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi); 136840e7efe0SQu Wenruo em->generation = btrfs_file_extent_generation(leaf, fi); 13697ffbb598SFilipe Manana if (type == BTRFS_FILE_EXTENT_REG || 13707ffbb598SFilipe Manana type == BTRFS_FILE_EXTENT_PREALLOC) { 13717ffbb598SFilipe Manana em->start = extent_start; 13727ffbb598SFilipe Manana em->len = extent_end - extent_start; 13737ffbb598SFilipe Manana em->orig_start = extent_start - 13747ffbb598SFilipe Manana btrfs_file_extent_offset(leaf, fi); 13757ffbb598SFilipe Manana em->orig_block_len = btrfs_file_extent_disk_num_bytes(leaf, fi); 13767ffbb598SFilipe Manana bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 13777ffbb598SFilipe Manana if (bytenr == 0) { 13787ffbb598SFilipe Manana em->block_start = EXTENT_MAP_HOLE; 13797ffbb598SFilipe Manana return; 13807ffbb598SFilipe Manana } 13817ffbb598SFilipe Manana if (compress_type != BTRFS_COMPRESS_NONE) { 13827ffbb598SFilipe Manana set_bit(EXTENT_FLAG_COMPRESSED, &em->flags); 13837ffbb598SFilipe Manana em->compress_type = compress_type; 13847ffbb598SFilipe Manana em->block_start = bytenr; 13857ffbb598SFilipe Manana em->block_len = em->orig_block_len; 13867ffbb598SFilipe Manana } else { 13877ffbb598SFilipe Manana bytenr += btrfs_file_extent_offset(leaf, fi); 13887ffbb598SFilipe Manana em->block_start = bytenr; 13897ffbb598SFilipe Manana em->block_len = em->len; 13907ffbb598SFilipe Manana if (type == BTRFS_FILE_EXTENT_PREALLOC) 13917ffbb598SFilipe Manana set_bit(EXTENT_FLAG_PREALLOC, &em->flags); 13927ffbb598SFilipe Manana } 13937ffbb598SFilipe Manana } else if (type == BTRFS_FILE_EXTENT_INLINE) { 13947ffbb598SFilipe Manana em->block_start = EXTENT_MAP_INLINE; 13957ffbb598SFilipe Manana em->start = extent_start; 13967ffbb598SFilipe Manana em->len = extent_end - extent_start; 13977ffbb598SFilipe Manana /* 13987ffbb598SFilipe Manana * Initialize orig_start and block_len with the same values 13997ffbb598SFilipe Manana * as in inode.c:btrfs_get_extent(). 14007ffbb598SFilipe Manana */ 14017ffbb598SFilipe Manana em->orig_start = EXTENT_MAP_HOLE; 14027ffbb598SFilipe Manana em->block_len = (u64)-1; 14037ffbb598SFilipe Manana em->compress_type = compress_type; 1404280f15cbSQu Wenruo if (compress_type != BTRFS_COMPRESS_NONE) 1405280f15cbSQu Wenruo set_bit(EXTENT_FLAG_COMPRESSED, &em->flags); 14067ffbb598SFilipe Manana } else { 14070b246afaSJeff Mahoney btrfs_err(fs_info, 14089cdc5124SNikolay Borisov "unknown file extent item type %d, inode %llu, offset %llu, " 14099cdc5124SNikolay Borisov "root %llu", type, btrfs_ino(inode), extent_start, 14107ffbb598SFilipe Manana root->root_key.objectid); 14117ffbb598SFilipe Manana } 14127ffbb598SFilipe Manana } 1413a5eeb3d1SFilipe Manana 1414a5eeb3d1SFilipe Manana /* 1415a5eeb3d1SFilipe Manana * Returns the end offset (non inclusive) of the file extent item the given path 1416a5eeb3d1SFilipe Manana * points to. If it points to an inline extent, the returned offset is rounded 1417a5eeb3d1SFilipe Manana * up to the sector size. 1418a5eeb3d1SFilipe Manana */ 1419a5eeb3d1SFilipe Manana u64 btrfs_file_extent_end(const struct btrfs_path *path) 1420a5eeb3d1SFilipe Manana { 1421a5eeb3d1SFilipe Manana const struct extent_buffer *leaf = path->nodes[0]; 1422a5eeb3d1SFilipe Manana const int slot = path->slots[0]; 1423a5eeb3d1SFilipe Manana struct btrfs_file_extent_item *fi; 1424a5eeb3d1SFilipe Manana struct btrfs_key key; 1425a5eeb3d1SFilipe Manana u64 end; 1426a5eeb3d1SFilipe Manana 1427a5eeb3d1SFilipe Manana btrfs_item_key_to_cpu(leaf, &key, slot); 1428a5eeb3d1SFilipe Manana ASSERT(key.type == BTRFS_EXTENT_DATA_KEY); 1429a5eeb3d1SFilipe Manana fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item); 1430a5eeb3d1SFilipe Manana 1431a5eeb3d1SFilipe Manana if (btrfs_file_extent_type(leaf, fi) == BTRFS_FILE_EXTENT_INLINE) { 1432a5eeb3d1SFilipe Manana end = btrfs_file_extent_ram_bytes(leaf, fi); 1433a5eeb3d1SFilipe Manana end = ALIGN(key.offset + end, leaf->fs_info->sectorsize); 1434a5eeb3d1SFilipe Manana } else { 1435a5eeb3d1SFilipe Manana end = key.offset + btrfs_file_extent_num_bytes(leaf, fi); 1436a5eeb3d1SFilipe Manana } 1437a5eeb3d1SFilipe Manana 1438a5eeb3d1SFilipe Manana return end; 1439a5eeb3d1SFilipe Manana } 1440