org.graalvm.compiler.nodes.spi

Interface Canonicalizable.BinaryCommutative<T extends Node>

All Superinterfaces:

BinaryCommutativeMarker, Canonicalizable, Canonicalizable.Binary<T>, CanonicalizableMarker

All Known Implementing Classes:

AddNode, AndNode, FloatEqualsNode, IntegerAddExactNode, IntegerAddExactOverflowNode, IntegerEqualsNode, IntegerMulExactNode, IntegerMulExactOverflowNode, IntegerMulHighNode, IntegerTestNode, MaxNode, MinMaxNode, MinNode, MulNode, ObjectEqualsNode, OrNode, PointerEqualsNode, UnsignedMulHighNode, XorNode

Enclosing interface:

Canonicalizable

public static interface Canonicalizable.BinaryCommutative<T extends Node>
extends Canonicalizable.Binary<T>, BinaryCommutativeMarker

This sub-interface of Canonicalizable.Binary is for nodes with two inputs where the operation is commutative. It is used to improve GVN by trying to merge nodes with the same inputs in different order.

Nested Class Summary

Nested classes/interfaces inherited from interface org.graalvm.compiler.nodes.spi.Canonicalizable

Canonicalizable.Binary<T extends Node>, Canonicalizable.BinaryCommutative<T extends Node>, Canonicalizable.Ternary<T extends Node>, Canonicalizable.Unary<T extends Node>

Method Summary

Modifier and Type	Method and Description
Node	maybeCommuteInputs() Ensure a canonical ordering of inputs for commutative nodes to improve GVN results.

Methods inherited from interface org.graalvm.compiler.nodes.spi.Canonicalizable.Binary

canonical, canonical, getX, getY

Method Detail

maybeCommuteInputs

Node 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