| /external/llvm/include/llvm/ADT/ |
| PostOrderIterator.h | 28 // visited nodes during the po_iterator's depth-first traversal.
46 // could be used to remove loop back-edges from the CFG seen by po_iterator.
50 // the finishPostorder() function is called just before the po_iterator moves
93 class po_iterator : public std::iterator<std::forward_iterator_tag, class in namespace:llvm
115 po_iterator(NodeType *BB) { function in class:llvm::po_iterator
120 po_iterator() {} // End is when stack is empty. function in class:llvm::po_iterator
122 po_iterator(NodeType *BB, SetType &S) function in class:llvm::po_iterator
130 po_iterator(SetType &S) function in class:llvm::po_iterator
137 static po_iterator begin(GraphT G) {
138 return po_iterator(GT::getEntryNode(G))
[all...] |
| /external/clang/lib/Analysis/ |
| PostOrderCFGView.cpp | 24 for (po_iterator I = po_iterator::begin(cfg, BSet),
25 E = po_iterator::end(cfg, BSet); I != E; ++I) {
|
| /external/clang/include/clang/Analysis/Analyses/ |
| 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
|
| /external/llvm/include/llvm/Analysis/ |
| 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
|
