| Package | Description |
|---|---|
| org.jikesrvm.compilers.opt.controlflow | |
| org.jikesrvm.compilers.opt.depgraph |
Provides classes that implement a dependence graph.
|
| org.jikesrvm.compilers.opt.dfsolver | |
| org.jikesrvm.compilers.opt.inlining | |
| org.jikesrvm.compilers.opt.ir | |
| org.jikesrvm.compilers.opt.ir.ia32 | |
| org.jikesrvm.compilers.opt.lir2mir |
Provides classes that implement the transition from low-level IR to
machine-specific IR.
|
| org.jikesrvm.compilers.opt.regalloc | |
| org.jikesrvm.compilers.opt.ssa |
SSA implementation (disabled because of bugs, see entry in issue tracker).
|
| org.jikesrvm.compilers.opt.util |
| Class and Description |
|---|
| Graph
An abstract interface for generic graphs; general graph utilities
should be defined in terms of this interface and all graph
implementations in the system should implement it.
|
| GraphNode
A generic interface for graph nodes.
|
| SpaceEffGraph
SpaceEffGraph package implements a generic directed graph that can
be a multigraph.
|
| SpaceEffGraphEdge
SpaceEffGraphEdge is a generic graph edge.
|
| SpaceEffGraphNode
SpaceEffGraphNode is a generic graph node.
|
| Stack
Stack is a smaller implementation of java.util.Stack, that uses a linked
list rather than a vector.
|
| TopSortInterface
Interface to allow building top-sort, by calling TopSort.buildTopSort()
|
| Tree
This class is a generic tree.
|
| TreeNode
This class is a node in a tree.
|
| Class and Description |
|---|
| Graph
An abstract interface for generic graphs; general graph utilities
should be defined in terms of this interface and all graph
implementations in the system should implement it.
|
| GraphEdge
Graph representations that use explicit edge objects should have
their edge objects implement this interface.
|
| GraphNode
A generic interface for graph nodes.
|
| SpaceEffGraph
SpaceEffGraph package implements a generic directed graph that can
be a multigraph.
|
| SpaceEffGraphEdge
SpaceEffGraphEdge is a generic graph edge.
|
| SpaceEffGraphNode
SpaceEffGraphNode is a generic graph node.
|
| TopSortInterface
Interface to allow building top-sort, by calling TopSort.buildTopSort()
|
| Class and Description |
|---|
| Graph
An abstract interface for generic graphs; general graph utilities
should be defined in terms of this interface and all graph
implementations in the system should implement it.
|
| GraphNode
A generic interface for graph nodes.
|
| Class and Description |
|---|
| Tree
This class is a generic tree.
|
| TreeNode
This class is a node in a tree.
|
| Class and Description |
|---|
| BitSetMapping
An object that implements a bijection between whole numbers and
objects.
|
| Graph
An abstract interface for generic graphs; general graph utilities
should be defined in terms of this interface and all graph
implementations in the system should implement it.
|
| GraphNode
A generic interface for graph nodes.
|
| SortedGraphNode |
| SpaceEffGraph
SpaceEffGraph package implements a generic directed graph that can
be a multigraph.
|
| SpaceEffGraphEdge
SpaceEffGraphEdge is a generic graph edge.
|
| SpaceEffGraphNode
SpaceEffGraphNode is a generic graph node.
|
| TopSortInterface
Interface to allow building top-sort, by calling TopSort.buildTopSort()
|
| Class and Description |
|---|
| BitSet
A bit set is a set of elements, each of which corresponds to a unique
integer from [0,MAX].
|
| BitSetMapping
An object that implements a bijection between whole numbers and
objects.
|
| Class and Description |
|---|
| Graph
An abstract interface for generic graphs; general graph utilities
should be defined in terms of this interface and all graph
implementations in the system should implement it.
|
| GraphNode
A generic interface for graph nodes.
|
| SpaceEffGraph
SpaceEffGraph package implements a generic directed graph that can
be a multigraph.
|
| SpaceEffGraphEdge
SpaceEffGraphEdge is a generic graph edge.
|
| SpaceEffGraphNode
SpaceEffGraphNode is a generic graph node.
|
| TopSortInterface
Interface to allow building top-sort, by calling TopSort.buildTopSort()
|
| Class and Description |
|---|
| BitSet
A bit set is a set of elements, each of which corresponds to a unique
integer from [0,MAX].
|
| Graph
An abstract interface for generic graphs; general graph utilities
should be defined in terms of this interface and all graph
implementations in the system should implement it.
|
| GraphEdge
Graph representations that use explicit edge objects should have
their edge objects implement this interface.
|
| GraphNode
A generic interface for graph nodes.
|
| SpaceEffGraph
SpaceEffGraph package implements a generic directed graph that can
be a multigraph.
|
| SpaceEffGraphEdge
SpaceEffGraphEdge is a generic graph edge.
|
| SpaceEffGraphNode
SpaceEffGraphNode is a generic graph node.
|
| TopSortInterface
Interface to allow building top-sort, by calling TopSort.buildTopSort()
|
| Class and Description |
|---|
| GraphEdge
Graph representations that use explicit edge objects should have
their edge objects implement this interface.
|
| GraphNode
A generic interface for graph nodes.
|
| SpaceEffGraph
SpaceEffGraph package implements a generic directed graph that can
be a multigraph.
|
| SpaceEffGraphEdge
SpaceEffGraphEdge is a generic graph edge.
|
| SpaceEffGraphNode
SpaceEffGraphNode is a generic graph node.
|
| Class and Description |
|---|
| BitSet
A bit set is a set of elements, each of which corresponds to a unique
integer from [0,MAX].
|
| BitSetMapping
An object that implements a bijection between whole numbers and
objects.
|
| 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.
|
| FilterEnumerator.Filter |
| FilterIterator.Filter |
| Graph
An abstract interface for generic graphs; general graph utilities
should be defined in terms of this interface and all graph
implementations in the system should implement it.
|
| GraphEdge
Graph representations that use explicit edge objects should have
their edge objects implement this interface.
|
| GraphEdgeFilter |
| GraphNode
A generic interface for graph nodes.
|
| GraphNodeEnumerator |
| 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.
|
| SortedGraphNode |
| SpaceEffGraphEdge
SpaceEffGraphEdge is a generic graph edge.
|
| SpaceEffGraphEdgeList |
| SpaceEffGraphNode
SpaceEffGraphNode is a generic graph node.
|
| SpaceEffGraphNode.GraphEdgeEnumeration |
| SpaceEffGraphNode.InEdgeEnumeration |
| SpaceEffGraphNode.OutEdgeEnumeration |
| SpaceEffGraphNodeList
List of Graph nodes.
|
| SpaceEffGraphNodeListHeader |
| Stack
Stack is a smaller implementation of java.util.Stack, that uses a linked
list rather than a vector.
|
| TopSortInterface
Interface to allow building top-sort, by calling TopSort.buildTopSort()
|
| TreeNode
This class is a node in a tree.
|