Searched refs:best_path (Results 1 - 3 of 3) sorted by relevance

/external/chromium_org/third_party/libwebp/enc/
H A Dquant.c562 int best_path[3] = {-1, -1, -1}; // store best-last/best-level/best-previous local
673 best_path[0] = n; // best eob position
674 best_path[1] = m; // best node index
675 best_path[2] = best_prev; // best predecessor
684 if (best_path[0] == -1) {
691 // best_prev for non-terminal. So we patch best_path[2] in.
693 int best_node = best_path[1];
694 n = best_path[0];
695 NODE(n, best_node).prev = best_path[2]; // force best-prev for terminal
/external/webp/src/enc/
H A Dquant.c562 int best_path[3] = {-1, -1, -1}; // store best-last/best-level/best-previous local
673 best_path[0] = n; // best eob position
674 best_path[1] = m; // best node index
675 best_path[2] = best_prev; // best predecessor
684 if (best_path[0] == -1) {
691 // best_prev for non-terminal. So we patch best_path[2] in.
693 int best_node = best_path[1];
694 n = best_path[0];
695 NODE(n, best_node).prev = best_path[2]; // force best-prev for terminal
/external/chromium_org/testing/gtest/src/
H A Dgtest.cc1035 std::vector<EditType> best_path; local
1038 best_path.push_back(move);
1042 std::reverse(best_path.begin(), best_path.end());
1043 return best_path;

Completed in 189 milliseconds