2 * MSMPEG4 backend for encoder and decoder
3 * Copyright (c) 2001 Fabrice Bellard
4 * Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at>
6 * msmpeg4v1 & v2 stuff by Michael Niedermayer <michaelni@gmx.at>
8 * This file is part of FFmpeg.
10 * FFmpeg is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU Lesser General Public
12 * License as published by the Free Software Foundation; either
13 * version 2.1 of the License, or (at your option) any later version.
15 * FFmpeg is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 * Lesser General Public License for more details.
20 * You should have received a copy of the GNU Lesser General Public
21 * License along with FFmpeg; if not, write to the Free Software
22 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
27 * MSMPEG4 backend for encoder and decoder
32 #include "mpegvideo.h"
34 #include "libavutil/x86/asm.h"
36 #include "mpeg4video.h"
37 #include "msmpeg4data.h"
39 #include "libavutil/imgutils.h"
42 * You can also call this codec : MPEG4 with a twist !
45 * - (encoding) select best mv table (two choices)
46 * - (encoding) select best vlc/dc table
49 /* This table is practically identical to the one from h263
50 * except that it is inverted. */
51 static av_cold void init_h263_dc_for_msmpeg4(void)
53 int level, uni_code, uni_len;
55 if(ff_v2_dc_chroma_table[255 + 256][1])
58 for(level=-256; level<256; level++){
60 /* find number of bits */
69 l= (-level) ^ ((1 << size) - 1);
74 uni_code= ff_mpeg4_DCtab_lum[size][0];
75 uni_len = ff_mpeg4_DCtab_lum[size][1];
76 uni_code ^= (1<<uni_len)-1; //M$ does not like compatibility
79 uni_code<<=size; uni_code|=l;
82 uni_code<<=1; uni_code|=1;
86 ff_v2_dc_lum_table[level + 256][0] = uni_code;
87 ff_v2_dc_lum_table[level + 256][1] = uni_len;
89 /* chrominance h263 */
90 uni_code= ff_mpeg4_DCtab_chrom[size][0];
91 uni_len = ff_mpeg4_DCtab_chrom[size][1];
92 uni_code ^= (1<<uni_len)-1; //M$ does not like compatibility
95 uni_code<<=size; uni_code|=l;
98 uni_code<<=1; uni_code|=1;
102 ff_v2_dc_chroma_table[level + 256][0] = uni_code;
103 ff_v2_dc_chroma_table[level + 256][1] = uni_len;
108 av_cold void ff_msmpeg4_common_init(MpegEncContext *s)
110 switch(s->msmpeg4_version){
114 s->c_dc_scale_table= ff_mpeg1_dc_scale_table;
117 if(s->workaround_bugs){
118 s->y_dc_scale_table= ff_old_ff_y_dc_scale_table;
119 s->c_dc_scale_table= ff_wmv1_c_dc_scale_table;
121 s->y_dc_scale_table= ff_mpeg4_y_dc_scale_table;
122 s->c_dc_scale_table= ff_mpeg4_c_dc_scale_table;
127 s->y_dc_scale_table= ff_wmv1_y_dc_scale_table;
128 s->c_dc_scale_table= ff_wmv1_c_dc_scale_table;
130 #if CONFIG_VC1_DECODER
132 s->y_dc_scale_table= ff_wmv3_dc_scale_table;
133 s->c_dc_scale_table= ff_wmv3_dc_scale_table;
140 if(s->msmpeg4_version>=4){
141 ff_init_scantable(s->dsp.idct_permutation, &s->intra_scantable , ff_wmv1_scantable[1]);
142 ff_init_scantable(s->dsp.idct_permutation, &s->intra_h_scantable, ff_wmv1_scantable[2]);
143 ff_init_scantable(s->dsp.idct_permutation, &s->intra_v_scantable, ff_wmv1_scantable[3]);
144 ff_init_scantable(s->dsp.idct_permutation, &s->inter_scantable , ff_wmv1_scantable[0]);
146 //Note the default tables are set in common_init in mpegvideo.c
148 init_h263_dc_for_msmpeg4();
151 /* predict coded block */
152 int ff_msmpeg4_coded_block_pred(MpegEncContext * s, int n, uint8_t **coded_block_ptr)
154 int xy, wrap, pred, a, b, c;
156 xy = s->block_index[n];
162 a = s->coded_block[xy - 1 ];
163 b = s->coded_block[xy - 1 - wrap];
164 c = s->coded_block[xy - wrap];
173 *coded_block_ptr = &s->coded_block[xy];
178 static int get_dc(uint8_t *src, int stride, int scale, int block_size)
182 for(y=0; y<block_size; y++){
184 for(x=0; x<block_size; x++){
185 sum+=src[x + y*stride];
188 return FASTDIV((sum + (scale>>1)), scale);
191 /* dir = 0: left, dir = 1: top prediction */
192 int ff_msmpeg4_pred_dc(MpegEncContext *s, int n,
193 int16_t **dc_val_ptr, int *dir_ptr)
195 int a, b, c, wrap, pred, scale;
198 /* find prediction */
200 scale = s->y_dc_scale;
202 scale = s->c_dc_scale;
205 wrap = s->block_wrap[n];
206 dc_val= s->dc_val[0] + s->block_index[n];
212 b = dc_val[ - 1 - wrap];
215 if(s->first_slice_line && (n&2)==0 && s->msmpeg4_version<4){
219 /* XXX: the following solution consumes divisions, but it does not
220 necessitate to modify mpegvideo.c. The problem comes from the
221 fact they decided to store the quantized DC (which would lead
222 to problems if Q could vary !) */
223 #if ARCH_X86 && HAVE_7REGS && HAVE_EBX_AVAILABLE
225 "movl %3, %%eax \n\t"
226 "shrl $1, %%eax \n\t"
227 "addl %%eax, %2 \n\t"
228 "addl %%eax, %1 \n\t"
229 "addl %0, %%eax \n\t"
231 "movl %%edx, %0 \n\t"
232 "movl %1, %%eax \n\t"
234 "movl %%edx, %1 \n\t"
235 "movl %2, %%eax \n\t"
237 "movl %%edx, %2 \n\t"
238 : "+b" (a), "+c" (b), "+D" (c)
239 : "g" (scale), "S" (ff_inverse[scale])
243 /* Divisions are costly everywhere; optimize the most common case. */
245 a = (a + (8 >> 1)) / 8;
246 b = (b + (8 >> 1)) / 8;
247 c = (c + (8 >> 1)) / 8;
249 a = FASTDIV((a + (scale >> 1)), scale);
250 b = FASTDIV((b + (scale >> 1)), scale);
251 c = FASTDIV((c + (scale >> 1)), scale);
254 /* XXX: WARNING: they did not choose the same test as MPEG4. This
255 is very important ! */
256 if(s->msmpeg4_version>3){
257 if(s->inter_intra_pred){
268 if (abs(a - b) < abs(b - c)) {
276 int bs = 8 >> s->avctx->lowres;
279 dest= s->current_picture.f.data[0] + (((n >> 1) + 2*s->mb_y) * bs* wrap ) + ((n & 1) + 2*s->mb_x) * bs;
282 dest= s->current_picture.f.data[n - 3] + (s->mb_y * bs * wrap) + s->mb_x * bs;
284 if(s->mb_x==0) a= (1024 + (scale>>1))/scale;
285 else a= get_dc(dest-bs, wrap, scale*8>>(2*s->avctx->lowres), bs);
286 if(s->mb_y==0) c= (1024 + (scale>>1))/scale;
287 else c= get_dc(dest-bs*wrap, wrap, scale*8>>(2*s->avctx->lowres), bs);
289 if (s->h263_aic_dir==0) {
292 }else if (s->h263_aic_dir==1) {
300 }else if (s->h263_aic_dir==2) {
314 if (abs(a - b) < abs(b - c)) {
323 if (abs(a - b) <= abs(b - c)) {
332 /* update predictor */
333 *dc_val_ptr = &dc_val[0];