public final class BinaryMathIntrinsicNode extends BinaryNode implements ArithmeticLIRLowerable, Lowerable
| Modifier and Type | Class and Description |
|---|---|
static class |
BinaryMathIntrinsicNode.BinaryOperation |
Node.ConstantNodeParameter, Node.EdgeVisitor, Node.IndirectCanonicalization, Node.InjectedNodeParameter, Node.Input, Node.NodeInsertionStackTrace, Node.NodeIntrinsic, Node.NodeIntrinsicFactory, Node.OptionalInput, Node.Successor, Node.ValueNumberableCanonicalizable.Binary<T extends Node>, Canonicalizable.BinaryCommutative<T extends Node>, Canonicalizable.Ternary<T extends Node>, Canonicalizable.Unary<T extends Node>| Modifier and Type | Field and Description |
|---|---|
protected BinaryMathIntrinsicNode.BinaryOperation |
operation |
static NodeClass<BinaryMathIntrinsicNode> |
TYPE |
x, yEMPTY_ARRAY, stampNODE_LIST, NOT_ITERABLE, TRACK_CREATION_POSITION, WithAllEdges, WithNoEdges, WithOnlyInputEdges, WithOnlySucessorEdges| Modifier | Constructor and Description |
|---|---|
protected |
BinaryMathIntrinsicNode(ValueNode forX,
ValueNode forY,
BinaryMathIntrinsicNode.BinaryOperation op) |
| 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 double |
compute(double x,
double y,
BinaryMathIntrinsicNode.BinaryOperation op) |
static ValueNode |
create(ValueNode forX,
ValueNode forY,
BinaryMathIntrinsicNode.BinaryOperation op) |
Stamp |
foldStamp(Stamp stampX,
Stamp stampY)
Compute an improved for this node using the passed in stamps.
|
void |
generate(NodeLIRBuilderTool nodeValueMap,
ArithmeticLIRGeneratorTool gen) |
BinaryMathIntrinsicNode.BinaryOperation |
getOperation() |
protected static ValueNode |
tryConstantFold(ValueNode forX,
ValueNode forY,
BinaryMathIntrinsicNode.BinaryOperation op) |
getX, getY, inferStamp, setX, setYasConstant, asJavaConstant, asNode, asSerializableConstant, checkReplaceAtUsagesInvariants, getStackKind, graph, hasUsagesOtherThan, isAllowedUsageType, isConstant, isConstantPredicate, isDefaultConstant, isIllegalConstant, isJavaConstant, isNullConstant, isSerializableConstant, recursivelyDataFlowEqualsUpTo, setStamp, stamp, updateStamp, updateUsagesInterfaceafterClone, 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, withNodeSourcePositionclone, equals, getClass, notify, notifyAll, wait, wait, waitgenerateasNodecanonicalpublic static final NodeClass<BinaryMathIntrinsicNode> TYPE
protected final BinaryMathIntrinsicNode.BinaryOperation operation
protected BinaryMathIntrinsicNode(ValueNode forX, ValueNode forY, BinaryMathIntrinsicNode.BinaryOperation op)
public BinaryMathIntrinsicNode.BinaryOperation getOperation()
public static ValueNode create(ValueNode forX, ValueNode forY, BinaryMathIntrinsicNode.BinaryOperation op)
protected static ValueNode tryConstantFold(ValueNode forX, ValueNode forY, BinaryMathIntrinsicNode.BinaryOperation op)
public Stamp foldStamp(Stamp stampX, Stamp stampY)
BinaryNodeBinaryNode.x and BinaryNode.y. This code is used to provide the
default implementation of BinaryNode.inferStamp() and may be used by external optimizations.foldStamp in class BinaryNodepublic void generate(NodeLIRBuilderTool nodeValueMap, ArithmeticLIRGeneratorTool gen)
generate in interface ArithmeticLIRLowerablepublic ValueNode canonical(CanonicalizerTool tool, ValueNode forX, ValueNode forY)
Canonicalizable.BinaryCanonicalizable.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>public static double compute(double x,
double y,
BinaryMathIntrinsicNode.BinaryOperation op)