Home
last modified time | relevance | path

Searched refs:InstCostMap (Results 1 – 2 of 2) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DSelectOptimize.cpp190 bool IsTrue, const DenseMap<const Instruction *, CostInfo> &InstCostMap, in getOpCostOnBranch() argument
195 auto It = InstCostMap.find(IV); in getOpCostOnBranch()
196 return It != InstCostMap.end() ? It->second.NonPredCost in getOpCostOnBranch()
211 auto It = InstCostMap.find(OpI); in getOpCostOnBranch()
212 if (It != InstCostMap.end()) in getOpCostOnBranch()
279 DenseMap<const Instruction *, CostInfo> &InstCostMap,
967 DenseMap<const Instruction *, CostInfo> InstCostMap; in findProfitableSIGroupsInnerLoops() local
970 if (!computeLoopCosts(L, SIGroups, InstCostMap, LoopCost) || in findProfitableSIGroupsInnerLoops()
980 const auto &ICM = InstCostMap[SI.getI()]; in findProfitableSIGroupsInnerLoops()
1281 DenseMap<const Instruction *, CostInfo> &InstCostMap, CostInfo *LoopCost) { in computeLoopCosts() argument
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopUnrollPass.cpp397 DenseSet<UnrolledInstState, UnrolledInstStateKeyInfo> InstCostMap; in analyzeLoopUnrollCost() local
422 auto CostIter = InstCostMap.find({I, Iteration, 0, 0}); in analyzeLoopUnrollCost()
423 if (CostIter == InstCostMap.end()) in analyzeLoopUnrollCost()
564 bool Inserted = InstCostMap.insert({&I, (int)Iteration, in analyzeLoopUnrollCost()