Searched refs:LazyCallGraph (Results 1 - 9 of 9) sorted by relevance
/external/llvm/lib/Analysis/ |
H A D | CGSCCPassManager.cpp | 16 template class PassManager<LazyCallGraph::SCC>; 17 template class AnalysisManager<LazyCallGraph::SCC>; 20 LazyCallGraph::SCC>; 22 LazyCallGraph::SCC>;
|
H A D | LazyCallGraph.cpp | 1 //===- LazyCallGraph.cpp - Analysis of a Module's call graph --------------===// 10 #include "llvm/Analysis/LazyCallGraph.h" 23 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, 25 LazyCallGraph::Edge::Kind EK) { 39 Edges.emplace_back(LazyCallGraph::Edge(F, EK)); 45 SmallVectorImpl<LazyCallGraph::Edge> &Edges, 51 addEdge(Edges, EdgeIndexMap, *F, LazyCallGraph::Edge::Ref); 61 LazyCallGraph::Node::Node(LazyCallGraph &G, Function &F) 81 addEdge(Edges, EdgeIndexMap, *Callee, LazyCallGraph 126 LazyCallGraph::LazyCallGraph(Module &M) : NextDFSNumber(0) { function in class:LazyCallGraph 153 LazyCallGraph::LazyCallGraph(LazyCallGraph &&G) function in class:LazyCallGraph [all...] |
/external/llvm/unittests/Analysis/ |
H A D | LazyCallGraphTest.cpp | 10 #include "llvm/Analysis/LazyCallGraph.h" 126 LazyCallGraph CG(*M); 132 LazyCallGraph::Node &A1 = (I++)->getNode(CG); 134 LazyCallGraph::Node &A2 = (I++)->getNode(CG); 136 LazyCallGraph::Node &A3 = (I++)->getNode(CG); 138 LazyCallGraph::Node &B1 = (I++)->getNode(CG); 140 LazyCallGraph::Node &B2 = (I++)->getNode(CG); 142 LazyCallGraph::Node &B3 = (I++)->getNode(CG); 144 LazyCallGraph::Node &C1 = (I++)->getNode(CG); 146 LazyCallGraph [all...] |
H A D | CGSCCPassManagerTest.cpp | 11 #include "llvm/Analysis/LazyCallGraph.h" 62 Result run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM) { 152 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM) { 168 for (LazyCallGraph::Node &N : C) 176 for (LazyCallGraph::Node &N : C) {
|
/external/llvm/include/llvm/Analysis/ |
H A D | LazyCallGraph.h | 1 //===- LazyCallGraph.h - Analysis of a Module's call graph ------*- C++ -*-===// 31 /// see the documentation of the \c LazyCallGraph below. 102 /// FIXME: This class is named LazyCallGraph in a lame attempt to distinguish 105 class LazyCallGraph { class in namespace:llvm 176 Node &getNode(LazyCallGraph &G); 179 friend class LazyCallGraph::Node; 195 friend class LazyCallGraph; 196 friend class LazyCallGraph::SCC; 198 LazyCallGraph *G; 212 Node(LazyCallGraph [all...] |
H A D | CGSCCPassManager.h | 24 #include "llvm/Analysis/LazyCallGraph.h" 29 extern template class PassManager<LazyCallGraph::SCC>; 35 typedef PassManager<LazyCallGraph::SCC> CGSCCPassManager; 37 extern template class AnalysisManager<LazyCallGraph::SCC>; 44 typedef AnalysisManager<LazyCallGraph::SCC> CGSCCAnalysisManager; 52 LazyCallGraph::SCC>; 54 typedef OuterAnalysisManagerProxy<ModuleAnalysisManager, LazyCallGraph::SCC> 62 /// manager as it uses the LazyCallGraph analysis. It will also run the 98 LazyCallGraph &CG = AM.getResult<LazyCallGraphAnalysis>(M); 101 for (LazyCallGraph [all...] |
/external/llvm/include/llvm/Transforms/IPO/ |
H A D | FunctionAttrs.h | 17 #include "llvm/Analysis/LazyCallGraph.h" 33 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM);
|
/external/llvm/lib/Passes/ |
H A D | PassBuilder.cpp | 35 #include "llvm/Analysis/LazyCallGraph.h" 145 PreservedAnalyses run(LazyCallGraph::SCC &C, 146 AnalysisManager<LazyCallGraph::SCC> &) { 159 Result run(LazyCallGraph::SCC &, AnalysisManager<LazyCallGraph::SCC> &) {
|
/external/llvm/lib/Transforms/IPO/ |
H A D | FunctionAttrs.cpp | 987 PreservedAnalyses PostOrderFunctionAttrsPass::run(LazyCallGraph::SCC &C, 1003 for (LazyCallGraph::Node &N : C) {
|
Completed in 413 milliseconds