HomeSort by relevance Sort by last modified time
    Searched defs:best_mv (Results 1 - 3 of 3) sorted by null

  /external/libvpx/vp8/decoder/
decodemv.c 328 MV nearest, nearby, best_mv; local
335 vp8_find_near_mvs(&pbi->mb, mi, &nearest, &nearby, &best_mv, rct, mbmi->ref_frame, pbi->common.ref_frame_sign_bias);
364 mv->row += best_mv.row;
365 mv->col += best_mv.col;
445 mv->row += best_mv.row;
446 mv->col += best_mv.col;
  /external/libvpx/vp8/encoder/
bitstream.c 960 MV best_mv; local
977 vp8_find_near_mvs(xd, m, &n1, &n2, &best_mv, ct, rf, cpi->common.ref_frame_sign_bias);
1000 write_mv(w, &mi->mv.as_mv, &best_mv, mvc);
1034 write_mv(w, &b->mv.as_mv, &best_mv, (const MV_CONTEXT *) mvc);
    [all...]
mcomp.c 776 MV *best_mv,
894 best_mv->row = br;
895 best_mv->col = bc;
897 return vfp->vf(src, src_stride, PRE(br, bc), d->pre_stride, &thiserr) + mv_err_cost(best_mv, center_mv, mvcost, error_per_bit) ;
913 MV *best_mv,
967 best_mv->row = ref_row;
968 best_mv->col = ref_col;
975 this_row_offset = best_mv->row + ss[i].mv.row;
976 this_col_offset = best_mv->col + ss[i].mv.col;
1004 best_mv->row += ss[best_site].mv.row
1189 MV *best_mv = &d->bmi.mv.as_mv; local
1279 MV *best_mv = &d->bmi.mv.as_mv; local
1402 MV *best_mv = &d->bmi.mv.as_mv; local
    [all...]

Completed in 284 milliseconds