65 static int compression_compress_pages(int type, struct list_head *ws,  in compression_compress_pages()  argument
72 		return zlib_compress_pages(ws, mapping, start, pages,  in compression_compress_pages()
75 		return lzo_compress_pages(ws, mapping, start, pages,  in compression_compress_pages()
78 		return zstd_compress_pages(ws, mapping, start, pages,  in compression_compress_pages()
91 static int compression_decompress_bio(int type, struct list_head *ws,  in compression_decompress_bio()  argument
95 	case BTRFS_COMPRESS_ZLIB: return zlib_decompress_bio(ws, cb);  in compression_decompress_bio()
96 	case BTRFS_COMPRESS_LZO:  return lzo_decompress_bio(ws, cb);  in compression_decompress_bio()
97 	case BTRFS_COMPRESS_ZSTD: return zstd_decompress_bio(ws, cb);  in compression_decompress_bio()
108 static int compression_decompress(int type, struct list_head *ws,  in compression_decompress()  argument
113 	case BTRFS_COMPRESS_ZLIB: return zlib_decompress(ws, data_in, dest_page,  in compression_decompress()
115 	case BTRFS_COMPRESS_LZO:  return lzo_decompress(ws, data_in, dest_page,  in compression_decompress()
117 	case BTRFS_COMPRESS_ZSTD: return zstd_decompress(ws, data_in, dest_page,  in compression_decompress()
830 static void free_heuristic_ws(struct list_head *ws)  in free_heuristic_ws()  argument
834 	workspace = list_entry(ws, struct heuristic_ws, list);  in free_heuristic_ws()
844 	struct heuristic_ws *ws;  in alloc_heuristic_ws()  local
846 	ws = kzalloc(sizeof(*ws), GFP_KERNEL);  in alloc_heuristic_ws()
847 	if (!ws)  in alloc_heuristic_ws()
850 	ws->sample = kvmalloc(MAX_SAMPLE_SIZE, GFP_KERNEL);  in alloc_heuristic_ws()
851 	if (!ws->sample)  in alloc_heuristic_ws()
854 	ws->bucket = kcalloc(BUCKET_SIZE, sizeof(*ws->bucket), GFP_KERNEL);  in alloc_heuristic_ws()
855 	if (!ws->bucket)  in alloc_heuristic_ws()
858 	ws->bucket_b = kcalloc(BUCKET_SIZE, sizeof(*ws->bucket_b), GFP_KERNEL);  in alloc_heuristic_ws()
859 	if (!ws->bucket_b)  in alloc_heuristic_ws()
862 	INIT_LIST_HEAD(&ws->list);  in alloc_heuristic_ws()
863 	return &ws->list;  in alloc_heuristic_ws()
865 	free_heuristic_ws(&ws->list);  in alloc_heuristic_ws()
897 static void free_workspace(int type, struct list_head *ws)  in free_workspace()  argument
900 	case BTRFS_COMPRESS_NONE: return free_heuristic_ws(ws);  in free_workspace()
901 	case BTRFS_COMPRESS_ZLIB: return zlib_free_workspace(ws);  in free_workspace()
902 	case BTRFS_COMPRESS_LZO:  return lzo_free_workspace(ws);  in free_workspace()
903 	case BTRFS_COMPRESS_ZSTD: return zstd_free_workspace(ws);  in free_workspace()
942 	struct list_head *ws;  in btrfs_cleanup_workspace_manager()  local
946 		ws = wsman->idle_ws.next;  in btrfs_cleanup_workspace_manager()
947 		list_del(ws);  in btrfs_cleanup_workspace_manager()
948 		free_workspace(type, ws);  in btrfs_cleanup_workspace_manager()
1058 void btrfs_put_workspace(int type, struct list_head *ws)  in btrfs_put_workspace()  argument
1076 		list_add(ws, idle_ws);  in btrfs_put_workspace()
1083 	free_workspace(type, ws);  in btrfs_put_workspace()
1089 static void put_workspace(int type, struct list_head *ws)  in put_workspace()  argument
1092 	case BTRFS_COMPRESS_NONE: return btrfs_put_workspace(type, ws);  in put_workspace()
1093 	case BTRFS_COMPRESS_ZLIB: return btrfs_put_workspace(type, ws);  in put_workspace()
1094 	case BTRFS_COMPRESS_LZO:  return btrfs_put_workspace(type, ws);  in put_workspace()
1095 	case BTRFS_COMPRESS_ZSTD: return zstd_put_workspace(ws);  in put_workspace()
1356 static u32 shannon_entropy(struct heuristic_ws *ws)  in shannon_entropy()  argument
1363 	sz_base = ilog2_w(ws->sample_size);  in shannon_entropy()
1364 	for (i = 0; i < BUCKET_SIZE && ws->bucket[i].count > 0; i++) {  in shannon_entropy()
1365 		p = ws->bucket[i].count;  in shannon_entropy()
1370 	entropy_sum /= ws->sample_size;  in shannon_entropy()
1492 static int byte_core_set_size(struct heuristic_ws *ws)  in byte_core_set_size()  argument
1496 	const u32 core_set_threshold = ws->sample_size * 90 / 100;  in byte_core_set_size()
1497 	struct bucket_item *bucket = ws->bucket;  in byte_core_set_size()
1500 	radix_sort(ws->bucket, ws->bucket_b, BUCKET_SIZE);  in byte_core_set_size()
1530 static u32 byte_set_size(const struct heuristic_ws *ws)  in byte_set_size()  argument
1536 		if (ws->bucket[i].count > 0)  in byte_set_size()
1546 		if (ws->bucket[i].count > 0) {  in byte_set_size()
1556 static bool sample_repeated_patterns(struct heuristic_ws *ws)  in sample_repeated_patterns()  argument
1558 	const u32 half_of_sample = ws->sample_size / 2;  in sample_repeated_patterns()
1559 	const u8 *data = ws->sample;  in sample_repeated_patterns()
1565 				     struct heuristic_ws *ws)  in heuristic_collect_sample()  argument
1601 			memcpy(&ws->sample[curr_sample_pos], &in_data[i],  in heuristic_collect_sample()
1613 	ws->sample_size = curr_sample_pos;  in heuristic_collect_sample()
1634 	struct heuristic_ws *ws;  in btrfs_compress_heuristic()  local
1639 	ws = list_entry(ws_list, struct heuristic_ws, list);  in btrfs_compress_heuristic()
1641 	heuristic_collect_sample(inode, start, end, ws);  in btrfs_compress_heuristic()
1643 	if (sample_repeated_patterns(ws)) {  in btrfs_compress_heuristic()
1648 	memset(ws->bucket, 0, sizeof(*ws->bucket)*BUCKET_SIZE);  in btrfs_compress_heuristic()
1650 	for (i = 0; i < ws->sample_size; i++) {  in btrfs_compress_heuristic()
1651 		byte = ws->sample[i];  in btrfs_compress_heuristic()
1652 		ws->bucket[byte].count++;  in btrfs_compress_heuristic()
1655 	i = byte_set_size(ws);  in btrfs_compress_heuristic()
1661 	i = byte_core_set_size(ws);  in btrfs_compress_heuristic()
1672 	i = shannon_entropy(ws);  in btrfs_compress_heuristic()