Searched refs:LoopCost (Results 1 – 5 of 5) sorted by relevance
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | SelectOptimize.cpp | 344 CostInfo *LoopCost);
866 CostInfo LoopCost[2] = {{Scaled64::getZero(), Scaled64::getZero()}, in findProfitableSIGroupsInnerLoops() local
868 if (!computeLoopCosts(L, SIGroups, InstCostMap, LoopCost) || in findProfitableSIGroupsInnerLoops()
869 !checkLoopHeuristics(L, LoopCost)) { in findProfitableSIGroupsInnerLoops()
1095 const CostInfo LoopCost[2]) { in checkLoopHeuristics()
1105 if (LoopCost[0].NonPredCost > LoopCost[0].PredCost || in checkLoopHeuristics()
1106 LoopCost[1].NonPredCost >= LoopCost[1].PredCost) { in checkLoopHeuristics()
1113 Scaled64 Gain[2] = {LoopCost[0].PredCost - LoopCost[0].NonPredCost, in checkLoopHeuristics()
1114 LoopCost[1].PredCost - LoopCost[1].NonPredCost}; in checkLoopHeuristics()
1120 Gain[1] * Scaled64::get(GainRelativeThreshold) < LoopCost[1].PredCost) { in checkLoopHeuristics()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | LoopCacheAnalysis.cpp | 611 CacheCostTy LoopCost = computeLoopCacheCost(*L, RefGroups); in calculateCacheFootprint() local
612 LoopCosts.push_back(std::make_pair(L, LoopCost)); in calculateCacheFootprint()
712 CacheCostTy LoopCost = 0; in computeLoopCacheCost() local
715 LoopCost += RefGroupCost * TripCountsProduct; in computeLoopCacheCost()
719 << "' has cost=" << LoopCost << "\n"); in computeLoopCacheCost()
721 return LoopCost; in computeLoopCacheCost()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | SimpleLoopUnswitch.cpp | 3338 InstructionCost LoopCost = 0; in findBestNonTrivialUnswitchCandidate()
3347 LoopCost += Cost; in findBestNonTrivialUnswitchCandidate()
3348 assert(LoopCost >= 0 && "Must not have negative loop costs!"); in findBestNonTrivialUnswitchCandidate()
3351 LLVM_DEBUG(dbgs() << " Total loop cost: " << LoopCost << "\n"); in findBestNonTrivialUnswitchCandidate()
3374 return LoopCost; in findBestNonTrivialUnswitchCandidate()
3415 assert(Cost <= LoopCost && in findBestNonTrivialUnswitchCandidate()
3428 return (LoopCost - Cost) * (SuccessorsCount - 1); in findBestNonTrivialUnswitchCandidate()
3337 InstructionCost LoopCost = 0; findBestNonTrivialUnswitchCandidate() local
|
| H A D | LoopStrengthReduce.cpp | 1441 unsigned LoopCost = 1; in RateRegister() local
1450 LoopCost = 0; in RateRegister()
1457 LoopCost = 0; in RateRegister()
1461 C.AddRecCost += LoopCost; in RateRegister()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | LoopVectorize.cpp | 1055 unsigned selectInterleaveCount(ElementCount VF, InstructionCost LoopCost);
4827 InstructionCost LoopCost) { in selectInterleaveCount() argument
4861 if (LoopCost == 0) { in selectInterleaveCount()
4862 LoopCost = expectedCost(VF); in selectInterleaveCount()
4863 assert(LoopCost.isValid() && "Expected to have chosen a VF with valid cost"); in selectInterleaveCount()
4866 if (LoopCost == 0) in selectInterleaveCount()
5017 LLVM_DEBUG(dbgs() << "LV: Loop cost is " << LoopCost << '\n' in selectInterleaveCount()
5023 !ScalarInterleavingRequiresPredication && LoopCost < SmallLoopCost) { in selectInterleaveCount()
5028 SmallLoopCost / *LoopCost.getValue())); in selectInterleaveCount()
|