mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-19 11:02:59 +02:00
ae65e281f3
to reflect the new license. We understand that people may be surprised that we're moving the header entirely to discuss the new license. We checked this carefully with the Foundation's lawyer and we believe this is the correct approach. Essentially, all code in the project is now made available by the LLVM project under our new license, so you will see that the license headers include that license only. Some of our contributors have contributed code under our old license, and accordingly, we have retained a copy of our old license notice in the top-level files in each project and repository. llvm-svn: 351636
72 lines
2.8 KiB
C++
72 lines
2.8 KiB
C++
//===- LazyBlockFrequencyInfo.cpp - Lazy Block Frequency Analysis ---------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This is an alternative analysis pass to BlockFrequencyInfoWrapperPass. The
|
|
// difference is that with this pass the block frequencies are not computed when
|
|
// the analysis pass is executed but rather when the BFI result is explicitly
|
|
// requested by the analysis client.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/Analysis/LazyBlockFrequencyInfo.h"
|
|
#include "llvm/Analysis/LazyBranchProbabilityInfo.h"
|
|
#include "llvm/Analysis/LoopInfo.h"
|
|
#include "llvm/IR/Dominators.h"
|
|
|
|
using namespace llvm;
|
|
|
|
#define DEBUG_TYPE "lazy-block-freq"
|
|
|
|
INITIALIZE_PASS_BEGIN(LazyBlockFrequencyInfoPass, DEBUG_TYPE,
|
|
"Lazy Block Frequency Analysis", true, true)
|
|
INITIALIZE_PASS_DEPENDENCY(LazyBPIPass)
|
|
INITIALIZE_PASS_DEPENDENCY(LoopInfoWrapperPass)
|
|
INITIALIZE_PASS_END(LazyBlockFrequencyInfoPass, DEBUG_TYPE,
|
|
"Lazy Block Frequency Analysis", true, true)
|
|
|
|
char LazyBlockFrequencyInfoPass::ID = 0;
|
|
|
|
LazyBlockFrequencyInfoPass::LazyBlockFrequencyInfoPass() : FunctionPass(ID) {
|
|
initializeLazyBlockFrequencyInfoPassPass(*PassRegistry::getPassRegistry());
|
|
}
|
|
|
|
void LazyBlockFrequencyInfoPass::print(raw_ostream &OS, const Module *) const {
|
|
LBFI.getCalculated().print(OS);
|
|
}
|
|
|
|
void LazyBlockFrequencyInfoPass::getAnalysisUsage(AnalysisUsage &AU) const {
|
|
LazyBranchProbabilityInfoPass::getLazyBPIAnalysisUsage(AU);
|
|
// We require DT so it's available when LI is available. The LI updating code
|
|
// asserts that DT is also present so if we don't make sure that we have DT
|
|
// here, that assert will trigger.
|
|
AU.addRequired<DominatorTreeWrapperPass>();
|
|
AU.addRequired<LoopInfoWrapperPass>();
|
|
AU.setPreservesAll();
|
|
}
|
|
|
|
void LazyBlockFrequencyInfoPass::releaseMemory() { LBFI.releaseMemory(); }
|
|
|
|
bool LazyBlockFrequencyInfoPass::runOnFunction(Function &F) {
|
|
auto &BPIPass = getAnalysis<LazyBranchProbabilityInfoPass>();
|
|
LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
|
|
LBFI.setAnalysis(&F, &BPIPass, &LI);
|
|
return false;
|
|
}
|
|
|
|
void LazyBlockFrequencyInfoPass::getLazyBFIAnalysisUsage(AnalysisUsage &AU) {
|
|
LazyBranchProbabilityInfoPass::getLazyBPIAnalysisUsage(AU);
|
|
AU.addRequired<LazyBlockFrequencyInfoPass>();
|
|
AU.addRequired<LoopInfoWrapperPass>();
|
|
}
|
|
|
|
void llvm::initializeLazyBFIPassPass(PassRegistry &Registry) {
|
|
initializeLazyBPIPassPass(Registry);
|
|
INITIALIZE_PASS_DEPENDENCY(LazyBlockFrequencyInfoPass);
|
|
INITIALIZE_PASS_DEPENDENCY(LoopInfoWrapperPass);
|
|
}
|