317                         CostInfo *LoopCost);
813   CostInfo LoopCost[2] = {{Scaled64::getZero(), Scaled64::getZero()},  in findProfitableSIGroupsInnerLoops()  local
815   if (!computeLoopCosts(L, SIGroups, InstCostMap, LoopCost) ||  in findProfitableSIGroupsInnerLoops()
816       !checkLoopHeuristics(L, LoopCost)) {  in findProfitableSIGroupsInnerLoops()
1042                                              const CostInfo LoopCost[2]) {  in checkLoopHeuristics()
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()
1067       Gain[1] * Scaled64::get(GainRelativeThreshold) < LoopCost[1].PredCost) {  in checkLoopHeuristics()
1068     Scaled64 RelativeGain = Scaled64::get(100) * Gain[1] / LoopCost[1].PredCost;  in checkLoopHeuristics()
1084                             (LoopCost[1].PredCost - LoopCost[0].PredCost);  in checkLoopHeuristics()
1112     DenseMap<const Instruction *, CostInfo> &InstCostMap, CostInfo *LoopCost) {  in computeLoopCosts()  argument
1121     CostInfo &MaxCost = LoopCost[Iter];  in computeLoopCosts()