217     Scaled64 getTrueOpCost(DenseMap<const Instruction *, CostInfo> &InstCostMap,  in getTrueOpCost()  argument
221           return InstCostMap.contains(I) ? InstCostMap[I].NonPredCost  in getTrueOpCost()
227           if (InstCostMap.contains(I)) {  in getTrueOpCost()
233             return InstCostMap[I].NonPredCost +  in getTrueOpCost()
243     getFalseOpCost(DenseMap<const Instruction *, CostInfo> &InstCostMap,  in getFalseOpCost()  argument
247           return InstCostMap.contains(I) ? InstCostMap[I].NonPredCost  in getFalseOpCost()
253           if (InstCostMap.contains(I))  in getFalseOpCost()
254             return InstCostMap[I].NonPredCost;  in getFalseOpCost()
316                         DenseMap<const Instruction *, CostInfo> &InstCostMap,
812   DenseMap<const Instruction *, CostInfo> InstCostMap;  in findProfitableSIGroupsInnerLoops()  local
815   if (!computeLoopCosts(L, SIGroups, InstCostMap, LoopCost) ||  in findProfitableSIGroupsInnerLoops()
825       SelectCost = std::max(SelectCost, InstCostMap[SI.getI()].PredCost);  in findProfitableSIGroupsInnerLoops()
826       BranchCost = std::max(BranchCost, InstCostMap[SI.getI()].NonPredCost);  in findProfitableSIGroupsInnerLoops()
1112     DenseMap<const Instruction *, CostInfo> &InstCostMap, CostInfo *LoopCost) {  in computeLoopCosts()  argument
1137           if (InstCostMap.count(UI)) {  in computeLoopCosts()
1138             IPredCost = std::max(IPredCost, InstCostMap[UI].PredCost);  in computeLoopCosts()
1139             INonPredCost = std::max(INonPredCost, InstCostMap[UI].NonPredCost);  in computeLoopCosts()
1162           Scaled64 TrueOpCost = SI.getTrueOpCost(InstCostMap, TTI);  in computeLoopCosts()
1163           Scaled64 FalseOpCost = SI.getFalseOpCost(InstCostMap, TTI);  in computeLoopCosts()
1169             if (InstCostMap.count(CI))  in computeLoopCosts()
1170               CondCost = InstCostMap[CI].NonPredCost;  in computeLoopCosts()
1178         InstCostMap[&I] = {IPredCost, INonPredCost};  in computeLoopCosts()