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