Store the result of a depth first search within basic blocks contained by a single loop.
Synopsis
Declared in <llvm/Analysis/LoopIterator.h>
class LoopBlocksDFS;Description
TODO: This could be generalized for any CFG region, or the entire CFG.
Type Aliases
Name |
Description |
Postorder list iterators. |
|
Reverse‐postorder list iterator. |
Member Functions
Name |
Description |
|
Construct a DFS result store for |
Iterate over the cached postorder blocks. |
|
Reverse iterate over the cached postorder blocks. |
|
Clear the cached DFS numbering and block lists. |
|
Return an iterator past the last postorder block. |
|
Return an iterator past the last reverse‐postorder block. |
|
Return the loop being traversed. |
|
Get a block's postorder number. |
|
Get a block's reverse postorder number. |
|
Return true if this block has a postorder number. |
|
Return true if this block has been preorder visited. |
|
Return true if postorder numbers are assigned to all loop blocks. |
|
Traverse the loop blocks and store the DFS result. |
Friends
Name |
Description |
Traverse the blocks in a loop using a depth‐first search. |
Created with MrDocs