Lines Matching refs:best_path
562 int best_path[3] = {-1, -1, -1}; // store best-last/best-level/best-previous
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
