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