Home | History | Annotate | Download | only in encoder

Lines Matching defs:best_mv

506                               const MV *center_mv, MV *best_mv,
695 best_mv->row = br;
696 best_mv->col = bc;
702 const MV *best_mv, const MV *center_mv,
708 const MV mv = {best_mv->row * 8, best_mv->col * 8};
712 get_buf_from_mv(in_what, best_mv), in_what->stride, &unused) +
718 const MV *best_mv, const MV *center_mv,
725 const MV mv = {best_mv->row * 8, best_mv->col * 8};
728 return vfp->svaf(get_buf_from_mv(in_what, best_mv), in_what->stride, 0, 0,
741 const MV *center_mv, MV *best_mv) {
764 center_mv, best_mv,
776 MV *best_mv) {
805 center_mv, best_mv,
817 MV *best_mv) {
846 center_mv, best_mv,
858 MV *best_mv) {
861 center_mv, best_mv);
872 MV *best_mv) {
875 center_mv, best_mv);
880 int vp9_full_range_search_c(const MACROBLOCK *x, MV *ref_mv, MV *best_mv,
913 best_mv->row = ref_row;
914 best_mv->col = ref_col;
921 + mvsad_err_cost(best_mv, &fcenter_mv,
973 best_mv->row += best_tr;
974 best_mv->col += best_tc;
979 MV *ref_mv, MV *best_mv,
1005 *best_mv = *ref_mv;
1010 mvsad_err_cost(best_mv, &fcenter_mv, mvjsadcost, mvsadcost, sad_per_bit);
1016 const MV mv = {best_mv->row + ss[i].mv.row,
1017 best_mv->col + ss[i].mv.col};
1036 best_mv->row += ss[best_site].mv.row;
1037 best_mv->col += ss[best_site].mv.col;
1042 const MV this_mv = {best_mv->row + ss[best_site].mv.row,
1043 best_mv->col + ss[best_site].mv.col};
1053 best_mv->row += ss[best_site].mv.row;
1054 best_mv->col += ss[best_site].mv.col;
1071 MV *ref_mv, MV *best_mv, int search_param,
1109 best_mv->row = ref_row;
1110 best_mv->col = ref_col;
1118 + mvsad_err_cost(best_mv, &fcenter_mv,
1128 all_in &= ((best_mv->row + ss[i].mv.row) > x->mv_row_min);
1129 all_in &= ((best_mv->row + ss[i + 1].mv.row) < x->mv_row_max);
1130 all_in &= ((best_mv->col + ss[i + 2].mv.col) > x->mv_col_min);
1131 all_in &= ((best_mv->col + ss[i + 3].mv.col) < x->mv_col_max);
1150 const MV this_mv = {best_mv->row + ss[i].mv.row,
1151 best_mv->col + ss[i].mv.col};
1165 const MV this_mv = {best_mv->row + ss[i].mv.row,
1166 best_mv->col + ss[i].mv.col};
1187 best_mv->row += ss[best_site].mv.row;
1188 best_mv->col += ss[best_site].mv.col;
1193 const MV this_mv = {best_mv->row + ss[best_site].mv.row,
1194 best_mv->col + ss[best_site].mv.col};
1204 best_mv->row += ss[best_site].mv.row;
1205 best_mv->col += ss[best_site].mv.col;
1272 MV best_mv = *dst_mv;
1273 thissme = cpi->refining_search_sad(x, &best_mv, sadpb, search_range,
1277 thissme = vp9_get_mvpred_var(x, &best_mv, ref_mv, fn_ptr, 1);
1280 *dst_mv = best_mv;
1290 const MV *center_mv, MV *best_mv) {
1305 *best_mv = *ref_mv;
1317 *best_mv = mv;
1328 const MV *center_mv, MV *best_mv) {
1355 best_mv->row = ref_row;
1356 best_mv->col = ref_col;
1361 + mvsad_err_cost(best_mv, &fcenter_mv,
1384 best_mv->row = r;
1385 best_mv->col = c;
1404 best_mv->row = r;
1405 best_mv->col = c;
1420 const MV *center_mv, MV *best_mv) {
1448 best_mv->row = ref_row;
1449 best_mv->col = ref_col;
1454 + mvsad_err_cost(best_mv, &fcenter_mv,
1477 best_mv->row = r;
1478 best_mv->col = c;
1502 best_mv->row = r;
1503 best_mv->col = c;
1523 best_mv->row = r;
1524 best_mv->col = c;