Lines Matching refs:BPI
239 BranchProbabilityInfo *BPI;
276 // within the loop. We identify such unprofitable loops through BPI.
297 LoopPredication(ScalarEvolution *SE, BranchProbabilityInfo *BPI)
298 : SE(SE), BPI(BPI){};
318 BranchProbabilityInfo &BPI =
320 LoopPredication LP(SE, &BPI);
345 auto *BPI = FAM.getCachedResult<BranchProbabilityAnalysis>(*F);
346 LoopPredication LP(&AR.SE, BPI);
725 if (SkipProfitabilityChecks || !BPI)
748 BPI->getEdgeProbability(LatchBlock, LatchBrExitIdx);
766 BPI->getEdgeProbability(ExitEdge.first, ExitEdge.second);
772 // Using BPI, we have concluded that the most probable way to exit from the
