137       SCCMap(std::move(G.SCCMap)), LeafSCCs(std::move(G.LeafSCCs)),  in LazyCallGraph()
150   SCCMap = std::move(G.SCCMap);  in operator =()
162   G->SCCMap[&N] = this;  in insert()
184   assert(G->SCCMap.lookup(&CallerN) == this && "Caller must be in this SCC.");  in insertIntraSCCEdge()
185   assert(G->SCCMap.lookup(&CalleeN) == this && "Callee must be in this SCC.");  in insertIntraSCCEdge()
194   assert(G->SCCMap.lookup(&CallerN) == this && "Caller must be in this SCC.");  in insertOutgoingEdge()
196   SCC &CalleeC = *G->SCCMap.lookup(&CalleeN);  in insertOutgoingEdge()
210   assert(G->SCCMap.lookup(&CalleeN) == this && "Callee must be in this SCC.");  in insertIncomingEdge()
212   SCC &CallerC = *G->SCCMap.lookup(&CallerN);  in insertIncomingEdge()
301         SCC &ChildC = *G->SCCMap.lookup(&ChildN);  in insertIncomingEdge()
305       G->SCCMap[N] = this;  in insertIncomingEdge()
312       SCC &ChildC = *G->SCCMap.lookup(&ChildN);  in insertIncomingEdge()
328   assert(G->SCCMap.lookup(&CallerN) == this &&  in removeInterSCCEdge()
331   SCC &CalleeC = *G->SCCMap.lookup(&CalleeN);  in removeInterSCCEdge()
343       SCC &OtherCalleeC = *G->SCCMap.lookup(&OtherCalleeN);  in removeInterSCCEdge()
392       if (SCC *ChildSCC = G->SCCMap.lookup(&ChildN)) {  in internalDFS()
476     G->SCCMap.erase(N);  in removeIntraSCCEdge()
505       SCC &ChildSCC = *G->SCCMap.lookup(&ChildN);  in removeIntraSCCEdge()
532   assert(SCCMap.empty() && DFSStack.empty() &&  in insertEdge()
539   assert(SCCMap.empty() && DFSStack.empty() &&  in removeEdge()
600       SCC &ChildSCC = *SCCMap.lookup(&SCCChildN);  in formSCC()
648         assert(!SCCMap.count(&ChildN) &&  in getNextSCCInPostOrder()