-
Notifications
You must be signed in to change notification settings - Fork 3
/
codec.c
472 lines (420 loc) · 8.92 KB
/
codec.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
470
471
/*************************************************************
Copyright (C) 1990, 1991, 1993 Andy C. Hung, all rights reserved.
PUBLIC DOMAIN LICENSE: Stanford University Portable Video Research
Group. If you use this software, you agree to the following: This
program package is purely experimental, and is licensed "as is".
Permission is granted to use, modify, and distribute this program
without charge for any purpose, provided this license/ disclaimer
notice appears in the copies. No warranty or maintenance is given,
either expressed or implied. In no event shall the author(s) be
liable to you or a third party for any special, incidental,
consequential, or other damages, arising out of the use or inability
to use the program for any purpose (or the loss of data), even if we
have been advised of such possibilities. Any public reference or
advertisement of this source code should refer to it as the Portable
Video Research Group (PVRG) code, and not by any author(s) (or
Stanford University) name.
*************************************************************/
/*
************************************************************
codec.c
This file contains the routines to run-length encode the ac and dc
coefficients.
************************************************************
*/
/*LABEL codec.c */
#include "globals.h"
#include "csize.h"
#define fputv mputv
#define fgetv mgetv
#define fputb mputb
#define fgetb mgetb
/*PUBLIC*/
extern void EncodeAC();
extern void CBPEncodeAC();
extern void DecodeAC();
extern void CBPDecodeAC();
extern int DecodeDC();
extern void EncodeDC();
/*PRIVATE*/
extern int bit_set_mask[];
extern int Loud;
extern int NumberNZ;
extern FRAME *CFrame;
extern IMAGE *CImage;
extern DHUFF *T1DHuff;
extern DHUFF *T2DHuff;
extern EHUFF *T1EHuff;
extern EHUFF *T2EHuff;
int extend_mask[] = {
0xFFFFFFFE,
0xFFFFFFFC,
0xFFFFFFF8,
0xFFFFFFF0,
0xFFFFFFE0,
0xFFFFFFC0,
0xFFFFFF80,
0xFFFFFF00,
0xFFFFFE00,
0xFFFFFC00,
0xFFFFF800,
0xFFFFF000,
0xFFFFE000,
0xFFFFC000,
0xFFFF8000,
0xFFFF0000,
0xFFFE0000,
0xFFFC0000,
0xFFF80000,
0xFFF00000
};
int CodedBlockBits=0;
int EOBBits=0;
/*START*/
/*BFUNC
EncodeAC() encodes the quantized coefficient matrix input by the first
Huffman table. The index is an offset into the matrix.
EFUNC*/
void EncodeAC(index,matrix)
int index;
int *matrix;
{
BEGIN("EncodeAC");
int k,r,l,code,retval,Start;
Start=swtell();
for(r=0,k=index-1;++k<BLOCKSIZE;)
{
l = matrix[k];
if (!l) {r++;}
else
{
if ((l < 128) && (l > -128))
{
code = abs(l) | (r << 8);
if (code != HUFFMAN_ESCAPE)
{
retval=Encode(code,T1EHuff);
}
else {retval=0;}
if (!retval)
{
Encode(HUFFMAN_ESCAPE,T1EHuff);
fputv(6,r);
fputv(8,l);
}
else
{
if (l < 0){fputb(1);}
else {fputb(0);}
}
}
else
{
Encode(HUFFMAN_ESCAPE,T1EHuff);
fputv(6,r);
if (l>0) {fputv(8,0x00);}
else {fputv(8,0x80);} /* Negative */
fputv(8,l&0xff);
}
r=0;
NumberNZ++;
}
}
CodedBlockBits+=(swtell()-Start);
EOBBits+=Encode(0,T1EHuff);
}
/*BFUNC
CBPEncodeAC() encodes the AC block matrix when we know there exists a
non-zero coefficient in the matrix. Thus the EOB cannot occur as the
first element and we save countless bits...
EFUNC*/
void CBPEncodeAC(index,matrix)
int index;
int *matrix;
{
BEGIN("CBPEncodeAC");
int k,r,l,code,retval,ovfl,Start;
Start=swtell();
for(ovfl=1,r=0,k=index-1;++k<BLOCKSIZE;)
{
l = matrix[k];
if (!l) {r++;}
else
{
if ((l < 128) && (l > -128))
{
code = abs(l) | (r << 8);
if (code != HUFFMAN_ESCAPE)
retval=Encode(code,T2EHuff);
else
retval=0;
if (!retval)
{
Encode(HUFFMAN_ESCAPE,T2EHuff);
fputv(6,r);
fputv(8,l);
}
else
{
if (l < 0) {fputb(1);}
else {fputb(0);}
}
}
else
{
Encode(HUFFMAN_ESCAPE,T1EHuff);
fputv(6,r);
if (l>0) {fputv(8,0x00);}
else {fputv(8,0x80);} /* Negative */
fputv(8,l&0xff);
}
ovfl=0;
NumberNZ++;
break;
}
}
if (ovfl)
{
WHEREAMI();
printf("CBP block without any coefficients.\n");
return;
}
for(r=0;++k<BLOCKSIZE;)
{
l = matrix[k];
if (!l) {r++;}
else
{
if ((l < 128) && (l > -128))
{
code = abs(l) | (r << 8);
if (code != HUFFMAN_ESCAPE) {retval=Encode(code,T1EHuff);}
else {retval=0;}
if (!retval)
{
Encode(HUFFMAN_ESCAPE,T1EHuff);
fputv(6,r);
fputv(8,l);
}
else
{
if (l < 0) {fputb(1);}
else {fputb(0);}
}
}
else
{
Encode(HUFFMAN_ESCAPE,T1EHuff);
fputv(6,r);
if (l>0) {fputv(8,0x00);}
else {fputv(8,0x80);} /* Negative */
fputv(8,l&0xff);
}
r=0;
NumberNZ++;
}
}
CodedBlockBits+=(swtell()-Start);
EOBBits+=Encode(0,T1EHuff);
}
/*BFUNC
DecodeAC() decodes from the stream and puts the elements into the matrix
starting from the value of index. The matrix must be given as input and
initialized to a value at least as large as 64.
EFUNC*/
void DecodeAC(index,matrix)
int index;
int *matrix;
{
BEGIN("DecodeAC");
int k,r,l;
int *mptr;
for(mptr=matrix+index;mptr<matrix+BLOCKSIZE;mptr++) {*mptr = 0;}
for(k=index;k<BLOCKSIZE;) /* JPEG Mistake */
{
r = Decode(T1DHuff);
if (!r)
{
#ifdef CODEC_DEBUG
printf("Return:%d\n",k);
#endif
return;
} /*Eof*/
if (r == HUFFMAN_ESCAPE)
{
r = fgetv(6);
l = fgetv(8);
if (l==0x00)
l = fgetv(8); /* extended precision */
else if (l==0x80)
l = fgetv(8) | extend_mask[7]; /* extended sign */
else if (l & bit_set_mask[7])
l |= extend_mask[7];
}
else
{
l = r & 0xff;
r = r >> 8;
if (fgetb()) {l = -l;}
}
#ifdef CODEC_DEBUG
printf("DecodeAC: k:%d r:%d l:%d\n",k,r,l);
#endif
k += r;
if (k>=BLOCKSIZE)
{
WHEREAMI();
printf("k greater than blocksize:\n",k);
break;
}
matrix[k++] = l;
NumberNZ++;
}
if (r=Decode(T1DHuff))
{
WHEREAMI();
printf("EOB expected, found 0x%x.\n",r);
}
}
/*BFUNC
CBPDecodeAC() decodes the stream when we assume the input cannot begin
with an EOB Huffman code. Thus we use a different Huffman table. The
input index is the offset within the matrix and the matrix must
already be defined to be greater than 64 elements of int.
EFUNC*/
void CBPDecodeAC(index,matrix)
int index;
int *matrix;
{
BEGIN("CBPDecodeAC");
int k,r,l;
int *mptr;
for(mptr=matrix+index;mptr<matrix+BLOCKSIZE;mptr++) {*mptr = 0;}
k = index;
r = Decode(T2DHuff);
if (!r)
{
WHEREAMI();
printf("Bad EOF in CBP block.\n");
return;
}
if (r==HUFFMAN_ESCAPE)
{
r = fgetv(6);
l = fgetv(8);
if (l==0x00)
l = fgetv(8); /* extended precision */
else if (l==0x80)
l = fgetv(8) | extend_mask[7]; /* extended sign */
else if (l & bit_set_mask[7])
l |= extend_mask[7];
}
else
{
l = r & 0xff;
r = r >> 8;
if (fgetb()) {l = -l;}
}
k += r;
matrix[k++] = l;
NumberNZ++;
while(k<BLOCKSIZE)
{
r = Decode(T1DHuff);
if (!r) {return;} /*Eof*/
if (r == HUFFMAN_ESCAPE)
{
r = fgetv(6);
l = fgetv(8);
if (l==0x00)
l = fgetv(8); /* extended precision */
else if (l==0x80)
l = fgetv(8) | extend_mask[7]; /* extended sign */
else if (l & bit_set_mask[7])
{
l |= extend_mask[7];
}
}
else
{
l = r & 0xff;
r = r >> 8;
if (fgetb()) {l = -l;}
}
#ifdef CODEC_DEBUG
printf("CBPDecodeAC: k:%d r:%d l:%d\n",r,l);
#endif
if (l & bit_set_mask[7])
l |= extend_mask[7];
k += r;
if (k>=BLOCKSIZE)
{
WHEREAMI();
printf("k greater than blocksize:\n",k);
break;
}
matrix[k++] = l;
NumberNZ++;
}
if (r=Decode(T1DHuff))
{
WHEREAMI();
printf("EOB expected, found 0x%x.\n",r);
}
}
/*BFUNC
DecodeDC() decodes a dc element from the stream.
EFUNC*/
int DecodeDC(LocalDHuff)
DHUFF *LocalDHuff;
{
BEGIN("DecodeDC");
int s,diff;
s = Decode(LocalDHuff);
#ifdef CODEC_DEBUG
printf("DC Decode sig. %d\n",s);
#endif
if (s)
{
diff = fgetv(s);
s--; /* Align */
#ifdef CODEC_DEBUG
printf("Raw DC Decode %d\n",diff);
#endif
if ((diff & bit_set_mask[s]) == 0)
{
diff |= extend_mask[s];
diff++;
}
}
else
diff=0;
return(diff);
}
/*BFUNC
EncodeDC() encodes the coefficient input into the output stream.
EFUNC*/
void EncodeDC(coef,LocalEHuff)
int coef;
EHUFF *LocalEHuff;
{
int cofac,s,encsize;
if (coef) NumberNZ++;
cofac = abs(coef);
if (cofac < 256)
s = csize[cofac];
else
{
cofac = cofac >> 8;
s = csize[cofac] + 8;
}
#ifdef CODEC_DEBUG
printf("DC Encoding Difference %d Size %d\n",coef,s);
#endif
encsize=Encode(s,LocalEHuff);
if (coef < 0)
coef--;
fputv(s,coef);
CodedBlockBits+=(s+encsize);
}
/*END*/