Mercurial > hg > graal-jvmci-8
view src/share/vm/gc_implementation/shared/immutableSpace.hpp @ 807:d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
Summary: For heaps larger than 32Gb, the number of heap regions overflows the data type used to hold the region index in the SparsePRT structure. Changed the region indexes, card indexes, and RSet hash table buckets to ints and added some size overflow guarantees.
Reviewed-by: ysr, tonyp
author | johnc |
---|---|
date | Thu, 11 Jun 2009 17:19:33 -0700 |
parents | 06df86c2ec37 |
children | c18cbe5936b8 |
line wrap: on
line source
/* * Copyright 2001-2008 Sun Microsystems, 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, * CA 95054 USA or visit www.sun.com if you need additional information or * have any questions. * */ // An ImmutableSpace is a viewport into a contiguous range // (or subrange) of previously allocated objects. // Invariant: bottom() and end() are on page_size boundaries and // bottom() <= end() class ImmutableSpace: public CHeapObj { friend class VMStructs; protected: HeapWord* _bottom; HeapWord* _end; public: ImmutableSpace() { _bottom = NULL; _end = NULL; } HeapWord* bottom() const { return _bottom; } HeapWord* end() const { return _end; } MemRegion region() const { return MemRegion(bottom(), end()); } // Initialization void initialize(MemRegion mr); bool contains(const void* p) const { return _bottom <= p && p < _end; } // Size computations. Sizes are in bytes. size_t capacity_in_bytes() const { return capacity_in_words() * HeapWordSize; } // Size computations. Sizes are in heapwords. size_t capacity_in_words() const { return pointer_delta(end(), bottom()); } virtual size_t capacity_in_words(Thread*) const { return capacity_in_words(); } // Iteration. virtual void oop_iterate(OopClosure* cl); virtual void object_iterate(ObjectClosure* cl); // Debugging virtual void print() const PRODUCT_RETURN; virtual void print_short() const PRODUCT_RETURN; virtual void verify(bool allow_dirty); };