Home
last modified time | relevance | path

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

/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DSelectOptimize.cpp196 CostInfo *LoopCost);
596 CostInfo LoopCost[2] = {{Scaled64::getZero(), Scaled64::getZero()}, in findProfitableSIGroupsInnerLoops() local
598 if (!computeLoopCosts(L, SIGroups, InstCostMap, LoopCost) || in findProfitableSIGroupsInnerLoops()
599 !checkLoopHeuristics(L, LoopCost)) { in findProfitableSIGroupsInnerLoops()
815 const CostInfo LoopCost[2]) { in checkLoopHeuristics()
825 if (LoopCost[0].NonPredCost > LoopCost[0].PredCost || in checkLoopHeuristics()
826 LoopCost[1].NonPredCost >= LoopCost[1].PredCost) { in checkLoopHeuristics()
833 Scaled64 Gain[2] = {LoopCost[0].PredCost - LoopCost[0].NonPredCost, in checkLoopHeuristics()
834 LoopCost[1].PredCost - LoopCost[1].NonPredCost}; in checkLoopHeuristics()
840 Gain[1] * Scaled64::get(GainRelativeThreshold) < LoopCost[1].PredCost) { in checkLoopHeuristics()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Analysis/
H A DLoopCacheAnalysis.cpp606 CacheCostTy LoopCost = computeLoopCacheCost(*L, RefGroups); in calculateCacheFootprint() local
607 LoopCosts.push_back(std::make_pair(L, LoopCost)); in calculateCacheFootprint()
707 CacheCostTy LoopCost = 0; in computeLoopCacheCost() local
710 LoopCost += RefGroupCost * TripCountsProduct; in computeLoopCacheCost()
714 << "' has cost=" << LoopCost << "\n"); in computeLoopCacheCost()
716 return LoopCost; in computeLoopCacheCost()
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DSimpleLoopUnswitch.cpp2912 InstructionCost LoopCost = 0; in findBestNonTrivialUnswitchCandidate() local
2921 LoopCost += Cost; in findBestNonTrivialUnswitchCandidate()
2922 assert(LoopCost >= 0 && "Must not have negative loop costs!"); in findBestNonTrivialUnswitchCandidate()
2925 LLVM_DEBUG(dbgs() << " Total loop cost: " << LoopCost << "\n"); in findBestNonTrivialUnswitchCandidate()
2985 assert(Cost <= LoopCost && in findBestNonTrivialUnswitchCandidate()
2998 return (LoopCost - Cost) * (SuccessorsCount - 1); in findBestNonTrivialUnswitchCandidate()
H A DLoopStrengthReduce.cpp1305 unsigned LoopCost = 1; in RateRegister() local
1314 LoopCost = 0; in RateRegister()
1321 LoopCost = 0; in RateRegister()
1325 C.AddRecCost += LoopCost; in RateRegister()
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp1215 unsigned selectInterleaveCount(ElementCount VF, InstructionCost LoopCost);
5672 InstructionCost LoopCost) { in selectInterleaveCount() argument
5707 if (LoopCost == 0) { in selectInterleaveCount()
5708 LoopCost = expectedCost(VF).first; in selectInterleaveCount()
5709 assert(LoopCost.isValid() && "Expected to have chosen a VF with valid cost"); in selectInterleaveCount()
5712 if (LoopCost == 0) in selectInterleaveCount()
5827 LLVM_DEBUG(dbgs() << "LV: Loop cost is " << LoopCost << '\n' in selectInterleaveCount()
5833 !ScalarInterleavingRequiresPredication && LoopCost < SmallLoopCost) { in selectInterleaveCount()
5838 IC, (unsigned)PowerOf2Floor(SmallLoopCost / *LoopCost.getValue())); in selectInterleaveCount()