Lines Matching refs:TargetN
104 void LazyCallGraph::Node::insertEdgeInternal(Node &TargetN, Edge::Kind EK) { in insertEdgeInternal() argument
105 EdgeIndexMap.insert({&TargetN.getFunction(), Edges.size()}); in insertEdgeInternal()
106 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
265 LazyCallGraph::RefSCC::switchInternalEdgeToCall(Node &SourceN, Node &TargetN) { in switchInternalEdgeToCall() argument
266 assert(!SourceN[TargetN].isCall() && "Must start with a ref edge!"); in switchInternalEdgeToCall()
271 SCC &TargetSCC = *G->lookupSCC(TargetN); 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()
482 Node &TargetN) { in switchInternalEdgeToRef() argument
483 assert(SourceN[TargetN].isCall() && "Must start with a call edge!"); in switchInternalEdgeToRef()
486 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
494 SourceN.setEdgeKind(TargetN.getFunction(), Edge::Ref); in switchInternalEdgeToRef()
539 TargetN.DFSNumber = TargetN.LowLink = -1; in switchInternalEdgeToRef()
540 OldSCC.Nodes.push_back(&TargetN); in switchInternalEdgeToRef()
541 G->SCCMap[&TargetN] = &OldSCC; in switchInternalEdgeToRef()
673 Node &TargetN) { in switchOutgoingEdgeToCall() argument
674 assert(!SourceN[TargetN].isCall() && "Must start with a ref edge!"); in switchOutgoingEdgeToCall()
677 assert(G->lookupRefSCC(TargetN) != this && in switchOutgoingEdgeToCall()
679 assert(G->lookupRefSCC(TargetN)->isDescendantOf(*this) && in switchOutgoingEdgeToCall()
684 SourceN.setEdgeKind(TargetN.getFunction(), Edge::Call); in switchOutgoingEdgeToCall()
693 Node &TargetN) { in switchOutgoingEdgeToRef() argument
694 assert(SourceN[TargetN].isCall() && "Must start with a call edge!"); in switchOutgoingEdgeToRef()
697 assert(G->lookupRefSCC(TargetN) != this && in switchOutgoingEdgeToRef()
699 assert(G->lookupRefSCC(TargetN)->isDescendantOf(*this) && in switchOutgoingEdgeToRef()
704 SourceN.setEdgeKind(TargetN.getFunction(), Edge::Ref); in switchOutgoingEdgeToRef()
713 Node &TargetN) { in insertInternalRefEdge() argument
715 assert(G->lookupRefSCC(TargetN) == this && "Target 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()
732 RefSCC &TargetC = *G->lookupRefSCC(TargetN); in insertOutgoingEdge()
748 LazyCallGraph::RefSCC::insertIncomingRefEdge(Node &SourceN, Node &TargetN) { in insertIncomingRefEdge() argument
749 assert(G->lookupRefSCC(TargetN) == this && "Target must be in this SCC."); in insertIncomingRefEdge()
889 SourceN.insertEdgeInternal(TargetN, Edge::Ref); in insertIncomingRefEdge()
903 void LazyCallGraph::RefSCC::removeOutgoingEdge(Node &SourceN, Node &TargetN) { in removeOutgoingEdge() argument
907 RefSCC &TargetRC = *G->lookupRefSCC(TargetN); in removeOutgoingEdge()
915 SourceN.removeEdgeInternal(TargetN.getFunction()); in removeOutgoingEdge()
951 << " -> " << TargetN.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()
997 SCC &TargetC = *G->lookupSCC(TargetN); in removeInternalRefEdge()
1259 if (Node *TargetN = E.getNode()) in updateGraphPtrs() local
1260 Worklist.push_back(TargetN); in updateGraphPtrs()