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 Fold_Int01 extends JTTTest {
033
034    public static int test(int arg) {
035        if (arg == 0) {
036            return add();
037        }
038        if (arg == 1) {
039            return sub();
040        }
041        if (arg == 2) {
042            return mul();
043        }
044        if (arg == 3) {
045            return div();
046        }
047        if (arg == 4) {
048            return mod();
049        }
050        if (arg == 5) {
051            return and();
052        }
053        if (arg == 6) {
054            return or();
055        }
056        if (arg == 7) {
057            return xor();
058        }
059        return 0;
060    }
061
062    public static int add() {
063        int x = 3;
064        return x + 7;
065    }
066
067    public static int sub() {
068        int x = 15;
069        return x - 4;
070    }
071
072    public static int mul() {
073        int x = 6;
074        return x * 2;
075    }
076
077    public static int div() {
078        int x = 26;
079        return x / 2;
080    }
081
082    public static int mod() {
083        int x = 29;
084        return x % 15;
085    }
086
087    public static int and() {
088        int x = 31;
089        return x & 15;
090    }
091
092    public static int or() {
093        int x = 16;
094        return x | 16;
095    }
096
097    public static int xor() {
098        int x = 0;
099        return x ^ 17;
100    }
101
102    @Test
103    public void run0() throws Throwable {
104        runTest("test", 0);
105    }
106
107    @Test
108    public void run1() throws Throwable {
109        runTest("test", 1);
110    }
111
112    @Test
113    public void run2() throws Throwable {
114        runTest("test", 2);
115    }
116
117    @Test
118    public void run3() throws Throwable {
119        runTest("test", 3);
120    }
121
122    @Test
123    public void run4() throws Throwable {
124        runTest("test", 4);
125    }
126
127    @Test
128    public void run5() throws Throwable {
129        runTest("test", 5);
130    }
131
132    @Test
133    public void run6() throws Throwable {
134        runTest("test", 6);
135    }
136
137    @Test
138    public void run7() throws Throwable {
139        runTest("test", 7);
140    }
141
142}