2001-07-22 14:18:56 +00:00
|
|
|
/*
|
2011-10-30 16:56:57 +00:00
|
|
|
* MSMPEG4 backend for encoder and decoder
|
2009-01-19 15:46:40 +00:00
|
|
|
* Copyright (c) 2001 Fabrice Bellard
|
2004-01-10 16:04:55 +00:00
|
|
|
* Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at>
|
2001-07-22 14:18:56 +00:00
|
|
|
*
|
2007-07-05 10:37:29 +00:00
|
|
|
* msmpeg4v1 & v2 stuff by Michael Niedermayer <michaelni@gmx.at>
|
|
|
|
*
|
2011-03-18 17:35:10 +00:00
|
|
|
* This file is part of Libav.
|
2006-10-07 15:30:46 +00:00
|
|
|
*
|
2011-03-18 17:35:10 +00:00
|
|
|
* Libav is free software; you can redistribute it and/or
|
2002-05-25 22:45:33 +00:00
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
2006-10-07 15:30:46 +00:00
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
2001-07-22 14:18:56 +00:00
|
|
|
*
|
2011-03-18 17:35:10 +00:00
|
|
|
* Libav is distributed in the hope that it will be useful,
|
2001-07-22 14:18:56 +00:00
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
2002-05-25 22:45:33 +00:00
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* Lesser General Public License for more details.
|
2001-07-22 14:18:56 +00:00
|
|
|
*
|
2002-05-25 22:45:33 +00:00
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
2011-03-18 17:35:10 +00:00
|
|
|
* License along with Libav; if not, write to the Free Software
|
2006-01-12 22:43:26 +00:00
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
2001-07-22 14:18:56 +00:00
|
|
|
*/
|
2003-03-06 11:32:04 +00:00
|
|
|
|
|
|
|
/**
|
2010-04-20 14:45:34 +00:00
|
|
|
* @file
|
2011-10-30 16:56:57 +00:00
|
|
|
* MSMPEG4 backend for encoder and decoder
|
2003-03-06 11:32:04 +00:00
|
|
|
*/
|
|
|
|
|
2002-05-18 23:03:29 +00:00
|
|
|
#include "avcodec.h"
|
2001-07-22 14:18:56 +00:00
|
|
|
#include "dsputil.h"
|
|
|
|
#include "mpegvideo.h"
|
2007-11-07 23:41:39 +00:00
|
|
|
#include "msmpeg4.h"
|
2012-08-08 12:51:52 +00:00
|
|
|
#include "libavutil/x86/asm.h"
|
2010-01-07 23:53:49 +00:00
|
|
|
#include "h263.h"
|
|
|
|
#include "mpeg4video.h"
|
2012-02-18 13:28:43 +00:00
|
|
|
#include "msmpeg4data.h"
|
2012-02-18 12:43:59 +00:00
|
|
|
#include "vc1data.h"
|
2002-05-21 23:13:57 +00:00
|
|
|
|
2001-07-22 14:18:56 +00:00
|
|
|
/*
|
2005-12-17 18:14:38 +00:00
|
|
|
* You can also call this codec : MPEG4 with a twist !
|
2001-07-22 14:18:56 +00:00
|
|
|
*
|
2005-12-17 18:14:38 +00:00
|
|
|
* TODO:
|
2001-07-22 14:18:56 +00:00
|
|
|
* - (encoding) select best mv table (two choices)
|
2005-12-17 18:14:38 +00:00
|
|
|
* - (encoding) select best vlc/dc table
|
2001-07-22 14:18:56 +00:00
|
|
|
*/
|
|
|
|
|
2009-12-30 14:15:12 +00:00
|
|
|
/* This table is practically identical to the one from h263
|
|
|
|
* except that it is inverted. */
|
|
|
|
static av_cold void init_h263_dc_for_msmpeg4(void)
|
|
|
|
{
|
|
|
|
int level, uni_code, uni_len;
|
|
|
|
|
|
|
|
for(level=-256; level<256; level++){
|
|
|
|
int size, v, l;
|
|
|
|
/* find number of bits */
|
|
|
|
size = 0;
|
|
|
|
v = abs(level);
|
|
|
|
while (v) {
|
|
|
|
v >>= 1;
|
|
|
|
size++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (level < 0)
|
|
|
|
l= (-level) ^ ((1 << size) - 1);
|
|
|
|
else
|
|
|
|
l= level;
|
|
|
|
|
|
|
|
/* luminance h263 */
|
2010-01-08 17:28:43 +00:00
|
|
|
uni_code= ff_mpeg4_DCtab_lum[size][0];
|
|
|
|
uni_len = ff_mpeg4_DCtab_lum[size][1];
|
2009-12-30 14:15:12 +00:00
|
|
|
uni_code ^= (1<<uni_len)-1; //M$ does not like compatibility
|
|
|
|
|
|
|
|
if (size > 0) {
|
|
|
|
uni_code<<=size; uni_code|=l;
|
|
|
|
uni_len+=size;
|
|
|
|
if (size > 8){
|
|
|
|
uni_code<<=1; uni_code|=1;
|
|
|
|
uni_len++;
|
|
|
|
}
|
|
|
|
}
|
2012-02-18 13:28:43 +00:00
|
|
|
ff_v2_dc_lum_table[level + 256][0] = uni_code;
|
|
|
|
ff_v2_dc_lum_table[level + 256][1] = uni_len;
|
2009-12-30 14:15:12 +00:00
|
|
|
|
|
|
|
/* chrominance h263 */
|
2010-01-08 17:28:43 +00:00
|
|
|
uni_code= ff_mpeg4_DCtab_chrom[size][0];
|
|
|
|
uni_len = ff_mpeg4_DCtab_chrom[size][1];
|
2009-12-30 14:15:12 +00:00
|
|
|
uni_code ^= (1<<uni_len)-1; //M$ does not like compatibility
|
|
|
|
|
|
|
|
if (size > 0) {
|
|
|
|
uni_code<<=size; uni_code|=l;
|
|
|
|
uni_len+=size;
|
|
|
|
if (size > 8){
|
|
|
|
uni_code<<=1; uni_code|=1;
|
|
|
|
uni_len++;
|
|
|
|
}
|
|
|
|
}
|
2012-02-18 13:28:43 +00:00
|
|
|
ff_v2_dc_chroma_table[level + 256][0] = uni_code;
|
|
|
|
ff_v2_dc_chroma_table[level + 256][1] = uni_len;
|
2009-12-30 14:15:12 +00:00
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-02-18 13:28:43 +00:00
|
|
|
av_cold void ff_msmpeg4_common_init(MpegEncContext *s)
|
2002-06-18 00:49:00 +00:00
|
|
|
{
|
2008-02-13 09:26:10 +00:00
|
|
|
static int initialized=0;
|
2005-12-17 18:14:38 +00:00
|
|
|
|
2002-06-18 00:49:00 +00:00
|
|
|
switch(s->msmpeg4_version){
|
|
|
|
case 1:
|
|
|
|
case 2:
|
|
|
|
s->y_dc_scale_table=
|
|
|
|
s->c_dc_scale_table= ff_mpeg1_dc_scale_table;
|
|
|
|
break;
|
|
|
|
case 3:
|
|
|
|
if(s->workaround_bugs){
|
2012-02-15 10:56:41 +00:00
|
|
|
s->y_dc_scale_table= ff_old_ff_y_dc_scale_table;
|
|
|
|
s->c_dc_scale_table= ff_wmv1_c_dc_scale_table;
|
2002-06-18 00:49:00 +00:00
|
|
|
} else{
|
|
|
|
s->y_dc_scale_table= ff_mpeg4_y_dc_scale_table;
|
|
|
|
s->c_dc_scale_table= ff_mpeg4_c_dc_scale_table;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case 4:
|
2002-12-27 23:51:46 +00:00
|
|
|
case 5:
|
2012-02-15 10:56:41 +00:00
|
|
|
s->y_dc_scale_table= ff_wmv1_y_dc_scale_table;
|
|
|
|
s->c_dc_scale_table= ff_wmv1_c_dc_scale_table;
|
2002-06-18 00:49:00 +00:00
|
|
|
break;
|
2009-07-29 09:54:49 +00:00
|
|
|
#if CONFIG_VC1_DECODER
|
2005-01-30 16:34:57 +00:00
|
|
|
case 6:
|
2012-02-15 11:00:08 +00:00
|
|
|
s->y_dc_scale_table= ff_wmv3_dc_scale_table;
|
|
|
|
s->c_dc_scale_table= ff_wmv3_dc_scale_table;
|
2005-01-30 16:34:57 +00:00
|
|
|
break;
|
2005-05-02 22:14:42 +00:00
|
|
|
#endif
|
2005-01-30 16:34:57 +00:00
|
|
|
|
2002-06-18 00:49:00 +00:00
|
|
|
}
|
|
|
|
|
2005-12-17 18:14:38 +00:00
|
|
|
|
2002-12-27 23:51:46 +00:00
|
|
|
if(s->msmpeg4_version>=4){
|
2012-02-15 10:56:41 +00:00
|
|
|
ff_init_scantable(s->dsp.idct_permutation, &s->intra_scantable , ff_wmv1_scantable[1]);
|
|
|
|
ff_init_scantable(s->dsp.idct_permutation, &s->intra_h_scantable, ff_wmv1_scantable[2]);
|
|
|
|
ff_init_scantable(s->dsp.idct_permutation, &s->intra_v_scantable, ff_wmv1_scantable[3]);
|
|
|
|
ff_init_scantable(s->dsp.idct_permutation, &s->inter_scantable , ff_wmv1_scantable[0]);
|
2002-06-18 00:49:00 +00:00
|
|
|
}
|
2002-09-29 22:44:22 +00:00
|
|
|
//Note the default tables are set in common_init in mpegvideo.c
|
2005-12-17 18:14:38 +00:00
|
|
|
|
2008-02-13 09:26:10 +00:00
|
|
|
if(!initialized){
|
|
|
|
initialized=1;
|
2002-06-18 00:49:00 +00:00
|
|
|
|
|
|
|
init_h263_dc_for_msmpeg4();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2001-07-22 14:18:56 +00:00
|
|
|
/* predict coded block */
|
2007-11-07 23:23:35 +00:00
|
|
|
int ff_msmpeg4_coded_block_pred(MpegEncContext * s, int n, uint8_t **coded_block_ptr)
|
2001-07-22 14:18:56 +00:00
|
|
|
{
|
2002-03-29 01:53:59 +00:00
|
|
|
int xy, wrap, pred, a, b, c;
|
2001-07-22 14:18:56 +00:00
|
|
|
|
2002-03-29 01:53:59 +00:00
|
|
|
xy = s->block_index[n];
|
2004-04-16 01:01:45 +00:00
|
|
|
wrap = s->b8_stride;
|
2001-07-22 14:18:56 +00:00
|
|
|
|
|
|
|
/* B C
|
2005-12-17 18:14:38 +00:00
|
|
|
* A X
|
2001-07-22 14:18:56 +00:00
|
|
|
*/
|
2002-03-29 01:53:59 +00:00
|
|
|
a = s->coded_block[xy - 1 ];
|
|
|
|
b = s->coded_block[xy - 1 - wrap];
|
|
|
|
c = s->coded_block[xy - wrap];
|
2005-12-17 18:14:38 +00:00
|
|
|
|
2001-07-22 14:18:56 +00:00
|
|
|
if (b == c) {
|
|
|
|
pred = a;
|
|
|
|
} else {
|
|
|
|
pred = c;
|
|
|
|
}
|
2005-12-17 18:14:38 +00:00
|
|
|
|
2001-07-22 14:18:56 +00:00
|
|
|
/* store value */
|
2002-03-29 01:53:59 +00:00
|
|
|
*coded_block_ptr = &s->coded_block[xy];
|
2001-07-22 14:18:56 +00:00
|
|
|
|
|
|
|
return pred;
|
|
|
|
}
|
|
|
|
|
2002-07-07 08:34:46 +00:00
|
|
|
static int get_dc(uint8_t *src, int stride, int scale)
|
|
|
|
{
|
|
|
|
int y;
|
|
|
|
int sum=0;
|
|
|
|
for(y=0; y<8; y++){
|
|
|
|
int x;
|
|
|
|
for(x=0; x<8; x++){
|
|
|
|
sum+=src[x + y*stride];
|
|
|
|
}
|
|
|
|
}
|
2003-05-14 15:12:13 +00:00
|
|
|
return FASTDIV((sum + (scale>>1)), scale);
|
2002-07-07 08:34:46 +00:00
|
|
|
}
|
|
|
|
|
2001-07-22 14:18:56 +00:00
|
|
|
/* dir = 0: left, dir = 1: top prediction */
|
2012-02-18 13:28:43 +00:00
|
|
|
int ff_msmpeg4_pred_dc(MpegEncContext *s, int n,
|
|
|
|
int16_t **dc_val_ptr, int *dir_ptr)
|
2001-07-22 14:18:56 +00:00
|
|
|
{
|
2002-03-29 01:53:59 +00:00
|
|
|
int a, b, c, wrap, pred, scale;
|
2006-09-27 22:13:44 +00:00
|
|
|
int16_t *dc_val;
|
2001-07-22 14:18:56 +00:00
|
|
|
|
|
|
|
/* find prediction */
|
|
|
|
if (n < 4) {
|
2005-12-22 01:10:11 +00:00
|
|
|
scale = s->y_dc_scale;
|
2001-07-22 14:18:56 +00:00
|
|
|
} else {
|
2005-12-22 01:10:11 +00:00
|
|
|
scale = s->c_dc_scale;
|
2001-07-22 14:18:56 +00:00
|
|
|
}
|
2005-12-17 18:14:38 +00:00
|
|
|
|
2002-03-29 01:53:59 +00:00
|
|
|
wrap = s->block_wrap[n];
|
|
|
|
dc_val= s->dc_val[0] + s->block_index[n];
|
2001-07-22 14:18:56 +00:00
|
|
|
|
|
|
|
/* B C
|
2005-12-17 18:14:38 +00:00
|
|
|
* A X
|
2001-07-22 14:18:56 +00:00
|
|
|
*/
|
2002-03-29 01:53:59 +00:00
|
|
|
a = dc_val[ - 1];
|
|
|
|
b = dc_val[ - 1 - wrap];
|
|
|
|
c = dc_val[ - wrap];
|
2005-12-17 18:14:38 +00:00
|
|
|
|
2003-01-09 11:37:08 +00:00
|
|
|
if(s->first_slice_line && (n&2)==0 && s->msmpeg4_version<4){
|
2002-10-13 13:16:04 +00:00
|
|
|
b=c=1024;
|
|
|
|
}
|
2001-07-22 14:18:56 +00:00
|
|
|
|
|
|
|
/* XXX: the following solution consumes divisions, but it does not
|
|
|
|
necessitate to modify mpegvideo.c. The problem comes from the
|
|
|
|
fact they decided to store the quantized DC (which would lead
|
|
|
|
to problems if Q could vary !) */
|
2009-08-21 09:54:28 +00:00
|
|
|
#if ARCH_X86 && HAVE_7REGS && HAVE_EBX_AVAILABLE
|
2008-10-16 13:34:09 +00:00
|
|
|
__asm__ volatile(
|
2005-12-22 01:10:11 +00:00
|
|
|
"movl %3, %%eax \n\t"
|
|
|
|
"shrl $1, %%eax \n\t"
|
|
|
|
"addl %%eax, %2 \n\t"
|
|
|
|
"addl %%eax, %1 \n\t"
|
|
|
|
"addl %0, %%eax \n\t"
|
|
|
|
"mull %4 \n\t"
|
|
|
|
"movl %%edx, %0 \n\t"
|
|
|
|
"movl %1, %%eax \n\t"
|
|
|
|
"mull %4 \n\t"
|
|
|
|
"movl %%edx, %1 \n\t"
|
|
|
|
"movl %2, %%eax \n\t"
|
|
|
|
"mull %4 \n\t"
|
|
|
|
"movl %%edx, %2 \n\t"
|
|
|
|
: "+b" (a), "+c" (b), "+D" (c)
|
2006-11-12 18:49:36 +00:00
|
|
|
: "g" (scale), "S" (ff_inverse[scale])
|
2005-12-22 01:10:11 +00:00
|
|
|
: "%eax", "%edx"
|
2002-01-14 04:34:52 +00:00
|
|
|
);
|
2002-01-28 18:06:28 +00:00
|
|
|
#else
|
2013-11-13 19:39:56 +00:00
|
|
|
/* Divisions are costly everywhere; optimize the most common case. */
|
2002-01-20 14:48:02 +00:00
|
|
|
if (scale == 8) {
|
2005-12-22 01:10:11 +00:00
|
|
|
a = (a + (8 >> 1)) / 8;
|
|
|
|
b = (b + (8 >> 1)) / 8;
|
|
|
|
c = (c + (8 >> 1)) / 8;
|
2002-01-20 14:48:02 +00:00
|
|
|
} else {
|
2005-12-22 01:10:11 +00:00
|
|
|
a = FASTDIV((a + (scale >> 1)), scale);
|
|
|
|
b = FASTDIV((b + (scale >> 1)), scale);
|
|
|
|
c = FASTDIV((c + (scale >> 1)), scale);
|
2002-01-20 14:48:02 +00:00
|
|
|
}
|
2002-01-14 04:34:52 +00:00
|
|
|
#endif
|
2001-07-22 14:18:56 +00:00
|
|
|
/* XXX: WARNING: they did not choose the same test as MPEG4. This
|
|
|
|
is very important ! */
|
2002-06-22 15:52:25 +00:00
|
|
|
if(s->msmpeg4_version>3){
|
2002-07-07 08:34:46 +00:00
|
|
|
if(s->inter_intra_pred){
|
|
|
|
uint8_t *dest;
|
|
|
|
int wrap;
|
2005-12-17 18:14:38 +00:00
|
|
|
|
2002-07-07 08:34:46 +00:00
|
|
|
if(n==1){
|
|
|
|
pred=a;
|
|
|
|
*dir_ptr = 0;
|
|
|
|
}else if(n==2){
|
|
|
|
pred=c;
|
|
|
|
*dir_ptr = 1;
|
|
|
|
}else if(n==3){
|
|
|
|
if (abs(a - b) < abs(b - c)) {
|
|
|
|
pred = c;
|
|
|
|
*dir_ptr = 1;
|
|
|
|
} else {
|
|
|
|
pred = a;
|
|
|
|
*dir_ptr = 0;
|
|
|
|
}
|
|
|
|
}else{
|
|
|
|
if(n<4){
|
|
|
|
wrap= s->linesize;
|
2011-07-06 18:08:30 +00:00
|
|
|
dest= s->current_picture.f.data[0] + (((n >> 1) + 2*s->mb_y) * 8* wrap ) + ((n & 1) + 2*s->mb_x) * 8;
|
2002-07-07 08:34:46 +00:00
|
|
|
}else{
|
2002-07-15 14:15:10 +00:00
|
|
|
wrap= s->uvlinesize;
|
2011-07-06 18:08:30 +00:00
|
|
|
dest= s->current_picture.f.data[n - 3] + (s->mb_y * 8 * wrap) + s->mb_x * 8;
|
2002-07-07 08:34:46 +00:00
|
|
|
}
|
|
|
|
if(s->mb_x==0) a= (1024 + (scale>>1))/scale;
|
|
|
|
else a= get_dc(dest-8, wrap, scale*8);
|
|
|
|
if(s->mb_y==0) c= (1024 + (scale>>1))/scale;
|
|
|
|
else c= get_dc(dest-8*wrap, wrap, scale*8);
|
2005-12-17 18:14:38 +00:00
|
|
|
|
2002-07-07 08:34:46 +00:00
|
|
|
if (s->h263_aic_dir==0) {
|
|
|
|
pred= a;
|
|
|
|
*dir_ptr = 0;
|
|
|
|
}else if (s->h263_aic_dir==1) {
|
|
|
|
if(n==0){
|
|
|
|
pred= c;
|
|
|
|
*dir_ptr = 1;
|
|
|
|
}else{
|
|
|
|
pred= a;
|
|
|
|
*dir_ptr = 0;
|
|
|
|
}
|
|
|
|
}else if (s->h263_aic_dir==2) {
|
|
|
|
if(n==0){
|
|
|
|
pred= a;
|
|
|
|
*dir_ptr = 0;
|
|
|
|
}else{
|
|
|
|
pred= c;
|
|
|
|
*dir_ptr = 1;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
pred= c;
|
|
|
|
*dir_ptr = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}else{
|
|
|
|
if (abs(a - b) < abs(b - c)) {
|
|
|
|
pred = c;
|
|
|
|
*dir_ptr = 1;
|
|
|
|
} else {
|
|
|
|
pred = a;
|
|
|
|
*dir_ptr = 0;
|
|
|
|
}
|
2002-06-22 15:52:25 +00:00
|
|
|
}
|
|
|
|
}else{
|
|
|
|
if (abs(a - b) <= abs(b - c)) {
|
|
|
|
pred = c;
|
|
|
|
*dir_ptr = 1;
|
|
|
|
} else {
|
|
|
|
pred = a;
|
|
|
|
*dir_ptr = 0;
|
|
|
|
}
|
2001-07-22 14:18:56 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* update predictor */
|
2002-03-29 01:53:59 +00:00
|
|
|
*dc_val_ptr = &dc_val[0];
|
2001-07-22 14:18:56 +00:00
|
|
|
return pred;
|
|
|
|
}
|
|
|
|
|