1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000 1.2 +++ b/test/compiler/intrinsics/hashcode/TestHashCode.java Wed Apr 27 01:25:04 2016 +0800 1.3 @@ -0,0 +1,73 @@ 1.4 +/* 1.5 + * Copyright (c) 2014, Oracle and/or its affiliates. All rights reserved. 1.6 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 1.7 + * 1.8 + * This code is free software; you can redistribute it and/or modify it 1.9 + * under the terms of the GNU General Public License version 2 only, as 1.10 + * published by the Free Software Foundation. 1.11 + * 1.12 + * This code is distributed in the hope that it will be useful, but WITHOUT 1.13 + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 1.14 + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 1.15 + * version 2 for more details (a copy is included in the LICENSE file that 1.16 + * accompanied this code). 1.17 + * 1.18 + * You should have received a copy of the GNU General Public License version 1.19 + * 2 along with this work; if not, write to the Free Software Foundation, 1.20 + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 1.21 + * 1.22 + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 1.23 + * or visit www.oracle.com if you need additional information or have any 1.24 + * questions. 1.25 + */ 1.26 + 1.27 +/* 1.28 + * @test 1.29 + * @bug 8011646 1.30 + * @summary SEGV in compiled code with loop predication 1.31 + * @run main/othervm -XX:-TieredCompilation -XX:CompileOnly=TestHashCode.m1,Object.hashCode TestHashCode 1.32 + * 1.33 + */ 1.34 + 1.35 +public class TestHashCode { 1.36 + static class A { 1.37 + int i; 1.38 + } 1.39 + 1.40 + static class B extends A { 1.41 + } 1.42 + 1.43 + static boolean crash = false; 1.44 + 1.45 + static A m2() { 1.46 + if (crash) { 1.47 + return null; 1.48 + } 1.49 + return new A(); 1.50 + } 1.51 + 1.52 + static int m1(A aa) { 1.53 + int res = 0; 1.54 + for (int i = 0; i < 10; i++) { 1.55 + A a = m2(); 1.56 + int j = a.i; 1.57 + if (aa instanceof B) { 1.58 + } 1.59 + res += a.hashCode(); 1.60 + } 1.61 + return res; 1.62 + } 1.63 + 1.64 + public static void main(String[] args) { 1.65 + A a = new A(); 1.66 + for (int i = 0; i < 20000; i++) { 1.67 + m1(a); 1.68 + } 1.69 + crash = true; 1.70 + try { 1.71 + m1(a); 1.72 + } catch (NullPointerException e) { 1.73 + System.out.println("Test passed"); 1.74 + } 1.75 + } 1.76 +}