Searched refs:SuccessNode (Results 1 – 3 of 3) sorted by relevance
| /llvm-project-15.0.7/mlir/lib/Conversion/PDLToPDLInterp/ |
| H A D | PredicateTree.h | 154 struct SuccessNode : public MatcherNode { struct
155 explicit SuccessNode(pdl::PatternOp pattern, Value root,
161 return node->getMatcherTypeID() == TypeID::get<SuccessNode>(); in classof() argument
|
| H A D | PredicateTree.cpp | 811 std::make_unique<SuccessNode>(list.pattern, list.root, std::move(node)); in propagatePattern()
989 SuccessNode::SuccessNode(pdl::PatternOp pattern, Value root, in SuccessNode() function in SuccessNode
991 : MatcherNode(TypeID::get<SuccessNode>(), /*position=*/nullptr, in SuccessNode()
|
| H A D | PDLToPDLInterp.cpp | 66 void generate(SuccessNode *successNode, Block *¤tBlock);
216 .Case([&](SuccessNode *successNode) { in generateMatcher()
556 void PatternLowering::generate(SuccessNode *successNode, Block *¤tBlock) { in generate()
|