1 /*
   2  * Copyright (c) 2011, 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 static org.graalvm.compiler.nodeinfo.InputType.Condition;
  26 import static org.graalvm.compiler.nodeinfo.InputType.Guard;
  27 import static org.graalvm.compiler.nodeinfo.NodeCycles.CYCLES_0;
  28 import static org.graalvm.compiler.nodeinfo.NodeSize.SIZE_0;
  29 
  30 import org.graalvm.compiler.core.common.type.StampFactory;
  31 import org.graalvm.compiler.graph.Node;
  32 import org.graalvm.compiler.graph.NodeClass;
  33 import org.graalvm.compiler.graph.spi.Canonicalizable;
  34 import org.graalvm.compiler.graph.spi.CanonicalizerTool;
  35 import org.graalvm.compiler.nodeinfo.NodeInfo;
  36 import org.graalvm.compiler.nodeinfo.Verbosity;
  37 import org.graalvm.compiler.nodes.extended.GuardingNode;
  38 import org.graalvm.compiler.nodes.extended.ValueAnchorNode;
  39 import org.graalvm.compiler.nodes.spi.Lowerable;
  40 import org.graalvm.compiler.nodes.spi.LoweringTool;
  41 
  42 @NodeInfo(nameTemplate = "ConditionAnchor(!={p#negated})", allowedUsageTypes = Guard, cycles = CYCLES_0, size = SIZE_0)
  43 public final class ConditionAnchorNode extends FixedWithNextNode implements Canonicalizable.Unary<Node>, Lowerable, GuardingNode {
  44 
  45     public static final NodeClass<ConditionAnchorNode> TYPE = NodeClass.create(ConditionAnchorNode.class);
  46     @Input(Condition) LogicNode condition;
  47     protected boolean negated;
  48 
  49     public ConditionAnchorNode(LogicNode condition) {
  50         this(condition, false);
  51     }
  52 
  53     public ConditionAnchorNode(LogicNode condition, boolean negated) {
  54         super(TYPE, StampFactory.forVoid());
  55         this.negated = negated;
  56         this.condition = condition;
  57     }
  58 
  59     public LogicNode condition() {
  60         return condition;
  61     }
  62 
  63     public boolean isNegated() {
  64         return negated;
  65     }
  66 
  67     @Override
  68     public String toString(Verbosity verbosity) {
  69         if (verbosity == Verbosity.Name && negated) {
  70             return "!" + super.toString(verbosity);
  71         } else {
  72             return super.toString(verbosity);
  73         }
  74     }
  75 
  76     @Override
  77     public Node canonical(CanonicalizerTool tool, Node forValue) {
  78         if (forValue instanceof LogicNegationNode) {
  79             LogicNegationNode negation = (LogicNegationNode) forValue;
  80             return new ConditionAnchorNode(negation.getValue(), !negated);
  81         }
  82         if (forValue instanceof LogicConstantNode) {
  83             LogicConstantNode c = (LogicConstantNode) forValue;
  84             if (c.getValue() != negated) {
  85                 return null;
  86             } else {
  87                 return new ValueAnchorNode(null);
  88             }
  89         }
  90         if (tool.allUsagesAvailable() && this.hasNoUsages()) {
  91             return null;
  92         }
  93         return this;
  94     }
  95 
  96     @Override
  97     public void lower(LoweringTool tool) {
  98         if (graph().getGuardsStage() == StructuredGraph.GuardsStage.FIXED_DEOPTS) {
  99             ValueAnchorNode newAnchor = graph().add(new ValueAnchorNode(null));
 100             graph().replaceFixedWithFixed(this, newAnchor);
 101         }
 102     }
 103 
 104     @Override
 105     public Node getValue() {
 106         return condition;
 107     }
 108 }