213       SCCMap(std::move(G.SCCMap)),  in LazyCallGraph()
232   SCCMap = std::move(G.SCCMap);  in operator =()
713       G->SCCMap[N] = &TargetSCC;  in switchInternalEdgeToCall()
796     G->SCCMap.erase(N);  in switchInternalEdgeToRef()
809   G->SCCMap[&TargetN] = &OldSCC;  in switchInternalEdgeToRef()
841           assert(!G->SCCMap.count(&ChildN) &&  in switchInternalEdgeToRef()
865               G->SCCMap[&N] = &OldSCC;  in switchInternalEdgeToRef()
915         G->SCCMap[&N] = NewSCCs.back();  in switchInternalEdgeToRef()
1113         G->SCCMap[&N] = &InnerC;  in insertIncomingRefEdge()
1489   assert(SCCMap.empty() &&  in insertEdge()
1496   assert(SCCMap.empty() &&  in removeEdge()
1526   if (SCCMap.empty()) {  in removeDeadFunction()
1535   auto CI = SCCMap.find(&N);  in removeDeadFunction()
1536   assert(CI != SCCMap.end() &&  in removeDeadFunction()
1539   SCCMap.erase(CI);  in removeDeadFunction()
1686   SCCMap[&NewN] = NewC;  in addSplitFunction()
1756     SCCMap[&NewN] = NewC;  in addSplitRefRecursiveFunctions()
1918           SCCMap[&N] = RC.SCCs.back();  in buildSCCs()