com.oracle.graal.nodes

Class DynamicDeoptimizeNode

java.lang.Object

com.oracle.graal.graph.Node

com.oracle.graal.nodes.ValueNode

com.oracle.graal.nodes.FixedNode

com.oracle.graal.nodes.ControlSinkNode

com.oracle.graal.nodes.AbstractDeoptimizeNode

com.oracle.graal.nodes.DynamicDeoptimizeNode

All Implemented Interfaces:

IterableNodeType, NodeInterface, Canonicalizable, DeoptimizingNode, DeoptimizingNode.DeoptBefore, LIRLowerable, Lowerable, NodeWithState, Cloneable, Formattable, KindProvider

public final class DynamicDeoptimizeNode
extends AbstractDeoptimizeNode
implements LIRLowerable, Lowerable, Canonicalizable

Nested Class Summary

Nested classes/interfaces inherited from class com.oracle.graal.graph.Node

Node.ConstantNodeParameter, Node.InjectedNodeParameter, Node.Input, Node.NodeIntrinsic, Node.OptionalInput, Node.Successor, Node.ValueNumberable

Nested classes/interfaces inherited from interface com.oracle.graal.graph.spi.Canonicalizable

Canonicalizable.Binary<T extends Node>, Canonicalizable.BinaryCommutative<T extends Node>, Canonicalizable.Unary<T extends Node>

Nested classes/interfaces inherited from interface com.oracle.graal.nodes.DeoptimizingNode

DeoptimizingNode.DeoptAfter, DeoptimizingNode.DeoptBefore, DeoptimizingNode.DeoptDuring

Field Summary

Fields

Modifier and Type	Field and Description
(package private) ValueNode	actionAndReason
(package private) ValueNode	speculation
static NodeClass<DynamicDeoptimizeNode>	TYPE

Fields inherited from class com.oracle.graal.nodes.AbstractDeoptimizeNode

stateBefore

Fields inherited from class com.oracle.graal.nodes.ValueNode

stamp

Fields inherited from class com.oracle.graal.graph.Node

NODE_LIST, NOT_ITERABLE, USE_UNSAFE_TO_CLONE, WithAllEdges, WithNoEdges, WithOnlyInputEdges, WithOnlySucessorEdges

Constructor Summary

Constructors

Constructor and Description
DynamicDeoptimizeNode(ValueNode actionAndReason, ValueNode speculation)

Method Summary

Modifier and Type	Method and Description
Node	canonical(CanonicalizerTool tool) Implementations of this method can provide local optimizations like constant folding and strength reduction.
void	generate(NodeLIRBuilderTool generator)
ValueNode	getActionAndReason()
ValueNode	getActionAndReason(MetaAccessProvider metaAccess)
ValueNode	getSpeculation()
ValueNode	getSpeculation(MetaAccessProvider metaAccess)
void	lower(LoweringTool tool) Expand this node into lower level nodes expressing the same semantics.

Methods inherited from class com.oracle.graal.nodes.AbstractDeoptimizeNode

canDeoptimize, setStateBefore, stateBefore

Methods inherited from class com.oracle.graal.nodes.FixedNode

asNode, verify

Methods inherited from class com.oracle.graal.nodes.ValueNode

asConstant, asJavaConstant, getKind, graph, inferStamp, isAllowedUsageType, isConstant, isConstantPredicate, isNullConstant, setStamp, stamp, updateStamp

Methods inherited from class com.oracle.graal.graph.Node

acceptInputs, acceptSuccessors, afterClone, assertFalse, assertTrue, cfgPredecessors, cfgSuccessors, clearInputs, clearSuccessors, copyWithInputs, copyWithInputs, equals, fail, formatTo, getDebugProperties, getDebugProperties, getId, getNodeClass, getUsageAt, getUsageCount, hashCode, hasNoUsages, hasUsages, inputs, isAlive, isDeleted, markDeleted, modCount, newIdentityMap, newIdentityMap, newIdentityMap, newMap, newMap, newMap, newSet, newSet, predecessor, pushInputs, removeUsage, replaceAndDelete, replaceAtMatchingUsages, replaceAtPredecessor, replaceAtUsages, replaceAtUsages, replaceAtUsages, replaceFirstInput, replaceFirstSuccessor, safeDelete, simplify, successors, toString, toString, updatePredecessor, updateUsages, updateUsagesInterface, usages, valueEquals, verifyEdges, verifyInputs

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface com.oracle.graal.nodes.spi.Lowerable

asNode

Methods inherited from interface com.oracle.graal.nodes.spi.NodeWithState

states

Field Detail

TYPE

public static final NodeClass<DynamicDeoptimizeNode> TYPE

actionAndReason

ValueNode actionAndReason

speculation

ValueNode speculation

Constructor Detail

DynamicDeoptimizeNode

public DynamicDeoptimizeNode(ValueNode actionAndReason,
                             ValueNode speculation)

Method Detail

getActionAndReason

public ValueNode getActionAndReason()

getSpeculation

public ValueNode getSpeculation()

getActionAndReason

public ValueNode getActionAndReason(MetaAccessProvider metaAccess)

Specified by:

getActionAndReason in class AbstractDeoptimizeNode

getSpeculation

public ValueNode getSpeculation(MetaAccessProvider metaAccess)

Specified by:

getSpeculation in class AbstractDeoptimizeNode

lower

public void lower(LoweringTool tool)

Description copied from interface: Lowerable

Expand this node into lower level nodes expressing the same semantics. If the introduced nodes are themselves lowerable, they should be recursively lowered as part of this call.

Specified by:

lower in interface Lowerable

generate

public void generate(NodeLIRBuilderTool generator)

Specified by:

generate in interface LIRLowerable

canonical

public Node canonical(CanonicalizerTool tool)

Description copied from interface: Canonicalizable

Implementations of this method can provide local optimizations like constant folding and strength reduction. Implementations should look at the properties and inputs of the current node and determine if there is a more optimal and always semantically correct replacement.
The return value determines the effect that the canonicalization will have:

• Returning an pre-existing node will replace the current node with the given one.
• Returning a newly created node (that was not yet added to the graph) will replace the current node with the given one, after adding it to the graph. If both the replacement and the replacee are anchored in control flow (fixed nodes), the replacement will be added to the control flow. It is invalid to replace a non-fixed node with a newly created fixed node (because its placement in the control flow cannot be determined without scheduling).
• Returning null will delete the current node and replace it with null at all usages. Note that it is not necessary to delete floating nodes that have no more usages this way - they will be deleted automatically.

Specified by:

canonical in interface Canonicalizable

Parameters:

tool - provides access to runtime interfaces like MetaAccessProvider