com.oracle.graal.nodes.extended

Class SwitchNode

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

All Implemented Interfaces:

IterableNodeType, Cloneable, Formattable, KindProvider

Direct Known Subclasses:

IntegerSwitchNode, TypeSwitchNode

public abstract class SwitchNode
extends ControlSplitNode

The SwitchNode class is the base of both lookup and table switches.

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 double[]	keyProbabilities
protected int[]	keySuccessors
protected NodeSuccessorList<AbstractBeginNode>	successors
static NodeClass<SwitchNode>	TYPE
protected ValueNode	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

Modifier	Constructor and Description
protected	SwitchNode(NodeClass<? extends SwitchNode> c, ValueNode value, AbstractBeginNode[] successors, int[] keySuccessors, double[] keyProbabilities) Constructs a new Switch.

Method Summary

Modifier and Type	Method and Description
private boolean	assertProbabilities()
AbstractBeginNode	blockSuccessor(int i)
int	blockSuccessorCount()
AbstractBeginNode	defaultSuccessor() Gets the successor corresponding to the default (fall through) case.
int	defaultSuccessorIndex() Returns the index of the default (fall through) successor of this switch.
abstract boolean	equalKeys(SwitchNode switchNode) Returns true if the switch has the same keys in the same order as this switch.
AbstractBeginNode	getPrimarySuccessor() Primary successor of the control split.
abstract boolean	isSorted()
abstract JavaConstant	keyAt(int i) The key at the specified position, encoded in a Constant.
abstract int	keyCount() The number of distinct keys in this switch.
double	keyProbability(int i) Returns the probability of the key at the given index.
AbstractBeginNode	keySuccessor(int i) Returns the successor for the key at the given index.
int	keySuccessorIndex(int i) Returns the index of the successor belonging to the key at the specified index.
protected void	killOtherSuccessors(SimplifierTool tool, int survivingEdge) Delete all other successors except for the one reached by survivingEdge.
double	probability(AbstractBeginNode successor)
void	setBlockSuccessor(int i, AbstractBeginNode s)
boolean	structureEquals(SwitchNode switchNode)
ValueNode	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, simplify, 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<SwitchNode> TYPE

successors

protected NodeSuccessorList<AbstractBeginNode> successors

value

protected ValueNode value

keyProbabilities

protected final double[] keyProbabilities

keySuccessors

protected final int[] keySuccessors

Constructor Detail

SwitchNode

protected SwitchNode(NodeClass<? extends SwitchNode> c,
                     ValueNode value,
                     AbstractBeginNode[] successors,
                     int[] keySuccessors,
                     double[] keyProbabilities)

Constructs a new Switch.

Parameters:

value - the instruction that provides the value to be switched over

successors - the list of successors of this switch

Method Detail

assertProbabilities

private boolean assertProbabilities()

probability

public double probability(AbstractBeginNode successor)

Specified by:

probability in class ControlSplitNode

value

public ValueNode value()

isSorted

public abstract boolean isSorted()

keyCount

public abstract int keyCount()

The number of distinct keys in this switch.

keyAt

public abstract JavaConstant keyAt(int i)

The key at the specified position, encoded in a Constant.

structureEquals

public boolean structureEquals(SwitchNode switchNode)

equalKeys

public abstract boolean equalKeys(SwitchNode switchNode)

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

keySuccessorIndex

public int keySuccessorIndex(int i)

Returns the index of the successor belonging to the key at the specified index.

keySuccessor

public AbstractBeginNode keySuccessor(int i)

Returns the successor for the key at the given index.

keyProbability

public double keyProbability(int i)

Returns the probability of the key at the given index.

defaultSuccessorIndex

public int defaultSuccessorIndex()

Returns the index of the default (fall through) successor of this switch.

blockSuccessor

public AbstractBeginNode blockSuccessor(int i)

setBlockSuccessor

public void setBlockSuccessor(int i,
                              AbstractBeginNode s)

blockSuccessorCount

public int blockSuccessorCount()

defaultSuccessor

public AbstractBeginNode defaultSuccessor()

Gets the successor corresponding to the default (fall through) case.

Returns:

the default successor

getPrimarySuccessor

public AbstractBeginNode getPrimarySuccessor()

Description copied from class: ControlSplitNode

Primary successor of the control split. Data dependencies on the node have to be scheduled in the primary successor.

Specified by:

getPrimarySuccessor in class ControlSplitNode

Returns:

the primary successor

killOtherSuccessors

protected void killOtherSuccessors(SimplifierTool tool,
                                   int survivingEdge)

Delete all other successors except for the one reached by survivingEdge.

Parameters:

tool -

survivingEdge - index of the edge in the successors list