Searched refs:LoopCosts (Results 1 – 3 of 3) sorted by relevance
216 auto IT = llvm::find_if(LoopCosts, [&L](const LoopCacheCostTy &LCC) { in getLoopCost() 219 return (IT != LoopCosts.end()) ? (*IT).second : -1; in getLoopCost() 223 ArrayRef<LoopCacheCostTy> getLoopCosts() const { return LoopCosts; } in getLoopCosts() 253 /// Sort the LoopCosts vector by decreasing cache cost.255 stable_sort(LoopCosts, in sortLoopCosts() 269 SmallVector<LoopCacheCostTy, 3> LoopCosts; variable
555 for (const auto &LC : CC.LoopCosts) { in operator <<()608 LoopCosts, in calculateCacheFootprint()612 LoopCosts.push_back(std::make_pair(L, LoopCost)); in calculateCacheFootprint()
468 const auto &LoopCosts = CC->getLoopCosts(); in processLoopList() local469 for (unsigned i = 0; i < LoopCosts.size(); i++) { in processLoopList()470 CostMap[LoopCosts[i].first] = i; in processLoopList()