Lines Matching refs:MV
30 int vp8_mv_bit_cost(int_mv *mv, int_mv *ref, int *mvcost[2], int Weight)
32 /* MV costing is based on the distribution of vectors in the previous
39 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;
42 static int mv_err_cost(int_mv *mv, int_mv *ref, int *mvcost[2], int error_per_bit)
44 /* Ignore mv costing if mvcost is NULL */
46 return ((mvcost[0][(mv->as_mv.row - ref->as_mv.row) >> 1] +
47 mvcost[1][(mv->as_mv.col - ref->as_mv.col) >> 1])
52 static int mvsad_err_cost(int_mv *mv, int_mv *ref, int *mvsadcost[2], int error_per_bit)
55 /* Ignore mv costing if mvsadcost is NULL */
57 return ((mvsadcost[0][(mv->as_mv.row - ref->as_mv.row)] +
58 mvsadcost[1][(mv->as_mv.col - ref->as_mv.col)])
71 x->ss[search_site_count].mv.col = 0;
72 x->ss[search_site_count].mv.row = 0;
80 x->ss[search_site_count].mv.col = 0;
81 x->ss[search_site_count].mv.row = -Len;
86 x->ss[search_site_count].mv.col = 0;
87 x->ss[search_site_count].mv.row = Len;
92 x->ss[search_site_count].mv.col = -Len;
93 x->ss[search_site_count].mv.row = 0;
98 x->ss[search_site_count].mv.col = Len;
99 x->ss[search_site_count].mv.row = 0;
118 x->ss[search_site_count].mv.col = 0;
119 x->ss[search_site_count].mv.row = 0;
127 x->ss[search_site_count].mv.col = 0;
128 x->ss[search_site_count].mv.row = -Len;
133 x->ss[search_site_count].mv.col = 0;
134 x->ss[search_site_count].mv.row = Len;
139 x->ss[search_site_count].mv.col = -Len;
140 x->ss[search_site_count].mv.row = 0;
145 x->ss[search_site_count].mv.col = Len;
146 x->ss[search_site_count].mv.row = 0;
151 x->ss[search_site_count].mv.col = -Len;
152 x->ss[search_site_count].mv.row = -Len;
157 x->ss[search_site_count].mv.col = Len;
158 x->ss[search_site_count].mv.row = -Len;
163 x->ss[search_site_count].mv.col = -Len;
164 x->ss[search_site_count].mv.row = Len;
169 x->ss[search_site_count].mv.col = Len;
170 x->ss[search_site_count].mv.row = Len;
264 /* central mv */
398 /* central mv */
709 /* central mv */
843 static const MV next_chkpts[6][3] =
868 MV hex[6] = { { -1, -2}, {1, -2}, {2, 0}, {1, 2}, { -1, 2}, { -2, 0} } ;
869 MV neighbors[4] = {{0, -1}, { -1, 0}, {1, 0}, {0, 1}} ;
896 /* adjust ref_mv to make sure it is within MV range */
1124 this_row_offset = best_mv->as_mv.row + ss[i].mv.row;
1125 this_col_offset = best_mv->as_mv.col + ss[i].mv.col;
1154 best_mv->as_mv.row += ss[best_site].mv.row;
1155 best_mv->as_mv.col += ss[best_site].mv.col;
1251 all_in &= ((best_mv->as_mv.row + ss[i].mv.row)> x->mv_row_min);
1252 all_in &= ((best_mv->as_mv.row + ss[i+1].mv.row) < x->mv_row_max);
1253 all_in &= ((best_mv->as_mv.col + ss[i+2].mv.col) > x->mv_col_min);
1254 all_in &= ((best_mv->as_mv.col + ss[i+3].mv.col) < x->mv_col_max);
1273 this_mv.as_mv.row = best_mv->as_mv.row + ss[i].mv.row;
1274 this_mv.as_mv.col = best_mv->as_mv.col + ss[i].mv.col;
1292 this_row_offset = best_mv->as_mv.row + ss[i].mv.row;
1293 this_col_offset = best_mv->as_mv.col + ss[i].mv.col;
1321 best_mv->as_mv.row += ss[best_site].mv.row;
1322 best_mv->as_mv.col += ss[best_site].mv.col;
1350 int_mv *best_mv = &d->bmi.mv;
1445 int_mv *best_mv = &d->bmi.mv;
1578 int_mv *best_mv = &d->bmi.mv;
1734 MV neighbors[4] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}};
1813 MV neighbors[4] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}};
1976 /* MV ref count VP8_ENTROPY_STATS stats code */
2031 #endif/* END MV ref count VP8_ENTROPY_STATS stats code */
