Searched refs:TargetN (Results 1 – 3 of 3) sorted by relevance
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | LazyCallGraph.cpp | 43 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
51 auto IndexMapI = EdgeIndexMap.find(&TargetN); in removeEdgeInternal()
577 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument
588 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
753 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
794 TargetN.DFSNumber = TargetN.LowLink = -1; in switchInternalEdgeToRef()
795 OldSCC.Nodes.push_back(&TargetN); in switchInternalEdgeToRef()
796 G->SCCMap[&TargetN] = &OldSCC; in switchInternalEdgeToRef()
1174 for (Node *TargetN : TargetNs) { in removeInternalRefEdge()
1185 [&](Node *TargetN) { return &SourceN == TargetN; })) in removeInternalRefEdge() argument
[all …]
|
| H A D | CGSCCPassManager.cpp | 1013 llvm::erase_if(DeadTargets, [&](Node *TargetN) { in updateCGAndAnalysisManagerForPass() argument
1014 SCC &TargetC = *G.lookupSCC(*TargetN); in updateCGAndAnalysisManagerForPass()
1023 << *TargetN << "'\n"); in updateCGAndAnalysisManagerForPass()
1024 RC->removeOutgoingEdge(N, *TargetN); in updateCGAndAnalysisManagerForPass()
|
| /freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | LazyCallGraph.h | 690 Node &SourceN, Node &TargetN,
720 Node &TargetN);
726 void switchOutgoingEdgeToCall(Node &SourceN, Node &TargetN);
732 void switchOutgoingEdgeToRef(Node &SourceN, Node &TargetN);
746 void insertInternalRefEdge(Node &SourceN, Node &TargetN);
782 Node &TargetN);
794 void removeOutgoingEdge(Node &SourceN, Node &TargetN);
846 void insertTrivialCallEdge(Node &SourceN, Node &TargetN);
857 void insertTrivialRefEdge(Node &SourceN, Node &TargetN);
1030 void insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
[all …]
|