1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
|
/*
* shrink.h - compressor definitions
*
* Copyright (C) 2019 Emmanuel Marty
*
* This software is provided 'as-is', without any express or implied
* warranty. In no event will the authors be held liable for any damages
* arising from the use of this software.
*
* Permission is granted to anyone to use this software for any purpose,
* including commercial applications, and to alter it and redistribute it
* freely, subject to the following restrictions:
*
* 1. The origin of this software must not be misrepresented; you must not
* claim that you wrote the original software. If you use this software
* in a product, an acknowledgment in the product documentation would be
* appreciated but is not required.
* 2. Altered source versions must be plainly marked as such, and must not be
* misrepresented as being the original software.
* 3. This notice may not be removed or altered from any source distribution.
*/
/*
* Uses the libdivsufsort library Copyright (c) 2003-2008 Yuta Mori
*
* Inspired by cap by Sven-�ke Dahl. https://github.com/svendahl/cap
* Also inspired by Charles Bloom's compression blog. http://cbloomrants.blogspot.com/
* With ideas from LZ4 by Yann Collet. https://github.com/lz4/lz4
* With help and support from spke <zxintrospec@gmail.com>
*
*/
#ifndef _SHRINK_H
#define _SHRINK_H
#include "divsufsort.h"
#ifdef __cplusplus
extern "C" {
#endif
#define LCP_BITS 15
#define TAG_BITS 4
#define LCP_MAX ((1U<<(LCP_BITS - TAG_BITS)) - 1)
#define LCP_AND_TAG_MAX ((1U<<LCP_BITS) - 1)
#define LCP_SHIFT (63-LCP_BITS)
#define LCP_MASK (((1ULL<<LCP_BITS) - 1) << LCP_SHIFT)
#define POS_MASK ((1ULL<<LCP_SHIFT) - 1)
#define VISITED_FLAG 0x8000000000000000ULL
#define EXCL_VISITED_MASK 0x7fffffffffffffffULL
#define NARRIVALS_PER_POSITION_MAX 62
#define NARRIVALS_PER_POSITION_NORMAL 46
#define NARRIVALS_PER_POSITION_SMALL 9
#define NMATCHES_PER_INDEX 64
#define MATCHES_PER_INDEX_SHIFT 6
#define LEAVE_ALONE_MATCH_SIZE 120
/** One match option */
typedef struct _apultra_match {
unsigned int length:11;
unsigned int offset:21;
} apultra_match;
/** One finalized match */
typedef struct _apultra_final_match {
int length;
int offset;
} apultra_final_match;
/** Forward arrival slot */
typedef struct _apultra_arrival {
int cost;
unsigned int from_pos:21;
int from_slot:7;
unsigned int follows_literal:1;
unsigned int rep_offset:21;
unsigned int short_offset:4;
unsigned int rep_pos:21;
unsigned int match_len:11;
int score;
} apultra_arrival;
/** Visited match */
typedef int apultra_visited;
/** Compression statistics */
typedef struct _apultra_stats {
int num_literals;
int num_4bit_matches;
int num_7bit_matches;
int num_variable_matches;
int num_rep_matches;
int num_eod;
int safe_dist;
int min_offset;
int max_offset;
long long total_offsets;
int min_match_len;
int max_match_len;
int total_match_lens;
int min_rle1_len;
int max_rle1_len;
int total_rle1_lens;
int min_rle2_len;
int max_rle2_len;
int total_rle2_lens;
int commands_divisor;
int match_divisor;
int rle1_divisor;
int rle2_divisor;
} apultra_stats;
/** Compression context */
typedef struct _apultra_compressor {
divsufsort_ctx_t divsufsort_context;
unsigned long long *intervals;
unsigned long long *pos_data;
unsigned long long *open_intervals;
apultra_match *match;
unsigned short *match_depth;
unsigned char *match1;
apultra_final_match *best_match;
apultra_arrival *arrival;
int *first_offset_for_byte;
int *next_offset_for_pos;
int *offset_cache;
int flags;
int block_size;
int max_offset;
int max_arrivals;
apultra_stats stats;
} apultra_compressor;
/**
* Get maximum compressed size of input(source) data
*
* @param nInputSize input(source) size in bytes
*
* @return maximum compressed size
*/
size_t apultra_get_max_compressed_size(size_t nInputSize);
/**
* Compress memory
*
* @param pInputData pointer to input(source) data to compress
* @param pOutBuffer buffer for compressed data
* @param nInputSize input(source) size in bytes
* @param nMaxOutBufferSize maximum capacity of compression buffer
* @param nFlags compression flags (set to 0)
* @param nMaxWindowSize maximum window size to use (0 for default)
* @param nDictionarySize size of dictionary in front of input data (0 for none)
* @param progress progress function, called after compressing each block, or NULL for none
* @param pStats pointer to compression stats that are filled if this function is successful, or NULL
*
* @return actual compressed size, or -1 for error
*/
size_t apultra_compress(const unsigned char *pInputData, unsigned char *pOutBuffer, size_t nInputSize, size_t nMaxOutBufferSize,
const unsigned int nFlags, size_t nMaxWindowSize, size_t nDictionarySize, void(*progress)(long long nOriginalSize, long long nCompressedSize), apultra_stats *pStats);
#ifdef __cplusplus
}
#endif
#endif /* _SHRINK_H */
|
