Searched defs:old_b (Results 1 - 4 of 4) sorted by relevance

/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/
H A Dvp9_subexp.c122 const int old_b = cost_branch256(ct, oldp); local
130 const int savings = old_b - new_b - update_b;
144 int i, old_b, new_b, update_b, savings, bestsavings, step; local
149 for (i = UNCONSTRAINED_NODES, old_b = 0; i < ENTROPY_NODES; ++i)
150 old_b += cost_branch256(ct + 2 * i, oldplist[i]);
151 old_b += cost_branch256(ct + 2 * PIVOT_NODE, oldplist[PIVOT_NODE]);
168 savings = old_b - new_b - update_b;
/external/libvpx/libvpx/vp9/encoder/
H A Dvp9_subexp.c123 const int old_b = cost_branch256(ct, oldp); local
131 const int savings = old_b - new_b - update_b;
145 int i, old_b, new_b, update_b, savings, bestsavings, step; local
150 for (i = UNCONSTRAINED_NODES, old_b = 0; i < ENTROPY_NODES; ++i)
151 old_b += cost_branch256(ct + 2 * i, oldplist[i]);
152 old_b += cost_branch256(ct + 2 * PIVOT_NODE, oldplist[PIVOT_NODE]);
169 savings = old_b - new_b - update_b;
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/
H A Dbitstream.c74 unsigned int new_b = 0, old_b = 0; local
86 old_b += vp8_cost_branch(bct[i], Pcur[i]);
90 if (new_b + (n << 8) < old_b)
843 const int old_b = vp8_cost_branch(ct, oldp); local
848 return old_b - new_b - update_b;
/external/libvpx/libvpx/vp8/encoder/
H A Dbitstream.c75 unsigned int new_b = 0, old_b = 0; local
87 old_b += vp8_cost_branch(bct[i], Pcur[i]);
91 if (new_b + (n << 8) < old_b)
844 const int old_b = vp8_cost_branch(ct, oldp); local
849 return old_b - new_b - update_b;

Completed in 119 milliseconds