/external/libvpx/vp8/common/ |
mv.h | 19 } MV;
|
findnearmv.h | 15 #include "mv.h" 24 MV *nearest, MV *nearby, MV *best,
|
entropymode.h | 28 extern int vp8_mv_cont(const MV *l, const MV *a);
|
findnearmv.c | 23 MV as_mv; 28 MV xmv; 29 xmv = x->mbmi.mv.as_mv; 41 void vp8_clamp_mv(MV *mv, const MACROBLOCKD *xd) 43 if (mv->col < (xd->mb_to_left_edge - LEFT_TOP_MARGIN)) 44 mv->col = xd->mb_to_left_edge - LEFT_TOP_MARGIN; 45 else if (mv->col > xd->mb_to_right_edge + RIGHT_BOTTOM_MARGIN) 46 mv->col = xd->mb_to_right_edge + RIGHT_BOTTOM_MARGIN; 48 if (mv->row < (xd->mb_to_top_edge - LEFT_TOP_MARGIN) 71 int_mv *mv = near_mvs; local [all...] |
blockd.h | 19 #include "mv.h" 148 MV as_mv; 149 } mv; member in struct:__anon5210 169 MV as_mv; 170 } mv; member in struct:__anon5213 266 //char mode_lf_deltas[MAX_MODE_LF_DELTAS]; // 0 = BPRED, ZERO_MV, MV, SPLIT 268 signed char mode_lf_deltas[MAX_MODE_LF_DELTAS]; // 0 = BPRED, ZERO_MV, MV, SPLIT
|
entropymode.c | 36 int vp8_mv_cont(const MV *l, const MV *a)
|
/external/libvpx/vp8/encoder/ |
encodemv.h | 18 void vp8_encode_motion_vector(vp8_writer *, const MV *, const MV_CONTEXT *);
|
mcomp.h | 25 #define MAX_FULL_PEL_VAL ((1 << (MAX_MVSEARCH_STEPS+3)) - 8) // Max full pel mv specified in 1/8 pel units 30 extern int vp8_mv_bit_cost(MV *mv, MV *ref, int *mvcost[2], int Weight); 40 MV *ref_mv, 41 MV *best_mv, 52 typedef int (fractional_mv_step_fp)(MACROBLOCK *x, BLOCK *b, BLOCKD *d, MV *bestmv, MV *ref_mv, int error_per_bit, vp8_subpixvariance_fn_t svf, vp8_variance_fn_t vf, int *mvcost[2]); 64 MV *ref_mv, \ 78 MV *ref_mv, [all...] |
mcomp.c | 37 int vp8_mv_bit_cost(MV *mv, MV *ref, int *mvcost[2], int Weight) 39 // MV costing is based on the distribution of vectors in the previous frame and as such will tend to 43 return ((mvcost[0][(mv->row - ref->row) >> 1] + mvcost[1][(mv->col - ref->col) >> 1]) * Weight) >> 7; 46 int vp8_mv_err_cost(MV *mv, MV *ref, int *mvcost[2], int error_per_bit) 49 //return ((mvcost[0][(mv->row - ref->row)>>1] + mvcost[1][(mv->col - ref->col)>>1] + 128) * error_per_bit) >> 8 [all...] |
block.h | 24 MV mv; member in struct:__anon5279 48 // MV enc_mv;
|
pickinter.c | 48 extern int vp8_rd_pick_best_mbsegmentation(VP8_COMP *cpi, MACROBLOCK *x, MV *best_ref_mv, int best_rd, int *, int *, int *, int, int *mvcost[2], int, int fullpixel); 50 extern void vp8_set_mbmode_and_mvs(MACROBLOCK *x, MB_PREDICTION_MODE mb, MV *mv); 53 int vp8_skip_fractional_mv_step(MACROBLOCK *mb, BLOCK *b, BLOCKD *d, MV *bestmv, MV *ref_mv, int error_per_bit, vp8_subpixvariance_fn_t svf, vp8_variance_fn_t vf, int *mvcost[2]) 77 int xoffset = d->bmi.mv.as_mv.col & 7; 78 int yoffset = d->bmi.mv.as_mv.row & 7; 80 in_what += (d->bmi.mv.as_mv.row >> 3) * d->pre_stride + (d->bmi.mv.as_mv.col >> 3); 263 xd->block[i].bmi.mv.as_int = 0 [all...] |
rdopt.c | 556 mv_row = x->e_mbd.block[16].bmi.mv.as_mv.row; 557 mv_col = x->e_mbd.block[16].bmi.mv.as_mv.col; 903 void vp8_set_mbmode_and_mvs(MACROBLOCK *x, MB_PREDICTION_MODE mb, MV *mv) 908 x->e_mbd.mode_info_context->mbmi.mv.as_mv.row = mv->row; 909 x->e_mbd.mode_info_context->mbmi.mv.as_mv.col = mv->col; 915 bmi->mv.as_mv.row = mv->row 995 const MV mv = col ? d[-1].bmi.mv.as_mv : vp8_left_bmi(mic, i)->mv.as_mv; local [all...] |
bitstream.c | 812 vp8_writer *w, const MV *mv, const MV *ref, const MV_CONTEXT *mvc 815 MV e; 816 e.row = mv->row - ref->row; 817 e.col = mv->col - ref->col; 932 // These specified to 8th pel as they are always compared to MV values that are in 1/8th pel units 970 MV best_mv; 984 MV n1, n2; 1010 write_mv(w, &mi->mv.as_mv, &best_mv, mvc) [all...] |
firstpass.c | 44 extern void vp8_set_mbmode_and_mvs(MACROBLOCK *x, MB_PREDICTION_MODE mb, MV *mv); 469 void vp8_first_pass_motion_search(VP8_COMP *cpi, MACROBLOCK *x, MV *ref_mv, MV *best_mv, YV12_BUFFER_CONFIG *recon_buffer, int *best_motion_err, int recon_yoffset ) 476 MV tmp_mv = {0, 0}; 492 // Initial step/diamond search centred on best mv 557 MV best_ref_mv = {0, 0}; 558 MV zero_ref_mv = {0, 0}; 582 // Initialise the MV cost table to the defaults 595 MV best_ref_mv = {0, 0} [all...] |
encodemv.c | 68 void vp8_encode_motion_vector(vp8_writer *w, const MV *mv, const MV_CONTEXT *mvc) 73 if (abs(mv->row >> 1) > max_mv_r) 76 max_mv_r = abs(mv->row >> 1); 77 fprintf(f, "New Mv Row Max %6d\n", (mv->row >> 1)); 79 if ((abs(mv->row) / 2) != max_mv_r) 80 fprintf(f, "MV Row conversion error %6d\n", abs(mv->row) / 2); 85 if (abs(mv->col >> 1) > max_mv_c [all...] |
/external/e2fsprogs/lib/ |
Makefile.bsd-lib | 26 $(MV) pic/$(BSD_LIB) .
|
Makefile.darwin-lib | 28 @$(MV) pic/$(BSD_LIB) .
|
Makefile.elf-lib | 29 @$(MV) elfshared/$(ELF_LIB) .
|
Makefile.solaris-lib | 29 @$(MV) elfshared/$(ELF_LIB) .
|
/external/libvpx/vp8/encoder/arm/ |
mcomp_arm.c | 72 int vp8_mv_bit_cost(MV *mv, MV *ref, int *mvcost[2], int Weight) 74 // MV costing is based on the distribution of vectors in the previous frame and as such will tend to 78 return ((mvcost[0][(mv->row - ref->row) >> 1] + mvcost[1][(mv->col - ref->col) >> 1]) * Weight) >> 7; 81 int vp8_mv_err_cost(MV *mv, MV *ref, int *mvcost[2], int error_per_bit) 84 //return ((mvcost[0][(mv->row - ref->row)>>1] + mvcost[1][(mv->col - ref->col)>>1] + 128) * error_per_bit) >> 8 [all...] |
/external/libvpx/vp8/decoder/ |
decodemv.c | 173 static void read_mv(vp8_reader *r, MV *mv, const MV_CONTEXT *mvc) 175 mv->row = (short)(read_mvcomponent(r, mvc) << 1); 176 mv->col = (short)(read_mvcomponent(r, ++mvc) << 1); 292 const MV Zero = { 0, 0}; 297 MV *const mv = & mbmi->mv.as_mv; local 310 // These specified to 8th pel as they are always compared to MV values that are in 1/8th pel units 333 MV nearest, nearby, best_mv 357 MV *const mv = & bmi.mv.as_mv; local [all...] |
/external/e2fsprogs/lib/ss/ |
Makefile.in | 115 $(MV) -f y.tab.c ct.tab.c 116 $(MV) -f y.tab.h ct.tab.h
|
/cts/apps/CtsVerifier/arduino-helper/ |
Makefile | 138 MV = mv -f
|
/external/libpng/ |
ltmain.sh | 125 : ${MV="mv -f"} 1096 $MV "${write_libobj}T" "${write_libobj}" [all...] |
/external/protobuf/gtest/build-aux/ |
ltmain.sh | 125 : ${MV="mv -f"} 1095 $MV "${write_libobj}T" "${write_libobj}" [all...] |