Home
last modified time | relevance | path

Searched refs:OptimalBranching (Results 1 – 4 of 4) sorted by relevance

/llvm-project-15.0.7/mlir/lib/Conversion/PDLToPDLInterp/
H A DRootOrdering.cpp120 OptimalBranching::OptimalBranching(RootOrderingGraph graph, Value root) in OptimalBranching() function in OptimalBranching
123 unsigned OptimalBranching::solve() { in solve()
207 OptimalBranching::EdgeList
208 OptimalBranching::preOrderTraversal(ArrayRef<Value> nodes) const { in preOrderTraversal()
H A DRootOrdering.h90 class OptimalBranching {
96 OptimalBranching(RootOrderingGraph graph, Value root);
H A DPredicateTree.cpp617 OptimalBranching::EdgeList bestEdges; in buildPredicateList()
622 OptimalBranching solver(graph, root); in buildPredicateList()
632 OptimalBranching solver(graph, bestRoot); in buildPredicateList()
/llvm-project-15.0.7/mlir/unittests/Conversion/PDLToPDLInterp/
H A DRootOrderingTest.cpp49 void check(unsigned cost, const OptimalBranching::EdgeList &edges) { in check()
50 OptimalBranching opt(graph, v[0]); in check()