1 /*
   2  * Copyright (c) 2014, 2015, 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.calc;
  24 
  25 import java.io.Serializable;
  26 import java.util.function.Function;
  27 
  28 import org.graalvm.compiler.core.common.type.ArithmeticOpTable;
  29 import org.graalvm.compiler.core.common.type.ArithmeticOpTable.UnaryOp;
  30 import org.graalvm.compiler.core.common.type.Stamp;
  31 import org.graalvm.compiler.graph.NodeClass;
  32 import org.graalvm.compiler.graph.spi.CanonicalizerTool;
  33 import org.graalvm.compiler.nodeinfo.NodeInfo;
  34 import org.graalvm.compiler.nodes.ArithmeticOperation;
  35 import org.graalvm.compiler.nodes.ConstantNode;
  36 import org.graalvm.compiler.nodes.ValueNode;
  37 import org.graalvm.compiler.nodes.spi.ArithmeticLIRLowerable;
  38 
  39 @NodeInfo
  40 public abstract class UnaryArithmeticNode<OP> extends UnaryNode implements ArithmeticOperation, ArithmeticLIRLowerable {
  41 
  42     @SuppressWarnings("rawtypes") public static final NodeClass<UnaryArithmeticNode> TYPE = NodeClass.create(UnaryArithmeticNode.class);
  43 
  44     protected interface SerializableUnaryFunction<T> extends Function<ArithmeticOpTable, UnaryOp<T>>, Serializable {
  45     }
  46 
  47     protected final SerializableUnaryFunction<OP> getOp;
  48 
  49     protected UnaryArithmeticNode(NodeClass<? extends UnaryArithmeticNode<OP>> c, SerializableUnaryFunction<OP> getOp, ValueNode value) {
  50         super(c, getOp.apply(ArithmeticOpTable.forStamp(value.stamp())).foldStamp(value.stamp()), value);
  51         this.getOp = getOp;
  52     }
  53 
  54     protected final UnaryOp<OP> getOp(ValueNode forValue) {
  55         return getOp.apply(ArithmeticOpTable.forStamp(forValue.stamp()));
  56     }
  57 
  58     @Override
  59     public final UnaryOp<OP> getArithmeticOp() {
  60         return getOp(getValue());
  61     }
  62 
  63     @Override
  64     public Stamp foldStamp(Stamp newStamp) {
  65         assert newStamp.isCompatible(getValue().stamp());
  66         return getOp(getValue()).foldStamp(newStamp);
  67     }
  68 
  69     @Override
  70     public ValueNode canonical(CanonicalizerTool tool, ValueNode forValue) {
  71         ValueNode synonym = findSynonym(forValue, getOp(forValue));
  72         if (synonym != null) {
  73             return synonym;
  74         }
  75         return this;
  76     }
  77 
  78     protected static <OP> ValueNode findSynonym(ValueNode forValue, UnaryOp<OP> op) {
  79         if (forValue.isConstant()) {
  80             return ConstantNode.forPrimitive(op.foldStamp(forValue.stamp()), op.foldConstant(forValue.asConstant()));
  81         }
  82         return null;
  83     }
  84 }