1 |
/***************************************************************************** |
/***************************************************************************** |
2 |
* |
* |
3 |
* XVID MPEG-4 VIDEO CODEC |
* XVID MPEG-4 VIDEO CODEC |
4 |
* - Prediction functions - |
* - Prediction module - |
5 |
* |
* |
6 |
* Copyright(C) 2001-2002 - Michael Militzer <isibaar@xvid.org> |
* Copyright (C) 2001-2003 Michael Militzer <isibaar@xvid.org> |
7 |
* Copyright(C) 2001-2002 - Peter Ross <pross@xvid.org> |
* 2001-2003 Peter Ross <pross@xvid.org> |
8 |
* |
* |
9 |
* This file is part of XviD, a free MPEG-4 video encoder/decoder |
* This program is free software ; you can redistribute it and/or modify |
10 |
* |
* it under the terms of the GNU General Public License as published by |
|
* XviD is free software; you can redistribute it and/or modify it |
|
|
* under the terms of the GNU General Public License as published by |
|
11 |
* the Free Software Foundation; either version 2 of the License, or |
* the Free Software Foundation; either version 2 of the License, or |
12 |
* (at your option) any later version. |
* (at your option) any later version. |
13 |
* |
* |
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 |
* |
* |
|
* Under section 8 of the GNU General Public License, the copyright |
|
|
* holders of XVID explicitly forbid distribution in the following |
|
|
* countries: |
|
|
* |
|
|
* - Japan |
|
|
* - United States of America |
|
|
* |
|
|
* Linking XviD statically or dynamically with other modules is making a |
|
|
* combined work based on XviD. Thus, the terms and conditions of the |
|
|
* GNU General Public License cover the whole combination. |
|
|
* |
|
|
* As a special exception, the copyright holders of XviD give you |
|
|
* permission to link XviD with independent modules that communicate with |
|
|
* XviD solely through the VFW1.1 and DShow interfaces, regardless of the |
|
|
* license terms of these independent modules, and to copy and distribute |
|
|
* the resulting combined work under terms of your choice, provided that |
|
|
* every copy of the combined work is accompanied by a complete copy of |
|
|
* the source code of XviD (the version of XviD used to produce the |
|
|
* combined work), being distributed under the terms of the GNU General |
|
|
* Public License plus this exception. An independent module is a module |
|
|
* which is not derived from or based on XviD. |
|
|
* |
|
|
* Note that people who make modified versions of XviD are not obligated |
|
|
* to grant this special exception for their modified versions; it is |
|
|
* their choice whether to do so. The GNU General Public License gives |
|
|
* permission to release a modified version without this exception; this |
|
|
* exception also makes it possible to release a modified version which |
|
|
* carries forward this exception. |
|
|
* |
|
23 |
* $Id$ |
* $Id$ |
24 |
* |
* |
25 |
****************************************************************************/ |
****************************************************************************/ |
26 |
|
|
27 |
|
#include <stdlib.h> |
28 |
|
|
29 |
|
#include "../global.h" |
30 |
#include "../encoder.h" |
#include "../encoder.h" |
31 |
#include "mbprediction.h" |
#include "mbprediction.h" |
32 |
#include "../utils/mbfunctions.h" |
#include "../utils/mbfunctions.h" |
33 |
#include "../bitstream/cbp.h" |
#include "../bitstream/cbp.h" |
34 |
|
#include "../bitstream/mbcoding.h" |
35 |
|
#include "../bitstream/zigzag.h" |
36 |
|
|
37 |
|
|
|
#define ABS(X) (((X)>0)?(X):-(X)) |
|
|
#define DIV_DIV(A,B) ( (A) > 0 ? ((A)+((B)>>1))/(B) : ((A)-((B)>>1))/(B) ) |
|
|
|
|
|
|
|
|
/***************************************************************************** |
|
|
* Local inlined function |
|
|
****************************************************************************/ |
|
|
|
|
38 |
static int __inline |
static int __inline |
39 |
rescale(int predict_quant, |
rescale(int predict_quant, |
40 |
int current_quant, |
int current_quant, |
45 |
} |
} |
46 |
|
|
47 |
|
|
|
/***************************************************************************** |
|
|
* Local data |
|
|
****************************************************************************/ |
|
|
|
|
48 |
static const int16_t default_acdc_values[15] = { |
static const int16_t default_acdc_values[15] = { |
49 |
1024, |
1024, |
50 |
0, 0, 0, 0, 0, 0, 0, |
0, 0, 0, 0, 0, 0, 0, |
52 |
}; |
}; |
53 |
|
|
54 |
|
|
|
/***************************************************************************** |
|
|
* Functions |
|
|
****************************************************************************/ |
|
|
|
|
|
|
|
55 |
/* get dc/ac prediction direction for a single block and place |
/* get dc/ac prediction direction for a single block and place |
56 |
predictor values into MB->pred_values[j][..] |
predictor values into MB->pred_values[j][..] |
57 |
*/ |
*/ |
96 |
|
|
97 |
left = pMBs[index - 1].pred_values[0]; |
left = pMBs[index - 1].pred_values[0]; |
98 |
left_quant = pMBs[index - 1].quant; |
left_quant = pMBs[index - 1].quant; |
|
/*DEBUGI("LEFT", *(left+MBPRED_SIZE)); */ |
|
99 |
} |
} |
100 |
/* top macroblock */ |
/* top macroblock */ |
101 |
|
|
184 |
break; |
break; |
185 |
} |
} |
186 |
|
|
187 |
/* determine ac prediction direction & ac/dc predictor */ |
/* |
188 |
/* place rescaled ac/dc predictions into predictors[] for later use */ |
* determine ac prediction direction & ac/dc predictor place rescaled ac/dc |
189 |
|
* predictions into predictors[] for later use |
190 |
|
*/ |
191 |
|
|
192 |
if (ABS(pLeft[0] - pDiag[0]) < ABS(pDiag[0] - pTop[0])) { |
if (abs(pLeft[0] - pDiag[0]) < abs(pDiag[0] - pTop[0])) { |
193 |
*acpred_direction = 1; /* vertical */ |
*acpred_direction = 1; /* vertical */ |
194 |
predictors[0] = (int16_t)(DIV_DIV(pTop[0], iDcScaler)); |
predictors[0] = DIV_DIV(pTop[0], iDcScaler); |
195 |
for (i = 1; i < 8; i++) { |
for (i = 1; i < 8; i++) { |
196 |
predictors[i] = rescale(top_quant, current_quant, pTop[i]); |
predictors[i] = rescale(top_quant, current_quant, pTop[i]); |
197 |
} |
} |
198 |
} else { |
} else { |
199 |
*acpred_direction = 2; /* horizontal */ |
*acpred_direction = 2; /* horizontal */ |
200 |
predictors[0] = (int16_t)(DIV_DIV(pLeft[0], iDcScaler)); |
predictors[0] = DIV_DIV(pLeft[0], iDcScaler); |
201 |
for (i = 1; i < 8; i++) { |
for (i = 1; i < 8; i++) { |
202 |
predictors[i] = rescale(left_quant, current_quant, pLeft[i + 7]); |
predictors[i] = rescale(left_quant, current_quant, pLeft[i + 7]); |
203 |
} |
} |
221 |
int16_t *pCurrent = pMB->pred_values[block]; |
int16_t *pCurrent = pMB->pred_values[block]; |
222 |
uint32_t i; |
uint32_t i; |
223 |
|
|
224 |
DPRINTF(DPRINTF_COEFF,"predictor[0] %i", predictors[0]); |
DPRINTF(XVID_DEBUG_COEFF,"predictor[0] %i\n", predictors[0]); |
225 |
|
|
226 |
dct_codes[0] += predictors[0]; /* dc prediction */ |
dct_codes[0] += predictors[0]; /* dc prediction */ |
227 |
pCurrent[0] = (int16_t)(dct_codes[0] * iDcScaler); |
pCurrent[0] = dct_codes[0] * iDcScaler; |
228 |
|
|
229 |
if (acpred_direction == 1) { |
if (acpred_direction == 1) { |
230 |
for (i = 1; i < 8; i++) { |
for (i = 1; i < 8; i++) { |
231 |
int level = dct_codes[i] + predictors[i]; |
int level = dct_codes[i] + predictors[i]; |
232 |
|
|
233 |
DPRINTF(DPRINTF_COEFF,"predictor[%i] %i",i, predictors[i]); |
DPRINTF(XVID_DEBUG_COEFF,"predictor[%i] %i\n",i, predictors[i]); |
234 |
|
|
235 |
dct_codes[i] = level; |
dct_codes[i] = level; |
236 |
pCurrent[i] = level; |
pCurrent[i] = level; |
239 |
} else if (acpred_direction == 2) { |
} else if (acpred_direction == 2) { |
240 |
for (i = 1; i < 8; i++) { |
for (i = 1; i < 8; i++) { |
241 |
int level = dct_codes[i * 8] + predictors[i]; |
int level = dct_codes[i * 8] + predictors[i]; |
242 |
DPRINTF(DPRINTF_COEFF,"predictor[%i] %i",i*8, predictors[i]); |
DPRINTF(XVID_DEBUG_COEFF,"predictor[%i] %i\n",i*8, predictors[i]); |
243 |
|
|
244 |
dct_codes[i * 8] = level; |
dct_codes[i * 8] = level; |
245 |
pCurrent[i + 7] = level; |
pCurrent[i + 7] = level; |
255 |
|
|
256 |
|
|
257 |
|
|
258 |
/* ****************************************************************** */ |
/***************************************************************************** |
259 |
/* ****************************************************************** */ |
****************************************************************************/ |
260 |
|
|
261 |
/* encoder: subtract predictors from qcoeff[] and calculate S1/S2 |
/* encoder: subtract predictors from qcoeff[] and calculate S1/S2 |
262 |
|
|
263 |
todo: perform [-127,127] clamping after prediction |
returns sum of coeefficients *saved* if prediction is enabled |
|
clamping must adjust the coeffs, so dequant is done correctly |
|
264 |
|
|
|
S1/S2 are used to determine if its worth predicting for AC |
|
265 |
S1 = sum of all (qcoeff - prediction) |
S1 = sum of all (qcoeff - prediction) |
266 |
S2 = sum of all qcoeff |
S2 = sum of all qcoeff |
267 |
*/ |
*/ |
268 |
|
|
269 |
uint32_t |
int |
270 |
calc_acdc(MACROBLOCK * pMB, |
calc_acdc_coeff(MACROBLOCK * pMB, |
271 |
uint32_t block, |
uint32_t block, |
272 |
int16_t qcoeff[64], |
int16_t qcoeff[64], |
273 |
uint32_t iDcScaler, |
uint32_t iDcScaler, |
275 |
{ |
{ |
276 |
int16_t *pCurrent = pMB->pred_values[block]; |
int16_t *pCurrent = pMB->pred_values[block]; |
277 |
uint32_t i; |
uint32_t i; |
278 |
uint32_t S1 = 0, S2 = 0; |
int S1 = 0, S2 = 0; |
279 |
|
|
280 |
|
|
281 |
/* store current coeffs to pred_values[] for future prediction */ |
/* store current coeffs to pred_values[] for future prediction */ |
282 |
|
|
283 |
pCurrent[0] = (int16_t)(qcoeff[0] * iDcScaler); |
pCurrent[0] = qcoeff[0] * iDcScaler; |
284 |
for (i = 1; i < 8; i++) { |
for (i = 1; i < 8; i++) { |
285 |
pCurrent[i] = qcoeff[i]; |
pCurrent[i] = qcoeff[i]; |
286 |
pCurrent[i + 7] = qcoeff[i * 8]; |
pCurrent[i + 7] = qcoeff[i * 8]; |
295 |
int16_t level; |
int16_t level; |
296 |
|
|
297 |
level = qcoeff[i]; |
level = qcoeff[i]; |
298 |
S2 += ABS(level); |
S2 += abs(level); |
299 |
level -= predictors[i]; |
level -= predictors[i]; |
300 |
S1 += ABS(level); |
S1 += abs(level); |
301 |
predictors[i] = level; |
predictors[i] = level; |
302 |
} |
} |
303 |
} else /* acpred_direction == 2 */ |
} else /* acpred_direction == 2 */ |
306 |
int16_t level; |
int16_t level; |
307 |
|
|
308 |
level = qcoeff[i * 8]; |
level = qcoeff[i * 8]; |
309 |
S2 += ABS(level); |
S2 += abs(level); |
310 |
level -= predictors[i]; |
level -= predictors[i]; |
311 |
S1 += ABS(level); |
S1 += abs(level); |
312 |
predictors[i] = level; |
predictors[i] = level; |
313 |
} |
} |
314 |
|
|
319 |
} |
} |
320 |
|
|
321 |
|
|
322 |
|
|
323 |
|
/* returns the bits *saved* if prediction is enabled */ |
324 |
|
|
325 |
|
int |
326 |
|
calc_acdc_bits(MACROBLOCK * pMB, |
327 |
|
uint32_t block, |
328 |
|
int16_t qcoeff[64], |
329 |
|
uint32_t iDcScaler, |
330 |
|
int16_t predictors[8]) |
331 |
|
{ |
332 |
|
const int direction = pMB->acpred_directions[block]; |
333 |
|
int16_t *pCurrent = pMB->pred_values[block]; |
334 |
|
int16_t tmp[8]; |
335 |
|
unsigned int i; |
336 |
|
int Z1, Z2; |
337 |
|
|
338 |
|
/* store current coeffs to pred_values[] for future prediction */ |
339 |
|
pCurrent[0] = qcoeff[0] * iDcScaler; |
340 |
|
for (i = 1; i < 8; i++) { |
341 |
|
pCurrent[i] = qcoeff[i]; |
342 |
|
pCurrent[i + 7] = qcoeff[i * 8]; |
343 |
|
} |
344 |
|
|
345 |
|
|
346 |
|
/* dc prediction */ |
347 |
|
qcoeff[0] = qcoeff[0] - predictors[0]; |
348 |
|
|
349 |
|
/* calc cost before ac prediction */ |
350 |
|
Z2 = CodeCoeffIntra_CalcBits(qcoeff, scan_tables[0]); |
351 |
|
|
352 |
|
/* apply ac prediction & calc cost*/ |
353 |
|
if (direction == 1) { |
354 |
|
for (i = 1; i < 8; i++) { |
355 |
|
tmp[i] = qcoeff[i]; |
356 |
|
qcoeff[i] -= predictors[i]; |
357 |
|
predictors[i] = qcoeff[i]; |
358 |
|
} |
359 |
|
}else{ /* acpred_direction == 2 */ |
360 |
|
for (i = 1; i < 8; i++) { |
361 |
|
tmp[i] = qcoeff[i*8]; |
362 |
|
qcoeff[i*8] -= predictors[i]; |
363 |
|
predictors[i] = qcoeff[i*8]; |
364 |
|
} |
365 |
|
} |
366 |
|
|
367 |
|
Z1 = CodeCoeffIntra_CalcBits(qcoeff, scan_tables[direction]); |
368 |
|
|
369 |
|
/* undo prediction */ |
370 |
|
if (direction == 1) { |
371 |
|
for (i = 1; i < 8; i++) |
372 |
|
qcoeff[i] = tmp[i]; |
373 |
|
}else{ /* acpred_direction == 2 */ |
374 |
|
for (i = 1; i < 8; i++) |
375 |
|
qcoeff[i*8] = tmp[i]; |
376 |
|
} |
377 |
|
|
378 |
|
return Z2-Z1; |
379 |
|
} |
380 |
|
|
381 |
/* apply predictors[] to qcoeff */ |
/* apply predictors[] to qcoeff */ |
382 |
|
|
383 |
void |
void |
386 |
int16_t qcoeff[64], |
int16_t qcoeff[64], |
387 |
int16_t predictors[8]) |
int16_t predictors[8]) |
388 |
{ |
{ |
389 |
uint32_t i; |
unsigned int i; |
390 |
|
|
391 |
if (pMB->acpred_directions[block] == 1) { |
if (pMB->acpred_directions[block] == 1) { |
392 |
for (i = 1; i < 8; i++) { |
for (i = 1; i < 8; i++) |
393 |
qcoeff[i] = predictors[i]; |
qcoeff[i] = predictors[i]; |
|
} |
|
394 |
} else { |
} else { |
395 |
for (i = 1; i < 8; i++) { |
for (i = 1; i < 8; i++) |
396 |
qcoeff[i * 8] = predictors[i]; |
qcoeff[i * 8] = predictors[i]; |
397 |
} |
} |
398 |
} |
} |
|
} |
|
399 |
|
|
400 |
|
|
401 |
void |
void |
407 |
{ |
{ |
408 |
|
|
409 |
int32_t j; |
int32_t j; |
410 |
int32_t iDcScaler, iQuant = frame->quant; |
int32_t iDcScaler, iQuant; |
411 |
int32_t S = 0; |
int S = 0; |
412 |
int16_t predictors[6][8]; |
int16_t predictors[6][8]; |
413 |
|
|
414 |
MACROBLOCK *pMB = &frame->mbs[x + y * mb_width]; |
MACROBLOCK *pMB = &frame->mbs[x + y * mb_width]; |
415 |
|
iQuant = pMB->quant; |
416 |
|
|
417 |
if ((pMB->mode == MODE_INTRA) || (pMB->mode == MODE_INTRA_Q)) { |
if ((pMB->mode == MODE_INTRA) || (pMB->mode == MODE_INTRA_Q)) { |
418 |
|
|
419 |
for (j = 0; j < 6; j++) { |
for (j = 0; j < 6; j++) { |
420 |
iDcScaler = get_dc_scaler(iQuant, (j < 4) ? 1 : 0); |
iDcScaler = get_dc_scaler(iQuant, j<4); |
421 |
|
|
422 |
predict_acdc(frame->mbs, x, y, mb_width, j, &qcoeff[j * 64], |
predict_acdc(frame->mbs, x, y, mb_width, j, &qcoeff[j * 64], |
423 |
iQuant, iDcScaler, predictors[j], 0); |
iQuant, iDcScaler, predictors[j], 0); |
424 |
|
|
425 |
S += calc_acdc(pMB, j, &qcoeff[j * 64], iDcScaler, predictors[j]); |
if ((frame->vop_flags & XVID_VOP_HQACPRED)) |
426 |
|
S += calc_acdc_bits(pMB, j, &qcoeff[j * 64], iDcScaler, predictors[j]); |
427 |
|
else |
428 |
|
S += calc_acdc_coeff(pMB, j, &qcoeff[j * 64], iDcScaler, predictors[j]); |
429 |
|
|
430 |
} |
} |
431 |
|
|
432 |
if (S < 0) /* dont predict */ |
if (S<=0) { /* dont predict */ |
433 |
{ |
for (j = 0; j < 6; j++) |
|
for (j = 0; j < 6; j++) { |
|
434 |
pMB->acpred_directions[j] = 0; |
pMB->acpred_directions[j] = 0; |
|
} |
|
435 |
} else { |
} else { |
436 |
for (j = 0; j < 6; j++) { |
for (j = 0; j < 6; j++) |
437 |
apply_acdc(pMB, j, &qcoeff[j * 64], predictors[j]); |
apply_acdc(pMB, j, &qcoeff[j * 64], predictors[j]); |
438 |
} |
} |
439 |
} |
|
440 |
pMB->cbp = calc_cbp(qcoeff); |
pMB->cbp = calc_cbp(qcoeff); |
441 |
} |
} |
442 |
|
} |
443 |
|
|
444 |
|
static const VECTOR zeroMV = { 0, 0 }; |
445 |
|
|
446 |
|
VECTOR |
447 |
|
get_pmv2(const MACROBLOCK * const mbs, |
448 |
|
const int mb_width, |
449 |
|
const int bound, |
450 |
|
const int x, |
451 |
|
const int y, |
452 |
|
const int block) |
453 |
|
{ |
454 |
|
int lx, ly, lz; /* left */ |
455 |
|
int tx, ty, tz; /* top */ |
456 |
|
int rx, ry, rz; /* top-right */ |
457 |
|
int lpos, tpos, rpos; |
458 |
|
int num_cand = 0, last_cand = 1; |
459 |
|
|
460 |
|
VECTOR pmv[4]; /* left neighbour, top neighbour, top-right neighbour */ |
461 |
|
|
462 |
|
switch (block) { |
463 |
|
case 0: |
464 |
|
lx = x - 1; ly = y; lz = 1; |
465 |
|
tx = x; ty = y - 1; tz = 2; |
466 |
|
rx = x + 1; ry = y - 1; rz = 2; |
467 |
|
break; |
468 |
|
case 1: |
469 |
|
lx = x; ly = y; lz = 0; |
470 |
|
tx = x; ty = y - 1; tz = 3; |
471 |
|
rx = x + 1; ry = y - 1; rz = 2; |
472 |
|
break; |
473 |
|
case 2: |
474 |
|
lx = x - 1; ly = y; lz = 3; |
475 |
|
tx = x; ty = y; tz = 0; |
476 |
|
rx = x; ry = y; rz = 1; |
477 |
|
break; |
478 |
|
default: |
479 |
|
lx = x; ly = y; lz = 2; |
480 |
|
tx = x; ty = y; tz = 0; |
481 |
|
rx = x; ry = y; rz = 1; |
482 |
|
} |
483 |
|
|
484 |
|
lpos = lx + ly * mb_width; |
485 |
|
rpos = rx + ry * mb_width; |
486 |
|
tpos = tx + ty * mb_width; |
487 |
|
|
488 |
|
if (lpos >= bound && lx >= 0) { |
489 |
|
num_cand++; |
490 |
|
pmv[1] = mbs[lpos].mvs[lz]; |
491 |
|
} else pmv[1] = zeroMV; |
492 |
|
|
493 |
|
if (tpos >= bound) { |
494 |
|
num_cand++; |
495 |
|
last_cand = 2; |
496 |
|
pmv[2] = mbs[tpos].mvs[tz]; |
497 |
|
} else pmv[2] = zeroMV; |
498 |
|
|
499 |
|
if (rpos >= bound && rx < mb_width) { |
500 |
|
num_cand++; |
501 |
|
last_cand = 3; |
502 |
|
pmv[3] = mbs[rpos].mvs[rz]; |
503 |
|
} else pmv[3] = zeroMV; |
504 |
|
|
505 |
|
/* If there're more than one candidate, we return the median vector */ |
506 |
|
|
507 |
|
if (num_cand > 1) { |
508 |
|
/* set median */ |
509 |
|
pmv[0].x = |
510 |
|
MIN(MAX(pmv[1].x, pmv[2].x), |
511 |
|
MIN(MAX(pmv[2].x, pmv[3].x), MAX(pmv[1].x, pmv[3].x))); |
512 |
|
pmv[0].y = |
513 |
|
MIN(MAX(pmv[1].y, pmv[2].y), |
514 |
|
MIN(MAX(pmv[2].y, pmv[3].y), MAX(pmv[1].y, pmv[3].y))); |
515 |
|
return pmv[0]; |
516 |
|
} |
517 |
|
|
518 |
|
return pmv[last_cand]; /* no point calculating median mv */ |
519 |
|
} |
520 |
|
|
521 |
|
VECTOR |
522 |
|
get_qpmv2(const MACROBLOCK * const mbs, |
523 |
|
const int mb_width, |
524 |
|
const int bound, |
525 |
|
const int x, |
526 |
|
const int y, |
527 |
|
const int block) |
528 |
|
{ |
529 |
|
int lx, ly, lz; /* left */ |
530 |
|
int tx, ty, tz; /* top */ |
531 |
|
int rx, ry, rz; /* top-right */ |
532 |
|
int lpos, tpos, rpos; |
533 |
|
int num_cand = 0, last_cand = 1; |
534 |
|
|
535 |
|
VECTOR pmv[4]; /* left neighbour, top neighbour, top-right neighbour */ |
536 |
|
|
537 |
|
switch (block) { |
538 |
|
case 0: |
539 |
|
lx = x - 1; ly = y; lz = 1; |
540 |
|
tx = x; ty = y - 1; tz = 2; |
541 |
|
rx = x + 1; ry = y - 1; rz = 2; |
542 |
|
break; |
543 |
|
case 1: |
544 |
|
lx = x; ly = y; lz = 0; |
545 |
|
tx = x; ty = y - 1; tz = 3; |
546 |
|
rx = x + 1; ry = y - 1; rz = 2; |
547 |
|
break; |
548 |
|
case 2: |
549 |
|
lx = x - 1; ly = y; lz = 3; |
550 |
|
tx = x; ty = y; tz = 0; |
551 |
|
rx = x; ry = y; rz = 1; |
552 |
|
break; |
553 |
|
default: |
554 |
|
lx = x; ly = y; lz = 2; |
555 |
|
tx = x; ty = y; tz = 0; |
556 |
|
rx = x; ry = y; rz = 1; |
557 |
|
} |
558 |
|
|
559 |
|
lpos = lx + ly * mb_width; |
560 |
|
rpos = rx + ry * mb_width; |
561 |
|
tpos = tx + ty * mb_width; |
562 |
|
|
563 |
|
if (lpos >= bound && lx >= 0) { |
564 |
|
num_cand++; |
565 |
|
pmv[1] = mbs[lpos].qmvs[lz]; |
566 |
|
} else pmv[1] = zeroMV; |
567 |
|
|
568 |
|
if (tpos >= bound) { |
569 |
|
num_cand++; |
570 |
|
last_cand = 2; |
571 |
|
pmv[2] = mbs[tpos].qmvs[tz]; |
572 |
|
} else pmv[2] = zeroMV; |
573 |
|
|
574 |
|
if (rpos >= bound && rx < mb_width) { |
575 |
|
num_cand++; |
576 |
|
last_cand = 3; |
577 |
|
pmv[3] = mbs[rpos].qmvs[rz]; |
578 |
|
} else pmv[3] = zeroMV; |
579 |
|
|
580 |
|
/* If there're more than one candidate, we return the median vector */ |
581 |
|
|
582 |
|
if (num_cand > 1) { |
583 |
|
/* set median */ |
584 |
|
pmv[0].x = |
585 |
|
MIN(MAX(pmv[1].x, pmv[2].x), |
586 |
|
MIN(MAX(pmv[2].x, pmv[3].x), MAX(pmv[1].x, pmv[3].x))); |
587 |
|
pmv[0].y = |
588 |
|
MIN(MAX(pmv[1].y, pmv[2].y), |
589 |
|
MIN(MAX(pmv[2].y, pmv[3].y), MAX(pmv[1].y, pmv[3].y))); |
590 |
|
return pmv[0]; |
591 |
|
} |
592 |
|
|
593 |
|
return pmv[last_cand]; /* no point calculating median mv */ |
594 |
} |
} |