Searched refs:SourceN (Results 1 – 2 of 2) sorted by relevance
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| H A D | LazyCallGraph.cpp | 586 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument
588 assert(!(*SourceN)[TargetN].isCall() && "Must start with a ref edge!"); in switchInternalEdgeToCall()
596 SCC &SourceSCC = *G->lookupSCC(SourceN); in switchInternalEdgeToCall()
602 SourceN->setEdgeKind(TargetN, Edge::Call); in switchInternalEdgeToCall()
615 SourceN->setEdgeKind(TargetN, Edge::Call); in switchInternalEdgeToCall()
691 SourceN->setEdgeKind(TargetN, Edge::Call); in switchInternalEdgeToCall()
726 SourceN->setEdgeKind(TargetN, Edge::Call); in switchInternalEdgeToCall()
732 void LazyCallGraph::RefSCC::switchTrivialInternalEdgeToRef(Node &SourceN, in switchTrivialInternalEdgeToRef() argument
734 assert((*SourceN)[TargetN].isCall() && "Must start with a call edge!"); in switchTrivialInternalEdgeToRef()
741 assert(G->lookupRefSCC(SourceN) == this && in switchTrivialInternalEdgeToRef()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| H A D | LazyCallGraph.h | 683 Node &SourceN, Node &TargetN,
692 void switchTrivialInternalEdgeToRef(Node &SourceN, Node &TargetN);
712 iterator_range<iterator> switchInternalEdgeToRef(Node &SourceN,
719 void switchOutgoingEdgeToCall(Node &SourceN, Node &TargetN);
725 void switchOutgoingEdgeToRef(Node &SourceN, Node &TargetN);
739 void insertInternalRefEdge(Node &SourceN, Node &TargetN);
747 void insertOutgoingEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
774 SmallVector<RefSCC *, 1> insertIncomingRefEdge(Node &SourceN,
787 void removeOutgoingEdge(Node &SourceN, Node &TargetN);
827 SmallVector<RefSCC *, 1> removeInternalRefEdge(Node &SourceN,
[all …]
|