Mercurial > hg > truffle
view graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/IntegerConvertNode.java @ 14707:6ce6c4ccba8f
initial support for memory arithmetic on x86
author | Tom Rodriguez <tom.rodriguez@oracle.com> |
---|---|
date | Thu, 20 Mar 2014 15:57:03 -0700 |
parents | 2a7d7da912e1 |
children | 9c1e53adc159 |
line wrap: on
line source
/* * Copyright (c) 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.graph.spi.*; import com.oracle.graal.nodes.*; import com.oracle.graal.nodes.spi.*; import com.oracle.graal.nodes.type.*; /** * An {@code IntegerConvert} converts an integer to an integer of different width. */ public abstract class IntegerConvertNode extends ConvertNode implements ArithmeticLIRLowerable, Canonicalizable, MemoryArithmeticLIRLowerable { private final int resultBits; protected IntegerConvertNode(Stamp stamp, ValueNode input, int resultBits) { super(stamp, input); this.resultBits = resultBits; } public int getResultBits() { return resultBits; } public int getInputBits() { if (getInput().stamp() instanceof IntegerStamp) { return ((IntegerStamp) getInput().stamp()).getBits(); } else { return 0; } } public static long convert(long value, int bits, boolean unsigned) { if (unsigned) { return ZeroExtendNode.zeroExtend(value, bits); } else { return SignExtendNode.signExtend(value, bits); } } protected ValueNode canonicalConvert() { if (getInput().stamp() instanceof IntegerStamp) { int inputBits = ((IntegerStamp) getInput().stamp()).getBits(); if (inputBits == resultBits) { return getInput(); } else if (getInput().isConstant()) { Constant ret = evalConst(getInput().asConstant()); return ConstantNode.forIntegerBits(resultBits, false, ret.asLong(), graph()); } } return null; } public static ValueNode convert(ValueNode input, Stamp stamp) { StructuredGraph graph = input.graph(); IntegerStamp fromStamp = (IntegerStamp) input.stamp(); IntegerStamp toStamp = (IntegerStamp) stamp; ValueNode result; if (toStamp.getBits() == fromStamp.getBits()) { result = input; } else if (toStamp.getBits() < fromStamp.getBits()) { result = graph.unique(new NarrowNode(input, toStamp.getBits())); } else { // toStamp.getBits() > fromStamp.getBits() if (fromStamp.isUnsigned()) { result = graph.unique(new ZeroExtendNode(input, toStamp.getBits())); } else { result = graph.unique(new SignExtendNode(input, toStamp.getBits())); } } IntegerStamp resultStamp = (IntegerStamp) result.stamp(); assert toStamp.getBits() == resultStamp.getBits(); if (toStamp.isUnsigned() == resultStamp.isUnsigned()) { return result; } else { return graph.unique(new ReinterpretNode(toStamp, result)); } } }