Searched refs:BBCostMap (Results 1 – 1 of 1) sorted by relevance
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | SimpleLoopUnswitch.cpp | 2663 const SmallDenseMap<BasicBlock *, InstructionCost, 4> &BBCostMap, in computeDomSubtreeCost()
2667 auto BBCostIt = BBCostMap.find(N.getBlock()); in computeDomSubtreeCost()
2668 if (BBCostIt == BBCostMap.end()) in computeDomSubtreeCost()
2681 return Sum + computeDomSubtreeCost(*ChildN, BBCostMap, DTCostMap); in computeDomSubtreeCost()
3327 SmallDenseMap<BasicBlock *, InstructionCost, 4> BBCostMap; in findBestNonTrivialUnswitchCandidate()
3349 BBCostMap[BB] = Cost; in findBestNonTrivialUnswitchCandidate()
3414 Cost += computeDomSubtreeCost(*DT[SuccBB], BBCostMap, DTCostMap); in findBestNonTrivialUnswitchCandidate()
2662 computeDomSubtreeCost(DomTreeNode & N,const SmallDenseMap<BasicBlock *,InstructionCost,4> & BBCostMap,SmallDenseMap<DomTreeNode *,InstructionCost,4> & DTCostMap) computeDomSubtreeCost() argument
3326 SmallDenseMap<BasicBlock *, InstructionCost, 4> BBCostMap; findBestNonTrivialUnswitchCandidate() local
|