/
c63dec.c
469 lines (386 loc) · 10.5 KB
/
c63dec.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
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
#include <assert.h>
#include <errno.h>
#include <getopt.h>
#include <math.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "c63.h"
#include "c63_write.h"
#include "common.h"
#include "io.h"
#include "me.h"
#include "tables.h"
/* Decode VLC token */
static uint8_t get_vlc_token(struct entropy_ctx *c, uint16_t *table,
uint8_t *table_sz, int tablelen)
{
int i, n;
uint16_t bits = 0;
for (n = 1; n <= 16; ++n)
{
bits <<= 1;
bits |= get_bits(c, 1);
/* See if this string matches a token in VLC table */
for (i = 0; i < tablelen; ++i)
{
if (table_sz[i] < n)
{
/* Too small token. */
continue;
}
if (table_sz[i] == n)
{
if (bits == (table[i] & ((1 << n) - 1)))
{
/* Found it */
return i;
}
}
}
}
fprintf(stdout, "VLC token not found.\n");
exit(EXIT_FAILURE);
}
/* Decode AC VLC token.
Optimized VLC decoder that takes advantage of the increasing order
of our ACVLC_Size table. Does not work with a general table, so use the
unoptimized get_vlc_token. A better approach would be to use an index table.
*/
static uint8_t get_vlc_token_ac(struct entropy_ctx *c,
uint16_t table[HUFF_AC_ZERO][HUFF_AC_SIZE],
uint8_t table_sz[HUFF_AC_ZERO][HUFF_AC_SIZE])
{
int n, x, y;
uint16_t bits = 0;
for (n = 1; n <= 16; ++n)
{
bits <<= 1;
bits |= get_bits(c, 1);
uint16_t mask = (1 << n) - 1;
for (x = 1; x < HUFF_AC_SIZE; ++x)
{
for (y = 0; y < HUFF_AC_ZERO; ++y)
{
if (table_sz[y][x] < n)
{
continue;
}
else if (table_sz[y][x] > n)
{
break;
}
else if (bits == (table[y][x] & mask))
{
/* Found it */
return y*HUFF_AC_SIZE + x;
}
}
if (table_sz[x][0] > n) { break; }
}
/* Check if it's a special token (bitsize 0) */
for (y = 0; y < HUFF_AC_ZERO; y += (HUFF_AC_ZERO-1))
{
if (table_sz[y][0] == n && bits == (table[y][0] & mask))
{
/* Found it */
return y*HUFF_AC_SIZE;
}
}
}
printf("VLC token not found (ac).\n");
exit(EXIT_FAILURE);
}
/* Decode sign of value from VLC. See Figure F.12 in spec. */
static int16_t extend_sign(int16_t v, int sz)
{
int vt = 1 << (sz - 1);
if (v >= vt) { return v; }
int range = (1 << sz) - 1;
v = -(range - v);
return v;
}
static void read_block(struct c63_common *cm, int16_t *out_data, uint32_t width,
uint32_t height, uint32_t uoffset, uint32_t voffset, int16_t *prev_DC,
int32_t cc, int channel)
{
int i, num_zero=0;
uint8_t size;
/* Read motion vector */
struct macroblock *mb =
&cm->curframe->mbs[channel][voffset/8 * cm->padw[channel]/8 + uoffset/8];
/* Use inter pred? */
mb->use_mv = get_bits(&cm->e_ctx, 1);
if (mb->use_mv)
{
int reuse_prev_mv = get_bits(&cm->e_ctx, 1);
if (reuse_prev_mv)
{
mb->mv_x = (mb-1)->mv_x;
mb->mv_y = (mb-1)->mv_y;
}
else
{
int16_t val;
size = get_vlc_token(&cm->e_ctx, MVVLC, MVVLC_Size, ARRAY_SIZE(MVVLC));
val = get_bits(&cm->e_ctx, size);
mb->mv_x = extend_sign(val, size);
size = get_vlc_token(&cm->e_ctx, MVVLC, MVVLC_Size, ARRAY_SIZE(MVVLC));
val = get_bits(&cm->e_ctx, size);
mb->mv_y = extend_sign(val, size);
}
}
/* Read residuals */
// Linear block in memory
int16_t *block = &out_data[uoffset * 8 + voffset * width];
memset(block, 0, 64 * sizeof(int16_t));
/* Decode DC */
size =
get_vlc_token(&cm->e_ctx, DCVLC[cc], DCVLC_Size[cc], ARRAY_SIZE(DCVLC[cc]));
int16_t dc = get_bits(&cm->e_ctx, size);
dc = extend_sign(dc, size);
block[0] = dc + *prev_DC;
*prev_DC = block[0];
/* Decode AC RLE */
for (i = 1; i < 64; ++i)
{
uint16_t token = get_vlc_token_ac(&cm->e_ctx, ACVLC[cc], ACVLC_Size[cc]);
num_zero = token / 11;
size = token % 11;
i += num_zero;
if (num_zero == 15 && size == 0) { continue; }
else if (num_zero == 0 && size == 0) { break; }
int16_t ac = get_bits(&cm->e_ctx, size);
block[i] = extend_sign(ac, size);
}
#if 0
int j;
static int blocknum;
++blocknum;
printf("Dump block %d:\n", blocknum);
for(i = 0; i < 8; ++i)
{
for (j = 0; j < 8; ++j)
{
printf(", %5d", block[i*8+j]);
}
printf("\n");
}
printf("Finished block\n\n");
#endif
}
static void read_interleaved_data_MCU(struct c63_common *cm, int16_t *dct,
uint32_t wi, uint32_t he, uint32_t h, uint32_t v, uint32_t x, uint32_t y,
int16_t *prev_DC, int32_t cc, int channel)
{
uint32_t i, j, ii, jj;
for(j = y*v*8; j < (y+1)*v*8; j += 8)
{
jj = he-8;
jj = MIN(j, jj);
for(i = x*h*8; i < (x+1)*h*8; i += 8)
{
ii = wi-8;
ii = MIN(i, ii);
read_block(cm, dct, wi, he, ii, jj, prev_DC, cc, channel);
}
}
}
void read_interleaved_data(struct c63_common *cm)
{
int u,v;
int16_t prev_DC[3] = {0, 0, 0};
uint32_t ublocks = (uint32_t) (ceil(cm->ypw/(float)(8.0f*2)));
uint32_t vblocks = (uint32_t) (ceil(cm->yph/(float)(8.0f*2)));
/* Write the MCU's interleaved */
for(v = 0; v < vblocks; ++v)
{
for(u = 0; u < ublocks; ++u)
{
read_interleaved_data_MCU(cm, cm->curframe->residuals->Ydct, cm->ypw,
cm->yph, YX, YY, u, v, &prev_DC[0], 0, 0);
read_interleaved_data_MCU(cm, cm->curframe->residuals->Udct, cm->upw,
cm->uph, UX, UY, u, v, &prev_DC[1], 1, 1);
read_interleaved_data_MCU(cm, cm->curframe->residuals->Vdct, cm->vpw,
cm->vph, VX, VY, u, v, &prev_DC[2], 1, 2);
}
}
}
// Define quantization tables
void parse_dqt(struct c63_common *cm)
{
int i;
uint16_t size;
size = (get_byte(cm->e_ctx.fp) << 8) | get_byte(cm->e_ctx.fp);
// Discard size
size = size; /* huh? */
for (i = 0; i < 3; ++i)
{
int idx = get_byte(cm->e_ctx.fp);
if (idx != i)
{
fprintf(stderr, "DQT: Expected %d - got %d\n", i, idx);
exit(EXIT_FAILURE);
}
read_bytes(cm->e_ctx.fp, cm->quanttbl[i], 64);
}
}
// Start of scan
void parse_sos(struct c63_common *cm)
{
uint16_t size;
size = (get_byte(cm->e_ctx.fp) << 8) | get_byte(cm->e_ctx.fp);
/* Don't care currently */
uint8_t buf[size];
read_bytes(cm->e_ctx.fp, buf, size-2);
}
// Baseline DCT
void parse_sof0(struct c63_common *cm)
{
uint16_t size;
size = (get_byte(cm->e_ctx.fp) << 8) | get_byte(cm->e_ctx.fp);
size = size; // Discard size
uint8_t precision = get_byte(cm->e_ctx.fp);
if (precision != 8)
{
fprintf(stderr, "Only 8-bit precision supported\n");
exit(EXIT_FAILURE);
}
uint16_t height = (get_byte(cm->e_ctx.fp) << 8) | get_byte(cm->e_ctx.fp);
uint16_t width = (get_byte(cm->e_ctx.fp) << 8) | get_byte(cm->e_ctx.fp);
// Discard subsampling info. We assume 4:2:0
uint8_t buf[10];
read_bytes(cm->e_ctx.fp, buf, 10);
/* First frame? */
if (cm->framenum == 0)
{
cm->width = width;
cm->height = height;
cm->padw[0] = cm->ypw = (uint32_t)(ceil(width/16.0f)*16);
cm->padh[0] = cm->yph = (uint32_t)(ceil(height/16.0f)*16);
cm->padw[1] = cm->upw = (uint32_t)(ceil(width*UX/(YX*8.0f))*8);
cm->padh[1] = cm->uph = (uint32_t)(ceil(height*UY/(YY*8.0f))*8);
cm->padw[2] = cm->vpw = (uint32_t)(ceil(width*VX/(YX*8.0f))*8);
cm->padh[2] = cm->vph = (uint32_t)(ceil(height*VY/(YY*8.0f))*8);
cm->mb_cols = cm->ypw / 8;
cm->mb_rows = cm->yph / 8;
cm->curframe = 0;
}
/* Advance to next frame */
destroy_frame(cm->refframe);
cm->refframe = cm->curframe;
cm->curframe = create_frame(cm, 0);
/* Is this a keyframe */
cm->curframe->keyframe = get_byte(cm->e_ctx.fp);
}
// Define Huffman tables
void parse_dht(struct c63_common *cm)
{
uint16_t size;
size = (get_byte(cm->e_ctx.fp) << 8) | get_byte(cm->e_ctx.fp);
// XXX: Should be handeled properly. However, we currently only use static
// tables
uint8_t buf[size];
read_bytes(cm->e_ctx.fp, buf, size-2);
}
int parse_c63_frame(struct c63_common *cm)
{
// SOI
if (get_byte(cm->e_ctx.fp) != JPEG_DEF_MARKER ||
get_byte(cm->e_ctx.fp) != JPEG_SOI_MARKER)
{
fprintf(stderr, "Not an JPEG file\n");
exit(EXIT_FAILURE);
}
while(1)
{
int c;
c = get_byte(cm->e_ctx.fp);
if (c == 0) { c = get_byte(cm->e_ctx.fp); }
if (c != JPEG_DEF_MARKER)
{
fprintf(stderr, "Expected marker.\n");
exit(EXIT_FAILURE);
}
uint8_t marker = get_byte(cm->e_ctx.fp);
if (marker == JPEG_DQT_MARKER)
{
parse_dqt(cm);
}
else if (marker == JPEG_SOS_MARKER)
{
parse_sos(cm);
read_interleaved_data(cm);
cm->e_ctx.bit_buffer = cm->e_ctx.bit_buffer_width = 0;
}
else if (marker == JPEG_SOF_MARKER)
{
parse_sof0(cm);
}
else if (marker == JPEG_DHT_MARKER)
{
parse_dht(cm);
}
else if (marker == JPEG_EOI_MARKER)
{
return 1;
}
else
{
fprintf(stderr, "Invalid marker: 0x%02x\n", marker);
exit(EXIT_FAILURE);
}
}
return 1;
}
void decode_c63_frame(struct c63_common *cm, FILE *fout)
{
/* Motion Compensation */
if (!cm->curframe->keyframe) { c63_motion_compensate(cm); }
/* Decode residuals */
dequantize_idct(cm->curframe->residuals->Ydct, cm->curframe->predicted->Y,
cm->ypw, cm->yph, cm->curframe->recons->Y, cm->quanttbl[0]);
dequantize_idct(cm->curframe->residuals->Udct, cm->curframe->predicted->U,
cm->upw, cm->uph, cm->curframe->recons->U, cm->quanttbl[1]);
dequantize_idct(cm->curframe->residuals->Vdct, cm->curframe->predicted->V,
cm->vpw, cm->vph, cm->curframe->recons->V, cm->quanttbl[2]);
#ifndef C63_PRED
/* Write result */
dump_image(cm->curframe->recons, cm->width, cm->height, fout);
#else
/* To dump the predicted frames, use this instead */
dump_image(cm->curframe->predicted, cm->width, cm->height, fout);
#endif
++cm->framenum;
}
static void print_help(int argc, char **argv)
{
printf("Usage: %s input.c63 output.yuv\n\n", argv[0]);
printf("Tip! Use mplayer to playback raw YUV file:\n");
printf("mplayer -demuxer rawvideo -rawvideo w=352:h=288 foreman.yuv\n\n");
exit(EXIT_FAILURE);
}
int main(int argc, char **argv)
{
if(argc < 3 || argc > 3) { print_help(argc, argv); }
FILE *fin = fopen(argv[1], "rb");
FILE *fout = fopen(argv[2], "wb");
if (!fin || !fout)
{
perror("fopen");
exit(EXIT_FAILURE);
}
struct c63_common *cm = calloc(1, sizeof(*cm));
cm->e_ctx.fp = fin;
int framenum = 0;
while(!feof(fin))
{
printf("Decoding frame %d\n", framenum++);
parse_c63_frame(cm);
decode_c63_frame(cm, fout);
}
fclose(fin);
fclose(fout);
return 0;
}