Searched refs:TargetN (Results 1 – 3 of 3) sorted by relevance
| /freebsd-12.1/contrib/llvm/lib/Analysis/ |
| H A D | LazyCallGraph.cpp | 46 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
54 auto IndexMapI = EdgeIndexMap.find(&TargetN); in removeEdgeInternal()
517 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument
530 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
703 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
744 TargetN.DFSNumber = TargetN.LowLink = -1; in switchInternalEdgeToRef()
745 OldSCC.Nodes.push_back(&TargetN); in switchInternalEdgeToRef()
746 G->SCCMap[&TargetN] = &OldSCC; in switchInternalEdgeToRef()
1134 for (Node *TargetN : TargetNs) { in removeInternalRefEdge()
1145 [&](Node *TargetN) { return &SourceN == TargetN; })) in removeInternalRefEdge() argument
[all …]
|
| H A D | CGSCCPassManager.cpp | 523 [&](Node *TargetN) { in updateCGAndAnalysisManagerForFunctionPass() argument
524 SCC &TargetC = *G.lookupSCC(*TargetN); in updateCGAndAnalysisManagerForFunctionPass()
532 RC->removeOutgoingEdge(N, *TargetN); in updateCGAndAnalysisManagerForFunctionPass()
534 << N << "' to '" << TargetN << "'\n"); in updateCGAndAnalysisManagerForFunctionPass()
|
| /freebsd-12.1/contrib/llvm/include/llvm/Analysis/ |
| H A D | LazyCallGraph.h | 611 void handleTrivialEdgeInsertion(Node &SourceN, Node &TargetN);
697 Node &SourceN, Node &TargetN,
733 void switchOutgoingEdgeToCall(Node &SourceN, Node &TargetN);
739 void switchOutgoingEdgeToRef(Node &SourceN, Node &TargetN);
753 void insertInternalRefEdge(Node &SourceN, Node &TargetN);
789 Node &TargetN);
801 void removeOutgoingEdge(Node &SourceN, Node &TargetN);
853 void insertTrivialCallEdge(Node &SourceN, Node &TargetN);
864 void insertTrivialRefEdge(Node &SourceN, Node &TargetN);
1020 void insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
[all …]
|