org.graalvm.compiler.nodes.calc

Class ShiftNode<OP>

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<OP>

All Implemented Interfaces:

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

Direct Known Subclasses:

LeftShiftNode, RightShiftNode, UnsignedRightShiftNode

public abstract class ShiftNode<OP>
extends BinaryNode
implements ArithmeticOperation, ArithmeticLIRLowerable, NarrowableArithmeticNode

The ShiftOp class represents shift operations.

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<ShiftNode>	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

Modifier	Constructor and Description
protected	ShiftNode(NodeClass<? extends ShiftNode<OP>> c, ArithmeticOpTable.ShiftOp<OP> opForStampComputation, ValueNode x, ValueNode s) Creates a new shift operation.

Method Summary

Modifier and Type	Method and Description
static <OP> ValueNode	canonical(ArithmeticOpTable.ShiftOp<OP> op, Stamp stamp, ValueNode forX, ValueNode forY, NodeView view)
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.
Stamp	foldStamp(Stamp stampX, Stamp stampY) Compute an improved for this node using the passed in stamps.
ArithmeticOpTable.ShiftOp<OP>	getArithmeticOp()
protected abstract ArithmeticOpTable.ShiftOp<OP>	getOp(ArithmeticOpTable table)
protected ArithmeticOpTable.ShiftOp<OP>	getOp(ValueNode forValue)
int	getShiftAmountMask()
boolean	isNarrowable(int resultBits) Check whether this operation can be narrowed to resultBits bit without loss of precision.

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, generate

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

canonical

Field Detail

TYPE

public static final NodeClass<ShiftNode> TYPE

Constructor Detail

ShiftNode

protected ShiftNode(NodeClass<? extends ShiftNode<OP>> c,
                    ArithmeticOpTable.ShiftOp<OP> opForStampComputation,
                    ValueNode x,
                    ValueNode s)

Creates a new shift operation.

Parameters:

x - the first input value

s - the second input value

Method Detail

getOp

protected abstract ArithmeticOpTable.ShiftOp<OP> getOp(ArithmeticOpTable table)

getOp

protected final ArithmeticOpTable.ShiftOp<OP> getOp(ValueNode forValue)

getArithmeticOp

public final ArithmeticOpTable.ShiftOp<OP> getArithmeticOp()

Specified by:

getArithmeticOp in interface ArithmeticOperation

foldStamp

public Stamp foldStamp(Stamp stampX,
                       Stamp stampY)

Description copied from class: BinaryNode

Compute an improved for this node using the passed in stamps. The stamps must be compatible with the current values of BinaryNode.x and BinaryNode.y. This code is used to provide the default implementation of BinaryNode.inferStamp() and may be used by external optimizations.

Specified by:

foldStamp in class BinaryNode

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>

canonical

public static <OP> ValueNode canonical(ArithmeticOpTable.ShiftOp<OP> op,
                                       Stamp stamp,
                                       ValueNode forX,
                                       ValueNode forY,
                                       NodeView view)

getShiftAmountMask

public int getShiftAmountMask()

isNarrowable

public boolean isNarrowable(int resultBits)

Description copied from interface: NarrowableArithmeticNode

Check whether this operation can be narrowed to resultBits bit without loss of precision.

Specified by:

isNarrowable in interface NarrowableArithmeticNode