3 |
* XVID MPEG-4 VIDEO CODEC |
* XVID MPEG-4 VIDEO CODEC |
4 |
* - MB prediction header file - |
* - MB prediction header file - |
5 |
* |
* |
6 |
* This program is an implementation of a part of one or more MPEG-4 |
* Copyright(C) 2002 Christoph Lampert <gruel@web.de> |
7 |
* Video tools as specified in ISO/IEC 14496-2 standard. Those intending |
* 2002 Peter Ross <pross@xvid.org> |
8 |
* to use this software module in hardware or software products are |
* |
9 |
* advised that its use may infringe existing patents or copyrights, and |
* This file is part of XviD, a free MPEG-4 video encoder/decoder |
10 |
* any such use would be at such party's own risk. The original |
* |
11 |
* developer of this software module and his/her company, and subsequent |
* XviD is free software; you can redistribute it and/or modify it |
12 |
* editors and their companies, will have no liability for use of this |
* under the terms of the GNU General Public License as published by |
13 |
* software or modifications or derivatives thereof. |
* the Free Software Foundation; either version 2 of the License, or |
|
* |
|
|
* This program is free software; you can redistribute it and/or modify |
|
|
* it under the terms of the GNU General Public License as published by |
|
|
* the xvid_free Software Foundation; either version 2 of the License, or |
|
14 |
* (at your option) any later version. |
* (at your option) any later version. |
15 |
* |
* |
16 |
* This program is distributed in the hope that it will be useful, |
* This program is distributed in the hope that it will be useful, |
19 |
* GNU General Public License for more details. |
* GNU General Public License for more details. |
20 |
* |
* |
21 |
* You should have received a copy of the GNU General Public License |
* You should have received a copy of the GNU General Public License |
22 |
* along with this program; if not, write to the xvid_free Software |
* along with this program; if not, write to the Free Software |
23 |
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
24 |
|
* |
25 |
|
* Under section 8 of the GNU General Public License, the copyright |
26 |
|
* holders of XVID explicitly forbid distribution in the following |
27 |
|
* countries: |
28 |
|
* |
29 |
|
* - Japan |
30 |
|
* - United States of America |
31 |
|
* |
32 |
|
* Linking XviD statically or dynamically with other modules is making a |
33 |
|
* combined work based on XviD. Thus, the terms and conditions of the |
34 |
|
* GNU General Public License cover the whole combination. |
35 |
|
* |
36 |
|
* As a special exception, the copyright holders of XviD give you |
37 |
|
* permission to link XviD with independent modules that communicate with |
38 |
|
* XviD solely through the VFW1.1 and DShow interfaces, regardless of the |
39 |
|
* license terms of these independent modules, and to copy and distribute |
40 |
|
* the resulting combined work under terms of your choice, provided that |
41 |
|
* every copy of the combined work is accompanied by a complete copy of |
42 |
|
* the source code of XviD (the version of XviD used to produce the |
43 |
|
* combined work), being distributed under the terms of the GNU General |
44 |
|
* Public License plus this exception. An independent module is a module |
45 |
|
* which is not derived from or based on XviD. |
46 |
|
* |
47 |
|
* Note that people who make modified versions of XviD are not obligated |
48 |
|
* to grant this special exception for their modified versions; it is |
49 |
|
* their choice whether to do so. The GNU General Public License gives |
50 |
|
* permission to release a modified version without this exception; this |
51 |
|
* exception also makes it possible to release a modified version which |
52 |
|
* carries forward this exception. |
53 |
* |
* |
54 |
* $Id: mbprediction.h,v 1.13 2002-07-10 19:17:49 chl Exp $ |
* $Id: mbprediction.h,v 1.17 2002-11-17 00:35:33 edgomez Exp $ |
55 |
* |
* |
56 |
*************************************************************************/ |
*************************************************************************/ |
57 |
|
|
|
/****************************************************************************** |
|
|
* * |
|
|
* Revision history: * |
|
|
* * |
|
|
* 29.06.2002 get_pmvdata() bounding * |
|
|
* * |
|
|
******************************************************************************/ |
|
|
|
|
|
|
|
58 |
#ifndef _MBPREDICTION_H_ |
#ifndef _MBPREDICTION_H_ |
59 |
#define _MBPREDICTION_H_ |
#define _MBPREDICTION_H_ |
60 |
|
|
70 |
|
|
71 |
#define MVequal(A,B) ( ((A).x)==((B).x) && ((A).y)==((B).y) ) |
#define MVequal(A,B) ( ((A).x)==((B).x) && ((A).y)==((B).y) ) |
72 |
|
|
73 |
|
/***************************************************************************** |
74 |
|
* Prototypes |
75 |
|
****************************************************************************/ |
76 |
|
|
77 |
void MBPrediction(FRAMEINFO * frame, /* <-- The parameter for ACDC and MV prediction */ |
void MBPrediction(FRAMEINFO * frame, /* <-- The parameter for ACDC and MV prediction */ |
78 |
|
|
79 |
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 */ |
103 |
const int bound); |
const int bound); |
104 |
|
|
105 |
|
|
106 |
#ifdef OLD_GETPMV |
/***************************************************************************** |
107 |
/* get_pmvdata returns the median predictor and nothing else */ |
* Inlined functions |
108 |
|
****************************************************************************/ |
|
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; |
|
|
} |
|
|
|
|
|
|
|
|
/* 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 |
|
109 |
|
|
110 |
/* |
/* |
111 |
* MODE_INTER, vm18 page 48 |
* MODE_INTER, vm18 page 48 |
163 |
lpos = lx + ly * mb_width; |
lpos = lx + ly * mb_width; |
164 |
rpos = rx + ry * mb_width; |
rpos = rx + ry * mb_width; |
165 |
tpos = tx + ty * mb_width; |
tpos = tx + ty * mb_width; |
166 |
num_cand = 0; |
last_cand = num_cand = 0; |
167 |
|
|
168 |
if (lpos >= bound && lx >= 0) { |
if (lpos >= bound && lx >= 0) { |
169 |
num_cand++; |
num_cand++; |
189 |
pmv[3] = zeroMV; |
pmv[3] = zeroMV; |
190 |
} |
} |
191 |
|
|
192 |
/* if only one valid candidate predictor, the invalid candiates are set to the canidate */ |
/* |
193 |
|
* If there're more than one candidate, we return the median vector |
194 |
|
* edgomez : the special case "no candidates" is handled the same way |
195 |
|
* because all vectors are set to zero. So the median vector |
196 |
|
* is {0,0}, and this is exactly the vector we must return |
197 |
|
* according to the mpeg4 specs. |
198 |
|
*/ |
199 |
|
|
200 |
if (num_cand != 1) { |
if (num_cand != 1) { |
201 |
/* set median */ |
/* set median */ |
202 |
|
|
270 |
lpos = lx + ly * mb_width; |
lpos = lx + ly * mb_width; |
271 |
rpos = rx + ry * mb_width; |
rpos = rx + ry * mb_width; |
272 |
tpos = tx + ty * mb_width; |
tpos = tx + ty * mb_width; |
273 |
num_cand = 0; |
last_cand = num_cand = 0; |
274 |
|
|
275 |
if (lpos >= bound && lx >= 0) { |
if (lpos >= bound && lx >= 0) { |
276 |
num_cand++; |
num_cand++; |
388 |
lpos = lx + ly * mb_width; |
lpos = lx + ly * mb_width; |
389 |
rpos = rx + ry * mb_width; |
rpos = rx + ry * mb_width; |
390 |
tpos = tx + ty * mb_width; |
tpos = tx + ty * mb_width; |
391 |
num_cand = 0; |
last_cand = num_cand = 0; |
392 |
|
|
393 |
if (lpos >= bound && lx >= 0) { |
if (lpos >= bound && lx >= 0) { |
394 |
num_cand++; |
num_cand++; |
473 |
lpos = lx + ly * mb_width; |
lpos = lx + ly * mb_width; |
474 |
rpos = rx + ry * mb_width; |
rpos = rx + ry * mb_width; |
475 |
tpos = tx + ty * mb_width; |
tpos = tx + ty * mb_width; |
476 |
num_cand = 0; |
last_cand = num_cand = 0; |
477 |
|
|
478 |
if (lpos >= bound && lx >= 0) { |
if (lpos >= bound && lx >= 0) { |
479 |
num_cand++; |
num_cand++; |