/*
* Copyright (c) 2009, 2012, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package jtt.optimize;
/*
* Tests optimization of integer operations.
* @Harness: java
* @Runs: 0=80L; 1=11L; 2=12L; 3=13L; 4=64L
*/
public class Reduce_LongShift02 {
public static long test(long arg) {
if (arg == 0) {
return shift0(arg + 80);
}
if (arg == 1) {
return shift1(arg + 0x800000000000000aL);
}
if (arg == 2) {
return shift2(arg + 192);
}
if (arg == 3) {
return shift3(arg + 208);
}
if (arg == 4) {
return shift4(arg);
}
return 0;
}
public static long shift0(long x) {
return x >>> 3 << 3;
}
public static long shift1(long x) {
return x << 3 >>> 3;
}
public static long shift2(long x) {
return x >> 3 >> 1;
}
public static long shift3(long x) {
return x >>> 3 >>> 1;
}
public static long shift4(long x) {
return x << 3 << 1;
}
}