Searched refs:getPredicateFns (Results 1 – 13 of 13) sorted by relevance
194 if (!Op->getPredicateFns().empty()) { in initialize()195 TreePredicateFn PredFn = Op->getPredicateFns()[0]; in initialize()199 if (Op->getPredicateFns().size() > 1 || in initialize()224 if (!Op->getPredicateFns().empty() || Op->getNumTypes() != 1) in initialize()497 if (!InstPatNode->getPredicateFns().empty()) in collectPatterns()
709 if (!P->getPredicateFns().empty()) in getPatternSize()723 else if (!Child->getPredicateFns().empty()) in getPatternSize()1096 getPredicateFns() != N->getPredicateFns() || in isIsomorphicTo()1134 New->setPredicateFns(getPredicateFns()); in clone()1164 assert((Child->getPredicateFns().empty() || in SubstituteFormalArguments()1165 NewChild->getPredicateFns() == Child->getPredicateFns()) && in SubstituteFormalArguments()1189 assert((Child->getPredicateFns().empty() || in InlinePatternFragments()1190 NewChild->getPredicateFns() == Child->getPredicateFns()) && in InlinePatternFragments()1228 for (unsigned i = 0, e = getPredicateFns().size(); i != e; ++i) in InlinePatternFragments()1229 FragTree->addPredicateFn(getPredicateFns()[i]); in InlinePatternFragments()[all …]
284 N->getChild(1)->isLeaf() && N->getChild(1)->getPredicateFns().empty() && in EmitOperatorMatchCode()285 N->getPredicateFns().empty()) { in EmitOperatorMatchCode()447 for (unsigned i = 0, e = N->getPredicateFns().size(); i != e; ++i) in EmitMatchCode()448 AddMatcher(new CheckPredicateMatcher(N->getPredicateFns()[i])); in EmitMatchCode()
379 const std::vector<TreePredicateFn> &getPredicateFns() const { in getPredicateFns() function
201 if (!Op->getPredicateFns().empty()) { in initialize()202 TreePredicateFn PredFn = Op->getPredicateFns()[0]; in initialize()206 if (Op->getPredicateFns().size() > 1 || in initialize()231 if (!Op->getPredicateFns().empty() || Op->getNumTypes() != 1) in initialize()521 if (!InstPatNode->getPredicateFns().empty()) in collectPatterns()
319 N->getChild(1)->isLeaf() && N->getChild(1)->getPredicateFns().empty() && in EmitOperatorMatchCode()320 N->getPredicateFns().empty()) { in EmitOperatorMatchCode()484 for (unsigned i = 0, e = N->getPredicateFns().size(); i != e; ++i) in EmitMatchCode()485 AddMatcher(new CheckPredicateMatcher(N->getPredicateFns()[i])); in EmitMatchCode()
838 if (!P->getPredicateFns().empty()) in getPatternSize()852 else if (!Child->getPredicateFns().empty()) in getPatternSize()1319 getPredicateFns() != N->getPredicateFns() || in isIsomorphicTo()1357 New->setPredicateFns(getPredicateFns()); in clone()1389 assert((Child->getPredicateFns().empty() || in SubstituteFormalArguments()1390 NewChild->getPredicateFns() == Child->getPredicateFns()) && in SubstituteFormalArguments()1418 assert((Child->getPredicateFns().empty() || in InlinePatternFragments()1419 NewChild->getPredicateFns() == Child->getPredicateFns()) && in InlinePatternFragments()1459 for (const TreePredicateFn &Pred : getPredicateFns()) in InlinePatternFragments()3593 R->setPredicateFns(Orig->getPredicateFns()); in CombineChildVariants()[all …]
405 const std::vector<TreePredicateFn> &getPredicateFns() const { in getPredicateFns() function
212 if (!Op->getPredicateFns().empty()) { in initialize()213 TreePredicateFn PredFn = Op->getPredicateFns()[0]; in initialize()217 if (Op->getPredicateFns().size() > 1 || in initialize()238 if (!Op->getPredicateFns().empty() || Op->getNumTypes() != 1) in initialize()531 if (!InstPatNode->getPredicateFns().empty()) in collectPatterns()
322 N->getChild(1)->isLeaf() && N->getChild(1)->getPredicateFns().empty() && in EmitOperatorMatchCode()323 N->getPredicateFns().empty()) { in EmitOperatorMatchCode()488 for (unsigned i = 0, e = N->getPredicateFns().size(); i != e; ++i) in EmitMatchCode()489 AddMatcher(new CheckPredicateMatcher(N->getPredicateFns()[i])); in EmitMatchCode()
1274 if (!P->getPredicateFns().empty()) in getPatternSize()1294 else if (!Child->getPredicateFns().empty()) in getPatternSize()1772 getPredicateFns() != N->getPredicateFns() || in isIsomorphicTo()1811 New->setPredicateFns(getPredicateFns()); in clone()1843 assert((Child->getPredicateFns().empty() || in SubstituteFormalArguments()1844 NewChild->getPredicateFns() == Child->getPredicateFns()) && in SubstituteFormalArguments()1890 assert((Child->getPredicateFns().empty() || in InlinePatternFragments()1891 NewChild->getPredicateFns() == Child->getPredicateFns()) && in InlinePatternFragments()1909 R->setPredicateFns(getPredicateFns()); in InlinePatternFragments()1970 for (const TreePredicateFn &Pred : getPredicateFns()) in InlinePatternFragments()[all …]
203 for (const auto &P : N->getPredicateFns()) { in explainPredicates()287 for (const auto &Predicate : N->getPredicateFns()) { in isTrivialOperatorNode()3131 for (const auto &Predicate : N->getPredicateFns()) { in getEquivNode()3200 for (const auto &Predicate : Src->getPredicateFns()) { in createAndImportSelDAGMatcher()
666 const std::vector<TreePredicateFn> &getPredicateFns() const { in getPredicateFns() function