Searched refs:TargetN (Results 1 – 3 of 3) sorted by relevance
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | LazyCallGraph.cpp | 48 Edges.emplace_back(TargetN, EK); in insertEdgeInternal() 56 auto IndexMapI = EdgeIndexMap.find(&TargetN); in removeEdgeInternal() 587 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument 598 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall() 767 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef() 808 TargetN.DFSNumber = TargetN.LowLink = -1; in switchInternalEdgeToRef() 809 OldSCC.Nodes.push_back(&TargetN); in switchInternalEdgeToRef() 810 G->SCCMap[&TargetN] = &OldSCC; in switchInternalEdgeToRef() 1190 for (Node *TargetN : TargetNs) { in removeInternalRefEdge() 1201 [&](Node *TargetN) { return &SourceN == TargetN; })) in removeInternalRefEdge() argument [all …]
|
| H A D | CGSCCPassManager.cpp | 1035 llvm::erase_if(DeadTargets, [&](Node *TargetN) { in updateCGAndAnalysisManagerForPass() argument 1036 SCC &TargetC = *G.lookupSCC(*TargetN); in updateCGAndAnalysisManagerForPass() 1045 << *TargetN << "'\n"); in updateCGAndAnalysisManagerForPass() 1046 RC->removeOutgoingEdge(N, *TargetN); in updateCGAndAnalysisManagerForPass()
|
| /llvm-project-15.0.7/llvm/include/llvm/Analysis/ |
| H A D | LazyCallGraph.h | 682 Node &SourceN, Node &TargetN, 712 Node &TargetN); 718 void switchOutgoingEdgeToCall(Node &SourceN, Node &TargetN); 724 void switchOutgoingEdgeToRef(Node &SourceN, Node &TargetN); 738 void insertInternalRefEdge(Node &SourceN, Node &TargetN); 774 Node &TargetN); 786 void removeOutgoingEdge(Node &SourceN, Node &TargetN); 838 void insertTrivialCallEdge(Node &SourceN, Node &TargetN); 849 void insertTrivialRefEdge(Node &SourceN, Node &TargetN); 1022 void insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK); [all …]
|