Mercurial > libavcodec.hg
annotate mpegvideo.c @ 945:463f7260b155 libavcodec
trellis quantization
author | michaelni |
---|---|
date | Tue, 31 Dec 2002 17:23:56 +0000 |
parents | caa77cd960c0 |
children | 4f522c9e6099 |
rev | line source |
---|---|
0 | 1 /* |
2 * The simplest mpeg encoder (well, it was the simplest!) | |
429 | 3 * Copyright (c) 2000,2001 Fabrice Bellard. |
0 | 4 * |
429 | 5 * This library is free software; you can redistribute it and/or |
6 * modify it under the terms of the GNU Lesser General Public | |
7 * License as published by the Free Software Foundation; either | |
8 * version 2 of the License, or (at your option) any later version. | |
0 | 9 * |
429 | 10 * This library is distributed in the hope that it will be useful, |
0 | 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
429 | 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
13 * Lesser General Public License for more details. | |
0 | 14 * |
429 | 15 * You should have received a copy of the GNU Lesser General Public |
16 * License along with this library; if not, write to the Free Software | |
17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA | |
295 | 18 * |
325 | 19 * 4MV & hq & b-frame encoding stuff by Michael Niedermayer <michaelni@gmx.at> |
0 | 20 */ |
701 | 21 |
22 #include <ctype.h> | |
0 | 23 #include "avcodec.h" |
24 #include "dsputil.h" | |
25 #include "mpegvideo.h" | |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
26 #include "simple_idct.h" |
0 | 27 |
17
b69fe46fd708
Adding fastmemcpy stuff to speedup mplayer project
nickols_k
parents:
13
diff
changeset
|
28 #ifdef USE_FASTMEMCPY |
b69fe46fd708
Adding fastmemcpy stuff to speedup mplayer project
nickols_k
parents:
13
diff
changeset
|
29 #include "fastmemcpy.h" |
b69fe46fd708
Adding fastmemcpy stuff to speedup mplayer project
nickols_k
parents:
13
diff
changeset
|
30 #endif |
b69fe46fd708
Adding fastmemcpy stuff to speedup mplayer project
nickols_k
parents:
13
diff
changeset
|
31 |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
32 //#undef NDEBUG |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
33 //#include <assert.h> |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
34 |
13
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
35 static void encode_picture(MpegEncContext *s, int picture_number); |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
36 static void dct_unquantize_mpeg1_c(MpegEncContext *s, |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
37 DCTELEM *block, int n, int qscale); |
325 | 38 static void dct_unquantize_mpeg2_c(MpegEncContext *s, |
39 DCTELEM *block, int n, int qscale); | |
13
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
40 static void dct_unquantize_h263_c(MpegEncContext *s, |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
41 DCTELEM *block, int n, int qscale); |
206 | 42 static void draw_edges_c(UINT8 *buf, int wrap, int width, int height, int w); |
344 | 43 static int dct_quantize_c(MpegEncContext *s, DCTELEM *block, int n, int qscale, int *overflow); |
945 | 44 static int dct_quantize_trellis_c(MpegEncContext *s, DCTELEM *block, int n, int qscale, int *overflow); |
206 | 45 |
46 void (*draw_edges)(UINT8 *buf, int wrap, int width, int height, int w)= draw_edges_c; | |
47 | |
0 | 48 |
49 /* enable all paranoid tests for rounding, overflows, etc... */ | |
50 //#define PARANOID | |
51 | |
52 //#define DEBUG | |
53 | |
321 | 54 |
0 | 55 /* for jpeg fast DCT */ |
56 #define CONST_BITS 14 | |
57 | |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
58 static const uint16_t aanscales[64] = { |
0 | 59 /* precomputed values scaled up by 14 bits */ |
60 16384, 22725, 21407, 19266, 16384, 12873, 8867, 4520, | |
61 22725, 31521, 29692, 26722, 22725, 17855, 12299, 6270, | |
62 21407, 29692, 27969, 25172, 21407, 16819, 11585, 5906, | |
63 19266, 26722, 25172, 22654, 19266, 15137, 10426, 5315, | |
64 16384, 22725, 21407, 19266, 16384, 12873, 8867, 4520, | |
65 12873, 17855, 16819, 15137, 12873, 10114, 6967, 3552, | |
936 | 66 8867 , 12299, 11585, 10426, 8867, 6967, 4799, 2446, |
67 4520 , 6270, 5906, 5315, 4520, 3552, 2446, 1247 | |
0 | 68 }; |
69 | |
768
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
70 /* Input permutation for the simple_idct_mmx */ |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
71 static const uint8_t simple_mmx_permutation[64]={ |
768
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
72 0x00, 0x08, 0x04, 0x09, 0x01, 0x0C, 0x05, 0x0D, |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
73 0x10, 0x18, 0x14, 0x19, 0x11, 0x1C, 0x15, 0x1D, |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
74 0x20, 0x28, 0x24, 0x29, 0x21, 0x2C, 0x25, 0x2D, |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
75 0x12, 0x1A, 0x16, 0x1B, 0x13, 0x1E, 0x17, 0x1F, |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
76 0x02, 0x0A, 0x06, 0x0B, 0x03, 0x0E, 0x07, 0x0F, |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
77 0x30, 0x38, 0x34, 0x39, 0x31, 0x3C, 0x35, 0x3D, |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
78 0x22, 0x2A, 0x26, 0x2B, 0x23, 0x2E, 0x27, 0x2F, |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
79 0x32, 0x3A, 0x36, 0x3B, 0x33, 0x3E, 0x37, 0x3F, |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
80 }; |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
81 |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
82 static const uint8_t h263_chroma_roundtab[16] = { |
0 | 83 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, |
84 }; | |
85 | |
815
78accc54493b
put a few large tables under #ifdef CONFIG_ENCODERS or dynamically allocate them
michaelni
parents:
814
diff
changeset
|
86 static UINT16 (*default_mv_penalty)[MAX_MV*2+1]=NULL; |
277
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
271
diff
changeset
|
87 static UINT8 default_fcode_tab[MAX_MV*2+1]; |
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
271
diff
changeset
|
88 |
625
bb6a69f9d409
slow but accurate integer dct from IJG (should be ok with the LGPL as the old DCT is the fast integer DCT from IJG)
michaelni
parents:
619
diff
changeset
|
89 static void convert_matrix(MpegEncContext *s, int (*qmat)[64], uint16_t (*qmat16)[64], uint16_t (*qmat16_bias)[64], |
709
afeff6ccb7f5
convert only needed matrixes in convert_matrix() (mjpeg calls it for every frame)
michaelni
parents:
706
diff
changeset
|
90 const UINT16 *quant_matrix, int bias, int qmin, int qmax) |
0 | 91 { |
344 | 92 int qscale; |
0 | 93 |
709
afeff6ccb7f5
convert only needed matrixes in convert_matrix() (mjpeg calls it for every frame)
michaelni
parents:
706
diff
changeset
|
94 for(qscale=qmin; qscale<=qmax; qscale++){ |
344 | 95 int i; |
625
bb6a69f9d409
slow but accurate integer dct from IJG (should be ok with the LGPL as the old DCT is the fast integer DCT from IJG)
michaelni
parents:
619
diff
changeset
|
96 if (s->fdct == ff_jpeg_fdct_islow) { |
bb6a69f9d409
slow but accurate integer dct from IJG (should be ok with the LGPL as the old DCT is the fast integer DCT from IJG)
michaelni
parents:
619
diff
changeset
|
97 for(i=0;i<64;i++) { |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
98 const int j= s->idct_permutation[i]; |
625
bb6a69f9d409
slow but accurate integer dct from IJG (should be ok with the LGPL as the old DCT is the fast integer DCT from IJG)
michaelni
parents:
619
diff
changeset
|
99 /* 16 <= qscale * quant_matrix[i] <= 7905 */ |
bb6a69f9d409
slow but accurate integer dct from IJG (should be ok with the LGPL as the old DCT is the fast integer DCT from IJG)
michaelni
parents:
619
diff
changeset
|
100 /* 19952 <= aanscales[i] * qscale * quant_matrix[i] <= 249205026 */ |
bb6a69f9d409
slow but accurate integer dct from IJG (should be ok with the LGPL as the old DCT is the fast integer DCT from IJG)
michaelni
parents:
619
diff
changeset
|
101 /* (1<<36)/19952 >= (1<<36)/(aanscales[i] * qscale * quant_matrix[i]) >= (1<<36)/249205026 */ |
bb6a69f9d409
slow but accurate integer dct from IJG (should be ok with the LGPL as the old DCT is the fast integer DCT from IJG)
michaelni
parents:
619
diff
changeset
|
102 /* 3444240 >= (1<<36)/(aanscales[i] * qscale * quant_matrix[i]) >= 275 */ |
bb6a69f9d409
slow but accurate integer dct from IJG (should be ok with the LGPL as the old DCT is the fast integer DCT from IJG)
michaelni
parents:
619
diff
changeset
|
103 |
764 | 104 qmat[qscale][i] = (int)((UINT64_C(1) << QMAT_SHIFT) / |
625
bb6a69f9d409
slow but accurate integer dct from IJG (should be ok with the LGPL as the old DCT is the fast integer DCT from IJG)
michaelni
parents:
619
diff
changeset
|
105 (qscale * quant_matrix[j])); |
bb6a69f9d409
slow but accurate integer dct from IJG (should be ok with the LGPL as the old DCT is the fast integer DCT from IJG)
michaelni
parents:
619
diff
changeset
|
106 } |
bb6a69f9d409
slow but accurate integer dct from IJG (should be ok with the LGPL as the old DCT is the fast integer DCT from IJG)
michaelni
parents:
619
diff
changeset
|
107 } else if (s->fdct == fdct_ifast) { |
344 | 108 for(i=0;i<64;i++) { |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
109 const int j= s->idct_permutation[i]; |
344 | 110 /* 16 <= qscale * quant_matrix[i] <= 7905 */ |
111 /* 19952 <= aanscales[i] * qscale * quant_matrix[i] <= 249205026 */ | |
112 /* (1<<36)/19952 >= (1<<36)/(aanscales[i] * qscale * quant_matrix[i]) >= (1<<36)/249205026 */ | |
113 /* 3444240 >= (1<<36)/(aanscales[i] * qscale * quant_matrix[i]) >= 275 */ | |
114 | |
764 | 115 qmat[qscale][i] = (int)((UINT64_C(1) << (QMAT_SHIFT + 14)) / |
344 | 116 (aanscales[i] * qscale * quant_matrix[j])); |
117 } | |
118 } else { | |
119 for(i=0;i<64;i++) { | |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
120 const int j= s->idct_permutation[i]; |
344 | 121 /* We can safely suppose that 16 <= quant_matrix[i] <= 255 |
122 So 16 <= qscale * quant_matrix[i] <= 7905 | |
123 so (1<<19) / 16 >= (1<<19) / (qscale * quant_matrix[i]) >= (1<<19) / 7905 | |
124 so 32768 >= (1<<19) / (qscale * quant_matrix[i]) >= 67 | |
125 */ | |
945 | 126 qmat[qscale][i] = (int)((UINT64_C(1) << QMAT_SHIFT) / (qscale * quant_matrix[j])); |
127 // qmat [qscale][i] = (1 << QMAT_SHIFT_MMX) / (qscale * quant_matrix[i]); | |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
128 qmat16[qscale][i] = (1 << QMAT_SHIFT_MMX) / (qscale * quant_matrix[j]); |
344 | 129 |
130 if(qmat16[qscale][i]==0 || qmat16[qscale][i]==128*256) qmat16[qscale][i]=128*256-1; | |
131 qmat16_bias[qscale][i]= ROUNDED_DIV(bias<<(16-QUANT_BIAS_SHIFT), qmat16[qscale][i]); | |
132 } | |
0 | 133 } |
134 } | |
135 } | |
456 | 136 // move into common.c perhaps |
137 #define CHECKED_ALLOCZ(p, size)\ | |
138 {\ | |
139 p= av_mallocz(size);\ | |
140 if(p==NULL){\ | |
141 perror("malloc");\ | |
142 goto fail;\ | |
143 }\ | |
144 } | |
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
145 |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
146 void ff_init_scantable(MpegEncContext *s, ScanTable *st, const UINT8 *src_scantable){ |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
147 int i; |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
148 int end; |
764 | 149 |
150 st->scantable= src_scantable; | |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
151 |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
152 for(i=0; i<64; i++){ |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
153 int j; |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
154 j = src_scantable[i]; |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
155 st->permutated[i] = s->idct_permutation[j]; |
828
ace3ccd18dd2
Altivec Patch (Mark III) by (Dieter Shirley <dieters at schemasoft dot com>)
michaelni
parents:
815
diff
changeset
|
156 #ifdef ARCH_POWERPC |
ace3ccd18dd2
Altivec Patch (Mark III) by (Dieter Shirley <dieters at schemasoft dot com>)
michaelni
parents:
815
diff
changeset
|
157 st->inverse[j] = i; |
ace3ccd18dd2
Altivec Patch (Mark III) by (Dieter Shirley <dieters at schemasoft dot com>)
michaelni
parents:
815
diff
changeset
|
158 #endif |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
159 } |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
160 |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
161 end=-1; |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
162 for(i=0; i<64; i++){ |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
163 int j; |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
164 j = st->permutated[i]; |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
165 if(j>end) end=j; |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
166 st->raster_end[i]= end; |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
167 } |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
168 } |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
169 |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
170 /* XXX: those functions should be suppressed ASAP when all IDCTs are |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
171 converted */ |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
172 // *FIXME* this is ugly hack using local static |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
173 static void (*ff_put_pixels_clamped)(const DCTELEM *block, UINT8 *pixels, int line_size); |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
174 static void (*ff_add_pixels_clamped)(const DCTELEM *block, UINT8 *pixels, int line_size); |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
175 static void ff_jref_idct_put(UINT8 *dest, int line_size, DCTELEM *block) |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
176 { |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
177 j_rev_dct (block); |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
178 ff_put_pixels_clamped(block, dest, line_size); |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
179 } |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
180 static void ff_jref_idct_add(UINT8 *dest, int line_size, DCTELEM *block) |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
181 { |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
182 j_rev_dct (block); |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
183 ff_add_pixels_clamped(block, dest, line_size); |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
184 } |
0 | 185 |
726
a91203b34e71
moved dct init out from mpv_common_init to dct_common_init (for less-uglier way for dv)
al3x
parents:
721
diff
changeset
|
186 /* init common dct for both encoder and decoder */ |
a91203b34e71
moved dct init out from mpv_common_init to dct_common_init (for less-uglier way for dv)
al3x
parents:
721
diff
changeset
|
187 int DCT_common_init(MpegEncContext *s) |
0 | 188 { |
726
a91203b34e71
moved dct init out from mpv_common_init to dct_common_init (for less-uglier way for dv)
al3x
parents:
721
diff
changeset
|
189 int i; |
0 | 190 |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
191 ff_put_pixels_clamped = s->dsp.put_pixels_clamped; |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
192 ff_add_pixels_clamped = s->dsp.add_pixels_clamped; |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
193 |
312 | 194 s->dct_unquantize_h263 = dct_unquantize_h263_c; |
325 | 195 s->dct_unquantize_mpeg1 = dct_unquantize_mpeg1_c; |
196 s->dct_unquantize_mpeg2 = dct_unquantize_mpeg2_c; | |
625
bb6a69f9d409
slow but accurate integer dct from IJG (should be ok with the LGPL as the old DCT is the fast integer DCT from IJG)
michaelni
parents:
619
diff
changeset
|
197 s->dct_quantize= dct_quantize_c; |
bb6a69f9d409
slow but accurate integer dct from IJG (should be ok with the LGPL as the old DCT is the fast integer DCT from IJG)
michaelni
parents:
619
diff
changeset
|
198 |
bb6a69f9d409
slow but accurate integer dct from IJG (should be ok with the LGPL as the old DCT is the fast integer DCT from IJG)
michaelni
parents:
619
diff
changeset
|
199 if(s->avctx->dct_algo==FF_DCT_FASTINT) |
bb6a69f9d409
slow but accurate integer dct from IJG (should be ok with the LGPL as the old DCT is the fast integer DCT from IJG)
michaelni
parents:
619
diff
changeset
|
200 s->fdct = fdct_ifast; |
bb6a69f9d409
slow but accurate integer dct from IJG (should be ok with the LGPL as the old DCT is the fast integer DCT from IJG)
michaelni
parents:
619
diff
changeset
|
201 else |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
202 s->fdct = ff_jpeg_fdct_islow; //slow/accurate/default |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
203 |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
204 if(s->avctx->idct_algo==FF_IDCT_INT){ |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
205 s->idct_put= ff_jref_idct_put; |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
206 s->idct_add= ff_jref_idct_add; |
768
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
207 s->idct_permutation_type= FF_LIBMPEG2_IDCT_PERM; |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
208 }else{ //accurate/default |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
209 s->idct_put= simple_idct_put; |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
210 s->idct_add= simple_idct_add; |
768
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
211 s->idct_permutation_type= FF_NO_IDCT_PERM; |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
212 } |
13
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
213 |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
214 #ifdef HAVE_MMX |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
215 MPV_common_init_mmx(s); |
8 | 216 #endif |
514
c9f724e3a797
Update and activate dct_unquantize_h263_mvi. Thanks to M«©ns Rullg«©rd
mellum
parents:
506
diff
changeset
|
217 #ifdef ARCH_ALPHA |
c9f724e3a797
Update and activate dct_unquantize_h263_mvi. Thanks to M«©ns Rullg«©rd
mellum
parents:
506
diff
changeset
|
218 MPV_common_init_axp(s); |
c9f724e3a797
Update and activate dct_unquantize_h263_mvi. Thanks to M«©ns Rullg«©rd
mellum
parents:
506
diff
changeset
|
219 #endif |
628
f596db4aa871
sun solaris compilation bugfix, patch by (Martin Olschewski <olschewski at zpr dot uni-koeln dot de>)
michaelni
parents:
625
diff
changeset
|
220 #ifdef HAVE_MLIB |
f596db4aa871
sun solaris compilation bugfix, patch by (Martin Olschewski <olschewski at zpr dot uni-koeln dot de>)
michaelni
parents:
625
diff
changeset
|
221 MPV_common_init_mlib(s); |
f596db4aa871
sun solaris compilation bugfix, patch by (Martin Olschewski <olschewski at zpr dot uni-koeln dot de>)
michaelni
parents:
625
diff
changeset
|
222 #endif |
721
71f669e9f633
ps2 optimizations update patch by (Leon van Stuivenberg <leonvs at iae dot nl>)
michaelni
parents:
717
diff
changeset
|
223 #ifdef HAVE_MMI |
71f669e9f633
ps2 optimizations update patch by (Leon van Stuivenberg <leonvs at iae dot nl>)
michaelni
parents:
717
diff
changeset
|
224 MPV_common_init_mmi(s); |
71f669e9f633
ps2 optimizations update patch by (Leon van Stuivenberg <leonvs at iae dot nl>)
michaelni
parents:
717
diff
changeset
|
225 #endif |
730 | 226 #ifdef ARCH_ARMV4L |
874 | 227 MPV_common_init_armv4l(s); |
730 | 228 #endif |
828
ace3ccd18dd2
Altivec Patch (Mark III) by (Dieter Shirley <dieters at schemasoft dot com>)
michaelni
parents:
815
diff
changeset
|
229 #ifdef ARCH_POWERPC |
ace3ccd18dd2
Altivec Patch (Mark III) by (Dieter Shirley <dieters at schemasoft dot com>)
michaelni
parents:
815
diff
changeset
|
230 MPV_common_init_ppc(s); |
ace3ccd18dd2
Altivec Patch (Mark III) by (Dieter Shirley <dieters at schemasoft dot com>)
michaelni
parents:
815
diff
changeset
|
231 #endif |
730 | 232 |
945 | 233 if(s->flags&CODEC_FLAG_TRELLIS_QUANT){ |
234 s->dct_quantize= dct_quantize_trellis_c; //move before MPV_common_init_* | |
235 } | |
236 | |
768
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
237 switch(s->idct_permutation_type){ |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
238 case FF_NO_IDCT_PERM: |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
239 for(i=0; i<64; i++) |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
240 s->idct_permutation[i]= i; |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
241 break; |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
242 case FF_LIBMPEG2_IDCT_PERM: |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
243 for(i=0; i<64; i++) |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
244 s->idct_permutation[i]= (i & 0x38) | ((i & 6) >> 1) | ((i & 1) << 2); |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
245 break; |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
246 case FF_SIMPLE_IDCT_PERM: |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
247 for(i=0; i<64; i++) |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
248 s->idct_permutation[i]= simple_mmx_permutation[i]; |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
249 break; |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
250 case FF_TRANSPOSE_IDCT_PERM: |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
251 for(i=0; i<64; i++) |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
252 s->idct_permutation[i]= ((i&7)<<3) | (i>>3); |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
253 break; |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
254 default: |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
255 fprintf(stderr, "Internal error, IDCT permutation not set\n"); |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
256 return -1; |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
257 } |
c3fc09466f92
idct_permutation_type variable, so the permutation type can quickly be identified
michaelni
parents:
767
diff
changeset
|
258 |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
259 |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
260 /* load & permutate scantables |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
261 note: only wmv uses differnt ones |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
262 */ |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
263 ff_init_scantable(s, &s->inter_scantable , ff_zigzag_direct); |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
264 ff_init_scantable(s, &s->intra_scantable , ff_zigzag_direct); |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
265 ff_init_scantable(s, &s->intra_h_scantable, ff_alternate_horizontal_scan); |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
266 ff_init_scantable(s, &s->intra_v_scantable, ff_alternate_vertical_scan); |
591 | 267 |
726
a91203b34e71
moved dct init out from mpv_common_init to dct_common_init (for less-uglier way for dv)
al3x
parents:
721
diff
changeset
|
268 return 0; |
a91203b34e71
moved dct init out from mpv_common_init to dct_common_init (for less-uglier way for dv)
al3x
parents:
721
diff
changeset
|
269 } |
a91203b34e71
moved dct init out from mpv_common_init to dct_common_init (for less-uglier way for dv)
al3x
parents:
721
diff
changeset
|
270 |
903 | 271 /** |
924 | 272 * allocates a Picture |
273 * The pixels are allocated/set by calling get_buffer() if shared=0 | |
903 | 274 */ |
924 | 275 static int alloc_picture(MpegEncContext *s, Picture *pic, int shared){ |
276 | |
277 if(shared){ | |
278 assert(pic->data[0]); | |
279 assert(pic->type == 0 || pic->type == FF_BUFFER_TYPE_SHARED); | |
280 pic->type= FF_BUFFER_TYPE_SHARED; | |
281 }else{ | |
282 int r; | |
283 | |
284 assert(!pic->data[0]); | |
285 | |
925 | 286 r= s->avctx->get_buffer(s->avctx, (AVFrame*)pic); |
924 | 287 |
288 if(r<0 || !pic->age || !pic->type || !pic->data[0]){ | |
289 fprintf(stderr, "get_buffer() failed (%d %d %d %X)\n", r, pic->age, pic->type, (int)pic->data[0]); | |
290 return -1; | |
291 } | |
292 | |
293 if(s->linesize && (s->linesize != pic->linesize[0] || s->uvlinesize != pic->linesize[1])){ | |
294 fprintf(stderr, "get_buffer() failed (stride changed)\n"); | |
295 return -1; | |
296 } | |
297 | |
298 if(pic->linesize[1] != pic->linesize[2]){ | |
299 fprintf(stderr, "get_buffer() failed (uv stride missmatch)\n"); | |
300 return -1; | |
301 } | |
302 | |
303 s->linesize = pic->linesize[0]; | |
304 s->uvlinesize= pic->linesize[1]; | |
903 | 305 } |
924 | 306 |
307 if(pic->qscale_table==NULL){ | |
308 if (s->encoding) { | |
309 CHECKED_ALLOCZ(pic->mb_var , s->mb_num * sizeof(INT16)) | |
310 CHECKED_ALLOCZ(pic->mc_mb_var, s->mb_num * sizeof(INT16)) | |
311 CHECKED_ALLOCZ(pic->mb_mean , s->mb_num * sizeof(INT8)) | |
312 } | |
313 | |
314 CHECKED_ALLOCZ(pic->mbskip_table , s->mb_num * sizeof(UINT8)+1) //the +1 is for the slice end check | |
315 CHECKED_ALLOCZ(pic->qscale_table , s->mb_num * sizeof(UINT8)) | |
316 pic->qstride= s->mb_width; | |
317 } | |
903 | 318 |
319 return 0; | |
320 fail: //for the CHECKED_ALLOCZ macro | |
321 return -1; | |
322 } | |
323 | |
924 | 324 /** |
325 * deallocates a picture | |
326 */ | |
903 | 327 static void free_picture(MpegEncContext *s, Picture *pic){ |
328 int i; | |
924 | 329 |
330 if(pic->data[0] && pic->type!=FF_BUFFER_TYPE_SHARED){ | |
925 | 331 s->avctx->release_buffer(s->avctx, (AVFrame*)pic); |
924 | 332 } |
333 | |
903 | 334 av_freep(&pic->mb_var); |
335 av_freep(&pic->mc_mb_var); | |
336 av_freep(&pic->mb_mean); | |
337 av_freep(&pic->mbskip_table); | |
338 av_freep(&pic->qscale_table); | |
339 | |
924 | 340 if(pic->type == FF_BUFFER_TYPE_INTERNAL){ |
903 | 341 for(i=0; i<4; i++){ |
342 av_freep(&pic->base[i]); | |
343 pic->data[i]= NULL; | |
344 } | |
345 av_freep(&pic->opaque); | |
924 | 346 pic->type= 0; |
347 }else if(pic->type == FF_BUFFER_TYPE_SHARED){ | |
348 for(i=0; i<4; i++){ | |
349 pic->base[i]= | |
350 pic->data[i]= NULL; | |
351 } | |
352 pic->type= 0; | |
903 | 353 } |
354 } | |
355 | |
726
a91203b34e71
moved dct init out from mpv_common_init to dct_common_init (for less-uglier way for dv)
al3x
parents:
721
diff
changeset
|
356 /* init common structure for both encoder and decoder */ |
a91203b34e71
moved dct init out from mpv_common_init to dct_common_init (for less-uglier way for dv)
al3x
parents:
721
diff
changeset
|
357 int MPV_common_init(MpegEncContext *s) |
a91203b34e71
moved dct init out from mpv_common_init to dct_common_init (for less-uglier way for dv)
al3x
parents:
721
diff
changeset
|
358 { |
756 | 359 int y_size, c_size, yc_size, i; |
726
a91203b34e71
moved dct init out from mpv_common_init to dct_common_init (for less-uglier way for dv)
al3x
parents:
721
diff
changeset
|
360 |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
361 dsputil_init(&s->dsp, s->avctx->dsp_mask); |
726
a91203b34e71
moved dct init out from mpv_common_init to dct_common_init (for less-uglier way for dv)
al3x
parents:
721
diff
changeset
|
362 DCT_common_init(s); |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
363 |
754 | 364 s->flags= s->avctx->flags; |
726
a91203b34e71
moved dct init out from mpv_common_init to dct_common_init (for less-uglier way for dv)
al3x
parents:
721
diff
changeset
|
365 |
903 | 366 s->mb_width = (s->width + 15) / 16; |
0 | 367 s->mb_height = (s->height + 15) / 16; |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
368 |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
369 /* set default edge pos, will be overriden in decode_header if needed */ |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
370 s->h_edge_pos= s->mb_width*16; |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
371 s->v_edge_pos= s->mb_height*16; |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
372 |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
373 s->mb_num = s->mb_width * s->mb_height; |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
374 |
756 | 375 y_size = (2 * s->mb_width + 2) * (2 * s->mb_height + 2); |
376 c_size = (s->mb_width + 2) * (s->mb_height + 2); | |
377 yc_size = y_size + 2 * c_size; | |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
378 |
701 | 379 /* convert fourcc to upper case */ |
380 s->avctx->fourcc= toupper( s->avctx->fourcc &0xFF) | |
381 + (toupper((s->avctx->fourcc>>8 )&0xFF)<<8 ) | |
382 + (toupper((s->avctx->fourcc>>16)&0xFF)<<16) | |
383 + (toupper((s->avctx->fourcc>>24)&0xFF)<<24); | |
582
5132a4ee50cd
different edge positions fixed with edge emu / dr1
michaelni
parents:
575
diff
changeset
|
384 |
567
5a6eaaa9fba2
larger edge emu buffer (might have been too small)
michaelni
parents:
566
diff
changeset
|
385 CHECKED_ALLOCZ(s->edge_emu_buffer, (s->width+64)*2*17*2); //(width + edge + align)*interlaced*MBsize*tolerance |
903 | 386 |
925 | 387 s->avctx->coded_frame= (AVFrame*)&s->current_picture; |
903 | 388 |
232
b640ec5948b0
- Now the ME is done for the entire picture when enconding, the
pulento
parents:
231
diff
changeset
|
389 if (s->encoding) { |
324 | 390 int mv_table_size= (s->mb_width+2)*(s->mb_height+2); |
391 | |
392 /* Allocate MV tables */ | |
456 | 393 CHECKED_ALLOCZ(s->p_mv_table , mv_table_size * 2 * sizeof(INT16)) |
394 CHECKED_ALLOCZ(s->b_forw_mv_table , mv_table_size * 2 * sizeof(INT16)) | |
395 CHECKED_ALLOCZ(s->b_back_mv_table , mv_table_size * 2 * sizeof(INT16)) | |
396 CHECKED_ALLOCZ(s->b_bidir_forw_mv_table , mv_table_size * 2 * sizeof(INT16)) | |
397 CHECKED_ALLOCZ(s->b_bidir_back_mv_table , mv_table_size * 2 * sizeof(INT16)) | |
398 CHECKED_ALLOCZ(s->b_direct_mv_table , mv_table_size * 2 * sizeof(INT16)) | |
324 | 399 |
903 | 400 //FIXME should be linesize instead of s->width*2 but that isnt known before get_buffer() |
936 | 401 CHECKED_ALLOCZ(s->me.scratchpad, s->width*2*16*3*sizeof(uint8_t)) |
456 | 402 |
936 | 403 CHECKED_ALLOCZ(s->me.map , ME_MAP_SIZE*sizeof(uint32_t)) |
404 CHECKED_ALLOCZ(s->me.score_map, ME_MAP_SIZE*sizeof(uint32_t)) | |
327 | 405 |
456 | 406 if(s->codec_id==CODEC_ID_MPEG4){ |
407 CHECKED_ALLOCZ(s->tex_pb_buffer, PB_BUFFER_SIZE); | |
408 CHECKED_ALLOCZ( s->pb2_buffer, PB_BUFFER_SIZE); | |
409 } | |
612 | 410 |
650
ef4a33aad86e
reducing sizeof MpegEncContext to avoid stack overflow on crap M$ windo$
michaelni
parents:
635
diff
changeset
|
411 if(s->msmpeg4_version){ |
ef4a33aad86e
reducing sizeof MpegEncContext to avoid stack overflow on crap M$ windo$
michaelni
parents:
635
diff
changeset
|
412 CHECKED_ALLOCZ(s->ac_stats, 2*2*(MAX_LEVEL+1)*(MAX_RUN+1)*2*sizeof(int)); |
ef4a33aad86e
reducing sizeof MpegEncContext to avoid stack overflow on crap M$ windo$
michaelni
parents:
635
diff
changeset
|
413 } |
612 | 414 CHECKED_ALLOCZ(s->avctx->stats_out, 256); |
232
b640ec5948b0
- Now the ME is done for the entire picture when enconding, the
pulento
parents:
231
diff
changeset
|
415 } |
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
416 |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
417 CHECKED_ALLOCZ(s->error_status_table, s->mb_num*sizeof(UINT8)) |
232
b640ec5948b0
- Now the ME is done for the entire picture when enconding, the
pulento
parents:
231
diff
changeset
|
418 |
288 | 419 if (s->out_format == FMT_H263 || s->encoding) { |
0 | 420 int size; |
456 | 421 /* Allocate MB type table */ |
422 CHECKED_ALLOCZ(s->mb_type , s->mb_num * sizeof(UINT8)) | |
423 | |
0 | 424 /* MV prediction */ |
425 size = (2 * s->mb_width + 2) * (2 * s->mb_height + 2); | |
456 | 426 CHECKED_ALLOCZ(s->motion_val, size * 2 * sizeof(INT16)); |
664 | 427 } |
428 | |
429 if(s->codec_id==CODEC_ID_MPEG4){ | |
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
430 /* interlaced direct mode decoding tables */ |
664 | 431 CHECKED_ALLOCZ(s->field_mv_table, s->mb_num*2*2 * sizeof(INT16)) |
432 CHECKED_ALLOCZ(s->field_select_table, s->mb_num*2* sizeof(INT8)) | |
0 | 433 } |
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
434 /* 4mv b frame decoding table */ |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
435 //note this is needed for h263 without b frames too (segfault on damaged streams otherwise) |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
436 CHECKED_ALLOCZ(s->co_located_type_table, s->mb_num * sizeof(UINT8)) |
767 | 437 if (s->out_format == FMT_H263) { |
0 | 438 /* ac values */ |
756 | 439 CHECKED_ALLOCZ(s->ac_val[0], yc_size * sizeof(INT16) * 16); |
0 | 440 s->ac_val[1] = s->ac_val[0] + y_size; |
441 s->ac_val[2] = s->ac_val[1] + c_size; | |
442 | |
443 /* cbp values */ | |
456 | 444 CHECKED_ALLOCZ(s->coded_block, y_size); |
333 | 445 |
446 /* divx501 bitstream reorder buffer */ | |
456 | 447 CHECKED_ALLOCZ(s->bitstream_buffer, BITSTREAM_BUFFER_SIZE); |
843 | 448 |
456 | 449 /* cbp, ac_pred, pred_dir */ |
450 CHECKED_ALLOCZ(s->cbp_table , s->mb_num * sizeof(UINT8)) | |
451 CHECKED_ALLOCZ(s->pred_dir_table, s->mb_num * sizeof(UINT8)) | |
197
21abf1b20016
different fix, s->mbintra_table used only if h263_pred set. - patch by Michael Niedermayer <michaelni@gmx.at>
arpi_esp
parents:
196
diff
changeset
|
452 } |
756 | 453 |
454 if (s->h263_pred || s->h263_plus || !s->encoding) { | |
455 /* dc values */ | |
456 //MN: we need these for error resilience of intra-frames | |
457 CHECKED_ALLOCZ(s->dc_val[0], yc_size * sizeof(INT16)); | |
458 s->dc_val[1] = s->dc_val[0] + y_size; | |
459 s->dc_val[2] = s->dc_val[1] + c_size; | |
460 for(i=0;i<yc_size;i++) | |
461 s->dc_val[0][i] = 1024; | |
462 } | |
463 | |
611
3214d3f4519e
error concealment needs the mbintra_table so it should allways be allocated
michaelni
parents:
608
diff
changeset
|
464 /* which mb is a intra block */ |
3214d3f4519e
error concealment needs the mbintra_table so it should allways be allocated
michaelni
parents:
608
diff
changeset
|
465 CHECKED_ALLOCZ(s->mbintra_table, s->mb_num); |
3214d3f4519e
error concealment needs the mbintra_table so it should allways be allocated
michaelni
parents:
608
diff
changeset
|
466 memset(s->mbintra_table, 1, s->mb_num); |
3214d3f4519e
error concealment needs the mbintra_table so it should allways be allocated
michaelni
parents:
608
diff
changeset
|
467 |
0 | 468 /* default structure is frame */ |
469 s->picture_structure = PICT_FRAME; | |
553 | 470 |
7
1d3ac9654178
added skip macroblock optimization (big perf win on black regions for example)
glantau
parents:
0
diff
changeset
|
471 /* init macroblock skip table */ |
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
472 CHECKED_ALLOCZ(s->mbskip_table, s->mb_num+1); |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
473 //Note the +1 is for a quicker mpeg4 slice_end detection |
294 | 474 |
327 | 475 s->block= s->blocks[0]; |
7
1d3ac9654178
added skip macroblock optimization (big perf win on black regions for example)
glantau
parents:
0
diff
changeset
|
476 |
842
e460775adb38
cleanup (breaks compatibility, requested by fabrice)
michaelni
parents:
828
diff
changeset
|
477 s->parse_context.state= -1; |
e460775adb38
cleanup (breaks compatibility, requested by fabrice)
michaelni
parents:
828
diff
changeset
|
478 |
0 | 479 s->context_initialized = 1; |
480 return 0; | |
481 fail: | |
244 | 482 MPV_common_end(s); |
483 return -1; | |
484 } | |
485 | |
456 | 486 |
487 //extern int sads; | |
488 | |
244 | 489 /* init common structure for both encoder and decoder */ |
490 void MPV_common_end(MpegEncContext *s) | |
491 { | |
492 int i; | |
493 | |
396
fce0a2520551
removed useless header includes - use av memory functions
glantau
parents:
376
diff
changeset
|
494 av_freep(&s->mb_type); |
fce0a2520551
removed useless header includes - use av memory functions
glantau
parents:
376
diff
changeset
|
495 av_freep(&s->p_mv_table); |
fce0a2520551
removed useless header includes - use av memory functions
glantau
parents:
376
diff
changeset
|
496 av_freep(&s->b_forw_mv_table); |
fce0a2520551
removed useless header includes - use av memory functions
glantau
parents:
376
diff
changeset
|
497 av_freep(&s->b_back_mv_table); |
fce0a2520551
removed useless header includes - use av memory functions
glantau
parents:
376
diff
changeset
|
498 av_freep(&s->b_bidir_forw_mv_table); |
fce0a2520551
removed useless header includes - use av memory functions
glantau
parents:
376
diff
changeset
|
499 av_freep(&s->b_bidir_back_mv_table); |
fce0a2520551
removed useless header includes - use av memory functions
glantau
parents:
376
diff
changeset
|
500 av_freep(&s->b_direct_mv_table); |
fce0a2520551
removed useless header includes - use av memory functions
glantau
parents:
376
diff
changeset
|
501 av_freep(&s->motion_val); |
fce0a2520551
removed useless header includes - use av memory functions
glantau
parents:
376
diff
changeset
|
502 av_freep(&s->dc_val[0]); |
fce0a2520551
removed useless header includes - use av memory functions
glantau
parents:
376
diff
changeset
|
503 av_freep(&s->ac_val[0]); |
fce0a2520551
removed useless header includes - use av memory functions
glantau
parents:
376
diff
changeset
|
504 av_freep(&s->coded_block); |
fce0a2520551
removed useless header includes - use av memory functions
glantau
parents:
376
diff
changeset
|
505 av_freep(&s->mbintra_table); |
456 | 506 av_freep(&s->cbp_table); |
507 av_freep(&s->pred_dir_table); | |
936 | 508 av_freep(&s->me.scratchpad); |
509 av_freep(&s->me.map); | |
510 av_freep(&s->me.score_map); | |
456 | 511 |
396
fce0a2520551
removed useless header includes - use av memory functions
glantau
parents:
376
diff
changeset
|
512 av_freep(&s->mbskip_table); |
fce0a2520551
removed useless header includes - use av memory functions
glantau
parents:
376
diff
changeset
|
513 av_freep(&s->bitstream_buffer); |
456 | 514 av_freep(&s->tex_pb_buffer); |
515 av_freep(&s->pb2_buffer); | |
553 | 516 av_freep(&s->edge_emu_buffer); |
664 | 517 av_freep(&s->co_located_type_table); |
518 av_freep(&s->field_mv_table); | |
519 av_freep(&s->field_select_table); | |
612 | 520 av_freep(&s->avctx->stats_out); |
650
ef4a33aad86e
reducing sizeof MpegEncContext to avoid stack overflow on crap M$ windo$
michaelni
parents:
635
diff
changeset
|
521 av_freep(&s->ac_stats); |
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
522 av_freep(&s->error_status_table); |
903 | 523 |
524 for(i=0; i<MAX_PICTURE_COUNT; i++){ | |
525 free_picture(s, &s->picture[i]); | |
0 | 526 } |
527 s->context_initialized = 0; | |
528 } | |
529 | |
530 /* init video encoder */ | |
531 int MPV_encode_init(AVCodecContext *avctx) | |
532 { | |
533 MpegEncContext *s = avctx->priv_data; | |
60 | 534 int i; |
0 | 535 |
315 | 536 avctx->pix_fmt = PIX_FMT_YUV420P; |
537 | |
0 | 538 s->bit_rate = avctx->bit_rate; |
268 | 539 s->bit_rate_tolerance = avctx->bit_rate_tolerance; |
0 | 540 s->frame_rate = avctx->frame_rate; |
541 s->width = avctx->width; | |
542 s->height = avctx->height; | |
456 | 543 if(avctx->gop_size > 600){ |
462
3fdd0627f6bd
typo (found by Bohdan Horst <nexus at hoth.amu.edu.pl>)
michaelni
parents:
461
diff
changeset
|
544 fprintf(stderr, "Warning keyframe interval too large! reducing it ...\n"); |
456 | 545 avctx->gop_size=600; |
546 } | |
0 | 547 s->gop_size = avctx->gop_size; |
162 | 548 s->rtp_mode = avctx->rtp_mode; |
549 s->rtp_payload_size = avctx->rtp_payload_size; | |
231 | 550 if (avctx->rtp_callback) |
551 s->rtp_callback = avctx->rtp_callback; | |
268 | 552 s->qmin= avctx->qmin; |
553 s->qmax= avctx->qmax; | |
554 s->max_qdiff= avctx->max_qdiff; | |
555 s->qcompress= avctx->qcompress; | |
556 s->qblur= avctx->qblur; | |
194
27d1773552c9
mpeg4 encoder fix by Michael Niedermayer <michaelni@gmx.at>
arpi_esp
parents:
191
diff
changeset
|
557 s->avctx = avctx; |
294 | 558 s->flags= avctx->flags; |
324 | 559 s->max_b_frames= avctx->max_b_frames; |
329 | 560 s->b_frame_strategy= avctx->b_frame_strategy; |
344 | 561 s->codec_id= avctx->codec->id; |
456 | 562 s->luma_elim_threshold = avctx->luma_elim_threshold; |
563 s->chroma_elim_threshold= avctx->chroma_elim_threshold; | |
564 s->strict_std_compliance= avctx->strict_std_compliance; | |
565 s->data_partitioning= avctx->flags & CODEC_FLAG_PART; | |
936 | 566 s->quarter_sample= (avctx->flags & CODEC_FLAG_QPEL)!=0; |
599 | 567 s->mpeg_quant= avctx->mpeg_quant; |
344 | 568 |
0 | 569 if (s->gop_size <= 1) { |
570 s->intra_only = 1; | |
571 s->gop_size = 12; | |
572 } else { | |
573 s->intra_only = 0; | |
574 } | |
693
b6a7ff92df57
darkness masking (lumi masking does only bright stuff now)
michaelni
parents:
690
diff
changeset
|
575 |
936 | 576 s->me_method = avctx->me_method; |
693
b6a7ff92df57
darkness masking (lumi masking does only bright stuff now)
michaelni
parents:
690
diff
changeset
|
577 |
320
cda7d0857baf
- ME setting moved to AVCodecContext/MpegEncContext, no longer a global.
pulento
parents:
315
diff
changeset
|
578 /* Fixed QSCALE */ |
0 | 579 s->fixed_qscale = (avctx->flags & CODEC_FLAG_QSCALE); |
232
b640ec5948b0
- Now the ME is done for the entire picture when enconding, the
pulento
parents:
231
diff
changeset
|
580 |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
581 s->adaptive_quant= ( s->avctx->lumi_masking |
693
b6a7ff92df57
darkness masking (lumi masking does only bright stuff now)
michaelni
parents:
690
diff
changeset
|
582 || s->avctx->dark_masking |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
583 || s->avctx->temporal_cplx_masking |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
584 || s->avctx->spatial_cplx_masking |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
585 || s->avctx->p_masking) |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
586 && !s->fixed_qscale; |
697 | 587 |
588 s->progressive_sequence= !(avctx->flags & CODEC_FLAG_INTERLACED_DCT); | |
693
b6a7ff92df57
darkness masking (lumi masking does only bright stuff now)
michaelni
parents:
690
diff
changeset
|
589 |
0 | 590 switch(avctx->codec->id) { |
591 case CODEC_ID_MPEG1VIDEO: | |
592 s->out_format = FMT_MPEG1; | |
336 | 593 avctx->delay=0; //FIXME not sure, should check the spec |
0 | 594 break; |
595 case CODEC_ID_MJPEG: | |
596 s->out_format = FMT_MJPEG; | |
597 s->intra_only = 1; /* force intra only for jpeg */ | |
232
b640ec5948b0
- Now the ME is done for the entire picture when enconding, the
pulento
parents:
231
diff
changeset
|
598 s->mjpeg_write_tables = 1; /* write all tables */ |
370
0eca28d16cbd
clamp intra matrix to 8bit for mjpeg (workaround for qscale>=25)
al3x
parents:
365
diff
changeset
|
599 s->mjpeg_data_only_frames = 0; /* write all the needed headers */ |
232
b640ec5948b0
- Now the ME is done for the entire picture when enconding, the
pulento
parents:
231
diff
changeset
|
600 s->mjpeg_vsample[0] = 2; /* set up default sampling factors */ |
b640ec5948b0
- Now the ME is done for the entire picture when enconding, the
pulento
parents:
231
diff
changeset
|
601 s->mjpeg_vsample[1] = 1; /* the only currently supported values */ |
b640ec5948b0
- Now the ME is done for the entire picture when enconding, the
pulento
parents:
231
diff
changeset
|
602 s->mjpeg_vsample[2] = 1; |
370
0eca28d16cbd
clamp intra matrix to 8bit for mjpeg (workaround for qscale>=25)
al3x
parents:
365
diff
changeset
|
603 s->mjpeg_hsample[0] = 2; |
232
b640ec5948b0
- Now the ME is done for the entire picture when enconding, the
pulento
parents:
231
diff
changeset
|
604 s->mjpeg_hsample[1] = 1; |
b640ec5948b0
- Now the ME is done for the entire picture when enconding, the
pulento
parents:
231
diff
changeset
|
605 s->mjpeg_hsample[2] = 1; |
0 | 606 if (mjpeg_init(s) < 0) |
607 return -1; | |
336 | 608 avctx->delay=0; |
924 | 609 s->low_delay=1; |
0 | 610 break; |
611 case CODEC_ID_H263: | |
232
b640ec5948b0
- Now the ME is done for the entire picture when enconding, the
pulento
parents:
231
diff
changeset
|
612 if (h263_get_picture_format(s->width, s->height) == 7) { |
b640ec5948b0
- Now the ME is done for the entire picture when enconding, the
pulento
parents:
231
diff
changeset
|
613 printf("Input picture size isn't suitable for h263 codec! try h263+\n"); |
0 | 614 return -1; |
232
b640ec5948b0
- Now the ME is done for the entire picture when enconding, the
pulento
parents:
231
diff
changeset
|
615 } |
0 | 616 s->out_format = FMT_H263; |
336 | 617 avctx->delay=0; |
924 | 618 s->low_delay=1; |
0 | 619 break; |
620 case CODEC_ID_H263P: | |
621 s->out_format = FMT_H263; | |
622 s->h263_plus = 1; | |
78 | 623 s->unrestricted_mv = 1; |
350
6ebbecc10063
- Advanced Intra Coding (AIC) support for H.263+ encoder, just DC by now.
pulento
parents:
347
diff
changeset
|
624 s->h263_aic = 1; |
79
82e579c37bc3
Moved some H.263+ variables to MpegEncContext to be thread-safe.
pulento
parents:
78
diff
changeset
|
625 |
82e579c37bc3
Moved some H.263+ variables to MpegEncContext to be thread-safe.
pulento
parents:
78
diff
changeset
|
626 /* These are just to be sure */ |
82e579c37bc3
Moved some H.263+ variables to MpegEncContext to be thread-safe.
pulento
parents:
78
diff
changeset
|
627 s->umvplus = 0; |
82e579c37bc3
Moved some H.263+ variables to MpegEncContext to be thread-safe.
pulento
parents:
78
diff
changeset
|
628 s->umvplus_dec = 0; |
336 | 629 avctx->delay=0; |
924 | 630 s->low_delay=1; |
0 | 631 break; |
632 case CODEC_ID_RV10: | |
633 s->out_format = FMT_H263; | |
634 s->h263_rv10 = 1; | |
336 | 635 avctx->delay=0; |
924 | 636 s->low_delay=1; |
0 | 637 break; |
71 | 638 case CODEC_ID_MPEG4: |
0 | 639 s->out_format = FMT_H263; |
640 s->h263_pred = 1; | |
641 s->unrestricted_mv = 1; | |
924 | 642 s->low_delay= s->max_b_frames ? 0 : 1; |
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
643 avctx->delay= s->low_delay ? 0 : (s->max_b_frames + 1); |
0 | 644 break; |
307 | 645 case CODEC_ID_MSMPEG4V1: |
0 | 646 s->out_format = FMT_H263; |
647 s->h263_msmpeg4 = 1; | |
648 s->h263_pred = 1; | |
649 s->unrestricted_mv = 1; | |
307 | 650 s->msmpeg4_version= 1; |
336 | 651 avctx->delay=0; |
924 | 652 s->low_delay=1; |
307 | 653 break; |
654 case CODEC_ID_MSMPEG4V2: | |
655 s->out_format = FMT_H263; | |
656 s->h263_msmpeg4 = 1; | |
657 s->h263_pred = 1; | |
658 s->unrestricted_mv = 1; | |
659 s->msmpeg4_version= 2; | |
336 | 660 avctx->delay=0; |
924 | 661 s->low_delay=1; |
307 | 662 break; |
663 case CODEC_ID_MSMPEG4V3: | |
664 s->out_format = FMT_H263; | |
665 s->h263_msmpeg4 = 1; | |
666 s->h263_pred = 1; | |
667 s->unrestricted_mv = 1; | |
668 s->msmpeg4_version= 3; | |
336 | 669 avctx->delay=0; |
924 | 670 s->low_delay=1; |
0 | 671 break; |
499 | 672 case CODEC_ID_WMV1: |
673 s->out_format = FMT_H263; | |
674 s->h263_msmpeg4 = 1; | |
675 s->h263_pred = 1; | |
676 s->unrestricted_mv = 1; | |
677 s->msmpeg4_version= 4; | |
678 avctx->delay=0; | |
924 | 679 s->low_delay=1; |
499 | 680 break; |
681 case CODEC_ID_WMV2: | |
682 s->out_format = FMT_H263; | |
683 s->h263_msmpeg4 = 1; | |
684 s->h263_pred = 1; | |
685 s->unrestricted_mv = 1; | |
686 s->msmpeg4_version= 5; | |
687 avctx->delay=0; | |
924 | 688 s->low_delay=1; |
499 | 689 break; |
0 | 690 default: |
691 return -1; | |
692 } | |
295 | 693 |
277
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
271
diff
changeset
|
694 { /* set up some save defaults, some codecs might override them later */ |
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
271
diff
changeset
|
695 static int done=0; |
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
271
diff
changeset
|
696 if(!done){ |
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
271
diff
changeset
|
697 int i; |
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
271
diff
changeset
|
698 done=1; |
815
78accc54493b
put a few large tables under #ifdef CONFIG_ENCODERS or dynamically allocate them
michaelni
parents:
814
diff
changeset
|
699 |
78accc54493b
put a few large tables under #ifdef CONFIG_ENCODERS or dynamically allocate them
michaelni
parents:
814
diff
changeset
|
700 default_mv_penalty= av_mallocz( sizeof(UINT16)*(MAX_FCODE+1)*(2*MAX_MV+1) ); |
292
73a9ce3d9715
fcode_tables where too small, found by Klaas-Pieter Vlieg <vlieg@eurescom.de>
michaelni
parents:
288
diff
changeset
|
701 memset(default_mv_penalty, 0, sizeof(UINT16)*(MAX_FCODE+1)*(2*MAX_MV+1)); |
277
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
271
diff
changeset
|
702 memset(default_fcode_tab , 0, sizeof(UINT8)*(2*MAX_MV+1)); |
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
271
diff
changeset
|
703 |
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
271
diff
changeset
|
704 for(i=-16; i<16; i++){ |
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
271
diff
changeset
|
705 default_fcode_tab[i + MAX_MV]= 1; |
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
271
diff
changeset
|
706 } |
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
271
diff
changeset
|
707 } |
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
271
diff
changeset
|
708 } |
936 | 709 s->me.mv_penalty= default_mv_penalty; |
277
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
271
diff
changeset
|
710 s->fcode_tab= default_fcode_tab; |
506
b9ed0ae72d51
init dc_scale tables to defaults (fixes mjpeg sig11)
michaelni
parents:
499
diff
changeset
|
711 s->y_dc_scale_table= |
b9ed0ae72d51
init dc_scale tables to defaults (fixes mjpeg sig11)
michaelni
parents:
499
diff
changeset
|
712 s->c_dc_scale_table= ff_mpeg1_dc_scale_table; |
b9ed0ae72d51
init dc_scale tables to defaults (fixes mjpeg sig11)
michaelni
parents:
499
diff
changeset
|
713 |
287 | 714 /* dont use mv_penalty table for crap MV as it would be confused */ |
936 | 715 //FIXME remove after fixing / removing old ME |
716 if (s->me_method < ME_EPZS) s->me.mv_penalty = default_mv_penalty; | |
287 | 717 |
7
1d3ac9654178
added skip macroblock optimization (big perf win on black regions for example)
glantau
parents:
0
diff
changeset
|
718 s->encoding = 1; |
1d3ac9654178
added skip macroblock optimization (big perf win on black regions for example)
glantau
parents:
0
diff
changeset
|
719 |
0 | 720 /* init */ |
721 if (MPV_common_init(s) < 0) | |
722 return -1; | |
723 | |
936 | 724 ff_init_me(s); |
725 | |
815
78accc54493b
put a few large tables under #ifdef CONFIG_ENCODERS or dynamically allocate them
michaelni
parents:
814
diff
changeset
|
726 #ifdef CONFIG_ENCODERS |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
727 if (s->out_format == FMT_H263) |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
728 h263_encode_init(s); |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
729 else if (s->out_format == FMT_MPEG1) |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
730 ff_mpeg1_encode_init(s); |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
731 if(s->msmpeg4_version) |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
732 ff_msmpeg4_encode_init(s); |
815
78accc54493b
put a few large tables under #ifdef CONFIG_ENCODERS or dynamically allocate them
michaelni
parents:
814
diff
changeset
|
733 #endif |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
734 |
60 | 735 /* init default q matrix */ |
736 for(i=0;i<64;i++) { | |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
737 int j= s->idct_permutation[i]; |
599 | 738 if(s->codec_id==CODEC_ID_MPEG4 && s->mpeg_quant){ |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
739 s->intra_matrix[j] = ff_mpeg4_default_intra_matrix[i]; |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
740 s->inter_matrix[j] = ff_mpeg4_default_non_intra_matrix[i]; |
599 | 741 }else if(s->out_format == FMT_H263){ |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
742 s->intra_matrix[j] = |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
743 s->inter_matrix[j] = ff_mpeg1_default_non_intra_matrix[i]; |
599 | 744 }else{ /* mpeg1 */ |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
745 s->intra_matrix[j] = ff_mpeg1_default_intra_matrix[i]; |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
746 s->inter_matrix[j] = ff_mpeg1_default_non_intra_matrix[i]; |
599 | 747 } |
344 | 748 } |
749 | |
750 /* precompute matrix */ | |
350
6ebbecc10063
- Advanced Intra Coding (AIC) support for H.263+ encoder, just DC by now.
pulento
parents:
347
diff
changeset
|
751 /* for mjpeg, we do include qscale in the matrix */ |
344 | 752 if (s->out_format != FMT_MJPEG) { |
625
bb6a69f9d409
slow but accurate integer dct from IJG (should be ok with the LGPL as the old DCT is the fast integer DCT from IJG)
michaelni
parents:
619
diff
changeset
|
753 convert_matrix(s, s->q_intra_matrix, s->q_intra_matrix16, s->q_intra_matrix16_bias, |
709
afeff6ccb7f5
convert only needed matrixes in convert_matrix() (mjpeg calls it for every frame)
michaelni
parents:
706
diff
changeset
|
754 s->intra_matrix, s->intra_quant_bias, 1, 31); |
625
bb6a69f9d409
slow but accurate integer dct from IJG (should be ok with the LGPL as the old DCT is the fast integer DCT from IJG)
michaelni
parents:
619
diff
changeset
|
755 convert_matrix(s, s->q_inter_matrix, s->q_inter_matrix16, s->q_inter_matrix16_bias, |
709
afeff6ccb7f5
convert only needed matrixes in convert_matrix() (mjpeg calls it for every frame)
michaelni
parents:
706
diff
changeset
|
756 s->inter_matrix, s->inter_quant_bias, 1, 31); |
60 | 757 } |
758 | |
329 | 759 if(ff_rate_control_init(s) < 0) |
760 return -1; | |
0 | 761 |
762 s->picture_number = 0; | |
277
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
271
diff
changeset
|
763 s->picture_in_gop_number = 0; |
0 | 764 s->fake_picture_number = 0; |
765 /* motion detector init */ | |
766 s->f_code = 1; | |
324 | 767 s->b_code = 1; |
0 | 768 |
769 return 0; | |
770 } | |
771 | |
772 int MPV_encode_end(AVCodecContext *avctx) | |
773 { | |
774 MpegEncContext *s = avctx->priv_data; | |
775 | |
776 #ifdef STATS | |
777 print_stats(); | |
778 #endif | |
329 | 779 |
780 ff_rate_control_uninit(s); | |
781 | |
0 | 782 MPV_common_end(s); |
783 if (s->out_format == FMT_MJPEG) | |
784 mjpeg_close(s); | |
232
b640ec5948b0
- Now the ME is done for the entire picture when enconding, the
pulento
parents:
231
diff
changeset
|
785 |
0 | 786 return 0; |
787 } | |
788 | |
789 /* draw the edges of width 'w' of an image of size width, height */ | |
619
2be2cc8fd0a1
mpeg4 interlaced decoding support (not completly implemented/tested due to lack of samples)
michaelni
parents:
618
diff
changeset
|
790 //FIXME check that this is ok for mpeg4 interlaced |
206 | 791 static void draw_edges_c(UINT8 *buf, int wrap, int width, int height, int w) |
0 | 792 { |
793 UINT8 *ptr, *last_line; | |
794 int i; | |
795 | |
796 last_line = buf + (height - 1) * wrap; | |
797 for(i=0;i<w;i++) { | |
798 /* top and bottom */ | |
799 memcpy(buf - (i + 1) * wrap, buf, width); | |
800 memcpy(last_line + (i + 1) * wrap, last_line, width); | |
801 } | |
802 /* left and right */ | |
803 ptr = buf; | |
804 for(i=0;i<height;i++) { | |
805 memset(ptr - w, ptr[0], w); | |
806 memset(ptr + width, ptr[width-1], w); | |
807 ptr += wrap; | |
808 } | |
809 /* corners */ | |
810 for(i=0;i<w;i++) { | |
811 memset(buf - (i + 1) * wrap - w, buf[0], w); /* top left */ | |
812 memset(buf - (i + 1) * wrap + width, buf[width-1], w); /* top right */ | |
813 memset(last_line + (i + 1) * wrap - w, last_line[0], w); /* top left */ | |
814 memset(last_line + (i + 1) * wrap + width, last_line[width-1], w); /* top right */ | |
815 } | |
816 } | |
817 | |
924 | 818 static int find_unused_picture(MpegEncContext *s, int shared){ |
819 int i; | |
820 | |
821 if(shared){ | |
822 for(i=0; i<MAX_PICTURE_COUNT; i++){ | |
823 if(s->picture[i].data[0]==NULL && s->picture[i].type==0) break; | |
824 } | |
825 }else{ | |
826 for(i=0; i<MAX_PICTURE_COUNT; i++){ | |
827 if(s->picture[i].data[0]==NULL && s->picture[i].type!=0) break; | |
828 } | |
829 for(i=0; i<MAX_PICTURE_COUNT; i++){ | |
830 if(s->picture[i].data[0]==NULL) break; | |
831 } | |
832 } | |
833 | |
834 assert(i<MAX_PICTURE_COUNT); | |
835 return i; | |
836 } | |
837 | |
0 | 838 /* generic function for encode/decode called before a frame is coded/decoded */ |
771
d4cc92144266
handle direct rendering buffer allocation failure
michaelni
parents:
768
diff
changeset
|
839 int MPV_frame_start(MpegEncContext *s, AVCodecContext *avctx) |
0 | 840 { |
924 | 841 int i; |
925 | 842 AVFrame *pic; |
0 | 843 |
46
931417475f5b
fixed mpeg1 first block bug (pb with black picture optimisation for B frames)
glantau
parents:
40
diff
changeset
|
844 s->mb_skiped = 0; |
903 | 845 |
846 /* mark&release old frames */ | |
847 if (s->pict_type != B_TYPE && s->last_picture.data[0]) { | |
848 for(i=0; i<MAX_PICTURE_COUNT; i++){ | |
924 | 849 //printf("%8X %d %d %X %X\n", s->picture[i].data[0], s->picture[i].type, i, s->next_picture.data[0], s->last_picture.data[0]); |
903 | 850 if(s->picture[i].data[0] == s->last_picture.data[0]){ |
851 // s->picture[i].reference=0; | |
925 | 852 avctx->release_buffer(avctx, (AVFrame*)&s->picture[i]); |
903 | 853 break; |
854 } | |
855 } | |
856 assert(i<MAX_PICTURE_COUNT); | |
857 | |
858 /* release forgotten pictures */ | |
859 /* if(mpeg124/h263) */ | |
860 if(!s->encoding){ | |
861 for(i=0; i<MAX_PICTURE_COUNT; i++){ | |
862 if(s->picture[i].data[0] && s->picture[i].data[0] != s->next_picture.data[0] && s->picture[i].reference){ | |
863 fprintf(stderr, "releasing zombie picture\n"); | |
925 | 864 avctx->release_buffer(avctx, (AVFrame*)&s->picture[i]); |
903 | 865 } |
866 } | |
867 } | |
868 } | |
910
eb448df811be
fixing files where the first frame isn a keyframe
michaelni
parents:
909
diff
changeset
|
869 alloc: |
eb448df811be
fixing files where the first frame isn a keyframe
michaelni
parents:
909
diff
changeset
|
870 if(!s->encoding){ |
924 | 871 i= find_unused_picture(s, 0); |
903 | 872 |
925 | 873 pic= (AVFrame*)&s->picture[i]; |
903 | 874 pic->reference= s->pict_type != B_TYPE; |
875 pic->coded_picture_number= s->current_picture.coded_picture_number+1; | |
876 | |
924 | 877 alloc_picture(s, (Picture*)pic, 0); |
903 | 878 |
879 s->current_picture= s->picture[i]; | |
880 } | |
456 | 881 |
903 | 882 if (s->pict_type != B_TYPE) { |
883 s->last_picture= s->next_picture; | |
884 s->next_picture= s->current_picture; | |
553 | 885 } |
910
eb448df811be
fixing files where the first frame isn a keyframe
michaelni
parents:
909
diff
changeset
|
886 |
eb448df811be
fixing files where the first frame isn a keyframe
michaelni
parents:
909
diff
changeset
|
887 if(s->pict_type != I_TYPE && s->last_picture.data[0]==NULL){ |
eb448df811be
fixing files where the first frame isn a keyframe
michaelni
parents:
909
diff
changeset
|
888 fprintf(stderr, "warning: first frame is no keyframe\n"); |
eb448df811be
fixing files where the first frame isn a keyframe
michaelni
parents:
909
diff
changeset
|
889 assert(s->pict_type != B_TYPE); //these should have been dropped if we dont have a reference |
eb448df811be
fixing files where the first frame isn a keyframe
michaelni
parents:
909
diff
changeset
|
890 goto alloc; |
eb448df811be
fixing files where the first frame isn a keyframe
michaelni
parents:
909
diff
changeset
|
891 } |
903 | 892 |
910
eb448df811be
fixing files where the first frame isn a keyframe
michaelni
parents:
909
diff
changeset
|
893 s->hurry_up= s->avctx->hurry_up; |
eb448df811be
fixing files where the first frame isn a keyframe
michaelni
parents:
909
diff
changeset
|
894 s->error_resilience= avctx->error_resilience; |
eb448df811be
fixing files where the first frame isn a keyframe
michaelni
parents:
909
diff
changeset
|
895 |
591 | 896 /* set dequantizer, we cant do it during init as it might change for mpeg4 |
897 and we cant do it in the header decode as init isnt called for mpeg4 there yet */ | |
898 if(s->out_format == FMT_H263){ | |
899 if(s->mpeg_quant) | |
900 s->dct_unquantize = s->dct_unquantize_mpeg2; | |
901 else | |
902 s->dct_unquantize = s->dct_unquantize_h263; | |
903 }else | |
904 s->dct_unquantize = s->dct_unquantize_mpeg1; | |
771
d4cc92144266
handle direct rendering buffer allocation failure
michaelni
parents:
768
diff
changeset
|
905 |
d4cc92144266
handle direct rendering buffer allocation failure
michaelni
parents:
768
diff
changeset
|
906 return 0; |
0 | 907 } |
13
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
908 |
0 | 909 /* generic function for encode/decode called after a frame has been coded/decoded */ |
910 void MPV_frame_end(MpegEncContext *s) | |
911 { | |
903 | 912 int i; |
0 | 913 /* draw edge for correct motion prediction if outside */ |
903 | 914 if(s->codec_id!=CODEC_ID_SVQ1){ |
915 if (s->pict_type != B_TYPE && !s->intra_only && !(s->flags&CODEC_FLAG_EMU_EDGE)) { | |
916 draw_edges(s->current_picture.data[0], s->linesize , s->h_edge_pos , s->v_edge_pos , EDGE_WIDTH ); | |
917 draw_edges(s->current_picture.data[1], s->uvlinesize, s->h_edge_pos>>1, s->v_edge_pos>>1, EDGE_WIDTH/2); | |
918 draw_edges(s->current_picture.data[2], s->uvlinesize, s->h_edge_pos>>1, s->v_edge_pos>>1, EDGE_WIDTH/2); | |
919 } | |
0 | 920 } |
207 | 921 emms_c(); |
329 | 922 |
612 | 923 s->last_pict_type = s->pict_type; |
329 | 924 if(s->pict_type!=B_TYPE){ |
925 s->last_non_b_pict_type= s->pict_type; | |
926 } | |
903 | 927 |
928 s->current_picture.quality= s->qscale; //FIXME get average of qscale_table | |
929 s->current_picture.pict_type= s->pict_type; | |
930 s->current_picture.key_frame= s->pict_type == I_TYPE; | |
931 | |
932 /* copy back current_picture variables */ | |
933 for(i=0; i<MAX_PICTURE_COUNT; i++){ | |
934 if(s->picture[i].data[0] == s->current_picture.data[0]){ | |
935 s->picture[i]= s->current_picture; | |
936 break; | |
937 } | |
938 } | |
939 assert(i<MAX_PICTURE_COUNT); | |
940 | |
941 /* release non refernce frames */ | |
942 for(i=0; i<MAX_PICTURE_COUNT; i++){ | |
924 | 943 if(s->picture[i].data[0] && !s->picture[i].reference /*&& s->picture[i].type!=FF_BUFFER_TYPE_SHARED*/) |
925 | 944 s->avctx->release_buffer(s->avctx, (AVFrame*)&s->picture[i]); |
324 | 945 } |
936 | 946 if(s->avctx->debug&FF_DEBUG_SKIP){ |
947 int x,y; | |
948 for(y=0; y<s->mb_height; y++){ | |
949 for(x=0; x<s->mb_width; x++){ | |
950 int count= s->mbskip_table[x + y*s->mb_width]; | |
951 if(count>9) count=9; | |
952 printf(" %1d", count); | |
953 } | |
954 printf("\n"); | |
955 } | |
956 printf("pict type: %d\n", s->pict_type); | |
957 } | |
903 | 958 } |
959 | |
915 | 960 static int get_sae(uint8_t *src, int ref, int stride){ |
961 int x,y; | |
962 int acc=0; | |
963 | |
964 for(y=0; y<16; y++){ | |
965 for(x=0; x<16; x++){ | |
966 acc+= ABS(src[x+y*stride] - ref); | |
967 } | |
968 } | |
969 | |
970 return acc; | |
971 } | |
972 | |
973 static int get_intra_count(MpegEncContext *s, uint8_t *src, uint8_t *ref, int stride){ | |
974 int x, y, w, h; | |
975 int acc=0; | |
976 | |
977 w= s->width &~15; | |
978 h= s->height&~15; | |
979 | |
980 for(y=0; y<h; y+=16){ | |
981 for(x=0; x<w; x+=16){ | |
982 int offset= x + y*stride; | |
983 int sad = s->dsp.pix_abs16x16(src + offset, ref + offset, stride); | |
984 int mean= (s->dsp.pix_sum(src + offset, stride) + 128)>>8; | |
985 int sae = get_sae(src + offset, mean, stride); | |
986 | |
987 acc+= sae + 500 < sad; | |
988 } | |
989 } | |
990 return acc; | |
991 } | |
992 | |
924 | 993 |
925 | 994 static int load_input_picture(MpegEncContext *s, AVFrame *pic_arg){ |
995 AVFrame *pic; | |
924 | 996 int i; |
903 | 997 const int encoding_delay= s->max_b_frames; |
924 | 998 int direct=1; |
999 | |
1000 if(encoding_delay && !(s->flags&CODEC_FLAG_INPUT_PRESERVED)) direct=0; | |
1001 if(pic_arg->linesize[0] != s->linesize) direct=0; | |
1002 if(pic_arg->linesize[1] != s->uvlinesize) direct=0; | |
1003 if(pic_arg->linesize[2] != s->uvlinesize) direct=0; | |
1004 | |
1005 // printf("%d %d %d %d\n",pic_arg->linesize[0], pic_arg->linesize[1], s->linesize, s->uvlinesize); | |
1006 | |
1007 if(direct){ | |
1008 i= find_unused_picture(s, 1); | |
1009 | |
925 | 1010 pic= (AVFrame*)&s->picture[i]; |
924 | 1011 pic->reference= 1; |
903 | 1012 |
924 | 1013 for(i=0; i<4; i++){ |
1014 pic->data[i]= pic_arg->data[i]; | |
1015 pic->linesize[i]= pic_arg->linesize[i]; | |
1016 } | |
1017 alloc_picture(s, (Picture*)pic, 1); | |
1018 }else{ | |
1019 i= find_unused_picture(s, 0); | |
1020 | |
925 | 1021 pic= (AVFrame*)&s->picture[i]; |
924 | 1022 pic->reference= 1; |
1023 | |
1024 alloc_picture(s, (Picture*)pic, 0); | |
1025 | |
1026 if( pic->data[0] == pic_arg->data[0] | |
1027 && pic->data[1] == pic_arg->data[1] | |
1028 && pic->data[2] == pic_arg->data[2]){ | |
1029 // empty | |
1030 }else{ | |
1031 int h_chroma_shift, v_chroma_shift; | |
1032 | |
1033 avcodec_get_chroma_sub_sample(s->avctx->pix_fmt, &h_chroma_shift, &v_chroma_shift); | |
1034 | |
1035 for(i=0; i<3; i++){ | |
1036 int src_stride= pic_arg->linesize[i]; | |
1037 int dst_stride= i ? s->uvlinesize : s->linesize; | |
1038 int h_shift= i ? h_chroma_shift : 0; | |
1039 int v_shift= i ? v_chroma_shift : 0; | |
1040 int w= s->width >>h_shift; | |
1041 int h= s->height>>v_shift; | |
1042 uint8_t *src= pic_arg->data[i]; | |
1043 uint8_t *dst= pic->data[i]; | |
1044 | |
1045 if(src_stride==dst_stride) | |
1046 memcpy(dst, src, src_stride*h); | |
1047 else{ | |
1048 while(h--){ | |
1049 memcpy(dst, src, w); | |
1050 dst += dst_stride; | |
1051 src += src_stride; | |
1052 } | |
1053 } | |
1054 } | |
1055 } | |
324 | 1056 } |
924 | 1057 pic->quality= pic_arg->quality; |
1058 pic->pict_type= pic_arg->pict_type; | |
903 | 1059 |
1060 if(s->input_picture[encoding_delay]) | |
1061 pic->display_picture_number= s->input_picture[encoding_delay]->display_picture_number + 1; | |
1062 | |
1063 /* shift buffer entries */ | |
1064 for(i=1; i<MAX_PICTURE_COUNT /*s->encoding_delay+1*/; i++) | |
1065 s->input_picture[i-1]= s->input_picture[i]; | |
1066 | |
1067 s->input_picture[encoding_delay]= (Picture*)pic; | |
1068 | |
1069 return 0; | |
1070 } | |
1071 | |
1072 static void select_input_picture(MpegEncContext *s){ | |
1073 int i; | |
1074 const int encoding_delay= s->max_b_frames; | |
1075 int coded_pic_num=0; | |
1076 | |
1077 if(s->reordered_input_picture[0]) | |
1078 coded_pic_num= s->reordered_input_picture[0]->coded_picture_number + 1; | |
924 | 1079 |
903 | 1080 for(i=1; i<MAX_PICTURE_COUNT; i++) |
1081 s->reordered_input_picture[i-1]= s->reordered_input_picture[i]; | |
1082 s->reordered_input_picture[MAX_PICTURE_COUNT-1]= NULL; | |
1083 | |
1084 /* set next picture types & ordering */ | |
1085 if(s->reordered_input_picture[0]==NULL && s->input_picture[0]){ | |
915 | 1086 if(/*s->picture_in_gop_number >= s->gop_size ||*/ s->next_picture.data[0]==NULL || s->intra_only){ |
1087 s->reordered_input_picture[0]= s->input_picture[0]; | |
1088 s->reordered_input_picture[0]->pict_type= I_TYPE; | |
1089 s->reordered_input_picture[0]->coded_picture_number= coded_pic_num; | |
1090 }else{ | |
1091 int b_frames; | |
1092 | |
1093 if(s->flags&CODEC_FLAG_PASS2){ | |
1094 for(i=0; i<s->max_b_frames+1; i++){ | |
1095 int pict_num= s->input_picture[0]->display_picture_number + i; | |
1096 int pict_type= s->rc_context.entry[pict_num].new_pict_type; | |
1097 s->input_picture[i]->pict_type= pict_type; | |
1098 | |
1099 if(i + 1 >= s->rc_context.num_entries) break; | |
1100 } | |
1101 } | |
924 | 1102 |
915 | 1103 if(s->input_picture[0]->pict_type){ |
1104 /* user selected pict_type */ | |
909
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
1105 for(b_frames=0; b_frames<s->max_b_frames+1; b_frames++){ |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
1106 if(s->input_picture[b_frames]->pict_type!=B_TYPE) break; |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
1107 } |
915 | 1108 |
909
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
1109 if(b_frames > s->max_b_frames){ |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
1110 fprintf(stderr, "warning, too many bframes in a row\n"); |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
1111 b_frames = s->max_b_frames; |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
1112 } |
915 | 1113 }else if(s->b_frame_strategy==0){ |
1114 b_frames= s->max_b_frames; | |
1115 }else if(s->b_frame_strategy==1){ | |
1116 for(i=1; i<s->max_b_frames+1; i++){ | |
1117 if(s->input_picture[i]->b_frame_score==0){ | |
1118 s->input_picture[i]->b_frame_score= | |
924 | 1119 get_intra_count(s, s->input_picture[i ]->data[0], |
1120 s->input_picture[i-1]->data[0], s->linesize) + 1; | |
915 | 1121 } |
1122 } | |
1123 for(i=0; i<s->max_b_frames; i++){ | |
1124 if(s->input_picture[i]->b_frame_score - 1 > s->mb_num/40) break; | |
1125 } | |
1126 | |
1127 b_frames= FFMAX(0, i-1); | |
909
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
1128 |
915 | 1129 /* reset scores */ |
1130 for(i=0; i<b_frames+1; i++){ | |
1131 s->input_picture[i]->b_frame_score=0; | |
1132 } | |
1133 }else{ | |
1134 fprintf(stderr, "illegal b frame strategy\n"); | |
1135 b_frames=0; | |
909
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
1136 } |
915 | 1137 |
1138 emms_c(); | |
1139 //static int b_count=0; | |
1140 //b_count+= b_frames; | |
1141 //printf("b_frames: %d\n", b_count); | |
1142 | |
1143 s->reordered_input_picture[0]= s->input_picture[b_frames]; | |
1144 if( s->picture_in_gop_number + b_frames >= s->gop_size | |
1145 || s->reordered_input_picture[0]->pict_type== I_TYPE) | |
903 | 1146 s->reordered_input_picture[0]->pict_type= I_TYPE; |
915 | 1147 else |
1148 s->reordered_input_picture[0]->pict_type= P_TYPE; | |
1149 s->reordered_input_picture[0]->coded_picture_number= coded_pic_num; | |
1150 for(i=0; i<b_frames; i++){ | |
1151 coded_pic_num++; | |
1152 s->reordered_input_picture[i+1]= s->input_picture[i]; | |
1153 s->reordered_input_picture[i+1]->pict_type= B_TYPE; | |
1154 s->reordered_input_picture[i+1]->coded_picture_number= coded_pic_num; | |
903 | 1155 } |
324 | 1156 } |
1157 } | |
903 | 1158 |
1159 if(s->reordered_input_picture[0]){ | |
924 | 1160 s->reordered_input_picture[0]->reference= s->reordered_input_picture[0]->pict_type!=B_TYPE; |
1161 | |
1162 if(s->reordered_input_picture[0]->type == FF_BUFFER_TYPE_SHARED){ | |
1163 int i= find_unused_picture(s, 0); | |
1164 Picture *pic= &s->picture[i]; | |
1165 | |
1166 s->new_picture= *s->reordered_input_picture[0]; | |
1167 | |
1168 /* mark us unused / free shared pic */ | |
1169 for(i=0; i<4; i++) | |
1170 s->reordered_input_picture[0]->data[i]= NULL; | |
1171 s->reordered_input_picture[0]->type= 0; | |
1172 | |
1173 pic->pict_type = s->reordered_input_picture[0]->pict_type; | |
1174 pic->quality = s->reordered_input_picture[0]->quality; | |
1175 pic->coded_picture_number = s->reordered_input_picture[0]->coded_picture_number; | |
1176 pic->reference = s->reordered_input_picture[0]->reference; | |
1177 | |
1178 alloc_picture(s, pic, 0); | |
1179 | |
1180 s->current_picture= *pic; | |
1181 }else{ | |
1182 assert( s->reordered_input_picture[0]->type==FF_BUFFER_TYPE_USER | |
1183 || s->reordered_input_picture[0]->type==FF_BUFFER_TYPE_INTERNAL); | |
1184 | |
1185 s->new_picture= *s->reordered_input_picture[0]; | |
1186 | |
1187 for(i=0; i<4; i++){ | |
1188 s->reordered_input_picture[0]->data[i]-=16; //FIXME dirty | |
1189 } | |
1190 s->current_picture= *s->reordered_input_picture[0]; | |
903 | 1191 } |
1192 | |
1193 s->picture_number= s->new_picture.display_picture_number; | |
1194 //printf("dpn:%d\n", s->picture_number); | |
1195 }else{ | |
1196 memset(&s->new_picture, 0, sizeof(Picture)); | |
324 | 1197 } |
1198 } | |
1199 | |
0 | 1200 int MPV_encode_picture(AVCodecContext *avctx, |
1201 unsigned char *buf, int buf_size, void *data) | |
1202 { | |
1203 MpegEncContext *s = avctx->priv_data; | |
925 | 1204 AVFrame *pic_arg = data; |
909
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
1205 int i; |
0 | 1206 |
1207 init_put_bits(&s->pb, buf, buf_size, NULL, NULL); | |
1208 | |
903 | 1209 s->picture_in_gop_number++; |
1210 | |
1211 load_input_picture(s, pic_arg); | |
329 | 1212 |
903 | 1213 select_input_picture(s); |
324 | 1214 |
1215 /* output? */ | |
903 | 1216 if(s->new_picture.data[0]){ |
1217 | |
1218 s->pict_type= s->new_picture.pict_type; | |
1219 if (s->fixed_qscale){ /* the ratecontrol needs the last qscale so we dont touch it for CBR */ | |
1220 s->qscale= (int)(s->new_picture.quality+0.5); | |
1221 assert(s->qscale); | |
1222 } | |
1223 //emms_c(); | |
1224 //printf("qs:%f %f %d\n", s->new_picture.quality, s->current_picture.quality, s->qscale); | |
553 | 1225 MPV_frame_start(s, avctx); |
286 | 1226 |
324 | 1227 encode_picture(s, s->picture_number); |
652 | 1228 |
376 | 1229 avctx->real_pict_num = s->picture_number; |
324 | 1230 avctx->header_bits = s->header_bits; |
1231 avctx->mv_bits = s->mv_bits; | |
1232 avctx->misc_bits = s->misc_bits; | |
1233 avctx->i_tex_bits = s->i_tex_bits; | |
1234 avctx->p_tex_bits = s->p_tex_bits; | |
1235 avctx->i_count = s->i_count; | |
656
e47fa3e3f2d5
statistics for forw & back p-MBs instead of just one counter for both
michaelni
parents:
652
diff
changeset
|
1236 avctx->p_count = s->mb_num - s->i_count - s->skip_count; //FIXME f/b_count in avctx |
324 | 1237 avctx->skip_count = s->skip_count; |
0 | 1238 |
324 | 1239 MPV_frame_end(s); |
1240 | |
1241 if (s->out_format == FMT_MJPEG) | |
1242 mjpeg_picture_trailer(s); | |
329 | 1243 |
1244 if(s->flags&CODEC_FLAG_PASS1) | |
1245 ff_write_pass1_stats(s); | |
324 | 1246 } |
1247 | |
1248 s->input_picture_number++; | |
0 | 1249 |
1250 flush_put_bits(&s->pb); | |
268 | 1251 s->frame_bits = (pbBufPtr(&s->pb) - s->pb.buf) * 8; |
612 | 1252 |
268 | 1253 s->total_bits += s->frame_bits; |
286 | 1254 avctx->frame_bits = s->frame_bits; |
909
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
1255 |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
1256 for(i=0; i<4; i++){ |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
1257 avctx->error[i] += s->current_picture.error[i]; |
252
ddb1a0e94cf4
- Added PSNR feature to libavcodec and ffmpeg. By now just Y PSNR until I'm
pulento
parents:
251
diff
changeset
|
1258 } |
909
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
1259 |
234
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
233
diff
changeset
|
1260 return pbBufPtr(&s->pb) - s->pb.buf; |
0 | 1261 } |
1262 | |
255 | 1263 static inline void gmc1_motion(MpegEncContext *s, |
1264 UINT8 *dest_y, UINT8 *dest_cb, UINT8 *dest_cr, | |
1265 int dest_offset, | |
753 | 1266 UINT8 **ref_picture, int src_offset) |
255 | 1267 { |
1268 UINT8 *ptr; | |
556 | 1269 int offset, src_x, src_y, linesize, uvlinesize; |
255 | 1270 int motion_x, motion_y; |
566 | 1271 int emu=0; |
255 | 1272 |
1273 motion_x= s->sprite_offset[0][0]; | |
1274 motion_y= s->sprite_offset[0][1]; | |
1275 src_x = s->mb_x * 16 + (motion_x >> (s->sprite_warping_accuracy+1)); | |
1276 src_y = s->mb_y * 16 + (motion_y >> (s->sprite_warping_accuracy+1)); | |
1277 motion_x<<=(3-s->sprite_warping_accuracy); | |
1278 motion_y<<=(3-s->sprite_warping_accuracy); | |
1279 src_x = clip(src_x, -16, s->width); | |
1280 if (src_x == s->width) | |
1281 motion_x =0; | |
1282 src_y = clip(src_y, -16, s->height); | |
1283 if (src_y == s->height) | |
1284 motion_y =0; | |
753 | 1285 |
255 | 1286 linesize = s->linesize; |
556 | 1287 uvlinesize = s->uvlinesize; |
753 | 1288 |
255 | 1289 ptr = ref_picture[0] + (src_y * linesize) + src_x + src_offset; |
1290 | |
1291 dest_y+=dest_offset; | |
566 | 1292 if(s->flags&CODEC_FLAG_EMU_EDGE){ |
582
5132a4ee50cd
different edge positions fixed with edge emu / dr1
michaelni
parents:
575
diff
changeset
|
1293 if(src_x<0 || src_y<0 || src_x + (motion_x&15) + 16 > s->h_edge_pos |
753 | 1294 || src_y + (motion_y&15) + 16 > s->v_edge_pos){ |
936 | 1295 ff_emulated_edge_mc(s, ptr, linesize, 17, 17, src_x, src_y, s->h_edge_pos, s->v_edge_pos); |
566 | 1296 ptr= s->edge_emu_buffer; |
1297 emu=1; | |
1298 } | |
1299 } | |
753 | 1300 |
1301 if((motion_x|motion_y)&7){ | |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
1302 s->dsp.gmc1(dest_y , ptr , linesize, 16, motion_x&15, motion_y&15, 128 - s->no_rounding); |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
1303 s->dsp.gmc1(dest_y+8, ptr+8, linesize, 16, motion_x&15, motion_y&15, 128 - s->no_rounding); |
753 | 1304 }else{ |
1305 int dxy; | |
1306 | |
1307 dxy= ((motion_x>>3)&1) | ((motion_y>>2)&2); | |
1308 if (s->no_rounding){ | |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
1309 s->dsp.put_no_rnd_pixels_tab[0][dxy](dest_y, ptr, linesize, 16); |
753 | 1310 }else{ |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
1311 s->dsp.put_pixels_tab [0][dxy](dest_y, ptr, linesize, 16); |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
1312 } |
753 | 1313 } |
1314 | |
1315 if(s->flags&CODEC_FLAG_GRAY) return; | |
255 | 1316 |
1317 motion_x= s->sprite_offset[1][0]; | |
1318 motion_y= s->sprite_offset[1][1]; | |
1319 src_x = s->mb_x * 8 + (motion_x >> (s->sprite_warping_accuracy+1)); | |
1320 src_y = s->mb_y * 8 + (motion_y >> (s->sprite_warping_accuracy+1)); | |
1321 motion_x<<=(3-s->sprite_warping_accuracy); | |
1322 motion_y<<=(3-s->sprite_warping_accuracy); | |
1323 src_x = clip(src_x, -8, s->width>>1); | |
1324 if (src_x == s->width>>1) | |
1325 motion_x =0; | |
1326 src_y = clip(src_y, -8, s->height>>1); | |
1327 if (src_y == s->height>>1) | |
1328 motion_y =0; | |
1329 | |
556 | 1330 offset = (src_y * uvlinesize) + src_x + (src_offset>>1); |
255 | 1331 ptr = ref_picture[1] + offset; |
566 | 1332 if(emu){ |
936 | 1333 ff_emulated_edge_mc(s, ptr, uvlinesize, 9, 9, src_x, src_y, s->h_edge_pos>>1, s->v_edge_pos>>1); |
566 | 1334 ptr= s->edge_emu_buffer; |
1335 } | |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
1336 s->dsp.gmc1(dest_cb + (dest_offset>>1), ptr, uvlinesize, 8, motion_x&15, motion_y&15, 128 - s->no_rounding); |
566 | 1337 |
255 | 1338 ptr = ref_picture[2] + offset; |
566 | 1339 if(emu){ |
936 | 1340 ff_emulated_edge_mc(s, ptr, uvlinesize, 9, 9, src_x, src_y, s->h_edge_pos>>1, s->v_edge_pos>>1); |
566 | 1341 ptr= s->edge_emu_buffer; |
1342 } | |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
1343 s->dsp.gmc1(dest_cr + (dest_offset>>1), ptr, uvlinesize, 8, motion_x&15, motion_y&15, 128 - s->no_rounding); |
255 | 1344 |
1345 return; | |
1346 } | |
1347 | |
753 | 1348 static inline void gmc_motion(MpegEncContext *s, |
1349 UINT8 *dest_y, UINT8 *dest_cb, UINT8 *dest_cr, | |
1350 int dest_offset, | |
1351 UINT8 **ref_picture, int src_offset) | |
1352 { | |
1353 UINT8 *ptr; | |
1354 int linesize, uvlinesize; | |
1355 const int a= s->sprite_warping_accuracy; | |
1356 int ox, oy; | |
1357 | |
1358 linesize = s->linesize; | |
1359 uvlinesize = s->uvlinesize; | |
1360 | |
1361 ptr = ref_picture[0] + src_offset; | |
1362 | |
1363 dest_y+=dest_offset; | |
1364 | |
1365 ox= s->sprite_offset[0][0] + s->sprite_delta[0][0]*s->mb_x*16 + s->sprite_delta[0][1]*s->mb_y*16; | |
1366 oy= s->sprite_offset[0][1] + s->sprite_delta[1][0]*s->mb_x*16 + s->sprite_delta[1][1]*s->mb_y*16; | |
1367 | |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
1368 s->dsp.gmc(dest_y, ptr, linesize, 16, |
753 | 1369 ox, |
1370 oy, | |
1371 s->sprite_delta[0][0], s->sprite_delta[0][1], | |
1372 s->sprite_delta[1][0], s->sprite_delta[1][1], | |
1373 a+1, (1<<(2*a+1)) - s->no_rounding, | |
1374 s->h_edge_pos, s->v_edge_pos); | |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
1375 s->dsp.gmc(dest_y+8, ptr, linesize, 16, |
753 | 1376 ox + s->sprite_delta[0][0]*8, |
1377 oy + s->sprite_delta[1][0]*8, | |
1378 s->sprite_delta[0][0], s->sprite_delta[0][1], | |
1379 s->sprite_delta[1][0], s->sprite_delta[1][1], | |
1380 a+1, (1<<(2*a+1)) - s->no_rounding, | |
1381 s->h_edge_pos, s->v_edge_pos); | |
1382 | |
1383 if(s->flags&CODEC_FLAG_GRAY) return; | |
1384 | |
1385 | |
1386 dest_cb+=dest_offset>>1; | |
1387 dest_cr+=dest_offset>>1; | |
1388 | |
1389 ox= s->sprite_offset[1][0] + s->sprite_delta[0][0]*s->mb_x*8 + s->sprite_delta[0][1]*s->mb_y*8; | |
1390 oy= s->sprite_offset[1][1] + s->sprite_delta[1][0]*s->mb_x*8 + s->sprite_delta[1][1]*s->mb_y*8; | |
1391 | |
1392 ptr = ref_picture[1] + (src_offset>>1); | |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
1393 s->dsp.gmc(dest_cb, ptr, uvlinesize, 8, |
753 | 1394 ox, |
1395 oy, | |
1396 s->sprite_delta[0][0], s->sprite_delta[0][1], | |
1397 s->sprite_delta[1][0], s->sprite_delta[1][1], | |
1398 a+1, (1<<(2*a+1)) - s->no_rounding, | |
1399 s->h_edge_pos>>1, s->v_edge_pos>>1); | |
1400 | |
1401 ptr = ref_picture[2] + (src_offset>>1); | |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
1402 s->dsp.gmc(dest_cr, ptr, uvlinesize, 8, |
753 | 1403 ox, |
1404 oy, | |
1405 s->sprite_delta[0][0], s->sprite_delta[0][1], | |
1406 s->sprite_delta[1][0], s->sprite_delta[1][1], | |
1407 a+1, (1<<(2*a+1)) - s->no_rounding, | |
1408 s->h_edge_pos>>1, s->v_edge_pos>>1); | |
1409 } | |
1410 | |
1411 | |
936 | 1412 void ff_emulated_edge_mc(MpegEncContext *s, UINT8 *src, int linesize, int block_w, int block_h, |
553 | 1413 int src_x, int src_y, int w, int h){ |
1414 int x, y; | |
1415 int start_y, start_x, end_y, end_x; | |
566 | 1416 UINT8 *buf= s->edge_emu_buffer; |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
1417 |
553 | 1418 if(src_y>= h){ |
1419 src+= (h-1-src_y)*linesize; | |
1420 src_y=h-1; | |
554 | 1421 }else if(src_y<=-block_h){ |
1422 src+= (1-block_h-src_y)*linesize; | |
1423 src_y=1-block_h; | |
553 | 1424 } |
1425 if(src_x>= w){ | |
1426 src+= (w-1-src_x); | |
1427 src_x=w-1; | |
554 | 1428 }else if(src_x<=-block_w){ |
1429 src+= (1-block_w-src_x); | |
1430 src_x=1-block_w; | |
553 | 1431 } |
1432 | |
847 | 1433 start_y= FFMAX(0, -src_y); |
1434 start_x= FFMAX(0, -src_x); | |
1435 end_y= FFMIN(block_h, h-src_y); | |
1436 end_x= FFMIN(block_w, w-src_x); | |
566 | 1437 |
553 | 1438 // copy existing part |
1439 for(y=start_y; y<end_y; y++){ | |
1440 for(x=start_x; x<end_x; x++){ | |
1441 buf[x + y*linesize]= src[x + y*linesize]; | |
1442 } | |
1443 } | |
1444 | |
1445 //top | |
1446 for(y=0; y<start_y; y++){ | |
1447 for(x=start_x; x<end_x; x++){ | |
1448 buf[x + y*linesize]= buf[x + start_y*linesize]; | |
1449 } | |
1450 } | |
1451 | |
1452 //bottom | |
1453 for(y=end_y; y<block_h; y++){ | |
1454 for(x=start_x; x<end_x; x++){ | |
1455 buf[x + y*linesize]= buf[x + (end_y-1)*linesize]; | |
1456 } | |
1457 } | |
1458 | |
1459 for(y=0; y<block_h; y++){ | |
1460 //left | |
1461 for(x=0; x<start_x; x++){ | |
1462 buf[x + y*linesize]= buf[start_x + y*linesize]; | |
1463 } | |
1464 | |
1465 //right | |
1466 for(x=end_x; x<block_w; x++){ | |
1467 buf[x + y*linesize]= buf[end_x - 1 + y*linesize]; | |
1468 } | |
1469 } | |
1470 } | |
1471 | |
1472 | |
0 | 1473 /* apply one mpeg motion vector to the three components */ |
1474 static inline void mpeg_motion(MpegEncContext *s, | |
1475 UINT8 *dest_y, UINT8 *dest_cb, UINT8 *dest_cr, | |
1476 int dest_offset, | |
1477 UINT8 **ref_picture, int src_offset, | |
651 | 1478 int field_based, op_pixels_func (*pix_op)[4], |
0 | 1479 int motion_x, int motion_y, int h) |
1480 { | |
1481 UINT8 *ptr; | |
582
5132a4ee50cd
different edge positions fixed with edge emu / dr1
michaelni
parents:
575
diff
changeset
|
1482 int dxy, offset, mx, my, src_x, src_y, height, v_edge_pos, linesize, uvlinesize; |
553 | 1483 int emu=0; |
651 | 1484 #if 0 |
255 | 1485 if(s->quarter_sample) |
1486 { | |
1487 motion_x>>=1; | |
1488 motion_y>>=1; | |
1489 } | |
651 | 1490 #endif |
0 | 1491 dxy = ((motion_y & 1) << 1) | (motion_x & 1); |
1492 src_x = s->mb_x * 16 + (motion_x >> 1); | |
1493 src_y = s->mb_y * (16 >> field_based) + (motion_y >> 1); | |
1494 | |
1495 /* WARNING: do no forget half pels */ | |
1496 height = s->height >> field_based; | |
582
5132a4ee50cd
different edge positions fixed with edge emu / dr1
michaelni
parents:
575
diff
changeset
|
1497 v_edge_pos = s->v_edge_pos >> field_based; |
0 | 1498 src_x = clip(src_x, -16, s->width); |
1499 if (src_x == s->width) | |
1500 dxy &= ~1; | |
1501 src_y = clip(src_y, -16, height); | |
1502 if (src_y == height) | |
1503 dxy &= ~2; | |
565
44d744901ded
interlaced mpeg2 fix ... replacing linesize>>1 by uvlinesize brainlessly wasnt a good idea
michaelni
parents:
562
diff
changeset
|
1504 linesize = s->linesize << field_based; |
44d744901ded
interlaced mpeg2 fix ... replacing linesize>>1 by uvlinesize brainlessly wasnt a good idea
michaelni
parents:
562
diff
changeset
|
1505 uvlinesize = s->uvlinesize << field_based; |
0 | 1506 ptr = ref_picture[0] + (src_y * linesize) + (src_x) + src_offset; |
1507 dest_y += dest_offset; | |
553 | 1508 |
1509 if(s->flags&CODEC_FLAG_EMU_EDGE){ | |
582
5132a4ee50cd
different edge positions fixed with edge emu / dr1
michaelni
parents:
575
diff
changeset
|
1510 if(src_x<0 || src_y<0 || src_x + (motion_x&1) + 16 > s->h_edge_pos |
5132a4ee50cd
different edge positions fixed with edge emu / dr1
michaelni
parents:
575
diff
changeset
|
1511 || src_y + (motion_y&1) + h > v_edge_pos){ |
936 | 1512 ff_emulated_edge_mc(s, ptr - src_offset, s->linesize, 17, 17+field_based, |
763 | 1513 src_x, src_y<<field_based, s->h_edge_pos, s->v_edge_pos); |
1514 ptr= s->edge_emu_buffer + src_offset; | |
553 | 1515 emu=1; |
1516 } | |
1517 } | |
651 | 1518 pix_op[0][dxy](dest_y, ptr, linesize, h); |
0 | 1519 |
485 | 1520 if(s->flags&CODEC_FLAG_GRAY) return; |
1521 | |
0 | 1522 if (s->out_format == FMT_H263) { |
1523 dxy = 0; | |
1524 if ((motion_x & 3) != 0) | |
1525 dxy |= 1; | |
1526 if ((motion_y & 3) != 0) | |
1527 dxy |= 2; | |
1528 mx = motion_x >> 2; | |
1529 my = motion_y >> 2; | |
1530 } else { | |
1531 mx = motion_x / 2; | |
1532 my = motion_y / 2; | |
1533 dxy = ((my & 1) << 1) | (mx & 1); | |
1534 mx >>= 1; | |
1535 my >>= 1; | |
1536 } | |
1537 | |
1538 src_x = s->mb_x * 8 + mx; | |
1539 src_y = s->mb_y * (8 >> field_based) + my; | |
1540 src_x = clip(src_x, -8, s->width >> 1); | |
1541 if (src_x == (s->width >> 1)) | |
1542 dxy &= ~1; | |
1543 src_y = clip(src_y, -8, height >> 1); | |
1544 if (src_y == (height >> 1)) | |
1545 dxy &= ~2; | |
565
44d744901ded
interlaced mpeg2 fix ... replacing linesize>>1 by uvlinesize brainlessly wasnt a good idea
michaelni
parents:
562
diff
changeset
|
1546 offset = (src_y * uvlinesize) + src_x + (src_offset >> 1); |
0 | 1547 ptr = ref_picture[1] + offset; |
553 | 1548 if(emu){ |
936 | 1549 ff_emulated_edge_mc(s, ptr - (src_offset >> 1), s->uvlinesize, 9, 9+field_based, |
763 | 1550 src_x, src_y<<field_based, s->h_edge_pos>>1, s->v_edge_pos>>1); |
1551 ptr= s->edge_emu_buffer + (src_offset >> 1); | |
553 | 1552 } |
651 | 1553 pix_op[1][dxy](dest_cb + (dest_offset >> 1), ptr, uvlinesize, h >> 1); |
553 | 1554 |
0 | 1555 ptr = ref_picture[2] + offset; |
553 | 1556 if(emu){ |
936 | 1557 ff_emulated_edge_mc(s, ptr - (src_offset >> 1), s->uvlinesize, 9, 9+field_based, |
763 | 1558 src_x, src_y<<field_based, s->h_edge_pos>>1, s->v_edge_pos>>1); |
1559 ptr= s->edge_emu_buffer + (src_offset >> 1); | |
553 | 1560 } |
651 | 1561 pix_op[1][dxy](dest_cr + (dest_offset >> 1), ptr, uvlinesize, h >> 1); |
0 | 1562 } |
1563 | |
255 | 1564 static inline void qpel_motion(MpegEncContext *s, |
1565 UINT8 *dest_y, UINT8 *dest_cb, UINT8 *dest_cr, | |
1566 int dest_offset, | |
1567 UINT8 **ref_picture, int src_offset, | |
651 | 1568 int field_based, op_pixels_func (*pix_op)[4], |
1569 qpel_mc_func (*qpix_op)[16], | |
255 | 1570 int motion_x, int motion_y, int h) |
1571 { | |
1572 UINT8 *ptr; | |
671 | 1573 int dxy, offset, mx, my, src_x, src_y, height, v_edge_pos, linesize, uvlinesize; |
554 | 1574 int emu=0; |
255 | 1575 |
1576 dxy = ((motion_y & 3) << 2) | (motion_x & 3); | |
1577 src_x = s->mb_x * 16 + (motion_x >> 2); | |
1578 src_y = s->mb_y * (16 >> field_based) + (motion_y >> 2); | |
1579 | |
1580 height = s->height >> field_based; | |
582
5132a4ee50cd
different edge positions fixed with edge emu / dr1
michaelni
parents:
575
diff
changeset
|
1581 v_edge_pos = s->v_edge_pos >> field_based; |
255 | 1582 src_x = clip(src_x, -16, s->width); |
1583 if (src_x == s->width) | |
1584 dxy &= ~3; | |
1585 src_y = clip(src_y, -16, height); | |
1586 if (src_y == height) | |
1587 dxy &= ~12; | |
1588 linesize = s->linesize << field_based; | |
671 | 1589 uvlinesize = s->uvlinesize << field_based; |
255 | 1590 ptr = ref_picture[0] + (src_y * linesize) + src_x + src_offset; |
1591 dest_y += dest_offset; | |
1592 //printf("%d %d %d\n", src_x, src_y, dxy); | |
554 | 1593 |
1594 if(s->flags&CODEC_FLAG_EMU_EDGE){ | |
582
5132a4ee50cd
different edge positions fixed with edge emu / dr1
michaelni
parents:
575
diff
changeset
|
1595 if(src_x<0 || src_y<0 || src_x + (motion_x&3) + 16 > s->h_edge_pos |
5132a4ee50cd
different edge positions fixed with edge emu / dr1
michaelni
parents:
575
diff
changeset
|
1596 || src_y + (motion_y&3) + h > v_edge_pos){ |
936 | 1597 ff_emulated_edge_mc(s, ptr - src_offset, s->linesize, 17, 17+field_based, |
763 | 1598 src_x, src_y<<field_based, s->h_edge_pos, s->v_edge_pos); |
1599 ptr= s->edge_emu_buffer + src_offset; | |
554 | 1600 emu=1; |
1601 } | |
1602 } | |
671 | 1603 if(!field_based) |
1604 qpix_op[0][dxy](dest_y, ptr, linesize); | |
1605 else{ | |
1606 //damn interlaced mode | |
1607 //FIXME boundary mirroring is not exactly correct here | |
1608 qpix_op[1][dxy](dest_y , ptr , linesize); | |
1609 qpix_op[1][dxy](dest_y+8, ptr+8, linesize); | |
1610 } | |
651 | 1611 |
485 | 1612 if(s->flags&CODEC_FLAG_GRAY) return; |
1613 | |
671 | 1614 if(field_based){ |
1615 mx= motion_x/2; | |
1616 my= motion_y>>1; | |
760 | 1617 }else if(s->workaround_bugs&FF_BUG_QPEL_CHROMA){ |
671 | 1618 mx= (motion_x>>1)|(motion_x&1); |
1619 my= (motion_y>>1)|(motion_y&1); | |
1620 }else{ | |
1621 mx= motion_x/2; | |
1622 my= motion_y/2; | |
1623 } | |
1624 mx= (mx>>1)|(mx&1); | |
1625 my= (my>>1)|(my&1); | |
1626 dxy= (mx&1) | ((my&1)<<1); | |
1627 mx>>=1; | |
1628 my>>=1; | |
255 | 1629 |
1630 src_x = s->mb_x * 8 + mx; | |
1631 src_y = s->mb_y * (8 >> field_based) + my; | |
1632 src_x = clip(src_x, -8, s->width >> 1); | |
1633 if (src_x == (s->width >> 1)) | |
1634 dxy &= ~1; | |
1635 src_y = clip(src_y, -8, height >> 1); | |
1636 if (src_y == (height >> 1)) | |
1637 dxy &= ~2; | |
1638 | |
671 | 1639 offset = (src_y * uvlinesize) + src_x + (src_offset >> 1); |
255 | 1640 ptr = ref_picture[1] + offset; |
554 | 1641 if(emu){ |
936 | 1642 ff_emulated_edge_mc(s, ptr - (src_offset >> 1), s->uvlinesize, 9, 9 + field_based, |
763 | 1643 src_x, src_y<<field_based, s->h_edge_pos>>1, s->v_edge_pos>>1); |
1644 ptr= s->edge_emu_buffer + (src_offset >> 1); | |
554 | 1645 } |
671 | 1646 pix_op[1][dxy](dest_cb + (dest_offset >> 1), ptr, uvlinesize, h >> 1); |
554 | 1647 |
255 | 1648 ptr = ref_picture[2] + offset; |
554 | 1649 if(emu){ |
936 | 1650 ff_emulated_edge_mc(s, ptr - (src_offset >> 1), s->uvlinesize, 9, 9 + field_based, |
763 | 1651 src_x, src_y<<field_based, s->h_edge_pos>>1, s->v_edge_pos>>1); |
1652 ptr= s->edge_emu_buffer + (src_offset >> 1); | |
554 | 1653 } |
671 | 1654 pix_op[1][dxy](dest_cr + (dest_offset >> 1), ptr, uvlinesize, h >> 1); |
255 | 1655 } |
1656 | |
1657 | |
0 | 1658 static inline void MPV_motion(MpegEncContext *s, |
1659 UINT8 *dest_y, UINT8 *dest_cb, UINT8 *dest_cr, | |
1660 int dir, UINT8 **ref_picture, | |
651 | 1661 op_pixels_func (*pix_op)[4], qpel_mc_func (*qpix_op)[16]) |
0 | 1662 { |
1663 int dxy, offset, mx, my, src_x, src_y, motion_x, motion_y; | |
1664 int mb_x, mb_y, i; | |
1665 UINT8 *ptr, *dest; | |
554 | 1666 int emu=0; |
0 | 1667 |
1668 mb_x = s->mb_x; | |
1669 mb_y = s->mb_y; | |
1670 | |
1671 switch(s->mv_type) { | |
1672 case MV_TYPE_16X16: | |
255 | 1673 if(s->mcsel){ |
753 | 1674 if(s->real_sprite_warping_points==1){ |
1675 gmc1_motion(s, dest_y, dest_cb, dest_cr, 0, | |
1676 ref_picture, 0); | |
1677 }else{ | |
1678 gmc_motion(s, dest_y, dest_cb, dest_cr, 0, | |
1679 ref_picture, 0); | |
1680 } | |
651 | 1681 }else if(s->quarter_sample){ |
255 | 1682 qpel_motion(s, dest_y, dest_cb, dest_cr, 0, |
1683 ref_picture, 0, | |
1684 0, pix_op, qpix_op, | |
1685 s->mv[dir][0][0], s->mv[dir][0][1], 16); | |
936 | 1686 }else if(s->mspel){ |
1687 ff_mspel_motion(s, dest_y, dest_cb, dest_cr, | |
1688 ref_picture, pix_op, | |
1689 s->mv[dir][0][0], s->mv[dir][0][1], 16); | |
255 | 1690 }else{ |
1691 mpeg_motion(s, dest_y, dest_cb, dest_cr, 0, | |
1692 ref_picture, 0, | |
1693 0, pix_op, | |
1694 s->mv[dir][0][0], s->mv[dir][0][1], 16); | |
1695 } | |
0 | 1696 break; |
1697 case MV_TYPE_8X8: | |
673 | 1698 mx = 0; |
1699 my = 0; | |
1700 if(s->quarter_sample){ | |
1701 for(i=0;i<4;i++) { | |
1702 motion_x = s->mv[dir][i][0]; | |
1703 motion_y = s->mv[dir][i][1]; | |
0 | 1704 |
673 | 1705 dxy = ((motion_y & 3) << 2) | (motion_x & 3); |
1706 src_x = mb_x * 16 + (motion_x >> 2) + (i & 1) * 8; | |
1707 src_y = mb_y * 16 + (motion_y >> 2) + (i >>1) * 8; | |
1708 | |
1709 /* WARNING: do no forget half pels */ | |
1710 src_x = clip(src_x, -16, s->width); | |
1711 if (src_x == s->width) | |
1712 dxy &= ~3; | |
1713 src_y = clip(src_y, -16, s->height); | |
1714 if (src_y == s->height) | |
1715 dxy &= ~12; | |
0 | 1716 |
673 | 1717 ptr = ref_picture[0] + (src_y * s->linesize) + (src_x); |
1718 if(s->flags&CODEC_FLAG_EMU_EDGE){ | |
1719 if(src_x<0 || src_y<0 || src_x + (motion_x&3) + 8 > s->h_edge_pos | |
1720 || src_y + (motion_y&3) + 8 > s->v_edge_pos){ | |
936 | 1721 ff_emulated_edge_mc(s, ptr, s->linesize, 9, 9, src_x, src_y, s->h_edge_pos, s->v_edge_pos); |
673 | 1722 ptr= s->edge_emu_buffer; |
1723 } | |
1724 } | |
1725 dest = dest_y + ((i & 1) * 8) + (i >> 1) * 8 * s->linesize; | |
1726 qpix_op[1][dxy](dest, ptr, s->linesize); | |
1727 | |
1728 mx += s->mv[dir][i][0]/2; | |
1729 my += s->mv[dir][i][1]/2; | |
1730 } | |
1731 }else{ | |
1732 for(i=0;i<4;i++) { | |
1733 motion_x = s->mv[dir][i][0]; | |
1734 motion_y = s->mv[dir][i][1]; | |
1735 | |
1736 dxy = ((motion_y & 1) << 1) | (motion_x & 1); | |
1737 src_x = mb_x * 16 + (motion_x >> 1) + (i & 1) * 8; | |
1738 src_y = mb_y * 16 + (motion_y >> 1) + (i >>1) * 8; | |
0 | 1739 |
673 | 1740 /* WARNING: do no forget half pels */ |
1741 src_x = clip(src_x, -16, s->width); | |
1742 if (src_x == s->width) | |
1743 dxy &= ~1; | |
1744 src_y = clip(src_y, -16, s->height); | |
1745 if (src_y == s->height) | |
1746 dxy &= ~2; | |
1747 | |
1748 ptr = ref_picture[0] + (src_y * s->linesize) + (src_x); | |
1749 if(s->flags&CODEC_FLAG_EMU_EDGE){ | |
1750 if(src_x<0 || src_y<0 || src_x + (motion_x&1) + 8 > s->h_edge_pos | |
1751 || src_y + (motion_y&1) + 8 > s->v_edge_pos){ | |
936 | 1752 ff_emulated_edge_mc(s, ptr, s->linesize, 9, 9, src_x, src_y, s->h_edge_pos, s->v_edge_pos); |
673 | 1753 ptr= s->edge_emu_buffer; |
1754 } | |
554 | 1755 } |
673 | 1756 dest = dest_y + ((i & 1) * 8) + (i >> 1) * 8 * s->linesize; |
1757 pix_op[1][dxy](dest, ptr, s->linesize, 8); | |
1758 | |
1759 mx += s->mv[dir][i][0]; | |
1760 my += s->mv[dir][i][1]; | |
554 | 1761 } |
0 | 1762 } |
673 | 1763 |
485 | 1764 if(s->flags&CODEC_FLAG_GRAY) break; |
0 | 1765 /* In case of 8X8, we construct a single chroma motion vector |
1766 with a special rounding */ | |
1767 for(i=0;i<4;i++) { | |
1768 } | |
1769 if (mx >= 0) | |
1770 mx = (h263_chroma_roundtab[mx & 0xf] + ((mx >> 3) & ~1)); | |
1771 else { | |
1772 mx = -mx; | |
1773 mx = -(h263_chroma_roundtab[mx & 0xf] + ((mx >> 3) & ~1)); | |
1774 } | |
1775 if (my >= 0) | |
1776 my = (h263_chroma_roundtab[my & 0xf] + ((my >> 3) & ~1)); | |
1777 else { | |
1778 my = -my; | |
1779 my = -(h263_chroma_roundtab[my & 0xf] + ((my >> 3) & ~1)); | |
1780 } | |
1781 dxy = ((my & 1) << 1) | (mx & 1); | |
1782 mx >>= 1; | |
1783 my >>= 1; | |
1784 | |
1785 src_x = mb_x * 8 + mx; | |
1786 src_y = mb_y * 8 + my; | |
1787 src_x = clip(src_x, -8, s->width/2); | |
1788 if (src_x == s->width/2) | |
1789 dxy &= ~1; | |
1790 src_y = clip(src_y, -8, s->height/2); | |
1791 if (src_y == s->height/2) | |
1792 dxy &= ~2; | |
1793 | |
556 | 1794 offset = (src_y * (s->uvlinesize)) + src_x; |
0 | 1795 ptr = ref_picture[1] + offset; |
554 | 1796 if(s->flags&CODEC_FLAG_EMU_EDGE){ |
582
5132a4ee50cd
different edge positions fixed with edge emu / dr1
michaelni
parents:
575
diff
changeset
|
1797 if(src_x<0 || src_y<0 || src_x + (dxy &1) + 8 > s->h_edge_pos>>1 |
5132a4ee50cd
different edge positions fixed with edge emu / dr1
michaelni
parents:
575
diff
changeset
|
1798 || src_y + (dxy>>1) + 8 > s->v_edge_pos>>1){ |
936 | 1799 ff_emulated_edge_mc(s, ptr, s->uvlinesize, 9, 9, src_x, src_y, s->h_edge_pos>>1, s->v_edge_pos>>1); |
554 | 1800 ptr= s->edge_emu_buffer; |
1801 emu=1; | |
1802 } | |
1803 } | |
651 | 1804 pix_op[1][dxy](dest_cb, ptr, s->uvlinesize, 8); |
554 | 1805 |
0 | 1806 ptr = ref_picture[2] + offset; |
554 | 1807 if(emu){ |
936 | 1808 ff_emulated_edge_mc(s, ptr, s->uvlinesize, 9, 9, src_x, src_y, s->h_edge_pos>>1, s->v_edge_pos>>1); |
554 | 1809 ptr= s->edge_emu_buffer; |
1810 } | |
651 | 1811 pix_op[1][dxy](dest_cr, ptr, s->uvlinesize, 8); |
0 | 1812 break; |
1813 case MV_TYPE_FIELD: | |
1814 if (s->picture_structure == PICT_FRAME) { | |
671 | 1815 if(s->quarter_sample){ |
1816 /* top field */ | |
1817 qpel_motion(s, dest_y, dest_cb, dest_cr, 0, | |
1818 ref_picture, s->field_select[dir][0] ? s->linesize : 0, | |
1819 1, pix_op, qpix_op, | |
1820 s->mv[dir][0][0], s->mv[dir][0][1], 8); | |
1821 /* bottom field */ | |
1822 qpel_motion(s, dest_y, dest_cb, dest_cr, s->linesize, | |
1823 ref_picture, s->field_select[dir][1] ? s->linesize : 0, | |
1824 1, pix_op, qpix_op, | |
1825 s->mv[dir][1][0], s->mv[dir][1][1], 8); | |
1826 }else{ | |
1827 /* top field */ | |
1828 mpeg_motion(s, dest_y, dest_cb, dest_cr, 0, | |
1829 ref_picture, s->field_select[dir][0] ? s->linesize : 0, | |
1830 1, pix_op, | |
1831 s->mv[dir][0][0], s->mv[dir][0][1], 8); | |
1832 /* bottom field */ | |
1833 mpeg_motion(s, dest_y, dest_cb, dest_cr, s->linesize, | |
1834 ref_picture, s->field_select[dir][1] ? s->linesize : 0, | |
1835 1, pix_op, | |
1836 s->mv[dir][1][0], s->mv[dir][1][1], 8); | |
1837 } | |
0 | 1838 } else { |
1839 | |
1840 | |
1841 } | |
1842 break; | |
1843 } | |
1844 } | |
1845 | |
1846 | |
1847 /* put block[] to dest[] */ | |
1848 static inline void put_dct(MpegEncContext *s, | |
1849 DCTELEM *block, int i, UINT8 *dest, int line_size) | |
1850 { | |
711 | 1851 s->dct_unquantize(s, block, i, s->qscale); |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
1852 s->idct_put (dest, line_size, block); |
0 | 1853 } |
1854 | |
1855 /* add block[] to dest[] */ | |
1856 static inline void add_dct(MpegEncContext *s, | |
1857 DCTELEM *block, int i, UINT8 *dest, int line_size) | |
1858 { | |
1859 if (s->block_last_index[i] >= 0) { | |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
1860 s->idct_add (dest, line_size, block); |
481 | 1861 } |
1862 } | |
1863 | |
1864 static inline void add_dequant_dct(MpegEncContext *s, | |
1865 DCTELEM *block, int i, UINT8 *dest, int line_size) | |
1866 { | |
1867 if (s->block_last_index[i] >= 0) { | |
1868 s->dct_unquantize(s, block, i, s->qscale); | |
324 | 1869 |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
1870 s->idct_add (dest, line_size, block); |
0 | 1871 } |
1872 } | |
1873 | |
456 | 1874 /** |
1875 * cleans dc, ac, coded_block for the current non intra MB | |
1876 */ | |
1877 void ff_clean_intra_table_entries(MpegEncContext *s) | |
1878 { | |
1879 int wrap = s->block_wrap[0]; | |
1880 int xy = s->block_index[0]; | |
1881 | |
1882 s->dc_val[0][xy ] = | |
1883 s->dc_val[0][xy + 1 ] = | |
1884 s->dc_val[0][xy + wrap] = | |
1885 s->dc_val[0][xy + 1 + wrap] = 1024; | |
1886 /* ac pred */ | |
1887 memset(s->ac_val[0][xy ], 0, 32 * sizeof(INT16)); | |
1888 memset(s->ac_val[0][xy + wrap], 0, 32 * sizeof(INT16)); | |
1889 if (s->msmpeg4_version>=3) { | |
1890 s->coded_block[xy ] = | |
1891 s->coded_block[xy + 1 ] = | |
1892 s->coded_block[xy + wrap] = | |
1893 s->coded_block[xy + 1 + wrap] = 0; | |
1894 } | |
1895 /* chroma */ | |
1896 wrap = s->block_wrap[4]; | |
1897 xy = s->mb_x + 1 + (s->mb_y + 1) * wrap; | |
1898 s->dc_val[1][xy] = | |
1899 s->dc_val[2][xy] = 1024; | |
1900 /* ac pred */ | |
1901 memset(s->ac_val[1][xy], 0, 16 * sizeof(INT16)); | |
1902 memset(s->ac_val[2][xy], 0, 16 * sizeof(INT16)); | |
1903 | |
1904 s->mbintra_table[s->mb_x + s->mb_y*s->mb_width]= 0; | |
1905 } | |
1906 | |
0 | 1907 /* generic function called after a macroblock has been parsed by the |
1908 decoder or after it has been encoded by the encoder. | |
1909 | |
1910 Important variables used: | |
1911 s->mb_intra : true if intra macroblock | |
1912 s->mv_dir : motion vector direction | |
1913 s->mv_type : motion vector type | |
1914 s->mv : motion vector | |
1915 s->interlaced_dct : true if interlaced dct used (mpeg2) | |
1916 */ | |
1917 void MPV_decode_mb(MpegEncContext *s, DCTELEM block[6][64]) | |
1918 { | |
244 | 1919 int mb_x, mb_y; |
481 | 1920 const int mb_xy = s->mb_y * s->mb_width + s->mb_x; |
0 | 1921 |
1922 mb_x = s->mb_x; | |
1923 mb_y = s->mb_y; | |
1924 | |
903 | 1925 s->current_picture.qscale_table[mb_xy]= s->qscale; |
108
1e4a4af694d1
exporting qscale data for postprocessing (for MPlayer)
arpi_esp
parents:
79
diff
changeset
|
1926 |
0 | 1927 /* update DC predictors for P macroblocks */ |
1928 if (!s->mb_intra) { | |
249
42a0b7b16738
- Bug fixes in H.263+ Advanced INTRA Coding decoder.
pulento
parents:
248
diff
changeset
|
1929 if (s->h263_pred || s->h263_aic) { |
481 | 1930 if(s->mbintra_table[mb_xy]) |
456 | 1931 ff_clean_intra_table_entries(s); |
0 | 1932 } else { |
456 | 1933 s->last_dc[0] = |
1934 s->last_dc[1] = | |
0 | 1935 s->last_dc[2] = 128 << s->intra_dc_precision; |
1936 } | |
1937 } | |
249
42a0b7b16738
- Bug fixes in H.263+ Advanced INTRA Coding decoder.
pulento
parents:
248
diff
changeset
|
1938 else if (s->h263_pred || s->h263_aic) |
481 | 1939 s->mbintra_table[mb_xy]=1; |
191
883f184537e6
AC table reset (memset) optimization - patch by Michael Niedermayer <michaelni@gmx.at>
uid46427
parents:
189
diff
changeset
|
1940 |
280 | 1941 /* update motion predictor, not for B-frames as they need the motion_val from the last P/S-Frame */ |
481 | 1942 if (s->out_format == FMT_H263 && s->pict_type!=B_TYPE) { //FIXME move into h263.c if possible, format specific stuff shouldnt be here |
936 | 1943 //FIXME a lot of thet is only needed for !low_delay |
481 | 1944 const int wrap = s->block_wrap[0]; |
1945 const int xy = s->block_index[0]; | |
664 | 1946 const int mb_index= s->mb_x + s->mb_y*s->mb_width; |
619
2be2cc8fd0a1
mpeg4 interlaced decoding support (not completly implemented/tested due to lack of samples)
michaelni
parents:
618
diff
changeset
|
1947 if(s->mv_type == MV_TYPE_8X8){ |
664 | 1948 s->co_located_type_table[mb_index]= CO_LOCATED_TYPE_4MV; |
619
2be2cc8fd0a1
mpeg4 interlaced decoding support (not completly implemented/tested due to lack of samples)
michaelni
parents:
618
diff
changeset
|
1949 } else { |
2be2cc8fd0a1
mpeg4 interlaced decoding support (not completly implemented/tested due to lack of samples)
michaelni
parents:
618
diff
changeset
|
1950 int motion_x, motion_y; |
2be2cc8fd0a1
mpeg4 interlaced decoding support (not completly implemented/tested due to lack of samples)
michaelni
parents:
618
diff
changeset
|
1951 if (s->mb_intra) { |
2be2cc8fd0a1
mpeg4 interlaced decoding support (not completly implemented/tested due to lack of samples)
michaelni
parents:
618
diff
changeset
|
1952 motion_x = 0; |
2be2cc8fd0a1
mpeg4 interlaced decoding support (not completly implemented/tested due to lack of samples)
michaelni
parents:
618
diff
changeset
|
1953 motion_y = 0; |
664 | 1954 if(s->co_located_type_table) |
1955 s->co_located_type_table[mb_index]= 0; | |
619
2be2cc8fd0a1
mpeg4 interlaced decoding support (not completly implemented/tested due to lack of samples)
michaelni
parents:
618
diff
changeset
|
1956 } else if (s->mv_type == MV_TYPE_16X16) { |
2be2cc8fd0a1
mpeg4 interlaced decoding support (not completly implemented/tested due to lack of samples)
michaelni
parents:
618
diff
changeset
|
1957 motion_x = s->mv[0][0][0]; |
2be2cc8fd0a1
mpeg4 interlaced decoding support (not completly implemented/tested due to lack of samples)
michaelni
parents:
618
diff
changeset
|
1958 motion_y = s->mv[0][0][1]; |
664 | 1959 if(s->co_located_type_table) |
1960 s->co_located_type_table[mb_index]= 0; | |
619
2be2cc8fd0a1
mpeg4 interlaced decoding support (not completly implemented/tested due to lack of samples)
michaelni
parents:
618
diff
changeset
|
1961 } else /*if (s->mv_type == MV_TYPE_FIELD)*/ { |
664 | 1962 int i; |
619
2be2cc8fd0a1
mpeg4 interlaced decoding support (not completly implemented/tested due to lack of samples)
michaelni
parents:
618
diff
changeset
|
1963 motion_x = s->mv[0][0][0] + s->mv[0][1][0]; |
2be2cc8fd0a1
mpeg4 interlaced decoding support (not completly implemented/tested due to lack of samples)
michaelni
parents:
618
diff
changeset
|
1964 motion_y = s->mv[0][0][1] + s->mv[0][1][1]; |
2be2cc8fd0a1
mpeg4 interlaced decoding support (not completly implemented/tested due to lack of samples)
michaelni
parents:
618
diff
changeset
|
1965 motion_x = (motion_x>>1) | (motion_x&1); |
664 | 1966 for(i=0; i<2; i++){ |
1967 s->field_mv_table[mb_index][i][0]= s->mv[0][i][0]; | |
1968 s->field_mv_table[mb_index][i][1]= s->mv[0][i][1]; | |
1969 s->field_select_table[mb_index][i]= s->field_select[0][i]; | |
1970 } | |
1971 s->co_located_type_table[mb_index]= CO_LOCATED_TYPE_FIELDMV; | |
619
2be2cc8fd0a1
mpeg4 interlaced decoding support (not completly implemented/tested due to lack of samples)
michaelni
parents:
618
diff
changeset
|
1972 } |
0 | 1973 /* no update if 8X8 because it has been done during parsing */ |
244 | 1974 s->motion_val[xy][0] = motion_x; |
1975 s->motion_val[xy][1] = motion_y; | |
1976 s->motion_val[xy + 1][0] = motion_x; | |
1977 s->motion_val[xy + 1][1] = motion_y; | |
1978 s->motion_val[xy + wrap][0] = motion_x; | |
1979 s->motion_val[xy + wrap][1] = motion_y; | |
1980 s->motion_val[xy + 1 + wrap][0] = motion_x; | |
1981 s->motion_val[xy + 1 + wrap][1] = motion_y; | |
0 | 1982 } |
1983 } | |
1984 | |
909
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
1985 if ((s->flags&CODEC_FLAG_PSNR) || !(s->encoding && (s->intra_only || s->pict_type==B_TYPE))) { //FIXME precalc |
0 | 1986 UINT8 *dest_y, *dest_cb, *dest_cr; |
481 | 1987 int dct_linesize, dct_offset; |
651 | 1988 op_pixels_func (*op_pix)[4]; |
1989 qpel_mc_func (*op_qpix)[16]; | |
7
1d3ac9654178
added skip macroblock optimization (big perf win on black regions for example)
glantau
parents:
0
diff
changeset
|
1990 |
903 | 1991 /* avoid copy if macroblock skipped in last frame too */ |
324 | 1992 if (s->pict_type != B_TYPE) { |
903 | 1993 s->current_picture.mbskip_table[mb_xy]= s->mb_skiped; |
1994 } | |
1995 | |
1996 /* skip only during decoding as we might trash the buffers during encoding a bit */ | |
1997 if(!s->encoding){ | |
481 | 1998 UINT8 *mbskip_ptr = &s->mbskip_table[mb_xy]; |
903 | 1999 const int age= s->current_picture.age; |
2000 | |
2001 assert(age); | |
2002 | |
7
1d3ac9654178
added skip macroblock optimization (big perf win on black regions for example)
glantau
parents:
0
diff
changeset
|
2003 if (s->mb_skiped) { |
903 | 2004 s->mb_skiped= 0; |
2005 assert(s->pict_type!=I_TYPE); | |
2006 | |
556 | 2007 (*mbskip_ptr) ++; /* indicate that this time we skiped it */ |
2008 if(*mbskip_ptr >99) *mbskip_ptr= 99; | |
2009 | |
903 | 2010 /* if previous was skipped too, then nothing to do ! */ |
2011 if (*mbskip_ptr >= age){ | |
2012 //if(s->pict_type!=B_TYPE && s->mb_x==0) printf("\n"); | |
2013 //if(s->pict_type!=B_TYPE) printf("%d%d ", *mbskip_ptr, age); | |
2014 if(s->pict_type!=B_TYPE) return; | |
2015 if(s->avctx->draw_horiz_band==NULL && *mbskip_ptr > age) return; | |
2016 /* we dont draw complete frames here so we cant skip */ | |
2017 } | |
7
1d3ac9654178
added skip macroblock optimization (big perf win on black regions for example)
glantau
parents:
0
diff
changeset
|
2018 } else { |
1d3ac9654178
added skip macroblock optimization (big perf win on black regions for example)
glantau
parents:
0
diff
changeset
|
2019 *mbskip_ptr = 0; /* not skipped */ |
1d3ac9654178
added skip macroblock optimization (big perf win on black regions for example)
glantau
parents:
0
diff
changeset
|
2020 } |
903 | 2021 }else |
2022 s->mb_skiped= 0; | |
0 | 2023 |
717 | 2024 if(s->pict_type==B_TYPE && s->avctx->draw_horiz_band){ |
903 | 2025 dest_y = s->current_picture.data[0] + mb_x * 16; |
2026 dest_cb = s->current_picture.data[1] + mb_x * 8; | |
2027 dest_cr = s->current_picture.data[2] + mb_x * 8; | |
717 | 2028 }else{ |
903 | 2029 dest_y = s->current_picture.data[0] + (mb_y * 16* s->linesize ) + mb_x * 16; |
2030 dest_cb = s->current_picture.data[1] + (mb_y * 8 * s->uvlinesize) + mb_x * 8; | |
2031 dest_cr = s->current_picture.data[2] + (mb_y * 8 * s->uvlinesize) + mb_x * 8; | |
717 | 2032 } |
0 | 2033 |
2034 if (s->interlaced_dct) { | |
2035 dct_linesize = s->linesize * 2; | |
2036 dct_offset = s->linesize; | |
2037 } else { | |
2038 dct_linesize = s->linesize; | |
2039 dct_offset = s->linesize * 8; | |
2040 } | |
2041 | |
2042 if (!s->mb_intra) { | |
2043 /* motion handling */ | |
456 | 2044 /* decoding or more than one mb_type (MC was allready done otherwise) */ |
481 | 2045 if((!s->encoding) || (s->mb_type[mb_xy]&(s->mb_type[mb_xy]-1))){ |
327 | 2046 if ((!s->no_rounding) || s->pict_type==B_TYPE){ |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2047 op_pix = s->dsp.put_pixels_tab; |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2048 op_qpix= s->dsp.put_qpel_pixels_tab; |
324 | 2049 }else{ |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2050 op_pix = s->dsp.put_no_rnd_pixels_tab; |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2051 op_qpix= s->dsp.put_no_rnd_qpel_pixels_tab; |
324 | 2052 } |
0 | 2053 |
324 | 2054 if (s->mv_dir & MV_DIR_FORWARD) { |
903 | 2055 MPV_motion(s, dest_y, dest_cb, dest_cr, 0, s->last_picture.data, op_pix, op_qpix); |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2056 op_pix = s->dsp.avg_pixels_tab; |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2057 op_qpix= s->dsp.avg_qpel_pixels_tab; |
324 | 2058 } |
2059 if (s->mv_dir & MV_DIR_BACKWARD) { | |
903 | 2060 MPV_motion(s, dest_y, dest_cb, dest_cr, 1, s->next_picture.data, op_pix, op_qpix); |
324 | 2061 } |
0 | 2062 } |
2063 | |
481 | 2064 /* skip dequant / idct if we are really late ;) */ |
814 | 2065 if(s->hurry_up>1) return; |
481 | 2066 |
0 | 2067 /* add dct residue */ |
711 | 2068 if(s->encoding || !( s->mpeg2 || s->h263_msmpeg4 || s->codec_id==CODEC_ID_MPEG1VIDEO |
2069 || (s->codec_id==CODEC_ID_MPEG4 && !s->mpeg_quant))){ | |
481 | 2070 add_dequant_dct(s, block[0], 0, dest_y, dct_linesize); |
2071 add_dequant_dct(s, block[1], 1, dest_y + 8, dct_linesize); | |
2072 add_dequant_dct(s, block[2], 2, dest_y + dct_offset, dct_linesize); | |
2073 add_dequant_dct(s, block[3], 3, dest_y + dct_offset + 8, dct_linesize); | |
0 | 2074 |
485 | 2075 if(!(s->flags&CODEC_FLAG_GRAY)){ |
556 | 2076 add_dequant_dct(s, block[4], 4, dest_cb, s->uvlinesize); |
2077 add_dequant_dct(s, block[5], 5, dest_cr, s->uvlinesize); | |
485 | 2078 } |
936 | 2079 } else if(s->codec_id != CODEC_ID_WMV2){ |
481 | 2080 add_dct(s, block[0], 0, dest_y, dct_linesize); |
2081 add_dct(s, block[1], 1, dest_y + 8, dct_linesize); | |
2082 add_dct(s, block[2], 2, dest_y + dct_offset, dct_linesize); | |
2083 add_dct(s, block[3], 3, dest_y + dct_offset + 8, dct_linesize); | |
2084 | |
485 | 2085 if(!(s->flags&CODEC_FLAG_GRAY)){ |
556 | 2086 add_dct(s, block[4], 4, dest_cb, s->uvlinesize); |
2087 add_dct(s, block[5], 5, dest_cr, s->uvlinesize); | |
485 | 2088 } |
936 | 2089 } else{ |
2090 ff_wmv2_add_mb(s, block, dest_y, dest_cb, dest_cr); | |
481 | 2091 } |
0 | 2092 } else { |
2093 /* dct only in intra block */ | |
711 | 2094 if(s->encoding || !(s->mpeg2 || s->codec_id==CODEC_ID_MPEG1VIDEO)){ |
2095 put_dct(s, block[0], 0, dest_y, dct_linesize); | |
2096 put_dct(s, block[1], 1, dest_y + 8, dct_linesize); | |
2097 put_dct(s, block[2], 2, dest_y + dct_offset, dct_linesize); | |
2098 put_dct(s, block[3], 3, dest_y + dct_offset + 8, dct_linesize); | |
0 | 2099 |
711 | 2100 if(!(s->flags&CODEC_FLAG_GRAY)){ |
2101 put_dct(s, block[4], 4, dest_cb, s->uvlinesize); | |
2102 put_dct(s, block[5], 5, dest_cr, s->uvlinesize); | |
2103 } | |
2104 }else{ | |
2105 s->idct_put(dest_y , dct_linesize, block[0]); | |
2106 s->idct_put(dest_y + 8, dct_linesize, block[1]); | |
2107 s->idct_put(dest_y + dct_offset , dct_linesize, block[2]); | |
2108 s->idct_put(dest_y + dct_offset + 8, dct_linesize, block[3]); | |
2109 | |
2110 if(!(s->flags&CODEC_FLAG_GRAY)){ | |
2111 s->idct_put(dest_cb, s->uvlinesize, block[4]); | |
2112 s->idct_put(dest_cr, s->uvlinesize, block[5]); | |
2113 } | |
485 | 2114 } |
0 | 2115 } |
2116 } | |
294 | 2117 } |
2118 | |
605
40874804a5af
same dc skip behavior for chroma & luma elimination, its confusing otherwise imho
michaelni
parents:
604
diff
changeset
|
2119 static inline void dct_single_coeff_elimination(MpegEncContext *s, int n, int threshold) |
456 | 2120 { |
2121 static const char tab[64]= | |
2122 {3,2,2,1,1,1,1,1, | |
2123 1,1,1,1,1,1,1,1, | |
2124 1,1,1,1,1,1,1,1, | |
2125 0,0,0,0,0,0,0,0, | |
2126 0,0,0,0,0,0,0,0, | |
2127 0,0,0,0,0,0,0,0, | |
2128 0,0,0,0,0,0,0,0, | |
2129 0,0,0,0,0,0,0,0}; | |
2130 int score=0; | |
2131 int run=0; | |
2132 int i; | |
2133 DCTELEM *block= s->block[n]; | |
2134 const int last_index= s->block_last_index[n]; | |
605
40874804a5af
same dc skip behavior for chroma & luma elimination, its confusing otherwise imho
michaelni
parents:
604
diff
changeset
|
2135 int skip_dc; |
456 | 2136 |
604
4344cc8033bd
skip blocks with small chroma dc too (if the user wants it) needed to avoid IDCT(input coeffs !=0) == 0 problems which cause catastrophic error accumulation at qp=1
michaelni
parents:
599
diff
changeset
|
2137 if(threshold<0){ |
4344cc8033bd
skip blocks with small chroma dc too (if the user wants it) needed to avoid IDCT(input coeffs !=0) == 0 problems which cause catastrophic error accumulation at qp=1
michaelni
parents:
599
diff
changeset
|
2138 skip_dc=0; |
4344cc8033bd
skip blocks with small chroma dc too (if the user wants it) needed to avoid IDCT(input coeffs !=0) == 0 problems which cause catastrophic error accumulation at qp=1
michaelni
parents:
599
diff
changeset
|
2139 threshold= -threshold; |
605
40874804a5af
same dc skip behavior for chroma & luma elimination, its confusing otherwise imho
michaelni
parents:
604
diff
changeset
|
2140 }else |
40874804a5af
same dc skip behavior for chroma & luma elimination, its confusing otherwise imho
michaelni
parents:
604
diff
changeset
|
2141 skip_dc=1; |
604
4344cc8033bd
skip blocks with small chroma dc too (if the user wants it) needed to avoid IDCT(input coeffs !=0) == 0 problems which cause catastrophic error accumulation at qp=1
michaelni
parents:
599
diff
changeset
|
2142 |
456 | 2143 /* are all which we could set to zero are allready zero? */ |
2144 if(last_index<=skip_dc - 1) return; | |
2145 | |
2146 for(i=0; i<=last_index; i++){ | |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2147 const int j = s->intra_scantable.permutated[i]; |
456 | 2148 const int level = ABS(block[j]); |
2149 if(level==1){ | |
2150 if(skip_dc && i==0) continue; | |
2151 score+= tab[run]; | |
2152 run=0; | |
2153 }else if(level>1){ | |
2154 return; | |
2155 }else{ | |
2156 run++; | |
2157 } | |
2158 } | |
2159 if(score >= threshold) return; | |
2160 for(i=skip_dc; i<=last_index; i++){ | |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2161 const int j = s->intra_scantable.permutated[i]; |
456 | 2162 block[j]=0; |
2163 } | |
2164 if(block[0]) s->block_last_index[n]= 0; | |
2165 else s->block_last_index[n]= -1; | |
2166 } | |
2167 | |
344 | 2168 static inline void clip_coeffs(MpegEncContext *s, DCTELEM *block, int last_index) |
2169 { | |
2170 int i; | |
2171 const int maxlevel= s->max_qcoeff; | |
2172 const int minlevel= s->min_qcoeff; | |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2173 |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2174 if(s->mb_intra){ |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2175 i=1; //skip clipping of intra dc |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2176 }else |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2177 i=0; |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2178 |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2179 for(;i<=last_index; i++){ |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2180 const int j= s->intra_scantable.permutated[i]; |
344 | 2181 int level = block[j]; |
2182 | |
2183 if (level>maxlevel) level=maxlevel; | |
2184 else if(level<minlevel) level=minlevel; | |
2185 block[j]= level; | |
2186 } | |
2187 } | |
324 | 2188 |
697 | 2189 static inline void requantize_coeffs(MpegEncContext *s, DCTELEM block[64], int oldq, int newq, int n) |
2190 { | |
2191 int i; | |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2192 |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2193 if(s->mb_intra){ |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2194 i=1; //skip clipping of intra dc |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2195 //FIXME requantize, note (mpeg1/h263/h263p-aic dont need it,...) |
697 | 2196 }else |
2197 i=0; | |
2198 | |
2199 for(;i<=s->block_last_index[n]; i++){ | |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2200 const int j = s->intra_scantable.permutated[i]; |
697 | 2201 int level = block[j]; |
2202 | |
2203 block[j]= ROUNDED_DIV(level*oldq, newq); | |
2204 } | |
2205 | |
2206 for(i=s->block_last_index[n]; i>=0; i--){ | |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2207 const int j = s->intra_scantable.permutated[i]; |
697 | 2208 if(block[j]) break; |
2209 } | |
2210 s->block_last_index[n]= i; | |
2211 } | |
2212 | |
2213 static inline void auto_requantize_coeffs(MpegEncContext *s, DCTELEM block[6][64]) | |
2214 { | |
2215 int i,n, newq; | |
2216 const int maxlevel= s->max_qcoeff; | |
2217 const int minlevel= s->min_qcoeff; | |
2218 int largest=0, smallest=0; | |
2219 | |
2220 assert(s->adaptive_quant); | |
2221 | |
2222 for(n=0; n<6; n++){ | |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2223 if(s->mb_intra){ |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2224 i=1; //skip clipping of intra dc |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2225 //FIXME requantize, note (mpeg1/h263/h263p-aic dont need it,...) |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2226 }else |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2227 i=0; |
697 | 2228 |
2229 for(;i<=s->block_last_index[n]; i++){ | |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2230 const int j = s->intra_scantable.permutated[i]; |
697 | 2231 int level = block[n][j]; |
2232 if(largest < level) largest = level; | |
2233 if(smallest > level) smallest= level; | |
2234 } | |
2235 } | |
2236 | |
2237 for(newq=s->qscale+1; newq<32; newq++){ | |
2238 if( ROUNDED_DIV(smallest*s->qscale, newq) >= minlevel | |
2239 && ROUNDED_DIV(largest *s->qscale, newq) <= maxlevel) | |
2240 break; | |
2241 } | |
2242 | |
2243 if(s->out_format==FMT_H263){ | |
2244 /* h263 like formats cannot change qscale by more than 2 easiely */ | |
2245 if(s->avctx->qmin + 2 < newq) | |
2246 newq= s->avctx->qmin + 2; | |
2247 } | |
2248 | |
2249 for(n=0; n<6; n++){ | |
2250 requantize_coeffs(s, block[n], s->qscale, newq, n); | |
2251 clip_coeffs(s, block[n], s->block_last_index[n]); | |
2252 } | |
2253 | |
2254 s->dquant+= newq - s->qscale; | |
2255 s->qscale= newq; | |
2256 } | |
2257 #if 0 | |
2258 static int pix_vcmp16x8(UINT8 *s, int stride){ //FIXME move to dsputil & optimize | |
2259 int score=0; | |
2260 int x,y; | |
2261 | |
2262 for(y=0; y<7; y++){ | |
2263 for(x=0; x<16; x+=4){ | |
2264 score+= ABS(s[x ] - s[x +stride]) + ABS(s[x+1] - s[x+1+stride]) | |
2265 +ABS(s[x+2] - s[x+2+stride]) + ABS(s[x+3] - s[x+3+stride]); | |
2266 } | |
2267 s+= stride; | |
2268 } | |
2269 | |
2270 return score; | |
2271 } | |
2272 | |
2273 static int pix_diff_vcmp16x8(UINT8 *s1, UINT8*s2, int stride){ //FIXME move to dsputil & optimize | |
2274 int score=0; | |
2275 int x,y; | |
2276 | |
2277 for(y=0; y<7; y++){ | |
2278 for(x=0; x<16; x++){ | |
2279 score+= ABS(s1[x ] - s2[x ] - s1[x +stride] + s2[x +stride]); | |
2280 } | |
2281 s1+= stride; | |
2282 s2+= stride; | |
2283 } | |
2284 | |
2285 return score; | |
2286 } | |
2287 #else | |
2288 #define SQ(a) ((a)*(a)) | |
2289 | |
2290 static int pix_vcmp16x8(UINT8 *s, int stride){ //FIXME move to dsputil & optimize | |
2291 int score=0; | |
2292 int x,y; | |
2293 | |
2294 for(y=0; y<7; y++){ | |
2295 for(x=0; x<16; x+=4){ | |
2296 score+= SQ(s[x ] - s[x +stride]) + SQ(s[x+1] - s[x+1+stride]) | |
2297 +SQ(s[x+2] - s[x+2+stride]) + SQ(s[x+3] - s[x+3+stride]); | |
2298 } | |
2299 s+= stride; | |
2300 } | |
2301 | |
2302 return score; | |
2303 } | |
2304 | |
2305 static int pix_diff_vcmp16x8(UINT8 *s1, UINT8*s2, int stride){ //FIXME move to dsputil & optimize | |
2306 int score=0; | |
2307 int x,y; | |
2308 | |
2309 for(y=0; y<7; y++){ | |
2310 for(x=0; x<16; x++){ | |
2311 score+= SQ(s1[x ] - s2[x ] - s1[x +stride] + s2[x +stride]); | |
2312 } | |
2313 s1+= stride; | |
2314 s2+= stride; | |
2315 } | |
2316 | |
2317 return score; | |
2318 } | |
2319 | |
2320 #endif | |
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2321 |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2322 void ff_draw_horiz_band(MpegEncContext *s){ |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2323 if ( s->avctx->draw_horiz_band |
924 | 2324 && (s->last_picture.data[0] || s->low_delay) ) { |
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2325 UINT8 *src_ptr[3]; |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2326 int y, h, offset; |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2327 y = s->mb_y * 16; |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2328 h = s->height - y; |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2329 if (h > 16) |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2330 h = 16; |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2331 |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2332 if(s->pict_type==B_TYPE) |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2333 offset = 0; |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2334 else |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2335 offset = y * s->linesize; |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2336 |
924 | 2337 if(s->pict_type==B_TYPE || s->low_delay){ |
903 | 2338 src_ptr[0] = s->current_picture.data[0] + offset; |
2339 src_ptr[1] = s->current_picture.data[1] + (offset >> 2); | |
2340 src_ptr[2] = s->current_picture.data[2] + (offset >> 2); | |
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2341 } else { |
903 | 2342 src_ptr[0] = s->last_picture.data[0] + offset; |
2343 src_ptr[1] = s->last_picture.data[1] + (offset >> 2); | |
2344 src_ptr[2] = s->last_picture.data[2] + (offset >> 2); | |
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2345 } |
813 | 2346 emms_c(); |
2347 | |
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2348 s->avctx->draw_horiz_band(s->avctx, src_ptr, s->linesize, |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2349 y, s->width, h); |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2350 } |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2351 } |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2352 |
324 | 2353 static void encode_mb(MpegEncContext *s, int motion_x, int motion_y) |
294 | 2354 { |
2355 const int mb_x= s->mb_x; | |
2356 const int mb_y= s->mb_y; | |
2357 int i; | |
456 | 2358 int skip_dct[6]; |
697 | 2359 int dct_offset = s->linesize*8; //default for progressive frames |
2360 | |
456 | 2361 for(i=0; i<6; i++) skip_dct[i]=0; |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
2362 |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
2363 if(s->adaptive_quant){ |
903 | 2364 s->dquant= s->current_picture.qscale_table[mb_x + mb_y*s->mb_width] - s->qscale; |
697 | 2365 |
2366 if(s->out_format==FMT_H263){ | |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
2367 if (s->dquant> 2) s->dquant= 2; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
2368 else if(s->dquant<-2) s->dquant=-2; |
697 | 2369 } |
2370 | |
2371 if(s->codec_id==CODEC_ID_MPEG4){ | |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
2372 if(!s->mb_intra){ |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
2373 assert(s->dquant==0 || s->mv_type!=MV_TYPE_8X8); |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
2374 |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
2375 if(s->mv_dir&MV_DIRECT) |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
2376 s->dquant=0; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
2377 } |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
2378 } |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
2379 s->qscale+= s->dquant; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
2380 s->y_dc_scale= s->y_dc_scale_table[ s->qscale ]; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
2381 s->c_dc_scale= s->c_dc_scale_table[ s->qscale ]; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
2382 } |
294 | 2383 |
324 | 2384 if (s->mb_intra) { |
2385 UINT8 *ptr; | |
697 | 2386 int wrap_y; |
570
274d9c5a75ee
use edge emu for encoding of width or height %16!=0 files
michaelni
parents:
569
diff
changeset
|
2387 int emu=0; |
294 | 2388 |
697 | 2389 wrap_y = s->linesize; |
903 | 2390 ptr = s->new_picture.data[0] + (mb_y * 16 * wrap_y) + mb_x * 16; |
697 | 2391 |
570
274d9c5a75ee
use edge emu for encoding of width or height %16!=0 files
michaelni
parents:
569
diff
changeset
|
2392 if(mb_x*16+16 > s->width || mb_y*16+16 > s->height){ |
936 | 2393 ff_emulated_edge_mc(s, ptr, wrap_y, 16, 16, mb_x*16, mb_y*16, s->width, s->height); |
570
274d9c5a75ee
use edge emu for encoding of width or height %16!=0 files
michaelni
parents:
569
diff
changeset
|
2394 ptr= s->edge_emu_buffer; |
274d9c5a75ee
use edge emu for encoding of width or height %16!=0 files
michaelni
parents:
569
diff
changeset
|
2395 emu=1; |
274d9c5a75ee
use edge emu for encoding of width or height %16!=0 files
michaelni
parents:
569
diff
changeset
|
2396 } |
697 | 2397 |
2398 if(s->flags&CODEC_FLAG_INTERLACED_DCT){ | |
2399 int progressive_score, interlaced_score; | |
2400 | |
2401 progressive_score= pix_vcmp16x8(ptr, wrap_y ) + pix_vcmp16x8(ptr + wrap_y*8, wrap_y ); | |
2402 interlaced_score = pix_vcmp16x8(ptr, wrap_y*2) + pix_vcmp16x8(ptr + wrap_y , wrap_y*2); | |
2403 | |
2404 if(progressive_score > interlaced_score + 100){ | |
2405 s->interlaced_dct=1; | |
2406 | |
2407 dct_offset= wrap_y; | |
2408 wrap_y<<=1; | |
2409 }else | |
2410 s->interlaced_dct=0; | |
2411 } | |
2412 | |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2413 s->dsp.get_pixels(s->block[0], ptr , wrap_y); |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2414 s->dsp.get_pixels(s->block[1], ptr + 8, wrap_y); |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2415 s->dsp.get_pixels(s->block[2], ptr + dct_offset , wrap_y); |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2416 s->dsp.get_pixels(s->block[3], ptr + dct_offset + 8, wrap_y); |
294 | 2417 |
487 | 2418 if(s->flags&CODEC_FLAG_GRAY){ |
2419 skip_dct[4]= 1; | |
2420 skip_dct[5]= 1; | |
2421 }else{ | |
697 | 2422 int wrap_c = s->uvlinesize; |
903 | 2423 ptr = s->new_picture.data[1] + (mb_y * 8 * wrap_c) + mb_x * 8; |
570
274d9c5a75ee
use edge emu for encoding of width or height %16!=0 files
michaelni
parents:
569
diff
changeset
|
2424 if(emu){ |
936 | 2425 ff_emulated_edge_mc(s, ptr, wrap_c, 8, 8, mb_x*8, mb_y*8, s->width>>1, s->height>>1); |
570
274d9c5a75ee
use edge emu for encoding of width or height %16!=0 files
michaelni
parents:
569
diff
changeset
|
2426 ptr= s->edge_emu_buffer; |
274d9c5a75ee
use edge emu for encoding of width or height %16!=0 files
michaelni
parents:
569
diff
changeset
|
2427 } |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2428 s->dsp.get_pixels(s->block[4], ptr, wrap_c); |
294 | 2429 |
903 | 2430 ptr = s->new_picture.data[2] + (mb_y * 8 * wrap_c) + mb_x * 8; |
570
274d9c5a75ee
use edge emu for encoding of width or height %16!=0 files
michaelni
parents:
569
diff
changeset
|
2431 if(emu){ |
936 | 2432 ff_emulated_edge_mc(s, ptr, wrap_c, 8, 8, mb_x*8, mb_y*8, s->width>>1, s->height>>1); |
570
274d9c5a75ee
use edge emu for encoding of width or height %16!=0 files
michaelni
parents:
569
diff
changeset
|
2433 ptr= s->edge_emu_buffer; |
274d9c5a75ee
use edge emu for encoding of width or height %16!=0 files
michaelni
parents:
569
diff
changeset
|
2434 } |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2435 s->dsp.get_pixels(s->block[5], ptr, wrap_c); |
487 | 2436 } |
324 | 2437 }else{ |
651 | 2438 op_pixels_func (*op_pix)[4]; |
2439 qpel_mc_func (*op_qpix)[16]; | |
324 | 2440 UINT8 *dest_y, *dest_cb, *dest_cr; |
456 | 2441 UINT8 *ptr_y, *ptr_cb, *ptr_cr; |
2442 int wrap_y, wrap_c; | |
570
274d9c5a75ee
use edge emu for encoding of width or height %16!=0 files
michaelni
parents:
569
diff
changeset
|
2443 int emu=0; |
294 | 2444 |
903 | 2445 dest_y = s->current_picture.data[0] + (mb_y * 16 * s->linesize ) + mb_x * 16; |
2446 dest_cb = s->current_picture.data[1] + (mb_y * 8 * (s->uvlinesize)) + mb_x * 8; | |
2447 dest_cr = s->current_picture.data[2] + (mb_y * 8 * (s->uvlinesize)) + mb_x * 8; | |
456 | 2448 wrap_y = s->linesize; |
697 | 2449 wrap_c = s->uvlinesize; |
903 | 2450 ptr_y = s->new_picture.data[0] + (mb_y * 16 * wrap_y) + mb_x * 16; |
2451 ptr_cb = s->new_picture.data[1] + (mb_y * 8 * wrap_c) + mb_x * 8; | |
2452 ptr_cr = s->new_picture.data[2] + (mb_y * 8 * wrap_c) + mb_x * 8; | |
324 | 2453 |
327 | 2454 if ((!s->no_rounding) || s->pict_type==B_TYPE){ |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2455 op_pix = s->dsp.put_pixels_tab; |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2456 op_qpix= s->dsp.put_qpel_pixels_tab; |
295 | 2457 }else{ |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2458 op_pix = s->dsp.put_no_rnd_pixels_tab; |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2459 op_qpix= s->dsp.put_no_rnd_qpel_pixels_tab; |
324 | 2460 } |
295 | 2461 |
324 | 2462 if (s->mv_dir & MV_DIR_FORWARD) { |
903 | 2463 MPV_motion(s, dest_y, dest_cb, dest_cr, 0, s->last_picture.data, op_pix, op_qpix); |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2464 op_pix = s->dsp.avg_pixels_tab; |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2465 op_qpix= s->dsp.avg_qpel_pixels_tab; |
324 | 2466 } |
2467 if (s->mv_dir & MV_DIR_BACKWARD) { | |
903 | 2468 MPV_motion(s, dest_y, dest_cb, dest_cr, 1, s->next_picture.data, op_pix, op_qpix); |
324 | 2469 } |
295 | 2470 |
570
274d9c5a75ee
use edge emu for encoding of width or height %16!=0 files
michaelni
parents:
569
diff
changeset
|
2471 if(mb_x*16+16 > s->width || mb_y*16+16 > s->height){ |
936 | 2472 ff_emulated_edge_mc(s, ptr_y, wrap_y, 16, 16, mb_x*16, mb_y*16, s->width, s->height); |
570
274d9c5a75ee
use edge emu for encoding of width or height %16!=0 files
michaelni
parents:
569
diff
changeset
|
2473 ptr_y= s->edge_emu_buffer; |
274d9c5a75ee
use edge emu for encoding of width or height %16!=0 files
michaelni
parents:
569
diff
changeset
|
2474 emu=1; |
274d9c5a75ee
use edge emu for encoding of width or height %16!=0 files
michaelni
parents:
569
diff
changeset
|
2475 } |
697 | 2476 |
2477 if(s->flags&CODEC_FLAG_INTERLACED_DCT){ | |
2478 int progressive_score, interlaced_score; | |
2479 | |
2480 progressive_score= pix_diff_vcmp16x8(ptr_y , dest_y , wrap_y ) | |
2481 + pix_diff_vcmp16x8(ptr_y + wrap_y*8, dest_y + wrap_y*8, wrap_y ); | |
2482 interlaced_score = pix_diff_vcmp16x8(ptr_y , dest_y , wrap_y*2) | |
2483 + pix_diff_vcmp16x8(ptr_y + wrap_y , dest_y + wrap_y , wrap_y*2); | |
2484 | |
2485 if(progressive_score > interlaced_score + 600){ | |
2486 s->interlaced_dct=1; | |
2487 | |
2488 dct_offset= wrap_y; | |
2489 wrap_y<<=1; | |
2490 }else | |
2491 s->interlaced_dct=0; | |
2492 } | |
2493 | |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2494 s->dsp.diff_pixels(s->block[0], ptr_y , dest_y , wrap_y); |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2495 s->dsp.diff_pixels(s->block[1], ptr_y + 8, dest_y + 8, wrap_y); |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2496 s->dsp.diff_pixels(s->block[2], ptr_y + dct_offset , dest_y + dct_offset , wrap_y); |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2497 s->dsp.diff_pixels(s->block[3], ptr_y + dct_offset + 8, dest_y + dct_offset + 8, wrap_y); |
487 | 2498 |
2499 if(s->flags&CODEC_FLAG_GRAY){ | |
2500 skip_dct[4]= 1; | |
2501 skip_dct[5]= 1; | |
2502 }else{ | |
570
274d9c5a75ee
use edge emu for encoding of width or height %16!=0 files
michaelni
parents:
569
diff
changeset
|
2503 if(emu){ |
936 | 2504 ff_emulated_edge_mc(s, ptr_cb, wrap_c, 8, 8, mb_x*8, mb_y*8, s->width>>1, s->height>>1); |
570
274d9c5a75ee
use edge emu for encoding of width or height %16!=0 files
michaelni
parents:
569
diff
changeset
|
2505 ptr_cb= s->edge_emu_buffer; |
274d9c5a75ee
use edge emu for encoding of width or height %16!=0 files
michaelni
parents:
569
diff
changeset
|
2506 } |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2507 s->dsp.diff_pixels(s->block[4], ptr_cb, dest_cb, wrap_c); |
570
274d9c5a75ee
use edge emu for encoding of width or height %16!=0 files
michaelni
parents:
569
diff
changeset
|
2508 if(emu){ |
936 | 2509 ff_emulated_edge_mc(s, ptr_cr, wrap_c, 8, 8, mb_x*8, mb_y*8, s->width>>1, s->height>>1); |
570
274d9c5a75ee
use edge emu for encoding of width or height %16!=0 files
michaelni
parents:
569
diff
changeset
|
2510 ptr_cr= s->edge_emu_buffer; |
274d9c5a75ee
use edge emu for encoding of width or height %16!=0 files
michaelni
parents:
569
diff
changeset
|
2511 } |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2512 s->dsp.diff_pixels(s->block[5], ptr_cr, dest_cr, wrap_c); |
487 | 2513 } |
456 | 2514 /* pre quantization */ |
903 | 2515 if(s->current_picture.mc_mb_var[s->mb_width*mb_y+ mb_x]<2*s->qscale*s->qscale){ |
697 | 2516 //FIXME optimize |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2517 if(s->dsp.pix_abs8x8(ptr_y , dest_y , wrap_y) < 20*s->qscale) skip_dct[0]= 1; |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2518 if(s->dsp.pix_abs8x8(ptr_y + 8, dest_y + 8, wrap_y) < 20*s->qscale) skip_dct[1]= 1; |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2519 if(s->dsp.pix_abs8x8(ptr_y +dct_offset , dest_y +dct_offset , wrap_y) < 20*s->qscale) skip_dct[2]= 1; |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2520 if(s->dsp.pix_abs8x8(ptr_y +dct_offset+ 8, dest_y +dct_offset+ 8, wrap_y) < 20*s->qscale) skip_dct[3]= 1; |
899 | 2521 if(s->dsp.pix_abs8x8(ptr_cb , dest_cb , wrap_c) < 20*s->qscale) skip_dct[4]= 1; |
2522 if(s->dsp.pix_abs8x8(ptr_cr , dest_cr , wrap_c) < 20*s->qscale) skip_dct[5]= 1; | |
456 | 2523 #if 0 |
2524 { | |
2525 static int stat[7]; | |
2526 int num=0; | |
2527 for(i=0; i<6; i++) | |
2528 if(skip_dct[i]) num++; | |
2529 stat[num]++; | |
2530 | |
2531 if(s->mb_x==0 && s->mb_y==0){ | |
2532 for(i=0; i<7; i++){ | |
2533 printf("%6d %1d\n", stat[i], i); | |
2534 } | |
2535 } | |
2536 } | |
2537 #endif | |
2538 } | |
324 | 2539 |
294 | 2540 } |
2541 | |
2542 #if 0 | |
2543 { | |
2544 float adap_parm; | |
2545 | |
2546 adap_parm = ((s->avg_mb_var << 1) + s->mb_var[s->mb_width*mb_y+mb_x] + 1.0) / | |
2547 ((s->mb_var[s->mb_width*mb_y+mb_x] << 1) + s->avg_mb_var + 1.0); | |
2548 | |
2549 printf("\ntype=%c qscale=%2d adap=%0.2f dquant=%4.2f var=%4d avgvar=%4d", | |
2550 (s->mb_type[s->mb_width*mb_y+mb_x] > 0) ? 'I' : 'P', | |
2551 s->qscale, adap_parm, s->qscale*adap_parm, | |
2552 s->mb_var[s->mb_width*mb_y+mb_x], s->avg_mb_var); | |
2553 } | |
2554 #endif | |
2555 /* DCT & quantize */ | |
344 | 2556 if(s->out_format==FMT_MJPEG){ |
2557 for(i=0;i<6;i++) { | |
2558 int overflow; | |
625
bb6a69f9d409
slow but accurate integer dct from IJG (should be ok with the LGPL as the old DCT is the fast integer DCT from IJG)
michaelni
parents:
619
diff
changeset
|
2559 s->block_last_index[i] = s->dct_quantize(s, s->block[i], i, 8, &overflow); |
350
6ebbecc10063
- Advanced Intra Coding (AIC) support for H.263+ encoder, just DC by now.
pulento
parents:
347
diff
changeset
|
2560 if (overflow) clip_coeffs(s, s->block[i], s->block_last_index[i]); |
344 | 2561 } |
2562 }else{ | |
2563 for(i=0;i<6;i++) { | |
456 | 2564 if(!skip_dct[i]){ |
2565 int overflow; | |
625
bb6a69f9d409
slow but accurate integer dct from IJG (should be ok with the LGPL as the old DCT is the fast integer DCT from IJG)
michaelni
parents:
619
diff
changeset
|
2566 s->block_last_index[i] = s->dct_quantize(s, s->block[i], i, s->qscale, &overflow); |
344 | 2567 // FIXME we could decide to change to quantizer instead of clipping |
350
6ebbecc10063
- Advanced Intra Coding (AIC) support for H.263+ encoder, just DC by now.
pulento
parents:
347
diff
changeset
|
2568 // JS: I don't think that would be a good idea it could lower quality instead |
6ebbecc10063
- Advanced Intra Coding (AIC) support for H.263+ encoder, just DC by now.
pulento
parents:
347
diff
changeset
|
2569 // of improve it. Just INTRADC clipping deserves changes in quantizer |
456 | 2570 if (overflow) clip_coeffs(s, s->block[i], s->block_last_index[i]); |
2571 }else | |
2572 s->block_last_index[i]= -1; | |
344 | 2573 } |
456 | 2574 if(s->luma_elim_threshold && !s->mb_intra) |
2575 for(i=0; i<4; i++) | |
605
40874804a5af
same dc skip behavior for chroma & luma elimination, its confusing otherwise imho
michaelni
parents:
604
diff
changeset
|
2576 dct_single_coeff_elimination(s, i, s->luma_elim_threshold); |
456 | 2577 if(s->chroma_elim_threshold && !s->mb_intra) |
2578 for(i=4; i<6; i++) | |
605
40874804a5af
same dc skip behavior for chroma & luma elimination, its confusing otherwise imho
michaelni
parents:
604
diff
changeset
|
2579 dct_single_coeff_elimination(s, i, s->chroma_elim_threshold); |
294 | 2580 } |
2581 | |
487 | 2582 if((s->flags&CODEC_FLAG_GRAY) && s->mb_intra){ |
2583 s->block_last_index[4]= | |
2584 s->block_last_index[5]= 0; | |
2585 s->block[4][0]= | |
2586 s->block[5][0]= 128; | |
2587 } | |
2588 | |
815
78accc54493b
put a few large tables under #ifdef CONFIG_ENCODERS or dynamically allocate them
michaelni
parents:
814
diff
changeset
|
2589 #ifdef CONFIG_ENCODERS |
294 | 2590 /* huffman encode */ |
936 | 2591 switch(s->codec_id){ //FIXME funct ptr could be slightly faster |
2592 case CODEC_ID_MPEG1VIDEO: | |
2593 mpeg1_encode_mb(s, s->block, motion_x, motion_y); break; | |
2594 case CODEC_ID_MPEG4: | |
2595 mpeg4_encode_mb(s, s->block, motion_x, motion_y); break; | |
2596 case CODEC_ID_MSMPEG4V2: | |
2597 case CODEC_ID_MSMPEG4V3: | |
2598 case CODEC_ID_WMV1: | |
2599 msmpeg4_encode_mb(s, s->block, motion_x, motion_y); break; | |
2600 case CODEC_ID_WMV2: | |
2601 ff_wmv2_encode_mb(s, s->block, motion_x, motion_y); break; | |
2602 case CODEC_ID_MJPEG: | |
2603 mjpeg_encode_mb(s, s->block); break; | |
2604 case CODEC_ID_H263: | |
2605 case CODEC_ID_H263P: | |
2606 case CODEC_ID_RV10: | |
2607 h263_encode_mb(s, s->block, motion_x, motion_y); break; | |
2608 default: | |
2609 assert(0); | |
294 | 2610 } |
815
78accc54493b
put a few large tables under #ifdef CONFIG_ENCODERS or dynamically allocate them
michaelni
parents:
814
diff
changeset
|
2611 #endif |
294 | 2612 } |
2613 | |
456 | 2614 void ff_copy_bits(PutBitContext *pb, UINT8 *src, int length) |
294 | 2615 { |
326 | 2616 int bytes= length>>4; |
2617 int bits= length&15; | |
2618 int i; | |
2619 | |
456 | 2620 if(length==0) return; |
2621 | |
326 | 2622 for(i=0; i<bytes; i++) put_bits(pb, 16, be2me_16(((uint16_t*)src)[i])); |
2623 put_bits(pb, bits, be2me_16(((uint16_t*)src)[i])>>(16-bits)); | |
0 | 2624 } |
2625 | |
456 | 2626 static inline void copy_context_before_encode(MpegEncContext *d, MpegEncContext *s, int type){ |
326 | 2627 int i; |
2628 | |
2629 memcpy(d->last_mv, s->last_mv, 2*2*2*sizeof(int)); //FIXME is memcpy faster then a loop? | |
2630 | |
2631 /* mpeg1 */ | |
2632 d->mb_incr= s->mb_incr; | |
2633 for(i=0; i<3; i++) | |
2634 d->last_dc[i]= s->last_dc[i]; | |
2635 | |
2636 /* statistics */ | |
2637 d->mv_bits= s->mv_bits; | |
2638 d->i_tex_bits= s->i_tex_bits; | |
2639 d->p_tex_bits= s->p_tex_bits; | |
2640 d->i_count= s->i_count; | |
656
e47fa3e3f2d5
statistics for forw & back p-MBs instead of just one counter for both
michaelni
parents:
652
diff
changeset
|
2641 d->f_count= s->f_count; |
e47fa3e3f2d5
statistics for forw & back p-MBs instead of just one counter for both
michaelni
parents:
652
diff
changeset
|
2642 d->b_count= s->b_count; |
326 | 2643 d->skip_count= s->skip_count; |
2644 d->misc_bits= s->misc_bits; | |
329 | 2645 d->last_bits= 0; |
327 | 2646 |
2647 d->mb_skiped= s->mb_skiped; | |
912 | 2648 d->qscale= s->qscale; |
326 | 2649 } |
2650 | |
456 | 2651 static inline void copy_context_after_encode(MpegEncContext *d, MpegEncContext *s, int type){ |
326 | 2652 int i; |
2653 | |
2654 memcpy(d->mv, s->mv, 2*4*2*sizeof(int)); | |
2655 memcpy(d->last_mv, s->last_mv, 2*2*2*sizeof(int)); //FIXME is memcpy faster then a loop? | |
2656 | |
2657 /* mpeg1 */ | |
2658 d->mb_incr= s->mb_incr; | |
2659 for(i=0; i<3; i++) | |
2660 d->last_dc[i]= s->last_dc[i]; | |
2661 | |
2662 /* statistics */ | |
2663 d->mv_bits= s->mv_bits; | |
2664 d->i_tex_bits= s->i_tex_bits; | |
2665 d->p_tex_bits= s->p_tex_bits; | |
2666 d->i_count= s->i_count; | |
656
e47fa3e3f2d5
statistics for forw & back p-MBs instead of just one counter for both
michaelni
parents:
652
diff
changeset
|
2667 d->f_count= s->f_count; |
e47fa3e3f2d5
statistics for forw & back p-MBs instead of just one counter for both
michaelni
parents:
652
diff
changeset
|
2668 d->b_count= s->b_count; |
326 | 2669 d->skip_count= s->skip_count; |
2670 d->misc_bits= s->misc_bits; | |
2671 | |
2672 d->mb_intra= s->mb_intra; | |
327 | 2673 d->mb_skiped= s->mb_skiped; |
326 | 2674 d->mv_type= s->mv_type; |
2675 d->mv_dir= s->mv_dir; | |
2676 d->pb= s->pb; | |
456 | 2677 if(s->data_partitioning){ |
2678 d->pb2= s->pb2; | |
2679 d->tex_pb= s->tex_pb; | |
2680 } | |
326 | 2681 d->block= s->block; |
2682 for(i=0; i<6; i++) | |
2683 d->block_last_index[i]= s->block_last_index[i]; | |
755 | 2684 d->interlaced_dct= s->interlaced_dct; |
912 | 2685 d->qscale= s->qscale; |
326 | 2686 } |
2687 | |
456 | 2688 static inline void encode_mb_hq(MpegEncContext *s, MpegEncContext *backup, MpegEncContext *best, int type, |
2689 PutBitContext pb[2], PutBitContext pb2[2], PutBitContext tex_pb[2], | |
2690 int *dmin, int *next_block, int motion_x, int motion_y) | |
2691 { | |
2692 int bits_count; | |
2693 | |
2694 copy_context_before_encode(s, backup, type); | |
2695 | |
2696 s->block= s->blocks[*next_block]; | |
2697 s->pb= pb[*next_block]; | |
2698 if(s->data_partitioning){ | |
2699 s->pb2 = pb2 [*next_block]; | |
2700 s->tex_pb= tex_pb[*next_block]; | |
2701 } | |
2702 | |
2703 encode_mb(s, motion_x, motion_y); | |
2704 | |
2705 bits_count= get_bit_count(&s->pb); | |
2706 if(s->data_partitioning){ | |
2707 bits_count+= get_bit_count(&s->pb2); | |
2708 bits_count+= get_bit_count(&s->tex_pb); | |
2709 } | |
2710 | |
2711 if(bits_count<*dmin){ | |
2712 *dmin= bits_count; | |
2713 *next_block^=1; | |
2714 | |
2715 copy_context_after_encode(best, s, type); | |
2716 } | |
2717 } | |
909
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
2718 |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
2719 static inline int sse(MpegEncContext *s, uint8_t *src1, uint8_t *src2, int w, int h, int stride){ |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
2720 uint32_t *sq = squareTbl + 256; |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
2721 int acc=0; |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
2722 int x,y; |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
2723 |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
2724 if(w==16 && h==16) |
936 | 2725 return s->dsp.sse[0](NULL, src1, src2, stride); |
2726 else if(w==8 && h==8) | |
2727 return s->dsp.sse[1](NULL, src1, src2, stride); | |
909
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
2728 |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
2729 for(y=0; y<h; y++){ |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
2730 for(x=0; x<w; x++){ |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
2731 acc+= sq[src1[x + y*stride] - src2[x + y*stride]]; |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
2732 } |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
2733 } |
936 | 2734 |
2735 assert(acc>=0); | |
2736 | |
909
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
2737 return acc; |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
2738 } |
326 | 2739 |
0 | 2740 static void encode_picture(MpegEncContext *s, int picture_number) |
2741 { | |
766 | 2742 int mb_x, mb_y, pdif = 0; |
294 | 2743 int i; |
286 | 2744 int bits; |
326 | 2745 MpegEncContext best_s, backup_s; |
456 | 2746 UINT8 bit_buf[2][3000]; |
2747 UINT8 bit_buf2[2][3000]; | |
2748 UINT8 bit_buf_tex[2][3000]; | |
2749 PutBitContext pb[2], pb2[2], tex_pb[2]; | |
2750 | |
2751 for(i=0; i<2; i++){ | |
2752 init_put_bits(&pb [i], bit_buf [i], 3000, NULL, NULL); | |
2753 init_put_bits(&pb2 [i], bit_buf2 [i], 3000, NULL, NULL); | |
2754 init_put_bits(&tex_pb[i], bit_buf_tex[i], 3000, NULL, NULL); | |
2755 } | |
0 | 2756 |
2757 s->picture_number = picture_number; | |
268 | 2758 |
294 | 2759 s->block_wrap[0]= |
2760 s->block_wrap[1]= | |
2761 s->block_wrap[2]= | |
2762 s->block_wrap[3]= s->mb_width*2 + 2; | |
2763 s->block_wrap[4]= | |
2764 s->block_wrap[5]= s->mb_width + 2; | |
2765 | |
268 | 2766 /* Reset the average MB variance */ |
903 | 2767 s->current_picture.mb_var_sum = 0; |
2768 s->current_picture.mc_mb_var_sum = 0; | |
327 | 2769 |
2770 /* we need to initialize some time vars before we can encode b-frames */ | |
2771 if (s->h263_pred && !s->h263_msmpeg4) | |
2772 ff_set_mpeg4_time(s, s->picture_number); | |
2773 | |
608 | 2774 s->scene_change_score=0; |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
2775 |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
2776 s->qscale= (int)(s->frame_qscale + 0.5); //FIXME qscale / ... stuff for ME ratedistoration |
936 | 2777 |
2778 if(s->msmpeg4_version){ | |
2779 if(s->pict_type==I_TYPE) | |
2780 s->no_rounding=1; | |
2781 else if(s->flipflop_rounding) | |
2782 s->no_rounding ^= 1; | |
2783 }else{ | |
2784 if(s->pict_type==I_TYPE) | |
2785 s->no_rounding=0; | |
2786 else if(s->pict_type!=B_TYPE) | |
2787 s->no_rounding ^= 1; | |
2788 } | |
608 | 2789 |
268 | 2790 /* Estimate motion for every MB */ |
324 | 2791 if(s->pict_type != I_TYPE){ |
294 | 2792 for(mb_y=0; mb_y < s->mb_height; mb_y++) { |
2793 s->block_index[0]= s->block_wrap[0]*(mb_y*2 + 1) - 1; | |
2794 s->block_index[1]= s->block_wrap[0]*(mb_y*2 + 1); | |
2795 s->block_index[2]= s->block_wrap[0]*(mb_y*2 + 2) - 1; | |
2796 s->block_index[3]= s->block_wrap[0]*(mb_y*2 + 2); | |
2797 for(mb_x=0; mb_x < s->mb_width; mb_x++) { | |
2798 s->mb_x = mb_x; | |
2799 s->mb_y = mb_y; | |
2800 s->block_index[0]+=2; | |
2801 s->block_index[1]+=2; | |
2802 s->block_index[2]+=2; | |
2803 s->block_index[3]+=2; | |
268 | 2804 |
294 | 2805 /* compute motion vector & mb_type and store in context */ |
324 | 2806 if(s->pict_type==B_TYPE) |
2807 ff_estimate_b_frame_motion(s, mb_x, mb_y); | |
2808 else | |
2809 ff_estimate_p_frame_motion(s, mb_x, mb_y); | |
268 | 2810 } |
2811 } | |
456 | 2812 }else /* if(s->pict_type == I_TYPE) */{ |
294 | 2813 /* I-Frame */ |
2814 //FIXME do we need to zero them? | |
2815 memset(s->motion_val[0], 0, sizeof(INT16)*(s->mb_width*2 + 2)*(s->mb_height*2 + 2)*2); | |
324 | 2816 memset(s->p_mv_table , 0, sizeof(INT16)*(s->mb_width+2)*(s->mb_height+2)*2); |
294 | 2817 memset(s->mb_type , MB_TYPE_INTRA, sizeof(UINT8)*s->mb_width*s->mb_height); |
612 | 2818 |
2819 if(!s->fixed_qscale){ | |
2820 /* finding spatial complexity for I-frame rate control */ | |
2821 for(mb_y=0; mb_y < s->mb_height; mb_y++) { | |
2822 for(mb_x=0; mb_x < s->mb_width; mb_x++) { | |
2823 int xx = mb_x * 16; | |
2824 int yy = mb_y * 16; | |
903 | 2825 uint8_t *pix = s->new_picture.data[0] + (yy * s->linesize) + xx; |
612 | 2826 int varc; |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2827 int sum = s->dsp.pix_sum(pix, s->linesize); |
612 | 2828 |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
2829 varc = (s->dsp.pix_norm1(pix, s->linesize) - (((unsigned)(sum*sum))>>8) + 500 + 128)>>8; |
612 | 2830 |
903 | 2831 s->current_picture.mb_var [s->mb_width * mb_y + mb_x] = varc; |
2832 s->current_picture.mb_mean[s->mb_width * mb_y + mb_x] = (sum+128)>>8; | |
2833 s->current_picture.mb_var_sum += varc; | |
612 | 2834 } |
2835 } | |
2836 } | |
268 | 2837 } |
814 | 2838 emms_c(); |
2839 | |
608 | 2840 if(s->scene_change_score > 0 && s->pict_type == P_TYPE){ |
271 | 2841 s->pict_type= I_TYPE; |
294 | 2842 memset(s->mb_type , MB_TYPE_INTRA, sizeof(UINT8)*s->mb_width*s->mb_height); |
903 | 2843 //printf("Scene change detected, encoding as I Frame %d %d\n", s->current_picture.mb_var_sum, s->current_picture.mc_mb_var_sum); |
271 | 2844 } |
903 | 2845 |
324 | 2846 if(s->pict_type==P_TYPE || s->pict_type==S_TYPE) |
2847 s->f_code= ff_get_best_fcode(s, s->p_mv_table, MB_TYPE_INTER); | |
2848 ff_fix_long_p_mvs(s); | |
2849 if(s->pict_type==B_TYPE){ | |
2850 s->f_code= ff_get_best_fcode(s, s->b_forw_mv_table, MB_TYPE_FORWARD); | |
2851 s->b_code= ff_get_best_fcode(s, s->b_back_mv_table, MB_TYPE_BACKWARD); | |
327 | 2852 |
2853 ff_fix_long_b_mvs(s, s->b_forw_mv_table, s->f_code, MB_TYPE_FORWARD); | |
2854 ff_fix_long_b_mvs(s, s->b_back_mv_table, s->b_code, MB_TYPE_BACKWARD); | |
2855 ff_fix_long_b_mvs(s, s->b_bidir_forw_mv_table, s->f_code, MB_TYPE_BIDIR); | |
2856 ff_fix_long_b_mvs(s, s->b_bidir_back_mv_table, s->b_code, MB_TYPE_BIDIR); | |
277
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
271
diff
changeset
|
2857 } |
324 | 2858 |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
2859 if (s->fixed_qscale) |
903 | 2860 s->frame_qscale = s->current_picture.quality; |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
2861 else |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
2862 s->frame_qscale = ff_rate_estimate_qscale(s); |
277
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
271
diff
changeset
|
2863 |
695 | 2864 if(s->adaptive_quant){ |
2865 switch(s->codec_id){ | |
2866 case CODEC_ID_MPEG4: | |
2867 ff_clean_mpeg4_qscales(s); | |
2868 break; | |
2869 case CODEC_ID_H263: | |
2870 case CODEC_ID_H263P: | |
2871 ff_clean_h263_qscales(s); | |
2872 break; | |
2873 } | |
2874 | |
903 | 2875 s->qscale= s->current_picture.qscale_table[0]; |
695 | 2876 }else |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
2877 s->qscale= (int)(s->frame_qscale + 0.5); |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
673
diff
changeset
|
2878 |
0 | 2879 if (s->out_format == FMT_MJPEG) { |
2880 /* for mjpeg, we do include qscale in the matrix */ | |
533
3c07cf9595de
adding ff prefix to avoid global name conficts with xvid (patch by Marko Kreen <marko at l-t.ee>)
michaelni
parents:
514
diff
changeset
|
2881 s->intra_matrix[0] = ff_mpeg1_default_intra_matrix[0]; |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2882 for(i=1;i<64;i++){ |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2883 int j= s->idct_permutation[i]; |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2884 |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2885 s->intra_matrix[j] = CLAMP_TO_8BIT((ff_mpeg1_default_intra_matrix[i] * s->qscale) >> 3); |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
2886 } |
625
bb6a69f9d409
slow but accurate integer dct from IJG (should be ok with the LGPL as the old DCT is the fast integer DCT from IJG)
michaelni
parents:
619
diff
changeset
|
2887 convert_matrix(s, s->q_intra_matrix, s->q_intra_matrix16, |
709
afeff6ccb7f5
convert only needed matrixes in convert_matrix() (mjpeg calls it for every frame)
michaelni
parents:
706
diff
changeset
|
2888 s->q_intra_matrix16_bias, s->intra_matrix, s->intra_quant_bias, 8, 8); |
0 | 2889 } |
903 | 2890 |
2891 //FIXME var duplication | |
2892 s->current_picture.key_frame= s->pict_type == I_TYPE; | |
2893 s->current_picture.pict_type= s->pict_type; | |
2894 | |
2895 if(s->current_picture.key_frame) | |
2896 s->picture_in_gop_number=0; | |
0 | 2897 |
286 | 2898 s->last_bits= get_bit_count(&s->pb); |
0 | 2899 switch(s->out_format) { |
2900 case FMT_MJPEG: | |
2901 mjpeg_picture_header(s); | |
2902 break; | |
2903 case FMT_H263: | |
936 | 2904 if (s->codec_id == CODEC_ID_WMV2) |
2905 ff_wmv2_encode_picture_header(s, picture_number); | |
2906 else if (s->h263_msmpeg4) | |
0 | 2907 msmpeg4_encode_picture_header(s, picture_number); |
2908 else if (s->h263_pred) | |
2909 mpeg4_encode_picture_header(s, picture_number); | |
2910 else if (s->h263_rv10) | |
2911 rv10_encode_picture_header(s, picture_number); | |
2912 else | |
2913 h263_encode_picture_header(s, picture_number); | |
2914 break; | |
2915 case FMT_MPEG1: | |
2916 mpeg1_encode_picture_header(s, picture_number); | |
2917 break; | |
2918 } | |
286 | 2919 bits= get_bit_count(&s->pb); |
2920 s->header_bits= bits - s->last_bits; | |
2921 s->last_bits= bits; | |
2922 s->mv_bits=0; | |
2923 s->misc_bits=0; | |
2924 s->i_tex_bits=0; | |
2925 s->p_tex_bits=0; | |
2926 s->i_count=0; | |
656
e47fa3e3f2d5
statistics for forw & back p-MBs instead of just one counter for both
michaelni
parents:
652
diff
changeset
|
2927 s->f_count=0; |
e47fa3e3f2d5
statistics for forw & back p-MBs instead of just one counter for both
michaelni
parents:
652
diff
changeset
|
2928 s->b_count=0; |
286 | 2929 s->skip_count=0; |
2930 | |
909
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
2931 for(i=0; i<3; i++){ |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
2932 /* init last dc values */ |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
2933 /* note: quant matrix value (8) is implied here */ |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
2934 s->last_dc[i] = 128; |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
2935 |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
2936 s->current_picture.error[i] = 0; |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
2937 } |
0 | 2938 s->mb_incr = 1; |
2939 s->last_mv[0][0][0] = 0; | |
2940 s->last_mv[0][0][1] = 0; | |
2941 | |
766 | 2942 if (s->codec_id==CODEC_ID_H263 || s->codec_id==CODEC_ID_H263P) |
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2943 s->gob_index = ff_h263_get_gob_height(s); |
456 | 2944 |
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2945 if(s->codec_id==CODEC_ID_MPEG4 && s->partitioned_frame) |
456 | 2946 ff_mpeg4_init_partitions(s); |
2947 | |
2948 s->resync_mb_x=0; | |
2949 s->resync_mb_y=0; | |
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2950 s->first_slice_line = 1; |
766 | 2951 s->ptr_lastgob = s->pb.buf; |
2952 s->ptr_last_mb_line = s->pb.buf; | |
233
3f5b72726118
- More work on preliminary bit rate control, just to be able to get an
pulento
parents:
232
diff
changeset
|
2953 for(mb_y=0; mb_y < s->mb_height; mb_y++) { |
499 | 2954 s->y_dc_scale= s->y_dc_scale_table[ s->qscale ]; |
2955 s->c_dc_scale= s->c_dc_scale_table[ s->qscale ]; | |
233
3f5b72726118
- More work on preliminary bit rate control, just to be able to get an
pulento
parents:
232
diff
changeset
|
2956 |
266 | 2957 s->block_index[0]= s->block_wrap[0]*(mb_y*2 + 1) - 1; |
2958 s->block_index[1]= s->block_wrap[0]*(mb_y*2 + 1); | |
2959 s->block_index[2]= s->block_wrap[0]*(mb_y*2 + 2) - 1; | |
2960 s->block_index[3]= s->block_wrap[0]*(mb_y*2 + 2); | |
2961 s->block_index[4]= s->block_wrap[4]*(mb_y + 1) + s->block_wrap[0]*(s->mb_height*2 + 2); | |
2962 s->block_index[5]= s->block_wrap[4]*(mb_y + 1 + s->mb_height + 2) + s->block_wrap[0]*(s->mb_height*2 + 2); | |
232
b640ec5948b0
- Now the ME is done for the entire picture when enconding, the
pulento
parents:
231
diff
changeset
|
2963 for(mb_x=0; mb_x < s->mb_width; mb_x++) { |
327 | 2964 const int mb_type= s->mb_type[mb_y * s->mb_width + mb_x]; |
2965 const int xy= (mb_y+1) * (s->mb_width+2) + mb_x + 1; | |
456 | 2966 // int d; |
294 | 2967 int dmin=10000000; |
0 | 2968 |
232
b640ec5948b0
- Now the ME is done for the entire picture when enconding, the
pulento
parents:
231
diff
changeset
|
2969 s->mb_x = mb_x; |
b640ec5948b0
- Now the ME is done for the entire picture when enconding, the
pulento
parents:
231
diff
changeset
|
2970 s->mb_y = mb_y; |
266 | 2971 s->block_index[0]+=2; |
2972 s->block_index[1]+=2; | |
2973 s->block_index[2]+=2; | |
2974 s->block_index[3]+=2; | |
2975 s->block_index[4]++; | |
2976 s->block_index[5]++; | |
456 | 2977 |
766 | 2978 /* write gob / video packet header */ |
2979 if(s->rtp_mode){ | |
2980 int current_packet_size, is_gob_start; | |
2981 | |
2982 current_packet_size= pbBufPtr(&s->pb) - s->ptr_lastgob; | |
2983 is_gob_start=0; | |
2984 | |
2985 if(s->codec_id==CODEC_ID_MPEG4){ | |
2986 if(current_packet_size + s->mb_line_avgsize/s->mb_width >= s->rtp_payload_size | |
2987 && s->mb_y + s->mb_x>0){ | |
2988 | |
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
2989 if(s->partitioned_frame){ |
456 | 2990 ff_mpeg4_merge_partitions(s); |
2991 ff_mpeg4_init_partitions(s); | |
2992 } | |
2993 ff_mpeg4_encode_video_packet_header(s); | |
2994 | |
2995 if(s->flags&CODEC_FLAG_PASS1){ | |
2996 int bits= get_bit_count(&s->pb); | |
2997 s->misc_bits+= bits - s->last_bits; | |
2998 s->last_bits= bits; | |
2999 } | |
3000 ff_mpeg4_clean_buffers(s); | |
766 | 3001 is_gob_start=1; |
456 | 3002 } |
766 | 3003 }else{ |
3004 if(current_packet_size + s->mb_line_avgsize*s->gob_index >= s->rtp_payload_size | |
3005 && s->mb_x==0 && s->mb_y>0 && s->mb_y%s->gob_index==0){ | |
3006 | |
3007 h263_encode_gob_header(s, mb_y); | |
3008 is_gob_start=1; | |
3009 } | |
3010 } | |
3011 | |
3012 if(is_gob_start){ | |
456 | 3013 s->ptr_lastgob = pbBufPtr(&s->pb); |
3014 s->first_slice_line=1; | |
3015 s->resync_mb_x=mb_x; | |
3016 s->resync_mb_y=mb_y; | |
3017 } | |
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
3018 } |
456 | 3019 |
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
3020 if( (s->resync_mb_x == s->mb_x) |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
3021 && s->resync_mb_y+1 == s->mb_y){ |
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
3022 s->first_slice_line=0; |
456 | 3023 } |
3024 | |
294 | 3025 if(mb_type & (mb_type-1)){ // more than 1 MB type possible |
327 | 3026 int next_block=0; |
456 | 3027 int pb_bits_count, pb2_bits_count, tex_pb_bits_count; |
326 | 3028 |
3029 copy_context_before_encode(&backup_s, s, -1); | |
456 | 3030 backup_s.pb= s->pb; |
3031 best_s.data_partitioning= s->data_partitioning; | |
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
3032 best_s.partitioned_frame= s->partitioned_frame; |
456 | 3033 if(s->data_partitioning){ |
3034 backup_s.pb2= s->pb2; | |
3035 backup_s.tex_pb= s->tex_pb; | |
3036 } | |
326 | 3037 |
294 | 3038 if(mb_type&MB_TYPE_INTER){ |
327 | 3039 s->mv_dir = MV_DIR_FORWARD; |
295 | 3040 s->mv_type = MV_TYPE_16X16; |
294 | 3041 s->mb_intra= 0; |
324 | 3042 s->mv[0][0][0] = s->p_mv_table[xy][0]; |
3043 s->mv[0][0][1] = s->p_mv_table[xy][1]; | |
456 | 3044 encode_mb_hq(s, &backup_s, &best_s, MB_TYPE_INTER, pb, pb2, tex_pb, |
3045 &dmin, &next_block, s->mv[0][0][0], s->mv[0][0][1]); | |
0 | 3046 } |
326 | 3047 if(mb_type&MB_TYPE_INTER4V){ |
327 | 3048 s->mv_dir = MV_DIR_FORWARD; |
295 | 3049 s->mv_type = MV_TYPE_8X8; |
3050 s->mb_intra= 0; | |
3051 for(i=0; i<4; i++){ | |
3052 s->mv[0][i][0] = s->motion_val[s->block_index[i]][0]; | |
3053 s->mv[0][i][1] = s->motion_val[s->block_index[i]][1]; | |
3054 } | |
456 | 3055 encode_mb_hq(s, &backup_s, &best_s, MB_TYPE_INTER4V, pb, pb2, tex_pb, |
3056 &dmin, &next_block, 0, 0); | |
327 | 3057 } |
3058 if(mb_type&MB_TYPE_FORWARD){ | |
3059 s->mv_dir = MV_DIR_FORWARD; | |
3060 s->mv_type = MV_TYPE_16X16; | |
3061 s->mb_intra= 0; | |
3062 s->mv[0][0][0] = s->b_forw_mv_table[xy][0]; | |
3063 s->mv[0][0][1] = s->b_forw_mv_table[xy][1]; | |
456 | 3064 encode_mb_hq(s, &backup_s, &best_s, MB_TYPE_FORWARD, pb, pb2, tex_pb, |
3065 &dmin, &next_block, s->mv[0][0][0], s->mv[0][0][1]); | |
327 | 3066 } |
3067 if(mb_type&MB_TYPE_BACKWARD){ | |
3068 s->mv_dir = MV_DIR_BACKWARD; | |
3069 s->mv_type = MV_TYPE_16X16; | |
3070 s->mb_intra= 0; | |
3071 s->mv[1][0][0] = s->b_back_mv_table[xy][0]; | |
3072 s->mv[1][0][1] = s->b_back_mv_table[xy][1]; | |
456 | 3073 encode_mb_hq(s, &backup_s, &best_s, MB_TYPE_BACKWARD, pb, pb2, tex_pb, |
3074 &dmin, &next_block, s->mv[1][0][0], s->mv[1][0][1]); | |
327 | 3075 } |
3076 if(mb_type&MB_TYPE_BIDIR){ | |
3077 s->mv_dir = MV_DIR_FORWARD | MV_DIR_BACKWARD; | |
3078 s->mv_type = MV_TYPE_16X16; | |
3079 s->mb_intra= 0; | |
3080 s->mv[0][0][0] = s->b_bidir_forw_mv_table[xy][0]; | |
3081 s->mv[0][0][1] = s->b_bidir_forw_mv_table[xy][1]; | |
3082 s->mv[1][0][0] = s->b_bidir_back_mv_table[xy][0]; | |
3083 s->mv[1][0][1] = s->b_bidir_back_mv_table[xy][1]; | |
456 | 3084 encode_mb_hq(s, &backup_s, &best_s, MB_TYPE_BIDIR, pb, pb2, tex_pb, |
3085 &dmin, &next_block, 0, 0); | |
327 | 3086 } |
3087 if(mb_type&MB_TYPE_DIRECT){ | |
936 | 3088 int mx= s->b_direct_mv_table[xy][0]; |
3089 int my= s->b_direct_mv_table[xy][1]; | |
3090 | |
327 | 3091 s->mv_dir = MV_DIR_FORWARD | MV_DIR_BACKWARD | MV_DIRECT; |
3092 s->mb_intra= 0; | |
936 | 3093 ff_mpeg4_set_direct_mv(s, mx, my); |
456 | 3094 encode_mb_hq(s, &backup_s, &best_s, MB_TYPE_DIRECT, pb, pb2, tex_pb, |
936 | 3095 &dmin, &next_block, mx, my); |
295 | 3096 } |
294 | 3097 if(mb_type&MB_TYPE_INTRA){ |
327 | 3098 s->mv_dir = MV_DIR_FORWARD; |
295 | 3099 s->mv_type = MV_TYPE_16X16; |
294 | 3100 s->mb_intra= 1; |
3101 s->mv[0][0][0] = 0; | |
3102 s->mv[0][0][1] = 0; | |
456 | 3103 encode_mb_hq(s, &backup_s, &best_s, MB_TYPE_INTRA, pb, pb2, tex_pb, |
3104 &dmin, &next_block, 0, 0); | |
326 | 3105 /* force cleaning of ac/dc pred stuff if needed ... */ |
3106 if(s->h263_pred || s->h263_aic) | |
3107 s->mbintra_table[mb_x + mb_y*s->mb_width]=1; | |
295 | 3108 } |
326 | 3109 copy_context_after_encode(s, &best_s, -1); |
456 | 3110 |
3111 pb_bits_count= get_bit_count(&s->pb); | |
3112 flush_put_bits(&s->pb); | |
3113 ff_copy_bits(&backup_s.pb, bit_buf[next_block^1], pb_bits_count); | |
3114 s->pb= backup_s.pb; | |
3115 | |
3116 if(s->data_partitioning){ | |
3117 pb2_bits_count= get_bit_count(&s->pb2); | |
3118 flush_put_bits(&s->pb2); | |
3119 ff_copy_bits(&backup_s.pb2, bit_buf2[next_block^1], pb2_bits_count); | |
3120 s->pb2= backup_s.pb2; | |
3121 | |
3122 tex_pb_bits_count= get_bit_count(&s->tex_pb); | |
3123 flush_put_bits(&s->tex_pb); | |
3124 ff_copy_bits(&backup_s.tex_pb, bit_buf_tex[next_block^1], tex_pb_bits_count); | |
3125 s->tex_pb= backup_s.tex_pb; | |
3126 } | |
329 | 3127 s->last_bits= get_bit_count(&s->pb); |
294 | 3128 } else { |
324 | 3129 int motion_x, motion_y; |
3130 s->mv_type=MV_TYPE_16X16; | |
294 | 3131 // only one MB-Type possible |
327 | 3132 switch(mb_type){ |
3133 case MB_TYPE_INTRA: | |
324 | 3134 s->mv_dir = MV_DIR_FORWARD; |
294 | 3135 s->mb_intra= 1; |
324 | 3136 motion_x= s->mv[0][0][0] = 0; |
3137 motion_y= s->mv[0][0][1] = 0; | |
327 | 3138 break; |
3139 case MB_TYPE_INTER: | |
324 | 3140 s->mv_dir = MV_DIR_FORWARD; |
3141 s->mb_intra= 0; | |
3142 motion_x= s->mv[0][0][0] = s->p_mv_table[xy][0]; | |
3143 motion_y= s->mv[0][0][1] = s->p_mv_table[xy][1]; | |
327 | 3144 break; |
456 | 3145 case MB_TYPE_INTER4V: |
3146 s->mv_dir = MV_DIR_FORWARD; | |
3147 s->mv_type = MV_TYPE_8X8; | |
3148 s->mb_intra= 0; | |
3149 for(i=0; i<4; i++){ | |
3150 s->mv[0][i][0] = s->motion_val[s->block_index[i]][0]; | |
3151 s->mv[0][i][1] = s->motion_val[s->block_index[i]][1]; | |
3152 } | |
3153 motion_x= motion_y= 0; | |
3154 break; | |
327 | 3155 case MB_TYPE_DIRECT: |
324 | 3156 s->mv_dir = MV_DIR_FORWARD | MV_DIR_BACKWARD | MV_DIRECT; |
3157 s->mb_intra= 0; | |
327 | 3158 motion_x=s->b_direct_mv_table[xy][0]; |
3159 motion_y=s->b_direct_mv_table[xy][1]; | |
936 | 3160 ff_mpeg4_set_direct_mv(s, motion_x, motion_y); |
327 | 3161 break; |
3162 case MB_TYPE_BIDIR: | |
324 | 3163 s->mv_dir = MV_DIR_FORWARD | MV_DIR_BACKWARD; |
294 | 3164 s->mb_intra= 0; |
324 | 3165 motion_x=0; |
3166 motion_y=0; | |
3167 s->mv[0][0][0] = s->b_bidir_forw_mv_table[xy][0]; | |
3168 s->mv[0][0][1] = s->b_bidir_forw_mv_table[xy][1]; | |
3169 s->mv[1][0][0] = s->b_bidir_back_mv_table[xy][0]; | |
3170 s->mv[1][0][1] = s->b_bidir_back_mv_table[xy][1]; | |
327 | 3171 break; |
3172 case MB_TYPE_BACKWARD: | |
324 | 3173 s->mv_dir = MV_DIR_BACKWARD; |
3174 s->mb_intra= 0; | |
3175 motion_x= s->mv[1][0][0] = s->b_back_mv_table[xy][0]; | |
3176 motion_y= s->mv[1][0][1] = s->b_back_mv_table[xy][1]; | |
327 | 3177 break; |
3178 case MB_TYPE_FORWARD: | |
324 | 3179 s->mv_dir = MV_DIR_FORWARD; |
3180 s->mb_intra= 0; | |
3181 motion_x= s->mv[0][0][0] = s->b_forw_mv_table[xy][0]; | |
3182 motion_y= s->mv[0][0][1] = s->b_forw_mv_table[xy][1]; | |
3183 // printf(" %d %d ", motion_x, motion_y); | |
327 | 3184 break; |
3185 default: | |
324 | 3186 motion_x=motion_y=0; //gcc warning fix |
3187 printf("illegal MB type\n"); | |
294 | 3188 } |
324 | 3189 encode_mb(s, motion_x, motion_y); |
248
56ee684c48bb
- H.263+ decoder support for Advanded INTRA Coding (buggy)
pulento
parents:
244
diff
changeset
|
3190 } |
327 | 3191 /* clean the MV table in IPS frames for direct mode in B frames */ |
3192 if(s->mb_intra /* && I,P,S_TYPE */){ | |
3193 s->p_mv_table[xy][0]=0; | |
3194 s->p_mv_table[xy][1]=0; | |
3195 } | |
0 | 3196 |
13
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3197 MPV_decode_mb(s, s->block); |
909
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3198 |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3199 if(s->flags&CODEC_FLAG_PSNR){ |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3200 int w= 16; |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3201 int h= 16; |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3202 |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3203 if(s->mb_x*16 + 16 > s->width ) w= s->width - s->mb_x*16; |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3204 if(s->mb_y*16 + 16 > s->height) h= s->height- s->mb_y*16; |
936 | 3205 |
909
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3206 s->current_picture.error[0] += sse( |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3207 s, |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3208 s->new_picture .data[0] + s->mb_x*16 + s->mb_y*s->linesize*16, |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3209 s->current_picture.data[0] + s->mb_x*16 + s->mb_y*s->linesize*16, |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3210 w, h, s->linesize); |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3211 s->current_picture.error[1] += sse( |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3212 s, |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3213 s->new_picture .data[1] + s->mb_x*8 + s->mb_y*s->uvlinesize*8, |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3214 s->current_picture.data[1] + s->mb_x*8 + s->mb_y*s->uvlinesize*8, |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3215 w>>1, h>>1, s->uvlinesize); |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3216 s->current_picture.error[2] += sse( |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3217 s, |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3218 s->new_picture .data[2] + s->mb_x*8 + s->mb_y*s->uvlinesize*8, |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3219 s->current_picture.data[2] + s->mb_x*8 + s->mb_y*s->uvlinesize*8, |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3220 w>>1, h>>1, s->uvlinesize); |
8ae1e4c24e91
new PSNR code (now works with chroma, b frames, ...)
michaelni
parents:
903
diff
changeset
|
3221 } |
456 | 3222 //printf("MB %d %d bits\n", s->mb_x+s->mb_y*s->mb_width, get_bit_count(&s->pb)); |
0 | 3223 } |
234
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
233
diff
changeset
|
3224 |
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
233
diff
changeset
|
3225 |
766 | 3226 /* Obtain average mb_row size for RTP */ |
231 | 3227 if (s->rtp_mode) { |
766 | 3228 if (mb_y==0) |
234
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
233
diff
changeset
|
3229 s->mb_line_avgsize = pbBufPtr(&s->pb) - s->ptr_last_mb_line; |
766 | 3230 else { |
234
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
233
diff
changeset
|
3231 s->mb_line_avgsize = (s->mb_line_avgsize + pbBufPtr(&s->pb) - s->ptr_last_mb_line) >> 1; |
231 | 3232 } |
766 | 3233 s->ptr_last_mb_line = pbBufPtr(&s->pb); |
231 | 3234 } |
0 | 3235 } |
294 | 3236 emms_c(); |
286 | 3237 |
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
731
diff
changeset
|
3238 if(s->codec_id==CODEC_ID_MPEG4 && s->partitioned_frame) |
456 | 3239 ff_mpeg4_merge_partitions(s); |
3240 | |
3241 if (s->msmpeg4_version && s->msmpeg4_version<4 && s->pict_type == I_TYPE) | |
208 | 3242 msmpeg4_encode_ext_header(s); |
3243 | |
456 | 3244 if(s->codec_id==CODEC_ID_MPEG4) |
3245 ff_mpeg4_stuffing(&s->pb); | |
3246 | |
162 | 3247 //if (s->gob_number) |
3248 // fprintf(stderr,"\nNumber of GOB: %d", s->gob_number); | |
231 | 3249 |
3250 /* Send the last GOB if RTP */ | |
3251 if (s->rtp_mode) { | |
3252 flush_put_bits(&s->pb); | |
234
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
233
diff
changeset
|
3253 pdif = pbBufPtr(&s->pb) - s->ptr_lastgob; |
231 | 3254 /* Call the RTP callback to send the last GOB */ |
3255 if (s->rtp_callback) | |
3256 s->rtp_callback(s->ptr_lastgob, pdif, s->gob_number); | |
234
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
233
diff
changeset
|
3257 s->ptr_lastgob = pbBufPtr(&s->pb); |
231 | 3258 //fprintf(stderr,"\nGOB: %2d size: %d (last)", s->gob_number, pdif); |
3259 } | |
0 | 3260 } |
3261 | |
945 | 3262 static int dct_quantize_trellis_c(MpegEncContext *s, |
3263 DCTELEM *block, int n, | |
3264 int qscale, int *overflow){ | |
3265 const int *qmat; | |
3266 const UINT8 *scantable= s->intra_scantable.scantable; | |
3267 int max=0; | |
3268 unsigned int threshold1, threshold2; | |
3269 int bias=0; | |
3270 int run_tab[65]; | |
3271 int last_run[65]; | |
3272 int level_tab[65]; | |
3273 int last_level[65]; | |
3274 int score_tab[65]; | |
3275 int last_score[65]; | |
3276 int coeff[4][64]; | |
3277 int coeff_count[64]; | |
3278 int lambda, qmul, qadd, start_i, best_i, best_score, last_non_zero, i; | |
3279 const int esc_length= s->ac_esc_length; | |
3280 uint8_t * length; | |
3281 uint8_t * last_length; | |
3282 | |
3283 s->fdct (block); | |
3284 | |
3285 qmul= qscale*16; | |
3286 qadd= ((qscale-1)|1)*8; | |
3287 | |
3288 if (s->mb_intra) { | |
3289 int q; | |
3290 if (!s->h263_aic) { | |
3291 if (n < 4) | |
3292 q = s->y_dc_scale; | |
3293 else | |
3294 q = s->c_dc_scale; | |
3295 q = q << 3; | |
3296 } else{ | |
3297 /* For AIC we skip quant/dequant of INTRADC */ | |
3298 q = 1 << 3; | |
3299 qadd=0; | |
3300 } | |
3301 | |
3302 /* note: block[0] is assumed to be positive */ | |
3303 block[0] = (block[0] + (q >> 1)) / q; | |
3304 start_i = 1; | |
3305 last_non_zero = 0; | |
3306 qmat = s->q_intra_matrix[qscale]; | |
3307 if(s->mpeg_quant) | |
3308 bias= 1<<(QMAT_SHIFT-1); | |
3309 length = s->intra_ac_vlc_length; | |
3310 last_length= s->intra_ac_vlc_last_length; | |
3311 } else { | |
3312 start_i = 0; | |
3313 last_non_zero = -1; | |
3314 qmat = s->q_inter_matrix[qscale]; | |
3315 length = s->inter_ac_vlc_length; | |
3316 last_length= s->inter_ac_vlc_last_length; | |
3317 } | |
3318 | |
3319 threshold1= (1<<QMAT_SHIFT) - bias - 1; | |
3320 threshold2= (threshold1<<1); | |
3321 //printf("%d %d %d\n", qmat[1], QMAT_SHIFT, qscale); | |
3322 for(i=start_i; i<64; i++) { | |
3323 const int j = scantable[i]; | |
3324 const int k= i-start_i; | |
3325 int level = block[j]; | |
3326 level = level * qmat[j]; | |
3327 | |
3328 // if( bias+level >= (1<<(QMAT_SHIFT - 3)) | |
3329 // || bias-level >= (1<<(QMAT_SHIFT - 3))){ | |
3330 if(((unsigned)(level+threshold1))>threshold2){ | |
3331 if(level>0){ | |
3332 level= (bias + level)>>QMAT_SHIFT; | |
3333 coeff[0][k]= level; | |
3334 coeff[1][k]= level-1; | |
3335 coeff[2][k]= level-2; | |
3336 coeff[3][k]= level-3; | |
3337 coeff_count[k]= FFMIN(level, 4); | |
3338 }else{ | |
3339 level= (bias - level)>>QMAT_SHIFT; | |
3340 coeff[0][k]= -level; | |
3341 coeff[1][k]= -level+1; | |
3342 coeff[2][k]= -level+2; | |
3343 coeff[3][k]= -level+3; | |
3344 coeff_count[k]= FFMIN(level, 4); | |
3345 } | |
3346 max |=level; | |
3347 last_non_zero = i; | |
3348 }else{ | |
3349 if(level < 0) | |
3350 coeff[0][k]= -1; | |
3351 else | |
3352 coeff[0][k]= 1; | |
3353 coeff_count[k]= 1; | |
3354 } | |
3355 } | |
3356 | |
3357 *overflow= s->max_qcoeff < max; //overflow might have happend | |
3358 | |
3359 if(last_non_zero < start_i){ | |
3360 memset(block + start_i, 0, (64-start_i)*sizeof(DCTELEM)); | |
3361 return last_non_zero; | |
3362 } | |
3363 | |
3364 lambda= (qscale*qscale*64*82 + 50)/100; //FIXME finetune | |
3365 | |
3366 score_tab[0]= | |
3367 last_score[0]= 0; | |
3368 //printf("qscale:%d\n", qscale); | |
3369 for(i=0; i<=last_non_zero - start_i; i++){ | |
3370 int level_index, run, j; | |
3371 const int dct_coeff= block[ scantable[i + start_i] ]; | |
3372 const int zero_distoration= dct_coeff*dct_coeff; | |
3373 int best_score=256*256*256*120, best_last_score= 256*256*256*120; | |
3374 | |
3375 //printf("%2d %5d ", i, dct_coeff); | |
3376 | |
3377 for(level_index=0; level_index < coeff_count[i]; level_index++){ | |
3378 int distoration; | |
3379 int level= coeff[level_index][i]; | |
3380 int unquant_coeff; | |
3381 | |
3382 assert(level); | |
3383 | |
3384 if(s->out_format == FMT_H263){ | |
3385 if(level>0){ | |
3386 unquant_coeff= level*qmul + qadd; | |
3387 }else{ | |
3388 unquant_coeff= level*qmul - qadd; | |
3389 } | |
3390 } //FIXME else | |
3391 //printf("(%d %d) ", level, unquant_coeff); | |
3392 distoration= (unquant_coeff - dct_coeff) * (unquant_coeff - dct_coeff); | |
3393 | |
3394 level+=64; | |
3395 if((level&(~127)) == 0){ | |
3396 for(run=0; run<=i; run++){ | |
3397 int score= distoration + length[UNI_ENC_INDEX(run, level)]*lambda; | |
3398 score += score_tab[i-run]; | |
3399 | |
3400 if(score < best_score){ | |
3401 best_score= | |
3402 score_tab[i+1]= score; | |
3403 run_tab[i+1]= run; | |
3404 level_tab[i+1]= level-64; | |
3405 } | |
3406 } | |
3407 | |
3408 if(s->out_format == FMT_H263){ | |
3409 for(run=0; run<=i; run++){ | |
3410 int score= distoration + last_length[UNI_ENC_INDEX(run, level)]*lambda; | |
3411 score += score_tab[i-run]; | |
3412 if(score < best_last_score){ | |
3413 best_last_score= | |
3414 last_score[i+1]= score; | |
3415 last_run[i+1]= run; | |
3416 last_level[i+1]= level-64; | |
3417 } | |
3418 } | |
3419 } | |
3420 }else{ | |
3421 distoration += esc_length*lambda; | |
3422 for(run=0; run<=i; run++){ | |
3423 int score= distoration + score_tab[i-run]; | |
3424 | |
3425 if(score < best_score){ | |
3426 best_score= | |
3427 score_tab[i+1]= score; | |
3428 run_tab[i+1]= run; | |
3429 level_tab[i+1]= level-64; | |
3430 } | |
3431 } | |
3432 | |
3433 if(s->out_format == FMT_H263){ | |
3434 for(run=0; run<=i; run++){ | |
3435 int score= distoration + score_tab[i-run]; | |
3436 if(score < best_last_score){ | |
3437 best_last_score= | |
3438 last_score[i+1]= score; | |
3439 last_run[i+1]= run; | |
3440 last_level[i+1]= level-64; | |
3441 } | |
3442 } | |
3443 } | |
3444 } | |
3445 } | |
3446 | |
3447 for(j=0; j<=i; j++){ | |
3448 score_tab[j] += zero_distoration; | |
3449 // printf("%6d ", score_tab[j]); | |
3450 } | |
3451 // printf("%6d ", score_tab[j]); | |
3452 | |
3453 // printf("last: "); | |
3454 if(s->out_format == FMT_H263){ | |
3455 for(j=0; j<=i; j++){ | |
3456 last_score[j] += zero_distoration; | |
3457 // printf("%6d ", last_score[j]); | |
3458 } | |
3459 // printf("%6d ", last_score[j]); | |
3460 } | |
3461 // printf("\n"); | |
3462 } | |
3463 | |
3464 if(s->out_format != FMT_H263){ | |
3465 for(i=0; i<=last_non_zero - start_i + 1; i++){ | |
3466 last_score[i]= score_tab[i]; | |
3467 if(i) last_score[i] += lambda*2; //FIXME exacter? | |
3468 last_run[i]= run_tab[i]; | |
3469 last_level[i]= level_tab[i]; | |
3470 } | |
3471 } | |
3472 | |
3473 //FIXME add some cbp penalty | |
3474 best_i= 0; | |
3475 best_score= 256*256*256*120; | |
3476 for(i=0; i<=last_non_zero - start_i + 1; i++){ | |
3477 int score= last_score[i]; | |
3478 if(score < best_score){ | |
3479 best_score= score; | |
3480 best_i= i; | |
3481 } | |
3482 } | |
3483 | |
3484 last_non_zero= best_i - 1 + start_i; | |
3485 memset(block + start_i, 0, (64-start_i)*sizeof(DCTELEM)); | |
3486 | |
3487 if(last_non_zero < start_i) | |
3488 return last_non_zero; | |
3489 | |
3490 i= best_i; | |
3491 //printf("%d %d %d %d %d\n", last_level[i], i, start_i, last_non_zero, best_score); | |
3492 assert(last_level[i]); | |
3493 //FIXME use permutated scantable | |
3494 block[ s->idct_permutation[ scantable[last_non_zero] ] ]= last_level[i]; | |
3495 i -= last_run[i] + 1; | |
3496 | |
3497 for(;i>0 ; i -= run_tab[i] + 1){ | |
3498 const int j= s->idct_permutation[ scantable[i - 1 + start_i] ]; | |
3499 | |
3500 block[j]= level_tab[i]; | |
3501 assert(block[j]); | |
3502 } | |
3503 | |
3504 return last_non_zero; | |
3505 } | |
3506 | |
220 | 3507 static int dct_quantize_c(MpegEncContext *s, |
0 | 3508 DCTELEM *block, int n, |
344 | 3509 int qscale, int *overflow) |
0 | 3510 { |
3511 int i, j, level, last_non_zero, q; | |
3512 const int *qmat; | |
764 | 3513 const UINT8 *scantable= s->intra_scantable.scantable; |
344 | 3514 int bias; |
3515 int max=0; | |
3516 unsigned int threshold1, threshold2; | |
828
ace3ccd18dd2
Altivec Patch (Mark III) by (Dieter Shirley <dieters at schemasoft dot com>)
michaelni
parents:
815
diff
changeset
|
3517 |
625
bb6a69f9d409
slow but accurate integer dct from IJG (should be ok with the LGPL as the old DCT is the fast integer DCT from IJG)
michaelni
parents:
619
diff
changeset
|
3518 s->fdct (block); |
0 | 3519 |
3520 if (s->mb_intra) { | |
350
6ebbecc10063
- Advanced Intra Coding (AIC) support for H.263+ encoder, just DC by now.
pulento
parents:
347
diff
changeset
|
3521 if (!s->h263_aic) { |
6ebbecc10063
- Advanced Intra Coding (AIC) support for H.263+ encoder, just DC by now.
pulento
parents:
347
diff
changeset
|
3522 if (n < 4) |
6ebbecc10063
- Advanced Intra Coding (AIC) support for H.263+ encoder, just DC by now.
pulento
parents:
347
diff
changeset
|
3523 q = s->y_dc_scale; |
6ebbecc10063
- Advanced Intra Coding (AIC) support for H.263+ encoder, just DC by now.
pulento
parents:
347
diff
changeset
|
3524 else |
6ebbecc10063
- Advanced Intra Coding (AIC) support for H.263+ encoder, just DC by now.
pulento
parents:
347
diff
changeset
|
3525 q = s->c_dc_scale; |
6ebbecc10063
- Advanced Intra Coding (AIC) support for H.263+ encoder, just DC by now.
pulento
parents:
347
diff
changeset
|
3526 q = q << 3; |
6ebbecc10063
- Advanced Intra Coding (AIC) support for H.263+ encoder, just DC by now.
pulento
parents:
347
diff
changeset
|
3527 } else |
6ebbecc10063
- Advanced Intra Coding (AIC) support for H.263+ encoder, just DC by now.
pulento
parents:
347
diff
changeset
|
3528 /* For AIC we skip quant/dequant of INTRADC */ |
6ebbecc10063
- Advanced Intra Coding (AIC) support for H.263+ encoder, just DC by now.
pulento
parents:
347
diff
changeset
|
3529 q = 1 << 3; |
6ebbecc10063
- Advanced Intra Coding (AIC) support for H.263+ encoder, just DC by now.
pulento
parents:
347
diff
changeset
|
3530 |
0 | 3531 /* note: block[0] is assumed to be positive */ |
3532 block[0] = (block[0] + (q >> 1)) / q; | |
3533 i = 1; | |
3534 last_non_zero = 0; | |
344 | 3535 qmat = s->q_intra_matrix[qscale]; |
635 | 3536 bias= s->intra_quant_bias<<(QMAT_SHIFT - QUANT_BIAS_SHIFT); |
0 | 3537 } else { |
3538 i = 0; | |
3539 last_non_zero = -1; | |
344 | 3540 qmat = s->q_inter_matrix[qscale]; |
635 | 3541 bias= s->inter_quant_bias<<(QMAT_SHIFT - QUANT_BIAS_SHIFT); |
0 | 3542 } |
635 | 3543 threshold1= (1<<QMAT_SHIFT) - bias - 1; |
3544 threshold2= (threshold1<<1); | |
0 | 3545 |
3546 for(;i<64;i++) { | |
764 | 3547 j = scantable[i]; |
0 | 3548 level = block[j]; |
3549 level = level * qmat[j]; | |
344 | 3550 |
3551 // if( bias+level >= (1<<(QMAT_SHIFT - 3)) | |
3552 // || bias-level >= (1<<(QMAT_SHIFT - 3))){ | |
3553 if(((unsigned)(level+threshold1))>threshold2){ | |
3554 if(level>0){ | |
635 | 3555 level= (bias + level)>>QMAT_SHIFT; |
344 | 3556 block[j]= level; |
3557 }else{ | |
635 | 3558 level= (bias - level)>>QMAT_SHIFT; |
344 | 3559 block[j]= -level; |
0 | 3560 } |
344 | 3561 max |=level; |
0 | 3562 last_non_zero = i; |
344 | 3563 }else{ |
3564 block[j]=0; | |
0 | 3565 } |
3566 } | |
344 | 3567 *overflow= s->max_qcoeff < max; //overflow might have happend |
3568 | |
764 | 3569 /* we need this permutation so that we correct the IDCT, we only permute the !=0 elements */ |
882 | 3570 if (s->idct_permutation_type != FF_NO_IDCT_PERM) |
3571 ff_block_permute(block, s->idct_permutation, scantable, last_non_zero); | |
764 | 3572 |
0 | 3573 return last_non_zero; |
3574 } | |
3575 | |
13
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3576 static void dct_unquantize_mpeg1_c(MpegEncContext *s, |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3577 DCTELEM *block, int n, int qscale) |
0 | 3578 { |
200 | 3579 int i, level, nCoeffs; |
0 | 3580 const UINT16 *quant_matrix; |
3581 | |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
3582 nCoeffs= s->block_last_index[n]; |
200 | 3583 |
0 | 3584 if (s->mb_intra) { |
3585 if (n < 4) | |
3586 block[0] = block[0] * s->y_dc_scale; | |
3587 else | |
3588 block[0] = block[0] * s->c_dc_scale; | |
3589 /* XXX: only mpeg1 */ | |
3590 quant_matrix = s->intra_matrix; | |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
3591 for(i=1;i<=nCoeffs;i++) { |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
3592 int j= s->intra_scantable.permutated[i]; |
200 | 3593 level = block[j]; |
0 | 3594 if (level) { |
3595 if (level < 0) { | |
3596 level = -level; | |
200 | 3597 level = (int)(level * qscale * quant_matrix[j]) >> 3; |
0 | 3598 level = (level - 1) | 1; |
3599 level = -level; | |
3600 } else { | |
200 | 3601 level = (int)(level * qscale * quant_matrix[j]) >> 3; |
0 | 3602 level = (level - 1) | 1; |
3603 } | |
3604 #ifdef PARANOID | |
3605 if (level < -2048 || level > 2047) | |
3606 fprintf(stderr, "unquant error %d %d\n", i, level); | |
3607 #endif | |
200 | 3608 block[j] = level; |
0 | 3609 } |
3610 } | |
3611 } else { | |
3612 i = 0; | |
344 | 3613 quant_matrix = s->inter_matrix; |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
3614 for(;i<=nCoeffs;i++) { |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
3615 int j= s->intra_scantable.permutated[i]; |
200 | 3616 level = block[j]; |
0 | 3617 if (level) { |
3618 if (level < 0) { | |
3619 level = -level; | |
3620 level = (((level << 1) + 1) * qscale * | |
200 | 3621 ((int) (quant_matrix[j]))) >> 4; |
0 | 3622 level = (level - 1) | 1; |
3623 level = -level; | |
3624 } else { | |
3625 level = (((level << 1) + 1) * qscale * | |
200 | 3626 ((int) (quant_matrix[j]))) >> 4; |
0 | 3627 level = (level - 1) | 1; |
3628 } | |
3629 #ifdef PARANOID | |
3630 if (level < -2048 || level > 2047) | |
3631 fprintf(stderr, "unquant error %d %d\n", i, level); | |
3632 #endif | |
200 | 3633 block[j] = level; |
0 | 3634 } |
3635 } | |
3636 } | |
3637 } | |
13
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3638 |
325 | 3639 static void dct_unquantize_mpeg2_c(MpegEncContext *s, |
3640 DCTELEM *block, int n, int qscale) | |
3641 { | |
3642 int i, level, nCoeffs; | |
3643 const UINT16 *quant_matrix; | |
3644 | |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
3645 if(s->alternate_scan) nCoeffs= 63; |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
3646 else nCoeffs= s->block_last_index[n]; |
325 | 3647 |
3648 if (s->mb_intra) { | |
3649 if (n < 4) | |
3650 block[0] = block[0] * s->y_dc_scale; | |
3651 else | |
3652 block[0] = block[0] * s->c_dc_scale; | |
3653 quant_matrix = s->intra_matrix; | |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
3654 for(i=1;i<=nCoeffs;i++) { |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
3655 int j= s->intra_scantable.permutated[i]; |
325 | 3656 level = block[j]; |
3657 if (level) { | |
3658 if (level < 0) { | |
3659 level = -level; | |
3660 level = (int)(level * qscale * quant_matrix[j]) >> 3; | |
3661 level = -level; | |
3662 } else { | |
3663 level = (int)(level * qscale * quant_matrix[j]) >> 3; | |
3664 } | |
3665 #ifdef PARANOID | |
3666 if (level < -2048 || level > 2047) | |
3667 fprintf(stderr, "unquant error %d %d\n", i, level); | |
3668 #endif | |
3669 block[j] = level; | |
3670 } | |
3671 } | |
3672 } else { | |
3673 int sum=-1; | |
3674 i = 0; | |
344 | 3675 quant_matrix = s->inter_matrix; |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
3676 for(;i<=nCoeffs;i++) { |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
3677 int j= s->intra_scantable.permutated[i]; |
325 | 3678 level = block[j]; |
3679 if (level) { | |
3680 if (level < 0) { | |
3681 level = -level; | |
3682 level = (((level << 1) + 1) * qscale * | |
3683 ((int) (quant_matrix[j]))) >> 4; | |
3684 level = -level; | |
3685 } else { | |
3686 level = (((level << 1) + 1) * qscale * | |
3687 ((int) (quant_matrix[j]))) >> 4; | |
3688 } | |
3689 #ifdef PARANOID | |
3690 if (level < -2048 || level > 2047) | |
3691 fprintf(stderr, "unquant error %d %d\n", i, level); | |
3692 #endif | |
3693 block[j] = level; | |
3694 sum+=level; | |
3695 } | |
3696 } | |
3697 block[63]^=sum&1; | |
3698 } | |
3699 } | |
3700 | |
3701 | |
13
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3702 static void dct_unquantize_h263_c(MpegEncContext *s, |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3703 DCTELEM *block, int n, int qscale) |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3704 { |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3705 int i, level, qmul, qadd; |
200 | 3706 int nCoeffs; |
249
42a0b7b16738
- Bug fixes in H.263+ Advanced INTRA Coding decoder.
pulento
parents:
248
diff
changeset
|
3707 |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
3708 assert(s->block_last_index[n]>=0); |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
3709 |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
3710 qadd = (qscale - 1) | 1; |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
3711 qmul = qscale << 1; |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
3712 |
13
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3713 if (s->mb_intra) { |
249
42a0b7b16738
- Bug fixes in H.263+ Advanced INTRA Coding decoder.
pulento
parents:
248
diff
changeset
|
3714 if (!s->h263_aic) { |
42a0b7b16738
- Bug fixes in H.263+ Advanced INTRA Coding decoder.
pulento
parents:
248
diff
changeset
|
3715 if (n < 4) |
42a0b7b16738
- Bug fixes in H.263+ Advanced INTRA Coding decoder.
pulento
parents:
248
diff
changeset
|
3716 block[0] = block[0] * s->y_dc_scale; |
42a0b7b16738
- Bug fixes in H.263+ Advanced INTRA Coding decoder.
pulento
parents:
248
diff
changeset
|
3717 else |
42a0b7b16738
- Bug fixes in H.263+ Advanced INTRA Coding decoder.
pulento
parents:
248
diff
changeset
|
3718 block[0] = block[0] * s->c_dc_scale; |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
3719 }else |
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
3720 qadd = 0; |
13
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3721 i = 1; |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
3722 nCoeffs= 63; //does not allways use zigzag table |
13
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3723 } else { |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3724 i = 0; |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
3725 nCoeffs= s->intra_scantable.raster_end[ s->block_last_index[n] ]; |
13
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3726 } |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3727 |
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
704
diff
changeset
|
3728 for(;i<=nCoeffs;i++) { |
13
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3729 level = block[i]; |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3730 if (level) { |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3731 if (level < 0) { |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3732 level = level * qmul - qadd; |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3733 } else { |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3734 level = level * qmul + qadd; |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3735 } |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3736 #ifdef PARANOID |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3737 if (level < -2048 || level > 2047) |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3738 fprintf(stderr, "unquant error %d %d\n", i, level); |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3739 #endif |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3740 block[i] = level; |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3741 } |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3742 } |
174ef88f619a
use block[] in structure to have it aligned on 8 bytes for mmx optimizations - dct_unquantize is always a function pointer - added specialized dct_unquantize_h263
glantau
parents:
8
diff
changeset
|
3743 } |
0 | 3744 |
930 | 3745 char ff_get_pict_type_char(int pict_type){ |
3746 switch(pict_type){ | |
3747 case I_TYPE: return 'I'; | |
3748 case P_TYPE: return 'P'; | |
3749 case B_TYPE: return 'B'; | |
3750 case S_TYPE: return 'S'; | |
936 | 3751 default: return '?'; |
930 | 3752 } |
3753 } | |
3754 | |
0 | 3755 AVCodec mpeg1video_encoder = { |
3756 "mpeg1video", | |
3757 CODEC_TYPE_VIDEO, | |
3758 CODEC_ID_MPEG1VIDEO, | |
3759 sizeof(MpegEncContext), | |
3760 MPV_encode_init, | |
3761 MPV_encode_picture, | |
3762 MPV_encode_end, | |
3763 }; | |
3764 | |
3765 AVCodec h263_encoder = { | |
3766 "h263", | |
3767 CODEC_TYPE_VIDEO, | |
3768 CODEC_ID_H263, | |
3769 sizeof(MpegEncContext), | |
3770 MPV_encode_init, | |
3771 MPV_encode_picture, | |
3772 MPV_encode_end, | |
3773 }; | |
3774 | |
3775 AVCodec h263p_encoder = { | |
3776 "h263p", | |
3777 CODEC_TYPE_VIDEO, | |
3778 CODEC_ID_H263P, | |
3779 sizeof(MpegEncContext), | |
3780 MPV_encode_init, | |
3781 MPV_encode_picture, | |
3782 MPV_encode_end, | |
3783 }; | |
3784 | |
3785 AVCodec rv10_encoder = { | |
3786 "rv10", | |
3787 CODEC_TYPE_VIDEO, | |
3788 CODEC_ID_RV10, | |
3789 sizeof(MpegEncContext), | |
3790 MPV_encode_init, | |
3791 MPV_encode_picture, | |
3792 MPV_encode_end, | |
3793 }; | |
3794 | |
3795 AVCodec mjpeg_encoder = { | |
3796 "mjpeg", | |
3797 CODEC_TYPE_VIDEO, | |
3798 CODEC_ID_MJPEG, | |
3799 sizeof(MpegEncContext), | |
3800 MPV_encode_init, | |
3801 MPV_encode_picture, | |
3802 MPV_encode_end, | |
3803 }; | |
3804 | |
71 | 3805 AVCodec mpeg4_encoder = { |
3806 "mpeg4", | |
0 | 3807 CODEC_TYPE_VIDEO, |
71 | 3808 CODEC_ID_MPEG4, |
0 | 3809 sizeof(MpegEncContext), |
3810 MPV_encode_init, | |
3811 MPV_encode_picture, | |
3812 MPV_encode_end, | |
3813 }; | |
3814 | |
307 | 3815 AVCodec msmpeg4v1_encoder = { |
3816 "msmpeg4v1", | |
0 | 3817 CODEC_TYPE_VIDEO, |
307 | 3818 CODEC_ID_MSMPEG4V1, |
0 | 3819 sizeof(MpegEncContext), |
3820 MPV_encode_init, | |
3821 MPV_encode_picture, | |
3822 MPV_encode_end, | |
3823 }; | |
307 | 3824 |
3825 AVCodec msmpeg4v2_encoder = { | |
3826 "msmpeg4v2", | |
3827 CODEC_TYPE_VIDEO, | |
3828 CODEC_ID_MSMPEG4V2, | |
3829 sizeof(MpegEncContext), | |
3830 MPV_encode_init, | |
3831 MPV_encode_picture, | |
3832 MPV_encode_end, | |
3833 }; | |
3834 | |
3835 AVCodec msmpeg4v3_encoder = { | |
3836 "msmpeg4", | |
3837 CODEC_TYPE_VIDEO, | |
3838 CODEC_ID_MSMPEG4V3, | |
3839 sizeof(MpegEncContext), | |
3840 MPV_encode_init, | |
3841 MPV_encode_picture, | |
3842 MPV_encode_end, | |
3843 }; | |
499 | 3844 |
3845 AVCodec wmv1_encoder = { | |
3846 "wmv1", | |
3847 CODEC_TYPE_VIDEO, | |
3848 CODEC_ID_WMV1, | |
3849 sizeof(MpegEncContext), | |
3850 MPV_encode_init, | |
3851 MPV_encode_picture, | |
3852 MPV_encode_end, | |
3853 }; | |
3854 |