1 /*
2 * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
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 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "classfile/classLoaderDataGraph.hpp"
26 #include "classfile/javaClasses.inline.hpp"
27 #include "classfile/stringTable.hpp"
28 #include "classfile/symbolTable.hpp"
29 #include "classfile/systemDictionary.hpp"
30 #include "code/codeCache.hpp"
31 #include "code/nmethod.hpp"
32 #include "compiler/oopMap.hpp"
33 #include "cppstdlib/new.hpp"
34 #include "gc/parallel/objectStartArray.inline.hpp"
35 #include "gc/parallel/parallelArguments.hpp"
36 #include "gc/parallel/parallelScavengeHeap.inline.hpp"
37 #include "gc/parallel/parMarkBitMap.inline.hpp"
38 #include "gc/parallel/psAdaptiveSizePolicy.hpp"
39 #include "gc/parallel/psCompactionManager.inline.hpp"
40 #include "gc/parallel/psOldGen.hpp"
41 #include "gc/parallel/psParallelCompact.inline.hpp"
42 #include "gc/parallel/psPromotionManager.inline.hpp"
43 #include "gc/parallel/psRootType.hpp"
44 #include "gc/parallel/psScavenge.hpp"
45 #include "gc/parallel/psStringDedup.hpp"
46 #include "gc/parallel/psYoungGen.hpp"
47 #include "gc/shared/classUnloadingContext.hpp"
48 #include "gc/shared/collectedHeap.inline.hpp"
49 #include "gc/shared/fullGCForwarding.inline.hpp"
50 #include "gc/shared/gcCause.hpp"
51 #include "gc/shared/gcHeapSummary.hpp"
52 #include "gc/shared/gcId.hpp"
53 #include "gc/shared/gcLocker.hpp"
54 #include "gc/shared/gcTimer.hpp"
55 #include "gc/shared/gcTrace.hpp"
56 #include "gc/shared/gcTraceTime.inline.hpp"
57 #include "gc/shared/gcVMOperations.hpp"
58 #include "gc/shared/isGCActiveMark.hpp"
59 #include "gc/shared/oopStorage.inline.hpp"
60 #include "gc/shared/oopStorageSet.inline.hpp"
61 #include "gc/shared/oopStorageSetParState.inline.hpp"
62 #include "gc/shared/parallelCleaning.hpp"
63 #include "gc/shared/preservedMarks.inline.hpp"
64 #include "gc/shared/referencePolicy.hpp"
65 #include "gc/shared/referenceProcessor.hpp"
66 #include "gc/shared/referenceProcessorPhaseTimes.hpp"
67 #include "gc/shared/spaceDecorator.hpp"
68 #include "gc/shared/taskTerminator.hpp"
69 #include "gc/shared/weakProcessor.inline.hpp"
70 #include "gc/shared/workerPolicy.hpp"
71 #include "gc/shared/workerThread.hpp"
72 #include "gc/shared/workerUtils.hpp"
73 #include "logging/log.hpp"
74 #include "memory/iterator.inline.hpp"
75 #include "memory/memoryReserver.hpp"
76 #include "memory/metaspaceUtils.hpp"
77 #include "memory/resourceArea.hpp"
78 #include "memory/universe.hpp"
79 #include "nmt/memTracker.hpp"
80 #include "oops/access.inline.hpp"
81 #include "oops/instanceClassLoaderKlass.inline.hpp"
82 #include "oops/instanceKlass.inline.hpp"
83 #include "oops/instanceMirrorKlass.inline.hpp"
84 #include "oops/methodData.hpp"
85 #include "oops/objArrayKlass.inline.hpp"
86 #include "oops/oop.inline.hpp"
87 #include "runtime/handles.inline.hpp"
88 #include "runtime/java.hpp"
89 #include "runtime/safepoint.hpp"
90 #include "runtime/threads.hpp"
91 #include "runtime/vmThread.hpp"
92 #include "services/memoryService.hpp"
93 #include "utilities/align.hpp"
94 #include "utilities/debug.hpp"
95 #include "utilities/events.hpp"
96 #include "utilities/formatBuffer.hpp"
97 #include "utilities/macros.hpp"
98 #include "utilities/stack.inline.hpp"
99
100 #include <math.h>
101
102 // All sizes are in HeapWords.
103 const size_t ParallelCompactData::Log2RegionSize = 16; // 64K words
104 const size_t ParallelCompactData::RegionSize = (size_t)1 << Log2RegionSize;
105 static_assert(ParallelCompactData::RegionSize >= BitsPerWord, "region-start bit word-aligned");
106 const size_t ParallelCompactData::RegionSizeBytes =
107 RegionSize << LogHeapWordSize;
108 const size_t ParallelCompactData::RegionSizeOffsetMask = RegionSize - 1;
109 const size_t ParallelCompactData::RegionAddrOffsetMask = RegionSizeBytes - 1;
110 const size_t ParallelCompactData::RegionAddrMask = ~RegionAddrOffsetMask;
111
112 const ParallelCompactData::RegionData::region_sz_t
113 ParallelCompactData::RegionData::dc_shift = 27;
114
115 const ParallelCompactData::RegionData::region_sz_t
116 ParallelCompactData::RegionData::dc_mask = ~0U << dc_shift;
117
118 const ParallelCompactData::RegionData::region_sz_t
119 ParallelCompactData::RegionData::dc_one = 0x1U << dc_shift;
120
121 const ParallelCompactData::RegionData::region_sz_t
122 ParallelCompactData::RegionData::los_mask = ~dc_mask;
123
124 const ParallelCompactData::RegionData::region_sz_t
125 ParallelCompactData::RegionData::dc_claimed = 0x8U << dc_shift;
126
127 const ParallelCompactData::RegionData::region_sz_t
128 ParallelCompactData::RegionData::dc_completed = 0xcU << dc_shift;
129
130 bool ParallelCompactData::RegionData::is_clear() {
131 return (_destination == nullptr) &&
132 (_source_region == 0) &&
133 (_partial_obj_addr == nullptr) &&
134 (_partial_obj_size == 0) &&
135 (dc_and_los() == 0) &&
136 (shadow_state() == 0);
137 }
138
139 #ifdef ASSERT
140 void ParallelCompactData::RegionData::verify_clear() {
141 assert(_destination == nullptr, "inv");
142 assert(_source_region == 0, "inv");
143 assert(_partial_obj_addr == nullptr, "inv");
144 assert(_partial_obj_size == 0, "inv");
145 assert(dc_and_los() == 0, "inv");
146 assert(shadow_state() == 0, "inv");
147 }
148 #endif
149
150 SpaceInfo PSParallelCompact::_space_info[PSParallelCompact::last_space_id];
151
152 SpanSubjectToDiscoveryClosure PSParallelCompact::_span_based_discoverer;
153 ReferenceProcessor* PSParallelCompact::_ref_processor = nullptr;
154
155 void SplitInfo::record(size_t split_region_idx, HeapWord* split_point, size_t preceding_live_words) {
156 assert(split_region_idx != 0, "precondition");
157
158 // Obj denoted by split_point will be deferred to the next space.
159 assert(split_point != nullptr, "precondition");
160
161 const ParallelCompactData& sd = PSParallelCompact::summary_data();
162
163 PSParallelCompact::RegionData* split_region_ptr = sd.region(split_region_idx);
164 assert(preceding_live_words < split_region_ptr->data_size(), "inv");
165
166 HeapWord* preceding_destination = split_region_ptr->destination();
167 assert(preceding_destination != nullptr, "inv");
168
169 // How many regions does the preceding part occupy
170 uint preceding_destination_count;
171 if (preceding_live_words == 0) {
172 preceding_destination_count = 0;
173 } else {
174 // -1 so that the ending address doesn't fall on the region-boundary
175 if (sd.region_align_down(preceding_destination) ==
176 sd.region_align_down(preceding_destination + preceding_live_words - 1)) {
177 preceding_destination_count = 1;
178 } else {
179 preceding_destination_count = 2;
180 }
181 }
182
183 _split_region_idx = split_region_idx;
184 _split_point = split_point;
185 _preceding_live_words = preceding_live_words;
186 _preceding_destination = preceding_destination;
187 _preceding_destination_count = preceding_destination_count;
188 }
189
190 void SplitInfo::clear()
191 {
192 _split_region_idx = 0;
193 _split_point = nullptr;
194 _preceding_live_words = 0;
195 _preceding_destination = nullptr;
196 _preceding_destination_count = 0;
197 assert(!is_valid(), "sanity");
198 }
199
200 #ifdef ASSERT
201 void SplitInfo::verify_clear()
202 {
203 assert(_split_region_idx == 0, "not clear");
204 assert(_split_point == nullptr, "not clear");
205 assert(_preceding_live_words == 0, "not clear");
206 assert(_preceding_destination == nullptr, "not clear");
207 assert(_preceding_destination_count == 0, "not clear");
208 }
209 #endif // #ifdef ASSERT
210
211
212 void PSParallelCompact::print_on(outputStream* st) {
213 _mark_bitmap.print_on(st);
214 }
215
216 ParallelCompactData::ParallelCompactData() :
217 _heap_start(nullptr),
218 DEBUG_ONLY(_heap_end(nullptr) COMMA)
219 _region_vspace(nullptr),
220 _reserved_byte_size(0),
221 _region_data(nullptr),
222 _region_count(0) {}
223
224 bool ParallelCompactData::initialize(MemRegion reserved_heap)
225 {
226 _heap_start = reserved_heap.start();
227 const size_t heap_size = reserved_heap.word_size();
228 DEBUG_ONLY(_heap_end = _heap_start + heap_size;)
229
230 assert(region_align_down(_heap_start) == _heap_start,
231 "region start not aligned");
232 assert(is_aligned(heap_size, RegionSize), "precondition");
233
234 const size_t count = heap_size >> Log2RegionSize;
235 const size_t raw_bytes = count * sizeof(RegionData);
236 const size_t page_sz = os::page_size_for_region_aligned(raw_bytes, 10);
237 const size_t granularity = os::vm_allocation_granularity();
238 const size_t rs_align = MAX2(page_sz, granularity);
239
240 _reserved_byte_size = align_up(raw_bytes, rs_align);
241
242 ReservedSpace rs = MemoryReserver::reserve(_reserved_byte_size,
243 rs_align,
244 page_sz,
245 mtGC);
246
247 if (!rs.is_reserved()) {
248 // Failed to reserve memory.
249 return false;
250 }
251
252 os::trace_page_sizes("Parallel Compact Data", raw_bytes, raw_bytes, rs.base(),
253 rs.size(), page_sz);
254
255 MemTracker::record_virtual_memory_tag(rs, mtGC);
256
257 PSVirtualSpace* region_vspace = new PSVirtualSpace(rs, page_sz);
258
259 if (!region_vspace->expand_by(_reserved_byte_size)) {
260 // Failed to commit memory.
261
262 delete region_vspace;
263
264 // Release memory reserved in the space.
265 MemoryReserver::release(rs);
266
267 return false;
268 }
269
270 _region_vspace = region_vspace;
271 _region_data = (RegionData*)_region_vspace->reserved_low_addr();
272 _region_count = count;
273 return true;
274 }
275
276 void ParallelCompactData::clear_range(size_t beg_region, size_t end_region) {
277 assert(beg_region <= _region_count, "beg_region out of range");
278 assert(end_region <= _region_count, "end_region out of range");
279
280 for (size_t i = beg_region; i < end_region; i++) {
281 ::new (&_region_data[i]) RegionData{};
282 }
283 }
284
285 // The total live words on src_region would overflow the target space, so find
286 // the overflowing object and record the split point. The invariant is that an
287 // obj should not cross space boundary.
288 HeapWord* ParallelCompactData::summarize_split_space(size_t src_region,
289 SplitInfo& split_info,
290 HeapWord* const destination,
291 HeapWord* const target_end,
292 HeapWord** target_next) {
293 assert(destination <= target_end, "sanity");
294 assert(destination + _region_data[src_region].data_size() > target_end,
295 "region should not fit into target space");
296 assert(is_region_aligned(target_end), "sanity");
297
298 size_t partial_obj_size = _region_data[src_region].partial_obj_size();
299
300 if (destination + partial_obj_size > target_end) {
301 assert(partial_obj_size > 0, "inv");
302 // The overflowing obj is from a previous region.
303 //
304 // source-regions:
305 //
306 // ***************
307 // | A|AA |
308 // ***************
309 // ^
310 // | split-point
311 //
312 // dest-region:
313 //
314 // ********
315 // |~~~~A |
316 // ********
317 // ^^
318 // || target-space-end
319 // |
320 // | destination
321 //
322 // AAA would overflow target-space.
323 //
324 HeapWord* overflowing_obj = _region_data[src_region].partial_obj_addr();
325 size_t split_region = addr_to_region_idx(overflowing_obj);
326
327 // The number of live words before the overflowing object on this split region
328 size_t preceding_live_words;
329 if (is_region_aligned(overflowing_obj)) {
330 preceding_live_words = 0;
331 } else {
332 // Words accounted by the overflowing object on the split region
333 size_t overflowing_size = pointer_delta(region_align_up(overflowing_obj), overflowing_obj);
334 preceding_live_words = region(split_region)->data_size() - overflowing_size;
335 }
336
337 split_info.record(split_region, overflowing_obj, preceding_live_words);
338
339 // The [overflowing_obj, src_region_start) part has been accounted for, so
340 // must move back the new_top, now that this overflowing obj is deferred.
341 HeapWord* new_top = destination - pointer_delta(region_to_addr(src_region), overflowing_obj);
342
343 // If the overflowing obj was relocated to its original destination,
344 // those destination regions would have their source_region set. Now that
345 // this overflowing obj is relocated somewhere else, reset the
346 // source_region.
347 {
348 size_t range_start = addr_to_region_idx(region_align_up(new_top));
349 size_t range_end = addr_to_region_idx(region_align_up(destination));
350 for (size_t i = range_start; i < range_end; ++i) {
351 region(i)->set_source_region(0);
352 }
353 }
354
355 // Update new top of target space
356 *target_next = new_top;
357
358 return overflowing_obj;
359 }
360
361 // Obj-iteration to locate the overflowing obj
362 HeapWord* region_start = region_to_addr(src_region);
363 HeapWord* region_end = region_start + RegionSize;
364 HeapWord* cur_addr = region_start + partial_obj_size;
365 size_t live_words = partial_obj_size;
366
367 while (true) {
368 assert(cur_addr < region_end, "inv");
369 cur_addr = PSParallelCompact::mark_bitmap()->find_obj_beg(cur_addr, region_end);
370 // There must be an overflowing obj in this region
371 assert(cur_addr < region_end, "inv");
372
373 oop obj = cast_to_oop(cur_addr);
374 size_t obj_size = obj->size();
375 if (destination + live_words + obj_size > target_end) {
376 // Found the overflowing obj
377 split_info.record(src_region, cur_addr, live_words);
378 *target_next = destination + live_words;
379 return cur_addr;
380 }
381
382 live_words += obj_size;
383 cur_addr += obj_size;
384 }
385 }
386
387 size_t ParallelCompactData::live_words_in_space(const MutableSpace* space,
388 HeapWord** full_region_prefix_end) {
389 size_t cur_region = addr_to_region_idx(space->bottom());
390 const size_t end_region = addr_to_region_idx(region_align_up(space->top()));
391 size_t live_words = 0;
392 if (full_region_prefix_end == nullptr) {
393 for (/* empty */; cur_region < end_region; ++cur_region) {
394 live_words += _region_data[cur_region].data_size();
395 }
396 } else {
397 bool first_set = false;
398 for (/* empty */; cur_region < end_region; ++cur_region) {
399 size_t live_words_in_region = _region_data[cur_region].data_size();
400 if (!first_set && live_words_in_region < RegionSize) {
401 *full_region_prefix_end = region_to_addr(cur_region);
402 first_set = true;
403 }
404 live_words += live_words_in_region;
405 }
406 if (!first_set) {
407 // All regions are full of live objs.
408 assert(is_region_aligned(space->top()), "inv");
409 *full_region_prefix_end = space->top();
410 }
411 assert(*full_region_prefix_end != nullptr, "postcondition");
412 assert(is_region_aligned(*full_region_prefix_end), "inv");
413 assert(*full_region_prefix_end >= space->bottom(), "in-range");
414 assert(*full_region_prefix_end <= space->top(), "in-range");
415 }
416 return live_words;
417 }
418
419 bool ParallelCompactData::summarize(SplitInfo& split_info,
420 HeapWord* source_beg, HeapWord* source_end,
421 HeapWord** source_next,
422 HeapWord* target_beg, HeapWord* target_end,
423 HeapWord** target_next)
424 {
425 HeapWord* const source_next_val = source_next == nullptr ? nullptr : *source_next;
426 log_develop_trace(gc, compaction)(
427 "sb=" PTR_FORMAT " se=" PTR_FORMAT " sn=" PTR_FORMAT
428 "tb=" PTR_FORMAT " te=" PTR_FORMAT " tn=" PTR_FORMAT,
429 p2i(source_beg), p2i(source_end), p2i(source_next_val),
430 p2i(target_beg), p2i(target_end), p2i(*target_next));
431
432 size_t cur_region = addr_to_region_idx(source_beg);
433 const size_t end_region = addr_to_region_idx(region_align_up(source_end));
434
435 HeapWord *dest_addr = target_beg;
436 for (/* empty */; cur_region < end_region; cur_region++) {
437 size_t words = _region_data[cur_region].data_size();
438
439 // Skip empty ones
440 if (words == 0) {
441 continue;
442 }
443
444 if (split_info.is_split(cur_region)) {
445 assert(words > split_info.preceding_live_words(), "inv");
446 words -= split_info.preceding_live_words();
447 }
448
449 _region_data[cur_region].set_destination(dest_addr);
450
451 // If cur_region does not fit entirely into the target space, find a point
452 // at which the source space can be 'split' so that part is copied to the
453 // target space and the rest is copied elsewhere.
454 if (dest_addr + words > target_end) {
455 assert(source_next != nullptr, "source_next is null when splitting");
456 *source_next = summarize_split_space(cur_region, split_info, dest_addr,
457 target_end, target_next);
458 return false;
459 }
460
461 uint destination_count = split_info.is_split(cur_region)
462 ? split_info.preceding_destination_count()
463 : 0;
464
465 HeapWord* const last_addr = dest_addr + words - 1;
466 const size_t dest_region_1 = addr_to_region_idx(dest_addr);
467 const size_t dest_region_2 = addr_to_region_idx(last_addr);
468
469 // Initially assume that the destination regions will be the same and
470 // adjust the value below if necessary. Under this assumption, if
471 // cur_region == dest_region_2, then cur_region will be compacted
472 // completely into itself.
473 destination_count += cur_region == dest_region_2 ? 0 : 1;
474 if (dest_region_1 != dest_region_2) {
475 // Destination regions differ; adjust destination_count.
476 destination_count += 1;
477 // Data from cur_region will be copied to the start of dest_region_2.
478 _region_data[dest_region_2].set_source_region(cur_region);
479 } else if (is_region_aligned(dest_addr)) {
480 // Data from cur_region will be copied to the start of the destination
481 // region.
482 _region_data[dest_region_1].set_source_region(cur_region);
483 }
484
485 _region_data[cur_region].set_destination_count(destination_count);
486 dest_addr += words;
487 }
488
489 *target_next = dest_addr;
490 return true;
491 }
492
493 #ifdef ASSERT
494 void ParallelCompactData::verify_clear() {
495 for (uint cur_idx = 0; cur_idx < region_count(); ++cur_idx) {
496 if (!region(cur_idx)->is_clear()) {
497 log_warning(gc)("Uncleared Region: %u", cur_idx);
498 region(cur_idx)->verify_clear();
499 }
500 }
501 }
502 #endif // #ifdef ASSERT
503
504 STWGCTimer PSParallelCompact::_gc_timer;
505 ParallelOldTracer PSParallelCompact::_gc_tracer;
506 elapsedTimer PSParallelCompact::_accumulated_time;
507 unsigned int PSParallelCompact::_maximum_compaction_gc_num = 0;
508 CollectorCounters* PSParallelCompact::_counters = nullptr;
509 ParMarkBitMap PSParallelCompact::_mark_bitmap;
510 ParallelCompactData PSParallelCompact::_summary_data;
511
512 PSParallelCompact::IsAliveClosure PSParallelCompact::_is_alive_closure;
513
514 class PCAdjustPointerClosure: public BasicOopIterateClosure {
515 template <typename T>
516 void do_oop_work(T* p) { PSParallelCompact::adjust_pointer(p); }
517
518 public:
519 virtual void do_oop(oop* p) { do_oop_work(p); }
520 virtual void do_oop(narrowOop* p) { do_oop_work(p); }
521
522 virtual ReferenceIterationMode reference_iteration_mode() { return DO_FIELDS; }
523 };
524
525 static PCAdjustPointerClosure pc_adjust_pointer_closure;
526
527 bool PSParallelCompact::IsAliveClosure::do_object_b(oop p) { return mark_bitmap()->is_marked(p); }
528
529 void PSParallelCompact::post_initialize() {
530 ParallelScavengeHeap* heap = ParallelScavengeHeap::heap();
531 _span_based_discoverer.set_span(heap->reserved_region());
532 _ref_processor =
533 new ReferenceProcessor(&_span_based_discoverer,
534 ParallelGCThreads, // mt processing degree
535 ParallelGCThreads, // mt discovery degree
536 false, // concurrent_discovery
537 &_is_alive_closure); // non-header is alive closure
538
539 _counters = new CollectorCounters("Parallel full collection pauses", 1);
540
541 // Initialize static fields in ParCompactionManager.
542 ParCompactionManager::initialize(mark_bitmap());
543 }
544
545 bool PSParallelCompact::initialize_aux_data() {
546 ParallelScavengeHeap* heap = ParallelScavengeHeap::heap();
547 MemRegion mr = heap->reserved_region();
548 assert(mr.byte_size() != 0, "heap should be reserved");
549
550 initialize_space_info();
551
552 if (!_mark_bitmap.initialize(mr)) {
553 vm_shutdown_during_initialization(
554 err_msg("Unable to allocate %zuKB bitmaps for parallel "
555 "garbage collection for the requested %zuKB heap.",
556 _mark_bitmap.reserved_byte_size()/K, mr.byte_size()/K));
557 return false;
558 }
559
560 if (!_summary_data.initialize(mr)) {
561 vm_shutdown_during_initialization(
562 err_msg("Unable to allocate %zuKB card tables for parallel "
563 "garbage collection for the requested %zuKB heap.",
564 _summary_data.reserved_byte_size()/K, mr.byte_size()/K));
565 return false;
566 }
567
568 return true;
569 }
570
571 void PSParallelCompact::initialize_space_info()
572 {
573 memset(&_space_info, 0, sizeof(_space_info));
574
575 ParallelScavengeHeap* heap = ParallelScavengeHeap::heap();
576 PSYoungGen* young_gen = heap->young_gen();
577
578 _space_info[old_space_id].set_space(heap->old_gen()->object_space());
579 _space_info[eden_space_id].set_space(young_gen->eden_space());
580 _space_info[from_space_id].set_space(young_gen->from_space());
581 _space_info[to_space_id].set_space(young_gen->to_space());
582
583 _space_info[old_space_id].set_start_array(heap->old_gen()->start_array());
584 }
585
586 void
587 PSParallelCompact::clear_data_covering_space(SpaceId id)
588 {
589 // At this point, top is the value before GC, new_top() is the value that will
590 // be set at the end of GC. The marking bitmap is cleared to top; nothing
591 // should be marked above top. The summary data is cleared to the larger of
592 // top & new_top.
593 MutableSpace* const space = _space_info[id].space();
594 HeapWord* const bot = space->bottom();
595 HeapWord* const top = space->top();
596 HeapWord* const max_top = MAX2(top, _space_info[id].new_top());
597
598 _mark_bitmap.clear_range(bot, top);
599
600 const size_t beg_region = _summary_data.addr_to_region_idx(bot);
601 const size_t end_region =
602 _summary_data.addr_to_region_idx(_summary_data.region_align_up(max_top));
603 _summary_data.clear_range(beg_region, end_region);
604
605 // Clear the data used to 'split' regions.
606 SplitInfo& split_info = _space_info[id].split_info();
607 if (split_info.is_valid()) {
608 split_info.clear();
609 }
610 DEBUG_ONLY(split_info.verify_clear();)
611 }
612
613 void PSParallelCompact::pre_compact()
614 {
615 // Update the from & to space pointers in space_info, since they are swapped
616 // at each young gen gc. Do the update unconditionally (even though a
617 // promotion failure does not swap spaces) because an unknown number of young
618 // collections will have swapped the spaces an unknown number of times.
619 GCTraceTime(Debug, gc, phases) tm("Pre Compact", &_gc_timer);
620 ParallelScavengeHeap* heap = ParallelScavengeHeap::heap();
621 _space_info[from_space_id].set_space(heap->young_gen()->from_space());
622 _space_info[to_space_id].set_space(heap->young_gen()->to_space());
623
624 heap->increment_total_collections(true);
625
626 CodeCache::on_gc_marking_cycle_start();
627
628 heap->print_before_gc();
629 heap->trace_heap_before_gc(&_gc_tracer);
630
631 // Fill in TLABs
632 heap->ensure_parsability(true); // retire TLABs
633
634 if (VerifyBeforeGC && heap->total_collections() >= VerifyGCStartAt) {
635 Universe::verify("Before GC");
636 }
637
638 DEBUG_ONLY(mark_bitmap()->verify_clear();)
639 DEBUG_ONLY(summary_data().verify_clear();)
640 }
641
642 void PSParallelCompact::post_compact()
643 {
644 GCTraceTime(Info, gc, phases) tm("Post Compact", &_gc_timer);
645 ParCompactionManager::remove_all_shadow_regions();
646
647 CodeCache::on_gc_marking_cycle_finish();
648 CodeCache::arm_all_nmethods();
649
650 // Need to clear claim bits for the next full-gc (marking and adjust-pointers).
651 ClassLoaderDataGraph::clear_claimed_marks();
652
653 for (unsigned int id = old_space_id; id < last_space_id; ++id) {
654 // Clear the marking bitmap, summary data and split info.
655 clear_data_covering_space(SpaceId(id));
656 {
657 MutableSpace* space = _space_info[id].space();
658 HeapWord* top = space->top();
659 HeapWord* new_top = _space_info[id].new_top();
660 if (ZapUnusedHeapArea && new_top < top) {
661 space->mangle_region(MemRegion(new_top, top));
662 }
663 // Update top(). Must be done after clearing the bitmap and summary data.
664 space->set_top(new_top);
665 }
666 }
667
668 #ifdef ASSERT
669 {
670 mark_bitmap()->verify_clear();
671 summary_data().verify_clear();
672 }
673 #endif
674
675 ParCompactionManager::flush_all_string_dedup_requests();
676
677 MutableSpace* const eden_space = _space_info[eden_space_id].space();
678 MutableSpace* const from_space = _space_info[from_space_id].space();
679 MutableSpace* const to_space = _space_info[to_space_id].space();
680
681 ParallelScavengeHeap* heap = ParallelScavengeHeap::heap();
682 bool eden_empty = eden_space->is_empty();
683
684 // Update heap occupancy information which is used as input to the soft ref
685 // clearing policy at the next gc.
686 Universe::heap()->update_capacity_and_used_at_gc();
687
688 bool young_gen_empty = eden_empty && from_space->is_empty() &&
689 to_space->is_empty();
690
691 PSCardTable* ct = heap->card_table();
692 MemRegion old_mr = heap->old_gen()->committed();
693 if (young_gen_empty) {
694 ct->clear_MemRegion(old_mr);
695 } else {
696 ct->dirty_MemRegion(old_mr);
697 }
698
699 heap->prune_scavengable_nmethods();
700
701 #ifdef COMPILER2
702 DerivedPointerTable::update_pointers();
703 #endif // COMPILER2
704
705 // Signal that we have completed a visit to all live objects.
706 Universe::heap()->record_whole_heap_examined_timestamp();
707 }
708
709 HeapWord* PSParallelCompact::compute_dense_prefix_for_old_space(MutableSpace* old_space,
710 HeapWord* full_region_prefix_end) {
711 const size_t region_size = ParallelCompactData::RegionSize;
712 const ParallelCompactData& sd = summary_data();
713
714 // Iteration starts with the region *after* the full-region-prefix-end.
715 const RegionData* const start_region = sd.addr_to_region_ptr(full_region_prefix_end);
716 // If final region is not full, iteration stops before that region,
717 // because fill_dense_prefix_end assumes that prefix_end <= top.
718 const RegionData* const end_region = sd.addr_to_region_ptr(old_space->top());
719 assert(start_region <= end_region, "inv");
720
721 size_t max_waste = old_space->capacity_in_words() * (MarkSweepDeadRatio / 100.0);
722 const RegionData* cur_region = start_region;
723 for (/* empty */; cur_region < end_region; ++cur_region) {
724 assert(region_size >= cur_region->data_size(), "inv");
725 size_t dead_size = region_size - cur_region->data_size();
726 if (max_waste < dead_size) {
727 break;
728 }
729 max_waste -= dead_size;
730 }
731
732 HeapWord* const prefix_end = sd.region_to_addr(cur_region);
733 assert(sd.is_region_aligned(prefix_end), "postcondition");
734 assert(prefix_end >= full_region_prefix_end, "in-range");
735 assert(prefix_end <= old_space->top(), "in-range");
736 return prefix_end;
737 }
738
739 void PSParallelCompact::fill_dense_prefix_end(SpaceId id) {
740 // Comparing two sizes to decide if filling is required:
741 //
742 // The size of the filler (min-obj-size) is 2 heap words with the default
743 // MinObjAlignment, since both markword and klass take 1 heap word.
744 // With +UseCompactObjectHeaders, the minimum filler size is only one word,
745 // because the Klass* gets encoded in the mark-word.
746 //
747 // The size of the gap (if any) right before dense-prefix-end is
748 // MinObjAlignment.
749 //
750 // Need to fill in the gap only if it's smaller than min-obj-size, and the
751 // filler obj will extend to next region.
752
753 if (MinObjAlignment >= checked_cast<int>(CollectedHeap::min_fill_size())) {
754 return;
755 }
756
757 assert(!UseCompactObjectHeaders, "Compact headers can allocate small objects");
758 assert(CollectedHeap::min_fill_size() == 2, "inv");
759 HeapWord* const dense_prefix_end = dense_prefix(id);
760 assert(_summary_data.is_region_aligned(dense_prefix_end), "precondition");
761 assert(dense_prefix_end <= space(id)->top(), "precondition");
762 if (dense_prefix_end == space(id)->top()) {
763 // Must not have single-word gap right before prefix-end/top.
764 return;
765 }
766 RegionData* const region_after_dense_prefix = _summary_data.addr_to_region_ptr(dense_prefix_end);
767
768 if (region_after_dense_prefix->partial_obj_size() != 0 ||
769 _mark_bitmap.is_marked(dense_prefix_end)) {
770 // The region after the dense prefix starts with live bytes.
771 return;
772 }
773
774 HeapWord* block_start = start_array(id)->block_start_reaching_into_card(dense_prefix_end);
775 if (block_start == dense_prefix_end - 1) {
776 assert(!_mark_bitmap.is_marked(block_start), "inv");
777 // There is exactly one heap word gap right before the dense prefix end, so we need a filler object.
778 // The filler object will extend into region_after_dense_prefix.
779 const size_t obj_len = 2; // min-fill-size
780 HeapWord* const obj_beg = dense_prefix_end - 1;
781 CollectedHeap::fill_with_object(obj_beg, obj_len);
782 _mark_bitmap.mark_obj(obj_beg);
783 _summary_data.addr_to_region_ptr(obj_beg)->add_live_obj(1);
784 region_after_dense_prefix->set_partial_obj_size(1);
785 region_after_dense_prefix->set_partial_obj_addr(obj_beg);
786 assert(start_array(id) != nullptr, "sanity");
787 start_array(id)->update_for_block(obj_beg, obj_beg + obj_len);
788 }
789 }
790
791 bool PSParallelCompact::check_maximum_compaction(bool should_do_max_compaction,
792 size_t total_live_words,
793 MutableSpace* const old_space,
794 HeapWord* full_region_prefix_end) {
795
796 ParallelScavengeHeap* heap = ParallelScavengeHeap::heap();
797
798 // Check System.GC
799 bool is_max_on_system_gc = UseMaximumCompactionOnSystemGC
800 && GCCause::is_user_requested_gc(heap->gc_cause());
801
802 // Check if all live objs are too much for old-gen.
803 const bool is_old_gen_too_full = (total_live_words >= old_space->capacity_in_words());
804
805 // If all regions in old-gen are full
806 const bool is_region_full =
807 full_region_prefix_end >= _summary_data.region_align_down(old_space->top());
808
809 return should_do_max_compaction
810 || is_max_on_system_gc
811 || is_old_gen_too_full
812 || is_region_full;
813 }
814
815 void PSParallelCompact::summary_phase(bool should_do_max_compaction)
816 {
817 GCTraceTime(Info, gc, phases) tm("Summary Phase", &_gc_timer);
818
819 MutableSpace* const old_space = _space_info[old_space_id].space();
820 {
821 size_t total_live_words = 0;
822 HeapWord* full_region_prefix_end = nullptr;
823 {
824 // old-gen
825 size_t live_words = _summary_data.live_words_in_space(old_space,
826 &full_region_prefix_end);
827 total_live_words += live_words;
828 }
829 // young-gen
830 for (uint i = eden_space_id; i < last_space_id; ++i) {
831 const MutableSpace* space = _space_info[i].space();
832 size_t live_words = _summary_data.live_words_in_space(space);
833 total_live_words += live_words;
834 _space_info[i].set_new_top(space->bottom() + live_words);
835 _space_info[i].set_dense_prefix(space->bottom());
836 }
837
838 should_do_max_compaction = check_maximum_compaction(should_do_max_compaction,
839 total_live_words,
840 old_space,
841 full_region_prefix_end);
842 {
843 GCTraceTime(Info, gc, phases) tm("Summary Phase: expand", &_gc_timer);
844 // Try to expand old-gen in order to fit all live objs and waste.
845 size_t target_capacity_bytes = total_live_words * HeapWordSize
846 + old_space->capacity_in_bytes() * (MarkSweepDeadRatio / 100);
847 ParallelScavengeHeap::heap()->old_gen()->try_expand_till_size(target_capacity_bytes);
848 }
849
850 HeapWord* dense_prefix_end = should_do_max_compaction
851 ? full_region_prefix_end
852 : compute_dense_prefix_for_old_space(old_space,
853 full_region_prefix_end);
854 SpaceId id = old_space_id;
855 _space_info[id].set_dense_prefix(dense_prefix_end);
856
857 if (dense_prefix_end != old_space->bottom()) {
858 fill_dense_prefix_end(id);
859 }
860
861 // Compacting objs in [dense_prefix_end, old_space->top())
862 _summary_data.summarize(_space_info[id].split_info(),
863 dense_prefix_end, old_space->top(), nullptr,
864 dense_prefix_end, old_space->end(),
865 _space_info[id].new_top_addr());
866 }
867
868 // Summarize the remaining spaces in the young gen. The initial target space
869 // is the old gen. If a space does not fit entirely into the target, then the
870 // remainder is compacted into the space itself and that space becomes the new
871 // target.
872 SpaceId dst_space_id = old_space_id;
873 HeapWord* dst_space_end = old_space->end();
874 HeapWord** new_top_addr = _space_info[dst_space_id].new_top_addr();
875 for (unsigned int id = eden_space_id; id < last_space_id; ++id) {
876 const MutableSpace* space = _space_info[id].space();
877 const size_t live = pointer_delta(_space_info[id].new_top(),
878 space->bottom());
879 const size_t available = pointer_delta(dst_space_end, *new_top_addr);
880
881 if (live > 0 && live <= available) {
882 // All the live data will fit.
883 bool done = _summary_data.summarize(_space_info[id].split_info(),
884 space->bottom(), space->top(),
885 nullptr,
886 *new_top_addr, dst_space_end,
887 new_top_addr);
888 assert(done, "space must fit into old gen");
889
890 // Reset the new_top value for the space.
891 _space_info[id].set_new_top(space->bottom());
892 } else if (live > 0) {
893 // Attempt to fit part of the source space into the target space.
894 HeapWord* next_src_addr = nullptr;
895 bool done = _summary_data.summarize(_space_info[id].split_info(),
896 space->bottom(), space->top(),
897 &next_src_addr,
898 *new_top_addr, dst_space_end,
899 new_top_addr);
900 assert(!done, "space should not fit into old gen");
901 assert(next_src_addr != nullptr, "sanity");
902
903 // The source space becomes the new target, so the remainder is compacted
904 // within the space itself.
905 dst_space_id = SpaceId(id);
906 dst_space_end = space->end();
907 new_top_addr = _space_info[id].new_top_addr();
908 done = _summary_data.summarize(_space_info[id].split_info(),
909 next_src_addr, space->top(),
910 nullptr,
911 space->bottom(), dst_space_end,
912 new_top_addr);
913 assert(done, "space must fit when compacted into itself");
914 assert(*new_top_addr <= space->top(), "usage should not grow");
915 }
916 }
917 }
918
919 void PSParallelCompact::report_object_count_after_gc() {
920 GCTraceTime(Debug, gc, phases) tm("Report Object Count", &_gc_timer);
921 // The heap is compacted, all objects are iterable. However there may be
922 // filler objects in the heap which we should ignore.
923 class SkipFillerObjectClosure : public BoolObjectClosure {
924 public:
925 bool do_object_b(oop obj) override { return !CollectedHeap::is_filler_object(obj); }
926 } cl;
927 _gc_tracer.report_object_count_after_gc(&cl, &ParallelScavengeHeap::heap()->workers());
928 }
929
930 bool PSParallelCompact::invoke(bool clear_all_soft_refs, bool should_do_max_compaction) {
931 assert(SafepointSynchronize::is_at_safepoint(), "should be at safepoint");
932 assert(Thread::current() == (Thread*)VMThread::vm_thread(),
933 "should be in vm thread");
934 assert(ref_processor() != nullptr, "Sanity");
935
936 SvcGCMarker sgcm(SvcGCMarker::FULL);
937 IsSTWGCActiveMark mark;
938
939 ParallelScavengeHeap* heap = ParallelScavengeHeap::heap();
940
941 GCIdMark gc_id_mark;
942 _gc_timer.register_gc_start();
943 _gc_tracer.report_gc_start(heap->gc_cause(), _gc_timer.gc_start());
944
945 GCCause::Cause gc_cause = heap->gc_cause();
946 PSOldGen* old_gen = heap->old_gen();
947 PSAdaptiveSizePolicy* size_policy = heap->size_policy();
948
949 // Make sure data structures are sane, make the heap parsable, and do other
950 // miscellaneous bookkeeping.
951 pre_compact();
952
953 const PreGenGCValues pre_gc_values = heap->get_pre_gc_values();
954
955 {
956 const uint active_workers =
957 WorkerPolicy::calc_active_workers(ParallelScavengeHeap::heap()->workers().max_workers(),
958 ParallelScavengeHeap::heap()->workers().active_workers(),
959 Threads::number_of_non_daemon_threads());
960 ParallelScavengeHeap::heap()->workers().set_active_workers(active_workers);
961
962 GCTraceCPUTime tcpu(&_gc_tracer);
963 GCTraceTime(Info, gc) tm("Pause Full", nullptr, gc_cause, true);
964
965 heap->pre_full_gc_dump(&_gc_timer);
966
967 TraceCollectorStats tcs(counters());
968 TraceMemoryManagerStats tms(heap->old_gc_manager(), gc_cause, "end of major GC");
969
970 if (log_is_enabled(Debug, gc, heap, exit)) {
971 accumulated_time()->start();
972 }
973
974 // Let the size policy know we're starting
975 size_policy->major_collection_begin();
976
977 #ifdef COMPILER2
978 DerivedPointerTable::clear();
979 #endif // COMPILER2
980
981 ref_processor()->start_discovery(clear_all_soft_refs);
982
983 marking_phase(&_gc_tracer);
984
985 summary_phase(should_do_max_compaction);
986
987 #ifdef COMPILER2
988 assert(DerivedPointerTable::is_active(), "Sanity");
989 DerivedPointerTable::set_active(false);
990 #endif // COMPILER2
991
992 forward_to_new_addr();
993
994 adjust_pointers();
995
996 compact();
997
998 ParCompactionManager::_preserved_marks_set->restore(&ParallelScavengeHeap::heap()->workers());
999
1000 ParCompactionManager::verify_all_region_stack_empty();
1001
1002 // Reset the mark bitmap, summary data, and do other bookkeeping. Must be
1003 // done before resizing.
1004 post_compact();
1005
1006 size_policy->major_collection_end();
1007
1008 size_policy->sample_old_gen_used_bytes(MAX2(pre_gc_values.old_gen_used(), old_gen->used_in_bytes()));
1009
1010 if (UseAdaptiveSizePolicy) {
1011 heap->resize_after_full_gc();
1012 }
1013
1014 heap->resize_all_tlabs();
1015
1016 // Resize the metaspace capacity after a collection
1017 MetaspaceGC::compute_new_size();
1018
1019 if (log_is_enabled(Debug, gc, heap, exit)) {
1020 accumulated_time()->stop();
1021 }
1022
1023 heap->print_heap_change(pre_gc_values);
1024
1025 report_object_count_after_gc();
1026
1027 // Track memory usage and detect low memory
1028 MemoryService::track_memory_usage();
1029 heap->update_counters();
1030
1031 heap->post_full_gc_dump(&_gc_timer);
1032
1033 size_policy->record_gc_pause_end_instant();
1034 }
1035
1036 heap->gc_epilogue(true);
1037
1038 if (VerifyAfterGC && heap->total_collections() >= VerifyGCStartAt) {
1039 Universe::verify("After GC");
1040 }
1041
1042 heap->print_after_gc();
1043 heap->trace_heap_after_gc(&_gc_tracer);
1044
1045 _gc_timer.register_gc_end();
1046
1047 _gc_tracer.report_dense_prefix(dense_prefix(old_space_id));
1048 _gc_tracer.report_gc_end(_gc_timer.gc_end(), _gc_timer.time_partitions());
1049
1050 return true;
1051 }
1052
1053 class PCAddThreadRootsMarkingTaskClosure : public ThreadClosure {
1054 ParCompactionManager* _cm;
1055
1056 public:
1057 PCAddThreadRootsMarkingTaskClosure(ParCompactionManager* cm) : _cm(cm) { }
1058 void do_thread(Thread* thread) {
1059 ResourceMark rm;
1060
1061 MarkingNMethodClosure mark_and_push_in_blobs(&_cm->_mark_and_push_closure);
1062
1063 thread->oops_do(&_cm->_mark_and_push_closure, &mark_and_push_in_blobs);
1064
1065 // Do the real work
1066 _cm->follow_marking_stacks();
1067 }
1068 };
1069
1070 void steal_marking_work(TaskTerminator& terminator, uint worker_id) {
1071 assert(ParallelScavengeHeap::heap()->is_stw_gc_active(), "called outside gc");
1072
1073 ParCompactionManager* cm =
1074 ParCompactionManager::gc_thread_compaction_manager(worker_id);
1075
1076 do {
1077 ScannerTask task;
1078 if (ParCompactionManager::steal(worker_id, task)) {
1079 cm->follow_contents(task, true);
1080 }
1081 cm->follow_marking_stacks();
1082 } while (!terminator.offer_termination());
1083 }
1084
1085 class MarkFromRootsTask : public WorkerTask {
1086 NMethodMarkingScope _nmethod_marking_scope;
1087 ThreadsClaimTokenScope _threads_claim_token_scope;
1088 OopStorageSetStrongParState<false /* concurrent */, false /* is_const */> _oop_storage_set_par_state;
1089 TaskTerminator _terminator;
1090 uint _active_workers;
1091
1092 public:
1093 MarkFromRootsTask(uint active_workers) :
1094 WorkerTask("MarkFromRootsTask"),
1095 _nmethod_marking_scope(),
1096 _threads_claim_token_scope(),
1097 _terminator(active_workers, ParCompactionManager::marking_stacks()),
1098 _active_workers(active_workers) {}
1099
1100 virtual void work(uint worker_id) {
1101 ParCompactionManager* cm = ParCompactionManager::gc_thread_compaction_manager(worker_id);
1102 cm->create_marking_stats_cache();
1103 {
1104 CLDToOopClosure cld_closure(&cm->_mark_and_push_closure, ClassLoaderData::_claim_stw_fullgc_mark);
1105 ClassLoaderDataGraph::always_strong_cld_do(&cld_closure);
1106
1107 // Do the real work
1108 cm->follow_marking_stacks();
1109 }
1110
1111 {
1112 PCAddThreadRootsMarkingTaskClosure closure(cm);
1113 Threads::possibly_parallel_threads_do(_active_workers > 1 /* is_par */, &closure);
1114 }
1115
1116 // Mark from OopStorages
1117 {
1118 _oop_storage_set_par_state.oops_do(&cm->_mark_and_push_closure);
1119 // Do the real work
1120 cm->follow_marking_stacks();
1121 }
1122
1123 if (_active_workers > 1) {
1124 steal_marking_work(_terminator, worker_id);
1125 }
1126 }
1127 };
1128
1129 class ParallelCompactRefProcProxyTask : public RefProcProxyTask {
1130 TaskTerminator _terminator;
1131
1132 public:
1133 ParallelCompactRefProcProxyTask(uint max_workers)
1134 : RefProcProxyTask("ParallelCompactRefProcProxyTask", max_workers),
1135 _terminator(_max_workers, ParCompactionManager::marking_stacks()) {}
1136
1137 void work(uint worker_id) override {
1138 assert(worker_id < _max_workers, "sanity");
1139 ParCompactionManager* cm = (_tm == RefProcThreadModel::Single) ? ParCompactionManager::get_vmthread_cm() : ParCompactionManager::gc_thread_compaction_manager(worker_id);
1140 BarrierEnqueueDiscoveredFieldClosure enqueue;
1141 ParCompactionManager::FollowStackClosure complete_gc(cm, (_tm == RefProcThreadModel::Single) ? nullptr : &_terminator, worker_id);
1142 _rp_task->rp_work(worker_id, PSParallelCompact::is_alive_closure(), &cm->_mark_and_push_closure, &enqueue, &complete_gc);
1143 }
1144
1145 void prepare_run_task_hook() override {
1146 _terminator.reset_for_reuse(_queue_count);
1147 }
1148 };
1149
1150 static void flush_marking_stats_cache(const uint num_workers) {
1151 for (uint i = 0; i < num_workers; ++i) {
1152 ParCompactionManager* cm = ParCompactionManager::gc_thread_compaction_manager(i);
1153 cm->flush_and_destroy_marking_stats_cache();
1154 }
1155 }
1156
1157 class PSParallelCleaningTask : public WorkerTask {
1158 bool _unloading_occurred;
1159 CodeCacheUnloadingTask _code_cache_task;
1160 // Prune dead klasses from subklass/sibling/implementor lists.
1161 KlassCleaningTask _klass_cleaning_task;
1162
1163 public:
1164 PSParallelCleaningTask(bool unloading_occurred) :
1165 WorkerTask("PS Parallel Cleaning"),
1166 _unloading_occurred(unloading_occurred),
1167 _code_cache_task(unloading_occurred),
1168 _klass_cleaning_task() {}
1169
1170 void work(uint worker_id) {
1171 // Do first pass of code cache cleaning.
1172 _code_cache_task.work(worker_id);
1173
1174 // Clean all klasses that were not unloaded.
1175 // The weak metadata in klass doesn't need to be
1176 // processed if there was no unloading.
1177 if (_unloading_occurred) {
1178 _klass_cleaning_task.work();
1179 }
1180 }
1181 };
1182
1183 void PSParallelCompact::marking_phase(ParallelOldTracer *gc_tracer) {
1184 // Recursively traverse all live objects and mark them
1185 GCTraceTime(Info, gc, phases) tm("Marking Phase", &_gc_timer);
1186
1187 uint active_gc_threads = ParallelScavengeHeap::heap()->workers().active_workers();
1188
1189 ClassLoaderDataGraph::verify_claimed_marks_cleared(ClassLoaderData::_claim_stw_fullgc_mark);
1190 {
1191 GCTraceTime(Debug, gc, phases) tm("Par Mark", &_gc_timer);
1192
1193 MarkFromRootsTask task(active_gc_threads);
1194 ParallelScavengeHeap::heap()->workers().run_task(&task);
1195 }
1196
1197 // Process reference objects found during marking
1198 {
1199 GCTraceTime(Debug, gc, phases) tm("Reference Processing", &_gc_timer);
1200
1201 ReferenceProcessorStats stats;
1202 ReferenceProcessorPhaseTimes pt(&_gc_timer, ref_processor()->max_num_queues());
1203
1204 ParallelCompactRefProcProxyTask task(ref_processor()->max_num_queues());
1205 stats = ref_processor()->process_discovered_references(task, &ParallelScavengeHeap::heap()->workers(), pt);
1206
1207 gc_tracer->report_gc_reference_stats(stats);
1208 pt.print_all_references();
1209 }
1210
1211 {
1212 GCTraceTime(Debug, gc, phases) tm("Flush Marking Stats", &_gc_timer);
1213
1214 flush_marking_stats_cache(active_gc_threads);
1215 }
1216
1217 // This is the point where the entire marking should have completed.
1218 ParCompactionManager::verify_all_marking_stack_empty();
1219
1220 {
1221 GCTraceTime(Debug, gc, phases) tm("Weak Processing", &_gc_timer);
1222 WeakProcessor::weak_oops_do(&ParallelScavengeHeap::heap()->workers(),
1223 is_alive_closure(),
1224 &do_nothing_cl,
1225 1);
1226 }
1227
1228 {
1229 GCTraceTime(Debug, gc, phases) tm_m("Class Unloading", &_gc_timer);
1230
1231 ClassUnloadingContext ctx(active_gc_threads /* num_nmethod_unlink_workers */,
1232 false /* unregister_nmethods_during_purge */,
1233 false /* lock_nmethod_free_separately */);
1234
1235 {
1236 CodeCache::UnlinkingScope scope(is_alive_closure());
1237
1238 // Follow system dictionary roots and unload classes.
1239 bool unloading_occurred = SystemDictionary::do_unloading(&_gc_timer);
1240
1241 PSParallelCleaningTask task{unloading_occurred};
1242 ParallelScavengeHeap::heap()->workers().run_task(&task);
1243 }
1244
1245 {
1246 GCTraceTime(Debug, gc, phases) t("Purge Unlinked NMethods", gc_timer());
1247 // Release unloaded nmethod's memory.
1248 ctx.purge_nmethods();
1249 }
1250 {
1251 GCTraceTime(Debug, gc, phases) ur("Unregister NMethods", &_gc_timer);
1252 ParallelScavengeHeap::heap()->prune_unlinked_nmethods();
1253 }
1254 {
1255 GCTraceTime(Debug, gc, phases) t("Free Code Blobs", gc_timer());
1256 ctx.free_nmethods();
1257 }
1258 {
1259 // Delete metaspaces for unloaded class loaders and clean up loader_data graph
1260 GCTraceTime(Debug, gc, phases) t("Purge Class Loader Data", gc_timer());
1261 ClassLoaderDataGraph::purge(true /* at_safepoint */);
1262 DEBUG_ONLY(MetaspaceUtils::verify();)
1263 }
1264 }
1265
1266 #if TASKQUEUE_STATS
1267 ParCompactionManager::print_and_reset_taskqueue_stats();
1268 #endif
1269 }
1270
1271 template<typename Func>
1272 void PSParallelCompact::adjust_in_space_helper(SpaceId id, Atomic<uint>* claim_counter, Func&& on_stripe) {
1273 MutableSpace* sp = PSParallelCompact::space(id);
1274 HeapWord* const bottom = sp->bottom();
1275 HeapWord* const top = sp->top();
1276 if (bottom == top) {
1277 return;
1278 }
1279
1280 const uint num_regions_per_stripe = 2;
1281 const size_t region_size = ParallelCompactData::RegionSize;
1282 const size_t stripe_size = num_regions_per_stripe * region_size;
1283
1284 while (true) {
1285 uint counter = claim_counter->fetch_then_add(num_regions_per_stripe);
1286 HeapWord* cur_stripe = bottom + counter * region_size;
1287 if (cur_stripe >= top) {
1288 break;
1289 }
1290 HeapWord* stripe_end = MIN2(cur_stripe + stripe_size, top);
1291 on_stripe(cur_stripe, stripe_end);
1292 }
1293 }
1294
1295 void PSParallelCompact::adjust_in_old_space(Atomic<uint>* claim_counter) {
1296 // Regions in old-space shouldn't be split.
1297 assert(!_space_info[old_space_id].split_info().is_valid(), "inv");
1298
1299 auto scan_obj_with_limit = [&] (HeapWord* obj_start, HeapWord* left, HeapWord* right) {
1300 assert(mark_bitmap()->is_marked(obj_start), "inv");
1301 oop obj = cast_to_oop(obj_start);
1302 return obj->oop_iterate_size(&pc_adjust_pointer_closure, MemRegion(left, right));
1303 };
1304
1305 adjust_in_space_helper(old_space_id, claim_counter, [&] (HeapWord* stripe_start, HeapWord* stripe_end) {
1306 assert(_summary_data.is_region_aligned(stripe_start), "inv");
1307 RegionData* cur_region = _summary_data.addr_to_region_ptr(stripe_start);
1308 HeapWord* obj_start;
1309 if (cur_region->partial_obj_size() != 0) {
1310 obj_start = cur_region->partial_obj_addr();
1311 obj_start += scan_obj_with_limit(obj_start, stripe_start, stripe_end);
1312 } else {
1313 obj_start = stripe_start;
1314 }
1315
1316 while (obj_start < stripe_end) {
1317 obj_start = mark_bitmap()->find_obj_beg(obj_start, stripe_end);
1318 if (obj_start >= stripe_end) {
1319 break;
1320 }
1321 obj_start += scan_obj_with_limit(obj_start, stripe_start, stripe_end);
1322 }
1323 });
1324 }
1325
1326 void PSParallelCompact::adjust_in_young_space(SpaceId id, Atomic<uint>* claim_counter) {
1327 adjust_in_space_helper(id, claim_counter, [](HeapWord* stripe_start, HeapWord* stripe_end) {
1328 HeapWord* obj_start = stripe_start;
1329 while (obj_start < stripe_end) {
1330 obj_start = mark_bitmap()->find_obj_beg(obj_start, stripe_end);
1331 if (obj_start >= stripe_end) {
1332 break;
1333 }
1334 oop obj = cast_to_oop(obj_start);
1335 obj_start += obj->oop_iterate_size(&pc_adjust_pointer_closure);
1336 }
1337 });
1338 }
1339
1340 void PSParallelCompact::adjust_pointers_in_spaces(uint worker_id, Atomic<uint>* claim_counters) {
1341 auto start_time = Ticks::now();
1342 adjust_in_old_space(&claim_counters[0]);
1343 for (uint id = eden_space_id; id < last_space_id; ++id) {
1344 adjust_in_young_space(SpaceId(id), &claim_counters[id]);
1345 }
1346 log_trace(gc, phases)("adjust_pointers_in_spaces worker %u: %.3f ms", worker_id, (Ticks::now() - start_time).seconds() * 1000);
1347 }
1348
1349 class PSAdjustTask final : public WorkerTask {
1350 ThreadsClaimTokenScope _threads_claim_token_scope;
1351 WeakProcessor::Task _weak_proc_task;
1352 OopStorageSetStrongParState<false, false> _oop_storage_iter;
1353 uint _nworkers;
1354 Atomic<bool> _code_cache_claimed;
1355 Atomic<uint> _claim_counters[PSParallelCompact::last_space_id];
1356
1357 bool try_claim_code_cache_task() {
1358 return _code_cache_claimed.load_relaxed() == false
1359 && _code_cache_claimed.compare_set(false, true);
1360 }
1361
1362 public:
1363 PSAdjustTask(uint nworkers) :
1364 WorkerTask("PSAdjust task"),
1365 _threads_claim_token_scope(),
1366 _weak_proc_task(nworkers),
1367 _oop_storage_iter(),
1368 _nworkers(nworkers),
1369 _code_cache_claimed(false),
1370 _claim_counters{} {
1371
1372 ClassLoaderDataGraph::verify_claimed_marks_cleared(ClassLoaderData::_claim_stw_fullgc_adjust);
1373 }
1374
1375 void work(uint worker_id) {
1376 {
1377 // Pointers in heap.
1378 ParCompactionManager* cm = ParCompactionManager::gc_thread_compaction_manager(worker_id);
1379 cm->preserved_marks()->adjust_during_full_gc();
1380
1381 PSParallelCompact::adjust_pointers_in_spaces(worker_id, _claim_counters);
1382 }
1383
1384 {
1385 // All (strong and weak) CLDs.
1386 CLDToOopClosure cld_closure(&pc_adjust_pointer_closure, ClassLoaderData::_claim_stw_fullgc_adjust);
1387 ClassLoaderDataGraph::cld_do(&cld_closure);
1388 }
1389
1390 {
1391 // Threads stack frames. No need to visit on-stack nmethods, because all
1392 // nmethods are visited in one go via CodeCache::nmethods_do.
1393 ResourceMark rm;
1394 Threads::possibly_parallel_oops_do(_nworkers > 1, &pc_adjust_pointer_closure, nullptr);
1395 if (try_claim_code_cache_task()) {
1396 NMethodToOopClosure adjust_code(&pc_adjust_pointer_closure, NMethodToOopClosure::FixRelocations);
1397 CodeCache::nmethods_do(&adjust_code);
1398 }
1399 }
1400
1401 {
1402 // VM internal strong and weak roots.
1403 _oop_storage_iter.oops_do(&pc_adjust_pointer_closure);
1404 AlwaysTrueClosure always_alive;
1405 _weak_proc_task.work(worker_id, &always_alive, &pc_adjust_pointer_closure);
1406 }
1407 }
1408 };
1409
1410 void PSParallelCompact::adjust_pointers() {
1411 // Adjust the pointers to reflect the new locations
1412 GCTraceTime(Info, gc, phases) tm("Adjust Pointers", &_gc_timer);
1413 uint nworkers = ParallelScavengeHeap::heap()->workers().active_workers();
1414 PSAdjustTask task(nworkers);
1415 ParallelScavengeHeap::heap()->workers().run_task(&task);
1416 }
1417
1418 // Split [start, end) evenly for a number of workers and return the
1419 // range for worker_id.
1420 static void split_regions_for_worker(size_t start, size_t end,
1421 uint worker_id, uint num_workers,
1422 size_t* worker_start, size_t* worker_end) {
1423 assert(start < end, "precondition");
1424 assert(num_workers > 0, "precondition");
1425 assert(worker_id < num_workers, "precondition");
1426
1427 size_t num_regions = end - start;
1428 size_t num_regions_per_worker = num_regions / num_workers;
1429 size_t remainder = num_regions % num_workers;
1430 // The first few workers will get one extra.
1431 *worker_start = start + worker_id * num_regions_per_worker
1432 + MIN2(checked_cast<size_t>(worker_id), remainder);
1433 *worker_end = *worker_start + num_regions_per_worker
1434 + (worker_id < remainder ? 1 : 0);
1435 }
1436
1437 void PSParallelCompact::forward_to_new_addr() {
1438 GCTraceTime(Info, gc, phases) tm("Forward", &_gc_timer);
1439 uint nworkers = ParallelScavengeHeap::heap()->workers().active_workers();
1440
1441 struct ForwardTask final : public WorkerTask {
1442 uint _num_workers;
1443
1444 explicit ForwardTask(uint num_workers) :
1445 WorkerTask("PSForward task"),
1446 _num_workers(num_workers) {}
1447
1448 static void forward_objs_in_range(ParCompactionManager* cm,
1449 HeapWord* start,
1450 HeapWord* end,
1451 HeapWord* destination) {
1452 HeapWord* cur_addr = start;
1453 HeapWord* new_addr = destination;
1454
1455 while (cur_addr < end) {
1456 cur_addr = mark_bitmap()->find_obj_beg(cur_addr, end);
1457 if (cur_addr >= end) {
1458 return;
1459 }
1460 assert(mark_bitmap()->is_marked(cur_addr), "inv");
1461 oop obj = cast_to_oop(cur_addr);
1462 if (new_addr != cur_addr) {
1463 cm->preserved_marks()->push_if_necessary(obj, obj->mark());
1464 FullGCForwarding::forward_to(obj, cast_to_oop(new_addr));
1465 }
1466 size_t obj_size = obj->size();
1467 new_addr += obj_size;
1468 cur_addr += obj_size;
1469 }
1470 }
1471
1472 void work(uint worker_id) override {
1473 ParCompactionManager* cm = ParCompactionManager::gc_thread_compaction_manager(worker_id);
1474 for (uint id = old_space_id; id < last_space_id; ++id) {
1475 MutableSpace* sp = PSParallelCompact::space(SpaceId(id));
1476 HeapWord* dense_prefix_addr = dense_prefix(SpaceId(id));
1477 HeapWord* top = sp->top();
1478
1479 if (dense_prefix_addr == top) {
1480 // Empty space
1481 continue;
1482 }
1483
1484 const SplitInfo& split_info = _space_info[SpaceId(id)].split_info();
1485 size_t dense_prefix_region = _summary_data.addr_to_region_idx(dense_prefix_addr);
1486 size_t top_region = _summary_data.addr_to_region_idx(_summary_data.region_align_up(top));
1487 size_t start_region;
1488 size_t end_region;
1489 split_regions_for_worker(dense_prefix_region, top_region,
1490 worker_id, _num_workers,
1491 &start_region, &end_region);
1492 for (size_t cur_region = start_region; cur_region < end_region; ++cur_region) {
1493 RegionData* region_ptr = _summary_data.region(cur_region);
1494 size_t partial_obj_size = region_ptr->partial_obj_size();
1495
1496 if (partial_obj_size == ParallelCompactData::RegionSize) {
1497 // No obj-start
1498 continue;
1499 }
1500
1501 HeapWord* region_start = _summary_data.region_to_addr(cur_region);
1502 HeapWord* region_end = region_start + ParallelCompactData::RegionSize;
1503
1504 if (split_info.is_split(cur_region)) {
1505 // Part 1: will be relocated to space-1
1506 HeapWord* preceding_destination = split_info.preceding_destination();
1507 HeapWord* split_point = split_info.split_point();
1508 forward_objs_in_range(cm, region_start + partial_obj_size, split_point, preceding_destination + partial_obj_size);
1509
1510 // Part 2: will be relocated to space-2
1511 HeapWord* destination = region_ptr->destination();
1512 forward_objs_in_range(cm, split_point, region_end, destination);
1513 } else {
1514 HeapWord* destination = region_ptr->destination();
1515 forward_objs_in_range(cm, region_start + partial_obj_size, region_end, destination + partial_obj_size);
1516 }
1517 }
1518 }
1519 }
1520 } task(nworkers);
1521
1522 ParallelScavengeHeap::heap()->workers().run_task(&task);
1523 DEBUG_ONLY(verify_forward();)
1524 }
1525
1526 #ifdef ASSERT
1527 void PSParallelCompact::verify_forward() {
1528 HeapWord* const old_dense_prefix_addr = dense_prefix(SpaceId(old_space_id));
1529 // The destination addr for the first live obj after dense-prefix.
1530 HeapWord* bump_ptr = old_dense_prefix_addr
1531 + _summary_data.addr_to_region_ptr(old_dense_prefix_addr)->partial_obj_size();
1532 SpaceId bump_ptr_space = old_space_id;
1533
1534 for (uint id = old_space_id; id < last_space_id; ++id) {
1535 MutableSpace* sp = PSParallelCompact::space(SpaceId(id));
1536 // Only verify objs after dense-prefix, because those before dense-prefix are not moved (forwarded).
1537 HeapWord* cur_addr = dense_prefix(SpaceId(id));
1538 HeapWord* top = sp->top();
1539
1540 while (cur_addr < top) {
1541 cur_addr = mark_bitmap()->find_obj_beg(cur_addr, top);
1542 if (cur_addr >= top) {
1543 break;
1544 }
1545 assert(mark_bitmap()->is_marked(cur_addr), "inv");
1546 assert(bump_ptr <= _space_info[bump_ptr_space].new_top(), "inv");
1547 // Move to the space containing cur_addr
1548 if (bump_ptr == _space_info[bump_ptr_space].new_top()) {
1549 bump_ptr = space(space_id(cur_addr))->bottom();
1550 bump_ptr_space = space_id(bump_ptr);
1551 }
1552 oop obj = cast_to_oop(cur_addr);
1553 if (cur_addr == bump_ptr) {
1554 assert(!FullGCForwarding::is_forwarded(obj), "inv");
1555 } else {
1556 assert(FullGCForwarding::forwardee(obj) == cast_to_oop(bump_ptr), "inv");
1557 }
1558 bump_ptr += obj->size();
1559 cur_addr += obj->size();
1560 }
1561 }
1562 }
1563 #endif
1564
1565 // Helper class to print 8 region numbers per line and then print the total at the end.
1566 class FillableRegionLogger : public StackObj {
1567 private:
1568 Log(gc, compaction) log;
1569 static const int LineLength = 8;
1570 size_t _regions[LineLength];
1571 int _next_index;
1572 bool _enabled;
1573 size_t _total_regions;
1574 public:
1575 FillableRegionLogger() : _next_index(0), _enabled(log_develop_is_enabled(Trace, gc, compaction)), _total_regions(0) { }
1576 ~FillableRegionLogger() {
1577 log.trace("%zu initially fillable regions", _total_regions);
1578 }
1579
1580 void print_line() {
1581 if (!_enabled || _next_index == 0) {
1582 return;
1583 }
1584 FormatBuffer<> line("Fillable: ");
1585 for (int i = 0; i < _next_index; i++) {
1586 line.append(" %7zu", _regions[i]);
1587 }
1588 log.trace("%s", line.buffer());
1589 _next_index = 0;
1590 }
1591
1592 void handle(size_t region) {
1593 if (!_enabled) {
1594 return;
1595 }
1596 _regions[_next_index++] = region;
1597 if (_next_index == LineLength) {
1598 print_line();
1599 }
1600 _total_regions++;
1601 }
1602 };
1603
1604 void PSParallelCompact::prepare_region_draining_tasks(uint parallel_gc_threads)
1605 {
1606 GCTraceTime(Trace, gc, phases) tm("Drain Task Setup", &_gc_timer);
1607
1608 // Find the threads that are active
1609 uint worker_id = 0;
1610
1611 // Find all regions that are available (can be filled immediately) and
1612 // distribute them to the thread stacks. The iteration is done in reverse
1613 // order (high to low) so the regions will be removed in ascending order.
1614
1615 const ParallelCompactData& sd = PSParallelCompact::summary_data();
1616
1617 // id + 1 is used to test termination so unsigned can
1618 // be used with an old_space_id == 0.
1619 FillableRegionLogger region_logger;
1620 for (unsigned int id = last_space_id - 1; id + 1 > old_space_id; --id) {
1621 SpaceInfo* const space_info = _space_info + id;
1622 HeapWord* const new_top = space_info->new_top();
1623
1624 const size_t beg_region = sd.addr_to_region_idx(space_info->dense_prefix());
1625 const size_t end_region =
1626 sd.addr_to_region_idx(sd.region_align_up(new_top));
1627
1628 for (size_t cur = end_region - 1; cur + 1 > beg_region; --cur) {
1629 if (sd.region(cur)->claim_unsafe()) {
1630 ParCompactionManager* cm = ParCompactionManager::gc_thread_compaction_manager(worker_id);
1631 bool result = sd.region(cur)->mark_normal();
1632 assert(result, "Must succeed at this point.");
1633 cm->region_stack()->push(cur);
1634 region_logger.handle(cur);
1635 // Assign regions to tasks in round-robin fashion.
1636 if (++worker_id == parallel_gc_threads) {
1637 worker_id = 0;
1638 }
1639 }
1640 }
1641 region_logger.print_line();
1642 }
1643 }
1644
1645 static void compaction_with_stealing_work(TaskTerminator* terminator, uint worker_id) {
1646 assert(ParallelScavengeHeap::heap()->is_stw_gc_active(), "called outside gc");
1647
1648 ParCompactionManager* cm =
1649 ParCompactionManager::gc_thread_compaction_manager(worker_id);
1650
1651 // Drain the stacks that have been preloaded with regions
1652 // that are ready to fill.
1653
1654 cm->drain_region_stacks();
1655
1656 guarantee(cm->region_stack()->is_empty(), "Not empty");
1657
1658 size_t region_index = 0;
1659
1660 while (true) {
1661 if (ParCompactionManager::steal(worker_id, region_index)) {
1662 PSParallelCompact::fill_and_update_region(cm, region_index);
1663 cm->drain_region_stacks();
1664 } else if (PSParallelCompact::steal_unavailable_region(cm, region_index)) {
1665 // Fill and update an unavailable region with the help of a shadow region
1666 PSParallelCompact::fill_and_update_shadow_region(cm, region_index);
1667 cm->drain_region_stacks();
1668 } else {
1669 if (terminator->offer_termination()) {
1670 break;
1671 }
1672 // Go around again.
1673 }
1674 }
1675 }
1676
1677 class FillDensePrefixAndCompactionTask: public WorkerTask {
1678 TaskTerminator _terminator;
1679
1680 public:
1681 FillDensePrefixAndCompactionTask(uint active_workers) :
1682 WorkerTask("FillDensePrefixAndCompactionTask"),
1683 _terminator(active_workers, ParCompactionManager::region_task_queues()) {
1684 }
1685
1686 virtual void work(uint worker_id) {
1687 if (worker_id == 0) {
1688 auto start = Ticks::now();
1689 PSParallelCompact::fill_dead_objs_in_dense_prefix();
1690 log_trace(gc, phases)("Fill dense prefix by worker 0: %.3f ms", (Ticks::now() - start).seconds() * 1000);
1691 }
1692 compaction_with_stealing_work(&_terminator, worker_id);
1693 }
1694 };
1695
1696 void PSParallelCompact::fill_range_in_dense_prefix(HeapWord* start, HeapWord* end) {
1697 #ifdef ASSERT
1698 {
1699 assert(start < end, "precondition");
1700 assert(mark_bitmap()->find_obj_beg(start, end) == end, "precondition");
1701 HeapWord* bottom = _space_info[old_space_id].space()->bottom();
1702 if (start != bottom) {
1703 // The preceding live obj.
1704 HeapWord* obj_start = mark_bitmap()->find_obj_beg_reverse(bottom, start);
1705 HeapWord* obj_end = obj_start + cast_to_oop(obj_start)->size();
1706 assert(obj_end == start, "precondition");
1707 }
1708 }
1709 #endif
1710
1711 CollectedHeap::fill_with_objects(start, pointer_delta(end, start));
1712 HeapWord* addr = start;
1713 do {
1714 size_t size = cast_to_oop(addr)->size();
1715 start_array(old_space_id)->update_for_block(addr, addr + size);
1716 addr += size;
1717 } while (addr < end);
1718 }
1719
1720 void PSParallelCompact::fill_dead_objs_in_dense_prefix() {
1721 ParMarkBitMap* bitmap = mark_bitmap();
1722
1723 HeapWord* const bottom = _space_info[old_space_id].space()->bottom();
1724 HeapWord* const prefix_end = dense_prefix(old_space_id);
1725
1726 const size_t region_size = ParallelCompactData::RegionSize;
1727
1728 // Fill dead space in [start_addr, end_addr)
1729 HeapWord* const start_addr = bottom;
1730 HeapWord* const end_addr = prefix_end;
1731
1732 for (HeapWord* cur_addr = start_addr; cur_addr < end_addr; /* empty */) {
1733 RegionData* cur_region_ptr = _summary_data.addr_to_region_ptr(cur_addr);
1734 if (cur_region_ptr->data_size() == region_size) {
1735 // Full; no dead space. Next region.
1736 if (_summary_data.is_region_aligned(cur_addr)) {
1737 cur_addr += region_size;
1738 } else {
1739 cur_addr = _summary_data.region_align_up(cur_addr);
1740 }
1741 continue;
1742 }
1743
1744 // Fill dead space inside cur_region.
1745 if (_summary_data.is_region_aligned(cur_addr)) {
1746 cur_addr += cur_region_ptr->partial_obj_size();
1747 }
1748
1749 HeapWord* region_end_addr = _summary_data.region_align_up(cur_addr + 1);
1750 assert(region_end_addr <= end_addr, "inv");
1751 while (cur_addr < region_end_addr) {
1752 // Use end_addr to allow filler-obj to cross region boundary.
1753 HeapWord* live_start = bitmap->find_obj_beg(cur_addr, end_addr);
1754 if (cur_addr != live_start) {
1755 // Found dead space [cur_addr, live_start).
1756 fill_range_in_dense_prefix(cur_addr, live_start);
1757 }
1758 if (live_start >= region_end_addr) {
1759 cur_addr = live_start;
1760 break;
1761 }
1762 assert(bitmap->is_marked(live_start), "inv");
1763 cur_addr = live_start + cast_to_oop(live_start)->size();
1764 }
1765 }
1766 }
1767
1768 void PSParallelCompact::compact() {
1769 GCTraceTime(Info, gc, phases) tm("Compaction Phase", &_gc_timer);
1770
1771 uint active_gc_threads = ParallelScavengeHeap::heap()->workers().active_workers();
1772
1773 initialize_shadow_regions(active_gc_threads);
1774 prepare_region_draining_tasks(active_gc_threads);
1775
1776 {
1777 GCTraceTime(Trace, gc, phases) tm("Par Compact", &_gc_timer);
1778
1779 FillDensePrefixAndCompactionTask task(active_gc_threads);
1780 ParallelScavengeHeap::heap()->workers().run_task(&task);
1781
1782 #ifdef ASSERT
1783 verify_filler_in_dense_prefix();
1784
1785 // Verify that all regions have been processed.
1786 for (unsigned int id = old_space_id; id < last_space_id; ++id) {
1787 verify_complete(SpaceId(id));
1788 }
1789 #endif
1790 }
1791 }
1792
1793 #ifdef ASSERT
1794 void PSParallelCompact::verify_filler_in_dense_prefix() {
1795 HeapWord* bottom = _space_info[old_space_id].space()->bottom();
1796 HeapWord* dense_prefix_end = dense_prefix(old_space_id);
1797
1798 const size_t region_size = ParallelCompactData::RegionSize;
1799
1800 for (HeapWord* cur_addr = bottom; cur_addr < dense_prefix_end; /* empty */) {
1801 RegionData* cur_region_ptr = _summary_data.addr_to_region_ptr(cur_addr);
1802 if (cur_region_ptr->data_size() == region_size) {
1803 // Full; no dead space. Next region.
1804 if (_summary_data.is_region_aligned(cur_addr)) {
1805 cur_addr += region_size;
1806 } else {
1807 cur_addr = _summary_data.region_align_up(cur_addr);
1808 }
1809 continue;
1810 }
1811
1812 // This region contains filler objs.
1813 if (_summary_data.is_region_aligned(cur_addr)) {
1814 cur_addr += cur_region_ptr->partial_obj_size();
1815 }
1816
1817 HeapWord* region_end_addr = _summary_data.region_align_up(cur_addr + 1);
1818 assert(region_end_addr <= dense_prefix_end, "inv");
1819
1820 while (cur_addr < region_end_addr) {
1821 oop obj = cast_to_oop(cur_addr);
1822 oopDesc::verify(obj);
1823 if (!mark_bitmap()->is_marked(cur_addr)) {
1824 assert(CollectedHeap::is_filler_object(cast_to_oop(cur_addr)), "inv");
1825 }
1826 cur_addr += obj->size();
1827 }
1828 }
1829 }
1830
1831 void PSParallelCompact::verify_complete(SpaceId space_id) {
1832 // All Regions served as compaction targets, from dense_prefix() to
1833 // new_top(), should be marked as filled and all Regions between new_top()
1834 // and top() should be available (i.e., should have been emptied).
1835 ParallelCompactData& sd = summary_data();
1836 SpaceInfo si = _space_info[space_id];
1837 HeapWord* new_top_addr = sd.region_align_up(si.new_top());
1838 HeapWord* old_top_addr = sd.region_align_up(si.space()->top());
1839 const size_t beg_region = sd.addr_to_region_idx(si.dense_prefix());
1840 const size_t new_top_region = sd.addr_to_region_idx(new_top_addr);
1841 const size_t old_top_region = sd.addr_to_region_idx(old_top_addr);
1842
1843 size_t cur_region;
1844 for (cur_region = beg_region; cur_region < new_top_region; ++cur_region) {
1845 const RegionData* const c = sd.region(cur_region);
1846 assert(c->completed(), "region %zu not filled: destination_count=%u",
1847 cur_region, c->destination_count());
1848 }
1849
1850 for (cur_region = new_top_region; cur_region < old_top_region; ++cur_region) {
1851 const RegionData* const c = sd.region(cur_region);
1852 assert(c->available(), "region %zu not empty: destination_count=%u",
1853 cur_region, c->destination_count());
1854 }
1855 }
1856 #endif // #ifdef ASSERT
1857
1858 // Return the SpaceId for the space containing addr. If addr is not in the
1859 // heap, last_space_id is returned. In debug mode it expects the address to be
1860 // in the heap and asserts such.
1861 PSParallelCompact::SpaceId PSParallelCompact::space_id(HeapWord* addr) {
1862 assert(ParallelScavengeHeap::heap()->is_in_reserved(addr), "addr not in the heap");
1863
1864 for (unsigned int id = old_space_id; id < last_space_id; ++id) {
1865 if (_space_info[id].space()->contains(addr)) {
1866 return SpaceId(id);
1867 }
1868 }
1869
1870 assert(false, "no space contains the addr");
1871 return last_space_id;
1872 }
1873
1874 // Skip over count live words starting from beg, and return the address of the
1875 // next live word. Callers must also ensure that there are enough live words in
1876 // the range [beg, end) to skip.
1877 HeapWord* PSParallelCompact::skip_live_words(HeapWord* beg, HeapWord* end, size_t count)
1878 {
1879 ParMarkBitMap* m = mark_bitmap();
1880 HeapWord* cur_addr = beg;
1881 while (true) {
1882 cur_addr = m->find_obj_beg(cur_addr, end);
1883 assert(cur_addr < end, "inv");
1884 size_t obj_size = cast_to_oop(cur_addr)->size();
1885 // Strictly greater-than
1886 if (obj_size > count) {
1887 return cur_addr + count;
1888 }
1889 count -= obj_size;
1890 cur_addr += obj_size;
1891 }
1892 }
1893
1894 // On starting to fill a destination region (dest-region), we need to know the
1895 // location of the word that will be at the start of the dest-region after
1896 // compaction. A dest-region can have one or more source regions, but only the
1897 // first source-region contains this location. This location is retrieved by
1898 // calling `first_src_addr` on a dest-region.
1899 // Conversely, a source-region has a dest-region which holds the destination of
1900 // the first live word on this source-region, based on which the destination
1901 // for the rest of live words can be derived.
1902 //
1903 // Note:
1904 // There is some complication due to space-boundary-fragmentation (an obj can't
1905 // cross space-boundary) -- a source-region may be split and behave like two
1906 // distinct regions with their own dest-region, as depicted below.
1907 //
1908 // source-region: region-n
1909 //
1910 // **********************
1911 // | A|A~~~~B|B |
1912 // **********************
1913 // n-1 n n+1
1914 //
1915 // AA, BB denote two live objs. ~~~~ denotes unknown number of live objs.
1916 //
1917 // Assuming the dest-region for region-n is the final region before
1918 // old-space-end and its first-live-word is the middle of AA, the heap content
1919 // will look like the following after compaction:
1920 //
1921 // ************** *************
1922 // A|A~~~~ | |BB |
1923 // ************** *************
1924 // ^ ^
1925 // | old-space-end | eden-space-start
1926 //
1927 // Therefore, in this example, region-n will have two dest-regions:
1928 // 1. the final region in old-space
1929 // 2. the first region in eden-space.
1930 // To handle this special case, we introduce the concept of split-region, whose
1931 // contents are relocated to two spaces. `SplitInfo` captures all necessary
1932 // info about the split, the first part, spliting-point, and the second part.
1933 HeapWord* PSParallelCompact::first_src_addr(HeapWord* const dest_addr,
1934 SpaceId src_space_id,
1935 size_t src_region_idx)
1936 {
1937 const size_t RegionSize = ParallelCompactData::RegionSize;
1938 const ParallelCompactData& sd = summary_data();
1939 assert(sd.is_region_aligned(dest_addr), "precondition");
1940
1941 const RegionData* const src_region_ptr = sd.region(src_region_idx);
1942 assert(src_region_ptr->data_size() > 0, "src region cannot be empty");
1943
1944 const size_t partial_obj_size = src_region_ptr->partial_obj_size();
1945 HeapWord* const src_region_destination = src_region_ptr->destination();
1946
1947 HeapWord* const region_start = sd.region_to_addr(src_region_idx);
1948 HeapWord* const region_end = sd.region_to_addr(src_region_idx) + RegionSize;
1949
1950 // Identify the actual destination for the first live words on this region,
1951 // taking split-region into account.
1952 HeapWord* region_start_destination;
1953 const SplitInfo& split_info = _space_info[src_space_id].split_info();
1954 if (split_info.is_split(src_region_idx)) {
1955 // The second part of this split region; use the recorded split point.
1956 if (dest_addr == src_region_destination) {
1957 return split_info.split_point();
1958 }
1959 region_start_destination = split_info.preceding_destination();
1960 } else {
1961 region_start_destination = src_region_destination;
1962 }
1963
1964 // Calculate the offset to be skipped
1965 size_t words_to_skip = pointer_delta(dest_addr, region_start_destination);
1966
1967 HeapWord* result;
1968 if (partial_obj_size > words_to_skip) {
1969 result = region_start + words_to_skip;
1970 } else {
1971 words_to_skip -= partial_obj_size;
1972 result = skip_live_words(region_start + partial_obj_size, region_end, words_to_skip);
1973 }
1974
1975 if (split_info.is_split(src_region_idx)) {
1976 assert(result < split_info.split_point(), "postcondition");
1977 } else {
1978 assert(result < region_end, "postcondition");
1979 }
1980
1981 return result;
1982 }
1983
1984 void PSParallelCompact::decrement_destination_counts(ParCompactionManager* cm,
1985 SpaceId src_space_id,
1986 size_t beg_region,
1987 HeapWord* end_addr)
1988 {
1989 ParallelCompactData& sd = summary_data();
1990
1991 #ifdef ASSERT
1992 MutableSpace* const src_space = _space_info[src_space_id].space();
1993 HeapWord* const beg_addr = sd.region_to_addr(beg_region);
1994 assert(src_space->contains(beg_addr) || beg_addr == src_space->end(),
1995 "src_space_id does not match beg_addr");
1996 assert(src_space->contains(end_addr) || end_addr == src_space->end(),
1997 "src_space_id does not match end_addr");
1998 #endif // #ifdef ASSERT
1999
2000 RegionData* const beg = sd.region(beg_region);
2001 RegionData* const end = sd.addr_to_region_ptr(sd.region_align_up(end_addr));
2002
2003 // Regions up to new_top() are enqueued if they become available.
2004 HeapWord* const new_top = _space_info[src_space_id].new_top();
2005 RegionData* const enqueue_end =
2006 sd.addr_to_region_ptr(sd.region_align_up(new_top));
2007
2008 for (RegionData* cur = beg; cur < end; ++cur) {
2009 assert(cur->data_size() > 0, "region must have live data");
2010 cur->decrement_destination_count();
2011 if (cur < enqueue_end && cur->available() && cur->claim()) {
2012 if (cur->mark_normal()) {
2013 cm->push_region(sd.region(cur));
2014 } else if (cur->mark_copied()) {
2015 // Try to copy the content of the shadow region back to its corresponding
2016 // heap region if the shadow region is filled. Otherwise, the GC thread
2017 // fills the shadow region will copy the data back (see
2018 // MoveAndUpdateShadowClosure::complete_region).
2019 copy_back(sd.region_to_addr(cur->shadow_region()), sd.region_to_addr(cur));
2020 ParCompactionManager::push_shadow_region_mt_safe(cur->shadow_region());
2021 cur->set_completed();
2022 }
2023 }
2024 }
2025 }
2026
2027 size_t PSParallelCompact::next_src_region(MoveAndUpdateClosure& closure,
2028 SpaceId& src_space_id,
2029 HeapWord*& src_space_top,
2030 HeapWord* end_addr)
2031 {
2032 ParallelCompactData& sd = PSParallelCompact::summary_data();
2033
2034 size_t src_region_idx = 0;
2035
2036 // Skip empty regions (if any) up to the top of the space.
2037 HeapWord* const src_aligned_up = sd.region_align_up(end_addr);
2038 RegionData* src_region_ptr = sd.addr_to_region_ptr(src_aligned_up);
2039 HeapWord* const top_aligned_up = sd.region_align_up(src_space_top);
2040 const RegionData* const top_region_ptr = sd.addr_to_region_ptr(top_aligned_up);
2041
2042 while (src_region_ptr < top_region_ptr && src_region_ptr->data_size() == 0) {
2043 ++src_region_ptr;
2044 }
2045
2046 if (src_region_ptr < top_region_ptr) {
2047 // Found the first non-empty region in the same space.
2048 src_region_idx = sd.region(src_region_ptr);
2049 closure.set_source(sd.region_to_addr(src_region_idx));
2050 return src_region_idx;
2051 }
2052
2053 // Switch to a new source space and find the first non-empty region.
2054 uint space_id = src_space_id + 1;
2055 assert(space_id < last_space_id, "not enough spaces");
2056
2057 for (/* empty */; space_id < last_space_id; ++space_id) {
2058 HeapWord* bottom = _space_info[space_id].space()->bottom();
2059 HeapWord* top = _space_info[space_id].space()->top();
2060 // Skip empty space
2061 if (bottom == top) {
2062 continue;
2063 }
2064
2065 // Identify the first region that contains live words in this space
2066 size_t cur_region = sd.addr_to_region_idx(bottom);
2067 size_t end_region = sd.addr_to_region_idx(sd.region_align_up(top));
2068
2069 for (/* empty */ ; cur_region < end_region; ++cur_region) {
2070 RegionData* cur = sd.region(cur_region);
2071 if (cur->live_obj_size() > 0) {
2072 HeapWord* region_start_addr = sd.region_to_addr(cur_region);
2073
2074 src_space_id = SpaceId(space_id);
2075 src_space_top = top;
2076 closure.set_source(region_start_addr);
2077 return cur_region;
2078 }
2079 }
2080 }
2081
2082 ShouldNotReachHere();
2083 }
2084
2085 HeapWord* PSParallelCompact::partial_obj_end(HeapWord* region_start_addr) {
2086 ParallelCompactData& sd = summary_data();
2087 assert(sd.is_region_aligned(region_start_addr), "precondition");
2088
2089 // Use per-region partial_obj_size to locate the end of the obj, that extends
2090 // to region_start_addr.
2091 size_t start_region_idx = sd.addr_to_region_idx(region_start_addr);
2092 size_t end_region_idx = sd.region_count();
2093 size_t accumulated_size = 0;
2094 for (size_t region_idx = start_region_idx; region_idx < end_region_idx; ++region_idx) {
2095 size_t cur_partial_obj_size = sd.region(region_idx)->partial_obj_size();
2096 accumulated_size += cur_partial_obj_size;
2097 if (cur_partial_obj_size != ParallelCompactData::RegionSize) {
2098 break;
2099 }
2100 }
2101 return region_start_addr + accumulated_size;
2102 }
2103
2104 // Use region_idx as the destination region, and evacuate all live objs on its
2105 // source regions to this destination region.
2106 void PSParallelCompact::fill_region(ParCompactionManager* cm, MoveAndUpdateClosure& closure, size_t region_idx)
2107 {
2108 ParMarkBitMap* const bitmap = mark_bitmap();
2109 ParallelCompactData& sd = summary_data();
2110 RegionData* const region_ptr = sd.region(region_idx);
2111
2112 // Get the source region and related info.
2113 size_t src_region_idx = region_ptr->source_region();
2114 SpaceId src_space_id = space_id(sd.region_to_addr(src_region_idx));
2115 HeapWord* src_space_top = _space_info[src_space_id].space()->top();
2116 HeapWord* dest_addr = sd.region_to_addr(region_idx);
2117
2118 closure.set_source(first_src_addr(dest_addr, src_space_id, src_region_idx));
2119
2120 // Adjust src_region_idx to prepare for decrementing destination counts (the
2121 // destination count is not decremented when a region is copied to itself).
2122 if (src_region_idx == region_idx) {
2123 src_region_idx += 1;
2124 }
2125
2126 // source-region:
2127 //
2128 // **********
2129 // | ~~~ |
2130 // **********
2131 // ^
2132 // |-- closure.source() / first_src_addr
2133 //
2134 //
2135 // ~~~ : live words
2136 //
2137 // destination-region:
2138 //
2139 // **********
2140 // | |
2141 // **********
2142 // ^
2143 // |-- region-start
2144 if (bitmap->is_unmarked(closure.source())) {
2145 // An object overflows the previous destination region, so this
2146 // destination region should copy the remainder of the object or as much as
2147 // will fit.
2148 HeapWord* const old_src_addr = closure.source();
2149 {
2150 HeapWord* region_start = sd.region_align_down(closure.source());
2151 HeapWord* obj_start = bitmap->find_obj_beg_reverse(region_start, closure.source());
2152 HeapWord* obj_end;
2153 if (obj_start != closure.source()) {
2154 assert(bitmap->is_marked(obj_start), "inv");
2155 // Found the actual obj-start, try to find the obj-end using either
2156 // size() if this obj is completely contained in the current region.
2157 HeapWord* next_region_start = region_start + ParallelCompactData::RegionSize;
2158 HeapWord* partial_obj_start = (next_region_start >= src_space_top)
2159 ? nullptr
2160 : sd.addr_to_region_ptr(next_region_start)->partial_obj_addr();
2161 // This obj extends to next region iff partial_obj_addr of the *next*
2162 // region is the same as obj-start.
2163 if (partial_obj_start == obj_start) {
2164 // This obj extends to next region.
2165 obj_end = partial_obj_end(next_region_start);
2166 } else {
2167 // Completely contained in this region; safe to use size().
2168 obj_end = obj_start + cast_to_oop(obj_start)->size();
2169 }
2170 } else {
2171 // This obj extends to current region.
2172 obj_end = partial_obj_end(region_start);
2173 }
2174 size_t partial_obj_size = pointer_delta(obj_end, closure.source());
2175 closure.copy_partial_obj(partial_obj_size);
2176 }
2177
2178 if (closure.is_full()) {
2179 decrement_destination_counts(cm, src_space_id, src_region_idx, closure.source());
2180 closure.complete_region(dest_addr, region_ptr);
2181 return;
2182 }
2183
2184 // Finished copying without using up the current destination-region
2185 HeapWord* const end_addr = sd.region_align_down(closure.source());
2186 if (sd.region_align_down(old_src_addr) != end_addr) {
2187 assert(sd.region_align_up(old_src_addr) == end_addr, "only one region");
2188 // The partial object was copied from more than one source region.
2189 decrement_destination_counts(cm, src_space_id, src_region_idx, end_addr);
2190
2191 // Move to the next source region, possibly switching spaces as well. All
2192 // args except end_addr may be modified.
2193 src_region_idx = next_src_region(closure, src_space_id, src_space_top, end_addr);
2194 }
2195 }
2196
2197 // Handle the rest obj-by-obj, where we know obj-start.
2198 do {
2199 HeapWord* cur_addr = closure.source();
2200 HeapWord* const end_addr = MIN2(sd.region_align_up(cur_addr + 1),
2201 src_space_top);
2202 // To handle the case where the final obj in source region extends to next region.
2203 HeapWord* final_obj_start = (end_addr == src_space_top)
2204 ? nullptr
2205 : sd.addr_to_region_ptr(end_addr)->partial_obj_addr();
2206 // Apply closure on objs inside [cur_addr, end_addr)
2207 do {
2208 cur_addr = bitmap->find_obj_beg(cur_addr, end_addr);
2209 if (cur_addr == end_addr) {
2210 break;
2211 }
2212 size_t obj_size;
2213 if (final_obj_start == cur_addr) {
2214 obj_size = pointer_delta(partial_obj_end(end_addr), cur_addr);
2215 } else {
2216 // This obj doesn't extend into next region; size() is safe to use.
2217 obj_size = cast_to_oop(cur_addr)->size();
2218 }
2219 closure.do_addr(cur_addr, obj_size);
2220 cur_addr += obj_size;
2221 } while (cur_addr < end_addr && !closure.is_full());
2222
2223 if (closure.is_full()) {
2224 decrement_destination_counts(cm, src_space_id, src_region_idx, closure.source());
2225 closure.complete_region(dest_addr, region_ptr);
2226 return;
2227 }
2228
2229 decrement_destination_counts(cm, src_space_id, src_region_idx, end_addr);
2230
2231 // Move to the next source region, possibly switching spaces as well. All
2232 // args except end_addr may be modified.
2233 src_region_idx = next_src_region(closure, src_space_id, src_space_top, end_addr);
2234 } while (true);
2235 }
2236
2237 void PSParallelCompact::fill_and_update_region(ParCompactionManager* cm, size_t region_idx)
2238 {
2239 MoveAndUpdateClosure cl(mark_bitmap(), region_idx);
2240 fill_region(cm, cl, region_idx);
2241 }
2242
2243 void PSParallelCompact::fill_and_update_shadow_region(ParCompactionManager* cm, size_t region_idx)
2244 {
2245 // Get a shadow region first
2246 ParallelCompactData& sd = summary_data();
2247 RegionData* const region_ptr = sd.region(region_idx);
2248 size_t shadow_region = ParCompactionManager::pop_shadow_region_mt_safe(region_ptr);
2249 // The InvalidShadow return value indicates the corresponding heap region is available,
2250 // so use MoveAndUpdateClosure to fill the normal region. Otherwise, use
2251 // MoveAndUpdateShadowClosure to fill the acquired shadow region.
2252 if (shadow_region == ParCompactionManager::InvalidShadow) {
2253 MoveAndUpdateClosure cl(mark_bitmap(), region_idx);
2254 region_ptr->shadow_to_normal();
2255 return fill_region(cm, cl, region_idx);
2256 } else {
2257 MoveAndUpdateShadowClosure cl(mark_bitmap(), region_idx, shadow_region);
2258 return fill_region(cm, cl, region_idx);
2259 }
2260 }
2261
2262 void PSParallelCompact::copy_back(HeapWord *shadow_addr, HeapWord *region_addr)
2263 {
2264 Copy::aligned_conjoint_words(shadow_addr, region_addr, _summary_data.RegionSize);
2265 }
2266
2267 bool PSParallelCompact::steal_unavailable_region(ParCompactionManager* cm, size_t ®ion_idx)
2268 {
2269 size_t next = cm->next_shadow_region();
2270 ParallelCompactData& sd = summary_data();
2271 size_t old_new_top = sd.addr_to_region_idx(_space_info[old_space_id].new_top());
2272 uint active_gc_threads = ParallelScavengeHeap::heap()->workers().active_workers();
2273
2274 while (next < old_new_top) {
2275 if (sd.region(next)->mark_shadow()) {
2276 region_idx = next;
2277 return true;
2278 }
2279 next = cm->move_next_shadow_region_by(active_gc_threads);
2280 }
2281
2282 return false;
2283 }
2284
2285 // The shadow region is an optimization to address region dependencies in full GC. The basic
2286 // idea is making more regions available by temporally storing their live objects in empty
2287 // shadow regions to resolve dependencies between them and the destination regions. Therefore,
2288 // GC threads need not wait destination regions to be available before processing sources.
2289 //
2290 // A typical workflow would be:
2291 // After draining its own stack and failing to steal from others, a GC worker would pick an
2292 // unavailable region (destination count > 0) and get a shadow region. Then the worker fills
2293 // the shadow region by copying live objects from source regions of the unavailable one. Once
2294 // the unavailable region becomes available, the data in the shadow region will be copied back.
2295 // Shadow regions are empty regions in the to-space and regions between top and end of other spaces.
2296 void PSParallelCompact::initialize_shadow_regions(uint parallel_gc_threads)
2297 {
2298 const ParallelCompactData& sd = PSParallelCompact::summary_data();
2299
2300 for (unsigned int id = old_space_id; id < last_space_id; ++id) {
2301 SpaceInfo* const space_info = _space_info + id;
2302 MutableSpace* const space = space_info->space();
2303
2304 const size_t beg_region =
2305 sd.addr_to_region_idx(sd.region_align_up(MAX2(space_info->new_top(), space->top())));
2306 const size_t end_region =
2307 sd.addr_to_region_idx(sd.region_align_down(space->end()));
2308
2309 for (size_t cur = beg_region; cur < end_region; ++cur) {
2310 ParCompactionManager::push_shadow_region(cur);
2311 }
2312 }
2313
2314 size_t beg_region = sd.addr_to_region_idx(_space_info[old_space_id].dense_prefix());
2315 for (uint i = 0; i < parallel_gc_threads; i++) {
2316 ParCompactionManager *cm = ParCompactionManager::gc_thread_compaction_manager(i);
2317 cm->set_next_shadow_region(beg_region + i);
2318 }
2319 }
2320
2321 void MoveAndUpdateClosure::copy_partial_obj(size_t partial_obj_size)
2322 {
2323 size_t words = MIN2(partial_obj_size, words_remaining());
2324
2325 // This test is necessary; if omitted, the pointer updates to a partial object
2326 // that crosses the dense prefix boundary could be overwritten.
2327 if (source() != copy_destination()) {
2328 DEBUG_ONLY(PSParallelCompact::check_new_location(source(), destination());)
2329 Copy::aligned_conjoint_words(source(), copy_destination(), words);
2330 }
2331 update_state(words);
2332 }
2333
2334 void MoveAndUpdateClosure::complete_region(HeapWord* dest_addr, PSParallelCompact::RegionData* region_ptr) {
2335 assert(region_ptr->shadow_state() == ParallelCompactData::RegionData::NormalRegion, "Region should be finished");
2336 region_ptr->set_completed();
2337 }
2338
2339 void MoveAndUpdateClosure::do_addr(HeapWord* addr, size_t words) {
2340 assert(destination() != nullptr, "sanity");
2341 _source = addr;
2342
2343 // The start_array must be updated even if the object is not moving.
2344 if (_start_array != nullptr) {
2345 _start_array->update_for_block(destination(), destination() + words);
2346 }
2347
2348 // Avoid overflow
2349 words = MIN2(words, words_remaining());
2350 assert(words > 0, "inv");
2351
2352 if (copy_destination() != source()) {
2353 DEBUG_ONLY(PSParallelCompact::check_new_location(source(), destination());)
2354 assert(source() != destination(), "inv");
2355 assert(FullGCForwarding::is_forwarded(cast_to_oop(source())), "inv");
2356 assert(FullGCForwarding::forwardee(cast_to_oop(source())) == cast_to_oop(destination()), "inv");
2357 Copy::aligned_conjoint_words(source(), copy_destination(), words);
2358 cast_to_oop(copy_destination())->init_mark();
2359 }
2360
2361 update_state(words);
2362 }
2363
2364 void MoveAndUpdateShadowClosure::complete_region(HeapWord* dest_addr, PSParallelCompact::RegionData* region_ptr) {
2365 assert(region_ptr->shadow_state() == ParallelCompactData::RegionData::ShadowRegion, "Region should be shadow");
2366 // Record the shadow region index
2367 region_ptr->set_shadow_region(_shadow);
2368 // Mark the shadow region as filled to indicate the data is ready to be
2369 // copied back
2370 region_ptr->mark_filled();
2371 // Try to copy the content of the shadow region back to its corresponding
2372 // heap region if available; the GC thread that decreases the destination
2373 // count to zero will do the copying otherwise (see
2374 // PSParallelCompact::decrement_destination_counts).
2375 if (((region_ptr->available() && region_ptr->claim()) || region_ptr->claimed()) && region_ptr->mark_copied()) {
2376 region_ptr->set_completed();
2377 PSParallelCompact::copy_back(PSParallelCompact::summary_data().region_to_addr(_shadow), dest_addr);
2378 ParCompactionManager::push_shadow_region_mt_safe(_shadow);
2379 }
2380 }