Searched refs:LoopCost (Results 1 – 4 of 4) sorted by relevance
530 CacheCostTy LoopCost = computeLoopCacheCost(*L, RefGroups); in calculateCacheFootprint() local531 LoopCosts.push_back(std::make_pair(L, LoopCost)); in calculateCacheFootprint()631 CacheCostTy LoopCost = 0; in computeLoopCacheCost() local634 LoopCost += RefGroupCost * TripCountsProduct; in computeLoopCacheCost()638 << "' has cost=" << LoopCost << "\n"); in computeLoopCacheCost()640 return LoopCost; in computeLoopCacheCost()
2820 InstructionCost LoopCost = 0; in unswitchBestCondition() local2836 LoopCost += Cost; in unswitchBestCondition()2837 assert(LoopCost >= 0 && "Must not have negative loop costs!"); in unswitchBestCondition()2840 LLVM_DEBUG(dbgs() << " Total loop cost: " << LoopCost << "\n"); in unswitchBestCondition()2899 assert(Cost <= LoopCost && in unswitchBestCondition()2912 return (LoopCost - Cost) * (SuccessorsCount - 1); in unswitchBestCondition()
1289 unsigned LoopCost = 1; in RateRegister() local1298 LoopCost = 0; in RateRegister()1305 LoopCost = 0; in RateRegister()1309 C.AddRecCost += LoopCost; in RateRegister()
1280 unsigned selectInterleaveCount(ElementCount VF, unsigned LoopCost);6322 unsigned LoopCost) { in selectInterleaveCount() argument6448 if (LoopCost == 0) { in selectInterleaveCount()6451 LoopCost = *C.getValue(); in selectInterleaveCount()6454 assert(LoopCost && "Non-zero loop cost expected"); in selectInterleaveCount()6470 LLVM_DEBUG(dbgs() << "LV: Loop cost is " << LoopCost << '\n' in selectInterleaveCount()6475 if (!InterleavingRequiresRuntimePointerCheck && LoopCost < SmallLoopCost) { in selectInterleaveCount()6480 std::min(IC, (unsigned)PowerOf2Floor(SmallLoopCost / LoopCost)); in selectInterleaveCount()