forked from xbarin02/brain-compressor
-
Notifications
You must be signed in to change notification settings - Fork 0
/
libx.c
396 lines (290 loc) · 6.72 KB
/
libx.c
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
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
#include "libx.h"
#include <assert.h>
#include <stdint.h>
enum {
BIO_MODE_READ,
BIO_MODE_WRITE
};
struct bio {
uint32_t *ptr; /* pointer to memory */
void *end;
uint32_t b; /* bit buffer */
size_t c; /* bit counter */
};
static struct context {
size_t freq[256]; /* char -> frequency */
unsigned char sorted[256]; /* index -> char */
unsigned char order[256]; /* char -> index */
} table[256];
static size_t opt_k;
static size_t symbol_sum, symbol_count; /* mean = symbol_sum / symbol_count */
#define RESET_INTERVAL 256 /* recompute Golomb-Rice codes after... */
static void bio_open(struct bio *bio, void *ptr, void *end, int mode)
{
assert(bio != NULL);
bio->ptr = ptr;
bio->end = (char *)end - 3;
if (mode == BIO_MODE_READ) {
bio->c = 32;
} else {
bio->b = 0;
bio->c = 0;
}
}
static void bio_flush_buffer(struct bio *bio)
{
assert(bio != NULL);
assert(bio->ptr != NULL);
*(bio->ptr++) = bio->b;
bio->b = 0;
bio->c = 0;
}
static void bio_reload_buffer(struct bio *bio)
{
assert(bio != NULL);
assert(bio->ptr != NULL);
if ((void *)bio->ptr < bio->end) {
bio->b = *(bio->ptr++);
} else {
bio->b = 0x80000000;
}
bio->c = 0;
}
static void bio_put_nonzero_bit(struct bio *bio)
{
assert(bio != NULL);
assert(bio->c < 32);
bio->b |= (uint32_t)1 << bio->c;
bio->c++;
if (bio->c == 32) {
bio_flush_buffer(bio);
}
}
static size_t minsize(size_t a, size_t b)
{
return a < b ? a : b;
}
static size_t ctzu32(uint32_t n)
{
if (n == 0) {
return 32;
}
switch (sizeof(uint32_t)) {
static const int lut[32] = {
0, 1, 28, 2, 29, 14, 24, 3, 30, 22, 20, 15, 25, 17, 4, 8,
31, 27, 13, 23, 21, 19, 16, 7, 26, 12, 18, 6, 11, 5, 10, 9
};
#ifdef __GNUC__
case sizeof(unsigned):
return __builtin_ctz((unsigned)n);
case sizeof(unsigned long):
return __builtin_ctzl((unsigned long)n);
#endif
default:
/* http://graphics.stanford.edu/~seander/bithacks.html */
return lut[((uint32_t)((n & -n) * 0x077CB531U)) >> 27];
}
}
static void bio_write_bits(struct bio *bio, uint32_t b, size_t n)
{
assert(n <= 32);
for (int i = 0; i < 2; ++i) {
assert(bio->c < 32);
size_t m = minsize(32 - bio->c, n);
bio->b |= (b & (((uint32_t)1 << m) - 1)) << bio->c;
bio->c += m;
if (bio->c == 32) {
bio_flush_buffer(bio);
}
b >>= m;
n -= m;
if (n == 0) {
return;
}
}
}
static void bio_write_zero_bits(struct bio *bio, size_t n)
{
assert(n <= 32);
for (size_t m; n > 0; n -= m) {
assert(bio->c < 32);
m = minsize(32 - bio->c, n);
bio->c += m;
if (bio->c == 32) {
bio_flush_buffer(bio);
}
}
}
static uint32_t bio_read_bits(struct bio *bio, size_t n)
{
if (bio->c == 32) {
bio_reload_buffer(bio);
}
/* get the avail. least-significant bits */
size_t s = minsize(32 - bio->c, n);
uint32_t w = bio->b & (((uint32_t)1 << s) - 1);
bio->b >>= s;
bio->c += s;
n -= s;
/* need more bits? reload & get the most-significant bits */
if (n > 0) {
assert(bio->c == 32);
bio_reload_buffer(bio);
w |= (bio->b & (((uint32_t)1 << n) - 1)) << s;
bio->b >>= n;
bio->c += n;
}
return w;
}
static void bio_close(struct bio *bio, int mode)
{
assert(bio != NULL);
if (mode == BIO_MODE_WRITE && bio->c > 0) {
bio_flush_buffer(bio);
}
}
static void bio_write_unary(struct bio *bio, uint32_t N)
{
for (; N > 32; N -= 32) {
bio_write_zero_bits(bio, 32);
}
bio_write_zero_bits(bio, N);
bio_put_nonzero_bit(bio);
}
static uint32_t bio_read_unary(struct bio *bio)
{
/* get zeros... */
uint32_t total_zeros = 0;
assert(bio != NULL);
do {
if (bio->c == 32) {
bio_reload_buffer(bio);
}
/* get trailing zeros */
size_t s = minsize(32 - bio->c, ctzu32(bio->b));
bio->b >>= s;
bio->c += s;
total_zeros += s;
} while (bio->c == 32);
/* ...and drop non-zero bit */
assert(bio->c < 32);
bio->b >>= 1;
bio->c++;
return total_zeros;
}
/* Golomb-Rice, encode non-negative integer N, parameter M = 2^k */
static void bio_write_gr(struct bio *bio, size_t k, uint32_t N)
{
uint32_t Q = N >> k;
bio_write_unary(bio, Q);
assert(k <= 32);
bio_write_bits(bio, N, k);
}
static uint32_t bio_read_gr(struct bio *bio, size_t k)
{
uint32_t Q = bio_read_unary(bio);
uint32_t N = Q << k;
assert(k <= 32);
N |= bio_read_bits(bio, k);
return N;
}
void init()
{
opt_k = 3;
symbol_sum = 0;
symbol_count = 0;
for (int p = 0; p < 256; ++p) {
for (int i = 0; i < 256; ++i) {
table[p].sorted[i] = i;
table[p].freq[i] = 0;
table[p].order[i] = i;
}
}
}
static void swap_symbols(struct context *context, unsigned char c, unsigned char d)
{
assert(context != NULL);
unsigned char ic = context->order[c];
unsigned char id = context->order[d];
assert(context->sorted[ic] == c);
assert(context->sorted[id] == d);
context->sorted[ic] = d;
context->sorted[id] = c;
context->order[c] = id;
context->order[d] = ic;
}
static void increment_frequency(struct context *context, unsigned char c)
{
assert(context != NULL);
unsigned char ic = context->order[c];
size_t freq_c = ++(context->freq[c]);
unsigned char *pd;
for (pd = context->sorted + ic - 1; pd >= context->sorted; --pd) {
if (freq_c <= context->freq[*pd]) {
break;
}
}
unsigned char d = *(pd + 1);
if (c != d) {
swap_symbols(context, c, d);
}
}
/* https://ipnpr.jpl.nasa.gov/progress_report/42-159/159E.pdf */
static void update_model(unsigned char delta)
{
if (symbol_count == RESET_INTERVAL) {
int k;
/* 2^k <= E{r[k]} + 0 */
for (k = 1; (symbol_count << k) <= symbol_sum; ++k)
;
opt_k = k - 1;
symbol_count = 0;
symbol_sum = 0;
}
symbol_sum += delta;
symbol_count++;
}
void *compress(void *iptr, size_t isize, void *optr)
{
struct bio bio;
unsigned char *end = (unsigned char *)iptr + isize;
struct context *context = table + 0;
bio_open(&bio, optr, NULL, BIO_MODE_WRITE);
for (unsigned char *iptrc = iptr; iptrc < end; ++iptrc) {
unsigned char c = *iptrc;
/* get index */
unsigned char d = context->order[c];
bio_write_gr(&bio, opt_k, (uint32_t)d);
assert(c == context->sorted[d]);
/* update context model */
increment_frequency(context, c);
/* update Golomb-Rice model */
update_model(d);
context = table + c;
}
/* EOF symbol */
bio_write_gr(&bio, opt_k, 256);
bio_close(&bio, BIO_MODE_WRITE);
return bio.ptr;
}
void *decompress(void *iptr, size_t isize, void *optr)
{
struct bio bio;
unsigned char *end = (unsigned char *)iptr + isize;
struct context *context = table + 0;
bio_open(&bio, iptr, end, BIO_MODE_READ);
unsigned char *optrc = optr;
for (;; ++optrc) {
uint32_t d = bio_read_gr(&bio, opt_k);
if (d >= 256) {
break;
}
unsigned char c = context->sorted[d];
*optrc = c;
increment_frequency(context, c);
update_model(d);
context = table + c;
}
bio_close(&bio, BIO_MODE_READ);
return optrc;
}