Searched refs:LazyCallGraph (Results 1 – 8 of 8) sorted by relevance
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 …]
103 class LazyCallGraph {119 friend class LazyCallGraph; variable120 friend class LazyCallGraph::Node;122 LazyCallGraph *G;126 iterator(LazyCallGraph &G, NodeVectorImplT::iterator NI, in iterator()161 friend class LazyCallGraph; variable162 friend class LazyCallGraph::SCC;164 LazyCallGraph *G;177 Node(LazyCallGraph &G, Function &F);189 typedef LazyCallGraph::iterator iterator;[all …]
34 typedef PassManager<LazyCallGraph::SCC> CGSCCPassManager;42 typedef AnalysisManager<LazyCallGraph::SCC> CGSCCAnalysisManager;151 bool invalidate(LazyCallGraph::SCC &) { return false; } in invalidate()178 Result run(LazyCallGraph::SCC &) { return Result(*MAM); } in run()226 LazyCallGraph &CG = AM->getResult<LazyCallGraphAnalysis>(M); in run()229 for (LazyCallGraph::SCC &C : CG.postorder_sccs()) { in run()305 bool invalidate(LazyCallGraph::SCC &C, const PreservedAnalyses &PA);339 Result run(LazyCallGraph::SCC &C);442 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager *AM) { in run()449 for (LazyCallGraph::Node *N : C) { in run()
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 LazyCallGraph133 LazyCallGraph::LazyCallGraph(LazyCallGraph &&G) in LazyCallGraph() function in LazyCallGraph144 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 …]
48 FunctionAnalysisManagerCGSCCProxy::run(LazyCallGraph::SCC &C) { in run()60 LazyCallGraph::SCC &C, const PreservedAnalyses &PA) { in invalidate()
37 LazyCallGraph.cpp
39 LazyCallGraph.cpp \
64 PreservedAnalyses run(LazyCallGraph::SCC &C) { in run()73 Result run(LazyCallGraph::SCC &) { return Result(); } in run()