com.oracle.graal.nodes.calc

Class NormalizeCompareNode

java.lang.Object

com.oracle.graal.graph.Node

com.oracle.graal.nodes.ValueNode

com.oracle.graal.nodes.calc.FloatingNode

com.oracle.graal.nodes.calc.BinaryNode

com.oracle.graal.nodes.calc.NormalizeCompareNode

All Implemented Interfaces:

Node.ValueNumberable, NodeInterface, Canonicalizable, Canonicalizable.Binary<ValueNode>, Lowerable, Cloneable, Formattable, KindProvider

public final class NormalizeCompareNode
extends BinaryNode
implements Lowerable

Returns -1, 0, or 1 if either x < y, x == y, or x > y. If the comparison is undecided (one of the inputs is NaN), the result is 1 if isUnorderedLess is false and -1 if isUnorderedLess is true.

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
protected boolean	isUnorderedLess
static NodeClass<NormalizeCompareNode>	TYPE

Fields inherited from class com.oracle.graal.nodes.calc.BinaryNode

x, y

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
NormalizeCompareNode(ValueNode x, ValueNode y, boolean isUnorderedLess)

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, boolean isUnorderedLess, ConstantReflectionProvider constantReflection)
void	lower(LoweringTool tool) Expand this node into lower level nodes expressing the same semantics.

Methods inherited from class com.oracle.graal.nodes.calc.BinaryNode

getX, getY, setX, setY

Methods inherited from class com.oracle.graal.nodes.calc.FloatingNode

asNode

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, verify, 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.graph.spi.Canonicalizable.Binary

canonical

Field Detail

TYPE

public static final NodeClass<NormalizeCompareNode> TYPE

isUnorderedLess

protected final boolean isUnorderedLess

Constructor Detail

NormalizeCompareNode

public NormalizeCompareNode(ValueNode x,
                            ValueNode y,
                            boolean isUnorderedLess)

Method Detail

create

public static ValueNode create(ValueNode x,
                               ValueNode y,
                               boolean isUnorderedLess,
                               ConstantReflectionProvider constantReflection)

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>

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