Uses of Class
org.jikesrvm.compilers.opt.util.SortedGraphNode

Packages that use SortedGraphNode

Package	Description
org.jikesrvm.compilers.opt.ir
org.jikesrvm.compilers.opt.util

Uses of SortedGraphNode in org.jikesrvm.compilers.opt.ir

Subclasses of SortedGraphNode in org.jikesrvm.compilers.opt.ir

Modifier and Type	Class and Description
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.

Methods in org.jikesrvm.compilers.opt.ir that return SortedGraphNode

Modifier and Type	Method and Description
SortedGraphNode	ControlFlowGraph.buildRevTopSort() Builds the reverse topological order, i.e., the topsort order on the reverse graph.
SortedGraphNode	ControlFlowGraph.startNode(boolean forward) Return the node to start with for a topological traversal of the FCFG.

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

Fields in org.jikesrvm.compilers.opt.util declared as SortedGraphNode

Modifier and Type	Field and Description
protected SortedGraphNode	SortedGraphIterator.barrier The earliest place where we needed to move currentNode back in the list because its successor needed to be processed.
protected SortedGraphNode	SortedGraphIterator.currentNode The current node we are processing
private SortedGraphNode	TopSort.lastNumberedNode the last node to get a number
SortedGraphNode	SortedGraphNode.sortedNext
SortedGraphNode	SortedGraphNode.sortedPrev

Methods in org.jikesrvm.compilers.opt.util that return SortedGraphNode

Modifier and Type	Method and Description
SortedGraphNode	SpaceEffGraph.buildRevTopSort() Build a reverse topological sort of this graph
static SortedGraphNode	TopSort.buildTopological(TopSortInterface graph, boolean forward)
SortedGraphNode	SortedGraphNode.getBackwardSortedNext()
SortedGraphNode	SortedGraphNode.getForwardSortedNext()
SortedGraphNode	SortedGraphNode.getSortedNext(boolean forward)
SortedGraphNode	SortedGraphIterator.markAndGetNextTopSort(boolean changed) General fixed-pointer iterator; call this repeatedly until there is no more work to do.
SortedGraphNode	SpaceEffGraph.startNode(boolean forward)
SortedGraphNode	TopSortInterface.startNode(boolean forward) Return the start node if forward = true for forward topsort, and return the end node if forward = false for backward topsort.

Methods in org.jikesrvm.compilers.opt.util that return types with arguments of type SortedGraphNode

Modifier and Type	Method and Description
abstract Enumeration<? extends SortedGraphNode>	SortedGraphNode.getInNodes()
abstract Enumeration<? extends SortedGraphNode>	SortedGraphNode.getOutNodes()

Methods in org.jikesrvm.compilers.opt.util with parameters of type SortedGraphNode

Modifier and Type	Method and Description
private void	TopSort.DFS(SortedGraphNode node, int numNodes) Depth-first numbering in a non-recursive manner
static int	SortedGraphNode.getNewSortMarker(SortedGraphNode anchor)
boolean	SortedGraphIterator.isSinglePredecessor(SortedGraphNode currentNode, SortedGraphNode nextNode) This method checks to see if the second parameter has a single successor, which is the first parameter.
boolean	SortedGraphIterator.isSingleSuccessor(SortedGraphNode currentNode, SortedGraphNode nextNode) This method checks to see if the second parameter has a single predecessor, which is the first parameter.
void	SortedGraphNode.setSortedNext(SortedGraphNode next, boolean forward)

Constructors in org.jikesrvm.compilers.opt.util with parameters of type SortedGraphNode

Constructor and Description
SortedGraphIterator(SortedGraphNode current, boolean forward) Constructor