Searched refs:insertEdge (Results 1 – 7 of 7) sorted by relevance
| /external/llvm/unittests/ADT/ |
| D | PostOrderIteratorTest.cpp | 24 PIS.insertEdge(Null, Null); in TEST()
27 PIS.insertEdge(Null, Null); in TEST()
33 PI.insertEdge(NullBB, NullBB); in TEST()
35 PIExt.insertEdge(NullBB, NullBB); in TEST()
|
| /external/llvm/include/llvm/ADT/ |
| D | PostOrderIterator.h | 60 bool insertEdge(NodeType *From, NodeType *To) { in insertEdge() function
80 template <class NodeType> bool insertEdge(NodeType *From, NodeType *To) { in insertEdge() function
108 if (this->insertEdge(VisitStack.back().first, BB)) { in traverseChild()
116 this->insertEdge((NodeType*)nullptr, BB); in po_iterator()
124 if (this->insertEdge((NodeType*)nullptr, BB)) { in po_iterator()
|
| /external/llvm/include/llvm/Analysis/ |
| D | LoopIterator.h | 117 bool insertEdge(BasicBlock *From, BasicBlock *To);
170 insertEdge(BasicBlock *From, BasicBlock *To) { in insertEdge() function
|
| D | LazyCallGraph.h | 816 void insertEdge(Node &Caller, Function &Callee, Edge::Kind EK);
819 void insertEdge(Function &Caller, Function &Callee, Edge::Kind EK) { in insertEdge() function
820 return insertEdge(get(Caller), Callee, EK); in insertEdge()
|
| /external/llvm/unittests/Analysis/ |
| D | LazyCallGraphTest.cpp | 306 CG.insertEdge(B, lookupFunction(*M, "c"), LazyCallGraph::Edge::Call); in TEST()
311 CG.insertEdge(C, B.getFunction(), LazyCallGraph::Edge::Call); in TEST()
315 CG.insertEdge(C, C.getFunction(), LazyCallGraph::Edge::Call); in TEST()
338 CG.insertEdge(lookupFunction(*M, "d1"), lookupFunction(*M, "a1"), in TEST()
|
| /external/llvm/lib/CodeGen/ |
| D | MachineTraceMetrics.cpp | 433 bool insertEdge(const MachineBasicBlock *From, const MachineBasicBlock *To) { in insertEdge() function in llvm::po_iterator_storage
|
| /external/llvm/lib/Analysis/ |
| D | LazyCallGraph.cpp | 1229 void LazyCallGraph::insertEdge(Node &SourceN, Function &Target, Edge::Kind EK) { in insertEdge() function in LazyCallGraph
|