Lines Matching refs:ws
68 static int compression_compress_pages(int type, struct list_head *ws, in compression_compress_pages() argument
75 return zlib_compress_pages(ws, mapping, start, pages, in compression_compress_pages()
78 return lzo_compress_pages(ws, mapping, start, pages, in compression_compress_pages()
81 return zstd_compress_pages(ws, mapping, start, pages, in compression_compress_pages()
99 static int compression_decompress_bio(int type, struct list_head *ws, in compression_decompress_bio() argument
103 case BTRFS_COMPRESS_ZLIB: return zlib_decompress_bio(ws, cb); in compression_decompress_bio()
104 case BTRFS_COMPRESS_LZO: return lzo_decompress_bio(ws, cb); in compression_decompress_bio()
105 case BTRFS_COMPRESS_ZSTD: return zstd_decompress_bio(ws, cb); in compression_decompress_bio()
116 static int compression_decompress(int type, struct list_head *ws, in compression_decompress() argument
121 case BTRFS_COMPRESS_ZLIB: return zlib_decompress(ws, data_in, dest_page, in compression_decompress()
123 case BTRFS_COMPRESS_LZO: return lzo_decompress(ws, data_in, dest_page, in compression_decompress()
125 case BTRFS_COMPRESS_ZSTD: return zstd_decompress(ws, data_in, dest_page, in compression_decompress()
1025 static void free_heuristic_ws(struct list_head *ws) in free_heuristic_ws() argument
1029 workspace = list_entry(ws, struct heuristic_ws, list); in free_heuristic_ws()
1039 struct heuristic_ws *ws; in alloc_heuristic_ws() local
1041 ws = kzalloc(sizeof(*ws), GFP_KERNEL); in alloc_heuristic_ws()
1042 if (!ws) in alloc_heuristic_ws()
1045 ws->sample = kvmalloc(MAX_SAMPLE_SIZE, GFP_KERNEL); in alloc_heuristic_ws()
1046 if (!ws->sample) in alloc_heuristic_ws()
1049 ws->bucket = kcalloc(BUCKET_SIZE, sizeof(*ws->bucket), GFP_KERNEL); in alloc_heuristic_ws()
1050 if (!ws->bucket) in alloc_heuristic_ws()
1053 ws->bucket_b = kcalloc(BUCKET_SIZE, sizeof(*ws->bucket_b), GFP_KERNEL); in alloc_heuristic_ws()
1054 if (!ws->bucket_b) in alloc_heuristic_ws()
1057 INIT_LIST_HEAD(&ws->list); in alloc_heuristic_ws()
1058 return &ws->list; in alloc_heuristic_ws()
1060 free_heuristic_ws(&ws->list); in alloc_heuristic_ws()
1092 static void free_workspace(int type, struct list_head *ws) in free_workspace() argument
1095 case BTRFS_COMPRESS_NONE: return free_heuristic_ws(ws); in free_workspace()
1096 case BTRFS_COMPRESS_ZLIB: return zlib_free_workspace(ws); in free_workspace()
1097 case BTRFS_COMPRESS_LZO: return lzo_free_workspace(ws); in free_workspace()
1098 case BTRFS_COMPRESS_ZSTD: return zstd_free_workspace(ws); in free_workspace()
1137 struct list_head *ws; in btrfs_cleanup_workspace_manager() local
1141 ws = wsman->idle_ws.next; in btrfs_cleanup_workspace_manager()
1142 list_del(ws); in btrfs_cleanup_workspace_manager()
1143 free_workspace(type, ws); in btrfs_cleanup_workspace_manager()
1253 void btrfs_put_workspace(int type, struct list_head *ws) in btrfs_put_workspace() argument
1271 list_add(ws, idle_ws); in btrfs_put_workspace()
1278 free_workspace(type, ws); in btrfs_put_workspace()
1284 static void put_workspace(int type, struct list_head *ws) in put_workspace() argument
1287 case BTRFS_COMPRESS_NONE: return btrfs_put_workspace(type, ws); in put_workspace()
1288 case BTRFS_COMPRESS_ZLIB: return btrfs_put_workspace(type, ws); in put_workspace()
1289 case BTRFS_COMPRESS_LZO: return btrfs_put_workspace(type, ws); in put_workspace()
1290 case BTRFS_COMPRESS_ZSTD: return zstd_put_workspace(ws); in put_workspace()
1518 static u32 shannon_entropy(struct heuristic_ws *ws) in shannon_entropy() argument
1525 sz_base = ilog2_w(ws->sample_size); in shannon_entropy()
1526 for (i = 0; i < BUCKET_SIZE && ws->bucket[i].count > 0; i++) { in shannon_entropy()
1527 p = ws->bucket[i].count; in shannon_entropy()
1532 entropy_sum /= ws->sample_size; in shannon_entropy()
1654 static int byte_core_set_size(struct heuristic_ws *ws) in byte_core_set_size() argument
1658 const u32 core_set_threshold = ws->sample_size * 90 / 100; in byte_core_set_size()
1659 struct bucket_item *bucket = ws->bucket; in byte_core_set_size()
1662 radix_sort(ws->bucket, ws->bucket_b, BUCKET_SIZE); in byte_core_set_size()
1692 static u32 byte_set_size(const struct heuristic_ws *ws) in byte_set_size() argument
1698 if (ws->bucket[i].count > 0) in byte_set_size()
1708 if (ws->bucket[i].count > 0) { in byte_set_size()
1718 static bool sample_repeated_patterns(struct heuristic_ws *ws) in sample_repeated_patterns() argument
1720 const u32 half_of_sample = ws->sample_size / 2; in sample_repeated_patterns()
1721 const u8 *data = ws->sample; in sample_repeated_patterns()
1727 struct heuristic_ws *ws) in heuristic_collect_sample() argument
1763 memcpy(&ws->sample[curr_sample_pos], &in_data[i], in heuristic_collect_sample()
1775 ws->sample_size = curr_sample_pos; in heuristic_collect_sample()
1796 struct heuristic_ws *ws; in btrfs_compress_heuristic() local
1801 ws = list_entry(ws_list, struct heuristic_ws, list); in btrfs_compress_heuristic()
1803 heuristic_collect_sample(inode, start, end, ws); in btrfs_compress_heuristic()
1805 if (sample_repeated_patterns(ws)) { in btrfs_compress_heuristic()
1810 memset(ws->bucket, 0, sizeof(*ws->bucket)*BUCKET_SIZE); in btrfs_compress_heuristic()
1812 for (i = 0; i < ws->sample_size; i++) { in btrfs_compress_heuristic()
1813 byte = ws->sample[i]; in btrfs_compress_heuristic()
1814 ws->bucket[byte].count++; in btrfs_compress_heuristic()
1817 i = byte_set_size(ws); in btrfs_compress_heuristic()
1823 i = byte_core_set_size(ws); in btrfs_compress_heuristic()
1834 i = shannon_entropy(ws); in btrfs_compress_heuristic()