int vp8_hex_search(MACROBLOCK *x, BLOCK *b, BLOCKD *d, int_mv *ref_mv,
int_mv *best_mv, int search_param, int sad_per_bit,
const vp8_variance_fn_ptr_t *vfp, int *mvsadcost[2],
- int *mvcost[2], int_mv *center_mv) {
+ int_mv *center_mv) {
MV hex[6] = {
{ -1, -2 }, { 1, -2 }, { 2, 0 }, { 1, 2 }, { -1, 2 }, { -2, 0 }
};
fcenter_mv.as_mv.row = center_mv->as_mv.row >> 3;
fcenter_mv.as_mv.col = center_mv->as_mv.col >> 3;
- (void)mvcost;
-
/* adjust ref_mv to make sure it is within MV range */
vp8_clamp_mv(ref_mv, x->mv_col_min, x->mv_col_max, x->mv_row_min,
x->mv_row_max);
int vp8_hex_search(MACROBLOCK *x, BLOCK *b, BLOCKD *d, int_mv *ref_mv,
int_mv *best_mv, int search_param, int sad_per_bit,
const vp8_variance_fn_ptr_t *vfp, int *mvsadcost[2],
- int *mvcost[2], int_mv *center_mv);
+ int_mv *center_mv);
typedef int(fractional_mv_step_fp)(MACROBLOCK *x, BLOCK *b, BLOCKD *d,
int_mv *bestmv, int_mv *ref_mv,
#endif
bestsme = vp8_hex_search(x, b, d, &mvp_full, &d->bmi.mv, step_param,
sadpb, &cpi->fn_ptr[BLOCK_16X16],
- x->mvsadcost, x->mvcost, &best_ref_mv);
+ x->mvsadcost, &best_ref_mv);
mode_mv[NEWMV].as_int = d->bmi.mv.as_int;
} else {
bestsme = cpi->diamond_search_sad(
/* Ignore mv costing by sending NULL cost arrays */
bestsme =
vp8_hex_search(x, b, d, &best_ref_mv1_full, &d->bmi.mv, step_param, sadpb,
- &cpi->fn_ptr[BLOCK_16X16], NULL, NULL, &best_ref_mv1);
+ &cpi->fn_ptr[BLOCK_16X16], NULL, &best_ref_mv1);
(void)bestsme; // Ignore unused return value.
#if ALT_REF_SUBPEL_ENABLED