org.graalvm.compiler.phases.common.inlining.walker

Class InliningData

java.lang.Object

org.graalvm.compiler.phases.common.inlining.walker.InliningData

public class InliningData
extends Object

The space of inlining decisions is explored depth-first with the help of a stack realized by InliningData. At any point in time, the topmost element of that stack consists of:

• the callsite under consideration is tracked as a MethodInvocation.
• one or more CallsiteHolders, all of them associated to the callsite above. Why more than one? Depending on the type-profile for the receiver more than one concrete method may be feasible target.

The bottom element in the stack consists of:

• a single MethodInvocation (the root one, ie the unknown caller of the root graph)
• a single CallsiteHolder (the root one, for the method on which inlining was called)

See Also:

InliningData.moveForward()

Constructor Summary

Constructors

Constructor and Description
InliningData(StructuredGraph rootGraph, HighTierContext context, int maxMethodPerInlining, CanonicalizerPhase canonicalizer, InliningPolicy inliningPolicy, LinkedList<Invoke> rootInvokes)

Method Summary

Modifier and Type	Method and Description
int	countRecursiveInlining(ResolvedJavaMethod method)
static BitSet	freshlyInstantiatedArguments(Invoke invoke, org.graalvm.collections.EconomicSet<ParameterNode> fixedParams) Gets the freshly instantiated arguments.
Collection<StackTraceElement>	getInvocationStackTrace() Gets a stack trace representing the current inlining stack represented by this object.
int	graphCount()
boolean	hasUnprocessedGraphs()
int	inliningDepth()
static boolean	isFreshInstantiation(ValueNode arg)
boolean	moveForward() The stack realized by InliningData grows and shrinks as choices are made among the alternatives below: not worth inlining: pop stack top, which comprises: pop any remaining graphs not yet delved into pop the current invocation delve into one of the callsites hosted in the current graph, such callsite is explored next by InliningData.moveForward() try to inline: move past the current graph (remove it from the topmost element).
boolean	repOK() This method checks invariants for this class.
String	toString()

Methods inherited from class java.lang.Object

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

Constructor Detail

InliningData

public InliningData(StructuredGraph rootGraph,
                    HighTierContext context,
                    int maxMethodPerInlining,
                    CanonicalizerPhase canonicalizer,
                    InliningPolicy inliningPolicy,
                    LinkedList<Invoke> rootInvokes)

Method Detail

isFreshInstantiation

public static boolean isFreshInstantiation(ValueNode arg)

freshlyInstantiatedArguments

public static BitSet freshlyInstantiatedArguments(Invoke invoke,
                                                  org.graalvm.collections.EconomicSet<ParameterNode> fixedParams)

Gets the freshly instantiated arguments.

A freshly instantiated argument is either:

• an InliningData.isFreshInstantiation(org.graalvm.compiler.nodes.ValueNode)
• a fixed-param, ie a ParameterNode receiving a freshly instantiated argument

Returns:

the positions of freshly instantiated arguments in the argument list of the invoke, or null if no such positions exist.

graphCount

public int graphCount()

hasUnprocessedGraphs

public boolean hasUnprocessedGraphs()

countRecursiveInlining

public int countRecursiveInlining(ResolvedJavaMethod method)

inliningDepth

public int inliningDepth()

toString

public String toString()

Overrides:

toString in class Object

getInvocationStackTrace

public Collection<StackTraceElement> getInvocationStackTrace()

Gets a stack trace representing the current inlining stack represented by this object.

moveForward

public boolean moveForward()

The stack realized by InliningData grows and shrinks as choices are made among the alternatives below:

1. not worth inlining: pop stack top, which comprises:
   • pop any remaining graphs not yet delved into
   • pop the current invocation
2. delve into one of the callsites hosted in the current graph, such callsite is explored next by InliningData.moveForward()
3. try to inline: move past the current graph (remove it from the topmost element).
   • If that was the last one then try to inline the callsite under consideration (ie, the "current invocation").
   • Whether inlining occurs or not, that callsite is removed from the top of InliningData .

Some facts about the alternatives above:

• the first step amounts to backtracking, the 2nd one to depth-search, and the 3rd one also involves backtracking (however possibly after inlining).
• the choice of abandon-and-backtrack or delve-into depends on InliningPolicy.isWorthInlining(org.graalvm.compiler.nodes.spi.Replacements, org.graalvm.compiler.phases.common.inlining.walker.MethodInvocation, org.graalvm.compiler.phases.common.inlining.info.InlineInfo, int, boolean) and InliningPolicy.continueInlining(org.graalvm.compiler.nodes.StructuredGraph).
• the 3rd choice is picked whenever none of the previous choices are made

Returns:

true iff inlining was actually performed

repOK

public boolean repOK()

This method checks invariants for this class. Named after shorthand for "internal representation is ok".