Searched refs:TargetN (Results 1 – 3 of 3) sorted by relevance
| /external/llvm/lib/Analysis/ |
| D | LazyCallGraph.cpp | 104 void LazyCallGraph::Node::insertEdgeInternal(Node &TargetN, Edge::Kind EK) { in insertEdgeInternal() argument
105 EdgeIndexMap.insert({&TargetN.getFunction(), Edges.size()}); in insertEdgeInternal()
106 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
265 LazyCallGraph::RefSCC::switchInternalEdgeToCall(Node &SourceN, Node &TargetN) { in switchInternalEdgeToCall() argument
266 assert(!SourceN[TargetN].isCall() && "Must start with a ref edge!"); in switchInternalEdgeToCall()
271 SCC &TargetSCC = *G->lookupSCC(TargetN); 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()
[all …]
|
| /external/llvm/include/llvm/Analysis/ |
| D | LazyCallGraph.h | 569 Node &TargetN);
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);
644 Node &TargetN);
656 void removeOutgoingEdge(Node &SourceN, Node &TargetN);
700 Node &TargetN);
|
| /external/llvm/lib/Target/Hexagon/ |
| D | BitTracker.cpp | 969 int TargetN = Targets[i]->getNumber(); in visitBranchesFrom() local
970 FlowQ.push(CFGEdge(ThisN, TargetN)); in visitBranchesFrom()
|