com.oracle.graal.pointsto.phases

Class InlineBeforeAnalysisPolicy.AbstractPolicyScope

java.lang.Object

com.oracle.graal.pointsto.phases.InlineBeforeAnalysisPolicy.AbstractPolicyScope

Enclosing class:

InlineBeforeAnalysisPolicy

public abstract static class InlineBeforeAnalysisPolicy.AbstractPolicyScope
extends Object

A place for policy implementations to store per-callee information like the number of nodes seen in the callee.

Field Summary

Fields

Modifier and Type	Field and Description
int	inliningDepth

Constructor Summary

Constructors

Modifier	Constructor and Description
protected	AbstractPolicyScope(int inliningDepth)

Method Summary

Modifier and Type	Method and Description
abstract void	abortCalleeScope(InlineBeforeAnalysisPolicy.AbstractPolicyScope callee)
abstract boolean	allowAbort()
abstract void	commitCalleeScope(InlineBeforeAnalysisPolicy.AbstractPolicyScope callee)
abstract boolean	processNode(AnalysisMetaAccess metaAccess, ResolvedJavaMethod method, org.graalvm.compiler.graph.Node node) Invoked for each node of the callee during graph decoding.

Methods inherited from class java.lang.Object

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

Field Detail

inliningDepth

public final int inliningDepth

Constructor Detail

AbstractPolicyScope

protected AbstractPolicyScope(int inliningDepth)

Method Detail

allowAbort

public abstract boolean allowAbort()

commitCalleeScope

public abstract void commitCalleeScope(InlineBeforeAnalysisPolicy.AbstractPolicyScope callee)

abortCalleeScope

public abstract void abortCalleeScope(InlineBeforeAnalysisPolicy.AbstractPolicyScope callee)

processNode

public abstract boolean processNode(AnalysisMetaAccess metaAccess,
                                    ResolvedJavaMethod method,
                                    org.graalvm.compiler.graph.Node node)

Invoked for each node of the callee during graph decoding. If the method returns true, inlining is continued. If the method returns false, inlining is aborted. This method is called during graph decoding. The provided node itself is already fully decoded and canonicalized, i.e., all properties and predecessors of the node are available. But usages have not been decoded yet, so the implementation must not base any decision on the current list of usages. The list of usages is often but not always empty.