58 #include "gc/shared/oopStorageSetParState.inline.hpp"
59 #include "gc/shared/preservedMarks.inline.hpp"
60 #include "gc/shared/referencePolicy.hpp"
61 #include "gc/shared/referenceProcessor.hpp"
62 #include "gc/shared/referenceProcessorPhaseTimes.hpp"
63 #include "gc/shared/spaceDecorator.hpp"
64 #include "gc/shared/strongRootsScope.hpp"
65 #include "gc/shared/taskTerminator.hpp"
66 #include "gc/shared/weakProcessor.inline.hpp"
67 #include "gc/shared/workerPolicy.hpp"
68 #include "gc/shared/workerThread.hpp"
69 #include "gc/shared/workerUtils.hpp"
70 #include "logging/log.hpp"
71 #include "memory/iterator.inline.hpp"
72 #include "memory/memoryReserver.hpp"
73 #include "memory/metaspaceUtils.hpp"
74 #include "memory/resourceArea.hpp"
75 #include "memory/universe.hpp"
76 #include "nmt/memTracker.hpp"
77 #include "oops/access.inline.hpp"
78 #include "oops/instanceClassLoaderKlass.inline.hpp"
79 #include "oops/instanceKlass.inline.hpp"
80 #include "oops/instanceMirrorKlass.inline.hpp"
81 #include "oops/methodData.hpp"
82 #include "oops/objArrayKlass.inline.hpp"
83 #include "oops/oop.inline.hpp"
84 #include "runtime/atomicAccess.hpp"
85 #include "runtime/handles.inline.hpp"
86 #include "runtime/java.hpp"
87 #include "runtime/safepoint.hpp"
88 #include "runtime/threads.hpp"
89 #include "runtime/vmThread.hpp"
90 #include "services/memoryService.hpp"
91 #include "utilities/align.hpp"
92 #include "utilities/debug.hpp"
93 #include "utilities/events.hpp"
94 #include "utilities/formatBuffer.hpp"
95 #include "utilities/macros.hpp"
96 #include "utilities/stack.inline.hpp"
97 #if INCLUDE_JVMCI
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);
|
58 #include "gc/shared/oopStorageSetParState.inline.hpp"
59 #include "gc/shared/preservedMarks.inline.hpp"
60 #include "gc/shared/referencePolicy.hpp"
61 #include "gc/shared/referenceProcessor.hpp"
62 #include "gc/shared/referenceProcessorPhaseTimes.hpp"
63 #include "gc/shared/spaceDecorator.hpp"
64 #include "gc/shared/strongRootsScope.hpp"
65 #include "gc/shared/taskTerminator.hpp"
66 #include "gc/shared/weakProcessor.inline.hpp"
67 #include "gc/shared/workerPolicy.hpp"
68 #include "gc/shared/workerThread.hpp"
69 #include "gc/shared/workerUtils.hpp"
70 #include "logging/log.hpp"
71 #include "memory/iterator.inline.hpp"
72 #include "memory/memoryReserver.hpp"
73 #include "memory/metaspaceUtils.hpp"
74 #include "memory/resourceArea.hpp"
75 #include "memory/universe.hpp"
76 #include "nmt/memTracker.hpp"
77 #include "oops/access.inline.hpp"
78 #include "oops/flatArrayKlass.inline.hpp"
79 #include "oops/instanceClassLoaderKlass.inline.hpp"
80 #include "oops/instanceKlass.inline.hpp"
81 #include "oops/instanceMirrorKlass.inline.hpp"
82 #include "oops/methodData.hpp"
83 #include "oops/objArrayKlass.inline.hpp"
84 #include "oops/oop.inline.hpp"
85 #include "runtime/atomicAccess.hpp"
86 #include "runtime/handles.inline.hpp"
87 #include "runtime/java.hpp"
88 #include "runtime/safepoint.hpp"
89 #include "runtime/threads.hpp"
90 #include "runtime/vmThread.hpp"
91 #include "services/memoryService.hpp"
92 #include "utilities/align.hpp"
93 #include "utilities/debug.hpp"
94 #include "utilities/events.hpp"
95 #include "utilities/formatBuffer.hpp"
96 #include "utilities/macros.hpp"
97 #include "utilities/stack.inline.hpp"
98 #if INCLUDE_JVMCI
2339
2340 void MoveAndUpdateClosure::do_addr(HeapWord* addr, size_t words) {
2341 assert(destination() != nullptr, "sanity");
2342 _source = addr;
2343
2344 // The start_array must be updated even if the object is not moving.
2345 if (_start_array != nullptr) {
2346 _start_array->update_for_block(destination(), destination() + words);
2347 }
2348
2349 // Avoid overflow
2350 words = MIN2(words, words_remaining());
2351 assert(words > 0, "inv");
2352
2353 if (copy_destination() != source()) {
2354 DEBUG_ONLY(PSParallelCompact::check_new_location(source(), destination());)
2355 assert(source() != destination(), "inv");
2356 assert(FullGCForwarding::is_forwarded(cast_to_oop(source())), "inv");
2357 assert(FullGCForwarding::forwardee(cast_to_oop(source())) == cast_to_oop(destination()), "inv");
2358 Copy::aligned_conjoint_words(source(), copy_destination(), words);
2359 cast_to_oop(copy_destination())->reinit_mark();
2360 }
2361
2362 update_state(words);
2363 }
2364
2365 void MoveAndUpdateShadowClosure::complete_region(HeapWord* dest_addr, PSParallelCompact::RegionData* region_ptr) {
2366 assert(region_ptr->shadow_state() == ParallelCompactData::RegionData::ShadowRegion, "Region should be shadow");
2367 // Record the shadow region index
2368 region_ptr->set_shadow_region(_shadow);
2369 // Mark the shadow region as filled to indicate the data is ready to be
2370 // copied back
2371 region_ptr->mark_filled();
2372 // Try to copy the content of the shadow region back to its corresponding
2373 // heap region if available; the GC thread that decreases the destination
2374 // count to zero will do the copying otherwise (see
2375 // PSParallelCompact::decrement_destination_counts).
2376 if (((region_ptr->available() && region_ptr->claim()) || region_ptr->claimed()) && region_ptr->mark_copied()) {
2377 region_ptr->set_completed();
2378 PSParallelCompact::copy_back(PSParallelCompact::summary_data().region_to_addr(_shadow), dest_addr);
2379 ParCompactionManager::push_shadow_region_mt_safe(_shadow);
|