Cross Reference: /external/libvpx/libvpx/vp9/encoder/vp9

Lines Matching refs:col
28   return &buf->buf[mv->row * buf->stride + mv->col];
32   int col_min = (mv->col >> 3) - MAX_FULL_PEL_VAL + (mv->col & 7 ? 1 : 0);
34   int col_max = (mv->col >> 3) + MAX_FULL_PEL_VAL;
71              comp_cost[0][mv->row] + comp_cost[1][mv->col];
77                     mv->col - ref->col };
86                       mv->col - ref->col };
98                       mv->col - ref->col };
108   x->ss[0].mv.col = x->ss[0].mv.row = 0;
118       ss->offset = ss->mv.row * stride + ss->mv.col;
129   x->ss[0].mv.col = x->ss[0].mv.row = 0;
142       ss->offset = ss->mv.row * stride + ss->mv.col;
285   const int offset = bestmv->row * y_stride + bestmv->col;
289   int rc = ref_mv->col;
291   int bc = bestmv->col * 8;
293   const int minc = MAX(x->mv_col_min * 8, ref_mv->col - MV_MAX);
294   const int maxc = MIN(x->mv_col_max * 8, ref_mv->col + MV_MAX);
303   bestmv->col *= 8;
344   bestmv->col = bc;
346   if ((abs(bestmv->col - ref_mv->col) > (MAX_FULL_PEL_VAL << 3)) ||
384   const int offset = bestmv->row * y_stride + bestmv->col;
388   int rc = ref_mv->col;
390   int bc = bestmv->col * 8;
392   const int minc = MAX(x->mv_col_min * 8, ref_mv->col - MV_MAX);
393   const int maxc = MIN(x->mv_col_max * 8, ref_mv->col + MV_MAX);
402   bestmv->col *= 8;
451   bestmv->col = bc;
453   if ((abs(bestmv->col - ref_mv->col) > (MAX_FULL_PEL_VAL << 3)) ||
465 static INLINE int check_bounds(const MACROBLOCK *x, int row, int col,
469          ((col - range) >= x->mv_col_min) &
470          ((col + range) <= x->mv_col_max);
474   return (mv->col >= x->mv_col_min) && (mv->col <= x->mv_col_max) &&
521   const MV fcenter_mv = {center_mv->row >> 3, center_mv->col >> 3};
529   bc = ref_mv->col;
548                               bc + candidates[t][i].col};
557                               bc + candidates[t][i].col};
575       bc += candidates[best_init_s][k].col;
591                                 bc + candidates[s][i].col};
600                                 bc + candidates[s][i].col};
614           bc += candidates[s][best_site].col;
629                                 bc + candidates[s][next_chkpts_indices[i]].col};
638                                 bc + candidates[s][next_chkpts_indices[i]].col};
651           bc += candidates[s][k].col;
667                               bc + neighbors[i].col};
676                               bc + neighbors[i].col};
690         bc += neighbors[best_site].col;
696   best_mv->col = bc;
708   const MV mv = {best_mv->row * 8, best_mv->col * 8};
725   const MV mv = {best_mv->row * 8, best_mv->col * 8};
895   const MV fcenter_mv = {center_mv->row >> 3, center_mv->col >> 3};
911   ref_col = ref_mv->col;
914   best_mv->col = ref_col;
974   best_mv->col += best_tc;
993   const MV fcenter_mv = {center_mv->row >> 3, center_mv->col >> 3};
1017                      best_mv->col + ss[i].mv.col};
1037       best_mv->col += ss[best_site].mv.col;
1043                             best_mv->col + ss[best_site].mv.col};
1054               best_mv->col += ss[best_site].mv.col;
1100   const MV fcenter_mv = {center_mv->row >> 3, center_mv->col >> 3};
1107   ref_col = ref_mv->col;
1110   best_mv->col = ref_col;
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);
1151                                 best_mv->col + ss[i].mv.col};
1166                             best_mv->col + ss[i].mv.col};
1188       best_mv->col += ss[best_site].mv.col;
1194                             best_mv->col + ss[best_site].mv.col};
1205               best_mv->col += ss[best_site].mv.col;
1297   const int col_min = MAX(ref_mv->col - distance, x->mv_col_min);
1298   const int col_max = MIN(ref_mv->col + distance, x->mv_col_max);
1301   const MV fcenter_mv = {center_mv->row >> 3, center_mv->col >> 3};
1339   int ref_col = ref_mv->col;
1348   const MV fcenter_mv = {center_mv->row >> 3, center_mv->col >> 3};
1356   best_mv->col = ref_col;
1378           this_mv.col = c;
1385             best_mv->col = c;
1398         this_mv.col = c;
1405           best_mv->col = c;
1430   int ref_col = ref_mv->col;
1440   const MV fcenter_mv = {center_mv->row >> 3, center_mv->col >> 3};
1449   best_mv->col = ref_col;
1471           this_mv.col = c;
1478             best_mv->col = c;
1496           this_mv.col = c;
1503             best_mv->col = c;
1517         this_mv.col = c;
1524           best_mv->col = c;
1545   const MV fcenter_mv = {center_mv->row >> 3, center_mv->col >> 3};
1560                      ref_mv->col + neighbors[j].col};
1579       ref_mv->col += neighbors[best_site].col;
1595   const MV fcenter_mv = {center_mv->row >> 3, center_mv->col >> 3};
1608                        ((ref_mv->col - 1) > x->mv_col_min) &
1609                        ((ref_mv->col + 1) < x->mv_col_max);
1625                          ref_mv->col + neighbors[j].col};
1638                        ref_mv->col + neighbors[j].col};
1661       ref_mv->col += neighbors[best_site].col;
1683   const MV fcenter_mv = {center_mv->row >> 3, center_mv->col >> 3};
1697                      ref_mv->col + neighbors[j].col};
1718       ref_mv->col += neighbors[best_site].col;