1 /*
2 * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
3 * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
5 *
6 * This code is free software; you can redistribute it and/or modify it
7 * under the terms of the GNU General Public License version 2 only, as
8 * published by the Free Software Foundation.
9 *
10 * This code is distributed in the hope that it will be useful, but WITHOUT
11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
13 * version 2 for more details (a copy is included in the LICENSE file that
14 * accompanied this code).
15 *
16 * You should have received a copy of the GNU General Public License version
17 * 2 along with this work; if not, write to the Free Software Foundation,
18 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
19 *
20 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
21 * or visit www.oracle.com if you need additional information or have any
22 * questions.
23 *
24 */
25
26 #include "gc/shenandoah/shenandoahAgeCensus.hpp"
27 #include "gc/shenandoah/shenandoahClosures.inline.hpp"
28 #include "gc/shenandoah/shenandoahCollectorPolicy.hpp"
29 #include "gc/shenandoah/shenandoahForwarding.inline.hpp"
30 #include "gc/shenandoah/shenandoahFreeSet.hpp"
31 #include "gc/shenandoah/shenandoahGeneration.hpp"
32 #include "gc/shenandoah/shenandoahGenerationalControlThread.hpp"
33 #include "gc/shenandoah/shenandoahGenerationalEvacuationTask.hpp"
34 #include "gc/shenandoah/shenandoahGenerationalHeap.hpp"
35 #include "gc/shenandoah/shenandoahHeap.inline.hpp"
36 #include "gc/shenandoah/shenandoahHeapRegion.hpp"
37 #include "gc/shenandoah/shenandoahHeapRegionClosures.hpp"
38 #include "gc/shenandoah/shenandoahInitLogger.hpp"
39 #include "gc/shenandoah/shenandoahMemoryPool.hpp"
40 #include "gc/shenandoah/shenandoahMonitoringSupport.hpp"
41 #include "gc/shenandoah/shenandoahOldGeneration.hpp"
42 #include "gc/shenandoah/shenandoahPhaseTimings.hpp"
43 #include "gc/shenandoah/shenandoahRegulatorThread.hpp"
44 #include "gc/shenandoah/shenandoahScanRemembered.inline.hpp"
45 #include "gc/shenandoah/shenandoahUtils.hpp"
46 #include "gc/shenandoah/shenandoahWorkerPolicy.hpp"
47 #include "gc/shenandoah/shenandoahYoungGeneration.hpp"
48 #include "logging/log.hpp"
49 #include "utilities/events.hpp"
50
51
52 class ShenandoahGenerationalInitLogger : public ShenandoahInitLogger {
53 public:
54 static void print() {
55 ShenandoahGenerationalInitLogger logger;
56 logger.print_all();
57 }
58 protected:
59 void print_gc_specific() override {
60 ShenandoahInitLogger::print_gc_specific();
61
62 ShenandoahGenerationalHeap* heap = ShenandoahGenerationalHeap::heap();
63 log_info(gc, init)("Young Heuristics: %s", heap->young_generation()->heuristics()->name());
64 log_info(gc, init)("Old Heuristics: %s", heap->old_generation()->heuristics()->name());
65 }
66 };
67
68 size_t ShenandoahGenerationalHeap::calculate_min_plab() {
69 return PLAB::min_size();
70 }
71
72 size_t ShenandoahGenerationalHeap::calculate_max_plab() {
73 return ShenandoahHeapRegion::max_tlab_size_words();
74 }
75
76 // Returns size in bytes
77 size_t ShenandoahGenerationalHeap::unsafe_max_tlab_alloc() const {
78 return MIN2(ShenandoahHeapRegion::max_tlab_size_bytes(), young_generation()->available());
79 }
80
81 ShenandoahGenerationalHeap::ShenandoahGenerationalHeap(ShenandoahCollectorPolicy* policy) :
82 ShenandoahHeap(policy),
83 _age_census(nullptr),
84 _min_plab_size(calculate_min_plab()),
85 _max_plab_size(calculate_max_plab()),
86 _regulator_thread(nullptr),
87 _young_gen_memory_pool(nullptr),
88 _old_gen_memory_pool(nullptr) {
89 }
90
91 void ShenandoahGenerationalHeap::initialize_generations() {
92 ShenandoahHeap::initialize_generations();
93 _young_generation->post_initialize(this);
94 _old_generation->post_initialize(this);
95 }
96
97 void ShenandoahGenerationalHeap::post_initialize() {
98 ShenandoahHeap::post_initialize();
99 _age_census = new ShenandoahAgeCensus();
100 }
101
102 void ShenandoahGenerationalHeap::post_initialize_heuristics() {
103 ShenandoahHeap::post_initialize_heuristics();
104 _young_generation->post_initialize_heuristics();
105 _old_generation->post_initialize_heuristics();
106 }
107
108 void ShenandoahGenerationalHeap::print_init_logger() const {
109 ShenandoahGenerationalInitLogger logger;
110 logger.print_all();
111 }
112
113 void ShenandoahGenerationalHeap::initialize_heuristics() {
114 // Initialize global generation and heuristics even in generational mode.
115 ShenandoahHeap::initialize_heuristics();
116
117 _young_generation = new ShenandoahYoungGeneration(max_workers());
118 _old_generation = new ShenandoahOldGeneration(max_workers());
119 _young_generation->initialize_heuristics(mode());
120 _old_generation->initialize_heuristics(mode());
121 }
122
123 void ShenandoahGenerationalHeap::initialize_serviceability() {
124 assert(mode()->is_generational(), "Only for the generational mode");
125 _young_gen_memory_pool = new ShenandoahYoungGenMemoryPool(this);
126 _old_gen_memory_pool = new ShenandoahOldGenMemoryPool(this);
127 cycle_memory_manager()->add_pool(_young_gen_memory_pool);
128 cycle_memory_manager()->add_pool(_old_gen_memory_pool);
129 stw_memory_manager()->add_pool(_young_gen_memory_pool);
130 stw_memory_manager()->add_pool(_old_gen_memory_pool);
131 }
132
133 GrowableArray<MemoryPool*> ShenandoahGenerationalHeap::memory_pools() {
134 assert(mode()->is_generational(), "Only for the generational mode");
135 GrowableArray<MemoryPool*> memory_pools(2);
136 memory_pools.append(_young_gen_memory_pool);
137 memory_pools.append(_old_gen_memory_pool);
138 return memory_pools;
139 }
140
141 void ShenandoahGenerationalHeap::initialize_controller() {
142 auto control_thread = new ShenandoahGenerationalControlThread();
143 _control_thread = control_thread;
144 _regulator_thread = new ShenandoahRegulatorThread(control_thread);
145 }
146
147 void ShenandoahGenerationalHeap::gc_threads_do(ThreadClosure* tcl) const {
148 if (!shenandoah_policy()->is_at_shutdown()) {
149 ShenandoahHeap::gc_threads_do(tcl);
150 tcl->do_thread(regulator_thread());
151 }
152 }
153
154 void ShenandoahGenerationalHeap::stop() {
155 ShenandoahHeap::stop();
156 regulator_thread()->stop();
157 }
158
159 void ShenandoahGenerationalHeap::start_idle_span() {
160 young_generation()->heuristics()->start_idle_span();
161 }
162
163 bool ShenandoahGenerationalHeap::requires_barriers(stackChunkOop obj) const {
164 if (is_idle()) {
165 return false;
166 }
167
168 if (is_concurrent_young_mark_in_progress() && is_in_young(obj) && !marking_context()->allocated_after_mark_start(obj)) {
169 // We are marking young, this object is in young, and it is below the TAMS
170 return true;
171 }
172
173 if (is_in_old(obj)) {
174 // Card marking barriers are required for objects in the old generation
175 return true;
176 }
177
178 if (has_forwarded_objects()) {
179 // Object may have pointers that need to be updated
180 return true;
181 }
182
183 return false;
184 }
185
186 void ShenandoahGenerationalHeap::evacuate_collection_set(ShenandoahGeneration* generation, bool concurrent) {
187 ShenandoahRegionIterator regions;
188 ShenandoahGenerationalEvacuationTask task(this, generation, ®ions, concurrent, false /* only promote regions */);
189 workers()->run_task(&task);
190 }
191
192 void ShenandoahGenerationalHeap::promote_regions_in_place(ShenandoahGeneration* generation, bool concurrent) {
193 ShenandoahRegionIterator regions;
194 ShenandoahGenerationalEvacuationTask task(this, generation, ®ions, concurrent, true /* only promote regions */);
195 workers()->run_task(&task);
196 }
197
198 oop ShenandoahGenerationalHeap::evacuate_object(oop p, Thread* thread) {
199 assert(thread == Thread::current(), "Expected thread parameter to be current thread.");
200
201 ShenandoahHeapRegion* from_region = heap_region_containing(p);
202 assert(!from_region->is_humongous(), "never evacuate humongous objects");
203
204 // Try to keep the object in the same generation
205 const ShenandoahAffiliation target_gen = from_region->affiliation();
206
207 if (target_gen == YOUNG_GENERATION) {
208 markWord mark = p->mark();
209 if (mark.is_marked()) {
210 // Already forwarded.
211 return ShenandoahForwarding::get_forwardee(p);
212 }
213
214 if (age_census()->is_tenurable(from_region->age() + mark.age())) {
215 // If the object is tenurable, try to promote it
216 oop result = try_evacuate_object<YOUNG_GENERATION, OLD_GENERATION>(p, thread, from_region->age());
217
218 // If we failed to promote this aged object, we'll fall through to code below and evacuate to young-gen.
219 if (result != nullptr) {
220 return result;
221 }
222 }
223 return try_evacuate_object<YOUNG_GENERATION, YOUNG_GENERATION>(p, thread, from_region->age());
224 }
225
226 assert(target_gen == OLD_GENERATION, "Expected evacuation to old");
227 return try_evacuate_object<OLD_GENERATION, OLD_GENERATION>(p, thread, from_region->age());
228 }
229
230 // try_evacuate_object registers the object and dirties the associated remembered set information when evacuating
231 // to OLD_GENERATION.
232 template<ShenandoahAffiliation FROM_GENERATION, ShenandoahAffiliation TO_GENERATION>
233 oop ShenandoahGenerationalHeap::try_evacuate_object(oop p, Thread* thread, uint from_region_age) {
234 bool alloc_from_lab = true;
235 bool has_plab = false;
236 HeapWord* copy = nullptr;
237 size_t size = ShenandoahForwarding::size(p);
238 constexpr bool is_promotion = (TO_GENERATION == OLD_GENERATION) && (FROM_GENERATION == YOUNG_GENERATION);
239
240 #ifdef ASSERT
241 if (ShenandoahOOMDuringEvacALot &&
242 (os::random() & 1) == 0) { // Simulate OOM every ~2nd slow-path call
243 copy = nullptr;
244 } else {
245 #endif
246 if (UseTLAB) {
247 switch (TO_GENERATION) {
248 case YOUNG_GENERATION: {
249 copy = allocate_from_gclab(thread, size);
250 if ((copy == nullptr) && (size < ShenandoahThreadLocalData::gclab_size(thread))) {
251 // GCLAB allocation failed because we are bumping up against the limit on young evacuation reserve. Try resetting
252 // the desired GCLAB size and retry GCLAB allocation to avoid cascading of shared memory allocations.
253 ShenandoahThreadLocalData::set_gclab_size(thread, PLAB::min_size());
254 copy = allocate_from_gclab(thread, size);
255 // If we still get nullptr, we'll try a shared allocation below.
256 }
257 break;
258 }
259 case OLD_GENERATION: {
260 ShenandoahPLAB* shenandoah_plab = ShenandoahThreadLocalData::shenandoah_plab(thread);
261 if (shenandoah_plab != nullptr) {
262 has_plab = true;
263 copy = shenandoah_plab->allocate(size, is_promotion);
264 if (copy == nullptr && size < shenandoah_plab->desired_size() && shenandoah_plab->retries_enabled()) {
265 // PLAB allocation failed because we are bumping up against the limit on old evacuation reserve or because
266 // the requested object does not fit within the current plab but the plab still has an "abundance" of memory,
267 // where abundance is defined as >= ShenGenHeap::plab_min_size(). In the former case, we try shrinking the
268 // desired PLAB size to the minimum and retry PLAB allocation to avoid cascading of shared memory allocations.
269 // Shrinking the desired PLAB size may allow us to eke out a small PLAB while staying beneath evacuation reserve.
270 if (shenandoah_plab->plab()->words_remaining() < plab_min_size()) {
271 shenandoah_plab->set_desired_size(plab_min_size());
272 copy = shenandoah_plab->allocate(size, is_promotion);
273 if (copy == nullptr) {
274 // If we still get nullptr, we'll try a shared allocation below.
275 // However, don't continue to retry until we have success (probably in next GC pass)
276 shenandoah_plab->disable_retries();
277 }
278 }
279 }
280 }
281 break;
282 }
283 default: {
284 ShouldNotReachHere();
285 break;
286 }
287 }
288 }
289
290 if (copy == nullptr) {
291 // If we failed to allocate in LAB, we'll try a shared allocation.
292 if (!is_promotion || !has_plab || (size > PLAB::min_size())) {
293 ShenandoahAllocRequest req = ShenandoahAllocRequest::for_shared_gc(size, TO_GENERATION, is_promotion);
294 copy = allocate_memory(req);
295 alloc_from_lab = false;
296 }
297 // else, we leave copy equal to nullptr, signaling a promotion failure below if appropriate.
298 // We choose not to promote objects smaller than size_threshold by way of shared allocations as this is too
299 // costly. Instead, we'll simply "evacuate" to young-gen memory (using a GCLAB) and will promote in a future
300 // evacuation pass. This condition is denoted by: is_promotion && has_plab && (size <= size_threshhold).
301 }
302 #ifdef ASSERT
303 }
304 #endif
305
306 if (copy == nullptr) {
307 if (TO_GENERATION == OLD_GENERATION) {
308 if (FROM_GENERATION == YOUNG_GENERATION) {
309 // Signal that promotion failed. Will evacuate this old object somewhere in young gen.
310 old_generation()->handle_failed_promotion(thread, size);
311 return nullptr;
312 } else {
313 // Remember that evacuation to old gen failed. We'll want to trigger a full gc to recover from this
314 // after the evacuation threads have finished.
315 old_generation()->handle_failed_evacuation();
316 }
317 }
318
319 control_thread()->handle_alloc_failure_evac(size);
320
321 // Install the self-forwarded bit so other evacuators/LRBs see the
322 // object as "already handled, do not try to evacuate". The CAS may
323 // fail if another thread concurrently installed a real forwardee or
324 // self-forwarded first.
325 markWord old_mark = p->mark();
326 if (old_mark.is_forwarded()) {
327 return ShenandoahForwarding::get_forwardee(p);
328 }
329 oop winner = ShenandoahForwarding::try_forward_to_self(p, old_mark);
330 if (winner == nullptr) {
331 // We own the self-forwarding. Flag the from-region so the degen/full
332 // GC entry drain knows to scan it for self_fwd bits to clear.
333 heap_region_containing(p)->set_has_self_forwards();
334 return p;
335 }
336 return winner;
337 }
338
339 if (ShenandoahEvacTracking) {
340 evac_tracker()->begin_evacuation(thread, size * HeapWordSize, FROM_GENERATION, TO_GENERATION);
341 }
342
343 // Copy the object:
344 Copy::aligned_disjoint_words(cast_from_oop<HeapWord*>(p), copy, size);
345 oop copy_val = cast_to_oop(copy);
346
347 // Update the age of the evacuated object
348 if (TO_GENERATION == YOUNG_GENERATION) {
349 increase_object_age(copy_val, from_region_age + 1);
350 }
351
352 // Relativize stack chunks before publishing the copy. After the forwarding CAS,
353 // mutators can see the copy and thaw it via the fast path if flags == 0. We must
354 // relativize derived pointers and set gc_mode before that happens. Skip if the
355 // copy's mark word is already a forwarding pointer (another thread won the race
356 // and overwrote the original's header before we copied it).
357 if (!ShenandoahForwarding::is_forwarded(copy_val)) {
358 ContinuationGCSupport::relativize_stack_chunk(copy_val);
359 }
360
361 // Try to install the new forwarding pointer.
362 oop result = ShenandoahForwarding::try_update_forwardee(p, copy_val);
363 if (result == copy_val) {
364 // Successfully evacuated. Our copy is now the public one!
365 if (ShenandoahEvacTracking) {
366 // Record that the evacuation succeeded
367 evac_tracker()->end_evacuation(thread, size * HeapWordSize, FROM_GENERATION, TO_GENERATION);
368 }
369 } else {
370 // Failed to evacuate. We need to deal with the object that is left behind. Since this
371 // new allocation is certainly after TAMS, it will be considered live in the next cycle.
372 // But if it happens to contain references to evacuated regions, those references would
373 // not get updated for this stale copy during this cycle, and we will crash while scanning
374 // it the next cycle.
375 if (alloc_from_lab) {
376 // For LAB allocations, it is enough to rollback the allocation ptr. Either the next
377 // object will overwrite this stale copy, or the filler object on LAB retirement will
378 // do this.
379 switch (TO_GENERATION) {
380 case YOUNG_GENERATION: {
381 ShenandoahThreadLocalData::gclab(thread)->undo_allocation(copy, size);
382 break;
383 }
384 case OLD_GENERATION: {
385 ShenandoahThreadLocalData::shenandoah_plab(thread)->plab()->undo_allocation(copy, size);
386 if (is_promotion) {
387 ShenandoahThreadLocalData::shenandoah_plab(thread)->subtract_from_promoted(size * HeapWordSize);
388 }
389 break;
390 }
391 default: {
392 ShouldNotReachHere();
393 break;
394 }
395 }
396 } else {
397 // For non-LAB allocations, we have no way to retract the allocation, and
398 // have to explicitly overwrite the copy with the filler object. With that overwrite,
399 // we have to keep the fwdptr initialized and pointing to our (stale) copy.
400 assert(size >= ShenandoahHeap::min_fill_size(), "previously allocated object known to be larger than min_size");
401 fill_with_object(copy, size);
402 }
403 }
404 shenandoah_assert_correct(nullptr, result);
405 return result;
406 }
407
408 template oop ShenandoahGenerationalHeap::try_evacuate_object<YOUNG_GENERATION, YOUNG_GENERATION>(oop p, Thread* thread, uint from_region_age);
409 template oop ShenandoahGenerationalHeap::try_evacuate_object<YOUNG_GENERATION, OLD_GENERATION>(oop p, Thread* thread, uint from_region_age);
410 template oop ShenandoahGenerationalHeap::try_evacuate_object<OLD_GENERATION, OLD_GENERATION>(oop p, Thread* thread, uint from_region_age);
411
412 // Call this function at the end of a GC cycle in order to establish proper sizes of young and old reserves,
413 // setting the old-generation balance so that GC can perform the anticipated evacuations.
414 //
415 // Make sure old-generation is large enough, but no larger than is necessary, to hold mixed evacuations
416 // and promotions, if we anticipate either. Any deficit is provided by the young generation, subject to
417 // mutator_xfer_limit, and any surplus is transferred to the young generation. mutator_xfer_limit is
418 // the maximum we're able to transfer from young to old. The mutator_xfer_limit constrains the transfer
419 // of memory from young to old. It does not limit young reserves.
420 void ShenandoahGenerationalHeap::compute_old_generation_balance(size_t mutator_xfer_limit,
421 size_t old_trashed_regions, size_t young_trashed_regions) {
422 shenandoah_assert_heaplocked();
423 // We can limit the old reserve to the size of anticipated promotions:
424 // max_old_reserve is an upper bound on memory evacuated from old and promoted to old,
425 // clamped by the old generation space available.
426 //
427 // Here's the algebra.
428 // Let SOEP = ShenandoahOldEvacPercent,
429 // OE = old evac,
430 // YE = young evac, and
431 // TE = total evac = OE + YE
432 // By definition:
433 // SOEP/100 = OE/TE
434 // = OE/(OE+YE)
435 // => SOEP/(100-SOEP) = OE/((OE+YE)-OE) // componendo-dividendo: If a/b = c/d, then a/(b-a) = c/(d-c)
436 // = OE/YE
437 // => OE = YE*SOEP/(100-SOEP)
438
439 // We have to be careful in the event that SOEP is set to 100 by the user.
440 assert(ShenandoahOldEvacPercent <= 100, "Error");
441 const size_t region_size_bytes = ShenandoahHeapRegion::region_size_bytes();
442
443 ShenandoahOldGeneration* old_gen = old_generation();
444 size_t old_capacity = old_gen->max_capacity();
445 size_t old_usage = old_gen->used(); // includes humongous waste
446 size_t old_currently_available =
447 ((old_capacity >= old_usage)? old_capacity - old_usage: 0) + old_trashed_regions * region_size_bytes;
448
449 ShenandoahYoungGeneration* young_gen = young_generation();
450 size_t young_capacity = young_gen->max_capacity();
451 size_t young_usage = young_gen->used(); // includes humongous waste
452 size_t young_available = ((young_capacity >= young_usage)? young_capacity - young_usage: 0);
453 size_t freeset_available = free_set()->available_locked();
454 if (young_available > freeset_available) {
455 young_available = freeset_available;
456 }
457 young_available += young_trashed_regions * region_size_bytes;
458
459 // The free set will reserve this amount of memory to hold young evacuations (initialized to the ideal reserve)
460 size_t young_reserve = (young_generation()->max_capacity() * ShenandoahEvacReserve) / 100;
461
462 // If ShenandoahOldEvacPercent equals 100, max_old_reserve is limited only by mutator_xfer_limit and young_reserve
463 const size_t bound_on_old_reserve =
464 ((old_currently_available + mutator_xfer_limit + young_reserve) * ShenandoahOldEvacPercent) / 100;
465 size_t proposed_max_old = ((ShenandoahOldEvacPercent == 100)?
466 bound_on_old_reserve:
467 MIN2((young_reserve * ShenandoahOldEvacPercent) / (100 - ShenandoahOldEvacPercent),
468 bound_on_old_reserve));
469 assert(mutator_xfer_limit <= young_available,
470 "Cannot transfer (%zu) memory that is not available (%zu)", mutator_xfer_limit, young_available);
471
472 if (young_reserve > young_available) {
473 young_reserve = young_available;
474 }
475 // We allow young_reserve to exceed mutator_xfer_limit. Essentially, this means the GC is already behind the pace
476 // of mutator allocations, and we'll need to trigger the next GC as soon as possible.
477 if (mutator_xfer_limit > young_reserve) {
478 mutator_xfer_limit -= young_reserve;
479 } else {
480 mutator_xfer_limit = 0;
481 }
482
483 // Decide how much old space we should reserve for a mixed collection
484 size_t proposed_reserve_for_mixed = 0;
485 const size_t old_fragmented_available =
486 old_currently_available - (old_generation()->free_unaffiliated_regions() + old_trashed_regions) * region_size_bytes;
487
488 if (old_fragmented_available > proposed_max_old) {
489 // In this case, the old_fragmented_available is greater than the desired amount of evacuation to old.
490 // We'll use all of this memory to hold results of old evacuation, and we'll give back to the young generation
491 // any old regions that are not fragmented.
492 //
493 // This scenario may happen after we have promoted many regions in place, and each of these regions had non-zero
494 // unused memory, so there is now an abundance of old-fragmented available memory, even more than the desired
495 // percentage for old reserve. We cannot transfer these fragmented regions back to young. Instead we make the
496 // best of the situation by using this fragmented memory for both promotions and evacuations.
497
498 proposed_max_old = old_fragmented_available;
499 }
500 // Otherwise: old_fragmented_available <= proposed_max_old. Do not shrink proposed_max_old from the original computation.
501
502 // Though we initially set proposed_reserve_for_promo to equal the entirety of old fragmented available, we have the
503 // opportunity below to shift some of this memory into the proposed_reserve_for_mixed.
504 size_t proposed_reserve_for_promo = old_fragmented_available;
505 const size_t max_old_reserve = proposed_max_old;
506
507 const size_t mixed_candidate_live_memory = old_generation()->unprocessed_collection_candidates_live_memory();
508 const bool doing_mixed = (mixed_candidate_live_memory > 0);
509 if (doing_mixed) {
510 // In the ideal, all of the memory reserved for mixed evacuation would be unfragmented, but we don't enforce
511 // this. Note that the initial value of max_evac_need is conservative because we may not evacuate all of the
512 // remaining mixed evacuation candidates in a single cycle.
513 const size_t max_evac_need = (size_t) (mixed_candidate_live_memory * ShenandoahOldEvacWaste);
514 assert(old_currently_available >= old_generation()->free_unaffiliated_regions() * region_size_bytes,
515 "Unaffiliated available must be less than total available");
516
517 // We prefer to evacuate all of mixed into unfragmented memory, and will expand old in order to do so, unless
518 // we already have too much fragmented available memory in old.
519 proposed_reserve_for_mixed = max_evac_need;
520 if (proposed_reserve_for_mixed + proposed_reserve_for_promo > max_old_reserve) {
521 // We're trying to reserve more memory than is available. So we need to shrink our reserves.
522 size_t excess_reserves = (proposed_reserve_for_mixed + proposed_reserve_for_promo) - max_old_reserve;
523 // We need to shrink reserves by excess_reserves. We prefer to shrink by reducing promotion, giving priority to mixed
524 // evacuation. If the promotion reserve is larger than the amount we need to shrink by, do all the shrinkage there.
525 if (proposed_reserve_for_promo > excess_reserves) {
526 proposed_reserve_for_promo -= excess_reserves;
527 } else {
528 // Otherwise, we'll shrink promotion reserve to zero and we'll shrink the mixed-evac reserve by the remaining excess.
529 excess_reserves -= proposed_reserve_for_promo;
530 proposed_reserve_for_promo = 0;
531 proposed_reserve_for_mixed -= excess_reserves;
532 }
533 }
534 }
535 assert(proposed_reserve_for_mixed + proposed_reserve_for_promo <= max_old_reserve,
536 "Reserve for mixed (%zu) plus reserve for promotions (%zu) must be less than maximum old reserve (%zu)",
537 proposed_reserve_for_mixed, proposed_reserve_for_promo, max_old_reserve);
538
539 // Decide how much additional space we should reserve for promotions from young. We give priority to mixed evacations
540 // over promotions.
541 const size_t promo_load = old_generation()->get_promotion_potential();
542 const bool doing_promotions = promo_load > 0;
543
544 // promo_load represents the combined total of live memory within regions that have reached tenure age. The true
545 // promotion potential is larger than this, because individual objects within regions that have not yet reached tenure
546 // age may be promotable. On the other hand, some of the objects that we intend to promote in the next GC cycle may
547 // die before they are next marked. In the future, the promo_load will include the total size of tenurable objects
548 // residing in regions that have not yet reached tenure age.
549
550 if (doing_promotions) {
551 // We are always doing promotions, even when old_generation->get_promotion_potential() returns 0. As currently implemented,
552 // get_promotion_potential() only knows the total live memory contained within young-generation regions whose age is
553 // tenurable. It does not know whether that memory will still be live at the end of the next mark cycle, and it doesn't
554 // know how much memory is contained within objects whose individual ages are tenurable, which reside in regions with
555 // non-tenurable age. We use this, as adjusted by ShenandoahPromoEvacWaste, as an approximation of the total amount of
556 // memory to be promoted. In the near future, we expect to implement a change that will allow get_promotion_potential()
557 // to account also for the total memory contained within individual objects that are tenure-ready even when they do
558 // not reside in aged regions. This will represent a conservative over approximation of promotable memory because
559 // some of these objects may die before the next GC cycle executes.
560
561 // Be careful not to ask for too much promotion reserves. We have observed jtreg test failures under which a greedy
562 // promotion reserve causes a humongous allocation which is awaiting a full GC to fail (specifically
563 // gc/TestAllocHumongousFragment.java). This happens if too much of the memory reclaimed by the full GC
564 // is immediately reserved so that it cannot be allocated by the waiting mutator. It's not clear that this
565 // particular test is representative of the needs of typical GenShen users. It is really a test of high frequency
566 // Full GCs under heap fragmentation stress.
567
568 size_t promo_need = (size_t) (promo_load * ShenandoahPromoEvacWaste);
569 if (promo_need > proposed_reserve_for_promo) {
570 const size_t available_for_additional_promotions =
571 max_old_reserve - (proposed_reserve_for_mixed + proposed_reserve_for_promo);
572 if (proposed_reserve_for_promo + available_for_additional_promotions >= promo_need) {
573 proposed_reserve_for_promo = promo_need;
574 } else {
575 proposed_reserve_for_promo += available_for_additional_promotions;
576 }
577 }
578 }
579 // else, leave proposed_reserve_for_promo as is. By default, it is initialized to represent old_fragmented_available.
580
581 // This is the total old we want to reserve (initialized to the ideal reserve)
582 size_t proposed_old_reserve = proposed_reserve_for_mixed + proposed_reserve_for_promo;
583
584 // We now check if the old generation is running a surplus or a deficit.
585 size_t old_region_deficit = 0;
586 size_t old_region_surplus = 0;
587
588 size_t mutator_region_xfer_limit = mutator_xfer_limit / region_size_bytes;
589 // align the mutator_xfer_limit on region size
590 mutator_xfer_limit = mutator_region_xfer_limit * region_size_bytes;
591
592 if (old_currently_available >= proposed_old_reserve) {
593 // We are running a surplus, so the old region surplus can go to young
594 const size_t old_surplus = old_currently_available - proposed_old_reserve;
595 old_region_surplus = old_surplus / region_size_bytes;
596 const size_t unaffiliated_old_regions = old_generation()->free_unaffiliated_regions() + old_trashed_regions;
597 old_region_surplus = MIN2(old_region_surplus, unaffiliated_old_regions);
598 old_generation()->set_region_balance(checked_cast<ssize_t>(old_region_surplus));
599 old_currently_available -= old_region_surplus * region_size_bytes;
600 young_available += old_region_surplus * region_size_bytes;
601 } else if (old_currently_available + mutator_xfer_limit >= proposed_old_reserve) {
602 // We know that old_currently_available < proposed_old_reserve because above test failed. Expand old_currently_available.
603 // Mutator's xfer limit is sufficient to satisfy our need: transfer all memory from there.
604 size_t old_deficit = proposed_old_reserve - old_currently_available;
605 old_region_deficit = (old_deficit + region_size_bytes - 1) / region_size_bytes;
606 old_generation()->set_region_balance(0 - checked_cast<ssize_t>(old_region_deficit));
607 old_currently_available += old_region_deficit * region_size_bytes;
608 young_available -= old_region_deficit * region_size_bytes;
609 } else {
610 // We know that (old_currently_available < proposed_old_reserve) and
611 // (old_currently_available + mutator_xfer_limit < proposed_old_reserve) because above tests failed.
612 // We need to shrink proposed_old_reserves.
613
614 // We could potentially shrink young_reserves in order to further expand proposed_old_reserves. Let's not bother. The
615 // important thing is that we keep a total amount of memory in reserve in preparation for the next GC cycle. At
616 // the time we choose the next collection set, we'll have an opportunity to shift some of these young reserves
617 // into old reserves if that makes sense.
618
619 // Start by taking all of mutator_xfer_limit into old_currently_available.
620 size_t old_region_deficit = mutator_region_xfer_limit;
621 old_generation()->set_region_balance(0 - checked_cast<ssize_t>(old_region_deficit));
622 old_currently_available += old_region_deficit * region_size_bytes;
623 young_available -= old_region_deficit * region_size_bytes;
624
625 assert(old_currently_available < proposed_old_reserve,
626 "Old currently available (%zu) must be less than old reserve (%zu)", old_currently_available, proposed_old_reserve);
627
628 // There's not enough memory to satisfy our desire. Scale back our old-gen intentions. We prefer to satisfy
629 // the budget_overrun entirely from the promotion reserve, if that is large enough. Otherwise, we'll satisfy
630 // the overrun from a combination of promotion and mixed-evacuation reserves.
631 size_t budget_overrun = proposed_old_reserve - old_currently_available;
632 if (proposed_reserve_for_promo > budget_overrun) {
633 proposed_reserve_for_promo -= budget_overrun;
634 // Dead code:
635 // proposed_old_reserve -= budget_overrun;
636 } else {
637 budget_overrun -= proposed_reserve_for_promo;
638 proposed_reserve_for_promo = 0;
639 proposed_reserve_for_mixed = (proposed_reserve_for_mixed > budget_overrun)? proposed_reserve_for_mixed - budget_overrun: 0;
640 // Dead code:
641 // Note: proposed_reserve_for_promo is 0 and proposed_reserve_for_mixed may equal 0.
642 // proposed_old_reserve = proposed_reserve_for_mixed;
643 }
644 }
645
646 assert(old_region_deficit == 0 || old_region_surplus == 0,
647 "Only surplus (%zu) or deficit (%zu), never both", old_region_surplus, old_region_deficit);
648 assert(young_reserve + proposed_reserve_for_mixed + proposed_reserve_for_promo <= old_currently_available + young_available,
649 "Cannot reserve more memory than is available: %zu + %zu + %zu <= %zu + %zu",
650 young_reserve, proposed_reserve_for_mixed, proposed_reserve_for_promo, old_currently_available, young_available);
651
652 // deficit/surplus adjustments to generation sizes will precede rebuild
653 young_generation()->set_evacuation_reserve(young_reserve);
654 old_generation()->set_evacuation_reserve(proposed_reserve_for_mixed);
655 old_generation()->set_promoted_reserve(proposed_reserve_for_promo);
656 }
657
658 void ShenandoahGenerationalHeap::coalesce_and_fill_old_regions(bool concurrent) {
659 class ShenandoahGlobalCoalesceAndFill : public WorkerTask {
660 private:
661 ShenandoahPhaseTimings::Phase _phase;
662 ShenandoahRegionIterator _regions;
663 public:
664 explicit ShenandoahGlobalCoalesceAndFill(ShenandoahPhaseTimings::Phase phase) :
665 WorkerTask("Shenandoah Global Coalesce"),
666 _phase(phase) {}
667
668 void work(uint worker_id) override {
669 ShenandoahWorkerTimingsTracker timer(_phase,
670 ShenandoahPhaseTimings::Work,
671 worker_id, true);
672 ShenandoahHeapRegion* region;
673 while ((region = _regions.next()) != nullptr) {
674 // old region is not in the collection set and was not immediately trashed
675 if (region->is_old() && region->is_active() && !region->is_humongous()) {
676 // Reset the coalesce and fill boundary because this is a global collect
677 // and cannot be preempted by young collects. We want to be sure the entire
678 // region is coalesced here and does not resume from a previously interrupted
679 // or completed coalescing.
680 region->begin_preemptible_coalesce_and_fill();
681 region->oop_coalesce_and_fill(false);
682 }
683 }
684 }
685 };
686
687 ShenandoahPhaseTimings::Phase phase = concurrent ?
688 ShenandoahPhaseTimings::conc_coalesce_and_fill :
689 ShenandoahPhaseTimings::degen_gc_coalesce_and_fill;
690
691 // This is not cancellable
692 ShenandoahGlobalCoalesceAndFill coalesce(phase);
693 workers()->run_task(&coalesce);
694 old_generation()->set_parsable(true);
695 }
696
697 template<bool CONCURRENT>
698 class ShenandoahGenerationalUpdateHeapRefsTask : public WorkerTask {
699 private:
700 // For update refs, _generation will be young or global. Mixed collections use the young generation.
701 ShenandoahGeneration* _generation;
702 ShenandoahGenerationalHeap* _heap;
703 ShenandoahRegionIterator* _regions;
704 ShenandoahRegionChunkIterator* _work_chunks;
705
706 public:
707 ShenandoahGenerationalUpdateHeapRefsTask(ShenandoahGeneration* generation,
708 ShenandoahRegionIterator* regions,
709 ShenandoahRegionChunkIterator* work_chunks) :
710 WorkerTask("Shenandoah Update References"),
711 _generation(generation),
712 _heap(ShenandoahGenerationalHeap::heap()),
713 _regions(regions),
714 _work_chunks(work_chunks)
715 {
716 const bool old_bitmap_stable = _heap->old_generation()->is_mark_complete();
717 log_debug(gc, remset)("Update refs, scan remembered set using bitmap: %s", BOOL_TO_STR(old_bitmap_stable));
718 }
719
720 void work(uint worker_id) override {
721 if (CONCURRENT) {
722 ShenandoahWorkerTimingsTracker timer(ShenandoahPhaseTimings::conc_update_refs, ShenandoahPhaseTimings::Work, worker_id, true);
723 ShenandoahConcurrentWorkerSession worker_session(worker_id);
724 SuspendibleThreadSetJoiner stsj;
725 do_work<ShenandoahConcUpdateRefsClosure>(worker_id);
726 } else {
727 ShenandoahWorkerTimingsTracker timer(ShenandoahPhaseTimings::degen_gc_update_refs, ShenandoahPhaseTimings::Work, worker_id, true);
728 ShenandoahParallelWorkerSession worker_session(worker_id);
729 do_work<ShenandoahNonConcUpdateRefsClosure>(worker_id);
730 }
731 }
732
733 private:
734 template<class T>
735 void do_work(uint worker_id) {
736 T cl;
737
738 if (CONCURRENT && (worker_id == 0)) {
739 // We ask the first worker to replenish the Mutator free set by moving regions previously reserved to hold the
740 // results of evacuation. These reserves are no longer necessary because evacuation has completed.
741 size_t cset_regions = _heap->collection_set()->count();
742
743 // Now that evacuation is done, we can reassign any regions that had been reserved to hold the results of evacuation
744 // to the mutator free set. At the end of GC, we will have cset_regions newly evacuated fully empty regions from
745 // which we will be able to replenish the Collector free set and the OldCollector free set in preparation for the
746 // next GC cycle.
747 _heap->free_set()->move_regions_from_collector_to_mutator(cset_regions);
748 }
749 // If !CONCURRENT, there's no value in expanding Mutator free set
750
751 ShenandoahHeapRegion* r = _regions->next();
752 // We update references for global, mixed, and young collections.
753 assert(_generation->is_mark_complete(), "Expected complete marking");
754 ShenandoahMarkingContext* const ctx = _heap->marking_context();
755 bool is_mixed = _heap->collection_set()->has_old_regions();
756 while (r != nullptr) {
757 HeapWord* update_watermark = r->get_update_watermark();
758 assert(update_watermark >= r->bottom(), "sanity");
759
760 log_debug(gc)("Update refs worker " UINT32_FORMAT ", looking at region %zu", worker_id, r->index());
761 if (r->is_active() && !r->is_cset()) {
762 if (r->is_young()) {
763 _heap->marked_object_oop_iterate(r, &cl, update_watermark);
764 } else if (r->is_old()) {
765 if (_generation->is_global()) {
766
767 _heap->marked_object_oop_iterate(r, &cl, update_watermark);
768 }
769 // Otherwise, this is an old region in a young or mixed cycle. Process it during a second phase, below.
770 } else {
771 // Because updating of references runs concurrently, it is possible that a FREE inactive region transitions
772 // to a non-free active region while this loop is executing. Whenever this happens, the changing of a region's
773 // active status may propagate at a different speed than the changing of the region's affiliation.
774
775 // When we reach this control point, it is because a race has allowed a region's is_active() status to be seen
776 // by this thread before the region's affiliation() is seen by this thread.
777
778 // It's ok for this race to occur because the newly transformed region does not have any references to be
779 // updated.
780
781 assert(r->get_update_watermark() == r->bottom(),
782 "%s Region %zu is_active but not recognized as YOUNG or OLD so must be newly transitioned from FREE",
783 r->affiliation_name(), r->index());
784 }
785 }
786
787 if (_heap->check_cancelled_gc_and_yield(CONCURRENT)) {
788 return;
789 }
790
791 r = _regions->next();
792 }
793
794 if (_generation->is_young()) {
795 // Since this is generational and not GLOBAL, we have to process the remembered set. There's no remembered
796 // set processing if not in generational mode or if GLOBAL mode.
797
798 // After this thread has exhausted its traditional update-refs work, it continues with updating refs within
799 // remembered set. The remembered set workload is better balanced between threads, so threads that are "behind"
800 // can catch up with other threads during this phase, allowing all threads to work more effectively in parallel.
801 update_references_in_remembered_set(worker_id, cl, ctx, is_mixed);
802 }
803 }
804
805 template<class T>
806 void update_references_in_remembered_set(uint worker_id, T &cl, const ShenandoahMarkingContext* ctx, bool is_mixed) {
807
808 struct ShenandoahRegionChunk assignment;
809 ShenandoahScanRemembered* scanner = _heap->old_generation()->card_scan();
810
811 while (!_heap->check_cancelled_gc_and_yield(CONCURRENT) && _work_chunks->next(&assignment)) {
812 // Keep grabbing next work chunk to process until finished, or asked to yield
813 ShenandoahHeapRegion* r = assignment._r;
814 if (r->is_active() && !r->is_cset() && r->is_old()) {
815 HeapWord* start_of_range = r->bottom() + assignment._chunk_offset;
816 HeapWord* end_of_range = r->get_update_watermark();
817 if (end_of_range > start_of_range + assignment._chunk_size) {
818 end_of_range = start_of_range + assignment._chunk_size;
819 }
820
821 if (start_of_range >= end_of_range) {
822 continue;
823 }
824
825 // Old region in a young cycle or mixed cycle.
826 if (is_mixed) {
827 if (r->is_humongous()) {
828 // Need to examine both dirty and clean cards during mixed evac.
829 r->oop_iterate_humongous_slice_all(&cl,start_of_range, assignment._chunk_size);
830 } else {
831 // Since this is mixed evacuation, old regions that are candidates for collection have not been coalesced
832 // and filled. This will use mark bits to find objects that need to be updated.
833 update_references_in_old_region(cl, ctx, scanner, r, start_of_range, end_of_range);
834 }
835 } else {
836 // This is a young evacuation
837 size_t cluster_size = CardTable::card_size_in_words() * ShenandoahCardCluster::CardsPerCluster;
838 size_t clusters = assignment._chunk_size / cluster_size;
839 assert(clusters * cluster_size == assignment._chunk_size, "Chunk assignment must align on cluster boundaries");
840 scanner->process_region_slice(r, assignment._chunk_offset, clusters, end_of_range, &cl, true, worker_id);
841 }
842 }
843 }
844 }
845
846 template<class T>
847 void update_references_in_old_region(T &cl, const ShenandoahMarkingContext* ctx, ShenandoahScanRemembered* scanner,
848 const ShenandoahHeapRegion* r, HeapWord* start_of_range,
849 HeapWord* end_of_range) const {
850 // In case last object in my range spans boundary of my chunk, I may need to scan all the way to top()
851 ShenandoahObjectToOopBoundedClosure<T> objs(&cl, start_of_range, r->top());
852
853 // Any object that begins in a previous range is part of a different scanning assignment. Any object that
854 // starts after end_of_range is also not my responsibility. (Either allocated during evacuation, so does
855 // not hold pointers to from-space, or is beyond the range of my assigned work chunk.)
856
857 // Find the first object that begins in my range, if there is one. Note that `p` will be set to `end_of_range`
858 // when no live object is found in the range.
859 HeapWord* tams = ctx->top_at_mark_start(r);
860 HeapWord* p = get_first_object_start_word(ctx, scanner, tams, start_of_range, end_of_range);
861
862 while (p < end_of_range) {
863 // p is known to point to the beginning of marked object obj
864 oop obj = cast_to_oop(p);
865 objs.do_object(obj);
866 HeapWord* prev_p = p;
867 p += obj->size();
868 if (p < tams) {
869 p = ctx->get_next_marked_addr(p, tams);
870 // If there are no more marked objects before tams, this returns tams. Note that tams is
871 // either >= end_of_range, or tams is the start of an object that is marked.
872 }
873 assert(p != prev_p, "Lack of forward progress");
874 }
875 }
876
877 HeapWord* get_first_object_start_word(const ShenandoahMarkingContext* ctx, ShenandoahScanRemembered* scanner, HeapWord* tams,
878 HeapWord* start_of_range, HeapWord* end_of_range) const {
879 HeapWord* p = start_of_range;
880
881 if (p >= tams) {
882 // We cannot use ctx->is_marked(obj) to test whether an object begins at this address. Instead,
883 // we need to use the remembered set crossing map to advance p to the first object that starts
884 // within the enclosing card.
885 size_t card_index = scanner->card_index_for_addr(start_of_range);
886 while (true) {
887 HeapWord* first_object = scanner->first_object_in_card(card_index);
888 if (first_object != nullptr) {
889 p = first_object;
890 break;
891 } else if (scanner->addr_for_card_index(card_index + 1) < end_of_range) {
892 card_index++;
893 } else {
894 // Signal that no object was found in range
895 p = end_of_range;
896 break;
897 }
898 }
899 } else if (!ctx->is_marked(cast_to_oop(p))) {
900 p = ctx->get_next_marked_addr(p, tams);
901 // If there are no more marked objects before tams, this returns tams.
902 // Note that tams is either >= end_of_range, or tams is the start of an object that is marked.
903 }
904 return p;
905 }
906 };
907
908 void ShenandoahGenerationalHeap::update_heap_references(ShenandoahGeneration* generation, bool concurrent) {
909 assert(!is_full_gc_in_progress(), "Only for concurrent and degenerated GC");
910 const uint nworkers = workers()->active_workers();
911 ShenandoahRegionChunkIterator work_list(nworkers);
912 if (concurrent) {
913 ShenandoahGenerationalUpdateHeapRefsTask<true> task(generation, &_update_refs_iterator, &work_list);
914 workers()->run_task(&task);
915 } else {
916 ShenandoahGenerationalUpdateHeapRefsTask<false> task(generation, &_update_refs_iterator, &work_list);
917 workers()->run_task(&task);
918 }
919
920 if (ShenandoahEnableCardStats) {
921 // Only do this if we are collecting card stats
922 ShenandoahScanRemembered* card_scan = old_generation()->card_scan();
923 assert(card_scan != nullptr, "Card table must exist when card stats are enabled");
924 card_scan->log_card_stats(nworkers, CARD_STAT_UPDATE_REFS);
925 }
926 }
927
928 struct ShenandoahCompositeRegionClosure {
929 template<typename C1, typename C2>
930 class Closure : public ShenandoahHeapRegionClosure {
931 private:
932 C1 &_c1;
933 C2 &_c2;
934
935 public:
936 Closure(C1 &c1, C2 &c2) : ShenandoahHeapRegionClosure(), _c1(c1), _c2(c2) {}
937
938 void heap_region_do(ShenandoahHeapRegion* r) override {
939 _c1.heap_region_do(r);
940 _c2.heap_region_do(r);
941 }
942
943 bool is_thread_safe() override {
944 return _c1.is_thread_safe() && _c2.is_thread_safe();
945 }
946 };
947
948 template<typename C1, typename C2>
949 static Closure<C1, C2> of(C1 &c1, C2 &c2) {
950 return Closure<C1, C2>(c1, c2);
951 }
952 };
953
954 class ShenandoahUpdateRegionAges : public ShenandoahHeapRegionClosure {
955 private:
956 ShenandoahMarkingContext* _ctx;
957
958 public:
959 explicit ShenandoahUpdateRegionAges(ShenandoahMarkingContext* ctx) : _ctx(ctx) { }
960
961 void heap_region_do(ShenandoahHeapRegion* r) override {
962 // Maintenance of region age must follow evacuation in order to account for
963 // evacuation allocations within survivor regions. We consult region age during
964 // the subsequent evacuation to determine whether certain objects need to
965 // be promoted.
966 if (r->is_young() && r->is_active()) {
967 HeapWord *tams = _ctx->top_at_mark_start(r);
968 HeapWord *top = r->top();
969
970 // Allocations move the watermark when top moves. However, compacting
971 // objects will sometimes lower top beneath the watermark, after which,
972 // attempts to read the watermark will assert out (watermark should not be
973 // higher than top).
974 if (top > tams) {
975 // There have been allocations in this region since the start of the cycle.
976 // Any objects new to this region must not assimilate elevated age.
977 r->reset_age();
978 } else {
979 r->increment_age();
980 }
981 }
982 }
983
984 bool is_thread_safe() override {
985 return true;
986 }
987 };
988
989 void ShenandoahGenerationalHeap::final_update_refs_update_region_states() {
990 ShenandoahSynchronizePinnedRegionStates pins;
991 ShenandoahUpdateRegionAges ages(marking_context());
992 auto cl = ShenandoahCompositeRegionClosure::of(pins, ages);
993 parallel_heap_region_iterate(&cl);
994 }
995
996 void ShenandoahGenerationalHeap::complete_degenerated_cycle() {
997 shenandoah_assert_heaplocked_or_safepoint();
998 if (!old_generation()->is_parsable()) {
999 ShenandoahGCPhase phase(ShenandoahPhaseTimings::degen_gc_coalesce_and_fill);
1000 coalesce_and_fill_old_regions(false);
1001 }
1002
1003 old_generation()->maybe_log_promotion_failure_stats(false);
1004 }
1005
1006 void ShenandoahGenerationalHeap::complete_concurrent_cycle() {
1007 if (!old_generation()->is_parsable()) {
1008 // Class unloading may render the card offsets unusable, so we must rebuild them before
1009 // the next remembered set scan. We _could_ let the control thread do this sometime after
1010 // the global cycle has completed and before the next young collection, but under memory
1011 // pressure the control thread may not have the time (that is, because it's running back
1012 // to back GCs). In that scenario, we would have to make the old regions parsable before
1013 // we could start a young collection. This could delay the start of the young cycle and
1014 // throw off the heuristics.
1015 entry_global_coalesce_and_fill();
1016 }
1017
1018 old_generation()->maybe_log_promotion_failure_stats(true);
1019 }
1020
1021 void ShenandoahGenerationalHeap::entry_global_coalesce_and_fill() {
1022 const char* msg = "Coalescing and filling old regions";
1023 ShenandoahConcurrentSubphase gc_phase(msg, ShenandoahPhaseTimings::conc_coalesce_and_fill);
1024
1025 TraceCollectorStats tcs(monitoring_support()->concurrent_collection_counters());
1026 EventMark em("%s", msg);
1027 ShenandoahWorkerScope scope(workers(),
1028 ShenandoahWorkerPolicy::calc_workers_for_conc_marking(),
1029 "concurrent coalesce and fill");
1030
1031 coalesce_and_fill_old_regions(true);
1032 }
1033
1034 void ShenandoahGenerationalHeap::update_region_ages(ShenandoahMarkingContext* ctx) {
1035 ShenandoahUpdateRegionAges cl(ctx);
1036 parallel_heap_region_iterate(&cl);
1037 }