Lines Matching defs:mv

459     mv_row = x->e_mbd.block[16].bmi.mv.as_mv.row;
460 mv_col = x->e_mbd.block[16].bmi.mv.as_mv.col;
862 void vp8_set_mbmode_and_mvs(MACROBLOCK *x, MB_PREDICTION_MODE mb, MV *mv)
867 x->e_mbd.mode_info_context->mbmi.mv.as_mv.row = mv->row;
868 x->e_mbd.mode_info_context->mbmi.mv.as_mv.col = mv->col;
874 bmi->mv.as_mv.row = mv->row;
875 bmi->mv.as_mv.col = mv->col;
925 *this_mv = col ? d[-1].bmi.mv.as_mv : vp8_left_bmi(mic, i)->mv.as_mv;
928 *this_mv = row ? d[-4].bmi.mv.as_mv : vp8_above_bmi(mic, i, mis)->mv.as_mv;
939 const MV mv = col ? d[-1].bmi.mv.as_mv : vp8_left_bmi(mic, i)->mv.as_mv;
941 if (mv.row == this_mv->row && mv.col == this_mv->col)
949 d->bmi.mv.as_mv = *this_mv;
1074 // segments. setting this to 1 would make mv thresh
1137 bsi->mvp = &(x->e_mbd.block[i-1].bmi.mv.as_mv);
1138 if (i==4 || i==8 || i==12) bsi->mvp = &(x->e_mbd.block[i-4].bmi.mv.as_mv);
1200 mode_mv[NEW4X4] = e->bmi.mv.as_mv;
1205 e->bmi.mv.as_mv = mode_mv[NEW4X4];
1281 bsi->mvs[i].as_mv = bd->bmi.mv.as_mv;
1411 bd->bmi.mv.as_mv = bsi.mvs[i].as_mv;
1431 x->partition_info->bmi[i].mv.as_mv = x->e_mbd.block[j].bmi.mv.as_mv;
1538 int_mv mv;
1547 mv.as_int = 0;
1557 near_mvs[vcnt].as_int = above->mbmi.mv.as_int;
1564 near_mvs[vcnt].as_int = left->mbmi.mv.as_int;
1571 near_mvs[vcnt].as_int = aboveleft->mbmi.mv.as_int;
1634 mv.as_int = near_mvs[near_sadidx[i]].as_int;
1655 mv.as_mv.row = mvx[vcnt/2];
1656 mv.as_mv.col = mvy[vcnt/2];
1665 *mvp = mv.as_mv;
2081 //adjust search range according to sr from mv prediction
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);
2100 mode_mv[NEWMV].row = d->bmi.mv.as_mv.row;
2101 mode_mv[NEWMV].col = d->bmi.mv.as_mv.col;
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
2106 mode_mv[NEWMV].row = d->bmi.mv.as_mv.row;
2107 mode_mv[NEWMV].col = d->bmi.mv.as_mv.col;
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
2129 mode_mv[NEWMV].row = d->bmi.mv.as_mv.row;
2130 mode_mv[NEWMV].col = d->bmi.mv.as_mv.col;
2134 d->bmi.mv.as_mv.row = mode_mv[NEWMV].row;
2135 d->bmi.mv.as_mv.col = mode_mv[NEWMV].col;
2150 full_mvp.row = d->bmi.mv.as_mv.row <<3; // use diamond search result as full search staring point
2151 full_mvp.col = d->bmi.mv.as_mv.col <<3;
2154 search_range = MAXF(abs((mvp.row>>3) - d->bmi.mv.as_mv.row), abs((mvp.col>>3) - d->bmi.mv.as_mv.col));
2188 d->bmi.mv.as_mv.row = mode_mv[NEWMV].row;
2189 d->bmi.mv.as_mv.col = mode_mv[NEWMV].col;
2199 // cpi->find_fractional_mv_step(x,b,d,&d->bmi.mv.as_mv,&best_ref_mv,x->errorperbit/2,cpi->fn_ptr.svf,cpi->fn_ptr.vf,x->mvcost); // normal mvc=11
2200 cpi->find_fractional_mv_step(x, b, d, &d->bmi.mv.as_mv, &best_ref_mv, x->errorperbit / 4, &cpi->fn_ptr[BLOCK_16X16], x->mvcost);
2202 mode_mv[NEWMV].row = d->bmi.mv.as_mv.row;
2203 mode_mv[NEWMV].col = d->bmi.mv.as_mv.col;
2445 // If we have chosen new mv or split then decay the full search check count more quickly.
2467 best_mbmode.mv.as_int = 0;
2481 x->e_mbd.mode_info_context->mbmi.mv.as_int = 0;
2492 best_bmodes[i].mv.as_int = 0;
2505 x->e_mbd.mode_info_context->mbmi.mv.as_mv = x->e_mbd.block[15].bmi.mv.as_mv;