Mercurial > hg > graal-jvmci-8
annotate src/share/vm/memory/genCollectedHeap.cpp @ 24234:ea6f94ab283b default tip
Added tag jvmci-0.36 for changeset 8128b98d4736
author | Gilles Duboscq <gilles.m.duboscq@oracle.com> |
---|---|
date | Mon, 18 Sep 2017 18:49:45 +0200 |
parents | dd9cc155639c |
children |
rev | line source |
---|---|
0 | 1 /* |
17937
78bbf4d43a14
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
17866
diff
changeset
|
2 * Copyright (c) 2000, 2014, Oracle and/or its affiliates. All rights reserved. |
0 | 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 * | |
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1520
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1520
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1520
diff
changeset
|
21 * questions. |
0 | 22 * |
23 */ | |
24 | |
1972 | 25 #include "precompiled.hpp" |
26 #include "classfile/symbolTable.hpp" | |
27 #include "classfile/systemDictionary.hpp" | |
28 #include "classfile/vmSymbols.hpp" | |
23224
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
29 #include "code/codeCache.hpp" |
1972 | 30 #include "code/icBuffer.hpp" |
31 #include "gc_implementation/shared/collectorCounters.hpp" | |
20190
0982ec23da03
8043607: Add a GC id as a log decoration similar to PrintGCTimeStamps
brutisso
parents:
17937
diff
changeset
|
32 #include "gc_implementation/shared/gcTrace.hpp" |
10405 | 33 #include "gc_implementation/shared/gcTraceTime.hpp" |
1972 | 34 #include "gc_implementation/shared/vmGCOperations.hpp" |
35 #include "gc_interface/collectedHeap.inline.hpp" | |
36 #include "memory/filemap.hpp" | |
37 #include "memory/gcLocker.inline.hpp" | |
38 #include "memory/genCollectedHeap.hpp" | |
39 #include "memory/genOopClosures.inline.hpp" | |
40 #include "memory/generation.inline.hpp" | |
41 #include "memory/generationSpec.hpp" | |
42 #include "memory/resourceArea.hpp" | |
43 #include "memory/sharedHeap.hpp" | |
44 #include "memory/space.hpp" | |
45 #include "oops/oop.inline.hpp" | |
46 #include "oops/oop.inline2.hpp" | |
47 #include "runtime/biasedLocking.hpp" | |
48 #include "runtime/fprofiler.hpp" | |
49 #include "runtime/handles.hpp" | |
50 #include "runtime/handles.inline.hpp" | |
51 #include "runtime/java.hpp" | |
52 #include "runtime/vmThread.hpp" | |
23224
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
53 #include "services/management.hpp" |
1972 | 54 #include "services/memoryService.hpp" |
55 #include "utilities/vmError.hpp" | |
56 #include "utilities/workgroup.hpp" | |
8001
db9981fd3124
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
6865
diff
changeset
|
57 #include "utilities/macros.hpp" |
db9981fd3124
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
6865
diff
changeset
|
58 #if INCLUDE_ALL_GCS |
1972 | 59 #include "gc_implementation/concurrentMarkSweep/concurrentMarkSweepThread.hpp" |
60 #include "gc_implementation/concurrentMarkSweep/vmCMSOperations.hpp" | |
8001
db9981fd3124
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
6865
diff
changeset
|
61 #endif // INCLUDE_ALL_GCS |
0 | 62 |
63 GenCollectedHeap* GenCollectedHeap::_gch; | |
64 NOT_PRODUCT(size_t GenCollectedHeap::_skip_header_HeapWords = 0;) | |
65 | |
20278
2c6ef90f030a
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
20264
diff
changeset
|
66 // The set of potentially parallel tasks in root scanning. |
2c6ef90f030a
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
20264
diff
changeset
|
67 enum GCH_strong_roots_tasks { |
23224
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
68 GCH_PS_Universe_oops_do, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
69 GCH_PS_JNIHandles_oops_do, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
70 GCH_PS_ObjectSynchronizer_oops_do, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
71 GCH_PS_FlatProfiler_oops_do, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
72 GCH_PS_Management_oops_do, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
73 GCH_PS_SystemDictionary_oops_do, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
74 GCH_PS_ClassLoaderDataGraph_oops_do, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
75 GCH_PS_jvmti_oops_do, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
76 GCH_PS_CodeCache_oops_do, |
0 | 77 GCH_PS_younger_gens, |
78 // Leave this one last. | |
79 GCH_PS_NumElements | |
80 }; | |
81 | |
82 GenCollectedHeap::GenCollectedHeap(GenCollectorPolicy *policy) : | |
83 SharedHeap(policy), | |
84 _gen_policy(policy), | |
23224
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
85 _process_strong_tasks(new SubTasksDone(GCH_PS_NumElements)), |
0 | 86 _full_collections_completed(0) |
87 { | |
88 assert(policy != NULL, "Sanity check"); | |
89 } | |
90 | |
91 jint GenCollectedHeap::initialize() { | |
1166 | 92 CollectedHeap::pre_initialize(); |
93 | |
0 | 94 int i; |
95 _n_gens = gen_policy()->number_of_generations(); | |
96 | |
97 // While there are no constraints in the GC code that HeapWordSize | |
98 // be any particular value, there are multiple other areas in the | |
99 // system which believe this to be true (e.g. oop->object_size in some | |
100 // cases incorrectly returns the size in wordSize units rather than | |
101 // HeapWordSize). | |
102 guarantee(HeapWordSize == wordSize, "HeapWordSize must equal wordSize"); | |
103 | |
104 // The heap must be at least as aligned as generations. | |
12110
4c84d351cca9
8007074: SIGSEGV at ParMarkBitMap::verify_clear()
stefank
parents:
12063
diff
changeset
|
105 size_t gen_alignment = Generation::GenGrain; |
0 | 106 |
107 _gen_specs = gen_policy()->generations(); | |
108 | |
109 // Make sure the sizes are all aligned. | |
110 for (i = 0; i < _n_gens; i++) { | |
12110
4c84d351cca9
8007074: SIGSEGV at ParMarkBitMap::verify_clear()
stefank
parents:
12063
diff
changeset
|
111 _gen_specs[i]->align(gen_alignment); |
0 | 112 } |
113 | |
114 // Allocate space for the heap. | |
115 | |
116 char* heap_address; | |
117 size_t total_reserved = 0; | |
118 int n_covered_regions = 0; | |
12110
4c84d351cca9
8007074: SIGSEGV at ParMarkBitMap::verify_clear()
stefank
parents:
12063
diff
changeset
|
119 ReservedSpace heap_rs; |
0 | 120 |
13060
8f07aa079343
8016309: assert(eden_size > 0 && survivor_size > 0) failed: just checking
jwilhelm
parents:
13059
diff
changeset
|
121 size_t heap_alignment = collector_policy()->heap_alignment(); |
12110
4c84d351cca9
8007074: SIGSEGV at ParMarkBitMap::verify_clear()
stefank
parents:
12063
diff
changeset
|
122 |
4c84d351cca9
8007074: SIGSEGV at ParMarkBitMap::verify_clear()
stefank
parents:
12063
diff
changeset
|
123 heap_address = allocate(heap_alignment, &total_reserved, |
0 | 124 &n_covered_regions, &heap_rs); |
125 | |
126 if (!heap_rs.is_reserved()) { | |
127 vm_shutdown_during_initialization( | |
128 "Could not reserve enough space for object heap"); | |
129 return JNI_ENOMEM; | |
130 } | |
131 | |
132 _reserved = MemRegion((HeapWord*)heap_rs.base(), | |
133 (HeapWord*)(heap_rs.base() + heap_rs.size())); | |
134 | |
135 // It is important to do this in a way such that concurrent readers can't | |
136 // temporarily think somethings in the heap. (Seen this happen in asserts.) | |
137 _reserved.set_word_size(0); | |
138 _reserved.set_start((HeapWord*)heap_rs.base()); | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
139 size_t actual_heap_size = heap_rs.size(); |
0 | 140 _reserved.set_end((HeapWord*)(heap_rs.base() + actual_heap_size)); |
141 | |
142 _rem_set = collector_policy()->create_rem_set(_reserved, n_covered_regions); | |
143 set_barrier_set(rem_set()->bs()); | |
1166 | 144 |
0 | 145 _gch = this; |
146 | |
147 for (i = 0; i < _n_gens; i++) { | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
148 ReservedSpace this_rs = heap_rs.first_part(_gen_specs[i]->max_size(), false, false); |
0 | 149 _gens[i] = _gen_specs[i]->init(this_rs, i, rem_set()); |
150 heap_rs = heap_rs.last_part(_gen_specs[i]->max_size()); | |
151 } | |
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1833
diff
changeset
|
152 clear_incremental_collection_failed(); |
0 | 153 |
8001
db9981fd3124
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
6865
diff
changeset
|
154 #if INCLUDE_ALL_GCS |
0 | 155 // If we are running CMS, create the collector responsible |
156 // for collecting the CMS generations. | |
157 if (collector_policy()->is_concurrent_mark_sweep_policy()) { | |
158 bool success = create_cms_collector(); | |
159 if (!success) return JNI_ENOMEM; | |
160 } | |
8001
db9981fd3124
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
6865
diff
changeset
|
161 #endif // INCLUDE_ALL_GCS |
0 | 162 |
163 return JNI_OK; | |
164 } | |
165 | |
166 | |
167 char* GenCollectedHeap::allocate(size_t alignment, | |
168 size_t* _total_reserved, | |
169 int* _n_covered_regions, | |
170 ReservedSpace* heap_rs){ | |
171 const char overflow_msg[] = "The size of the object heap + VM data exceeds " | |
172 "the maximum representable size"; | |
173 | |
174 // Now figure out the total size. | |
175 size_t total_reserved = 0; | |
176 int n_covered_regions = 0; | |
177 const size_t pageSize = UseLargePages ? | |
178 os::large_page_size() : os::vm_page_size(); | |
179 | |
12110
4c84d351cca9
8007074: SIGSEGV at ParMarkBitMap::verify_clear()
stefank
parents:
12063
diff
changeset
|
180 assert(alignment % pageSize == 0, "Must be"); |
4c84d351cca9
8007074: SIGSEGV at ParMarkBitMap::verify_clear()
stefank
parents:
12063
diff
changeset
|
181 |
0 | 182 for (int i = 0; i < _n_gens; i++) { |
183 total_reserved += _gen_specs[i]->max_size(); | |
184 if (total_reserved < _gen_specs[i]->max_size()) { | |
185 vm_exit_during_initialization(overflow_msg); | |
186 } | |
187 n_covered_regions += _gen_specs[i]->n_covered_regions(); | |
188 } | |
12110
4c84d351cca9
8007074: SIGSEGV at ParMarkBitMap::verify_clear()
stefank
parents:
12063
diff
changeset
|
189 assert(total_reserved % alignment == 0, |
4c84d351cca9
8007074: SIGSEGV at ParMarkBitMap::verify_clear()
stefank
parents:
12063
diff
changeset
|
190 err_msg("Gen size; total_reserved=" SIZE_FORMAT ", alignment=" |
4c84d351cca9
8007074: SIGSEGV at ParMarkBitMap::verify_clear()
stefank
parents:
12063
diff
changeset
|
191 SIZE_FORMAT, total_reserved, alignment)); |
0 | 192 |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
193 // Needed until the cardtable is fixed to have the right number |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
194 // of covered regions. |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
195 n_covered_regions += 2; |
0 | 196 |
12110
4c84d351cca9
8007074: SIGSEGV at ParMarkBitMap::verify_clear()
stefank
parents:
12063
diff
changeset
|
197 *_total_reserved = total_reserved; |
4c84d351cca9
8007074: SIGSEGV at ParMarkBitMap::verify_clear()
stefank
parents:
12063
diff
changeset
|
198 *_n_covered_regions = n_covered_regions; |
0 | 199 |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
200 *heap_rs = Universe::reserve_heap(total_reserved, alignment); |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
201 return heap_rs->base(); |
0 | 202 } |
203 | |
204 | |
205 void GenCollectedHeap::post_initialize() { | |
206 SharedHeap::post_initialize(); | |
207 TwoGenerationCollectorPolicy *policy = | |
208 (TwoGenerationCollectorPolicy *)collector_policy(); | |
209 guarantee(policy->is_two_generation_policy(), "Illegal policy type"); | |
210 DefNewGeneration* def_new_gen = (DefNewGeneration*) get_gen(0); | |
211 assert(def_new_gen->kind() == Generation::DefNew || | |
212 def_new_gen->kind() == Generation::ParNew || | |
213 def_new_gen->kind() == Generation::ASParNew, | |
214 "Wrong generation kind"); | |
215 | |
216 Generation* old_gen = get_gen(1); | |
217 assert(old_gen->kind() == Generation::ConcurrentMarkSweep || | |
218 old_gen->kind() == Generation::ASConcurrentMarkSweep || | |
219 old_gen->kind() == Generation::MarkSweepCompact, | |
220 "Wrong generation kind"); | |
221 | |
222 policy->initialize_size_policy(def_new_gen->eden()->capacity(), | |
223 old_gen->capacity(), | |
224 def_new_gen->from()->capacity()); | |
225 policy->initialize_gc_policy_counters(); | |
226 } | |
227 | |
228 void GenCollectedHeap::ref_processing_init() { | |
229 SharedHeap::ref_processing_init(); | |
230 for (int i = 0; i < _n_gens; i++) { | |
231 _gens[i]->ref_processor_init(); | |
232 } | |
233 } | |
234 | |
235 size_t GenCollectedHeap::capacity() const { | |
236 size_t res = 0; | |
237 for (int i = 0; i < _n_gens; i++) { | |
238 res += _gens[i]->capacity(); | |
239 } | |
240 return res; | |
241 } | |
242 | |
243 size_t GenCollectedHeap::used() const { | |
244 size_t res = 0; | |
245 for (int i = 0; i < _n_gens; i++) { | |
246 res += _gens[i]->used(); | |
247 } | |
248 return res; | |
249 } | |
250 | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
251 // Save the "used_region" for generations level and lower. |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
252 void GenCollectedHeap::save_used_regions(int level) { |
0 | 253 assert(level < _n_gens, "Illegal level parameter"); |
254 for (int i = level; i >= 0; i--) { | |
255 _gens[i]->save_used_region(); | |
256 } | |
257 } | |
258 | |
259 size_t GenCollectedHeap::max_capacity() const { | |
260 size_t res = 0; | |
261 for (int i = 0; i < _n_gens; i++) { | |
262 res += _gens[i]->max_capacity(); | |
263 } | |
264 return res; | |
265 } | |
266 | |
267 // Update the _full_collections_completed counter | |
268 // at the end of a stop-world full GC. | |
269 unsigned int GenCollectedHeap::update_full_collections_completed() { | |
270 MonitorLockerEx ml(FullGCCount_lock, Mutex::_no_safepoint_check_flag); | |
271 assert(_full_collections_completed <= _total_full_collections, | |
272 "Can't complete more collections than were started"); | |
273 _full_collections_completed = _total_full_collections; | |
274 ml.notify_all(); | |
275 return _full_collections_completed; | |
276 } | |
277 | |
278 // Update the _full_collections_completed counter, as appropriate, | |
279 // at the end of a concurrent GC cycle. Note the conditional update | |
280 // below to allow this method to be called by a concurrent collector | |
281 // without synchronizing in any manner with the VM thread (which | |
282 // may already have initiated a STW full collection "concurrently"). | |
283 unsigned int GenCollectedHeap::update_full_collections_completed(unsigned int count) { | |
284 MonitorLockerEx ml(FullGCCount_lock, Mutex::_no_safepoint_check_flag); | |
285 assert((_full_collections_completed <= _total_full_collections) && | |
286 (count <= _total_full_collections), | |
287 "Can't complete more collections than were started"); | |
288 if (count > _full_collections_completed) { | |
289 _full_collections_completed = count; | |
290 ml.notify_all(); | |
291 } | |
292 return _full_collections_completed; | |
293 } | |
294 | |
295 | |
296 #ifndef PRODUCT | |
297 // Override of memory state checking method in CollectedHeap: | |
298 // Some collectors (CMS for example) can't have badHeapWordVal written | |
299 // in the first two words of an object. (For instance , in the case of | |
300 // CMS these words hold state used to synchronize between certain | |
301 // (concurrent) GC steps and direct allocating mutators.) | |
302 // The skip_header_HeapWords() method below, allows us to skip | |
303 // over the requisite number of HeapWord's. Note that (for | |
304 // generational collectors) this means that those many words are | |
305 // skipped in each object, irrespective of the generation in which | |
306 // that object lives. The resultant loss of precision seems to be | |
307 // harmless and the pain of avoiding that imprecision appears somewhat | |
308 // higher than we are prepared to pay for such rudimentary debugging | |
309 // support. | |
310 void GenCollectedHeap::check_for_non_bad_heap_word_value(HeapWord* addr, | |
311 size_t size) { | |
312 if (CheckMemoryInitialization && ZapUnusedHeapArea) { | |
313 // We are asked to check a size in HeapWords, | |
314 // but the memory is mangled in juint words. | |
315 juint* start = (juint*) (addr + skip_header_HeapWords()); | |
316 juint* end = (juint*) (addr + size); | |
317 for (juint* slot = start; slot < end; slot += 1) { | |
318 assert(*slot == badHeapWordVal, | |
319 "Found non badHeapWordValue in pre-allocation check"); | |
320 } | |
321 } | |
322 } | |
323 #endif | |
324 | |
325 HeapWord* GenCollectedHeap::attempt_allocation(size_t size, | |
326 bool is_tlab, | |
327 bool first_only) { | |
328 HeapWord* res; | |
329 for (int i = 0; i < _n_gens; i++) { | |
330 if (_gens[i]->should_allocate(size, is_tlab)) { | |
331 res = _gens[i]->allocate(size, is_tlab); | |
332 if (res != NULL) return res; | |
333 else if (first_only) break; | |
334 } | |
335 } | |
336 // Otherwise... | |
337 return NULL; | |
338 } | |
339 | |
340 HeapWord* GenCollectedHeap::mem_allocate(size_t size, | |
341 bool* gc_overhead_limit_was_exceeded) { | |
342 return collector_policy()->mem_allocate_work(size, | |
3774
c9ca3f51cf41
6994322: Remove the is_tlab and is_noref / is_large_noref parameters from the CollectedHeap
tonyp
parents:
3772
diff
changeset
|
343 false /* is_tlab */, |
0 | 344 gc_overhead_limit_was_exceeded); |
345 } | |
346 | |
347 bool GenCollectedHeap::must_clear_all_soft_refs() { | |
348 return _gc_cause == GCCause::_last_ditch_collection; | |
349 } | |
350 | |
351 bool GenCollectedHeap::should_do_concurrent_full_gc(GCCause::Cause cause) { | |
1520
bb843ebc7c55
6919638: CMS: ExplicitGCInvokesConcurrent misinteracts with gc locker
ysr
parents:
1387
diff
changeset
|
352 return UseConcMarkSweepGC && |
bb843ebc7c55
6919638: CMS: ExplicitGCInvokesConcurrent misinteracts with gc locker
ysr
parents:
1387
diff
changeset
|
353 ((cause == GCCause::_gc_locker && GCLockerInvokesConcurrent) || |
bb843ebc7c55
6919638: CMS: ExplicitGCInvokesConcurrent misinteracts with gc locker
ysr
parents:
1387
diff
changeset
|
354 (cause == GCCause::_java_lang_system_gc && ExplicitGCInvokesConcurrent)); |
0 | 355 } |
356 | |
357 void GenCollectedHeap::do_collection(bool full, | |
358 bool clear_all_soft_refs, | |
359 size_t size, | |
360 bool is_tlab, | |
361 int max_level) { | |
362 bool prepared_for_verification = false; | |
363 ResourceMark rm; | |
364 DEBUG_ONLY(Thread* my_thread = Thread::current();) | |
365 | |
366 assert(SafepointSynchronize::is_at_safepoint(), "should be at safepoint"); | |
367 assert(my_thread->is_VM_thread() || | |
368 my_thread->is_ConcurrentGC_thread(), | |
369 "incorrect thread type capability"); | |
1387
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1170
diff
changeset
|
370 assert(Heap_lock->is_locked(), |
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1170
diff
changeset
|
371 "the requesting thread should have the Heap_lock"); |
0 | 372 guarantee(!is_gc_active(), "collection is not reentrant"); |
373 assert(max_level < n_gens(), "sanity check"); | |
374 | |
375 if (GC_locker::check_active_before_gc()) { | |
376 return; // GC is disabled (e.g. JNI GetXXXCritical operation) | |
377 } | |
378 | |
1387
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1170
diff
changeset
|
379 const bool do_clear_all_soft_refs = clear_all_soft_refs || |
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1170
diff
changeset
|
380 collector_policy()->should_clear_all_soft_refs(); |
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1170
diff
changeset
|
381 |
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1170
diff
changeset
|
382 ClearedAllSoftRefs casr(do_clear_all_soft_refs, collector_policy()); |
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1170
diff
changeset
|
383 |
17866
270d7cb38f40
8038934: Remove prefix allocated_ from methods and variables in Metaspace
ehelin
parents:
17727
diff
changeset
|
384 const size_t metadata_prev_used = MetaspaceAux::used_bytes(); |
0 | 385 |
4872
aa3d708d67c4
7141200: log some interesting information in ring buffers for crashes
never
parents:
4728
diff
changeset
|
386 print_heap_before_gc(); |
0 | 387 |
388 { | |
389 FlagSetting fl(_is_gc_active, true); | |
390 | |
391 bool complete = full && (max_level == (n_gens()-1)); | |
6064
9d679effd28c
7166894: Add gc cause to GC logging for all collectors
brutisso
parents:
6008
diff
changeset
|
392 const char* gc_cause_prefix = complete ? "Full GC" : "GC"; |
0 | 393 TraceCPUTime tcpu(PrintGCDetails, true, gclog_or_tty); |
20190
0982ec23da03
8043607: Add a GC id as a log decoration similar to PrintGCTimeStamps
brutisso
parents:
17937
diff
changeset
|
394 // The PrintGCDetails logging starts before we have incremented the GC id. We will do that later |
0982ec23da03
8043607: Add a GC id as a log decoration similar to PrintGCTimeStamps
brutisso
parents:
17937
diff
changeset
|
395 // so we can assume here that the next GC id is what we want. |
0982ec23da03
8043607: Add a GC id as a log decoration similar to PrintGCTimeStamps
brutisso
parents:
17937
diff
changeset
|
396 GCTraceTime t(GCCauseString(gc_cause_prefix, gc_cause()), PrintGCDetails, false, NULL, GCId::peek()); |
0 | 397 |
398 gc_prologue(complete); | |
399 increment_total_collections(complete); | |
400 | |
401 size_t gch_prev_used = used(); | |
402 | |
403 int starting_level = 0; | |
404 if (full) { | |
405 // Search for the oldest generation which will collect all younger | |
406 // generations, and start collection loop there. | |
407 for (int i = max_level; i >= 0; i--) { | |
408 if (_gens[i]->full_collects_younger_generations()) { | |
409 starting_level = i; | |
410 break; | |
411 } | |
412 } | |
413 } | |
414 | |
415 bool must_restore_marks_for_biased_locking = false; | |
416 | |
417 int max_level_collected = starting_level; | |
418 for (int i = starting_level; i <= max_level; i++) { | |
419 if (_gens[i]->should_collect(full, size, is_tlab)) { | |
880
2b4230d1e589
6862295: JDWP threadid changes during debugging session (leading to ingored breakpoints)
dcubed
parents:
457
diff
changeset
|
420 if (i == n_gens() - 1) { // a major collection is to happen |
2b4230d1e589
6862295: JDWP threadid changes during debugging session (leading to ingored breakpoints)
dcubed
parents:
457
diff
changeset
|
421 if (!complete) { |
2b4230d1e589
6862295: JDWP threadid changes during debugging session (leading to ingored breakpoints)
dcubed
parents:
457
diff
changeset
|
422 // The full_collections increment was missed above. |
2b4230d1e589
6862295: JDWP threadid changes during debugging session (leading to ingored breakpoints)
dcubed
parents:
457
diff
changeset
|
423 increment_total_full_collections(); |
2b4230d1e589
6862295: JDWP threadid changes during debugging session (leading to ingored breakpoints)
dcubed
parents:
457
diff
changeset
|
424 } |
10405 | 425 pre_full_gc_dump(NULL); // do any pre full gc dumps |
880
2b4230d1e589
6862295: JDWP threadid changes during debugging session (leading to ingored breakpoints)
dcubed
parents:
457
diff
changeset
|
426 } |
0 | 427 // Timer for individual generations. Last argument is false: no CR |
10405 | 428 // FIXME: We should try to start the timing earlier to cover more of the GC pause |
20190
0982ec23da03
8043607: Add a GC id as a log decoration similar to PrintGCTimeStamps
brutisso
parents:
17937
diff
changeset
|
429 // The PrintGCDetails logging starts before we have incremented the GC id. We will do that later |
0982ec23da03
8043607: Add a GC id as a log decoration similar to PrintGCTimeStamps
brutisso
parents:
17937
diff
changeset
|
430 // so we can assume here that the next GC id is what we want. |
0982ec23da03
8043607: Add a GC id as a log decoration similar to PrintGCTimeStamps
brutisso
parents:
17937
diff
changeset
|
431 GCTraceTime t1(_gens[i]->short_name(), PrintGCDetails, false, NULL, GCId::peek()); |
0 | 432 TraceCollectorStats tcs(_gens[i]->counters()); |
3356
78542e2b5e35
7036199: Adding a notification to the implementation of GarbageCollectorMXBeans
fparain
parents:
2426
diff
changeset
|
433 TraceMemoryManagerStats tmms(_gens[i]->kind(),gc_cause()); |
0 | 434 |
435 size_t prev_used = _gens[i]->used(); | |
436 _gens[i]->stat_record()->invocations++; | |
437 _gens[i]->stat_record()->accumulated_time.start(); | |
438 | |
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
439 // Must be done anew before each collection because |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
440 // a previous collection will do mangling and will |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
441 // change top of some spaces. |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
442 record_gen_tops_before_GC(); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
443 |
0 | 444 if (PrintGC && Verbose) { |
445 gclog_or_tty->print("level=%d invoke=%d size=" SIZE_FORMAT, | |
446 i, | |
447 _gens[i]->stat_record()->invocations, | |
448 size*HeapWordSize); | |
449 } | |
450 | |
451 if (VerifyBeforeGC && i >= VerifyGCLevel && | |
452 total_collections() >= VerifyGCStartAt) { | |
453 HandleMark hm; // Discard invalid handles created during verification | |
454 if (!prepared_for_verification) { | |
455 prepare_for_verify(); | |
456 prepared_for_verification = true; | |
457 } | |
10186
b06ac540229e
8013132: Add a flag to turn off the output of the verbose verification code
stefank
parents:
10183
diff
changeset
|
458 Universe::verify(" VerifyBeforeGC:"); |
0 | 459 } |
22298 | 460 #if defined(COMPILER2) || INCLUDE_JVMCI |
22294
d86b226e331a
Enable derived oop processing by the GC with JVMCI
Tom Rodriguez <tom.rodriguez@oracle.com>
parents:
20804
diff
changeset
|
461 DerivedPointerTable::clear(); |
d86b226e331a
Enable derived oop processing by the GC with JVMCI
Tom Rodriguez <tom.rodriguez@oracle.com>
parents:
20804
diff
changeset
|
462 #endif |
0 | 463 |
464 if (!must_restore_marks_for_biased_locking && | |
465 _gens[i]->performs_in_place_marking()) { | |
466 // We perform this mark word preservation work lazily | |
467 // because it's only at this point that we know whether we | |
468 // absolutely have to do it; we want to avoid doing it for | |
469 // scavenge-only collections where it's unnecessary | |
470 must_restore_marks_for_biased_locking = true; | |
471 BiasedLocking::preserve_marks(); | |
472 } | |
473 | |
474 // Do collection work | |
475 { | |
476 // Note on ref discovery: For what appear to be historical reasons, | |
477 // GCH enables and disabled (by enqueing) refs discovery. | |
478 // In the future this should be moved into the generation's | |
479 // collect method so that ref discovery and enqueueing concerns | |
480 // are local to a generation. The collect method could return | |
481 // an appropriate indication in the case that notification on | |
482 // the ref lock was needed. This will make the treatment of | |
483 // weak refs more uniform (and indeed remove such concerns | |
484 // from GCH). XXX | |
485 | |
486 HandleMark hm; // Discard invalid handles created during gc | |
487 save_marks(); // save marks for all gens | |
488 // We want to discover references, but not process them yet. | |
489 // This mode is disabled in process_discovered_references if the | |
490 // generation does some collection work, or in | |
491 // enqueue_discovered_references if the generation returns | |
492 // without doing any work. | |
493 ReferenceProcessor* rp = _gens[i]->ref_processor(); | |
494 // If the discovery of ("weak") refs in this generation is | |
495 // atomic wrt other collectors in this configuration, we | |
496 // are guaranteed to have empty discovered ref lists. | |
497 if (rp->discovery_is_atomic()) { | |
3979
4dfb2df418f2
6484982: G1: process references during evacuation pauses
johnc
parents:
3915
diff
changeset
|
498 rp->enable_discovery(true /*verify_disabled*/, true /*verify_no_refs*/); |
1387
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1170
diff
changeset
|
499 rp->setup_policy(do_clear_all_soft_refs); |
0 | 500 } else { |
453
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
269
diff
changeset
|
501 // collect() below will enable discovery as appropriate |
0 | 502 } |
1387
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1170
diff
changeset
|
503 _gens[i]->collect(full, do_clear_all_soft_refs, size, is_tlab); |
0 | 504 if (!rp->enqueuing_is_done()) { |
505 rp->enqueue_discovered_references(); | |
506 } else { | |
507 rp->set_enqueuing_is_done(false); | |
508 } | |
509 rp->verify_no_references_recorded(); | |
510 } | |
511 max_level_collected = i; | |
512 | |
513 // Determine if allocation request was met. | |
514 if (size > 0) { | |
515 if (!is_tlab || _gens[i]->supports_tlab_allocation()) { | |
516 if (size*HeapWordSize <= _gens[i]->unsafe_max_alloc_nogc()) { | |
517 size = 0; | |
518 } | |
519 } | |
520 } | |
521 | |
22298 | 522 #if defined(COMPILER2) || INCLUDE_JVMCI |
22294
d86b226e331a
Enable derived oop processing by the GC with JVMCI
Tom Rodriguez <tom.rodriguez@oracle.com>
parents:
20804
diff
changeset
|
523 DerivedPointerTable::update_pointers(); |
d86b226e331a
Enable derived oop processing by the GC with JVMCI
Tom Rodriguez <tom.rodriguez@oracle.com>
parents:
20804
diff
changeset
|
524 #endif |
0 | 525 |
526 _gens[i]->stat_record()->accumulated_time.stop(); | |
527 | |
528 update_gc_stats(i, full); | |
529 | |
530 if (VerifyAfterGC && i >= VerifyGCLevel && | |
531 total_collections() >= VerifyGCStartAt) { | |
532 HandleMark hm; // Discard invalid handles created during verification | |
10186
b06ac540229e
8013132: Add a flag to turn off the output of the verbose verification code
stefank
parents:
10183
diff
changeset
|
533 Universe::verify(" VerifyAfterGC:"); |
0 | 534 } |
535 | |
536 if (PrintGCDetails) { | |
537 gclog_or_tty->print(":"); | |
538 _gens[i]->print_heap_change(prev_used); | |
539 } | |
540 } | |
541 } | |
542 | |
543 // Update "complete" boolean wrt what actually transpired -- | |
544 // for instance, a promotion failure could have led to | |
545 // a whole heap collection. | |
546 complete = complete || (max_level_collected == n_gens() - 1); | |
547 | |
615
c6c601a0f2d6
6797870: Add -XX:+{HeapDump,PrintClassHistogram}{Before,After}FullGC
ysr
parents:
546
diff
changeset
|
548 if (complete) { // We did a "major" collection |
10405 | 549 // FIXME: See comment at pre_full_gc_dump call |
550 post_full_gc_dump(NULL); // do any post full gc dumps | |
615
c6c601a0f2d6
6797870: Add -XX:+{HeapDump,PrintClassHistogram}{Before,After}FullGC
ysr
parents:
546
diff
changeset
|
551 } |
c6c601a0f2d6
6797870: Add -XX:+{HeapDump,PrintClassHistogram}{Before,After}FullGC
ysr
parents:
546
diff
changeset
|
552 |
0 | 553 if (PrintGCDetails) { |
554 print_heap_change(gch_prev_used); | |
555 | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
556 // Print metaspace info for full GC with PrintGCDetails flag. |
0 | 557 if (complete) { |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
558 MetaspaceAux::print_metaspace_change(metadata_prev_used); |
0 | 559 } |
560 } | |
561 | |
562 for (int j = max_level_collected; j >= 0; j -= 1) { | |
563 // Adjust generation sizes. | |
564 _gens[j]->compute_new_size(); | |
565 } | |
566 | |
567 if (complete) { | |
8784
79af1312fc2c
8005602: NPG: classunloading does not happen while CMS GC with -XX:+CMSClassUnloadingEnabled is used
mgerdin
parents:
8001
diff
changeset
|
568 // Delete metaspaces for unloaded class loaders and clean up loader_data graph |
79af1312fc2c
8005602: NPG: classunloading does not happen while CMS GC with -XX:+CMSClassUnloadingEnabled is used
mgerdin
parents:
8001
diff
changeset
|
569 ClassLoaderDataGraph::purge(); |
10183
868d87ed63c8
8008966: NPG: Inefficient Metaspace counter functions cause large young GC regressions
jmasa
parents:
10179
diff
changeset
|
570 MetaspaceAux::verify_metrics(); |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
571 // Resize the metaspace capacity after full collections |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
572 MetaspaceGC::compute_new_size(); |
0 | 573 update_full_collections_completed(); |
574 } | |
575 | |
576 // Track memory usage and detect low memory after GC finishes | |
577 MemoryService::track_memory_usage(); | |
578 | |
579 gc_epilogue(complete); | |
580 | |
581 if (must_restore_marks_for_biased_locking) { | |
582 BiasedLocking::restore_marks(); | |
583 } | |
584 } | |
585 | |
586 AdaptiveSizePolicy* sp = gen_policy()->size_policy(); | |
587 AdaptiveSizePolicyOutput(sp, total_collections()); | |
588 | |
4872
aa3d708d67c4
7141200: log some interesting information in ring buffers for crashes
never
parents:
4728
diff
changeset
|
589 print_heap_after_gc(); |
0 | 590 |
546
05c6d52fa7a9
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
517
diff
changeset
|
591 #ifdef TRACESPINNING |
05c6d52fa7a9
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
517
diff
changeset
|
592 ParallelTaskTerminator::print_termination_counts(); |
05c6d52fa7a9
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
517
diff
changeset
|
593 #endif |
0 | 594 } |
595 | |
596 HeapWord* GenCollectedHeap::satisfy_failed_allocation(size_t size, bool is_tlab) { | |
597 return collector_policy()->satisfy_failed_allocation(size, is_tlab); | |
598 } | |
599 | |
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4712
diff
changeset
|
600 void GenCollectedHeap::set_par_threads(uint t) { |
0 | 601 SharedHeap::set_par_threads(t); |
23224
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
602 set_n_termination(t); |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
603 } |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
604 |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
605 void GenCollectedHeap::set_n_termination(uint t) { |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
606 _process_strong_tasks->set_n_threads(t); |
0 | 607 } |
608 | |
23224
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
609 #ifdef ASSERT |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
610 class AssertNonScavengableClosure: public OopClosure { |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
611 public: |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
612 virtual void do_oop(oop* p) { |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
613 assert(!Universe::heap()->is_in_partial_collection(*p), |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
614 "Referent should not be scavengable."); } |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
615 virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); } |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
616 }; |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
617 static AssertNonScavengableClosure assert_is_non_scavengable_closure; |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
618 #endif |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
619 |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
620 void GenCollectedHeap::process_roots(bool activate_scope, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
621 ScanningOption so, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
622 OopClosure* strong_roots, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
623 OopClosure* weak_roots, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
624 CLDClosure* strong_cld_closure, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
625 CLDClosure* weak_cld_closure, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
626 CodeBlobClosure* code_roots) { |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
627 StrongRootsScope srs(this, activate_scope); |
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
881
diff
changeset
|
628 |
20278
2c6ef90f030a
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
20264
diff
changeset
|
629 // General roots. |
23224
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
630 assert(_strong_roots_parity != 0, "must have called prologue code"); |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
631 assert(code_roots != NULL, "code root closure should always be set"); |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
632 // _n_termination for _process_strong_tasks should be set up stream |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
633 // in a method not running in a GC worker. Otherwise the GC worker |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
634 // could be trying to change the termination condition while the task |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
635 // is executing in another GC worker. |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
636 |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
637 if (!_process_strong_tasks->is_task_claimed(GCH_PS_ClassLoaderDataGraph_oops_do)) { |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
638 ClassLoaderDataGraph::roots_cld_do(strong_cld_closure, weak_cld_closure); |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
639 } |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
640 |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
641 // Some CLDs contained in the thread frames should be considered strong. |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
642 // Don't process them if they will be processed during the ClassLoaderDataGraph phase. |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
643 CLDClosure* roots_from_clds_p = (strong_cld_closure != weak_cld_closure) ? strong_cld_closure : NULL; |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
644 // Only process code roots from thread stacks if we aren't visiting the entire CodeCache anyway |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
645 CodeBlobClosure* roots_from_code_p = (so & SO_AllCodeCache) ? NULL : code_roots; |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
646 |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
647 Threads::possibly_parallel_oops_do(strong_roots, roots_from_clds_p, roots_from_code_p); |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
648 |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
649 if (!_process_strong_tasks->is_task_claimed(GCH_PS_Universe_oops_do)) { |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
650 Universe::oops_do(strong_roots); |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
651 } |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
652 // Global (strong) JNI handles |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
653 if (!_process_strong_tasks->is_task_claimed(GCH_PS_JNIHandles_oops_do)) { |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
654 JNIHandles::oops_do(strong_roots); |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
655 } |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
656 |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
657 if (!_process_strong_tasks->is_task_claimed(GCH_PS_ObjectSynchronizer_oops_do)) { |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
658 ObjectSynchronizer::oops_do(strong_roots); |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
659 } |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
660 if (!_process_strong_tasks->is_task_claimed(GCH_PS_FlatProfiler_oops_do)) { |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
661 FlatProfiler::oops_do(strong_roots); |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
662 } |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
663 if (!_process_strong_tasks->is_task_claimed(GCH_PS_Management_oops_do)) { |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
664 Management::oops_do(strong_roots); |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
665 } |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
666 if (!_process_strong_tasks->is_task_claimed(GCH_PS_jvmti_oops_do)) { |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
667 JvmtiExport::oops_do(strong_roots); |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
668 } |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
669 |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
670 if (!_process_strong_tasks->is_task_claimed(GCH_PS_SystemDictionary_oops_do)) { |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
671 SystemDictionary::roots_oops_do(strong_roots, weak_roots); |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
672 } |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
673 |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
674 // All threads execute the following. A specific chunk of buckets |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
675 // from the StringTable are the individual tasks. |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
676 if (weak_roots != NULL) { |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
677 if (CollectedHeap::use_parallel_gc_threads()) { |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
678 StringTable::possibly_parallel_oops_do(weak_roots); |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
679 } else { |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
680 StringTable::oops_do(weak_roots); |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
681 } |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
682 } |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
683 |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
684 if (!_process_strong_tasks->is_task_claimed(GCH_PS_CodeCache_oops_do)) { |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
685 if (so & SO_ScavengeCodeCache) { |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
686 assert(code_roots != NULL, "must supply closure for code cache"); |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
687 |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
688 // We only visit parts of the CodeCache when scavenging. |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
689 CodeCache::scavenge_root_nmethods_do(code_roots); |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
690 } |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
691 if (so & SO_AllCodeCache) { |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
692 assert(code_roots != NULL, "must supply closure for code cache"); |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
693 |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
694 // CMSCollector uses this to do intermediate-strength collections. |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
695 // We scan the entire code cache, since CodeCache::do_unloading is not called. |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
696 CodeCache::blobs_do(code_roots); |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
697 } |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
698 // Verify that the code cache contents are not subject to |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
699 // movement by a scavenging collection. |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
700 DEBUG_ONLY(CodeBlobToOopClosure assert_code_is_non_scavengable(&assert_is_non_scavengable_closure, !CodeBlobToOopClosure::FixRelocations)); |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
701 DEBUG_ONLY(CodeCache::asserted_non_scavengable_nmethods_do(&assert_code_is_non_scavengable)); |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
702 } |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
703 |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
704 } |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
705 |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
706 void GenCollectedHeap::gen_process_roots(int level, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
707 bool younger_gens_as_roots, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
708 bool activate_scope, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
709 ScanningOption so, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
710 bool only_strong_roots, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
711 OopsInGenClosure* not_older_gens, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
712 OopsInGenClosure* older_gens, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
713 CLDClosure* cld_closure) { |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
714 const bool is_adjust_phase = !only_strong_roots && !younger_gens_as_roots; |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
715 |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
716 bool is_moving_collection = false; |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
717 if (level == 0 || is_adjust_phase) { |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
718 // young collections are always moving |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
719 is_moving_collection = true; |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
720 } |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
721 |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
722 MarkingCodeBlobClosure mark_code_closure(not_older_gens, is_moving_collection); |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
723 OopsInGenClosure* weak_roots = only_strong_roots ? NULL : not_older_gens; |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
724 CLDClosure* weak_cld_closure = only_strong_roots ? NULL : cld_closure; |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
725 |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
726 process_roots(activate_scope, so, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
727 not_older_gens, weak_roots, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
728 cld_closure, weak_cld_closure, |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
729 &mark_code_closure); |
0 | 730 |
731 if (younger_gens_as_roots) { | |
23224
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
732 if (!_process_strong_tasks->is_task_claimed(GCH_PS_younger_gens)) { |
0 | 733 for (int i = 0; i < level; i++) { |
734 not_older_gens->set_generation(_gens[i]); | |
735 _gens[i]->oop_iterate(not_older_gens); | |
736 } | |
737 not_older_gens->reset_generation(); | |
738 } | |
739 } | |
740 // When collection is parallel, all threads get to cooperate to do | |
741 // older-gen scanning. | |
742 for (int i = level+1; i < _n_gens; i++) { | |
743 older_gens->set_generation(_gens[i]); | |
744 rem_set()->younger_refs_iterate(_gens[i], older_gens); | |
745 older_gens->reset_generation(); | |
746 } | |
747 | |
23224
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
748 _process_strong_tasks->all_tasks_completed(); |
20278
2c6ef90f030a
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
20264
diff
changeset
|
749 } |
2c6ef90f030a
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
20264
diff
changeset
|
750 |
2c6ef90f030a
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
20264
diff
changeset
|
751 |
23224
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
752 class AlwaysTrueClosure: public BoolObjectClosure { |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
753 public: |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
754 bool do_object_b(oop p) { return true; } |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
755 }; |
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
756 static AlwaysTrueClosure always_true; |
0 | 757 |
20257
7426d8d76305
8034761: Remove the do_code_roots parameter from process_strong_roots
stefank
parents:
20254
diff
changeset
|
758 void GenCollectedHeap::gen_process_weak_roots(OopClosure* root_closure) { |
23224
79b13c9a93e8
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
20359
diff
changeset
|
759 JNIHandles::weak_oops_do(&always_true, root_closure); |
0 | 760 for (int i = 0; i < _n_gens; i++) { |
761 _gens[i]->ref_processor()->weak_oops_do(root_closure); | |
762 } | |
763 } | |
764 | |
765 #define GCH_SINCE_SAVE_MARKS_ITERATE_DEFN(OopClosureType, nv_suffix) \ | |
766 void GenCollectedHeap:: \ | |
767 oop_since_save_marks_iterate(int level, \ | |
768 OopClosureType* cur, \ | |
769 OopClosureType* older) { \ | |
770 _gens[level]->oop_since_save_marks_iterate##nv_suffix(cur); \ | |
771 for (int i = level+1; i < n_gens(); i++) { \ | |
772 _gens[i]->oop_since_save_marks_iterate##nv_suffix(older); \ | |
773 } \ | |
774 } | |
775 | |
776 ALL_SINCE_SAVE_MARKS_CLOSURES(GCH_SINCE_SAVE_MARKS_ITERATE_DEFN) | |
777 | |
778 #undef GCH_SINCE_SAVE_MARKS_ITERATE_DEFN | |
779 | |
780 bool GenCollectedHeap::no_allocs_since_save_marks(int level) { | |
781 for (int i = level; i < _n_gens; i++) { | |
782 if (!_gens[i]->no_allocs_since_save_marks()) return false; | |
783 } | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
784 return true; |
0 | 785 } |
786 | |
787 bool GenCollectedHeap::supports_inline_contig_alloc() const { | |
788 return _gens[0]->supports_inline_contig_alloc(); | |
789 } | |
790 | |
791 HeapWord** GenCollectedHeap::top_addr() const { | |
792 return _gens[0]->top_addr(); | |
793 } | |
794 | |
795 HeapWord** GenCollectedHeap::end_addr() const { | |
796 return _gens[0]->end_addr(); | |
797 } | |
798 | |
799 // public collection interfaces | |
800 | |
801 void GenCollectedHeap::collect(GCCause::Cause cause) { | |
802 if (should_do_concurrent_full_gc(cause)) { | |
8001
db9981fd3124
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
6865
diff
changeset
|
803 #if INCLUDE_ALL_GCS |
0 | 804 // mostly concurrent full collection |
805 collect_mostly_concurrent(cause); | |
8001
db9981fd3124
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
6865
diff
changeset
|
806 #else // INCLUDE_ALL_GCS |
0 | 807 ShouldNotReachHere(); |
8001
db9981fd3124
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
6865
diff
changeset
|
808 #endif // INCLUDE_ALL_GCS |
20357
4bfc44ba0d19
8055098: WB API should be extended to provide information about size and age of object.
tschatzl
parents:
20295
diff
changeset
|
809 } else if (cause == GCCause::_wb_young_gc) { |
4bfc44ba0d19
8055098: WB API should be extended to provide information about size and age of object.
tschatzl
parents:
20295
diff
changeset
|
810 // minor collection for WhiteBox API |
4bfc44ba0d19
8055098: WB API should be extended to provide information about size and age of object.
tschatzl
parents:
20295
diff
changeset
|
811 collect(cause, 0); |
0 | 812 } else { |
813 #ifdef ASSERT | |
20357
4bfc44ba0d19
8055098: WB API should be extended to provide information about size and age of object.
tschatzl
parents:
20295
diff
changeset
|
814 if (cause == GCCause::_scavenge_alot) { |
4bfc44ba0d19
8055098: WB API should be extended to provide information about size and age of object.
tschatzl
parents:
20295
diff
changeset
|
815 // minor collection only |
4bfc44ba0d19
8055098: WB API should be extended to provide information about size and age of object.
tschatzl
parents:
20295
diff
changeset
|
816 collect(cause, 0); |
4bfc44ba0d19
8055098: WB API should be extended to provide information about size and age of object.
tschatzl
parents:
20295
diff
changeset
|
817 } else { |
4bfc44ba0d19
8055098: WB API should be extended to provide information about size and age of object.
tschatzl
parents:
20295
diff
changeset
|
818 // Stop-the-world full collection |
4bfc44ba0d19
8055098: WB API should be extended to provide information about size and age of object.
tschatzl
parents:
20295
diff
changeset
|
819 collect(cause, n_gens() - 1); |
4bfc44ba0d19
8055098: WB API should be extended to provide information about size and age of object.
tschatzl
parents:
20295
diff
changeset
|
820 } |
0 | 821 #else |
822 // Stop-the-world full collection | |
823 collect(cause, n_gens() - 1); | |
824 #endif | |
825 } | |
826 } | |
827 | |
828 void GenCollectedHeap::collect(GCCause::Cause cause, int max_level) { | |
829 // The caller doesn't have the Heap_lock | |
830 assert(!Heap_lock->owned_by_self(), "this thread should not own the Heap_lock"); | |
831 MutexLocker ml(Heap_lock); | |
832 collect_locked(cause, max_level); | |
833 } | |
834 | |
835 void GenCollectedHeap::collect_locked(GCCause::Cause cause) { | |
836 // The caller has the Heap_lock | |
837 assert(Heap_lock->owned_by_self(), "this thread should own the Heap_lock"); | |
838 collect_locked(cause, n_gens() - 1); | |
839 } | |
840 | |
841 // this is the private collection interface | |
842 // The Heap_lock is expected to be held on entry. | |
843 | |
844 void GenCollectedHeap::collect_locked(GCCause::Cause cause, int max_level) { | |
845 // Read the GC count while holding the Heap_lock | |
846 unsigned int gc_count_before = total_collections(); | |
847 unsigned int full_gc_count_before = total_full_collections(); | |
848 { | |
849 MutexUnlocker mu(Heap_lock); // give up heap lock, execute gets it back | |
850 VM_GenCollectFull op(gc_count_before, full_gc_count_before, | |
851 cause, max_level); | |
852 VMThread::execute(&op); | |
853 } | |
854 } | |
855 | |
8001
db9981fd3124
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
6865
diff
changeset
|
856 #if INCLUDE_ALL_GCS |
0 | 857 bool GenCollectedHeap::create_cms_collector() { |
858 | |
859 assert(((_gens[1]->kind() == Generation::ConcurrentMarkSweep) || | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
860 (_gens[1]->kind() == Generation::ASConcurrentMarkSweep)), |
0 | 861 "Unexpected generation kinds"); |
862 // Skip two header words in the block content verification | |
863 NOT_PRODUCT(_skip_header_HeapWords = CMSCollector::skip_header_HeapWords();) | |
864 CMSCollector* collector = new CMSCollector( | |
865 (ConcurrentMarkSweepGeneration*)_gens[1], | |
866 _rem_set->as_CardTableRS(), | |
867 (ConcurrentMarkSweepPolicy*) collector_policy()); | |
868 | |
869 if (collector == NULL || !collector->completed_initialization()) { | |
870 if (collector) { | |
871 delete collector; // Be nice in embedded situation | |
872 } | |
873 vm_shutdown_during_initialization("Could not create CMS collector"); | |
874 return false; | |
875 } | |
876 return true; // success | |
877 } | |
878 | |
879 void GenCollectedHeap::collect_mostly_concurrent(GCCause::Cause cause) { | |
880 assert(!Heap_lock->owned_by_self(), "Should not own Heap_lock"); | |
881 | |
882 MutexLocker ml(Heap_lock); | |
883 // Read the GC counts while holding the Heap_lock | |
884 unsigned int full_gc_count_before = total_full_collections(); | |
885 unsigned int gc_count_before = total_collections(); | |
886 { | |
887 MutexUnlocker mu(Heap_lock); | |
888 VM_GenCollectFullConcurrent op(gc_count_before, full_gc_count_before, cause); | |
889 VMThread::execute(&op); | |
890 } | |
891 } | |
8001
db9981fd3124
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
6865
diff
changeset
|
892 #endif // INCLUDE_ALL_GCS |
0 | 893 |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
894 void GenCollectedHeap::do_full_collection(bool clear_all_soft_refs) { |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
895 do_full_collection(clear_all_soft_refs, _n_gens - 1); |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
896 } |
0 | 897 |
898 void GenCollectedHeap::do_full_collection(bool clear_all_soft_refs, | |
899 int max_level) { | |
900 int local_max_level; | |
1994
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
901 if (!incremental_collection_will_fail(false /* don't consult_young */) && |
0 | 902 gc_cause() == GCCause::_gc_locker) { |
903 local_max_level = 0; | |
904 } else { | |
905 local_max_level = max_level; | |
906 } | |
907 | |
908 do_collection(true /* full */, | |
909 clear_all_soft_refs /* clear_all_soft_refs */, | |
910 0 /* size */, | |
911 false /* is_tlab */, | |
912 local_max_level /* max_level */); | |
913 // Hack XXX FIX ME !!! | |
914 // A scavenge may not have been attempted, or may have | |
915 // been attempted and failed, because the old gen was too full | |
916 if (local_max_level == 0 && gc_cause() == GCCause::_gc_locker && | |
1994
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
917 incremental_collection_will_fail(false /* don't consult_young */)) { |
0 | 918 if (PrintGCDetails) { |
919 gclog_or_tty->print_cr("GC locker: Trying a full collection " | |
920 "because scavenge failed"); | |
921 } | |
922 // This time allow the old gen to be collected as well | |
923 do_collection(true /* full */, | |
924 clear_all_soft_refs /* clear_all_soft_refs */, | |
925 0 /* size */, | |
926 false /* is_tlab */, | |
927 n_gens() - 1 /* max_level */); | |
928 } | |
929 } | |
930 | |
3377
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3356
diff
changeset
|
931 bool GenCollectedHeap::is_in_young(oop p) { |
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3356
diff
changeset
|
932 bool result = ((HeapWord*)p) < _gens[_n_gens - 1]->reserved().start(); |
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3356
diff
changeset
|
933 assert(result == _gens[0]->is_in_reserved(p), |
17937
78bbf4d43a14
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
17866
diff
changeset
|
934 err_msg("incorrect test - result=%d, p=" PTR_FORMAT, result, p2i((void*)p))); |
3377
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3356
diff
changeset
|
935 return result; |
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3356
diff
changeset
|
936 } |
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3356
diff
changeset
|
937 |
4708 | 938 // Returns "TRUE" iff "p" points into the committed areas of the heap. |
0 | 939 bool GenCollectedHeap::is_in(const void* p) const { |
940 #ifndef ASSERT | |
9071
68fe50d4f1d5
8011343: Add new flag for verifying the heap during startup
johnc
parents:
8784
diff
changeset
|
941 guarantee(VerifyBeforeGC || |
68fe50d4f1d5
8011343: Add new flag for verifying the heap during startup
johnc
parents:
8784
diff
changeset
|
942 VerifyDuringGC || |
68fe50d4f1d5
8011343: Add new flag for verifying the heap during startup
johnc
parents:
8784
diff
changeset
|
943 VerifyBeforeExit || |
68fe50d4f1d5
8011343: Add new flag for verifying the heap during startup
johnc
parents:
8784
diff
changeset
|
944 VerifyDuringStartup || |
68fe50d4f1d5
8011343: Add new flag for verifying the heap during startup
johnc
parents:
8784
diff
changeset
|
945 PrintAssembly || |
68fe50d4f1d5
8011343: Add new flag for verifying the heap during startup
johnc
parents:
8784
diff
changeset
|
946 tty->count() != 0 || // already printing |
68fe50d4f1d5
8011343: Add new flag for verifying the heap during startup
johnc
parents:
8784
diff
changeset
|
947 VerifyAfterGC || |
1681
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1626
diff
changeset
|
948 VMError::fatal_error_in_progress(), "too expensive"); |
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1626
diff
changeset
|
949 |
0 | 950 #endif |
951 // This might be sped up with a cache of the last generation that | |
952 // answered yes. | |
953 for (int i = 0; i < _n_gens; i++) { | |
954 if (_gens[i]->is_in(p)) return true; | |
955 } | |
956 // Otherwise... | |
957 return false; | |
958 } | |
959 | |
3377
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3356
diff
changeset
|
960 #ifdef ASSERT |
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3356
diff
changeset
|
961 // Don't implement this by using is_in_young(). This method is used |
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3356
diff
changeset
|
962 // in some cases to check that is_in_young() is correct. |
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3356
diff
changeset
|
963 bool GenCollectedHeap::is_in_partial_collection(const void* p) { |
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3356
diff
changeset
|
964 assert(is_in_reserved(p) || p == NULL, |
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3356
diff
changeset
|
965 "Does not work if address is non-null and outside of the heap"); |
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3356
diff
changeset
|
966 return p < _gens[_n_gens - 2]->reserved().end() && p != NULL; |
0 | 967 } |
3377
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3356
diff
changeset
|
968 #endif |
0 | 969 |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
970 void GenCollectedHeap::oop_iterate(ExtendedOopClosure* cl) { |
0 | 971 for (int i = 0; i < _n_gens; i++) { |
972 _gens[i]->oop_iterate(cl); | |
973 } | |
974 } | |
975 | |
976 void GenCollectedHeap::object_iterate(ObjectClosure* cl) { | |
977 for (int i = 0; i < _n_gens; i++) { | |
978 _gens[i]->object_iterate(cl); | |
979 } | |
980 } | |
981 | |
517
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
457
diff
changeset
|
982 void GenCollectedHeap::safe_object_iterate(ObjectClosure* cl) { |
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
457
diff
changeset
|
983 for (int i = 0; i < _n_gens; i++) { |
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
457
diff
changeset
|
984 _gens[i]->safe_object_iterate(cl); |
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
457
diff
changeset
|
985 } |
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
457
diff
changeset
|
986 } |
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
457
diff
changeset
|
987 |
0 | 988 Space* GenCollectedHeap::space_containing(const void* addr) const { |
989 for (int i = 0; i < _n_gens; i++) { | |
990 Space* res = _gens[i]->space_containing(addr); | |
991 if (res != NULL) return res; | |
992 } | |
993 // Otherwise... | |
994 assert(false, "Could not find containing space"); | |
995 return NULL; | |
996 } | |
997 | |
998 | |
999 HeapWord* GenCollectedHeap::block_start(const void* addr) const { | |
1000 assert(is_in_reserved(addr), "block_start of address outside of heap"); | |
1001 for (int i = 0; i < _n_gens; i++) { | |
1002 if (_gens[i]->is_in_reserved(addr)) { | |
1003 assert(_gens[i]->is_in(addr), | |
1004 "addr should be in allocated part of generation"); | |
1005 return _gens[i]->block_start(addr); | |
1006 } | |
1007 } | |
1008 assert(false, "Some generation should contain the address"); | |
1009 return NULL; | |
1010 } | |
1011 | |
1012 size_t GenCollectedHeap::block_size(const HeapWord* addr) const { | |
1013 assert(is_in_reserved(addr), "block_size of address outside of heap"); | |
1014 for (int i = 0; i < _n_gens; i++) { | |
1015 if (_gens[i]->is_in_reserved(addr)) { | |
1016 assert(_gens[i]->is_in(addr), | |
1017 "addr should be in allocated part of generation"); | |
1018 return _gens[i]->block_size(addr); | |
1019 } | |
1020 } | |
1021 assert(false, "Some generation should contain the address"); | |
1022 return 0; | |
1023 } | |
1024 | |
1025 bool GenCollectedHeap::block_is_obj(const HeapWord* addr) const { | |
1026 assert(is_in_reserved(addr), "block_is_obj of address outside of heap"); | |
1027 assert(block_start(addr) == addr, "addr must be a block start"); | |
1028 for (int i = 0; i < _n_gens; i++) { | |
1029 if (_gens[i]->is_in_reserved(addr)) { | |
1030 return _gens[i]->block_is_obj(addr); | |
1031 } | |
1032 } | |
1033 assert(false, "Some generation should contain the address"); | |
1034 return false; | |
1035 } | |
1036 | |
1037 bool GenCollectedHeap::supports_tlab_allocation() const { | |
1038 for (int i = 0; i < _n_gens; i += 1) { | |
1039 if (_gens[i]->supports_tlab_allocation()) { | |
1040 return true; | |
1041 } | |
1042 } | |
1043 return false; | |
1044 } | |
1045 | |
1046 size_t GenCollectedHeap::tlab_capacity(Thread* thr) const { | |
1047 size_t result = 0; | |
1048 for (int i = 0; i < _n_gens; i += 1) { | |
1049 if (_gens[i]->supports_tlab_allocation()) { | |
1050 result += _gens[i]->tlab_capacity(); | |
1051 } | |
1052 } | |
1053 return result; | |
1054 } | |
1055 | |
17727 | 1056 size_t GenCollectedHeap::tlab_used(Thread* thr) const { |
1057 size_t result = 0; | |
1058 for (int i = 0; i < _n_gens; i += 1) { | |
1059 if (_gens[i]->supports_tlab_allocation()) { | |
1060 result += _gens[i]->tlab_used(); | |
1061 } | |
1062 } | |
1063 return result; | |
1064 } | |
1065 | |
0 | 1066 size_t GenCollectedHeap::unsafe_max_tlab_alloc(Thread* thr) const { |
1067 size_t result = 0; | |
1068 for (int i = 0; i < _n_gens; i += 1) { | |
1069 if (_gens[i]->supports_tlab_allocation()) { | |
1070 result += _gens[i]->unsafe_max_tlab_alloc(); | |
1071 } | |
1072 } | |
1073 return result; | |
1074 } | |
1075 | |
1076 HeapWord* GenCollectedHeap::allocate_new_tlab(size_t size) { | |
1077 bool gc_overhead_limit_was_exceeded; | |
3774
c9ca3f51cf41
6994322: Remove the is_tlab and is_noref / is_large_noref parameters from the CollectedHeap
tonyp
parents:
3772
diff
changeset
|
1078 return collector_policy()->mem_allocate_work(size /* size */, |
c9ca3f51cf41
6994322: Remove the is_tlab and is_noref / is_large_noref parameters from the CollectedHeap
tonyp
parents:
3772
diff
changeset
|
1079 true /* is_tlab */, |
c9ca3f51cf41
6994322: Remove the is_tlab and is_noref / is_large_noref parameters from the CollectedHeap
tonyp
parents:
3772
diff
changeset
|
1080 &gc_overhead_limit_was_exceeded); |
0 | 1081 } |
1082 | |
1083 // Requires "*prev_ptr" to be non-NULL. Deletes and a block of minimal size | |
1084 // from the list headed by "*prev_ptr". | |
1085 static ScratchBlock *removeSmallestScratch(ScratchBlock **prev_ptr) { | |
1086 bool first = true; | |
1087 size_t min_size = 0; // "first" makes this conceptually infinite. | |
1088 ScratchBlock **smallest_ptr, *smallest; | |
1089 ScratchBlock *cur = *prev_ptr; | |
1090 while (cur) { | |
1091 assert(*prev_ptr == cur, "just checking"); | |
1092 if (first || cur->num_words < min_size) { | |
1093 smallest_ptr = prev_ptr; | |
1094 smallest = cur; | |
1095 min_size = smallest->num_words; | |
1096 first = false; | |
1097 } | |
1098 prev_ptr = &cur->next; | |
1099 cur = cur->next; | |
1100 } | |
1101 smallest = *smallest_ptr; | |
1102 *smallest_ptr = smallest->next; | |
1103 return smallest; | |
1104 } | |
1105 | |
1106 // Sort the scratch block list headed by res into decreasing size order, | |
1107 // and set "res" to the result. | |
1108 static void sort_scratch_list(ScratchBlock*& list) { | |
1109 ScratchBlock* sorted = NULL; | |
1110 ScratchBlock* unsorted = list; | |
1111 while (unsorted) { | |
1112 ScratchBlock *smallest = removeSmallestScratch(&unsorted); | |
1113 smallest->next = sorted; | |
1114 sorted = smallest; | |
1115 } | |
1116 list = sorted; | |
1117 } | |
1118 | |
1119 ScratchBlock* GenCollectedHeap::gather_scratch(Generation* requestor, | |
1120 size_t max_alloc_words) { | |
1121 ScratchBlock* res = NULL; | |
1122 for (int i = 0; i < _n_gens; i++) { | |
1123 _gens[i]->contribute_scratch(res, requestor, max_alloc_words); | |
1124 } | |
1125 sort_scratch_list(res); | |
1126 return res; | |
1127 } | |
1128 | |
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1129 void GenCollectedHeap::release_scratch() { |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1130 for (int i = 0; i < _n_gens; i++) { |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1131 _gens[i]->reset_scratch(); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1132 } |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1133 } |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1134 |
0 | 1135 class GenPrepareForVerifyClosure: public GenCollectedHeap::GenClosure { |
1136 void do_generation(Generation* gen) { | |
1137 gen->prepare_for_verify(); | |
1138 } | |
1139 }; | |
1140 | |
1141 void GenCollectedHeap::prepare_for_verify() { | |
1142 ensure_parsability(false); // no need to retire TLABs | |
1143 GenPrepareForVerifyClosure blk; | |
1144 generation_iterate(&blk, false); | |
1145 } | |
1146 | |
1147 | |
1148 void GenCollectedHeap::generation_iterate(GenClosure* cl, | |
1149 bool old_to_young) { | |
1150 if (old_to_young) { | |
1151 for (int i = _n_gens-1; i >= 0; i--) { | |
1152 cl->do_generation(_gens[i]); | |
1153 } | |
1154 } else { | |
1155 for (int i = 0; i < _n_gens; i++) { | |
1156 cl->do_generation(_gens[i]); | |
1157 } | |
1158 } | |
1159 } | |
1160 | |
1161 void GenCollectedHeap::space_iterate(SpaceClosure* cl) { | |
1162 for (int i = 0; i < _n_gens; i++) { | |
1163 _gens[i]->space_iterate(cl, true); | |
1164 } | |
1165 } | |
1166 | |
1167 bool GenCollectedHeap::is_maximal_no_gc() const { | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
1168 for (int i = 0; i < _n_gens; i++) { |
0 | 1169 if (!_gens[i]->is_maximal_no_gc()) { |
1170 return false; | |
1171 } | |
1172 } | |
1173 return true; | |
1174 } | |
1175 | |
1176 void GenCollectedHeap::save_marks() { | |
1177 for (int i = 0; i < _n_gens; i++) { | |
1178 _gens[i]->save_marks(); | |
1179 } | |
1180 } | |
1181 | |
1182 GenCollectedHeap* GenCollectedHeap::heap() { | |
1183 assert(_gch != NULL, "Uninitialized access to GenCollectedHeap::heap()"); | |
1184 assert(_gch->kind() == CollectedHeap::GenCollectedHeap, "not a generational heap"); | |
1185 return _gch; | |
1186 } | |
1187 | |
1188 | |
1189 void GenCollectedHeap::prepare_for_compaction() { | |
12030
330dfb0476f4
8022800: Use specific generations rather than generation iteration
brutisso
parents:
11096
diff
changeset
|
1190 guarantee(_n_gens = 2, "Wrong number of generations"); |
330dfb0476f4
8022800: Use specific generations rather than generation iteration
brutisso
parents:
11096
diff
changeset
|
1191 Generation* old_gen = _gens[1]; |
0 | 1192 // Start by compacting into same gen. |
20295
3f2894c5052e
8048112: G1 Full GC needs to support the case when the very first region is not available
tschatzl
parents:
20278
diff
changeset
|
1193 CompactPoint cp(old_gen); |
12030
330dfb0476f4
8022800: Use specific generations rather than generation iteration
brutisso
parents:
11096
diff
changeset
|
1194 old_gen->prepare_for_compaction(&cp); |
330dfb0476f4
8022800: Use specific generations rather than generation iteration
brutisso
parents:
11096
diff
changeset
|
1195 Generation* young_gen = _gens[0]; |
330dfb0476f4
8022800: Use specific generations rather than generation iteration
brutisso
parents:
11096
diff
changeset
|
1196 young_gen->prepare_for_compaction(&cp); |
0 | 1197 } |
1198 | |
1199 GCStats* GenCollectedHeap::gc_stats(int level) const { | |
1200 return _gens[level]->gc_stats(); | |
1201 } | |
1202 | |
6008 | 1203 void GenCollectedHeap::verify(bool silent, VerifyOption option /* ignored */) { |
0 | 1204 for (int i = _n_gens-1; i >= 0; i--) { |
1205 Generation* g = _gens[i]; | |
1206 if (!silent) { | |
17937
78bbf4d43a14
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
17866
diff
changeset
|
1207 gclog_or_tty->print("%s", g->name()); |
0 | 1208 gclog_or_tty->print(" "); |
1209 } | |
6008 | 1210 g->verify(); |
0 | 1211 } |
1212 if (!silent) { | |
1213 gclog_or_tty->print("remset "); | |
1214 } | |
1215 rem_set()->verify(); | |
1216 } | |
1217 | |
1218 void GenCollectedHeap::print_on(outputStream* st) const { | |
1219 for (int i = 0; i < _n_gens; i++) { | |
1220 _gens[i]->print_on(st); | |
1221 } | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
1222 MetaspaceAux::print_on(st); |
0 | 1223 } |
1224 | |
1225 void GenCollectedHeap::gc_threads_do(ThreadClosure* tc) const { | |
1226 if (workers() != NULL) { | |
1227 workers()->threads_do(tc); | |
1228 } | |
8001
db9981fd3124
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
6865
diff
changeset
|
1229 #if INCLUDE_ALL_GCS |
0 | 1230 if (UseConcMarkSweepGC) { |
1231 ConcurrentMarkSweepThread::threads_do(tc); | |
1232 } | |
8001
db9981fd3124
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
6865
diff
changeset
|
1233 #endif // INCLUDE_ALL_GCS |
0 | 1234 } |
1235 | |
1236 void GenCollectedHeap::print_gc_threads_on(outputStream* st) const { | |
8001
db9981fd3124
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
6865
diff
changeset
|
1237 #if INCLUDE_ALL_GCS |
0 | 1238 if (UseParNewGC) { |
1239 workers()->print_worker_threads_on(st); | |
1240 } | |
1241 if (UseConcMarkSweepGC) { | |
1242 ConcurrentMarkSweepThread::print_all_on(st); | |
1243 } | |
8001
db9981fd3124
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
6865
diff
changeset
|
1244 #endif // INCLUDE_ALL_GCS |
0 | 1245 } |
1246 | |
9076
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9071
diff
changeset
|
1247 void GenCollectedHeap::print_on_error(outputStream* st) const { |
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9071
diff
changeset
|
1248 this->CollectedHeap::print_on_error(st); |
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9071
diff
changeset
|
1249 |
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9071
diff
changeset
|
1250 #if INCLUDE_ALL_GCS |
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9071
diff
changeset
|
1251 if (UseConcMarkSweepGC) { |
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9071
diff
changeset
|
1252 st->cr(); |
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9071
diff
changeset
|
1253 CMSCollector::print_on_error(st); |
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9071
diff
changeset
|
1254 } |
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9071
diff
changeset
|
1255 #endif // INCLUDE_ALL_GCS |
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9071
diff
changeset
|
1256 } |
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9071
diff
changeset
|
1257 |
0 | 1258 void GenCollectedHeap::print_tracing_info() const { |
1259 if (TraceGen0Time) { | |
1260 get_gen(0)->print_summary_info(); | |
1261 } | |
1262 if (TraceGen1Time) { | |
1263 get_gen(1)->print_summary_info(); | |
1264 } | |
1265 } | |
1266 | |
1267 void GenCollectedHeap::print_heap_change(size_t prev_used) const { | |
1268 if (PrintGCDetails && Verbose) { | |
1269 gclog_or_tty->print(" " SIZE_FORMAT | |
1270 "->" SIZE_FORMAT | |
1271 "(" SIZE_FORMAT ")", | |
1272 prev_used, used(), capacity()); | |
1273 } else { | |
1274 gclog_or_tty->print(" " SIZE_FORMAT "K" | |
1275 "->" SIZE_FORMAT "K" | |
1276 "(" SIZE_FORMAT "K)", | |
1277 prev_used / K, used() / K, capacity() / K); | |
1278 } | |
1279 } | |
1280 | |
1281 class GenGCPrologueClosure: public GenCollectedHeap::GenClosure { | |
1282 private: | |
1283 bool _full; | |
1284 public: | |
1285 void do_generation(Generation* gen) { | |
1286 gen->gc_prologue(_full); | |
1287 } | |
1288 GenGCPrologueClosure(bool full) : _full(full) {}; | |
1289 }; | |
1290 | |
1291 void GenCollectedHeap::gc_prologue(bool full) { | |
1292 assert(InlineCacheBuffer::is_empty(), "should have cleaned up ICBuffer"); | |
1293 | |
1294 always_do_update_barrier = false; | |
1295 // Fill TLAB's and such | |
1296 CollectedHeap::accumulate_statistics_all_tlabs(); | |
1297 ensure_parsability(true); // retire TLABs | |
1298 | |
1299 // Walk generations | |
1300 GenGCPrologueClosure blk(full); | |
1301 generation_iterate(&blk, false); // not old-to-young. | |
1302 }; | |
1303 | |
1304 class GenGCEpilogueClosure: public GenCollectedHeap::GenClosure { | |
1305 private: | |
1306 bool _full; | |
1307 public: | |
1308 void do_generation(Generation* gen) { | |
1309 gen->gc_epilogue(_full); | |
1310 } | |
1311 GenGCEpilogueClosure(bool full) : _full(full) {}; | |
1312 }; | |
1313 | |
1314 void GenCollectedHeap::gc_epilogue(bool full) { | |
22298 | 1315 #if defined(COMPILER2) || INCLUDE_JVMCI |
0 | 1316 assert(DerivedPointerTable::is_empty(), "derived pointer present"); |
1317 size_t actual_gap = pointer_delta((HeapWord*) (max_uintx-3), *(end_addr())); | |
1318 guarantee(actual_gap > (size_t)FastAllocateSizeLimit, "inline allocation wraps"); | |
1319 #endif /* COMPILER2 */ | |
1320 | |
1321 resize_all_tlabs(); | |
1322 | |
1323 GenGCEpilogueClosure blk(full); | |
1324 generation_iterate(&blk, false); // not old-to-young. | |
1325 | |
3799
48048b59a551
7061204: clean the chunk table synchronously in embedded builds
jcoomes
parents:
3774
diff
changeset
|
1326 if (!CleanChunkPoolAsync) { |
48048b59a551
7061204: clean the chunk table synchronously in embedded builds
jcoomes
parents:
3774
diff
changeset
|
1327 Chunk::clean_chunk_pool(); |
48048b59a551
7061204: clean the chunk table synchronously in embedded builds
jcoomes
parents:
3774
diff
changeset
|
1328 } |
48048b59a551
7061204: clean the chunk table synchronously in embedded builds
jcoomes
parents:
3774
diff
changeset
|
1329 |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
1330 MetaspaceCounters::update_performance_counters(); |
12063
1a8fb39bdbc4
8014659: NPG: performance counters for compressed klass space
ehelin
parents:
12030
diff
changeset
|
1331 CompressedClassSpaceCounters::update_performance_counters(); |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6109
diff
changeset
|
1332 |
0 | 1333 always_do_update_barrier = UseConcMarkSweepGC; |
1334 }; | |
1335 | |
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1336 #ifndef PRODUCT |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1337 class GenGCSaveTopsBeforeGCClosure: public GenCollectedHeap::GenClosure { |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1338 private: |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1339 public: |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1340 void do_generation(Generation* gen) { |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1341 gen->record_spaces_top(); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1342 } |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1343 }; |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1344 |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1345 void GenCollectedHeap::record_gen_tops_before_GC() { |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1346 if (ZapUnusedHeapArea) { |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1347 GenGCSaveTopsBeforeGCClosure blk; |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1348 generation_iterate(&blk, false); // not old-to-young. |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1349 } |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1350 } |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1351 #endif // not PRODUCT |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
1352 |
0 | 1353 class GenEnsureParsabilityClosure: public GenCollectedHeap::GenClosure { |
1354 public: | |
1355 void do_generation(Generation* gen) { | |
1356 gen->ensure_parsability(); | |
1357 } | |
1358 }; | |
1359 | |
1360 void GenCollectedHeap::ensure_parsability(bool retire_tlabs) { | |
1361 CollectedHeap::ensure_parsability(retire_tlabs); | |
1362 GenEnsureParsabilityClosure ep_cl; | |
1363 generation_iterate(&ep_cl, false); | |
1364 } | |
1365 | |
12030
330dfb0476f4
8022800: Use specific generations rather than generation iteration
brutisso
parents:
11096
diff
changeset
|
1366 oop GenCollectedHeap::handle_failed_promotion(Generation* old_gen, |
0 | 1367 oop obj, |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1368 size_t obj_size) { |
12030
330dfb0476f4
8022800: Use specific generations rather than generation iteration
brutisso
parents:
11096
diff
changeset
|
1369 guarantee(old_gen->level() == 1, "We only get here with an old generation"); |
0 | 1370 assert(obj_size == (size_t)obj->size(), "bad obj_size passed in"); |
1371 HeapWord* result = NULL; | |
1372 | |
12030
330dfb0476f4
8022800: Use specific generations rather than generation iteration
brutisso
parents:
11096
diff
changeset
|
1373 result = old_gen->expand_and_allocate(obj_size, false); |
0 | 1374 |
1375 if (result != NULL) { | |
1376 Copy::aligned_disjoint_words((HeapWord*)obj, result, obj_size); | |
1377 } | |
1378 return oop(result); | |
1379 } | |
1380 | |
1381 class GenTimeOfLastGCClosure: public GenCollectedHeap::GenClosure { | |
1382 jlong _time; // in ms | |
1383 jlong _now; // in ms | |
1384 | |
1385 public: | |
1386 GenTimeOfLastGCClosure(jlong now) : _time(now), _now(now) { } | |
1387 | |
1388 jlong time() { return _time; } | |
1389 | |
1390 void do_generation(Generation* gen) { | |
1391 _time = MIN2(_time, gen->time_of_last_gc(_now)); | |
1392 } | |
1393 }; | |
1394 | |
1395 jlong GenCollectedHeap::millis_since_last_gc() { | |
4712
e7dead7e90af
7117303: VM uses non-monotonic time source and complains that it is non-monotonic
johnc
parents:
4708
diff
changeset
|
1396 // We need a monotonically non-deccreasing time in ms but |
e7dead7e90af
7117303: VM uses non-monotonic time source and complains that it is non-monotonic
johnc
parents:
4708
diff
changeset
|
1397 // os::javaTimeMillis() does not guarantee monotonicity. |
e7dead7e90af
7117303: VM uses non-monotonic time source and complains that it is non-monotonic
johnc
parents:
4708
diff
changeset
|
1398 jlong now = os::javaTimeNanos() / NANOSECS_PER_MILLISEC; |
0 | 1399 GenTimeOfLastGCClosure tolgc_cl(now); |
1400 // iterate over generations getting the oldest | |
1401 // time that a generation was collected | |
1402 generation_iterate(&tolgc_cl, false); | |
4712
e7dead7e90af
7117303: VM uses non-monotonic time source and complains that it is non-monotonic
johnc
parents:
4708
diff
changeset
|
1403 |
e7dead7e90af
7117303: VM uses non-monotonic time source and complains that it is non-monotonic
johnc
parents:
4708
diff
changeset
|
1404 // javaTimeNanos() is guaranteed to be monotonically non-decreasing |
e7dead7e90af
7117303: VM uses non-monotonic time source and complains that it is non-monotonic
johnc
parents:
4708
diff
changeset
|
1405 // provided the underlying platform provides such a time source |
e7dead7e90af
7117303: VM uses non-monotonic time source and complains that it is non-monotonic
johnc
parents:
4708
diff
changeset
|
1406 // (and it is bug free). So we still have to guard against getting |
e7dead7e90af
7117303: VM uses non-monotonic time source and complains that it is non-monotonic
johnc
parents:
4708
diff
changeset
|
1407 // back a time later than 'now'. |
0 | 1408 jlong retVal = now - tolgc_cl.time(); |
1409 if (retVal < 0) { | |
17937
78bbf4d43a14
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
17866
diff
changeset
|
1410 NOT_PRODUCT(warning("time warp: "INT64_FORMAT, (int64_t) retVal);) |
0 | 1411 return 0; |
1412 } | |
1413 return retVal; | |
1414 } |