Mercurial > hg > graal-compiler
view graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/AddNode.java @ 18845:f57d86eb036f
removed Node factory methods
author | Doug Simon <doug.simon@oracle.com> |
---|---|
date | Mon, 12 Jan 2015 20:39:04 +0100 |
parents | 290dc460feb3 |
children | edbac8edc2e1 |
line wrap: on
line source
/* * Copyright (c) 2011, 2014, 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.nodes.calc; import com.oracle.graal.api.meta.*; import com.oracle.graal.compiler.common.type.*; import com.oracle.graal.compiler.common.type.ArithmeticOpTable.BinaryOp; import com.oracle.graal.compiler.common.type.ArithmeticOpTable.BinaryOp.Add; import com.oracle.graal.graph.spi.*; import com.oracle.graal.lir.gen.*; import com.oracle.graal.nodeinfo.*; import com.oracle.graal.nodes.*; import com.oracle.graal.nodes.spi.*; @NodeInfo(shortName = "+") public class AddNode extends BinaryArithmeticNode<Add> implements NarrowableArithmeticNode { public AddNode(ValueNode x, ValueNode y) { super(ArithmeticOpTable::getAdd, x, y); } @Override public ValueNode canonical(CanonicalizerTool tool, ValueNode forX, ValueNode forY) { ValueNode ret = super.canonical(tool, forX, forY); if (ret != this) { return ret; } if (forX.isConstant() && !forY.isConstant()) { return new AddNode(forY, forX); } BinaryOp<Add> op = getOp(forX, forY); boolean associative = op.isAssociative(); if (associative) { if (forX instanceof SubNode) { SubNode sub = (SubNode) forX; if (sub.getY() == forY) { // (a - b) + b return sub.getX(); } } if (forY instanceof SubNode) { SubNode sub = (SubNode) forY; if (sub.getY() == forX) { // b + (a - b) return sub.getX(); } } } if (forY.isConstant()) { Constant c = forY.asConstant(); if (op.isNeutral(c)) { return forX; } if (associative) { // canonicalize expressions like "(a + 1) + 2" BinaryNode reassociated = reassociate(this, ValueNode.isConstantPredicate(), forX, forY); if (reassociated != this) { return reassociated; } } } if (forX instanceof NegateNode) { return BinaryArithmeticNode.sub(forY, ((NegateNode) forX).getValue()); } else if (forY instanceof NegateNode) { return BinaryArithmeticNode.sub(forX, ((NegateNode) forY).getValue()); } return this; } @Override public void generate(NodeMappableLIRBuilder builder, ArithmeticLIRGenerator gen) { Value op1 = builder.operand(getX()); assert op1 != null : getX() + ", this=" + this; Value op2 = builder.operand(getY()); if (!getY().isConstant() && !BinaryArithmeticNode.livesLonger(this, getY(), builder)) { Value tmp = op1; op1 = op2; op2 = tmp; } builder.setResult(this, gen.emitAdd(op1, op2)); } }