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"
38 #include "mpegvideodata.h"
40 #include "libavutil/imgutils.h"
43 * You can also call this codec: MPEG-4 with a twist!
46 * - (encoding) select best mv table (two choices)
47 * - (encoding) select best vlc/dc table
50 /* This table is practically identical to the one from H.263
51 * except that it is inverted. */
52 static av_cold void init_h263_dc_for_msmpeg4(void)
54 int level, uni_code, uni_len;
56 if(ff_v2_dc_chroma_table[255 + 256][1])
59 for(level=-256; level<256; level++){
61 /* find number of bits */
70 l= (-level) ^ ((1 << size) - 1);
75 uni_code= ff_mpeg4_DCtab_lum[size][0];
76 uni_len = ff_mpeg4_DCtab_lum[size][1];
77 uni_code ^= (1<<uni_len)-1; //M$ does not like compatibility
80 uni_code<<=size; uni_code|=l;
83 uni_code<<=1; uni_code|=1;
87 ff_v2_dc_lum_table[level + 256][0] = uni_code;
88 ff_v2_dc_lum_table[level + 256][1] = uni_len;
90 /* chrominance H.263 */
91 uni_code= ff_mpeg4_DCtab_chrom[size][0];
92 uni_len = ff_mpeg4_DCtab_chrom[size][1];
93 uni_code ^= (1<<uni_len)-1; //M$ does not like compatibility
96 uni_code<<=size; uni_code|=l;
99 uni_code<<=1; uni_code|=1;
103 ff_v2_dc_chroma_table[level + 256][0] = uni_code;
104 ff_v2_dc_chroma_table[level + 256][1] = uni_len;
109 av_cold void ff_msmpeg4_common_init(MpegEncContext *s)
111 switch(s->msmpeg4_version){
115 s->c_dc_scale_table= ff_mpeg1_dc_scale_table;
118 if(s->workaround_bugs){
119 s->y_dc_scale_table= ff_old_ff_y_dc_scale_table;
120 s->c_dc_scale_table= ff_wmv1_c_dc_scale_table;
122 s->y_dc_scale_table= ff_mpeg4_y_dc_scale_table;
123 s->c_dc_scale_table= ff_mpeg4_c_dc_scale_table;
128 s->y_dc_scale_table= ff_wmv1_y_dc_scale_table;
129 s->c_dc_scale_table= ff_wmv1_c_dc_scale_table;
131 #if CONFIG_VC1_DECODER
133 s->y_dc_scale_table= ff_wmv3_dc_scale_table;
134 s->c_dc_scale_table= ff_wmv3_dc_scale_table;
141 if(s->msmpeg4_version>=4){
142 ff_init_scantable(s->idsp.idct_permutation, &s->intra_scantable, ff_wmv1_scantable[1]);
143 ff_init_scantable(s->idsp.idct_permutation, &s->intra_h_scantable, ff_wmv1_scantable[2]);
144 ff_init_scantable(s->idsp.idct_permutation, &s->intra_v_scantable, ff_wmv1_scantable[3]);
145 ff_init_scantable(s->idsp.idct_permutation, &s->inter_scantable, ff_wmv1_scantable[0]);
147 //Note the default tables are set in common_init in mpegvideo.c
149 init_h263_dc_for_msmpeg4();
152 /* predict coded block */
153 int ff_msmpeg4_coded_block_pred(MpegEncContext * s, int n, uint8_t **coded_block_ptr)
155 int xy, wrap, pred, a, b, c;
157 xy = s->block_index[n];
163 a = s->coded_block[xy - 1 ];
164 b = s->coded_block[xy - 1 - wrap];
165 c = s->coded_block[xy - wrap];
174 *coded_block_ptr = &s->coded_block[xy];
179 static int get_dc(uint8_t *src, int stride, int scale, int block_size)
183 for(y=0; y<block_size; y++){
185 for(x=0; x<block_size; x++){
186 sum+=src[x + y*stride];
189 return FASTDIV((sum + (scale>>1)), scale);
192 /* dir = 0: left, dir = 1: top prediction */
193 int ff_msmpeg4_pred_dc(MpegEncContext *s, int n,
194 int16_t **dc_val_ptr, int *dir_ptr)
196 int a, b, c, wrap, pred, scale;
199 /* find prediction */
201 scale = s->y_dc_scale;
203 scale = s->c_dc_scale;
206 wrap = s->block_wrap[n];
207 dc_val= s->dc_val[0] + s->block_index[n];
213 b = dc_val[ - 1 - wrap];
216 if(s->first_slice_line && (n&2)==0 && s->msmpeg4_version<4){
220 /* XXX: the following solution consumes divisions, but it does not
221 necessitate to modify mpegvideo.c. The problem comes from the
222 fact they decided to store the quantized DC (which would lead
223 to problems if Q could vary !) */
224 #if ARCH_X86 && HAVE_7REGS && HAVE_EBX_AVAILABLE
226 "movl %3, %%eax \n\t"
227 "shrl $1, %%eax \n\t"
228 "addl %%eax, %2 \n\t"
229 "addl %%eax, %1 \n\t"
230 "addl %0, %%eax \n\t"
232 "movl %%edx, %0 \n\t"
233 "movl %1, %%eax \n\t"
235 "movl %%edx, %1 \n\t"
236 "movl %2, %%eax \n\t"
238 "movl %%edx, %2 \n\t"
239 : "+b" (a), "+c" (b), "+D" (c)
240 : "g" (scale), "S" (ff_inverse[scale])
244 /* Divisions are costly everywhere; optimize the most common case. */
246 a = (a + (8 >> 1)) / 8;
247 b = (b + (8 >> 1)) / 8;
248 c = (c + (8 >> 1)) / 8;
250 a = FASTDIV((a + (scale >> 1)), scale);
251 b = FASTDIV((b + (scale >> 1)), scale);
252 c = FASTDIV((c + (scale >> 1)), scale);
255 /* XXX: WARNING: they did not choose the same test as MPEG-4. This
256 is very important ! */
257 if(s->msmpeg4_version>3){
258 if(s->inter_intra_pred){
269 if (abs(a - b) < abs(b - c)) {
277 int bs = 8 >> s->avctx->lowres;
280 dest= s->current_picture.f->data[0] + (((n >> 1) + 2*s->mb_y) * bs* wrap ) + ((n & 1) + 2*s->mb_x) * bs;
283 dest= s->current_picture.f->data[n - 3] + (s->mb_y * bs * wrap) + s->mb_x * bs;
285 if(s->mb_x==0) a= (1024 + (scale>>1))/scale;
286 else a= get_dc(dest-bs, wrap, scale*8>>(2*s->avctx->lowres), bs);
287 if(s->mb_y==0) c= (1024 + (scale>>1))/scale;
288 else c= get_dc(dest-bs*wrap, wrap, scale*8>>(2*s->avctx->lowres), bs);
290 if (s->h263_aic_dir==0) {
293 }else if (s->h263_aic_dir==1) {
301 }else if (s->h263_aic_dir==2) {
315 if (abs(a - b) < abs(b - c)) {
324 if (abs(a - b) <= abs(b - c)) {
333 /* update predictor */
334 *dc_val_ptr = &dc_val[0];