Lines Matching defs:TargetN
40 void LazyCallGraph::EdgeSequence::insertEdgeInternal(Node &TargetN, in insertEdgeInternal()
46 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) { in setEdgeKind()
50 bool LazyCallGraph::EdgeSequence::removeEdgeInternal(Node &TargetN) { in removeEdgeInternal()
577 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall()
724 Node &TargetN) { in switchTrivialInternalEdgeToRef()
742 LazyCallGraph::RefSCC::switchInternalEdgeToRef(Node &SourceN, Node &TargetN) { in switchInternalEdgeToRef()
923 Node &TargetN) { in switchOutgoingEdgeToCall()
944 Node &TargetN) { in switchOutgoingEdgeToRef()
965 Node &TargetN) { in insertInternalRefEdge()
976 void LazyCallGraph::RefSCC::insertOutgoingEdge(Node &SourceN, Node &TargetN, in insertOutgoingEdge()
996 LazyCallGraph::RefSCC::insertIncomingRefEdge(Node &SourceN, Node &TargetN) { in insertIncomingRefEdge()
1137 void LazyCallGraph::RefSCC::removeOutgoingEdge(Node &SourceN, Node &TargetN) { in removeOutgoingEdge()
1185 [&](Node *TargetN) { return &SourceN == TargetN; })) in removeInternalRefEdge()
1191 if (llvm::all_of(TargetNs, [&](Node *TargetN) { in removeInternalRefEdge()
1390 Node &TargetN) { in insertTrivialCallEdge()
1418 void LazyCallGraph::RefSCC::insertTrivialRefEdge(Node &SourceN, Node &TargetN) { in insertTrivialRefEdge()
1478 void LazyCallGraph::insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK) { in insertEdge()
1485 void LazyCallGraph::removeEdge(Node &SourceN, Node &TargetN) { in removeEdge()