1 //=- MachineBranchProbabilityInfo.h - Branch Probability Analysis -*- C++ -*-=//
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 // This pass is used to evaluate branch probabilties on machine basic blocks.
12 //===----------------------------------------------------------------------===//
14 #ifndef LLVM_CODEGEN_MACHINEBRANCHPROBABILITYINFO_H
15 #define LLVM_CODEGEN_MACHINEBRANCHPROBABILITYINFO_H
17 #include "llvm/CodeGen/MachineBasicBlock.h"
18 #include "llvm/Pass.h"
19 #include "llvm/Support/BranchProbability.h"
26 class MachineBranchProbabilityInfo : public ImmutablePass {
27 virtual void anchor();
29 // Default weight value. Used when we don't have information about the edge.
30 // TODO: DEFAULT_WEIGHT makes sense during static predication, when none of
31 // the successors have a weight yet. But it doesn't make sense when providing
32 // weight to an edge that may have siblings with non-zero weights. This can
33 // be handled various ways, but it's probably fine for an edge with unknown
34 // weight to just "inherit" the non-zero weight of an adjacent successor.
35 static const uint32_t DEFAULT_WEIGHT = 16;
40 MachineBranchProbabilityInfo() : ImmutablePass(ID) {
41 PassRegistry &Registry = *PassRegistry::getPassRegistry();
42 initializeMachineBranchProbabilityInfoPass(Registry);
45 void getAnalysisUsage(AnalysisUsage &AU) const override {
49 // Return edge weight. If we don't have any informations about it - return
51 uint32_t getEdgeWeight(const MachineBasicBlock *Src,
52 const MachineBasicBlock *Dst) const;
54 // Same thing, but using a const_succ_iterator from Src. This is faster when
55 // the iterator is already available.
56 uint32_t getEdgeWeight(const MachineBasicBlock *Src,
57 MachineBasicBlock::const_succ_iterator Dst) const;
59 // Get sum of the block successors' weights, potentially scaling them to fit
60 // within 32-bits. If scaling is required, sets Scale based on the necessary
61 // adjustment. Any edge weights used with the sum should be divided by Scale.
62 uint32_t getSumForBlock(const MachineBasicBlock *MBB, uint32_t &Scale) const;
64 // A 'Hot' edge is an edge which probability is >= 80%.
65 bool isEdgeHot(const MachineBasicBlock *Src,
66 const MachineBasicBlock *Dst) const;
68 // Return a hot successor for the block BB or null if there isn't one.
69 // NB: This routine's complexity is linear on the number of successors.
70 MachineBasicBlock *getHotSucc(MachineBasicBlock *MBB) const;
72 // Return a probability as a fraction between 0 (0% probability) and
73 // 1 (100% probability), however the value is never equal to 0, and can be 1
74 // only iff SRC block has only one successor.
75 // NB: This routine's complexity is linear on the number of successors of
76 // Src. Querying sequentially for each successor's probability is a quadratic
78 BranchProbability getEdgeProbability(const MachineBasicBlock *Src,
79 const MachineBasicBlock *Dst) const;
81 // Print value between 0 (0% probability) and 1 (100% probability),
82 // however the value is never equal to 0, and can be 1 only iff SRC block
83 // has only one successor.
84 raw_ostream &printEdgeProbability(raw_ostream &OS,
85 const MachineBasicBlock *Src,
86 const MachineBasicBlock *Dst) const;
88 // Normalize a list of weights by scaling them down so that the sum of them
89 // doesn't exceed UINT32_MAX. Return the scale.
90 template <class WeightListIter>
91 static uint32_t normalizeEdgeWeights(WeightListIter Begin,
95 template <class WeightListIter>
97 MachineBranchProbabilityInfo::normalizeEdgeWeights(WeightListIter Begin,
99 // First we compute the sum with 64-bits of precision.
100 uint64_t Sum = std::accumulate(Begin, End, uint64_t(0));
102 // If Sum is zero, set all weights to 1.
104 std::fill(Begin, End, uint64_t(1));
106 // If the computed sum fits in 32-bits, we're done.
107 if (Sum <= UINT32_MAX)
110 // Otherwise, compute the scale necessary to cause the weights to fit, and
111 // re-sum with that scale applied.
112 assert((Sum / UINT32_MAX) < UINT32_MAX &&
113 "The sum of weights exceeds UINT32_MAX^2!");
114 uint32_t Scale = (Sum / UINT32_MAX) + 1;
115 for (auto I = Begin; I != End; ++I)