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 optimization of integer operations.
031 */
032public class Reduce_IntShift02 extends JTTTest {
033
034    public static int test(int arg) {
035        if (arg == 0) {
036            return shift0(arg + 80);
037        }
038        if (arg == 1) {
039            return shift1(arg + 0x8000000a);
040        }
041        if (arg == 2) {
042            return shift2(arg + 192);
043        }
044        if (arg == 3) {
045            return shift3(arg + 208);
046        }
047        if (arg == 4) {
048            return shift4(arg);
049        }
050        if (arg == 5) {
051            return shift5(arg);
052        }
053        return 0;
054    }
055
056    public static int shift0(int x) {
057        return x >>> 3 << 3;
058    }
059
060    public static int shift1(int x) {
061        return x << 3 >>> 3;
062    }
063
064    public static int shift2(int x) {
065        return x >> 3 >> 1;
066    }
067
068    public static int shift3(int x) {
069        return x >>> 3 >>> 1;
070    }
071
072    public static int shift4(int x) {
073        return x << 3 << 1;
074    }
075
076    public static int shift5(int x) {
077        return x << 16 << 17;
078    }
079
080    @Test
081    public void run0() throws Throwable {
082        runTest("test", 0);
083    }
084
085    @Test
086    public void run1() throws Throwable {
087        runTest("test", 1);
088    }
089
090    @Test
091    public void run2() throws Throwable {
092        runTest("test", 2);
093    }
094
095    @Test
096    public void run3() throws Throwable {
097        runTest("test", 3);
098    }
099
100    @Test
101    public void run4() throws Throwable {
102        runTest("test", 4);
103    }
104
105    @Test
106    public void run5() throws Throwable {
107        runTest("test", 5);
108    }
109
110}