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

Packages that use GraphNodeEnumeration
org.jikesrvm.compilers.opt.dfsolver   
org.jikesrvm.compilers.opt.util   
 

Uses of GraphNodeEnumeration in org.jikesrvm.compilers.opt.dfsolver
 

Methods in org.jikesrvm.compilers.opt.dfsolver that return GraphNodeEnumeration
 GraphNodeEnumeration DF_Graph.enumerateNodes()
          Enumerate the nodes in the graph.
 GraphNodeEnumeration DF_Equation.inNodes()
          Return an enumeration of the equations upon whose results this equation depends.
 GraphNodeEnumeration DF_AbstractCell.inNodes()
           
 GraphNodeEnumeration DF_Equation.outNodes()
          Return an enumeration of the equations which use the result of this equation.
 GraphNodeEnumeration DF_AbstractCell.outNodes()
           
 

Uses of GraphNodeEnumeration in org.jikesrvm.compilers.opt.util
 

Classes in org.jikesrvm.compilers.opt.util that implement GraphNodeEnumeration
 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 GraphNodeEnumerator
           
private static class GraphNodeEnumerator.Enum
           
private static class GraphNodeEnumerator.Iter
           
 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
           
private static class SpaceEffGraph.NodeEnumeration
           
(package private) static class SpaceEffGraphNode.InNodeEnumeration
           
(package private) static class SpaceEffGraphNode.OutNodeEnumeration
           
 

Fields in org.jikesrvm.compilers.opt.util declared as GraphNodeEnumeration
private  GraphNodeEnumeration DFSenumerateByFinish.e
          an enumeration of all nodes to search from
private  GraphNodeEnumeration[] DFSenumerateByFinish.info
          an enumeration of child nodes for each node being searched
 

Methods in org.jikesrvm.compilers.opt.util that return GraphNodeEnumeration
 GraphNodeEnumeration SpaceEffGraph.enumerateNodes()
          Enumerate the nodes in no particular order
 GraphNodeEnumeration Graph.enumerateNodes()
          This method lists all of the nodes in a given graph.
static GraphNodeEnumeration GraphUtilities.enumerateTopSort(Graph G)
          Return an enumeration of the nodes, or a subset of the nodes, in an acyclic graph in topological order .
static GraphNodeEnumeration GraphUtilities.enumerateTopSort(Graph G, GraphNodeEnumeration ie)
           
static GraphNodeEnumeration GraphUtilities.enumerateTopSort(Graph G, GraphNodeEnumeration ie, GraphEdgeFilter f)
           
private static GraphNodeEnumeration GraphUtilities.enumerateTopSortInternal(Graph G, GraphNodeEnumeration e)
           
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)
           
 GraphNodeEnumeration SpaceEffGraphNode.inNodes()
           
 GraphNodeEnumeration GraphNode.inNodes()
          Get an enumeration of all the edges at which edges that point to this node are sourced.
 GraphNodeEnumeration GraphEdgeFilter.inNodes(GraphNode node)
           
 GraphNodeEnumeration SpaceEffGraphNode.outNodes()
           
 GraphNodeEnumeration GraphNode.outNodes()
          Get an enumeration of all the edges to which edges sourced at this node point.
 GraphNodeEnumeration GraphEdgeFilter.outNodes(GraphNode node)
           
 

Methods in org.jikesrvm.compilers.opt.util with parameters of type GraphNodeEnumeration
static GraphNodeEnumeration GraphUtilities.enumerateTopSort(Graph G, GraphNodeEnumeration ie)
           
static GraphNodeEnumeration GraphUtilities.enumerateTopSort(Graph G, GraphNodeEnumeration ie, GraphEdgeFilter f)
           
private static GraphNodeEnumeration GraphUtilities.enumerateTopSortInternal(Graph G, GraphNodeEnumeration e)
           
 

Constructors in org.jikesrvm.compilers.opt.util with parameters of type GraphNodeEnumeration
DFSenumerateByFinish(Graph net, GraphNodeEnumeration nodes)
          Construct a depth-first enumerator across the (possibly improper) subset of nodes reachable from the nodes in the given enumeration.
FilteredDFSenumerateByFinish(Graph net, GraphNodeEnumeration nodes, GraphEdgeFilter filter)
           
ReverseDFSenumerateByFinish(Graph net, GraphNodeEnumeration nodes)
          Construct a reverse DFS across a subset of a graph, starting at the given set of nodes.
ReverseFilteredDFSenumerateByFinish(Graph net, GraphNodeEnumeration nodes, GraphEdgeFilter filter)