|
|||||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||||
| Uses of GraphNode in org.jikesrvm.compilers.opt.controlflow |
|---|
| Classes in org.jikesrvm.compilers.opt.controlflow that implement GraphNode | |
|---|---|
class |
AnnotatedLSTNode
A node in the LST (Loop Structure Tree) with added information on: Whether this is a countable, affine or non-regular loop The registers being used to hold the loop iterator The initial loop iterator value The terminal loop iterator value The instruction that modifies the iterator The phi instruction that merges the redefined iterator with its original value The condition used to test for loop termination The stride operand The information is only held on regular loops. |
(package private) class |
DominatorCell
DominatorCell represents a set of basic blocks, used in the dataflow calculation |
class |
LSTNode
A node in the LST (Loop Structure Tree) |
| Uses of GraphNode in org.jikesrvm.compilers.opt.depgraph |
|---|
| Classes in org.jikesrvm.compilers.opt.depgraph that implement GraphNode | |
|---|---|
class |
DepGraphNode
Dependence graph node: there is one for each instruction in a basic block. |
| Uses of GraphNode in org.jikesrvm.compilers.opt.dfsolver |
|---|
| Subinterfaces of GraphNode in org.jikesrvm.compilers.opt.dfsolver | |
|---|---|
interface |
DF_LatticeCell
DF_LatticeCell.java Represents a single lattice cell in a dataflow equation system. |
| Classes in org.jikesrvm.compilers.opt.dfsolver that implement GraphNode | |
|---|---|
class |
DF_AbstractCell
DF_LatticeCell.java Represents a single lattice cell in a dataflow system. |
class |
DF_Equation
DF_Equation.java represents a single Data Flow equation |
| Fields in org.jikesrvm.compilers.opt.dfsolver with type parameters of type GraphNode | |
|---|---|
ArrayList<GraphNode> |
DF_Graph.nodes
The nodes of the graph. |
| Methods in org.jikesrvm.compilers.opt.dfsolver with parameters of type GraphNode | |
|---|---|
void |
DF_Graph.addGraphEdge(GraphNode x,
GraphNode y)
Unsupported. |
void |
DF_Graph.addGraphNode(GraphNode x)
Add a node to the graph. |
| Uses of GraphNode in org.jikesrvm.compilers.opt.ir |
|---|
| Classes in org.jikesrvm.compilers.opt.ir that implement GraphNode | |
|---|---|
class |
BasicBlock
A basic block in the Factored Control Flow Graph (FCFG). |
class |
ExceptionHandlerBasicBlock
A basic block that marks the start of an exception handler. |
| Uses of GraphNode in org.jikesrvm.compilers.opt.regalloc |
|---|
| Classes in org.jikesrvm.compilers.opt.regalloc that implement GraphNode | |
|---|---|
(package private) static class |
CoalesceGraph.Node
|
| Uses of GraphNode in org.jikesrvm.compilers.opt.ssa |
|---|
| Classes in org.jikesrvm.compilers.opt.ssa that implement GraphNode | |
|---|---|
(package private) static class |
IndexPropagation.ArrayCell
An ArrayCell is a lattice cell for the index propagation problem, used in redundant load elimination for one-dimensional arrays. |
(package private) static class |
IndexPropagation.ObjectCell
An ObjectCell is a lattice cell for the index propagation problem, used in redundant load elimination for fields. |
(package private) class |
ValueGraphVertex
This class implements a vertex in the value graph used in global value numbering ala Alpern, Wegman and Zadeck. |
| Methods in org.jikesrvm.compilers.opt.ssa that return types with arguments of type GraphNode | |
|---|---|
Enumeration<GraphNode> |
ValueGraph.enumerateVertices()
Enumerate the vertices in the value graph. |
| Uses of GraphNode in org.jikesrvm.compilers.opt.util |
|---|
| Classes in org.jikesrvm.compilers.opt.util that implement GraphNode | |
|---|---|
class |
SortedGraphNode
|
class |
SpaceEffGraphNode
SpaceEffGraphNode is a generic graph node. |
| Fields in org.jikesrvm.compilers.opt.util declared as GraphNode | |
|---|---|
GraphNode |
DFSenumerateByFinish.currentRoot
While a depth-first enumeration is in progress, this field holds the current root node, i.e. the current botton of the search stack (assuming stacks grow upward). |
private GraphNode |
DFSenumerateByFinish.theNextElement
the current next element in finishing time order |
| Fields in org.jikesrvm.compilers.opt.util with type parameters of type GraphNode | |
|---|---|
private Enumeration<GraphNode> |
GraphNodeEnumerator.Enum.e
|
private Iterator<GraphNode> |
GraphNodeEnumerator.Iter.i
|
(package private) Stack<GraphNode> |
DepthFirstEnumerator.stack
|
| Methods in org.jikesrvm.compilers.opt.util that return GraphNode | |
|---|---|
GraphNode |
GraphEdge.from()
|
GraphNode |
SpaceEffGraphEdge.from()
Get the start node for the edge. |
GraphNode |
SpaceEffGraphNode.InNodeEnumeration.next()
|
GraphNode |
SpaceEffGraphNode.OutNodeEnumeration.next()
|
GraphNode |
DepthFirstEnumerator.next()
|
GraphNode |
DFSenumerateByFinish.next()
Find the next graph node in finishing time order. |
GraphNode |
SpaceEffGraph.NodeEnumeration.next()
|
GraphNode |
GraphNodeEnumerator.Enum.next()
|
GraphNode |
GraphNodeEnumerator.Iter.next()
|
GraphNode |
GraphNodeEnumeration.next()
Return the next graph node in the enumeration. |
GraphNode |
SpaceEffGraphNode.InNodeEnumeration.nextElement()
|
GraphNode |
SpaceEffGraphNode.OutNodeEnumeration.nextElement()
|
GraphNode |
DepthFirstEnumerator.nextElement()
|
GraphNode |
DFSenumerateByFinish.nextElement()
Wrapper for next() to make the Enumeration interface happy |
GraphNode |
SpaceEffGraph.NodeEnumeration.nextElement()
|
GraphNode |
GraphNodeEnumerator.nextElement()
|
GraphNode |
GraphEdge.to()
|
GraphNode |
SpaceEffGraphEdge.to()
Get the end node for the edge. |
| Methods in org.jikesrvm.compilers.opt.util with parameters of type GraphNode | |
|---|---|
void |
SpaceEffGraph.addGraphEdge(GraphNode from,
GraphNode to)
Add an edge to the graph. |
void |
Graph.addGraphEdge(GraphNode source,
GraphNode target)
Add a new edge to a graph. |
void |
SpaceEffGraph.addGraphNode(GraphNode inode)
Add a node to the graph. |
void |
Graph.addGraphNode(GraphNode node)
Add a new graph node to the graph. |
protected GraphNodeEnumeration |
ReverseDFSenumerateByFinish.getConnected(GraphNode n)
Traverse edges from target to source. |
protected GraphNodeEnumeration |
DFSenumerateByFinish.getConnected(GraphNode n)
get the out edges of a given node |
protected GraphNodeEnumeration |
ReverseFilteredDFSenumerateByFinish.getConnected(GraphNode n)
|
protected GraphNodeEnumeration |
FilteredDFSenumerateByFinish.getConnected(GraphNode n)
|
boolean |
SpaceEffGraphNode.hasIn(GraphNode in)
|
boolean |
SpaceEffGraphNode.hasOut(GraphNode out)
|
GraphNodeEnumeration |
GraphEdgeFilter.inNodes(GraphNode node)
|
GraphNodeEnumeration |
GraphEdgeFilter.outNodes(GraphNode node)
|
| Method parameters in org.jikesrvm.compilers.opt.util with type arguments of type GraphNode | |
|---|---|
static GraphNodeEnumerator |
GraphNodeEnumerator.create(Enumeration<GraphNode> e)
|
static GraphNodeEnumerator |
GraphNodeEnumerator.create(Iterable<GraphNode> i)
|
static GraphNodeEnumerator |
GraphNodeEnumerator.create(Iterator<GraphNode> i)
|
private void |
SpaceEffGraph.print(Enumeration<GraphNode> e)
Print, to System.out, the basic blocks in the order given in the supplied enumeration. |
| Constructors in org.jikesrvm.compilers.opt.util with parameters of type GraphNode | |
|---|---|
DepthFirstEnumerator(GraphNode start,
int markNumber)
|
|
| Constructor parameters in org.jikesrvm.compilers.opt.util with type arguments of type GraphNode | |
|---|---|
GraphNodeEnumerator.Enum(Enumeration<GraphNode> e)
|
|
GraphNodeEnumerator.Iter(Iterator<GraphNode> i)
|
|
|
|||||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||||