1 //===- PassManager.h - Infrastructure for managing & running IR passes ----===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 #include "llvm/IR/PassManager.h"
11 #include "llvm/ADT/STLExtras.h"
15 PreservedAnalyses ModulePassManager::run(Module *M) {
16 PreservedAnalyses PA = PreservedAnalyses::all();
17 for (unsigned Idx = 0, Size = Passes.size(); Idx != Size; ++Idx) {
18 PreservedAnalyses PassPA = Passes[Idx]->run(M);
20 AM->invalidate(M, PassPA);
21 PA.intersect(llvm_move(PassPA));
26 void ModuleAnalysisManager::invalidate(Module *M, const PreservedAnalyses &PA) {
27 // FIXME: This is a total hack based on the fact that erasure doesn't
28 // invalidate iteration for DenseMap.
29 for (ModuleAnalysisResultMapT::iterator I = ModuleAnalysisResults.begin(),
30 E = ModuleAnalysisResults.end();
32 if (!PA.preserved(I->first) && I->second->invalidate(M))
33 ModuleAnalysisResults.erase(I);
36 const detail::AnalysisResultConcept<Module> &
37 ModuleAnalysisManager::getResultImpl(void *PassID, Module *M) {
38 ModuleAnalysisResultMapT::iterator RI;
40 llvm::tie(RI, Inserted) = ModuleAnalysisResults.insert(std::make_pair(
41 PassID, polymorphic_ptr<detail::AnalysisResultConcept<Module> >()));
44 // We don't have a cached result for this result. Look up the pass and run
45 // it to produce a result, which we then add to the cache.
46 ModuleAnalysisPassMapT::const_iterator PI =
47 ModuleAnalysisPasses.find(PassID);
48 assert(PI != ModuleAnalysisPasses.end() &&
49 "Analysis passes must be registered prior to being queried!");
50 RI->second = PI->second->run(M);
56 void ModuleAnalysisManager::invalidateImpl(void *PassID, Module *M) {
57 ModuleAnalysisResults.erase(PassID);
60 PreservedAnalyses FunctionPassManager::run(Function *F) {
61 PreservedAnalyses PA = PreservedAnalyses::all();
62 for (unsigned Idx = 0, Size = Passes.size(); Idx != Size; ++Idx) {
63 PreservedAnalyses PassPA = Passes[Idx]->run(F);
65 AM->invalidate(F, PassPA);
66 PA.intersect(llvm_move(PassPA));
71 void FunctionAnalysisManager::invalidate(Function *F, const PreservedAnalyses &PA) {
72 // Clear all the invalidated results associated specifically with this
74 SmallVector<void *, 8> InvalidatedPassIDs;
75 FunctionAnalysisResultListT &ResultsList = FunctionAnalysisResultLists[F];
76 for (FunctionAnalysisResultListT::iterator I = ResultsList.begin(),
77 E = ResultsList.end();
79 if (!PA.preserved(I->first) && I->second->invalidate(F)) {
80 InvalidatedPassIDs.push_back(I->first);
81 I = ResultsList.erase(I);
85 while (!InvalidatedPassIDs.empty())
86 FunctionAnalysisResults.erase(
87 std::make_pair(InvalidatedPassIDs.pop_back_val(), F));
90 const detail::AnalysisResultConcept<Function> &
91 FunctionAnalysisManager::getResultImpl(void *PassID, Function *F) {
92 FunctionAnalysisResultMapT::iterator RI;
94 llvm::tie(RI, Inserted) = FunctionAnalysisResults.insert(std::make_pair(
95 std::make_pair(PassID, F), FunctionAnalysisResultListT::iterator()));
98 // We don't have a cached result for this result. Look up the pass and run
99 // it to produce a result, which we then add to the cache.
100 FunctionAnalysisPassMapT::const_iterator PI =
101 FunctionAnalysisPasses.find(PassID);
102 assert(PI != FunctionAnalysisPasses.end() &&
103 "Analysis passes must be registered prior to being queried!");
104 FunctionAnalysisResultListT &ResultList = FunctionAnalysisResultLists[F];
105 ResultList.push_back(std::make_pair(PassID, PI->second->run(F)));
106 RI->second = llvm::prior(ResultList.end());
109 return *RI->second->second;
112 void FunctionAnalysisManager::invalidateImpl(void *PassID, Function *F) {
113 FunctionAnalysisResultMapT::iterator RI =
114 FunctionAnalysisResults.find(std::make_pair(PassID, F));
115 if (RI == FunctionAnalysisResults.end())
118 FunctionAnalysisResultLists[F].erase(RI->second);