Home
last modified time | relevance | path

Searched refs:po_iterator (Results 1 – 4 of 4) sorted by relevance

/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DPostOrderIterator.h31 // visited nodes during the po_iterator's depth-first traversal.
49 // could be used to remove loop back-edges from the CFG seen by po_iterator.
53 // the finishPostorder() function is called just before the po_iterator moves
96 class po_iterator : public po_iterator_storage<SetType, ExtStorage> {
113 po_iterator(NodeRef BB) {
119 po_iterator() = default; // End is when stack is empty.
121 po_iterator(NodeRef BB, SetType &S)
129 po_iterator(SetType &S)
148 static po_iterator begin(const GraphT &G) {
149 return po_iterator(G
114 po_iterator(NodeRef BB) { po_iterator() function
122 po_iterator(NodeRef BB, SetType &S) po_iterator() function
130 po_iterator(SetType &S) po_iterator() function
[all...]
/freebsd/contrib/llvm-project/clang/lib/Analysis/
H A DPostOrderCFGView.cpp25 for (po_iterator I = po_iterator::begin(cfg, BSet), in PostOrderCFGView()
26 E = po_iterator::end(cfg, BSet); I != E; ++I) { in PostOrderCFGView()
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DPostOrderCFGView.h106 using po_iterator = variable
107 llvm::po_iterator<const CFG *, CFGBlockSet, true, CFGLoopBodyFirstTraits>;
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLoopIterator.h203 typedef po_iterator<BasicBlock*, LoopBlocksTraversal, true> POTIterator;
214 /// po_iterator "automatically" calls back to visitPreorder and
218 assert(DFS.L->getNumBlocks() && "po_iterator cannot handle an empty graph"); in begin()
226 /// Called by po_iterator upon reaching a block via a CFG edge. If this block
238 /// Called by po_iterator each time it advances, indicating a block's