Thu, 25 Aug 2011 17:17:59 -0700
Added tag jdk8-b02 for changeset 31e253c1da42
aoqi@0 | 1 | /* |
aoqi@0 | 2 | * Copyright (c) 2011, Oracle and/or its affiliates. All rights reserved. |
aoqi@0 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
aoqi@0 | 4 | * |
aoqi@0 | 5 | * This code is free software; you can redistribute it and/or modify it |
aoqi@0 | 6 | * under the terms of the GNU General Public License version 2 only, as |
aoqi@0 | 7 | * published by the Free Software Foundation. |
aoqi@0 | 8 | * |
aoqi@0 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
aoqi@0 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
aoqi@0 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
aoqi@0 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
aoqi@0 | 13 | * accompanied this code). |
aoqi@0 | 14 | * |
aoqi@0 | 15 | * You should have received a copy of the GNU General Public License version |
aoqi@0 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
aoqi@0 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
aoqi@0 | 18 | * |
aoqi@0 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
aoqi@0 | 20 | * or visit www.oracle.com if you need additional information or have any |
aoqi@0 | 21 | * questions. |
aoqi@0 | 22 | * |
aoqi@0 | 23 | */ |
aoqi@0 | 24 | |
aoqi@0 | 25 | /** |
aoqi@0 | 26 | * @test |
aoqi@0 | 27 | * @bug 6931567 |
aoqi@0 | 28 | * @summary JIT Error (on class file compiled with eclipse) on JVM x64 (but not on x32!). |
aoqi@0 | 29 | * |
aoqi@0 | 30 | * @run main Test6931567 |
aoqi@0 | 31 | */ |
aoqi@0 | 32 | |
aoqi@0 | 33 | // Should be compiled with javac from JDK1.3 to get bytecode which shows the problem. |
aoqi@0 | 34 | public class Test6931567 { |
aoqi@0 | 35 | |
aoqi@0 | 36 | public static void main(final String[] args) { |
aoqi@0 | 37 | booleanInvert(Integer.MAX_VALUE); |
aoqi@0 | 38 | booleanInvert(Integer.MAX_VALUE - 1); |
aoqi@0 | 39 | } |
aoqi@0 | 40 | |
aoqi@0 | 41 | private static void booleanInvert(final int max) { |
aoqi@0 | 42 | boolean test1 = false; |
aoqi@0 | 43 | boolean test2 = false; |
aoqi@0 | 44 | |
aoqi@0 | 45 | for (int i = 0; i < max; i++) { |
aoqi@0 | 46 | test1 = !test1; |
aoqi@0 | 47 | } |
aoqi@0 | 48 | |
aoqi@0 | 49 | for (int i = 0; i < max; i++) { |
aoqi@0 | 50 | test2 ^= true; |
aoqi@0 | 51 | } |
aoqi@0 | 52 | |
aoqi@0 | 53 | if (test1 != test2) { |
aoqi@0 | 54 | System.out.println("ERROR: Boolean invert\n\ttest1=" + test1 |
aoqi@0 | 55 | + "\n\ttest2=" + test2); |
aoqi@0 | 56 | System.exit(97); |
aoqi@0 | 57 | } else { |
aoqi@0 | 58 | System.out.println("Passed!"); |
aoqi@0 | 59 | } |
aoqi@0 | 60 | } |
aoqi@0 | 61 | } |
aoqi@0 | 62 |