Lines Matching refs:col
78 return ((mvcost[0][(mv->row - ref->row) >> 1] + mvcost[1][(mv->col - ref->col) >> 1]) * Weight) >> 7;
84 //return ((mvcost[0][(mv->row - ref->row)>>1] + mvcost[1][(mv->col - ref->col)>>1] + 128) * error_per_bit) >> 8;
88 return ((mvcost[0][(mv->row - ref->row) >> 1] + mvcost[1][(mv->col - ref->col) >> 1]) * error_per_bit + 128) >> 8;
97 return ((mvcost[0][(mv->row - ref->row) >> 1] + mvcost[1][(mv->col - ref->col)>> 1]) + 128) >> 8;
108 x->ss[search_site_count].mv.col = 0;
117 x->ss[search_site_count].mv.col = 0;
123 x->ss[search_site_count].mv.col = 0;
129 x->ss[search_site_count].mv.col = -Len;
135 x->ss[search_site_count].mv.col = Len;
155 x->ss[search_site_count].mv.col = 0;
164 x->ss[search_site_count].mv.col = 0;
170 x->ss[search_site_count].mv.col = 0;
176 x->ss[search_site_count].mv.col = -Len;
182 x->ss[search_site_count].mv.col = Len;
188 x->ss[search_site_count].mv.col = -Len;
194 x->ss[search_site_count].mv.col = Len;
200 x->ss[search_site_count].mv.col = -Len;
206 x->ss[search_site_count].mv.col = Len;
235 unsigned char *y = *(d->base_pre) + d->pre + (bestmv->row) * d->pre_stride + bestmv->col;
238 int rr = ref_mv->row >> 1, rc = ref_mv->col >> 1;
239 int br = bestmv->row << 2, bc = bestmv->col << 2;
248 int minc = MAX(x->mv_col_min << 2, (ref_mv->col >> 1) - ((1 << mvlong_width) - 1));
249 int maxc = MIN(x->mv_col_max << 2, (ref_mv->col >> 1) + ((1 << mvlong_width) - 1));
255 bestmv->col <<= 3;
332 bestmv->col = bc << 1;
334 if ((abs(bestmv->col - ref_mv->col) > MAX_FULL_PEL_VAL) || (abs(bestmv->row - ref_mv->row) > MAX_FULL_PEL_VAL))
353 unsigned char *y = *(d->base_pre) + d->pre + (bestmv->row) * d->pre_stride + bestmv->col;
361 if ((abs((bestmv->col << 3) - ref_mv->col) > MAX_FULL_PEL_VAL) || (abs((bestmv->row << 3) - ref_mv->row) > MAX_FULL_PEL_VAL))
364 bestmv->col <<= 3;
370 bestmv->col <<= 3;
379 this_mv.col = ((startmv.col - 8) | 4);
389 this_mv.col += 8;
400 this_mv.col = startmv.col;
431 this_mv.col = (this_mv.col - 8) | 4;
436 this_mv.col += 4;
441 this_mv.col = (this_mv.col - 8) | 4;
446 this_mv.col += 4;
467 if (bestmv->col < startmv.col)
477 if (startmv.col & 7)
479 this_mv.col = startmv.col - 2;
480 left = svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
484 this_mv.col = (startmv.col - 8) | 6;
496 this_mv.col += 4;
497 right = svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
507 this_mv.col = startmv.col;
512 up = svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
517 up = svf(y - d->pre_stride, d->pre_stride, this_mv.col & 7, 6, z, b->src_stride, &sse);
529 down = svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
554 if (startmv.col & 7)
556 this_mv.col -= 2;
557 diag = svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
561 this_mv.col = (startmv.col - 8) | 6;
569 if (startmv.col & 7)
571 this_mv.col -= 2;
572 diag = svf(y - d->pre_stride, d->pre_stride, this_mv.col & 7, 6, z, b->src_stride, &sse);
576 this_mv.col = (startmv.col - 8) | 6;
583 this_mv.col += 2;
588 diag = svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
593 diag = svf(y - d->pre_stride, d->pre_stride, this_mv.col & 7, 6, z, b->src_stride, &sse);
600 if (startmv.col & 7)
602 this_mv.col -= 2;
603 diag = svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
607 this_mv.col = (startmv.col - 8) | 6;
613 this_mv.col += 2;
615 diag = svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
638 unsigned char *y = *(d->base_pre) + d->pre + (bestmv->row) * d->pre_stride + bestmv->col;
644 if ((abs((bestmv->col << 3) - ref_mv->col) > MAX_FULL_PEL_VAL) || (abs((bestmv->row << 3) - ref_mv->row) > MAX_FULL_PEL_VAL))
647 bestmv->col <<= 3;
653 bestmv->col <<= 3;
662 this_mv.col = ((startmv.col - 8) | 4);
672 this_mv.col += 8;
683 this_mv.col = startmv.col;
713 this_mv.col = (this_mv.col - 8) | 4;
718 this_mv.col += 4;
723 this_mv.col = (this_mv.col - 8) | 4;
728 this_mv.col += 4;
743 this_mv.col = (this_mv.col - 8) | 4;
754 this_mv.col += 8;
764 this_mv.col = (this_mv.col - 8) | 4;
775 this_mv.col += 8;
826 int rr = ref_mv->row, rc = ref_mv->col, br = rr >> 3, bc = rc >> 3, tr, tc;
850 int nr = tr + hex[i].row, nc = tc + hex[i].col;
881 int nr = tr + next_chkpts[tk][i].row, nc = tc + next_chkpts[tk][i].col;
915 int nr = tr + neighbors[i].row, nc = tc + neighbors[i].col;
929 best_mv->col = bc;
969 //int rr= ref_mv->row,rc= ref_mv->col,br=rr,bc=rc,tr,tc;
970 int rr = ref_mv->row, rc = ref_mv->col, br = rr >> 3, bc = rc >> 3, tr, tc;
1004 int nr = tr + hex[i].row, nc = tc + hex[i].col;
1027 int nr = tr + neighbors[i].row, nc = tc + neighbors[i].col;
1041 best_mv->col = bc;
1085 int ref_col = ref_mv->col >> 3;
1112 best_mv->col = ref_col;
1122 this_col_offset = best_mv->col + ss[i].mv.col;
1134 this_mv.col = this_col_offset << 3;
1151 best_mv->col += ss[best_site].mv.col;
1160 this_mv.col = best_mv->col << 3;
1200 int ref_col = ref_mv->col >> 3;
1227 best_mv->col = ref_col;
1237 check_col_min = x->mv_col_min - best_mv->col;
1238 check_col_max = x->mv_col_max - best_mv->col;
1248 valid_block [t] = (ss[t+i].mv.col > check_col_min);
1249 valid_block [t] &= (ss[t+i].mv.col < check_col_max);
1270 this_mv.col = (best_mv->col + ss[i].mv.col) << 3;
1297 this_col_offset = best_mv->col + ss[i].mv.col;
1300 this_mv.col = this_col_offset << 3;
1317 best_mv->col += ss[best_site].mv.col;
1326 this_mv.col = best_mv->col << 3;
1354 int ref_col = ref_mv->col >> 3;
1366 best_mv->col = ref_col;
1400 this_mv.col = c << 3;
1409 best_mv->col = c;
1418 this_mv.col = best_mv->col << 3;
1444 int ref_col = ref_mv->col >> 3;
1458 best_mv->col = ref_col;
1499 this_mv.col = c << 3;
1506 best_mv->col = c;
1522 this_mv.col = c << 3;
1529 best_mv->col = c;
1541 this_mv.col = best_mv->col << 3;
