public final class AndNode extends BinaryArithmeticNode<ArithmeticOpTable.BinaryOp.And> implements NarrowableArithmeticNode, Canonicalizable.BinaryCommutative<ValueNode>
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 |
|---|---|
static NodeClass<AndNode> |
TYPE |
x, yEMPTY_ARRAY, stampNODE_LIST, NOT_ITERABLE, TRACK_CREATION_POSITION, WithAllEdges, WithNoEdges, WithOnlyInputEdges, WithOnlySucessorEdges| 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,
NodeView view) |
static ValueNode |
eliminateRedundantBinaryArithmeticOp(ValueNode usingAndInput,
IntegerStamp usingAndOtherStamp)
Given a value which is an input to an
AndNode and an IntegerStamp for the other input
determine if the input can be simplified by folding away an AddNode or an
OrNode. |
void |
generate(NodeLIRBuilderTool nodeValueMap,
ArithmeticLIRGeneratorTool gen) |
protected ArithmeticOpTable.BinaryOp<ArithmeticOpTable.BinaryOp.And> |
getOp(ArithmeticOpTable table) |
add, add, add, branchlessMax, branchlessMin, foldStamp, getArithmeticOp, getArithmeticOpTable, getOp, isAssociative, maybeCommuteInputs, mul, mul, mul, reassociateMatchedValues, reassociateUnmatchedValues, shouldSwapInputs, sub, sub, sub, tryConstantFoldgetX, 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, waitisNarrowablegetArithmeticOpmaybeCommuteInputscanonical, getX, getYgenerateprotected ArithmeticOpTable.BinaryOp<ArithmeticOpTable.BinaryOp.And> getOp(ArithmeticOpTable table)
getOp in class BinaryArithmeticNode<ArithmeticOpTable.BinaryOp.And>public 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>canonical in class BinaryArithmeticNode<ArithmeticOpTable.BinaryOp.And>public static ValueNode eliminateRedundantBinaryArithmeticOp(ValueNode usingAndInput, IntegerStamp usingAndOtherStamp)
AndNode and an IntegerStamp for the other input
determine if the input can be simplified by folding away an AddNode or an
OrNode.usingAndInput - the AndNode ValueNode inputusingAndOtherStamp - the stamp of the other inputValueNode to use as a replacement input in place of the
usingAndInput input, null otherwisepublic void generate(NodeLIRBuilderTool nodeValueMap, ArithmeticLIRGeneratorTool gen)
generate in interface ArithmeticLIRLowerable