Home
last modified time | relevance | path

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

/llvm-project/mlir/lib/Conversion/PDLToPDLInterp/
H A DRootOrdering.h78 using RootOrderingGraph = DenseMap<Value, DenseMap<Value, RootOrderingEntry>>; variable
96 OptimalBranching(RootOrderingGraph graph, Value root);
121 RootOrderingGraph graph;
H A DRootOrdering.cpp48 static void contract(RootOrderingGraph &graph, ArrayRef<Value> cycle, in contract()
120 OptimalBranching::OptimalBranching(RootOrderingGraph graph, Value root) in OptimalBranching()
H A DPredicateTree.cpp422 static void buildCostGraph(ArrayRef<Value> roots, RootOrderingGraph &graph, in buildCostGraph()
621 RootOrderingGraph graph; in buildPredicateList()
/llvm-project/mlir/unittests/Conversion/PDLToPDLInterp/
H A DRootOrderingTest.cpp68 RootOrderingGraph graph;