Lines Matching refs:step_param
1025 int sv_istep[2]; // save 2 initial step_param for 16x8/8x16
1111 int step_param = 0;
1131 step_param = bsi->sv_istep[i];
1139 step_param = 2;
1143 further_steps = (MAX_MVSEARCH_STEPS - 1) - step_param;
1156 &mode_mv[NEW4X4], step_param, sadpb, &num00, v_fn_ptr, x->mvsadcost, x->mvcost, bsi->ref_mv);
1161 &mode_mv[NEW4X4], step_param,
1176 &temp_mv, step_param + n,
1764 int sr=0; //search range got from mv_pred(). It uses step_param levels. (0-7)
2056 int step_param = cpi->sf.first_step;
2082 if(sr > step_param)
2083 step_param = sr;
2099 bestsme = vp8_hex_search(x, b, d, &best_ref_mv, &d->bmi.mv.as_mv, step_param, sadpb/*x->errorperbit*/, &num00, &cpi->fn_ptr[BLOCK_16X16], x->mvsadcost, x->mvcost, &best_ref_mv);
2105 bestsme = cpi->diamond_search_sad(x, b, d, &mvp, &d->bmi.mv.as_mv, step_param, sadpb / 2/*x->errorperbit*/, &num00, &cpi->fn_ptr[BLOCK_16X16], x->mvsadcost, x->mvcost, &best_ref_mv); //sadpb < 9
2111 further_steps = (cpi->sf.max_step_search_steps - 1) - step_param;
2124 thissme = cpi->diamond_search_sad(x, b, d, &mvp, &d->bmi.mv.as_mv, step_param + n, sadpb / 4/*x->errorperbit*/, &num00, &cpi->fn_ptr[BLOCK_16X16], x->mvsadcost, x->mvcost, &best_ref_mv); //sadpb = 9
