HomeSort by: relevance | last modified time | path
    Searched defs:insertEdge (Results 1 - 6 of 6) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
PostOrderIterator.h 48 // edges can be pruned by returning false in the insertEdge() function. This
52 // the post-order. The insertEdge() function is called in a pre-order, while
64 bool insertEdge(Optional<NodeRef> From, NodeRef To) {
84 template <class NodeRef> bool insertEdge(Optional<NodeRef> From, NodeRef To) {
112 this->insertEdge(Optional<NodeRef>(), BB);
121 if (this->insertEdge(Optional<NodeRef>(), BB)) {
134 if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) {
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
LoopIterator.h 39 // LoopBodyTraits, so that insertEdge doesn't have to be specialized.
195 bool insertEdge(Optional<BasicBlock *> From, BasicBlock *To);
247 inline bool po_iterator_storage<LoopBlocksTraversal, true>::insertEdge(
LazyCallGraph.h 1010 void insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
1013 void insertEdge(Function &Source, Function &Target, Edge::Kind EK) {
1014 return insertEdge(get(Source), get(Target), EK);
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
DomTreeUpdater.cpp 39 // 2. When called by insertEdge*()/deleteEdge*(), this update is invalid.
317 void DomTreeUpdater::insertEdge(BasicBlock *From, BasicBlock *To) {
333 DT->insertEdge(From, To);
335 PDT->insertEdge(From, To);
354 DT->insertEdge(From, To);
356 PDT->insertEdge(From, To);
  /src/external/apache2/llvm/dist/llvm/lib/Target/X86/
X86DomainReassignment.cpp 333 bool insertEdge(Register Reg) { return Edges.insert(Reg).second; }
551 if (!C.insertEdge(CurReg))
  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
GenericDomTree.h 205 void InsertEdge(DomTreeT &DT, typename DomTreeT::NodePtr From,
584 void insertEdge(NodeT *From, NodeT *To) {
589 DomTreeBuilder::InsertEdge(*this, From, To);

Completed in 25 milliseconds