Traverse the blocks in a loop using a depth-first search.
Declared in <llvm/Analysis/LoopIterator.h>
class LoopBlocksTraversal
: public PostOrderTraversalBase<LoopBlocksTraversal, GraphTraits<Function*>>| Name | Description |
|---|---|
PostOrderTraversalBase<LoopBlocksTraversal, GraphTraits<Function*>> | CRTP base for a single post-order graph walk. |
| Name | Description |
|---|---|
iterator | Input iterator yielding nodes in post-order during a single traversal. |
| Name | Description |
|---|---|
LoopBlocksTraversal [constructor] | |
begin | Postorder traversal over the graph. This only needs to be done once. PostOrderTraversalBase "automatically" calls back to insertEdge and finishPostorder to record the DFS result. |
end | |
finishPostorder | finishPostorder overloads |
insertEdge | insertEdge overloads |
| Name | Description |
|---|---|
derived | Return this object cast to the CRTP derived type. |
init | Initialize post-order traversal at given start node. |