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