66 static int compression_compress_pages(int type, struct list_head *ws,  in compression_compress_pages()  argument
73 		return zlib_compress_pages(ws, mapping, start, pages,  in compression_compress_pages()
76 		return lzo_compress_pages(ws, mapping, start, pages,  in compression_compress_pages()
79 		return zstd_compress_pages(ws, mapping, start, pages,  in compression_compress_pages()
97 static int compression_decompress_bio(int type, struct list_head *ws,  in compression_decompress_bio()  argument
101 	case BTRFS_COMPRESS_ZLIB: return zlib_decompress_bio(ws, cb);  in compression_decompress_bio()
102 	case BTRFS_COMPRESS_LZO:  return lzo_decompress_bio(ws, cb);  in compression_decompress_bio()
103 	case BTRFS_COMPRESS_ZSTD: return zstd_decompress_bio(ws, cb);  in compression_decompress_bio()
114 static int compression_decompress(int type, struct list_head *ws,  in compression_decompress()  argument
119 	case BTRFS_COMPRESS_ZLIB: return zlib_decompress(ws, data_in, dest_page,  in compression_decompress()
121 	case BTRFS_COMPRESS_LZO:  return lzo_decompress(ws, data_in, dest_page,  in compression_decompress()
123 	case BTRFS_COMPRESS_ZSTD: return zstd_decompress(ws, data_in, dest_page,  in compression_decompress()
897 static void free_heuristic_ws(struct list_head *ws)  in free_heuristic_ws()  argument
901 	workspace = list_entry(ws, struct heuristic_ws, list);  in free_heuristic_ws()
911 	struct heuristic_ws *ws;  in alloc_heuristic_ws()  local
913 	ws = kzalloc(sizeof(*ws), GFP_KERNEL);  in alloc_heuristic_ws()
914 	if (!ws)  in alloc_heuristic_ws()
917 	ws->sample = kvmalloc(MAX_SAMPLE_SIZE, GFP_KERNEL);  in alloc_heuristic_ws()
918 	if (!ws->sample)  in alloc_heuristic_ws()
921 	ws->bucket = kcalloc(BUCKET_SIZE, sizeof(*ws->bucket), GFP_KERNEL);  in alloc_heuristic_ws()
922 	if (!ws->bucket)  in alloc_heuristic_ws()
925 	ws->bucket_b = kcalloc(BUCKET_SIZE, sizeof(*ws->bucket_b), GFP_KERNEL);  in alloc_heuristic_ws()
926 	if (!ws->bucket_b)  in alloc_heuristic_ws()
929 	INIT_LIST_HEAD(&ws->list);  in alloc_heuristic_ws()
930 	return &ws->list;  in alloc_heuristic_ws()
932 	free_heuristic_ws(&ws->list);  in alloc_heuristic_ws()
964 static void free_workspace(int type, struct list_head *ws)  in free_workspace()  argument
967 	case BTRFS_COMPRESS_NONE: return free_heuristic_ws(ws);  in free_workspace()
968 	case BTRFS_COMPRESS_ZLIB: return zlib_free_workspace(ws);  in free_workspace()
969 	case BTRFS_COMPRESS_LZO:  return lzo_free_workspace(ws);  in free_workspace()
970 	case BTRFS_COMPRESS_ZSTD: return zstd_free_workspace(ws);  in free_workspace()
1009 	struct list_head *ws;  in btrfs_cleanup_workspace_manager()  local
1013 		ws = wsman->idle_ws.next;  in btrfs_cleanup_workspace_manager()
1014 		list_del(ws);  in btrfs_cleanup_workspace_manager()
1015 		free_workspace(type, ws);  in btrfs_cleanup_workspace_manager()
1125 void btrfs_put_workspace(int type, struct list_head *ws)  in btrfs_put_workspace()  argument
1143 		list_add(ws, idle_ws);  in btrfs_put_workspace()
1150 	free_workspace(type, ws);  in btrfs_put_workspace()
1156 static void put_workspace(int type, struct list_head *ws)  in put_workspace()  argument
1159 	case BTRFS_COMPRESS_NONE: return btrfs_put_workspace(type, ws);  in put_workspace()
1160 	case BTRFS_COMPRESS_ZLIB: return btrfs_put_workspace(type, ws);  in put_workspace()
1161 	case BTRFS_COMPRESS_LZO:  return btrfs_put_workspace(type, ws);  in put_workspace()
1162 	case BTRFS_COMPRESS_ZSTD: return zstd_put_workspace(ws);  in put_workspace()
1390 static u32 shannon_entropy(struct heuristic_ws *ws)  in shannon_entropy()  argument
1397 	sz_base = ilog2_w(ws->sample_size);  in shannon_entropy()
1398 	for (i = 0; i < BUCKET_SIZE && ws->bucket[i].count > 0; i++) {  in shannon_entropy()
1399 		p = ws->bucket[i].count;  in shannon_entropy()
1404 	entropy_sum /= ws->sample_size;  in shannon_entropy()
1526 static int byte_core_set_size(struct heuristic_ws *ws)  in byte_core_set_size()  argument
1530 	const u32 core_set_threshold = ws->sample_size * 90 / 100;  in byte_core_set_size()
1531 	struct bucket_item *bucket = ws->bucket;  in byte_core_set_size()
1534 	radix_sort(ws->bucket, ws->bucket_b, BUCKET_SIZE);  in byte_core_set_size()
1564 static u32 byte_set_size(const struct heuristic_ws *ws)  in byte_set_size()  argument
1570 		if (ws->bucket[i].count > 0)  in byte_set_size()
1580 		if (ws->bucket[i].count > 0) {  in byte_set_size()
1590 static bool sample_repeated_patterns(struct heuristic_ws *ws)  in sample_repeated_patterns()  argument
1592 	const u32 half_of_sample = ws->sample_size / 2;  in sample_repeated_patterns()
1593 	const u8 *data = ws->sample;  in sample_repeated_patterns()
1599 				     struct heuristic_ws *ws)  in heuristic_collect_sample()  argument
1635 			memcpy(&ws->sample[curr_sample_pos], &in_data[i],  in heuristic_collect_sample()
1647 	ws->sample_size = curr_sample_pos;  in heuristic_collect_sample()
1668 	struct heuristic_ws *ws;  in btrfs_compress_heuristic()  local
1673 	ws = list_entry(ws_list, struct heuristic_ws, list);  in btrfs_compress_heuristic()
1675 	heuristic_collect_sample(inode, start, end, ws);  in btrfs_compress_heuristic()
1677 	if (sample_repeated_patterns(ws)) {  in btrfs_compress_heuristic()
1682 	memset(ws->bucket, 0, sizeof(*ws->bucket)*BUCKET_SIZE);  in btrfs_compress_heuristic()
1684 	for (i = 0; i < ws->sample_size; i++) {  in btrfs_compress_heuristic()
1685 		byte = ws->sample[i];  in btrfs_compress_heuristic()
1686 		ws->bucket[byte].count++;  in btrfs_compress_heuristic()
1689 	i = byte_set_size(ws);  in btrfs_compress_heuristic()
1695 	i = byte_core_set_size(ws);  in btrfs_compress_heuristic()
1706 	i = shannon_entropy(ws);  in btrfs_compress_heuristic()