]>
Commit | Line | Data |
---|---|---|
c8b97818 CM |
1 | /* |
2 | * Copyright (C) 2008 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 | ||
19 | #include <linux/kernel.h> | |
20 | #include <linux/bio.h> | |
21 | #include <linux/buffer_head.h> | |
22 | #include <linux/file.h> | |
23 | #include <linux/fs.h> | |
24 | #include <linux/pagemap.h> | |
25 | #include <linux/highmem.h> | |
26 | #include <linux/time.h> | |
27 | #include <linux/init.h> | |
28 | #include <linux/string.h> | |
c8b97818 CM |
29 | #include <linux/backing-dev.h> |
30 | #include <linux/mpage.h> | |
31 | #include <linux/swap.h> | |
32 | #include <linux/writeback.h> | |
33 | #include <linux/bit_spinlock.h> | |
5a0e3ad6 | 34 | #include <linux/slab.h> |
c8b97818 CM |
35 | #include "ctree.h" |
36 | #include "disk-io.h" | |
37 | #include "transaction.h" | |
38 | #include "btrfs_inode.h" | |
39 | #include "volumes.h" | |
40 | #include "ordered-data.h" | |
c8b97818 CM |
41 | #include "compression.h" |
42 | #include "extent_io.h" | |
43 | #include "extent_map.h" | |
44 | ||
45 | struct compressed_bio { | |
46 | /* number of bios pending for this compressed extent */ | |
47 | atomic_t pending_bios; | |
48 | ||
49 | /* the pages with the compressed data on them */ | |
50 | struct page **compressed_pages; | |
51 | ||
52 | /* inode that owns this data */ | |
53 | struct inode *inode; | |
54 | ||
55 | /* starting offset in the inode for our pages */ | |
56 | u64 start; | |
57 | ||
58 | /* number of bytes in the inode we're working on */ | |
59 | unsigned long len; | |
60 | ||
61 | /* number of bytes on disk */ | |
62 | unsigned long compressed_len; | |
63 | ||
261507a0 LZ |
64 | /* the compression algorithm for this bio */ |
65 | int compress_type; | |
66 | ||
c8b97818 CM |
67 | /* number of compressed pages in the array */ |
68 | unsigned long nr_pages; | |
69 | ||
70 | /* IO errors */ | |
71 | int errors; | |
d20f7043 | 72 | int mirror_num; |
c8b97818 CM |
73 | |
74 | /* for reads, this is the bio we are copying the data into */ | |
75 | struct bio *orig_bio; | |
d20f7043 CM |
76 | |
77 | /* | |
78 | * the start of a variable length array of checksums only | |
79 | * used by reads | |
80 | */ | |
81 | u32 sums; | |
c8b97818 CM |
82 | }; |
83 | ||
48a3b636 ES |
84 | static int btrfs_decompress_biovec(int type, struct page **pages_in, |
85 | u64 disk_start, struct bio_vec *bvec, | |
86 | int vcnt, size_t srclen); | |
87 | ||
d20f7043 CM |
88 | static inline int compressed_bio_size(struct btrfs_root *root, |
89 | unsigned long disk_size) | |
90 | { | |
6c41761f DS |
91 | u16 csum_size = btrfs_super_csum_size(root->fs_info->super_copy); |
92 | ||
d20f7043 | 93 | return sizeof(struct compressed_bio) + |
ed6078f7 | 94 | (DIV_ROUND_UP(disk_size, root->sectorsize)) * csum_size; |
d20f7043 CM |
95 | } |
96 | ||
c8b97818 CM |
97 | static struct bio *compressed_bio_alloc(struct block_device *bdev, |
98 | u64 first_byte, gfp_t gfp_flags) | |
99 | { | |
b54ffb73 | 100 | return btrfs_bio_alloc(bdev, first_byte >> 9, BIO_MAX_PAGES, gfp_flags); |
c8b97818 CM |
101 | } |
102 | ||
d20f7043 CM |
103 | static int check_compressed_csum(struct inode *inode, |
104 | struct compressed_bio *cb, | |
105 | u64 disk_start) | |
106 | { | |
107 | int ret; | |
d20f7043 CM |
108 | struct page *page; |
109 | unsigned long i; | |
110 | char *kaddr; | |
111 | u32 csum; | |
112 | u32 *cb_sum = &cb->sums; | |
113 | ||
6cbff00f | 114 | if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM) |
d20f7043 CM |
115 | return 0; |
116 | ||
117 | for (i = 0; i < cb->nr_pages; i++) { | |
118 | page = cb->compressed_pages[i]; | |
119 | csum = ~(u32)0; | |
120 | ||
7ac687d9 | 121 | kaddr = kmap_atomic(page); |
09cbfeaf | 122 | csum = btrfs_csum_data(kaddr, csum, PAGE_SIZE); |
d20f7043 | 123 | btrfs_csum_final(csum, (char *)&csum); |
7ac687d9 | 124 | kunmap_atomic(kaddr); |
d20f7043 CM |
125 | |
126 | if (csum != *cb_sum) { | |
efe120a0 FH |
127 | btrfs_info(BTRFS_I(inode)->root->fs_info, |
128 | "csum failed ino %llu extent %llu csum %u wanted %u mirror %d", | |
129 | btrfs_ino(inode), disk_start, csum, *cb_sum, | |
130 | cb->mirror_num); | |
d20f7043 CM |
131 | ret = -EIO; |
132 | goto fail; | |
133 | } | |
134 | cb_sum++; | |
135 | ||
136 | } | |
137 | ret = 0; | |
138 | fail: | |
139 | return ret; | |
140 | } | |
141 | ||
c8b97818 CM |
142 | /* when we finish reading compressed pages from the disk, we |
143 | * decompress them and then run the bio end_io routines on the | |
144 | * decompressed pages (in the inode address space). | |
145 | * | |
146 | * This allows the checksumming and other IO error handling routines | |
147 | * to work normally | |
148 | * | |
149 | * The compressed pages are freed here, and it must be run | |
150 | * in process context | |
151 | */ | |
4246a0b6 | 152 | static void end_compressed_bio_read(struct bio *bio) |
c8b97818 | 153 | { |
c8b97818 CM |
154 | struct compressed_bio *cb = bio->bi_private; |
155 | struct inode *inode; | |
156 | struct page *page; | |
157 | unsigned long index; | |
158 | int ret; | |
159 | ||
4246a0b6 | 160 | if (bio->bi_error) |
c8b97818 CM |
161 | cb->errors = 1; |
162 | ||
163 | /* if there are more bios still pending for this compressed | |
164 | * extent, just exit | |
165 | */ | |
166 | if (!atomic_dec_and_test(&cb->pending_bios)) | |
167 | goto out; | |
168 | ||
d20f7043 | 169 | inode = cb->inode; |
4f024f37 KO |
170 | ret = check_compressed_csum(inode, cb, |
171 | (u64)bio->bi_iter.bi_sector << 9); | |
d20f7043 CM |
172 | if (ret) |
173 | goto csum_failed; | |
174 | ||
c8b97818 CM |
175 | /* ok, we're the last bio for this extent, lets start |
176 | * the decompression. | |
177 | */ | |
261507a0 LZ |
178 | ret = btrfs_decompress_biovec(cb->compress_type, |
179 | cb->compressed_pages, | |
180 | cb->start, | |
181 | cb->orig_bio->bi_io_vec, | |
182 | cb->orig_bio->bi_vcnt, | |
183 | cb->compressed_len); | |
d20f7043 | 184 | csum_failed: |
c8b97818 CM |
185 | if (ret) |
186 | cb->errors = 1; | |
187 | ||
188 | /* release the compressed pages */ | |
189 | index = 0; | |
190 | for (index = 0; index < cb->nr_pages; index++) { | |
191 | page = cb->compressed_pages[index]; | |
192 | page->mapping = NULL; | |
09cbfeaf | 193 | put_page(page); |
c8b97818 CM |
194 | } |
195 | ||
196 | /* do io completion on the original bio */ | |
771ed689 | 197 | if (cb->errors) { |
c8b97818 | 198 | bio_io_error(cb->orig_bio); |
d20f7043 | 199 | } else { |
2c30c71b KO |
200 | int i; |
201 | struct bio_vec *bvec; | |
d20f7043 CM |
202 | |
203 | /* | |
204 | * we have verified the checksum already, set page | |
205 | * checked so the end_io handlers know about it | |
206 | */ | |
2c30c71b | 207 | bio_for_each_segment_all(bvec, cb->orig_bio, i) |
d20f7043 | 208 | SetPageChecked(bvec->bv_page); |
2c30c71b | 209 | |
4246a0b6 | 210 | bio_endio(cb->orig_bio); |
d20f7043 | 211 | } |
c8b97818 CM |
212 | |
213 | /* finally free the cb struct */ | |
214 | kfree(cb->compressed_pages); | |
215 | kfree(cb); | |
216 | out: | |
217 | bio_put(bio); | |
218 | } | |
219 | ||
220 | /* | |
221 | * Clear the writeback bits on all of the file | |
222 | * pages for a compressed write | |
223 | */ | |
7bdcefc1 FM |
224 | static noinline void end_compressed_writeback(struct inode *inode, |
225 | const struct compressed_bio *cb) | |
c8b97818 | 226 | { |
09cbfeaf KS |
227 | unsigned long index = cb->start >> PAGE_SHIFT; |
228 | unsigned long end_index = (cb->start + cb->len - 1) >> PAGE_SHIFT; | |
c8b97818 CM |
229 | struct page *pages[16]; |
230 | unsigned long nr_pages = end_index - index + 1; | |
231 | int i; | |
232 | int ret; | |
233 | ||
7bdcefc1 FM |
234 | if (cb->errors) |
235 | mapping_set_error(inode->i_mapping, -EIO); | |
236 | ||
d397712b | 237 | while (nr_pages > 0) { |
c8b97818 | 238 | ret = find_get_pages_contig(inode->i_mapping, index, |
5b050f04 CM |
239 | min_t(unsigned long, |
240 | nr_pages, ARRAY_SIZE(pages)), pages); | |
c8b97818 CM |
241 | if (ret == 0) { |
242 | nr_pages -= 1; | |
243 | index += 1; | |
244 | continue; | |
245 | } | |
246 | for (i = 0; i < ret; i++) { | |
7bdcefc1 FM |
247 | if (cb->errors) |
248 | SetPageError(pages[i]); | |
c8b97818 | 249 | end_page_writeback(pages[i]); |
09cbfeaf | 250 | put_page(pages[i]); |
c8b97818 CM |
251 | } |
252 | nr_pages -= ret; | |
253 | index += ret; | |
254 | } | |
255 | /* the inode may be gone now */ | |
c8b97818 CM |
256 | } |
257 | ||
258 | /* | |
259 | * do the cleanup once all the compressed pages hit the disk. | |
260 | * This will clear writeback on the file pages and free the compressed | |
261 | * pages. | |
262 | * | |
263 | * This also calls the writeback end hooks for the file pages so that | |
264 | * metadata and checksums can be updated in the file. | |
265 | */ | |
4246a0b6 | 266 | static void end_compressed_bio_write(struct bio *bio) |
c8b97818 CM |
267 | { |
268 | struct extent_io_tree *tree; | |
269 | struct compressed_bio *cb = bio->bi_private; | |
270 | struct inode *inode; | |
271 | struct page *page; | |
272 | unsigned long index; | |
273 | ||
4246a0b6 | 274 | if (bio->bi_error) |
c8b97818 CM |
275 | cb->errors = 1; |
276 | ||
277 | /* if there are more bios still pending for this compressed | |
278 | * extent, just exit | |
279 | */ | |
280 | if (!atomic_dec_and_test(&cb->pending_bios)) | |
281 | goto out; | |
282 | ||
283 | /* ok, we're the last bio for this extent, step one is to | |
284 | * call back into the FS and do all the end_io operations | |
285 | */ | |
286 | inode = cb->inode; | |
287 | tree = &BTRFS_I(inode)->io_tree; | |
70b99e69 | 288 | cb->compressed_pages[0]->mapping = cb->inode->i_mapping; |
c8b97818 CM |
289 | tree->ops->writepage_end_io_hook(cb->compressed_pages[0], |
290 | cb->start, | |
291 | cb->start + cb->len - 1, | |
7bdcefc1 | 292 | NULL, |
4246a0b6 | 293 | bio->bi_error ? 0 : 1); |
70b99e69 | 294 | cb->compressed_pages[0]->mapping = NULL; |
c8b97818 | 295 | |
7bdcefc1 | 296 | end_compressed_writeback(inode, cb); |
c8b97818 CM |
297 | /* note, our inode could be gone now */ |
298 | ||
299 | /* | |
300 | * release the compressed pages, these came from alloc_page and | |
301 | * are not attached to the inode at all | |
302 | */ | |
303 | index = 0; | |
304 | for (index = 0; index < cb->nr_pages; index++) { | |
305 | page = cb->compressed_pages[index]; | |
306 | page->mapping = NULL; | |
09cbfeaf | 307 | put_page(page); |
c8b97818 CM |
308 | } |
309 | ||
310 | /* finally free the cb struct */ | |
311 | kfree(cb->compressed_pages); | |
312 | kfree(cb); | |
313 | out: | |
314 | bio_put(bio); | |
315 | } | |
316 | ||
317 | /* | |
318 | * worker function to build and submit bios for previously compressed pages. | |
319 | * The corresponding pages in the inode should be marked for writeback | |
320 | * and the compressed pages should have a reference on them for dropping | |
321 | * when the IO is complete. | |
322 | * | |
323 | * This also checksums the file bytes and gets things ready for | |
324 | * the end io hooks. | |
325 | */ | |
326 | int btrfs_submit_compressed_write(struct inode *inode, u64 start, | |
327 | unsigned long len, u64 disk_start, | |
328 | unsigned long compressed_len, | |
329 | struct page **compressed_pages, | |
330 | unsigned long nr_pages) | |
331 | { | |
332 | struct bio *bio = NULL; | |
333 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
334 | struct compressed_bio *cb; | |
335 | unsigned long bytes_left; | |
336 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; | |
306e16ce | 337 | int pg_index = 0; |
c8b97818 CM |
338 | struct page *page; |
339 | u64 first_byte = disk_start; | |
340 | struct block_device *bdev; | |
341 | int ret; | |
e55179b3 | 342 | int skip_sum = BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM; |
c8b97818 | 343 | |
09cbfeaf | 344 | WARN_ON(start & ((u64)PAGE_SIZE - 1)); |
d20f7043 | 345 | cb = kmalloc(compressed_bio_size(root, compressed_len), GFP_NOFS); |
dac97e51 YS |
346 | if (!cb) |
347 | return -ENOMEM; | |
c8b97818 CM |
348 | atomic_set(&cb->pending_bios, 0); |
349 | cb->errors = 0; | |
350 | cb->inode = inode; | |
351 | cb->start = start; | |
352 | cb->len = len; | |
d20f7043 | 353 | cb->mirror_num = 0; |
c8b97818 CM |
354 | cb->compressed_pages = compressed_pages; |
355 | cb->compressed_len = compressed_len; | |
356 | cb->orig_bio = NULL; | |
357 | cb->nr_pages = nr_pages; | |
358 | ||
359 | bdev = BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev; | |
360 | ||
c8b97818 | 361 | bio = compressed_bio_alloc(bdev, first_byte, GFP_NOFS); |
67871254 | 362 | if (!bio) { |
dac97e51 YS |
363 | kfree(cb); |
364 | return -ENOMEM; | |
365 | } | |
c8b97818 CM |
366 | bio->bi_private = cb; |
367 | bio->bi_end_io = end_compressed_bio_write; | |
368 | atomic_inc(&cb->pending_bios); | |
369 | ||
370 | /* create and submit bios for the compressed pages */ | |
371 | bytes_left = compressed_len; | |
306e16ce DS |
372 | for (pg_index = 0; pg_index < cb->nr_pages; pg_index++) { |
373 | page = compressed_pages[pg_index]; | |
c8b97818 | 374 | page->mapping = inode->i_mapping; |
4f024f37 | 375 | if (bio->bi_iter.bi_size) |
64a16701 | 376 | ret = io_tree->ops->merge_bio_hook(WRITE, page, 0, |
09cbfeaf | 377 | PAGE_SIZE, |
c8b97818 CM |
378 | bio, 0); |
379 | else | |
380 | ret = 0; | |
381 | ||
70b99e69 | 382 | page->mapping = NULL; |
09cbfeaf KS |
383 | if (ret || bio_add_page(bio, page, PAGE_SIZE, 0) < |
384 | PAGE_SIZE) { | |
c8b97818 CM |
385 | bio_get(bio); |
386 | ||
af09abfe CM |
387 | /* |
388 | * inc the count before we submit the bio so | |
389 | * we know the end IO handler won't happen before | |
390 | * we inc the count. Otherwise, the cb might get | |
391 | * freed before we're done setting it up | |
392 | */ | |
393 | atomic_inc(&cb->pending_bios); | |
bfebd8b5 DS |
394 | ret = btrfs_bio_wq_end_io(root->fs_info, bio, |
395 | BTRFS_WQ_ENDIO_DATA); | |
79787eaa | 396 | BUG_ON(ret); /* -ENOMEM */ |
c8b97818 | 397 | |
e55179b3 LZ |
398 | if (!skip_sum) { |
399 | ret = btrfs_csum_one_bio(root, inode, bio, | |
400 | start, 1); | |
79787eaa | 401 | BUG_ON(ret); /* -ENOMEM */ |
e55179b3 | 402 | } |
d20f7043 | 403 | |
c8b97818 | 404 | ret = btrfs_map_bio(root, WRITE, bio, 0, 1); |
79787eaa | 405 | BUG_ON(ret); /* -ENOMEM */ |
c8b97818 CM |
406 | |
407 | bio_put(bio); | |
408 | ||
409 | bio = compressed_bio_alloc(bdev, first_byte, GFP_NOFS); | |
e627ee7b | 410 | BUG_ON(!bio); |
c8b97818 CM |
411 | bio->bi_private = cb; |
412 | bio->bi_end_io = end_compressed_bio_write; | |
09cbfeaf | 413 | bio_add_page(bio, page, PAGE_SIZE, 0); |
c8b97818 | 414 | } |
09cbfeaf | 415 | if (bytes_left < PAGE_SIZE) { |
efe120a0 FH |
416 | btrfs_info(BTRFS_I(inode)->root->fs_info, |
417 | "bytes left %lu compress len %lu nr %lu", | |
cfbc246e CM |
418 | bytes_left, cb->compressed_len, cb->nr_pages); |
419 | } | |
09cbfeaf KS |
420 | bytes_left -= PAGE_SIZE; |
421 | first_byte += PAGE_SIZE; | |
771ed689 | 422 | cond_resched(); |
c8b97818 CM |
423 | } |
424 | bio_get(bio); | |
425 | ||
bfebd8b5 | 426 | ret = btrfs_bio_wq_end_io(root->fs_info, bio, BTRFS_WQ_ENDIO_DATA); |
79787eaa | 427 | BUG_ON(ret); /* -ENOMEM */ |
c8b97818 | 428 | |
e55179b3 LZ |
429 | if (!skip_sum) { |
430 | ret = btrfs_csum_one_bio(root, inode, bio, start, 1); | |
79787eaa | 431 | BUG_ON(ret); /* -ENOMEM */ |
e55179b3 | 432 | } |
d20f7043 | 433 | |
c8b97818 | 434 | ret = btrfs_map_bio(root, WRITE, bio, 0, 1); |
79787eaa | 435 | BUG_ON(ret); /* -ENOMEM */ |
c8b97818 CM |
436 | |
437 | bio_put(bio); | |
438 | return 0; | |
439 | } | |
440 | ||
771ed689 CM |
441 | static noinline int add_ra_bio_pages(struct inode *inode, |
442 | u64 compressed_end, | |
443 | struct compressed_bio *cb) | |
444 | { | |
445 | unsigned long end_index; | |
306e16ce | 446 | unsigned long pg_index; |
771ed689 CM |
447 | u64 last_offset; |
448 | u64 isize = i_size_read(inode); | |
449 | int ret; | |
450 | struct page *page; | |
451 | unsigned long nr_pages = 0; | |
452 | struct extent_map *em; | |
453 | struct address_space *mapping = inode->i_mapping; | |
771ed689 CM |
454 | struct extent_map_tree *em_tree; |
455 | struct extent_io_tree *tree; | |
456 | u64 end; | |
457 | int misses = 0; | |
458 | ||
459 | page = cb->orig_bio->bi_io_vec[cb->orig_bio->bi_vcnt - 1].bv_page; | |
09cbfeaf | 460 | last_offset = (page_offset(page) + PAGE_SIZE); |
771ed689 CM |
461 | em_tree = &BTRFS_I(inode)->extent_tree; |
462 | tree = &BTRFS_I(inode)->io_tree; | |
463 | ||
464 | if (isize == 0) | |
465 | return 0; | |
466 | ||
09cbfeaf | 467 | end_index = (i_size_read(inode) - 1) >> PAGE_SHIFT; |
771ed689 | 468 | |
d397712b | 469 | while (last_offset < compressed_end) { |
09cbfeaf | 470 | pg_index = last_offset >> PAGE_SHIFT; |
771ed689 | 471 | |
306e16ce | 472 | if (pg_index > end_index) |
771ed689 CM |
473 | break; |
474 | ||
475 | rcu_read_lock(); | |
306e16ce | 476 | page = radix_tree_lookup(&mapping->page_tree, pg_index); |
771ed689 | 477 | rcu_read_unlock(); |
0cd6144a | 478 | if (page && !radix_tree_exceptional_entry(page)) { |
771ed689 CM |
479 | misses++; |
480 | if (misses > 4) | |
481 | break; | |
482 | goto next; | |
483 | } | |
484 | ||
c62d2555 MH |
485 | page = __page_cache_alloc(mapping_gfp_constraint(mapping, |
486 | ~__GFP_FS)); | |
771ed689 CM |
487 | if (!page) |
488 | break; | |
489 | ||
c62d2555 | 490 | if (add_to_page_cache_lru(page, mapping, pg_index, GFP_NOFS)) { |
09cbfeaf | 491 | put_page(page); |
771ed689 CM |
492 | goto next; |
493 | } | |
494 | ||
09cbfeaf | 495 | end = last_offset + PAGE_SIZE - 1; |
771ed689 CM |
496 | /* |
497 | * at this point, we have a locked page in the page cache | |
498 | * for these bytes in the file. But, we have to make | |
499 | * sure they map to this compressed extent on disk. | |
500 | */ | |
501 | set_page_extent_mapped(page); | |
d0082371 | 502 | lock_extent(tree, last_offset, end); |
890871be | 503 | read_lock(&em_tree->lock); |
771ed689 | 504 | em = lookup_extent_mapping(em_tree, last_offset, |
09cbfeaf | 505 | PAGE_SIZE); |
890871be | 506 | read_unlock(&em_tree->lock); |
771ed689 CM |
507 | |
508 | if (!em || last_offset < em->start || | |
09cbfeaf | 509 | (last_offset + PAGE_SIZE > extent_map_end(em)) || |
4f024f37 | 510 | (em->block_start >> 9) != cb->orig_bio->bi_iter.bi_sector) { |
771ed689 | 511 | free_extent_map(em); |
d0082371 | 512 | unlock_extent(tree, last_offset, end); |
771ed689 | 513 | unlock_page(page); |
09cbfeaf | 514 | put_page(page); |
771ed689 CM |
515 | break; |
516 | } | |
517 | free_extent_map(em); | |
518 | ||
519 | if (page->index == end_index) { | |
520 | char *userpage; | |
09cbfeaf | 521 | size_t zero_offset = isize & (PAGE_SIZE - 1); |
771ed689 CM |
522 | |
523 | if (zero_offset) { | |
524 | int zeros; | |
09cbfeaf | 525 | zeros = PAGE_SIZE - zero_offset; |
7ac687d9 | 526 | userpage = kmap_atomic(page); |
771ed689 CM |
527 | memset(userpage + zero_offset, 0, zeros); |
528 | flush_dcache_page(page); | |
7ac687d9 | 529 | kunmap_atomic(userpage); |
771ed689 CM |
530 | } |
531 | } | |
532 | ||
533 | ret = bio_add_page(cb->orig_bio, page, | |
09cbfeaf | 534 | PAGE_SIZE, 0); |
771ed689 | 535 | |
09cbfeaf | 536 | if (ret == PAGE_SIZE) { |
771ed689 | 537 | nr_pages++; |
09cbfeaf | 538 | put_page(page); |
771ed689 | 539 | } else { |
d0082371 | 540 | unlock_extent(tree, last_offset, end); |
771ed689 | 541 | unlock_page(page); |
09cbfeaf | 542 | put_page(page); |
771ed689 CM |
543 | break; |
544 | } | |
545 | next: | |
09cbfeaf | 546 | last_offset += PAGE_SIZE; |
771ed689 | 547 | } |
771ed689 CM |
548 | return 0; |
549 | } | |
550 | ||
c8b97818 CM |
551 | /* |
552 | * for a compressed read, the bio we get passed has all the inode pages | |
553 | * in it. We don't actually do IO on those pages but allocate new ones | |
554 | * to hold the compressed pages on disk. | |
555 | * | |
4f024f37 | 556 | * bio->bi_iter.bi_sector points to the compressed extent on disk |
c8b97818 CM |
557 | * bio->bi_io_vec points to all of the inode pages |
558 | * bio->bi_vcnt is a count of pages | |
559 | * | |
560 | * After the compressed pages are read, we copy the bytes into the | |
561 | * bio we were passed and then call the bio end_io calls | |
562 | */ | |
563 | int btrfs_submit_compressed_read(struct inode *inode, struct bio *bio, | |
564 | int mirror_num, unsigned long bio_flags) | |
565 | { | |
566 | struct extent_io_tree *tree; | |
567 | struct extent_map_tree *em_tree; | |
568 | struct compressed_bio *cb; | |
569 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
09cbfeaf | 570 | unsigned long uncompressed_len = bio->bi_vcnt * PAGE_SIZE; |
c8b97818 CM |
571 | unsigned long compressed_len; |
572 | unsigned long nr_pages; | |
306e16ce | 573 | unsigned long pg_index; |
c8b97818 CM |
574 | struct page *page; |
575 | struct block_device *bdev; | |
576 | struct bio *comp_bio; | |
4f024f37 | 577 | u64 cur_disk_byte = (u64)bio->bi_iter.bi_sector << 9; |
e04ca626 CM |
578 | u64 em_len; |
579 | u64 em_start; | |
c8b97818 | 580 | struct extent_map *em; |
6b82ce8d | 581 | int ret = -ENOMEM; |
15e3004a | 582 | int faili = 0; |
d20f7043 | 583 | u32 *sums; |
c8b97818 CM |
584 | |
585 | tree = &BTRFS_I(inode)->io_tree; | |
586 | em_tree = &BTRFS_I(inode)->extent_tree; | |
587 | ||
588 | /* we need the actual starting offset of this extent in the file */ | |
890871be | 589 | read_lock(&em_tree->lock); |
c8b97818 CM |
590 | em = lookup_extent_mapping(em_tree, |
591 | page_offset(bio->bi_io_vec->bv_page), | |
09cbfeaf | 592 | PAGE_SIZE); |
890871be | 593 | read_unlock(&em_tree->lock); |
285190d9 TI |
594 | if (!em) |
595 | return -EIO; | |
c8b97818 | 596 | |
d20f7043 CM |
597 | compressed_len = em->block_len; |
598 | cb = kmalloc(compressed_bio_size(root, compressed_len), GFP_NOFS); | |
6b82ce8d | 599 | if (!cb) |
600 | goto out; | |
601 | ||
c8b97818 CM |
602 | atomic_set(&cb->pending_bios, 0); |
603 | cb->errors = 0; | |
604 | cb->inode = inode; | |
d20f7043 CM |
605 | cb->mirror_num = mirror_num; |
606 | sums = &cb->sums; | |
c8b97818 | 607 | |
ff5b7ee3 | 608 | cb->start = em->orig_start; |
e04ca626 CM |
609 | em_len = em->len; |
610 | em_start = em->start; | |
d20f7043 | 611 | |
c8b97818 | 612 | free_extent_map(em); |
e04ca626 | 613 | em = NULL; |
c8b97818 CM |
614 | |
615 | cb->len = uncompressed_len; | |
616 | cb->compressed_len = compressed_len; | |
261507a0 | 617 | cb->compress_type = extent_compress_type(bio_flags); |
c8b97818 CM |
618 | cb->orig_bio = bio; |
619 | ||
09cbfeaf | 620 | nr_pages = DIV_ROUND_UP(compressed_len, PAGE_SIZE); |
31e818fe | 621 | cb->compressed_pages = kcalloc(nr_pages, sizeof(struct page *), |
c8b97818 | 622 | GFP_NOFS); |
6b82ce8d | 623 | if (!cb->compressed_pages) |
624 | goto fail1; | |
625 | ||
c8b97818 CM |
626 | bdev = BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev; |
627 | ||
306e16ce DS |
628 | for (pg_index = 0; pg_index < nr_pages; pg_index++) { |
629 | cb->compressed_pages[pg_index] = alloc_page(GFP_NOFS | | |
c8b97818 | 630 | __GFP_HIGHMEM); |
15e3004a JB |
631 | if (!cb->compressed_pages[pg_index]) { |
632 | faili = pg_index - 1; | |
633 | ret = -ENOMEM; | |
6b82ce8d | 634 | goto fail2; |
15e3004a | 635 | } |
c8b97818 | 636 | } |
15e3004a | 637 | faili = nr_pages - 1; |
c8b97818 CM |
638 | cb->nr_pages = nr_pages; |
639 | ||
7f042a83 | 640 | add_ra_bio_pages(inode, em_start + em_len, cb); |
771ed689 | 641 | |
771ed689 | 642 | /* include any pages we added in add_ra-bio_pages */ |
09cbfeaf | 643 | uncompressed_len = bio->bi_vcnt * PAGE_SIZE; |
771ed689 CM |
644 | cb->len = uncompressed_len; |
645 | ||
c8b97818 | 646 | comp_bio = compressed_bio_alloc(bdev, cur_disk_byte, GFP_NOFS); |
6b82ce8d | 647 | if (!comp_bio) |
648 | goto fail2; | |
c8b97818 CM |
649 | comp_bio->bi_private = cb; |
650 | comp_bio->bi_end_io = end_compressed_bio_read; | |
651 | atomic_inc(&cb->pending_bios); | |
652 | ||
306e16ce DS |
653 | for (pg_index = 0; pg_index < nr_pages; pg_index++) { |
654 | page = cb->compressed_pages[pg_index]; | |
c8b97818 | 655 | page->mapping = inode->i_mapping; |
09cbfeaf | 656 | page->index = em_start >> PAGE_SHIFT; |
d20f7043 | 657 | |
4f024f37 | 658 | if (comp_bio->bi_iter.bi_size) |
64a16701 | 659 | ret = tree->ops->merge_bio_hook(READ, page, 0, |
09cbfeaf | 660 | PAGE_SIZE, |
c8b97818 CM |
661 | comp_bio, 0); |
662 | else | |
663 | ret = 0; | |
664 | ||
70b99e69 | 665 | page->mapping = NULL; |
09cbfeaf KS |
666 | if (ret || bio_add_page(comp_bio, page, PAGE_SIZE, 0) < |
667 | PAGE_SIZE) { | |
c8b97818 CM |
668 | bio_get(comp_bio); |
669 | ||
bfebd8b5 DS |
670 | ret = btrfs_bio_wq_end_io(root->fs_info, comp_bio, |
671 | BTRFS_WQ_ENDIO_DATA); | |
79787eaa | 672 | BUG_ON(ret); /* -ENOMEM */ |
c8b97818 | 673 | |
af09abfe CM |
674 | /* |
675 | * inc the count before we submit the bio so | |
676 | * we know the end IO handler won't happen before | |
677 | * we inc the count. Otherwise, the cb might get | |
678 | * freed before we're done setting it up | |
679 | */ | |
680 | atomic_inc(&cb->pending_bios); | |
681 | ||
6cbff00f | 682 | if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)) { |
c2db1073 TI |
683 | ret = btrfs_lookup_bio_sums(root, inode, |
684 | comp_bio, sums); | |
79787eaa | 685 | BUG_ON(ret); /* -ENOMEM */ |
d20f7043 | 686 | } |
ed6078f7 DS |
687 | sums += DIV_ROUND_UP(comp_bio->bi_iter.bi_size, |
688 | root->sectorsize); | |
d20f7043 CM |
689 | |
690 | ret = btrfs_map_bio(root, READ, comp_bio, | |
691 | mirror_num, 0); | |
4246a0b6 CH |
692 | if (ret) { |
693 | bio->bi_error = ret; | |
694 | bio_endio(comp_bio); | |
695 | } | |
c8b97818 CM |
696 | |
697 | bio_put(comp_bio); | |
698 | ||
699 | comp_bio = compressed_bio_alloc(bdev, cur_disk_byte, | |
700 | GFP_NOFS); | |
e627ee7b | 701 | BUG_ON(!comp_bio); |
771ed689 CM |
702 | comp_bio->bi_private = cb; |
703 | comp_bio->bi_end_io = end_compressed_bio_read; | |
704 | ||
09cbfeaf | 705 | bio_add_page(comp_bio, page, PAGE_SIZE, 0); |
c8b97818 | 706 | } |
09cbfeaf | 707 | cur_disk_byte += PAGE_SIZE; |
c8b97818 CM |
708 | } |
709 | bio_get(comp_bio); | |
710 | ||
bfebd8b5 DS |
711 | ret = btrfs_bio_wq_end_io(root->fs_info, comp_bio, |
712 | BTRFS_WQ_ENDIO_DATA); | |
79787eaa | 713 | BUG_ON(ret); /* -ENOMEM */ |
c8b97818 | 714 | |
c2db1073 TI |
715 | if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)) { |
716 | ret = btrfs_lookup_bio_sums(root, inode, comp_bio, sums); | |
79787eaa | 717 | BUG_ON(ret); /* -ENOMEM */ |
c2db1073 | 718 | } |
d20f7043 CM |
719 | |
720 | ret = btrfs_map_bio(root, READ, comp_bio, mirror_num, 0); | |
4246a0b6 CH |
721 | if (ret) { |
722 | bio->bi_error = ret; | |
723 | bio_endio(comp_bio); | |
724 | } | |
c8b97818 CM |
725 | |
726 | bio_put(comp_bio); | |
727 | return 0; | |
6b82ce8d | 728 | |
729 | fail2: | |
15e3004a JB |
730 | while (faili >= 0) { |
731 | __free_page(cb->compressed_pages[faili]); | |
732 | faili--; | |
733 | } | |
6b82ce8d | 734 | |
735 | kfree(cb->compressed_pages); | |
736 | fail1: | |
737 | kfree(cb); | |
738 | out: | |
739 | free_extent_map(em); | |
740 | return ret; | |
c8b97818 | 741 | } |
261507a0 | 742 | |
d9187649 BL |
743 | static struct { |
744 | struct list_head idle_ws; | |
745 | spinlock_t ws_lock; | |
6ac10a6a DS |
746 | /* Number of free workspaces */ |
747 | int free_ws; | |
748 | /* Total number of allocated workspaces */ | |
749 | atomic_t total_ws; | |
750 | /* Waiters for a free workspace */ | |
d9187649 BL |
751 | wait_queue_head_t ws_wait; |
752 | } btrfs_comp_ws[BTRFS_COMPRESS_TYPES]; | |
261507a0 | 753 | |
e8c9f186 | 754 | static const struct btrfs_compress_op * const btrfs_compress_op[] = { |
261507a0 | 755 | &btrfs_zlib_compress, |
a6fa6fae | 756 | &btrfs_lzo_compress, |
261507a0 LZ |
757 | }; |
758 | ||
143bede5 | 759 | void __init btrfs_init_compress(void) |
261507a0 LZ |
760 | { |
761 | int i; | |
762 | ||
763 | for (i = 0; i < BTRFS_COMPRESS_TYPES; i++) { | |
f77dd0d6 DS |
764 | struct list_head *workspace; |
765 | ||
d9187649 BL |
766 | INIT_LIST_HEAD(&btrfs_comp_ws[i].idle_ws); |
767 | spin_lock_init(&btrfs_comp_ws[i].ws_lock); | |
6ac10a6a | 768 | atomic_set(&btrfs_comp_ws[i].total_ws, 0); |
d9187649 | 769 | init_waitqueue_head(&btrfs_comp_ws[i].ws_wait); |
f77dd0d6 DS |
770 | |
771 | /* | |
772 | * Preallocate one workspace for each compression type so | |
773 | * we can guarantee forward progress in the worst case | |
774 | */ | |
775 | workspace = btrfs_compress_op[i]->alloc_workspace(); | |
776 | if (IS_ERR(workspace)) { | |
777 | printk(KERN_WARNING | |
778 | "BTRFS: cannot preallocate compression workspace, will try later"); | |
779 | } else { | |
780 | atomic_set(&btrfs_comp_ws[i].total_ws, 1); | |
781 | btrfs_comp_ws[i].free_ws = 1; | |
782 | list_add(workspace, &btrfs_comp_ws[i].idle_ws); | |
783 | } | |
261507a0 | 784 | } |
261507a0 LZ |
785 | } |
786 | ||
787 | /* | |
788 | * this finds an available workspace or allocates a new one | |
789 | * ERR_PTR is returned if things go bad. | |
790 | */ | |
791 | static struct list_head *find_workspace(int type) | |
792 | { | |
793 | struct list_head *workspace; | |
794 | int cpus = num_online_cpus(); | |
795 | int idx = type - 1; | |
796 | ||
d9187649 BL |
797 | struct list_head *idle_ws = &btrfs_comp_ws[idx].idle_ws; |
798 | spinlock_t *ws_lock = &btrfs_comp_ws[idx].ws_lock; | |
6ac10a6a | 799 | atomic_t *total_ws = &btrfs_comp_ws[idx].total_ws; |
d9187649 | 800 | wait_queue_head_t *ws_wait = &btrfs_comp_ws[idx].ws_wait; |
6ac10a6a | 801 | int *free_ws = &btrfs_comp_ws[idx].free_ws; |
261507a0 | 802 | again: |
d9187649 BL |
803 | spin_lock(ws_lock); |
804 | if (!list_empty(idle_ws)) { | |
805 | workspace = idle_ws->next; | |
261507a0 | 806 | list_del(workspace); |
6ac10a6a | 807 | (*free_ws)--; |
d9187649 | 808 | spin_unlock(ws_lock); |
261507a0 LZ |
809 | return workspace; |
810 | ||
811 | } | |
6ac10a6a | 812 | if (atomic_read(total_ws) > cpus) { |
261507a0 LZ |
813 | DEFINE_WAIT(wait); |
814 | ||
d9187649 BL |
815 | spin_unlock(ws_lock); |
816 | prepare_to_wait(ws_wait, &wait, TASK_UNINTERRUPTIBLE); | |
6ac10a6a | 817 | if (atomic_read(total_ws) > cpus && !*free_ws) |
261507a0 | 818 | schedule(); |
d9187649 | 819 | finish_wait(ws_wait, &wait); |
261507a0 LZ |
820 | goto again; |
821 | } | |
6ac10a6a | 822 | atomic_inc(total_ws); |
d9187649 | 823 | spin_unlock(ws_lock); |
261507a0 LZ |
824 | |
825 | workspace = btrfs_compress_op[idx]->alloc_workspace(); | |
826 | if (IS_ERR(workspace)) { | |
6ac10a6a | 827 | atomic_dec(total_ws); |
d9187649 | 828 | wake_up(ws_wait); |
261507a0 LZ |
829 | } |
830 | return workspace; | |
831 | } | |
832 | ||
833 | /* | |
834 | * put a workspace struct back on the list or free it if we have enough | |
835 | * idle ones sitting around | |
836 | */ | |
837 | static void free_workspace(int type, struct list_head *workspace) | |
838 | { | |
839 | int idx = type - 1; | |
d9187649 BL |
840 | struct list_head *idle_ws = &btrfs_comp_ws[idx].idle_ws; |
841 | spinlock_t *ws_lock = &btrfs_comp_ws[idx].ws_lock; | |
6ac10a6a | 842 | atomic_t *total_ws = &btrfs_comp_ws[idx].total_ws; |
d9187649 | 843 | wait_queue_head_t *ws_wait = &btrfs_comp_ws[idx].ws_wait; |
6ac10a6a | 844 | int *free_ws = &btrfs_comp_ws[idx].free_ws; |
d9187649 BL |
845 | |
846 | spin_lock(ws_lock); | |
6ac10a6a | 847 | if (*free_ws < num_online_cpus()) { |
d9187649 | 848 | list_add(workspace, idle_ws); |
6ac10a6a | 849 | (*free_ws)++; |
d9187649 | 850 | spin_unlock(ws_lock); |
261507a0 LZ |
851 | goto wake; |
852 | } | |
d9187649 | 853 | spin_unlock(ws_lock); |
261507a0 LZ |
854 | |
855 | btrfs_compress_op[idx]->free_workspace(workspace); | |
6ac10a6a | 856 | atomic_dec(total_ws); |
261507a0 | 857 | wake: |
a83342aa DS |
858 | /* |
859 | * Make sure counter is updated before we wake up waiters. | |
860 | */ | |
66657b31 | 861 | smp_mb(); |
d9187649 BL |
862 | if (waitqueue_active(ws_wait)) |
863 | wake_up(ws_wait); | |
261507a0 LZ |
864 | } |
865 | ||
866 | /* | |
867 | * cleanup function for module exit | |
868 | */ | |
869 | static void free_workspaces(void) | |
870 | { | |
871 | struct list_head *workspace; | |
872 | int i; | |
873 | ||
874 | for (i = 0; i < BTRFS_COMPRESS_TYPES; i++) { | |
d9187649 BL |
875 | while (!list_empty(&btrfs_comp_ws[i].idle_ws)) { |
876 | workspace = btrfs_comp_ws[i].idle_ws.next; | |
261507a0 LZ |
877 | list_del(workspace); |
878 | btrfs_compress_op[i]->free_workspace(workspace); | |
6ac10a6a | 879 | atomic_dec(&btrfs_comp_ws[i].total_ws); |
261507a0 LZ |
880 | } |
881 | } | |
882 | } | |
883 | ||
884 | /* | |
885 | * given an address space and start/len, compress the bytes. | |
886 | * | |
887 | * pages are allocated to hold the compressed result and stored | |
888 | * in 'pages' | |
889 | * | |
890 | * out_pages is used to return the number of pages allocated. There | |
891 | * may be pages allocated even if we return an error | |
892 | * | |
893 | * total_in is used to return the number of bytes actually read. It | |
894 | * may be smaller then len if we had to exit early because we | |
895 | * ran out of room in the pages array or because we cross the | |
896 | * max_out threshold. | |
897 | * | |
898 | * total_out is used to return the total number of compressed bytes | |
899 | * | |
900 | * max_out tells us the max number of bytes that we're allowed to | |
901 | * stuff into pages | |
902 | */ | |
903 | int btrfs_compress_pages(int type, struct address_space *mapping, | |
904 | u64 start, unsigned long len, | |
905 | struct page **pages, | |
906 | unsigned long nr_dest_pages, | |
907 | unsigned long *out_pages, | |
908 | unsigned long *total_in, | |
909 | unsigned long *total_out, | |
910 | unsigned long max_out) | |
911 | { | |
912 | struct list_head *workspace; | |
913 | int ret; | |
914 | ||
915 | workspace = find_workspace(type); | |
916 | if (IS_ERR(workspace)) | |
774bcb35 | 917 | return PTR_ERR(workspace); |
261507a0 LZ |
918 | |
919 | ret = btrfs_compress_op[type-1]->compress_pages(workspace, mapping, | |
920 | start, len, pages, | |
921 | nr_dest_pages, out_pages, | |
922 | total_in, total_out, | |
923 | max_out); | |
924 | free_workspace(type, workspace); | |
925 | return ret; | |
926 | } | |
927 | ||
928 | /* | |
929 | * pages_in is an array of pages with compressed data. | |
930 | * | |
931 | * disk_start is the starting logical offset of this array in the file | |
932 | * | |
933 | * bvec is a bio_vec of pages from the file that we want to decompress into | |
934 | * | |
935 | * vcnt is the count of pages in the biovec | |
936 | * | |
937 | * srclen is the number of bytes in pages_in | |
938 | * | |
939 | * The basic idea is that we have a bio that was created by readpages. | |
940 | * The pages in the bio are for the uncompressed data, and they may not | |
941 | * be contiguous. They all correspond to the range of bytes covered by | |
942 | * the compressed extent. | |
943 | */ | |
48a3b636 ES |
944 | static int btrfs_decompress_biovec(int type, struct page **pages_in, |
945 | u64 disk_start, struct bio_vec *bvec, | |
946 | int vcnt, size_t srclen) | |
261507a0 LZ |
947 | { |
948 | struct list_head *workspace; | |
949 | int ret; | |
950 | ||
951 | workspace = find_workspace(type); | |
952 | if (IS_ERR(workspace)) | |
774bcb35 | 953 | return PTR_ERR(workspace); |
261507a0 LZ |
954 | |
955 | ret = btrfs_compress_op[type-1]->decompress_biovec(workspace, pages_in, | |
956 | disk_start, | |
957 | bvec, vcnt, srclen); | |
958 | free_workspace(type, workspace); | |
959 | return ret; | |
960 | } | |
961 | ||
962 | /* | |
963 | * a less complex decompression routine. Our compressed data fits in a | |
964 | * single page, and we want to read a single page out of it. | |
965 | * start_byte tells us the offset into the compressed data we're interested in | |
966 | */ | |
967 | int btrfs_decompress(int type, unsigned char *data_in, struct page *dest_page, | |
968 | unsigned long start_byte, size_t srclen, size_t destlen) | |
969 | { | |
970 | struct list_head *workspace; | |
971 | int ret; | |
972 | ||
973 | workspace = find_workspace(type); | |
974 | if (IS_ERR(workspace)) | |
774bcb35 | 975 | return PTR_ERR(workspace); |
261507a0 LZ |
976 | |
977 | ret = btrfs_compress_op[type-1]->decompress(workspace, data_in, | |
978 | dest_page, start_byte, | |
979 | srclen, destlen); | |
980 | ||
981 | free_workspace(type, workspace); | |
982 | return ret; | |
983 | } | |
984 | ||
8e4eef7a | 985 | void btrfs_exit_compress(void) |
261507a0 LZ |
986 | { |
987 | free_workspaces(); | |
988 | } | |
3a39c18d LZ |
989 | |
990 | /* | |
991 | * Copy uncompressed data from working buffer to pages. | |
992 | * | |
993 | * buf_start is the byte offset we're of the start of our workspace buffer. | |
994 | * | |
995 | * total_out is the last byte of the buffer | |
996 | */ | |
997 | int btrfs_decompress_buf2page(char *buf, unsigned long buf_start, | |
998 | unsigned long total_out, u64 disk_start, | |
999 | struct bio_vec *bvec, int vcnt, | |
306e16ce | 1000 | unsigned long *pg_index, |
3a39c18d LZ |
1001 | unsigned long *pg_offset) |
1002 | { | |
1003 | unsigned long buf_offset; | |
1004 | unsigned long current_buf_start; | |
1005 | unsigned long start_byte; | |
1006 | unsigned long working_bytes = total_out - buf_start; | |
1007 | unsigned long bytes; | |
1008 | char *kaddr; | |
306e16ce | 1009 | struct page *page_out = bvec[*pg_index].bv_page; |
3a39c18d LZ |
1010 | |
1011 | /* | |
1012 | * start byte is the first byte of the page we're currently | |
1013 | * copying into relative to the start of the compressed data. | |
1014 | */ | |
1015 | start_byte = page_offset(page_out) - disk_start; | |
1016 | ||
1017 | /* we haven't yet hit data corresponding to this page */ | |
1018 | if (total_out <= start_byte) | |
1019 | return 1; | |
1020 | ||
1021 | /* | |
1022 | * the start of the data we care about is offset into | |
1023 | * the middle of our working buffer | |
1024 | */ | |
1025 | if (total_out > start_byte && buf_start < start_byte) { | |
1026 | buf_offset = start_byte - buf_start; | |
1027 | working_bytes -= buf_offset; | |
1028 | } else { | |
1029 | buf_offset = 0; | |
1030 | } | |
1031 | current_buf_start = buf_start; | |
1032 | ||
1033 | /* copy bytes from the working buffer into the pages */ | |
1034 | while (working_bytes > 0) { | |
09cbfeaf KS |
1035 | bytes = min(PAGE_SIZE - *pg_offset, |
1036 | PAGE_SIZE - buf_offset); | |
3a39c18d | 1037 | bytes = min(bytes, working_bytes); |
7ac687d9 | 1038 | kaddr = kmap_atomic(page_out); |
3a39c18d | 1039 | memcpy(kaddr + *pg_offset, buf + buf_offset, bytes); |
7ac687d9 | 1040 | kunmap_atomic(kaddr); |
3a39c18d LZ |
1041 | flush_dcache_page(page_out); |
1042 | ||
1043 | *pg_offset += bytes; | |
1044 | buf_offset += bytes; | |
1045 | working_bytes -= bytes; | |
1046 | current_buf_start += bytes; | |
1047 | ||
1048 | /* check if we need to pick another page */ | |
09cbfeaf | 1049 | if (*pg_offset == PAGE_SIZE) { |
306e16ce DS |
1050 | (*pg_index)++; |
1051 | if (*pg_index >= vcnt) | |
3a39c18d LZ |
1052 | return 0; |
1053 | ||
306e16ce | 1054 | page_out = bvec[*pg_index].bv_page; |
3a39c18d LZ |
1055 | *pg_offset = 0; |
1056 | start_byte = page_offset(page_out) - disk_start; | |
1057 | ||
1058 | /* | |
1059 | * make sure our new page is covered by this | |
1060 | * working buffer | |
1061 | */ | |
1062 | if (total_out <= start_byte) | |
1063 | return 1; | |
1064 | ||
1065 | /* | |
1066 | * the next page in the biovec might not be adjacent | |
1067 | * to the last page, but it might still be found | |
1068 | * inside this working buffer. bump our offset pointer | |
1069 | */ | |
1070 | if (total_out > start_byte && | |
1071 | current_buf_start < start_byte) { | |
1072 | buf_offset = start_byte - buf_start; | |
1073 | working_bytes = total_out - start_byte; | |
1074 | current_buf_start = buf_start + buf_offset; | |
1075 | } | |
1076 | } | |
1077 | } | |
1078 | ||
1079 | return 1; | |
1080 | } | |
2f19cad9 CM |
1081 | |
1082 | /* | |
1083 | * When uncompressing data, we need to make sure and zero any parts of | |
1084 | * the biovec that were not filled in by the decompression code. pg_index | |
1085 | * and pg_offset indicate the last page and the last offset of that page | |
1086 | * that have been filled in. This will zero everything remaining in the | |
1087 | * biovec. | |
1088 | */ | |
1089 | void btrfs_clear_biovec_end(struct bio_vec *bvec, int vcnt, | |
1090 | unsigned long pg_index, | |
1091 | unsigned long pg_offset) | |
1092 | { | |
1093 | while (pg_index < vcnt) { | |
1094 | struct page *page = bvec[pg_index].bv_page; | |
1095 | unsigned long off = bvec[pg_index].bv_offset; | |
1096 | unsigned long len = bvec[pg_index].bv_len; | |
1097 | ||
1098 | if (pg_offset < off) | |
1099 | pg_offset = off; | |
1100 | if (pg_offset < off + len) { | |
1101 | unsigned long bytes = off + len - pg_offset; | |
1102 | char *kaddr; | |
1103 | ||
1104 | kaddr = kmap_atomic(page); | |
1105 | memset(kaddr + pg_offset, 0, bytes); | |
1106 | kunmap_atomic(kaddr); | |
1107 | } | |
1108 | pg_index++; | |
1109 | pg_offset = 0; | |
1110 | } | |
1111 | } |