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()
180 void LazyCallGraph::SCC::insertIntraSCCEdge(Node &CallerN, Node &CalleeN) {  in insertIntraSCCEdge()
190 void LazyCallGraph::SCC::insertOutgoingEdge(Node &CallerN, Node &CalleeN) {  in insertOutgoingEdge()
205 SmallVector<LazyCallGraph::SCC *, 1>
206 LazyCallGraph::SCC::insertIncomingEdge(Node &CallerN, Node &CalleeN) {  in insertIncomingEdge()
324 void LazyCallGraph::SCC::removeInterSCCEdge(Node &CallerN, Node &CalleeN) {  in removeInterSCCEdge()
377 void LazyCallGraph::SCC::internalDFS(  in internalDFS()
456 SmallVector<LazyCallGraph::SCC *, 1>
457 LazyCallGraph::SCC::removeIntraSCCEdge(Node &CallerN,  in removeIntraSCCEdge()
531 void LazyCallGraph::insertEdge(Node &CallerN, Function &Callee) {  in insertEdge()
538 void LazyCallGraph::removeEdge(Node &CallerN, Function &Callee) {  in removeEdge()
545 LazyCallGraph::Node &LazyCallGraph::insertInto(Function &F, Node *&MappedN) {  in insertInto()
549 void LazyCallGraph::updateGraphPtrs() {  in updateGraphPtrs()
580 LazyCallGraph::SCC *LazyCallGraph::formSCC(Node *RootN,  in formSCC()
614 LazyCallGraph::SCC *LazyCallGraph::getNextSCCInPostOrder() {  in getNextSCCInPostOrder()
687 static void printNodes(raw_ostream &OS, LazyCallGraph::Node &N,  in printNodes()
688                        SmallPtrSetImpl<LazyCallGraph::Node *> &Printed) {  in printNodes()
690   for (LazyCallGraph::Node &ChildN : N)  in printNodes()
695   for (LazyCallGraph::iterator I = N.begin(), E = N.end(); I != E; ++I)  in printNodes()
701 static void printSCC(raw_ostream &OS, LazyCallGraph::SCC &SCC) {  in printSCC()
705   for (LazyCallGraph::Node *N : SCC)  in printSCC()
713   LazyCallGraph &G = AM->getResult<LazyCallGraphAnalysis>(M);  in run()
718   SmallPtrSet<LazyCallGraph::Node *, 16> Printed;  in run()
719   for (LazyCallGraph::Node &N : G)  in run()
723   for (LazyCallGraph::SCC &SCC : G.postorder_sccs())  in run()