Searched refs:LazyCallGraph (Results 1 – 8 of 8) sorted by relevance
| /external/llvm/unittests/Analysis/ |
| D | LazyCallGraphTest.cpp | 125 LazyCallGraph CG(*M); in TEST()
131 LazyCallGraph::Node &A1 = *I++; in TEST()
133 LazyCallGraph::Node &A2 = *I++; in TEST()
135 LazyCallGraph::Node &A3 = *I++; in TEST()
137 LazyCallGraph::Node &B1 = *I++; in TEST()
139 LazyCallGraph::Node &B2 = *I++; in TEST()
141 LazyCallGraph::Node &B3 = *I++; in TEST()
143 LazyCallGraph::Node &C1 = *I++; in TEST()
145 LazyCallGraph::Node &C2 = *I++; in TEST()
147 LazyCallGraph::Node &C3 = *I++; in TEST()
[all …]
|
| /external/llvm/include/llvm/Analysis/ |
| D | LazyCallGraph.h | 103 class LazyCallGraph {
119 friend class LazyCallGraph; variable
120 friend class LazyCallGraph::Node;
122 LazyCallGraph *G;
126 iterator(LazyCallGraph &G, NodeVectorImplT::iterator NI, in iterator()
161 friend class LazyCallGraph; variable
162 friend class LazyCallGraph::SCC;
164 LazyCallGraph *G;
177 Node(LazyCallGraph &G, Function &F);
189 typedef LazyCallGraph::iterator iterator;
[all …]
|
| D | CGSCCPassManager.h | 43 PreservedAnalyses run(LazyCallGraph::SCC *C,
54 typedef detail::PassConcept<LazyCallGraph::SCC *, CGSCCAnalysisManager>
58 : detail::PassModel<LazyCallGraph::SCC *, CGSCCAnalysisManager, PassT> {
60 : detail::PassModel<LazyCallGraph::SCC *, CGSCCAnalysisManager, PassT>( in CGSCCPassModel()
73 CGSCCAnalysisManager, LazyCallGraph::SCC *> {
75 LazyCallGraph::SCC *>;
77 LazyCallGraph::SCC *> BaseT;
113 ResultConceptT &getResultImpl(void *PassID, LazyCallGraph::SCC *C);
117 LazyCallGraph::SCC *C) const;
120 void invalidateImpl(void *PassID, LazyCallGraph::SCC *C);
[all …]
|
| /external/llvm/lib/Analysis/ |
| D | LazyCallGraph.cpp | 25 SmallVectorImpl<PointerUnion<Function *, LazyCallGraph::Node *>> &Callees, in findCallees()
56 LazyCallGraph::Node::Node(LazyCallGraph &G, Function &F) in Node()
78 void LazyCallGraph::Node::insertEdgeInternal(Function &Callee) { in insertEdgeInternal()
86 void LazyCallGraph::Node::insertEdgeInternal(Node &CalleeN) { in insertEdgeInternal()
91 void LazyCallGraph::Node::removeEdgeInternal(Function &Callee) { in removeEdgeInternal()
100 LazyCallGraph::LazyCallGraph(Module &M) : NextDFSNumber(0) { in LazyCallGraph() function in LazyCallGraph
133 LazyCallGraph::LazyCallGraph(LazyCallGraph &&G) in LazyCallGraph() function in LazyCallGraph
144 LazyCallGraph &LazyCallGraph::operator=(LazyCallGraph &&G) { in operator =()
159 void LazyCallGraph::SCC::insert(Node &N) { in insert()
165 bool LazyCallGraph::SCC::isDescendantOf(const SCC &C) const { in isDescendantOf()
[all …]
|
| D | CGSCCPassManager.cpp | 20 PreservedAnalyses CGSCCPassManager::run(LazyCallGraph::SCC *C, in run()
56 CGSCCAnalysisManager::getResultImpl(void *PassID, LazyCallGraph::SCC *C) { in getResultImpl()
75 LazyCallGraph::SCC *C) const { in getCachedResultImpl()
81 void CGSCCAnalysisManager::invalidateImpl(void *PassID, LazyCallGraph::SCC *C) { in invalidateImpl()
90 void CGSCCAnalysisManager::invalidateImpl(LazyCallGraph::SCC *C, in invalidateImpl()
143 FunctionAnalysisManagerCGSCCProxy::run(LazyCallGraph::SCC *C) { in run()
155 LazyCallGraph::SCC *C, const PreservedAnalyses &PA) { in invalidate()
|
| D | CMakeLists.txt | 29 LazyCallGraph.cpp
|
| D | Android.mk | 31 LazyCallGraph.cpp \
|
| /external/llvm/tools/opt/ |
| D | Passes.cpp | 37 PreservedAnalyses run(LazyCallGraph::SCC *C) { in run()
|