1 |
|
/****************************************************************************** |
2 |
|
* * |
3 |
|
* This file is part of XviD, a free MPEG-4 video encoder/decoder * |
4 |
|
* * |
5 |
|
* XviD is an implementation of a part of one or more MPEG-4 Video tools * |
6 |
|
* as specified in ISO/IEC 14496-2 standard. Those intending to use this * |
7 |
|
* software module in hardware or software products are advised that its * |
8 |
|
* use may infringe existing patents or copyrights, and any such use * |
9 |
|
* would be at such party's own risk. The original developer of this * |
10 |
|
* software module and his/her company, and subsequent editors and their * |
11 |
|
* companies, will have no liability for use of this software or * |
12 |
|
* modifications or derivatives thereof. * |
13 |
|
* * |
14 |
|
* XviD is free software; you can redistribute it and/or modify it * |
15 |
|
* under the terms of the GNU General Public License as published by * |
16 |
|
* the Free Software Foundation; either version 2 of the License, or * |
17 |
|
* (at your option) any later version. * |
18 |
|
* * |
19 |
|
* XviD is distributed in the hope that it will be useful, but * |
20 |
|
* WITHOUT ANY WARRANTY; without even the implied warranty of * |
21 |
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * |
22 |
|
* GNU General Public License for more details. * |
23 |
|
* * |
24 |
|
* You should have received a copy of the GNU General Public License * |
25 |
|
* along with this program; if not, write to the Free Software * |
26 |
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA * |
27 |
|
* * |
28 |
|
******************************************************************************/ |
29 |
|
|
30 |
|
/****************************************************************************** |
31 |
|
* * |
32 |
|
* bitstream.c * |
33 |
|
* * |
34 |
|
* Copyright (C) 2001 - Peter Ross <pross@cs.rmit.edu.au> * |
35 |
|
* * |
36 |
|
* For more information visit the XviD homepage: http://www.xvid.org * |
37 |
|
* * |
38 |
|
******************************************************************************/ |
39 |
|
|
40 |
|
/****************************************************************************** |
41 |
|
* * |
42 |
|
* Revision history: * |
43 |
|
* * |
44 |
|
* 14.04.2002 bframe encoding |
45 |
|
* 08.03.2002 initial version; isibaar * |
46 |
|
* * |
47 |
|
******************************************************************************/ |
48 |
|
|
49 |
|
|
50 |
|
|
51 |
|
#include <stdlib.h> |
52 |
#include "../portab.h" |
#include "../portab.h" |
53 |
#include "bitstream.h" |
#include "bitstream.h" |
54 |
#include "zigzag.h" |
#include "zigzag.h" |
55 |
#include "vlc_codes.h" |
#include "vlc_codes.h" |
56 |
|
#include "mbcoding.h" |
57 |
|
|
58 |
#include "../utils/mbfunctions.h" |
#include "../utils/mbfunctions.h" |
59 |
|
|
|
#include <stdlib.h> /* malloc, free */ |
|
|
|
|
|
#define ESCAPE 7167 |
|
60 |
#define ABS(X) (((X)>0)?(X):-(X)) |
#define ABS(X) (((X)>0)?(X):-(X)) |
61 |
#define CLIP(X,A) (X > A) ? (A) : (X) |
#define CLIP(X,A) (X > A) ? (A) : (X) |
62 |
|
|
63 |
static VLC *DCT3D[2]; |
VLC intra_table[65536]; |
64 |
|
VLC inter_table[65536]; |
65 |
|
|
66 |
|
VLC DCT3Dintra[4096]; |
67 |
|
VLC DCT3Dinter[4096]; |
68 |
|
|
69 |
VLC *intra_table, *inter_table; |
static int16_t clip_table[4096]; |
|
static short clip_table[4096]; |
|
70 |
|
|
71 |
void create_vlc_tables(void) |
void init_vlc_tables(void) |
72 |
{ |
{ |
73 |
|
|
74 |
int32_t k, l, i, intra, last; |
int32_t k, l, i, intra, last; |
76 |
VLC **coeff_ptr; |
VLC **coeff_ptr; |
77 |
VLC *vlc1, *vlc2; |
VLC *vlc1, *vlc2; |
78 |
|
|
|
VLC *DCT3Dintra; |
|
|
VLC *DCT3Dinter; |
|
|
|
|
|
DCT3Dintra = (VLC *) malloc(sizeof(VLC) * 4096); |
|
|
DCT3Dinter = (VLC *) malloc(sizeof(VLC) * 4096); |
|
|
|
|
79 |
vlc1 = DCT3Dintra; |
vlc1 = DCT3Dintra; |
80 |
vlc2 = DCT3Dinter; |
vlc2 = DCT3Dinter; |
81 |
|
|
82 |
vlc[0] = intra_table = (VLC *) malloc(128 * 511 * sizeof(VLC)); |
vlc[0] = intra_table; |
83 |
vlc[1] = inter_table = (VLC *) malloc(128 * 511 * sizeof(VLC)); |
vlc[1] = inter_table; |
84 |
|
|
85 |
// initialize the clipping table |
// initialize the clipping table |
86 |
for(i = -2048; i < 2048; i++) { |
for(i = -2048; i < 2048; i++) { |
91 |
clip_table[i + 2048] = 255; |
clip_table[i + 2048] = 255; |
92 |
} |
} |
93 |
|
|
94 |
// generate intra/inter vlc lookup table |
// generate encoding vlc lookup tables |
95 |
for(i = 0; i < 4; i++) { |
for(i = 0; i < 4; i++) { |
96 |
intra = i % 2; |
intra = i % 2; |
97 |
last = i >> 1; |
last = i / 2; |
98 |
|
|
99 |
coeff_ptr = coeff_vlc[last + (intra << 1)]; |
coeff_ptr = coeff_vlc[last + 2 * intra]; |
100 |
|
|
101 |
for(k = -255; k < 256; k++) { // level |
for(k = -255; k < 256; k++) { // level |
102 |
char *max_level_ptr = max_level[last + (intra << 1)]; |
int8_t *max_level_ptr = max_level[last + 2 * intra]; |
103 |
char *max_run_ptr = max_run[last + (intra << 1)]; |
int8_t *max_run_ptr = max_run[last + 2 * intra]; |
104 |
|
|
105 |
for(l = 0; l < 64; l++) { // run |
for(l = 0; l < 64; l++) { // run |
106 |
int32_t level = k; |
int32_t level = k; |
107 |
uint32_t run = l; |
uint32_t run = l; |
108 |
|
|
109 |
if(abs(level) <= max_level_ptr[run] && run <= max_run_ptr[abs(level)]) { |
if((abs(level) <= max_level_ptr[run]) && |
110 |
|
(run <= max_run_ptr[abs(level)])) { // level < max_level and run < max_run |
111 |
|
|
|
if(level > 0) { |
|
|
vlc[intra]->code = (coeff_ptr[run][level - 1].code) << 1; |
|
|
vlc[intra]->len = coeff_ptr[run][level - 1].len + 1; |
|
|
} |
|
|
else if(level < 0) { |
|
|
vlc[intra]->code = ((coeff_ptr[run][-level - 1].code) << 1) + 1; |
|
|
vlc[intra]->len = coeff_ptr[run][-level - 1].len + 1; |
|
|
} |
|
|
else { |
|
112 |
vlc[intra]->code = 0; |
vlc[intra]->code = 0; |
113 |
vlc[intra]->len = 0; |
vlc[intra]->len = 0; |
114 |
|
goto loop_end; |
115 |
} |
} |
116 |
} else { |
else { |
117 |
if(level > 0) |
if(level > 0) // correct level |
118 |
level -= max_level_ptr[run]; |
level -= max_level_ptr[run]; |
119 |
else |
else |
120 |
level += max_level_ptr[run]; |
level += max_level_ptr[run]; |
121 |
|
|
122 |
if(abs(level) <= max_level_ptr[run] && |
if((abs(level) <= max_level_ptr[run]) && |
123 |
run <= max_run_ptr[abs(level)]) { |
(run <= max_run_ptr[abs(level)])) { |
124 |
|
|
|
if(level > 0) { |
|
|
vlc[intra]->code = (0x06 << (coeff_ptr[run][level - 1].len + 1)) | |
|
|
(coeff_ptr[run][level - 1].code << 1); |
|
|
vlc[intra]->len = (coeff_ptr[run][level - 1].len + 1) + 8; |
|
|
} |
|
|
else if(level < 0) { |
|
|
vlc[intra]->code = (0x06 << (coeff_ptr[run][-level - 1].len + 1)) | |
|
|
((coeff_ptr[run][-level - 1].code << 1) + 1); |
|
|
vlc[intra]->len = (coeff_ptr[run][-level - 1].len + 1) + 8; |
|
|
} |
|
|
else { |
|
125 |
vlc[intra]->code = 0x06; |
vlc[intra]->code = 0x06; |
126 |
vlc[intra]->len = 8; |
vlc[intra]->len = 8; |
127 |
|
goto loop_end; |
128 |
} |
} |
129 |
} else { |
|
130 |
if(level > 0) |
if(level > 0) // still here? |
131 |
level += max_level_ptr[run]; |
level += max_level_ptr[run]; // restore level |
132 |
else |
else |
133 |
level -= max_level_ptr[run]; |
level -= max_level_ptr[run]; |
134 |
|
|
135 |
run -= max_run_ptr[abs(level)] + 1; |
run -= max_run_ptr[abs(level)] + 1; // and change run |
136 |
|
|
137 |
if(abs(level) <= max_level_ptr[run] && |
if((abs(level) <= max_level_ptr[run]) && |
138 |
run <= max_run_ptr[abs(level)]) { |
(run <= max_run_ptr[abs(level)])) { |
139 |
|
|
|
if(level > 0) { |
|
|
vlc[intra]->code = (0x0e << (coeff_ptr[run][level - 1].len + 1)) | |
|
|
(coeff_ptr[run][level - 1].code << 1); |
|
|
vlc[intra]->len = (coeff_ptr[run][level - 1].len + 1) + 9; |
|
|
} |
|
|
else if(level < 0) { |
|
|
vlc[intra]->code = (0x0e << (coeff_ptr[run][-level - 1].len + 1)) | |
|
|
((coeff_ptr[run][-level - 1].code << 1) + 1); |
|
|
vlc[intra]->len = (coeff_ptr[run][-level - 1].len + 1) + 9; |
|
|
} |
|
|
else { |
|
140 |
vlc[intra]->code = 0x0e; |
vlc[intra]->code = 0x0e; |
141 |
vlc[intra]->len = 9; |
vlc[intra]->len = 9; |
142 |
|
goto loop_end; |
143 |
} |
} |
|
} else { |
|
|
if(level != 0) |
|
144 |
run += max_run_ptr[abs(level)] + 1; |
run += max_run_ptr[abs(level)] + 1; |
145 |
else |
} |
|
run++; |
|
146 |
|
|
147 |
vlc[intra]->code = (uint32_t) ((0x1e + last) << 20) | |
vlc[intra]->code = (uint32_t) ((l << 14) | (0x1e + last) << 20) | |
148 |
(l << 14) | (1 << 13) | ((k & 0xfff) << 1) | 1; |
(1 << 13) | ((k & 0xfff) << 1) | 1; |
149 |
|
|
150 |
vlc[intra]->len = 30; |
vlc[intra]->len = 30; |
151 |
|
vlc[intra]++; |
152 |
|
continue; |
153 |
|
|
154 |
|
loop_end: |
155 |
|
if(level != 0) { |
156 |
|
vlc[intra]->code = (vlc[intra]->code << (coeff_ptr[run][abs(level) - 1].len + 1)) | |
157 |
|
(coeff_ptr[run][abs(level) - 1].code << 1); |
158 |
|
vlc[intra]->len = (coeff_ptr[run][abs(level) - 1].len + 1) + vlc[intra]->len; |
159 |
|
|
160 |
|
if(level < 0) |
161 |
|
vlc[intra]->code += 1; |
162 |
} |
} |
163 |
} |
|
|
} |
|
164 |
vlc[intra]++; |
vlc[intra]++; |
165 |
} |
} |
166 |
} |
} |
167 |
} |
} |
168 |
|
|
|
intra_table += 64*255; // center vlc tables |
|
|
inter_table += 64*255; // center vlc tables |
|
|
|
|
169 |
for(i = 0; i < 4096; i++) { |
for(i = 0; i < 4096; i++) { |
170 |
if(i >= 512) { |
if(i >= 512) { |
171 |
*vlc1 = DCT3Dtab3[(i >> 5) - 16]; |
*vlc1 = DCT3Dtab3[(i >> 5) - 16]; |
192 |
|
|
193 |
} |
} |
194 |
|
|
|
void destroy_vlc_tables(void) { |
|
|
|
|
|
if(intra_table != NULL && inter_table != NULL) { |
|
|
intra_table -= 64*255; // uncenter vlc tables |
|
|
inter_table -= 64*255; // uncenter vlc tables |
|
|
|
|
|
free(intra_table); |
|
|
free(inter_table); |
|
|
} |
|
|
|
|
|
if(DCT3D[0] != NULL && DCT3D[1] != NULL) { |
|
|
free(DCT3D[0]); |
|
|
free(DCT3D[1]); |
|
|
} |
|
|
|
|
|
} |
|
|
|
|
195 |
static __inline void CodeVector(Bitstream *bs, |
static __inline void CodeVector(Bitstream *bs, |
196 |
int16_t value, |
int16_t value, |
197 |
int16_t f_code, |
int16_t f_code, |
257 |
VLC *vlc; |
VLC *vlc; |
258 |
|
|
259 |
j = intra; |
j = intra; |
260 |
last = 1 + intra; |
last = intra; |
261 |
|
|
262 |
while((v = qcoeff[zigzag[j++]]) == 0); |
while((v = qcoeff[zigzag[j]]) == 0) j++; |
263 |
|
|
264 |
do { |
do { |
265 |
// count zeroes |
// count zeroes |
266 |
vlc = table + (clip_table[2048+v] << 6) + j - last; |
vlc = table + 64*255 + (clip_table[2048+v] << 6) + j - last; |
267 |
last = j + 1; |
last = ++j; |
268 |
while(j < 64 && (v = qcoeff[zigzag[j++]]) == 0); |
while(j < 64 && (v = qcoeff[zigzag[j]]) == 0) j++; |
269 |
|
|
270 |
// write code |
// write code |
271 |
if(j != 64) { |
if(j != 64) { |
441 |
|
|
442 |
} |
} |
443 |
|
|
444 |
|
/*************************************************************** |
445 |
|
* bframe encoding start |
446 |
|
***************************************************************/ |
447 |
|
|
448 |
|
/* |
449 |
|
mbtype |
450 |
|
0 1b direct(h263) mvdb |
451 |
|
1 01b interpolate mc+q dbquant, mvdf, mvdb |
452 |
|
2 001b backward mc+q dbquant, mvdb |
453 |
|
3 0001b forward mc+q dbquant, mvdf |
454 |
|
*/ |
455 |
|
|
456 |
|
void put_bvop_mbtype(Bitstream * bs, int value) |
457 |
|
{ |
458 |
|
switch(value) |
459 |
|
{ |
460 |
|
case 0 : BitstreamPutBit(bs, 1); |
461 |
|
return; |
462 |
|
|
463 |
|
case 1 : BitstreamPutBit(bs, 0); |
464 |
|
BitstreamPutBit(bs, 1); |
465 |
|
return; |
466 |
|
|
467 |
|
case 2 : BitstreamPutBit(bs, 0); |
468 |
|
BitstreamPutBit(bs, 0); |
469 |
|
BitstreamPutBit(bs, 1); |
470 |
|
return; |
471 |
|
|
472 |
|
case 3 : BitstreamPutBit(bs, 0); |
473 |
|
BitstreamPutBit(bs, 0); |
474 |
|
BitstreamPutBit(bs, 0); |
475 |
|
BitstreamPutBit(bs, 1); |
476 |
|
return; |
477 |
|
|
478 |
|
default : ; // invalid! |
479 |
|
|
480 |
|
} |
481 |
|
|
482 |
|
} |
483 |
|
|
484 |
|
/* |
485 |
|
dbquant |
486 |
|
-2 10b |
487 |
|
0 0b |
488 |
|
+2 11b |
489 |
|
*/ |
490 |
|
|
491 |
|
void put_bvop_dbquant(Bitstream *bs, int value) |
492 |
|
{ |
493 |
|
switch (value) |
494 |
|
{ |
495 |
|
case 0 : BitstreamPutBit(bs, 0); |
496 |
|
return; |
497 |
|
|
498 |
|
case -2 : BitstreamPutBit(bs, 1); |
499 |
|
BitstreamPutBit(bs, 0); |
500 |
|
return; |
501 |
|
|
502 |
|
case 2 : BitstreamPutBit(bs, 1); |
503 |
|
BitstreamPutBit(bs, 1); |
504 |
|
return; |
505 |
|
|
506 |
|
default : ; // invalid |
507 |
|
} |
508 |
|
} |
509 |
|
|
510 |
|
|
511 |
|
|
512 |
|
void MBCodingBVOP(const MACROBLOCK * mb, |
513 |
|
const int16_t qcoeff[6*64], |
514 |
|
const int16_t fcode, |
515 |
|
const int16_t bcode, |
516 |
|
Bitstream * bs, |
517 |
|
Statistics * pStat) |
518 |
|
{ |
519 |
|
int i; |
520 |
|
|
521 |
|
/* ------------------------------------------------------------------ |
522 |
|
when a block is skipped it is decoded DIRECT(0,) |
523 |
|
hence are interpolated from forward & backward frames |
524 |
|
------------------------------------------------------------------ */ |
525 |
|
|
526 |
|
if (mb->mode == 5) |
527 |
|
{ |
528 |
|
BitstreamPutBit(bs, 1); // skipped |
529 |
|
return; |
530 |
|
} |
531 |
|
|
532 |
|
BitstreamPutBit(bs, 0); // not skipped |
533 |
|
|
534 |
|
if (mb->cbp == 0) |
535 |
|
{ |
536 |
|
BitstreamPutBit(bs, 1); // cbp == 0 |
537 |
|
} |
538 |
|
else |
539 |
|
{ |
540 |
|
BitstreamPutBit(bs, 0); // cbp == xxx |
541 |
|
} |
542 |
|
|
543 |
|
put_bvop_mbtype(bs, mb->mode); |
544 |
|
|
545 |
|
if (mb->cbp) |
546 |
|
{ |
547 |
|
BitstreamPutBits(bs, mb->cbp, 6); |
548 |
|
} |
549 |
|
|
550 |
|
if (mb->mode != MODE_DIRECT && mb->cbp != 0) |
551 |
|
{ |
552 |
|
put_bvop_dbquant(bs, 0); // todo: mb->dquant = 0 |
553 |
|
} |
554 |
|
|
555 |
|
if (mb->mode == MODE_INTERPOLATE || mb->mode == MODE_FORWARD) |
556 |
|
{ |
557 |
|
CodeVector(bs, mb->pmvs[0].x, fcode, pStat); |
558 |
|
CodeVector(bs, mb->pmvs[0].y, fcode, pStat); |
559 |
|
} |
560 |
|
|
561 |
|
if (mb->mode == MODE_INTERPOLATE || mb->mode == MODE_BACKWARD) |
562 |
|
{ |
563 |
|
CodeVector(bs, mb->b_pmvs[0].x, bcode, pStat); |
564 |
|
CodeVector(bs, mb->b_pmvs[0].y, bcode, pStat); |
565 |
|
} |
566 |
|
|
567 |
|
if (mb->mode == MODE_DIRECT) |
568 |
|
{ |
569 |
|
// TODO: direct |
570 |
|
} |
571 |
|
|
572 |
|
for (i = 0; i < 6; i++) |
573 |
|
{ |
574 |
|
if (mb->cbp & (1 << (5 - i))) |
575 |
|
{ |
576 |
|
CodeCoeff(bs, &qcoeff[i*64], inter_table, scan_tables[0], 0); |
577 |
|
} |
578 |
|
} |
579 |
|
} |
580 |
|
|
581 |
|
|
582 |
|
|
583 |
/*************************************************************** |
/*************************************************************** |
584 |
* decoding stuff starts here * |
* decoding stuff starts here * |
732 |
|
|
733 |
} |
} |
734 |
|
|
|
int get_coeff(Bitstream * bs, int *run, int *last, int intra, int short_video_header) |
|
|
{ |
|
|
|
|
|
uint32_t mode; |
|
|
const VLC *tab; |
|
|
int32_t level; |
|
|
|
|
|
if(short_video_header) // inter-VLCs will be used for both intra and inter blocks |
|
|
intra = 0; |
|
|
|
|
|
tab = &DCT3D[intra][BitstreamShowBits(bs, 12)]; |
|
|
|
|
|
if(tab->code == -1) |
|
|
goto error; |
|
|
|
|
|
BitstreamSkip(bs, tab->len); |
|
|
|
|
|
if(tab->code != ESCAPE) { |
|
|
if(!intra) |
|
|
{ |
|
|
*run = (tab->code >> 4) & 255; |
|
|
level = tab->code & 15; |
|
|
*last = (tab->code >> 12) & 1; |
|
|
} |
|
|
else |
|
|
{ |
|
|
*run = (tab->code >> 8) & 255; |
|
|
level = tab->code & 255; |
|
|
*last = (tab->code >> 16) & 1; |
|
|
} |
|
|
return BitstreamGetBit(bs) ? -level : level; |
|
|
} |
|
|
|
|
|
if(short_video_header) |
|
|
{ |
|
|
// escape mode 4 - H.263 type, only used if short_video_header = 1 |
|
|
*last = BitstreamGetBit(bs); |
|
|
*run = BitstreamGetBits(bs, 6); |
|
|
level = BitstreamGetBits(bs, 8); |
|
|
|
|
|
if (level == 0 || level == 128) |
|
|
DEBUG1("Illegal LEVEL for ESCAPE mode 4:", level); |
|
|
|
|
|
return (level >= 128 ? -(256 - level) : level); |
|
|
} |
|
|
|
|
|
mode = BitstreamShowBits(bs, 2); |
|
|
|
|
|
if(mode < 3) { |
|
|
BitstreamSkip(bs, (mode == 2) ? 2 : 1); |
|
|
|
|
|
tab = &DCT3D[intra][BitstreamShowBits(bs, 12)]; |
|
|
if (tab->code == -1) |
|
|
goto error; |
|
|
|
|
|
BitstreamSkip(bs, tab->len); |
|
|
|
|
|
if (!intra) { |
|
|
*run = (tab->code >> 4) & 255; |
|
|
level = tab->code & 15; |
|
|
*last = (tab->code >> 12) & 1; |
|
|
} |
|
|
else |
|
|
{ |
|
|
*run = (tab->code >> 8) & 255; |
|
|
level = tab->code & 255; |
|
|
*last = (tab->code >> 16) & 1; |
|
|
} |
|
|
|
|
|
if(mode < 2) // first escape mode, level is offset |
|
|
level += max_level[*last + (!intra<<1)][*run]; // need to add back the max level |
|
|
else if(mode == 2) // second escape mode, run is offset |
|
|
*run += max_run[*last + (!intra<<1)][level] + 1; |
|
|
|
|
|
return BitstreamGetBit(bs) ? -level : level; |
|
|
} |
|
|
|
|
|
// third escape mode - fixed length codes |
|
|
BitstreamSkip(bs, 2); |
|
|
*last = BitstreamGetBits(bs, 1); |
|
|
*run = BitstreamGetBits(bs, 6); |
|
|
BitstreamSkip(bs, 1); // marker |
|
|
level = BitstreamGetBits(bs, 12); |
|
|
BitstreamSkip(bs, 1); // marker |
|
|
|
|
|
return (level & 0x800) ? (level | (-1 ^ 0xfff)) : level; |
|
|
|
|
|
error: |
|
|
*run = VLC_ERROR; |
|
|
return 0; |
|
|
|
|
|
} |
|
|
|
|
|
|
|
735 |
void get_intra_block(Bitstream * bs, int16_t * block, int direction, int coeff) |
void get_intra_block(Bitstream * bs, int16_t * block, int direction, int coeff) |
736 |
{ |
{ |
737 |
|
|