Searched refs:SourceN (Results 1 – 2 of 2) sorted by relevance
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | LazyCallGraph.cpp | 530 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument
532 assert(!(*SourceN)[TargetN].isCall() && "Must start with a ref edge!"); in switchInternalEdgeToCall()
542 SCC &SourceSCC = *G->lookupSCC(SourceN); in switchInternalEdgeToCall()
548 SourceN->setEdgeKind(TargetN, Edge::Call); in switchInternalEdgeToCall()
561 SourceN->setEdgeKind(TargetN, Edge::Call); in switchInternalEdgeToCall()
637 SourceN->setEdgeKind(TargetN, Edge::Call); in switchInternalEdgeToCall()
672 SourceN->setEdgeKind(TargetN, Edge::Call); in switchInternalEdgeToCall()
678 void LazyCallGraph::RefSCC::switchTrivialInternalEdgeToRef(Node &SourceN, in switchTrivialInternalEdgeToRef() argument
680 assert((*SourceN)[TargetN].isCall() && "Must start with a call edge!"); in switchTrivialInternalEdgeToRef()
689 assert(G->lookupRefSCC(SourceN) == this && in switchTrivialInternalEdgeToRef()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| D | LazyCallGraph.h | 611 void handleTrivialEdgeInsertion(Node &SourceN, Node &TargetN);
697 Node &SourceN, Node &TargetN,
706 void switchTrivialInternalEdgeToRef(Node &SourceN, Node &TargetN);
726 iterator_range<iterator> switchInternalEdgeToRef(Node &SourceN,
733 void switchOutgoingEdgeToCall(Node &SourceN, Node &TargetN);
739 void switchOutgoingEdgeToRef(Node &SourceN, Node &TargetN);
753 void insertInternalRefEdge(Node &SourceN, Node &TargetN);
761 void insertOutgoingEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
788 SmallVector<RefSCC *, 1> insertIncomingRefEdge(Node &SourceN,
801 void removeOutgoingEdge(Node &SourceN, Node &TargetN);
[all …]
|