Home
last modified time | relevance | path

Searched refs:LoopCost (Results 1 – 5 of 5) sorted by relevance

/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DSelectOptimize.cpp196 CostInfo *LoopCost);
571 CostInfo LoopCost[2] = {{Scaled64::getZero(), Scaled64::getZero()}, in findProfitableSIGroupsInnerLoops() local
573 if (!computeLoopCosts(L, SIGroups, InstCostMap, LoopCost) || in findProfitableSIGroupsInnerLoops()
574 !checkLoopHeuristics(L, LoopCost)) { in findProfitableSIGroupsInnerLoops()
766 const CostInfo LoopCost[2]) { in checkLoopHeuristics()
776 if (LoopCost[0].NonPredCost > LoopCost[0].PredCost || in checkLoopHeuristics()
777 LoopCost[1].NonPredCost >= LoopCost[1].PredCost) { in checkLoopHeuristics()
784 Scaled64 Gain[2] = {LoopCost[0].PredCost - LoopCost[0].NonPredCost, in checkLoopHeuristics()
785 LoopCost[1].PredCost - LoopCost[1].NonPredCost}; in checkLoopHeuristics()
808 (LoopCost[1].PredCost - LoopCost[0].PredCost); in checkLoopHeuristics()
[all …]
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DLoopCacheAnalysis.cpp607 CacheCostTy LoopCost = computeLoopCacheCost(*L, RefGroups); in calculateCacheFootprint() local
608 LoopCosts.push_back(std::make_pair(L, LoopCost)); in calculateCacheFootprint()
708 CacheCostTy LoopCost = 0; in computeLoopCacheCost() local
711 LoopCost += RefGroupCost * TripCountsProduct; in computeLoopCacheCost()
715 << "' has cost=" << LoopCost << "\n"); in computeLoopCacheCost()
717 return LoopCost; in computeLoopCacheCost()
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DSimpleLoopUnswitch.cpp2866 InstructionCost LoopCost = 0; in unswitchBestCondition() local
2882 LoopCost += Cost; in unswitchBestCondition()
2883 assert(LoopCost >= 0 && "Must not have negative loop costs!"); in unswitchBestCondition()
2886 LLVM_DEBUG(dbgs() << " Total loop cost: " << LoopCost << "\n"); in unswitchBestCondition()
2946 assert(Cost <= LoopCost && in unswitchBestCondition()
2959 return (LoopCost - Cost) * (SuccessorsCount - 1); in unswitchBestCondition()
H A DLoopStrengthReduce.cpp1292 unsigned LoopCost = 1; in RateRegister() local
1301 LoopCost = 0; in RateRegister()
1308 LoopCost = 0; in RateRegister()
1312 C.AddRecCost += LoopCost; in RateRegister()
/llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp1185 unsigned selectInterleaveCount(ElementCount VF, unsigned LoopCost);
5609 unsigned LoopCost) { in selectInterleaveCount() argument
5644 if (LoopCost == 0) { in selectInterleaveCount()
5647 LoopCost = *C.getValue(); in selectInterleaveCount()
5650 if (LoopCost == 0) in selectInterleaveCount()
5765 LLVM_DEBUG(dbgs() << "LV: Loop cost is " << LoopCost << '\n' in selectInterleaveCount()
5771 !ScalarInterleavingRequiresPredication && LoopCost < SmallLoopCost) { in selectInterleaveCount()
5776 std::min(IC, (unsigned)PowerOf2Floor(SmallLoopCost / LoopCost)); in selectInterleaveCount()