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