public final class FloatLessThanNode extends CompareNode
Node.ConstantNodeParameter, Node.InjectedNodeParameter, Node.Input, Node.NodeIntrinsic, Node.OptionalInput, Node.Successor, Node.ValueNumberable
Canonicalizable.Binary<T extends Node>, Canonicalizable.BinaryCommutative<T extends Node>, Canonicalizable.Unary<T extends Node>
Modifier and Type | Field and Description |
---|---|
static NodeClass<FloatLessThanNode> |
TYPE |
condition, unorderedIsTrue
x, y
NODE_LIST, NOT_ITERABLE, USE_UNSAFE_TO_CLONE, WithAllEdges, WithNoEdges, WithOnlyInputEdges, WithOnlySucessorEdges
Constructor and Description |
---|
FloatLessThanNode(ValueNode x,
ValueNode y,
boolean unorderedIsTrue) |
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 LogicNode |
create(ValueNode x,
ValueNode y,
boolean unorderedIsTrue,
ConstantReflectionProvider constantReflection) |
protected CompareNode |
duplicateModified(ValueNode newX,
ValueNode newY) |
Stamp |
getSucceedingStampForX(boolean negated) |
Stamp |
getSucceedingStampForY(boolean negated) |
TriState |
tryFold(Stamp xStampGeneric,
Stamp yStampGeneric) |
canonicalizeSymmetricConstant, condition, createCompareNode, createCompareNode, optimizeNormalizeCmp, tryConstantFold, unorderedIsTrue
generate, getX, getY, maybeCommuteInputs, verify
and, and, isContradiction, isTautology, or, or
asNode
asConstant, asJavaConstant, getKind, graph, inferStamp, isAllowedUsageType, isConstant, isConstantPredicate, isNullConstant, setStamp, stamp, updateStamp
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
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
canonical, getX, getY
public static final NodeClass<FloatLessThanNode> TYPE
public FloatLessThanNode(ValueNode x, ValueNode y, boolean unorderedIsTrue)
public static LogicNode create(ValueNode x, ValueNode y, boolean unorderedIsTrue, ConstantReflectionProvider constantReflection)
public ValueNode canonical(CanonicalizerTool tool, ValueNode forX, ValueNode forY)
Canonicalizable.Binary
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.canonical
in interface Canonicalizable.Binary<ValueNode>
canonical
in class CompareNode
protected CompareNode duplicateModified(ValueNode newX, ValueNode newY)
duplicateModified
in class CompareNode
public Stamp getSucceedingStampForX(boolean negated)
getSucceedingStampForX
in class BinaryOpLogicNode
public Stamp getSucceedingStampForY(boolean negated)
getSucceedingStampForY
in class BinaryOpLogicNode