001/* 002 * Copyright (c) 2009, 2012, 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.jtt.optimize; 024 025import org.junit.*; 026 027import com.oracle.graal.jtt.*; 028 029/* 030 * Tests value numbering of integer operations. 031 */ 032public class VN_Int01 extends JTTTest { 033 034 public static int test(int arg) { 035 if (arg == 0) { 036 return add(arg); 037 } 038 if (arg == 1) { 039 return sub(arg); 040 } 041 if (arg == 2) { 042 return mul(arg); 043 } 044 if (arg == 3) { 045 return div(arg); 046 } 047 if (arg == 4) { 048 return mod(arg); 049 } 050 if (arg == 5) { 051 return and(arg); 052 } 053 if (arg == 6) { 054 return or(arg); 055 } 056 if (arg == 7) { 057 return xor(arg); 058 } 059 return 0; 060 } 061 062 public static int add(int x) { 063 int c = 3; 064 int t = x + c; 065 int u = x + c; 066 return t + u; 067 } 068 069 public static int sub(int x) { 070 int c = 3; 071 int t = x - c; 072 int u = x - c; 073 return t - u; 074 } 075 076 public static int mul(int x) { 077 int i = 3; 078 int t = x * i; 079 int u = x * i; 080 return t * u; 081 } 082 083 public static int div(int x) { 084 int i = 9; 085 int t = i / x; 086 int u = i / x; 087 return t / u; 088 } 089 090 public static int mod(int x) { 091 int i = 7; 092 int t = i % x; 093 int u = i % x; 094 return t % u; 095 } 096 097 public static int and(int x) { 098 int i = 7; 099 int t = i & x; 100 int u = i & x; 101 return t & u; 102 } 103 104 public static int or(int x) { 105 int i = 7; 106 int t = i | x; 107 int u = i | x; 108 return t | u; 109 } 110 111 public static int xor(int x) { 112 int i = 7; 113 int t = i ^ x; 114 int u = i ^ x; 115 return t ^ u; 116 } 117 118 @Test 119 public void run0() throws Throwable { 120 runTest("test", 0); 121 } 122 123 @Test 124 public void run1() throws Throwable { 125 runTest("test", 1); 126 } 127 128 @Test 129 public void run2() throws Throwable { 130 runTest("test", 2); 131 } 132 133 @Test 134 public void run3() throws Throwable { 135 runTest("test", 3); 136 } 137 138 @Test 139 public void run4() throws Throwable { 140 runTest("test", 4); 141 } 142 143 @Test 144 public void run5() throws Throwable { 145 runTest("test", 5); 146 } 147 148 @Test 149 public void run6() throws Throwable { 150 runTest("test", 6); 151 } 152 153 @Test 154 public void run7() throws Throwable { 155 runTest("test", 7); 156 } 157 158}