2 * Copyright (C) 2008 Oracle. All rights reserved.
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.
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.
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.
19 #include <linux/kernel.h>
20 #include <linux/bio.h>
21 #include <linux/buffer_head.h>
22 #include <linux/file.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>
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>
34 #include <linux/slab.h>
38 #include "transaction.h"
39 #include "btrfs_inode.h"
41 #include "ordered-data.h"
42 #include "compression.h"
43 #include "extent_io.h"
44 #include "extent_map.h"
46 struct compressed_bio
{
47 /* number of bios pending for this compressed extent */
48 atomic_t pending_bios
;
50 /* the pages with the compressed data on them */
51 struct page
**compressed_pages
;
53 /* inode that owns this data */
56 /* starting offset in the inode for our pages */
59 /* number of bytes in the inode we're working on */
62 /* number of bytes on disk */
63 unsigned long compressed_len
;
65 /* the compression algorithm for this bio */
68 /* number of compressed pages in the array */
69 unsigned long nr_pages
;
75 /* for reads, this is the bio we are copying the data into */
79 * the start of a variable length array of checksums only
85 static inline int compressed_bio_size(struct btrfs_root
*root
,
86 unsigned long disk_size
)
88 u16 csum_size
= btrfs_super_csum_size(root
->fs_info
->super_copy
);
90 return sizeof(struct compressed_bio
) +
91 ((disk_size
+ root
->sectorsize
- 1) / root
->sectorsize
) *
95 static struct bio
*compressed_bio_alloc(struct block_device
*bdev
,
96 u64 first_byte
, gfp_t gfp_flags
)
100 nr_vecs
= bio_get_nr_vecs(bdev
);
101 return btrfs_bio_alloc(bdev
, first_byte
>> 9, nr_vecs
, gfp_flags
);
104 static int check_compressed_csum(struct inode
*inode
,
105 struct compressed_bio
*cb
,
109 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
114 u32
*cb_sum
= &cb
->sums
;
116 if (BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATASUM
)
119 for (i
= 0; i
< cb
->nr_pages
; i
++) {
120 page
= cb
->compressed_pages
[i
];
123 kaddr
= kmap_atomic(page
, KM_USER0
);
124 csum
= btrfs_csum_data(root
, kaddr
, csum
, PAGE_CACHE_SIZE
);
125 btrfs_csum_final(csum
, (char *)&csum
);
126 kunmap_atomic(kaddr
, KM_USER0
);
128 if (csum
!= *cb_sum
) {
129 printk(KERN_INFO
"btrfs csum failed ino %llu "
130 "extent %llu csum %u "
131 "wanted %u mirror %d\n",
132 (unsigned long long)btrfs_ino(inode
),
133 (unsigned long long)disk_start
,
134 csum
, *cb_sum
, cb
->mirror_num
);
146 /* when we finish reading compressed pages from the disk, we
147 * decompress them and then run the bio end_io routines on the
148 * decompressed pages (in the inode address space).
150 * This allows the checksumming and other IO error handling routines
153 * The compressed pages are freed here, and it must be run
156 static void end_compressed_bio_read(struct bio
*bio
, int err
)
158 struct compressed_bio
*cb
= bio
->bi_private
;
167 /* if there are more bios still pending for this compressed
170 if (!atomic_dec_and_test(&cb
->pending_bios
))
174 ret
= check_compressed_csum(inode
, cb
, (u64
)bio
->bi_sector
<< 9);
178 /* ok, we're the last bio for this extent, lets start
181 ret
= btrfs_decompress_biovec(cb
->compress_type
,
182 cb
->compressed_pages
,
184 cb
->orig_bio
->bi_io_vec
,
185 cb
->orig_bio
->bi_vcnt
,
191 /* release the compressed pages */
193 for (index
= 0; index
< cb
->nr_pages
; index
++) {
194 page
= cb
->compressed_pages
[index
];
195 page
->mapping
= NULL
;
196 page_cache_release(page
);
199 /* do io completion on the original bio */
201 bio_io_error(cb
->orig_bio
);
204 struct bio_vec
*bvec
= cb
->orig_bio
->bi_io_vec
;
207 * we have verified the checksum already, set page
208 * checked so the end_io handlers know about it
210 while (bio_index
< cb
->orig_bio
->bi_vcnt
) {
211 SetPageChecked(bvec
->bv_page
);
215 bio_endio(cb
->orig_bio
, 0);
218 /* finally free the cb struct */
219 kfree(cb
->compressed_pages
);
226 * Clear the writeback bits on all of the file
227 * pages for a compressed write
229 static noinline
void end_compressed_writeback(struct inode
*inode
, u64 start
,
230 unsigned long ram_size
)
232 unsigned long index
= start
>> PAGE_CACHE_SHIFT
;
233 unsigned long end_index
= (start
+ ram_size
- 1) >> PAGE_CACHE_SHIFT
;
234 struct page
*pages
[16];
235 unsigned long nr_pages
= end_index
- index
+ 1;
239 while (nr_pages
> 0) {
240 ret
= find_get_pages_contig(inode
->i_mapping
, index
,
242 nr_pages
, ARRAY_SIZE(pages
)), pages
);
248 for (i
= 0; i
< ret
; i
++) {
249 end_page_writeback(pages
[i
]);
250 page_cache_release(pages
[i
]);
255 /* the inode may be gone now */
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
263 * This also calls the writeback end hooks for the file pages so that
264 * metadata and checksums can be updated in the file.
266 static void end_compressed_bio_write(struct bio
*bio
, int err
)
268 struct extent_io_tree
*tree
;
269 struct compressed_bio
*cb
= bio
->bi_private
;
277 /* if there are more bios still pending for this compressed
280 if (!atomic_dec_and_test(&cb
->pending_bios
))
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
287 tree
= &BTRFS_I(inode
)->io_tree
;
288 cb
->compressed_pages
[0]->mapping
= cb
->inode
->i_mapping
;
289 tree
->ops
->writepage_end_io_hook(cb
->compressed_pages
[0],
291 cb
->start
+ cb
->len
- 1,
293 cb
->compressed_pages
[0]->mapping
= NULL
;
295 end_compressed_writeback(inode
, cb
->start
, cb
->len
);
296 /* note, our inode could be gone now */
299 * release the compressed pages, these came from alloc_page and
300 * are not attached to the inode at all
303 for (index
= 0; index
< cb
->nr_pages
; index
++) {
304 page
= cb
->compressed_pages
[index
];
305 page
->mapping
= NULL
;
306 page_cache_release(page
);
309 /* finally free the cb struct */
310 kfree(cb
->compressed_pages
);
317 * worker function to build and submit bios for previously compressed pages.
318 * The corresponding pages in the inode should be marked for writeback
319 * and the compressed pages should have a reference on them for dropping
320 * when the IO is complete.
322 * This also checksums the file bytes and gets things ready for
325 int btrfs_submit_compressed_write(struct inode
*inode
, u64 start
,
326 unsigned long len
, u64 disk_start
,
327 unsigned long compressed_len
,
328 struct page
**compressed_pages
,
329 unsigned long nr_pages
)
331 struct bio
*bio
= NULL
;
332 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
333 struct compressed_bio
*cb
;
334 unsigned long bytes_left
;
335 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
338 u64 first_byte
= disk_start
;
339 struct block_device
*bdev
;
341 int skip_sum
= BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATASUM
;
343 WARN_ON(start
& ((u64
)PAGE_CACHE_SIZE
- 1));
344 cb
= kmalloc(compressed_bio_size(root
, compressed_len
), GFP_NOFS
);
347 atomic_set(&cb
->pending_bios
, 0);
353 cb
->compressed_pages
= compressed_pages
;
354 cb
->compressed_len
= compressed_len
;
356 cb
->nr_pages
= nr_pages
;
358 bdev
= BTRFS_I(inode
)->root
->fs_info
->fs_devices
->latest_bdev
;
360 bio
= compressed_bio_alloc(bdev
, first_byte
, GFP_NOFS
);
365 bio
->bi_private
= cb
;
366 bio
->bi_end_io
= end_compressed_bio_write
;
367 atomic_inc(&cb
->pending_bios
);
369 /* create and submit bios for the compressed pages */
370 bytes_left
= compressed_len
;
371 for (pg_index
= 0; pg_index
< cb
->nr_pages
; pg_index
++) {
372 page
= compressed_pages
[pg_index
];
373 page
->mapping
= inode
->i_mapping
;
375 ret
= io_tree
->ops
->merge_bio_hook(page
, 0,
381 page
->mapping
= NULL
;
382 if (ret
|| bio_add_page(bio
, page
, PAGE_CACHE_SIZE
, 0) <
387 * inc the count before we submit the bio so
388 * we know the end IO handler won't happen before
389 * we inc the count. Otherwise, the cb might get
390 * freed before we're done setting it up
392 atomic_inc(&cb
->pending_bios
);
393 ret
= btrfs_bio_wq_end_io(root
->fs_info
, bio
, 0);
397 ret
= btrfs_csum_one_bio(root
, inode
, bio
,
402 ret
= btrfs_map_bio(root
, WRITE
, bio
, 0, 1);
407 bio
= compressed_bio_alloc(bdev
, first_byte
, GFP_NOFS
);
408 bio
->bi_private
= cb
;
409 bio
->bi_end_io
= end_compressed_bio_write
;
410 bio_add_page(bio
, page
, PAGE_CACHE_SIZE
, 0);
412 if (bytes_left
< PAGE_CACHE_SIZE
) {
413 printk("bytes left %lu compress len %lu nr %lu\n",
414 bytes_left
, cb
->compressed_len
, cb
->nr_pages
);
416 bytes_left
-= PAGE_CACHE_SIZE
;
417 first_byte
+= PAGE_CACHE_SIZE
;
422 ret
= btrfs_bio_wq_end_io(root
->fs_info
, bio
, 0);
426 ret
= btrfs_csum_one_bio(root
, inode
, bio
, start
, 1);
430 ret
= btrfs_map_bio(root
, WRITE
, bio
, 0, 1);
437 static noinline
int add_ra_bio_pages(struct inode
*inode
,
439 struct compressed_bio
*cb
)
441 unsigned long end_index
;
442 unsigned long pg_index
;
444 u64 isize
= i_size_read(inode
);
447 unsigned long nr_pages
= 0;
448 struct extent_map
*em
;
449 struct address_space
*mapping
= inode
->i_mapping
;
450 struct extent_map_tree
*em_tree
;
451 struct extent_io_tree
*tree
;
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
;
463 end_index
= (i_size_read(inode
) - 1) >> PAGE_CACHE_SHIFT
;
465 while (last_offset
< compressed_end
) {
466 pg_index
= last_offset
>> PAGE_CACHE_SHIFT
;
468 if (pg_index
> end_index
)
472 page
= radix_tree_lookup(&mapping
->page_tree
, pg_index
);
481 page
= __page_cache_alloc(mapping_gfp_mask(mapping
) &
486 if (add_to_page_cache_lru(page
, mapping
, pg_index
,
488 page_cache_release(page
);
492 end
= last_offset
+ PAGE_CACHE_SIZE
- 1;
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.
498 set_page_extent_mapped(page
);
499 lock_extent(tree
, last_offset
, end
, GFP_NOFS
);
500 read_lock(&em_tree
->lock
);
501 em
= lookup_extent_mapping(em_tree
, last_offset
,
503 read_unlock(&em_tree
->lock
);
505 if (!em
|| last_offset
< em
->start
||
506 (last_offset
+ PAGE_CACHE_SIZE
> extent_map_end(em
)) ||
507 (em
->block_start
>> 9) != cb
->orig_bio
->bi_sector
) {
509 unlock_extent(tree
, last_offset
, end
, GFP_NOFS
);
511 page_cache_release(page
);
516 if (page
->index
== end_index
) {
518 size_t zero_offset
= isize
& (PAGE_CACHE_SIZE
- 1);
522 zeros
= PAGE_CACHE_SIZE
- zero_offset
;
523 userpage
= kmap_atomic(page
, KM_USER0
);
524 memset(userpage
+ zero_offset
, 0, zeros
);
525 flush_dcache_page(page
);
526 kunmap_atomic(userpage
, KM_USER0
);
530 ret
= bio_add_page(cb
->orig_bio
, page
,
533 if (ret
== PAGE_CACHE_SIZE
) {
535 page_cache_release(page
);
537 unlock_extent(tree
, last_offset
, end
, GFP_NOFS
);
539 page_cache_release(page
);
543 last_offset
+= PAGE_CACHE_SIZE
;
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.
553 * bio->bi_sector points to the compressed extent on disk
554 * bio->bi_io_vec points to all of the inode pages
555 * bio->bi_vcnt is a count of pages
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
560 int btrfs_submit_compressed_read(struct inode
*inode
, struct bio
*bio
,
561 int mirror_num
, unsigned long bio_flags
)
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
;
570 unsigned long pg_index
;
572 struct block_device
*bdev
;
573 struct bio
*comp_bio
;
574 u64 cur_disk_byte
= (u64
)bio
->bi_sector
<< 9;
577 struct extent_map
*em
;
581 tree
= &BTRFS_I(inode
)->io_tree
;
582 em_tree
= &BTRFS_I(inode
)->extent_tree
;
584 /* we need the actual starting offset of this extent in the file */
585 read_lock(&em_tree
->lock
);
586 em
= lookup_extent_mapping(em_tree
,
587 page_offset(bio
->bi_io_vec
->bv_page
),
589 read_unlock(&em_tree
->lock
);
593 compressed_len
= em
->block_len
;
594 cb
= kmalloc(compressed_bio_size(root
, compressed_len
), GFP_NOFS
);
598 atomic_set(&cb
->pending_bios
, 0);
601 cb
->mirror_num
= mirror_num
;
604 cb
->start
= em
->orig_start
;
606 em_start
= em
->start
;
611 cb
->len
= uncompressed_len
;
612 cb
->compressed_len
= compressed_len
;
613 cb
->compress_type
= extent_compress_type(bio_flags
);
616 nr_pages
= (compressed_len
+ PAGE_CACHE_SIZE
- 1) /
618 cb
->compressed_pages
= kzalloc(sizeof(struct page
*) * nr_pages
,
620 if (!cb
->compressed_pages
)
623 bdev
= BTRFS_I(inode
)->root
->fs_info
->fs_devices
->latest_bdev
;
625 for (pg_index
= 0; pg_index
< nr_pages
; pg_index
++) {
626 cb
->compressed_pages
[pg_index
] = alloc_page(GFP_NOFS
|
628 if (!cb
->compressed_pages
[pg_index
])
631 cb
->nr_pages
= nr_pages
;
633 add_ra_bio_pages(inode
, em_start
+ em_len
, cb
);
635 /* include any pages we added in add_ra-bio_pages */
636 uncompressed_len
= bio
->bi_vcnt
* PAGE_CACHE_SIZE
;
637 cb
->len
= uncompressed_len
;
639 comp_bio
= compressed_bio_alloc(bdev
, cur_disk_byte
, GFP_NOFS
);
642 comp_bio
->bi_private
= cb
;
643 comp_bio
->bi_end_io
= end_compressed_bio_read
;
644 atomic_inc(&cb
->pending_bios
);
646 for (pg_index
= 0; pg_index
< nr_pages
; pg_index
++) {
647 page
= cb
->compressed_pages
[pg_index
];
648 page
->mapping
= inode
->i_mapping
;
649 page
->index
= em_start
>> PAGE_CACHE_SHIFT
;
651 if (comp_bio
->bi_size
)
652 ret
= tree
->ops
->merge_bio_hook(page
, 0,
658 page
->mapping
= NULL
;
659 if (ret
|| bio_add_page(comp_bio
, page
, PAGE_CACHE_SIZE
, 0) <
663 ret
= btrfs_bio_wq_end_io(root
->fs_info
, comp_bio
, 0);
667 * inc the count before we submit the bio so
668 * we know the end IO handler won't happen before
669 * we inc the count. Otherwise, the cb might get
670 * freed before we're done setting it up
672 atomic_inc(&cb
->pending_bios
);
674 if (!(BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATASUM
)) {
675 ret
= btrfs_lookup_bio_sums(root
, inode
,
679 sums
+= (comp_bio
->bi_size
+ root
->sectorsize
- 1) /
682 ret
= btrfs_map_bio(root
, READ
, comp_bio
,
688 comp_bio
= compressed_bio_alloc(bdev
, cur_disk_byte
,
690 comp_bio
->bi_private
= cb
;
691 comp_bio
->bi_end_io
= end_compressed_bio_read
;
693 bio_add_page(comp_bio
, page
, PAGE_CACHE_SIZE
, 0);
695 cur_disk_byte
+= PAGE_CACHE_SIZE
;
699 ret
= btrfs_bio_wq_end_io(root
->fs_info
, comp_bio
, 0);
702 if (!(BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATASUM
)) {
703 ret
= btrfs_lookup_bio_sums(root
, inode
, comp_bio
, sums
);
707 ret
= btrfs_map_bio(root
, READ
, comp_bio
, mirror_num
, 0);
714 for (pg_index
= 0; pg_index
< nr_pages
; pg_index
++)
715 free_page((unsigned long)cb
->compressed_pages
[pg_index
]);
717 kfree(cb
->compressed_pages
);
725 static struct list_head comp_idle_workspace
[BTRFS_COMPRESS_TYPES
];
726 static spinlock_t comp_workspace_lock
[BTRFS_COMPRESS_TYPES
];
727 static int comp_num_workspace
[BTRFS_COMPRESS_TYPES
];
728 static atomic_t comp_alloc_workspace
[BTRFS_COMPRESS_TYPES
];
729 static wait_queue_head_t comp_workspace_wait
[BTRFS_COMPRESS_TYPES
];
731 struct btrfs_compress_op
*btrfs_compress_op
[] = {
732 &btrfs_zlib_compress
,
736 void __init
btrfs_init_compress(void)
740 for (i
= 0; i
< BTRFS_COMPRESS_TYPES
; i
++) {
741 INIT_LIST_HEAD(&comp_idle_workspace
[i
]);
742 spin_lock_init(&comp_workspace_lock
[i
]);
743 atomic_set(&comp_alloc_workspace
[i
], 0);
744 init_waitqueue_head(&comp_workspace_wait
[i
]);
749 * this finds an available workspace or allocates a new one
750 * ERR_PTR is returned if things go bad.
752 static struct list_head
*find_workspace(int type
)
754 struct list_head
*workspace
;
755 int cpus
= num_online_cpus();
758 struct list_head
*idle_workspace
= &comp_idle_workspace
[idx
];
759 spinlock_t
*workspace_lock
= &comp_workspace_lock
[idx
];
760 atomic_t
*alloc_workspace
= &comp_alloc_workspace
[idx
];
761 wait_queue_head_t
*workspace_wait
= &comp_workspace_wait
[idx
];
762 int *num_workspace
= &comp_num_workspace
[idx
];
764 spin_lock(workspace_lock
);
765 if (!list_empty(idle_workspace
)) {
766 workspace
= idle_workspace
->next
;
769 spin_unlock(workspace_lock
);
773 if (atomic_read(alloc_workspace
) > cpus
) {
776 spin_unlock(workspace_lock
);
777 prepare_to_wait(workspace_wait
, &wait
, TASK_UNINTERRUPTIBLE
);
778 if (atomic_read(alloc_workspace
) > cpus
&& !*num_workspace
)
780 finish_wait(workspace_wait
, &wait
);
783 atomic_inc(alloc_workspace
);
784 spin_unlock(workspace_lock
);
786 workspace
= btrfs_compress_op
[idx
]->alloc_workspace();
787 if (IS_ERR(workspace
)) {
788 atomic_dec(alloc_workspace
);
789 wake_up(workspace_wait
);
795 * put a workspace struct back on the list or free it if we have enough
796 * idle ones sitting around
798 static void free_workspace(int type
, struct list_head
*workspace
)
801 struct list_head
*idle_workspace
= &comp_idle_workspace
[idx
];
802 spinlock_t
*workspace_lock
= &comp_workspace_lock
[idx
];
803 atomic_t
*alloc_workspace
= &comp_alloc_workspace
[idx
];
804 wait_queue_head_t
*workspace_wait
= &comp_workspace_wait
[idx
];
805 int *num_workspace
= &comp_num_workspace
[idx
];
807 spin_lock(workspace_lock
);
808 if (*num_workspace
< num_online_cpus()) {
809 list_add_tail(workspace
, idle_workspace
);
811 spin_unlock(workspace_lock
);
814 spin_unlock(workspace_lock
);
816 btrfs_compress_op
[idx
]->free_workspace(workspace
);
817 atomic_dec(alloc_workspace
);
819 if (waitqueue_active(workspace_wait
))
820 wake_up(workspace_wait
);
824 * cleanup function for module exit
826 static void free_workspaces(void)
828 struct list_head
*workspace
;
831 for (i
= 0; i
< BTRFS_COMPRESS_TYPES
; i
++) {
832 while (!list_empty(&comp_idle_workspace
[i
])) {
833 workspace
= comp_idle_workspace
[i
].next
;
835 btrfs_compress_op
[i
]->free_workspace(workspace
);
836 atomic_dec(&comp_alloc_workspace
[i
]);
842 * given an address space and start/len, compress the bytes.
844 * pages are allocated to hold the compressed result and stored
847 * out_pages is used to return the number of pages allocated. There
848 * may be pages allocated even if we return an error
850 * total_in is used to return the number of bytes actually read. It
851 * may be smaller then len if we had to exit early because we
852 * ran out of room in the pages array or because we cross the
855 * total_out is used to return the total number of compressed bytes
857 * max_out tells us the max number of bytes that we're allowed to
860 int btrfs_compress_pages(int type
, struct address_space
*mapping
,
861 u64 start
, unsigned long len
,
863 unsigned long nr_dest_pages
,
864 unsigned long *out_pages
,
865 unsigned long *total_in
,
866 unsigned long *total_out
,
867 unsigned long max_out
)
869 struct list_head
*workspace
;
872 workspace
= find_workspace(type
);
873 if (IS_ERR(workspace
))
876 ret
= btrfs_compress_op
[type
-1]->compress_pages(workspace
, mapping
,
878 nr_dest_pages
, out_pages
,
881 free_workspace(type
, workspace
);
886 * pages_in is an array of pages with compressed data.
888 * disk_start is the starting logical offset of this array in the file
890 * bvec is a bio_vec of pages from the file that we want to decompress into
892 * vcnt is the count of pages in the biovec
894 * srclen is the number of bytes in pages_in
896 * The basic idea is that we have a bio that was created by readpages.
897 * The pages in the bio are for the uncompressed data, and they may not
898 * be contiguous. They all correspond to the range of bytes covered by
899 * the compressed extent.
901 int btrfs_decompress_biovec(int type
, struct page
**pages_in
, u64 disk_start
,
902 struct bio_vec
*bvec
, int vcnt
, size_t srclen
)
904 struct list_head
*workspace
;
907 workspace
= find_workspace(type
);
908 if (IS_ERR(workspace
))
911 ret
= btrfs_compress_op
[type
-1]->decompress_biovec(workspace
, pages_in
,
914 free_workspace(type
, workspace
);
919 * a less complex decompression routine. Our compressed data fits in a
920 * single page, and we want to read a single page out of it.
921 * start_byte tells us the offset into the compressed data we're interested in
923 int btrfs_decompress(int type
, unsigned char *data_in
, struct page
*dest_page
,
924 unsigned long start_byte
, size_t srclen
, size_t destlen
)
926 struct list_head
*workspace
;
929 workspace
= find_workspace(type
);
930 if (IS_ERR(workspace
))
933 ret
= btrfs_compress_op
[type
-1]->decompress(workspace
, data_in
,
934 dest_page
, start_byte
,
937 free_workspace(type
, workspace
);
941 void btrfs_exit_compress(void)
947 * Copy uncompressed data from working buffer to pages.
949 * buf_start is the byte offset we're of the start of our workspace buffer.
951 * total_out is the last byte of the buffer
953 int btrfs_decompress_buf2page(char *buf
, unsigned long buf_start
,
954 unsigned long total_out
, u64 disk_start
,
955 struct bio_vec
*bvec
, int vcnt
,
956 unsigned long *pg_index
,
957 unsigned long *pg_offset
)
959 unsigned long buf_offset
;
960 unsigned long current_buf_start
;
961 unsigned long start_byte
;
962 unsigned long working_bytes
= total_out
- buf_start
;
965 struct page
*page_out
= bvec
[*pg_index
].bv_page
;
968 * start byte is the first byte of the page we're currently
969 * copying into relative to the start of the compressed data.
971 start_byte
= page_offset(page_out
) - disk_start
;
973 /* we haven't yet hit data corresponding to this page */
974 if (total_out
<= start_byte
)
978 * the start of the data we care about is offset into
979 * the middle of our working buffer
981 if (total_out
> start_byte
&& buf_start
< start_byte
) {
982 buf_offset
= start_byte
- buf_start
;
983 working_bytes
-= buf_offset
;
987 current_buf_start
= buf_start
;
989 /* copy bytes from the working buffer into the pages */
990 while (working_bytes
> 0) {
991 bytes
= min(PAGE_CACHE_SIZE
- *pg_offset
,
992 PAGE_CACHE_SIZE
- buf_offset
);
993 bytes
= min(bytes
, working_bytes
);
994 kaddr
= kmap_atomic(page_out
, KM_USER0
);
995 memcpy(kaddr
+ *pg_offset
, buf
+ buf_offset
, bytes
);
996 kunmap_atomic(kaddr
, KM_USER0
);
997 flush_dcache_page(page_out
);
1000 buf_offset
+= bytes
;
1001 working_bytes
-= bytes
;
1002 current_buf_start
+= bytes
;
1004 /* check if we need to pick another page */
1005 if (*pg_offset
== PAGE_CACHE_SIZE
) {
1007 if (*pg_index
>= vcnt
)
1010 page_out
= bvec
[*pg_index
].bv_page
;
1012 start_byte
= page_offset(page_out
) - disk_start
;
1015 * make sure our new page is covered by this
1018 if (total_out
<= start_byte
)
1022 * the next page in the biovec might not be adjacent
1023 * to the last page, but it might still be found
1024 * inside this working buffer. bump our offset pointer
1026 if (total_out
> start_byte
&&
1027 current_buf_start
< start_byte
) {
1028 buf_offset
= start_byte
- buf_start
;
1029 working_bytes
= total_out
- start_byte
;
1030 current_buf_start
= buf_start
+ buf_offset
;