Overview  Package  Class   Use  Tree  Serialized  Deprecated  Index  Help 
 PREV   NEXT FRAMES    NO FRAMES    

Uses of Interface
org.jikesrvm.compilers.opt.util.GraphNode

Packages that use GraphNode
org.jikesrvm.compilers.opt.controlflow   
org.jikesrvm.compilers.opt.depgraph   
org.jikesrvm.compilers.opt.dfsolver   
org.jikesrvm.compilers.opt.ir   
org.jikesrvm.compilers.opt.regalloc   
org.jikesrvm.compilers.opt.ssa   
org.jikesrvm.compilers.opt.util   
 

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
          Represents a single lattice cell in a dataflow equation system.
 

Classes in org.jikesrvm.compilers.opt.dfsolver that implement GraphNode
 class DF_AbstractCell
          Represents a single lattice cell in a dataflow system.
 class DF_Equation
          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 that return types with arguments of type GraphNode
 Enumeration<GraphNode> DF_Graph.enumerateNodes()
          Enumerate the nodes in the graph.
 Enumeration<GraphNode> DF_AbstractCell.inNodes()
           
 Enumeration<GraphNode> DF_Equation.inNodes()
          Return an enumeration of the equations upon whose results this equation depends.
 Enumeration<GraphNode> DF_AbstractCell.outNodes()
           
 Enumeration<GraphNode> DF_Equation.outNodes()
          Return an enumeration of the equations which use the result of this equation.
 

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)
           
 

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 bottom 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  Enumeration<GraphNode> DFSenumerateByFinish.e
          an enumeration of all nodes to search from
private  Iterator<GraphNode> GraphNodeEnumerator.Iter.i
           
private  List<Enumeration<GraphNode>> DFSenumerateByFinish.info
          an enumeration of child nodes for each node being searched
private  Stack<GraphNode> DepthFirstEnumerator.stack
           
private  Set<GraphNode> DepthFirstEnumerator.visited
           
 

Methods in org.jikesrvm.compilers.opt.util that return GraphNode
 GraphNode SpaceEffGraphEdge.from()
          Get the start node for the edge.
 GraphNode GraphEdge.from()
           
 GraphNode DepthFirstEnumerator.nextElement()
           
 GraphNode SpaceEffGraph.NodeEnumeration.nextElement()
           
abstract  GraphNode GraphNodeEnumerator.nextElement()
           
 GraphNode GraphNodeEnumerator.Enum.nextElement()
           
 GraphNode GraphNodeEnumerator.Iter.nextElement()
           
 GraphNode DFSenumerateByFinish.nextElement()
          Find the next graph node in finishing time order.
 GraphNode SpaceEffGraphNode.InNodeEnumeration.nextElement()
           
 GraphNode SpaceEffGraphNode.OutNodeEnumeration.nextElement()
           
 GraphNode SpaceEffGraphEdge.to()
          Get the end node for the edge.
 GraphNode GraphEdge.to()
           
 

Methods in org.jikesrvm.compilers.opt.util that return types with arguments of type GraphNode
 Enumeration<GraphNode> SpaceEffGraph.enumerateNodes()
          Enumerate the nodes in no particular order
 Enumeration<GraphNode> Graph.enumerateNodes()
          This method lists all of the nodes in a given graph.
static Enumeration<GraphNode> GraphUtilities.enumerateTopSort(Graph G)
          Return an enumeration of the nodes, or a subset of the nodes, in an acyclic graph in topological order.
static Enumeration<GraphNode> GraphUtilities.enumerateTopSort(Graph G, Enumeration<GraphNode> ie)
           
static Enumeration<GraphNode> GraphUtilities.enumerateTopSort(Graph G, Enumeration<GraphNode> ie, GraphEdgeFilter f)
           
private static Enumeration<GraphNode> GraphUtilities.enumerateTopSortInternal(Graph G, Enumeration<GraphNode> e)
           
protected  Enumeration<GraphNode> ReverseDFSenumerateByFinish.getConnected(GraphNode n)
          Traverse edges from target to source.
protected  Enumeration<GraphNode> FilteredDFSenumerateByFinish.getConnected(GraphNode n)
           
protected  Enumeration<GraphNode> ReverseFilteredDFSenumerateByFinish.getConnected(GraphNode n)
           
protected  Enumeration<GraphNode> DFSenumerateByFinish.getConnected(GraphNode n)
          get the out edges of a given node
 Enumeration<GraphNode> GraphNode.inNodes()
          Get an enumeration of all the edges at which edges that point to this node are sourced.
 Enumeration<GraphNode> SpaceEffGraphNode.inNodes()
           
 Enumeration<GraphNode> GraphEdgeFilter.inNodes(GraphNode node)
           
 Enumeration<GraphNode> GraphNode.outNodes()
          Get an enumeration of all the edges to which edges sourced at this node point.
 Enumeration<GraphNode> SpaceEffGraphNode.outNodes()
           
 Enumeration<GraphNode> GraphEdgeFilter.outNodes(GraphNode node)
           
 

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)
           
 void Graph.addGraphNode(GraphNode node)
          Add a new graph node to the graph.
protected  Enumeration<GraphNode> ReverseDFSenumerateByFinish.getConnected(GraphNode n)
          Traverse edges from target to source.
protected  Enumeration<GraphNode> FilteredDFSenumerateByFinish.getConnected(GraphNode n)
           
protected  Enumeration<GraphNode> ReverseFilteredDFSenumerateByFinish.getConnected(GraphNode n)
           
protected  Enumeration<GraphNode> DFSenumerateByFinish.getConnected(GraphNode n)
          get the out edges of a given node
 boolean SpaceEffGraphNode.hasIn(GraphNode in)
           
 boolean SpaceEffGraphNode.hasOut(GraphNode out)
           
 Enumeration<GraphNode> GraphEdgeFilter.inNodes(GraphNode node)
           
private  boolean DepthFirstEnumerator.notVisited(GraphNode node)
           
 Enumeration<GraphNode> 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)
           
static Enumeration<GraphNode> GraphUtilities.enumerateTopSort(Graph G, Enumeration<GraphNode> ie)
           
static Enumeration<GraphNode> GraphUtilities.enumerateTopSort(Graph G, Enumeration<GraphNode> ie, GraphEdgeFilter f)
           
private static Enumeration<GraphNode> GraphUtilities.enumerateTopSortInternal(Graph G, Enumeration<GraphNode> e)
           
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)
           
 

Constructor parameters in org.jikesrvm.compilers.opt.util with type arguments of type GraphNode
DFSenumerateByFinish(Graph net, Enumeration<GraphNode> nodes)
          Construct a depth-first enumerator across the (possibly improper) subset of nodes reachable from the nodes in the given enumeration.
FilteredDFSenumerateByFinish(Graph net, Enumeration<GraphNode> nodes, GraphEdgeFilter filter)
           
GraphNodeEnumerator.Enum(Enumeration<GraphNode> e)
           
GraphNodeEnumerator.Iter(Iterator<GraphNode> i)
           
ReverseDFSenumerateByFinish(Graph net, Enumeration<GraphNode> nodes)
          Construct a reverse DFS across a subset of a graph, starting at the given set of nodes.
ReverseFilteredDFSenumerateByFinish(Graph net, Enumeration<GraphNode> nodes, GraphEdgeFilter filter)
           
 

Overview  Package  Class   Use  Tree  Serialized  Deprecated  Index  Help 
 PREV   NEXT FRAMES    NO FRAMES