Cross Reference: /external/libvpx/libvpx/vp8/encoder/mcomp.c

Lines Matching defs:mv
26 int vp8_mv_bit_cost(int_mv *mv, int_mv *ref, int *mvcost[2], int Weight)
35     return ((mvcost[0][(mv->as_mv.row - ref->as_mv.row) >> 1] + mvcost[1][(mv->as_mv.col - ref->as_mv.col) >> 1]) * Weight) >> 7;
38 static int mv_err_cost(int_mv *mv, int_mv *ref, int *mvcost[2], int error_per_bit)
40     /* Ignore mv costing if mvcost is NULL */
42         return ((mvcost[0][(mv->as_mv.row - ref->as_mv.row) >> 1] +
43                  mvcost[1][(mv->as_mv.col - ref->as_mv.col) >> 1])
48 static int mvsad_err_cost(int_mv *mv, int_mv *ref, int *mvsadcost[2], int error_per_bit)
51     /* Ignore mv costing if mvsadcost is NULL */
53         return ((mvsadcost[0][(mv->as_mv.row - ref->as_mv.row)] +
54                  mvsadcost[1][(mv->as_mv.col - ref->as_mv.col)])
67     x->ss[search_site_count].mv.col = 0;
68     x->ss[search_site_count].mv.row = 0;
76         x->ss[search_site_count].mv.col = 0;
77         x->ss[search_site_count].mv.row = -Len;
82         x->ss[search_site_count].mv.col = 0;
83         x->ss[search_site_count].mv.row = Len;
88         x->ss[search_site_count].mv.col = -Len;
89         x->ss[search_site_count].mv.row = 0;
94         x->ss[search_site_count].mv.col = Len;
95         x->ss[search_site_count].mv.row = 0;
114     x->ss[search_site_count].mv.col = 0;
115     x->ss[search_site_count].mv.row = 0;
123         x->ss[search_site_count].mv.col = 0;
124         x->ss[search_site_count].mv.row = -Len;
129         x->ss[search_site_count].mv.col = 0;
130         x->ss[search_site_count].mv.row = Len;
135         x->ss[search_site_count].mv.col = -Len;
136         x->ss[search_site_count].mv.row = 0;
141         x->ss[search_site_count].mv.col = Len;
142         x->ss[search_site_count].mv.row = 0;
147         x->ss[search_site_count].mv.col = -Len;
148         x->ss[search_site_count].mv.row = -Len;
153         x->ss[search_site_count].mv.col = Len;
154         x->ss[search_site_count].mv.row = -Len;
159         x->ss[search_site_count].mv.col = -Len;
160         x->ss[search_site_count].mv.row = Len;
165         x->ss[search_site_count].mv.col = Len;
166         x->ss[search_site_count].mv.row = Len;
260     /* central mv */
394     /* central mv */
705     /* central mv */
1116             this_row_offset = best_mv->as_mv.row + ss[i].mv.row;
1117             this_col_offset = best_mv->as_mv.col + ss[i].mv.col;
1146             best_mv->as_mv.row += ss[best_site].mv.row;
1147             best_mv->as_mv.col += ss[best_site].mv.col;
1243         all_in &= ((best_mv->as_mv.row + ss[i].mv.row)> x->mv_row_min);
1244         all_in &= ((best_mv->as_mv.row + ss[i+1].mv.row) < x->mv_row_max);
1245         all_in &= ((best_mv->as_mv.col + ss[i+2].mv.col) > x->mv_col_min);
1246         all_in &= ((best_mv->as_mv.col + ss[i+3].mv.col) < x->mv_col_max);
1265                         this_mv.as_mv.row = best_mv->as_mv.row + ss[i].mv.row;
1266                         this_mv.as_mv.col = best_mv->as_mv.col + ss[i].mv.col;
1284                 this_row_offset = best_mv->as_mv.row + ss[i].mv.row;
1285                 this_col_offset = best_mv->as_mv.col + ss[i].mv.col;
1313             best_mv->as_mv.row += ss[best_site].mv.row;
1314             best_mv->as_mv.col += ss[best_site].mv.col;
1342     int_mv *best_mv = &d->bmi.mv;
1438     int_mv *best_mv = &d->bmi.mv;
1572     int_mv *best_mv = &d->bmi.mv;