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

  /external/chromium_org/third_party/libwebp/enc/
quant.c 496 int best_path[3] = {-1, -1, -1}; // store best-last/best-level/best-previous local
605 best_path[0] = n; // best eob position
606 best_path[1] = m; // best level
607 best_path[2] = p; // best predecessor
617 if (best_path[0] == -1) {
623 // best_prev for non-terminal. So we patch best_path[2] in.
624 n = best_path[0];
625 best_node = best_path[1];
626 NODE(n, best_node).prev = best_path[2]; // force best-prev for terminal
    [all...]
  /external/webp/src/enc/
quant.c 496 int best_path[3] = {-1, -1, -1}; // store best-last/best-level/best-previous local
605 best_path[0] = n; // best eob position
606 best_path[1] = m; // best level
607 best_path[2] = p; // best predecessor
617 if (best_path[0] == -1) {
623 // best_prev for non-terminal. So we patch best_path[2] in.
624 n = best_path[0];
625 best_node = best_path[1];
626 NODE(n, best_node).prev = best_path[2]; // force best-prev for terminal
    [all...]

Completed in 5066 milliseconds