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 6753639 |
aoqi@0 | 28 | * @summary Strange optimisation in for loop with cyclic integer condition |
aoqi@0 | 29 | * |
aoqi@0 | 30 | * @run main/othervm -Xbatch Test6753639 |
aoqi@0 | 31 | */ |
aoqi@0 | 32 | |
aoqi@0 | 33 | public class Test6753639 { |
aoqi@0 | 34 | public static void main(String[] args) throws InterruptedException { |
aoqi@0 | 35 | int END = Integer.MAX_VALUE; |
aoqi@0 | 36 | int count = 0; |
aoqi@0 | 37 | for(int i = Integer.MAX_VALUE - 5; i <= END; i++) { |
aoqi@0 | 38 | count++; |
aoqi@0 | 39 | if (count > 100000) { |
aoqi@0 | 40 | System.out.println("Passed"); |
aoqi@0 | 41 | System.exit(95); |
aoqi@0 | 42 | } |
aoqi@0 | 43 | } |
aoqi@0 | 44 | System.out.println("broken " + count); |
aoqi@0 | 45 | System.out.println("FAILED"); |
aoqi@0 | 46 | System.exit(97); |
aoqi@0 | 47 | } |
aoqi@0 | 48 | } |
aoqi@0 | 49 | |
aoqi@0 | 50 |