Searched defs:insertEdge (Results 1 - 4 of 4) sorted by relevance
/external/llvm/include/llvm/Analysis/ |
H A D | LoopIterator.h | 117 bool insertEdge(BasicBlock *From, BasicBlock *To); 170 insertEdge(BasicBlock *From, BasicBlock *To) { function in class:llvm::po_iterator_storage
|
H A D | LazyCallGraph.h | 442 void insertEdge(Node &Caller, Function &Callee); 445 void insertEdge(Function &Caller, Function &Callee) { function in class:llvm::LazyCallGraph 446 return insertEdge(get(Caller), Callee);
|
/external/llvm/include/llvm/ADT/ |
H A D | PostOrderIterator.h | 44 // edges can be pruned by returning false in the insertEdge() function. This 48 // the post-order. The insertEdge() function is called in a pre-order, while 59 bool insertEdge(NodeType *From, NodeType *To) { function in class:llvm::po_iterator_storage 80 bool insertEdge(NodeType *From, NodeType *To) { return Visited.insert(To); } function in class:llvm::po_iterator_storage 106 if (this->insertEdge(VisitStack.back().first, BB)) { 114 this->insertEdge((NodeType*)nullptr, BB); 122 if (this->insertEdge((NodeType*)nullptr, BB)) {
|
/external/llvm/lib/Analysis/ |
H A D | LazyCallGraph.cpp | 531 void LazyCallGraph::insertEdge(Node &CallerN, Function &Callee) { function in class:LazyCallGraph
|
Completed in 952 milliseconds