Searched refs:LoopCost (Results 1 - 4 of 4) sorted by relevance

/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DLoopCacheAnalysis.cpp529 CacheCostTy LoopCost = computeLoopCacheCost(*L, RefGroups);
530 LoopCosts.push_back(std::make_pair(L, LoopCost));
630 CacheCostTy LoopCost = 0;
633 LoopCost += RefGroupCost * TripCountsProduct;
637 << "' has cost=" << LoopCost << "\n");
639 return LoopCost;
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSimpleLoopUnswitch.cpp2672 int LoopCost = 0; local
2688 LoopCost += Cost;
2689 assert(LoopCost >= 0 && "Must not have negative loop costs!");
2692 LLVM_DEBUG(dbgs() << " Total loop cost: " << LoopCost << "\n");
2715 int Cost = LoopCost;
H A DLoopStrengthReduce.cpp1250 unsigned LoopCost = 1; local
1259 LoopCost = 0;
1268 LoopCost = 0;
1272 C.AddRecCost += LoopCost;
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp1007 /// Otherwise, the interleave count is computed and returned. VF and LoopCost
1009 unsigned selectInterleaveCount(unsigned VF, unsigned LoopCost);
5244 unsigned LoopCost) {
5340 if (LoopCost == 0)
5341 LoopCost = expectedCost(VF).first;
5343 assert(LoopCost && "Non-zero loop cost expected");
5366 LLVM_DEBUG(dbgs() << "LV: Loop cost is " << LoopCost << '\n');
5367 if (!InterleavingRequiresRuntimePointerCheck && LoopCost < SmallLoopCost) {
5372 std::min(IC, (unsigned)PowerOf2Floor(SmallLoopCost / LoopCost));

Completed in 193 milliseconds