92 |
for (i = 0; i < 5; i++) Data->iMinSAD[i] = MV_MAX_ERROR; |
for (i = 0; i < 5; i++) Data->iMinSAD[i] = MV_MAX_ERROR; |
93 |
|
|
94 |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 4, |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 4, |
95 |
pParam->width, pParam->height, Data->iFcode - Data->qpel - 1, 0, 0); |
pParam->width, pParam->height, Data->iFcode - Data->qpel - 1, 0); |
96 |
|
|
97 |
Data->Cur = pCur + (x + y * pParam->edged_width) * 16; |
Data->Cur = pCur + (x + y * pParam->edged_width) * 16; |
98 |
Data->RefP[0] = pRef + (x + y * pParam->edged_width) * 16; |
Data->RefP[0] = pRef + (x + y * pParam->edged_width) * 16; |
129 |
} else simplicity++; |
} else simplicity++; |
130 |
|
|
131 |
if (*Data->iMinSAD > 500) /* refinement from 2-pixel to 1-pixel */ |
if (*Data->iMinSAD > 500) /* refinement from 2-pixel to 1-pixel */ |
132 |
xvid_me_SubpelRefine(Data, CheckCandidate32I); |
xvid_me_SubpelRefine(Data->currentMV[0], Data, CheckCandidate32I, 0); |
133 |
else simplicity++; |
else simplicity++; |
134 |
} else simplicity++; |
} else simplicity++; |
135 |
|
|
139 |
MB->mode = MODE_INTER; |
MB->mode = MODE_INTER; |
140 |
/* if we skipped some search steps, we have to assume that SAD would be lower with them */ |
/* if we skipped some search steps, we have to assume that SAD would be lower with them */ |
141 |
MB->sad16 = Data->iMinSAD[i+1] - (simplicity<<7); |
MB->sad16 = Data->iMinSAD[i+1] - (simplicity<<7); |
142 |
|
if (MB->sad16 < 0) MB->sad16 = 0; |
143 |
} |
} |
144 |
} |
} |
145 |
|
|