com.oracle.graal.phases.util

Class GraphOrder

java.lang.Object

com.oracle.graal.phases.util.GraphOrder

public final class GraphOrder
extends Object

Constructor Summary

Constructors

Modifier	Constructor and Description
private	GraphOrder()

Method Summary

Modifier and Type	Method and Description
static boolean	assertNonCyclicGraph(StructuredGraph graph) Quick (and imprecise) assertion that there are no (invalid) cycles in the given graph.
static boolean	assertSchedulableGraph(StructuredGraph graph) This method schedules the graph and makes sure that, for every node, all inputs are available at the position where it is scheduled.
private static List<Node>	createOrder(StructuredGraph graph)
private static void	visitForward(ArrayList<Node> nodes, NodeBitMap visited, Node node, boolean floatingOnly)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

GraphOrder

private GraphOrder()

Method Detail

assertNonCyclicGraph

public static boolean assertNonCyclicGraph(StructuredGraph graph)

Quick (and imprecise) assertion that there are no (invalid) cycles in the given graph. First, an ordered list of all nodes in the graph (a total ordering) is created. A second run over this list checks whether inputs are scheduled before their usages.

Parameters:

graph - the graph to be checked.

Throws:

AssertionError - if a cycle was detected.

createOrder

private static List<Node> createOrder(StructuredGraph graph)

visitForward

private static void visitForward(ArrayList<Node> nodes,
                                 NodeBitMap visited,
                                 Node node,
                                 boolean floatingOnly)

assertSchedulableGraph

public static boolean assertSchedulableGraph(StructuredGraph graph)

This method schedules the graph and makes sure that, for every node, all inputs are available at the position where it is scheduled. This is a very expensive assertion. Also, this phase assumes ProxyNodes to exist at LoopExitNodes, so that it cannot be run after phases that remove loop proxies or move proxies to BeginNodes.