Searched refs:TargetN (Results 1 – 3 of 3) sorted by relevance
| /openbsd-src/gnu/llvm/llvm/lib/Analysis/ |
| H A D | LazyCallGraph.cpp | 40 void LazyCallGraph::EdgeSequence::insertEdgeInternal(Node &TargetN, in insertEdgeInternal() argument
42 EdgeIndexMap.try_emplace(&TargetN, Edges.size()); in insertEdgeInternal()
43 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
46 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) { in setEdgeKind() argument
47 Edges[EdgeIndexMap.find(&TargetN)->second].setKind(EK); in setEdgeKind()
50 bool LazyCallGraph::EdgeSequence::removeEdgeInternal(Node &TargetN) { in removeEdgeInternal() argument
51 auto IndexMapI = EdgeIndexMap.find(&TargetN); in removeEdgeInternal()
577 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument
579 assert(!(*SourceN)[TargetN].isCall() && "Must start with a ref edge!"); in switchInternalEdgeToCall()
588 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
[all …]
|
| H A D | CGSCCPassManager.cpp | 1020 llvm::erase_if(DeadTargets, [&](Node *TargetN) { in updateCGAndAnalysisManagerForPass() argument
1021 SCC &TargetC = *G.lookupSCC(*TargetN); in updateCGAndAnalysisManagerForPass()
1030 << *TargetN << "'\n"); in updateCGAndAnalysisManagerForPass()
1031 RC->removeOutgoingEdge(N, *TargetN); in updateCGAndAnalysisManagerForPass()
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/ |
| H A D | LazyCallGraph.h | 690 Node &SourceN, Node &TargetN,
699 void switchTrivialInternalEdgeToRef(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);
754 void insertOutgoingEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
782 Node &TargetN);
794 void removeOutgoingEdge(Node &SourceN, Node &TargetN);
846 void insertTrivialCallEdge(Node &SourceN, Node &TargetN);
[all …]
|