Mercurial > hg > truffle

comparison test/compiler/intrinsics/hashcode/TestHashCode.java @ 17968:dbf0d88d867d

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
8011646: SEGV in compiled code with loop predication Summary: Remove control edge of load node to ensure that castPP removal sets the control edge correctly Reviewed-by: kvn, roland
author anoll
date Fri, 30 May 2014 06:50:38 +0200
parents
children
comparison
equal deleted inserted replaced
17964:660b3f6bf7d7 17968:dbf0d88d867d
1 /*
2 * Copyright (c) 2014, Oracle and/or its affiliates. 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 */
23
24 /*
25 * @test
26 * @bug 8011646
27 * @summary SEGV in compiled code with loop predication
28 * @run main/othervm -XX:-TieredCompilation -XX:CompileOnly=TestHashCode.m1,Object.hashCode TestHashCode
29 *
30 */
31
32 public class TestHashCode {
33 static class A {
34 int i;
35 }
36
37 static class B extends A {
38 }
39
40 static boolean crash = false;
41
42 static A m2() {
43 if (crash) {
44 return null;
45 }
46 return new A();
47 }
48
49 static int m1(A aa) {
50 int res = 0;
51 for (int i = 0; i < 10; i++) {
52 A a = m2();
53 int j = a.i;
54 if (aa instanceof B) {
55 }
56 res += a.hashCode();
57 }
58 return res;
59 }
60
61 public static void main(String[] args) {
62 A a = new A();
63 for (int i = 0; i < 20000; i++) {
64 m1(a);
65 }
66 crash = true;
67 try {
68 m1(a);
69 } catch (NullPointerException e) {
70 System.out.println("Test passed");
71 }
72 }
73 }