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

  /external/c-ares/
ares_llist.c 70 struct list_node old_b = *head_b; local
82 *head_a = old_b;
83 old_b.next->prev = head_a;
84 old_b.prev->next = head_a;
  /external/libvpx/libvpx/vp9/encoder/
vp9_subexp.c 118 const int old_b = cost_branch256(ct, oldp); local
124 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) {
128 const int savings = old_b - new_b - update_b;
143 int i, old_b, new_b, update_b, savings, bestsavings; local
151 old_b = cost_branch256(ct + 2 * PIVOT_NODE, oldp);
153 old_b += cost_branch256(ct + 2 * i, oldplist[i - UNCONSTRAINED_NODES]);
160 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) {
168 savings = old_b - new_b - update_b;
  /external/libvpx/libvpx/vp8/encoder/
bitstream.c 60 unsigned int new_b = 0, old_b = 0; local
68 old_b += vp8_cost_branch(bct[i], Pcur[i]);
71 if (new_b + (n << 8) < old_b) {
711 const int old_b = vp8_cost_branch(ct, oldp); local
715 return old_b - new_b - update_b;
    [all...]

Completed in 2457 milliseconds