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