215       SCCMap(std::move(G.SCCMap)),  in LazyCallGraph()
233   SCCMap = std::move(G.SCCMap);  in operator =()
714       G->SCCMap[N] = &TargetSCC;  in switchInternalEdgeToCall()
797     G->SCCMap.erase(N);  in switchInternalEdgeToRef()
810   G->SCCMap[&TargetN] = &OldSCC;  in switchInternalEdgeToRef()
842           assert(!G->SCCMap.count(&ChildN) &&  in switchInternalEdgeToRef()
866               G->SCCMap[&N] = &OldSCC;  in switchInternalEdgeToRef()
916         G->SCCMap[&N] = NewSCCs.back();  in switchInternalEdgeToRef()
1114         G->SCCMap[&N] = &InnerC;  in insertIncomingRefEdge()
1490   assert(SCCMap.empty() &&  in insertEdge()
1497   assert(SCCMap.empty() &&  in removeEdge()
1529   auto CI = SCCMap.find(&N);  in removeDeadFunction()
1530   assert(CI != SCCMap.end() &&  in removeDeadFunction()
1533   SCCMap.erase(CI);  in removeDeadFunction()
1674   SCCMap[&NewN] = NewC;  in addSplitFunction()
1744     SCCMap[&NewN] = NewC;  in addSplitRefRecursiveFunctions()
1906           SCCMap[&N] = RC.SCCs.back();  in buildSCCs()