Searched refs:BBCostMap (Results 1 – 1 of 1) sorted by relevance
2643 const SmallDenseMap<BasicBlock *, InstructionCost, 4> &BBCostMap, in computeDomSubtreeCost() argument2647 auto BBCostIt = BBCostMap.find(N.getBlock()); in computeDomSubtreeCost()2648 if (BBCostIt == BBCostMap.end()) in computeDomSubtreeCost()2661 return Sum + computeDomSubtreeCost(*ChildN, BBCostMap, DTCostMap); in computeDomSubtreeCost()3305 SmallDenseMap<BasicBlock *, InstructionCost, 4> BBCostMap; in findBestNonTrivialUnswitchCandidate() local3327 BBCostMap[BB] = Cost; in findBestNonTrivialUnswitchCandidate()3392 Cost += computeDomSubtreeCost(*DT[SuccBB], BBCostMap, DTCostMap); in findBestNonTrivialUnswitchCandidate()