com.oracle.graal.nodes.calc

Class BinaryArithmeticNode<OP>

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.BinaryArithmeticNode<OP>

All Implemented Interfaces:

Node.ValueNumberable, Canonicalizable, Canonicalizable.Binary<ValueNode>, ArithmeticOperation, ArithmeticLIRLowerable, Cloneable, Formattable, KindProvider

Direct Known Subclasses:

AddNode, AndNode, DivNode, MulNode, OrNode, RemNode, SubNode, XorNode

public abstract class BinaryArithmeticNode<OP>
extends BinaryNode
implements ArithmeticLIRLowerable, Canonicalizable.Binary<ValueNode>

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
private static class	BinaryArithmeticNode.ReassociateMatch
protected static interface	BinaryArithmeticNode.SerializableBinaryFunction<T>

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 BinaryArithmeticNode.SerializableBinaryFunction<OP>	getOp
static NodeClass<BinaryArithmeticNode>	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

Modifier	Constructor and Description
protected	BinaryArithmeticNode(NodeClass<? extends BinaryArithmeticNode<OP>> c, BinaryArithmeticNode.SerializableBinaryFunction<OP> getOp, ValueNode x, ValueNode y)

Method Summary

Modifier and Type	Method and Description
static AddNode	add(StructuredGraph graph, ValueNode v1, ValueNode v2)
static AddNode	add(ValueNode v1, ValueNode v2)
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.
private static BinaryArithmeticNode.ReassociateMatch	findReassociate(BinaryNode binary, NodePredicate criterion)
protected ArithmeticOpTable.BinaryOp<OP>	getOp(ValueNode forX, ValueNode forY)
boolean	inferStamp() This method can be overridden by subclasses of ValueNode if they need to recompute their stamp if their inputs change.
boolean	isAssociative()
protected static boolean	livesLonger(ValueNode after, ValueNode value, NodeValueMap nodeValueMap)
BinaryNode	maybeCommuteInputs() Ensure a canonical ordering of inputs for commutative nodes to improve GVN results.
static MulNode	mul(StructuredGraph graph, ValueNode v1, ValueNode v2)
static MulNode	mul(ValueNode v1, ValueNode v2)
static BinaryArithmeticNode<?>	reassociate(BinaryArithmeticNode<?> node, NodePredicate criterion, ValueNode forX, ValueNode forY) Tries to re-associate values which satisfy the criterion.
static SubNode	sub(StructuredGraph graph, ValueNode v1, ValueNode v2)
static SubNode	sub(ValueNode v1, ValueNode v2)
static <OP> ConstantNode	tryConstantFold(ArithmeticOpTable.BinaryOp<OP> op, ValueNode forX, ValueNode forY, Stamp stamp)

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, 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.ArithmeticLIRLowerable

generate

Methods inherited from interface com.oracle.graal.graph.spi.Canonicalizable.Binary

canonical, getX, getY

Field Detail

TYPE

public static final NodeClass<BinaryArithmeticNode> TYPE

getOp

protected final BinaryArithmeticNode.SerializableBinaryFunction<OP> getOp

Constructor Detail

BinaryArithmeticNode

protected BinaryArithmeticNode(NodeClass<? extends BinaryArithmeticNode<OP>> c,
                               BinaryArithmeticNode.SerializableBinaryFunction<OP> getOp,
                               ValueNode x,
                               ValueNode y)

Method Detail

getOp

protected final ArithmeticOpTable.BinaryOp<OP> getOp(ValueNode forX,
                                                     ValueNode forY)

isAssociative

public boolean isAssociative()

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>

tryConstantFold

public static <OP> ConstantNode tryConstantFold(ArithmeticOpTable.BinaryOp<OP> op,
                                                ValueNode forX,
                                                ValueNode forY,
                                                Stamp stamp)

inferStamp

public boolean inferStamp()

Description copied from class: ValueNode

This method can be overridden by subclasses of ValueNode if they need to recompute their stamp if their inputs change. A typical implementation will compute the stamp and pass it to ValueNode.updateStamp(Stamp), whose return value can be used as the result of this method.

Overrides:

inferStamp in class ValueNode

Returns:

true if the stamp has changed, false otherwise.

add

public static AddNode add(StructuredGraph graph,
                          ValueNode v1,
                          ValueNode v2)

add

public static AddNode add(ValueNode v1,
                          ValueNode v2)

mul

public static MulNode mul(StructuredGraph graph,
                          ValueNode v1,
                          ValueNode v2)

mul

public static MulNode mul(ValueNode v1,
                          ValueNode v2)

sub

public static SubNode sub(StructuredGraph graph,
                          ValueNode v1,
                          ValueNode v2)

sub

public static SubNode sub(ValueNode v1,
                          ValueNode v2)

findReassociate

private static BinaryArithmeticNode.ReassociateMatch findReassociate(BinaryNode binary,
                                                                     NodePredicate criterion)

reassociate

public static BinaryArithmeticNode<?> reassociate(BinaryArithmeticNode<?> node,
                                                  NodePredicate criterion,
                                                  ValueNode forX,
                                                  ValueNode forY)

Tries to re-associate values which satisfy the criterion. For example with a constantness criterion: (a + 2) + 1 => a + (1 + 2)

This method accepts only associative operations such as +, -, *, &, | and ^

Parameters:

forY -

forX -

livesLonger

protected static boolean livesLonger(ValueNode after,
                                     ValueNode value,
                                     NodeValueMap nodeValueMap)

maybeCommuteInputs

public BinaryNode maybeCommuteInputs()

Ensure a canonical ordering of inputs for commutative nodes to improve GVN results. Order the inputs by increasing Node.id and call Graph.findDuplicate(Node) on the node if it's currently in a graph. It's assumed that if there was a constant on the left it's been moved to the right by other code and that ordering is left alone.

Returns:

the original node or another node with the same input ordering