Searched refs:SourceN (Results 1 – 2 of 2) sorted by relevance
| /external/llvm/lib/Analysis/ |
| D | LazyCallGraph.cpp | 265 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/llvm/include/llvm/Analysis/ |
| D | LazyCallGraph.h | 568 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,
|