Searched refs:DTCostMap (Results 1 – 1 of 1) sorted by relevance
2644 SmallDenseMap<DomTreeNode *, InstructionCost, 4> &DTCostMap) { in computeDomSubtreeCost() argument2652 auto DTCostIt = DTCostMap.find(&N); in computeDomSubtreeCost()2653 if (DTCostIt != DTCostMap.end()) in computeDomSubtreeCost()2661 return Sum + computeDomSubtreeCost(*ChildN, BBCostMap, DTCostMap); in computeDomSubtreeCost()2663 bool Inserted = DTCostMap.insert({&N, Cost}).second; in computeDomSubtreeCost()3345 SmallDenseMap<DomTreeNode *, InstructionCost, 4> DTCostMap; in findBestNonTrivialUnswitchCandidate() local3392 Cost += computeDomSubtreeCost(*DT[SuccBB], BBCostMap, DTCostMap); in findBestNonTrivialUnswitchCandidate()