43 void LazyCallGraph::EdgeSequence::insertEdgeInternal(Node &TargetN,  in insertEdgeInternal()
49 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) {  in setEdgeKind()
53 bool LazyCallGraph::EdgeSequence::removeEdgeInternal(Node &TargetN) {  in removeEdgeInternal()
517     Node &SourceN, Node &TargetN,  in switchInternalEdgeToCall()
666                                                            Node &TargetN) {  in switchTrivialInternalEdgeToRef()
688 LazyCallGraph::RefSCC::switchInternalEdgeToRef(Node &SourceN, Node &TargetN) {  in switchInternalEdgeToRef()
875                                                      Node &TargetN) {  in switchOutgoingEdgeToCall()
897                                                     Node &TargetN) {  in switchOutgoingEdgeToRef()
919                                                   Node &TargetN) {  in insertInternalRefEdge()
931 void LazyCallGraph::RefSCC::insertOutgoingEdge(Node &SourceN, Node &TargetN,  in insertOutgoingEdge()
952 LazyCallGraph::RefSCC::insertIncomingRefEdge(Node &SourceN, Node &TargetN) {  in insertIncomingRefEdge()
1095 void LazyCallGraph::RefSCC::removeOutgoingEdge(Node &SourceN, Node &TargetN) {  in removeOutgoingEdge()
1145                    [&](Node *TargetN) { return &SourceN == TargetN; }))  in removeInternalRefEdge()
1151   if (llvm::all_of(TargetNs, [&](Node *TargetN) {  in removeInternalRefEdge()
1352                                                        Node &TargetN) {  in handleTrivialEdgeInsertion()
1369                                                   Node &TargetN) {  in insertTrivialCallEdge()
1403 void LazyCallGraph::RefSCC::insertTrivialRefEdge(Node &SourceN, Node &TargetN) {  in insertTrivialRefEdge()
1463 void LazyCallGraph::insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK) {  in insertEdge()
1470 void LazyCallGraph::removeEdge(Node &SourceN, Node &TargetN) {  in removeEdge()