Home
last modified time | relevance | path

Searched refs:vp8_read (Results 1 – 3 of 3) sorted by relevance

/external/libvpx/vp8/decoder/
Ddecodemv.c58 if (vp8_read(r, x->mb_segment_tree_probs[0])) in vp8_read_mb_features()
59 mi->segment_id = (unsigned char)(2 + vp8_read(r, x->mb_segment_tree_probs[2])); in vp8_read_mb_features()
61 mi->segment_id = (unsigned char)(vp8_read(r, x->mb_segment_tree_probs[1])); in vp8_read_mb_features()
83 m->mbmi.mb_skip_coeff = vp8_read(bc, pbi->prob_skip_false); in vp8_kfread_modes()
144 if (vp8_read(r, p [mvpis_short])) /* Large */ in read_mvcomponent()
150 x += vp8_read(r, p [MVPbits + i]) << i; in read_mvcomponent()
158 x += vp8_read(r, p [MVPbits + i]) << i; in read_mvcomponent()
162 if (!(x & 0xFFF0) || vp8_read(r, p [MVPbits + 3])) in read_mvcomponent()
168 if (x && vp8_read(r, p [MVPsign])) in read_mvcomponent()
193 if (vp8_read(bc, *up++)) in read_mvcontexts()
[all …]
Dtreereader.h21 #define vp8_read vp8dx_decode_bool macro
23 #define vp8_read_bit( R) vp8_read( R, vp8_prob_half)
36 while ((i = t[ i + vp8_read(r, p[i>>1])]) > 0) ; in vp8_treed_read()
57 b = vp8_read(r, p[i>>1]); in vp8_treed_read_num()
Ddecodframe.c825 if (vp8_read(bc, vp8_coef_update_probs [i][j][k][l])) in vp8_decode_frame()