test/compiler/6826736/Test.java

Tue, 08 Aug 2017 15:57:29 +0800

author
aoqi
date
Tue, 08 Aug 2017 15:57:29 +0800
changeset 6876
710a3c8b516e
parent 6315
231051bff068
parent 0
f90c822e73f8
permissions
-rw-r--r--

merge

aoqi@0 1 /*
aoqi@0 2 * Copyright (c) 2009, Oracle and/or its affiliates. All rights reserved.
aoqi@0 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
aoqi@0 4 *
aoqi@0 5 * This code is free software; you can redistribute it and/or modify it
aoqi@0 6 * under the terms of the GNU General Public License version 2 only, as
aoqi@0 7 * published by the Free Software Foundation.
aoqi@0 8 *
aoqi@0 9 * This code is distributed in the hope that it will be useful, but WITHOUT
aoqi@0 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
aoqi@0 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
aoqi@0 12 * version 2 for more details (a copy is included in the LICENSE file that
aoqi@0 13 * accompanied this code).
aoqi@0 14 *
aoqi@0 15 * You should have received a copy of the GNU General Public License version
aoqi@0 16 * 2 along with this work; if not, write to the Free Software Foundation,
aoqi@0 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
aoqi@0 18 *
aoqi@0 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
aoqi@0 20 * or visit www.oracle.com if you need additional information or have any
aoqi@0 21 * questions.
aoqi@0 22 *
aoqi@0 23 */
aoqi@0 24
aoqi@0 25 /**
aoqi@0 26 * @test
aoqi@0 27 * @bug 6826736
aoqi@0 28 * @summary CMS: core dump with -XX:+UseCompressedOops
aoqi@0 29 *
aoqi@0 30 * @run main/othervm/timeout=600 -XX:+IgnoreUnrecognizedVMOptions -Xbatch -XX:+ScavengeALot -XX:+UseCompressedOops -XX:HeapBaseMinAddress=32g -XX:CompileThreshold=100 -XX:CompileOnly=Test.test -XX:-BlockLayoutRotateLoops -XX:LoopUnrollLimit=0 -Xmx256m -XX:ParallelGCThreads=4 Test
aoqi@0 31 */
aoqi@0 32
aoqi@0 33 public class Test {
aoqi@0 34 int[] arr;
aoqi@0 35 int[] arr2;
aoqi@0 36 int test(int r) {
aoqi@0 37 for (int i = 0; i < 100; i++) {
aoqi@0 38 for (int j = i; j < 100; j++) {
aoqi@0 39 int a = 0;
aoqi@0 40 for (long k = 0; k < 100; k++) {
aoqi@0 41 a += k;
aoqi@0 42 }
aoqi@0 43 if (arr != null)
aoqi@0 44 a = arr[j];
aoqi@0 45 r += a;
aoqi@0 46 }
aoqi@0 47 }
aoqi@0 48 return r;
aoqi@0 49 }
aoqi@0 50
aoqi@0 51 public static void main(String[] args) {
aoqi@0 52 int r = 0;
aoqi@0 53 Test t = new Test();
aoqi@0 54 for (int i = 0; i < 100; i++) {
aoqi@0 55 t.arr = new int[100];
aoqi@0 56 r = t.test(r);
aoqi@0 57 }
aoqi@0 58 System.out.println("Warmup 1 is done.");
aoqi@0 59 for (int i = 0; i < 100; i++) {
aoqi@0 60 t.arr = null;
aoqi@0 61 r = t.test(r);
aoqi@0 62 }
aoqi@0 63 System.out.println("Warmup 2 is done.");
aoqi@0 64 for (int i = 0; i < 100; i++) {
aoqi@0 65 t.arr = new int[100];
aoqi@0 66 r = t.test(r);
aoqi@0 67 }
aoqi@0 68 System.out.println("Warmup is done.");
aoqi@0 69 for (int i = 0; i < 100; i++) {
aoqi@0 70 t.arr = new int[1000000];
aoqi@0 71 t.arr = null;
aoqi@0 72 r = t.test(r);
aoqi@0 73 }
aoqi@0 74 }
aoqi@0 75 }

mercurial