org.graalvm.compiler.replacements.amd64

Class AMD64CountLeadingZerosNode

java.lang.Object

org.graalvm.compiler.graph.Node

org.graalvm.compiler.nodes.ValueNode

org.graalvm.compiler.nodes.calc.FloatingNode

org.graalvm.compiler.nodes.calc.UnaryNode

org.graalvm.compiler.replacements.amd64.AMD64CountLeadingZerosNode

All Implemented Interfaces:

Cloneable, Formattable, Node.ValueNumberable, NodeInterface, Canonicalizable, Canonicalizable.Unary<ValueNode>, ArithmeticLIRLowerable, LIRLowerable, ValueNodeInterface

public final class AMD64CountLeadingZerosNode
extends UnaryNode
implements ArithmeticLIRLowerable

Count the number of leading zeros using the lzcntq or lzcntl instructions.

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.graph.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<AMD64CountLeadingZerosNode>	TYPE

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

value

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

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
AMD64CountLeadingZerosNode(ValueNode value)

Method Summary

Modifier and Type	Method and Description
ValueNode	canonical(CanonicalizerTool tool, ValueNode forValue) 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 int	countLeadingZeros(int i)
static int	countLeadingZeros(long i)
Stamp	foldStamp(Stamp newStamp) Compute an improved for this node using the passed in stamp.
void	generate(NodeLIRBuilderTool builder, ArithmeticLIRGeneratorTool gen)
static ValueNode	tryFold(ValueNode value)

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

getValue, inferStamp, setValue

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

asNode

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

asConstant, asJavaConstant, asSerializableConstant, getStackKind, graph, hasUsagesOtherThan, isAllowedUsageType, isConstant, isConstantPredicate, isDefaultConstant, isIllegalConstant, isJavaConstant, isNullConstant, isSerializableConstant, replaceAtAllUsages, replaceAtUsages, setStamp, stamp, updateStamp

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

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

Methods inherited from class java.lang.Object

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

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

generate

Methods inherited from interface org.graalvm.compiler.graph.spi.Canonicalizable.Unary

canonical

Field Detail

TYPE

public static final NodeClass<AMD64CountLeadingZerosNode> TYPE

Constructor Detail

AMD64CountLeadingZerosNode

public AMD64CountLeadingZerosNode(ValueNode value)

Method Detail

foldStamp

public Stamp foldStamp(Stamp newStamp)

Description copied from class: UnaryNode

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

Overrides:

foldStamp in class UnaryNode

tryFold

public static ValueNode tryFold(ValueNode value)

canonical

public ValueNode canonical(CanonicalizerTool tool,
                           ValueNode forValue)

Description copied from interface: Canonicalizable.Unary

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.Unary<ValueNode>

generate

public void generate(NodeLIRBuilderTool builder,
                     ArithmeticLIRGeneratorTool gen)

Specified by:

generate in interface ArithmeticLIRLowerable

countLeadingZeros

public static int countLeadingZeros(int i)

countLeadingZeros

public static int countLeadingZeros(long i)