blob: 5d2170dcf1551dbea19bd700268fea99202ede25 [file] [log] [blame]
Duncan P. N. Exon Smith689a5072014-04-11 23:20:58 +00001//===- BlockFrequencyInfo.cpp - Block Frequency Analysis ------------------===//
Jakub Staszak668c6fa2011-06-23 21:56:59 +00002//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// Loops should be simplified before this analysis.
11//
12//===----------------------------------------------------------------------===//
13
Jakub Staszak875ebd52011-07-25 19:25:40 +000014#include "llvm/Analysis/BlockFrequencyInfo.h"
Eugene Zelenko38c02bc2017-07-21 21:37:46 +000015#include "llvm/ADT/APInt.h"
16#include "llvm/ADT/None.h"
17#include "llvm/ADT/iterator.h"
Duncan P. N. Exon Smith689a5072014-04-11 23:20:58 +000018#include "llvm/Analysis/BlockFrequencyInfoImpl.h"
Chandler Carruthed0881b2012-12-03 16:50:05 +000019#include "llvm/Analysis/BranchProbabilityInfo.h"
Jakub Staszak668c6fa2011-06-23 21:56:59 +000020#include "llvm/Analysis/LoopInfo.h"
Chandler Carruth1305dc32014-03-04 11:45:46 +000021#include "llvm/IR/CFG.h"
Eugene Zelenko38c02bc2017-07-21 21:37:46 +000022#include "llvm/IR/Function.h"
23#include "llvm/IR/PassManager.h"
24#include "llvm/Pass.h"
Michael Gottesmanfd8aee72013-11-14 02:27:46 +000025#include "llvm/Support/CommandLine.h"
Michael Gottesmanfd8aee72013-11-14 02:27:46 +000026#include "llvm/Support/GraphWriter.h"
Eugene Zelenko38c02bc2017-07-21 21:37:46 +000027#include "llvm/Support/raw_ostream.h"
28#include <algorithm>
29#include <cassert>
30#include <string>
Jakub Staszak668c6fa2011-06-23 21:56:59 +000031
32using namespace llvm;
33
Chandler Carruthf1221bd2014-04-22 02:48:03 +000034#define DEBUG_TYPE "block-freq"
35
Xinliang David Li8dd5ce92016-06-28 04:07:03 +000036static cl::opt<GVDAGType> ViewBlockFreqPropagationDAG(
37 "view-block-freq-propagation-dags", cl::Hidden,
38 cl::desc("Pop up a window to show a dag displaying how block "
39 "frequencies propagation through the CFG."),
40 cl::values(clEnumValN(GVDT_None, "none", "do not display graphs."),
41 clEnumValN(GVDT_Fraction, "fraction",
42 "display a graph using the "
43 "fractional block frequency representation."),
44 clEnumValN(GVDT_Integer, "integer",
45 "display a graph using the raw "
46 "integer fractional block frequency representation."),
47 clEnumValN(GVDT_Count, "count", "display a graph using the real "
Mehdi Amini732afdd2016-10-08 19:41:06 +000048 "profile count if available.")));
Xinliang David Li8dd5ce92016-06-28 04:07:03 +000049
Xinliang David Li3e176c72016-06-28 06:58:21 +000050cl::opt<std::string>
51 ViewBlockFreqFuncName("view-bfi-func-name", cl::Hidden,
52 cl::desc("The option to specify "
53 "the name of the function "
54 "whose CFG will be displayed."));
55
56cl::opt<unsigned>
57 ViewHotFreqPercent("view-hot-freq-percent", cl::init(10), cl::Hidden,
58 cl::desc("An integer in percent used to specify "
59 "the hot blocks/edges to be displayed "
60 "in red: a block or edge whose frequency "
61 "is no less than the max frequency of the "
62 "function multiplied by this percent."));
Michael Gottesmanfd8aee72013-11-14 02:27:46 +000063
Hiroshi Yamauchia43913c2017-09-13 17:20:38 +000064// Command line option to turn on CFG dot or text dump after profile annotation.
65cl::opt<PGOViewCountsType> PGOViewCounts(
66 "pgo-view-counts", cl::Hidden,
67 cl::desc("A boolean option to show CFG dag or text with "
68 "block profile counts and branch probabilities "
69 "right after PGO profile annotation step. The "
70 "profile counts are computed using branch "
71 "probabilities from the runtime profile data and "
72 "block frequency propagation algorithm. To view "
73 "the raw counts from the profile, use option "
74 "-pgo-view-raw-counts instead. To limit graph "
75 "display to only one function, use filtering option "
76 "-view-bfi-func-name."),
77 cl::values(clEnumValN(PGOVCT_None, "none", "do not show."),
78 clEnumValN(PGOVCT_Graph, "graph", "show a graph."),
79 clEnumValN(PGOVCT_Text, "text", "show in text.")));
Xinliang David Licb253ce2017-01-23 18:58:24 +000080
Hiroshi Yamauchi63e17eb2017-08-26 00:31:00 +000081static cl::opt<bool> PrintBlockFreq(
82 "print-bfi", cl::init(false), cl::Hidden,
83 cl::desc("Print the block frequency info."));
84
85cl::opt<std::string> PrintBlockFreqFuncName(
86 "print-bfi-func-name", cl::Hidden,
87 cl::desc("The option to specify the name of the function "
88 "whose block frequency info is printed."));
89
Michael Gottesmanfd8aee72013-11-14 02:27:46 +000090namespace llvm {
91
Xinliang David Licb253ce2017-01-23 18:58:24 +000092static GVDAGType getGVDT() {
Hiroshi Yamauchia43913c2017-09-13 17:20:38 +000093 if (PGOViewCounts == PGOVCT_Graph)
Xinliang David Licb253ce2017-01-23 18:58:24 +000094 return GVDT_Count;
95 return ViewBlockFreqPropagationDAG;
96}
97
Michael Gottesmanfd8aee72013-11-14 02:27:46 +000098template <>
99struct GraphTraits<BlockFrequencyInfo *> {
Eugene Zelenko38c02bc2017-07-21 21:37:46 +0000100 using NodeRef = const BasicBlock *;
101 using ChildIteratorType = succ_const_iterator;
102 using nodes_iterator = pointer_iterator<Function::const_iterator>;
Michael Gottesmanfd8aee72013-11-14 02:27:46 +0000103
Tim Shen48f814e2016-08-31 16:48:13 +0000104 static NodeRef getEntryNode(const BlockFrequencyInfo *G) {
Duncan P. N. Exon Smith5a82c912015-10-10 00:53:03 +0000105 return &G->getFunction()->front();
Michael Gottesmanfd8aee72013-11-14 02:27:46 +0000106 }
Eugene Zelenko38c02bc2017-07-21 21:37:46 +0000107
Tim Shenf2187ed2016-08-22 21:09:30 +0000108 static ChildIteratorType child_begin(const NodeRef N) {
Michael Gottesmanfd8aee72013-11-14 02:27:46 +0000109 return succ_begin(N);
110 }
Eugene Zelenko38c02bc2017-07-21 21:37:46 +0000111
Tim Shenf2187ed2016-08-22 21:09:30 +0000112 static ChildIteratorType child_end(const NodeRef N) { return succ_end(N); }
Eugene Zelenko38c02bc2017-07-21 21:37:46 +0000113
Michael Gottesmanfd8aee72013-11-14 02:27:46 +0000114 static nodes_iterator nodes_begin(const BlockFrequencyInfo *G) {
Tim Shenb5e0f5a2016-08-19 21:20:13 +0000115 return nodes_iterator(G->getFunction()->begin());
Michael Gottesmanfd8aee72013-11-14 02:27:46 +0000116 }
Eugene Zelenko38c02bc2017-07-21 21:37:46 +0000117
Michael Gottesmanfd8aee72013-11-14 02:27:46 +0000118 static nodes_iterator nodes_end(const BlockFrequencyInfo *G) {
Tim Shenb5e0f5a2016-08-19 21:20:13 +0000119 return nodes_iterator(G->getFunction()->end());
Michael Gottesmanfd8aee72013-11-14 02:27:46 +0000120 }
121};
122
Eugene Zelenko38c02bc2017-07-21 21:37:46 +0000123using BFIDOTGTraitsBase =
124 BFIDOTGraphTraitsBase<BlockFrequencyInfo, BranchProbabilityInfo>;
Michael Gottesmanfd8aee72013-11-14 02:27:46 +0000125
Xinliang David Li55415f22016-06-28 03:41:29 +0000126template <>
127struct DOTGraphTraits<BlockFrequencyInfo *> : public BFIDOTGTraitsBase {
128 explicit DOTGraphTraits(bool isSimple = false)
129 : BFIDOTGTraitsBase(isSimple) {}
Michael Gottesmanfd8aee72013-11-14 02:27:46 +0000130
131 std::string getNodeLabel(const BasicBlock *Node,
132 const BlockFrequencyInfo *Graph) {
Michael Gottesmanfd8aee72013-11-14 02:27:46 +0000133
Xinliang David Licb253ce2017-01-23 18:58:24 +0000134 return BFIDOTGTraitsBase::getNodeLabel(Node, Graph, getGVDT());
Xinliang David Li55415f22016-06-28 03:41:29 +0000135 }
Michael Gottesmanfd8aee72013-11-14 02:27:46 +0000136
Xinliang David Li3e176c72016-06-28 06:58:21 +0000137 std::string getNodeAttributes(const BasicBlock *Node,
138 const BlockFrequencyInfo *Graph) {
139 return BFIDOTGTraitsBase::getNodeAttributes(Node, Graph,
140 ViewHotFreqPercent);
141 }
142
Xinliang David Li55415f22016-06-28 03:41:29 +0000143 std::string getEdgeAttributes(const BasicBlock *Node, EdgeIter EI,
144 const BlockFrequencyInfo *BFI) {
Xinliang David Li3e176c72016-06-28 06:58:21 +0000145 return BFIDOTGTraitsBase::getEdgeAttributes(Node, EI, BFI, BFI->getBPI(),
146 ViewHotFreqPercent);
Michael Gottesmanfd8aee72013-11-14 02:27:46 +0000147 }
148};
149
150} // end namespace llvm
Michael Gottesmanfd8aee72013-11-14 02:27:46 +0000151
Eugene Zelenko38c02bc2017-07-21 21:37:46 +0000152BlockFrequencyInfo::BlockFrequencyInfo() = default;
Cong Hou9b4f6b22015-07-16 23:23:35 +0000153
154BlockFrequencyInfo::BlockFrequencyInfo(const Function &F,
155 const BranchProbabilityInfo &BPI,
156 const LoopInfo &LI) {
157 calculate(F, BPI, LI);
158}
159
Xinliang David Li28a93272016-05-05 21:13:27 +0000160BlockFrequencyInfo::BlockFrequencyInfo(BlockFrequencyInfo &&Arg)
161 : BFI(std::move(Arg.BFI)) {}
162
163BlockFrequencyInfo &BlockFrequencyInfo::operator=(BlockFrequencyInfo &&RHS) {
164 releaseMemory();
165 BFI = std::move(RHS.BFI);
166 return *this;
167}
168
Adam Nemetc2f791d2016-07-13 05:01:48 +0000169// Explicitly define the default constructor otherwise it would be implicitly
170// defined at the first ODR-use which is the BFI member in the
171// LazyBlockFrequencyInfo header. The dtor needs the BlockFrequencyInfoImpl
172// template instantiated which is not available in the header.
Eugene Zelenko38c02bc2017-07-21 21:37:46 +0000173BlockFrequencyInfo::~BlockFrequencyInfo() = default;
Adam Nemetc2f791d2016-07-13 05:01:48 +0000174
Chandler Carruthca68a3e2017-01-15 06:32:49 +0000175bool BlockFrequencyInfo::invalidate(Function &F, const PreservedAnalyses &PA,
176 FunctionAnalysisManager::Invalidator &) {
177 // Check whether the analysis, all analyses on functions, or the function's
178 // CFG have been preserved.
179 auto PAC = PA.getChecker<BlockFrequencyAnalysis>();
180 return !(PAC.preserved() || PAC.preservedSet<AllAnalysesOn<Function>>() ||
181 PAC.preservedSet<CFGAnalyses>());
182}
183
Wei Mideee61e2015-07-14 23:40:50 +0000184void BlockFrequencyInfo::calculate(const Function &F,
185 const BranchProbabilityInfo &BPI,
186 const LoopInfo &LI) {
Duncan P. N. Exon Smith3dbe1052014-03-25 18:01:38 +0000187 if (!BFI)
188 BFI.reset(new ImplType);
Cong Hou5e67b662015-07-15 19:58:26 +0000189 BFI->calculate(F, BPI, LI);
Xinliang David Li8dd5ce92016-06-28 04:07:03 +0000190 if (ViewBlockFreqPropagationDAG != GVDT_None &&
191 (ViewBlockFreqFuncName.empty() ||
192 F.getName().equals(ViewBlockFreqFuncName))) {
Michael Gottesmanfd8aee72013-11-14 02:27:46 +0000193 view();
Xinliang David Li8dd5ce92016-06-28 04:07:03 +0000194 }
Hiroshi Yamauchi63e17eb2017-08-26 00:31:00 +0000195 if (PrintBlockFreq &&
196 (PrintBlockFreqFuncName.empty() ||
197 F.getName().equals(PrintBlockFreqFuncName))) {
198 print(dbgs());
199 }
Chandler Carruth343fad42011-10-19 10:12:41 +0000200}
201
Jakub Staszak96f8c552011-12-20 20:03:10 +0000202BlockFrequency BlockFrequencyInfo::getBlockFreq(const BasicBlock *BB) const {
Duncan P. N. Exon Smith3dbe1052014-03-25 18:01:38 +0000203 return BFI ? BFI->getBlockFreq(BB) : 0;
Jakub Staszak668c6fa2011-06-23 21:56:59 +0000204}
Michael Gottesmanfd8aee72013-11-14 02:27:46 +0000205
Easwaran Raman12b79aa2016-03-23 18:18:26 +0000206Optional<uint64_t>
207BlockFrequencyInfo::getBlockProfileCount(const BasicBlock *BB) const {
Xinliang David Lib12b3532016-06-22 17:12:12 +0000208 if (!BFI)
Easwaran Raman12b79aa2016-03-23 18:18:26 +0000209 return None;
Xinliang David Lib12b3532016-06-22 17:12:12 +0000210
211 return BFI->getBlockProfileCount(*getFunction(), BB);
Easwaran Raman12b79aa2016-03-23 18:18:26 +0000212}
213
Sean Silvaf8015752016-08-02 02:15:45 +0000214Optional<uint64_t>
215BlockFrequencyInfo::getProfileCountFromFreq(uint64_t Freq) const {
216 if (!BFI)
217 return None;
218 return BFI->getProfileCountFromFreq(*getFunction(), Freq);
219}
220
Xinliang David Lib12b3532016-06-22 17:12:12 +0000221void BlockFrequencyInfo::setBlockFreq(const BasicBlock *BB, uint64_t Freq) {
Manman Ren72d44b12015-10-15 14:59:40 +0000222 assert(BFI && "Expected analysis to be available");
223 BFI->setBlockFreq(BB, Freq);
224}
225
Easwaran Raman6c8f5112017-01-19 18:53:16 +0000226void BlockFrequencyInfo::setBlockFreqAndScale(
227 const BasicBlock *ReferenceBB, uint64_t Freq,
228 SmallPtrSetImpl<BasicBlock *> &BlocksToScale) {
229 assert(BFI && "Expected analysis to be available");
230 // Use 128 bits APInt to avoid overflow.
231 APInt NewFreq(128, Freq);
232 APInt OldFreq(128, BFI->getBlockFreq(ReferenceBB).getFrequency());
233 APInt BBFreq(128, 0);
234 for (auto *BB : BlocksToScale) {
235 BBFreq = BFI->getBlockFreq(BB).getFrequency();
236 // Multiply first by NewFreq and then divide by OldFreq
237 // to minimize loss of precision.
238 BBFreq *= NewFreq;
239 // udiv is an expensive operation in the general case. If this ends up being
240 // a hot spot, one of the options proposed in
241 // https://reviews.llvm.org/D28535#650071 could be used to avoid this.
242 BBFreq = BBFreq.udiv(OldFreq);
243 BFI->setBlockFreq(BB, BBFreq.getLimitedValue());
244 }
245 BFI->setBlockFreq(ReferenceBB, Freq);
246}
247
Michael Gottesmanfd8aee72013-11-14 02:27:46 +0000248/// Pop up a ghostview window with the current block frequency propagation
249/// rendered using dot.
250void BlockFrequencyInfo::view() const {
Michael Gottesmanfd8aee72013-11-14 02:27:46 +0000251 ViewGraph(const_cast<BlockFrequencyInfo *>(this), "BlockFrequencyDAGs");
Michael Gottesmanfd8aee72013-11-14 02:27:46 +0000252}
253
254const Function *BlockFrequencyInfo::getFunction() const {
Duncan P. N. Exon Smith10be9a82014-04-21 17:57:07 +0000255 return BFI ? BFI->getFunction() : nullptr;
Michael Gottesmanfd8aee72013-11-14 02:27:46 +0000256}
Michael Gottesmanfd5c4b22013-12-14 00:06:03 +0000257
Xinliang David Li55415f22016-06-28 03:41:29 +0000258const BranchProbabilityInfo *BlockFrequencyInfo::getBPI() const {
259 return BFI ? &BFI->getBPI() : nullptr;
260}
261
Michael Gottesmanfd5c4b22013-12-14 00:06:03 +0000262raw_ostream &BlockFrequencyInfo::
263printBlockFreq(raw_ostream &OS, const BlockFrequency Freq) const {
Duncan P. N. Exon Smith3dbe1052014-03-25 18:01:38 +0000264 return BFI ? BFI->printBlockFreq(OS, Freq) : OS;
Michael Gottesmanfd5c4b22013-12-14 00:06:03 +0000265}
266
267raw_ostream &
268BlockFrequencyInfo::printBlockFreq(raw_ostream &OS,
269 const BasicBlock *BB) const {
Duncan P. N. Exon Smith3dbe1052014-03-25 18:01:38 +0000270 return BFI ? BFI->printBlockFreq(OS, BB) : OS;
Michael Gottesmanfd5c4b22013-12-14 00:06:03 +0000271}
Yuchen Wu5947c8f2013-12-20 22:11:11 +0000272
273uint64_t BlockFrequencyInfo::getEntryFreq() const {
Duncan P. N. Exon Smith3dbe1052014-03-25 18:01:38 +0000274 return BFI ? BFI->getEntryFreq() : 0;
Yuchen Wu5947c8f2013-12-20 22:11:11 +0000275}
Wei Mideee61e2015-07-14 23:40:50 +0000276
277void BlockFrequencyInfo::releaseMemory() { BFI.reset(); }
278
279void BlockFrequencyInfo::print(raw_ostream &OS) const {
280 if (BFI)
281 BFI->print(OS);
282}
283
Wei Mideee61e2015-07-14 23:40:50 +0000284INITIALIZE_PASS_BEGIN(BlockFrequencyInfoWrapperPass, "block-freq",
285 "Block Frequency Analysis", true, true)
Cong Houab23bfb2015-07-15 22:48:29 +0000286INITIALIZE_PASS_DEPENDENCY(BranchProbabilityInfoWrapperPass)
Wei Mideee61e2015-07-14 23:40:50 +0000287INITIALIZE_PASS_DEPENDENCY(LoopInfoWrapperPass)
288INITIALIZE_PASS_END(BlockFrequencyInfoWrapperPass, "block-freq",
289 "Block Frequency Analysis", true, true)
290
291char BlockFrequencyInfoWrapperPass::ID = 0;
292
Wei Mideee61e2015-07-14 23:40:50 +0000293BlockFrequencyInfoWrapperPass::BlockFrequencyInfoWrapperPass()
294 : FunctionPass(ID) {
295 initializeBlockFrequencyInfoWrapperPassPass(*PassRegistry::getPassRegistry());
296}
297
Eugene Zelenko38c02bc2017-07-21 21:37:46 +0000298BlockFrequencyInfoWrapperPass::~BlockFrequencyInfoWrapperPass() = default;
Wei Mideee61e2015-07-14 23:40:50 +0000299
300void BlockFrequencyInfoWrapperPass::print(raw_ostream &OS,
301 const Module *) const {
302 BFI.print(OS);
303}
304
305void BlockFrequencyInfoWrapperPass::getAnalysisUsage(AnalysisUsage &AU) const {
Cong Houab23bfb2015-07-15 22:48:29 +0000306 AU.addRequired<BranchProbabilityInfoWrapperPass>();
Wei Mideee61e2015-07-14 23:40:50 +0000307 AU.addRequired<LoopInfoWrapperPass>();
308 AU.setPreservesAll();
309}
310
311void BlockFrequencyInfoWrapperPass::releaseMemory() { BFI.releaseMemory(); }
312
313bool BlockFrequencyInfoWrapperPass::runOnFunction(Function &F) {
Cong Houab23bfb2015-07-15 22:48:29 +0000314 BranchProbabilityInfo &BPI =
315 getAnalysis<BranchProbabilityInfoWrapperPass>().getBPI();
Wei Mideee61e2015-07-14 23:40:50 +0000316 LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
317 BFI.calculate(F, BPI, LI);
318 return false;
319}
Xinliang David Li28a93272016-05-05 21:13:27 +0000320
Chandler Carruthdab4eae2016-11-23 17:53:26 +0000321AnalysisKey BlockFrequencyAnalysis::Key;
Xinliang David Li28a93272016-05-05 21:13:27 +0000322BlockFrequencyInfo BlockFrequencyAnalysis::run(Function &F,
Sean Silva36e0d012016-08-09 00:28:15 +0000323 FunctionAnalysisManager &AM) {
Xinliang David Li28a93272016-05-05 21:13:27 +0000324 BlockFrequencyInfo BFI;
325 BFI.calculate(F, AM.getResult<BranchProbabilityAnalysis>(F),
326 AM.getResult<LoopAnalysis>(F));
327 return BFI;
328}
329
330PreservedAnalyses
Sean Silva36e0d012016-08-09 00:28:15 +0000331BlockFrequencyPrinterPass::run(Function &F, FunctionAnalysisManager &AM) {
Xinliang David Li28a93272016-05-05 21:13:27 +0000332 OS << "Printing analysis results of BFI for function "
333 << "'" << F.getName() << "':"
334 << "\n";
335 AM.getResult<BlockFrequencyAnalysis>(F).print(OS);
336 return PreservedAnalyses::all();
337}