Home
last modified time | relevance | path

Searched refs:SourceN (Results 1 – 6 of 6) sorted by relevance

/external/llvm-project/llvm/lib/Analysis/
DLazyCallGraph.cpp542 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument
544 assert(!(*SourceN)[TargetN].isCall() && "Must start with a ref edge!"); in switchInternalEdgeToCall()
554 SCC &SourceSCC = *G->lookupSCC(SourceN); in switchInternalEdgeToCall()
560 SourceN->setEdgeKind(TargetN, Edge::Call); in switchInternalEdgeToCall()
573 SourceN->setEdgeKind(TargetN, Edge::Call); in switchInternalEdgeToCall()
649 SourceN->setEdgeKind(TargetN, Edge::Call); in switchInternalEdgeToCall()
684 SourceN->setEdgeKind(TargetN, Edge::Call); in switchInternalEdgeToCall()
690 void LazyCallGraph::RefSCC::switchTrivialInternalEdgeToRef(Node &SourceN, in switchTrivialInternalEdgeToRef() argument
692 assert((*SourceN)[TargetN].isCall() && "Must start with a call edge!"); in switchTrivialInternalEdgeToRef()
701 assert(G->lookupRefSCC(SourceN) == this && in switchTrivialInternalEdgeToRef()
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DLazyCallGraph.cpp530 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 …]
/external/llvm/lib/Analysis/
DLazyCallGraph.cpp265 LazyCallGraph::RefSCC::switchInternalEdgeToCall(Node &SourceN, Node &TargetN) { in switchInternalEdgeToCall() argument
266 assert(!SourceN[TargetN].isCall() && "Must start with a ref edge!"); in switchInternalEdgeToCall()
270 SCC &SourceSCC = *G->lookupSCC(SourceN); in switchInternalEdgeToCall()
276 SourceN.setEdgeKind(TargetN.getFunction(), Edge::Call); in switchInternalEdgeToCall()
293 SourceN.setEdgeKind(TargetN.getFunction(), Edge::Call); in switchInternalEdgeToCall()
377 SourceN.setEdgeKind(TargetN.getFunction(), Edge::Call); in switchInternalEdgeToCall()
472 SourceN.setEdgeKind(TargetN.getFunction(), Edge::Call); in switchInternalEdgeToCall()
481 void LazyCallGraph::RefSCC::switchInternalEdgeToRef(Node &SourceN, in switchInternalEdgeToRef() argument
483 assert(SourceN[TargetN].isCall() && "Must start with a call edge!"); in switchInternalEdgeToRef()
485 SCC &SourceSCC = *G->lookupSCC(SourceN); in switchInternalEdgeToRef()
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DLazyCallGraph.h611 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 …]
/external/llvm-project/llvm/include/llvm/Analysis/
DLazyCallGraph.h611 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 …]
/external/llvm/include/llvm/Analysis/
DLazyCallGraph.h568 SmallVector<SCC *, 1> switchInternalEdgeToCall(Node &SourceN,
582 void switchInternalEdgeToRef(Node &SourceN, Node &TargetN);
588 void switchOutgoingEdgeToCall(Node &SourceN, Node &TargetN);
594 void switchOutgoingEdgeToRef(Node &SourceN, Node &TargetN);
608 void insertInternalRefEdge(Node &SourceN, Node &TargetN);
616 void insertOutgoingEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
643 SmallVector<RefSCC *, 1> insertIncomingRefEdge(Node &SourceN,
656 void removeOutgoingEdge(Node &SourceN, Node &TargetN);
699 SmallVector<RefSCC *, 1> removeInternalRefEdge(Node &SourceN,