Line data Source code
1 : //===- LazyBranchProbabilityInfo.cpp - Lazy Branch Probability Analysis ---===//
2 : //
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 : // This is an alternative analysis pass to BranchProbabilityInfoWrapperPass.
11 : // The difference is that with this pass the branch probabilities are not
12 : // computed when the analysis pass is executed but rather when the BPI results
13 : // is explicitly requested by the analysis client.
14 : //
15 : //===----------------------------------------------------------------------===//
16 :
17 : #include "llvm/Analysis/LazyBranchProbabilityInfo.h"
18 : #include "llvm/Analysis/LoopInfo.h"
19 : #include "llvm/Analysis/TargetLibraryInfo.h"
20 : #include "llvm/IR/Dominators.h"
21 :
22 : using namespace llvm;
23 :
24 : #define DEBUG_TYPE "lazy-branch-prob"
25 :
26 61371 : INITIALIZE_PASS_BEGIN(LazyBranchProbabilityInfoPass, DEBUG_TYPE,
27 : "Lazy Branch Probability Analysis", true, true)
28 61371 : INITIALIZE_PASS_DEPENDENCY(LoopInfoWrapperPass)
29 61371 : INITIALIZE_PASS_DEPENDENCY(TargetLibraryInfoWrapperPass)
30 221387 : INITIALIZE_PASS_END(LazyBranchProbabilityInfoPass, DEBUG_TYPE,
31 : "Lazy Branch Probability Analysis", true, true)
32 :
33 : char LazyBranchProbabilityInfoPass::ID = 0;
34 :
35 26518 : LazyBranchProbabilityInfoPass::LazyBranchProbabilityInfoPass()
36 26518 : : FunctionPass(ID) {
37 26518 : initializeLazyBranchProbabilityInfoPassPass(*PassRegistry::getPassRegistry());
38 26518 : }
39 :
40 32 : void LazyBranchProbabilityInfoPass::print(raw_ostream &OS,
41 : const Module *) const {
42 32 : LBPI->getCalculated().print(OS);
43 32 : }
44 :
45 26521 : void LazyBranchProbabilityInfoPass::getAnalysisUsage(AnalysisUsage &AU) const {
46 : // We require DT so it's available when LI is available. The LI updating code
47 : // asserts that DT is also present so if we don't make sure that we have DT
48 : // here, that assert will trigger.
49 : AU.addRequired<DominatorTreeWrapperPass>();
50 : AU.addRequired<LoopInfoWrapperPass>();
51 : AU.addRequired<TargetLibraryInfoWrapperPass>();
52 : AU.setPreservesAll();
53 26521 : }
54 :
55 468603 : void LazyBranchProbabilityInfoPass::releaseMemory() { LBPI.reset(); }
56 :
57 468647 : bool LazyBranchProbabilityInfoPass::runOnFunction(Function &F) {
58 468647 : LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
59 468647 : TargetLibraryInfo &TLI = getAnalysis<TargetLibraryInfoWrapperPass>().getTLI();
60 468647 : LBPI = llvm::make_unique<LazyBranchProbabilityInfo>(&F, &LI, &TLI);
61 468647 : return false;
62 : }
63 :
64 54798 : void LazyBranchProbabilityInfoPass::getLazyBPIAnalysisUsage(AnalysisUsage &AU) {
65 : AU.addRequired<LazyBranchProbabilityInfoPass>();
66 : AU.addRequired<LoopInfoWrapperPass>();
67 : AU.addRequired<TargetLibraryInfoWrapperPass>();
68 54798 : }
69 :
70 122742 : void llvm::initializeLazyBPIPassPass(PassRegistry &Registry) {
71 122742 : INITIALIZE_PASS_DEPENDENCY(LazyBranchProbabilityInfoPass);
72 122742 : INITIALIZE_PASS_DEPENDENCY(LoopInfoWrapperPass);
73 122742 : INITIALIZE_PASS_DEPENDENCY(TargetLibraryInfoWrapperPass);
74 122742 : }
|