com.oracle.graal.nodes.extended

Class JavaReadNode

java.lang.Object

com.oracle.graal.graph.Node

com.oracle.graal.nodes.ValueNode

com.oracle.graal.nodes.FixedNode

com.oracle.graal.nodes.FixedWithNextNode

com.oracle.graal.nodes.DeoptimizingFixedWithNextNode

com.oracle.graal.nodes.memory.FixedAccessNode

com.oracle.graal.nodes.extended.JavaReadNode

All Implemented Interfaces:

NodeInterface, Canonicalizable, DeoptimizingNode, DeoptimizingNode.DeoptBefore, GuardedNode, GuardingNode, Access, HeapAccess, Lowerable, NodeWithState, Cloneable, Formattable, KindProvider

public final class JavaReadNode
extends FixedAccessNode
implements Lowerable, GuardingNode, Canonicalizable

Read a raw memory location according to Java field or array read semantics. It will perform read barriers, implicit conversions and optionally oop uncompression.

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.memory.HeapAccess

HeapAccess.BarrierType

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
protected boolean	compressible
protected Kind	readKind
static NodeClass<JavaReadNode>	TYPE

Fields inherited from class com.oracle.graal.nodes.memory.FixedAccessNode

barrierType, guard, location, nullCheck

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

stateBefore

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

next

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
JavaReadNode(Kind readKind, AddressNode address, LocationIdentity location, HeapAccess.BarrierType barrierType, boolean compressible)

Method Summary

Modifier and Type	Method and Description
boolean	canNullCheck()
Node	canonical(CanonicalizerTool tool) Implementations of this method can provide local optimizations like constant folding and strength reduction.
Kind	getReadKind()
boolean	isCompressible()
void	lower(LoweringTool tool) Expand this node into lower level nodes expressing the same semantics.

Methods inherited from class com.oracle.graal.nodes.memory.FixedAccessNode

canDeoptimize, getAddress, getBarrierType, getGuard, getLocationIdentity, getNullCheck, setAddress, setGuard, setNullCheck

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

setStateBefore, stateBefore

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

asNode, next, setNext

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

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.extended.GuardingNode

asNode

Methods inherited from interface com.oracle.graal.nodes.extended.GuardedNode

asNode

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

states

Field Detail

TYPE

public static final NodeClass<JavaReadNode> TYPE

readKind

protected final Kind readKind

compressible

protected final boolean compressible

Constructor Detail

JavaReadNode

public JavaReadNode(Kind readKind,
                    AddressNode address,
                    LocationIdentity location,
                    HeapAccess.BarrierType barrierType,
                    boolean compressible)

Method Detail

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

canNullCheck

public boolean canNullCheck()

Specified by:

canNullCheck in interface Access

getReadKind

public Kind getReadKind()

isCompressible

public boolean isCompressible()

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