1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/rt/emul/compacttest/src/test/java/org/apidesign/bck2brwsr/tck/IntegerArithmeticTest.java	Wed Nov 19 19:32:00 2014 +0100
     1.3 @@ -0,0 +1,166 @@
     1.4 +/**
     1.5 + * Back 2 Browser Bytecode Translator
     1.6 + * Copyright (C) 2012 Jaroslav Tulach <jaroslav.tulach@apidesign.org>
     1.7 + *
     1.8 + * This program is free software: you can redistribute it and/or modify
     1.9 + * it under the terms of the GNU General Public License as published by
    1.10 + * the Free Software Foundation, version 2 of the License.
    1.11 + *
    1.12 + * This program is distributed in the hope that it will be useful,
    1.13 + * but WITHOUT ANY WARRANTY; without even the implied warranty of
    1.14 + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    1.15 + * GNU General Public License for more details.
    1.16 + *
    1.17 + * You should have received a copy of the GNU General Public License
    1.18 + * along with this program. Look for COPYING file in the top folder.
    1.19 + * If not, see http://opensource.org/licenses/GPL-2.0.
    1.20 + */
    1.21 +package org.apidesign.bck2brwsr.tck;
    1.22 +
    1.23 +import org.apidesign.bck2brwsr.vmtest.Compare;
    1.24 +import org.apidesign.bck2brwsr.vmtest.VMTest;
    1.25 +import org.testng.annotations.Factory;
    1.26 +
    1.27 +/**
    1.28 + *
    1.29 + * @author Jaroslav Tulach <jtulach@netbeans.org>
    1.30 + */
    1.31 +public class IntegerArithmeticTest {
    1.32 +    
    1.33 +    private static int add(int x, int y) {
    1.34 +        return x + y;
    1.35 +    }
    1.36 +    
    1.37 +    private static int sub(int x, int y) {
    1.38 +        return x - y;
    1.39 +    }
    1.40 +    
    1.41 +    private static int mul(int x, int y) {
    1.42 +        return x * y;
    1.43 +    }
    1.44 +    
    1.45 +    private static int div(int x, int y) {
    1.46 +        return x / y;
    1.47 +    }
    1.48 +    
    1.49 +    private static int mod(int x, int y) {
    1.50 +        return x % y;
    1.51 +    }
    1.52 +    
    1.53 +    private static int neg(int x) {
    1.54 +        return (-x);
    1.55 +    }
    1.56 +
    1.57 +    private static float fadd(float x, float y) {
    1.58 +        return x + y;
    1.59 +    }
    1.60 +
    1.61 +    private static double dadd(double x, double y) {
    1.62 +        return x + y;
    1.63 +    }
    1.64 +    
    1.65 +    @Compare public int addOverflow() {
    1.66 +        return add(Integer.MAX_VALUE, 1);
    1.67 +    }
    1.68 +    
    1.69 +    @Compare public int subUnderflow() {
    1.70 +        return sub(Integer.MIN_VALUE, 1);
    1.71 +    }
    1.72 +    
    1.73 +    @Compare public int addMaxIntAndMaxInt() {
    1.74 +        return add(Integer.MAX_VALUE, Integer.MAX_VALUE);
    1.75 +    }
    1.76 +    
    1.77 +    @Compare public int subMinIntAndMinInt() {
    1.78 +        return sub(Integer.MIN_VALUE, Integer.MIN_VALUE);
    1.79 +    }
    1.80 +    
    1.81 +    @Compare public int multiplyMaxInt() {
    1.82 +        return mul(Integer.MAX_VALUE, 2);
    1.83 +    }
    1.84 +    
    1.85 +    @Compare public int multiplyMaxIntAndMaxInt() {
    1.86 +        return mul(Integer.MAX_VALUE, Integer.MAX_VALUE);
    1.87 +    }
    1.88 +    
    1.89 +    @Compare public int multiplyMinInt() {
    1.90 +        return mul(Integer.MIN_VALUE, 2);
    1.91 +    }
    1.92 +    
    1.93 +    @Compare public int multiplyMinIntAndMinInt() {
    1.94 +        return mul(Integer.MIN_VALUE, Integer.MIN_VALUE);
    1.95 +    }
    1.96 +    
    1.97 +    @Compare public int multiplyPrecision() {
    1.98 +        return mul(119106029, 1103515245);
    1.99 +    }
   1.100 +    
   1.101 +    @Compare public int division() {
   1.102 +        return div(1, 2);
   1.103 +    }
   1.104 +
   1.105 +    @Compare public int divisionReminder() {
   1.106 +        return mod(1, 2);
   1.107 +    }
   1.108 +
   1.109 +    @Compare public int negativeDivision() {
   1.110 +        return div(-7, 3);
   1.111 +    }
   1.112 +
   1.113 +    @Compare public int negativeDivisionReminder() {
   1.114 +        return mod(-7, 3);
   1.115 +    }
   1.116 +
   1.117 +    @Compare public int conversionFromFloat() {
   1.118 +        return (int) fadd(-2, -0.6f);
   1.119 +    }
   1.120 +
   1.121 +    @Compare public int conversionFromDouble() {
   1.122 +        return (int) dadd(-2, -0.6);
   1.123 +    }
   1.124 +
   1.125 +    @Compare public boolean divByZeroThrowsArithmeticException() {
   1.126 +        try {
   1.127 +            div(1, 0);
   1.128 +            return false;
   1.129 +        } catch (final ArithmeticException e) {
   1.130 +            return true;
   1.131 +        }
   1.132 +    }
   1.133 +
   1.134 +    @Compare public boolean modByZeroThrowsArithmeticException() {
   1.135 +        try {
   1.136 +            mod(1, 0);
   1.137 +            return false;
   1.138 +        } catch (final ArithmeticException e) {
   1.139 +            return true;
   1.140 +        }
   1.141 +    }
   1.142 +
   1.143 +    @Compare public int negate() {
   1.144 +        return neg(123456);
   1.145 +    }
   1.146 +    
   1.147 +    @Compare public int negateMaxInt() {
   1.148 +        return neg(Integer.MAX_VALUE);
   1.149 +    }
   1.150 +    
   1.151 +    @Compare public int negateMinInt() {
   1.152 +        return neg(Integer.MIN_VALUE);
   1.153 +    }
   1.154 +    
   1.155 +    @Compare public int sumTwoDimensions() {
   1.156 +        int[][] matrix = createMatrix(4, 3);
   1.157 +        matrix[0][0] += 10;
   1.158 +        return matrix[0][0];
   1.159 +    }
   1.160 +    
   1.161 +    static int[][] createMatrix(int x, int y) {
   1.162 +        return new int[x][y];
   1.163 +    }
   1.164 +    
   1.165 +    @Factory
   1.166 +    public static Object[] create() {
   1.167 +        return VMTest.create(IntegerArithmeticTest.class);
   1.168 +    }
   1.169 +}