Mercurial > hg > truffle
view graal/com.oracle.graal.compiler/src/com/oracle/graal/compiler/phases/ConvertDeoptimizeToGuardPhase.java @ 5109:6766253384bf
more preparations for disabling runtime feedback selectively based on deoptimization history
author | Christian Haeubl <christian.haeubl@oracle.com> |
---|---|
date | Tue, 13 Mar 2012 18:53:33 -0700 |
parents | e808627bd16f |
children | e5427faad192 |
line wrap: on
line source
/* * Copyright (c) 2011, 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.compiler.phases; import java.util.*; import com.oracle.graal.debug.*; import com.oracle.graal.graph.*; import com.oracle.graal.nodes.*; import com.oracle.graal.nodes.util.*; public class ConvertDeoptimizeToGuardPhase extends Phase { private static BeginNode findBeginNode(Node startNode) { Node n = startNode; while (true) { if (n instanceof BeginNode) { return (BeginNode) n; } else { n = n.predecessor(); } } } @Override protected void run(final StructuredGraph graph) { if (graph.getNodes(DeoptimizeNode.class).isEmpty()) { return; } for (DeoptimizeNode d : graph.getNodes(DeoptimizeNode.class)) { visitDeoptBranch(findBeginNode(d), d, graph); } new DeadCodeEliminationPhase().apply(graph); } private void visitDeoptBranch(BeginNode deoptBegin, DeoptimizeNode deopt, StructuredGraph graph) { if (deoptBegin instanceof MergeNode) { MergeNode mergeNode = (MergeNode) deoptBegin; Debug.log("Eliminating %s followed by %s", mergeNode, deopt); List<EndNode> ends = mergeNode.forwardEnds().snapshot(); for (EndNode end : ends) { if (!end.isDeleted()) { BeginNode beginNode = findBeginNode(end); visitDeoptBranch(beginNode, deopt, graph); } } if (!deopt.isDeleted()) { visitDeoptBranch(findBeginNode(deopt), deopt, graph); } } else if (deoptBegin.predecessor() instanceof IfNode) { IfNode ifNode = (IfNode) deoptBegin.predecessor(); BeginNode otherBegin = ifNode.trueSuccessor(); BooleanNode conditionNode = ifNode.compare(); if (deoptBegin == ifNode.trueSuccessor()) { conditionNode = conditionNode.negate(); otherBegin = ifNode.falseSuccessor(); } BeginNode ifBlockBegin = findBeginNode(ifNode); Debug.log("Converting %s on %-5s branch of %s to guard for remaining branch %s. IfBegin=%s", deopt, deoptBegin == ifNode.trueSuccessor() ? "true" : "false", ifNode, otherBegin, ifBlockBegin); FixedGuardNode guard = graph.add(new FixedGuardNode(conditionNode, deopt.reason())); otherBegin.replaceAtUsages(ifBlockBegin); FixedNode next = otherBegin.next(); otherBegin.setNext(null); guard.setNext(next); ifNode.replaceAtPredecessors(guard); GraphUtil.killCFG(ifNode); } } }