Searched refs:po_iterator (Results 1 - 10 of 10) sorted by relevance
/freebsd-10-stable/contrib/llvm/include/llvm/ADT/ |
H A D | PostOrderIterator.h | 27 // visited nodes during the po_iterator's depth-first traversal. 45 // could be used to remove loop back-edges from the CFG seen by po_iterator. 49 // the finishPostorder() function is called just before the po_iterator moves 91 class po_iterator : public std::iterator<std::forward_iterator_tag, class in namespace:llvm 113 inline po_iterator(NodeType *BB) { function in class:llvm::po_iterator 118 inline po_iterator() {} // End is when stack is empty. function in class:llvm::po_iterator 120 inline po_iterator(NodeType *BB, SetType &S) : function in class:llvm::po_iterator 128 inline po_iterator(SetType &S) : function in class:llvm::po_iterator 133 typedef po_iterator<GraphT, SetType, ExtStorage, GT> _Self; 175 po_iterator< 182 po_ext_iterator(const po_iterator<T, SetType, true> &V) argument 201 ipo_iterator(const po_iterator<Inverse<T>, SetType, External> &V) argument 221 ipo_ext_iterator(const po_iterator<Inverse<T>, SetType, true> &V) argument [all...] |
/freebsd-10-stable/contrib/llvm/tools/clang/lib/Analysis/ |
H A D | PostOrderCFGView.cpp | 24 for (po_iterator I = po_iterator::begin(cfg, BSet), 25 E = po_iterator::end(cfg, BSet); I != E; ++I) {
|
/freebsd-10-stable/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/ |
H A D | PostOrderCFGView.h | 35 /// template parameter of the llvm::po_iterator template, as used with 41 // po_iterator requires this iterator, but the only interface needed is the 51 // Note that insert() is called by po_iterator, which doesn't check to 72 typedef llvm::po_iterator<const CFG*, CFGBlockSet, true> po_iterator; typedef in class:clang::PostOrderCFGView
|
/freebsd-10-stable/contrib/llvm/include/llvm/Analysis/ |
H A D | LoopIterator.h | 125 typedef po_iterator<BasicBlock*, LoopBlocksTraversal, true> POTIterator; 136 /// po_iterator "automatically" calls back to visitPreorder and 140 assert(DFS.L->getNumBlocks() && "po_iterator cannot handle an empty graph"); 148 /// Called by po_iterator upon reaching a block via a CFG edge. If this block 160 /// Called by po_iterator each time it advances, indicating a block's
|
H A D | LoopInfoImpl.h | 502 for (po_iterator<DomTreeNodeBase<BlockT>*> DomIter = po_begin(DomRoot),
|
/freebsd-10-stable/contrib/llvm/lib/Analysis/ |
H A D | BranchProbabilityInfo.cpp | 493 for (po_iterator<BasicBlock *> I = po_begin(&F.getEntryBlock()),
|
H A D | RegionInfo.cpp | 644 for (po_iterator<DomTreeNode*> FI = po_begin(N), FE = po_end(N); FI != FE;
|
/freebsd-10-stable/contrib/llvm/lib/CodeGen/ |
H A D | EarlyIfConversion.cpp | 795 for (po_iterator<MachineDominatorTree*>
|
/freebsd-10-stable/contrib/llvm/lib/CodeGen/SelectionDAG/ |
H A D | FunctionLoweringInfo.cpp | 434 for (po_iterator<Type*> i = po_begin(T), e = po_end(T);
|
/freebsd-10-stable/contrib/llvm/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 1801 for (po_iterator<BasicBlock*> it = po_begin(&F.getEntryBlock()),
|
Completed in 324 milliseconds