com.oracle.graal.lir

Class SwitchStrategy.BinaryStrategy

java.lang.Object

com.oracle.graal.lir.SwitchStrategy

com.oracle.graal.lir.SwitchStrategy.BinaryStrategy

Enclosing class:

SwitchStrategy

public static class SwitchStrategy.BinaryStrategy
extends SwitchStrategy

This strategy recursively subdivides the list of keys to create a binary search based on probabilities.

Nested Class Summary

Nested classes/interfaces inherited from class com.oracle.graal.lir.SwitchStrategy

SwitchStrategy.BaseSwitchClosure, SwitchStrategy.BinaryStrategy, SwitchStrategy.RangesStrategy, SwitchStrategy.SequentialStrategy

Field Summary

Fields

Modifier and Type	Field and Description
private static double	MIN_PROBABILITY
private double[]	probabilitySums

Fields inherited from class com.oracle.graal.lir.SwitchStrategy

keyConstants, keyProbabilities

Constructor Summary

Constructors

Constructor and Description
BinaryStrategy(double[] keyProbabilities, JavaConstant[] keyConstants)

Method Summary

Modifier and Type	Method and Description
private void	recurseBinarySwitch(SwitchStrategy.SwitchClosure closure, int left, int right, int startDepth) Recursively generate a list of comparisons that always subdivides the keys in the given (inclusive) range in the middle (in terms of probability, not index).
void	run(SwitchStrategy.SwitchClosure closure)

Methods inherited from class com.oracle.graal.lir.SwitchStrategy

getAverageEffort, getBestStrategy, getSliceEnd, registerDefaultEffort, registerEffort, toString

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Detail

MIN_PROBABILITY

private static final double MIN_PROBABILITY

See Also:

Constant Field Values

probabilitySums

private final double[] probabilitySums

Constructor Detail

BinaryStrategy

public BinaryStrategy(double[] keyProbabilities,
                      JavaConstant[] keyConstants)

Method Detail

run

public void run(SwitchStrategy.SwitchClosure closure)

Specified by:

run in class SwitchStrategy

recurseBinarySwitch

private void recurseBinarySwitch(SwitchStrategy.SwitchClosure closure,
                                 int left,
                                 int right,
                                 int startDepth)

Recursively generate a list of comparisons that always subdivides the keys in the given (inclusive) range in the middle (in terms of probability, not index). If left is bigger than zero, then we always know that the value is equal to or bigger than the left key. This does not hold for the right key, as there may be a gap afterwards.