Searched refs:LazyCallGraph (Results 1 - 7 of 7) sorted by relevance

/external/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h1 //===- LazyCallGraph.h - Analysis of a Module's call graph ------*- C++ -*-===//
31 /// see the documentation of the \c LazyCallGraph below.
100 /// FIXME: This class is named LazyCallGraph in a lame attempt to distinguish
103 class LazyCallGraph { class in namespace:llvm
119 friend class LazyCallGraph;
120 friend class LazyCallGraph::Node;
122 LazyCallGraph *G;
126 iterator(LazyCallGraph &G, NodeVectorImplT::iterator NI,
161 friend class LazyCallGraph;
162 friend class LazyCallGraph
[all...]
H A DCGSCCPassManager.h25 #include "llvm/Analysis/LazyCallGraph.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>(
73 CGSCCAnalysisManager, LazyCallGraph::SCC *> {
75 LazyCallGraph::SCC *>;
77 LazyCallGraph::SCC *> BaseT;
113 ResultConceptT &getResultImpl(void *PassID, LazyCallGraph::SCC *C);
117 LazyCallGraph
[all...]
/external/llvm/unittests/Analysis/
H A DLazyCallGraphTest.cpp10 #include "llvm/Analysis/LazyCallGraph.h"
125 LazyCallGraph CG(*M);
131 LazyCallGraph::Node &A1 = *I++;
133 LazyCallGraph::Node &A2 = *I++;
135 LazyCallGraph::Node &A3 = *I++;
137 LazyCallGraph::Node &B1 = *I++;
139 LazyCallGraph::Node &B2 = *I++;
141 LazyCallGraph::Node &B3 = *I++;
143 LazyCallGraph::Node &C1 = *I++;
145 LazyCallGraph
[all...]
/external/llvm/lib/Analysis/
H A DCGSCCPassManager.cpp20 PreservedAnalyses CGSCCPassManager::run(LazyCallGraph::SCC *C,
56 CGSCCAnalysisManager::getResultImpl(void *PassID, LazyCallGraph::SCC *C) {
75 LazyCallGraph::SCC *C) const {
81 void CGSCCAnalysisManager::invalidateImpl(void *PassID, LazyCallGraph::SCC *C) {
90 void CGSCCAnalysisManager::invalidateImpl(LazyCallGraph::SCC *C,
143 FunctionAnalysisManagerCGSCCProxy::run(LazyCallGraph::SCC *C) {
155 LazyCallGraph::SCC *C, const PreservedAnalyses &PA) {
H A DLazyCallGraph.cpp1 //===- LazyCallGraph.cpp - Analysis of a Module's call graph --------------===//
10 #include "llvm/Analysis/LazyCallGraph.h"
25 SmallVectorImpl<PointerUnion<Function *, LazyCallGraph::Node *>> &Callees,
56 LazyCallGraph::Node::Node(LazyCallGraph &G, Function &F)
78 void LazyCallGraph::Node::insertEdgeInternal(Function &Callee) {
86 void LazyCallGraph::Node::insertEdgeInternal(Node &CalleeN) {
91 void LazyCallGraph::Node::removeEdgeInternal(Function &Callee) {
100 LazyCallGraph::LazyCallGraph(Modul function in class:LazyCallGraph
133 LazyCallGraph::LazyCallGraph(LazyCallGraph &&G) function in class:LazyCallGraph
[all...]
H A DAndroid.mk31 LazyCallGraph.cpp \
/external/llvm/tools/opt/
H A DPasses.cpp19 #include "llvm/Analysis/LazyCallGraph.h"
37 PreservedAnalyses run(LazyCallGraph::SCC *C) {

Completed in 2546 milliseconds