124     Scaled64 NonPredCost;  member
221           return InstCostMap.contains(I) ? InstCostMap[I].NonPredCost  in getTrueOpCost()
233             return InstCostMap[I].NonPredCost +  in getTrueOpCost()
247           return InstCostMap.contains(I) ? InstCostMap[I].NonPredCost  in getFalseOpCost()
254             return InstCostMap[I].NonPredCost;  in getFalseOpCost()
826       BranchCost = std::max(BranchCost, InstCostMap[SI.getI()].NonPredCost);  in findProfitableSIGroupsInnerLoops()
1052   if (LoopCost[0].NonPredCost > LoopCost[0].PredCost ||  in checkLoopHeuristics()
1053       LoopCost[1].NonPredCost >= LoopCost[1].PredCost) {  in checkLoopHeuristics()
1060   Scaled64 Gain[2] = {LoopCost[0].PredCost - LoopCost[0].NonPredCost,  in checkLoopHeuristics()
1061                       LoopCost[1].PredCost - LoopCost[1].NonPredCost};  in checkLoopHeuristics()
1139             INonPredCost = std::max(INonPredCost, InstCostMap[UI].NonPredCost);  in computeLoopCosts()
1170               CondCost = InstCostMap[CI].NonPredCost;  in computeLoopCosts()
1180         MaxCost.NonPredCost = std::max(MaxCost.NonPredCost, INonPredCost);  in computeLoopCosts()
1185                       << MaxCost.NonPredCost << "\n");  in computeLoopCosts()