Graph traits for traversing basic blocks in a loop body.
Synopsis
Declared in <llvm/Analysis/LoopIterator.h>
struct LoopBodyTraits;
Description
The graph starts at the loop header and visits the BasicBlocks that are in the loop body, but not the loop header. Since the loop header is skipped, the back edges are excluded.
TODO: Explore the possibility to implement LoopBlocksTraversal in terms of LoopBodyTraits, so that insertEdge doesn't have to be specialized.
Types
Name |
Description |
Predicate that keeps only non‐header blocks contained in the loop. |
|
Successor iterator that carries the enclosing loop for edge filtering. |
Type Aliases
Name |
Description |
Filtered iterator over loop‐body successor nodes. |
|
Node type pairing a loop with one of its basic blocks. |
Static Member Functions
Name |
Description |
Return an iterator to the first child of |
|
Return an iterator past the last child of |
|
Return the graph entry node for loop |
Created with MrDocs