Searched refs:LoopCost (Results 1 – 6 of 6) sorted by relevance
280 CostInfo *LoopCost);968 CostInfo LoopCost[2] = {{Scaled64::getZero(), Scaled64::getZero()}, in findProfitableSIGroupsInnerLoops() local970 if (!computeLoopCosts(L, SIGroups, InstCostMap, LoopCost) || in findProfitableSIGroupsInnerLoops()971 !checkLoopHeuristics(L, LoopCost)) { in findProfitableSIGroupsInnerLoops()1211 const CostInfo LoopCost[2]) { in checkLoopHeuristics()1221 if (LoopCost[0].NonPredCost > LoopCost[0].PredCost || in checkLoopHeuristics()1222 LoopCost[1].NonPredCost >= LoopCost[1].PredCost) { in checkLoopHeuristics()1229 Scaled64 Gain[2] = {LoopCost[0].PredCost - LoopCost[0].NonPredCost, in checkLoopHeuristics()1230 LoopCost[1].PredCost - LoopCost[1].NonPredCost}; in checkLoopHeuristics()1236 Gain[1] * Scaled64::get(GainRelativeThreshold) < LoopCost[1].PredCost) { in checkLoopHeuristics()[all …]
617 CacheCostTy LoopCost = computeLoopCacheCost(*L, RefGroups); in calculateCacheFootprint() local618 LoopCosts.push_back(std::make_pair(L, LoopCost)); in calculateCacheFootprint()718 CacheCostTy LoopCost = 0; in computeLoopCacheCost() local721 LoopCost += RefGroupCost * TripCountsProduct; in computeLoopCacheCost()725 << "' has cost=" << LoopCost << "\n"); in computeLoopCacheCost()727 return LoopCost; in computeLoopCacheCost()
3345 InstructionCost LoopCost = 0; in findBestNonTrivialUnswitchCandidate() local3354 LoopCost += Cost; in findBestNonTrivialUnswitchCandidate()3355 assert(LoopCost >= 0 && "Must not have negative loop costs!"); in findBestNonTrivialUnswitchCandidate()3358 LLVM_DEBUG(dbgs() << " Total loop cost: " << LoopCost << "\n"); in findBestNonTrivialUnswitchCandidate()3381 return LoopCost; in findBestNonTrivialUnswitchCandidate()3422 assert(Cost <= LoopCost && in findBestNonTrivialUnswitchCandidate()3435 return (LoopCost - Cost) * (SuccessorsCount - 1); in findBestNonTrivialUnswitchCandidate()
1422 unsigned LoopCost = 1; in RateRegister() local1434 LoopCost = 0; in RateRegister()1440 LoopCost = 0; in RateRegister()1441 C.AddRecCost += LoopCost; in RateRegister()
964 InstructionCost LoopCost);4594 InstructionCost LoopCost) { in selectInterleaveCount() argument4633 if (LoopCost == 0) { in selectInterleaveCount()4634 LoopCost = expectedCost(VF); in selectInterleaveCount()4635 assert(LoopCost.isValid() && "Expected to have chosen a VF with valid cost"); in selectInterleaveCount()4638 if (LoopCost == 0) in selectInterleaveCount()4787 LLVM_DEBUG(dbgs() << "LV: Loop cost is " << LoopCost << '\n' in selectInterleaveCount()4793 !ScalarInterleavingRequiresPredication && LoopCost < SmallLoopCost) { in selectInterleaveCount()4798 SmallLoopCost / LoopCost.getValue())); in selectInterleaveCount()
4715 InstructionCost LoopCost = 0; in isLoopSizeWithinBudget() local4727 LoopCost += Cost; in isLoopSizeWithinBudget()4728 if (LoopCost > Budget) in isLoopSizeWithinBudget()4734 *FinalSize = LoopCost.getValue(); in isLoopSizeWithinBudget()