Searched defs:insertEdge (Results 1 - 3 of 3) sorted by relevance

/external/llvm/include/llvm/Analysis/
H A DLoopIterator.h117 bool insertEdge(BasicBlock *From, BasicBlock *To);
170 insertEdge(BasicBlock *From, BasicBlock *To) { function in class:llvm::po_iterator_storage
H A DLazyCallGraph.h816 void insertEdge(Node &Caller, Function &Callee, Edge::Kind EK);
819 void insertEdge(Function &Caller, Function &Callee, Edge::Kind EK) { function in class:llvm::LazyCallGraph::Edge
820 return insertEdge(get(Caller), Callee, EK);
/external/llvm/include/llvm/ADT/
H A DPostOrderIterator.h45 // edges can be pruned by returning false in the insertEdge() function. This
49 // the post-order. The insertEdge() function is called in a pre-order, while
60 bool insertEdge(NodeType *From, NodeType *To) { function in class:llvm::po_iterator_storage
80 template <class NodeType> bool insertEdge(NodeType *From, NodeType *To) { function in class:llvm::po_iterator_storage
108 if (this->insertEdge(VisitStack.back().first, BB)) {
116 this->insertEdge((NodeType*)nullptr, BB);
124 if (this->insertEdge((NodeType*)nullptr, BB)) {

Completed in 865 milliseconds