Mercurial > hg > truffle

comparison test/compiler/6859338/Test6859338.java @ 848:fe95187e8882

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
6859338: amd64 native unverified entry point pushes values before implicit null check Reviewed-by: kvn, twisti
author never
date Mon, 13 Jul 2009 14:58:17 -0700
parents
children c18cbe5936b8
comparison
equal deleted inserted replaced
834:0f2d888530e7 848:fe95187e8882
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 6859338
28 * @summary Assertion failure in sharedRuntime.cpp
29 *
30 * @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:-InlineObjectHash -Xbatch -XX:-ProfileInterpreter Test6859338
31 */
32
33 public class Test6859338 {
34 static Object[] o = new Object[] { new Object(), null };
35 public static void main(String[] args) {
36 int total = 0;
37 try {
38 // Exercise the implicit null check in the unverified entry point
39 for (int i = 0; i < 40000; i++) {
40 int limit = o.length;
41 if (i < 20000) limit = 1;
42 for (int j = 0; j < limit; j++) {
43 total += o[j].hashCode();
44 }
45 }
46
47 } catch (NullPointerException e) {
48 // this is expected. A true failure causes a crash
49 }
50 }
51 }