Home
last modified time | relevance | path

Searched refs:CostBenefit (Results 1 – 3 of 3) sorted by relevance

/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DInlineCost.h107 std::optional<CostBenefitPair> CostBenefit; variable
112 std::optional<CostBenefitPair> CostBenefit = std::nullopt)
115 CostBenefit(CostBenefit) { in Cost()
128 std::optional<CostBenefitPair> CostBenefit = std::nullopt) {
129 return InlineCost(AlwaysInlineCost, 0, 0, Reason, CostBenefit);
133 std::optional<CostBenefitPair> CostBenefit = std::nullopt) {
134 return InlineCost(NeverInlineCost, 0, 0, Reason, CostBenefit);
164 std::optional<CostBenefitPair> getCostBenefit() const { return CostBenefit; } in getCostBenefit()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DInlineOrder.cpp25 enum class InlinePriorityMode : int { Size, Cost, CostBenefit, ML }; enumerator
34 clEnumValN(InlinePriorityMode::CostBenefit, "cost-benefit",
122 CostBenefit = IC.getCostBenefit(); in CostBenefitPriority()
157 bool P1HasCB = P1.CostBenefit.has_value(); in isMoreDesirable()
158 bool P2HasCB = P2.CostBenefit.has_value(); in isMoreDesirable()
167 APInt LHS = P1.CostBenefit->getBenefit() * P2.CostBenefit->getCost(); in isMoreDesirable()
168 APInt RHS = P2.CostBenefit->getBenefit() * P1.CostBenefit->getCost(); in isMoreDesirable()
179 std::optional<CostBenefitPair> CostBenefit; member in __anona7cbcc7e0111::CostBenefitPriority
300 case InlinePriorityMode::CostBenefit: in getDefaultInlineOrder()
H A DInlineCost.cpp655 std::optional<CostBenefitPair> CostBenefit; member in __anon463f3bdb0111::InlineCostCallAnalyzer
1040 CostBenefit.emplace(APInt(128, Size), CycleSavings); in costBenefitAnalysis()
1245 std::optional<CostBenefitPair> getCostBenefitPair() { return CostBenefit; } in getCostBenefitPair()