30 |
* |
* |
31 |
*************************************************************************/ |
*************************************************************************/ |
32 |
|
|
33 |
/****************************************************************************** |
/*************************************************************************** |
34 |
* * |
* * |
35 |
* Revision history: * |
* Revision history: * |
36 |
* * |
* * |
37 |
* 29.06.2002 get_pmvdata() bounding * |
* 29.06.2002 get_pmvdata() bounding * |
38 |
* * |
* * |
39 |
******************************************************************************/ |
***************************************************************************/ |
|
|
|
40 |
|
|
41 |
#ifndef _MBPREDICTION_H_ |
#ifndef _MBPREDICTION_H_ |
42 |
#define _MBPREDICTION_H_ |
#define _MBPREDICTION_H_ |
54 |
#define MVequal(A,B) ( ((A).x)==((B).x) && ((A).y)==((B).y) ) |
#define MVequal(A,B) ( ((A).x)==((B).x) && ((A).y)==((B).y) ) |
55 |
|
|
56 |
void MBPrediction(FRAMEINFO * frame, /* <-- The parameter for ACDC and MV prediction */ |
void MBPrediction(FRAMEINFO * frame, /* <-- The parameter for ACDC and MV prediction */ |
|
|
|
57 |
uint32_t x_pos, /* <-- The x position of the MB to be searched */ |
uint32_t x_pos, /* <-- The x position of the MB to be searched */ |
|
|
|
58 |
uint32_t y_pos, /* <-- The y position of the MB to be searched */ |
uint32_t y_pos, /* <-- The y position of the MB to be searched */ |
|
|
|
59 |
uint32_t x_dim, /* <-- Number of macroblocks in a row */ |
uint32_t x_dim, /* <-- Number of macroblocks in a row */ |
|
|
|
60 |
int16_t * qcoeff); /* <-> The quantized DCT coefficients */ |
int16_t * qcoeff); /* <-> The quantized DCT coefficients */ |
61 |
|
|
62 |
void add_acdc(MACROBLOCK * pMB, |
void add_acdc(MACROBLOCK * pMB, |
65 |
uint32_t iDcScaler, |
uint32_t iDcScaler, |
66 |
int16_t predictors[8]); |
int16_t predictors[8]); |
67 |
|
|
|
|
|
68 |
void predict_acdc(MACROBLOCK * pMBs, |
void predict_acdc(MACROBLOCK * pMBs, |
69 |
uint32_t x, |
uint32_t x, |
70 |
uint32_t y, |
uint32_t y, |
76 |
int16_t predictors[8], |
int16_t predictors[8], |
77 |
const int bound); |
const int bound); |
78 |
|
|
79 |
|
static const VECTOR zeroMV = { 0, 0 }; |
|
#ifdef OLD_GETPMV |
|
|
/* get_pmvdata returns the median predictor and nothing else */ |
|
|
|
|
|
static __inline VECTOR |
|
|
get_pmv(const MACROBLOCK * const pMBs, |
|
|
const uint32_t x, |
|
|
const uint32_t y, |
|
|
const uint32_t x_dim, |
|
|
const uint32_t block) |
|
|
{ |
|
|
|
|
|
int xin1, xin2, xin3; |
|
|
int yin1, yin2, yin3; |
|
|
int vec1, vec2, vec3; |
|
|
VECTOR lneigh, tneigh, trneigh; /* left neighbour, top neighbour, topright neighbour */ |
|
|
VECTOR median; |
|
|
|
|
|
static VECTOR zeroMV = { 0, 0 }; |
|
|
uint32_t index = x + y * x_dim; |
|
|
|
|
|
/* first row (special case) */ |
|
|
if (y == 0 && (block == 0 || block == 1)) { |
|
|
if ((x == 0) && (block == 0)) // first column, first block |
|
|
{ |
|
|
return zeroMV; |
|
|
} |
|
|
if (block == 1) // second block; has only a left neighbour |
|
|
{ |
|
|
return pMBs[index].mvs[0]; |
|
|
} else { /* block==0, but x!=0, so again, there is a left neighbour */ |
|
|
|
|
|
return pMBs[index - 1].mvs[1]; |
|
|
} |
|
|
} |
|
|
|
|
|
/* |
|
|
* MODE_INTER, vm18 page 48 |
|
|
* MODE_INTER4V vm18 page 51 |
|
|
* |
|
|
* (x,y-1) (x+1,y-1) |
|
|
* [ | ] [ | ] |
|
|
* [ 2 | 3 ] [ 2 | ] |
|
|
* |
|
|
* (x-1,y) (x,y) (x+1,y) |
|
|
* [ | 1 ] [ 0 | 1 ] [ 0 | ] |
|
|
* [ | 3 ] [ 2 | 3 ] [ | ] |
|
|
*/ |
|
|
|
|
|
switch (block) { |
|
|
case 0: |
|
|
xin1 = x - 1; |
|
|
yin1 = y; |
|
|
vec1 = 1; /* left */ |
|
|
xin2 = x; |
|
|
yin2 = y - 1; |
|
|
vec2 = 2; /* top */ |
|
|
xin3 = x + 1; |
|
|
yin3 = y - 1; |
|
|
vec3 = 2; /* top right */ |
|
|
break; |
|
|
case 1: |
|
|
xin1 = x; |
|
|
yin1 = y; |
|
|
vec1 = 0; |
|
|
xin2 = x; |
|
|
yin2 = y - 1; |
|
|
vec2 = 3; |
|
|
xin3 = x + 1; |
|
|
yin3 = y - 1; |
|
|
vec3 = 2; |
|
|
break; |
|
|
case 2: |
|
|
xin1 = x - 1; |
|
|
yin1 = y; |
|
|
vec1 = 3; |
|
|
xin2 = x; |
|
|
yin2 = y; |
|
|
vec2 = 0; |
|
|
xin3 = x; |
|
|
yin3 = y; |
|
|
vec3 = 1; |
|
|
break; |
|
|
default: |
|
|
xin1 = x; |
|
|
yin1 = y; |
|
|
vec1 = 2; |
|
|
xin2 = x; |
|
|
yin2 = y; |
|
|
vec2 = 0; |
|
|
xin3 = x; |
|
|
yin3 = y; |
|
|
vec3 = 1; |
|
|
} |
|
|
|
|
|
|
|
|
if (xin1 < 0 || /* yin1 < 0 || */ xin1 >= (int32_t) x_dim) { |
|
|
lneigh = zeroMV; |
|
|
} else { |
|
|
lneigh = pMBs[xin1 + yin1 * x_dim].mvs[vec1]; |
|
|
} |
|
|
|
|
|
if (xin2 < 0 || /* yin2 < 0 || */ xin2 >= (int32_t) x_dim) { |
|
|
tneigh = zeroMV; |
|
|
} else { |
|
|
tneigh = pMBs[xin2 + yin2 * x_dim].mvs[vec2]; |
|
|
} |
|
|
|
|
|
if (xin3 < 0 || /* yin3 < 0 || */ xin3 >= (int32_t) x_dim) { |
|
|
trneigh = zeroMV; |
|
|
} else { |
|
|
trneigh = pMBs[xin3 + yin3 * x_dim].mvs[vec3]; |
|
|
} |
|
|
|
|
|
/* median,minimum */ |
|
|
|
|
|
median.x = |
|
|
MIN(MAX(lneigh.x, tneigh.x), |
|
|
MIN(MAX(tneigh.x, trneigh.x), MAX(lneigh.x, trneigh.x))); |
|
|
median.y = |
|
|
MIN(MAX(lneigh.y, tneigh.y), |
|
|
MIN(MAX(tneigh.y, trneigh.y), MAX(lneigh.y, trneigh.y))); |
|
|
return median; |
|
|
} |
|
|
|
|
|
|
|
|
static __inline VECTOR |
|
|
get_qpmv(const MACROBLOCK * const pMBs, |
|
|
const uint32_t x, |
|
|
const uint32_t y, |
|
|
const uint32_t x_dim, |
|
|
const uint32_t block) |
|
|
{ |
|
|
|
|
|
int xin1, xin2, xin3; |
|
|
int yin1, yin2, yin3; |
|
|
int vec1, vec2, vec3; |
|
|
VECTOR lneigh, tneigh, trneigh; /* left neighbour, top neighbour, topright neighbour */ |
|
|
VECTOR median; |
|
|
|
|
|
static VECTOR zeroMV = { 0, 0 }; |
|
|
uint32_t index = x + y * x_dim; |
|
|
|
|
|
/* first row (special case) */ |
|
|
if (y == 0 && (block == 0 || block == 1)) { |
|
|
if ((x == 0) && (block == 0)) // first column, first block |
|
|
{ |
|
|
return zeroMV; |
|
|
} |
|
|
if (block == 1) // second block; has only a left neighbour |
|
|
{ |
|
|
return pMBs[index].qmvs[0]; |
|
|
} else { /* block==0, but x!=0, so again, there is a left neighbour */ |
|
|
|
|
|
return pMBs[index - 1].qmvs[1]; |
|
|
} |
|
|
} |
|
|
|
|
|
/* |
|
|
* MODE_INTER, vm18 page 48 |
|
|
* MODE_INTER4V vm18 page 51 |
|
|
* |
|
|
* (x,y-1) (x+1,y-1) |
|
|
* [ | ] [ | ] |
|
|
* [ 2 | 3 ] [ 2 | ] |
|
|
* |
|
|
* (x-1,y) (x,y) (x+1,y) |
|
|
* [ | 1 ] [ 0 | 1 ] [ 0 | ] |
|
|
* [ | 3 ] [ 2 | 3 ] [ | ] |
|
|
*/ |
|
|
|
|
|
switch (block) { |
|
|
case 0: |
|
|
xin1 = x - 1; |
|
|
yin1 = y; |
|
|
vec1 = 1; /* left */ |
|
|
xin2 = x; |
|
|
yin2 = y - 1; |
|
|
vec2 = 2; /* top */ |
|
|
xin3 = x + 1; |
|
|
yin3 = y - 1; |
|
|
vec3 = 2; /* top right */ |
|
|
break; |
|
|
case 1: |
|
|
xin1 = x; |
|
|
yin1 = y; |
|
|
vec1 = 0; |
|
|
xin2 = x; |
|
|
yin2 = y - 1; |
|
|
vec2 = 3; |
|
|
xin3 = x + 1; |
|
|
yin3 = y - 1; |
|
|
vec3 = 2; |
|
|
break; |
|
|
case 2: |
|
|
xin1 = x - 1; |
|
|
yin1 = y; |
|
|
vec1 = 3; |
|
|
xin2 = x; |
|
|
yin2 = y; |
|
|
vec2 = 0; |
|
|
xin3 = x; |
|
|
yin3 = y; |
|
|
vec3 = 1; |
|
|
break; |
|
|
default: |
|
|
xin1 = x; |
|
|
yin1 = y; |
|
|
vec1 = 2; |
|
|
xin2 = x; |
|
|
yin2 = y; |
|
|
vec2 = 0; |
|
|
xin3 = x; |
|
|
yin3 = y; |
|
|
vec3 = 1; |
|
|
} |
|
|
|
|
|
|
|
|
if (xin1 < 0 || /* yin1 < 0 || */ xin1 >= (int32_t) x_dim) { |
|
|
lneigh = zeroMV; |
|
|
} else { |
|
|
lneigh = pMBs[xin1 + yin1 * x_dim].qmvs[vec1]; |
|
|
} |
|
|
|
|
|
if (xin2 < 0 || /* yin2 < 0 || */ xin2 >= (int32_t) x_dim) { |
|
|
tneigh = zeroMV; |
|
|
} else { |
|
|
tneigh = pMBs[xin2 + yin2 * x_dim].qmvs[vec2]; |
|
|
} |
|
|
|
|
|
if (xin3 < 0 || /* yin3 < 0 || */ xin3 >= (int32_t) x_dim) { |
|
|
trneigh = zeroMV; |
|
|
} else { |
|
|
trneigh = pMBs[xin3 + yin3 * x_dim].qmvs[vec3]; |
|
|
} |
|
|
|
|
|
/* median,minimum */ |
|
|
|
|
|
median.x = |
|
|
MIN(MAX(lneigh.x, tneigh.x), |
|
|
MIN(MAX(tneigh.x, trneigh.x), MAX(lneigh.x, trneigh.x))); |
|
|
median.y = |
|
|
MIN(MAX(lneigh.y, tneigh.y), |
|
|
MIN(MAX(tneigh.y, trneigh.y), MAX(lneigh.y, trneigh.y))); |
|
|
return median; |
|
|
} |
|
|
|
|
|
/* This is somehow a copy of get_pmv, but returning all MVs and Minimum SAD |
|
|
instead of only Median MV */ |
|
|
|
|
|
static __inline int |
|
|
get_pmvdata(const MACROBLOCK * const pMBs, |
|
|
const uint32_t x, |
|
|
const uint32_t y, |
|
|
const uint32_t x_dim, |
|
|
const uint32_t block, |
|
|
VECTOR * const pmv, |
|
|
int32_t * const psad) |
|
|
{ |
|
|
|
|
|
/* |
|
|
* pmv are filled with: |
|
|
* [0]: Median (or whatever is correct in a special case) |
|
|
* [1]: left neighbour |
|
|
* [2]: top neighbour |
|
|
* [3]: topright neighbour |
|
|
* psad are filled with: |
|
|
* [0]: minimum of [1] to [3] |
|
|
* [1]: left neighbour's SAD (NB:[1] to [3] are actually not needed) |
|
|
* [2]: top neighbour's SAD |
|
|
* [3]: topright neighbour's SAD |
|
|
*/ |
|
|
|
|
|
int xin1, xin2, xin3; |
|
|
int yin1, yin2, yin3; |
|
|
int vec1, vec2, vec3; |
|
|
|
|
|
uint32_t index = x + y * x_dim; |
|
|
const VECTOR zeroMV = { 0, 0 }; |
|
|
|
|
|
// first row of blocks (special case) |
|
|
if (y == 0 && (block == 0 || block == 1)) { |
|
|
if ((x == 0) && (block == 0)) // first column, first block |
|
|
{ |
|
|
pmv[0] = pmv[1] = pmv[2] = pmv[3] = zeroMV; |
|
|
psad[0] = 0; |
|
|
psad[1] = psad[2] = psad[3] = MV_MAX_ERROR; |
|
|
return 0; |
|
|
} |
|
|
if (block == 1) // second block; has only a left neighbour |
|
|
{ |
|
|
pmv[0] = pmv[1] = pMBs[index].mvs[0]; |
|
|
pmv[2] = pmv[3] = zeroMV; |
|
|
psad[0] = psad[1] = pMBs[index].sad8[0]; |
|
|
psad[2] = psad[3] = MV_MAX_ERROR; |
|
|
return 0; |
|
|
} else { /* block==0, but x!=0, so again, there is a left neighbour */ |
|
|
|
|
|
pmv[0] = pmv[1] = pMBs[index - 1].mvs[1]; |
|
|
pmv[2] = pmv[3] = zeroMV; |
|
|
psad[0] = psad[1] = pMBs[index - 1].sad8[1]; |
|
|
psad[2] = psad[3] = MV_MAX_ERROR; |
|
|
return 0; |
|
|
} |
|
|
} |
|
|
|
|
|
/* |
|
|
* MODE_INTER, vm18 page 48 |
|
|
* MODE_INTER4V vm18 page 51 |
|
|
* |
|
|
* (x,y-1) (x+1,y-1) |
|
|
* [ | ] [ | ] |
|
|
* [ 2 | 3 ] [ 2 | ] |
|
|
* |
|
|
* (x-1,y) (x,y) (x+1,y) |
|
|
* [ | 1 ] [ 0 | 1 ] [ 0 | ] |
|
|
* [ | 3 ] [ 2 | 3 ] [ | ] |
|
|
*/ |
|
|
|
|
|
switch (block) { |
|
|
case 0: |
|
|
xin1 = x - 1; |
|
|
yin1 = y; |
|
|
vec1 = 1; /* left */ |
|
|
xin2 = x; |
|
|
yin2 = y - 1; |
|
|
vec2 = 2; /* top */ |
|
|
xin3 = x + 1; |
|
|
yin3 = y - 1; |
|
|
vec3 = 2; /* top right */ |
|
|
break; |
|
|
case 1: |
|
|
xin1 = x; |
|
|
yin1 = y; |
|
|
vec1 = 0; |
|
|
xin2 = x; |
|
|
yin2 = y - 1; |
|
|
vec2 = 3; |
|
|
xin3 = x + 1; |
|
|
yin3 = y - 1; |
|
|
vec3 = 2; |
|
|
break; |
|
|
case 2: |
|
|
xin1 = x - 1; |
|
|
yin1 = y; |
|
|
vec1 = 3; |
|
|
xin2 = x; |
|
|
yin2 = y; |
|
|
vec2 = 0; |
|
|
xin3 = x; |
|
|
yin3 = y; |
|
|
vec3 = 1; |
|
|
break; |
|
|
default: |
|
|
xin1 = x; |
|
|
yin1 = y; |
|
|
vec1 = 2; |
|
|
xin2 = x; |
|
|
yin2 = y; |
|
|
vec2 = 0; |
|
|
xin3 = x; |
|
|
yin3 = y; |
|
|
vec3 = 1; |
|
|
} |
|
|
|
|
|
|
|
|
if (xin1 < 0 || xin1 >= (int32_t) x_dim) { |
|
|
pmv[1] = zeroMV; |
|
|
psad[1] = MV_MAX_ERROR; |
|
|
} else { |
|
|
pmv[1] = pMBs[xin1 + yin1 * x_dim].mvs[vec1]; |
|
|
psad[1] = pMBs[xin1 + yin1 * x_dim].sad8[vec1]; |
|
|
} |
|
|
|
|
|
if (xin2 < 0 || xin2 >= (int32_t) x_dim) { |
|
|
pmv[2] = zeroMV; |
|
|
psad[2] = MV_MAX_ERROR; |
|
|
} else { |
|
|
pmv[2] = pMBs[xin2 + yin2 * x_dim].mvs[vec2]; |
|
|
psad[2] = pMBs[xin2 + yin2 * x_dim].sad8[vec2]; |
|
|
} |
|
|
|
|
|
if (xin3 < 0 || xin3 >= (int32_t) x_dim) { |
|
|
pmv[3] = zeroMV; |
|
|
psad[3] = MV_MAX_ERROR; |
|
|
} else { |
|
|
pmv[3] = pMBs[xin3 + yin3 * x_dim].mvs[vec3]; |
|
|
psad[3] = pMBs[xin3 + yin3 * x_dim].sad8[vec3]; |
|
|
} |
|
|
|
|
|
if ((MVequal(pmv[1], pmv[2])) && (MVequal(pmv[1], pmv[3]))) { |
|
|
pmv[0] = pmv[1]; |
|
|
psad[0] = MIN(MIN(psad[1], psad[2]), psad[3]); |
|
|
return 1; |
|
|
} |
|
|
|
|
|
/* median,minimum */ |
|
|
|
|
|
pmv[0].x = |
|
|
MIN(MAX(pmv[1].x, pmv[2].x), |
|
|
MIN(MAX(pmv[2].x, pmv[3].x), MAX(pmv[1].x, pmv[3].x))); |
|
|
pmv[0].y = |
|
|
MIN(MAX(pmv[1].y, pmv[2].y), |
|
|
MIN(MAX(pmv[2].y, pmv[3].y), MAX(pmv[1].y, pmv[3].y))); |
|
|
psad[0] = MIN(MIN(psad[1], psad[2]), psad[3]); |
|
|
|
|
|
return 0; |
|
|
} |
|
|
|
|
|
#endif |
|
|
|
|
80 |
/* |
/* |
81 |
* MODE_INTER, vm18 page 48 |
* MODE_INTER, vm18 page 48 |
82 |
* MODE_INTER4V vm18 page 51 |
* MODE_INTER4V vm18 page 51 |
98 |
const int y, |
const int y, |
99 |
const int block) |
const int block) |
100 |
{ |
{ |
|
static const VECTOR zeroMV = { 0, 0 }; |
|
|
|
|
101 |
int lx, ly, lz; /* left */ |
int lx, ly, lz; /* left */ |
102 |
int tx, ty, tz; /* top */ |
int tx, ty, tz; /* top */ |
103 |
int rx, ry, rz; /* top-right */ |
int rx, ry, rz; /* top-right */ |
104 |
int lpos, tpos, rpos; |
int lpos, tpos, rpos; |
105 |
int num_cand, last_cand; |
int num_cand = 0, last_cand = 1; |
106 |
|
|
107 |
VECTOR pmv[4]; /* left neighbour, top neighbour, top-right neighbour */ |
VECTOR pmv[4]; /* left neighbour, top neighbour, top-right neighbour */ |
108 |
|
|
131 |
lpos = lx + ly * mb_width; |
lpos = lx + ly * mb_width; |
132 |
rpos = rx + ry * mb_width; |
rpos = rx + ry * mb_width; |
133 |
tpos = tx + ty * mb_width; |
tpos = tx + ty * mb_width; |
|
last_cand = num_cand = 0; |
|
134 |
|
|
135 |
if (lpos >= bound && lx >= 0) { |
if (lpos >= bound && lx >= 0) { |
136 |
num_cand++; |
num_cand++; |
|
last_cand = 1; |
|
137 |
pmv[1] = mbs[lpos].mvs[lz]; |
pmv[1] = mbs[lpos].mvs[lz]; |
138 |
} else { |
} else pmv[1] = zeroMV; |
|
pmv[1] = zeroMV; |
|
|
} |
|
139 |
|
|
140 |
if (tpos >= bound) { |
if (tpos >= bound) { |
141 |
num_cand++; |
num_cand++; |
142 |
last_cand = 2; |
last_cand = 2; |
143 |
pmv[2] = mbs[tpos].mvs[tz]; |
pmv[2] = mbs[tpos].mvs[tz]; |
144 |
} else { |
} else pmv[2] = zeroMV; |
|
pmv[2] = zeroMV; |
|
|
} |
|
145 |
|
|
146 |
if (rpos >= bound && rx < mb_width) { |
if (rpos >= bound && rx < mb_width) { |
147 |
num_cand++; |
num_cand++; |
148 |
last_cand = 3; |
last_cand = 3; |
149 |
pmv[3] = mbs[rpos].mvs[rz]; |
pmv[3] = mbs[rpos].mvs[rz]; |
150 |
} else { |
} else pmv[3] = zeroMV; |
|
pmv[3] = zeroMV; |
|
|
} |
|
151 |
|
|
152 |
/* |
/* If there're more than one candidate, we return the median vector */ |
|
* If there're more than one candidate, we return the median vector |
|
|
* edgomez : the special case "no candidates" is handled the same way |
|
|
* because all vectors are set to zero. So the median vector |
|
|
* is {0,0}, and this is exactly the vector we must return |
|
|
* according to the mpeg4 specs. |
|
|
*/ |
|
|
if (num_cand != 1) { |
|
|
/* set median */ |
|
153 |
|
|
154 |
|
if (num_cand > 1) { |
155 |
|
/* set median */ |
156 |
pmv[0].x = |
pmv[0].x = |
157 |
MIN(MAX(pmv[1].x, pmv[2].x), |
MIN(MAX(pmv[1].x, pmv[2].x), |
158 |
MIN(MAX(pmv[2].x, pmv[3].x), MAX(pmv[1].x, pmv[3].x))); |
MIN(MAX(pmv[2].x, pmv[3].x), MAX(pmv[1].x, pmv[3].x))); |
165 |
return pmv[last_cand]; /* no point calculating median mv */ |
return pmv[last_cand]; /* no point calculating median mv */ |
166 |
} |
} |
167 |
|
|
|
|
|
|
|
|
|
/* |
|
|
* MODE_INTER, vm18 page 48 |
|
|
* MODE_INTER4V vm18 page 51 |
|
|
* |
|
|
* (x,y-1) (x+1,y-1) |
|
|
* [ | ] [ | ] |
|
|
* [ 2 | 3 ] [ 2 | ] |
|
|
* |
|
|
* (x-1,y) (x,y) (x+1,y) |
|
|
* [ | 1 ] [ 0 | 1 ] [ 0 | ] |
|
|
* [ | 3 ] [ 2 | 3 ] [ | ] |
|
|
*/ |
|
|
|
|
168 |
static __inline VECTOR |
static __inline VECTOR |
169 |
get_qpmv2(const MACROBLOCK * const mbs, |
get_qpmv2(const MACROBLOCK * const mbs, |
170 |
const int mb_width, |
const int mb_width, |
173 |
const int y, |
const int y, |
174 |
const int block) |
const int block) |
175 |
{ |
{ |
|
static const VECTOR zeroMV = { 0, 0 }; |
|
|
|
|
176 |
int lx, ly, lz; /* left */ |
int lx, ly, lz; /* left */ |
177 |
int tx, ty, tz; /* top */ |
int tx, ty, tz; /* top */ |
178 |
int rx, ry, rz; /* top-right */ |
int rx, ry, rz; /* top-right */ |
179 |
int lpos, tpos, rpos; |
int lpos, tpos, rpos; |
180 |
int num_cand, last_cand; |
int num_cand = 0, last_cand = 1; |
181 |
|
|
182 |
VECTOR pmv[4]; /* left neighbour, top neighbour, top-right neighbour */ |
VECTOR pmv[4]; /* left neighbour, top neighbour, top-right neighbour */ |
183 |
|
|
206 |
lpos = lx + ly * mb_width; |
lpos = lx + ly * mb_width; |
207 |
rpos = rx + ry * mb_width; |
rpos = rx + ry * mb_width; |
208 |
tpos = tx + ty * mb_width; |
tpos = tx + ty * mb_width; |
|
last_cand = num_cand = 0; |
|
209 |
|
|
210 |
if (lpos >= bound && lx >= 0) { |
if (lpos >= bound && lx >= 0) { |
211 |
num_cand++; |
num_cand++; |
|
last_cand = 1; |
|
212 |
pmv[1] = mbs[lpos].qmvs[lz]; |
pmv[1] = mbs[lpos].qmvs[lz]; |
213 |
} else { |
} else pmv[1] = zeroMV; |
|
pmv[1] = zeroMV; |
|
|
} |
|
214 |
|
|
215 |
if (tpos >= bound) { |
if (tpos >= bound) { |
216 |
num_cand++; |
num_cand++; |
217 |
last_cand = 2; |
last_cand = 2; |
218 |
pmv[2] = mbs[tpos].qmvs[tz]; |
pmv[2] = mbs[tpos].qmvs[tz]; |
219 |
} else { |
} else pmv[2] = zeroMV; |
|
pmv[2] = zeroMV; |
|
|
} |
|
220 |
|
|
221 |
if (rpos >= bound && rx < mb_width) { |
if (rpos >= bound && rx < mb_width) { |
222 |
num_cand++; |
num_cand++; |
223 |
last_cand = 3; |
last_cand = 3; |
224 |
pmv[3] = mbs[rpos].qmvs[rz]; |
pmv[3] = mbs[rpos].qmvs[rz]; |
225 |
} else { |
} else pmv[3] = zeroMV; |
|
pmv[3] = zeroMV; |
|
|
} |
|
226 |
|
|
227 |
/* |
/* If there're more than one candidate, we return the median vector */ |
|
* If there're more than one candidate, we return the median vector |
|
|
* edgomez : the special case "no candidates" is handled the same way |
|
|
* because all vectors are set to zero. So the median vector |
|
|
* is {0,0}, and this is exactly the vector we must return |
|
|
* according to the mpeg4 specs. |
|
|
*/ |
|
|
if (num_cand != 1) { |
|
|
/* set median */ |
|
228 |
|
|
229 |
|
if (num_cand > 1) { |
230 |
|
/* set median */ |
231 |
pmv[0].x = |
pmv[0].x = |
232 |
MIN(MAX(pmv[1].x, pmv[2].x), |
MIN(MAX(pmv[1].x, pmv[2].x), |
233 |
MIN(MAX(pmv[2].x, pmv[3].x), MAX(pmv[1].x, pmv[3].x))); |
MIN(MAX(pmv[2].x, pmv[3].x), MAX(pmv[1].x, pmv[3].x))); |
240 |
return pmv[last_cand]; /* no point calculating median mv */ |
return pmv[last_cand]; /* no point calculating median mv */ |
241 |
} |
} |
242 |
|
|
|
|
|
243 |
/* |
/* |
244 |
* pmv are filled with: |
* pmv are filled with: |
245 |
* [0]: Median (or whatever is correct in a special case) |
* [0]: Median (or whatever is correct in a special case) |
263 |
VECTOR * const pmv, |
VECTOR * const pmv, |
264 |
int32_t * const psad) |
int32_t * const psad) |
265 |
{ |
{ |
|
static const VECTOR zeroMV = { 0, 0 }; |
|
|
|
|
266 |
int lx, ly, lz; /* left */ |
int lx, ly, lz; /* left */ |
267 |
int tx, ty, tz; /* top */ |
int tx, ty, tz; /* top */ |
268 |
int rx, ry, rz; /* top-right */ |
int rx, ry, rz; /* top-right */ |
269 |
int lpos, tpos, rpos; |
int lpos, tpos, rpos; |
270 |
int num_cand, last_cand; |
int num_cand = 0, last_cand = 1; |
271 |
|
|
272 |
switch (block) { |
switch (block) { |
273 |
case 0: |
case 0: |
294 |
lpos = lx + ly * mb_width; |
lpos = lx + ly * mb_width; |
295 |
rpos = rx + ry * mb_width; |
rpos = rx + ry * mb_width; |
296 |
tpos = tx + ty * mb_width; |
tpos = tx + ty * mb_width; |
|
last_cand = num_cand = 0; |
|
297 |
|
|
298 |
if (lpos >= bound && lx >= 0) { |
if (lpos >= bound && lx >= 0) { |
299 |
num_cand++; |
num_cand++; |
326 |
} |
} |
327 |
|
|
328 |
/* original pmvdata() compatibility hack */ |
/* original pmvdata() compatibility hack */ |
329 |
if (x == 0 && y == 0 && block == 0) |
if (x == 0 && y == 0 && block == 0) { |
|
{ |
|
330 |
pmv[0] = pmv[1] = pmv[2] = pmv[3] = zeroMV; |
pmv[0] = pmv[1] = pmv[2] = pmv[3] = zeroMV; |
331 |
psad[0] = 0; |
psad[0] = 0; |
332 |
psad[1] = psad[2] = psad[3] = MV_MAX_ERROR; |
psad[1] = psad[2] = psad[3] = MV_MAX_ERROR; |
347 |
pmv[0] = pmv[1]; |
pmv[0] = pmv[1]; |
348 |
psad[0] = MIN(MIN(psad[1], psad[2]), psad[3]); |
psad[0] = MIN(MIN(psad[1], psad[2]), psad[3]); |
349 |
return 1; |
return 1; |
|
/* compatibility patch */ |
|
|
//return y==0 && block <= 1 ? 0 : 1; |
|
350 |
} |
} |
351 |
|
|
352 |
/* set median, minimum */ |
/* set median, minimum */ |
363 |
return 0; |
return 0; |
364 |
} |
} |
365 |
|
|
|
/* copies of get_pmv and get_pmvdata for prediction from integer search */ |
|
|
|
|
|
static __inline VECTOR |
|
|
get_ipmv(const MACROBLOCK * const mbs, |
|
|
const int mb_width, |
|
|
const int bound, |
|
|
const int x, |
|
|
const int y, |
|
|
const int block) |
|
|
{ |
|
|
static const VECTOR zeroMV = { 0, 0 }; |
|
|
|
|
|
int lx, ly, lz; /* left */ |
|
|
int tx, ty, tz; /* top */ |
|
|
int rx, ry, rz; /* top-right */ |
|
|
int lpos, tpos, rpos; |
|
|
int num_cand, last_cand; |
|
|
|
|
|
VECTOR pmv[4]; /* left neighbour, top neighbour, top-right neighbour */ |
|
|
|
|
|
switch (block) { |
|
|
case 0: |
|
|
lx = x - 1; ly = y; lz = 1; |
|
|
tx = x; ty = y - 1; tz = 2; |
|
|
rx = x + 1; ry = y - 1; rz = 2; |
|
|
break; |
|
|
case 1: |
|
|
lx = x; ly = y; lz = 0; |
|
|
tx = x; ty = y - 1; tz = 3; |
|
|
rx = x + 1; ry = y - 1; rz = 2; |
|
|
break; |
|
|
case 2: |
|
|
lx = x - 1; ly = y; lz = 3; |
|
|
tx = x; ty = y; tz = 0; |
|
|
rx = x; ry = y; rz = 1; |
|
|
break; |
|
|
default: |
|
|
lx = x; ly = y; lz = 2; |
|
|
tx = x; ty = y; tz = 0; |
|
|
rx = x; ry = y; rz = 1; |
|
|
} |
|
|
|
|
|
lpos = lx + ly * mb_width; |
|
|
rpos = rx + ry * mb_width; |
|
|
tpos = tx + ty * mb_width; |
|
|
num_cand = 0; |
|
|
|
|
|
if (lpos >= bound && lx >= 0) { |
|
|
num_cand++; |
|
|
last_cand = 1; |
|
|
pmv[1] = mbs[lpos].i_mvs[lz]; |
|
|
} else { |
|
|
pmv[1] = zeroMV; |
|
|
} |
|
|
|
|
|
if (tpos >= bound) { |
|
|
num_cand++; |
|
|
last_cand = 2; |
|
|
pmv[2] = mbs[tpos].i_mvs[tz]; |
|
|
} else { |
|
|
pmv[2] = zeroMV; |
|
|
} |
|
|
|
|
|
if (rpos >= bound && rx < mb_width) { |
|
|
num_cand++; |
|
|
last_cand = 3; |
|
|
pmv[3] = mbs[rpos].i_mvs[rz]; |
|
|
} else { |
|
|
pmv[3] = zeroMV; |
|
|
} |
|
|
|
|
|
/* if only one valid candidate predictor, the invalid candiates are set to the canidate */ |
|
|
if (num_cand != 1) { |
|
|
/* set median */ |
|
|
|
|
|
pmv[0].x = |
|
|
MIN(MAX(pmv[1].x, pmv[2].x), |
|
|
MIN(MAX(pmv[2].x, pmv[3].x), MAX(pmv[1].x, pmv[3].x))); |
|
|
pmv[0].y = |
|
|
MIN(MAX(pmv[1].y, pmv[2].y), |
|
|
MIN(MAX(pmv[2].y, pmv[3].y), MAX(pmv[1].y, pmv[3].y))); |
|
|
return pmv[0]; |
|
|
} |
|
|
|
|
|
return pmv[last_cand]; /* no point calculating median mv */ |
|
|
} |
|
|
|
|
|
static __inline int |
|
|
get_ipmvdata(const MACROBLOCK * const mbs, |
|
|
const int mb_width, |
|
|
const int bound, |
|
|
const int x, |
|
|
const int y, |
|
|
const int block, |
|
|
VECTOR * const pmv, |
|
|
int32_t * const psad) |
|
|
{ |
|
|
static const VECTOR zeroMV = { 0, 0 }; |
|
|
|
|
|
int lx, ly, lz; /* left */ |
|
|
int tx, ty, tz; /* top */ |
|
|
int rx, ry, rz; /* top-right */ |
|
|
int lpos, tpos, rpos; |
|
|
int num_cand, last_cand; |
|
|
|
|
|
switch (block) { |
|
|
case 0: |
|
|
lx = x - 1; ly = y; lz = 1; |
|
|
tx = x; ty = y - 1; tz = 2; |
|
|
rx = x + 1; ry = y - 1; rz = 2; |
|
|
break; |
|
|
case 1: |
|
|
lx = x; ly = y; lz = 0; |
|
|
tx = x; ty = y - 1; tz = 3; |
|
|
rx = x + 1; ry = y - 1; rz = 2; |
|
|
break; |
|
|
case 2: |
|
|
lx = x - 1; ly = y; lz = 3; |
|
|
tx = x; ty = y; tz = 0; |
|
|
rx = x; ry = y; rz = 1; |
|
|
break; |
|
|
default: |
|
|
lx = x; ly = y; lz = 2; |
|
|
tx = x; ty = y; tz = 0; |
|
|
rx = x; ry = y; rz = 1; |
|
|
} |
|
|
|
|
|
lpos = lx + ly * mb_width; |
|
|
rpos = rx + ry * mb_width; |
|
|
tpos = tx + ty * mb_width; |
|
|
num_cand = 0; |
|
|
|
|
|
if (lpos >= bound && lx >= 0) { |
|
|
num_cand++; |
|
|
last_cand = 1; |
|
|
pmv[1] = mbs[lpos].i_mvs[lz]; |
|
|
psad[1] = mbs[lpos].i_sad8[lz]; |
|
|
} else { |
|
|
pmv[1] = zeroMV; |
|
|
psad[1] = MV_MAX_ERROR; |
|
|
} |
|
|
|
|
|
if (tpos >= bound) { |
|
|
num_cand++; |
|
|
last_cand = 2; |
|
|
pmv[2]= mbs[tpos].i_mvs[tz]; |
|
|
psad[2] = mbs[tpos].i_sad8[tz]; |
|
|
} else { |
|
|
pmv[2] = zeroMV; |
|
|
psad[2] = MV_MAX_ERROR; |
|
|
} |
|
|
|
|
|
if (rpos >= bound && rx < mb_width) { |
|
|
num_cand++; |
|
|
last_cand = 3; |
|
|
pmv[3] = mbs[rpos].i_mvs[rz]; |
|
|
psad[3] = mbs[rpos].i_sad8[rz]; |
|
|
} else { |
|
|
pmv[3] = zeroMV; |
|
|
psad[3] = MV_MAX_ERROR; |
|
|
} |
|
|
|
|
|
/* original pmvdata() compatibility hack */ |
|
|
if (x == 0 && y == 0 && block == 0) |
|
|
{ |
|
|
pmv[0] = pmv[1] = pmv[2] = pmv[3] = zeroMV; |
|
|
psad[0] = 0; |
|
|
psad[1] = psad[2] = psad[3] = MV_MAX_ERROR; |
|
|
return 0; |
|
|
} |
|
|
|
|
|
/* if only one valid candidate preictor, the invalid candiates are set to the canidate */ |
|
|
if (num_cand == 1) { |
|
|
pmv[0] = pmv[last_cand]; |
|
|
psad[0] = psad[last_cand]; |
|
|
// return MVequal(pmv[0], zeroMV); /* no point calculating median mv and minimum sad */ |
|
|
|
|
|
/* original pmvdata() compatibility hack */ |
|
|
return y==0 && block <= 1 ? 0 : MVequal(pmv[0], zeroMV); |
|
|
} |
|
|
|
|
|
if ((MVequal(pmv[1], pmv[2])) && (MVequal(pmv[1], pmv[3]))) { |
|
|
pmv[0] = pmv[1]; |
|
|
psad[0] = MIN(MIN(psad[1], psad[2]), psad[3]); |
|
|
return 1; |
|
|
/* compatibility patch */ |
|
|
//return y==0 && block <= 1 ? 0 : 1; |
|
|
} |
|
|
|
|
|
/* set median, minimum */ |
|
|
|
|
|
pmv[0].x = |
|
|
MIN(MAX(pmv[1].x, pmv[2].x), |
|
|
MIN(MAX(pmv[2].x, pmv[3].x), MAX(pmv[1].x, pmv[3].x))); |
|
|
pmv[0].y = |
|
|
MIN(MAX(pmv[1].y, pmv[2].y), |
|
|
MIN(MAX(pmv[2].y, pmv[3].y), MAX(pmv[1].y, pmv[3].y))); |
|
|
|
|
|
psad[0] = MIN(MIN(psad[1], psad[2]), psad[3]); |
|
|
|
|
|
return 0; |
|
|
} |
|
|
|
|
|
|
|
366 |
#endif /* _MBPREDICTION_H_ */ |
#endif /* _MBPREDICTION_H_ */ |