Mercurial > hg > graal-compiler

comparison test/compiler/6826736/Test.java @ 858:5314d85ffd54

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
6826736: CMS: core dump with -XX:+UseCompressedOops Summary: Fix deoptimization code and OopMapSet::all_do() to check for oop = narrow_oop_base. Reviewed-by: jcoomes, phh, ysr, never
author kvn
date Wed, 22 Jul 2009 15:48:51 -0700
parents
children 2b9164d13ce9
comparison
equal deleted inserted replaced
857:17173cb6e48d 858:5314d85ffd54
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 6826736
28 * @summary CMS: core dump with -XX:+UseCompressedOops
29 *
30 * @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -Xbatch -XX:+ScavengeALot -XX:+UseCompressedOops -XX:HeapBaseMinAddress=32g -XX:CompileThreshold=100 -XX:CompileOnly=Test.test -XX:-BlockLayoutRotateLoops -XX:LoopUnrollLimit=0 Test
31 */
32
33 public class Test {
34 int[] arr;
35 int[] arr2;
36 int test(int r) {
37 for (int i = 0; i < 100; i++) {
38 for (int j = i; j < 100; j++) {
39 int a = 0;
40 for (long k = 0; k < 100; k++) {
41 a += k;
42 }
43 if (arr != null)
44 a = arr[j];
45 r += a;
46 }
47 }
48 return r;
49 }
50
51 public static void main(String[] args) {
52 int r = 0;
53 Test t = new Test();
54 for (int i = 0; i < 100; i++) {
55 t.arr = new int[100];
56 r = t.test(r);
57 }
58 System.out.println("Warmup 1 is done.");
59 for (int i = 0; i < 100; i++) {
60 t.arr = null;
61 r = t.test(r);
62 }
63 System.out.println("Warmup 2 is done.");
64 for (int i = 0; i < 100; i++) {
65 t.arr = new int[100];
66 r = t.test(r);
67 }
68 System.out.println("Warmup is done.");
69 for (int i = 0; i < 100; i++) {
70 t.arr = new int[1000000];
71 t.arr = null;
72 r = t.test(r);
73 }
74 }
75 }