Structs§
- Postorder traversal of a graph.
- Preorder traversal of a graph.
Traits§
- Lets us plug in some additional logic and data into a Postorder traversal. Or not.
Functions§
MonoReachable
internally accumulates aBitSet
of visited blocks. This is just a convenience function to run that traversal then extract its set of reached blocks.- Postorder traversal of a graph.
- Preorder traversal of a graph.
- Returns an iterator over all basic blocks reachable from the
START_BLOCK
in no particular order. - Returns a
BitSet
containing all basic blocks reachable from theSTART_BLOCK
. - Reverse postorder traversal of a graph.