0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1 //===- BranchProbability.h - Branch Probability Wrapper ---------*- C++ -*-===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
2 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
3 // The LLVM Compiler Infrastructure
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
4 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
5 // This file is distributed under the University of Illinois Open Source
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
6 // License. See LICENSE.TXT for details.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
7 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
8 //===----------------------------------------------------------------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
9 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
10 // Definition of BranchProbability shared by IR and Machine Instructions.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
11 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
12 //===----------------------------------------------------------------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
13
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
14 #ifndef LLVM_SUPPORT_BRANCHPROBABILITY_H
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
15 #define LLVM_SUPPORT_BRANCHPROBABILITY_H
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
16
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
17 #include "llvm/Support/DataTypes.h"
|
|
100
|
18 #include <algorithm>
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
19 #include <cassert>
|
|
100
|
20 #include <climits>
|
|
|
21 #include <numeric>
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
22
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
23 namespace llvm {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
24
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
25 class raw_ostream;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
26
|
|
95
|
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
|
|
|
30 // precision).
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
31 class BranchProbability {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
32 // Numerator
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
33 uint32_t N;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
34
|
|
95
|
35 // Denominator, which is a constant value.
|
|
|
36 static const uint32_t D = 1u << 31;
|
|
100
|
37 static const uint32_t UnknownN = UINT32_MAX;
|
|
95
|
38
|
|
|
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) {}
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
42
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
43 public:
|
|
100
|
44 BranchProbability() : N(UnknownN) {}
|
|
95
|
45 BranchProbability(uint32_t Numerator, uint32_t Denominator);
|
|
|
46
|
|
|
47 bool isZero() const { return N == 0; }
|
|
100
|
48 bool isUnknown() const { return N == UnknownN; }
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
49
|
|
95
|
50 static BranchProbability getZero() { return BranchProbability(0); }
|
|
|
51 static BranchProbability getOne() { return BranchProbability(D); }
|
|
100
|
52 static BranchProbability getUnknown() { return BranchProbability(UnknownN); }
|
|
95
|
53 // Create a BranchProbability object with the given numerator and 1<<31
|
|
|
54 // as denominator.
|
|
|
55 static BranchProbability getRaw(uint32_t N) { return BranchProbability(N); }
|
|
100
|
56 // Create a BranchProbability object from 64-bit integers.
|
|
|
57 static BranchProbability getBranchProbability(uint64_t Numerator,
|
|
|
58 uint64_t Denominator);
|
|
95
|
59
|
|
|
60 // Normalize given probabilties so that the sum of them becomes approximate
|
|
|
61 // one.
|
|
100
|
62 template <class ProbabilityIter>
|
|
|
63 static void normalizeProbabilities(ProbabilityIter Begin,
|
|
|
64 ProbabilityIter End);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
65
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
66 uint32_t getNumerator() const { return N; }
|
|
95
|
67 static uint32_t getDenominator() { return D; }
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
68
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
69 // Return (1 - Probability).
|
|
95
|
70 BranchProbability getCompl() const { return BranchProbability(D - N); }
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
71
|
|
77
|
72 raw_ostream &print(raw_ostream &OS) const;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
73
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
74 void dump() const;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
75
|
|
77
|
76 /// \brief Scale a large integer.
|
|
|
77 ///
|
|
|
78 /// Scales \c Num. Guarantees full precision. Returns the floor of the
|
|
|
79 /// result.
|
|
|
80 ///
|
|
|
81 /// \return \c Num times \c this.
|
|
|
82 uint64_t scale(uint64_t Num) const;
|
|
|
83
|
|
|
84 /// \brief Scale a large integer by the inverse.
|
|
|
85 ///
|
|
|
86 /// Scales \c Num by the inverse of \c this. Guarantees full precision.
|
|
|
87 /// Returns the floor of the result.
|
|
|
88 ///
|
|
|
89 /// \return \c Num divided by \c this.
|
|
|
90 uint64_t scaleByInverse(uint64_t Num) const;
|
|
|
91
|
|
95
|
92 BranchProbability &operator+=(BranchProbability RHS) {
|
|
100
|
93 assert(N != UnknownN && RHS.N != UnknownN &&
|
|
|
94 "Unknown probability cannot participate in arithmetics.");
|
|
|
95 // Saturate the result in case of overflow.
|
|
|
96 N = (uint64_t(N) + RHS.N > D) ? D : N + RHS.N;
|
|
95
|
97 return *this;
|
|
|
98 }
|
|
|
99
|
|
|
100 BranchProbability &operator-=(BranchProbability RHS) {
|
|
100
|
101 assert(N != UnknownN && RHS.N != UnknownN &&
|
|
|
102 "Unknown probability cannot participate in arithmetics.");
|
|
|
103 // Saturate the result in case of underflow.
|
|
|
104 N = N < RHS.N ? 0 : N - RHS.N;
|
|
95
|
105 return *this;
|
|
|
106 }
|
|
|
107
|
|
|
108 BranchProbability &operator*=(BranchProbability RHS) {
|
|
100
|
109 assert(N != UnknownN && RHS.N != UnknownN &&
|
|
|
110 "Unknown probability cannot participate in arithmetics.");
|
|
95
|
111 N = (static_cast<uint64_t>(N) * RHS.N + D / 2) / D;
|
|
|
112 return *this;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
113 }
|
|
95
|
114
|
|
100
|
115 BranchProbability &operator/=(uint32_t RHS) {
|
|
|
116 assert(N != UnknownN &&
|
|
|
117 "Unknown probability cannot participate in arithmetics.");
|
|
|
118 assert(RHS > 0 && "The divider cannot be zero.");
|
|
|
119 N /= RHS;
|
|
|
120 return *this;
|
|
|
121 }
|
|
|
122
|
|
95
|
123 BranchProbability operator+(BranchProbability RHS) const {
|
|
|
124 BranchProbability Prob(*this);
|
|
|
125 return Prob += RHS;
|
|
|
126 }
|
|
|
127
|
|
|
128 BranchProbability operator-(BranchProbability RHS) const {
|
|
|
129 BranchProbability Prob(*this);
|
|
|
130 return Prob -= RHS;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
131 }
|
|
95
|
132
|
|
|
133 BranchProbability operator*(BranchProbability RHS) const {
|
|
|
134 BranchProbability Prob(*this);
|
|
|
135 return Prob *= RHS;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
136 }
|
|
95
|
137
|
|
100
|
138 BranchProbability operator/(uint32_t RHS) const {
|
|
|
139 BranchProbability Prob(*this);
|
|
|
140 return Prob /= RHS;
|
|
|
141 }
|
|
|
142
|
|
95
|
143 bool operator==(BranchProbability RHS) const { return N == RHS.N; }
|
|
|
144 bool operator!=(BranchProbability RHS) const { return !(*this == RHS); }
|
|
100
|
145
|
|
|
146 bool operator<(BranchProbability RHS) const {
|
|
|
147 assert(N != UnknownN && RHS.N != UnknownN &&
|
|
|
148 "Unknown probability cannot participate in comparisons.");
|
|
|
149 return N < RHS.N;
|
|
|
150 }
|
|
|
151
|
|
|
152 bool operator>(BranchProbability RHS) const {
|
|
|
153 assert(N != UnknownN && RHS.N != UnknownN &&
|
|
|
154 "Unknown probability cannot participate in comparisons.");
|
|
|
155 return RHS < *this;
|
|
|
156 }
|
|
|
157
|
|
|
158 bool operator<=(BranchProbability RHS) const {
|
|
|
159 assert(N != UnknownN && RHS.N != UnknownN &&
|
|
|
160 "Unknown probability cannot participate in comparisons.");
|
|
|
161 return !(RHS < *this);
|
|
|
162 }
|
|
|
163
|
|
|
164 bool operator>=(BranchProbability RHS) const {
|
|
|
165 assert(N != UnknownN && RHS.N != UnknownN &&
|
|
|
166 "Unknown probability cannot participate in comparisons.");
|
|
|
167 return !(*this < RHS);
|
|
|
168 }
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
169 };
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
170
|
|
95
|
171 inline raw_ostream &operator<<(raw_ostream &OS, BranchProbability Prob) {
|
|
77
|
172 return Prob.print(OS);
|
|
|
173 }
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
174
|
|
100
|
175 template <class ProbabilityIter>
|
|
|
176 void BranchProbability::normalizeProbabilities(ProbabilityIter Begin,
|
|
|
177 ProbabilityIter End) {
|
|
|
178 if (Begin == End)
|
|
|
179 return;
|
|
|
180
|
|
|
181 unsigned UnknownProbCount = 0;
|
|
|
182 uint64_t Sum = std::accumulate(Begin, End, uint64_t(0),
|
|
|
183 [&](uint64_t S, const BranchProbability &BP) {
|
|
|
184 if (!BP.isUnknown())
|
|
|
185 return S + BP.N;
|
|
|
186 UnknownProbCount++;
|
|
|
187 return S;
|
|
|
188 });
|
|
|
189
|
|
|
190 if (UnknownProbCount > 0) {
|
|
|
191 BranchProbability ProbForUnknown = BranchProbability::getZero();
|
|
|
192 // If the sum of all known probabilities is less than one, evenly distribute
|
|
|
193 // the complement of sum to unknown probabilities. Otherwise, set unknown
|
|
|
194 // probabilities to zeros and continue to normalize known probabilities.
|
|
|
195 if (Sum < BranchProbability::getDenominator())
|
|
|
196 ProbForUnknown = BranchProbability::getRaw(
|
|
|
197 (BranchProbability::getDenominator() - Sum) / UnknownProbCount);
|
|
|
198
|
|
|
199 std::replace_if(Begin, End,
|
|
|
200 [](const BranchProbability &BP) { return BP.isUnknown(); },
|
|
|
201 ProbForUnknown);
|
|
|
202
|
|
|
203 if (Sum <= BranchProbability::getDenominator())
|
|
|
204 return;
|
|
|
205 }
|
|
|
206
|
|
|
207 if (Sum == 0) {
|
|
|
208 BranchProbability BP(1, std::distance(Begin, End));
|
|
|
209 std::fill(Begin, End, BP);
|
|
|
210 return;
|
|
|
211 }
|
|
|
212
|
|
|
213 for (auto I = Begin; I != End; ++I)
|
|
|
214 I->N = (I->N * uint64_t(D) + Sum / 2) / Sum;
|
|
95
|
215 }
|
|
|
216
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
217 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
218
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
219 #endif
|
