]>
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 | 268 | int btrfs_lookup_csums_range(struct btrfs_root *root, u64 start, u64 end, |
a2de733c | 269 | struct list_head *list, int search_commit) |
17d217fe YZ |
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 | ||
a2de733c AJ |
286 | if (search_commit) { |
287 | path->skip_locking = 1; | |
288 | path->reada = 2; | |
289 | path->search_commit_root = 1; | |
290 | } | |
291 | ||
17d217fe YZ |
292 | key.objectid = BTRFS_EXTENT_CSUM_OBJECTID; |
293 | key.offset = start; | |
294 | key.type = BTRFS_EXTENT_CSUM_KEY; | |
295 | ||
07d400a6 | 296 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
17d217fe YZ |
297 | if (ret < 0) |
298 | goto fail; | |
299 | if (ret > 0 && path->slots[0] > 0) { | |
300 | leaf = path->nodes[0]; | |
301 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1); | |
302 | if (key.objectid == BTRFS_EXTENT_CSUM_OBJECTID && | |
303 | key.type == BTRFS_EXTENT_CSUM_KEY) { | |
304 | offset = (start - key.offset) >> | |
305 | root->fs_info->sb->s_blocksize_bits; | |
306 | if (offset * csum_size < | |
307 | btrfs_item_size_nr(leaf, path->slots[0] - 1)) | |
308 | path->slots[0]--; | |
309 | } | |
310 | } | |
311 | ||
312 | while (start <= end) { | |
313 | leaf = path->nodes[0]; | |
314 | if (path->slots[0] >= btrfs_header_nritems(leaf)) { | |
07d400a6 | 315 | ret = btrfs_next_leaf(root, path); |
17d217fe YZ |
316 | if (ret < 0) |
317 | goto fail; | |
318 | if (ret > 0) | |
319 | break; | |
320 | leaf = path->nodes[0]; | |
321 | } | |
322 | ||
323 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
324 | if (key.objectid != BTRFS_EXTENT_CSUM_OBJECTID || | |
325 | key.type != BTRFS_EXTENT_CSUM_KEY) | |
326 | break; | |
327 | ||
328 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
329 | if (key.offset > end) | |
330 | break; | |
331 | ||
332 | if (key.offset > start) | |
333 | start = key.offset; | |
334 | ||
335 | size = btrfs_item_size_nr(leaf, path->slots[0]); | |
336 | csum_end = key.offset + (size / csum_size) * root->sectorsize; | |
87b29b20 YZ |
337 | if (csum_end <= start) { |
338 | path->slots[0]++; | |
339 | continue; | |
340 | } | |
17d217fe | 341 | |
07d400a6 | 342 | csum_end = min(csum_end, end + 1); |
17d217fe YZ |
343 | item = btrfs_item_ptr(path->nodes[0], path->slots[0], |
344 | struct btrfs_csum_item); | |
07d400a6 YZ |
345 | while (start < csum_end) { |
346 | size = min_t(size_t, csum_end - start, | |
347 | MAX_ORDERED_SUM_BYTES(root)); | |
348 | sums = kzalloc(btrfs_ordered_sum_size(root, size), | |
349 | GFP_NOFS); | |
350 | BUG_ON(!sums); | |
17d217fe | 351 | |
07d400a6 YZ |
352 | sector_sum = sums->sums; |
353 | sums->bytenr = start; | |
354 | sums->len = size; | |
355 | ||
356 | offset = (start - key.offset) >> | |
357 | root->fs_info->sb->s_blocksize_bits; | |
358 | offset *= csum_size; | |
359 | ||
360 | while (size > 0) { | |
361 | read_extent_buffer(path->nodes[0], | |
362 | §or_sum->sum, | |
363 | ((unsigned long)item) + | |
364 | offset, csum_size); | |
365 | sector_sum->bytenr = start; | |
366 | ||
367 | size -= root->sectorsize; | |
368 | start += root->sectorsize; | |
369 | offset += csum_size; | |
370 | sector_sum++; | |
371 | } | |
372 | list_add_tail(&sums->list, list); | |
373 | } | |
17d217fe YZ |
374 | path->slots[0]++; |
375 | } | |
376 | ret = 0; | |
377 | fail: | |
378 | btrfs_free_path(path); | |
379 | return ret; | |
380 | } | |
381 | ||
3edf7d33 | 382 | int btrfs_csum_one_bio(struct btrfs_root *root, struct inode *inode, |
d20f7043 | 383 | struct bio *bio, u64 file_start, int contig) |
e015640f | 384 | { |
e6dcd2dc CM |
385 | struct btrfs_ordered_sum *sums; |
386 | struct btrfs_sector_sum *sector_sum; | |
3edf7d33 | 387 | struct btrfs_ordered_extent *ordered; |
e015640f CM |
388 | char *data; |
389 | struct bio_vec *bvec = bio->bi_io_vec; | |
390 | int bio_index = 0; | |
3edf7d33 CM |
391 | unsigned long total_bytes = 0; |
392 | unsigned long this_sum_bytes = 0; | |
393 | u64 offset; | |
d20f7043 | 394 | u64 disk_bytenr; |
e015640f | 395 | |
e6dcd2dc CM |
396 | WARN_ON(bio->bi_vcnt <= 0); |
397 | sums = kzalloc(btrfs_ordered_sum_size(root, bio->bi_size), GFP_NOFS); | |
e015640f CM |
398 | if (!sums) |
399 | return -ENOMEM; | |
3edf7d33 | 400 | |
ed98b56a | 401 | sector_sum = sums->sums; |
d20f7043 | 402 | disk_bytenr = (u64)bio->bi_sector << 9; |
e6dcd2dc CM |
403 | sums->len = bio->bi_size; |
404 | INIT_LIST_HEAD(&sums->list); | |
d20f7043 CM |
405 | |
406 | if (contig) | |
407 | offset = file_start; | |
408 | else | |
409 | offset = page_offset(bvec->bv_page) + bvec->bv_offset; | |
410 | ||
411 | ordered = btrfs_lookup_ordered_extent(inode, offset); | |
3edf7d33 | 412 | BUG_ON(!ordered); |
d20f7043 | 413 | sums->bytenr = ordered->start; |
e015640f | 414 | |
d397712b | 415 | while (bio_index < bio->bi_vcnt) { |
d20f7043 CM |
416 | if (!contig) |
417 | offset = page_offset(bvec->bv_page) + bvec->bv_offset; | |
418 | ||
419 | if (!contig && (offset >= ordered->file_offset + ordered->len || | |
420 | offset < ordered->file_offset)) { | |
3edf7d33 CM |
421 | unsigned long bytes_left; |
422 | sums->len = this_sum_bytes; | |
423 | this_sum_bytes = 0; | |
424 | btrfs_add_ordered_sum(inode, ordered, sums); | |
425 | btrfs_put_ordered_extent(ordered); | |
426 | ||
427 | bytes_left = bio->bi_size - total_bytes; | |
428 | ||
429 | sums = kzalloc(btrfs_ordered_sum_size(root, bytes_left), | |
430 | GFP_NOFS); | |
431 | BUG_ON(!sums); | |
ed98b56a | 432 | sector_sum = sums->sums; |
3edf7d33 | 433 | sums->len = bytes_left; |
d20f7043 | 434 | ordered = btrfs_lookup_ordered_extent(inode, offset); |
3edf7d33 | 435 | BUG_ON(!ordered); |
d20f7043 | 436 | sums->bytenr = ordered->start; |
3edf7d33 CM |
437 | } |
438 | ||
e015640f | 439 | data = kmap_atomic(bvec->bv_page, KM_USER0); |
e6dcd2dc CM |
440 | sector_sum->sum = ~(u32)0; |
441 | sector_sum->sum = btrfs_csum_data(root, | |
442 | data + bvec->bv_offset, | |
443 | sector_sum->sum, | |
444 | bvec->bv_len); | |
e015640f | 445 | kunmap_atomic(data, KM_USER0); |
e6dcd2dc CM |
446 | btrfs_csum_final(sector_sum->sum, |
447 | (char *)§or_sum->sum); | |
d20f7043 | 448 | sector_sum->bytenr = disk_bytenr; |
ed98b56a | 449 | |
e6dcd2dc | 450 | sector_sum++; |
e015640f | 451 | bio_index++; |
3edf7d33 CM |
452 | total_bytes += bvec->bv_len; |
453 | this_sum_bytes += bvec->bv_len; | |
d20f7043 CM |
454 | disk_bytenr += bvec->bv_len; |
455 | offset += bvec->bv_len; | |
e015640f CM |
456 | bvec++; |
457 | } | |
ed98b56a | 458 | this_sum_bytes = 0; |
3edf7d33 CM |
459 | btrfs_add_ordered_sum(inode, ordered, sums); |
460 | btrfs_put_ordered_extent(ordered); | |
e015640f CM |
461 | return 0; |
462 | } | |
463 | ||
459931ec CM |
464 | /* |
465 | * helper function for csum removal, this expects the | |
466 | * key to describe the csum pointed to by the path, and it expects | |
467 | * the csum to overlap the range [bytenr, len] | |
468 | * | |
469 | * The csum should not be entirely contained in the range and the | |
470 | * range should not be entirely contained in the csum. | |
471 | * | |
472 | * This calls btrfs_truncate_item with the correct args based on the | |
473 | * overlap, and fixes up the key as required. | |
474 | */ | |
475 | static noinline int truncate_one_csum(struct btrfs_trans_handle *trans, | |
476 | struct btrfs_root *root, | |
477 | struct btrfs_path *path, | |
478 | struct btrfs_key *key, | |
479 | u64 bytenr, u64 len) | |
480 | { | |
481 | struct extent_buffer *leaf; | |
482 | u16 csum_size = | |
483 | btrfs_super_csum_size(&root->fs_info->super_copy); | |
484 | u64 csum_end; | |
485 | u64 end_byte = bytenr + len; | |
486 | u32 blocksize_bits = root->fs_info->sb->s_blocksize_bits; | |
487 | int ret; | |
488 | ||
489 | leaf = path->nodes[0]; | |
490 | csum_end = btrfs_item_size_nr(leaf, path->slots[0]) / csum_size; | |
491 | csum_end <<= root->fs_info->sb->s_blocksize_bits; | |
492 | csum_end += key->offset; | |
493 | ||
494 | if (key->offset < bytenr && csum_end <= end_byte) { | |
495 | /* | |
496 | * [ bytenr - len ] | |
497 | * [ ] | |
498 | * [csum ] | |
499 | * A simple truncate off the end of the item | |
500 | */ | |
501 | u32 new_size = (bytenr - key->offset) >> blocksize_bits; | |
502 | new_size *= csum_size; | |
503 | ret = btrfs_truncate_item(trans, root, path, new_size, 1); | |
504 | BUG_ON(ret); | |
505 | } else if (key->offset >= bytenr && csum_end > end_byte && | |
506 | end_byte > key->offset) { | |
507 | /* | |
508 | * [ bytenr - len ] | |
509 | * [ ] | |
510 | * [csum ] | |
511 | * we need to truncate from the beginning of the csum | |
512 | */ | |
513 | u32 new_size = (csum_end - end_byte) >> blocksize_bits; | |
514 | new_size *= csum_size; | |
515 | ||
516 | ret = btrfs_truncate_item(trans, root, path, new_size, 0); | |
517 | BUG_ON(ret); | |
518 | ||
519 | key->offset = end_byte; | |
520 | ret = btrfs_set_item_key_safe(trans, root, path, key); | |
521 | BUG_ON(ret); | |
522 | } else { | |
523 | BUG(); | |
524 | } | |
525 | return 0; | |
526 | } | |
527 | ||
528 | /* | |
529 | * deletes the csum items from the csum tree for a given | |
530 | * range of bytes. | |
531 | */ | |
532 | int btrfs_del_csums(struct btrfs_trans_handle *trans, | |
533 | struct btrfs_root *root, u64 bytenr, u64 len) | |
534 | { | |
535 | struct btrfs_path *path; | |
536 | struct btrfs_key key; | |
537 | u64 end_byte = bytenr + len; | |
538 | u64 csum_end; | |
539 | struct extent_buffer *leaf; | |
540 | int ret; | |
541 | u16 csum_size = | |
542 | btrfs_super_csum_size(&root->fs_info->super_copy); | |
543 | int blocksize_bits = root->fs_info->sb->s_blocksize_bits; | |
544 | ||
545 | root = root->fs_info->csum_root; | |
546 | ||
547 | path = btrfs_alloc_path(); | |
2a29edc6 | 548 | if (!path) |
549 | return -ENOMEM; | |
459931ec | 550 | |
d397712b | 551 | while (1) { |
459931ec CM |
552 | key.objectid = BTRFS_EXTENT_CSUM_OBJECTID; |
553 | key.offset = end_byte - 1; | |
554 | key.type = BTRFS_EXTENT_CSUM_KEY; | |
555 | ||
b9473439 | 556 | path->leave_spinning = 1; |
459931ec CM |
557 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); |
558 | if (ret > 0) { | |
559 | if (path->slots[0] == 0) | |
560 | goto out; | |
561 | path->slots[0]--; | |
ad0397a7 JB |
562 | } else if (ret < 0) { |
563 | goto out; | |
459931ec | 564 | } |
ad0397a7 | 565 | |
459931ec CM |
566 | leaf = path->nodes[0]; |
567 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
568 | ||
569 | if (key.objectid != BTRFS_EXTENT_CSUM_OBJECTID || | |
570 | key.type != BTRFS_EXTENT_CSUM_KEY) { | |
571 | break; | |
572 | } | |
573 | ||
574 | if (key.offset >= end_byte) | |
575 | break; | |
576 | ||
577 | csum_end = btrfs_item_size_nr(leaf, path->slots[0]) / csum_size; | |
578 | csum_end <<= blocksize_bits; | |
579 | csum_end += key.offset; | |
580 | ||
581 | /* this csum ends before we start, we're done */ | |
582 | if (csum_end <= bytenr) | |
583 | break; | |
584 | ||
585 | /* delete the entire item, it is inside our range */ | |
586 | if (key.offset >= bytenr && csum_end <= end_byte) { | |
587 | ret = btrfs_del_item(trans, root, path); | |
588 | BUG_ON(ret); | |
dcbdd4dc CM |
589 | if (key.offset == bytenr) |
590 | break; | |
459931ec CM |
591 | } else if (key.offset < bytenr && csum_end > end_byte) { |
592 | unsigned long offset; | |
593 | unsigned long shift_len; | |
594 | unsigned long item_offset; | |
595 | /* | |
596 | * [ bytenr - len ] | |
597 | * [csum ] | |
598 | * | |
599 | * Our bytes are in the middle of the csum, | |
600 | * we need to split this item and insert a new one. | |
601 | * | |
602 | * But we can't drop the path because the | |
603 | * csum could change, get removed, extended etc. | |
604 | * | |
605 | * The trick here is the max size of a csum item leaves | |
606 | * enough room in the tree block for a single | |
607 | * item header. So, we split the item in place, | |
608 | * adding a new header pointing to the existing | |
609 | * bytes. Then we loop around again and we have | |
610 | * a nicely formed csum item that we can neatly | |
611 | * truncate. | |
612 | */ | |
613 | offset = (bytenr - key.offset) >> blocksize_bits; | |
614 | offset *= csum_size; | |
615 | ||
616 | shift_len = (len >> blocksize_bits) * csum_size; | |
617 | ||
618 | item_offset = btrfs_item_ptr_offset(leaf, | |
619 | path->slots[0]); | |
620 | ||
621 | memset_extent_buffer(leaf, 0, item_offset + offset, | |
622 | shift_len); | |
623 | key.offset = bytenr; | |
624 | ||
625 | /* | |
626 | * btrfs_split_item returns -EAGAIN when the | |
627 | * item changed size or key | |
628 | */ | |
629 | ret = btrfs_split_item(trans, root, path, &key, offset); | |
630 | BUG_ON(ret && ret != -EAGAIN); | |
631 | ||
632 | key.offset = end_byte - 1; | |
633 | } else { | |
634 | ret = truncate_one_csum(trans, root, path, | |
635 | &key, bytenr, len); | |
636 | BUG_ON(ret); | |
dcbdd4dc CM |
637 | if (key.offset < bytenr) |
638 | break; | |
459931ec CM |
639 | } |
640 | btrfs_release_path(root, path); | |
641 | } | |
642 | out: | |
643 | btrfs_free_path(path); | |
644 | return 0; | |
645 | } | |
646 | ||
065631f6 | 647 | int btrfs_csum_file_blocks(struct btrfs_trans_handle *trans, |
d20f7043 | 648 | struct btrfs_root *root, |
e6dcd2dc | 649 | struct btrfs_ordered_sum *sums) |
f254e52c | 650 | { |
d20f7043 | 651 | u64 bytenr; |
f254e52c CM |
652 | int ret; |
653 | struct btrfs_key file_key; | |
6567e837 | 654 | struct btrfs_key found_key; |
065631f6 | 655 | u64 next_offset; |
e6dcd2dc | 656 | u64 total_bytes = 0; |
065631f6 | 657 | int found_next; |
5caf2a00 | 658 | struct btrfs_path *path; |
f254e52c | 659 | struct btrfs_csum_item *item; |
065631f6 | 660 | struct btrfs_csum_item *item_end; |
ff79f819 | 661 | struct extent_buffer *leaf = NULL; |
6567e837 | 662 | u64 csum_offset; |
e6dcd2dc | 663 | struct btrfs_sector_sum *sector_sum; |
f578d4bd CM |
664 | u32 nritems; |
665 | u32 ins_size; | |
6e92f5e6 CM |
666 | char *eb_map; |
667 | char *eb_token; | |
668 | unsigned long map_len; | |
669 | unsigned long map_start; | |
607d432d JB |
670 | u16 csum_size = |
671 | btrfs_super_csum_size(&root->fs_info->super_copy); | |
6e92f5e6 | 672 | |
5caf2a00 CM |
673 | path = btrfs_alloc_path(); |
674 | BUG_ON(!path); | |
ed98b56a | 675 | sector_sum = sums->sums; |
065631f6 CM |
676 | again: |
677 | next_offset = (u64)-1; | |
678 | found_next = 0; | |
d20f7043 CM |
679 | file_key.objectid = BTRFS_EXTENT_CSUM_OBJECTID; |
680 | file_key.offset = sector_sum->bytenr; | |
681 | bytenr = sector_sum->bytenr; | |
682 | btrfs_set_key_type(&file_key, BTRFS_EXTENT_CSUM_KEY); | |
a429e513 | 683 | |
d20f7043 | 684 | item = btrfs_lookup_csum(trans, root, path, sector_sum->bytenr, 1); |
ff79f819 CM |
685 | if (!IS_ERR(item)) { |
686 | leaf = path->nodes[0]; | |
639cb586 | 687 | ret = 0; |
a429e513 | 688 | goto found; |
ff79f819 | 689 | } |
a429e513 | 690 | ret = PTR_ERR(item); |
4a500fd1 YZ |
691 | if (ret != -EFBIG && ret != -ENOENT) |
692 | goto fail_unlock; | |
693 | ||
a429e513 CM |
694 | if (ret == -EFBIG) { |
695 | u32 item_size; | |
696 | /* we found one, but it isn't big enough yet */ | |
5f39d397 CM |
697 | leaf = path->nodes[0]; |
698 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
607d432d JB |
699 | if ((item_size / csum_size) >= |
700 | MAX_CSUM_ITEMS(root, csum_size)) { | |
a429e513 CM |
701 | /* already at max size, make a new one */ |
702 | goto insert; | |
703 | } | |
704 | } else { | |
f578d4bd | 705 | int slot = path->slots[0] + 1; |
a429e513 | 706 | /* we didn't find a csum item, insert one */ |
f578d4bd CM |
707 | nritems = btrfs_header_nritems(path->nodes[0]); |
708 | if (path->slots[0] >= nritems - 1) { | |
709 | ret = btrfs_next_leaf(root, path); | |
b56baf5b | 710 | if (ret == 1) |
f578d4bd | 711 | found_next = 1; |
b56baf5b | 712 | if (ret != 0) |
f578d4bd | 713 | goto insert; |
b56baf5b | 714 | slot = 0; |
f578d4bd CM |
715 | } |
716 | btrfs_item_key_to_cpu(path->nodes[0], &found_key, slot); | |
d20f7043 CM |
717 | if (found_key.objectid != BTRFS_EXTENT_CSUM_OBJECTID || |
718 | found_key.type != BTRFS_EXTENT_CSUM_KEY) { | |
f578d4bd CM |
719 | found_next = 1; |
720 | goto insert; | |
721 | } | |
722 | next_offset = found_key.offset; | |
723 | found_next = 1; | |
a429e513 CM |
724 | goto insert; |
725 | } | |
726 | ||
727 | /* | |
728 | * at this point, we know the tree has an item, but it isn't big | |
729 | * enough yet to put our csum in. Grow it | |
730 | */ | |
731 | btrfs_release_path(root, path); | |
6567e837 | 732 | ret = btrfs_search_slot(trans, root, &file_key, path, |
607d432d | 733 | csum_size, 1); |
6567e837 | 734 | if (ret < 0) |
53863232 | 735 | goto fail_unlock; |
459931ec CM |
736 | |
737 | if (ret > 0) { | |
738 | if (path->slots[0] == 0) | |
739 | goto insert; | |
740 | path->slots[0]--; | |
6567e837 | 741 | } |
459931ec | 742 | |
5f39d397 CM |
743 | leaf = path->nodes[0]; |
744 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
d20f7043 | 745 | csum_offset = (bytenr - found_key.offset) >> |
6567e837 | 746 | root->fs_info->sb->s_blocksize_bits; |
459931ec | 747 | |
d20f7043 CM |
748 | if (btrfs_key_type(&found_key) != BTRFS_EXTENT_CSUM_KEY || |
749 | found_key.objectid != BTRFS_EXTENT_CSUM_OBJECTID || | |
607d432d | 750 | csum_offset >= MAX_CSUM_ITEMS(root, csum_size)) { |
6567e837 CM |
751 | goto insert; |
752 | } | |
459931ec | 753 | |
5f39d397 | 754 | if (csum_offset >= btrfs_item_size_nr(leaf, path->slots[0]) / |
607d432d JB |
755 | csum_size) { |
756 | u32 diff = (csum_offset + 1) * csum_size; | |
459931ec CM |
757 | |
758 | /* | |
759 | * is the item big enough already? we dropped our lock | |
760 | * before and need to recheck | |
761 | */ | |
762 | if (diff < btrfs_item_size_nr(leaf, path->slots[0])) | |
763 | goto csum; | |
764 | ||
5f39d397 | 765 | diff = diff - btrfs_item_size_nr(leaf, path->slots[0]); |
d397712b | 766 | if (diff != csum_size) |
3a686375 | 767 | goto insert; |
459931ec | 768 | |
a429e513 | 769 | ret = btrfs_extend_item(trans, root, path, diff); |
6567e837 CM |
770 | BUG_ON(ret); |
771 | goto csum; | |
772 | } | |
773 | ||
774 | insert: | |
a429e513 | 775 | btrfs_release_path(root, path); |
6567e837 | 776 | csum_offset = 0; |
f578d4bd | 777 | if (found_next) { |
d20f7043 CM |
778 | u64 tmp = total_bytes + root->sectorsize; |
779 | u64 next_sector = sector_sum->bytenr; | |
780 | struct btrfs_sector_sum *next = sector_sum + 1; | |
781 | ||
d397712b | 782 | while (tmp < sums->len) { |
d20f7043 CM |
783 | if (next_sector + root->sectorsize != next->bytenr) |
784 | break; | |
785 | tmp += root->sectorsize; | |
786 | next_sector = next->bytenr; | |
787 | next++; | |
788 | } | |
789 | tmp = min(tmp, next_offset - file_key.offset); | |
f578d4bd CM |
790 | tmp >>= root->fs_info->sb->s_blocksize_bits; |
791 | tmp = max((u64)1, tmp); | |
607d432d JB |
792 | tmp = min(tmp, (u64)MAX_CSUM_ITEMS(root, csum_size)); |
793 | ins_size = csum_size * tmp; | |
f578d4bd | 794 | } else { |
607d432d | 795 | ins_size = csum_size; |
f578d4bd | 796 | } |
b9473439 | 797 | path->leave_spinning = 1; |
5caf2a00 | 798 | ret = btrfs_insert_empty_item(trans, root, path, &file_key, |
f578d4bd | 799 | ins_size); |
b9473439 | 800 | path->leave_spinning = 0; |
54aa1f4d | 801 | if (ret < 0) |
53863232 | 802 | goto fail_unlock; |
a429e513 | 803 | if (ret != 0) { |
a429e513 | 804 | WARN_ON(1); |
53863232 | 805 | goto fail_unlock; |
a429e513 | 806 | } |
6567e837 | 807 | csum: |
5f39d397 CM |
808 | leaf = path->nodes[0]; |
809 | item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item); | |
f254e52c | 810 | ret = 0; |
509659cd | 811 | item = (struct btrfs_csum_item *)((unsigned char *)item + |
607d432d | 812 | csum_offset * csum_size); |
b18c6685 | 813 | found: |
065631f6 CM |
814 | item_end = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item); |
815 | item_end = (struct btrfs_csum_item *)((unsigned char *)item_end + | |
816 | btrfs_item_size_nr(leaf, path->slots[0])); | |
6e92f5e6 | 817 | eb_token = NULL; |
e6dcd2dc | 818 | next_sector: |
aadfeb6e | 819 | |
6e92f5e6 | 820 | if (!eb_token || |
607d432d | 821 | (unsigned long)item + csum_size >= map_start + map_len) { |
6e92f5e6 CM |
822 | int err; |
823 | ||
824 | if (eb_token) | |
eb20978f | 825 | unmap_extent_buffer(leaf, eb_token, KM_USER1); |
6e92f5e6 CM |
826 | eb_token = NULL; |
827 | err = map_private_extent_buffer(leaf, (unsigned long)item, | |
607d432d | 828 | csum_size, |
6e92f5e6 | 829 | &eb_token, &eb_map, |
eb20978f | 830 | &map_start, &map_len, KM_USER1); |
6e92f5e6 CM |
831 | if (err) |
832 | eb_token = NULL; | |
833 | } | |
834 | if (eb_token) { | |
835 | memcpy(eb_token + ((unsigned long)item & (PAGE_CACHE_SIZE - 1)), | |
607d432d | 836 | §or_sum->sum, csum_size); |
6e92f5e6 | 837 | } else { |
e6dcd2dc | 838 | write_extent_buffer(leaf, §or_sum->sum, |
607d432d | 839 | (unsigned long)item, csum_size); |
6e92f5e6 | 840 | } |
7f3c74fb | 841 | |
e6dcd2dc CM |
842 | total_bytes += root->sectorsize; |
843 | sector_sum++; | |
844 | if (total_bytes < sums->len) { | |
6e92f5e6 | 845 | item = (struct btrfs_csum_item *)((char *)item + |
607d432d | 846 | csum_size); |
d20f7043 CM |
847 | if (item < item_end && bytenr + PAGE_CACHE_SIZE == |
848 | sector_sum->bytenr) { | |
849 | bytenr = sector_sum->bytenr; | |
e6dcd2dc | 850 | goto next_sector; |
2e1a992e | 851 | } |
065631f6 | 852 | } |
6e92f5e6 | 853 | if (eb_token) { |
eb20978f | 854 | unmap_extent_buffer(leaf, eb_token, KM_USER1); |
6e92f5e6 CM |
855 | eb_token = NULL; |
856 | } | |
5caf2a00 | 857 | btrfs_mark_buffer_dirty(path->nodes[0]); |
e6dcd2dc | 858 | if (total_bytes < sums->len) { |
065631f6 | 859 | btrfs_release_path(root, path); |
b9473439 | 860 | cond_resched(); |
065631f6 CM |
861 | goto again; |
862 | } | |
53863232 | 863 | out: |
5caf2a00 | 864 | btrfs_free_path(path); |
f254e52c | 865 | return ret; |
53863232 CM |
866 | |
867 | fail_unlock: | |
53863232 | 868 | goto out; |
f254e52c | 869 | } |