Lines Matching refs:col
43 return ((mvcost[0][(mv->row - ref->row) >> 1] + mvcost[1][(mv->col - ref->col) >> 1]) * Weight) >> 7;
49 //return ((mvcost[0][(mv->row - ref->row)>>1] + mvcost[1][(mv->col - ref->col)>>1] + 128) * error_per_bit) >> 8;
53 return ((mvcost[0][(mv->row - ref->row) >> 1] + mvcost[1][(mv->col - ref->col) >> 1]) * error_per_bit + 128) >> 8;
62 return ((mvcost[0][(mv->row - ref->row) >> 1] + mvcost[1][(mv->col - ref->col)>> 1]) + 128) >> 8;
73 x->ss[search_site_count].mv.col = 0;
82 x->ss[search_site_count].mv.col = 0;
88 x->ss[search_site_count].mv.col = 0;
94 x->ss[search_site_count].mv.col = -Len;
100 x->ss[search_site_count].mv.col = Len;
120 x->ss[search_site_count].mv.col = 0;
129 x->ss[search_site_count].mv.col = 0;
135 x->ss[search_site_count].mv.col = 0;
141 x->ss[search_site_count].mv.col = -Len;
147 x->ss[search_site_count].mv.col = Len;
153 x->ss[search_site_count].mv.col = -Len;
159 x->ss[search_site_count].mv.col = Len;
165 x->ss[search_site_count].mv.col = -Len;
171 x->ss[search_site_count].mv.col = Len;
200 unsigned char *y = *(d->base_pre) + d->pre + (bestmv->row) * d->pre_stride + bestmv->col;
203 int rr = ref_mv->row >> 1, rc = ref_mv->col >> 1;
204 int br = bestmv->row << 2, bc = bestmv->col << 2;
213 int minc = MAX(x->mv_col_min << 2, (ref_mv->col >> 1) - ((1 << mvlong_width) - 1));
214 int maxc = MIN(x->mv_col_max << 2, (ref_mv->col >> 1) + ((1 << mvlong_width) - 1));
220 bestmv->col <<= 3;
297 bestmv->col = bc << 1;
299 if ((abs(bestmv->col - ref_mv->col) > MAX_FULL_PEL_VAL) || (abs(bestmv->row - ref_mv->row) > MAX_FULL_PEL_VAL))
318 unsigned char *y = *(d->base_pre) + d->pre + (bestmv->row) * d->pre_stride + bestmv->col;
326 if ((abs((bestmv->col << 3) - ref_mv->col) > MAX_FULL_PEL_VAL) || (abs((bestmv->row << 3) - ref_mv->row) > MAX_FULL_PEL_VAL))
329 bestmv->col <<= 3;
335 bestmv->col <<= 3;
344 this_mv.col = ((startmv.col - 8) | 4);
354 this_mv.col += 8;
365 this_mv.col = startmv.col;
400 this_mv.col = (this_mv.col - 8) | 4;
405 this_mv.col += 4;
410 this_mv.col = (this_mv.col - 8) | 4;
415 this_mv.col += 4;
436 if (bestmv->col < startmv.col)
446 if (startmv.col & 7)
448 this_mv.col = startmv.col - 2;
449 left = svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
453 this_mv.col = (startmv.col - 8) | 6;
465 this_mv.col += 4;
466 right = svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
476 this_mv.col = startmv.col;
481 up = svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
486 up = svf(y - d->pre_stride, d->pre_stride, this_mv.col & 7, 6, z, b->src_stride, &sse);
498 down = svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
523 if (startmv.col & 7)
525 this_mv.col -= 2;
526 diag = svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
530 this_mv.col = (startmv.col - 8) | 6;
538 if (startmv.col & 7)
540 this_mv.col -= 2;
541 diag = svf(y - d->pre_stride, d->pre_stride, this_mv.col & 7, 6, z, b->src_stride, &sse);
545 this_mv.col = (startmv.col - 8) | 6;
552 this_mv.col += 2;
557 diag = svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
562 diag = svf(y - d->pre_stride, d->pre_stride, this_mv.col & 7, 6, z, b->src_stride, &sse);
569 if (startmv.col & 7)
571 this_mv.col -= 2;
572 diag = svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
576 this_mv.col = (startmv.col - 8) | 6;
582 this_mv.col += 2;
584 diag = svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
607 unsigned char *y = *(d->base_pre) + d->pre + (bestmv->row) * d->pre_stride + bestmv->col;
613 if ((abs((bestmv->col << 3) - ref_mv->col) > MAX_FULL_PEL_VAL) || (abs((bestmv->row << 3) - ref_mv->row) > MAX_FULL_PEL_VAL))
616 bestmv->col <<= 3;
622 bestmv->col <<= 3;
631 this_mv.col = ((startmv.col - 8) | 4);
641 this_mv.col += 8;
652 this_mv.col = startmv.col;
682 this_mv.col = (this_mv.col - 8) | 4;
687 this_mv.col += 4;
692 this_mv.col = (this_mv.col - 8) | 4;
697 this_mv.col += 4;
712 this_mv.col = (this_mv.col - 8) | 4;
723 this_mv.col += 8;
733 this_mv.col = (this_mv.col - 8) | 4;
744 this_mv.col += 8;
786 int rr = ref_mv->row, rc = ref_mv->col, br = rr, bc = rc, tr, tc;
812 int nr = tr + hex[i].row, nc = tc + hex[i].col;
835 int nr = tr + neighbors[i].row, nc = tc + neighbors[i].col;
849 best_mv->col = bc;
890 int ref_col = ref_mv->col >> 3;
917 best_mv->col = ref_col;
927 this_col_offset = best_mv->col + ss[i].mv.col;
939 this_mv.col = this_col_offset << 3;
956 best_mv->col += ss[best_site].mv.col;
965 this_mv.col = best_mv->col << 3;
1005 int ref_col = ref_mv->col >> 3;
1032 best_mv->col = ref_col;
1042 check_col_min = x->mv_col_min - best_mv->col;
1043 check_col_max = x->mv_col_max - best_mv->col;
1053 valid_block [t] = (ss[t+i].mv.col > check_col_min);
1054 valid_block [t] &= (ss[t+i].mv.col < check_col_max);
1075 this_mv.col = (best_mv->col + ss[i].mv.col) << 3;
1102 col + ss[i].mv.col;
1105 this_mv.col = this_col_offset << 3;
1122 best_mv->col += ss[best_site].mv.col;
1131 this_mv.col = best_mv->col << 3;
1158 int ref_col = ref_mv->col >> 3;
1170 best_mv->col = ref_col;
1204 this_mv.col = c << 3;
1213 best_mv->col = c;
1222 this_mv.col = best_mv->col << 3;
1248 int ref_col = ref_mv->col >> 3;
1262 best_mv->col = ref_col;
1303 this_mv.col = c << 3;
1310 best_mv->col = c;
1326 this_mv.col = c << 3;
1333 best_mv->col = c;
1345 this_mv.col = best_mv->col << 3;
