Searched refs:DTCostMap (Results 1 – 1 of 1) sorted by relevance
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | SimpleLoopUnswitch.cpp | 2664 SmallDenseMap<DomTreeNode *, InstructionCost, 4> &DTCostMap) { in computeDomSubtreeCost()
2672 auto DTCostIt = DTCostMap.find(&N); in computeDomSubtreeCost()
2673 if (DTCostIt != DTCostMap.end()) in computeDomSubtreeCost()
2681 return Sum + computeDomSubtreeCost(*ChildN, BBCostMap, DTCostMap); in computeDomSubtreeCost()
2683 bool Inserted = DTCostMap.insert({&N, Cost}).second; in computeDomSubtreeCost()
3367 SmallDenseMap<DomTreeNode *, InstructionCost, 4> DTCostMap; in findBestNonTrivialUnswitchCandidate()
3414 Cost += computeDomSubtreeCost(*DT[SuccBB], BBCostMap, DTCostMap); in findBestNonTrivialUnswitchCandidate()
2663 computeDomSubtreeCost(DomTreeNode & N,const SmallDenseMap<BasicBlock *,InstructionCost,4> & BBCostMap,SmallDenseMap<DomTreeNode *,InstructionCost,4> & DTCostMap) computeDomSubtreeCost() argument
3366 SmallDenseMap<DomTreeNode *, InstructionCost, 4> DTCostMap; findBestNonTrivialUnswitchCandidate() local
|