Mercurial > hg > truffle
comparison test/compiler/6823453/Test.java @ 704:ad8c635e757e
6823453: DeoptimizeALot causes fastdebug server jvm to fail with assert(false,"unscheduable graph")
Summary: Use a HaltNode on the fall through path of the AllocateArrayNode to indicate that it is unreachable if the array length is negative.
Reviewed-by: never, jrose
author | kvn |
---|---|
date | Fri, 03 Apr 2009 13:33:32 -0700 |
parents | |
children | d6b9fd78f389 |
comparison
equal
deleted
inserted
replaced
685:4e35bfab60a5 | 704:ad8c635e757e |
---|---|
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 /* | |
26 * @test | |
27 * @bug 6823453 | |
28 * @summary DeoptimizeALot causes fastdebug server jvm to fail with assert(false,"unscheduable graph") | |
29 * @run main/othervm -Xcomp -XX:CompileOnly=Test -XX:+DeoptimizeALot Test | |
30 */ | |
31 | |
32 public class Test { | |
33 | |
34 static long vara_1 = 1L; | |
35 | |
36 static void testa() { | |
37 short var_2 = (byte) 1.0E10; | |
38 | |
39 for ( Object temp = new byte[(byte)1.0E10]; true ; | |
40 var_2 = "1".equals("0") ? ((byte) vara_1) : 1 ) {} | |
41 } | |
42 | |
43 static void testb() { | |
44 long var_1 = -1L; | |
45 | |
46 short var_2 = (byte) 1.0E10; | |
47 | |
48 for ( Object temp = new byte[(byte)1.0E10]; true ; | |
49 var_2 = "1".equals("0") ? ((byte) var_1) : 1 ) {} | |
50 } | |
51 | |
52 static void testc() { | |
53 long var_1 = -1L; | |
54 if (vara_1 > 0) var_1 = 1L; | |
55 | |
56 int var_2 = (byte)var_1 - 128; | |
57 | |
58 for ( Object temp = new byte[var_2]; true ; | |
59 var_2 = "1".equals("0") ? 2 : 1 ) {} | |
60 } | |
61 | |
62 static void testd() { | |
63 long var_1 = 0L; | |
64 | |
65 int var_2 = (byte)var_1 + 1; | |
66 for (int i=0; i<2 ; i++) var_2 = var_2 - 1; | |
67 | |
68 for ( Object temp = new byte[var_2]; true ; | |
69 var_2 = "1".equals("0") ? 2 : 1 ) {} | |
70 } | |
71 | |
72 public static void main(String[] args) throws Exception { | |
73 int nex = 0; | |
74 | |
75 try { | |
76 testa(); | |
77 } | |
78 catch (java.lang.NegativeArraySizeException ex) { nex++; } | |
79 try { | |
80 testb(); | |
81 } | |
82 catch (java.lang.NegativeArraySizeException ex) { nex++; } | |
83 try { | |
84 testc(); | |
85 } | |
86 catch (java.lang.NegativeArraySizeException ex) { nex++; } | |
87 try { | |
88 testd(); | |
89 } | |
90 catch (java.lang.NegativeArraySizeException ex) { nex++; } | |
91 | |
92 if (nex != 4) | |
93 System.exit(97); | |
94 } | |
95 } | |
96 |