Lines Matching refs:row
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;
74 x->ss[search_site_count].mv.row = 0;
83 x->ss[search_site_count].mv.row = -Len;
89 x->ss[search_site_count].mv.row = Len;
95 x->ss[search_site_count].mv.row = 0;
101 x->ss[search_site_count].mv.row = 0;
121 x->ss[search_site_count].mv.row = 0;
130 x->ss[search_site_count].mv.row = -Len;
136 x->ss[search_site_count].mv.row = Len;
142 x->ss[search_site_count].mv.row = 0;
148 x->ss[search_site_count].mv.row = 0;
154 x->ss[search_site_count].mv.row = -Len;
160 x->ss[search_site_count].mv.row = -Len;
166 x->ss[search_site_count].mv.row = Len;
172 x->ss[search_site_count].mv.row = 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;
215 int minr = MAX(x->mv_row_min << 2, (ref_mv->row >> 1) - ((1 << mvlong_width) - 1));
216 int maxr = MIN(x->mv_row_max << 2, (ref_mv->row >> 1) + ((1 << mvlong_width) - 1));
219 bestmv->row <<= 3;
296 bestmv->row = br << 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))
328 bestmv->row <<= 3;
334 bestmv->row <<= 3;
343 this_mv.row = startmv.row;
366 this_mv.row = ((startmv.row - 8) | 4);
376 this_mv.row += 8;
397 this_mv.row = (this_mv.row - 8) | 4;
402 this_mv.row = (this_mv.row - 8) | 4;
407 this_mv.row += 4;
413 this_mv.row += 4;
430 if (bestmv->row < startmv.row)
441 this_mv.row = startmv.row;
446 left = vfp->svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
451 left = vfp->svf(y - 1, d->pre_stride, 6, this_mv.row & 7, z, b->src_stride, &sse);
463 right = vfp->svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
475 if (startmv.row & 7)
477 this_mv.row = startmv.row - 2;
478 up = vfp->svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
482 this_mv.row = (startmv.row - 8) | 6;
494 this_mv.row += 4;
495 down = vfp->svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
516 if (startmv.row & 7)
518 this_mv.row -= 2;
523 diag = vfp->svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
528 diag = vfp->svf(y - 1, d->pre_stride, 6, this_mv.row & 7, z, b->src_stride, &sse);;
533 this_mv.row = (startmv.row - 8) | 6;
551 if (startmv.row & 7)
553 this_mv.row -= 2;
554 diag = vfp->svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
558 this_mv.row = (startmv.row - 8) | 6;
564 this_mv.row += 2;
569 diag = vfp->svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
574 diag = vfp->svf(y - 1, d->pre_stride, 6, this_mv.row & 7, z, b->src_stride, &sse);;
580 this_mv.row += 2;
581 diag = vfp->svf(y, d->pre_stride, this_mv.col & 7, this_mv.row & 7, z, b->src_stride, &sse);
604 unsigned char *y = *(d->base_pre) + d->pre + (bestmv->row) * d->pre_stride + bestmv->col;
610 if ((abs((bestmv->col << 3) - ref_mv->col) > MAX_FULL_PEL_VAL) || (abs((bestmv->row << 3) - ref_mv->row) > MAX_FULL_PEL_VAL))
612 bestmv->row <<= 3;
618 bestmv->row <<= 3;
627 this_mv.row = startmv.row;
650 this_mv.row = ((startmv.row - 8) | 4);
660 this_mv.row += 8;
680 this_mv.row = (this_mv.row - 8) | 4;
685 this_mv.row = (this_mv.row - 8) | 4;
690 this_mv.row += 4;
695 this_mv.row += 4;
710 this_mv.row = (this_mv.row - 8) | 4;
731 this_mv.row = startmv.row + 4;
791 int rr = center_mv->row, rc = center_mv->col;
792 int br = ref_mv->row >> 3, bc = ref_mv->col >> 3, tr, tc;
816 int nr = tr + hex[i].row, nc = tc + hex[i].col;
847 int nr = tr + next_chkpts[tk][i].row, nc = tc + next_chkpts[tk][i].col;
881 int nr = tr + neighbors[i].row, nc = tc + neighbors[i].col;
894 best_mv->row = br;
938 int ref_row = ref_mv->row >> 3;
967 best_mv->row = ref_row;
975 this_row_offset = best_mv->row + ss[i].mv.row;
987 this_mv.row = this_row_offset << 3;
1004 best_mv->row += ss[best_site].mv.row;
1013 this_mv.row = best_mv->row << 3;
1054 int ref_row = ref_mv->row >> 3;
1083 best_mv->row = ref_row;
1092 all_in &= ((best_mv->row + ss[i].mv.row)> x->mv_row_min);
1093 all_in &= ((best_mv->row + ss[i+1].mv.row) < x->mv_row_max);
1114 this_mv.row = (best_mv->row + ss[i].mv.row) << 3;
1132 this_row_offset = best_mv->row + ss[i].mv.row;
1143 this_mv.row = this_row_offset << 3;
1160 best_mv->row += ss[best_site].mv.row;
1169 this_mv.row = best_mv->row << 3;
1197 int ref_row = ref_mv->row >> 3;
1209 best_mv->row = ref_row;
1237 this_mv.row = r << 3;
1252 best_mv->row = r;
1261 this_mv.row = best_mv->row << 3;
1287 int ref_row = ref_mv->row >> 3;
1301 best_mv->row = ref_row;
1327 this_mv.row = r << 3;
1349 best_mv->row = r;
1372 best_mv->row = r;
1384 this_mv.row = best_mv->row << 3;
1410 int ref_row = ref_mv->row >> 3;
1425 best_mv->row = ref_row;
1451 this_mv.row = r << 3;
1473 best_mv->row = r;
1502 best_mv->row = r;
1525 best_mv->row = r;
1536 this_mv.row = best_mv->row << 3;
