Searched refs:LoopCosts (Results 1 - 3 of 3) sorted by relevance

/openbsd-current/gnu/llvm/llvm/include/llvm/Analysis/
H A DLoopCacheAnalysis.h216 auto IT = llvm::find_if(LoopCosts, [&L](const LoopCacheCostTy &LCC) {
219 return (IT != LoopCosts.end()) ? (*IT).second : -1;
223 ArrayRef<LoopCacheCostTy> getLoopCosts() const { return LoopCosts; }
253 /// Sort the LoopCosts vector by decreasing cache cost.
255 stable_sort(LoopCosts,
269 SmallVector<LoopCacheCostTy, 3> LoopCosts;
/openbsd-current/gnu/llvm/llvm/lib/Analysis/
H A DLoopCacheAnalysis.cpp550 for (const auto &LC : CC.LoopCosts) {
603 LoopCosts,
607 LoopCosts.push_back(std::make_pair(L, LoopCost));
/openbsd-current/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DLoopInterchange.cpp473 const auto &LoopCosts = CC->getLoopCosts(); local
474 for (unsigned i = 0; i < LoopCosts.size(); i++) {
475 CostMap[LoopCosts[i].first] = i;

Completed in 182 milliseconds