Mercurial > hg > truffle
view test/compiler/6860469/Test.java @ 10246:194f52aa2f23
7176479: G1: JVM crashes on T5-8 system with 1.5 TB heap
Summary: Refactor G1's hot card cache and card counts table into their own files. Simplify the card counts table, including removing the encoding of the card index in each entry. The card counts table now has a 1:1 correspondence with the cards spanned by heap. Space for the card counts table is reserved from virtual memory (rather than C heap) during JVM startup and is committed/expanded when the heap is expanded. Changes were also reviewed-by Vitaly Davidovich.
Reviewed-by: tschatzl, jmasa
author | johnc |
---|---|
date | Thu, 09 May 2013 11:16:39 -0700 |
parents | c18cbe5936b8 |
children |
line wrap: on
line source
/* * Copyright 2009 Google Inc. All Rights Reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. * */ /** * @test * @bug 6860469 * @summary remix_address_expressions reshapes address expression with bad control * * @run main/othervm -Xcomp -XX:CompileOnly=Test.C Test */ public class Test { private static final int H = 16; private static final int F = 9; static int[] fl = new int[1 << F]; static int C(int ll, int f) { int max = -1; int min = H + 1; if (ll != 0) { if (ll < min) { min = ll; } if (ll > max) { max = ll; } } if (f > max) { f = max; } if (min > f) { min = f; } for (int mc = 1 >> max - f; mc <= 0; mc++) { int i = mc << (32 - f); fl[i] = max; } return min; } public static void main(String argv[]) { C(0, 10); } }