001/* 002 * Copyright (c) 2014, 2014, Oracle and/or its affiliates. All rights reserved. 003 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 004 * 005 * This code is free software; you can redistribute it and/or modify it 006 * under the terms of the GNU General Public License version 2 only, as 007 * published by the Free Software Foundation. 008 * 009 * This code is distributed in the hope that it will be useful, but WITHOUT 010 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 011 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 012 * version 2 for more details (a copy is included in the LICENSE file that 013 * accompanied this code). 014 * 015 * You should have received a copy of the GNU General Public License version 016 * 2 along with this work; if not, write to the Free Software Foundation, 017 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 018 * 019 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 020 * or visit www.oracle.com if you need additional information or have any 021 * questions. 022 */ 023package com.oracle.graal.nodes.calc; 024 025import jdk.internal.jvmci.meta.*; 026 027import com.oracle.graal.compiler.common.calc.*; 028import com.oracle.graal.graph.*; 029import com.oracle.graal.nodes.*; 030 031/** 032 * Represents a conversion between primitive types. 033 */ 034public interface ConvertNode extends ArithmeticOperation, NodeInterface { 035 036 ValueNode getValue(); 037 038 Constant convert(Constant c, ConstantReflectionProvider constantReflection); 039 040 Constant reverse(Constant c, ConstantReflectionProvider constantReflection); 041 042 /** 043 * Check whether a conversion is lossless. 044 * 045 * @return true iff reverse(convert(c)) == c for all c 046 */ 047 boolean isLossless(); 048 049 /** 050 * Check whether a conversion preserves comparison order. 051 * 052 * @param op a comparison operator 053 * @return true iff (c1 op c2) == (convert(c1) op convert(c2)) for all c1, c2 054 */ 055 default boolean preservesOrder(Condition op) { 056 return isLossless(); 057 } 058 059 /** 060 * Check whether a conversion preserves comparison order against a particular constant value. 061 * 062 * @param op a comparison operator 063 * @param value 064 * @param constantReflection 065 * @return true iff (c1 op value) == (convert(c1) op convert(value)) for value and all c1 066 */ 067 default boolean preservesOrder(Condition op, Constant value, ConstantReflectionProvider constantReflection) { 068 return preservesOrder(op); 069 } 070 071 ValueNode asNode(); 072}