Searched refs:MatcherNode (Results 1 – 3 of 3) sorted by relevance
| /external/llvm-project/mlir/lib/Conversion/PDLToPDLInterp/ |
| D | PredicateTree.h | 26 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 …]
|
| D | PredicateTree.cpp | 263 static bool isSamePredicate(MatcherNode *node, OrderedPredicate *predicate) { in isSamePredicate()
270 std::unique_ptr<MatcherNode> &getOrCreateChild(SwitchNode *node, in getOrCreateChild()
286 static void propagatePattern(std::unique_ptr<MatcherNode> &node, in propagatePattern()
324 static void foldSwitchToBool(std::unique_ptr<MatcherNode> &node) { in foldSwitchToBool()
349 static void insertExitNode(std::unique_ptr<MatcherNode> *root) { in insertExitNode()
357 std::unique_ptr<MatcherNode>
358 MatcherNode::generateMatcherTree(ModuleOp module, PredicateBuilder &builder, in generateMatcherTree()
417 std::unique_ptr<MatcherNode> root; in generateMatcherTree()
431 MatcherNode::MatcherNode(TypeID matcherTypeID, Position *p, Qualifier *q, in MatcherNode() function in MatcherNode
432 std::unique_ptr<MatcherNode> failureNode) in MatcherNode()
[all …]
|
| D | PDLToPDLInterp.cpp | 45 Block *generateMatcher(MatcherNode &node);
147 std::unique_ptr<MatcherNode> root = MatcherNode::generateMatcherTree( in lower()
157 Block *PatternLowering::generateMatcher(MatcherNode &node) { in generateMatcher()
176 std::unique_ptr<MatcherNode> &failureNode = node.getFailureNode(); in generateMatcher()
|