Home
last modified time | relevance | path

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

/openbsd/src/gnu/llvm/llvm/lib/Analysis/
DLazyCallGraph.cpp577 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument
579 assert(!(*SourceN)[TargetN].isCall() && "Must start with a ref edge!"); in switchInternalEdgeToCall()
587 SCC &SourceSCC = *G->lookupSCC(SourceN); in switchInternalEdgeToCall()
593 SourceN->setEdgeKind(TargetN, Edge::Call); in switchInternalEdgeToCall()
606 SourceN->setEdgeKind(TargetN, Edge::Call); in switchInternalEdgeToCall()
682 SourceN->setEdgeKind(TargetN, Edge::Call); in switchInternalEdgeToCall()
717 SourceN->setEdgeKind(TargetN, Edge::Call); in switchInternalEdgeToCall()
723 void LazyCallGraph::RefSCC::switchTrivialInternalEdgeToRef(Node &SourceN, in switchTrivialInternalEdgeToRef() argument
725 assert((*SourceN)[TargetN].isCall() && "Must start with a call edge!"); in switchTrivialInternalEdgeToRef()
732 assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC."); in switchTrivialInternalEdgeToRef()
[all …]
/openbsd/src/gnu/llvm/llvm/include/llvm/Analysis/
DLazyCallGraph.h690 Node &SourceN, Node &TargetN,
699 void switchTrivialInternalEdgeToRef(Node &SourceN, Node &TargetN);
719 iterator_range<iterator> switchInternalEdgeToRef(Node &SourceN,
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);
781 SmallVector<RefSCC *, 1> insertIncomingRefEdge(Node &SourceN,
794 void removeOutgoingEdge(Node &SourceN, Node &TargetN);
835 removeInternalRefEdge(Node &SourceN, ArrayRef<Node *> TargetNs);
[all …]