2008-06-05 15:57:56 -07:00
|
|
|
/*
|
2012-08-28 15:20:08 -07:00
|
|
|
* Copyright (c) 2001, 2012, Oracle and/or its affiliates. All rights reserved.
|
2008-06-05 15:57:56 -07:00
|
|
|
* 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.
|
|
|
|
*
|
2010-05-27 19:08:38 -07:00
|
|
|
* 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.
|
2008-06-05 15:57:56 -07:00
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2010-11-23 13:22:55 -08:00
|
|
|
#ifndef SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTEDHEAP_INLINE_HPP
|
|
|
|
#define SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTEDHEAP_INLINE_HPP
|
|
|
|
|
|
|
|
#include "gc_implementation/g1/concurrentMark.hpp"
|
|
|
|
#include "gc_implementation/g1/g1CollectedHeap.hpp"
|
2011-03-30 10:26:59 -04:00
|
|
|
#include "gc_implementation/g1/g1AllocRegion.inline.hpp"
|
2010-08-24 17:24:33 -04:00
|
|
|
#include "gc_implementation/g1/g1CollectorPolicy.hpp"
|
2011-01-19 09:35:17 -05:00
|
|
|
#include "gc_implementation/g1/heapRegionSeq.inline.hpp"
|
2010-11-23 13:22:55 -08:00
|
|
|
#include "utilities/taskqueue.hpp"
|
|
|
|
|
2008-06-05 15:57:56 -07:00
|
|
|
// Inline functions for G1CollectedHeap
|
|
|
|
|
7045330: G1: Simplify/fix the HeapRegionSeq class
7042285: G1: native memory leak during humongous object allocation
6804436: G1: heap region indices should be size_t
A series of fixes and improvements to the HeapRegionSeq class: a) replace the _regions growable array with a standard C array, b) avoid de-allocating / re-allocating HeapRegion instances when the heap shrinks / grows (fix for 7042285), c) introduce fast method to map address to HeapRegion via a "biased" array pointer, d) embed the _hrs object in G1CollectedHeap, instead of pointing to it via an indirection, e) assume that all the regions added to the HeapRegionSeq instance are contiguous, f) replace int's with size_t's for indexes (and expand that to HeapRegion as part of 6804436), g) remove unnecessary / unused methods, h) rename a couple of fields (_alloc_search_start and _seq_bottom), i) fix iterate_from() not to always start from index 0 irrespective of the region passed to it, j) add a verification method to check the HeapRegionSeq assumptions, k) always call the wrappers for _hrs.iterate(), _hrs_length(), and _hrs.at() from G1CollectedHeap, not those methods directly, and l) unify the code that expands the sequence (by either re-using or creating a new HeapRegion) and make it robust wrt to a HeapRegion allocation failing.
Reviewed-by: stefank, johnc, brutisso
2011-06-10 13:16:40 -04:00
|
|
|
template <class T>
|
2008-06-05 15:57:56 -07:00
|
|
|
inline HeapRegion*
|
7045330: G1: Simplify/fix the HeapRegionSeq class
7042285: G1: native memory leak during humongous object allocation
6804436: G1: heap region indices should be size_t
A series of fixes and improvements to the HeapRegionSeq class: a) replace the _regions growable array with a standard C array, b) avoid de-allocating / re-allocating HeapRegion instances when the heap shrinks / grows (fix for 7042285), c) introduce fast method to map address to HeapRegion via a "biased" array pointer, d) embed the _hrs object in G1CollectedHeap, instead of pointing to it via an indirection, e) assume that all the regions added to the HeapRegionSeq instance are contiguous, f) replace int's with size_t's for indexes (and expand that to HeapRegion as part of 6804436), g) remove unnecessary / unused methods, h) rename a couple of fields (_alloc_search_start and _seq_bottom), i) fix iterate_from() not to always start from index 0 irrespective of the region passed to it, j) add a verification method to check the HeapRegionSeq assumptions, k) always call the wrappers for _hrs.iterate(), _hrs_length(), and _hrs.at() from G1CollectedHeap, not those methods directly, and l) unify the code that expands the sequence (by either re-using or creating a new HeapRegion) and make it robust wrt to a HeapRegion allocation failing.
Reviewed-by: stefank, johnc, brutisso
2011-06-10 13:16:40 -04:00
|
|
|
G1CollectedHeap::heap_region_containing(const T addr) const {
|
|
|
|
HeapRegion* hr = _hrs.addr_to_region((HeapWord*) addr);
|
2008-06-05 15:57:56 -07:00
|
|
|
// hr can be null if addr in perm_gen
|
|
|
|
if (hr != NULL && hr->continuesHumongous()) {
|
|
|
|
hr = hr->humongous_start_region();
|
|
|
|
}
|
|
|
|
return hr;
|
|
|
|
}
|
|
|
|
|
7045330: G1: Simplify/fix the HeapRegionSeq class
7042285: G1: native memory leak during humongous object allocation
6804436: G1: heap region indices should be size_t
A series of fixes and improvements to the HeapRegionSeq class: a) replace the _regions growable array with a standard C array, b) avoid de-allocating / re-allocating HeapRegion instances when the heap shrinks / grows (fix for 7042285), c) introduce fast method to map address to HeapRegion via a "biased" array pointer, d) embed the _hrs object in G1CollectedHeap, instead of pointing to it via an indirection, e) assume that all the regions added to the HeapRegionSeq instance are contiguous, f) replace int's with size_t's for indexes (and expand that to HeapRegion as part of 6804436), g) remove unnecessary / unused methods, h) rename a couple of fields (_alloc_search_start and _seq_bottom), i) fix iterate_from() not to always start from index 0 irrespective of the region passed to it, j) add a verification method to check the HeapRegionSeq assumptions, k) always call the wrappers for _hrs.iterate(), _hrs_length(), and _hrs.at() from G1CollectedHeap, not those methods directly, and l) unify the code that expands the sequence (by either re-using or creating a new HeapRegion) and make it robust wrt to a HeapRegion allocation failing.
Reviewed-by: stefank, johnc, brutisso
2011-06-10 13:16:40 -04:00
|
|
|
template <class T>
|
2008-06-05 15:57:56 -07:00
|
|
|
inline HeapRegion*
|
7045330: G1: Simplify/fix the HeapRegionSeq class
7042285: G1: native memory leak during humongous object allocation
6804436: G1: heap region indices should be size_t
A series of fixes and improvements to the HeapRegionSeq class: a) replace the _regions growable array with a standard C array, b) avoid de-allocating / re-allocating HeapRegion instances when the heap shrinks / grows (fix for 7042285), c) introduce fast method to map address to HeapRegion via a "biased" array pointer, d) embed the _hrs object in G1CollectedHeap, instead of pointing to it via an indirection, e) assume that all the regions added to the HeapRegionSeq instance are contiguous, f) replace int's with size_t's for indexes (and expand that to HeapRegion as part of 6804436), g) remove unnecessary / unused methods, h) rename a couple of fields (_alloc_search_start and _seq_bottom), i) fix iterate_from() not to always start from index 0 irrespective of the region passed to it, j) add a verification method to check the HeapRegionSeq assumptions, k) always call the wrappers for _hrs.iterate(), _hrs_length(), and _hrs.at() from G1CollectedHeap, not those methods directly, and l) unify the code that expands the sequence (by either re-using or creating a new HeapRegion) and make it robust wrt to a HeapRegion allocation failing.
Reviewed-by: stefank, johnc, brutisso
2011-06-10 13:16:40 -04:00
|
|
|
G1CollectedHeap::heap_region_containing_raw(const T addr) const {
|
|
|
|
assert(_g1_reserved.contains((const void*) addr), "invariant");
|
|
|
|
HeapRegion* res = _hrs.addr_to_region_unsafe((HeapWord*) addr);
|
2008-06-05 15:57:56 -07:00
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline bool G1CollectedHeap::obj_in_cs(oop obj) {
|
7045330: G1: Simplify/fix the HeapRegionSeq class
7042285: G1: native memory leak during humongous object allocation
6804436: G1: heap region indices should be size_t
A series of fixes and improvements to the HeapRegionSeq class: a) replace the _regions growable array with a standard C array, b) avoid de-allocating / re-allocating HeapRegion instances when the heap shrinks / grows (fix for 7042285), c) introduce fast method to map address to HeapRegion via a "biased" array pointer, d) embed the _hrs object in G1CollectedHeap, instead of pointing to it via an indirection, e) assume that all the regions added to the HeapRegionSeq instance are contiguous, f) replace int's with size_t's for indexes (and expand that to HeapRegion as part of 6804436), g) remove unnecessary / unused methods, h) rename a couple of fields (_alloc_search_start and _seq_bottom), i) fix iterate_from() not to always start from index 0 irrespective of the region passed to it, j) add a verification method to check the HeapRegionSeq assumptions, k) always call the wrappers for _hrs.iterate(), _hrs_length(), and _hrs.at() from G1CollectedHeap, not those methods directly, and l) unify the code that expands the sequence (by either re-using or creating a new HeapRegion) and make it robust wrt to a HeapRegion allocation failing.
Reviewed-by: stefank, johnc, brutisso
2011-06-10 13:16:40 -04:00
|
|
|
HeapRegion* r = _hrs.addr_to_region((HeapWord*) obj);
|
2008-06-05 15:57:56 -07:00
|
|
|
return r != NULL && r->in_collection_set();
|
|
|
|
}
|
|
|
|
|
2010-08-24 17:24:33 -04:00
|
|
|
inline HeapWord*
|
2011-03-30 10:26:59 -04:00
|
|
|
G1CollectedHeap::attempt_allocation(size_t word_size,
|
2013-03-28 10:27:28 +01:00
|
|
|
unsigned int* gc_count_before_ret,
|
|
|
|
int* gclocker_retry_count_ret) {
|
2011-01-12 16:34:25 -05:00
|
|
|
assert_heap_not_locked_and_not_at_safepoint();
|
2011-03-30 10:26:59 -04:00
|
|
|
assert(!isHumongous(word_size), "attempt_allocation() should not "
|
|
|
|
"be called for humongous allocation requests");
|
2010-08-24 17:24:33 -04:00
|
|
|
|
2011-03-30 10:26:59 -04:00
|
|
|
HeapWord* result = _mutator_alloc_region.attempt_allocation(word_size,
|
|
|
|
false /* bot_updates */);
|
|
|
|
if (result == NULL) {
|
2013-03-28 10:27:28 +01:00
|
|
|
result = attempt_allocation_slow(word_size,
|
|
|
|
gc_count_before_ret,
|
|
|
|
gclocker_retry_count_ret);
|
2008-06-05 15:57:56 -07:00
|
|
|
}
|
2011-03-30 10:26:59 -04:00
|
|
|
assert_heap_not_locked();
|
2011-01-12 16:34:25 -05:00
|
|
|
if (result != NULL) {
|
2011-03-30 10:26:59 -04:00
|
|
|
dirty_young_block(result, word_size);
|
2011-01-12 16:34:25 -05:00
|
|
|
}
|
2011-03-30 10:26:59 -04:00
|
|
|
return result;
|
2011-01-12 16:34:25 -05:00
|
|
|
}
|
|
|
|
|
2011-08-12 11:31:06 -04:00
|
|
|
inline HeapWord* G1CollectedHeap::survivor_attempt_allocation(size_t
|
|
|
|
word_size) {
|
|
|
|
assert(!isHumongous(word_size),
|
|
|
|
"we should not be seeing humongous-size allocations in this path");
|
|
|
|
|
|
|
|
HeapWord* result = _survivor_gc_alloc_region.attempt_allocation(word_size,
|
|
|
|
false /* bot_updates */);
|
|
|
|
if (result == NULL) {
|
|
|
|
MutexLockerEx x(FreeList_lock, Mutex::_no_safepoint_check_flag);
|
|
|
|
result = _survivor_gc_alloc_region.attempt_allocation_locked(word_size,
|
|
|
|
false /* bot_updates */);
|
|
|
|
}
|
|
|
|
if (result != NULL) {
|
|
|
|
dirty_young_block(result, word_size);
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline HeapWord* G1CollectedHeap::old_attempt_allocation(size_t word_size) {
|
|
|
|
assert(!isHumongous(word_size),
|
|
|
|
"we should not be seeing humongous-size allocations in this path");
|
|
|
|
|
|
|
|
HeapWord* result = _old_gc_alloc_region.attempt_allocation(word_size,
|
|
|
|
true /* bot_updates */);
|
|
|
|
if (result == NULL) {
|
|
|
|
MutexLockerEx x(FreeList_lock, Mutex::_no_safepoint_check_flag);
|
|
|
|
result = _old_gc_alloc_region.attempt_allocation_locked(word_size,
|
|
|
|
true /* bot_updates */);
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2010-08-24 17:24:33 -04:00
|
|
|
// It dirties the cards that cover the block so that so that the post
|
|
|
|
// write barrier never queues anything when updating objects on this
|
|
|
|
// block. It is assumed (and in fact we assert) that the block
|
|
|
|
// belongs to a young region.
|
|
|
|
inline void
|
|
|
|
G1CollectedHeap::dirty_young_block(HeapWord* start, size_t word_size) {
|
|
|
|
assert_heap_not_locked();
|
|
|
|
|
|
|
|
// Assign the containing region to containing_hr so that we don't
|
|
|
|
// have to keep calling heap_region_containing_raw() in the
|
|
|
|
// asserts below.
|
|
|
|
DEBUG_ONLY(HeapRegion* containing_hr = heap_region_containing_raw(start);)
|
|
|
|
assert(containing_hr != NULL && start != NULL && word_size > 0,
|
|
|
|
"pre-condition");
|
|
|
|
assert(containing_hr->is_in(start), "it should contain start");
|
|
|
|
assert(containing_hr->is_young(), "it should be young");
|
|
|
|
assert(!containing_hr->isHumongous(), "it should not be humongous");
|
|
|
|
|
|
|
|
HeapWord* end = start + word_size;
|
|
|
|
assert(containing_hr->is_in(end - 1), "it should also contain end - 1");
|
|
|
|
|
|
|
|
MemRegion mr(start, end);
|
2013-09-24 14:46:29 +02:00
|
|
|
g1_barrier_set()->dirty(mr);
|
2008-06-05 15:57:56 -07:00
|
|
|
}
|
|
|
|
|
2010-08-09 05:41:05 -07:00
|
|
|
inline RefToScanQueue* G1CollectedHeap::task_queue(int i) const {
|
2008-06-05 15:57:56 -07:00
|
|
|
return _task_queues->queue(i);
|
|
|
|
}
|
|
|
|
|
2012-08-28 15:20:08 -07:00
|
|
|
inline bool G1CollectedHeap::isMarkedPrev(oop obj) const {
|
2008-06-05 15:57:56 -07:00
|
|
|
return _cm->prevMarkBitMap()->isMarked((HeapWord *)obj);
|
|
|
|
}
|
|
|
|
|
|
|
|
inline bool G1CollectedHeap::isMarkedNext(oop obj) const {
|
|
|
|
return _cm->nextMarkBitMap()->isMarked((HeapWord *)obj);
|
|
|
|
}
|
2010-11-23 13:22:55 -08:00
|
|
|
|
2012-08-28 15:20:08 -07:00
|
|
|
#ifndef PRODUCT
|
|
|
|
// Support for G1EvacuationFailureALot
|
|
|
|
|
|
|
|
inline bool
|
|
|
|
G1CollectedHeap::evacuation_failure_alot_for_gc_type(bool gcs_are_young,
|
|
|
|
bool during_initial_mark,
|
|
|
|
bool during_marking) {
|
|
|
|
bool res = false;
|
|
|
|
if (during_marking) {
|
|
|
|
res |= G1EvacuationFailureALotDuringConcMark;
|
|
|
|
}
|
|
|
|
if (during_initial_mark) {
|
|
|
|
res |= G1EvacuationFailureALotDuringInitialMark;
|
|
|
|
}
|
|
|
|
if (gcs_are_young) {
|
|
|
|
res |= G1EvacuationFailureALotDuringYoungGC;
|
|
|
|
} else {
|
|
|
|
// GCs are mixed
|
|
|
|
res |= G1EvacuationFailureALotDuringMixedGC;
|
|
|
|
}
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline void
|
|
|
|
G1CollectedHeap::set_evacuation_failure_alot_for_current_gc() {
|
|
|
|
if (G1EvacuationFailureALot) {
|
|
|
|
// Note we can't assert that _evacuation_failure_alot_for_current_gc
|
|
|
|
// is clear here. It may have been set during a previous GC but that GC
|
|
|
|
// did not copy enough objects (i.e. G1EvacuationFailureALotCount) to
|
|
|
|
// trigger an evacuation failure and clear the flags and and counts.
|
|
|
|
|
|
|
|
// Check if we have gone over the interval.
|
|
|
|
const size_t gc_num = total_collections();
|
|
|
|
const size_t elapsed_gcs = gc_num - _evacuation_failure_alot_gc_number;
|
|
|
|
|
|
|
|
_evacuation_failure_alot_for_current_gc = (elapsed_gcs >= G1EvacuationFailureALotInterval);
|
|
|
|
|
|
|
|
// Now check if G1EvacuationFailureALot is enabled for the current GC type.
|
|
|
|
const bool gcs_are_young = g1_policy()->gcs_are_young();
|
|
|
|
const bool during_im = g1_policy()->during_initial_mark_pause();
|
|
|
|
const bool during_marking = mark_in_progress();
|
|
|
|
|
|
|
|
_evacuation_failure_alot_for_current_gc &=
|
|
|
|
evacuation_failure_alot_for_gc_type(gcs_are_young,
|
|
|
|
during_im,
|
|
|
|
during_marking);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
inline bool
|
|
|
|
G1CollectedHeap::evacuation_should_fail() {
|
|
|
|
if (!G1EvacuationFailureALot || !_evacuation_failure_alot_for_current_gc) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
// G1EvacuationFailureALot is in effect for current GC
|
|
|
|
// Access to _evacuation_failure_alot_count is not atomic;
|
|
|
|
// the value does not have to be exact.
|
|
|
|
if (++_evacuation_failure_alot_count < G1EvacuationFailureALotCount) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
_evacuation_failure_alot_count = 0;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline void G1CollectedHeap::reset_evacuation_should_fail() {
|
|
|
|
if (G1EvacuationFailureALot) {
|
|
|
|
_evacuation_failure_alot_gc_number = total_collections();
|
|
|
|
_evacuation_failure_alot_count = 0;
|
|
|
|
_evacuation_failure_alot_for_current_gc = false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif // #ifndef PRODUCT
|
|
|
|
|
2010-11-23 13:22:55 -08:00
|
|
|
#endif // SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTEDHEAP_INLINE_HPP
|