mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-03-06 05:33:28 +00:00
proxy. This lets a function pass query a module analysis manager. However, the interface is const to indicate that only cached results can be safely queried. With this, I think the new pass manager is largely functionally complete for modules and analyses. Still lots to test, and need to generalize to SCCs and Loops, and need to build an adaptor layer to support the use of existing Pass objects in the new managers. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@195538 91177308-0d34-0410-b5e6-96231b3b80d8
175 lines
6.3 KiB
C++
175 lines
6.3 KiB
C++
//===- PassManager.h - Infrastructure for managing & running IR passes ----===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/IR/PassManager.h"
|
|
#include "llvm/ADT/STLExtras.h"
|
|
|
|
using namespace llvm;
|
|
|
|
PreservedAnalyses ModulePassManager::run(Module *M, ModuleAnalysisManager *AM) {
|
|
PreservedAnalyses PA = PreservedAnalyses::all();
|
|
for (unsigned Idx = 0, Size = Passes.size(); Idx != Size; ++Idx) {
|
|
PreservedAnalyses PassPA = Passes[Idx]->run(M, AM);
|
|
if (AM)
|
|
AM->invalidate(M, PassPA);
|
|
PA.intersect(llvm_move(PassPA));
|
|
}
|
|
return PA;
|
|
}
|
|
|
|
void ModuleAnalysisManager::invalidate(Module *M, const PreservedAnalyses &PA) {
|
|
// FIXME: This is a total hack based on the fact that erasure doesn't
|
|
// invalidate iteration for DenseMap.
|
|
for (ModuleAnalysisResultMapT::iterator I = ModuleAnalysisResults.begin(),
|
|
E = ModuleAnalysisResults.end();
|
|
I != E; ++I)
|
|
if (I->second->invalidate(M, PA))
|
|
ModuleAnalysisResults.erase(I);
|
|
}
|
|
|
|
const detail::AnalysisResultConcept<Module *> &
|
|
ModuleAnalysisManager::getResultImpl(void *PassID, Module *M) {
|
|
ModuleAnalysisResultMapT::iterator RI;
|
|
bool Inserted;
|
|
llvm::tie(RI, Inserted) = ModuleAnalysisResults.insert(std::make_pair(
|
|
PassID, polymorphic_ptr<detail::AnalysisResultConcept<Module *> >()));
|
|
|
|
if (Inserted) {
|
|
// We don't have a cached result for this result. Look up the pass and run
|
|
// it to produce a result, which we then add to the cache.
|
|
ModuleAnalysisPassMapT::const_iterator PI =
|
|
ModuleAnalysisPasses.find(PassID);
|
|
assert(PI != ModuleAnalysisPasses.end() &&
|
|
"Analysis passes must be registered prior to being queried!");
|
|
RI->second = PI->second->run(M, this);
|
|
}
|
|
|
|
return *RI->second;
|
|
}
|
|
|
|
const detail::AnalysisResultConcept<Module *> *
|
|
ModuleAnalysisManager::getCachedResultImpl(void *PassID, Module *M) const {
|
|
ModuleAnalysisResultMapT::const_iterator RI = ModuleAnalysisResults.find(PassID);
|
|
return RI == ModuleAnalysisResults.end() ? 0 : &*RI->second;
|
|
}
|
|
|
|
void ModuleAnalysisManager::invalidateImpl(void *PassID, Module *M) {
|
|
ModuleAnalysisResults.erase(PassID);
|
|
}
|
|
|
|
PreservedAnalyses FunctionPassManager::run(Function *F, FunctionAnalysisManager *AM) {
|
|
PreservedAnalyses PA = PreservedAnalyses::all();
|
|
for (unsigned Idx = 0, Size = Passes.size(); Idx != Size; ++Idx) {
|
|
PreservedAnalyses PassPA = Passes[Idx]->run(F, AM);
|
|
if (AM)
|
|
AM->invalidate(F, PassPA);
|
|
PA.intersect(llvm_move(PassPA));
|
|
}
|
|
return PA;
|
|
}
|
|
|
|
void FunctionAnalysisManager::invalidate(Function *F, const PreservedAnalyses &PA) {
|
|
// Clear all the invalidated results associated specifically with this
|
|
// function.
|
|
SmallVector<void *, 8> InvalidatedPassIDs;
|
|
FunctionAnalysisResultListT &ResultsList = FunctionAnalysisResultLists[F];
|
|
for (FunctionAnalysisResultListT::iterator I = ResultsList.begin(),
|
|
E = ResultsList.end();
|
|
I != E;)
|
|
if (I->second->invalidate(F, PA)) {
|
|
InvalidatedPassIDs.push_back(I->first);
|
|
I = ResultsList.erase(I);
|
|
} else {
|
|
++I;
|
|
}
|
|
while (!InvalidatedPassIDs.empty())
|
|
FunctionAnalysisResults.erase(
|
|
std::make_pair(InvalidatedPassIDs.pop_back_val(), F));
|
|
}
|
|
|
|
bool FunctionAnalysisManager::empty() const {
|
|
assert(FunctionAnalysisResults.empty() ==
|
|
FunctionAnalysisResultLists.empty() &&
|
|
"The storage and index of analysis results disagree on how many there "
|
|
"are!");
|
|
return FunctionAnalysisResults.empty();
|
|
}
|
|
|
|
void FunctionAnalysisManager::clear() {
|
|
FunctionAnalysisResults.clear();
|
|
FunctionAnalysisResultLists.clear();
|
|
}
|
|
|
|
const detail::AnalysisResultConcept<Function *> &
|
|
FunctionAnalysisManager::getResultImpl(void *PassID, Function *F) {
|
|
FunctionAnalysisResultMapT::iterator RI;
|
|
bool Inserted;
|
|
llvm::tie(RI, Inserted) = FunctionAnalysisResults.insert(std::make_pair(
|
|
std::make_pair(PassID, F), FunctionAnalysisResultListT::iterator()));
|
|
|
|
if (Inserted) {
|
|
// We don't have a cached result for this result. Look up the pass and run
|
|
// it to produce a result, which we then add to the cache.
|
|
FunctionAnalysisPassMapT::const_iterator PI =
|
|
FunctionAnalysisPasses.find(PassID);
|
|
assert(PI != FunctionAnalysisPasses.end() &&
|
|
"Analysis passes must be registered prior to being queried!");
|
|
FunctionAnalysisResultListT &ResultList = FunctionAnalysisResultLists[F];
|
|
ResultList.push_back(std::make_pair(PassID, PI->second->run(F, this)));
|
|
RI->second = llvm::prior(ResultList.end());
|
|
}
|
|
|
|
return *RI->second->second;
|
|
}
|
|
|
|
const detail::AnalysisResultConcept<Function *> *
|
|
FunctionAnalysisManager::getCachedResultImpl(void *PassID, Function *F) const {
|
|
FunctionAnalysisResultMapT::const_iterator RI =
|
|
FunctionAnalysisResults.find(std::make_pair(PassID, F));
|
|
return RI == FunctionAnalysisResults.end() ? 0 : &*RI->second->second;
|
|
}
|
|
|
|
void FunctionAnalysisManager::invalidateImpl(void *PassID, Function *F) {
|
|
FunctionAnalysisResultMapT::iterator RI =
|
|
FunctionAnalysisResults.find(std::make_pair(PassID, F));
|
|
if (RI == FunctionAnalysisResults.end())
|
|
return;
|
|
|
|
FunctionAnalysisResultLists[F].erase(RI->second);
|
|
}
|
|
|
|
char FunctionAnalysisManagerModuleProxy::PassID;
|
|
|
|
FunctionAnalysisManagerModuleProxy::Result
|
|
FunctionAnalysisManagerModuleProxy::run(Module *M) {
|
|
assert(FAM.empty() && "Function analyses ran prior to the module proxy!");
|
|
return Result(FAM);
|
|
}
|
|
|
|
FunctionAnalysisManagerModuleProxy::Result::~Result() {
|
|
// Clear out the analysis manager if we're being destroyed -- it means we
|
|
// didn't even see an invalidate call when we got invalidated.
|
|
FAM.clear();
|
|
}
|
|
|
|
bool FunctionAnalysisManagerModuleProxy::Result::invalidate(
|
|
Module *M, const PreservedAnalyses &PA) {
|
|
// If this proxy isn't marked as preserved, then we can't even invalidate
|
|
// individual function analyses, there may be an invalid set of Function
|
|
// objects in the cache making it impossible to incrementally preserve them.
|
|
// Just clear the entire manager.
|
|
if (!PA.preserved(ID()))
|
|
FAM.clear();
|
|
|
|
// Return false to indicate that this result is still a valid proxy.
|
|
return false;
|
|
}
|
|
|
|
char ModuleAnalysisManagerFunctionProxy::PassID;
|