Mercurial > hg > truffle
view graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/MulNode.java @ 19527:34c0014aaf5b
Merge
author | Stefan Anzinger <stefan.anzinger@oracle.com> |
---|---|
date | Sat, 21 Feb 2015 19:48:22 +0100 |
parents | 8fc336a04d77 |
children | f7c6b33489c9 |
line wrap: on
line source
/* * Copyright (c) 2011, 2015, 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.code.*; 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.*; import com.oracle.graal.graph.*; 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 MulNode extends BinaryArithmeticNode<Mul> implements NarrowableArithmeticNode { public static final NodeClass<MulNode> TYPE = NodeClass.create(MulNode.class); public MulNode(ValueNode x, ValueNode y) { this(TYPE, x, y); } protected MulNode(NodeClass<? extends MulNode> c, ValueNode x, ValueNode y) { super(c, ArithmeticOpTable::getMul, x, y); } public static ValueNode create(ValueNode x, ValueNode y) { BinaryOp<Mul> op = ArithmeticOpTable.forStamp(x.stamp()).getMul(); Stamp stamp = op.foldStamp(x.stamp(), y.stamp()); ConstantNode tryConstantFold = tryConstantFold(op, x, y, stamp); if (tryConstantFold != null) { return tryConstantFold; } else { return new MulNode(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 MulNode(forY, forX); } if (forY.isConstant()) { BinaryOp<Mul> op = getOp(forX, forY); Constant c = forY.asConstant(); if (op.isNeutral(c)) { return forX; } if (c instanceof PrimitiveConstant && ((PrimitiveConstant) c).getKind().isNumericInteger()) { long i = ((PrimitiveConstant) c).asLong(); if (i > 0 && CodeUtil.isPowerOf2(i)) { return new LeftShiftNode(forX, ConstantNode.forInt(CodeUtil.log2(i))); } } if (op.isAssociative()) { // canonicalize expressions like "(a * 1) * 2" return reassociate(this, ValueNode.isConstantPredicate(), forX, forY); } } return this; } @Override public void generate(NodeMappableLIRBuilder builder, ArithmeticLIRGenerator gen) { Value op1 = builder.operand(getX()); Value op2 = builder.operand(getY()); if (!getY().isConstant() && !BinaryArithmeticNode.livesLonger(this, getY(), builder)) { Value tmp = op1; op1 = op2; op2 = tmp; } builder.setResult(this, gen.emitMul(op1, op2, false)); } }