265 LazyCallGraph::RefSCC::switchInternalEdgeToCall(Node &SourceN, Node &TargetN) {  in switchInternalEdgeToCall()  argument
266   assert(!SourceN[TargetN].isCall() && "Must start with a ref edge!");  in switchInternalEdgeToCall()
270   SCC &SourceSCC = *G->lookupSCC(SourceN);  in switchInternalEdgeToCall()
276     SourceN.setEdgeKind(TargetN.getFunction(), Edge::Call);  in switchInternalEdgeToCall()
293     SourceN.setEdgeKind(TargetN.getFunction(), Edge::Call);  in switchInternalEdgeToCall()
377     SourceN.setEdgeKind(TargetN.getFunction(), Edge::Call);  in switchInternalEdgeToCall()
472   SourceN.setEdgeKind(TargetN.getFunction(), Edge::Call);  in switchInternalEdgeToCall()
481 void LazyCallGraph::RefSCC::switchInternalEdgeToRef(Node &SourceN,  in switchInternalEdgeToRef()  argument
483   assert(SourceN[TargetN].isCall() && "Must start with a call edge!");  in switchInternalEdgeToRef()
485   SCC &SourceSCC = *G->lookupSCC(SourceN);  in switchInternalEdgeToRef()
494   SourceN.setEdgeKind(TargetN.getFunction(), Edge::Ref);  in switchInternalEdgeToRef()
672 void LazyCallGraph::RefSCC::switchOutgoingEdgeToCall(Node &SourceN,  in switchOutgoingEdgeToCall()  argument
674   assert(!SourceN[TargetN].isCall() && "Must start with a ref edge!");  in switchOutgoingEdgeToCall()
676   assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC.");  in switchOutgoingEdgeToCall()
684   SourceN.setEdgeKind(TargetN.getFunction(), Edge::Call);  in switchOutgoingEdgeToCall()
692 void LazyCallGraph::RefSCC::switchOutgoingEdgeToRef(Node &SourceN,  in switchOutgoingEdgeToRef()  argument
694   assert(SourceN[TargetN].isCall() && "Must start with a call edge!");  in switchOutgoingEdgeToRef()
696   assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC.");  in switchOutgoingEdgeToRef()
704   SourceN.setEdgeKind(TargetN.getFunction(), Edge::Ref);  in switchOutgoingEdgeToRef()
712 void LazyCallGraph::RefSCC::insertInternalRefEdge(Node &SourceN,  in insertInternalRefEdge()  argument
714   assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC.");  in insertInternalRefEdge()
717   SourceN.insertEdgeInternal(TargetN, Edge::Ref);  in insertInternalRefEdge()
725 void LazyCallGraph::RefSCC::insertOutgoingEdge(Node &SourceN, Node &TargetN,  in insertOutgoingEdge()  argument
728   SourceN.insertEdgeInternal(TargetN, EK);  in insertOutgoingEdge()
730   assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC.");  in insertOutgoingEdge()
748 LazyCallGraph::RefSCC::insertIncomingRefEdge(Node &SourceN, Node &TargetN) {  in insertIncomingRefEdge()  argument
756   RefSCC &SourceC = *G->lookupRefSCC(SourceN);  in insertIncomingRefEdge()
889   SourceN.insertEdgeInternal(TargetN, Edge::Ref);  in insertIncomingRefEdge()
903 void LazyCallGraph::RefSCC::removeOutgoingEdge(Node &SourceN, Node &TargetN) {  in removeOutgoingEdge()  argument
904   assert(G->lookupRefSCC(SourceN) == this &&  in removeOutgoingEdge()
915   SourceN.removeEdgeInternal(TargetN.getFunction());  in removeOutgoingEdge()
950       DEBUG(dbgs() << "LCG: Update removing " << SourceN.getFunction().getName()  in removeOutgoingEdge()
961 LazyCallGraph::RefSCC::removeInternalRefEdge(Node &SourceN, Node &TargetN) {  in removeInternalRefEdge()  argument
962   assert(!SourceN[TargetN].isCall() &&  in removeInternalRefEdge()
966   SourceN.removeEdgeInternal(TargetN.getFunction());  in removeInternalRefEdge()
972   if (&SourceN == &TargetN)  in removeInternalRefEdge()
1229 void LazyCallGraph::insertEdge(Node &SourceN, Function &Target, Edge::Kind EK) {  in insertEdge()  argument
1233   return SourceN.insertEdgeInternal(Target, EK);  in insertEdge()
1236 void LazyCallGraph::removeEdge(Node &SourceN, Function &Target) {  in removeEdge()  argument
1240   return SourceN.removeEdgeInternal(Target);  in removeEdge()