Mercurial > hg > truffle

comparison test/compiler/6901572/Test.java @ 1083:8b22f86d1740

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
6901572: JVM 1.6.16 crash on loops: assert(has_node(i),"") Summary: Skip the secondary induction variable handling if it is dead Reviewed-by: never, kvn
author cfang
date Wed, 02 Dec 2009 13:29:00 -0800
parents
children c18cbe5936b8
comparison
equal deleted inserted replaced
1082:facbc74580c3 1083:8b22f86d1740
1 /*
2 * Copyright 2009 Sun Microsystems, Inc. All Rights Reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
20 * CA 95054 USA or visit www.sun.com if you need additional information or
21 * have any questions.
22 */
23
24 /**
25 * @test
26 * @bug 6901572
27 * @summary JVM 1.6.16 crash on loops: assert(has_node(i),"")
28 *
29 * @run main/othervm Test
30 */
31
32
33 public class Test {
34
35 public static void main(String[] args) {
36 for (int i = 0; i < 2; i++)
37 NestedLoop();
38 }
39
40 public static long NestedLoop() {
41 final int n = 50;
42 long startTime = System.currentTimeMillis();
43 int x = 0;
44 for(int a = 0; a < n; a++)
45 for(int b = 0; b < n; b++)
46 for(int c = 0; c < n; c++)
47 for(int d = 0; d < n; d++)
48 for(int e = 0; e < n; e++)
49 for(int f = 0; f < n; f++)
50 x++;
51 long stopTime = System.currentTimeMillis();
52
53 return stopTime - startTime;
54 }
55 }