21 |
* along with this program ; if not, write to the Free Software |
* along with this program ; if not, write to the Free Software |
22 |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
23 |
* |
* |
24 |
* $Id: estimation_bvop.c,v 1.9 2004-07-10 17:42:18 edgomez Exp $ |
* $Id: estimation_bvop.c,v 1.12 2004-07-21 14:52:22 syskin Exp $ |
25 |
* |
* |
26 |
****************************************************************************/ |
****************************************************************************/ |
27 |
|
|
375 |
Data_d->CurU = Data_f->CurU = Data_b->CurU = Data_i->CurU = Cur[1]; |
Data_d->CurU = Data_f->CurU = Data_b->CurU = Data_i->CurU = Cur[1]; |
376 |
Data_d->CurV = Data_f->CurV = Data_b->CurV = Data_i->CurV = Cur[2]; |
Data_d->CurV = Data_f->CurV = Data_b->CurV = Data_i->CurV = Cur[2]; |
377 |
|
|
378 |
Data_d->lambda16 = lambda/4; |
Data_d->lambda16 = Data_f->lambda16 = Data_b->lambda16 = Data_i->lambda16 = lambda; |
|
Data_f->lambda16 = Data_b->lambda16 = Data_i->lambda16 = lambda; |
|
379 |
|
|
380 |
/* reset chroma-sad cache */ |
/* reset chroma-sad cache */ |
381 |
Data_d->b_chromaX = Data_d->b_chromaY = Data_d->chromaX = Data_d->chromaY = Data_d->chromaSAD = 256*4096; |
Data_d->b_chromaX = Data_d->b_chromaY = Data_d->chromaX = Data_d->chromaY = Data_d->chromaSAD = 256*4096; |
400 |
const uint32_t mode_curr, |
const uint32_t mode_curr, |
401 |
const VECTOR hint) |
const VECTOR hint) |
402 |
{ |
{ |
|
|
|
403 |
/* [0] is prediction */ |
/* [0] is prediction */ |
404 |
pmv[0].x = (pmv[0].x); pmv[0].y = (pmv[0].y); |
/* [1] is zero */ |
405 |
|
pmv[1].x = pmv[1].y = 0; |
|
pmv[1].x = pmv[1].y = 0; /* [1] is zero */ |
|
406 |
|
|
407 |
pmv[2].x = hint.x; pmv[2].y = hint.y; |
pmv[2].x = hint.x; pmv[2].y = hint.y; |
408 |
|
|
614 |
|
|
615 |
CheckCandidateDirect(0, 0, Data, 255); /* will also fill iMinSAD[1..4] with 8x8 SADs */ |
CheckCandidateDirect(0, 0, Data, 255); /* will also fill iMinSAD[1..4] with 8x8 SADs */ |
616 |
|
|
|
|
|
617 |
/* initial (fast) skip decision */ |
/* initial (fast) skip decision */ |
618 |
if (Data->iMinSAD[1] < (int)Data->iQuant * INITIAL_SKIP_THRESH |
if (Data->iMinSAD[1] < (int)Data->iQuant * INITIAL_SKIP_THRESH |
619 |
&& Data->iMinSAD[2] < (int)Data->iQuant * INITIAL_SKIP_THRESH |
&& Data->iMinSAD[2] < (int)Data->iQuant * INITIAL_SKIP_THRESH |
625 |
return *Data->iMinSAD; /* skipped */ |
return *Data->iMinSAD; /* skipped */ |
626 |
} |
} |
627 |
|
|
628 |
|
if (Data->chroma && Data->chromaSAD >= MAX_CHROMA_SAD_FOR_SKIP * (int)Data->iQuant) /* chroma doesn't allow skip */ |
629 |
|
skip_sad = 256*4096; |
630 |
|
else |
631 |
skip_sad = 4*MAX(MAX(Data->iMinSAD[1],Data->iMinSAD[2]), MAX(Data->iMinSAD[3],Data->iMinSAD[4])); |
skip_sad = 4*MAX(MAX(Data->iMinSAD[1],Data->iMinSAD[2]), MAX(Data->iMinSAD[3],Data->iMinSAD[4])); |
|
if (Data->chroma) skip_sad += Data->chromaSAD; |
|
632 |
|
|
633 |
Data->currentMV[1].x = Data->directmvF[0].x + Data->currentMV->x; /* hints for forward and backward searches */ |
Data->currentMV[1].x = Data->directmvF[0].x + Data->currentMV->x; /* hints for forward and backward searches */ |
634 |
Data->currentMV[1].y = Data->directmvF[0].y + Data->currentMV->y; |
Data->currentMV[1].y = Data->directmvF[0].y + Data->currentMV->y; |
873 |
*f_predMV = Data_f->currentMV[0]; |
*f_predMV = Data_f->currentMV[0]; |
874 |
} |
} |
875 |
pMB->mvs[0] = *Data_f->currentMV; |
pMB->mvs[0] = *Data_f->currentMV; |
876 |
|
pMB->b_mvs[0] = *Data_b->currentMV; /* hint for future searches */ |
877 |
break; |
break; |
878 |
|
|
879 |
case MODE_BACKWARD: |
case MODE_BACKWARD: |
888 |
*b_predMV = Data_b->currentMV[0]; |
*b_predMV = Data_b->currentMV[0]; |
889 |
} |
} |
890 |
pMB->b_mvs[0] = *Data_b->currentMV; |
pMB->b_mvs[0] = *Data_b->currentMV; |
891 |
|
pMB->mvs[0] = *Data_f->currentMV; /* hint for future searches */ |
892 |
break; |
break; |
893 |
|
|
894 |
|
|
944 |
|
|
945 |
const int32_t TRB = time_pp - time_bp; |
const int32_t TRB = time_pp - time_bp; |
946 |
const int32_t TRD = time_pp; |
const int32_t TRD = time_pp; |
947 |
|
DECLARE_ALIGNED_MATRIX(dct_space, 3, 64, int16_t, CACHE_LINE); |
948 |
|
|
949 |
/* some pre-inintialized data for the rest of the search */ |
/* some pre-inintialized data for the rest of the search */ |
950 |
SearchData Data_d, Data_f, Data_b, Data_i; |
SearchData Data_d, Data_f, Data_b, Data_i; |
955 |
Data_d.rounding = 0; |
Data_d.rounding = 0; |
956 |
Data_d.chroma = frame->motion_flags & XVID_ME_CHROMA_BVOP; |
Data_d.chroma = frame->motion_flags & XVID_ME_CHROMA_BVOP; |
957 |
Data_d.iQuant = frame->quant; |
Data_d.iQuant = frame->quant; |
958 |
|
Data_d.dctSpace = dct_space; |
959 |
|
Data_d.quant_type = !(pParam->vol_flags & XVID_VOL_MPEGQUANT); |
960 |
|
Data_d.mpeg_quant_matrices = pParam->mpeg_quant_matrices; |
961 |
|
|
962 |
Data_d.RefQ = f_refV->u; /* a good place, also used in MC (for similar purpose) */ |
Data_d.RefQ = f_refV->u; /* a good place, also used in MC (for similar purpose) */ |
963 |
|
|
1010 |
|
|
1011 |
sad2 = best_sad; |
sad2 = best_sad; |
1012 |
|
|
1013 |
if (Data_f.iMinSAD[0] < 2*sad2+1500) |
if (Data_f.iMinSAD[0] < 2*sad2+2000) |
1014 |
SearchBF_final(i, j, frame->motion_flags, pParam, &best_sad, &Data_f); |
SearchBF_final(i, j, frame->motion_flags, pParam, &best_sad, &Data_f); |
1015 |
|
|
1016 |
if (Data_b.iMinSAD[0] < 2*sad2+1500) |
if (Data_b.iMinSAD[0] < 2*sad2+2000) |
1017 |
SearchBF_final(i, j, frame->motion_flags, pParam, &best_sad, &Data_b); |
SearchBF_final(i, j, frame->motion_flags, pParam, &best_sad, &Data_b); |
1018 |
|
|
1019 |
SearchInterpolate_initial(i, j, frame->motion_flags, pParam, &f_predMV, &b_predMV, &best_sad, |
SearchInterpolate_initial(i, j, frame->motion_flags, pParam, &f_predMV, &b_predMV, &best_sad, |
1024 |
|
|
1025 |
SearchInterpolate_final(i, j, frame->motion_flags, pParam, &best_sad, &Data_i); |
SearchInterpolate_final(i, j, frame->motion_flags, pParam, &best_sad, &Data_i); |
1026 |
|
|
1027 |
|
if ((Data_d.iMinSAD[0] <= 2*best_sad) && (!frame->motion_flags&XVID_ME_SKIP_DELTASEARCH)) |
|
if ((Data_d.iMinSAD[0] <= best_sad) && (!(frame->motion_flags&XVID_ME_SKIP_DELTASEARCH))) |
|
1028 |
SearchDirect_final(frame->motion_flags, b_mb, &best_sad, &Data_d); |
SearchDirect_final(frame->motion_flags, b_mb, &best_sad, &Data_d); |
1029 |
|
|
|
|
|
1030 |
/* final skip decision */ |
/* final skip decision */ |
1031 |
if ( (skip_sad < Data_d.iQuant * MAX_SAD00_FOR_SKIP ) |
if ( (skip_sad < 2 * Data_d.iQuant * MAX_SAD00_FOR_SKIP ) |
1032 |
&& ((100*best_sad)/(skip_sad+1) > FINAL_SKIP_THRESH) ) { |
&& ((100*best_sad)/(skip_sad+1) > FINAL_SKIP_THRESH) ) { |
1033 |
|
|
1034 |
|
if (!Data_d.chroma) { /* we still need to check chroma */ |
1035 |
SkipDecisionB(pMB, &Data_d); |
SkipDecisionB(pMB, &Data_d); |
1036 |
if (pMB->mode == MODE_DIRECT_NONE_MV) { /* skipped? */ |
if (pMB->mode == MODE_DIRECT_NONE_MV) { /* skipped? */ |
1037 |
pMB->sad16 = best_sad; |
pMB->sad16 = skip_sad; |
1038 |
|
continue; |
1039 |
|
} |
1040 |
|
} else { /* just SKIP */ |
1041 |
|
pMB->mode = MODE_DIRECT_NONE_MV; |
1042 |
|
pMB->sad16 = skip_sad; |
1043 |
continue; |
continue; |
1044 |
} |
} |
1045 |
} |
} |
1046 |
|
|
1047 |
|
if (frame->vop_flags & XVID_VOP_RD_BVOP) |
1048 |
|
ModeDecision_BVOP_RD(&Data_d, &Data_b, &Data_f, &Data_i, |
1049 |
|
pMB, b_mb, &f_predMV, &b_predMV, frame->motion_flags, pParam, i, j); |
1050 |
|
else |
1051 |
ModeDecision_BVOP_SAD(&Data_d, &Data_b, &Data_f, &Data_i, pMB, b_mb, &f_predMV, &b_predMV); |
ModeDecision_BVOP_SAD(&Data_d, &Data_b, &Data_f, &Data_i, pMB, b_mb, &f_predMV, &b_predMV); |
1052 |
|
|
1053 |
} |
} |