mirror of
https://github.com/RPCSX/llvm.git
synced 2024-12-22 20:18:38 +00:00
b17a45cae0
Summary: The motivation is the same as in D22141: In order to add the hotness attribute to optimization remarks we need BFI to be available in all passes that emit optimization remarks. BFI depends on BPI so unless we make this lazy as well we would still compute BPI unconditionally. The solution is to use the new LazyBPI pass in LazyBFI and only compute BPI when computation of BFI is requested by the client. I extended the laziness test using a LoopDistribute test to also cover BPI. Reviewers: hfinkel, davidxl Subscribers: llvm-commits Differential Revision: https://reviews.llvm.org/D22835 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@277083 91177308-0d34-0410-b5e6-96231b3b80d8
64 lines
2.3 KiB
C++
64 lines
2.3 KiB
C++
//===- LazyBranchProbabilityInfo.cpp - Lazy Branch Probability Analysis ---===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This is an alternative analysis pass to BranchProbabilityInfoWrapperPass.
|
|
// The difference is that with this pass the branch probabilities are not
|
|
// computed when the analysis pass is executed but rather when the BPI results
|
|
// is explicitly requested by the analysis client.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/Analysis/LazyBranchProbabilityInfo.h"
|
|
#include "llvm/Analysis/LoopInfo.h"
|
|
|
|
using namespace llvm;
|
|
|
|
#define DEBUG_TYPE "lazy-branch-prob"
|
|
|
|
INITIALIZE_PASS_BEGIN(LazyBranchProbabilityInfoPass, DEBUG_TYPE,
|
|
"Lazy Branch Probability Analysis", true, true)
|
|
INITIALIZE_PASS_DEPENDENCY(LoopInfoWrapperPass)
|
|
INITIALIZE_PASS_END(LazyBranchProbabilityInfoPass, DEBUG_TYPE,
|
|
"Lazy Branch Probability Analysis", true, true)
|
|
|
|
char LazyBranchProbabilityInfoPass::ID = 0;
|
|
|
|
LazyBranchProbabilityInfoPass::LazyBranchProbabilityInfoPass()
|
|
: FunctionPass(ID) {
|
|
initializeLazyBranchProbabilityInfoPassPass(*PassRegistry::getPassRegistry());
|
|
}
|
|
|
|
void LazyBranchProbabilityInfoPass::print(raw_ostream &OS,
|
|
const Module *) const {
|
|
LBPI->getCalculated().print(OS);
|
|
}
|
|
|
|
void LazyBranchProbabilityInfoPass::getAnalysisUsage(AnalysisUsage &AU) const {
|
|
AU.addRequired<LoopInfoWrapperPass>();
|
|
AU.setPreservesAll();
|
|
}
|
|
|
|
void LazyBranchProbabilityInfoPass::releaseMemory() { LBPI.reset(); }
|
|
|
|
bool LazyBranchProbabilityInfoPass::runOnFunction(Function &F) {
|
|
LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
|
|
LBPI = llvm::make_unique<LazyBranchProbabilityInfo>(&F, &LI);
|
|
return false;
|
|
}
|
|
|
|
void LazyBranchProbabilityInfoPass::getLazyBPIAnalysisUsage(AnalysisUsage &AU) {
|
|
AU.addRequired<LazyBranchProbabilityInfoPass>();
|
|
AU.addRequired<LoopInfoWrapperPass>();
|
|
}
|
|
|
|
void llvm::initializeLazyBPIPassPass(PassRegistry &Registry) {
|
|
INITIALIZE_PASS_DEPENDENCY(LazyBranchProbabilityInfoPass);
|
|
INITIALIZE_PASS_DEPENDENCY(LoopInfoWrapperPass);
|
|
}
|