HomeSort by relevance Sort by last modified time
    Searched full:as_mv (Results 1 - 17 of 17) sorted by null

  /external/libvpx/libvpx/vp8/encoder/
mcomp.c 35 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 return ((mvcost[0][(mv->as_mv.row - ref->as_mv.row) >> 1] +
43 mvcost[1][(mv->as_mv.col - ref->as_mv.col) >> 1])
53 return ((mvsadcost[0][(mv->as_mv.row - ref->as_mv.row)]
    [all...]
pickinter.c 58 bestmv->as_mv.row <<= 3;
59 bestmv->as_mv.col <<= 3;
77 int xoffset = this_mv.as_mv.col & 7;
78 int yoffset = this_mv.as_mv.row & 7;
80 in_what += (this_mv.as_mv.row >> 3) * pre_stride + (this_mv.as_mv.col >> 3);
399 x->MVcount[0][mv_max+((xd->mode_info_context->mbmi.mv.as_mv.row -
400 best_ref_mv->as_mv.row) >> 1)]++;
401 x->MVcount[1][mv_max+((xd->mode_info_context->mbmi.mv.as_mv.col -
402 best_ref_mv->as_mv.col) >> 1)]++
    [all...]
mr_dissim.c 34 mvx[cnt] = x->mbmi.mv.as_mv.row; \
35 mvy[cnt] = x->mbmi.mv.as_mv.col; \
42 mvx[cnt] = x->mbmi.mv.as_mv.row; \
43 mvy[cnt] = x->mbmi.mv.as_mv.col; \
194 mmvx = MAX(abs(min_mvx - here->mbmi.mv.as_mv.row),
195 abs(max_mvx - here->mbmi.mv.as_mv.row));
196 mmvy = MAX(abs(min_mvy - here->mbmi.mv.as_mv.col),
197 abs(max_mvy - here->mbmi.mv.as_mv.col));
rdopt.c 474 int mv_row = x->e_mbd.mode_info_context->mbmi.mv.as_mv.row;
475 int mv_col = x->e_mbd.mode_info_context->mbmi.mv.as_mv.col;
1222 mvp_full.as_mv.row = bsi->mvp.as_mv.row >>3
    [all...]
temporal_filter.c 167 best_ref_mv1_full.as_mv.col = best_ref_mv1.as_mv.col >>3;
168 best_ref_mv1_full.as_mv.row = best_ref_mv1.as_mv.row >>3;
289 mbd->block[0].bmi.mv.as_mv.row = 0;
290 mbd->block[0].bmi.mv.as_mv.col = 0;
327 mbd->block[0].bmi.mv.as_mv.row,
328 mbd->block[0].bmi.mv.as_mv.col,
denoising.c 222 mv_col = x->best_sse_mv.as_mv.col;
223 mv_row = x->best_sse_mv.as_mv.row;
281 mv_row = x->best_sse_mv.as_mv.row;
282 mv_col = x->best_sse_mv.as_mv.col;
firstpass.c 462 ref_mv_full.as_mv.col = ref_mv->as_mv.col>>3;
463 ref_mv_full.as_mv.row = ref_mv->as_mv.row>>3;
473 best_mv->row = tmp_mv.as_mv.row;
474 best_mv->col = tmp_mv.as_mv.col;
499 best_mv->row = tmp_mv.as_mv.row;
500 best_mv->col = tmp_mv.as_mv.col;
647 d->bmi.mv.as_mv.row = 0;
648 d->bmi.mv.as_mv.col = 0
    [all...]
bitstream.c 456 e.row = mv->row - ref->as_mv.row;
457 e.col = mv->col - ref->as_mv.col;
656 write_mv(w, &mi->mv.as_mv, &best_mv, mvc);
698 write_mv(w, &blockmv.as_mv, &best_mv, (const MV_CONTEXT *) mvc);
    [all...]
  /external/libvpx/libvpx/vp8/common/
findnearmv.h 26 mvp->as_mv.row *= -1;
27 mvp->as_mv.col *= -1;
35 if (mv->as_mv.col < (xd->mb_to_left_edge - LEFT_TOP_MARGIN))
36 mv->as_mv.col = xd->mb_to_left_edge - LEFT_TOP_MARGIN;
37 else if (mv->as_mv.col > xd->mb_to_right_edge + RIGHT_BOTTOM_MARGIN)
38 mv->as_mv.col = xd->mb_to_right_edge + RIGHT_BOTTOM_MARGIN;
40 if (mv->as_mv.row < (xd->mb_to_top_edge - LEFT_TOP_MARGIN))
41 mv->as_mv.row = xd->mb_to_top_edge - LEFT_TOP_MARGIN;
42 else if (mv->as_mv.row > xd->mb_to_bottom_edge + RIGHT_BOTTOM_MARGIN)
43 mv->as_mv.row = xd->mb_to_bottom_edge + RIGHT_BOTTOM_MARGIN
    [all...]
reconinter.c 131 ptr = base_pre + d->offset + (d->bmi.mv.as_mv.row >> 3) * pre_stride + (d->bmi.mv.as_mv.col >> 3);
133 if (d->bmi.mv.as_mv.row & 7 || d->bmi.mv.as_mv.col & 7)
135 sppf(ptr, pre_stride, d->bmi.mv.as_mv.col & 7, d->bmi.mv.as_mv.row & 7, pred_ptr, pitch);
158 ptr = base_pre + d->offset + (d->bmi.mv.as_mv.row >> 3) * pre_stride + (d->bmi.mv.as_mv.col >> 3);
160 if (d->bmi.mv.as_mv.row & 7 || d->bmi.mv.as_mv.col & 7
    [all...]
mv.h 25 MV as_mv; member in union:int_mv
debugmodes.c 119 fprintf(mvs, "%5d:%-5d", mi[mb_index].mbmi.mv.as_mv.row / 2, mi[mb_index].mbmi.mv.as_mv.col / 2);
146 fprintf(mvs, "%3d:%-3d ", mi[mb_index].bmi[bindex].mv.as_mv.row, mi[mb_index].bmi[bindex].mv.as_mv.col);
findnearmv.c 142 inv->as_mv.row = src->as_mv.row * -1;
143 inv->as_mv.col = src->as_mv.col * -1;
mfqe.c 259 map[i] &= (mode_info_context->bmi[ndx[i][j]].mv.as_mv.row <= 2 &&
260 mode_info_context->bmi[ndx[i][j]].mv.as_mv.col <= 2);
267 abs(mode_info_context->mbmi.mv.as_mv.row) <= 2 &&
268 abs(mode_info_context->mbmi.mv.as_mv.col) <= 2);
postproc.c 960 MV *mv = &bmi->mv.as_mv;
981 MV *mv = &bmi->mv.as_mv;
1002 MV *mv = &bmi->mv.as_mv;
1044 MV *mv = &bmi->mv.as_mv;
1060 MV *mv = &mi->mbmi.mv.as_mv
    [all...]
  /external/libvpx/libvpx/vp8/decoder/
error_concealment.c 189 new_row = row - bmi->mv.as_mv.row;
190 new_col = col - bmi->mv.as_mv.col;
261 col_acc += overlaps[i].overlap * overlaps[i].bmi->mv.as_mv.col;
262 row_acc += overlaps[i].overlap * overlaps[i].bmi->mv.as_mv.row;
268 bmi->mv.as_mv.col = col_acc / overlap_sum;
269 bmi->mv.as_mv.row = row_acc / overlap_sum;
273 bmi->mv.as_mv.col = 0;
274 bmi->mv.as_mv.row = 0;
290 MV * const filtered_mv = &(mi->mbmi.mv.as_mv);
316 filtered_mv->col += bmi[i].mv.as_mv.col
    [all...]
decodemv.c 295 blockmv.as_mv.row = read_mvcomponent(bc, &mvc[0]) << 1;
296 blockmv.as_mv.row += best_mv.as_mv.row;
297 blockmv.as_mv.col = read_mvcomponent(bc, &mvc[1]) << 1;
298 blockmv.as_mv.col += best_mv.as_mv.col;
495 read_mv(bc, &mbmi_mv->as_mv, (const MV_CONTEXT *) mvc);
496 mbmi_mv->as_mv.row += near_mvs[near_index].as_mv.row;
497 mbmi_mv->as_mv.col += near_mvs[near_index].as_mv.col
    [all...]

Completed in 252 milliseconds