Mercurial > hg > graal-jvmci-8
view graal/com.oracle.graal.phases.common/src/com/oracle/graal/phases/common/inlining/info/elem/InlineableGraph.java @ 15985:85fa16055535
[inlining] refactoring for readability in InlineableGraph
author | Miguel Garcia <miguel.m.garcia@oracle.com> |
---|---|
date | Fri, 30 May 2014 18:41:56 +0200 |
parents | ce09739483c9 |
children | 23e6edbe4c76 |
line wrap: on
line source
/* * Copyright (c) 2012, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ package com.oracle.graal.phases.common.inlining.info.elem; import java.util.*; import com.oracle.graal.api.meta.Constant; import com.oracle.graal.api.meta.ResolvedJavaMethod; import com.oracle.graal.compiler.common.type.Stamp; import com.oracle.graal.debug.Debug; import com.oracle.graal.graph.*; import com.oracle.graal.nodes.*; import com.oracle.graal.phases.common.CanonicalizerPhase; import com.oracle.graal.phases.common.DeadCodeEliminationPhase; import com.oracle.graal.phases.common.inlining.InliningUtil; import com.oracle.graal.phases.tiers.HighTierContext; import static com.oracle.graal.compiler.common.GraalOptions.OptCanonicalizer; public class InlineableGraph implements Inlineable { private final StructuredGraph graph; public InlineableGraph(final ResolvedJavaMethod method, final Invoke invoke, final HighTierContext context, CanonicalizerPhase canonicalizer) { this.graph = buildGraph(method, invoke, context, canonicalizer); } /** * @return a (possibly cached) graph. The caller is responsible for cloning before modification. */ private static StructuredGraph getOriginalGraph(final ResolvedJavaMethod method, final HighTierContext context) { StructuredGraph intrinsicGraph = InliningUtil.getIntrinsicGraph(context.getReplacements(), method); if (intrinsicGraph != null) { return intrinsicGraph; } StructuredGraph cachedGraph = getCachedGraph(method, context); if (cachedGraph != null) { return cachedGraph; } return null; } private static StructuredGraph buildGraph(final ResolvedJavaMethod method, final Invoke invoke, final HighTierContext context, CanonicalizerPhase canonicalizer) { StructuredGraph newGraph = getOriginalGraph(method, context); if (newGraph == null) { newGraph = new StructuredGraph(method); parseBytecodes(newGraph, context, canonicalizer); } else { newGraph = newGraph.copy(); } // TODO (chaeubl): copying the graph is only necessary if it is modified or if it contains // any invokes try (Debug.Scope s = Debug.scope("InlineGraph", newGraph)) { boolean callerHasMoreInformationAboutArguments = false; NodeInputList<ValueNode> args = invoke.callTarget().arguments(); ArrayList<Node> parameterUsages = new ArrayList<>(); for (ParameterNode param : newGraph.getNodes(ParameterNode.class).snapshot()) { ValueNode arg = args.get(param.index()); if (arg.isConstant()) { Constant constant = arg.asConstant(); newGraph.replaceFloating(param, ConstantNode.forConstant(constant, context.getMetaAccess(), newGraph)); callerHasMoreInformationAboutArguments = true; param.usages().snapshotTo(parameterUsages); } else { Stamp joinedStamp = param.stamp().join(arg.stamp()); if (joinedStamp != null && !joinedStamp.equals(param.stamp())) { param.setStamp(joinedStamp); callerHasMoreInformationAboutArguments = true; param.usages().snapshotTo(parameterUsages); } } } if (callerHasMoreInformationAboutArguments) { if (OptCanonicalizer.getValue()) { canonicalizer.applyIncremental(newGraph, context, parameterUsages); } } else { // TODO (chaeubl): if args are not more concrete, inlining should be avoided // in most cases or we could at least use the previous graph size + invoke // probability to check the inlining } return newGraph; } catch (Throwable e) { throw Debug.handle(e); } } private static StructuredGraph getCachedGraph(ResolvedJavaMethod method, HighTierContext context) { if (context.getGraphCache() != null) { StructuredGraph cachedGraph = context.getGraphCache().get(method); if (cachedGraph != null) { return cachedGraph; } } return null; } /** * This method builds the IR nodes for <code>newGraph</code> and canonicalizes them. Provided * profiling info is mature, a copy of the resulting graph is cached. Thus, any modifications * performed on the returned graph won't affect the cached copy.</p> */ private static StructuredGraph parseBytecodes(StructuredGraph newGraph, HighTierContext context, CanonicalizerPhase canonicalizer) { try (Debug.Scope s = Debug.scope("InlineGraph", newGraph)) { if (context.getGraphBuilderSuite() != null) { context.getGraphBuilderSuite().apply(newGraph, context); } assert newGraph.start().next() != null : "graph needs to be populated by the GraphBuilderSuite"; new DeadCodeEliminationPhase().apply(newGraph); if (OptCanonicalizer.getValue()) { canonicalizer.apply(newGraph, context); } if (context.getGraphCache() != null) { context.getGraphCache().put(newGraph.method(), newGraph.copy()); } return newGraph; } catch (Throwable e) { throw Debug.handle(e); } } @Override public int getNodeCount() { return graph.getNodeCount(); } @Override public Iterable<Invoke> getInvokes() { return graph.getInvokes(); } public StructuredGraph getGraph() { return graph; } }