Commit | Line | Data |
---|---|---|
6cbd5570 CM |
1 | /* |
2 | * Copyright (C) 2007 Oracle. All rights reserved. | |
3 | * | |
4 | * This program is free software; you can redistribute it and/or | |
5 | * modify it under the terms of the GNU General Public | |
6 | * License v2 as published by the Free Software Foundation. | |
7 | * | |
8 | * This program is distributed in the hope that it will be useful, | |
9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
11 | * General Public License for more details. | |
12 | * | |
13 | * You should have received a copy of the GNU General Public | |
14 | * License along with this program; if not, write to the | |
15 | * Free Software Foundation, Inc., 59 Temple Place - Suite 330, | |
16 | * Boston, MA 021110-1307, USA. | |
17 | */ | |
18 | ||
065631f6 | 19 | #include <linux/bio.h> |
5a0e3ad6 | 20 | #include <linux/slab.h> |
065631f6 CM |
21 | #include <linux/pagemap.h> |
22 | #include <linux/highmem.h> | |
1e1d2701 | 23 | #include "ctree.h" |
dee26a9f | 24 | #include "disk-io.h" |
9f5fae2f | 25 | #include "transaction.h" |
facc8a22 | 26 | #include "volumes.h" |
1de037a4 | 27 | #include "print-tree.h" |
ebb8765b | 28 | #include "compression.h" |
1e1d2701 | 29 | |
42049bf6 CM |
30 | #define __MAX_CSUM_ITEMS(r, size) ((unsigned long)(((BTRFS_LEAF_DATA_SIZE(r) - \ |
31 | sizeof(struct btrfs_item) * 2) / \ | |
32 | size) - 1)) | |
07d400a6 | 33 | |
221b8318 | 34 | #define MAX_CSUM_ITEMS(r, size) (min_t(u32, __MAX_CSUM_ITEMS(r, size), \ |
09cbfeaf | 35 | PAGE_SIZE)) |
7ca4be45 | 36 | |
da17066c | 37 | #define MAX_ORDERED_SUM_BYTES(fs_info) ((PAGE_SIZE - \ |
07d400a6 | 38 | sizeof(struct btrfs_ordered_sum)) / \ |
da17066c | 39 | sizeof(u32) * (fs_info)->sectorsize) |
07d400a6 | 40 | |
b18c6685 | 41 | int btrfs_insert_file_extent(struct btrfs_trans_handle *trans, |
f2eb0a24 SW |
42 | struct btrfs_root *root, |
43 | u64 objectid, u64 pos, | |
44 | u64 disk_offset, u64 disk_num_bytes, | |
c8b97818 CM |
45 | u64 num_bytes, u64 offset, u64 ram_bytes, |
46 | u8 compression, u8 encryption, u16 other_encoding) | |
9f5fae2f | 47 | { |
dee26a9f CM |
48 | int ret = 0; |
49 | struct btrfs_file_extent_item *item; | |
50 | struct btrfs_key file_key; | |
5caf2a00 | 51 | struct btrfs_path *path; |
5f39d397 | 52 | struct extent_buffer *leaf; |
dee26a9f | 53 | |
5caf2a00 | 54 | path = btrfs_alloc_path(); |
db5b493a TI |
55 | if (!path) |
56 | return -ENOMEM; | |
dee26a9f | 57 | file_key.objectid = objectid; |
b18c6685 | 58 | file_key.offset = pos; |
962a298f | 59 | file_key.type = BTRFS_EXTENT_DATA_KEY; |
dee26a9f | 60 | |
b9473439 | 61 | path->leave_spinning = 1; |
5caf2a00 | 62 | ret = btrfs_insert_empty_item(trans, root, path, &file_key, |
dee26a9f | 63 | sizeof(*item)); |
54aa1f4d CM |
64 | if (ret < 0) |
65 | goto out; | |
79787eaa | 66 | BUG_ON(ret); /* Can't happen */ |
5f39d397 CM |
67 | leaf = path->nodes[0]; |
68 | item = btrfs_item_ptr(leaf, path->slots[0], | |
dee26a9f | 69 | struct btrfs_file_extent_item); |
f2eb0a24 | 70 | btrfs_set_file_extent_disk_bytenr(leaf, item, disk_offset); |
db94535d | 71 | btrfs_set_file_extent_disk_num_bytes(leaf, item, disk_num_bytes); |
f2eb0a24 | 72 | btrfs_set_file_extent_offset(leaf, item, offset); |
db94535d | 73 | btrfs_set_file_extent_num_bytes(leaf, item, num_bytes); |
c8b97818 | 74 | btrfs_set_file_extent_ram_bytes(leaf, item, ram_bytes); |
5f39d397 CM |
75 | btrfs_set_file_extent_generation(leaf, item, trans->transid); |
76 | btrfs_set_file_extent_type(leaf, item, BTRFS_FILE_EXTENT_REG); | |
c8b97818 CM |
77 | btrfs_set_file_extent_compression(leaf, item, compression); |
78 | btrfs_set_file_extent_encryption(leaf, item, encryption); | |
79 | btrfs_set_file_extent_other_encoding(leaf, item, other_encoding); | |
80 | ||
5f39d397 | 81 | btrfs_mark_buffer_dirty(leaf); |
54aa1f4d | 82 | out: |
5caf2a00 | 83 | btrfs_free_path(path); |
54aa1f4d | 84 | return ret; |
9f5fae2f | 85 | } |
dee26a9f | 86 | |
48a3b636 ES |
87 | static struct btrfs_csum_item * |
88 | btrfs_lookup_csum(struct btrfs_trans_handle *trans, | |
89 | struct btrfs_root *root, | |
90 | struct btrfs_path *path, | |
91 | u64 bytenr, int cow) | |
6567e837 | 92 | { |
0b246afa | 93 | struct btrfs_fs_info *fs_info = root->fs_info; |
6567e837 CM |
94 | int ret; |
95 | struct btrfs_key file_key; | |
96 | struct btrfs_key found_key; | |
97 | struct btrfs_csum_item *item; | |
5f39d397 | 98 | struct extent_buffer *leaf; |
6567e837 | 99 | u64 csum_offset = 0; |
0b246afa | 100 | u16 csum_size = btrfs_super_csum_size(fs_info->super_copy); |
a429e513 | 101 | int csums_in_item; |
6567e837 | 102 | |
d20f7043 CM |
103 | file_key.objectid = BTRFS_EXTENT_CSUM_OBJECTID; |
104 | file_key.offset = bytenr; | |
962a298f | 105 | file_key.type = BTRFS_EXTENT_CSUM_KEY; |
b18c6685 | 106 | ret = btrfs_search_slot(trans, root, &file_key, path, 0, cow); |
6567e837 CM |
107 | if (ret < 0) |
108 | goto fail; | |
5f39d397 | 109 | leaf = path->nodes[0]; |
6567e837 CM |
110 | if (ret > 0) { |
111 | ret = 1; | |
70b2befd | 112 | if (path->slots[0] == 0) |
6567e837 CM |
113 | goto fail; |
114 | path->slots[0]--; | |
5f39d397 | 115 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
962a298f | 116 | if (found_key.type != BTRFS_EXTENT_CSUM_KEY) |
6567e837 | 117 | goto fail; |
d20f7043 CM |
118 | |
119 | csum_offset = (bytenr - found_key.offset) >> | |
0b246afa | 120 | fs_info->sb->s_blocksize_bits; |
5f39d397 | 121 | csums_in_item = btrfs_item_size_nr(leaf, path->slots[0]); |
607d432d | 122 | csums_in_item /= csum_size; |
a429e513 | 123 | |
82d130ff | 124 | if (csum_offset == csums_in_item) { |
a429e513 | 125 | ret = -EFBIG; |
6567e837 | 126 | goto fail; |
82d130ff MX |
127 | } else if (csum_offset > csums_in_item) { |
128 | goto fail; | |
6567e837 CM |
129 | } |
130 | } | |
131 | item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item); | |
509659cd | 132 | item = (struct btrfs_csum_item *)((unsigned char *)item + |
607d432d | 133 | csum_offset * csum_size); |
6567e837 CM |
134 | return item; |
135 | fail: | |
136 | if (ret > 0) | |
b18c6685 | 137 | ret = -ENOENT; |
6567e837 CM |
138 | return ERR_PTR(ret); |
139 | } | |
140 | ||
dee26a9f CM |
141 | int btrfs_lookup_file_extent(struct btrfs_trans_handle *trans, |
142 | struct btrfs_root *root, | |
143 | struct btrfs_path *path, u64 objectid, | |
9773a788 | 144 | u64 offset, int mod) |
dee26a9f CM |
145 | { |
146 | int ret; | |
147 | struct btrfs_key file_key; | |
148 | int ins_len = mod < 0 ? -1 : 0; | |
149 | int cow = mod != 0; | |
150 | ||
151 | file_key.objectid = objectid; | |
70b2befd | 152 | file_key.offset = offset; |
962a298f | 153 | file_key.type = BTRFS_EXTENT_DATA_KEY; |
dee26a9f CM |
154 | ret = btrfs_search_slot(trans, root, &file_key, path, ins_len, cow); |
155 | return ret; | |
156 | } | |
f254e52c | 157 | |
facc8a22 MX |
158 | static void btrfs_io_bio_endio_readpage(struct btrfs_io_bio *bio, int err) |
159 | { | |
160 | kfree(bio->csum_allocated); | |
161 | } | |
162 | ||
2ff7e61e | 163 | static int __btrfs_lookup_bio_sums(struct inode *inode, struct bio *bio, |
4b46fce2 | 164 | u64 logical_offset, u32 *dst, int dio) |
61b49440 | 165 | { |
0b246afa | 166 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
17347cec LB |
167 | struct bio_vec bvec; |
168 | struct bvec_iter iter; | |
facc8a22 MX |
169 | struct btrfs_io_bio *btrfs_bio = btrfs_io_bio(bio); |
170 | struct btrfs_csum_item *item = NULL; | |
171 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; | |
172 | struct btrfs_path *path; | |
173 | u8 *csum; | |
4b46fce2 | 174 | u64 offset = 0; |
61b49440 CM |
175 | u64 item_start_offset = 0; |
176 | u64 item_last_offset = 0; | |
d20f7043 | 177 | u64 disk_bytenr; |
c40a3d38 | 178 | u64 page_bytes_left; |
61b49440 | 179 | u32 diff; |
facc8a22 | 180 | int nblocks; |
17347cec | 181 | int count = 0; |
0b246afa | 182 | u16 csum_size = btrfs_super_csum_size(fs_info->super_copy); |
61b49440 CM |
183 | |
184 | path = btrfs_alloc_path(); | |
c2db1073 TI |
185 | if (!path) |
186 | return -ENOMEM; | |
facc8a22 | 187 | |
4f024f37 | 188 | nblocks = bio->bi_iter.bi_size >> inode->i_sb->s_blocksize_bits; |
facc8a22 MX |
189 | if (!dst) { |
190 | if (nblocks * csum_size > BTRFS_BIO_INLINE_CSUM_SIZE) { | |
31e818fe DS |
191 | btrfs_bio->csum_allocated = kmalloc_array(nblocks, |
192 | csum_size, GFP_NOFS); | |
facc8a22 MX |
193 | if (!btrfs_bio->csum_allocated) { |
194 | btrfs_free_path(path); | |
195 | return -ENOMEM; | |
196 | } | |
197 | btrfs_bio->csum = btrfs_bio->csum_allocated; | |
198 | btrfs_bio->end_io = btrfs_io_bio_endio_readpage; | |
199 | } else { | |
200 | btrfs_bio->csum = btrfs_bio->csum_inline; | |
201 | } | |
202 | csum = btrfs_bio->csum; | |
203 | } else { | |
204 | csum = (u8 *)dst; | |
205 | } | |
206 | ||
09cbfeaf | 207 | if (bio->bi_iter.bi_size > PAGE_SIZE * 8) |
e4058b54 | 208 | path->reada = READA_FORWARD; |
61b49440 | 209 | |
2cf8572d CM |
210 | /* |
211 | * the free space stuff is only read when it hasn't been | |
212 | * updated in the current transaction. So, we can safely | |
213 | * read from the commit root and sidestep a nasty deadlock | |
214 | * between reading the free space cache and updating the csum tree. | |
215 | */ | |
70ddc553 | 216 | if (btrfs_is_free_space_inode(BTRFS_I(inode))) { |
2cf8572d | 217 | path->search_commit_root = 1; |
ddf23b3f JB |
218 | path->skip_locking = 1; |
219 | } | |
2cf8572d | 220 | |
4f024f37 | 221 | disk_bytenr = (u64)bio->bi_iter.bi_sector << 9; |
4b46fce2 JB |
222 | if (dio) |
223 | offset = logical_offset; | |
c40a3d38 | 224 | |
17347cec LB |
225 | bio_for_each_segment(bvec, bio, iter) { |
226 | page_bytes_left = bvec.bv_len; | |
4989d277 CH |
227 | if (count) |
228 | goto next; | |
229 | ||
4b46fce2 | 230 | if (!dio) |
17347cec | 231 | offset = page_offset(bvec.bv_page) + bvec.bv_offset; |
facc8a22 MX |
232 | count = btrfs_find_ordered_sum(inode, offset, disk_bytenr, |
233 | (u32 *)csum, nblocks); | |
e4100d98 | 234 | if (count) |
61b49440 CM |
235 | goto found; |
236 | ||
d20f7043 CM |
237 | if (!item || disk_bytenr < item_start_offset || |
238 | disk_bytenr >= item_last_offset) { | |
61b49440 CM |
239 | struct btrfs_key found_key; |
240 | u32 item_size; | |
241 | ||
242 | if (item) | |
b3b4aa74 | 243 | btrfs_release_path(path); |
0b246afa | 244 | item = btrfs_lookup_csum(NULL, fs_info->csum_root, |
d20f7043 | 245 | path, disk_bytenr, 0); |
61b49440 | 246 | if (IS_ERR(item)) { |
e4100d98 | 247 | count = 1; |
facc8a22 | 248 | memset(csum, 0, csum_size); |
17d217fe YZ |
249 | if (BTRFS_I(inode)->root->root_key.objectid == |
250 | BTRFS_DATA_RELOC_TREE_OBJECTID) { | |
251 | set_extent_bits(io_tree, offset, | |
0b246afa | 252 | offset + fs_info->sectorsize - 1, |
ceeb0ae7 | 253 | EXTENT_NODATASUM); |
17d217fe | 254 | } else { |
0b246afa | 255 | btrfs_info_rl(fs_info, |
efe120a0 | 256 | "no csum found for inode %llu start %llu", |
4a0cc7ca | 257 | btrfs_ino(BTRFS_I(inode)), offset); |
17d217fe | 258 | } |
6dab8157 | 259 | item = NULL; |
b3b4aa74 | 260 | btrfs_release_path(path); |
61b49440 CM |
261 | goto found; |
262 | } | |
263 | btrfs_item_key_to_cpu(path->nodes[0], &found_key, | |
264 | path->slots[0]); | |
265 | ||
266 | item_start_offset = found_key.offset; | |
267 | item_size = btrfs_item_size_nr(path->nodes[0], | |
268 | path->slots[0]); | |
269 | item_last_offset = item_start_offset + | |
607d432d | 270 | (item_size / csum_size) * |
0b246afa | 271 | fs_info->sectorsize; |
61b49440 CM |
272 | item = btrfs_item_ptr(path->nodes[0], path->slots[0], |
273 | struct btrfs_csum_item); | |
274 | } | |
275 | /* | |
276 | * this byte range must be able to fit inside | |
277 | * a single leaf so it will also fit inside a u32 | |
278 | */ | |
d20f7043 | 279 | diff = disk_bytenr - item_start_offset; |
0b246afa | 280 | diff = diff / fs_info->sectorsize; |
607d432d | 281 | diff = diff * csum_size; |
facc8a22 MX |
282 | count = min_t(int, nblocks, (item_last_offset - disk_bytenr) >> |
283 | inode->i_sb->s_blocksize_bits); | |
284 | read_extent_buffer(path->nodes[0], csum, | |
3de9d6b6 | 285 | ((unsigned long)item) + diff, |
e4100d98 | 286 | csum_size * count); |
61b49440 | 287 | found: |
facc8a22 MX |
288 | csum += count * csum_size; |
289 | nblocks -= count; | |
4989d277 | 290 | next: |
e4100d98 | 291 | while (count--) { |
0b246afa JM |
292 | disk_bytenr += fs_info->sectorsize; |
293 | offset += fs_info->sectorsize; | |
294 | page_bytes_left -= fs_info->sectorsize; | |
4989d277 CH |
295 | if (!page_bytes_left) |
296 | break; /* move to next bio */ | |
e4100d98 | 297 | } |
61b49440 | 298 | } |
389f239c | 299 | |
4989d277 | 300 | WARN_ON_ONCE(count); |
61b49440 CM |
301 | btrfs_free_path(path); |
302 | return 0; | |
303 | } | |
304 | ||
2ff7e61e | 305 | int btrfs_lookup_bio_sums(struct inode *inode, struct bio *bio, u32 *dst) |
4b46fce2 | 306 | { |
2ff7e61e | 307 | return __btrfs_lookup_bio_sums(inode, bio, 0, dst, 0); |
4b46fce2 JB |
308 | } |
309 | ||
2ff7e61e | 310 | int btrfs_lookup_bio_sums_dio(struct inode *inode, struct bio *bio, u64 offset) |
4b46fce2 | 311 | { |
2ff7e61e | 312 | return __btrfs_lookup_bio_sums(inode, bio, offset, NULL, 1); |
4b46fce2 JB |
313 | } |
314 | ||
17d217fe | 315 | int btrfs_lookup_csums_range(struct btrfs_root *root, u64 start, u64 end, |
a2de733c | 316 | struct list_head *list, int search_commit) |
17d217fe | 317 | { |
0b246afa | 318 | struct btrfs_fs_info *fs_info = root->fs_info; |
17d217fe YZ |
319 | struct btrfs_key key; |
320 | struct btrfs_path *path; | |
321 | struct extent_buffer *leaf; | |
322 | struct btrfs_ordered_sum *sums; | |
17d217fe | 323 | struct btrfs_csum_item *item; |
0678b618 | 324 | LIST_HEAD(tmplist); |
17d217fe YZ |
325 | unsigned long offset; |
326 | int ret; | |
327 | size_t size; | |
328 | u64 csum_end; | |
0b246afa | 329 | u16 csum_size = btrfs_super_csum_size(fs_info->super_copy); |
17d217fe | 330 | |
0b246afa JM |
331 | ASSERT(IS_ALIGNED(start, fs_info->sectorsize) && |
332 | IS_ALIGNED(end + 1, fs_info->sectorsize)); | |
4277a9c3 | 333 | |
17d217fe | 334 | path = btrfs_alloc_path(); |
d8926bb3 MF |
335 | if (!path) |
336 | return -ENOMEM; | |
17d217fe | 337 | |
a2de733c AJ |
338 | if (search_commit) { |
339 | path->skip_locking = 1; | |
e4058b54 | 340 | path->reada = READA_FORWARD; |
a2de733c AJ |
341 | path->search_commit_root = 1; |
342 | } | |
343 | ||
17d217fe YZ |
344 | key.objectid = BTRFS_EXTENT_CSUM_OBJECTID; |
345 | key.offset = start; | |
346 | key.type = BTRFS_EXTENT_CSUM_KEY; | |
347 | ||
07d400a6 | 348 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
17d217fe YZ |
349 | if (ret < 0) |
350 | goto fail; | |
351 | if (ret > 0 && path->slots[0] > 0) { | |
352 | leaf = path->nodes[0]; | |
353 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1); | |
354 | if (key.objectid == BTRFS_EXTENT_CSUM_OBJECTID && | |
355 | key.type == BTRFS_EXTENT_CSUM_KEY) { | |
356 | offset = (start - key.offset) >> | |
0b246afa | 357 | fs_info->sb->s_blocksize_bits; |
17d217fe YZ |
358 | if (offset * csum_size < |
359 | btrfs_item_size_nr(leaf, path->slots[0] - 1)) | |
360 | path->slots[0]--; | |
361 | } | |
362 | } | |
363 | ||
364 | while (start <= end) { | |
365 | leaf = path->nodes[0]; | |
366 | if (path->slots[0] >= btrfs_header_nritems(leaf)) { | |
07d400a6 | 367 | ret = btrfs_next_leaf(root, path); |
17d217fe YZ |
368 | if (ret < 0) |
369 | goto fail; | |
370 | if (ret > 0) | |
371 | break; | |
372 | leaf = path->nodes[0]; | |
373 | } | |
374 | ||
375 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
376 | if (key.objectid != BTRFS_EXTENT_CSUM_OBJECTID || | |
628c8282 ZYW |
377 | key.type != BTRFS_EXTENT_CSUM_KEY || |
378 | key.offset > end) | |
17d217fe YZ |
379 | break; |
380 | ||
381 | if (key.offset > start) | |
382 | start = key.offset; | |
383 | ||
384 | size = btrfs_item_size_nr(leaf, path->slots[0]); | |
0b246afa | 385 | csum_end = key.offset + (size / csum_size) * fs_info->sectorsize; |
87b29b20 YZ |
386 | if (csum_end <= start) { |
387 | path->slots[0]++; | |
388 | continue; | |
389 | } | |
17d217fe | 390 | |
07d400a6 | 391 | csum_end = min(csum_end, end + 1); |
17d217fe YZ |
392 | item = btrfs_item_ptr(path->nodes[0], path->slots[0], |
393 | struct btrfs_csum_item); | |
07d400a6 YZ |
394 | while (start < csum_end) { |
395 | size = min_t(size_t, csum_end - start, | |
0b246afa JM |
396 | MAX_ORDERED_SUM_BYTES(fs_info)); |
397 | sums = kzalloc(btrfs_ordered_sum_size(fs_info, size), | |
f51a4a18 | 398 | GFP_NOFS); |
0678b618 MF |
399 | if (!sums) { |
400 | ret = -ENOMEM; | |
401 | goto fail; | |
402 | } | |
17d217fe | 403 | |
07d400a6 | 404 | sums->bytenr = start; |
f51a4a18 | 405 | sums->len = (int)size; |
07d400a6 YZ |
406 | |
407 | offset = (start - key.offset) >> | |
0b246afa | 408 | fs_info->sb->s_blocksize_bits; |
07d400a6 | 409 | offset *= csum_size; |
0b246afa | 410 | size >>= fs_info->sb->s_blocksize_bits; |
07d400a6 | 411 | |
f51a4a18 MX |
412 | read_extent_buffer(path->nodes[0], |
413 | sums->sums, | |
414 | ((unsigned long)item) + offset, | |
415 | csum_size * size); | |
416 | ||
0b246afa | 417 | start += fs_info->sectorsize * size; |
0678b618 | 418 | list_add_tail(&sums->list, &tmplist); |
07d400a6 | 419 | } |
17d217fe YZ |
420 | path->slots[0]++; |
421 | } | |
422 | ret = 0; | |
423 | fail: | |
0678b618 | 424 | while (ret < 0 && !list_empty(&tmplist)) { |
6e5aafb2 | 425 | sums = list_entry(tmplist.next, struct btrfs_ordered_sum, list); |
0678b618 MF |
426 | list_del(&sums->list); |
427 | kfree(sums); | |
428 | } | |
429 | list_splice_tail(&tmplist, list); | |
430 | ||
17d217fe YZ |
431 | btrfs_free_path(path); |
432 | return ret; | |
433 | } | |
434 | ||
2ff7e61e JM |
435 | int btrfs_csum_one_bio(struct inode *inode, struct bio *bio, |
436 | u64 file_start, int contig) | |
e015640f | 437 | { |
0b246afa | 438 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
e6dcd2dc | 439 | struct btrfs_ordered_sum *sums; |
6cd7ce49 | 440 | struct btrfs_ordered_extent *ordered = NULL; |
e015640f | 441 | char *data; |
17347cec LB |
442 | struct bvec_iter iter; |
443 | struct bio_vec bvec; | |
f51a4a18 | 444 | int index; |
c40a3d38 | 445 | int nr_sectors; |
3edf7d33 CM |
446 | unsigned long total_bytes = 0; |
447 | unsigned long this_sum_bytes = 0; | |
17347cec | 448 | int i; |
3edf7d33 | 449 | u64 offset; |
e015640f | 450 | |
0b246afa | 451 | sums = kzalloc(btrfs_ordered_sum_size(fs_info, bio->bi_iter.bi_size), |
4f024f37 | 452 | GFP_NOFS); |
e015640f CM |
453 | if (!sums) |
454 | return -ENOMEM; | |
3edf7d33 | 455 | |
4f024f37 | 456 | sums->len = bio->bi_iter.bi_size; |
e6dcd2dc | 457 | INIT_LIST_HEAD(&sums->list); |
d20f7043 CM |
458 | |
459 | if (contig) | |
460 | offset = file_start; | |
461 | else | |
6cd7ce49 | 462 | offset = 0; /* shut up gcc */ |
d20f7043 | 463 | |
4f024f37 | 464 | sums->bytenr = (u64)bio->bi_iter.bi_sector << 9; |
f51a4a18 | 465 | index = 0; |
e015640f | 466 | |
17347cec | 467 | bio_for_each_segment(bvec, bio, iter) { |
d20f7043 | 468 | if (!contig) |
17347cec | 469 | offset = page_offset(bvec.bv_page) + bvec.bv_offset; |
d20f7043 | 470 | |
6cd7ce49 CH |
471 | if (!ordered) { |
472 | ordered = btrfs_lookup_ordered_extent(inode, offset); | |
473 | BUG_ON(!ordered); /* Logic error */ | |
474 | } | |
475 | ||
17347cec | 476 | data = kmap_atomic(bvec.bv_page); |
3edf7d33 | 477 | |
0b246afa | 478 | nr_sectors = BTRFS_BYTES_TO_BLKS(fs_info, |
17347cec | 479 | bvec.bv_len + fs_info->sectorsize |
0b246afa | 480 | - 1); |
c40a3d38 CR |
481 | |
482 | for (i = 0; i < nr_sectors; i++) { | |
483 | if (offset >= ordered->file_offset + ordered->len || | |
484 | offset < ordered->file_offset) { | |
485 | unsigned long bytes_left; | |
486 | ||
487 | kunmap_atomic(data); | |
488 | sums->len = this_sum_bytes; | |
489 | this_sum_bytes = 0; | |
490 | btrfs_add_ordered_sum(inode, ordered, sums); | |
491 | btrfs_put_ordered_extent(ordered); | |
492 | ||
493 | bytes_left = bio->bi_iter.bi_size - total_bytes; | |
494 | ||
0b246afa JM |
495 | sums = kzalloc(btrfs_ordered_sum_size(fs_info, bytes_left), |
496 | GFP_NOFS); | |
c40a3d38 CR |
497 | BUG_ON(!sums); /* -ENOMEM */ |
498 | sums->len = bytes_left; | |
499 | ordered = btrfs_lookup_ordered_extent(inode, | |
500 | offset); | |
501 | ASSERT(ordered); /* Logic error */ | |
502 | sums->bytenr = ((u64)bio->bi_iter.bi_sector << 9) | |
503 | + total_bytes; | |
504 | index = 0; | |
505 | ||
17347cec | 506 | data = kmap_atomic(bvec.bv_page); |
c40a3d38 | 507 | } |
3edf7d33 | 508 | |
c40a3d38 CR |
509 | sums->sums[index] = ~(u32)0; |
510 | sums->sums[index] | |
17347cec | 511 | = btrfs_csum_data(data + bvec.bv_offset |
0b246afa | 512 | + (i * fs_info->sectorsize), |
c40a3d38 | 513 | sums->sums[index], |
0b246afa | 514 | fs_info->sectorsize); |
c40a3d38 CR |
515 | btrfs_csum_final(sums->sums[index], |
516 | (char *)(sums->sums + index)); | |
517 | index++; | |
0b246afa JM |
518 | offset += fs_info->sectorsize; |
519 | this_sum_bytes += fs_info->sectorsize; | |
520 | total_bytes += fs_info->sectorsize; | |
3edf7d33 CM |
521 | } |
522 | ||
7ac687d9 | 523 | kunmap_atomic(data); |
e015640f | 524 | } |
ed98b56a | 525 | this_sum_bytes = 0; |
3edf7d33 CM |
526 | btrfs_add_ordered_sum(inode, ordered, sums); |
527 | btrfs_put_ordered_extent(ordered); | |
e015640f CM |
528 | return 0; |
529 | } | |
530 | ||
459931ec CM |
531 | /* |
532 | * helper function for csum removal, this expects the | |
533 | * key to describe the csum pointed to by the path, and it expects | |
534 | * the csum to overlap the range [bytenr, len] | |
535 | * | |
536 | * The csum should not be entirely contained in the range and the | |
537 | * range should not be entirely contained in the csum. | |
538 | * | |
539 | * This calls btrfs_truncate_item with the correct args based on the | |
540 | * overlap, and fixes up the key as required. | |
541 | */ | |
2ff7e61e | 542 | static noinline void truncate_one_csum(struct btrfs_fs_info *fs_info, |
143bede5 JM |
543 | struct btrfs_path *path, |
544 | struct btrfs_key *key, | |
545 | u64 bytenr, u64 len) | |
459931ec CM |
546 | { |
547 | struct extent_buffer *leaf; | |
0b246afa | 548 | u16 csum_size = btrfs_super_csum_size(fs_info->super_copy); |
459931ec CM |
549 | u64 csum_end; |
550 | u64 end_byte = bytenr + len; | |
0b246afa | 551 | u32 blocksize_bits = fs_info->sb->s_blocksize_bits; |
459931ec CM |
552 | |
553 | leaf = path->nodes[0]; | |
554 | csum_end = btrfs_item_size_nr(leaf, path->slots[0]) / csum_size; | |
0b246afa | 555 | csum_end <<= fs_info->sb->s_blocksize_bits; |
459931ec CM |
556 | csum_end += key->offset; |
557 | ||
558 | if (key->offset < bytenr && csum_end <= end_byte) { | |
559 | /* | |
560 | * [ bytenr - len ] | |
561 | * [ ] | |
562 | * [csum ] | |
563 | * A simple truncate off the end of the item | |
564 | */ | |
565 | u32 new_size = (bytenr - key->offset) >> blocksize_bits; | |
566 | new_size *= csum_size; | |
2ff7e61e | 567 | btrfs_truncate_item(fs_info, path, new_size, 1); |
459931ec CM |
568 | } else if (key->offset >= bytenr && csum_end > end_byte && |
569 | end_byte > key->offset) { | |
570 | /* | |
571 | * [ bytenr - len ] | |
572 | * [ ] | |
573 | * [csum ] | |
574 | * we need to truncate from the beginning of the csum | |
575 | */ | |
576 | u32 new_size = (csum_end - end_byte) >> blocksize_bits; | |
577 | new_size *= csum_size; | |
578 | ||
2ff7e61e | 579 | btrfs_truncate_item(fs_info, path, new_size, 0); |
459931ec CM |
580 | |
581 | key->offset = end_byte; | |
0b246afa | 582 | btrfs_set_item_key_safe(fs_info, path, key); |
459931ec CM |
583 | } else { |
584 | BUG(); | |
585 | } | |
459931ec CM |
586 | } |
587 | ||
588 | /* | |
589 | * deletes the csum items from the csum tree for a given | |
590 | * range of bytes. | |
591 | */ | |
592 | int btrfs_del_csums(struct btrfs_trans_handle *trans, | |
5b4aacef | 593 | struct btrfs_fs_info *fs_info, u64 bytenr, u64 len) |
459931ec | 594 | { |
5b4aacef | 595 | struct btrfs_root *root = fs_info->csum_root; |
459931ec CM |
596 | struct btrfs_path *path; |
597 | struct btrfs_key key; | |
598 | u64 end_byte = bytenr + len; | |
599 | u64 csum_end; | |
600 | struct extent_buffer *leaf; | |
601 | int ret; | |
0b246afa JM |
602 | u16 csum_size = btrfs_super_csum_size(fs_info->super_copy); |
603 | int blocksize_bits = fs_info->sb->s_blocksize_bits; | |
459931ec | 604 | |
459931ec | 605 | path = btrfs_alloc_path(); |
2a29edc6 | 606 | if (!path) |
607 | return -ENOMEM; | |
459931ec | 608 | |
d397712b | 609 | while (1) { |
459931ec CM |
610 | key.objectid = BTRFS_EXTENT_CSUM_OBJECTID; |
611 | key.offset = end_byte - 1; | |
612 | key.type = BTRFS_EXTENT_CSUM_KEY; | |
613 | ||
b9473439 | 614 | path->leave_spinning = 1; |
459931ec CM |
615 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); |
616 | if (ret > 0) { | |
617 | if (path->slots[0] == 0) | |
65a246c5 | 618 | break; |
459931ec | 619 | path->slots[0]--; |
ad0397a7 | 620 | } else if (ret < 0) { |
65a246c5 | 621 | break; |
459931ec | 622 | } |
ad0397a7 | 623 | |
459931ec CM |
624 | leaf = path->nodes[0]; |
625 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
626 | ||
627 | if (key.objectid != BTRFS_EXTENT_CSUM_OBJECTID || | |
628 | key.type != BTRFS_EXTENT_CSUM_KEY) { | |
629 | break; | |
630 | } | |
631 | ||
632 | if (key.offset >= end_byte) | |
633 | break; | |
634 | ||
635 | csum_end = btrfs_item_size_nr(leaf, path->slots[0]) / csum_size; | |
636 | csum_end <<= blocksize_bits; | |
637 | csum_end += key.offset; | |
638 | ||
639 | /* this csum ends before we start, we're done */ | |
640 | if (csum_end <= bytenr) | |
641 | break; | |
642 | ||
643 | /* delete the entire item, it is inside our range */ | |
644 | if (key.offset >= bytenr && csum_end <= end_byte) { | |
6f546216 FM |
645 | int del_nr = 1; |
646 | ||
647 | /* | |
648 | * Check how many csum items preceding this one in this | |
649 | * leaf correspond to our range and then delete them all | |
650 | * at once. | |
651 | */ | |
652 | if (key.offset > bytenr && path->slots[0] > 0) { | |
653 | int slot = path->slots[0] - 1; | |
654 | ||
655 | while (slot >= 0) { | |
656 | struct btrfs_key pk; | |
657 | ||
658 | btrfs_item_key_to_cpu(leaf, &pk, slot); | |
659 | if (pk.offset < bytenr || | |
660 | pk.type != BTRFS_EXTENT_CSUM_KEY || | |
661 | pk.objectid != | |
662 | BTRFS_EXTENT_CSUM_OBJECTID) | |
663 | break; | |
664 | path->slots[0] = slot; | |
665 | del_nr++; | |
666 | key.offset = pk.offset; | |
667 | slot--; | |
668 | } | |
669 | } | |
670 | ret = btrfs_del_items(trans, root, path, | |
671 | path->slots[0], del_nr); | |
65a246c5 TI |
672 | if (ret) |
673 | goto out; | |
dcbdd4dc CM |
674 | if (key.offset == bytenr) |
675 | break; | |
459931ec CM |
676 | } else if (key.offset < bytenr && csum_end > end_byte) { |
677 | unsigned long offset; | |
678 | unsigned long shift_len; | |
679 | unsigned long item_offset; | |
680 | /* | |
681 | * [ bytenr - len ] | |
682 | * [csum ] | |
683 | * | |
684 | * Our bytes are in the middle of the csum, | |
685 | * we need to split this item and insert a new one. | |
686 | * | |
687 | * But we can't drop the path because the | |
688 | * csum could change, get removed, extended etc. | |
689 | * | |
690 | * The trick here is the max size of a csum item leaves | |
691 | * enough room in the tree block for a single | |
692 | * item header. So, we split the item in place, | |
693 | * adding a new header pointing to the existing | |
694 | * bytes. Then we loop around again and we have | |
695 | * a nicely formed csum item that we can neatly | |
696 | * truncate. | |
697 | */ | |
698 | offset = (bytenr - key.offset) >> blocksize_bits; | |
699 | offset *= csum_size; | |
700 | ||
701 | shift_len = (len >> blocksize_bits) * csum_size; | |
702 | ||
703 | item_offset = btrfs_item_ptr_offset(leaf, | |
704 | path->slots[0]); | |
705 | ||
b159fa28 | 706 | memzero_extent_buffer(leaf, item_offset + offset, |
459931ec CM |
707 | shift_len); |
708 | key.offset = bytenr; | |
709 | ||
710 | /* | |
711 | * btrfs_split_item returns -EAGAIN when the | |
712 | * item changed size or key | |
713 | */ | |
714 | ret = btrfs_split_item(trans, root, path, &key, offset); | |
79787eaa | 715 | if (ret && ret != -EAGAIN) { |
66642832 | 716 | btrfs_abort_transaction(trans, ret); |
79787eaa JM |
717 | goto out; |
718 | } | |
459931ec CM |
719 | |
720 | key.offset = end_byte - 1; | |
721 | } else { | |
2ff7e61e | 722 | truncate_one_csum(fs_info, path, &key, bytenr, len); |
dcbdd4dc CM |
723 | if (key.offset < bytenr) |
724 | break; | |
459931ec | 725 | } |
b3b4aa74 | 726 | btrfs_release_path(path); |
459931ec | 727 | } |
65a246c5 | 728 | ret = 0; |
459931ec CM |
729 | out: |
730 | btrfs_free_path(path); | |
65a246c5 | 731 | return ret; |
459931ec CM |
732 | } |
733 | ||
065631f6 | 734 | int btrfs_csum_file_blocks(struct btrfs_trans_handle *trans, |
d20f7043 | 735 | struct btrfs_root *root, |
e6dcd2dc | 736 | struct btrfs_ordered_sum *sums) |
f254e52c | 737 | { |
0b246afa | 738 | struct btrfs_fs_info *fs_info = root->fs_info; |
f254e52c | 739 | struct btrfs_key file_key; |
6567e837 | 740 | struct btrfs_key found_key; |
5caf2a00 | 741 | struct btrfs_path *path; |
f254e52c | 742 | struct btrfs_csum_item *item; |
065631f6 | 743 | struct btrfs_csum_item *item_end; |
ff79f819 | 744 | struct extent_buffer *leaf = NULL; |
f51a4a18 MX |
745 | u64 next_offset; |
746 | u64 total_bytes = 0; | |
6567e837 | 747 | u64 csum_offset; |
f51a4a18 | 748 | u64 bytenr; |
f578d4bd CM |
749 | u32 nritems; |
750 | u32 ins_size; | |
f51a4a18 MX |
751 | int index = 0; |
752 | int found_next; | |
753 | int ret; | |
0b246afa | 754 | u16 csum_size = btrfs_super_csum_size(fs_info->super_copy); |
6e92f5e6 | 755 | |
5caf2a00 | 756 | path = btrfs_alloc_path(); |
d8926bb3 MF |
757 | if (!path) |
758 | return -ENOMEM; | |
065631f6 CM |
759 | again: |
760 | next_offset = (u64)-1; | |
761 | found_next = 0; | |
f51a4a18 | 762 | bytenr = sums->bytenr + total_bytes; |
d20f7043 | 763 | file_key.objectid = BTRFS_EXTENT_CSUM_OBJECTID; |
f51a4a18 | 764 | file_key.offset = bytenr; |
962a298f | 765 | file_key.type = BTRFS_EXTENT_CSUM_KEY; |
a429e513 | 766 | |
f51a4a18 | 767 | item = btrfs_lookup_csum(trans, root, path, bytenr, 1); |
ff79f819 | 768 | if (!IS_ERR(item)) { |
639cb586 | 769 | ret = 0; |
f51a4a18 MX |
770 | leaf = path->nodes[0]; |
771 | item_end = btrfs_item_ptr(leaf, path->slots[0], | |
772 | struct btrfs_csum_item); | |
773 | item_end = (struct btrfs_csum_item *)((char *)item_end + | |
774 | btrfs_item_size_nr(leaf, path->slots[0])); | |
a429e513 | 775 | goto found; |
ff79f819 | 776 | } |
a429e513 | 777 | ret = PTR_ERR(item); |
4a500fd1 YZ |
778 | if (ret != -EFBIG && ret != -ENOENT) |
779 | goto fail_unlock; | |
780 | ||
a429e513 CM |
781 | if (ret == -EFBIG) { |
782 | u32 item_size; | |
783 | /* we found one, but it isn't big enough yet */ | |
5f39d397 CM |
784 | leaf = path->nodes[0]; |
785 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
607d432d | 786 | if ((item_size / csum_size) >= |
0b246afa | 787 | MAX_CSUM_ITEMS(fs_info, csum_size)) { |
a429e513 CM |
788 | /* already at max size, make a new one */ |
789 | goto insert; | |
790 | } | |
791 | } else { | |
f578d4bd | 792 | int slot = path->slots[0] + 1; |
a429e513 | 793 | /* we didn't find a csum item, insert one */ |
f578d4bd | 794 | nritems = btrfs_header_nritems(path->nodes[0]); |
35045bf2 | 795 | if (!nritems || (path->slots[0] >= nritems - 1)) { |
f578d4bd | 796 | ret = btrfs_next_leaf(root, path); |
b56baf5b | 797 | if (ret == 1) |
f578d4bd | 798 | found_next = 1; |
b56baf5b | 799 | if (ret != 0) |
f578d4bd | 800 | goto insert; |
27b9a812 | 801 | slot = path->slots[0]; |
f578d4bd CM |
802 | } |
803 | btrfs_item_key_to_cpu(path->nodes[0], &found_key, slot); | |
d20f7043 CM |
804 | if (found_key.objectid != BTRFS_EXTENT_CSUM_OBJECTID || |
805 | found_key.type != BTRFS_EXTENT_CSUM_KEY) { | |
f578d4bd CM |
806 | found_next = 1; |
807 | goto insert; | |
808 | } | |
809 | next_offset = found_key.offset; | |
810 | found_next = 1; | |
a429e513 CM |
811 | goto insert; |
812 | } | |
813 | ||
814 | /* | |
815 | * at this point, we know the tree has an item, but it isn't big | |
816 | * enough yet to put our csum in. Grow it | |
817 | */ | |
b3b4aa74 | 818 | btrfs_release_path(path); |
6567e837 | 819 | ret = btrfs_search_slot(trans, root, &file_key, path, |
607d432d | 820 | csum_size, 1); |
6567e837 | 821 | if (ret < 0) |
53863232 | 822 | goto fail_unlock; |
459931ec CM |
823 | |
824 | if (ret > 0) { | |
825 | if (path->slots[0] == 0) | |
826 | goto insert; | |
827 | path->slots[0]--; | |
6567e837 | 828 | } |
459931ec | 829 | |
5f39d397 CM |
830 | leaf = path->nodes[0]; |
831 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
d20f7043 | 832 | csum_offset = (bytenr - found_key.offset) >> |
0b246afa | 833 | fs_info->sb->s_blocksize_bits; |
459931ec | 834 | |
962a298f | 835 | if (found_key.type != BTRFS_EXTENT_CSUM_KEY || |
d20f7043 | 836 | found_key.objectid != BTRFS_EXTENT_CSUM_OBJECTID || |
0b246afa | 837 | csum_offset >= MAX_CSUM_ITEMS(fs_info, csum_size)) { |
6567e837 CM |
838 | goto insert; |
839 | } | |
459931ec | 840 | |
2f697dc6 | 841 | if (csum_offset == btrfs_item_size_nr(leaf, path->slots[0]) / |
607d432d | 842 | csum_size) { |
2f697dc6 LB |
843 | int extend_nr; |
844 | u64 tmp; | |
845 | u32 diff; | |
846 | u32 free_space; | |
459931ec | 847 | |
2ff7e61e | 848 | if (btrfs_leaf_free_space(fs_info, leaf) < |
2f697dc6 LB |
849 | sizeof(struct btrfs_item) + csum_size * 2) |
850 | goto insert; | |
851 | ||
2ff7e61e | 852 | free_space = btrfs_leaf_free_space(fs_info, leaf) - |
2f697dc6 | 853 | sizeof(struct btrfs_item) - csum_size; |
f51a4a18 | 854 | tmp = sums->len - total_bytes; |
0b246afa | 855 | tmp >>= fs_info->sb->s_blocksize_bits; |
2f697dc6 LB |
856 | WARN_ON(tmp < 1); |
857 | ||
858 | extend_nr = max_t(int, 1, (int)tmp); | |
859 | diff = (csum_offset + extend_nr) * csum_size; | |
0b246afa JM |
860 | diff = min(diff, |
861 | MAX_CSUM_ITEMS(fs_info, csum_size) * csum_size); | |
459931ec | 862 | |
5f39d397 | 863 | diff = diff - btrfs_item_size_nr(leaf, path->slots[0]); |
2f697dc6 LB |
864 | diff = min(free_space, diff); |
865 | diff /= csum_size; | |
866 | diff *= csum_size; | |
459931ec | 867 | |
2ff7e61e | 868 | btrfs_extend_item(fs_info, path, diff); |
f51a4a18 | 869 | ret = 0; |
6567e837 CM |
870 | goto csum; |
871 | } | |
872 | ||
873 | insert: | |
b3b4aa74 | 874 | btrfs_release_path(path); |
6567e837 | 875 | csum_offset = 0; |
f578d4bd | 876 | if (found_next) { |
2f697dc6 | 877 | u64 tmp; |
d20f7043 | 878 | |
f51a4a18 | 879 | tmp = sums->len - total_bytes; |
0b246afa | 880 | tmp >>= fs_info->sb->s_blocksize_bits; |
2f697dc6 | 881 | tmp = min(tmp, (next_offset - file_key.offset) >> |
0b246afa | 882 | fs_info->sb->s_blocksize_bits); |
2f697dc6 | 883 | |
50d0446e SK |
884 | tmp = max_t(u64, 1, tmp); |
885 | tmp = min_t(u64, tmp, MAX_CSUM_ITEMS(fs_info, csum_size)); | |
607d432d | 886 | ins_size = csum_size * tmp; |
f578d4bd | 887 | } else { |
607d432d | 888 | ins_size = csum_size; |
f578d4bd | 889 | } |
b9473439 | 890 | path->leave_spinning = 1; |
5caf2a00 | 891 | ret = btrfs_insert_empty_item(trans, root, path, &file_key, |
f578d4bd | 892 | ins_size); |
b9473439 | 893 | path->leave_spinning = 0; |
54aa1f4d | 894 | if (ret < 0) |
53863232 | 895 | goto fail_unlock; |
fae7f21c | 896 | if (WARN_ON(ret != 0)) |
53863232 | 897 | goto fail_unlock; |
5f39d397 | 898 | leaf = path->nodes[0]; |
f51a4a18 | 899 | csum: |
5f39d397 | 900 | item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item); |
f51a4a18 MX |
901 | item_end = (struct btrfs_csum_item *)((unsigned char *)item + |
902 | btrfs_item_size_nr(leaf, path->slots[0])); | |
509659cd | 903 | item = (struct btrfs_csum_item *)((unsigned char *)item + |
607d432d | 904 | csum_offset * csum_size); |
b18c6685 | 905 | found: |
f51a4a18 | 906 | ins_size = (u32)(sums->len - total_bytes) >> |
0b246afa | 907 | fs_info->sb->s_blocksize_bits; |
f51a4a18 MX |
908 | ins_size *= csum_size; |
909 | ins_size = min_t(u32, (unsigned long)item_end - (unsigned long)item, | |
910 | ins_size); | |
911 | write_extent_buffer(leaf, sums->sums + index, (unsigned long)item, | |
912 | ins_size); | |
913 | ||
914 | ins_size /= csum_size; | |
0b246afa | 915 | total_bytes += ins_size * fs_info->sectorsize; |
f51a4a18 | 916 | index += ins_size; |
a6591715 | 917 | |
5caf2a00 | 918 | btrfs_mark_buffer_dirty(path->nodes[0]); |
e6dcd2dc | 919 | if (total_bytes < sums->len) { |
b3b4aa74 | 920 | btrfs_release_path(path); |
b9473439 | 921 | cond_resched(); |
065631f6 CM |
922 | goto again; |
923 | } | |
53863232 | 924 | out: |
5caf2a00 | 925 | btrfs_free_path(path); |
f254e52c | 926 | return ret; |
53863232 CM |
927 | |
928 | fail_unlock: | |
53863232 | 929 | goto out; |
f254e52c | 930 | } |
7ffbb598 | 931 | |
9cdc5124 | 932 | void btrfs_extent_item_to_extent_map(struct btrfs_inode *inode, |
7ffbb598 FM |
933 | const struct btrfs_path *path, |
934 | struct btrfs_file_extent_item *fi, | |
935 | const bool new_inline, | |
936 | struct extent_map *em) | |
937 | { | |
9cdc5124 NB |
938 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->vfs_inode.i_sb); |
939 | struct btrfs_root *root = inode->root; | |
7ffbb598 FM |
940 | struct extent_buffer *leaf = path->nodes[0]; |
941 | const int slot = path->slots[0]; | |
942 | struct btrfs_key key; | |
943 | u64 extent_start, extent_end; | |
944 | u64 bytenr; | |
945 | u8 type = btrfs_file_extent_type(leaf, fi); | |
946 | int compress_type = btrfs_file_extent_compression(leaf, fi); | |
947 | ||
0b246afa | 948 | em->bdev = fs_info->fs_devices->latest_bdev; |
7ffbb598 FM |
949 | btrfs_item_key_to_cpu(leaf, &key, slot); |
950 | extent_start = key.offset; | |
951 | ||
952 | if (type == BTRFS_FILE_EXTENT_REG || | |
953 | type == BTRFS_FILE_EXTENT_PREALLOC) { | |
954 | extent_end = extent_start + | |
955 | btrfs_file_extent_num_bytes(leaf, fi); | |
956 | } else if (type == BTRFS_FILE_EXTENT_INLINE) { | |
957 | size_t size; | |
958 | size = btrfs_file_extent_inline_len(leaf, slot, fi); | |
da17066c | 959 | extent_end = ALIGN(extent_start + size, |
0b246afa | 960 | fs_info->sectorsize); |
7ffbb598 FM |
961 | } |
962 | ||
963 | em->ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi); | |
964 | if (type == BTRFS_FILE_EXTENT_REG || | |
965 | type == BTRFS_FILE_EXTENT_PREALLOC) { | |
966 | em->start = extent_start; | |
967 | em->len = extent_end - extent_start; | |
968 | em->orig_start = extent_start - | |
969 | btrfs_file_extent_offset(leaf, fi); | |
970 | em->orig_block_len = btrfs_file_extent_disk_num_bytes(leaf, fi); | |
971 | bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); | |
972 | if (bytenr == 0) { | |
973 | em->block_start = EXTENT_MAP_HOLE; | |
974 | return; | |
975 | } | |
976 | if (compress_type != BTRFS_COMPRESS_NONE) { | |
977 | set_bit(EXTENT_FLAG_COMPRESSED, &em->flags); | |
978 | em->compress_type = compress_type; | |
979 | em->block_start = bytenr; | |
980 | em->block_len = em->orig_block_len; | |
981 | } else { | |
982 | bytenr += btrfs_file_extent_offset(leaf, fi); | |
983 | em->block_start = bytenr; | |
984 | em->block_len = em->len; | |
985 | if (type == BTRFS_FILE_EXTENT_PREALLOC) | |
986 | set_bit(EXTENT_FLAG_PREALLOC, &em->flags); | |
987 | } | |
988 | } else if (type == BTRFS_FILE_EXTENT_INLINE) { | |
989 | em->block_start = EXTENT_MAP_INLINE; | |
990 | em->start = extent_start; | |
991 | em->len = extent_end - extent_start; | |
992 | /* | |
993 | * Initialize orig_start and block_len with the same values | |
994 | * as in inode.c:btrfs_get_extent(). | |
995 | */ | |
996 | em->orig_start = EXTENT_MAP_HOLE; | |
997 | em->block_len = (u64)-1; | |
998 | if (!new_inline && compress_type != BTRFS_COMPRESS_NONE) { | |
999 | set_bit(EXTENT_FLAG_COMPRESSED, &em->flags); | |
1000 | em->compress_type = compress_type; | |
1001 | } | |
1002 | } else { | |
0b246afa | 1003 | btrfs_err(fs_info, |
9cdc5124 NB |
1004 | "unknown file extent item type %d, inode %llu, offset %llu, " |
1005 | "root %llu", type, btrfs_ino(inode), extent_start, | |
7ffbb598 FM |
1006 | root->root_key.objectid); |
1007 | } | |
1008 | } |