244     Scaled64 getTrueOpCost(DenseMap<const Instruction *, CostInfo> &InstCostMap,  in getTrueOpCost()  argument
248           return InstCostMap.contains(I) ? InstCostMap[I].NonPredCost  in getTrueOpCost()
254           if (InstCostMap.contains(I)) {  in getTrueOpCost()
260             return InstCostMap[I].NonPredCost +  in getTrueOpCost()
270     getFalseOpCost(DenseMap<const Instruction *, CostInfo> &InstCostMap,  in getFalseOpCost()  argument
274           return InstCostMap.contains(I) ? InstCostMap[I].NonPredCost  in getFalseOpCost()
280           if (InstCostMap.contains(I))  in getFalseOpCost()
281             return InstCostMap[I].NonPredCost;  in getFalseOpCost()
343                         DenseMap<const Instruction *, CostInfo> &InstCostMap,
865   DenseMap<const Instruction *, CostInfo> InstCostMap;  in findProfitableSIGroupsInnerLoops()  local
868   if (!computeLoopCosts(L, SIGroups, InstCostMap, LoopCost) ||  in findProfitableSIGroupsInnerLoops()
878       SelectCost = std::max(SelectCost, InstCostMap[SI.getI()].PredCost);  in findProfitableSIGroupsInnerLoops()
879       BranchCost = std::max(BranchCost, InstCostMap[SI.getI()].NonPredCost);  in findProfitableSIGroupsInnerLoops()
1165     DenseMap<const Instruction *, CostInfo> &InstCostMap, CostInfo *LoopCost) {  in computeLoopCosts()  argument
1190           if (InstCostMap.count(UI)) {  in computeLoopCosts()
1191             IPredCost = std::max(IPredCost, InstCostMap[UI].PredCost);  in computeLoopCosts()
1192             INonPredCost = std::max(INonPredCost, InstCostMap[UI].NonPredCost);  in computeLoopCosts()
1215           Scaled64 TrueOpCost = SI.getTrueOpCost(InstCostMap, TTI);  in computeLoopCosts()
1216           Scaled64 FalseOpCost = SI.getFalseOpCost(InstCostMap, TTI);  in computeLoopCosts()
1222             if (InstCostMap.count(CI))  in computeLoopCosts()
1223               CondCost = InstCostMap[CI].NonPredCost;  in computeLoopCosts()
1231         InstCostMap[&I] = {IPredCost, INonPredCost};  in computeLoopCosts()