HomeSort by relevance Sort by last modified time
    Searched refs:vp9_read (Results 1 - 7 of 7) sorted by null

  /external/libvpx/libvpx/vp9/decoder/
vp9_treereader.h 24 while ((i = t[ i + vp9_read(r, p[i >> 1])]) > 0)
vp9_detokenize.c 89 val += (vp9_read(r, prob) << bits_count); \
123 if (!vp9_read(r, prob[EOB_CONTEXT_NODE]))
136 if (!vp9_read(r, prob[ZERO_CONTEXT_NODE])) {
144 if (!vp9_read(r, prob[ONE_CONTEXT_NODE])) {
155 if (!vp9_read(r, prob[LOW_VAL_CONTEXT_NODE])) {
156 if (!vp9_read(r, prob[TWO_CONTEXT_NODE])) {
159 if (!vp9_read(r, prob[THREE_CONTEXT_NODE])) {
165 if (!vp9_read(r, prob[HIGH_LOW_CONTEXT_NODE])) {
166 if (!vp9_read(r, prob[CAT_ONE_CONTEXT_NODE])) {
177 if (!vp9_read(r, prob[CAT_THREEFOUR_CONTEXT_NODE]))
    [all...]
vp9_dboolhuff.h 41 static int vp9_read(vp9_reader *br, int probability) { function
79 return vp9_read(r, 128); // vp9_prob_half
vp9_decodemv.c 68 TX_SIZE tx_size = vp9_read(r, tx_probs[0]);
70 tx_size += vp9_read(r, tx_probs[1]);
72 tx_size += vp9_read(r, tx_probs[2]);
139 const int pred_flag = vp9_read(r, pred_prob);
156 const int skip = vp9_read(r, cm->fc.mbskip_probs[ctx]);
212 const int sign = vp9_read(r, mvcomp->sign);
225 d |= vp9_read(r, mvcomp->bits[i]) << i;
234 hp = usehp ? vp9_read(r, class0 ? mvcomp->class0_hp : mvcomp->hp)
265 const int mode = vp9_read(r, cm->fc.comp_inter_prob[ctx]);
290 const int bit = vp9_read(r, fc->comp_ref_prob[ctx])
    [all...]
vp9_dsubexp.c 103 if (vp9_read(r, DIFF_UPDATE_PROB)) {
vp9_decodframe.c 162 if (vp9_read(r, NMV_UPDATE_PROB))
469 p = vp9_read(r, probs[1]) ? PARTITION_SPLIT : PARTITION_HORZ;
471 p = vp9_read(r, probs[2]) ? PARTITION_SPLIT : PARTITION_VERT;
    [all...]
  /external/libvpx/libvpx/test/
vp9_boolcoder_test.cc 83 GTEST_ASSERT_EQ(vp9_read(&br, probas[i]), bit)

Completed in 128 milliseconds