1 /*
   2  * Copyright (c) 2013, 2014, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  */
  23 package org.graalvm.compiler.nodes;
  24 
  25 import org.graalvm.compiler.graph.Node;
  26 import org.graalvm.compiler.graph.NodeClass;
  27 import org.graalvm.compiler.graph.spi.Canonicalizable;
  28 import org.graalvm.compiler.graph.spi.CanonicalizerTool;
  29 import org.graalvm.compiler.nodeinfo.NodeInfo;
  30 import org.graalvm.compiler.nodes.spi.LIRLowerable;
  31 import org.graalvm.compiler.nodes.spi.Lowerable;
  32 import org.graalvm.compiler.nodes.spi.LoweringTool;
  33 import org.graalvm.compiler.nodes.spi.NodeLIRBuilderTool;
  34 
  35 import jdk.vm.ci.meta.JavaConstant;
  36 import jdk.vm.ci.meta.MetaAccessProvider;
  37 
  38 @NodeInfo
  39 public final class DynamicDeoptimizeNode extends AbstractDeoptimizeNode implements LIRLowerable, Lowerable, Canonicalizable {
  40     public static final NodeClass<DynamicDeoptimizeNode> TYPE = NodeClass.create(DynamicDeoptimizeNode.class);
  41     @Input ValueNode actionAndReason;
  42     @Input ValueNode speculation;
  43 
  44     public DynamicDeoptimizeNode(ValueNode actionAndReason, ValueNode speculation) {
  45         super(TYPE, null);
  46         this.actionAndReason = actionAndReason;
  47         this.speculation = speculation;
  48     }
  49 
  50     public ValueNode getActionAndReason() {
  51         return actionAndReason;
  52     }
  53 
  54     public ValueNode getSpeculation() {
  55         return speculation;
  56     }
  57 
  58     @Override
  59     public ValueNode getActionAndReason(MetaAccessProvider metaAccess) {
  60         return getActionAndReason();
  61     }
  62 
  63     @Override
  64     public ValueNode getSpeculation(MetaAccessProvider metaAccess) {
  65         return getSpeculation();
  66     }
  67 
  68     @Override
  69     public void lower(LoweringTool tool) {
  70         tool.getLowerer().lower(this, tool);
  71     }
  72 
  73     @Override
  74     public void generate(NodeLIRBuilderTool generator) {
  75         generator.getLIRGeneratorTool().emitDeoptimize(generator.operand(actionAndReason), generator.operand(speculation), generator.state(this));
  76     }
  77 
  78     @Override
  79     public Node canonical(CanonicalizerTool tool) {
  80         if (actionAndReason.isConstant() && speculation.isConstant()) {
  81             JavaConstant constant = actionAndReason.asJavaConstant();
  82             JavaConstant speculationConstant = speculation.asJavaConstant();
  83             DeoptimizeNode newDeopt = new DeoptimizeNode(tool.getMetaAccess().decodeDeoptAction(constant), tool.getMetaAccess().decodeDeoptReason(constant), tool.getMetaAccess().decodeDebugId(
  84                             constant), speculationConstant, stateBefore());
  85             return newDeopt;
  86         }
  87         return this;
  88     }
  89 }