public class PointerEqualsNode extends CompareNode implements Canonicalizable.BinaryCommutative<ValueNode>
Node.ConstantNodeParameter, Node.InjectedNodeParameter, Node.Input, Node.NodeIntrinsic, Node.OptionalInput, Node.Successor, Node.ValueNumberableCanonicalizable.Binary<T extends Node>, Canonicalizable.BinaryCommutative<T extends Node>, Canonicalizable.Unary<T extends Node>| Modifier and Type | Field and Description |
|---|---|
static NodeClass<PointerEqualsNode> |
TYPE |
condition, unorderedIsTruex, yNODE_LIST, NOT_ITERABLE, USE_UNSAFE_TO_CLONE, WithAllEdges, WithNoEdges, WithOnlyInputEdges, WithOnlySucessorEdges| Modifier | Constructor and Description |
|---|---|
protected |
PointerEqualsNode(NodeClass<? extends PointerEqualsNode> c,
ValueNode x,
ValueNode y) |
|
PointerEqualsNode(ValueNode x,
ValueNode y) |
| 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) |
protected CompareNode |
duplicateModified(ValueNode newX,
ValueNode newY) |
static LogicNode |
findSynonym(ValueNode forX,
ValueNode forY) |
Stamp |
getSucceedingStampForX(boolean negated) |
Stamp |
getSucceedingStampForY(boolean negated) |
TriState |
tryFold(Stamp xStampGeneric,
Stamp yStampGeneric) |
canonicalizeSymmetricConstant, condition, createCompareNode, createCompareNode, optimizeNormalizeCmp, tryConstantFold, unorderedIsTruegenerate, getX, getY, maybeCommuteInputs, verifyand, and, isContradiction, isTautology, or, orasNodeasConstant, asJavaConstant, getKind, graph, inferStamp, isAllowedUsageType, isConstant, isConstantPredicate, isNullConstant, setStamp, stamp, updateStampacceptInputs, 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, verifyInputsclone, finalize, getClass, notify, notifyAll, wait, wait, waitmaybeCommuteInputscanonical, getX, getYpublic static final NodeClass<PointerEqualsNode> TYPE
public PointerEqualsNode(ValueNode x, ValueNode y)
protected PointerEqualsNode(NodeClass<? extends PointerEqualsNode> c, ValueNode x, ValueNode y)
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 CompareNodepublic static LogicNode findSynonym(ValueNode forX, ValueNode forY)
protected CompareNode duplicateModified(ValueNode newX, ValueNode newY)
duplicateModified in class CompareNodepublic Stamp getSucceedingStampForX(boolean negated)
getSucceedingStampForX in class BinaryOpLogicNodepublic Stamp getSucceedingStampForY(boolean negated)
getSucceedingStampForY in class BinaryOpLogicNode