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 constant folding of integer operations.
031 */
032public class Reduce_Int02 extends JTTTest {
033
034    public static int test(int arg) {
035        if (arg == 0) {
036            return add(10);
037        }
038        if (arg == 1) {
039            return sub();
040        }
041        if (arg == 2) {
042            return mul(12);
043        }
044        if (arg == 3) {
045            return div();
046        }
047        if (arg == 4) {
048            return mod();
049        }
050        if (arg == 5) {
051            return and(15);
052        }
053        if (arg == 6) {
054            return or(16);
055        }
056        if (arg == 7) {
057            return xor(17);
058        }
059        return 0;
060    }
061
062    public static int add(int x) {
063        return 0 + x;
064    }
065
066    public static int sub() {
067        return 11;
068    }
069
070    public static int mul(int x) {
071        return 1 * x;
072    }
073
074    public static int div() {
075        return 13;
076    }
077
078    public static int mod() {
079        return 14;
080    }
081
082    public static int and(int x) {
083        return -1 & x;
084    }
085
086    public static int or(int x) {
087        return 0 | x;
088    }
089
090    public static int xor(int x) {
091        return 0 ^ x;
092    }
093
094    @Test
095    public void run0() throws Throwable {
096        runTest("test", 0);
097    }
098
099    @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}