1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/vmtest/src/test/java/org/apidesign/bck2brwsr/tck/LongArithmeticTest.java Fri Jan 25 11:00:52 2013 +0100
1.3 @@ -0,0 +1,104 @@
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 LongArithmeticTest {
1.32 +
1.33 + private static long add(long x, long y) {
1.34 + return (x + y);
1.35 + }
1.36 +
1.37 + private static long sub(long x, long y) {
1.38 + return (x - y);
1.39 + }
1.40 +
1.41 + private static long mul(long x, long y) {
1.42 + return (x * y);
1.43 + }
1.44 +
1.45 + private static long div(long x, long y) {
1.46 + return (x / y);
1.47 + }
1.48 +
1.49 + private static long mod(long x, long y) {
1.50 + return (x % y);
1.51 + }
1.52 +
1.53 + @Compare public long conversion() {
1.54 + return Long.MAX_VALUE;
1.55 + }
1.56 +
1.57 + /*
1.58 + @Compare public long addOverflow() {
1.59 + return add(Long.MAX_VALUE, 1l);
1.60 + }
1.61 +
1.62 + @Compare public long subUnderflow() {
1.63 + return sub(Long.MIN_VALUE, 1l);
1.64 + }
1.65 +
1.66 + @Compare public long addMaxLongAndMaxLong() {
1.67 + return add(Long.MAX_VALUE, Long.MAX_VALUE);
1.68 + }
1.69 +
1.70 + @Compare public long subMinLongAndMinLong() {
1.71 + return sub(Long.MIN_VALUE, Long.MIN_VALUE);
1.72 + }
1.73 +
1.74 + @Compare public long multiplyMaxLong() {
1.75 + return mul(Long.MAX_VALUE, 2l);
1.76 + }
1.77 +
1.78 + @Compare public long multiplyMaxLongAndMaxLong() {
1.79 + return mul(Long.MAX_VALUE, Long.MAX_VALUE);
1.80 + }
1.81 +
1.82 + @Compare public long multiplyMinLong() {
1.83 + return mul(Long.MIN_VALUE, 2l);
1.84 + }
1.85 +
1.86 + @Compare public long multiplyMinLongAndMinLong() {
1.87 + return mul(Long.MIN_VALUE, Long.MIN_VALUE);
1.88 + }
1.89 +
1.90 + @Compare public long multiplyPrecision() {
1.91 + return mul(17638l, 1103l);
1.92 + }
1.93 +
1.94 + @Compare public long division() {
1.95 + return div(1l, 2l);
1.96 + }
1.97 +
1.98 + @Compare public long divisionReminder() {
1.99 + return mod(1l, 2l);
1.100 + }
1.101 + */
1.102 +
1.103 + @Factory
1.104 + public static Object[] create() {
1.105 + return VMTest.create(LongArithmeticTest.class);
1.106 + }
1.107 +}