Mercurial > hg > graal-compiler
view graal/com.oracle.max.graal.jtt/src/com/oracle/graal/jtt/optimize/VN_Int01.java @ 5060:4ed4295ce15f
Update import statements.
author | Thomas Wuerthinger <thomas.wuerthinger@oracle.com> |
---|---|
date | Thu, 08 Mar 2012 19:11:12 +0100 |
parents | ed559a528128 |
children |
line wrap: on
line source
/* * Copyright (c) 2009, 2012, 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.jtt.optimize; import org.junit.*; /* * Tests value numbering of integer operations. */ public class VN_Int01 { public static int test(int arg) { if (arg == 0) { return add(arg); } if (arg == 1) { return sub(arg); } if (arg == 2) { return mul(arg); } if (arg == 3) { return div(arg); } if (arg == 4) { return mod(arg); } if (arg == 5) { return and(arg); } if (arg == 6) { return or(arg); } if (arg == 7) { return xor(arg); } return 0; } public static int add(int x) { int c = 3; int t = x + c; int u = x + c; return t + u; } public static int sub(int x) { int c = 3; int t = x - c; int u = x - c; return t - u; } public static int mul(int x) { int i = 3; int t = x * i; int u = x * i; return t * u; } public static int div(int x) { int i = 9; int t = i / x; int u = i / x; return t / u; } public static int mod(int x) { int i = 7; int t = i % x; int u = i % x; return t % u; } public static int and(int x) { int i = 7; int t = i & x; int u = i & x; return t & u; } public static int or(int x) { int i = 7; int t = i | x; int u = i | x; return t | u; } public static int xor(int x) { int i = 7; int t = i ^ x; int u = i ^ x; return t ^ u; } @Test public void run0() throws Throwable { Assert.assertEquals(6, test(0)); } @Test public void run1() throws Throwable { Assert.assertEquals(0, test(1)); } @Test public void run2() throws Throwable { Assert.assertEquals(36, test(2)); } @Test public void run3() throws Throwable { Assert.assertEquals(1, test(3)); } @Test public void run4() throws Throwable { Assert.assertEquals(0, test(4)); } @Test public void run5() throws Throwable { Assert.assertEquals(5, test(5)); } @Test public void run6() throws Throwable { Assert.assertEquals(7, test(6)); } @Test public void run7() throws Throwable { Assert.assertEquals(0, test(7)); } }