Searched refs:CostMap (Results 1 – 2 of 2) sorted by relevance
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUSplitModule.cpp | 189 FunctionsCostMap &CostMap) { in calculateFunctionCosts() argument
218 CostMap[&Fn] = FnCost; in calculateFunctionCosts()
226 if (CostMap.empty()) in calculateFunctionCosts()
306 SplitGraph(const Module &M, const FunctionsCostMap &CostMap, in SplitGraph() argument
308 : M(M), CostMap(CostMap), ModuleCost(ModuleCost) {} in SplitGraph()
328 CostType getCost(const Function &F) const { return CostMap.at(&F); } in getCost()
344 const FunctionsCostMap &CostMap; member in llvm::__anon00e757230111::SplitGraph
732 Cost = CostMap.at(Fn); in getNode()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopInterchange.cpp | 433 DenseMap<const Loop *, unsigned> CostMap; member in __anon815ea8750411::CacheCostManager
461 const DenseMap<const Loop *, unsigned> &CostMap, CacheCost *CC);
1222 CostMap[Cost.first] = Idx; in computeIfUnitinialized()
1232 return CostMap; in getCostMap()
1290 const DenseMap<const Loop *, unsigned> &CostMap, CacheCost *CC) { in isProfitablePerLoopCacheAnalysis() argument
1294 auto InnerLoopIt = CostMap.find(InnerLoop); in isProfitablePerLoopCacheAnalysis()
1295 if (InnerLoopIt == CostMap.end()) in isProfitablePerLoopCacheAnalysis()
1297 auto OuterLoopIt = CostMap.find(OuterLoop); in isProfitablePerLoopCacheAnalysis()
1298 if (OuterLoopIt == CostMap.end()) in isProfitablePerLoopCacheAnalysis()
1373 const DenseMap<const Loop *, unsigned> &CostMap = CCM.getCostMap(); in isProfitable() local
[all …]
|