Searched refs:best_node (Results 1 – 3 of 3) sorted by relevance
742 unsigned int best_node = -1; in ra_get_best_spill_node() local765 best_node = n; in ra_get_best_spill_node()769 return best_node; in ra_get_best_spill_node()
538 trees::TreeNode best_node = best_split.oblivious_split_info.split_node(); in FindBestSplitOblivious() local543 << ", best split: " << best_node.node_case() << ")"; in FindBestSplitOblivious()544 if (current_node.node_case() < best_node.node_case()) { in FindBestSplitOblivious()546 } else if (current_node.node_case() == best_node.node_case()) { in FindBestSplitOblivious()
731 int best_node = best_path[1]; in TrellisQuantizeBlock() local733 NODE(n, best_node).prev = best_path[2]; // force best-prev for terminal in TrellisQuantizeBlock()736 const Node* const node = &NODE(n, best_node); in TrellisQuantizeBlock()741 best_node = node->prev; in TrellisQuantizeBlock()