Home
last modified time | relevance | path

Searched refs:MatcherNode (Results 1 – 3 of 3) sorted by relevance

/llvm-project/mlir/lib/Conversion/PDLToPDLInterp/
H A DPredicateTree.h26 class MatcherNode; variable
50 class MatcherNode {
52 virtual ~MatcherNode() = default;
58 static std::unique_ptr<MatcherNode>
70 std::unique_ptr<MatcherNode> &getFailureNode() { return failureNode; } in getFailureNode()
73 void setFailureNode(std::unique_ptr<MatcherNode> node) { in setFailureNode()
82 MatcherNode(TypeID matcherTypeID, Position *position = nullptr,
84 std::unique_ptr<MatcherNode> failureNode = nullptr);
94 std::unique_ptr<MatcherNode> failureNode;
97 std::unique_ptr<MatcherNode> failureNodeStorage;
[all …]
H A DPredicateTree.cpp805 static bool isSamePredicate(MatcherNode *node, OrderedPredicate *predicate) { in isSamePredicate()
812 std::unique_ptr<MatcherNode> &getOrCreateChild(SwitchNode *node, in getOrCreateChild()
828 static void propagatePattern(std::unique_ptr<MatcherNode> &node, in propagatePattern()
867 static void foldSwitchToBool(std::unique_ptr<MatcherNode> &node) { in foldSwitchToBool()
892 static void insertExitNode(std::unique_ptr<MatcherNode> *root) { in insertExitNode()
943 std::unique_ptr<MatcherNode>
944 MatcherNode::generateMatcherTree(ModuleOp module, PredicateBuilder &builder, in generateMatcherTree()
1026 std::unique_ptr<MatcherNode> root; in generateMatcherTree()
1037 // MatcherNode
1040 MatcherNode function in MatcherNode
[all...]
H A DPDLToPDLInterp.cpp53 Block *generateMatcher(MatcherNode &node, Region &region,
179 std::unique_ptr<MatcherNode> root = MatcherNode::generateMatcherTree( in lower()
190 Block *PatternLowering::generateMatcher(MatcherNode &node, Region &region, in generateMatcher()
211 std::unique_ptr<MatcherNode> &failureNode = node.getFailureNode(); in generateMatcher()
234 TypeSwitch<MatcherNode *>(&node) in generateMatcher()