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

  /external/libvpx/libvpx/vp9/encoder/
vp9_subexp.c 196 old_b += cost_branch256(ct + 2 * PIVOT_NODE, oldplist[PIVOT_NODE]);
199 bestnewp = oldp[PIVOT_NODE];
201 step = (*bestp > oldp[PIVOT_NODE] ? -1 : 1);
203 for (newp = *bestp; newp != oldp[PIVOT_NODE]; newp += step) {
206 newplist[PIVOT_NODE] = newp;
210 new_b += cost_branch256(ct + 2 * PIVOT_NODE, newplist[PIVOT_NODE]);
211 update_b = prob_diff_update_cost(newp, oldp[PIVOT_NODE]) +
vp9_bitstream.c 738 if (t == PIVOT_NODE)
778 if (t == PIVOT_NODE)
832 if (t == PIVOT_NODE)
    [all...]
  /external/libvpx/libvpx/vp9/common/
vp9_entropy.h 142 #define PIVOT_NODE 2 // which node is pivot
vp9_entropy.c 315 extend_model_to_full_distribution(model[PIVOT_NODE], full);

Completed in 48 milliseconds