author | tschatzl |
Tue, 10 Feb 2015 17:41:19 -0500 | |
changeset 28939 | 0d2964a78d0e |
parent 28217 | 57791914628c |
child 29081 | c61eb4914428 |
permissions | -rw-r--r-- |
1 | 1 |
/* |
28939 | 2 |
* Copyright (c) 2000, 2015, Oracle and/or its affiliates. All rights reserved. |
1 | 3 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 |
* |
|
5 |
* This code is free software; you can redistribute it and/or modify it |
|
6 |
* under the terms of the GNU General Public License version 2 only, as |
|
7 |
* published by the Free Software Foundation. |
|
8 |
* |
|
9 |
* This code is distributed in the hope that it will be useful, but WITHOUT |
|
10 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
11 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
12 |
* version 2 for more details (a copy is included in the LICENSE file that |
|
13 |
* accompanied this code). |
|
14 |
* |
|
15 |
* You should have received a copy of the GNU General Public License version |
|
16 |
* 2 along with this work; if not, write to the Free Software Foundation, |
|
17 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
|
18 |
* |
|
5547
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
5433
diff
changeset
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
5433
diff
changeset
|
20 |
* or visit www.oracle.com if you need additional information or have any |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
5433
diff
changeset
|
21 |
* questions. |
1 | 22 |
* |
23 |
*/ |
|
24 |
||
7397 | 25 |
#include "precompiled.hpp" |
26 |
#include "classfile/symbolTable.hpp" |
|
27 |
#include "classfile/systemDictionary.hpp" |
|
28 |
#include "classfile/vmSymbols.hpp" |
|
29 |
#include "code/icBuffer.hpp" |
|
30 |
#include "gc_implementation/shared/collectorCounters.hpp" |
|
25350
6423a57e5451
8043607: Add a GC id as a log decoration similar to PrintGCTimeStamps
brutisso
parents:
24941
diff
changeset
|
31 |
#include "gc_implementation/shared/gcTrace.hpp" |
18025 | 32 |
#include "gc_implementation/shared/gcTraceTime.hpp" |
7397 | 33 |
#include "gc_implementation/shared/vmGCOperations.hpp" |
34 |
#include "gc_interface/collectedHeap.inline.hpp" |
|
35 |
#include "memory/filemap.hpp" |
|
36 |
#include "memory/gcLocker.inline.hpp" |
|
37 |
#include "memory/genCollectedHeap.hpp" |
|
38 |
#include "memory/genOopClosures.inline.hpp" |
|
39 |
#include "memory/generationSpec.hpp" |
|
40 |
#include "memory/resourceArea.hpp" |
|
41 |
#include "memory/sharedHeap.hpp" |
|
42 |
#include "memory/space.hpp" |
|
43 |
#include "oops/oop.inline.hpp" |
|
44 |
#include "oops/oop.inline2.hpp" |
|
45 |
#include "runtime/biasedLocking.hpp" |
|
46 |
#include "runtime/fprofiler.hpp" |
|
47 |
#include "runtime/handles.hpp" |
|
48 |
#include "runtime/handles.inline.hpp" |
|
49 |
#include "runtime/java.hpp" |
|
50 |
#include "runtime/vmThread.hpp" |
|
51 |
#include "services/memoryService.hpp" |
|
52 |
#include "utilities/vmError.hpp" |
|
53 |
#include "utilities/workgroup.hpp" |
|
15482
470d0b0c09f1
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
14076
diff
changeset
|
54 |
#include "utilities/macros.hpp" |
470d0b0c09f1
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
14076
diff
changeset
|
55 |
#if INCLUDE_ALL_GCS |
7397 | 56 |
#include "gc_implementation/concurrentMarkSweep/concurrentMarkSweepThread.hpp" |
57 |
#include "gc_implementation/concurrentMarkSweep/vmCMSOperations.hpp" |
|
15482
470d0b0c09f1
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
14076
diff
changeset
|
58 |
#endif // INCLUDE_ALL_GCS |
1 | 59 |
|
60 |
GenCollectedHeap* GenCollectedHeap::_gch; |
|
61 |
NOT_PRODUCT(size_t GenCollectedHeap::_skip_header_HeapWords = 0;) |
|
62 |
||
25492
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
63 |
// The set of potentially parallel tasks in root scanning. |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
64 |
enum GCH_strong_roots_tasks { |
1 | 65 |
// We probably want to parallelize both of these internally, but for now... |
66 |
GCH_PS_younger_gens, |
|
67 |
// Leave this one last. |
|
68 |
GCH_PS_NumElements |
|
69 |
}; |
|
70 |
||
71 |
GenCollectedHeap::GenCollectedHeap(GenCollectorPolicy *policy) : |
|
72 |
SharedHeap(policy), |
|
28217
57791914628c
8067499: G1SATBCardTableModRefBS should not inherit from CardTableModRefBSForCTRS
kbarrett
parents:
28212
diff
changeset
|
73 |
_rem_set(NULL), |
1 | 74 |
_gen_policy(policy), |
25492
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
75 |
_gen_process_roots_tasks(new SubTasksDone(GCH_PS_NumElements)), |
1 | 76 |
_full_collections_completed(0) |
77 |
{ |
|
25492
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
78 |
if (_gen_process_roots_tasks == NULL || |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
79 |
!_gen_process_roots_tasks->valid()) { |
1 | 80 |
vm_exit_during_initialization("Failed necessary allocation."); |
81 |
} |
|
82 |
assert(policy != NULL, "Sanity check"); |
|
83 |
} |
|
84 |
||
85 |
jint GenCollectedHeap::initialize() { |
|
4637 | 86 |
CollectedHeap::pre_initialize(); |
87 |
||
1 | 88 |
int i; |
89 |
_n_gens = gen_policy()->number_of_generations(); |
|
90 |
||
91 |
// While there are no constraints in the GC code that HeapWordSize |
|
92 |
// be any particular value, there are multiple other areas in the |
|
93 |
// system which believe this to be true (e.g. oop->object_size in some |
|
94 |
// cases incorrectly returns the size in wordSize units rather than |
|
95 |
// HeapWordSize). |
|
96 |
guarantee(HeapWordSize == wordSize, "HeapWordSize must equal wordSize"); |
|
97 |
||
98 |
// The heap must be at least as aligned as generations. |
|
19546
f6b7c9e96ea3
8007074: SIGSEGV at ParMarkBitMap::verify_clear()
stefank
parents:
19322
diff
changeset
|
99 |
size_t gen_alignment = Generation::GenGrain; |
1 | 100 |
|
101 |
_gen_specs = gen_policy()->generations(); |
|
102 |
||
103 |
// Make sure the sizes are all aligned. |
|
104 |
for (i = 0; i < _n_gens; i++) { |
|
19546
f6b7c9e96ea3
8007074: SIGSEGV at ParMarkBitMap::verify_clear()
stefank
parents:
19322
diff
changeset
|
105 |
_gen_specs[i]->align(gen_alignment); |
1 | 106 |
} |
107 |
||
108 |
// Allocate space for the heap. |
|
109 |
||
110 |
char* heap_address; |
|
19546
f6b7c9e96ea3
8007074: SIGSEGV at ParMarkBitMap::verify_clear()
stefank
parents:
19322
diff
changeset
|
111 |
ReservedSpace heap_rs; |
1 | 112 |
|
21561
c619b1cb4554
8016309: assert(eden_size > 0 && survivor_size > 0) failed: just checking
jwilhelm
parents:
21560
diff
changeset
|
113 |
size_t heap_alignment = collector_policy()->heap_alignment(); |
19546
f6b7c9e96ea3
8007074: SIGSEGV at ParMarkBitMap::verify_clear()
stefank
parents:
19322
diff
changeset
|
114 |
|
28939 | 115 |
heap_address = allocate(heap_alignment, &heap_rs); |
1 | 116 |
|
117 |
if (!heap_rs.is_reserved()) { |
|
118 |
vm_shutdown_during_initialization( |
|
119 |
"Could not reserve enough space for object heap"); |
|
120 |
return JNI_ENOMEM; |
|
121 |
} |
|
122 |
||
26829
26315213bab8
8055091: CollectedHeap::_reserved usage should be cleaned up
mlarsson
parents:
26183
diff
changeset
|
123 |
initialize_reserved_region((HeapWord*)heap_rs.base(), (HeapWord*)(heap_rs.base() + heap_rs.size())); |
1 | 124 |
|
27687
3a6367d7110b
8064721: The card tables only ever need two covering regions
ehelin
parents:
27252
diff
changeset
|
125 |
_rem_set = collector_policy()->create_rem_set(reserved_region()); |
1 | 126 |
set_barrier_set(rem_set()->bs()); |
4637 | 127 |
|
1 | 128 |
_gch = this; |
129 |
||
27252 | 130 |
for (i = 0; i < _n_gens; i++) { |
131 |
ReservedSpace this_rs = heap_rs.first_part(_gen_specs[i]->max_size(), false, false); |
|
132 |
_gens[i] = _gen_specs[i]->init(this_rs, i, rem_set()); |
|
133 |
heap_rs = heap_rs.last_part(_gen_specs[i]->max_size()); |
|
134 |
} |
|
6985
e9364ec299ac
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
6759
diff
changeset
|
135 |
clear_incremental_collection_failed(); |
1 | 136 |
|
15482
470d0b0c09f1
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
14076
diff
changeset
|
137 |
#if INCLUDE_ALL_GCS |
1 | 138 |
// If we are running CMS, create the collector responsible |
139 |
// for collecting the CMS generations. |
|
140 |
if (collector_policy()->is_concurrent_mark_sweep_policy()) { |
|
141 |
bool success = create_cms_collector(); |
|
142 |
if (!success) return JNI_ENOMEM; |
|
143 |
} |
|
15482
470d0b0c09f1
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
14076
diff
changeset
|
144 |
#endif // INCLUDE_ALL_GCS |
1 | 145 |
|
146 |
return JNI_OK; |
|
147 |
} |
|
148 |
||
27252 | 149 |
|
1 | 150 |
char* GenCollectedHeap::allocate(size_t alignment, |
151 |
ReservedSpace* heap_rs){ |
|
152 |
const char overflow_msg[] = "The size of the object heap + VM data exceeds " |
|
153 |
"the maximum representable size"; |
|
154 |
||
155 |
// Now figure out the total size. |
|
156 |
size_t total_reserved = 0; |
|
157 |
const size_t pageSize = UseLargePages ? |
|
158 |
os::large_page_size() : os::vm_page_size(); |
|
159 |
||
19546
f6b7c9e96ea3
8007074: SIGSEGV at ParMarkBitMap::verify_clear()
stefank
parents:
19322
diff
changeset
|
160 |
assert(alignment % pageSize == 0, "Must be"); |
f6b7c9e96ea3
8007074: SIGSEGV at ParMarkBitMap::verify_clear()
stefank
parents:
19322
diff
changeset
|
161 |
|
1 | 162 |
for (int i = 0; i < _n_gens; i++) { |
163 |
total_reserved += _gen_specs[i]->max_size(); |
|
164 |
if (total_reserved < _gen_specs[i]->max_size()) { |
|
165 |
vm_exit_during_initialization(overflow_msg); |
|
166 |
} |
|
167 |
} |
|
19546
f6b7c9e96ea3
8007074: SIGSEGV at ParMarkBitMap::verify_clear()
stefank
parents:
19322
diff
changeset
|
168 |
assert(total_reserved % alignment == 0, |
f6b7c9e96ea3
8007074: SIGSEGV at ParMarkBitMap::verify_clear()
stefank
parents:
19322
diff
changeset
|
169 |
err_msg("Gen size; total_reserved=" SIZE_FORMAT ", alignment=" |
f6b7c9e96ea3
8007074: SIGSEGV at ParMarkBitMap::verify_clear()
stefank
parents:
19322
diff
changeset
|
170 |
SIZE_FORMAT, total_reserved, alignment)); |
1 | 171 |
|
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12781
diff
changeset
|
172 |
*heap_rs = Universe::reserve_heap(total_reserved, alignment); |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12781
diff
changeset
|
173 |
return heap_rs->base(); |
1 | 174 |
} |
175 |
||
27252 | 176 |
|
1 | 177 |
void GenCollectedHeap::post_initialize() { |
178 |
SharedHeap::post_initialize(); |
|
24353
148147d21135
8027643: Merge GenCollectorPolicy and TwoGenerationCollectorPolicy
jwilhelm
parents:
23854
diff
changeset
|
179 |
GenCollectorPolicy *policy = (GenCollectorPolicy *)collector_policy(); |
148147d21135
8027643: Merge GenCollectorPolicy and TwoGenerationCollectorPolicy
jwilhelm
parents:
23854
diff
changeset
|
180 |
guarantee(policy->is_generation_policy(), "Illegal policy type"); |
27903
14c6e2f23fa0
8065992: Change CMSCollector::_young_gen to be a ParNewGeneration*
brutisso
parents:
27898
diff
changeset
|
181 |
assert((get_gen(0)->kind() == Generation::DefNew) || |
14c6e2f23fa0
8065992: Change CMSCollector::_young_gen to be a ParNewGeneration*
brutisso
parents:
27898
diff
changeset
|
182 |
(get_gen(0)->kind() == Generation::ParNew), |
14c6e2f23fa0
8065992: Change CMSCollector::_young_gen to be a ParNewGeneration*
brutisso
parents:
27898
diff
changeset
|
183 |
"Wrong youngest generation type"); |
14c6e2f23fa0
8065992: Change CMSCollector::_young_gen to be a ParNewGeneration*
brutisso
parents:
27898
diff
changeset
|
184 |
DefNewGeneration* def_new_gen = (DefNewGeneration*)get_gen(0); |
1 | 185 |
|
186 |
Generation* old_gen = get_gen(1); |
|
187 |
assert(old_gen->kind() == Generation::ConcurrentMarkSweep || |
|
188 |
old_gen->kind() == Generation::MarkSweepCompact, |
|
189 |
"Wrong generation kind"); |
|
190 |
||
191 |
policy->initialize_size_policy(def_new_gen->eden()->capacity(), |
|
192 |
old_gen->capacity(), |
|
193 |
def_new_gen->from()->capacity()); |
|
194 |
policy->initialize_gc_policy_counters(); |
|
195 |
} |
|
196 |
||
197 |
void GenCollectedHeap::ref_processing_init() { |
|
198 |
SharedHeap::ref_processing_init(); |
|
27252 | 199 |
for (int i = 0; i < _n_gens; i++) { |
200 |
_gens[i]->ref_processor_init(); |
|
201 |
} |
|
1 | 202 |
} |
203 |
||
204 |
size_t GenCollectedHeap::capacity() const { |
|
27252 | 205 |
size_t res = 0; |
206 |
for (int i = 0; i < _n_gens; i++) { |
|
207 |
res += _gens[i]->capacity(); |
|
208 |
} |
|
209 |
return res; |
|
1 | 210 |
} |
211 |
||
212 |
size_t GenCollectedHeap::used() const { |
|
27252 | 213 |
size_t res = 0; |
214 |
for (int i = 0; i < _n_gens; i++) { |
|
215 |
res += _gens[i]->used(); |
|
216 |
} |
|
217 |
return res; |
|
1 | 218 |
} |
219 |
||
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12781
diff
changeset
|
220 |
// Save the "used_region" for generations level and lower. |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12781
diff
changeset
|
221 |
void GenCollectedHeap::save_used_regions(int level) { |
1 | 222 |
assert(level < _n_gens, "Illegal level parameter"); |
27252 | 223 |
for (int i = level; i >= 0; i--) { |
224 |
_gens[i]->save_used_region(); |
|
1 | 225 |
} |
226 |
} |
|
227 |
||
228 |
size_t GenCollectedHeap::max_capacity() const { |
|
27252 | 229 |
size_t res = 0; |
230 |
for (int i = 0; i < _n_gens; i++) { |
|
231 |
res += _gens[i]->max_capacity(); |
|
232 |
} |
|
233 |
return res; |
|
1 | 234 |
} |
235 |
||
236 |
// Update the _full_collections_completed counter |
|
237 |
// at the end of a stop-world full GC. |
|
238 |
unsigned int GenCollectedHeap::update_full_collections_completed() { |
|
239 |
MonitorLockerEx ml(FullGCCount_lock, Mutex::_no_safepoint_check_flag); |
|
240 |
assert(_full_collections_completed <= _total_full_collections, |
|
241 |
"Can't complete more collections than were started"); |
|
242 |
_full_collections_completed = _total_full_collections; |
|
243 |
ml.notify_all(); |
|
244 |
return _full_collections_completed; |
|
245 |
} |
|
246 |
||
247 |
// Update the _full_collections_completed counter, as appropriate, |
|
248 |
// at the end of a concurrent GC cycle. Note the conditional update |
|
249 |
// below to allow this method to be called by a concurrent collector |
|
250 |
// without synchronizing in any manner with the VM thread (which |
|
251 |
// may already have initiated a STW full collection "concurrently"). |
|
252 |
unsigned int GenCollectedHeap::update_full_collections_completed(unsigned int count) { |
|
253 |
MonitorLockerEx ml(FullGCCount_lock, Mutex::_no_safepoint_check_flag); |
|
254 |
assert((_full_collections_completed <= _total_full_collections) && |
|
255 |
(count <= _total_full_collections), |
|
256 |
"Can't complete more collections than were started"); |
|
257 |
if (count > _full_collections_completed) { |
|
258 |
_full_collections_completed = count; |
|
259 |
ml.notify_all(); |
|
260 |
} |
|
261 |
return _full_collections_completed; |
|
262 |
} |
|
263 |
||
264 |
||
265 |
#ifndef PRODUCT |
|
266 |
// Override of memory state checking method in CollectedHeap: |
|
267 |
// Some collectors (CMS for example) can't have badHeapWordVal written |
|
268 |
// in the first two words of an object. (For instance , in the case of |
|
269 |
// CMS these words hold state used to synchronize between certain |
|
270 |
// (concurrent) GC steps and direct allocating mutators.) |
|
271 |
// The skip_header_HeapWords() method below, allows us to skip |
|
272 |
// over the requisite number of HeapWord's. Note that (for |
|
273 |
// generational collectors) this means that those many words are |
|
274 |
// skipped in each object, irrespective of the generation in which |
|
275 |
// that object lives. The resultant loss of precision seems to be |
|
276 |
// harmless and the pain of avoiding that imprecision appears somewhat |
|
277 |
// higher than we are prepared to pay for such rudimentary debugging |
|
278 |
// support. |
|
279 |
void GenCollectedHeap::check_for_non_bad_heap_word_value(HeapWord* addr, |
|
280 |
size_t size) { |
|
281 |
if (CheckMemoryInitialization && ZapUnusedHeapArea) { |
|
282 |
// We are asked to check a size in HeapWords, |
|
283 |
// but the memory is mangled in juint words. |
|
284 |
juint* start = (juint*) (addr + skip_header_HeapWords()); |
|
285 |
juint* end = (juint*) (addr + size); |
|
286 |
for (juint* slot = start; slot < end; slot += 1) { |
|
287 |
assert(*slot == badHeapWordVal, |
|
288 |
"Found non badHeapWordValue in pre-allocation check"); |
|
289 |
} |
|
290 |
} |
|
291 |
} |
|
292 |
#endif |
|
293 |
||
294 |
HeapWord* GenCollectedHeap::attempt_allocation(size_t size, |
|
295 |
bool is_tlab, |
|
296 |
bool first_only) { |
|
27252 | 297 |
HeapWord* res; |
298 |
for (int i = 0; i < _n_gens; i++) { |
|
299 |
if (_gens[i]->should_allocate(size, is_tlab)) { |
|
300 |
res = _gens[i]->allocate(size, is_tlab); |
|
301 |
if (res != NULL) return res; |
|
302 |
else if (first_only) break; |
|
1 | 303 |
} |
304 |
} |
|
27252 | 305 |
// Otherwise... |
306 |
return NULL; |
|
1 | 307 |
} |
308 |
||
309 |
HeapWord* GenCollectedHeap::mem_allocate(size_t size, |
|
310 |
bool* gc_overhead_limit_was_exceeded) { |
|
311 |
return collector_policy()->mem_allocate_work(size, |
|
9997
b75b7939f448
6994322: Remove the is_tlab and is_noref / is_large_noref parameters from the CollectedHeap
tonyp
parents:
9995
diff
changeset
|
312 |
false /* is_tlab */, |
1 | 313 |
gc_overhead_limit_was_exceeded); |
314 |
} |
|
315 |
||
316 |
bool GenCollectedHeap::must_clear_all_soft_refs() { |
|
317 |
return _gc_cause == GCCause::_last_ditch_collection; |
|
318 |
} |
|
319 |
||
320 |
bool GenCollectedHeap::should_do_concurrent_full_gc(GCCause::Cause cause) { |
|
5433
c182d4c3039e
6919638: CMS: ExplicitGCInvokesConcurrent misinteracts with gc locker
ysr
parents:
5343
diff
changeset
|
321 |
return UseConcMarkSweepGC && |
c182d4c3039e
6919638: CMS: ExplicitGCInvokesConcurrent misinteracts with gc locker
ysr
parents:
5343
diff
changeset
|
322 |
((cause == GCCause::_gc_locker && GCLockerInvokesConcurrent) || |
c182d4c3039e
6919638: CMS: ExplicitGCInvokesConcurrent misinteracts with gc locker
ysr
parents:
5343
diff
changeset
|
323 |
(cause == GCCause::_java_lang_system_gc && ExplicitGCInvokesConcurrent)); |
1 | 324 |
} |
325 |
||
27252 | 326 |
void GenCollectedHeap::do_collection(bool full, |
1 | 327 |
bool clear_all_soft_refs, |
328 |
size_t size, |
|
329 |
bool is_tlab, |
|
330 |
int max_level) { |
|
27252 | 331 |
bool prepared_for_verification = false; |
1 | 332 |
ResourceMark rm; |
333 |
DEBUG_ONLY(Thread* my_thread = Thread::current();) |
|
334 |
||
335 |
assert(SafepointSynchronize::is_at_safepoint(), "should be at safepoint"); |
|
336 |
assert(my_thread->is_VM_thread() || |
|
337 |
my_thread->is_ConcurrentGC_thread(), |
|
338 |
"incorrect thread type capability"); |
|
5343
95a5c4b89273
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
4641
diff
changeset
|
339 |
assert(Heap_lock->is_locked(), |
95a5c4b89273
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
4641
diff
changeset
|
340 |
"the requesting thread should have the Heap_lock"); |
1 | 341 |
guarantee(!is_gc_active(), "collection is not reentrant"); |
342 |
assert(max_level < n_gens(), "sanity check"); |
|
343 |
||
344 |
if (GC_locker::check_active_before_gc()) { |
|
345 |
return; // GC is disabled (e.g. JNI GetXXXCritical operation) |
|
346 |
} |
|
347 |
||
5343
95a5c4b89273
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
4641
diff
changeset
|
348 |
const bool do_clear_all_soft_refs = clear_all_soft_refs || |
95a5c4b89273
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
4641
diff
changeset
|
349 |
collector_policy()->should_clear_all_soft_refs(); |
95a5c4b89273
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
4641
diff
changeset
|
350 |
|
95a5c4b89273
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
4641
diff
changeset
|
351 |
ClearedAllSoftRefs casr(do_clear_all_soft_refs, collector_policy()); |
95a5c4b89273
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
4641
diff
changeset
|
352 |
|
23854
50f7f89b34e0
8038934: Remove prefix allocated_ from methods and variables in Metaspace
ehelin
parents:
23508
diff
changeset
|
353 |
const size_t metadata_prev_used = MetaspaceAux::used_bytes(); |
1 | 354 |
|
11636
3c07b54482a5
7141200: log some interesting information in ring buffers for crashes
never
parents:
11396
diff
changeset
|
355 |
print_heap_before_gc(); |
1 | 356 |
|
357 |
{ |
|
358 |
FlagSetting fl(_is_gc_active, true); |
|
359 |
||
360 |
bool complete = full && (max_level == (n_gens()-1)); |
|
12630
ddf6ee008138
7166894: Add gc cause to GC logging for all collectors
brutisso
parents:
12379
diff
changeset
|
361 |
const char* gc_cause_prefix = complete ? "Full GC" : "GC"; |
1 | 362 |
TraceCPUTime tcpu(PrintGCDetails, true, gclog_or_tty); |
25350
6423a57e5451
8043607: Add a GC id as a log decoration similar to PrintGCTimeStamps
brutisso
parents:
24941
diff
changeset
|
363 |
// The PrintGCDetails logging starts before we have incremented the GC id. We will do that later |
6423a57e5451
8043607: Add a GC id as a log decoration similar to PrintGCTimeStamps
brutisso
parents:
24941
diff
changeset
|
364 |
// so we can assume here that the next GC id is what we want. |
6423a57e5451
8043607: Add a GC id as a log decoration similar to PrintGCTimeStamps
brutisso
parents:
24941
diff
changeset
|
365 |
GCTraceTime t(GCCauseString(gc_cause_prefix, gc_cause()), PrintGCDetails, false, NULL, GCId::peek()); |
1 | 366 |
|
367 |
gc_prologue(complete); |
|
368 |
increment_total_collections(complete); |
|
369 |
||
370 |
size_t gch_prev_used = used(); |
|
371 |
||
27252 | 372 |
int starting_level = 0; |
373 |
if (full) { |
|
374 |
// Search for the oldest generation which will collect all younger |
|
375 |
// generations, and start collection loop there. |
|
376 |
for (int i = max_level; i >= 0; i--) { |
|
377 |
if (_gens[i]->full_collects_younger_generations()) { |
|
378 |
starting_level = i; |
|
379 |
break; |
|
380 |
} |
|
381 |
} |
|
1 | 382 |
} |
383 |
||
27252 | 384 |
bool must_restore_marks_for_biased_locking = false; |
385 |
||
386 |
int max_level_collected = starting_level; |
|
387 |
for (int i = starting_level; i <= max_level; i++) { |
|
388 |
if (_gens[i]->should_collect(full, size, is_tlab)) { |
|
389 |
if (i == n_gens() - 1) { // a major collection is to happen |
|
390 |
if (!complete) { |
|
391 |
// The full_collections increment was missed above. |
|
392 |
increment_total_full_collections(); |
|
393 |
} |
|
394 |
pre_full_gc_dump(NULL); // do any pre full gc dumps |
|
395 |
} |
|
396 |
// Timer for individual generations. Last argument is false: no CR |
|
397 |
// FIXME: We should try to start the timing earlier to cover more of the GC pause |
|
398 |
// The PrintGCDetails logging starts before we have incremented the GC id. We will do that later |
|
399 |
// so we can assume here that the next GC id is what we want. |
|
400 |
GCTraceTime t1(_gens[i]->short_name(), PrintGCDetails, false, NULL, GCId::peek()); |
|
401 |
TraceCollectorStats tcs(_gens[i]->counters()); |
|
402 |
TraceMemoryManagerStats tmms(_gens[i]->kind(),gc_cause()); |
|
403 |
||
404 |
size_t prev_used = _gens[i]->used(); |
|
405 |
_gens[i]->stat_record()->invocations++; |
|
406 |
_gens[i]->stat_record()->accumulated_time.start(); |
|
407 |
||
408 |
// Must be done anew before each collection because |
|
409 |
// a previous collection will do mangling and will |
|
410 |
// change top of some spaces. |
|
411 |
record_gen_tops_before_GC(); |
|
412 |
||
413 |
if (PrintGC && Verbose) { |
|
414 |
gclog_or_tty->print("level=%d invoke=%d size=" SIZE_FORMAT, |
|
415 |
i, |
|
416 |
_gens[i]->stat_record()->invocations, |
|
417 |
size*HeapWordSize); |
|
418 |
} |
|
419 |
||
420 |
if (VerifyBeforeGC && i >= VerifyGCLevel && |
|
421 |
total_collections() >= VerifyGCStartAt) { |
|
422 |
HandleMark hm; // Discard invalid handles created during verification |
|
423 |
if (!prepared_for_verification) { |
|
424 |
prepare_for_verify(); |
|
425 |
prepared_for_verification = true; |
|
426 |
} |
|
427 |
Universe::verify(" VerifyBeforeGC:"); |
|
428 |
} |
|
429 |
COMPILER2_PRESENT(DerivedPointerTable::clear()); |
|
430 |
||
431 |
if (!must_restore_marks_for_biased_locking && |
|
432 |
_gens[i]->performs_in_place_marking()) { |
|
433 |
// We perform this mark word preservation work lazily |
|
434 |
// because it's only at this point that we know whether we |
|
435 |
// absolutely have to do it; we want to avoid doing it for |
|
436 |
// scavenge-only collections where it's unnecessary |
|
437 |
must_restore_marks_for_biased_locking = true; |
|
438 |
BiasedLocking::preserve_marks(); |
|
439 |
} |
|
440 |
||
441 |
// Do collection work |
|
442 |
{ |
|
443 |
// Note on ref discovery: For what appear to be historical reasons, |
|
444 |
// GCH enables and disabled (by enqueing) refs discovery. |
|
445 |
// In the future this should be moved into the generation's |
|
446 |
// collect method so that ref discovery and enqueueing concerns |
|
447 |
// are local to a generation. The collect method could return |
|
448 |
// an appropriate indication in the case that notification on |
|
449 |
// the ref lock was needed. This will make the treatment of |
|
450 |
// weak refs more uniform (and indeed remove such concerns |
|
451 |
// from GCH). XXX |
|
452 |
||
453 |
HandleMark hm; // Discard invalid handles created during gc |
|
454 |
save_marks(); // save marks for all gens |
|
455 |
// We want to discover references, but not process them yet. |
|
456 |
// This mode is disabled in process_discovered_references if the |
|
457 |
// generation does some collection work, or in |
|
458 |
// enqueue_discovered_references if the generation returns |
|
459 |
// without doing any work. |
|
460 |
ReferenceProcessor* rp = _gens[i]->ref_processor(); |
|
461 |
// If the discovery of ("weak") refs in this generation is |
|
462 |
// atomic wrt other collectors in this configuration, we |
|
463 |
// are guaranteed to have empty discovered ref lists. |
|
464 |
if (rp->discovery_is_atomic()) { |
|
28212
647b7d0efb88
8066827: Remove ReferenceProcessor::clean_up_discovered_references()
kbarrett
parents:
27904
diff
changeset
|
465 |
rp->enable_discovery(); |
27252 | 466 |
rp->setup_policy(do_clear_all_soft_refs); |
467 |
} else { |
|
468 |
// collect() below will enable discovery as appropriate |
|
469 |
} |
|
470 |
_gens[i]->collect(full, do_clear_all_soft_refs, size, is_tlab); |
|
471 |
if (!rp->enqueuing_is_done()) { |
|
472 |
rp->enqueue_discovered_references(); |
|
473 |
} else { |
|
474 |
rp->set_enqueuing_is_done(false); |
|
475 |
} |
|
476 |
rp->verify_no_references_recorded(); |
|
477 |
} |
|
478 |
max_level_collected = i; |
|
479 |
||
480 |
// Determine if allocation request was met. |
|
481 |
if (size > 0) { |
|
482 |
if (!is_tlab || _gens[i]->supports_tlab_allocation()) { |
|
483 |
if (size*HeapWordSize <= _gens[i]->unsafe_max_alloc_nogc()) { |
|
484 |
size = 0; |
|
485 |
} |
|
486 |
} |
|
487 |
} |
|
488 |
||
489 |
COMPILER2_PRESENT(DerivedPointerTable::update_pointers()); |
|
490 |
||
491 |
_gens[i]->stat_record()->accumulated_time.stop(); |
|
492 |
||
493 |
update_gc_stats(i, full); |
|
494 |
||
495 |
if (VerifyAfterGC && i >= VerifyGCLevel && |
|
496 |
total_collections() >= VerifyGCStartAt) { |
|
497 |
HandleMark hm; // Discard invalid handles created during verification |
|
498 |
Universe::verify(" VerifyAfterGC:"); |
|
499 |
} |
|
500 |
||
501 |
if (PrintGCDetails) { |
|
502 |
gclog_or_tty->print(":"); |
|
503 |
_gens[i]->print_heap_change(prev_used); |
|
1 | 504 |
} |
505 |
} |
|
506 |
} |
|
507 |
||
508 |
// Update "complete" boolean wrt what actually transpired -- |
|
509 |
// for instance, a promotion failure could have led to |
|
510 |
// a whole heap collection. |
|
511 |
complete = complete || (max_level_collected == n_gens() - 1); |
|
512 |
||
2141
e9a644aaff87
6797870: Add -XX:+{HeapDump,PrintClassHistogram}{Before,After}FullGC
ysr
parents:
2010
diff
changeset
|
513 |
if (complete) { // We did a "major" collection |
18025 | 514 |
// FIXME: See comment at pre_full_gc_dump call |
515 |
post_full_gc_dump(NULL); // do any post full gc dumps |
|
2141
e9a644aaff87
6797870: Add -XX:+{HeapDump,PrintClassHistogram}{Before,After}FullGC
ysr
parents:
2010
diff
changeset
|
516 |
} |
e9a644aaff87
6797870: Add -XX:+{HeapDump,PrintClassHistogram}{Before,After}FullGC
ysr
parents:
2010
diff
changeset
|
517 |
|
1 | 518 |
if (PrintGCDetails) { |
519 |
print_heap_change(gch_prev_used); |
|
520 |
||
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12781
diff
changeset
|
521 |
// Print metaspace info for full GC with PrintGCDetails flag. |
1 | 522 |
if (complete) { |
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12781
diff
changeset
|
523 |
MetaspaceAux::print_metaspace_change(metadata_prev_used); |
1 | 524 |
} |
525 |
} |
|
526 |
||
27252 | 527 |
for (int j = max_level_collected; j >= 0; j -= 1) { |
528 |
// Adjust generation sizes. |
|
529 |
_gens[j]->compute_new_size(); |
|
1 | 530 |
} |
531 |
||
532 |
if (complete) { |
|
16385
4a05c6d94b04
8005602: NPG: classunloading does not happen while CMS GC with -XX:+CMSClassUnloadingEnabled is used
mgerdin
parents:
15482
diff
changeset
|
533 |
// Delete metaspaces for unloaded class loaders and clean up loader_data graph |
4a05c6d94b04
8005602: NPG: classunloading does not happen while CMS GC with -XX:+CMSClassUnloadingEnabled is used
mgerdin
parents:
15482
diff
changeset
|
534 |
ClassLoaderDataGraph::purge(); |
17109
90e6c31bbbe4
8008966: NPG: Inefficient Metaspace counter functions cause large young GC regressions
jmasa
parents:
17105
diff
changeset
|
535 |
MetaspaceAux::verify_metrics(); |
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12781
diff
changeset
|
536 |
// Resize the metaspace capacity after full collections |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12781
diff
changeset
|
537 |
MetaspaceGC::compute_new_size(); |
1 | 538 |
update_full_collections_completed(); |
539 |
} |
|
540 |
||
541 |
// Track memory usage and detect low memory after GC finishes |
|
542 |
MemoryService::track_memory_usage(); |
|
543 |
||
544 |
gc_epilogue(complete); |
|
545 |
||
546 |
if (must_restore_marks_for_biased_locking) { |
|
547 |
BiasedLocking::restore_marks(); |
|
548 |
} |
|
549 |
} |
|
550 |
||
11636
3c07b54482a5
7141200: log some interesting information in ring buffers for crashes
never
parents:
11396
diff
changeset
|
551 |
print_heap_after_gc(); |
1 | 552 |
|
2010
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
1893
diff
changeset
|
553 |
#ifdef TRACESPINNING |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
1893
diff
changeset
|
554 |
ParallelTaskTerminator::print_termination_counts(); |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
1893
diff
changeset
|
555 |
#endif |
1 | 556 |
} |
557 |
||
558 |
HeapWord* GenCollectedHeap::satisfy_failed_allocation(size_t size, bool is_tlab) { |
|
559 |
return collector_policy()->satisfy_failed_allocation(size, is_tlab); |
|
560 |
} |
|
561 |
||
11396
917d8673b5ef
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
11251
diff
changeset
|
562 |
void GenCollectedHeap::set_par_threads(uint t) { |
1 | 563 |
SharedHeap::set_par_threads(t); |
25492
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
564 |
_gen_process_roots_tasks->set_n_threads(t); |
1 | 565 |
} |
566 |
||
567 |
void GenCollectedHeap:: |
|
25492
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
568 |
gen_process_roots(int level, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
569 |
bool younger_gens_as_roots, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
570 |
bool activate_scope, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
571 |
SharedHeap::ScanningOption so, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
572 |
OopsInGenClosure* not_older_gens, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
573 |
OopsInGenClosure* weak_roots, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
574 |
OopsInGenClosure* older_gens, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
575 |
CLDClosure* cld_closure, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
576 |
CLDClosure* weak_cld_closure, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
577 |
CodeBlobClosure* code_closure) { |
3908
24b55ad4c228
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
3581
diff
changeset
|
578 |
|
25492
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
579 |
// General roots. |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
580 |
SharedHeap::process_roots(activate_scope, so, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
581 |
not_older_gens, weak_roots, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
582 |
cld_closure, weak_cld_closure, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
583 |
code_closure); |
1 | 584 |
|
585 |
if (younger_gens_as_roots) { |
|
25492
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
586 |
if (!_gen_process_roots_tasks->is_task_claimed(GCH_PS_younger_gens)) { |
27252 | 587 |
for (int i = 0; i < level; i++) { |
588 |
not_older_gens->set_generation(_gens[i]); |
|
589 |
_gens[i]->oop_iterate(not_older_gens); |
|
1 | 590 |
} |
591 |
not_older_gens->reset_generation(); |
|
592 |
} |
|
593 |
} |
|
594 |
// When collection is parallel, all threads get to cooperate to do |
|
595 |
// older-gen scanning. |
|
27252 | 596 |
for (int i = level+1; i < _n_gens; i++) { |
597 |
older_gens->set_generation(_gens[i]); |
|
598 |
rem_set()->younger_refs_iterate(_gens[i], older_gens); |
|
1 | 599 |
older_gens->reset_generation(); |
600 |
} |
|
601 |
||
25492
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
602 |
_gen_process_roots_tasks->all_tasks_completed(); |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
603 |
} |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
604 |
|
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
605 |
void GenCollectedHeap:: |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
606 |
gen_process_roots(int level, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
607 |
bool younger_gens_as_roots, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
608 |
bool activate_scope, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
609 |
SharedHeap::ScanningOption so, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
610 |
bool only_strong_roots, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
611 |
OopsInGenClosure* not_older_gens, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
612 |
OopsInGenClosure* older_gens, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
613 |
CLDClosure* cld_closure) { |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
614 |
|
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
615 |
const bool is_adjust_phase = !only_strong_roots && !younger_gens_as_roots; |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
616 |
|
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
617 |
bool is_moving_collection = false; |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
618 |
if (level == 0 || is_adjust_phase) { |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
619 |
// young collections are always moving |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
620 |
is_moving_collection = true; |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
621 |
} |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
622 |
|
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
623 |
MarkingCodeBlobClosure mark_code_closure(not_older_gens, is_moving_collection); |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
624 |
CodeBlobClosure* code_closure = &mark_code_closure; |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
625 |
|
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
626 |
gen_process_roots(level, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
627 |
younger_gens_as_roots, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
628 |
activate_scope, so, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
629 |
not_older_gens, only_strong_roots ? NULL : not_older_gens, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
630 |
older_gens, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
631 |
cld_closure, only_strong_roots ? NULL : cld_closure, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
632 |
code_closure); |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
633 |
|
1 | 634 |
} |
635 |
||
22882
195c8f70d605
8034761: Remove the do_code_roots parameter from process_strong_roots
stefank
parents:
22552
diff
changeset
|
636 |
void GenCollectedHeap::gen_process_weak_roots(OopClosure* root_closure) { |
195c8f70d605
8034761: Remove the do_code_roots parameter from process_strong_roots
stefank
parents:
22552
diff
changeset
|
637 |
SharedHeap::process_weak_roots(root_closure); |
1 | 638 |
// "Local" "weak" refs |
27252 | 639 |
for (int i = 0; i < _n_gens; i++) { |
640 |
_gens[i]->ref_processor()->weak_oops_do(root_closure); |
|
641 |
} |
|
1 | 642 |
} |
643 |
||
644 |
#define GCH_SINCE_SAVE_MARKS_ITERATE_DEFN(OopClosureType, nv_suffix) \ |
|
645 |
void GenCollectedHeap:: \ |
|
646 |
oop_since_save_marks_iterate(int level, \ |
|
647 |
OopClosureType* cur, \ |
|
648 |
OopClosureType* older) { \ |
|
27252 | 649 |
_gens[level]->oop_since_save_marks_iterate##nv_suffix(cur); \ |
650 |
for (int i = level+1; i < n_gens(); i++) { \ |
|
651 |
_gens[i]->oop_since_save_marks_iterate##nv_suffix(older); \ |
|
1 | 652 |
} \ |
653 |
} |
|
654 |
||
655 |
ALL_SINCE_SAVE_MARKS_CLOSURES(GCH_SINCE_SAVE_MARKS_ITERATE_DEFN) |
|
656 |
||
657 |
#undef GCH_SINCE_SAVE_MARKS_ITERATE_DEFN |
|
658 |
||
659 |
bool GenCollectedHeap::no_allocs_since_save_marks(int level) { |
|
27252 | 660 |
for (int i = level; i < _n_gens; i++) { |
661 |
if (!_gens[i]->no_allocs_since_save_marks()) return false; |
|
1 | 662 |
} |
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12781
diff
changeset
|
663 |
return true; |
1 | 664 |
} |
665 |
||
666 |
bool GenCollectedHeap::supports_inline_contig_alloc() const { |
|
27252 | 667 |
return _gens[0]->supports_inline_contig_alloc(); |
1 | 668 |
} |
669 |
||
670 |
HeapWord** GenCollectedHeap::top_addr() const { |
|
27252 | 671 |
return _gens[0]->top_addr(); |
1 | 672 |
} |
673 |
||
674 |
HeapWord** GenCollectedHeap::end_addr() const { |
|
27252 | 675 |
return _gens[0]->end_addr(); |
1 | 676 |
} |
677 |
||
678 |
// public collection interfaces |
|
679 |
||
680 |
void GenCollectedHeap::collect(GCCause::Cause cause) { |
|
681 |
if (should_do_concurrent_full_gc(cause)) { |
|
15482
470d0b0c09f1
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
14076
diff
changeset
|
682 |
#if INCLUDE_ALL_GCS |
1 | 683 |
// mostly concurrent full collection |
684 |
collect_mostly_concurrent(cause); |
|
15482
470d0b0c09f1
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
14076
diff
changeset
|
685 |
#else // INCLUDE_ALL_GCS |
1 | 686 |
ShouldNotReachHere(); |
15482
470d0b0c09f1
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
14076
diff
changeset
|
687 |
#endif // INCLUDE_ALL_GCS |
26183
bbe259d3c8bc
8055098: WB API should be extended to provide information about size and age of object.
tschatzl
parents:
25730
diff
changeset
|
688 |
} else if (cause == GCCause::_wb_young_gc) { |
bbe259d3c8bc
8055098: WB API should be extended to provide information about size and age of object.
tschatzl
parents:
25730
diff
changeset
|
689 |
// minor collection for WhiteBox API |
bbe259d3c8bc
8055098: WB API should be extended to provide information about size and age of object.
tschatzl
parents:
25730
diff
changeset
|
690 |
collect(cause, 0); |
1 | 691 |
} else { |
692 |
#ifdef ASSERT |
|
26183
bbe259d3c8bc
8055098: WB API should be extended to provide information about size and age of object.
tschatzl
parents:
25730
diff
changeset
|
693 |
if (cause == GCCause::_scavenge_alot) { |
bbe259d3c8bc
8055098: WB API should be extended to provide information about size and age of object.
tschatzl
parents:
25730
diff
changeset
|
694 |
// minor collection only |
bbe259d3c8bc
8055098: WB API should be extended to provide information about size and age of object.
tschatzl
parents:
25730
diff
changeset
|
695 |
collect(cause, 0); |
bbe259d3c8bc
8055098: WB API should be extended to provide information about size and age of object.
tschatzl
parents:
25730
diff
changeset
|
696 |
} else { |
bbe259d3c8bc
8055098: WB API should be extended to provide information about size and age of object.
tschatzl
parents:
25730
diff
changeset
|
697 |
// Stop-the-world full collection |
bbe259d3c8bc
8055098: WB API should be extended to provide information about size and age of object.
tschatzl
parents:
25730
diff
changeset
|
698 |
collect(cause, n_gens() - 1); |
bbe259d3c8bc
8055098: WB API should be extended to provide information about size and age of object.
tschatzl
parents:
25730
diff
changeset
|
699 |
} |
1 | 700 |
#else |
701 |
// Stop-the-world full collection |
|
702 |
collect(cause, n_gens() - 1); |
|
703 |
#endif |
|
704 |
} |
|
705 |
} |
|
706 |
||
707 |
void GenCollectedHeap::collect(GCCause::Cause cause, int max_level) { |
|
708 |
// The caller doesn't have the Heap_lock |
|
709 |
assert(!Heap_lock->owned_by_self(), "this thread should not own the Heap_lock"); |
|
710 |
MutexLocker ml(Heap_lock); |
|
711 |
collect_locked(cause, max_level); |
|
712 |
} |
|
713 |
||
714 |
void GenCollectedHeap::collect_locked(GCCause::Cause cause) { |
|
715 |
// The caller has the Heap_lock |
|
716 |
assert(Heap_lock->owned_by_self(), "this thread should own the Heap_lock"); |
|
717 |
collect_locked(cause, n_gens() - 1); |
|
718 |
} |
|
719 |
||
720 |
// this is the private collection interface |
|
721 |
// The Heap_lock is expected to be held on entry. |
|
722 |
||
723 |
void GenCollectedHeap::collect_locked(GCCause::Cause cause, int max_level) { |
|
724 |
// Read the GC count while holding the Heap_lock |
|
725 |
unsigned int gc_count_before = total_collections(); |
|
726 |
unsigned int full_gc_count_before = total_full_collections(); |
|
727 |
{ |
|
728 |
MutexUnlocker mu(Heap_lock); // give up heap lock, execute gets it back |
|
729 |
VM_GenCollectFull op(gc_count_before, full_gc_count_before, |
|
730 |
cause, max_level); |
|
731 |
VMThread::execute(&op); |
|
732 |
} |
|
733 |
} |
|
734 |
||
15482
470d0b0c09f1
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
14076
diff
changeset
|
735 |
#if INCLUDE_ALL_GCS |
1 | 736 |
bool GenCollectedHeap::create_cms_collector() { |
737 |
||
27252 | 738 |
assert(_gens[1]->kind() == Generation::ConcurrentMarkSweep, |
1 | 739 |
"Unexpected generation kinds"); |
740 |
// Skip two header words in the block content verification |
|
741 |
NOT_PRODUCT(_skip_header_HeapWords = CMSCollector::skip_header_HeapWords();) |
|
742 |
CMSCollector* collector = new CMSCollector( |
|
27252 | 743 |
(ConcurrentMarkSweepGeneration*)_gens[1], |
1 | 744 |
_rem_set->as_CardTableRS(), |
745 |
(ConcurrentMarkSweepPolicy*) collector_policy()); |
|
746 |
||
747 |
if (collector == NULL || !collector->completed_initialization()) { |
|
748 |
if (collector) { |
|
749 |
delete collector; // Be nice in embedded situation |
|
750 |
} |
|
751 |
vm_shutdown_during_initialization("Could not create CMS collector"); |
|
752 |
return false; |
|
753 |
} |
|
754 |
return true; // success |
|
755 |
} |
|
756 |
||
757 |
void GenCollectedHeap::collect_mostly_concurrent(GCCause::Cause cause) { |
|
758 |
assert(!Heap_lock->owned_by_self(), "Should not own Heap_lock"); |
|
759 |
||
760 |
MutexLocker ml(Heap_lock); |
|
761 |
// Read the GC counts while holding the Heap_lock |
|
762 |
unsigned int full_gc_count_before = total_full_collections(); |
|
763 |
unsigned int gc_count_before = total_collections(); |
|
764 |
{ |
|
765 |
MutexUnlocker mu(Heap_lock); |
|
766 |
VM_GenCollectFullConcurrent op(gc_count_before, full_gc_count_before, cause); |
|
767 |
VMThread::execute(&op); |
|
768 |
} |
|
769 |
} |
|
15482
470d0b0c09f1
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
14076
diff
changeset
|
770 |
#endif // INCLUDE_ALL_GCS |
1 | 771 |
|
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12781
diff
changeset
|
772 |
void GenCollectedHeap::do_full_collection(bool clear_all_soft_refs) { |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12781
diff
changeset
|
773 |
do_full_collection(clear_all_soft_refs, _n_gens - 1); |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12781
diff
changeset
|
774 |
} |
1 | 775 |
|
776 |
void GenCollectedHeap::do_full_collection(bool clear_all_soft_refs, |
|
777 |
int max_level) { |
|
778 |
int local_max_level; |
|
7419
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
779 |
if (!incremental_collection_will_fail(false /* don't consult_young */) && |
1 | 780 |
gc_cause() == GCCause::_gc_locker) { |
781 |
local_max_level = 0; |
|
782 |
} else { |
|
783 |
local_max_level = max_level; |
|
784 |
} |
|
785 |
||
786 |
do_collection(true /* full */, |
|
787 |
clear_all_soft_refs /* clear_all_soft_refs */, |
|
788 |
0 /* size */, |
|
789 |
false /* is_tlab */, |
|
790 |
local_max_level /* max_level */); |
|
791 |
// Hack XXX FIX ME !!! |
|
792 |
// A scavenge may not have been attempted, or may have |
|
793 |
// been attempted and failed, because the old gen was too full |
|
794 |
if (local_max_level == 0 && gc_cause() == GCCause::_gc_locker && |
|
7419
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
795 |
incremental_collection_will_fail(false /* don't consult_young */)) { |
1 | 796 |
if (PrintGCDetails) { |
797 |
gclog_or_tty->print_cr("GC locker: Trying a full collection " |
|
798 |
"because scavenge failed"); |
|
799 |
} |
|
800 |
// This time allow the old gen to be collected as well |
|
801 |
do_collection(true /* full */, |
|
802 |
clear_all_soft_refs /* clear_all_soft_refs */, |
|
803 |
0 /* size */, |
|
804 |
false /* is_tlab */, |
|
805 |
n_gens() - 1 /* max_level */); |
|
806 |
} |
|
807 |
} |
|
808 |
||
9935
51267b5e1a3d
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
9623
diff
changeset
|
809 |
bool GenCollectedHeap::is_in_young(oop p) { |
27252 | 810 |
bool result = ((HeapWord*)p) < _gens[_n_gens - 1]->reserved().start(); |
811 |
assert(result == _gens[0]->is_in_reserved(p), |
|
24424
2658d7834c6e
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
24353
diff
changeset
|
812 |
err_msg("incorrect test - result=%d, p=" INTPTR_FORMAT, result, p2i((void*)p))); |
9935
51267b5e1a3d
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
9623
diff
changeset
|
813 |
return result; |
51267b5e1a3d
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
9623
diff
changeset
|
814 |
} |
51267b5e1a3d
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
9623
diff
changeset
|
815 |
|
11247 | 816 |
// Returns "TRUE" iff "p" points into the committed areas of the heap. |
1 | 817 |
bool GenCollectedHeap::is_in(const void* p) const { |
818 |
#ifndef ASSERT |
|
16680
960505df90e7
8011343: Add new flag for verifying the heap during startup
johnc
parents:
16385
diff
changeset
|
819 |
guarantee(VerifyBeforeGC || |
960505df90e7
8011343: Add new flag for verifying the heap during startup
johnc
parents:
16385
diff
changeset
|
820 |
VerifyDuringGC || |
960505df90e7
8011343: Add new flag for verifying the heap during startup
johnc
parents:
16385
diff
changeset
|
821 |
VerifyBeforeExit || |
960505df90e7
8011343: Add new flag for verifying the heap during startup
johnc
parents:
16385
diff
changeset
|
822 |
VerifyDuringStartup || |
960505df90e7
8011343: Add new flag for verifying the heap during startup
johnc
parents:
16385
diff
changeset
|
823 |
PrintAssembly || |
960505df90e7
8011343: Add new flag for verifying the heap during startup
johnc
parents:
16385
diff
changeset
|
824 |
tty->count() != 0 || // already printing |
960505df90e7
8011343: Add new flag for verifying the heap during startup
johnc
parents:
16385
diff
changeset
|
825 |
VerifyAfterGC || |
6176
4d9030fe341f
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
5906
diff
changeset
|
826 |
VMError::fatal_error_in_progress(), "too expensive"); |
4d9030fe341f
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
5906
diff
changeset
|
827 |
|
1 | 828 |
#endif |
829 |
// This might be sped up with a cache of the last generation that |
|
830 |
// answered yes. |
|
27252 | 831 |
for (int i = 0; i < _n_gens; i++) { |
832 |
if (_gens[i]->is_in(p)) return true; |
|
1 | 833 |
} |
834 |
// Otherwise... |
|
835 |
return false; |
|
836 |
} |
|
837 |
||
9935
51267b5e1a3d
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
9623
diff
changeset
|
838 |
#ifdef ASSERT |
51267b5e1a3d
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
9623
diff
changeset
|
839 |
// Don't implement this by using is_in_young(). This method is used |
51267b5e1a3d
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
9623
diff
changeset
|
840 |
// in some cases to check that is_in_young() is correct. |
51267b5e1a3d
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
9623
diff
changeset
|
841 |
bool GenCollectedHeap::is_in_partial_collection(const void* p) { |
51267b5e1a3d
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
9623
diff
changeset
|
842 |
assert(is_in_reserved(p) || p == NULL, |
51267b5e1a3d
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
9623
diff
changeset
|
843 |
"Does not work if address is non-null and outside of the heap"); |
27252 | 844 |
return p < _gens[_n_gens - 2]->reserved().end() && p != NULL; |
1 | 845 |
} |
9935
51267b5e1a3d
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
9623
diff
changeset
|
846 |
#endif |
1 | 847 |
|
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12781
diff
changeset
|
848 |
void GenCollectedHeap::oop_iterate(ExtendedOopClosure* cl) { |
27252 | 849 |
for (int i = 0; i < _n_gens; i++) { |
850 |
_gens[i]->oop_iterate(cl); |
|
851 |
} |
|
1 | 852 |
} |
853 |
||
854 |
void GenCollectedHeap::object_iterate(ObjectClosure* cl) { |
|
27252 | 855 |
for (int i = 0; i < _n_gens; i++) { |
856 |
_gens[i]->object_iterate(cl); |
|
857 |
} |
|
1 | 858 |
} |
859 |
||
1893
c82e388e17c5
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
1610
diff
changeset
|
860 |
void GenCollectedHeap::safe_object_iterate(ObjectClosure* cl) { |
27252 | 861 |
for (int i = 0; i < _n_gens; i++) { |
862 |
_gens[i]->safe_object_iterate(cl); |
|
863 |
} |
|
1893
c82e388e17c5
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
1610
diff
changeset
|
864 |
} |
c82e388e17c5
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
1610
diff
changeset
|
865 |
|
1 | 866 |
Space* GenCollectedHeap::space_containing(const void* addr) const { |
27252 | 867 |
for (int i = 0; i < _n_gens; i++) { |
868 |
Space* res = _gens[i]->space_containing(addr); |
|
869 |
if (res != NULL) return res; |
|
1 | 870 |
} |
27252 | 871 |
// Otherwise... |
872 |
assert(false, "Could not find containing space"); |
|
873 |
return NULL; |
|
1 | 874 |
} |
875 |
||
27252 | 876 |
|
1 | 877 |
HeapWord* GenCollectedHeap::block_start(const void* addr) const { |
878 |
assert(is_in_reserved(addr), "block_start of address outside of heap"); |
|
27252 | 879 |
for (int i = 0; i < _n_gens; i++) { |
880 |
if (_gens[i]->is_in_reserved(addr)) { |
|
881 |
assert(_gens[i]->is_in(addr), |
|
882 |
"addr should be in allocated part of generation"); |
|
883 |
return _gens[i]->block_start(addr); |
|
884 |
} |
|
1 | 885 |
} |
27252 | 886 |
assert(false, "Some generation should contain the address"); |
887 |
return NULL; |
|
1 | 888 |
} |
889 |
||
890 |
size_t GenCollectedHeap::block_size(const HeapWord* addr) const { |
|
891 |
assert(is_in_reserved(addr), "block_size of address outside of heap"); |
|
27252 | 892 |
for (int i = 0; i < _n_gens; i++) { |
893 |
if (_gens[i]->is_in_reserved(addr)) { |
|
894 |
assert(_gens[i]->is_in(addr), |
|
895 |
"addr should be in allocated part of generation"); |
|
896 |
return _gens[i]->block_size(addr); |
|
897 |
} |
|
1 | 898 |
} |
27252 | 899 |
assert(false, "Some generation should contain the address"); |
900 |
return 0; |
|
1 | 901 |
} |
902 |
||
903 |
bool GenCollectedHeap::block_is_obj(const HeapWord* addr) const { |
|
904 |
assert(is_in_reserved(addr), "block_is_obj of address outside of heap"); |
|
905 |
assert(block_start(addr) == addr, "addr must be a block start"); |
|
27252 | 906 |
for (int i = 0; i < _n_gens; i++) { |
907 |
if (_gens[i]->is_in_reserved(addr)) { |
|
908 |
return _gens[i]->block_is_obj(addr); |
|
909 |
} |
|
1 | 910 |
} |
27252 | 911 |
assert(false, "Some generation should contain the address"); |
912 |
return false; |
|
1 | 913 |
} |
914 |
||
915 |
bool GenCollectedHeap::supports_tlab_allocation() const { |
|
27252 | 916 |
for (int i = 0; i < _n_gens; i += 1) { |
917 |
if (_gens[i]->supports_tlab_allocation()) { |
|
918 |
return true; |
|
919 |
} |
|
920 |
} |
|
921 |
return false; |
|
1 | 922 |
} |
923 |
||
924 |
size_t GenCollectedHeap::tlab_capacity(Thread* thr) const { |
|
27252 | 925 |
size_t result = 0; |
926 |
for (int i = 0; i < _n_gens; i += 1) { |
|
927 |
if (_gens[i]->supports_tlab_allocation()) { |
|
928 |
result += _gens[i]->tlab_capacity(); |
|
929 |
} |
|
1 | 930 |
} |
27252 | 931 |
return result; |
1 | 932 |
} |
933 |
||
22552 | 934 |
size_t GenCollectedHeap::tlab_used(Thread* thr) const { |
27252 | 935 |
size_t result = 0; |
936 |
for (int i = 0; i < _n_gens; i += 1) { |
|
937 |
if (_gens[i]->supports_tlab_allocation()) { |
|
938 |
result += _gens[i]->tlab_used(); |
|
939 |
} |
|
22552 | 940 |
} |
27252 | 941 |
return result; |
22552 | 942 |
} |
943 |
||
1 | 944 |
size_t GenCollectedHeap::unsafe_max_tlab_alloc(Thread* thr) const { |
27252 | 945 |
size_t result = 0; |
946 |
for (int i = 0; i < _n_gens; i += 1) { |
|
947 |
if (_gens[i]->supports_tlab_allocation()) { |
|
948 |
result += _gens[i]->unsafe_max_tlab_alloc(); |
|
949 |
} |
|
1 | 950 |
} |
27252 | 951 |
return result; |
1 | 952 |
} |
953 |
||
954 |
HeapWord* GenCollectedHeap::allocate_new_tlab(size_t size) { |
|
955 |
bool gc_overhead_limit_was_exceeded; |
|
9997
b75b7939f448
6994322: Remove the is_tlab and is_noref / is_large_noref parameters from the CollectedHeap
tonyp
parents:
9995
diff
changeset
|
956 |
return collector_policy()->mem_allocate_work(size /* size */, |
b75b7939f448
6994322: Remove the is_tlab and is_noref / is_large_noref parameters from the CollectedHeap
tonyp
parents:
9995
diff
changeset
|
957 |
true /* is_tlab */, |
b75b7939f448
6994322: Remove the is_tlab and is_noref / is_large_noref parameters from the CollectedHeap
tonyp
parents:
9995
diff
changeset
|
958 |
&gc_overhead_limit_was_exceeded); |
1 | 959 |
} |
960 |
||
961 |
// Requires "*prev_ptr" to be non-NULL. Deletes and a block of minimal size |
|
962 |
// from the list headed by "*prev_ptr". |
|
963 |
static ScratchBlock *removeSmallestScratch(ScratchBlock **prev_ptr) { |
|
964 |
bool first = true; |
|
965 |
size_t min_size = 0; // "first" makes this conceptually infinite. |
|
966 |
ScratchBlock **smallest_ptr, *smallest; |
|
967 |
ScratchBlock *cur = *prev_ptr; |
|
968 |
while (cur) { |
|
969 |
assert(*prev_ptr == cur, "just checking"); |
|
970 |
if (first || cur->num_words < min_size) { |
|
971 |
smallest_ptr = prev_ptr; |
|
972 |
smallest = cur; |
|
973 |
min_size = smallest->num_words; |
|
974 |
first = false; |
|
975 |
} |
|
976 |
prev_ptr = &cur->next; |
|
977 |
cur = cur->next; |
|
978 |
} |
|
979 |
smallest = *smallest_ptr; |
|
980 |
*smallest_ptr = smallest->next; |
|
981 |
return smallest; |
|
982 |
} |
|
983 |
||
984 |
// Sort the scratch block list headed by res into decreasing size order, |
|
985 |
// and set "res" to the result. |
|
986 |
static void sort_scratch_list(ScratchBlock*& list) { |
|
987 |
ScratchBlock* sorted = NULL; |
|
988 |
ScratchBlock* unsorted = list; |
|
989 |
while (unsorted) { |
|
990 |
ScratchBlock *smallest = removeSmallestScratch(&unsorted); |
|
991 |
smallest->next = sorted; |
|
992 |
sorted = smallest; |
|
993 |
} |
|
994 |
list = sorted; |
|
995 |
} |
|
996 |
||
997 |
ScratchBlock* GenCollectedHeap::gather_scratch(Generation* requestor, |
|
998 |
size_t max_alloc_words) { |
|
999 |
ScratchBlock* res = NULL; |
|
27252 | 1000 |
for (int i = 0; i < _n_gens; i++) { |
1001 |
_gens[i]->contribute_scratch(res, requestor, max_alloc_words); |
|
1002 |
} |
|
1 | 1003 |
sort_scratch_list(res); |
1004 |
return res; |
|
1005 |
} |
|
1006 |
||
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
1007 |
void GenCollectedHeap::release_scratch() { |
27252 | 1008 |
for (int i = 0; i < _n_gens; i++) { |
1009 |
_gens[i]->reset_scratch(); |
|
1010 |
} |
|
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
1011 |
} |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
1012 |
|
1 | 1013 |
class GenPrepareForVerifyClosure: public GenCollectedHeap::GenClosure { |
1014 |
void do_generation(Generation* gen) { |
|
1015 |
gen->prepare_for_verify(); |
|
1016 |
} |
|
1017 |
}; |
|
1018 |
||
1019 |
void GenCollectedHeap::prepare_for_verify() { |
|
1020 |
ensure_parsability(false); // no need to retire TLABs |
|
1021 |
GenPrepareForVerifyClosure blk; |
|
1022 |
generation_iterate(&blk, false); |
|
1023 |
} |
|
1024 |
||
27252 | 1025 |
|
1 | 1026 |
void GenCollectedHeap::generation_iterate(GenClosure* cl, |
1027 |
bool old_to_young) { |
|
1028 |
if (old_to_young) { |
|
27252 | 1029 |
for (int i = _n_gens-1; i >= 0; i--) { |
1030 |
cl->do_generation(_gens[i]); |
|
1031 |
} |
|
1 | 1032 |
} else { |
27252 | 1033 |
for (int i = 0; i < _n_gens; i++) { |
1034 |
cl->do_generation(_gens[i]); |
|
1035 |
} |
|
1 | 1036 |
} |
1037 |
} |
|
1038 |
||
1039 |
void GenCollectedHeap::space_iterate(SpaceClosure* cl) { |
|
27252 | 1040 |
for (int i = 0; i < _n_gens; i++) { |
1041 |
_gens[i]->space_iterate(cl, true); |
|
1042 |
} |
|
1 | 1043 |
} |
1044 |
||
1045 |
bool GenCollectedHeap::is_maximal_no_gc() const { |
|
27252 | 1046 |
for (int i = 0; i < _n_gens; i++) { |
1047 |
if (!_gens[i]->is_maximal_no_gc()) { |
|
1048 |
return false; |
|
1049 |
} |
|
1050 |
} |
|
1051 |
return true; |
|
1 | 1052 |
} |
1053 |
||
1054 |
void GenCollectedHeap::save_marks() { |
|
27252 | 1055 |
for (int i = 0; i < _n_gens; i++) { |
1056 |
_gens[i]->save_marks(); |
|
1057 |
} |
|
1 | 1058 |
} |
1059 |
||
1060 |
GenCollectedHeap* GenCollectedHeap::heap() { |
|
1061 |
assert(_gch != NULL, "Uninitialized access to GenCollectedHeap::heap()"); |
|
1062 |
assert(_gch->kind() == CollectedHeap::GenCollectedHeap, "not a generational heap"); |
|
1063 |
return _gch; |
|
1064 |
} |
|
1065 |
||
1066 |
||
1067 |
void GenCollectedHeap::prepare_for_compaction() { |
|
19286
48394008c803
8022800: Use specific generations rather than generation iteration
brutisso
parents:
18687
diff
changeset
|
1068 |
guarantee(_n_gens = 2, "Wrong number of generations"); |
27252 | 1069 |
Generation* old_gen = _gens[1]; |
1 | 1070 |
// Start by compacting into same gen. |
25730
7eb4e685f739
8048112: G1 Full GC needs to support the case when the very first region is not available
tschatzl
parents:
25492
diff
changeset
|
1071 |
CompactPoint cp(old_gen); |
19286
48394008c803
8022800: Use specific generations rather than generation iteration
brutisso
parents:
18687
diff
changeset
|
1072 |
old_gen->prepare_for_compaction(&cp); |
27252 | 1073 |
Generation* young_gen = _gens[0]; |
19286
48394008c803
8022800: Use specific generations rather than generation iteration
brutisso
parents:
18687
diff
changeset
|
1074 |
young_gen->prepare_for_compaction(&cp); |
1 | 1075 |
} |
1076 |
||
1077 |
GCStats* GenCollectedHeap::gc_stats(int level) const { |
|
27252 | 1078 |
return _gens[level]->gc_stats(); |
1 | 1079 |
} |
1080 |
||
12379 | 1081 |
void GenCollectedHeap::verify(bool silent, VerifyOption option /* ignored */) { |
27252 | 1082 |
for (int i = _n_gens-1; i >= 0; i--) { |
1083 |
Generation* g = _gens[i]; |
|
1084 |
if (!silent) { |
|
1085 |
gclog_or_tty->print("%s", g->name()); |
|
1086 |
gclog_or_tty->print(" "); |
|
1087 |
} |
|
1088 |
g->verify(); |
|
1 | 1089 |
} |
1090 |
if (!silent) { |
|
1091 |
gclog_or_tty->print("remset "); |
|
1092 |
} |
|
1093 |
rem_set()->verify(); |
|
1094 |
} |
|
1095 |
||
1096 |
void GenCollectedHeap::print_on(outputStream* st) const { |
|
27252 | 1097 |
for (int i = 0; i < _n_gens; i++) { |
1098 |
_gens[i]->print_on(st); |
|
1099 |
} |
|
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12781
diff
changeset
|
1100 |
MetaspaceAux::print_on(st); |
1 | 1101 |
} |
1102 |
||
1103 |
void GenCollectedHeap::gc_threads_do(ThreadClosure* tc) const { |
|
1104 |
if (workers() != NULL) { |
|
1105 |
workers()->threads_do(tc); |
|
1106 |
} |
|
15482
470d0b0c09f1
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
14076
diff
changeset
|
1107 |
#if INCLUDE_ALL_GCS |
1 | 1108 |
if (UseConcMarkSweepGC) { |
1109 |
ConcurrentMarkSweepThread::threads_do(tc); |
|
1110 |
} |
|
15482
470d0b0c09f1
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
14076
diff
changeset
|
1111 |
#endif // INCLUDE_ALL_GCS |
1 | 1112 |
} |
1113 |
||
1114 |
void GenCollectedHeap::print_gc_threads_on(outputStream* st) const { |
|
15482
470d0b0c09f1
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
14076
diff
changeset
|
1115 |
#if INCLUDE_ALL_GCS |
27898
813ad96387b3
8065972: Remove support for ParNew+SerialOld and DefNew+CMS
brutisso
parents:
27887
diff
changeset
|
1116 |
if (UseConcMarkSweepGC) { |
1 | 1117 |
workers()->print_worker_threads_on(st); |
1118 |
ConcurrentMarkSweepThread::print_all_on(st); |
|
1119 |
} |
|
15482
470d0b0c09f1
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
14076
diff
changeset
|
1120 |
#endif // INCLUDE_ALL_GCS |
1 | 1121 |
} |
1122 |
||
16685
41c34debcde0
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
16680
diff
changeset
|
1123 |
void GenCollectedHeap::print_on_error(outputStream* st) const { |
41c34debcde0
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
16680
diff
changeset
|
1124 |
this->CollectedHeap::print_on_error(st); |
41c34debcde0
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
16680
diff
changeset
|
1125 |
|
41c34debcde0
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
16680
diff
changeset
|
1126 |
#if INCLUDE_ALL_GCS |
41c34debcde0
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
16680
diff
changeset
|
1127 |
if (UseConcMarkSweepGC) { |
41c34debcde0
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
16680
diff
changeset
|
1128 |
st->cr(); |
41c34debcde0
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
16680
diff
changeset
|
1129 |
CMSCollector::print_on_error(st); |
41c34debcde0
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
16680
diff
changeset
|
1130 |
} |
41c34debcde0
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
16680
diff
changeset
|
1131 |
#endif // INCLUDE_ALL_GCS |
41c34debcde0
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
16680
diff
changeset
|
1132 |
} |
41c34debcde0
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
16680
diff
changeset
|
1133 |
|
1 | 1134 |
void GenCollectedHeap::print_tracing_info() const { |
24941
4ebbe176a7b1
8042298: Remove the names gen0 and gen1 from the GC code
jwilhelm
parents:
24424
diff
changeset
|
1135 |
if (TraceYoungGenTime) { |
1 | 1136 |
get_gen(0)->print_summary_info(); |
1137 |
} |
|
24941
4ebbe176a7b1
8042298: Remove the names gen0 and gen1 from the GC code
jwilhelm
parents:
24424
diff
changeset
|
1138 |
if (TraceOldGenTime) { |
1 | 1139 |
get_gen(1)->print_summary_info(); |
1140 |
} |
|
1141 |
} |
|
1142 |
||
1143 |
void GenCollectedHeap::print_heap_change(size_t prev_used) const { |
|
1144 |
if (PrintGCDetails && Verbose) { |
|
1145 |
gclog_or_tty->print(" " SIZE_FORMAT |
|
1146 |
"->" SIZE_FORMAT |
|
1147 |
"(" SIZE_FORMAT ")", |
|
1148 |
prev_used, used(), capacity()); |
|
1149 |
} else { |
|
1150 |
gclog_or_tty->print(" " SIZE_FORMAT "K" |
|
1151 |
"->" SIZE_FORMAT "K" |
|
1152 |
"(" SIZE_FORMAT "K)", |
|
1153 |
prev_used / K, used() / K, capacity() / K); |
|
1154 |
} |
|
1155 |
} |
|
1156 |
||
1157 |
class GenGCPrologueClosure: public GenCollectedHeap::GenClosure { |
|
1158 |
private: |
|
1159 |
bool _full; |
|
1160 |
public: |
|
1161 |
void do_generation(Generation* gen) { |
|
1162 |
gen->gc_prologue(_full); |
|
1163 |
} |
|
1164 |
GenGCPrologueClosure(bool full) : _full(full) {}; |
|
1165 |
}; |
|
1166 |
||
1167 |
void GenCollectedHeap::gc_prologue(bool full) { |
|
1168 |
assert(InlineCacheBuffer::is_empty(), "should have cleaned up ICBuffer"); |
|
1169 |
||
1170 |
always_do_update_barrier = false; |
|
1171 |
// Fill TLAB's and such |
|
1172 |
CollectedHeap::accumulate_statistics_all_tlabs(); |
|
1173 |
ensure_parsability(true); // retire TLABs |
|
1174 |
||
1175 |
// Walk generations |
|
1176 |
GenGCPrologueClosure blk(full); |
|
1177 |
generation_iterate(&blk, false); // not old-to-young. |
|
1178 |
}; |
|
1179 |
||
1180 |
class GenGCEpilogueClosure: public GenCollectedHeap::GenClosure { |
|
1181 |
private: |
|
1182 |
bool _full; |
|
1183 |
public: |
|
1184 |
void do_generation(Generation* gen) { |
|
1185 |
gen->gc_epilogue(_full); |
|
1186 |
} |
|
1187 |
GenGCEpilogueClosure(bool full) : _full(full) {}; |
|
1188 |
}; |
|
1189 |
||
1190 |
void GenCollectedHeap::gc_epilogue(bool full) { |
|
1191 |
#ifdef COMPILER2 |
|
1192 |
assert(DerivedPointerTable::is_empty(), "derived pointer present"); |
|
1193 |
size_t actual_gap = pointer_delta((HeapWord*) (max_uintx-3), *(end_addr())); |
|
1194 |
guarantee(actual_gap > (size_t)FastAllocateSizeLimit, "inline allocation wraps"); |
|
1195 |
#endif /* COMPILER2 */ |
|
1196 |
||
1197 |
resize_all_tlabs(); |
|
1198 |
||
1199 |
GenGCEpilogueClosure blk(full); |
|
1200 |
generation_iterate(&blk, false); // not old-to-young. |
|
1201 |
||
10022
377345fb5fb5
7061204: clean the chunk table synchronously in embedded builds
jcoomes
parents:
9997
diff
changeset
|
1202 |
if (!CleanChunkPoolAsync) { |
377345fb5fb5
7061204: clean the chunk table synchronously in embedded builds
jcoomes
parents:
9997
diff
changeset
|
1203 |
Chunk::clean_chunk_pool(); |
377345fb5fb5
7061204: clean the chunk table synchronously in embedded builds
jcoomes
parents:
9997
diff
changeset
|
1204 |
} |
377345fb5fb5
7061204: clean the chunk table synchronously in embedded builds
jcoomes
parents:
9997
diff
changeset
|
1205 |
|
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12781
diff
changeset
|
1206 |
MetaspaceCounters::update_performance_counters(); |
19322
e35f9ed4f081
8014659: NPG: performance counters for compressed klass space
ehelin
parents:
19286
diff
changeset
|
1207 |
CompressedClassSpaceCounters::update_performance_counters(); |
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12781
diff
changeset
|
1208 |
|
1 | 1209 |
always_do_update_barrier = UseConcMarkSweepGC; |
1210 |
}; |
|
1211 |
||
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
1212 |
#ifndef PRODUCT |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
1213 |
class GenGCSaveTopsBeforeGCClosure: public GenCollectedHeap::GenClosure { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
1214 |
private: |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
1215 |
public: |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
1216 |
void do_generation(Generation* gen) { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
1217 |
gen->record_spaces_top(); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
1218 |
} |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
1219 |
}; |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
1220 |
|
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
1221 |
void GenCollectedHeap::record_gen_tops_before_GC() { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
1222 |
if (ZapUnusedHeapArea) { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
1223 |
GenGCSaveTopsBeforeGCClosure blk; |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
1224 |
generation_iterate(&blk, false); // not old-to-young. |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
1225 |
} |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
1226 |
} |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
1227 |
#endif // not PRODUCT |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
1228 |
|
1 | 1229 |
class GenEnsureParsabilityClosure: public GenCollectedHeap::GenClosure { |
1230 |
public: |
|
1231 |
void do_generation(Generation* gen) { |
|
1232 |
gen->ensure_parsability(); |
|
1233 |
} |
|
1234 |
}; |
|
1235 |
||
1236 |
void GenCollectedHeap::ensure_parsability(bool retire_tlabs) { |
|
1237 |
CollectedHeap::ensure_parsability(retire_tlabs); |
|
1238 |
GenEnsureParsabilityClosure ep_cl; |
|
1239 |
generation_iterate(&ep_cl, false); |
|
1240 |
} |
|
1241 |
||
19286
48394008c803
8022800: Use specific generations rather than generation iteration
brutisso
parents:
18687
diff
changeset
|
1242 |
oop GenCollectedHeap::handle_failed_promotion(Generation* old_gen, |
1 | 1243 |
oop obj, |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1244 |
size_t obj_size) { |
19286
48394008c803
8022800: Use specific generations rather than generation iteration
brutisso
parents:
18687
diff
changeset
|
1245 |
guarantee(old_gen->level() == 1, "We only get here with an old generation"); |
1 | 1246 |
assert(obj_size == (size_t)obj->size(), "bad obj_size passed in"); |
1247 |
HeapWord* result = NULL; |
|
1248 |
||
19286
48394008c803
8022800: Use specific generations rather than generation iteration
brutisso
parents:
18687
diff
changeset
|
1249 |
result = old_gen->expand_and_allocate(obj_size, false); |
1 | 1250 |
|
1251 |
if (result != NULL) { |
|
1252 |
Copy::aligned_disjoint_words((HeapWord*)obj, result, obj_size); |
|
1253 |
} |
|
1254 |
return oop(result); |
|
1255 |
} |
|
1256 |
||
1257 |
class GenTimeOfLastGCClosure: public GenCollectedHeap::GenClosure { |
|
1258 |
jlong _time; // in ms |
|
1259 |
jlong _now; // in ms |
|
1260 |
||
1261 |
public: |
|
1262 |
GenTimeOfLastGCClosure(jlong now) : _time(now), _now(now) { } |
|
1263 |
||
1264 |
jlong time() { return _time; } |
|
1265 |
||
1266 |
void do_generation(Generation* gen) { |
|
1267 |
_time = MIN2(_time, gen->time_of_last_gc(_now)); |
|
1268 |
} |
|
1269 |
}; |
|
1270 |
||
1271 |
jlong GenCollectedHeap::millis_since_last_gc() { |
|
22551 | 1272 |
// We need a monotonically non-decreasing time in ms but |
11251
e29da6b5622b
7117303: VM uses non-monotonic time source and complains that it is non-monotonic
johnc
parents:
11247
diff
changeset
|
1273 |
// os::javaTimeMillis() does not guarantee monotonicity. |
e29da6b5622b
7117303: VM uses non-monotonic time source and complains that it is non-monotonic
johnc
parents:
11247
diff
changeset
|
1274 |
jlong now = os::javaTimeNanos() / NANOSECS_PER_MILLISEC; |
1 | 1275 |
GenTimeOfLastGCClosure tolgc_cl(now); |
1276 |
// iterate over generations getting the oldest |
|
1277 |
// time that a generation was collected |
|
1278 |
generation_iterate(&tolgc_cl, false); |
|
11251
e29da6b5622b
7117303: VM uses non-monotonic time source and complains that it is non-monotonic
johnc
parents:
11247
diff
changeset
|
1279 |
|
e29da6b5622b
7117303: VM uses non-monotonic time source and complains that it is non-monotonic
johnc
parents:
11247
diff
changeset
|
1280 |
// javaTimeNanos() is guaranteed to be monotonically non-decreasing |
e29da6b5622b
7117303: VM uses non-monotonic time source and complains that it is non-monotonic
johnc
parents:
11247
diff
changeset
|
1281 |
// provided the underlying platform provides such a time source |
e29da6b5622b
7117303: VM uses non-monotonic time source and complains that it is non-monotonic
johnc
parents:
11247
diff
changeset
|
1282 |
// (and it is bug free). So we still have to guard against getting |
e29da6b5622b
7117303: VM uses non-monotonic time source and complains that it is non-monotonic
johnc
parents:
11247
diff
changeset
|
1283 |
// back a time later than 'now'. |
1 | 1284 |
jlong retVal = now - tolgc_cl.time(); |
1285 |
if (retVal < 0) { |
|
24424
2658d7834c6e
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
24353
diff
changeset
|
1286 |
NOT_PRODUCT(warning("time warp: "INT64_FORMAT, (int64_t) retVal);) |
1 | 1287 |
return 0; |
1288 |
} |
|
1289 |
return retVal; |
|
1290 |
} |