Searched refs:getBenefit (Results 1 – 14 of 14) sorted by relevance
46 if (pat.getBenefit().isImpossibleToMatch()) { in applyCostModel()144 (!bestPattern || bestPattern->getBenefit() < (*anyIt)->getBenefit())) in matchAndRewrite()148 (!bestPattern || bestPattern->getBenefit() < pdlIt->benefit)) { in matchAndRewrite()
703 state.currentPatternBenefits.push_back(pattern.getBenefit()); in initializeMutableState()1142 LLVM_DEBUG(llvm::dbgs() << " * Benefit: " << benefit.getBenefit() << "\n" in execute()
201 unsigned getBenefit() const { in getBenefit() function215 const unsigned B = getBenefit(); in OutlinedFunction()
202 unsigned getBenefit() const { in getBenefit() function216 const unsigned B = getBenefit(); in OutlinedFunction()
495 R << "Saved " << NV("OutliningBenefit", OF.getBenefit()) << " bytes by " in emitOutlinedFunctionRemark()589 if (OF.getBenefit() < 1) { in findCandidates()746 return LHS.getBenefit() > RHS.getBenefit(); in outline()762 if (OF.getBenefit() < 1) in outline()
60 applyCostModel([](const Pattern &pattern) { return pattern.getBenefit(); }); in applyDefaultCostModel()
992 R << "Saved " << NV("OutliningBenefit", OF.getBenefit()) << " bytes by " in emitOutlinedFunctionRemark()1086 if (OF.getBenefit() < 1) { in findCandidates()1204 return LHS.getBenefit() > RHS.getBenefit(); in outline()1220 if (OF.getBenefit() < 1) in outline()
44 unsigned short getBenefit() const;84 PatternBenefit getBenefit() const { return benefit; } in getBenefit() function
422 int getBenefit() const;
23 unsigned short PatternBenefit::getBenefit() const { in getBenefit() function in PatternBenefit
590 int Pattern::getBenefit() const { in getBenefit() function in Pattern
217 return pattern.getBenefit();
2041 auto lhsBenefit = lhs->first->getBenefit(); in applyCostModelToPatterns()2042 auto rhsBenefit = rhs->first->getBenefit(); in applyCostModelToPatterns()
643 os << formatv(R"(}, {0}, context) {{})", pattern.getBenefit()) << "\n"; in emit()