com.oracle.graal.phases.common.inlining.walker

Class ComputeInliningRelevance

java.lang.Object

com.oracle.graal.phases.common.inlining.walker.ComputeInliningRelevance

public class ComputeInliningRelevance
extends Object

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
private class	ComputeInliningRelevance.Scope A scope holds information for the contents of one loop or of the root of the method.

Field Summary

Fields

Modifier and Type	Field and Description
private static double	EPSILON
private static int	EXPECTED_INVOKE_RATIO
private static int	EXPECTED_LOOP_COUNT
private static int	EXPECTED_MIN_INVOKE_COUNT
private StructuredGraph	graph
private ToDoubleFunction<FixedNode>	nodeProbabilities
private Map<FixedNode,Double>	nodeRelevances Node relevances are pre-computed for all invokes if the graph contains loops.
private ComputeInliningRelevance.Scope	rootScope This scope is non-null if (and only if) there are no loops in the graph.
private static double	UNINITIALIZED

Constructor Summary

Constructors

Constructor and Description
ComputeInliningRelevance(StructuredGraph graph, ToDoubleFunction<FixedNode> nodeProbabilities)

Method Summary

Modifier and Type	Method and Description
void	compute() Initializes or updates the relevance computation.
private double	computeFastPathMinProbability(FixedNode scopeStart) Computes the minimum probability along the most probable path within the scope.
private ComputeInliningRelevance.Scope	createLoopScope(LoopBeginNode loopBegin, Map<LoopBeginNode,ComputeInliningRelevance.Scope> loops) Determines the parent of the given loop and creates a ComputeInliningRelevance.Scope object for each one.
private Node	getMaxProbabilityLoopExit(LoopBeginNode loopBegin, ArrayList<FixedNode> pathBeginNodes) Returns the most probable loop exit.
private static Node	getMaxProbabilitySux(ControlSplitNode controlSplit, ArrayList<FixedNode> pathBeginNodes) Returns the most probable successor.
private double	getMinPathProbability(FixedNode current, double minPathProbability)
double	getRelevance(Invoke invoke)
private static void	truncate(ArrayList<FixedNode> pathBeginNodes, int pathBeginCount)

Methods inherited from class java.lang.Object

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

Field Detail

EPSILON

private static final double EPSILON

See Also:

Constant Field Values

UNINITIALIZED

private static final double UNINITIALIZED

See Also:

Constant Field Values

EXPECTED_MIN_INVOKE_COUNT

private static final int EXPECTED_MIN_INVOKE_COUNT

See Also:

Constant Field Values

EXPECTED_INVOKE_RATIO

private static final int EXPECTED_INVOKE_RATIO

See Also:

Constant Field Values

EXPECTED_LOOP_COUNT

private static final int EXPECTED_LOOP_COUNT

See Also:

Constant Field Values

graph

private final StructuredGraph graph

nodeProbabilities

private final ToDoubleFunction<FixedNode> nodeProbabilities

nodeRelevances

private Map<FixedNode,Double> nodeRelevances

Node relevances are pre-computed for all invokes if the graph contains loops. If there are no loops, the computation happens lazily based on rootScope.

rootScope

private ComputeInliningRelevance.Scope rootScope

This scope is non-null if (and only if) there are no loops in the graph. In this case, the root scope is used to compute invoke relevances on the fly.

Constructor Detail

ComputeInliningRelevance

public ComputeInliningRelevance(StructuredGraph graph,
                                ToDoubleFunction<FixedNode> nodeProbabilities)

Method Detail

compute

public void compute()

Initializes or updates the relevance computation. If there are no loops within the graph, most computation happens lazily.

getRelevance

public double getRelevance(Invoke invoke)

createLoopScope

private ComputeInliningRelevance.Scope createLoopScope(LoopBeginNode loopBegin,
                                                       Map<LoopBeginNode,ComputeInliningRelevance.Scope> loops)

Determines the parent of the given loop and creates a ComputeInliningRelevance.Scope object for each one. This method will call itself recursively if no ComputeInliningRelevance.Scope for the parent loop exists.

computeFastPathMinProbability

private double computeFastPathMinProbability(FixedNode scopeStart)

Computes the minimum probability along the most probable path within the scope. During iteration, the method returns immediately once a loop exit is discovered.

getMinPathProbability

private double getMinPathProbability(FixedNode current,
                                     double minPathProbability)

getMaxProbabilitySux

private static Node getMaxProbabilitySux(ControlSplitNode controlSplit,
                                         ArrayList<FixedNode> pathBeginNodes)

Returns the most probable successor. If multiple successors share the maximum probability, one is returned and the others are enqueued in pathBeginNodes.

getMaxProbabilityLoopExit

private Node getMaxProbabilityLoopExit(LoopBeginNode loopBegin,
                                       ArrayList<FixedNode> pathBeginNodes)

Returns the most probable loop exit. If multiple successors share the maximum probability, one is returned and the others are enqueued in pathBeginNodes.

truncate

private static void truncate(ArrayList<FixedNode> pathBeginNodes,
                             int pathBeginCount)