1 /*
   2  * Copyright (c) 2009, 2012, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  */
  23 package org.graalvm.compiler.jtt.optimize;
  24 
  25 import org.junit.Test;
  26 
  27 import org.graalvm.compiler.jtt.JTTTest;
  28 
  29 /*
  30  * Tests constant folding of integer operations.
  31  */
  32 public class Reduce_Int03 extends JTTTest {
  33 
  34     public static int test(int arg) {
  35         if (arg == 0) {
  36             return add(5);
  37         }
  38         if (arg == 1) {
  39             return sub(10);
  40         }
  41         if (arg == 2) {
  42             return mul(5);
  43         }
  44         if (arg == 3) {
  45             return div(5);
  46         }
  47         if (arg == 4) {
  48             return mod(5);
  49         }
  50         if (arg == 5) {
  51             return and(15);
  52         }
  53         if (arg == 6) {
  54             return or(16);
  55         }
  56         if (arg == 7) {
  57             return xor(17);
  58         }
  59         return 0;
  60     }
  61 
  62     public static int add(int x) {
  63         return x + x;
  64     }
  65 
  66     public static int sub(int x) {
  67         return x - x;
  68     }
  69 
  70     public static int mul(int x) {
  71         return x * x;
  72     }
  73 
  74     public static int div(int x) {
  75         return x / x;
  76     }
  77 
  78     public static int mod(int x) {
  79         return x % x;
  80     }
  81 
  82     public static int and(int x) {
  83         return x & x;
  84     }
  85 
  86     public static int or(int x) {
  87         return x | x;
  88     }
  89 
  90     public static int xor(int x) {
  91         return x ^ x;
  92     }
  93 
  94     @Test
  95     public void run0() throws Throwable {
  96         runTest("test", 0);
  97     }
  98 
  99     @Test
 100     public void run1() throws Throwable {
 101         runTest("test", 1);
 102     }
 103 
 104     @Test
 105     public void run2() throws Throwable {
 106         runTest("test", 2);
 107     }
 108 
 109     @Test
 110     public void run3() throws Throwable {
 111         runTest("test", 3);
 112     }
 113 
 114     @Test
 115     public void run4() throws Throwable {
 116         runTest("test", 4);
 117     }
 118 
 119     @Test
 120     public void run5() throws Throwable {
 121         runTest("test", 5);
 122     }
 123 
 124     @Test
 125     public void run6() throws Throwable {
 126         runTest("test", 6);
 127     }
 128 
 129     @Test
 130     public void run7() throws Throwable {
 131         runTest("test", 7);
 132     }
 133 
 134 }