| Package | Description |
|---|---|
| org.jikesrvm.compilers.opt.controlflow | |
| org.jikesrvm.compilers.opt.util |
| Modifier and Type | Class and Description |
|---|---|
class |
LTDominators
Calculate dominators using Langauer and Tarjan's fastest algorithm.
|
| Modifier and Type | Class and Description |
|---|---|
class |
DFSenumerateByFinish
This class implements depth-first search over a Graph,
return an enumeration of the nodes of the graph in order of
increasing finishing time.
|
class |
FilteredDFSenumerateByFinish |
class |
ReverseDFSenumerateByFinish
This class generates an enumeration of nodes of a graph, in order
of increasing finishing time in a reverse Depth First Search,
i.e. a search traversing nodes from target to source.
|
(package private) class |
ReverseFilteredDFSenumerateByFinish |
class |
TopSort
Depth First Spanning Tree, builds topological sort of a graph consisting of SortedGraphNode.
|
| Modifier and Type | Field and Description |
|---|---|
private Stack<GraphNode> |
DepthFirstEnumerator.stack |
| Modifier and Type | Method and Description |
|---|---|
Stack<T> |
Stack.copy() |
Stack<T> |
Stack.shallowCopy() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
Stack.compare(Stack<T> s2) |