Lines Matching defs:TargetN
45 void LazyCallGraph::EdgeSequence::insertEdgeInternal(Node &TargetN, in insertEdgeInternal()
51 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) { in setEdgeKind()
55 bool LazyCallGraph::EdgeSequence::removeEdgeInternal(Node &TargetN) { in removeEdgeInternal()
587 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall()
734 Node &TargetN) { in switchTrivialInternalEdgeToRef()
754 LazyCallGraph::RefSCC::switchInternalEdgeToRef(Node &SourceN, Node &TargetN) { in switchInternalEdgeToRef()
939 Node &TargetN) { in switchOutgoingEdgeToCall()
960 Node &TargetN) { in switchOutgoingEdgeToRef()
981 Node &TargetN) { in insertInternalRefEdge()
992 void LazyCallGraph::RefSCC::insertOutgoingEdge(Node &SourceN, Node &TargetN, in insertOutgoingEdge()
1012 LazyCallGraph::RefSCC::insertIncomingRefEdge(Node &SourceN, Node &TargetN) { in insertIncomingRefEdge()
1153 void LazyCallGraph::RefSCC::removeOutgoingEdge(Node &SourceN, Node &TargetN) { in removeOutgoingEdge()
1201 [&](Node *TargetN) { return &SourceN == TargetN; })) in removeInternalRefEdge()
1207 if (llvm::all_of(TargetNs, [&](Node *TargetN) { in removeInternalRefEdge()
1408 Node &TargetN) { in insertTrivialCallEdge()
1436 void LazyCallGraph::RefSCC::insertTrivialRefEdge(Node &SourceN, Node &TargetN) { in insertTrivialRefEdge()
1489 void LazyCallGraph::insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK) { in insertEdge()
1496 void LazyCallGraph::removeEdge(Node &SourceN, Node &TargetN) { in removeEdge()