Searched refs:LoopCost (Results 1 – 4 of 4) sorted by relevance
532 CacheCostTy LoopCost = computeLoopCacheCost(*L, RefGroups); in calculateCacheFootprint() local533 LoopCosts.push_back(std::make_pair(L, LoopCost)); in calculateCacheFootprint()633 CacheCostTy LoopCost = 0; in computeLoopCacheCost() local636 LoopCost += RefGroupCost * TripCountsProduct; in computeLoopCacheCost()640 << "' has cost=" << LoopCost << "\n"); in computeLoopCacheCost()642 return LoopCost; in computeLoopCacheCost()
2725 InstructionCost LoopCost = 0; in unswitchBestCondition() local2741 LoopCost += Cost; in unswitchBestCondition()2742 assert(LoopCost >= 0 && "Must not have negative loop costs!"); in unswitchBestCondition()2745 LLVM_DEBUG(dbgs() << " Total loop cost: " << LoopCost << "\n"); in unswitchBestCondition()2802 assert(Cost <= LoopCost && in unswitchBestCondition()2815 return (LoopCost - Cost) * (SuccessorsCount - 1); in unswitchBestCondition()
1263 unsigned LoopCost = 1; in RateRegister() local1272 LoopCost = 0; in RateRegister()1279 LoopCost = 0; in RateRegister()1283 C.AddRecCost += LoopCost; in RateRegister()
1267 unsigned selectInterleaveCount(ElementCount VF, unsigned LoopCost);6280 unsigned LoopCost) { in selectInterleaveCount() argument6406 if (LoopCost == 0) { in selectInterleaveCount()6408 LoopCost = *expectedCost(VF).first.getValue(); in selectInterleaveCount()6411 assert(LoopCost && "Non-zero loop cost expected"); in selectInterleaveCount()6427 LLVM_DEBUG(dbgs() << "LV: Loop cost is " << LoopCost << '\n' in selectInterleaveCount()6432 if (!InterleavingRequiresRuntimePointerCheck && LoopCost < SmallLoopCost) { in selectInterleaveCount()6437 std::min(IC, (unsigned)PowerOf2Floor(SmallLoopCost / LoopCost)); in selectInterleaveCount()