1 //===-- BranchProbabilityInfo.cpp - Branch Probability Analysis -----------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // Loops should be simplified before this analysis.
12 //===----------------------------------------------------------------------===//
14 #include "llvm/Analysis/BranchProbabilityInfo.h"
15 #include "llvm/ADT/PostOrderIterator.h"
16 #include "llvm/Analysis/LoopInfo.h"
17 #include "llvm/IR/CFG.h"
18 #include "llvm/IR/Constants.h"
19 #include "llvm/IR/Function.h"
20 #include "llvm/IR/Instructions.h"
21 #include "llvm/IR/LLVMContext.h"
22 #include "llvm/IR/Metadata.h"
23 #include "llvm/Support/Debug.h"
24 #include "llvm/Support/raw_ostream.h"
28 #define DEBUG_TYPE "branch-prob"
30 INITIALIZE_PASS_BEGIN(BranchProbabilityInfoWrapperPass, "branch-prob",
31 "Branch Probability Analysis", false, true)
32 INITIALIZE_PASS_DEPENDENCY(LoopInfoWrapperPass)
33 INITIALIZE_PASS_END(BranchProbabilityInfoWrapperPass, "branch-prob",
34 "Branch Probability Analysis", false, true)
36 char BranchProbabilityInfoWrapperPass::ID = 0;
38 // Weights are for internal use only. They are used by heuristics to help to
39 // estimate edges' probability. Example:
41 // Using "Loop Branch Heuristics" we predict weights of edges for the
56 // Probability of the edge BB2->BB1 = 124 / (124 + 4) = 0.96875
57 // Probability of the edge BB2->BB3 = 4 / (124 + 4) = 0.03125
58 static const uint32_t LBH_TAKEN_WEIGHT = 124;
59 static const uint32_t LBH_NONTAKEN_WEIGHT = 4;
61 /// \brief Unreachable-terminating branch taken weight.
63 /// This is the weight for a branch being taken to a block that terminates
64 /// (eventually) in unreachable. These are predicted as unlikely as possible.
65 static const uint32_t UR_TAKEN_WEIGHT = 1;
67 /// \brief Unreachable-terminating branch not-taken weight.
69 /// This is the weight for a branch not being taken toward a block that
70 /// terminates (eventually) in unreachable. Such a branch is essentially never
71 /// taken. Set the weight to an absurdly high value so that nested loops don't
72 /// easily subsume it.
73 static const uint32_t UR_NONTAKEN_WEIGHT = 1024*1024 - 1;
75 /// \brief Weight for a branch taken going into a cold block.
77 /// This is the weight for a branch taken toward a block marked
78 /// cold. A block is marked cold if it's postdominated by a
79 /// block containing a call to a cold function. Cold functions
80 /// are those marked with attribute 'cold'.
81 static const uint32_t CC_TAKEN_WEIGHT = 4;
83 /// \brief Weight for a branch not-taken into a cold block.
85 /// This is the weight for a branch not taken toward a block marked
87 static const uint32_t CC_NONTAKEN_WEIGHT = 64;
89 static const uint32_t PH_TAKEN_WEIGHT = 20;
90 static const uint32_t PH_NONTAKEN_WEIGHT = 12;
92 static const uint32_t ZH_TAKEN_WEIGHT = 20;
93 static const uint32_t ZH_NONTAKEN_WEIGHT = 12;
95 static const uint32_t FPH_TAKEN_WEIGHT = 20;
96 static const uint32_t FPH_NONTAKEN_WEIGHT = 12;
98 /// \brief Invoke-terminating normal branch taken weight
100 /// This is the weight for branching to the normal destination of an invoke
101 /// instruction. We expect this to happen most of the time. Set the weight to an
102 /// absurdly high value so that nested loops subsume it.
103 static const uint32_t IH_TAKEN_WEIGHT = 1024 * 1024 - 1;
105 /// \brief Invoke-terminating normal branch not-taken weight.
107 /// This is the weight for branching to the unwind destination of an invoke
108 /// instruction. This is essentially never taken.
109 static const uint32_t IH_NONTAKEN_WEIGHT = 1;
111 // Standard weight value. Used when none of the heuristics set weight for
113 static const uint32_t NORMAL_WEIGHT = 16;
115 // Minimum weight of an edge. Please note, that weight is NEVER 0.
116 static const uint32_t MIN_WEIGHT = 1;
118 /// \brief Calculate edge weights for successors lead to unreachable.
120 /// Predict that a successor which leads necessarily to an
121 /// unreachable-terminated block as extremely unlikely.
122 bool BranchProbabilityInfo::calcUnreachableHeuristics(BasicBlock *BB) {
123 TerminatorInst *TI = BB->getTerminator();
124 if (TI->getNumSuccessors() == 0) {
125 if (isa<UnreachableInst>(TI))
126 PostDominatedByUnreachable.insert(BB);
130 SmallVector<unsigned, 4> UnreachableEdges;
131 SmallVector<unsigned, 4> ReachableEdges;
133 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) {
134 if (PostDominatedByUnreachable.count(*I))
135 UnreachableEdges.push_back(I.getSuccessorIndex());
137 ReachableEdges.push_back(I.getSuccessorIndex());
140 // If all successors are in the set of blocks post-dominated by unreachable,
141 // this block is too.
142 if (UnreachableEdges.size() == TI->getNumSuccessors())
143 PostDominatedByUnreachable.insert(BB);
145 // Skip probabilities if this block has a single successor or if all were
147 if (TI->getNumSuccessors() == 1 || UnreachableEdges.empty())
150 // If the terminator is an InvokeInst, check only the normal destination block
151 // as the unwind edge of InvokeInst is also very unlikely taken.
152 if (auto *II = dyn_cast<InvokeInst>(TI))
153 if (PostDominatedByUnreachable.count(II->getNormalDest())) {
154 PostDominatedByUnreachable.insert(BB);
155 // Return false here so that edge weights for InvokeInst could be decided
156 // in calcInvokeHeuristics().
160 uint32_t UnreachableWeight =
161 std::max(UR_TAKEN_WEIGHT / (unsigned)UnreachableEdges.size(), MIN_WEIGHT);
162 for (SmallVectorImpl<unsigned>::iterator I = UnreachableEdges.begin(),
163 E = UnreachableEdges.end();
165 setEdgeWeight(BB, *I, UnreachableWeight);
167 if (ReachableEdges.empty())
169 uint32_t ReachableWeight =
170 std::max(UR_NONTAKEN_WEIGHT / (unsigned)ReachableEdges.size(),
172 for (SmallVectorImpl<unsigned>::iterator I = ReachableEdges.begin(),
173 E = ReachableEdges.end();
175 setEdgeWeight(BB, *I, ReachableWeight);
180 // Propagate existing explicit probabilities from either profile data or
181 // 'expect' intrinsic processing.
182 bool BranchProbabilityInfo::calcMetadataWeights(BasicBlock *BB) {
183 TerminatorInst *TI = BB->getTerminator();
184 if (TI->getNumSuccessors() == 1)
186 if (!isa<BranchInst>(TI) && !isa<SwitchInst>(TI))
189 MDNode *WeightsNode = TI->getMetadata(LLVMContext::MD_prof);
193 // Check that the number of successors is manageable.
194 assert(TI->getNumSuccessors() < UINT32_MAX && "Too many successors");
196 // Ensure there are weights for all of the successors. Note that the first
197 // operand to the metadata node is a name, not a weight.
198 if (WeightsNode->getNumOperands() != TI->getNumSuccessors() + 1)
201 // Build up the final weights that will be used in a temporary buffer.
202 // Compute the sum of all weights to later decide whether they need to
203 // be scaled to fit in 32 bits.
204 uint64_t WeightSum = 0;
205 SmallVector<uint32_t, 2> Weights;
206 Weights.reserve(TI->getNumSuccessors());
207 for (unsigned i = 1, e = WeightsNode->getNumOperands(); i != e; ++i) {
208 ConstantInt *Weight =
209 mdconst::dyn_extract<ConstantInt>(WeightsNode->getOperand(i));
212 assert(Weight->getValue().getActiveBits() <= 32 &&
213 "Too many bits for uint32_t");
214 Weights.push_back(Weight->getZExtValue());
215 WeightSum += Weights.back();
217 assert(Weights.size() == TI->getNumSuccessors() && "Checked above");
219 // If the sum of weights does not fit in 32 bits, scale every weight down
221 uint64_t ScalingFactor =
222 (WeightSum > UINT32_MAX) ? WeightSum / UINT32_MAX + 1 : 1;
225 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) {
226 uint32_t W = Weights[i] / ScalingFactor;
228 setEdgeWeight(BB, i, W);
230 assert(WeightSum <= UINT32_MAX &&
231 "Expected weights to scale down to 32 bits");
236 /// \brief Calculate edge weights for edges leading to cold blocks.
238 /// A cold block is one post-dominated by a block with a call to a
239 /// cold function. Those edges are unlikely to be taken, so we give
240 /// them relatively low weight.
242 /// Return true if we could compute the weights for cold edges.
243 /// Return false, otherwise.
244 bool BranchProbabilityInfo::calcColdCallHeuristics(BasicBlock *BB) {
245 TerminatorInst *TI = BB->getTerminator();
246 if (TI->getNumSuccessors() == 0)
249 // Determine which successors are post-dominated by a cold block.
250 SmallVector<unsigned, 4> ColdEdges;
251 SmallVector<unsigned, 4> NormalEdges;
252 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I)
253 if (PostDominatedByColdCall.count(*I))
254 ColdEdges.push_back(I.getSuccessorIndex());
256 NormalEdges.push_back(I.getSuccessorIndex());
258 // If all successors are in the set of blocks post-dominated by cold calls,
259 // this block is in the set post-dominated by cold calls.
260 if (ColdEdges.size() == TI->getNumSuccessors())
261 PostDominatedByColdCall.insert(BB);
263 // Otherwise, if the block itself contains a cold function, add it to the
264 // set of blocks postdominated by a cold call.
265 assert(!PostDominatedByColdCall.count(BB));
266 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
267 if (CallInst *CI = dyn_cast<CallInst>(I))
268 if (CI->hasFnAttr(Attribute::Cold)) {
269 PostDominatedByColdCall.insert(BB);
274 // Skip probabilities if this block has a single successor.
275 if (TI->getNumSuccessors() == 1 || ColdEdges.empty())
278 uint32_t ColdWeight =
279 std::max(CC_TAKEN_WEIGHT / (unsigned) ColdEdges.size(), MIN_WEIGHT);
280 for (SmallVectorImpl<unsigned>::iterator I = ColdEdges.begin(),
283 setEdgeWeight(BB, *I, ColdWeight);
285 if (NormalEdges.empty())
287 uint32_t NormalWeight = std::max(
288 CC_NONTAKEN_WEIGHT / (unsigned) NormalEdges.size(), NORMAL_WEIGHT);
289 for (SmallVectorImpl<unsigned>::iterator I = NormalEdges.begin(),
290 E = NormalEdges.end();
292 setEdgeWeight(BB, *I, NormalWeight);
297 // Calculate Edge Weights using "Pointer Heuristics". Predict a comparsion
298 // between two pointer or pointer and NULL will fail.
299 bool BranchProbabilityInfo::calcPointerHeuristics(BasicBlock *BB) {
300 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator());
301 if (!BI || !BI->isConditional())
304 Value *Cond = BI->getCondition();
305 ICmpInst *CI = dyn_cast<ICmpInst>(Cond);
306 if (!CI || !CI->isEquality())
309 Value *LHS = CI->getOperand(0);
311 if (!LHS->getType()->isPointerTy())
314 assert(CI->getOperand(1)->getType()->isPointerTy());
316 // p != 0 -> isProb = true
317 // p == 0 -> isProb = false
318 // p != q -> isProb = true
319 // p == q -> isProb = false;
320 unsigned TakenIdx = 0, NonTakenIdx = 1;
321 bool isProb = CI->getPredicate() == ICmpInst::ICMP_NE;
323 std::swap(TakenIdx, NonTakenIdx);
325 setEdgeWeight(BB, TakenIdx, PH_TAKEN_WEIGHT);
326 setEdgeWeight(BB, NonTakenIdx, PH_NONTAKEN_WEIGHT);
330 // Calculate Edge Weights using "Loop Branch Heuristics". Predict backedges
331 // as taken, exiting edges as not-taken.
332 bool BranchProbabilityInfo::calcLoopBranchHeuristics(BasicBlock *BB,
333 const LoopInfo &LI) {
334 Loop *L = LI.getLoopFor(BB);
338 SmallVector<unsigned, 8> BackEdges;
339 SmallVector<unsigned, 8> ExitingEdges;
340 SmallVector<unsigned, 8> InEdges; // Edges from header to the loop.
342 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) {
343 if (!L->contains(*I))
344 ExitingEdges.push_back(I.getSuccessorIndex());
345 else if (L->getHeader() == *I)
346 BackEdges.push_back(I.getSuccessorIndex());
348 InEdges.push_back(I.getSuccessorIndex());
351 if (BackEdges.empty() && ExitingEdges.empty())
354 if (uint32_t numBackEdges = BackEdges.size()) {
355 uint32_t backWeight = LBH_TAKEN_WEIGHT / numBackEdges;
356 if (backWeight < NORMAL_WEIGHT)
357 backWeight = NORMAL_WEIGHT;
359 for (SmallVectorImpl<unsigned>::iterator EI = BackEdges.begin(),
360 EE = BackEdges.end(); EI != EE; ++EI) {
361 setEdgeWeight(BB, *EI, backWeight);
365 if (uint32_t numInEdges = InEdges.size()) {
366 uint32_t inWeight = LBH_TAKEN_WEIGHT / numInEdges;
367 if (inWeight < NORMAL_WEIGHT)
368 inWeight = NORMAL_WEIGHT;
370 for (SmallVectorImpl<unsigned>::iterator EI = InEdges.begin(),
371 EE = InEdges.end(); EI != EE; ++EI) {
372 setEdgeWeight(BB, *EI, inWeight);
376 if (uint32_t numExitingEdges = ExitingEdges.size()) {
377 uint32_t exitWeight = LBH_NONTAKEN_WEIGHT / numExitingEdges;
378 if (exitWeight < MIN_WEIGHT)
379 exitWeight = MIN_WEIGHT;
381 for (SmallVectorImpl<unsigned>::iterator EI = ExitingEdges.begin(),
382 EE = ExitingEdges.end(); EI != EE; ++EI) {
383 setEdgeWeight(BB, *EI, exitWeight);
390 bool BranchProbabilityInfo::calcZeroHeuristics(BasicBlock *BB) {
391 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator());
392 if (!BI || !BI->isConditional())
395 Value *Cond = BI->getCondition();
396 ICmpInst *CI = dyn_cast<ICmpInst>(Cond);
400 Value *RHS = CI->getOperand(1);
401 ConstantInt *CV = dyn_cast<ConstantInt>(RHS);
405 // If the LHS is the result of AND'ing a value with a single bit bitmask,
406 // we don't have information about probabilities.
407 if (Instruction *LHS = dyn_cast<Instruction>(CI->getOperand(0)))
408 if (LHS->getOpcode() == Instruction::And)
409 if (ConstantInt *AndRHS = dyn_cast<ConstantInt>(LHS->getOperand(1)))
410 if (AndRHS->getUniqueInteger().isPowerOf2())
415 switch (CI->getPredicate()) {
416 case CmpInst::ICMP_EQ:
417 // X == 0 -> Unlikely
420 case CmpInst::ICMP_NE:
424 case CmpInst::ICMP_SLT:
428 case CmpInst::ICMP_SGT:
435 } else if (CV->isOne() && CI->getPredicate() == CmpInst::ICMP_SLT) {
436 // InstCombine canonicalizes X <= 0 into X < 1.
437 // X <= 0 -> Unlikely
439 } else if (CV->isAllOnesValue()) {
440 switch (CI->getPredicate()) {
441 case CmpInst::ICMP_EQ:
442 // X == -1 -> Unlikely
445 case CmpInst::ICMP_NE:
449 case CmpInst::ICMP_SGT:
450 // InstCombine canonicalizes X >= 0 into X > -1.
461 unsigned TakenIdx = 0, NonTakenIdx = 1;
464 std::swap(TakenIdx, NonTakenIdx);
466 setEdgeWeight(BB, TakenIdx, ZH_TAKEN_WEIGHT);
467 setEdgeWeight(BB, NonTakenIdx, ZH_NONTAKEN_WEIGHT);
472 bool BranchProbabilityInfo::calcFloatingPointHeuristics(BasicBlock *BB) {
473 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator());
474 if (!BI || !BI->isConditional())
477 Value *Cond = BI->getCondition();
478 FCmpInst *FCmp = dyn_cast<FCmpInst>(Cond);
483 if (FCmp->isEquality()) {
484 // f1 == f2 -> Unlikely
485 // f1 != f2 -> Likely
486 isProb = !FCmp->isTrueWhenEqual();
487 } else if (FCmp->getPredicate() == FCmpInst::FCMP_ORD) {
490 } else if (FCmp->getPredicate() == FCmpInst::FCMP_UNO) {
497 unsigned TakenIdx = 0, NonTakenIdx = 1;
500 std::swap(TakenIdx, NonTakenIdx);
502 setEdgeWeight(BB, TakenIdx, FPH_TAKEN_WEIGHT);
503 setEdgeWeight(BB, NonTakenIdx, FPH_NONTAKEN_WEIGHT);
508 bool BranchProbabilityInfo::calcInvokeHeuristics(BasicBlock *BB) {
509 InvokeInst *II = dyn_cast<InvokeInst>(BB->getTerminator());
513 setEdgeWeight(BB, 0/*Index for Normal*/, IH_TAKEN_WEIGHT);
514 setEdgeWeight(BB, 1/*Index for Unwind*/, IH_NONTAKEN_WEIGHT);
518 void BranchProbabilityInfo::releaseMemory() {
522 void BranchProbabilityInfo::print(raw_ostream &OS) const {
523 OS << "---- Branch Probabilities ----\n";
524 // We print the probabilities from the last function the analysis ran over,
525 // or the function it is currently running over.
526 assert(LastF && "Cannot print prior to running over a function");
527 for (const auto &BI : *LastF) {
528 for (succ_const_iterator SI = succ_begin(&BI), SE = succ_end(&BI); SI != SE;
530 printEdgeProbability(OS << " ", &BI, *SI);
535 uint32_t BranchProbabilityInfo::getSumForBlock(const BasicBlock *BB) const {
538 for (succ_const_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) {
539 uint32_t Weight = getEdgeWeight(BB, I.getSuccessorIndex());
540 uint32_t PrevSum = Sum;
543 assert(Sum >= PrevSum); (void) PrevSum;
549 bool BranchProbabilityInfo::
550 isEdgeHot(const BasicBlock *Src, const BasicBlock *Dst) const {
551 // Hot probability is at least 4/5 = 80%
552 // FIXME: Compare against a static "hot" BranchProbability.
553 return getEdgeProbability(Src, Dst) > BranchProbability(4, 5);
556 BasicBlock *BranchProbabilityInfo::getHotSucc(BasicBlock *BB) const {
558 uint32_t MaxWeight = 0;
559 BasicBlock *MaxSucc = nullptr;
561 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) {
562 BasicBlock *Succ = *I;
563 uint32_t Weight = getEdgeWeight(BB, Succ);
564 uint32_t PrevSum = Sum;
567 assert(Sum > PrevSum); (void) PrevSum;
569 if (Weight > MaxWeight) {
575 // Hot probability is at least 4/5 = 80%
576 if (BranchProbability(MaxWeight, Sum) > BranchProbability(4, 5))
582 /// Get the raw edge weight for the edge. If can't find it, return
583 /// DEFAULT_WEIGHT value. Here an edge is specified using PredBlock and an index
584 /// to the successors.
585 uint32_t BranchProbabilityInfo::
586 getEdgeWeight(const BasicBlock *Src, unsigned IndexInSuccessors) const {
587 DenseMap<Edge, uint32_t>::const_iterator I =
588 Weights.find(std::make_pair(Src, IndexInSuccessors));
590 if (I != Weights.end())
593 return DEFAULT_WEIGHT;
596 uint32_t BranchProbabilityInfo::getEdgeWeight(const BasicBlock *Src,
597 succ_const_iterator Dst) const {
598 return getEdgeWeight(Src, Dst.getSuccessorIndex());
601 /// Get the raw edge weight calculated for the block pair. This returns the sum
602 /// of all raw edge weights from Src to Dst.
603 uint32_t BranchProbabilityInfo::
604 getEdgeWeight(const BasicBlock *Src, const BasicBlock *Dst) const {
606 bool FoundWeight = false;
607 DenseMap<Edge, uint32_t>::const_iterator MapI;
608 for (succ_const_iterator I = succ_begin(Src), E = succ_end(Src); I != E; ++I)
610 MapI = Weights.find(std::make_pair(Src, I.getSuccessorIndex()));
611 if (MapI != Weights.end()) {
613 Weight += MapI->second;
616 return (!FoundWeight) ? DEFAULT_WEIGHT : Weight;
619 /// Set the edge weight for a given edge specified by PredBlock and an index
620 /// to the successors.
621 void BranchProbabilityInfo::
622 setEdgeWeight(const BasicBlock *Src, unsigned IndexInSuccessors,
624 Weights[std::make_pair(Src, IndexInSuccessors)] = Weight;
625 DEBUG(dbgs() << "set edge " << Src->getName() << " -> "
626 << IndexInSuccessors << " successor weight to "
630 /// Get an edge's probability, relative to other out-edges from Src.
631 BranchProbability BranchProbabilityInfo::
632 getEdgeProbability(const BasicBlock *Src, unsigned IndexInSuccessors) const {
633 uint32_t N = getEdgeWeight(Src, IndexInSuccessors);
634 uint32_t D = getSumForBlock(Src);
636 // It is possible that the edge weight on the only successor edge of Src is
637 // zero, in which case we return 100%.
638 if (N == 0 && D == 0)
639 return BranchProbability::getOne();
641 return BranchProbability(N, D);
644 /// Get the probability of going from Src to Dst. It returns the sum of all
645 /// probabilities for edges from Src to Dst.
646 BranchProbability BranchProbabilityInfo::
647 getEdgeProbability(const BasicBlock *Src, const BasicBlock *Dst) const {
649 uint32_t N = getEdgeWeight(Src, Dst);
650 uint32_t D = getSumForBlock(Src);
652 // It is possible that the edge weight on the only successor edge of Src is
653 // zero, in which case we return 100%.
654 if (N == 0 && D == 0)
655 return BranchProbability::getOne();
657 return BranchProbability(N, D);
661 BranchProbabilityInfo::getEdgeProbability(const BasicBlock *Src,
662 succ_const_iterator Dst) const {
663 return getEdgeProbability(Src, Dst.getSuccessorIndex());
667 BranchProbabilityInfo::printEdgeProbability(raw_ostream &OS,
668 const BasicBlock *Src,
669 const BasicBlock *Dst) const {
671 const BranchProbability Prob = getEdgeProbability(Src, Dst);
672 OS << "edge " << Src->getName() << " -> " << Dst->getName()
673 << " probability is " << Prob
674 << (isEdgeHot(Src, Dst) ? " [HOT edge]\n" : "\n");
679 void BranchProbabilityInfo::calculate(Function &F, const LoopInfo& LI) {
680 DEBUG(dbgs() << "---- Branch Probability Info : " << F.getName()
682 LastF = &F; // Store the last function we ran on for printing.
683 assert(PostDominatedByUnreachable.empty());
684 assert(PostDominatedByColdCall.empty());
686 // Walk the basic blocks in post-order so that we can build up state about
687 // the successors of a block iteratively.
688 for (auto BB : post_order(&F.getEntryBlock())) {
689 DEBUG(dbgs() << "Computing probabilities for " << BB->getName() << "\n");
690 if (calcUnreachableHeuristics(BB))
692 if (calcMetadataWeights(BB))
694 if (calcColdCallHeuristics(BB))
696 if (calcLoopBranchHeuristics(BB, LI))
698 if (calcPointerHeuristics(BB))
700 if (calcZeroHeuristics(BB))
702 if (calcFloatingPointHeuristics(BB))
704 calcInvokeHeuristics(BB);
707 PostDominatedByUnreachable.clear();
708 PostDominatedByColdCall.clear();
711 void BranchProbabilityInfoWrapperPass::getAnalysisUsage(
712 AnalysisUsage &AU) const {
713 AU.addRequired<LoopInfoWrapperPass>();
714 AU.setPreservesAll();
717 bool BranchProbabilityInfoWrapperPass::runOnFunction(Function &F) {
718 const LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
719 BPI.calculate(F, LI);
723 void BranchProbabilityInfoWrapperPass::releaseMemory() { BPI.releaseMemory(); }
725 void BranchProbabilityInfoWrapperPass::print(raw_ostream &OS,
726 const Module *) const {