1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) 2008 Oracle. All rights reserved.
6 #include <linux/kernel.h>
8 #include <linux/file.h>
10 #include <linux/pagemap.h>
11 #include <linux/highmem.h>
12 #include <linux/time.h>
13 #include <linux/init.h>
14 #include <linux/string.h>
15 #include <linux/backing-dev.h>
16 #include <linux/writeback.h>
17 #include <linux/slab.h>
18 #include <linux/sched/mm.h>
19 #include <linux/log2.h>
22 #include "transaction.h"
23 #include "btrfs_inode.h"
25 #include "ordered-data.h"
26 #include "compression.h"
27 #include "extent_io.h"
28 #include "extent_map.h"
30 static const char* const btrfs_compress_types[] = { "", "zlib", "lzo", "zstd" };
32 const char* btrfs_compress_type2str(enum btrfs_compression_type type)
35 case BTRFS_COMPRESS_ZLIB:
36 case BTRFS_COMPRESS_LZO:
37 case BTRFS_COMPRESS_ZSTD:
38 case BTRFS_COMPRESS_NONE:
39 return btrfs_compress_types[type];
45 static int btrfs_decompress_bio(struct compressed_bio *cb);
47 static inline int compressed_bio_size(struct btrfs_fs_info *fs_info,
48 unsigned long disk_size)
50 u16 csum_size = btrfs_super_csum_size(fs_info->super_copy);
52 return sizeof(struct compressed_bio) +
53 (DIV_ROUND_UP(disk_size, fs_info->sectorsize)) * csum_size;
56 static int check_compressed_csum(struct btrfs_inode *inode,
57 struct compressed_bio *cb,
65 u32 *cb_sum = &cb->sums;
67 if (inode->flags & BTRFS_INODE_NODATASUM)
70 for (i = 0; i < cb->nr_pages; i++) {
71 page = cb->compressed_pages[i];
74 kaddr = kmap_atomic(page);
75 csum = btrfs_csum_data(kaddr, csum, PAGE_SIZE);
76 btrfs_csum_final(csum, (u8 *)&csum);
79 if (csum != *cb_sum) {
80 btrfs_print_data_csum_error(inode, disk_start, csum,
81 *cb_sum, cb->mirror_num);
93 /* when we finish reading compressed pages from the disk, we
94 * decompress them and then run the bio end_io routines on the
95 * decompressed pages (in the inode address space).
97 * This allows the checksumming and other IO error handling routines
100 * The compressed pages are freed here, and it must be run
103 static void end_compressed_bio_read(struct bio *bio)
105 struct compressed_bio *cb = bio->bi_private;
109 unsigned int mirror = btrfs_io_bio(bio)->mirror_num;
115 /* if there are more bios still pending for this compressed
118 if (!refcount_dec_and_test(&cb->pending_bios))
122 * Record the correct mirror_num in cb->orig_bio so that
123 * read-repair can work properly.
125 ASSERT(btrfs_io_bio(cb->orig_bio));
126 btrfs_io_bio(cb->orig_bio)->mirror_num = mirror;
127 cb->mirror_num = mirror;
130 * Some IO in this cb have failed, just skip checksum as there
131 * is no way it could be correct.
137 ret = check_compressed_csum(BTRFS_I(inode), cb,
138 (u64)bio->bi_iter.bi_sector << 9);
142 /* ok, we're the last bio for this extent, lets start
145 ret = btrfs_decompress_bio(cb);
151 /* release the compressed pages */
153 for (index = 0; index < cb->nr_pages; index++) {
154 page = cb->compressed_pages[index];
155 page->mapping = NULL;
159 /* do io completion on the original bio */
161 bio_io_error(cb->orig_bio);
164 struct bio_vec *bvec;
167 * we have verified the checksum already, set page
168 * checked so the end_io handlers know about it
170 ASSERT(!bio_flagged(bio, BIO_CLONED));
171 bio_for_each_segment_all(bvec, cb->orig_bio, i)
172 SetPageChecked(bvec->bv_page);
174 bio_endio(cb->orig_bio);
177 /* finally free the cb struct */
178 kfree(cb->compressed_pages);
185 * Clear the writeback bits on all of the file
186 * pages for a compressed write
188 static noinline void end_compressed_writeback(struct inode *inode,
189 const struct compressed_bio *cb)
191 unsigned long index = cb->start >> PAGE_SHIFT;
192 unsigned long end_index = (cb->start + cb->len - 1) >> PAGE_SHIFT;
193 struct page *pages[16];
194 unsigned long nr_pages = end_index - index + 1;
199 mapping_set_error(inode->i_mapping, -EIO);
201 while (nr_pages > 0) {
202 ret = find_get_pages_contig(inode->i_mapping, index,
204 nr_pages, ARRAY_SIZE(pages)), pages);
210 for (i = 0; i < ret; i++) {
212 SetPageError(pages[i]);
213 end_page_writeback(pages[i]);
219 /* the inode may be gone now */
223 * do the cleanup once all the compressed pages hit the disk.
224 * This will clear writeback on the file pages and free the compressed
227 * This also calls the writeback end hooks for the file pages so that
228 * metadata and checksums can be updated in the file.
230 static void end_compressed_bio_write(struct bio *bio)
232 struct extent_io_tree *tree;
233 struct compressed_bio *cb = bio->bi_private;
241 /* if there are more bios still pending for this compressed
244 if (!refcount_dec_and_test(&cb->pending_bios))
247 /* ok, we're the last bio for this extent, step one is to
248 * call back into the FS and do all the end_io operations
251 tree = &BTRFS_I(inode)->io_tree;
252 cb->compressed_pages[0]->mapping = cb->inode->i_mapping;
253 tree->ops->writepage_end_io_hook(cb->compressed_pages[0],
255 cb->start + cb->len - 1,
258 BLK_STS_OK : BLK_STS_NOTSUPP);
259 cb->compressed_pages[0]->mapping = NULL;
261 end_compressed_writeback(inode, cb);
262 /* note, our inode could be gone now */
265 * release the compressed pages, these came from alloc_page and
266 * are not attached to the inode at all
269 for (index = 0; index < cb->nr_pages; index++) {
270 page = cb->compressed_pages[index];
271 page->mapping = NULL;
275 /* finally free the cb struct */
276 kfree(cb->compressed_pages);
283 * worker function to build and submit bios for previously compressed pages.
284 * The corresponding pages in the inode should be marked for writeback
285 * and the compressed pages should have a reference on them for dropping
286 * when the IO is complete.
288 * This also checksums the file bytes and gets things ready for
291 blk_status_t btrfs_submit_compressed_write(struct inode *inode, u64 start,
292 unsigned long len, u64 disk_start,
293 unsigned long compressed_len,
294 struct page **compressed_pages,
295 unsigned long nr_pages,
296 unsigned int write_flags)
298 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
299 struct bio *bio = NULL;
300 struct compressed_bio *cb;
301 unsigned long bytes_left;
304 u64 first_byte = disk_start;
305 struct block_device *bdev;
307 int skip_sum = BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM;
309 WARN_ON(start & ((u64)PAGE_SIZE - 1));
310 cb = kmalloc(compressed_bio_size(fs_info, compressed_len), GFP_NOFS);
312 return BLK_STS_RESOURCE;
313 refcount_set(&cb->pending_bios, 0);
319 cb->compressed_pages = compressed_pages;
320 cb->compressed_len = compressed_len;
322 cb->nr_pages = nr_pages;
324 bdev = fs_info->fs_devices->latest_bdev;
326 bio = btrfs_bio_alloc(bdev, first_byte);
327 bio->bi_opf = REQ_OP_WRITE | write_flags;
328 bio->bi_private = cb;
329 bio->bi_end_io = end_compressed_bio_write;
330 refcount_set(&cb->pending_bios, 1);
332 /* create and submit bios for the compressed pages */
333 bytes_left = compressed_len;
334 for (pg_index = 0; pg_index < cb->nr_pages; pg_index++) {
337 page = compressed_pages[pg_index];
338 page->mapping = inode->i_mapping;
339 if (bio->bi_iter.bi_size)
340 submit = btrfs_merge_bio_hook(page, 0, PAGE_SIZE, bio, 0);
342 page->mapping = NULL;
343 if (submit || bio_add_page(bio, page, PAGE_SIZE, 0) <
346 * inc the count before we submit the bio so
347 * we know the end IO handler won't happen before
348 * we inc the count. Otherwise, the cb might get
349 * freed before we're done setting it up
351 refcount_inc(&cb->pending_bios);
352 ret = btrfs_bio_wq_end_io(fs_info, bio,
353 BTRFS_WQ_ENDIO_DATA);
354 BUG_ON(ret); /* -ENOMEM */
357 ret = btrfs_csum_one_bio(inode, bio, start, 1);
358 BUG_ON(ret); /* -ENOMEM */
361 ret = btrfs_map_bio(fs_info, bio, 0, 1);
363 bio->bi_status = ret;
367 bio = btrfs_bio_alloc(bdev, first_byte);
368 bio->bi_opf = REQ_OP_WRITE | write_flags;
369 bio->bi_private = cb;
370 bio->bi_end_io = end_compressed_bio_write;
371 bio_add_page(bio, page, PAGE_SIZE, 0);
373 if (bytes_left < PAGE_SIZE) {
375 "bytes left %lu compress len %lu nr %lu",
376 bytes_left, cb->compressed_len, cb->nr_pages);
378 bytes_left -= PAGE_SIZE;
379 first_byte += PAGE_SIZE;
383 ret = btrfs_bio_wq_end_io(fs_info, bio, BTRFS_WQ_ENDIO_DATA);
384 BUG_ON(ret); /* -ENOMEM */
387 ret = btrfs_csum_one_bio(inode, bio, start, 1);
388 BUG_ON(ret); /* -ENOMEM */
391 ret = btrfs_map_bio(fs_info, bio, 0, 1);
393 bio->bi_status = ret;
400 static u64 bio_end_offset(struct bio *bio)
402 struct bio_vec *last = bio_last_bvec_all(bio);
404 return page_offset(last->bv_page) + last->bv_len + last->bv_offset;
407 static noinline int add_ra_bio_pages(struct inode *inode,
409 struct compressed_bio *cb)
411 unsigned long end_index;
412 unsigned long pg_index;
414 u64 isize = i_size_read(inode);
417 unsigned long nr_pages = 0;
418 struct extent_map *em;
419 struct address_space *mapping = inode->i_mapping;
420 struct extent_map_tree *em_tree;
421 struct extent_io_tree *tree;
425 last_offset = bio_end_offset(cb->orig_bio);
426 em_tree = &BTRFS_I(inode)->extent_tree;
427 tree = &BTRFS_I(inode)->io_tree;
432 end_index = (i_size_read(inode) - 1) >> PAGE_SHIFT;
434 while (last_offset < compressed_end) {
435 pg_index = last_offset >> PAGE_SHIFT;
437 if (pg_index > end_index)
441 page = radix_tree_lookup(&mapping->i_pages, pg_index);
443 if (page && !radix_tree_exceptional_entry(page)) {
450 page = __page_cache_alloc(mapping_gfp_constraint(mapping,
455 if (add_to_page_cache_lru(page, mapping, pg_index, GFP_NOFS)) {
460 end = last_offset + PAGE_SIZE - 1;
462 * at this point, we have a locked page in the page cache
463 * for these bytes in the file. But, we have to make
464 * sure they map to this compressed extent on disk.
466 set_page_extent_mapped(page);
467 lock_extent(tree, last_offset, end);
468 read_lock(&em_tree->lock);
469 em = lookup_extent_mapping(em_tree, last_offset,
471 read_unlock(&em_tree->lock);
473 if (!em || last_offset < em->start ||
474 (last_offset + PAGE_SIZE > extent_map_end(em)) ||
475 (em->block_start >> 9) != cb->orig_bio->bi_iter.bi_sector) {
477 unlock_extent(tree, last_offset, end);
484 if (page->index == end_index) {
486 size_t zero_offset = isize & (PAGE_SIZE - 1);
490 zeros = PAGE_SIZE - zero_offset;
491 userpage = kmap_atomic(page);
492 memset(userpage + zero_offset, 0, zeros);
493 flush_dcache_page(page);
494 kunmap_atomic(userpage);
498 ret = bio_add_page(cb->orig_bio, page,
501 if (ret == PAGE_SIZE) {
505 unlock_extent(tree, last_offset, end);
511 last_offset += PAGE_SIZE;
517 * for a compressed read, the bio we get passed has all the inode pages
518 * in it. We don't actually do IO on those pages but allocate new ones
519 * to hold the compressed pages on disk.
521 * bio->bi_iter.bi_sector points to the compressed extent on disk
522 * bio->bi_io_vec points to all of the inode pages
524 * After the compressed pages are read, we copy the bytes into the
525 * bio we were passed and then call the bio end_io calls
527 blk_status_t btrfs_submit_compressed_read(struct inode *inode, struct bio *bio,
528 int mirror_num, unsigned long bio_flags)
530 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
531 struct extent_map_tree *em_tree;
532 struct compressed_bio *cb;
533 unsigned long compressed_len;
534 unsigned long nr_pages;
535 unsigned long pg_index;
537 struct block_device *bdev;
538 struct bio *comp_bio;
539 u64 cur_disk_byte = (u64)bio->bi_iter.bi_sector << 9;
542 struct extent_map *em;
543 blk_status_t ret = BLK_STS_RESOURCE;
547 em_tree = &BTRFS_I(inode)->extent_tree;
549 /* we need the actual starting offset of this extent in the file */
550 read_lock(&em_tree->lock);
551 em = lookup_extent_mapping(em_tree,
552 page_offset(bio_first_page_all(bio)),
554 read_unlock(&em_tree->lock);
556 return BLK_STS_IOERR;
558 compressed_len = em->block_len;
559 cb = kmalloc(compressed_bio_size(fs_info, compressed_len), GFP_NOFS);
563 refcount_set(&cb->pending_bios, 0);
566 cb->mirror_num = mirror_num;
569 cb->start = em->orig_start;
571 em_start = em->start;
576 cb->len = bio->bi_iter.bi_size;
577 cb->compressed_len = compressed_len;
578 cb->compress_type = extent_compress_type(bio_flags);
581 nr_pages = DIV_ROUND_UP(compressed_len, PAGE_SIZE);
582 cb->compressed_pages = kcalloc(nr_pages, sizeof(struct page *),
584 if (!cb->compressed_pages)
587 bdev = fs_info->fs_devices->latest_bdev;
589 for (pg_index = 0; pg_index < nr_pages; pg_index++) {
590 cb->compressed_pages[pg_index] = alloc_page(GFP_NOFS |
592 if (!cb->compressed_pages[pg_index]) {
593 faili = pg_index - 1;
594 ret = BLK_STS_RESOURCE;
598 faili = nr_pages - 1;
599 cb->nr_pages = nr_pages;
601 add_ra_bio_pages(inode, em_start + em_len, cb);
603 /* include any pages we added in add_ra-bio_pages */
604 cb->len = bio->bi_iter.bi_size;
606 comp_bio = btrfs_bio_alloc(bdev, cur_disk_byte);
607 comp_bio->bi_opf = REQ_OP_READ;
608 comp_bio->bi_private = cb;
609 comp_bio->bi_end_io = end_compressed_bio_read;
610 refcount_set(&cb->pending_bios, 1);
612 for (pg_index = 0; pg_index < nr_pages; pg_index++) {
615 page = cb->compressed_pages[pg_index];
616 page->mapping = inode->i_mapping;
617 page->index = em_start >> PAGE_SHIFT;
619 if (comp_bio->bi_iter.bi_size)
620 submit = btrfs_merge_bio_hook(page, 0, PAGE_SIZE,
623 page->mapping = NULL;
624 if (submit || bio_add_page(comp_bio, page, PAGE_SIZE, 0) <
626 ret = btrfs_bio_wq_end_io(fs_info, comp_bio,
627 BTRFS_WQ_ENDIO_DATA);
628 BUG_ON(ret); /* -ENOMEM */
631 * inc the count before we submit the bio so
632 * we know the end IO handler won't happen before
633 * we inc the count. Otherwise, the cb might get
634 * freed before we're done setting it up
636 refcount_inc(&cb->pending_bios);
638 if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)) {
639 ret = btrfs_lookup_bio_sums(inode, comp_bio,
641 BUG_ON(ret); /* -ENOMEM */
643 sums += DIV_ROUND_UP(comp_bio->bi_iter.bi_size,
644 fs_info->sectorsize);
646 ret = btrfs_map_bio(fs_info, comp_bio, mirror_num, 0);
648 comp_bio->bi_status = ret;
652 comp_bio = btrfs_bio_alloc(bdev, cur_disk_byte);
653 comp_bio->bi_opf = REQ_OP_READ;
654 comp_bio->bi_private = cb;
655 comp_bio->bi_end_io = end_compressed_bio_read;
657 bio_add_page(comp_bio, page, PAGE_SIZE, 0);
659 cur_disk_byte += PAGE_SIZE;
662 ret = btrfs_bio_wq_end_io(fs_info, comp_bio, BTRFS_WQ_ENDIO_DATA);
663 BUG_ON(ret); /* -ENOMEM */
665 if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)) {
666 ret = btrfs_lookup_bio_sums(inode, comp_bio, sums);
667 BUG_ON(ret); /* -ENOMEM */
670 ret = btrfs_map_bio(fs_info, comp_bio, mirror_num, 0);
672 comp_bio->bi_status = ret;
680 __free_page(cb->compressed_pages[faili]);
684 kfree(cb->compressed_pages);
693 * Heuristic uses systematic sampling to collect data from the input data
694 * range, the logic can be tuned by the following constants:
696 * @SAMPLING_READ_SIZE - how many bytes will be copied from for each sample
697 * @SAMPLING_INTERVAL - range from which the sampled data can be collected
699 #define SAMPLING_READ_SIZE (16)
700 #define SAMPLING_INTERVAL (256)
703 * For statistical analysis of the input data we consider bytes that form a
704 * Galois Field of 256 objects. Each object has an attribute count, ie. how
705 * many times the object appeared in the sample.
707 #define BUCKET_SIZE (256)
710 * The size of the sample is based on a statistical sampling rule of thumb.
711 * The common way is to perform sampling tests as long as the number of
712 * elements in each cell is at least 5.
714 * Instead of 5, we choose 32 to obtain more accurate results.
715 * If the data contain the maximum number of symbols, which is 256, we obtain a
716 * sample size bound by 8192.
718 * For a sample of at most 8KB of data per data range: 16 consecutive bytes
719 * from up to 512 locations.
721 #define MAX_SAMPLE_SIZE (BTRFS_MAX_UNCOMPRESSED * \
722 SAMPLING_READ_SIZE / SAMPLING_INTERVAL)
728 struct heuristic_ws {
729 /* Partial copy of input data */
732 /* Buckets store counters for each byte value */
733 struct bucket_item *bucket;
735 struct bucket_item *bucket_b;
736 struct list_head list;
739 static void free_heuristic_ws(struct list_head *ws)
741 struct heuristic_ws *workspace;
743 workspace = list_entry(ws, struct heuristic_ws, list);
745 kvfree(workspace->sample);
746 kfree(workspace->bucket);
747 kfree(workspace->bucket_b);
751 static struct list_head *alloc_heuristic_ws(void)
753 struct heuristic_ws *ws;
755 ws = kzalloc(sizeof(*ws), GFP_KERNEL);
757 return ERR_PTR(-ENOMEM);
759 ws->sample = kvmalloc(MAX_SAMPLE_SIZE, GFP_KERNEL);
763 ws->bucket = kcalloc(BUCKET_SIZE, sizeof(*ws->bucket), GFP_KERNEL);
767 ws->bucket_b = kcalloc(BUCKET_SIZE, sizeof(*ws->bucket_b), GFP_KERNEL);
771 INIT_LIST_HEAD(&ws->list);
774 free_heuristic_ws(&ws->list);
775 return ERR_PTR(-ENOMEM);
778 struct workspaces_list {
779 struct list_head idle_ws;
781 /* Number of free workspaces */
783 /* Total number of allocated workspaces */
785 /* Waiters for a free workspace */
786 wait_queue_head_t ws_wait;
789 static struct workspaces_list btrfs_comp_ws[BTRFS_COMPRESS_TYPES];
791 static struct workspaces_list btrfs_heuristic_ws;
793 static const struct btrfs_compress_op * const btrfs_compress_op[] = {
794 &btrfs_zlib_compress,
796 &btrfs_zstd_compress,
799 void __init btrfs_init_compress(void)
801 struct list_head *workspace;
804 INIT_LIST_HEAD(&btrfs_heuristic_ws.idle_ws);
805 spin_lock_init(&btrfs_heuristic_ws.ws_lock);
806 atomic_set(&btrfs_heuristic_ws.total_ws, 0);
807 init_waitqueue_head(&btrfs_heuristic_ws.ws_wait);
809 workspace = alloc_heuristic_ws();
810 if (IS_ERR(workspace)) {
812 "BTRFS: cannot preallocate heuristic workspace, will try later\n");
814 atomic_set(&btrfs_heuristic_ws.total_ws, 1);
815 btrfs_heuristic_ws.free_ws = 1;
816 list_add(workspace, &btrfs_heuristic_ws.idle_ws);
819 for (i = 0; i < BTRFS_COMPRESS_TYPES; i++) {
820 INIT_LIST_HEAD(&btrfs_comp_ws[i].idle_ws);
821 spin_lock_init(&btrfs_comp_ws[i].ws_lock);
822 atomic_set(&btrfs_comp_ws[i].total_ws, 0);
823 init_waitqueue_head(&btrfs_comp_ws[i].ws_wait);
826 * Preallocate one workspace for each compression type so
827 * we can guarantee forward progress in the worst case
829 workspace = btrfs_compress_op[i]->alloc_workspace();
830 if (IS_ERR(workspace)) {
831 pr_warn("BTRFS: cannot preallocate compression workspace, will try later\n");
833 atomic_set(&btrfs_comp_ws[i].total_ws, 1);
834 btrfs_comp_ws[i].free_ws = 1;
835 list_add(workspace, &btrfs_comp_ws[i].idle_ws);
841 * This finds an available workspace or allocates a new one.
842 * If it's not possible to allocate a new one, waits until there's one.
843 * Preallocation makes a forward progress guarantees and we do not return
846 static struct list_head *__find_workspace(int type, bool heuristic)
848 struct list_head *workspace;
849 int cpus = num_online_cpus();
852 struct list_head *idle_ws;
855 wait_queue_head_t *ws_wait;
859 idle_ws = &btrfs_heuristic_ws.idle_ws;
860 ws_lock = &btrfs_heuristic_ws.ws_lock;
861 total_ws = &btrfs_heuristic_ws.total_ws;
862 ws_wait = &btrfs_heuristic_ws.ws_wait;
863 free_ws = &btrfs_heuristic_ws.free_ws;
865 idle_ws = &btrfs_comp_ws[idx].idle_ws;
866 ws_lock = &btrfs_comp_ws[idx].ws_lock;
867 total_ws = &btrfs_comp_ws[idx].total_ws;
868 ws_wait = &btrfs_comp_ws[idx].ws_wait;
869 free_ws = &btrfs_comp_ws[idx].free_ws;
874 if (!list_empty(idle_ws)) {
875 workspace = idle_ws->next;
878 spin_unlock(ws_lock);
882 if (atomic_read(total_ws) > cpus) {
885 spin_unlock(ws_lock);
886 prepare_to_wait(ws_wait, &wait, TASK_UNINTERRUPTIBLE);
887 if (atomic_read(total_ws) > cpus && !*free_ws)
889 finish_wait(ws_wait, &wait);
892 atomic_inc(total_ws);
893 spin_unlock(ws_lock);
896 * Allocation helpers call vmalloc that can't use GFP_NOFS, so we have
897 * to turn it off here because we might get called from the restricted
898 * context of btrfs_compress_bio/btrfs_compress_pages
900 nofs_flag = memalloc_nofs_save();
902 workspace = alloc_heuristic_ws();
904 workspace = btrfs_compress_op[idx]->alloc_workspace();
905 memalloc_nofs_restore(nofs_flag);
907 if (IS_ERR(workspace)) {
908 atomic_dec(total_ws);
912 * Do not return the error but go back to waiting. There's a
913 * workspace preallocated for each type and the compression
914 * time is bounded so we get to a workspace eventually. This
915 * makes our caller's life easier.
917 * To prevent silent and low-probability deadlocks (when the
918 * initial preallocation fails), check if there are any
921 if (atomic_read(total_ws) == 0) {
922 static DEFINE_RATELIMIT_STATE(_rs,
923 /* once per minute */ 60 * HZ,
926 if (__ratelimit(&_rs)) {
927 pr_warn("BTRFS: no compression workspaces, low memory, retrying\n");
935 static struct list_head *find_workspace(int type)
937 return __find_workspace(type, false);
941 * put a workspace struct back on the list or free it if we have enough
942 * idle ones sitting around
944 static void __free_workspace(int type, struct list_head *workspace,
948 struct list_head *idle_ws;
951 wait_queue_head_t *ws_wait;
955 idle_ws = &btrfs_heuristic_ws.idle_ws;
956 ws_lock = &btrfs_heuristic_ws.ws_lock;
957 total_ws = &btrfs_heuristic_ws.total_ws;
958 ws_wait = &btrfs_heuristic_ws.ws_wait;
959 free_ws = &btrfs_heuristic_ws.free_ws;
961 idle_ws = &btrfs_comp_ws[idx].idle_ws;
962 ws_lock = &btrfs_comp_ws[idx].ws_lock;
963 total_ws = &btrfs_comp_ws[idx].total_ws;
964 ws_wait = &btrfs_comp_ws[idx].ws_wait;
965 free_ws = &btrfs_comp_ws[idx].free_ws;
969 if (*free_ws <= num_online_cpus()) {
970 list_add(workspace, idle_ws);
972 spin_unlock(ws_lock);
975 spin_unlock(ws_lock);
978 free_heuristic_ws(workspace);
980 btrfs_compress_op[idx]->free_workspace(workspace);
981 atomic_dec(total_ws);
983 cond_wake_up(ws_wait);
986 static void free_workspace(int type, struct list_head *ws)
988 return __free_workspace(type, ws, false);
992 * cleanup function for module exit
994 static void free_workspaces(void)
996 struct list_head *workspace;
999 while (!list_empty(&btrfs_heuristic_ws.idle_ws)) {
1000 workspace = btrfs_heuristic_ws.idle_ws.next;
1001 list_del(workspace);
1002 free_heuristic_ws(workspace);
1003 atomic_dec(&btrfs_heuristic_ws.total_ws);
1006 for (i = 0; i < BTRFS_COMPRESS_TYPES; i++) {
1007 while (!list_empty(&btrfs_comp_ws[i].idle_ws)) {
1008 workspace = btrfs_comp_ws[i].idle_ws.next;
1009 list_del(workspace);
1010 btrfs_compress_op[i]->free_workspace(workspace);
1011 atomic_dec(&btrfs_comp_ws[i].total_ws);
1017 * Given an address space and start and length, compress the bytes into @pages
1018 * that are allocated on demand.
1020 * @type_level is encoded algorithm and level, where level 0 means whatever
1021 * default the algorithm chooses and is opaque here;
1022 * - compression algo are 0-3
1023 * - the level are bits 4-7
1025 * @out_pages is an in/out parameter, holds maximum number of pages to allocate
1026 * and returns number of actually allocated pages
1028 * @total_in is used to return the number of bytes actually read. It
1029 * may be smaller than the input length if we had to exit early because we
1030 * ran out of room in the pages array or because we cross the
1031 * max_out threshold.
1033 * @total_out is an in/out parameter, must be set to the input length and will
1034 * be also used to return the total number of compressed bytes
1036 * @max_out tells us the max number of bytes that we're allowed to
1039 int btrfs_compress_pages(unsigned int type_level, struct address_space *mapping,
1040 u64 start, struct page **pages,
1041 unsigned long *out_pages,
1042 unsigned long *total_in,
1043 unsigned long *total_out)
1045 struct list_head *workspace;
1047 int type = type_level & 0xF;
1049 workspace = find_workspace(type);
1051 btrfs_compress_op[type - 1]->set_level(workspace, type_level);
1052 ret = btrfs_compress_op[type-1]->compress_pages(workspace, mapping,
1055 total_in, total_out);
1056 free_workspace(type, workspace);
1061 * pages_in is an array of pages with compressed data.
1063 * disk_start is the starting logical offset of this array in the file
1065 * orig_bio contains the pages from the file that we want to decompress into
1067 * srclen is the number of bytes in pages_in
1069 * The basic idea is that we have a bio that was created by readpages.
1070 * The pages in the bio are for the uncompressed data, and they may not
1071 * be contiguous. They all correspond to the range of bytes covered by
1072 * the compressed extent.
1074 static int btrfs_decompress_bio(struct compressed_bio *cb)
1076 struct list_head *workspace;
1078 int type = cb->compress_type;
1080 workspace = find_workspace(type);
1081 ret = btrfs_compress_op[type - 1]->decompress_bio(workspace, cb);
1082 free_workspace(type, workspace);
1088 * a less complex decompression routine. Our compressed data fits in a
1089 * single page, and we want to read a single page out of it.
1090 * start_byte tells us the offset into the compressed data we're interested in
1092 int btrfs_decompress(int type, unsigned char *data_in, struct page *dest_page,
1093 unsigned long start_byte, size_t srclen, size_t destlen)
1095 struct list_head *workspace;
1098 workspace = find_workspace(type);
1100 ret = btrfs_compress_op[type-1]->decompress(workspace, data_in,
1101 dest_page, start_byte,
1104 free_workspace(type, workspace);
1108 void __cold btrfs_exit_compress(void)
1114 * Copy uncompressed data from working buffer to pages.
1116 * buf_start is the byte offset we're of the start of our workspace buffer.
1118 * total_out is the last byte of the buffer
1120 int btrfs_decompress_buf2page(const char *buf, unsigned long buf_start,
1121 unsigned long total_out, u64 disk_start,
1124 unsigned long buf_offset;
1125 unsigned long current_buf_start;
1126 unsigned long start_byte;
1127 unsigned long prev_start_byte;
1128 unsigned long working_bytes = total_out - buf_start;
1129 unsigned long bytes;
1131 struct bio_vec bvec = bio_iter_iovec(bio, bio->bi_iter);
1134 * start byte is the first byte of the page we're currently
1135 * copying into relative to the start of the compressed data.
1137 start_byte = page_offset(bvec.bv_page) - disk_start;
1139 /* we haven't yet hit data corresponding to this page */
1140 if (total_out <= start_byte)
1144 * the start of the data we care about is offset into
1145 * the middle of our working buffer
1147 if (total_out > start_byte && buf_start < start_byte) {
1148 buf_offset = start_byte - buf_start;
1149 working_bytes -= buf_offset;
1153 current_buf_start = buf_start;
1155 /* copy bytes from the working buffer into the pages */
1156 while (working_bytes > 0) {
1157 bytes = min_t(unsigned long, bvec.bv_len,
1158 PAGE_SIZE - buf_offset);
1159 bytes = min(bytes, working_bytes);
1161 kaddr = kmap_atomic(bvec.bv_page);
1162 memcpy(kaddr + bvec.bv_offset, buf + buf_offset, bytes);
1163 kunmap_atomic(kaddr);
1164 flush_dcache_page(bvec.bv_page);
1166 buf_offset += bytes;
1167 working_bytes -= bytes;
1168 current_buf_start += bytes;
1170 /* check if we need to pick another page */
1171 bio_advance(bio, bytes);
1172 if (!bio->bi_iter.bi_size)
1174 bvec = bio_iter_iovec(bio, bio->bi_iter);
1175 prev_start_byte = start_byte;
1176 start_byte = page_offset(bvec.bv_page) - disk_start;
1179 * We need to make sure we're only adjusting
1180 * our offset into compression working buffer when
1181 * we're switching pages. Otherwise we can incorrectly
1182 * keep copying when we were actually done.
1184 if (start_byte != prev_start_byte) {
1186 * make sure our new page is covered by this
1189 if (total_out <= start_byte)
1193 * the next page in the biovec might not be adjacent
1194 * to the last page, but it might still be found
1195 * inside this working buffer. bump our offset pointer
1197 if (total_out > start_byte &&
1198 current_buf_start < start_byte) {
1199 buf_offset = start_byte - buf_start;
1200 working_bytes = total_out - start_byte;
1201 current_buf_start = buf_start + buf_offset;
1210 * Shannon Entropy calculation
1212 * Pure byte distribution analysis fails to determine compressiability of data.
1213 * Try calculating entropy to estimate the average minimum number of bits
1214 * needed to encode the sampled data.
1216 * For convenience, return the percentage of needed bits, instead of amount of
1219 * @ENTROPY_LVL_ACEPTABLE - below that threshold, sample has low byte entropy
1220 * and can be compressible with high probability
1222 * @ENTROPY_LVL_HIGH - data are not compressible with high probability
1224 * Use of ilog2() decreases precision, we lower the LVL to 5 to compensate.
1226 #define ENTROPY_LVL_ACEPTABLE (65)
1227 #define ENTROPY_LVL_HIGH (80)
1230 * For increasead precision in shannon_entropy calculation,
1231 * let's do pow(n, M) to save more digits after comma:
1233 * - maximum int bit length is 64
1234 * - ilog2(MAX_SAMPLE_SIZE) -> 13
1235 * - 13 * 4 = 52 < 64 -> M = 4
1239 static inline u32 ilog2_w(u64 n)
1241 return ilog2(n * n * n * n);
1244 static u32 shannon_entropy(struct heuristic_ws *ws)
1246 const u32 entropy_max = 8 * ilog2_w(2);
1247 u32 entropy_sum = 0;
1248 u32 p, p_base, sz_base;
1251 sz_base = ilog2_w(ws->sample_size);
1252 for (i = 0; i < BUCKET_SIZE && ws->bucket[i].count > 0; i++) {
1253 p = ws->bucket[i].count;
1254 p_base = ilog2_w(p);
1255 entropy_sum += p * (sz_base - p_base);
1258 entropy_sum /= ws->sample_size;
1259 return entropy_sum * 100 / entropy_max;
1262 #define RADIX_BASE 4U
1263 #define COUNTERS_SIZE (1U << RADIX_BASE)
1265 static u8 get4bits(u64 num, int shift) {
1270 low4bits = (COUNTERS_SIZE - 1) - (num % COUNTERS_SIZE);
1275 * Use 4 bits as radix base
1276 * Use 16 u32 counters for calculating new possition in buf array
1278 * @array - array that will be sorted
1279 * @array_buf - buffer array to store sorting results
1280 * must be equal in size to @array
1283 static void radix_sort(struct bucket_item *array, struct bucket_item *array_buf,
1288 u32 counters[COUNTERS_SIZE];
1296 * Try avoid useless loop iterations for small numbers stored in big
1297 * counters. Example: 48 33 4 ... in 64bit array
1299 max_num = array[0].count;
1300 for (i = 1; i < num; i++) {
1301 buf_num = array[i].count;
1302 if (buf_num > max_num)
1306 buf_num = ilog2(max_num);
1307 bitlen = ALIGN(buf_num, RADIX_BASE * 2);
1310 while (shift < bitlen) {
1311 memset(counters, 0, sizeof(counters));
1313 for (i = 0; i < num; i++) {
1314 buf_num = array[i].count;
1315 addr = get4bits(buf_num, shift);
1319 for (i = 1; i < COUNTERS_SIZE; i++)
1320 counters[i] += counters[i - 1];
1322 for (i = num - 1; i >= 0; i--) {
1323 buf_num = array[i].count;
1324 addr = get4bits(buf_num, shift);
1326 new_addr = counters[addr];
1327 array_buf[new_addr] = array[i];
1330 shift += RADIX_BASE;
1333 * Normal radix expects to move data from a temporary array, to
1334 * the main one. But that requires some CPU time. Avoid that
1335 * by doing another sort iteration to original array instead of
1338 memset(counters, 0, sizeof(counters));
1340 for (i = 0; i < num; i ++) {
1341 buf_num = array_buf[i].count;
1342 addr = get4bits(buf_num, shift);
1346 for (i = 1; i < COUNTERS_SIZE; i++)
1347 counters[i] += counters[i - 1];
1349 for (i = num - 1; i >= 0; i--) {
1350 buf_num = array_buf[i].count;
1351 addr = get4bits(buf_num, shift);
1353 new_addr = counters[addr];
1354 array[new_addr] = array_buf[i];
1357 shift += RADIX_BASE;
1362 * Size of the core byte set - how many bytes cover 90% of the sample
1364 * There are several types of structured binary data that use nearly all byte
1365 * values. The distribution can be uniform and counts in all buckets will be
1366 * nearly the same (eg. encrypted data). Unlikely to be compressible.
1368 * Other possibility is normal (Gaussian) distribution, where the data could
1369 * be potentially compressible, but we have to take a few more steps to decide
1372 * @BYTE_CORE_SET_LOW - main part of byte values repeated frequently,
1373 * compression algo can easy fix that
1374 * @BYTE_CORE_SET_HIGH - data have uniform distribution and with high
1375 * probability is not compressible
1377 #define BYTE_CORE_SET_LOW (64)
1378 #define BYTE_CORE_SET_HIGH (200)
1380 static int byte_core_set_size(struct heuristic_ws *ws)
1383 u32 coreset_sum = 0;
1384 const u32 core_set_threshold = ws->sample_size * 90 / 100;
1385 struct bucket_item *bucket = ws->bucket;
1387 /* Sort in reverse order */
1388 radix_sort(ws->bucket, ws->bucket_b, BUCKET_SIZE);
1390 for (i = 0; i < BYTE_CORE_SET_LOW; i++)
1391 coreset_sum += bucket[i].count;
1393 if (coreset_sum > core_set_threshold)
1396 for (; i < BYTE_CORE_SET_HIGH && bucket[i].count > 0; i++) {
1397 coreset_sum += bucket[i].count;
1398 if (coreset_sum > core_set_threshold)
1406 * Count byte values in buckets.
1407 * This heuristic can detect textual data (configs, xml, json, html, etc).
1408 * Because in most text-like data byte set is restricted to limited number of
1409 * possible characters, and that restriction in most cases makes data easy to
1412 * @BYTE_SET_THRESHOLD - consider all data within this byte set size:
1413 * less - compressible
1414 * more - need additional analysis
1416 #define BYTE_SET_THRESHOLD (64)
1418 static u32 byte_set_size(const struct heuristic_ws *ws)
1421 u32 byte_set_size = 0;
1423 for (i = 0; i < BYTE_SET_THRESHOLD; i++) {
1424 if (ws->bucket[i].count > 0)
1429 * Continue collecting count of byte values in buckets. If the byte
1430 * set size is bigger then the threshold, it's pointless to continue,
1431 * the detection technique would fail for this type of data.
1433 for (; i < BUCKET_SIZE; i++) {
1434 if (ws->bucket[i].count > 0) {
1436 if (byte_set_size > BYTE_SET_THRESHOLD)
1437 return byte_set_size;
1441 return byte_set_size;
1444 static bool sample_repeated_patterns(struct heuristic_ws *ws)
1446 const u32 half_of_sample = ws->sample_size / 2;
1447 const u8 *data = ws->sample;
1449 return memcmp(&data[0], &data[half_of_sample], half_of_sample) == 0;
1452 static void heuristic_collect_sample(struct inode *inode, u64 start, u64 end,
1453 struct heuristic_ws *ws)
1456 u64 index, index_end;
1457 u32 i, curr_sample_pos;
1461 * Compression handles the input data by chunks of 128KiB
1462 * (defined by BTRFS_MAX_UNCOMPRESSED)
1464 * We do the same for the heuristic and loop over the whole range.
1466 * MAX_SAMPLE_SIZE - calculated under assumption that heuristic will
1467 * process no more than BTRFS_MAX_UNCOMPRESSED at a time.
1469 if (end - start > BTRFS_MAX_UNCOMPRESSED)
1470 end = start + BTRFS_MAX_UNCOMPRESSED;
1472 index = start >> PAGE_SHIFT;
1473 index_end = end >> PAGE_SHIFT;
1475 /* Don't miss unaligned end */
1476 if (!IS_ALIGNED(end, PAGE_SIZE))
1479 curr_sample_pos = 0;
1480 while (index < index_end) {
1481 page = find_get_page(inode->i_mapping, index);
1482 in_data = kmap(page);
1483 /* Handle case where the start is not aligned to PAGE_SIZE */
1484 i = start % PAGE_SIZE;
1485 while (i < PAGE_SIZE - SAMPLING_READ_SIZE) {
1486 /* Don't sample any garbage from the last page */
1487 if (start > end - SAMPLING_READ_SIZE)
1489 memcpy(&ws->sample[curr_sample_pos], &in_data[i],
1490 SAMPLING_READ_SIZE);
1491 i += SAMPLING_INTERVAL;
1492 start += SAMPLING_INTERVAL;
1493 curr_sample_pos += SAMPLING_READ_SIZE;
1501 ws->sample_size = curr_sample_pos;
1505 * Compression heuristic.
1507 * For now is's a naive and optimistic 'return true', we'll extend the logic to
1508 * quickly (compared to direct compression) detect data characteristics
1509 * (compressible/uncompressible) to avoid wasting CPU time on uncompressible
1512 * The following types of analysis can be performed:
1513 * - detect mostly zero data
1514 * - detect data with low "byte set" size (text, etc)
1515 * - detect data with low/high "core byte" set
1517 * Return non-zero if the compression should be done, 0 otherwise.
1519 int btrfs_compress_heuristic(struct inode *inode, u64 start, u64 end)
1521 struct list_head *ws_list = __find_workspace(0, true);
1522 struct heuristic_ws *ws;
1527 ws = list_entry(ws_list, struct heuristic_ws, list);
1529 heuristic_collect_sample(inode, start, end, ws);
1531 if (sample_repeated_patterns(ws)) {
1536 memset(ws->bucket, 0, sizeof(*ws->bucket)*BUCKET_SIZE);
1538 for (i = 0; i < ws->sample_size; i++) {
1539 byte = ws->sample[i];
1540 ws->bucket[byte].count++;
1543 i = byte_set_size(ws);
1544 if (i < BYTE_SET_THRESHOLD) {
1549 i = byte_core_set_size(ws);
1550 if (i <= BYTE_CORE_SET_LOW) {
1555 if (i >= BYTE_CORE_SET_HIGH) {
1560 i = shannon_entropy(ws);
1561 if (i <= ENTROPY_LVL_ACEPTABLE) {
1567 * For the levels below ENTROPY_LVL_HIGH, additional analysis would be
1568 * needed to give green light to compression.
1570 * For now just assume that compression at that level is not worth the
1571 * resources because:
1573 * 1. it is possible to defrag the data later
1575 * 2. the data would turn out to be hardly compressible, eg. 150 byte
1576 * values, every bucket has counter at level ~54. The heuristic would
1577 * be confused. This can happen when data have some internal repeated
1578 * patterns like "abbacbbc...". This can be detected by analyzing
1579 * pairs of bytes, which is too costly.
1581 if (i < ENTROPY_LVL_HIGH) {
1590 __free_workspace(0, ws_list, true);
1594 unsigned int btrfs_compress_str2level(const char *str)
1596 if (strncmp(str, "zlib", 4) != 0)
1599 /* Accepted form: zlib:1 up to zlib:9 and nothing left after the number */
1600 if (str[4] == ':' && '1' <= str[5] && str[5] <= '9' && str[6] == 0)
1601 return str[5] - '0';
1603 return BTRFS_ZLIB_DEFAULT_LEVEL;