org.graalvm.compiler.nodes.calc

Class LeftShiftNode

java.lang.Object

org.graalvm.compiler.graph.Node

org.graalvm.compiler.nodes.ValueNode

org.graalvm.compiler.nodes.calc.FloatingNode

org.graalvm.compiler.nodes.calc.BinaryNode

org.graalvm.compiler.nodes.calc.ShiftNode<ArithmeticOpTable.ShiftOp.Shl>

org.graalvm.compiler.nodes.calc.LeftShiftNode

All Implemented Interfaces:

Cloneable, Formattable, Node.IndirectCanonicalization, Node.ValueNumberable, CanonicalizableMarker, ArithmeticOperation, NarrowableArithmeticNode, ArithmeticLIRLowerable, Canonicalizable, Canonicalizable.Binary<ValueNode>, LIRLowerable, ValueNodeInterface

public final class LeftShiftNode
extends ShiftNode<ArithmeticOpTable.ShiftOp.Shl>

Nested Class Summary

Nested classes/interfaces inherited from class org.graalvm.compiler.graph.Node

Node.ConstantNodeParameter, Node.EdgeVisitor, Node.IndirectCanonicalization, Node.InjectedNodeParameter, Node.Input, Node.NodeInsertionStackTrace, Node.NodeIntrinsic, Node.NodeIntrinsicFactory, Node.OptionalInput, Node.Successor, Node.ValueNumberable

Nested classes/interfaces inherited from interface org.graalvm.compiler.nodes.spi.Canonicalizable

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

Field Summary

Fields

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

Fields inherited from class org.graalvm.compiler.nodes.calc.BinaryNode

x, y

Fields inherited from class org.graalvm.compiler.nodes.ValueNode

EMPTY_ARRAY, stamp

Fields inherited from class org.graalvm.compiler.graph.Node

NODE_LIST, NOT_ITERABLE, TRACK_CREATION_POSITION, WithAllEdges, WithNoEdges, WithOnlyInputEdges, WithOnlySucessorEdges

Constructor Summary

Constructors

Constructor and Description
LeftShiftNode(ValueNode x, ValueNode y)

Method Summary

Modifier and Type	Method and Description
ValueNode	canonical(CanonicalizerTool tool, ValueNode forX, ValueNode forY) Similar to Canonicalizable.canonical(CanonicalizerTool), except that implementations should act as if the current input of the node was the given one, i.e., they should never look at the inputs via the this pointer.
static ValueNode	create(ValueNode x, ValueNode y, NodeView view)
void	generate(NodeLIRBuilderTool nodeValueMap, ArithmeticLIRGeneratorTool gen)
protected ArithmeticOpTable.ShiftOp<ArithmeticOpTable.ShiftOp.Shl>	getOp(ArithmeticOpTable table)
void	tryReplaceWithMulNode() Try to rewrite the current node to a MulNode iff the BinaryNode.getX() and BinaryNode.getY() inputs represent numeric integers and BinaryNode.getY() is a constant value.

Methods inherited from class org.graalvm.compiler.nodes.calc.ShiftNode

canonical, foldStamp, getArithmeticOp, getOp, getShiftAmountMask, isNarrowable

Methods inherited from class org.graalvm.compiler.nodes.calc.BinaryNode

getX, getY, inferStamp, setX, setY

Methods inherited from class org.graalvm.compiler.nodes.ValueNode

asConstant, asJavaConstant, asNode, asSerializableConstant, checkReplaceAtUsagesInvariants, getStackKind, graph, hasUsagesOtherThan, isAllowedUsageType, isConstant, isConstantPredicate, isDefaultConstant, isIllegalConstant, isJavaConstant, isNullConstant, isSerializableConstant, recursivelyDataFlowEqualsUpTo, setStamp, stamp, updateStamp, updateUsagesInterface

Methods inherited from class org.graalvm.compiler.graph.Node

afterClone, applyInputs, applySuccessors, assertFalse, assertTrue, cfgPredecessors, cfgSuccessors, clearInputs, clearNodeSourcePosition, clearSuccessors, copyWithInputs, copyWithInputs, dataFlowEquals, dynamicNodeSizeEstimate, estimatedNodeCycles, estimatedNodeSize, fail, formatTo, getCreationPosition, getDebug, getDebugProperties, getDebugProperties, getInsertionPosition, getNodeClass, getNodeSourcePosition, getOptions, getUsageCount, hasExactlyOneUsage, hashCode, hasMoreThanOneUsage, hasNoUsages, hasOnlyUsagesOfType, hasUsages, hasUsagesOfType, inputPositions, inputs, isAlive, isDeleted, isUnregistered, markDeleted, maybeNotifyZeroUsages, modCount, predecessor, pushInputs, removeUsage, replaceAllInputs, replaceAndDelete, replaceAtAllUsages, replaceAtMatchingUsages, replaceAtPredecessor, replaceAtUsages, replaceAtUsages, replaceAtUsages, replaceAtUsages, replaceAtUsages, replaceAtUsagesAndDelete, replaceAtUsagesAndDelete, replaceFirstInput, replaceFirstSuccessor, safeDelete, setCreationPosition, setInsertionPosition, setNodeSourcePosition, singleUsage, successorPositions, successors, toString, toString, updateNodeSourcePosition, updatePredecessor, updateUsages, usages, valueEquals, verify, verifyEdges, verifyInputs, verifySourcePosition, withNodeSourcePosition

Methods inherited from class java.lang.Object

clone, equals, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface org.graalvm.compiler.nodes.spi.ArithmeticLIRLowerable

generate

Methods inherited from interface org.graalvm.compiler.nodes.spi.Canonicalizable.Binary

canonical

Field Detail

TYPE

public static final NodeClass<LeftShiftNode> TYPE

Constructor Detail

LeftShiftNode

public LeftShiftNode(ValueNode x,
                     ValueNode y)

Method Detail

create

public static ValueNode create(ValueNode x,
                               ValueNode y,
                               NodeView view)

getOp

protected ArithmeticOpTable.ShiftOp<ArithmeticOpTable.ShiftOp.Shl> getOp(ArithmeticOpTable table)

Specified by:

getOp in class ShiftNode<ArithmeticOpTable.ShiftOp.Shl>

canonical

public ValueNode canonical(CanonicalizerTool tool,
                           ValueNode forX,
                           ValueNode forY)

Description copied from interface: Canonicalizable.Binary

Similar to Canonicalizable.canonical(CanonicalizerTool), except that implementations should act as if the current input of the node was the given one, i.e., they should never look at the inputs via the this pointer.

Specified by:

canonical in interface Canonicalizable.Binary<ValueNode>

Overrides:

canonical in class ShiftNode<ArithmeticOpTable.ShiftOp.Shl>

tryReplaceWithMulNode

public void tryReplaceWithMulNode()

Try to rewrite the current node to a MulNode iff the BinaryNode.getX() and BinaryNode.getY() inputs represent numeric integers and BinaryNode.getY() is a constant value. The resulting MulNode replaces the current node in the ValueNode.graph().

generate

public void generate(NodeLIRBuilderTool nodeValueMap,
                     ArithmeticLIRGeneratorTool gen)