com.oracle.graal.nodes.extended

Class IntegerSwitchNode

java.lang.Object

com.oracle.graal.graph.Node

com.oracle.graal.nodes.ValueNode

com.oracle.graal.nodes.FixedNode

com.oracle.graal.nodes.ControlSplitNode

com.oracle.graal.nodes.extended.SwitchNode

com.oracle.graal.nodes.extended.IntegerSwitchNode

All Implemented Interfaces:

IterableNodeType, Simplifiable, LIRLowerable, Cloneable, Formattable, KindProvider

public final class IntegerSwitchNode
extends SwitchNode
implements LIRLowerable, Simplifiable

The IntegerSwitchNode represents a switch on integer keys, with a sorted array of key values. The actual implementation of the switch will be decided by the backend.

Nested Class Summary

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

Field Summary

Fields

Modifier and Type	Field and Description
protected int[]	keys
static NodeClass<IntegerSwitchNode>	TYPE

Fields inherited from class com.oracle.graal.nodes.extended.SwitchNode

keyProbabilities, keySuccessors, successors, value

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

Constructor and Description
IntegerSwitchNode(ValueNode value, AbstractBeginNode[] successors, int[] keys, double[] keyProbabilities, int[] keySuccessors)
IntegerSwitchNode(ValueNode value, int successorCount, int[] keys, double[] keyProbabilities, int[] keySuccessors)

Method Summary

Modifier and Type	Method and Description
private boolean	assertSorted()
boolean	equalKeys(SwitchNode switchNode) Returns true if the switch has the same keys in the same order as this switch.
void	generate(NodeLIRBuilderTool gen)
boolean	isSorted()
JavaConstant	keyAt(int i) Gets the key at the specified index.
int	keyCount() The number of distinct keys in this switch.
void	simplify(SimplifierTool tool) Must be overridden by subclasses that implement Simplifiable.
AbstractBeginNode	successorAtKey(int key)
int	successorIndexAtKey(int key)

Methods inherited from class com.oracle.graal.nodes.extended.SwitchNode

blockSuccessor, blockSuccessorCount, defaultSuccessor, defaultSuccessorIndex, getPrimarySuccessor, keyProbability, keySuccessor, keySuccessorIndex, killOtherSuccessors, probability, setBlockSuccessor, structureEquals, value

Methods inherited from class com.oracle.graal.nodes.FixedNode

asNode, verify

Methods inherited from class com.oracle.graal.nodes.ValueNode

asConstant, asJavaConstant, getKind, graph, inferStamp, 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, successors, toString, toString, updatePredecessor, updateUsages, updateUsagesInterface, usages, valueEquals, verifyEdges, verifyInputs

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Field Detail

TYPE

public static final NodeClass<IntegerSwitchNode> TYPE

keys

protected final int[] keys

Constructor Detail

IntegerSwitchNode

public IntegerSwitchNode(ValueNode value,
                         AbstractBeginNode[] successors,
                         int[] keys,
                         double[] keyProbabilities,
                         int[] keySuccessors)

IntegerSwitchNode

public IntegerSwitchNode(ValueNode value,
                         int successorCount,
                         int[] keys,
                         double[] keyProbabilities,
                         int[] keySuccessors)

Method Detail

assertSorted

private boolean assertSorted()

isSorted

public boolean isSorted()

Specified by:

isSorted in class SwitchNode

keyAt

public JavaConstant keyAt(int i)

Gets the key at the specified index.

Specified by:

keyAt in class SwitchNode

Parameters:

i - the index

Returns:

the key at that index

keyCount

public int keyCount()

Description copied from class: SwitchNode

The number of distinct keys in this switch.

Specified by:

keyCount in class SwitchNode

equalKeys

public boolean equalKeys(SwitchNode switchNode)

Description copied from class: SwitchNode

Returns true if the switch has the same keys in the same order as this switch.

Specified by:

equalKeys in class SwitchNode

generate

public void generate(NodeLIRBuilderTool gen)

Specified by:

generate in interface LIRLowerable

successorAtKey

public AbstractBeginNode successorAtKey(int key)

successorIndexAtKey

public int successorIndexAtKey(int key)

simplify

public void simplify(SimplifierTool tool)

Description copied from class: Node

Must be overridden by subclasses that implement Simplifiable. The implementation in Node exists to obviate the need to cast a node before invoking Simplifiable.simplify(SimplifierTool).

Specified by:

simplify in interface Simplifiable

Overrides:

simplify in class Node