| 20 |
* along with this program ; if not, write to the Free Software |
* along with this program ; if not, write to the Free Software |
| 21 |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
| 22 |
* |
* |
| 23 |
* $Id: motion_comp.c,v 1.18.2.6 2003-06-09 13:54:31 edgomez Exp $ |
* $Id: motion_comp.c,v 1.18.2.7 2003-06-28 15:53:07 chl Exp $ |
| 24 |
* |
* |
| 25 |
****************************************************************************/ |
****************************************************************************/ |
| 26 |
|
|
| 43 |
#endif |
#endif |
| 44 |
|
|
| 45 |
|
|
| 46 |
/* This is borrowed from decoder.c */ |
/* This is borrowed from bitstream.c until we find a common solution */ |
|
static __inline int gmc_sanitize(int value, int quarterpel, int fcode) |
|
|
{ |
|
|
int length = 1 << (fcode+4); |
|
|
|
|
|
#if 0 |
|
|
if (quarterpel) value *= 2; |
|
|
#endif |
|
|
|
|
|
if (value < -length) |
|
|
return -length; |
|
|
else if (value >= length) |
|
|
return length-1; |
|
|
else return value; |
|
|
} |
|
|
|
|
|
/* And this is borrowed from bitstream.c until we find a common solution */ |
|
| 47 |
|
|
| 48 |
static uint32_t __inline |
static uint32_t __inline |
| 49 |
log2bin(uint32_t value) |
log2bin(uint32_t value) |
| 524 |
dx, dy, edged_width / 2, 0), |
dx, dy, edged_width / 2, 0), |
| 525 |
edged_width / 2); |
edged_width / 2); |
| 526 |
} |
} |
|
|
|
|
|
|
|
|
|
|
void generate_GMCparameters( const int num_wp, const int res, |
|
|
const WARPPOINTS *const warp, |
|
|
const int width, const int height, |
|
|
GMC_DATA *const gmc) |
|
|
{ |
|
|
const int du0 = warp->duv[0].x; |
|
|
const int dv0 = warp->duv[0].y; |
|
|
const int du1 = warp->duv[1].x; |
|
|
const int dv1 = warp->duv[1].y; |
|
|
const int du2 = warp->duv[2].x; |
|
|
const int dv2 = warp->duv[2].y; |
|
|
|
|
|
gmc->W = width; |
|
|
gmc->H = height; |
|
|
|
|
|
gmc->rho = 4 - log2bin(res-1); /* = {3,2,1,0} for res={2,4,8,16} */ |
|
|
|
|
|
gmc->alpha = log2bin(gmc->W-1); |
|
|
gmc->Ws = (1 << gmc->alpha); |
|
|
|
|
|
gmc->dxF = 16*gmc->Ws + RDIV( 8*gmc->Ws*du1, gmc->W ); |
|
|
gmc->dxG = RDIV( 8*gmc->Ws*dv1, gmc->W ); |
|
|
gmc->Fo = (res*du0 + 1) << (gmc->alpha+gmc->rho-1); |
|
|
gmc->Go = (res*dv0 + 1) << (gmc->alpha+gmc->rho-1); |
|
|
|
|
|
if (num_wp==2) { |
|
|
gmc->dyF = -gmc->dxG; |
|
|
gmc->dyG = gmc->dxF; |
|
|
} else if (num_wp==3) { |
|
|
gmc->beta = log2bin(gmc->H-1); |
|
|
gmc->Hs = (1 << gmc->beta); |
|
|
gmc->dyF = RDIV( 8*gmc->Hs*du2, gmc->H ); |
|
|
gmc->dyG = 16*gmc->Hs + RDIV( 8*gmc->Hs*dv2, gmc->H ); |
|
|
if (gmc->beta > gmc->alpha) { |
|
|
gmc->dxF <<= (gmc->beta - gmc->alpha); |
|
|
gmc->dxG <<= (gmc->beta - gmc->alpha); |
|
|
gmc->alpha = gmc->beta; |
|
|
gmc->Ws = 1<< gmc->beta; |
|
|
} else { |
|
|
gmc->dyF <<= gmc->alpha - gmc->beta; |
|
|
gmc->dyG <<= gmc->alpha - gmc->beta; |
|
|
} |
|
|
} |
|
|
|
|
|
gmc->cFo = gmc->dxF + gmc->dyF + (1 << (gmc->alpha+gmc->rho+1)); |
|
|
gmc->cFo += 16*gmc->Ws*(du0-1); |
|
|
|
|
|
gmc->cGo = gmc->dxG + gmc->dyG + (1 << (gmc->alpha+gmc->rho+1)); |
|
|
gmc->cGo += 16*gmc->Ws*(dv0-1); |
|
|
} |
|
|
|
|
|
void |
|
|
generate_GMCimage( const GMC_DATA *const gmc_data, /* [input] precalculated data */ |
|
|
const IMAGE *const pRef, /* [input] */ |
|
|
const int mb_width, |
|
|
const int mb_height, |
|
|
const int stride, |
|
|
const int stride2, |
|
|
const int fcode, /* [input] some parameters... */ |
|
|
const int32_t quarterpel, /* [input] for rounding avgMV */ |
|
|
const int reduced_resolution, /* [input] ignored */ |
|
|
const int32_t rounding, /* [input] for rounding image data */ |
|
|
MACROBLOCK *const pMBs, /* [output] average motion vectors */ |
|
|
IMAGE *const pGMC) /* [output] full warped image */ |
|
|
{ |
|
|
|
|
|
unsigned int mj,mi; |
|
|
VECTOR avgMV; |
|
|
|
|
|
for (mj = 0; mj < (unsigned int)mb_height; mj++) |
|
|
for (mi = 0; mi < (unsigned int)mb_width; mi++) { |
|
|
|
|
|
avgMV = generate_GMCimageMB(gmc_data, pRef, mi, mj, |
|
|
stride, stride2, quarterpel, rounding, pGMC); |
|
|
|
|
|
pMBs[mj*mb_width+mi].amv.x = gmc_sanitize(avgMV.x, quarterpel, fcode); |
|
|
pMBs[mj*mb_width+mi].amv.y = gmc_sanitize(avgMV.y, quarterpel, fcode); |
|
|
pMBs[mj*mb_width+mi].mcsel = 0; /* until mode decision */ |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
#define MLT(i) (((16-(i))<<16) + (i)) |
|
|
static const uint32_t MTab[16] = { |
|
|
MLT( 0), MLT( 1), MLT( 2), MLT( 3), MLT( 4), MLT( 5), MLT( 6), MLT(7), |
|
|
MLT( 8), MLT( 9), MLT(10), MLT(11), MLT(12), MLT(13), MLT(14), MLT(15) |
|
|
}; |
|
|
#undef MLT |
|
|
|
|
|
VECTOR generate_GMCimageMB( const GMC_DATA *const gmc_data, |
|
|
const IMAGE *const pRef, |
|
|
const int mi, const int mj, |
|
|
const int stride, |
|
|
const int stride2, |
|
|
const int quarterpel, |
|
|
const int rounding, |
|
|
IMAGE *const pGMC) |
|
|
{ |
|
|
const int W = gmc_data->W; |
|
|
const int H = gmc_data->H; |
|
|
|
|
|
const int rho = gmc_data->rho; |
|
|
const int alpha = gmc_data->alpha; |
|
|
|
|
|
const int rounder = ( 128 - (rounding<<(rho+rho)) ) << 16; |
|
|
|
|
|
const int dxF = gmc_data->dxF; |
|
|
const int dyF = gmc_data->dyF; |
|
|
const int dxG = gmc_data->dxG; |
|
|
const int dyG = gmc_data->dyG; |
|
|
|
|
|
uint8_t *dstY, *dstU, *dstV; |
|
|
|
|
|
int I,J; |
|
|
VECTOR avgMV = {0,0}; |
|
|
|
|
|
int32_t Fj, Gj; |
|
|
|
|
|
dstY = &pGMC->y[(mj*16)*stride+mi*16] + 16; |
|
|
|
|
|
Fj = gmc_data->Fo + dyF*mj*16 + dxF*mi*16; |
|
|
Gj = gmc_data->Go + dyG*mj*16 + dxG*mi*16; |
|
|
|
|
|
for (J = 16; J > 0; --J) { |
|
|
int32_t Fi, Gi; |
|
|
|
|
|
Fi = Fj; Fj += dyF; |
|
|
Gi = Gj; Gj += dyG; |
|
|
for (I = -16; I < 0; ++I) { |
|
|
int32_t F, G; |
|
|
uint32_t ri, rj; |
|
|
|
|
|
F = ( Fi >> (alpha+rho) ) << rho; Fi += dxF; |
|
|
G = ( Gi >> (alpha+rho) ) << rho; Gi += dxG; |
|
|
|
|
|
avgMV.x += F; |
|
|
avgMV.y += G; |
|
|
|
|
|
ri = MTab[F&15]; |
|
|
rj = MTab[G&15]; |
|
|
|
|
|
F >>= 4; |
|
|
G >>= 4; |
|
|
|
|
|
if (F < -1) F = -1; |
|
|
else if (F > W) F = W; |
|
|
if (G< -1) G=-1; |
|
|
else if (G>H) G=H; |
|
|
|
|
|
{ /* MMX-like bilinear... */ |
|
|
const int offset = G*stride + F; |
|
|
uint32_t f0, f1; |
|
|
f0 = pRef->y[ offset +0 ]; |
|
|
f0 |= pRef->y[ offset +1 ] << 16; |
|
|
f1 = pRef->y[ offset+stride +0 ]; |
|
|
f1 |= pRef->y[ offset+stride +1 ] << 16; |
|
|
f0 = (ri*f0)>>16; |
|
|
f1 = (ri*f1) & 0x0fff0000; |
|
|
f0 |= f1; |
|
|
f0 = ( rj*f0 + rounder ) >> 24; |
|
|
|
|
|
dstY[I] = (uint8_t)f0; |
|
|
} |
|
|
} |
|
|
|
|
|
dstY += stride; |
|
|
} |
|
|
|
|
|
dstU = &pGMC->u[(mj*8)*stride2+mi*8] + 8; |
|
|
dstV = &pGMC->v[(mj*8)*stride2+mi*8] + 8; |
|
|
|
|
|
Fj = gmc_data->cFo + dyF*4 *mj*8 + dxF*4 *mi*8; |
|
|
Gj = gmc_data->cGo + dyG*4 *mj*8 + dxG*4 *mi*8; |
|
|
|
|
|
for (J = 8; J > 0; --J) { |
|
|
int32_t Fi, Gi; |
|
|
Fi = Fj; Fj += 4*dyF; |
|
|
Gi = Gj; Gj += 4*dyG; |
|
|
|
|
|
for (I = -8; I < 0; ++I) { |
|
|
int32_t F, G; |
|
|
uint32_t ri, rj; |
|
|
|
|
|
F = ( Fi >> (alpha+rho+2) ) << rho; Fi += 4*dxF; |
|
|
G = ( Gi >> (alpha+rho+2) ) << rho; Gi += 4*dxG; |
|
|
|
|
|
ri = MTab[F&15]; |
|
|
rj = MTab[G&15]; |
|
|
|
|
|
F >>= 4; |
|
|
G >>= 4; |
|
|
|
|
|
if (F < -1) F=-1; |
|
|
else if (F >= W/2) F = W/2; |
|
|
if (G < -1) G = -1; |
|
|
else if (G >= H/2) G = H/2; |
|
|
|
|
|
{ |
|
|
const int offset = G*stride2 + F; |
|
|
uint32_t f0, f1; |
|
|
|
|
|
f0 = pRef->u[ offset +0 ]; |
|
|
f0 |= pRef->u[ offset +1 ] << 16; |
|
|
f1 = pRef->u[ offset+stride2 +0 ]; |
|
|
f1 |= pRef->u[ offset+stride2 +1 ] << 16; |
|
|
f0 = (ri*f0)>>16; |
|
|
f1 = (ri*f1) & 0x0fff0000; |
|
|
f0 |= f1; |
|
|
f0 = ( rj*f0 + rounder ) >> 24; |
|
|
|
|
|
dstU[I] = (uint8_t)f0; |
|
|
|
|
|
|
|
|
f0 = pRef->v[ offset +0 ]; |
|
|
f0 |= pRef->v[ offset +1 ] << 16; |
|
|
f1 = pRef->v[ offset+stride2 +0 ]; |
|
|
f1 |= pRef->v[ offset+stride2 +1 ] << 16; |
|
|
f0 = (ri*f0)>>16; |
|
|
f1 = (ri*f1) & 0x0fff0000; |
|
|
f0 |= f1; |
|
|
f0 = ( rj*f0 + rounder ) >> 24; |
|
|
|
|
|
dstV[I] = (uint8_t)f0; |
|
|
} |
|
|
} |
|
|
dstU += stride2; |
|
|
dstV += stride2; |
|
|
} |
|
|
|
|
|
|
|
|
avgMV.x -= 16*((256*mi+120)<<4); /* 120 = 15*16/2 */ |
|
|
avgMV.y -= 16*((256*mj+120)<<4); |
|
|
|
|
|
avgMV.x = RSHIFT( avgMV.x, (4+7-quarterpel) ); |
|
|
avgMV.y = RSHIFT( avgMV.y, (4+7-quarterpel) ); |
|
|
|
|
|
return avgMV; |
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
#ifdef OLD_GRUEL_GMC |
|
|
void |
|
|
generate_GMCparameters( const int num_wp, /* [input]: number of warppoints */ |
|
|
const int res, /* [input]: resolution */ |
|
|
const WARPPOINTS *const warp, /* [input]: warp points */ |
|
|
const int width, const int height, |
|
|
GMC_DATA *const gmc) /* [output] precalculated parameters */ |
|
|
{ |
|
|
|
|
|
/* We follow mainly two sources: The original standard, which is ugly, and the |
|
|
thesis from Andreas Dehnhardt, which is much nicer. |
|
|
|
|
|
Notation is: indices are written next to the variable, |
|
|
primes in the standard are denoted by a suffix 'p'. |
|
|
types are "c"=constant, "i"=input parameter, "f"=calculated, then fixed, |
|
|
"o"=output data, " "=other, "u" = unused, "p"=calc for every pixel |
|
|
|
|
|
type | variable name | ISO name (TeX-style) | value or range | usage |
|
|
------------------------------------------------------------------------------------- |
|
|
c | H | H | [16 , ?] | image width (w/o edges) |
|
|
c | W | W | [16 , ?] | image height (w/o edges) |
|
|
|
|
|
c | i0 | i_0 | 0 | ref. point #1, X |
|
|
c | j0 | j_0 | 0 | ref. point #1, Y |
|
|
c | i1 | i_1 | W | ref. point #2, X |
|
|
c | j1 | j_1 | 0 | ref. point #2, Y |
|
|
cu | i2 | i_2 | 0 | ref. point #3, X |
|
|
cu | i2 | j_2 | H | ref. point #3, Y |
|
|
|
|
|
i | du0 | du[0] | [-16863,16863] | warp vector #1, Y |
|
|
i | dv0 | dv[0] | [-16863,16863] | warp vector #1, Y |
|
|
i | du1 | du[1] | [-16863,16863] | warp vector #2, Y |
|
|
i | dv1 | dv[1] | [-16863,16863] | warp vector #2, Y |
|
|
iu | du2 | du[2] | [-16863,16863] | warp vector #3, Y |
|
|
iu | dv2 | dv[2] | [-16863,16863] | warp vector #3, Y |
|
|
|
|
|
i | s | s | {2,4,8,16} | interpol. resolution |
|
|
f | sigma | - | log2(s) | X / s == X >> sigma |
|
|
f | r | r | =16/s | complementary res. |
|
|
f | rho | \rho | log2(r) | X / r == X >> rho |
|
|
|
|
|
f | i0s | i'_0 | | |
|
|
f | j0s | j'_0 | | |
|
|
f | i1s | i'_1 | | |
|
|
f | j1s | j'_1 | | |
|
|
f | i2s | i'_2 | | |
|
|
f | j2s | j'_2 | | |
|
|
|
|
|
f | alpha | \alpha | | 2^{alpha-1} < W <= 2^alpha |
|
|
f | beta | \beta | | 2^{beta-1} < H <= 2^beta |
|
|
|
|
|
f | Ws | W' | W = 2^{alpha} | scaled width |
|
|
f | Hs | H' | W = 2^{beta} | scaled height |
|
|
|
|
|
f | i1ss | i''_1 | "virtual sprite stuff" |
|
|
f | j1ss | j''_1 | "virtual sprite stuff" |
|
|
f | i2ss | i''_2 | "virtual sprite stuff" |
|
|
f | j2ss | j''_2 | "virtual sprite stuff" |
|
|
*/ |
|
|
|
|
|
/* Some calculations are disabled because we only use 2 warppoints at the moment */ |
|
|
|
|
|
int du0 = warp->duv[0].x; |
|
|
int dv0 = warp->duv[0].y; |
|
|
int du1 = warp->duv[1].x; |
|
|
int dv1 = warp->duv[1].y; |
|
|
#if 0 |
|
|
int du2 = warp->duv[2].x; |
|
|
int dv2 = warp->duv[2].y; |
|
|
#endif |
|
|
|
|
|
gmc->num_wp = num_wp; |
|
|
|
|
|
gmc->s = res; /* scaling parameters 2,4,8 or 16 */ |
|
|
gmc->sigma = log2bin(res-1); /* log2bin(15)=4, log2bin(16)=5, log2bin(17)=5 */ |
|
|
gmc->r = 16/res; |
|
|
gmc->rho = 4 - gmc->sigma; /* = log2bin(r-1) */ |
|
|
|
|
|
gmc->W = width; |
|
|
gmc->H = height; /* fixed reference coordinates */ |
|
|
|
|
|
gmc->alpha = log2bin(gmc->W-1); |
|
|
gmc->Ws= 1<<gmc->alpha; |
|
|
|
|
|
#if 0 |
|
|
gmc->beta = log2bin(gmc->H-1); |
|
|
gmc->Hs= 1<<gmc->beta; |
|
|
#endif |
|
|
|
|
|
#if 0 |
|
|
printf("du0=%d dv0=%d du1=%d dv1=%d s=%d sigma=%d W=%d alpha=%d, Ws=%d, rho=%d\n",du0,dv0,du1,dv1,gmc->s,gmc->sigma,gmc->W,gmc->alpha,gmc->Ws,gmc->rho); |
|
|
#endif |
|
|
|
|
|
/* |
|
|
* i2s is only needed for num_wp >= 3, etc. |
|
|
* the 's' values are in 1/s pel resolution |
|
|
*/ |
|
|
gmc->i0s = res/2 * ( du0 ); |
|
|
gmc->j0s = res/2 * ( dv0 ); |
|
|
gmc->i1s = res/2 * (2*width + du1 + du0 ); |
|
|
gmc->j1s = res/2 * ( dv1 + dv0 ); |
|
|
#if 0 |
|
|
gmc->i2s = res/2 * ( du2 + du0 ); |
|
|
gmc->j2s = res/2 * (2*height + dv2 + dv0 ); |
|
|
#endif |
|
|
|
|
|
/* i2s and i2ss are only needed for num_wp == 3, etc. */ |
|
|
|
|
|
/* the 'ss' values are in 1/16 pel resolution */ |
|
|
gmc->i1ss = 16*gmc->Ws + ROUNDED_DIV(((gmc->W-gmc->Ws)*(gmc->r*gmc->i0s) + gmc->Ws*(gmc->r*gmc->i1s - 16*gmc->W)),gmc->W); |
|
|
gmc->j1ss = ROUNDED_DIV( ((gmc->W - gmc->Ws)*(gmc->r*gmc->j0s) + gmc->Ws*gmc->r*gmc->j1s) ,gmc->W ); |
|
|
|
|
|
#if 0 |
|
|
gmc->i2ss = ROUNDED_DIV( ((gmc->H - gmc->Hs)*(gmc->r*gmc->i0s) + gmc->Hs*(gmc->r*gmc->i2s)), gmc->H); |
|
|
gmc->j2ss = 16*gmc->Hs + ROUNDED_DIV( ((gmc->H-gmc->Hs)*(gmc->r*gmc->j0s) + gmc->Ws*(gmc->r*gmc->j2s - 16*gmc->H)), gmc->H); |
|
|
#endif |
|
|
|
|
|
return; |
|
|
} |
|
|
|
|
|
void |
|
|
generate_GMCimage( const GMC_DATA *const gmc_data, /* [input] precalculated data */ |
|
|
const IMAGE *const pRef, /* [input] */ |
|
|
const int mb_width, |
|
|
const int mb_height, |
|
|
const int stride, |
|
|
const int stride2, |
|
|
const int fcode, /* [input] some parameters... */ |
|
|
const int32_t quarterpel, /* [input] for rounding avgMV */ |
|
|
const int reduced_resolution, /* [input] ignored */ |
|
|
const int32_t rounding, /* [input] for rounding image data */ |
|
|
MACROBLOCK *const pMBs, /* [output] average motion vectors */ |
|
|
IMAGE *const pGMC) /* [output] full warped image */ |
|
|
{ |
|
|
|
|
|
unsigned int mj,mi; |
|
|
VECTOR avgMV; |
|
|
|
|
|
for (mj = 0;mj < mb_height; mj++) |
|
|
for (mi = 0;mi < mb_width; mi++) { |
|
|
|
|
|
avgMV = generate_GMCimageMB(gmc_data, pRef, mi, mj, |
|
|
stride, stride2, quarterpel, rounding, pGMC); |
|
|
|
|
|
pMBs[mj*mb_width+mi].amv.x = gmc_sanitize(avgMV.x, quarterpel, fcode); |
|
|
pMBs[mj*mb_width+mi].amv.y = gmc_sanitize(avgMV.y, quarterpel, fcode); |
|
|
pMBs[mj*mb_width+mi].mcsel = 0; /* until mode decision */ |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
VECTOR generate_GMCimageMB( const GMC_DATA *const gmc_data, /* [input] all precalc data */ |
|
|
const IMAGE *const pRef, /* [input] */ |
|
|
const int mi, const int mj, /* [input] MB position */ |
|
|
const int stride, /* [input] Lumi stride */ |
|
|
const int stride2, /* [input] chroma stride */ |
|
|
const int quarterpel, /* [input] for rounding of avgMV */ |
|
|
const int rounding, /* [input] for rounding of imgae data */ |
|
|
IMAGE *const pGMC) /* [outut] generate image */ |
|
|
|
|
|
/* |
|
|
type | variable name | ISO name (TeX-style) | value or range | usage |
|
|
------------------------------------------------------------------------------------- |
|
|
p | F | F(i,j) | | pelwise motion vector X in s-th pel |
|
|
p | G | G(i,j) | | pelwise motion vector Y in s-th pel |
|
|
p | Fc | F_c(i,j) | | |
|
|
p | Gc | G_c(i,j) | | same for chroma |
|
|
|
|
|
p | Y00 | Y_{00} | [0,255*s*s] | first: 4 neighbouring Y-values |
|
|
p | Y01 | Y_{01} | [0,255] | at fullpel position, around the |
|
|
p | Y10 | Y_{10} | [0,255*s] | position where pelweise MV points to |
|
|
p | Y11 | Y_{11} | [0,255] | later: bilinear interpol Y-values in Y00 |
|
|
|
|
|
p | C00 | C_{00} | [0,255*s*s] | same for chroma Cb and Cr |
|
|
p | C01 | C_{01} | [0,255] | |
|
|
p | C10 | C_{10} | [0,255*s] | |
|
|
p | C11 | C_{11} | [0,255] | |
|
|
|
|
|
*/ |
|
|
{ |
|
|
const int W = gmc_data->W; |
|
|
const int H = gmc_data->H; |
|
|
|
|
|
const int s = gmc_data->s; |
|
|
const int sigma = gmc_data->sigma; |
|
|
|
|
|
const int r = gmc_data->r; |
|
|
const int rho = gmc_data->rho; |
|
|
|
|
|
const int i0s = gmc_data->i0s; |
|
|
const int j0s = gmc_data->j0s; |
|
|
|
|
|
const int i1ss = gmc_data->i1ss; |
|
|
const int j1ss = gmc_data->j1ss; |
|
|
#if 0 |
|
|
const int i2ss = gmc_data->i2ss; |
|
|
const int j2ss = gmc_data->j2ss; |
|
|
#endif |
|
|
|
|
|
const int alpha = gmc_data->alpha; |
|
|
const int Ws = gmc_data->Ws; |
|
|
|
|
|
#if 0 |
|
|
const int beta = gmc_data->beta; |
|
|
const int Hs = gmc_data->Hs; |
|
|
#endif |
|
|
|
|
|
int I,J; |
|
|
VECTOR avgMV = {0,0}; |
|
|
|
|
|
for (J=16*mj;J<16*(mj+1);J++) |
|
|
for (I=16*mi;I<16*(mi+1);I++) |
|
|
{ |
|
|
int F= i0s + ( ((-r*i0s+i1ss)*I + (r*j0s-j1ss)*J + (1<<(alpha+rho-1))) >> (alpha+rho) ); |
|
|
int G= j0s + ( ((-r*j0s+j1ss)*I + (-r*i0s+i1ss)*J + (1<<(alpha+rho-1))) >> (alpha+rho) ); |
|
|
|
|
|
/* this naive implementation (with lots of multiplications) isn't slower (rather faster) than |
|
|
working incremental. Don't ask me why... maybe the whole this is memory bound? */ |
|
|
|
|
|
const int ri= F & (s-1); /* fractional part of pelwise MV X */ |
|
|
const int rj= G & (s-1); /* fractional part of pelwise MV Y */ |
|
|
|
|
|
int Y00,Y01,Y10,Y11; |
|
|
|
|
|
/* unclipped values are used for avgMV */ |
|
|
avgMV.x += F-(I<<sigma); /* shift position to 1/s-pel, as the MV is */ |
|
|
avgMV.y += G-(J<<sigma); /* TODO: don't do this (of course) */ |
|
|
|
|
|
F >>= sigma; |
|
|
G >>= sigma; |
|
|
|
|
|
/* clip values to be in range. Since we have edges, clip to 1 less than lower boundary |
|
|
this way positions F+1/G+1 are still right */ |
|
|
|
|
|
if (F< -1) |
|
|
F=-1; |
|
|
else if (F>W) |
|
|
F=W; /* W or W-1 doesn't matter, so save 1 subtract ;-) */ |
|
|
if (G< -1) |
|
|
G=-1; |
|
|
else if (G>H) |
|
|
G=H; /* dito */ |
|
|
|
|
|
Y00 = pRef->y[ G*stride + F ]; /* Lumi values */ |
|
|
Y01 = pRef->y[ G*stride + F+1 ]; |
|
|
Y10 = pRef->y[ G*stride + F+stride ]; |
|
|
Y11 = pRef->y[ G*stride + F+stride+1 ]; |
|
|
|
|
|
/* bilinear interpolation */ |
|
|
Y00 = ((s-ri)*Y00 + ri*Y01); |
|
|
Y10 = ((s-ri)*Y10 + ri*Y11); |
|
|
Y00 = ((s-rj)*Y00 + rj*Y10 + s*s/2 - rounding ) >> (sigma+sigma); |
|
|
|
|
|
pGMC->y[J*stride+I] = (uint8_t)Y00; /* output 1 Y-pixel */ |
|
|
} |
|
|
|
|
|
|
|
|
/* doing chroma _here_ is even more stupid and slow, because won't be used until Compensation and |
|
|
most likely not even then (only if the block really _is_ GMC) |
|
|
*/ |
|
|
|
|
|
for (J=8*mj;J<8*(mj+1);J++) /* this plays the role of j_c,i_c in the standard */ |
|
|
for (I=8*mi;I<8*(mi+1);I++) /* For I_c we have to use I_c = 4*i_c+1 ! */ |
|
|
{ |
|
|
/* same positions for both chroma components, U=Cb and V=Cr */ |
|
|
int Fc=((-r*i0s+i1ss)*(4*I+1) + (r*j0s-j1ss)*(4*J+1) +2*Ws*r*i0s |
|
|
-16*Ws +(1<<(alpha+rho+1)))>>(alpha+rho+2); |
|
|
int Gc=((-r*j0s+j1ss)*(4*I+1) +(-r*i0s+i1ss)*(4*J+1) +2*Ws*r*j0s |
|
|
-16*Ws +(1<<(alpha+rho+1))) >>(alpha+rho+2); |
|
|
|
|
|
const int ri= Fc & (s-1); /* fractional part of pelwise MV X */ |
|
|
const int rj= Gc & (s-1); /* fractional part of pelwise MV Y */ |
|
|
|
|
|
int C00,C01,C10,C11; |
|
|
|
|
|
Fc >>= sigma; |
|
|
Gc >>= sigma; |
|
|
|
|
|
if (Fc< -1) |
|
|
Fc=-1; |
|
|
else if (Fc>=W/2) |
|
|
Fc=W/2; /* W or W-1 doesn't matter, so save 1 subtraction ;-) */ |
|
|
if (Gc< -1) |
|
|
Gc=-1; |
|
|
else if (Gc>=H/2) |
|
|
Gc=H/2; /* dito */ |
|
|
|
|
|
/* now calculate U data */ |
|
|
C00 = pRef->u[ Gc*stride2 + Fc ]; /* chroma-value Cb */ |
|
|
C01 = pRef->u[ Gc*stride2 + Fc+1 ]; |
|
|
C10 = pRef->u[ (Gc+1)*stride2 + Fc ]; |
|
|
C11 = pRef->u[ (Gc+1)*stride2 + Fc+1 ]; |
|
|
|
|
|
/* bilinear interpolation */ |
|
|
C00 = ((s-ri)*C00 + ri*C01); |
|
|
C10 = ((s-ri)*C10 + ri*C11); |
|
|
C00 = ((s-rj)*C00 + rj*C10 + s*s/2 - rounding ) >> (sigma+sigma); |
|
|
|
|
|
pGMC->u[J*stride2+I] = (uint8_t)C00; /* output 1 U-pixel */ |
|
|
|
|
|
/* now calculate V data */ |
|
|
C00 = pRef->v[ Gc*stride2 + Fc ]; /* chroma-value Cr */ |
|
|
C01 = pRef->v[ Gc*stride2 + Fc+1 ]; |
|
|
C10 = pRef->v[ (Gc+1)*stride2 + Fc ]; |
|
|
C11 = pRef->v[ (Gc+1)*stride2 + Fc+1 ]; |
|
|
|
|
|
/* bilinear interpolation */ |
|
|
C00 = ((s-ri)*C00 + ri*C01); |
|
|
C10 = ((s-ri)*C10 + ri*C11); |
|
|
C00 = ((s-rj)*C00 + rj*C10 + s*s/2 - rounding ) >> (sigma+sigma); |
|
|
|
|
|
pGMC->v[J*stride2+I] = (uint8_t)C00; /* output 1 V-pixel */ |
|
|
} |
|
|
|
|
|
/* The average vector is rounded from 1/s-pel to 1/2 or 1/4 using the '//' operator */ |
|
|
|
|
|
avgMV.x = RSHIFT( avgMV.x, (sigma+7-quarterpel) ); |
|
|
avgMV.y = RSHIFT( avgMV.y, (sigma+7-quarterpel) ); |
|
|
|
|
|
/* ^^^^ this is the way MS Reference Software does it */ |
|
|
|
|
|
return avgMV; /* clipping to fcode area is done outside! */ |
|
|
} |
|
|
|
|
|
#endif |
|
Parent Directory
| 
Revision Log
| 
Patch