Searched refs:getPredicateCalls (Results 1 – 5 of 5) sorted by relevance
227 if (!Op.getPredicateCalls().empty()) { in initialize()228 TreePredicateFn PredFn = Op.getPredicateCalls()[0].Fn; in initialize()232 if (Op.getPredicateCalls().size() > 1 || in initialize()252 if (!Op.getPredicateCalls().empty() || Op.getNumTypes() != 1) in initialize()539 if (!InstPatNode.getPredicateCalls().empty()) in collectPatterns()
337 N.getChild(1).isLeaf() && N.getChild(1).getPredicateCalls().empty() && in EmitOperatorMatchCode()338 N.getPredicateCalls().empty()) { in EmitOperatorMatchCode()529 for (unsigned i = 0, e = N.getPredicateCalls().size(); i != e; ++i) { in EmitMatchCode()530 const TreePredicateCall &Pred = N.getPredicateCalls()[i]; in EmitMatchCode()
95 for (const TreePredicateCall &Call : N.getPredicateCalls()) { in explainPredicates()201 for (const TreePredicateCall &Call : N.getPredicateCalls()) { in isTrivialOperatorNode()524 for (const TreePredicateCall &Call : N.getPredicateCalls()) { in getEquivNode()759 for (const TreePredicateCall &Call : Src.getPredicateCalls()) { in createAndImportSelDAGMatcher()1001 for (const TreePredicateCall &Call : SrcChild.getPredicateCalls()) { in importChildMatcher()
1449 if (!P.getPredicateCalls().empty()) in getPatternSize()1471 else if (!Child.getPredicateCalls().empty()) in getPatternSize()1985 getPredicateCalls() != N.getPredicateCalls() || in isIsomorphicTo()2022 New->setPredicateCalls(getPredicateCalls()); in clone()2057 assert((Child.getPredicateCalls().empty() || in SubstituteFormalArguments()2058 NewChild->getPredicateCalls() == Child.getPredicateCalls()) && in SubstituteFormalArguments()2101 assert((Child->getPredicateCalls().empty() || in InlinePatternFragments()2104 return NewChild->getPredicateCalls() == in InlinePatternFragments()2105 Child->getPredicateCalls(); in InlinePatternFragments()2125 R->setPredicateCalls(getPredicateCalls()); in InlinePatternFragments()[all …]
751 const std::vector<TreePredicateCall> &getPredicateCalls() const { in getPredicateCalls() function