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" |
1de037a4 | 26 | #include "print-tree.h" |
1e1d2701 | 27 | |
d397712b | 28 | #define MAX_CSUM_ITEMS(r, size) ((((BTRFS_LEAF_DATA_SIZE(r) - \ |
607d432d JB |
29 | sizeof(struct btrfs_item) * 2) / \ |
30 | size) - 1)) | |
07d400a6 YZ |
31 | |
32 | #define MAX_ORDERED_SUM_BYTES(r) ((PAGE_SIZE - \ | |
33 | sizeof(struct btrfs_ordered_sum)) / \ | |
34 | sizeof(struct btrfs_sector_sum) * \ | |
35 | (r)->sectorsize - (r)->sectorsize) | |
36 | ||
b18c6685 | 37 | int btrfs_insert_file_extent(struct btrfs_trans_handle *trans, |
f2eb0a24 SW |
38 | struct btrfs_root *root, |
39 | u64 objectid, u64 pos, | |
40 | u64 disk_offset, u64 disk_num_bytes, | |
c8b97818 CM |
41 | u64 num_bytes, u64 offset, u64 ram_bytes, |
42 | u8 compression, u8 encryption, u16 other_encoding) | |
9f5fae2f | 43 | { |
dee26a9f CM |
44 | int ret = 0; |
45 | struct btrfs_file_extent_item *item; | |
46 | struct btrfs_key file_key; | |
5caf2a00 | 47 | struct btrfs_path *path; |
5f39d397 | 48 | struct extent_buffer *leaf; |
dee26a9f | 49 | |
5caf2a00 | 50 | path = btrfs_alloc_path(); |
db5b493a TI |
51 | if (!path) |
52 | return -ENOMEM; | |
dee26a9f | 53 | file_key.objectid = objectid; |
b18c6685 | 54 | file_key.offset = pos; |
dee26a9f CM |
55 | btrfs_set_key_type(&file_key, BTRFS_EXTENT_DATA_KEY); |
56 | ||
b9473439 | 57 | path->leave_spinning = 1; |
5caf2a00 | 58 | ret = btrfs_insert_empty_item(trans, root, path, &file_key, |
dee26a9f | 59 | sizeof(*item)); |
54aa1f4d CM |
60 | if (ret < 0) |
61 | goto out; | |
9773a788 | 62 | BUG_ON(ret); |
5f39d397 CM |
63 | leaf = path->nodes[0]; |
64 | item = btrfs_item_ptr(leaf, path->slots[0], | |
dee26a9f | 65 | struct btrfs_file_extent_item); |
f2eb0a24 | 66 | btrfs_set_file_extent_disk_bytenr(leaf, item, disk_offset); |
db94535d | 67 | btrfs_set_file_extent_disk_num_bytes(leaf, item, disk_num_bytes); |
f2eb0a24 | 68 | btrfs_set_file_extent_offset(leaf, item, offset); |
db94535d | 69 | btrfs_set_file_extent_num_bytes(leaf, item, num_bytes); |
c8b97818 | 70 | btrfs_set_file_extent_ram_bytes(leaf, item, ram_bytes); |
5f39d397 CM |
71 | btrfs_set_file_extent_generation(leaf, item, trans->transid); |
72 | btrfs_set_file_extent_type(leaf, item, BTRFS_FILE_EXTENT_REG); | |
c8b97818 CM |
73 | btrfs_set_file_extent_compression(leaf, item, compression); |
74 | btrfs_set_file_extent_encryption(leaf, item, encryption); | |
75 | btrfs_set_file_extent_other_encoding(leaf, item, other_encoding); | |
76 | ||
5f39d397 | 77 | btrfs_mark_buffer_dirty(leaf); |
54aa1f4d | 78 | out: |
5caf2a00 | 79 | btrfs_free_path(path); |
54aa1f4d | 80 | return ret; |
9f5fae2f | 81 | } |
dee26a9f | 82 | |
b18c6685 CM |
83 | struct btrfs_csum_item *btrfs_lookup_csum(struct btrfs_trans_handle *trans, |
84 | struct btrfs_root *root, | |
85 | struct btrfs_path *path, | |
d20f7043 | 86 | u64 bytenr, int cow) |
6567e837 CM |
87 | { |
88 | int ret; | |
89 | struct btrfs_key file_key; | |
90 | struct btrfs_key found_key; | |
91 | struct btrfs_csum_item *item; | |
5f39d397 | 92 | struct extent_buffer *leaf; |
6567e837 | 93 | u64 csum_offset = 0; |
607d432d JB |
94 | u16 csum_size = |
95 | btrfs_super_csum_size(&root->fs_info->super_copy); | |
a429e513 | 96 | int csums_in_item; |
6567e837 | 97 | |
d20f7043 CM |
98 | file_key.objectid = BTRFS_EXTENT_CSUM_OBJECTID; |
99 | file_key.offset = bytenr; | |
100 | btrfs_set_key_type(&file_key, BTRFS_EXTENT_CSUM_KEY); | |
b18c6685 | 101 | ret = btrfs_search_slot(trans, root, &file_key, path, 0, cow); |
6567e837 CM |
102 | if (ret < 0) |
103 | goto fail; | |
5f39d397 | 104 | leaf = path->nodes[0]; |
6567e837 CM |
105 | if (ret > 0) { |
106 | ret = 1; | |
70b2befd | 107 | if (path->slots[0] == 0) |
6567e837 CM |
108 | goto fail; |
109 | path->slots[0]--; | |
5f39d397 | 110 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
d20f7043 | 111 | if (btrfs_key_type(&found_key) != BTRFS_EXTENT_CSUM_KEY) |
6567e837 | 112 | goto fail; |
d20f7043 CM |
113 | |
114 | csum_offset = (bytenr - found_key.offset) >> | |
6567e837 | 115 | root->fs_info->sb->s_blocksize_bits; |
5f39d397 | 116 | csums_in_item = btrfs_item_size_nr(leaf, path->slots[0]); |
607d432d | 117 | csums_in_item /= csum_size; |
a429e513 CM |
118 | |
119 | if (csum_offset >= csums_in_item) { | |
120 | ret = -EFBIG; | |
6567e837 CM |
121 | goto fail; |
122 | } | |
123 | } | |
124 | item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item); | |
509659cd | 125 | item = (struct btrfs_csum_item *)((unsigned char *)item + |
607d432d | 126 | csum_offset * csum_size); |
6567e837 CM |
127 | return item; |
128 | fail: | |
129 | if (ret > 0) | |
b18c6685 | 130 | ret = -ENOENT; |
6567e837 CM |
131 | return ERR_PTR(ret); |
132 | } | |
133 | ||
134 | ||
dee26a9f CM |
135 | int btrfs_lookup_file_extent(struct btrfs_trans_handle *trans, |
136 | struct btrfs_root *root, | |
137 | struct btrfs_path *path, u64 objectid, | |
9773a788 | 138 | u64 offset, int mod) |
dee26a9f CM |
139 | { |
140 | int ret; | |
141 | struct btrfs_key file_key; | |
142 | int ins_len = mod < 0 ? -1 : 0; | |
143 | int cow = mod != 0; | |
144 | ||
145 | file_key.objectid = objectid; | |
70b2befd | 146 | file_key.offset = offset; |
dee26a9f CM |
147 | btrfs_set_key_type(&file_key, BTRFS_EXTENT_DATA_KEY); |
148 | ret = btrfs_search_slot(trans, root, &file_key, path, ins_len, cow); | |
149 | return ret; | |
150 | } | |
f254e52c | 151 | |
17d217fe | 152 | |
4b46fce2 JB |
153 | static int __btrfs_lookup_bio_sums(struct btrfs_root *root, |
154 | struct inode *inode, struct bio *bio, | |
155 | u64 logical_offset, u32 *dst, int dio) | |
61b49440 CM |
156 | { |
157 | u32 sum; | |
158 | struct bio_vec *bvec = bio->bi_io_vec; | |
159 | int bio_index = 0; | |
4b46fce2 | 160 | u64 offset = 0; |
61b49440 CM |
161 | u64 item_start_offset = 0; |
162 | u64 item_last_offset = 0; | |
d20f7043 | 163 | u64 disk_bytenr; |
61b49440 | 164 | u32 diff; |
607d432d JB |
165 | u16 csum_size = |
166 | btrfs_super_csum_size(&root->fs_info->super_copy); | |
61b49440 CM |
167 | int ret; |
168 | struct btrfs_path *path; | |
169 | struct btrfs_csum_item *item = NULL; | |
170 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; | |
171 | ||
172 | path = btrfs_alloc_path(); | |
c2db1073 TI |
173 | if (!path) |
174 | return -ENOMEM; | |
4d1b5fb4 CM |
175 | if (bio->bi_size > PAGE_CACHE_SIZE * 8) |
176 | path->reada = 2; | |
61b49440 CM |
177 | |
178 | WARN_ON(bio->bi_vcnt <= 0); | |
179 | ||
d20f7043 | 180 | disk_bytenr = (u64)bio->bi_sector << 9; |
4b46fce2 JB |
181 | if (dio) |
182 | offset = logical_offset; | |
d397712b | 183 | while (bio_index < bio->bi_vcnt) { |
4b46fce2 JB |
184 | if (!dio) |
185 | offset = page_offset(bvec->bv_page) + bvec->bv_offset; | |
d20f7043 | 186 | ret = btrfs_find_ordered_sum(inode, offset, disk_bytenr, &sum); |
61b49440 CM |
187 | if (ret == 0) |
188 | goto found; | |
189 | ||
d20f7043 CM |
190 | if (!item || disk_bytenr < item_start_offset || |
191 | disk_bytenr >= item_last_offset) { | |
61b49440 CM |
192 | struct btrfs_key found_key; |
193 | u32 item_size; | |
194 | ||
195 | if (item) | |
196 | btrfs_release_path(root, path); | |
d20f7043 CM |
197 | item = btrfs_lookup_csum(NULL, root->fs_info->csum_root, |
198 | path, disk_bytenr, 0); | |
61b49440 CM |
199 | if (IS_ERR(item)) { |
200 | ret = PTR_ERR(item); | |
201 | if (ret == -ENOENT || ret == -EFBIG) | |
202 | ret = 0; | |
203 | sum = 0; | |
17d217fe YZ |
204 | if (BTRFS_I(inode)->root->root_key.objectid == |
205 | BTRFS_DATA_RELOC_TREE_OBJECTID) { | |
206 | set_extent_bits(io_tree, offset, | |
207 | offset + bvec->bv_len - 1, | |
208 | EXTENT_NODATASUM, GFP_NOFS); | |
209 | } else { | |
d397712b CM |
210 | printk(KERN_INFO "btrfs no csum found " |
211 | "for inode %lu start %llu\n", | |
212 | inode->i_ino, | |
17d217fe YZ |
213 | (unsigned long long)offset); |
214 | } | |
6dab8157 | 215 | item = NULL; |
39be25cd | 216 | btrfs_release_path(root, path); |
61b49440 CM |
217 | goto found; |
218 | } | |
219 | btrfs_item_key_to_cpu(path->nodes[0], &found_key, | |
220 | path->slots[0]); | |
221 | ||
222 | item_start_offset = found_key.offset; | |
223 | item_size = btrfs_item_size_nr(path->nodes[0], | |
224 | path->slots[0]); | |
225 | item_last_offset = item_start_offset + | |
607d432d | 226 | (item_size / csum_size) * |
61b49440 CM |
227 | root->sectorsize; |
228 | item = btrfs_item_ptr(path->nodes[0], path->slots[0], | |
229 | struct btrfs_csum_item); | |
230 | } | |
231 | /* | |
232 | * this byte range must be able to fit inside | |
233 | * a single leaf so it will also fit inside a u32 | |
234 | */ | |
d20f7043 | 235 | diff = disk_bytenr - item_start_offset; |
61b49440 | 236 | diff = diff / root->sectorsize; |
607d432d | 237 | diff = diff * csum_size; |
61b49440 CM |
238 | |
239 | read_extent_buffer(path->nodes[0], &sum, | |
3de9d6b6 | 240 | ((unsigned long)item) + diff, |
607d432d | 241 | csum_size); |
61b49440 | 242 | found: |
d20f7043 CM |
243 | if (dst) |
244 | *dst++ = sum; | |
245 | else | |
246 | set_state_private(io_tree, offset, sum); | |
247 | disk_bytenr += bvec->bv_len; | |
4b46fce2 | 248 | offset += bvec->bv_len; |
61b49440 CM |
249 | bio_index++; |
250 | bvec++; | |
251 | } | |
252 | btrfs_free_path(path); | |
253 | return 0; | |
254 | } | |
255 | ||
4b46fce2 JB |
256 | int btrfs_lookup_bio_sums(struct btrfs_root *root, struct inode *inode, |
257 | struct bio *bio, u32 *dst) | |
258 | { | |
259 | return __btrfs_lookup_bio_sums(root, inode, bio, 0, dst, 0); | |
260 | } | |
261 | ||
262 | int btrfs_lookup_bio_sums_dio(struct btrfs_root *root, struct inode *inode, | |
263 | struct bio *bio, u64 offset, u32 *dst) | |
264 | { | |
265 | return __btrfs_lookup_bio_sums(root, inode, bio, offset, dst, 1); | |
266 | } | |
267 | ||
17d217fe YZ |
268 | int btrfs_lookup_csums_range(struct btrfs_root *root, u64 start, u64 end, |
269 | struct list_head *list) | |
270 | { | |
271 | struct btrfs_key key; | |
272 | struct btrfs_path *path; | |
273 | struct extent_buffer *leaf; | |
274 | struct btrfs_ordered_sum *sums; | |
275 | struct btrfs_sector_sum *sector_sum; | |
276 | struct btrfs_csum_item *item; | |
277 | unsigned long offset; | |
278 | int ret; | |
279 | size_t size; | |
280 | u64 csum_end; | |
281 | u16 csum_size = btrfs_super_csum_size(&root->fs_info->super_copy); | |
282 | ||
283 | path = btrfs_alloc_path(); | |
284 | BUG_ON(!path); | |
285 | ||
286 | key.objectid = BTRFS_EXTENT_CSUM_OBJECTID; | |
287 | key.offset = start; | |
288 | key.type = BTRFS_EXTENT_CSUM_KEY; | |
289 | ||
07d400a6 | 290 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
17d217fe YZ |
291 | if (ret < 0) |
292 | goto fail; | |
293 | if (ret > 0 && path->slots[0] > 0) { | |
294 | leaf = path->nodes[0]; | |
295 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1); | |
296 | if (key.objectid == BTRFS_EXTENT_CSUM_OBJECTID && | |
297 | key.type == BTRFS_EXTENT_CSUM_KEY) { | |
298 | offset = (start - key.offset) >> | |
299 | root->fs_info->sb->s_blocksize_bits; | |
300 | if (offset * csum_size < | |
301 | btrfs_item_size_nr(leaf, path->slots[0] - 1)) | |
302 | path->slots[0]--; | |
303 | } | |
304 | } | |
305 | ||
306 | while (start <= end) { | |
307 | leaf = path->nodes[0]; | |
308 | if (path->slots[0] >= btrfs_header_nritems(leaf)) { | |
07d400a6 | 309 | ret = btrfs_next_leaf(root, path); |
17d217fe YZ |
310 | if (ret < 0) |
311 | goto fail; | |
312 | if (ret > 0) | |
313 | break; | |
314 | leaf = path->nodes[0]; | |
315 | } | |
316 | ||
317 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
318 | if (key.objectid != BTRFS_EXTENT_CSUM_OBJECTID || | |
319 | key.type != BTRFS_EXTENT_CSUM_KEY) | |
320 | break; | |
321 | ||
322 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
323 | if (key.offset > end) | |
324 | break; | |
325 | ||
326 | if (key.offset > start) | |
327 | start = key.offset; | |
328 | ||
329 | size = btrfs_item_size_nr(leaf, path->slots[0]); | |
330 | csum_end = key.offset + (size / csum_size) * root->sectorsize; | |
87b29b20 YZ |
331 | if (csum_end <= start) { |
332 | path->slots[0]++; | |
333 | continue; | |
334 | } | |
17d217fe | 335 | |
07d400a6 | 336 | csum_end = min(csum_end, end + 1); |
17d217fe YZ |
337 | item = btrfs_item_ptr(path->nodes[0], path->slots[0], |
338 | struct btrfs_csum_item); | |
07d400a6 YZ |
339 | while (start < csum_end) { |
340 | size = min_t(size_t, csum_end - start, | |
341 | MAX_ORDERED_SUM_BYTES(root)); | |
342 | sums = kzalloc(btrfs_ordered_sum_size(root, size), | |
343 | GFP_NOFS); | |
344 | BUG_ON(!sums); | |
17d217fe | 345 | |
07d400a6 YZ |
346 | sector_sum = sums->sums; |
347 | sums->bytenr = start; | |
348 | sums->len = size; | |
349 | ||
350 | offset = (start - key.offset) >> | |
351 | root->fs_info->sb->s_blocksize_bits; | |
352 | offset *= csum_size; | |
353 | ||
354 | while (size > 0) { | |
355 | read_extent_buffer(path->nodes[0], | |
356 | §or_sum->sum, | |
357 | ((unsigned long)item) + | |
358 | offset, csum_size); | |
359 | sector_sum->bytenr = start; | |
360 | ||
361 | size -= root->sectorsize; | |
362 | start += root->sectorsize; | |
363 | offset += csum_size; | |
364 | sector_sum++; | |
365 | } | |
366 | list_add_tail(&sums->list, list); | |
367 | } | |
17d217fe YZ |
368 | path->slots[0]++; |
369 | } | |
370 | ret = 0; | |
371 | fail: | |
372 | btrfs_free_path(path); | |
373 | return ret; | |
374 | } | |
375 | ||
3edf7d33 | 376 | int btrfs_csum_one_bio(struct btrfs_root *root, struct inode *inode, |
d20f7043 | 377 | struct bio *bio, u64 file_start, int contig) |
e015640f | 378 | { |
e6dcd2dc CM |
379 | struct btrfs_ordered_sum *sums; |
380 | struct btrfs_sector_sum *sector_sum; | |
3edf7d33 | 381 | struct btrfs_ordered_extent *ordered; |
e015640f CM |
382 | char *data; |
383 | struct bio_vec *bvec = bio->bi_io_vec; | |
384 | int bio_index = 0; | |
3edf7d33 CM |
385 | unsigned long total_bytes = 0; |
386 | unsigned long this_sum_bytes = 0; | |
387 | u64 offset; | |
d20f7043 | 388 | u64 disk_bytenr; |
e015640f | 389 | |
e6dcd2dc CM |
390 | WARN_ON(bio->bi_vcnt <= 0); |
391 | sums = kzalloc(btrfs_ordered_sum_size(root, bio->bi_size), GFP_NOFS); | |
e015640f CM |
392 | if (!sums) |
393 | return -ENOMEM; | |
3edf7d33 | 394 | |
ed98b56a | 395 | sector_sum = sums->sums; |
d20f7043 | 396 | disk_bytenr = (u64)bio->bi_sector << 9; |
e6dcd2dc CM |
397 | sums->len = bio->bi_size; |
398 | INIT_LIST_HEAD(&sums->list); | |
d20f7043 CM |
399 | |
400 | if (contig) | |
401 | offset = file_start; | |
402 | else | |
403 | offset = page_offset(bvec->bv_page) + bvec->bv_offset; | |
404 | ||
405 | ordered = btrfs_lookup_ordered_extent(inode, offset); | |
3edf7d33 | 406 | BUG_ON(!ordered); |
d20f7043 | 407 | sums->bytenr = ordered->start; |
e015640f | 408 | |
d397712b | 409 | while (bio_index < bio->bi_vcnt) { |
d20f7043 CM |
410 | if (!contig) |
411 | offset = page_offset(bvec->bv_page) + bvec->bv_offset; | |
412 | ||
413 | if (!contig && (offset >= ordered->file_offset + ordered->len || | |
414 | offset < ordered->file_offset)) { | |
3edf7d33 CM |
415 | unsigned long bytes_left; |
416 | sums->len = this_sum_bytes; | |
417 | this_sum_bytes = 0; | |
418 | btrfs_add_ordered_sum(inode, ordered, sums); | |
419 | btrfs_put_ordered_extent(ordered); | |
420 | ||
421 | bytes_left = bio->bi_size - total_bytes; | |
422 | ||
423 | sums = kzalloc(btrfs_ordered_sum_size(root, bytes_left), | |
424 | GFP_NOFS); | |
425 | BUG_ON(!sums); | |
ed98b56a | 426 | sector_sum = sums->sums; |
3edf7d33 | 427 | sums->len = bytes_left; |
d20f7043 | 428 | ordered = btrfs_lookup_ordered_extent(inode, offset); |
3edf7d33 | 429 | BUG_ON(!ordered); |
d20f7043 | 430 | sums->bytenr = ordered->start; |
3edf7d33 CM |
431 | } |
432 | ||
e015640f | 433 | data = kmap_atomic(bvec->bv_page, KM_USER0); |
e6dcd2dc CM |
434 | sector_sum->sum = ~(u32)0; |
435 | sector_sum->sum = btrfs_csum_data(root, | |
436 | data + bvec->bv_offset, | |
437 | sector_sum->sum, | |
438 | bvec->bv_len); | |
e015640f | 439 | kunmap_atomic(data, KM_USER0); |
e6dcd2dc CM |
440 | btrfs_csum_final(sector_sum->sum, |
441 | (char *)§or_sum->sum); | |
d20f7043 | 442 | sector_sum->bytenr = disk_bytenr; |
ed98b56a | 443 | |
e6dcd2dc | 444 | sector_sum++; |
e015640f | 445 | bio_index++; |
3edf7d33 CM |
446 | total_bytes += bvec->bv_len; |
447 | this_sum_bytes += bvec->bv_len; | |
d20f7043 CM |
448 | disk_bytenr += bvec->bv_len; |
449 | offset += bvec->bv_len; | |
e015640f CM |
450 | bvec++; |
451 | } | |
ed98b56a | 452 | this_sum_bytes = 0; |
3edf7d33 CM |
453 | btrfs_add_ordered_sum(inode, ordered, sums); |
454 | btrfs_put_ordered_extent(ordered); | |
e015640f CM |
455 | return 0; |
456 | } | |
457 | ||
459931ec CM |
458 | /* |
459 | * helper function for csum removal, this expects the | |
460 | * key to describe the csum pointed to by the path, and it expects | |
461 | * the csum to overlap the range [bytenr, len] | |
462 | * | |
463 | * The csum should not be entirely contained in the range and the | |
464 | * range should not be entirely contained in the csum. | |
465 | * | |
466 | * This calls btrfs_truncate_item with the correct args based on the | |
467 | * overlap, and fixes up the key as required. | |
468 | */ | |
469 | static noinline int truncate_one_csum(struct btrfs_trans_handle *trans, | |
470 | struct btrfs_root *root, | |
471 | struct btrfs_path *path, | |
472 | struct btrfs_key *key, | |
473 | u64 bytenr, u64 len) | |
474 | { | |
475 | struct extent_buffer *leaf; | |
476 | u16 csum_size = | |
477 | btrfs_super_csum_size(&root->fs_info->super_copy); | |
478 | u64 csum_end; | |
479 | u64 end_byte = bytenr + len; | |
480 | u32 blocksize_bits = root->fs_info->sb->s_blocksize_bits; | |
481 | int ret; | |
482 | ||
483 | leaf = path->nodes[0]; | |
484 | csum_end = btrfs_item_size_nr(leaf, path->slots[0]) / csum_size; | |
485 | csum_end <<= root->fs_info->sb->s_blocksize_bits; | |
486 | csum_end += key->offset; | |
487 | ||
488 | if (key->offset < bytenr && csum_end <= end_byte) { | |
489 | /* | |
490 | * [ bytenr - len ] | |
491 | * [ ] | |
492 | * [csum ] | |
493 | * A simple truncate off the end of the item | |
494 | */ | |
495 | u32 new_size = (bytenr - key->offset) >> blocksize_bits; | |
496 | new_size *= csum_size; | |
497 | ret = btrfs_truncate_item(trans, root, path, new_size, 1); | |
498 | BUG_ON(ret); | |
499 | } else if (key->offset >= bytenr && csum_end > end_byte && | |
500 | end_byte > key->offset) { | |
501 | /* | |
502 | * [ bytenr - len ] | |
503 | * [ ] | |
504 | * [csum ] | |
505 | * we need to truncate from the beginning of the csum | |
506 | */ | |
507 | u32 new_size = (csum_end - end_byte) >> blocksize_bits; | |
508 | new_size *= csum_size; | |
509 | ||
510 | ret = btrfs_truncate_item(trans, root, path, new_size, 0); | |
511 | BUG_ON(ret); | |
512 | ||
513 | key->offset = end_byte; | |
514 | ret = btrfs_set_item_key_safe(trans, root, path, key); | |
515 | BUG_ON(ret); | |
516 | } else { | |
517 | BUG(); | |
518 | } | |
519 | return 0; | |
520 | } | |
521 | ||
522 | /* | |
523 | * deletes the csum items from the csum tree for a given | |
524 | * range of bytes. | |
525 | */ | |
526 | int btrfs_del_csums(struct btrfs_trans_handle *trans, | |
527 | struct btrfs_root *root, u64 bytenr, u64 len) | |
528 | { | |
529 | struct btrfs_path *path; | |
530 | struct btrfs_key key; | |
531 | u64 end_byte = bytenr + len; | |
532 | u64 csum_end; | |
533 | struct extent_buffer *leaf; | |
534 | int ret; | |
535 | u16 csum_size = | |
536 | btrfs_super_csum_size(&root->fs_info->super_copy); | |
537 | int blocksize_bits = root->fs_info->sb->s_blocksize_bits; | |
538 | ||
539 | root = root->fs_info->csum_root; | |
540 | ||
541 | path = btrfs_alloc_path(); | |
2a29edc6 | 542 | if (!path) |
543 | return -ENOMEM; | |
459931ec | 544 | |
d397712b | 545 | while (1) { |
459931ec CM |
546 | key.objectid = BTRFS_EXTENT_CSUM_OBJECTID; |
547 | key.offset = end_byte - 1; | |
548 | key.type = BTRFS_EXTENT_CSUM_KEY; | |
549 | ||
b9473439 | 550 | path->leave_spinning = 1; |
459931ec CM |
551 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); |
552 | if (ret > 0) { | |
553 | if (path->slots[0] == 0) | |
554 | goto out; | |
555 | path->slots[0]--; | |
ad0397a7 JB |
556 | } else if (ret < 0) { |
557 | goto out; | |
459931ec | 558 | } |
ad0397a7 | 559 | |
459931ec CM |
560 | leaf = path->nodes[0]; |
561 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
562 | ||
563 | if (key.objectid != BTRFS_EXTENT_CSUM_OBJECTID || | |
564 | key.type != BTRFS_EXTENT_CSUM_KEY) { | |
565 | break; | |
566 | } | |
567 | ||
568 | if (key.offset >= end_byte) | |
569 | break; | |
570 | ||
571 | csum_end = btrfs_item_size_nr(leaf, path->slots[0]) / csum_size; | |
572 | csum_end <<= blocksize_bits; | |
573 | csum_end += key.offset; | |
574 | ||
575 | /* this csum ends before we start, we're done */ | |
576 | if (csum_end <= bytenr) | |
577 | break; | |
578 | ||
579 | /* delete the entire item, it is inside our range */ | |
580 | if (key.offset >= bytenr && csum_end <= end_byte) { | |
581 | ret = btrfs_del_item(trans, root, path); | |
582 | BUG_ON(ret); | |
dcbdd4dc CM |
583 | if (key.offset == bytenr) |
584 | break; | |
459931ec CM |
585 | } else if (key.offset < bytenr && csum_end > end_byte) { |
586 | unsigned long offset; | |
587 | unsigned long shift_len; | |
588 | unsigned long item_offset; | |
589 | /* | |
590 | * [ bytenr - len ] | |
591 | * [csum ] | |
592 | * | |
593 | * Our bytes are in the middle of the csum, | |
594 | * we need to split this item and insert a new one. | |
595 | * | |
596 | * But we can't drop the path because the | |
597 | * csum could change, get removed, extended etc. | |
598 | * | |
599 | * The trick here is the max size of a csum item leaves | |
600 | * enough room in the tree block for a single | |
601 | * item header. So, we split the item in place, | |
602 | * adding a new header pointing to the existing | |
603 | * bytes. Then we loop around again and we have | |
604 | * a nicely formed csum item that we can neatly | |
605 | * truncate. | |
606 | */ | |
607 | offset = (bytenr - key.offset) >> blocksize_bits; | |
608 | offset *= csum_size; | |
609 | ||
610 | shift_len = (len >> blocksize_bits) * csum_size; | |
611 | ||
612 | item_offset = btrfs_item_ptr_offset(leaf, | |
613 | path->slots[0]); | |
614 | ||
615 | memset_extent_buffer(leaf, 0, item_offset + offset, | |
616 | shift_len); | |
617 | key.offset = bytenr; | |
618 | ||
619 | /* | |
620 | * btrfs_split_item returns -EAGAIN when the | |
621 | * item changed size or key | |
622 | */ | |
623 | ret = btrfs_split_item(trans, root, path, &key, offset); | |
624 | BUG_ON(ret && ret != -EAGAIN); | |
625 | ||
626 | key.offset = end_byte - 1; | |
627 | } else { | |
628 | ret = truncate_one_csum(trans, root, path, | |
629 | &key, bytenr, len); | |
630 | BUG_ON(ret); | |
dcbdd4dc CM |
631 | if (key.offset < bytenr) |
632 | break; | |
459931ec CM |
633 | } |
634 | btrfs_release_path(root, path); | |
635 | } | |
636 | out: | |
637 | btrfs_free_path(path); | |
638 | return 0; | |
639 | } | |
640 | ||
065631f6 | 641 | int btrfs_csum_file_blocks(struct btrfs_trans_handle *trans, |
d20f7043 | 642 | struct btrfs_root *root, |
e6dcd2dc | 643 | struct btrfs_ordered_sum *sums) |
f254e52c | 644 | { |
d20f7043 | 645 | u64 bytenr; |
f254e52c CM |
646 | int ret; |
647 | struct btrfs_key file_key; | |
6567e837 | 648 | struct btrfs_key found_key; |
065631f6 | 649 | u64 next_offset; |
e6dcd2dc | 650 | u64 total_bytes = 0; |
065631f6 | 651 | int found_next; |
5caf2a00 | 652 | struct btrfs_path *path; |
f254e52c | 653 | struct btrfs_csum_item *item; |
065631f6 | 654 | struct btrfs_csum_item *item_end; |
ff79f819 | 655 | struct extent_buffer *leaf = NULL; |
6567e837 | 656 | u64 csum_offset; |
e6dcd2dc | 657 | struct btrfs_sector_sum *sector_sum; |
f578d4bd CM |
658 | u32 nritems; |
659 | u32 ins_size; | |
6e92f5e6 CM |
660 | char *eb_map; |
661 | char *eb_token; | |
662 | unsigned long map_len; | |
663 | unsigned long map_start; | |
607d432d JB |
664 | u16 csum_size = |
665 | btrfs_super_csum_size(&root->fs_info->super_copy); | |
6e92f5e6 | 666 | |
5caf2a00 CM |
667 | path = btrfs_alloc_path(); |
668 | BUG_ON(!path); | |
ed98b56a | 669 | sector_sum = sums->sums; |
065631f6 CM |
670 | again: |
671 | next_offset = (u64)-1; | |
672 | found_next = 0; | |
d20f7043 CM |
673 | file_key.objectid = BTRFS_EXTENT_CSUM_OBJECTID; |
674 | file_key.offset = sector_sum->bytenr; | |
675 | bytenr = sector_sum->bytenr; | |
676 | btrfs_set_key_type(&file_key, BTRFS_EXTENT_CSUM_KEY); | |
a429e513 | 677 | |
d20f7043 | 678 | item = btrfs_lookup_csum(trans, root, path, sector_sum->bytenr, 1); |
ff79f819 CM |
679 | if (!IS_ERR(item)) { |
680 | leaf = path->nodes[0]; | |
639cb586 | 681 | ret = 0; |
a429e513 | 682 | goto found; |
ff79f819 | 683 | } |
a429e513 | 684 | ret = PTR_ERR(item); |
4a500fd1 YZ |
685 | if (ret != -EFBIG && ret != -ENOENT) |
686 | goto fail_unlock; | |
687 | ||
a429e513 CM |
688 | if (ret == -EFBIG) { |
689 | u32 item_size; | |
690 | /* we found one, but it isn't big enough yet */ | |
5f39d397 CM |
691 | leaf = path->nodes[0]; |
692 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
607d432d JB |
693 | if ((item_size / csum_size) >= |
694 | MAX_CSUM_ITEMS(root, csum_size)) { | |
a429e513 CM |
695 | /* already at max size, make a new one */ |
696 | goto insert; | |
697 | } | |
698 | } else { | |
f578d4bd | 699 | int slot = path->slots[0] + 1; |
a429e513 | 700 | /* we didn't find a csum item, insert one */ |
f578d4bd CM |
701 | nritems = btrfs_header_nritems(path->nodes[0]); |
702 | if (path->slots[0] >= nritems - 1) { | |
703 | ret = btrfs_next_leaf(root, path); | |
b56baf5b | 704 | if (ret == 1) |
f578d4bd | 705 | found_next = 1; |
b56baf5b | 706 | if (ret != 0) |
f578d4bd | 707 | goto insert; |
b56baf5b | 708 | slot = 0; |
f578d4bd CM |
709 | } |
710 | btrfs_item_key_to_cpu(path->nodes[0], &found_key, slot); | |
d20f7043 CM |
711 | if (found_key.objectid != BTRFS_EXTENT_CSUM_OBJECTID || |
712 | found_key.type != BTRFS_EXTENT_CSUM_KEY) { | |
f578d4bd CM |
713 | found_next = 1; |
714 | goto insert; | |
715 | } | |
716 | next_offset = found_key.offset; | |
717 | found_next = 1; | |
a429e513 CM |
718 | goto insert; |
719 | } | |
720 | ||
721 | /* | |
722 | * at this point, we know the tree has an item, but it isn't big | |
723 | * enough yet to put our csum in. Grow it | |
724 | */ | |
725 | btrfs_release_path(root, path); | |
6567e837 | 726 | ret = btrfs_search_slot(trans, root, &file_key, path, |
607d432d | 727 | csum_size, 1); |
6567e837 | 728 | if (ret < 0) |
53863232 | 729 | goto fail_unlock; |
459931ec CM |
730 | |
731 | if (ret > 0) { | |
732 | if (path->slots[0] == 0) | |
733 | goto insert; | |
734 | path->slots[0]--; | |
6567e837 | 735 | } |
459931ec | 736 | |
5f39d397 CM |
737 | leaf = path->nodes[0]; |
738 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
d20f7043 | 739 | csum_offset = (bytenr - found_key.offset) >> |
6567e837 | 740 | root->fs_info->sb->s_blocksize_bits; |
459931ec | 741 | |
d20f7043 CM |
742 | if (btrfs_key_type(&found_key) != BTRFS_EXTENT_CSUM_KEY || |
743 | found_key.objectid != BTRFS_EXTENT_CSUM_OBJECTID || | |
607d432d | 744 | csum_offset >= MAX_CSUM_ITEMS(root, csum_size)) { |
6567e837 CM |
745 | goto insert; |
746 | } | |
459931ec | 747 | |
5f39d397 | 748 | if (csum_offset >= btrfs_item_size_nr(leaf, path->slots[0]) / |
607d432d JB |
749 | csum_size) { |
750 | u32 diff = (csum_offset + 1) * csum_size; | |
459931ec CM |
751 | |
752 | /* | |
753 | * is the item big enough already? we dropped our lock | |
754 | * before and need to recheck | |
755 | */ | |
756 | if (diff < btrfs_item_size_nr(leaf, path->slots[0])) | |
757 | goto csum; | |
758 | ||
5f39d397 | 759 | diff = diff - btrfs_item_size_nr(leaf, path->slots[0]); |
d397712b | 760 | if (diff != csum_size) |
3a686375 | 761 | goto insert; |
459931ec | 762 | |
a429e513 | 763 | ret = btrfs_extend_item(trans, root, path, diff); |
6567e837 CM |
764 | BUG_ON(ret); |
765 | goto csum; | |
766 | } | |
767 | ||
768 | insert: | |
a429e513 | 769 | btrfs_release_path(root, path); |
6567e837 | 770 | csum_offset = 0; |
f578d4bd | 771 | if (found_next) { |
d20f7043 CM |
772 | u64 tmp = total_bytes + root->sectorsize; |
773 | u64 next_sector = sector_sum->bytenr; | |
774 | struct btrfs_sector_sum *next = sector_sum + 1; | |
775 | ||
d397712b | 776 | while (tmp < sums->len) { |
d20f7043 CM |
777 | if (next_sector + root->sectorsize != next->bytenr) |
778 | break; | |
779 | tmp += root->sectorsize; | |
780 | next_sector = next->bytenr; | |
781 | next++; | |
782 | } | |
783 | tmp = min(tmp, next_offset - file_key.offset); | |
f578d4bd CM |
784 | tmp >>= root->fs_info->sb->s_blocksize_bits; |
785 | tmp = max((u64)1, tmp); | |
607d432d JB |
786 | tmp = min(tmp, (u64)MAX_CSUM_ITEMS(root, csum_size)); |
787 | ins_size = csum_size * tmp; | |
f578d4bd | 788 | } else { |
607d432d | 789 | ins_size = csum_size; |
f578d4bd | 790 | } |
b9473439 | 791 | path->leave_spinning = 1; |
5caf2a00 | 792 | ret = btrfs_insert_empty_item(trans, root, path, &file_key, |
f578d4bd | 793 | ins_size); |
b9473439 | 794 | path->leave_spinning = 0; |
54aa1f4d | 795 | if (ret < 0) |
53863232 | 796 | goto fail_unlock; |
a429e513 | 797 | if (ret != 0) { |
a429e513 | 798 | WARN_ON(1); |
53863232 | 799 | goto fail_unlock; |
a429e513 | 800 | } |
6567e837 | 801 | csum: |
5f39d397 CM |
802 | leaf = path->nodes[0]; |
803 | item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item); | |
f254e52c | 804 | ret = 0; |
509659cd | 805 | item = (struct btrfs_csum_item *)((unsigned char *)item + |
607d432d | 806 | csum_offset * csum_size); |
b18c6685 | 807 | found: |
065631f6 CM |
808 | item_end = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item); |
809 | item_end = (struct btrfs_csum_item *)((unsigned char *)item_end + | |
810 | btrfs_item_size_nr(leaf, path->slots[0])); | |
6e92f5e6 | 811 | eb_token = NULL; |
e6dcd2dc | 812 | next_sector: |
aadfeb6e | 813 | |
6e92f5e6 | 814 | if (!eb_token || |
607d432d | 815 | (unsigned long)item + csum_size >= map_start + map_len) { |
6e92f5e6 CM |
816 | int err; |
817 | ||
818 | if (eb_token) | |
eb20978f | 819 | unmap_extent_buffer(leaf, eb_token, KM_USER1); |
6e92f5e6 CM |
820 | eb_token = NULL; |
821 | err = map_private_extent_buffer(leaf, (unsigned long)item, | |
607d432d | 822 | csum_size, |
6e92f5e6 | 823 | &eb_token, &eb_map, |
eb20978f | 824 | &map_start, &map_len, KM_USER1); |
6e92f5e6 CM |
825 | if (err) |
826 | eb_token = NULL; | |
827 | } | |
828 | if (eb_token) { | |
829 | memcpy(eb_token + ((unsigned long)item & (PAGE_CACHE_SIZE - 1)), | |
607d432d | 830 | §or_sum->sum, csum_size); |
6e92f5e6 | 831 | } else { |
e6dcd2dc | 832 | write_extent_buffer(leaf, §or_sum->sum, |
607d432d | 833 | (unsigned long)item, csum_size); |
6e92f5e6 | 834 | } |
7f3c74fb | 835 | |
e6dcd2dc CM |
836 | total_bytes += root->sectorsize; |
837 | sector_sum++; | |
838 | if (total_bytes < sums->len) { | |
6e92f5e6 | 839 | item = (struct btrfs_csum_item *)((char *)item + |
607d432d | 840 | csum_size); |
d20f7043 CM |
841 | if (item < item_end && bytenr + PAGE_CACHE_SIZE == |
842 | sector_sum->bytenr) { | |
843 | bytenr = sector_sum->bytenr; | |
e6dcd2dc | 844 | goto next_sector; |
2e1a992e | 845 | } |
065631f6 | 846 | } |
6e92f5e6 | 847 | if (eb_token) { |
eb20978f | 848 | unmap_extent_buffer(leaf, eb_token, KM_USER1); |
6e92f5e6 CM |
849 | eb_token = NULL; |
850 | } | |
5caf2a00 | 851 | btrfs_mark_buffer_dirty(path->nodes[0]); |
e6dcd2dc | 852 | if (total_bytes < sums->len) { |
065631f6 | 853 | btrfs_release_path(root, path); |
b9473439 | 854 | cond_resched(); |
065631f6 CM |
855 | goto again; |
856 | } | |
53863232 | 857 | out: |
5caf2a00 | 858 | btrfs_free_path(path); |
f254e52c | 859 | return ret; |
53863232 CM |
860 | |
861 | fail_unlock: | |
53863232 | 862 | goto out; |
f254e52c | 863 | } |