com.oracle.graal.nodes.memory

Class MemoryAnchorNode

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

All Implemented Interfaces:

NodeInterface, Canonicalizable, MemoryNode, LIRLowerable, Cloneable, Formattable, KindProvider

public final class MemoryAnchorNode
extends FixedWithNextNode
implements LIRLowerable, MemoryNode, 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>

Field Summary

Fields

Modifier and Type	Field and Description
static NodeClass<MemoryAnchorNode>	TYPE

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
MemoryAnchorNode()

Method Summary

Modifier and Type	Method and Description
static StructuralInput.Memory	anchor()
Node	canonical(CanonicalizerTool tool) Implementations of this method can provide local optimizations like constant folding and strength reduction.
void	generate(NodeLIRBuilderTool generator)

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

asNode

Field Detail

TYPE

public static final NodeClass<MemoryAnchorNode> TYPE

Constructor Detail

MemoryAnchorNode

public MemoryAnchorNode()

Method Detail

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

anchor

public static StructuralInput.Memory anchor()