1 |
|
/************************************************************************** |
2 |
|
* |
3 |
|
* XVID MPEG-4 VIDEO CODEC |
4 |
|
* - MB prediction header file - |
5 |
|
* |
6 |
|
* This program is an implementation of a part of one or more MPEG-4 |
7 |
|
* Video tools as specified in ISO/IEC 14496-2 standard. Those intending |
8 |
|
* to use this software module in hardware or software products are |
9 |
|
* advised that its use may infringe existing patents or copyrights, and |
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 |
12 |
|
* editors and their companies, will have no liability for use of this |
13 |
|
* software or modifications or derivatives thereof. |
14 |
|
* |
15 |
|
* This program is free software; you can redistribute it and/or modify |
16 |
|
* it under the terms of the GNU General Public License as published by |
17 |
|
* the xvid_free Software Foundation; either version 2 of the License, or |
18 |
|
* (at your option) any later version. |
19 |
|
* |
20 |
|
* This program is distributed in the hope that it will be useful, |
21 |
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
22 |
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
23 |
|
* GNU General Public License for more details. |
24 |
|
* |
25 |
|
* You should have received a copy of the GNU General Public License |
26 |
|
* along with this program; if not, write to the xvid_free Software |
27 |
|
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
28 |
|
* |
29 |
|
* $Id: mbprediction.h,v 1.21 2003-02-21 14:41:23 syskin Exp $ |
30 |
|
* |
31 |
|
*************************************************************************/ |
32 |
|
|
33 |
|
/*************************************************************************** |
34 |
|
* * |
35 |
|
* Revision history: * |
36 |
|
* * |
37 |
|
* 29.06.2002 get_pmvdata() bounding * |
38 |
|
* * |
39 |
|
***************************************************************************/ |
40 |
|
|
41 |
#ifndef _MBPREDICTION_H_ |
#ifndef _MBPREDICTION_H_ |
42 |
#define _MBPREDICTION_H_ |
#define _MBPREDICTION_H_ |
43 |
|
|
48 |
#define MIN(X, Y) ((X)<(Y)?(X):(Y)) |
#define MIN(X, Y) ((X)<(Y)?(X):(Y)) |
49 |
#define MAX(X, Y) ((X)>(Y)?(X):(Y)) |
#define MAX(X, Y) ((X)>(Y)?(X):(Y)) |
50 |
|
|
51 |
// very large value |
/* very large value */ |
52 |
#define MV_MAX_ERROR (4096 * 256) |
#define MV_MAX_ERROR (4096 * 256) |
53 |
|
|
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(MBParam *pParam, /* <-- 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 */ |
|
MACROBLOCK *MB_array /* <-> the array of all the MB Infomations */ |
|
|
); |
|
61 |
|
|
62 |
void add_acdc(MACROBLOCK *pMB, |
void add_acdc(MACROBLOCK *pMB, |
63 |
uint32_t block, |
uint32_t block, |
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 y, uint32_t mb_width, |
uint32_t x, |
70 |
|
uint32_t y, |
71 |
|
uint32_t mb_width, |
72 |
uint32_t block, |
uint32_t block, |
73 |
int16_t qcoeff[64], |
int16_t qcoeff[64], |
74 |
uint32_t current_quant, |
uint32_t current_quant, |
75 |
int32_t iDcScaler, |
int32_t iDcScaler, |
76 |
int16_t predictors[8]); |
int16_t predictors[8], |
77 |
|
const int bound); |
|
/* This is somehow a copy of get_pmv, but returning all MVs and Minimum SAD |
|
|
instead of only Median MV */ |
|
78 |
|
|
79 |
static __inline int get_pmvdata(const MACROBLOCK * const pMBs, |
static const VECTOR zeroMV = { 0, 0 }; |
80 |
const uint32_t x, const uint32_t y, |
/* |
81 |
const uint32_t x_dim, |
* MODE_INTER, vm18 page 48 |
82 |
const uint32_t block, |
* MODE_INTER4V vm18 page 51 |
83 |
VECTOR * const pmv, |
* |
84 |
int32_t * const psad) |
* (x,y-1) (x+1,y-1) |
85 |
{ |
* [ | ] [ | ] |
86 |
/* pmv are filled with: |
* [ 2 | 3 ] [ 2 | ] |
87 |
[0]: Median (or whatever is correct in a special case) |
* |
88 |
[1]: left neighbour |
* (x-1,y) (x,y) (x+1,y) |
89 |
[2]: top neighbour, |
* [ | 1 ] [ 0 | 1 ] [ 0 | ] |
90 |
[3]: topright neighbour, |
* [ | 3 ] [ 2 | 3 ] [ | ] |
|
psad are filled with: |
|
|
[0]: minimum of [1] to [3] |
|
|
[1]: left neighbour's SAD // [1] to [3] are actually not needed |
|
|
[2]: top neighbour's SAD, |
|
|
[3]: topright neighbour's SAD, |
|
91 |
*/ |
*/ |
92 |
|
|
93 |
int xin1, xin2, xin3; |
static __inline VECTOR |
94 |
int yin1, yin2, yin3; |
get_pmv2(const MACROBLOCK * const mbs, |
95 |
int vec1, vec2, vec3; |
const int mb_width, |
96 |
|
const int bound, |
97 |
static VECTOR zeroMV; |
const int x, |
98 |
uint32_t index = x + y * x_dim; |
const int y, |
99 |
zeroMV.x = zeroMV.y = 0; |
const int block) |
100 |
|
{ |
101 |
|
int lx, ly, lz; /* left */ |
102 |
|
int tx, ty, tz; /* top */ |
103 |
|
int rx, ry, rz; /* top-right */ |
104 |
|
int lpos, tpos, rpos; |
105 |
|
int num_cand = 0, last_cand = 1; |
106 |
|
|
107 |
// first row (special case) |
VECTOR pmv[4]; /* left neighbour, top neighbour, top-right neighbour */ |
108 |
if (y == 0 && (block == 0 || block == 1)) |
|
109 |
{ |
switch (block) { |
110 |
if ((x == 0) && (block == 0)) // first column, first block |
case 0: |
111 |
{ |
lx = x - 1; ly = y; lz = 1; |
112 |
pmv[0] = pmv[1] = pmv[2] = pmv[3] = zeroMV; |
tx = x; ty = y - 1; tz = 2; |
113 |
psad[0] = psad[1] = psad[2] = psad[3] = MV_MAX_ERROR; |
rx = x + 1; ry = y - 1; rz = 2; |
114 |
return 0; |
break; |
115 |
} |
case 1: |
116 |
if (block == 1) // second block; has only a left neighbour |
lx = x; ly = y; lz = 0; |
117 |
{ |
tx = x; ty = y - 1; tz = 3; |
118 |
pmv[0] = pmv[1] = pMBs[index].mvs[0]; |
rx = x + 1; ry = y - 1; rz = 2; |
119 |
pmv[2] = pmv[3] = zeroMV; |
break; |
120 |
psad[0] = psad[1] = pMBs[index].sad8[0]; |
case 2: |
121 |
psad[2] = psad[3] = MV_MAX_ERROR; |
lx = x - 1; ly = y; lz = 3; |
122 |
return 0; |
tx = x; ty = y; tz = 0; |
123 |
} |
rx = x; ry = y; rz = 1; |
124 |
else /* block==0, but x!=0, so again, there is a left neighbour*/ |
break; |
125 |
{ |
default: |
126 |
pmv[0] = pmv[1] = pMBs[index-1].mvs[1]; |
lx = x; ly = y; lz = 2; |
127 |
pmv[2] = pmv[3] = zeroMV; |
tx = x; ty = y; tz = 0; |
128 |
psad[0] = psad[1] = pMBs[index-1].sad8[1]; |
rx = x; ry = y; rz = 1; |
129 |
psad[2] = psad[3] = MV_MAX_ERROR; |
} |
130 |
return 0; |
|
131 |
|
lpos = lx + ly * mb_width; |
132 |
|
rpos = rx + ry * mb_width; |
133 |
|
tpos = tx + ty * mb_width; |
134 |
|
|
135 |
|
if (lpos >= bound && lx >= 0) { |
136 |
|
num_cand++; |
137 |
|
pmv[1] = mbs[lpos].mvs[lz]; |
138 |
|
} else pmv[1] = zeroMV; |
139 |
|
|
140 |
|
if (tpos >= bound) { |
141 |
|
num_cand++; |
142 |
|
last_cand = 2; |
143 |
|
pmv[2] = mbs[tpos].mvs[tz]; |
144 |
|
} else pmv[2] = zeroMV; |
145 |
|
|
146 |
|
if (rpos >= bound && rx < mb_width) { |
147 |
|
num_cand++; |
148 |
|
last_cand = 3; |
149 |
|
pmv[3] = mbs[rpos].mvs[rz]; |
150 |
|
} else pmv[3] = zeroMV; |
151 |
|
|
152 |
|
/* If there're more than one candidate, we return the median vector */ |
153 |
|
|
154 |
|
if (num_cand > 1) { |
155 |
|
/* set median */ |
156 |
|
pmv[0].x = |
157 |
|
MIN(MAX(pmv[1].x, pmv[2].x), |
158 |
|
MIN(MAX(pmv[2].x, pmv[3].x), MAX(pmv[1].x, pmv[3].x))); |
159 |
|
pmv[0].y = |
160 |
|
MIN(MAX(pmv[1].y, pmv[2].y), |
161 |
|
MIN(MAX(pmv[2].y, pmv[3].y), MAX(pmv[1].y, pmv[3].y))); |
162 |
|
return pmv[0]; |
163 |
|
} |
164 |
|
|
165 |
|
return pmv[last_cand]; /* no point calculating median mv */ |
166 |
|
} |
167 |
|
|
168 |
|
static __inline VECTOR |
169 |
|
get_qpmv2(const MACROBLOCK * const mbs, |
170 |
|
const int mb_width, |
171 |
|
const int bound, |
172 |
|
const int x, |
173 |
|
const int y, |
174 |
|
const int block) |
175 |
|
{ |
176 |
|
int lx, ly, lz; /* left */ |
177 |
|
int tx, ty, tz; /* top */ |
178 |
|
int rx, ry, rz; /* top-right */ |
179 |
|
int lpos, tpos, rpos; |
180 |
|
int num_cand = 0, last_cand = 1; |
181 |
|
|
182 |
|
VECTOR pmv[4]; /* left neighbour, top neighbour, top-right neighbour */ |
183 |
|
|
184 |
|
switch (block) { |
185 |
|
case 0: |
186 |
|
lx = x - 1; ly = y; lz = 1; |
187 |
|
tx = x; ty = y - 1; tz = 2; |
188 |
|
rx = x + 1; ry = y - 1; rz = 2; |
189 |
|
break; |
190 |
|
case 1: |
191 |
|
lx = x; ly = y; lz = 0; |
192 |
|
tx = x; ty = y - 1; tz = 3; |
193 |
|
rx = x + 1; ry = y - 1; rz = 2; |
194 |
|
break; |
195 |
|
case 2: |
196 |
|
lx = x - 1; ly = y; lz = 3; |
197 |
|
tx = x; ty = y; tz = 0; |
198 |
|
rx = x; ry = y; rz = 1; |
199 |
|
break; |
200 |
|
default: |
201 |
|
lx = x; ly = y; lz = 2; |
202 |
|
tx = x; ty = y; tz = 0; |
203 |
|
rx = x; ry = y; rz = 1; |
204 |
|
} |
205 |
|
|
206 |
|
lpos = lx + ly * mb_width; |
207 |
|
rpos = rx + ry * mb_width; |
208 |
|
tpos = tx + ty * mb_width; |
209 |
|
|
210 |
|
if (lpos >= bound && lx >= 0) { |
211 |
|
num_cand++; |
212 |
|
pmv[1] = mbs[lpos].qmvs[lz]; |
213 |
|
} else pmv[1] = zeroMV; |
214 |
|
|
215 |
|
if (tpos >= bound) { |
216 |
|
num_cand++; |
217 |
|
last_cand = 2; |
218 |
|
pmv[2] = mbs[tpos].qmvs[tz]; |
219 |
|
} else pmv[2] = zeroMV; |
220 |
|
|
221 |
|
if (rpos >= bound && rx < mb_width) { |
222 |
|
num_cand++; |
223 |
|
last_cand = 3; |
224 |
|
pmv[3] = mbs[rpos].qmvs[rz]; |
225 |
|
} else pmv[3] = zeroMV; |
226 |
|
|
227 |
|
/* If there're more than one candidate, we return the median vector */ |
228 |
|
|
229 |
|
if (num_cand > 1) { |
230 |
|
/* set median */ |
231 |
|
pmv[0].x = |
232 |
|
MIN(MAX(pmv[1].x, pmv[2].x), |
233 |
|
MIN(MAX(pmv[2].x, pmv[3].x), MAX(pmv[1].x, pmv[3].x))); |
234 |
|
pmv[0].y = |
235 |
|
MIN(MAX(pmv[1].y, pmv[2].y), |
236 |
|
MIN(MAX(pmv[2].y, pmv[3].y), MAX(pmv[1].y, pmv[3].y))); |
237 |
|
return pmv[0]; |
238 |
} |
} |
239 |
|
|
240 |
|
return pmv[last_cand]; /* no point calculating median mv */ |
241 |
} |
} |
242 |
|
|
243 |
/* |
/* |
244 |
MODE_INTER, vm18 page 48 |
* pmv are filled with: |
245 |
MODE_INTER4V vm18 page 51 |
* [0]: Median (or whatever is correct in a special case) |
246 |
|
* [1]: left neighbour |
247 |
(x,y-1) (x+1,y-1) |
* [2]: top neighbour |
248 |
[ | ] [ | ] |
* [3]: topright neighbour |
249 |
[ 2 | 3 ] [ 2 | ] |
* psad are filled with: |
250 |
|
* [0]: minimum of [1] to [3] |
251 |
(x-1,y) (x,y) (x+1,y) |
* [1]: left neighbour's SAD (NB:[1] to [3] are actually not needed) |
252 |
[ | 1 ] [ 0 | 1 ] [ 0 | ] |
* [2]: top neighbour's SAD |
253 |
[ | 3 ] [ 2 | 3 ] [ | ] |
* [3]: topright neighbour's SAD |
254 |
*/ |
*/ |
255 |
|
|
256 |
switch (block) |
static __inline int |
257 |
|
get_pmvdata2(const MACROBLOCK * const mbs, |
258 |
|
const int mb_width, |
259 |
|
const int bound, |
260 |
|
const int x, |
261 |
|
const int y, |
262 |
|
const int block, |
263 |
|
VECTOR * const pmv, |
264 |
|
int32_t * const psad) |
265 |
{ |
{ |
266 |
|
int lx, ly, lz; /* left */ |
267 |
|
int tx, ty, tz; /* top */ |
268 |
|
int rx, ry, rz; /* top-right */ |
269 |
|
int lpos, tpos, rpos; |
270 |
|
int num_cand = 0, last_cand = 1; |
271 |
|
|
272 |
|
switch (block) { |
273 |
case 0: |
case 0: |
274 |
xin1 = x - 1; yin1 = y; vec1 = 1; /* left */ |
lx = x - 1; ly = y; lz = 1; |
275 |
xin2 = x; yin2 = y - 1; vec2 = 2; /* top */ |
tx = x; ty = y - 1; tz = 2; |
276 |
xin3 = x + 1; yin3 = y - 1; vec3 = 2; /* top right */ |
rx = x + 1; ry = y - 1; rz = 2; |
277 |
break; |
break; |
278 |
case 1: |
case 1: |
279 |
xin1 = x; yin1 = y; vec1 = 0; |
lx = x; ly = y; lz = 0; |
280 |
xin2 = x; yin2 = y - 1; vec2 = 3; |
tx = x; ty = y - 1; tz = 3; |
281 |
xin3 = x + 1; yin3 = y - 1; vec3 = 2; |
rx = x + 1; ry = y - 1; rz = 2; |
282 |
break; |
break; |
283 |
case 2: |
case 2: |
284 |
xin1 = x - 1; yin1 = y; vec1 = 3; |
lx = x - 1; ly = y; lz = 3; |
285 |
xin2 = x; yin2 = y; vec2 = 0; |
tx = x; ty = y; tz = 0; |
286 |
xin3 = x; yin3 = y; vec3 = 1; |
rx = x; ry = y; rz = 1; |
287 |
break; |
break; |
288 |
default: |
default: |
289 |
xin1 = x; yin1 = y; vec1 = 2; |
lx = x; ly = y; lz = 2; |
290 |
xin2 = x; yin2 = y; vec2 = 0; |
tx = x; ty = y; tz = 0; |
291 |
xin3 = x; yin3 = y; vec3 = 1; |
rx = x; ry = y; rz = 1; |
292 |
} |
} |
293 |
|
|
294 |
|
lpos = lx + ly * mb_width; |
295 |
if (xin1 < 0 || /* yin1 < 0 || */ xin1 >= (int32_t)x_dim) |
rpos = rx + ry * mb_width; |
296 |
{ |
tpos = tx + ty * mb_width; |
297 |
|
|
298 |
|
if (lpos >= bound && lx >= 0) { |
299 |
|
num_cand++; |
300 |
|
last_cand = 1; |
301 |
|
pmv[1] = mbs[lpos].mvs[lz]; |
302 |
|
psad[1] = mbs[lpos].sad8[lz]; |
303 |
|
} else { |
304 |
pmv[1] = zeroMV; |
pmv[1] = zeroMV; |
305 |
psad[1] = MV_MAX_ERROR; |
psad[1] = MV_MAX_ERROR; |
306 |
} |
} |
|
else |
|
|
{ |
|
|
pmv[1] = pMBs[xin1 + yin1 * x_dim].mvs[vec1]; |
|
|
psad[1] = pMBs[xin1 + yin1 * x_dim].sad8[vec1]; |
|
|
} |
|
307 |
|
|
308 |
if (xin2 < 0 || /* yin2 < 0 || */ xin2 >= (int32_t)x_dim) |
if (tpos >= bound) { |
309 |
{ |
num_cand++; |
310 |
|
last_cand = 2; |
311 |
|
pmv[2]= mbs[tpos].mvs[tz]; |
312 |
|
psad[2] = mbs[tpos].sad8[tz]; |
313 |
|
} else { |
314 |
pmv[2] = zeroMV; |
pmv[2] = zeroMV; |
315 |
psad[2] = MV_MAX_ERROR; |
psad[2] = MV_MAX_ERROR; |
316 |
} |
} |
|
else |
|
|
{ |
|
|
pmv[2] = pMBs[xin2 + yin2 * x_dim].mvs[vec2]; |
|
|
psad[2] = pMBs[xin2 + yin2 * x_dim].sad8[vec2]; |
|
|
} |
|
317 |
|
|
318 |
if (xin3 < 0 || /* yin3 < 0 || */ xin3 >= (int32_t)x_dim) |
if (rpos >= bound && rx < mb_width) { |
319 |
{ |
num_cand++; |
320 |
|
last_cand = 3; |
321 |
|
pmv[3] = mbs[rpos].mvs[rz]; |
322 |
|
psad[3] = mbs[rpos].sad8[rz]; |
323 |
|
} else { |
324 |
pmv[3] = zeroMV; |
pmv[3] = zeroMV; |
325 |
psad[3] = MV_MAX_ERROR; |
psad[3] = MV_MAX_ERROR; |
326 |
} |
} |
327 |
else |
|
328 |
{ |
/* original pmvdata() compatibility hack */ |
329 |
pmv[3] = pMBs[xin3 + yin3 * x_dim].mvs[vec3]; |
if (x == 0 && y == 0 && block == 0) { |
330 |
psad[3] = pMBs[xin2 + yin2 * x_dim].sad8[vec3]; |
pmv[0] = pmv[1] = pmv[2] = pmv[3] = zeroMV; |
331 |
|
psad[0] = 0; |
332 |
|
psad[1] = psad[2] = psad[3] = MV_MAX_ERROR; |
333 |
|
return 0; |
334 |
} |
} |
335 |
|
|
336 |
if ( (MVequal(pmv[1],pmv[2])) && (MVequal(pmv[1],pmv[3])) ) |
/* if only one valid candidate preictor, the invalid candiates are set to the canidate */ |
337 |
{ pmv[0]=pmv[1]; |
if (num_cand == 1) { |
338 |
psad[0]=psad[1]; |
pmv[0] = pmv[last_cand]; |
339 |
|
psad[0] = psad[last_cand]; |
340 |
|
// return MVequal(pmv[0], zeroMV); /* no point calculating median mv and minimum sad */ |
341 |
|
|
342 |
|
/* original pmvdata() compatibility hack */ |
343 |
|
return y==0 && block <= 1 ? 0 : MVequal(pmv[0], zeroMV); |
344 |
|
} |
345 |
|
|
346 |
|
if ((MVequal(pmv[1], pmv[2])) && (MVequal(pmv[1], pmv[3]))) { |
347 |
|
pmv[0] = pmv[1]; |
348 |
|
psad[0] = MIN(MIN(psad[1], psad[2]), psad[3]); |
349 |
return 1; |
return 1; |
350 |
} |
} |
351 |
|
|
352 |
// median,minimum |
/* set median, minimum */ |
353 |
|
|
354 |
|
pmv[0].x = |
355 |
|
MIN(MAX(pmv[1].x, pmv[2].x), |
356 |
|
MIN(MAX(pmv[2].x, pmv[3].x), MAX(pmv[1].x, pmv[3].x))); |
357 |
|
pmv[0].y = |
358 |
|
MIN(MAX(pmv[1].y, pmv[2].y), |
359 |
|
MIN(MAX(pmv[2].y, pmv[3].y), MAX(pmv[1].y, pmv[3].y))); |
360 |
|
|
|
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))); |
|
361 |
psad[0]=MIN(MIN(psad[1],psad[2]),psad[3]); |
psad[0]=MIN(MIN(psad[1],psad[2]),psad[3]); |
362 |
|
|
363 |
return 0; |
return 0; |
364 |
} |
} |
365 |
|
|
|
|
|
366 |
#endif /* _MBPREDICTION_H_ */ |
#endif /* _MBPREDICTION_H_ */ |