210       SCCMap(std::move(G.SCCMap)), LibFunctions(std::move(G.LibFunctions)) {  in LazyCallGraph()
227   SCCMap = std::move(G.SCCMap);  in operator =()
704       G->SCCMap[N] = &TargetSCC;  in switchInternalEdgeToCall()
783     G->SCCMap.erase(N);  in switchInternalEdgeToRef()
796   G->SCCMap[&TargetN] = &OldSCC;  in switchInternalEdgeToRef()
826           assert(!G->SCCMap.count(&ChildN) &&  in switchInternalEdgeToRef()
850               G->SCCMap[&N] = &OldSCC;  in switchInternalEdgeToRef()
900         G->SCCMap[&N] = NewSCCs.back();  in switchInternalEdgeToRef()
1098         G->SCCMap[&N] = &InnerC;  in insertIncomingRefEdge()
1479   assert(SCCMap.empty() &&  in insertEdge()
1486   assert(SCCMap.empty() &&  in removeEdge()
1514   auto CI = SCCMap.find(&N);  in removeDeadFunction()
1515   assert(CI != SCCMap.end() &&  in removeDeadFunction()
1543   SCCMap.erase(CI);  in removeDeadFunction()
1683   SCCMap[&NewN] = NewC;  in addSplitFunction()
1753     SCCMap[&NewN] = NewC;  in addSplitRefRecursiveFunctions()
1913           SCCMap[&N] = RC.SCCs.back();  in buildSCCs()