com.oracle.graal.nodes.util

Class GraphUtil

java.lang.Object

com.oracle.graal.nodes.util.GraphUtil

public class GraphUtil
extends Object

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
private static class	GraphUtil.DefaultSimplifierTool
(package private) static class	GraphUtil.OriginalValueSearch Exhaustive search for originalValue(ValueNode) when a simple search fails.

Field Summary

Fields

Modifier and Type	Field and Description
private static NodePredicate	FLOATING

Constructor Summary

Constructors

Constructor and Description
GraphUtil()

Method Summary

Modifier and Type	Method and Description
static RuntimeException	approxSourceException(Node node, Throwable cause) Gets an approximate source code location for a node, encoded as an exception, if possible.
static String	approxSourceLocation(Node node) Gets an approximate source code location for a node if possible.
static StackTraceElement[]	approxSourceStackTraceElement(FrameState frameState) Gets an approximate source code location for frame state.
static StackTraceElement[]	approxSourceStackTraceElement(Node node) Gets an approximate source code location for a node if possible.
static ValueNode	arrayLength(ValueNode value) Looks for an ArrayLengthProvider while iterating through all ValueProxies.
static void	checkRedundantPhi(PhiNode phiNode)
static void	checkRedundantProxy(ProxyNode vpn)
static BailoutException	createBailoutException(String message, Throwable cause, StackTraceElement[] elements) Creates a bailout exception with the given stack trace elements and message.
static SimplifierTool	getDefaultSimplifier(MetaAccessProvider metaAccess, ConstantReflectionProvider constantReflection, boolean canonicalizeReads)
static NodePredicate	isFloatingNode()
static void	killCFG(Node node)
static void	killCFG(Node node, SimplifierTool tool)
private static void	killEnd(AbstractEndNode end, SimplifierTool tool)
static void	killWithUnusedFloatingInputs(Node node)
private static void	normalizeLoopBegin(LoopBeginNode begin)
static void	normalizeLoops(StructuredGraph graph) Remove loop header without loop ends.
static ValueNode	originalValue(ValueNode proxy) Tries to find an original value of the given node by traversing through proxies and unambiguous phis.
static NodeIterable<FixedNode>	predecessorIterable(FixedNode start) Returns an iterator that will return the given node followed by all its predecessors, up until the point where Node.predecessor() returns null.
private static void	propagateKill(Node node)
static void	removeFixedWithUnusedInputs(FixedWithNextNode fixed)
static String	toString(Iterable<?> objects) Returns a string representation of the given collection of objects.
static boolean	tryKillUnused(Node node)
static void	unlinkFixedNode(FixedWithNextNode fixed)
static ValueNode	unproxify(ValueNode value) Gets the original value by iterating through all ValueProxies.

Methods inherited from class java.lang.Object

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

Field Detail

FLOATING

private static final NodePredicate FLOATING

Constructor Detail

GraphUtil

public GraphUtil()

Method Detail

killCFG

public static void killCFG(Node node,
                           SimplifierTool tool)

killCFG

public static void killCFG(Node node)

killEnd

private static void killEnd(AbstractEndNode end,
                            SimplifierTool tool)

isFloatingNode

public static NodePredicate isFloatingNode()

propagateKill

private static void propagateKill(Node node)

killWithUnusedFloatingInputs

public static void killWithUnusedFloatingInputs(Node node)

removeFixedWithUnusedInputs

public static void removeFixedWithUnusedInputs(FixedWithNextNode fixed)

unlinkFixedNode

public static void unlinkFixedNode(FixedWithNextNode fixed)

checkRedundantPhi

public static void checkRedundantPhi(PhiNode phiNode)

checkRedundantProxy

public static void checkRedundantProxy(ProxyNode vpn)

normalizeLoops

public static void normalizeLoops(StructuredGraph graph)

Remove loop header without loop ends. This can happen with degenerated loops like this one:

 for (;;) {
     try {
         break;
     } catch (UnresolvedException iioe) {
     }
 }
 

normalizeLoopBegin

private static void normalizeLoopBegin(LoopBeginNode begin)

approxSourceStackTraceElement

public static StackTraceElement[] approxSourceStackTraceElement(Node node)

Gets an approximate source code location for a node if possible.

Returns:

the StackTraceElements if an approximate source location is found, null otherwise

approxSourceStackTraceElement

public static StackTraceElement[] approxSourceStackTraceElement(FrameState frameState)

Gets an approximate source code location for frame state.

Returns:

the StackTraceElements if an approximate source location is found, null otherwise

approxSourceException

public static RuntimeException approxSourceException(Node node,
                                                     Throwable cause)

Gets an approximate source code location for a node, encoded as an exception, if possible.

Returns:

the exception with the location

createBailoutException

public static BailoutException createBailoutException(String message,
                                                      Throwable cause,
                                                      StackTraceElement[] elements)

Creates a bailout exception with the given stack trace elements and message.

Parameters:

message - the message of the exception

elements - the stack trace elements

Returns:

the exception

approxSourceLocation

public static String approxSourceLocation(Node node)

Gets an approximate source code location for a node if possible.

Returns:

a file name and source line number in stack trace format (e.g. "String.java:32") if an approximate source location is found, null otherwise

toString

public static String toString(Iterable<?> objects)

Returns a string representation of the given collection of objects.

Parameters:

objects - The Iterable that will be used to iterate over the objects.

Returns:

A string of the format "[a, b, ...]".

unproxify

public static ValueNode unproxify(ValueNode value)

Gets the original value by iterating through all ValueProxies.

Parameters:

value - The start value.

Returns:

The first non-proxy value encountered.

arrayLength

public static ValueNode arrayLength(ValueNode value)

Looks for an ArrayLengthProvider while iterating through all ValueProxies.

Parameters:

value - The start value.

Returns:

The array length if one was found, or null otherwise.

originalValue

public static ValueNode originalValue(ValueNode proxy)

Tries to find an original value of the given node by traversing through proxies and unambiguous phis. Note that this method will perform an exhaustive search through phis. It is intended to be used during graph building, when phi nodes aren't yet canonicalized.

Parameters:

proxy - The node whose original value should be determined.

tryKillUnused

public static boolean tryKillUnused(Node node)

predecessorIterable

public static NodeIterable<FixedNode> predecessorIterable(FixedNode start)

Returns an iterator that will return the given node followed by all its predecessors, up until the point where Node.predecessor() returns null.

Parameters:

start - the node at which to start iterating

getDefaultSimplifier

public static SimplifierTool getDefaultSimplifier(MetaAccessProvider metaAccess,
                                                  ConstantReflectionProvider constantReflection,
                                                  boolean canonicalizeReads)