1 //===- BranchProbability.h - Branch Probability Wrapper ---------*- 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 // Definition of BranchProbability shared by IR and Machine Instructions.
12 //===----------------------------------------------------------------------===//
14 #ifndef LLVM_SUPPORT_BRANCHPROBABILITY_H
15 #define LLVM_SUPPORT_BRANCHPROBABILITY_H
17 #include "llvm/Support/DataTypes.h"
27 // This class represents Branch Probability as a non-negative fraction that is
28 // no greater than 1. It uses a fixed-point-like implementation, in which the
29 // denominator is always a constant value (here we use 1<<31 for maximum
31 class BranchProbability {
35 // Denominator, which is a constant value.
36 static const uint32_t D = 1u << 31;
37 static const uint32_t UnknownN = UINT32_MAX;
39 // Construct a BranchProbability with only numerator assuming the denominator
40 // is 1<<31. For internal use only.
41 explicit BranchProbability(uint32_t n) : N(n) {}
44 BranchProbability() : N(UnknownN) {}
45 BranchProbability(uint32_t Numerator, uint32_t Denominator);
47 bool isZero() const { return N == 0; }
48 bool isUnknown() const { return N == UnknownN; }
50 static BranchProbability getZero() { return BranchProbability(0); }
51 static BranchProbability getOne() { return BranchProbability(D); }
52 static BranchProbability getUnknown() { return BranchProbability(UnknownN); }
53 // Create a BranchProbability object with the given numerator and 1<<31
55 static BranchProbability getRaw(uint32_t N) { return BranchProbability(N); }
56 // Create a BranchProbability object from 64-bit integers.
57 static BranchProbability getBranchProbability(uint64_t Numerator,
58 uint64_t Denominator);
60 // Normalize given probabilties so that the sum of them becomes approximate
62 template <class ProbabilityIter>
63 static void normalizeProbabilities(ProbabilityIter Begin,
66 // Normalize a list of weights by scaling them down so that the sum of them
67 // doesn't exceed UINT32_MAX.
68 template <class WeightListIter>
69 static void normalizeEdgeWeights(WeightListIter Begin, WeightListIter End);
71 uint32_t getNumerator() const { return N; }
72 static uint32_t getDenominator() { return D; }
74 // Return (1 - Probability).
75 BranchProbability getCompl() const { return BranchProbability(D - N); }
77 raw_ostream &print(raw_ostream &OS) const;
81 /// \brief Scale a large integer.
83 /// Scales \c Num. Guarantees full precision. Returns the floor of the
86 /// \return \c Num times \c this.
87 uint64_t scale(uint64_t Num) const;
89 /// \brief Scale a large integer by the inverse.
91 /// Scales \c Num by the inverse of \c this. Guarantees full precision.
92 /// Returns the floor of the result.
94 /// \return \c Num divided by \c this.
95 uint64_t scaleByInverse(uint64_t Num) const;
97 BranchProbability &operator+=(BranchProbability RHS) {
98 assert(N != UnknownN && RHS.N != UnknownN &&
99 "Unknown probability cannot participate in arithmetics.");
100 // Saturate the result in case of overflow.
101 N = (uint64_t(N) + RHS.N > D) ? D : N + RHS.N;
105 BranchProbability &operator-=(BranchProbability RHS) {
106 assert(N != UnknownN && RHS.N != UnknownN &&
107 "Unknown probability cannot participate in arithmetics.");
108 // Saturate the result in case of underflow.
109 N = N < RHS.N ? 0 : N - RHS.N;
113 BranchProbability &operator*=(BranchProbability RHS) {
114 assert(N != UnknownN && RHS.N != UnknownN &&
115 "Unknown probability cannot participate in arithmetics.");
116 N = (static_cast<uint64_t>(N) * RHS.N + D / 2) / D;
120 BranchProbability &operator/=(uint32_t RHS) {
121 assert(N != UnknownN &&
122 "Unknown probability cannot participate in arithmetics.");
123 assert(RHS > 0 && "The divider cannot be zero.");
128 BranchProbability operator+(BranchProbability RHS) const {
129 BranchProbability Prob(*this);
133 BranchProbability operator-(BranchProbability RHS) const {
134 BranchProbability Prob(*this);
138 BranchProbability operator*(BranchProbability RHS) const {
139 BranchProbability Prob(*this);
143 BranchProbability operator/(uint32_t RHS) const {
144 BranchProbability Prob(*this);
148 bool operator==(BranchProbability RHS) const { return N == RHS.N; }
149 bool operator!=(BranchProbability RHS) const { return !(*this == RHS); }
151 bool operator<(BranchProbability RHS) const {
152 assert(N != UnknownN && RHS.N != UnknownN &&
153 "Unknown probability cannot participate in comparisons.");
157 bool operator>(BranchProbability RHS) const {
158 assert(N != UnknownN && RHS.N != UnknownN &&
159 "Unknown probability cannot participate in comparisons.");
163 bool operator<=(BranchProbability RHS) const {
164 assert(N != UnknownN && RHS.N != UnknownN &&
165 "Unknown probability cannot participate in comparisons.");
166 return !(RHS < *this);
169 bool operator>=(BranchProbability RHS) const {
170 assert(N != UnknownN && RHS.N != UnknownN &&
171 "Unknown probability cannot participate in comparisons.");
172 return !(*this < RHS);
176 inline raw_ostream &operator<<(raw_ostream &OS, BranchProbability Prob) {
177 return Prob.print(OS);
180 template <class ProbabilityIter>
181 void BranchProbability::normalizeProbabilities(ProbabilityIter Begin,
182 ProbabilityIter End) {
186 auto UnknownProbCount =
187 std::count(Begin, End, BranchProbability::getUnknown());
188 assert((UnknownProbCount == 0 ||
189 UnknownProbCount == std::distance(Begin, End)) &&
190 "Cannot normalize probabilities with known and unknown ones.");
191 (void)UnknownProbCount;
193 uint64_t Sum = std::accumulate(
194 Begin, End, uint64_t(0),
195 [](uint64_t S, const BranchProbability &BP) { return S + BP.N; });
198 BranchProbability BP(1, std::distance(Begin, End));
199 std::fill(Begin, End, BP);
203 for (auto I = Begin; I != End; ++I)
204 I->N = (I->N * uint64_t(D) + Sum / 2) / Sum;
207 template <class WeightListIter>
208 void BranchProbability::normalizeEdgeWeights(WeightListIter Begin,
209 WeightListIter End) {
210 // First we compute the sum with 64-bits of precision.
211 uint64_t Sum = std::accumulate(Begin, End, uint64_t(0));
213 if (Sum > UINT32_MAX) {
214 // Compute the scale necessary to cause the weights to fit, and re-sum with
215 // that scale applied.
216 assert(Sum / UINT32_MAX < UINT32_MAX &&
217 "The sum of weights exceeds UINT32_MAX^2!");
218 uint32_t Scale = Sum / UINT32_MAX + 1;
219 for (auto I = Begin; I != End; ++I)
221 Sum = std::accumulate(Begin, End, uint64_t(0));
224 // Eliminate zero weights.
225 auto ZeroWeightNum = std::count(Begin, End, 0u);
226 if (ZeroWeightNum > 0) {
227 // If all weights are zeros, replace them by 1.
229 std::fill(Begin, End, 1u);
231 // We are converting zeros into ones, and here we need to make sure that
232 // after this the sum won't exceed UINT32_MAX.
233 if (Sum + ZeroWeightNum > UINT32_MAX) {
234 for (auto I = Begin; I != End; ++I)
236 ZeroWeightNum = std::count(Begin, End, 0u);
237 Sum = std::accumulate(Begin, End, uint64_t(0));
239 // Scale up non-zero weights and turn zero weights into ones.
240 uint64_t ScalingFactor = (UINT32_MAX - ZeroWeightNum) / Sum;
241 assert(ScalingFactor >= 1);
242 if (ScalingFactor > 1)
243 for (auto I = Begin; I != End; ++I)
245 std::replace(Begin, End, 0u, 1u);