Mercurial > hg > truffle
view test/compiler/7100757/Test7100757.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 | 4bac06a82bc3 |
children |
line wrap: on
line source
/* * Copyright (c) 2011, Oracle and/or its affiliates. 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 7100757 * @summary The BitSet.nextSetBit() produces incorrect result in 32bit VM on Sparc * * @run main/timeout=300 Test7100757 */ import java.util.*; public class Test7100757 { public static final int NBITS = 256; public static void main(String[] args) { BitSet bs = new BitSet(NBITS); Random rnd = new Random(); long[] ra = new long[(NBITS+63)/64]; for(int l=0; l < 5000000; l++) { for(int r = 0; r < ra.length; r++) { ra[r] = rnd.nextLong(); } test(ra, bs); } } static void test(long[] ra, BitSet bs) { bs.clear(); int bits_set = 0; for(int i = 0, t = 0, b = 0; i < NBITS; i++) { long bit = 1L << b++; if((ra[t]&bit) != 0) { bs.set(i); bits_set++; } if(b == 64) { t++; b = 0; } } // Test Long.bitCount() int check_bits = bs.cardinality(); if (check_bits != bits_set) { String bs_str = bs.toString(); System.err.printf("cardinality bits: %d != %d bs: %s\n", check_bits, bits_set, bs_str); System.exit(97); } // Test Long.numberOfTrailingZeros() check_bits = 0; for (int i = bs.nextSetBit(0); i >= 0; i = bs.nextSetBit(i+1)) { check_bits++; } if (check_bits != bits_set) { String bs_str = bs.toString(); System.err.printf("nextSetBit bits: %d != %d bs: %s\n", check_bits, bits_set, bs_str); System.exit(97); } // Test Long.numberOfLeadingZeros() for(int i = bs.length(); i > 0; i = bs.length()) { bs.clear(i-1); } // Test Long.bitCount() check_bits = bs.cardinality(); if (check_bits != 0) { String bs_str = bs.toString(); System.err.printf("after clear bits: %d != 0 bs: %s\n", check_bits, bs_str); System.exit(97); } } };