1 /* 2 * Copyright (c) 2005, 2018, 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 "precompiled.hpp" 26 #include "aot/aotLoader.hpp" 27 #include "classfile/stringTable.hpp" 28 #include "classfile/symbolTable.hpp" 29 #include "classfile/systemDictionary.hpp" 30 #include "code/codeCache.hpp" 31 #include "gc/parallel/gcTaskManager.hpp" 32 #include "gc/parallel/parallelScavengeHeap.inline.hpp" 33 #include "gc/parallel/parMarkBitMap.inline.hpp" 34 #include "gc/parallel/pcTasks.hpp" 35 #include "gc/parallel/psAdaptiveSizePolicy.hpp" 36 #include "gc/parallel/psCompactionManager.inline.hpp" 37 #include "gc/parallel/psOldGen.hpp" 38 #include "gc/parallel/psParallelCompact.inline.hpp" 39 #include "gc/parallel/psPromotionManager.inline.hpp" 40 #include "gc/parallel/psScavenge.hpp" 41 #include "gc/parallel/psYoungGen.hpp" 42 #include "gc/shared/gcCause.hpp" 43 #include "gc/shared/gcHeapSummary.hpp" 44 #include "gc/shared/gcId.hpp" 45 #include "gc/shared/gcLocker.hpp" 46 #include "gc/shared/gcTimer.hpp" 47 #include "gc/shared/gcTrace.hpp" 48 #include "gc/shared/gcTraceTime.inline.hpp" 49 #include "gc/shared/isGCActiveMark.hpp" 50 #include "gc/shared/referencePolicy.hpp" 51 #include "gc/shared/referenceProcessor.hpp" 52 #include "gc/shared/referenceProcessorPhaseTimes.hpp" 53 #include "gc/shared/spaceDecorator.hpp" 54 #include "gc/shared/weakProcessor.hpp" 55 #include "logging/log.hpp" 56 #include "memory/resourceArea.hpp" 57 #include "oops/access.inline.hpp" 58 #include "oops/instanceKlass.inline.hpp" 59 #include "oops/instanceMirrorKlass.inline.hpp" 60 #include "oops/methodData.hpp" 61 #include "oops/objArrayKlass.inline.hpp" 62 #include "oops/oop.inline.hpp" 63 #include "runtime/atomic.hpp" 64 #include "runtime/handles.inline.hpp" 65 #include "runtime/safepoint.hpp" 66 #include "runtime/vmThread.hpp" 67 #include "services/management.hpp" 68 #include "services/memTracker.hpp" 69 #include "services/memoryService.hpp" 70 #include "utilities/align.hpp" 71 #include "utilities/debug.hpp" 72 #include "utilities/events.hpp" 73 #include "utilities/formatBuffer.hpp" 74 #include "utilities/macros.hpp" 75 #include "utilities/stack.inline.hpp" 76 77 #include <math.h> 78 79 // All sizes are in HeapWords. 80 const size_t ParallelCompactData::Log2RegionSize = 16; // 64K words 81 const size_t ParallelCompactData::RegionSize = (size_t)1 << Log2RegionSize; 82 const size_t ParallelCompactData::RegionSizeBytes = 83 RegionSize << LogHeapWordSize; 84 const size_t ParallelCompactData::RegionSizeOffsetMask = RegionSize - 1; 85 const size_t ParallelCompactData::RegionAddrOffsetMask = RegionSizeBytes - 1; 86 const size_t ParallelCompactData::RegionAddrMask = ~RegionAddrOffsetMask; 87 88 const size_t ParallelCompactData::Log2BlockSize = 7; // 128 words 89 const size_t ParallelCompactData::BlockSize = (size_t)1 << Log2BlockSize; 90 const size_t ParallelCompactData::BlockSizeBytes = 91 BlockSize << LogHeapWordSize; 92 const size_t ParallelCompactData::BlockSizeOffsetMask = BlockSize - 1; 93 const size_t ParallelCompactData::BlockAddrOffsetMask = BlockSizeBytes - 1; 94 const size_t ParallelCompactData::BlockAddrMask = ~BlockAddrOffsetMask; 95 96 const size_t ParallelCompactData::BlocksPerRegion = RegionSize / BlockSize; 97 const size_t ParallelCompactData::Log2BlocksPerRegion = 98 Log2RegionSize - Log2BlockSize; 99 100 const ParallelCompactData::RegionData::region_sz_t 101 ParallelCompactData::RegionData::dc_shift = 27; 102 103 const ParallelCompactData::RegionData::region_sz_t 104 ParallelCompactData::RegionData::dc_mask = ~0U << dc_shift; 105 106 const ParallelCompactData::RegionData::region_sz_t 107 ParallelCompactData::RegionData::dc_one = 0x1U << dc_shift; 108 109 const ParallelCompactData::RegionData::region_sz_t 110 ParallelCompactData::RegionData::los_mask = ~dc_mask; 111 112 const ParallelCompactData::RegionData::region_sz_t 113 ParallelCompactData::RegionData::dc_claimed = 0x8U << dc_shift; 114 115 const ParallelCompactData::RegionData::region_sz_t 116 ParallelCompactData::RegionData::dc_completed = 0xcU << dc_shift; 117 118 SpaceInfo PSParallelCompact::_space_info[PSParallelCompact::last_space_id]; 119 120 SpanSubjectToDiscoveryClosure PSParallelCompact::_span_based_discoverer; 121 ReferenceProcessor* PSParallelCompact::_ref_processor = NULL; 122 123 double PSParallelCompact::_dwl_mean; 124 double PSParallelCompact::_dwl_std_dev; 125 double PSParallelCompact::_dwl_first_term; 126 double PSParallelCompact::_dwl_adjustment; 127 #ifdef ASSERT 128 bool PSParallelCompact::_dwl_initialized = false; 129 #endif // #ifdef ASSERT 130 131 void SplitInfo::record(size_t src_region_idx, size_t partial_obj_size, 132 HeapWord* destination) 133 { 134 assert(src_region_idx != 0, "invalid src_region_idx"); 135 assert(partial_obj_size != 0, "invalid partial_obj_size argument"); 136 assert(destination != NULL, "invalid destination argument"); 137 138 _src_region_idx = src_region_idx; 139 _partial_obj_size = partial_obj_size; 140 _destination = destination; 141 142 // These fields may not be updated below, so make sure they're clear. 143 assert(_dest_region_addr == NULL, "should have been cleared"); 144 assert(_first_src_addr == NULL, "should have been cleared"); 145 146 // Determine the number of destination regions for the partial object. 147 HeapWord* const last_word = destination + partial_obj_size - 1; 148 const ParallelCompactData& sd = PSParallelCompact::summary_data(); 149 HeapWord* const beg_region_addr = sd.region_align_down(destination); 150 HeapWord* const end_region_addr = sd.region_align_down(last_word); 151 152 if (beg_region_addr == end_region_addr) { 153 // One destination region. 154 _destination_count = 1; 155 if (end_region_addr == destination) { 156 // The destination falls on a region boundary, thus the first word of the 157 // partial object will be the first word copied to the destination region. 158 _dest_region_addr = end_region_addr; 159 _first_src_addr = sd.region_to_addr(src_region_idx); 160 } 161 } else { 162 // Two destination regions. When copied, the partial object will cross a 163 // destination region boundary, so a word somewhere within the partial 164 // object will be the first word copied to the second destination region. 165 _destination_count = 2; 166 _dest_region_addr = end_region_addr; 167 const size_t ofs = pointer_delta(end_region_addr, destination); 168 assert(ofs < _partial_obj_size, "sanity"); 169 _first_src_addr = sd.region_to_addr(src_region_idx) + ofs; 170 } 171 } 172 173 void SplitInfo::clear() 174 { 175 _src_region_idx = 0; 176 _partial_obj_size = 0; 177 _destination = NULL; 178 _destination_count = 0; 179 _dest_region_addr = NULL; 180 _first_src_addr = NULL; 181 assert(!is_valid(), "sanity"); 182 } 183 184 #ifdef ASSERT 185 void SplitInfo::verify_clear() 186 { 187 assert(_src_region_idx == 0, "not clear"); 188 assert(_partial_obj_size == 0, "not clear"); 189 assert(_destination == NULL, "not clear"); 190 assert(_destination_count == 0, "not clear"); 191 assert(_dest_region_addr == NULL, "not clear"); 192 assert(_first_src_addr == NULL, "not clear"); 193 } 194 #endif // #ifdef ASSERT 195 196 197 void PSParallelCompact::print_on_error(outputStream* st) { 198 _mark_bitmap.print_on_error(st); 199 } 200 201 #ifndef PRODUCT 202 const char* PSParallelCompact::space_names[] = { 203 "old ", "eden", "from", "to " 204 }; 205 206 void PSParallelCompact::print_region_ranges() { 207 if (!log_develop_is_enabled(Trace, gc, compaction)) { 208 return; 209 } 210 Log(gc, compaction) log; 211 ResourceMark rm; 212 LogStream ls(log.trace()); 213 Universe::print_on(&ls); 214 log.trace("space bottom top end new_top"); 215 log.trace("------ ---------- ---------- ---------- ----------"); 216 217 for (unsigned int id = 0; id < last_space_id; ++id) { 218 const MutableSpace* space = _space_info[id].space(); 219 log.trace("%u %s " 220 SIZE_FORMAT_W(10) " " SIZE_FORMAT_W(10) " " 221 SIZE_FORMAT_W(10) " " SIZE_FORMAT_W(10) " ", 222 id, space_names[id], 223 summary_data().addr_to_region_idx(space->bottom()), 224 summary_data().addr_to_region_idx(space->top()), 225 summary_data().addr_to_region_idx(space->end()), 226 summary_data().addr_to_region_idx(_space_info[id].new_top())); 227 } 228 } 229 230 void 231 print_generic_summary_region(size_t i, const ParallelCompactData::RegionData* c) 232 { 233 #define REGION_IDX_FORMAT SIZE_FORMAT_W(7) 234 #define REGION_DATA_FORMAT SIZE_FORMAT_W(5) 235 236 ParallelCompactData& sd = PSParallelCompact::summary_data(); 237 size_t dci = c->destination() ? sd.addr_to_region_idx(c->destination()) : 0; 238 log_develop_trace(gc, compaction)( 239 REGION_IDX_FORMAT " " PTR_FORMAT " " 240 REGION_IDX_FORMAT " " PTR_FORMAT " " 241 REGION_DATA_FORMAT " " REGION_DATA_FORMAT " " 242 REGION_DATA_FORMAT " " REGION_IDX_FORMAT " %d", 243 i, p2i(c->data_location()), dci, p2i(c->destination()), 244 c->partial_obj_size(), c->live_obj_size(), 245 c->data_size(), c->source_region(), c->destination_count()); 246 247 #undef REGION_IDX_FORMAT 248 #undef REGION_DATA_FORMAT 249 } 250 251 void 252 print_generic_summary_data(ParallelCompactData& summary_data, 253 HeapWord* const beg_addr, 254 HeapWord* const end_addr) 255 { 256 size_t total_words = 0; 257 size_t i = summary_data.addr_to_region_idx(beg_addr); 258 const size_t last = summary_data.addr_to_region_idx(end_addr); 259 HeapWord* pdest = 0; 260 261 while (i < last) { 262 ParallelCompactData::RegionData* c = summary_data.region(i); 263 if (c->data_size() != 0 || c->destination() != pdest) { 264 print_generic_summary_region(i, c); 265 total_words += c->data_size(); 266 pdest = c->destination(); 267 } 268 ++i; 269 } 270 271 log_develop_trace(gc, compaction)("summary_data_bytes=" SIZE_FORMAT, total_words * HeapWordSize); 272 } 273 274 void 275 PSParallelCompact::print_generic_summary_data(ParallelCompactData& summary_data, 276 HeapWord* const beg_addr, 277 HeapWord* const end_addr) { 278 ::print_generic_summary_data(summary_data,beg_addr, end_addr); 279 } 280 281 void 282 print_generic_summary_data(ParallelCompactData& summary_data, 283 SpaceInfo* space_info) 284 { 285 if (!log_develop_is_enabled(Trace, gc, compaction)) { 286 return; 287 } 288 289 for (unsigned int id = 0; id < PSParallelCompact::last_space_id; ++id) { 290 const MutableSpace* space = space_info[id].space(); 291 print_generic_summary_data(summary_data, space->bottom(), 292 MAX2(space->top(), space_info[id].new_top())); 293 } 294 } 295 296 void 297 print_initial_summary_data(ParallelCompactData& summary_data, 298 const MutableSpace* space) { 299 if (space->top() == space->bottom()) { 300 return; 301 } 302 303 const size_t region_size = ParallelCompactData::RegionSize; 304 typedef ParallelCompactData::RegionData RegionData; 305 HeapWord* const top_aligned_up = summary_data.region_align_up(space->top()); 306 const size_t end_region = summary_data.addr_to_region_idx(top_aligned_up); 307 const RegionData* c = summary_data.region(end_region - 1); 308 HeapWord* end_addr = c->destination() + c->data_size(); 309 const size_t live_in_space = pointer_delta(end_addr, space->bottom()); 310 311 // Print (and count) the full regions at the beginning of the space. 312 size_t full_region_count = 0; 313 size_t i = summary_data.addr_to_region_idx(space->bottom()); 314 while (i < end_region && summary_data.region(i)->data_size() == region_size) { 315 ParallelCompactData::RegionData* c = summary_data.region(i); 316 log_develop_trace(gc, compaction)( 317 SIZE_FORMAT_W(5) " " PTR_FORMAT " " SIZE_FORMAT_W(5) " " SIZE_FORMAT_W(5) " " SIZE_FORMAT_W(5) " " SIZE_FORMAT_W(5) " %d", 318 i, p2i(c->destination()), 319 c->partial_obj_size(), c->live_obj_size(), 320 c->data_size(), c->source_region(), c->destination_count()); 321 ++full_region_count; 322 ++i; 323 } 324 325 size_t live_to_right = live_in_space - full_region_count * region_size; 326 327 double max_reclaimed_ratio = 0.0; 328 size_t max_reclaimed_ratio_region = 0; 329 size_t max_dead_to_right = 0; 330 size_t max_live_to_right = 0; 331 332 // Print the 'reclaimed ratio' for regions while there is something live in 333 // the region or to the right of it. The remaining regions are empty (and 334 // uninteresting), and computing the ratio will result in division by 0. 335 while (i < end_region && live_to_right > 0) { 336 c = summary_data.region(i); 337 HeapWord* const region_addr = summary_data.region_to_addr(i); 338 const size_t used_to_right = pointer_delta(space->top(), region_addr); 339 const size_t dead_to_right = used_to_right - live_to_right; 340 const double reclaimed_ratio = double(dead_to_right) / live_to_right; 341 342 if (reclaimed_ratio > max_reclaimed_ratio) { 343 max_reclaimed_ratio = reclaimed_ratio; 344 max_reclaimed_ratio_region = i; 345 max_dead_to_right = dead_to_right; 346 max_live_to_right = live_to_right; 347 } 348 349 ParallelCompactData::RegionData* c = summary_data.region(i); 350 log_develop_trace(gc, compaction)( 351 SIZE_FORMAT_W(5) " " PTR_FORMAT " " SIZE_FORMAT_W(5) " " SIZE_FORMAT_W(5) " " SIZE_FORMAT_W(5) " " SIZE_FORMAT_W(5) " %d" 352 "%12.10f " SIZE_FORMAT_W(10) " " SIZE_FORMAT_W(10), 353 i, p2i(c->destination()), 354 c->partial_obj_size(), c->live_obj_size(), 355 c->data_size(), c->source_region(), c->destination_count(), 356 reclaimed_ratio, dead_to_right, live_to_right); 357 358 359 live_to_right -= c->data_size(); 360 ++i; 361 } 362 363 // Any remaining regions are empty. Print one more if there is one. 364 if (i < end_region) { 365 ParallelCompactData::RegionData* c = summary_data.region(i); 366 log_develop_trace(gc, compaction)( 367 SIZE_FORMAT_W(5) " " PTR_FORMAT " " SIZE_FORMAT_W(5) " " SIZE_FORMAT_W(5) " " SIZE_FORMAT_W(5) " " SIZE_FORMAT_W(5) " %d", 368 i, p2i(c->destination()), 369 c->partial_obj_size(), c->live_obj_size(), 370 c->data_size(), c->source_region(), c->destination_count()); 371 } 372 373 log_develop_trace(gc, compaction)("max: " SIZE_FORMAT_W(4) " d2r=" SIZE_FORMAT_W(10) " l2r=" SIZE_FORMAT_W(10) " max_ratio=%14.12f", 374 max_reclaimed_ratio_region, max_dead_to_right, max_live_to_right, max_reclaimed_ratio); 375 } 376 377 void 378 print_initial_summary_data(ParallelCompactData& summary_data, 379 SpaceInfo* space_info) { 380 if (!log_develop_is_enabled(Trace, gc, compaction)) { 381 return; 382 } 383 384 unsigned int id = PSParallelCompact::old_space_id; 385 const MutableSpace* space; 386 do { 387 space = space_info[id].space(); 388 print_initial_summary_data(summary_data, space); 389 } while (++id < PSParallelCompact::eden_space_id); 390 391 do { 392 space = space_info[id].space(); 393 print_generic_summary_data(summary_data, space->bottom(), space->top()); 394 } while (++id < PSParallelCompact::last_space_id); 395 } 396 #endif // #ifndef PRODUCT 397 398 #ifdef ASSERT 399 size_t add_obj_count; 400 size_t add_obj_size; 401 size_t mark_bitmap_count; 402 size_t mark_bitmap_size; 403 #endif // #ifdef ASSERT 404 405 ParallelCompactData::ParallelCompactData() 406 { 407 _region_start = 0; 408 409 _region_vspace = 0; 410 _reserved_byte_size = 0; 411 _region_data = 0; 412 _region_count = 0; 413 414 _block_vspace = 0; 415 _block_data = 0; 416 _block_count = 0; 417 } 418 419 bool ParallelCompactData::initialize(MemRegion covered_region) 420 { 421 _region_start = covered_region.start(); 422 const size_t region_size = covered_region.word_size(); 423 DEBUG_ONLY(_region_end = _region_start + region_size;) 424 425 assert(region_align_down(_region_start) == _region_start, 426 "region start not aligned"); 427 assert((region_size & RegionSizeOffsetMask) == 0, 428 "region size not a multiple of RegionSize"); 429 430 bool result = initialize_region_data(region_size) && initialize_block_data(); 431 return result; 432 } 433 434 PSVirtualSpace* 435 ParallelCompactData::create_vspace(size_t count, size_t element_size) 436 { 437 const size_t raw_bytes = count * element_size; 438 const size_t page_sz = os::page_size_for_region_aligned(raw_bytes, 10); 439 const size_t granularity = os::vm_allocation_granularity(); 440 _reserved_byte_size = align_up(raw_bytes, MAX2(page_sz, granularity)); 441 442 const size_t rs_align = page_sz == (size_t) os::vm_page_size() ? 0 : 443 MAX2(page_sz, granularity); 444 ReservedSpace rs(_reserved_byte_size, rs_align, rs_align > 0); 445 os::trace_page_sizes("Parallel Compact Data", raw_bytes, raw_bytes, page_sz, rs.base(), 446 rs.size()); 447 448 MemTracker::record_virtual_memory_type((address)rs.base(), mtGC); 449 450 PSVirtualSpace* vspace = new PSVirtualSpace(rs, page_sz); 451 if (vspace != 0) { 452 if (vspace->expand_by(_reserved_byte_size)) { 453 return vspace; 454 } 455 delete vspace; 456 // Release memory reserved in the space. 457 rs.release(); 458 } 459 460 return 0; 461 } 462 463 bool ParallelCompactData::initialize_region_data(size_t region_size) 464 { 465 const size_t count = (region_size + RegionSizeOffsetMask) >> Log2RegionSize; 466 _region_vspace = create_vspace(count, sizeof(RegionData)); 467 if (_region_vspace != 0) { 468 _region_data = (RegionData*)_region_vspace->reserved_low_addr(); 469 _region_count = count; 470 return true; 471 } 472 return false; 473 } 474 475 bool ParallelCompactData::initialize_block_data() 476 { 477 assert(_region_count != 0, "region data must be initialized first"); 478 const size_t count = _region_count << Log2BlocksPerRegion; 479 _block_vspace = create_vspace(count, sizeof(BlockData)); 480 if (_block_vspace != 0) { 481 _block_data = (BlockData*)_block_vspace->reserved_low_addr(); 482 _block_count = count; 483 return true; 484 } 485 return false; 486 } 487 488 void ParallelCompactData::clear() 489 { 490 memset(_region_data, 0, _region_vspace->committed_size()); 491 memset(_block_data, 0, _block_vspace->committed_size()); 492 } 493 494 void ParallelCompactData::clear_range(size_t beg_region, size_t end_region) { 495 assert(beg_region <= _region_count, "beg_region out of range"); 496 assert(end_region <= _region_count, "end_region out of range"); 497 assert(RegionSize % BlockSize == 0, "RegionSize not a multiple of BlockSize"); 498 499 const size_t region_cnt = end_region - beg_region; 500 memset(_region_data + beg_region, 0, region_cnt * sizeof(RegionData)); 501 502 const size_t beg_block = beg_region * BlocksPerRegion; 503 const size_t block_cnt = region_cnt * BlocksPerRegion; 504 memset(_block_data + beg_block, 0, block_cnt * sizeof(BlockData)); 505 } 506 507 HeapWord* ParallelCompactData::partial_obj_end(size_t region_idx) const 508 { 509 const RegionData* cur_cp = region(region_idx); 510 const RegionData* const end_cp = region(region_count() - 1); 511 512 HeapWord* result = region_to_addr(region_idx); 513 if (cur_cp < end_cp) { 514 do { 515 result += cur_cp->partial_obj_size(); 516 } while (cur_cp->partial_obj_size() == RegionSize && ++cur_cp < end_cp); 517 } 518 return result; 519 } 520 521 void ParallelCompactData::add_obj(HeapWord* addr, size_t len) 522 { 523 const size_t obj_ofs = pointer_delta(addr, _region_start); 524 const size_t beg_region = obj_ofs >> Log2RegionSize; 525 const size_t end_region = (obj_ofs + len - 1) >> Log2RegionSize; 526 527 DEBUG_ONLY(Atomic::inc(&add_obj_count);) 528 DEBUG_ONLY(Atomic::add(len, &add_obj_size);) 529 530 if (beg_region == end_region) { 531 // All in one region. 532 _region_data[beg_region].add_live_obj(len); 533 return; 534 } 535 536 // First region. 537 const size_t beg_ofs = region_offset(addr); 538 _region_data[beg_region].add_live_obj(RegionSize - beg_ofs); 539 540 Klass* klass = ((oop)addr)->klass(); 541 // Middle regions--completely spanned by this object. 542 for (size_t region = beg_region + 1; region < end_region; ++region) { 543 _region_data[region].set_partial_obj_size(RegionSize); 544 _region_data[region].set_partial_obj_addr(addr); 545 } 546 547 // Last region. 548 const size_t end_ofs = region_offset(addr + len - 1); 549 _region_data[end_region].set_partial_obj_size(end_ofs + 1); 550 _region_data[end_region].set_partial_obj_addr(addr); 551 } 552 553 void 554 ParallelCompactData::summarize_dense_prefix(HeapWord* beg, HeapWord* end) 555 { 556 assert(region_offset(beg) == 0, "not RegionSize aligned"); 557 assert(region_offset(end) == 0, "not RegionSize aligned"); 558 559 size_t cur_region = addr_to_region_idx(beg); 560 const size_t end_region = addr_to_region_idx(end); 561 HeapWord* addr = beg; 562 while (cur_region < end_region) { 563 _region_data[cur_region].set_destination(addr); 564 _region_data[cur_region].set_destination_count(0); 565 _region_data[cur_region].set_source_region(cur_region); 566 _region_data[cur_region].set_data_location(addr); 567 568 // Update live_obj_size so the region appears completely full. 569 size_t live_size = RegionSize - _region_data[cur_region].partial_obj_size(); 570 _region_data[cur_region].set_live_obj_size(live_size); 571 572 ++cur_region; 573 addr += RegionSize; 574 } 575 } 576 577 // Find the point at which a space can be split and, if necessary, record the 578 // split point. 579 // 580 // If the current src region (which overflowed the destination space) doesn't 581 // have a partial object, the split point is at the beginning of the current src 582 // region (an "easy" split, no extra bookkeeping required). 583 // 584 // If the current src region has a partial object, the split point is in the 585 // region where that partial object starts (call it the split_region). If 586 // split_region has a partial object, then the split point is just after that 587 // partial object (a "hard" split where we have to record the split data and 588 // zero the partial_obj_size field). With a "hard" split, we know that the 589 // partial_obj ends within split_region because the partial object that caused 590 // the overflow starts in split_region. If split_region doesn't have a partial 591 // obj, then the split is at the beginning of split_region (another "easy" 592 // split). 593 HeapWord* 594 ParallelCompactData::summarize_split_space(size_t src_region, 595 SplitInfo& split_info, 596 HeapWord* destination, 597 HeapWord* target_end, 598 HeapWord** target_next) 599 { 600 assert(destination <= target_end, "sanity"); 601 assert(destination + _region_data[src_region].data_size() > target_end, 602 "region should not fit into target space"); 603 assert(is_region_aligned(target_end), "sanity"); 604 605 size_t split_region = src_region; 606 HeapWord* split_destination = destination; 607 size_t partial_obj_size = _region_data[src_region].partial_obj_size(); 608 609 if (destination + partial_obj_size > target_end) { 610 // The split point is just after the partial object (if any) in the 611 // src_region that contains the start of the object that overflowed the 612 // destination space. 613 // 614 // Find the start of the "overflow" object and set split_region to the 615 // region containing it. 616 HeapWord* const overflow_obj = _region_data[src_region].partial_obj_addr(); 617 split_region = addr_to_region_idx(overflow_obj); 618 619 // Clear the source_region field of all destination regions whose first word 620 // came from data after the split point (a non-null source_region field 621 // implies a region must be filled). 622 // 623 // An alternative to the simple loop below: clear during post_compact(), 624 // which uses memcpy instead of individual stores, and is easy to 625 // parallelize. (The downside is that it clears the entire RegionData 626 // object as opposed to just one field.) 627 // 628 // post_compact() would have to clear the summary data up to the highest 629 // address that was written during the summary phase, which would be 630 // 631 // max(top, max(new_top, clear_top)) 632 // 633 // where clear_top is a new field in SpaceInfo. Would have to set clear_top 634 // to target_end. 635 const RegionData* const sr = region(split_region); 636 const size_t beg_idx = 637 addr_to_region_idx(region_align_up(sr->destination() + 638 sr->partial_obj_size())); 639 const size_t end_idx = addr_to_region_idx(target_end); 640 641 log_develop_trace(gc, compaction)("split: clearing source_region field in [" SIZE_FORMAT ", " SIZE_FORMAT ")", beg_idx, end_idx); 642 for (size_t idx = beg_idx; idx < end_idx; ++idx) { 643 _region_data[idx].set_source_region(0); 644 } 645 646 // Set split_destination and partial_obj_size to reflect the split region. 647 split_destination = sr->destination(); 648 partial_obj_size = sr->partial_obj_size(); 649 } 650 651 // The split is recorded only if a partial object extends onto the region. 652 if (partial_obj_size != 0) { 653 _region_data[split_region].set_partial_obj_size(0); 654 split_info.record(split_region, partial_obj_size, split_destination); 655 } 656 657 // Setup the continuation addresses. 658 *target_next = split_destination + partial_obj_size; 659 HeapWord* const source_next = region_to_addr(split_region) + partial_obj_size; 660 661 if (log_develop_is_enabled(Trace, gc, compaction)) { 662 const char * split_type = partial_obj_size == 0 ? "easy" : "hard"; 663 log_develop_trace(gc, compaction)("%s split: src=" PTR_FORMAT " src_c=" SIZE_FORMAT " pos=" SIZE_FORMAT, 664 split_type, p2i(source_next), split_region, partial_obj_size); 665 log_develop_trace(gc, compaction)("%s split: dst=" PTR_FORMAT " dst_c=" SIZE_FORMAT " tn=" PTR_FORMAT, 666 split_type, p2i(split_destination), 667 addr_to_region_idx(split_destination), 668 p2i(*target_next)); 669 670 if (partial_obj_size != 0) { 671 HeapWord* const po_beg = split_info.destination(); 672 HeapWord* const po_end = po_beg + split_info.partial_obj_size(); 673 log_develop_trace(gc, compaction)("%s split: po_beg=" PTR_FORMAT " " SIZE_FORMAT " po_end=" PTR_FORMAT " " SIZE_FORMAT, 674 split_type, 675 p2i(po_beg), addr_to_region_idx(po_beg), 676 p2i(po_end), addr_to_region_idx(po_end)); 677 } 678 } 679 680 return source_next; 681 } 682 683 bool ParallelCompactData::summarize(SplitInfo& split_info, 684 HeapWord* source_beg, HeapWord* source_end, 685 HeapWord** source_next, 686 HeapWord* target_beg, HeapWord* target_end, 687 HeapWord** target_next) 688 { 689 HeapWord* const source_next_val = source_next == NULL ? NULL : *source_next; 690 log_develop_trace(gc, compaction)( 691 "sb=" PTR_FORMAT " se=" PTR_FORMAT " sn=" PTR_FORMAT 692 "tb=" PTR_FORMAT " te=" PTR_FORMAT " tn=" PTR_FORMAT, 693 p2i(source_beg), p2i(source_end), p2i(source_next_val), 694 p2i(target_beg), p2i(target_end), p2i(*target_next)); 695 696 size_t cur_region = addr_to_region_idx(source_beg); 697 const size_t end_region = addr_to_region_idx(region_align_up(source_end)); 698 699 HeapWord *dest_addr = target_beg; 700 while (cur_region < end_region) { 701 // The destination must be set even if the region has no data. 702 _region_data[cur_region].set_destination(dest_addr); 703 704 size_t words = _region_data[cur_region].data_size(); 705 if (words > 0) { 706 // If cur_region does not fit entirely into the target space, find a point 707 // at which the source space can be 'split' so that part is copied to the 708 // target space and the rest is copied elsewhere. 709 if (dest_addr + words > target_end) { 710 assert(source_next != NULL, "source_next is NULL when splitting"); 711 *source_next = summarize_split_space(cur_region, split_info, dest_addr, 712 target_end, target_next); 713 return false; 714 } 715 716 // Compute the destination_count for cur_region, and if necessary, update 717 // source_region for a destination region. The source_region field is 718 // updated if cur_region is the first (left-most) region to be copied to a 719 // destination region. 720 // 721 // The destination_count calculation is a bit subtle. A region that has 722 // data that compacts into itself does not count itself as a destination. 723 // This maintains the invariant that a zero count means the region is 724 // available and can be claimed and then filled. 725 uint destination_count = 0; 726 if (split_info.is_split(cur_region)) { 727 // The current region has been split: the partial object will be copied 728 // to one destination space and the remaining data will be copied to 729 // another destination space. Adjust the initial destination_count and, 730 // if necessary, set the source_region field if the partial object will 731 // cross a destination region boundary. 732 destination_count = split_info.destination_count(); 733 if (destination_count == 2) { 734 size_t dest_idx = addr_to_region_idx(split_info.dest_region_addr()); 735 _region_data[dest_idx].set_source_region(cur_region); 736 } 737 } 738 739 HeapWord* const last_addr = dest_addr + words - 1; 740 const size_t dest_region_1 = addr_to_region_idx(dest_addr); 741 const size_t dest_region_2 = addr_to_region_idx(last_addr); 742 743 // Initially assume that the destination regions will be the same and 744 // adjust the value below if necessary. Under this assumption, if 745 // cur_region == dest_region_2, then cur_region will be compacted 746 // completely into itself. 747 destination_count += cur_region == dest_region_2 ? 0 : 1; 748 if (dest_region_1 != dest_region_2) { 749 // Destination regions differ; adjust destination_count. 750 destination_count += 1; 751 // Data from cur_region will be copied to the start of dest_region_2. 752 _region_data[dest_region_2].set_source_region(cur_region); 753 } else if (region_offset(dest_addr) == 0) { 754 // Data from cur_region will be copied to the start of the destination 755 // region. 756 _region_data[dest_region_1].set_source_region(cur_region); 757 } 758 759 _region_data[cur_region].set_destination_count(destination_count); 760 _region_data[cur_region].set_data_location(region_to_addr(cur_region)); 761 dest_addr += words; 762 } 763 764 ++cur_region; 765 } 766 767 *target_next = dest_addr; 768 return true; 769 } 770 771 HeapWord* ParallelCompactData::calc_new_pointer(HeapWord* addr, ParCompactionManager* cm) { 772 assert(addr != NULL, "Should detect NULL oop earlier"); 773 assert(ParallelScavengeHeap::heap()->is_in(addr), "not in heap"); 774 assert(PSParallelCompact::mark_bitmap()->is_marked(addr), "not marked"); 775 776 // Region covering the object. 777 RegionData* const region_ptr = addr_to_region_ptr(addr); 778 HeapWord* result = region_ptr->destination(); 779 780 // If the entire Region is live, the new location is region->destination + the 781 // offset of the object within in the Region. 782 783 // Run some performance tests to determine if this special case pays off. It 784 // is worth it for pointers into the dense prefix. If the optimization to 785 // avoid pointer updates in regions that only point to the dense prefix is 786 // ever implemented, this should be revisited. 787 if (region_ptr->data_size() == RegionSize) { 788 result += region_offset(addr); 789 return result; 790 } 791 792 // Otherwise, the new location is region->destination + block offset + the 793 // number of live words in the Block that are (a) to the left of addr and (b) 794 // due to objects that start in the Block. 795 796 // Fill in the block table if necessary. This is unsynchronized, so multiple 797 // threads may fill the block table for a region (harmless, since it is 798 // idempotent). 799 if (!region_ptr->blocks_filled()) { 800 PSParallelCompact::fill_blocks(addr_to_region_idx(addr)); 801 region_ptr->set_blocks_filled(); 802 } 803 804 HeapWord* const search_start = block_align_down(addr); 805 const size_t block_offset = addr_to_block_ptr(addr)->offset(); 806 807 const ParMarkBitMap* bitmap = PSParallelCompact::mark_bitmap(); 808 const size_t live = bitmap->live_words_in_range(cm, search_start, oop(addr)); 809 result += block_offset + live; 810 DEBUG_ONLY(PSParallelCompact::check_new_location(addr, result)); 811 return result; 812 } 813 814 #ifdef ASSERT 815 void ParallelCompactData::verify_clear(const PSVirtualSpace* vspace) 816 { 817 const size_t* const beg = (const size_t*)vspace->committed_low_addr(); 818 const size_t* const end = (const size_t*)vspace->committed_high_addr(); 819 for (const size_t* p = beg; p < end; ++p) { 820 assert(*p == 0, "not zero"); 821 } 822 } 823 824 void ParallelCompactData::verify_clear() 825 { 826 verify_clear(_region_vspace); 827 verify_clear(_block_vspace); 828 } 829 #endif // #ifdef ASSERT 830 831 STWGCTimer PSParallelCompact::_gc_timer; 832 ParallelOldTracer PSParallelCompact::_gc_tracer; 833 elapsedTimer PSParallelCompact::_accumulated_time; 834 unsigned int PSParallelCompact::_total_invocations = 0; 835 unsigned int PSParallelCompact::_maximum_compaction_gc_num = 0; 836 jlong PSParallelCompact::_time_of_last_gc = 0; 837 CollectorCounters* PSParallelCompact::_counters = NULL; 838 ParMarkBitMap PSParallelCompact::_mark_bitmap; 839 ParallelCompactData PSParallelCompact::_summary_data; 840 841 PSParallelCompact::IsAliveClosure PSParallelCompact::_is_alive_closure; 842 843 bool PSParallelCompact::IsAliveClosure::do_object_b(oop p) { return mark_bitmap()->is_marked(p); } 844 845 void PSParallelCompact::post_initialize() { 846 ParallelScavengeHeap* heap = ParallelScavengeHeap::heap(); 847 _span_based_discoverer.set_span(heap->reserved_region()); 848 _ref_processor = 849 new ReferenceProcessor(&_span_based_discoverer, 850 ParallelRefProcEnabled && (ParallelGCThreads > 1), // mt processing 851 ParallelGCThreads, // mt processing degree 852 true, // mt discovery 853 ParallelGCThreads, // mt discovery degree 854 true, // atomic_discovery 855 &_is_alive_closure, // non-header is alive closure 856 false); // disable adjusting number of processing threads 857 _counters = new CollectorCounters("PSParallelCompact", 1); 858 859 // Initialize static fields in ParCompactionManager. 860 ParCompactionManager::initialize(mark_bitmap()); 861 } 862 863 bool PSParallelCompact::initialize() { 864 ParallelScavengeHeap* heap = ParallelScavengeHeap::heap(); 865 MemRegion mr = heap->reserved_region(); 866 867 // Was the old gen get allocated successfully? 868 if (!heap->old_gen()->is_allocated()) { 869 return false; 870 } 871 872 initialize_space_info(); 873 initialize_dead_wood_limiter(); 874 875 if (!_mark_bitmap.initialize(mr)) { 876 vm_shutdown_during_initialization( 877 err_msg("Unable to allocate " SIZE_FORMAT "KB bitmaps for parallel " 878 "garbage collection for the requested " SIZE_FORMAT "KB heap.", 879 _mark_bitmap.reserved_byte_size()/K, mr.byte_size()/K)); 880 return false; 881 } 882 883 if (!_summary_data.initialize(mr)) { 884 vm_shutdown_during_initialization( 885 err_msg("Unable to allocate " SIZE_FORMAT "KB card tables for parallel " 886 "garbage collection for the requested " SIZE_FORMAT "KB heap.", 887 _summary_data.reserved_byte_size()/K, mr.byte_size()/K)); 888 return false; 889 } 890 891 return true; 892 } 893 894 void PSParallelCompact::initialize_space_info() 895 { 896 memset(&_space_info, 0, sizeof(_space_info)); 897 898 ParallelScavengeHeap* heap = ParallelScavengeHeap::heap(); 899 PSYoungGen* young_gen = heap->young_gen(); 900 901 _space_info[old_space_id].set_space(heap->old_gen()->object_space()); 902 _space_info[eden_space_id].set_space(young_gen->eden_space()); 903 _space_info[from_space_id].set_space(young_gen->from_space()); 904 _space_info[to_space_id].set_space(young_gen->to_space()); 905 906 _space_info[old_space_id].set_start_array(heap->old_gen()->start_array()); 907 } 908 909 void PSParallelCompact::initialize_dead_wood_limiter() 910 { 911 const size_t max = 100; 912 _dwl_mean = double(MIN2(ParallelOldDeadWoodLimiterMean, max)) / 100.0; 913 _dwl_std_dev = double(MIN2(ParallelOldDeadWoodLimiterStdDev, max)) / 100.0; 914 _dwl_first_term = 1.0 / (sqrt(2.0 * M_PI) * _dwl_std_dev); 915 DEBUG_ONLY(_dwl_initialized = true;) 916 _dwl_adjustment = normal_distribution(1.0); 917 } 918 919 void 920 PSParallelCompact::clear_data_covering_space(SpaceId id) 921 { 922 // At this point, top is the value before GC, new_top() is the value that will 923 // be set at the end of GC. The marking bitmap is cleared to top; nothing 924 // should be marked above top. The summary data is cleared to the larger of 925 // top & new_top. 926 MutableSpace* const space = _space_info[id].space(); 927 HeapWord* const bot = space->bottom(); 928 HeapWord* const top = space->top(); 929 HeapWord* const max_top = MAX2(top, _space_info[id].new_top()); 930 931 const idx_t beg_bit = _mark_bitmap.addr_to_bit(bot); 932 const idx_t end_bit = BitMap::word_align_up(_mark_bitmap.addr_to_bit(top)); 933 _mark_bitmap.clear_range(beg_bit, end_bit); 934 935 const size_t beg_region = _summary_data.addr_to_region_idx(bot); 936 const size_t end_region = 937 _summary_data.addr_to_region_idx(_summary_data.region_align_up(max_top)); 938 _summary_data.clear_range(beg_region, end_region); 939 940 // Clear the data used to 'split' regions. 941 SplitInfo& split_info = _space_info[id].split_info(); 942 if (split_info.is_valid()) { 943 split_info.clear(); 944 } 945 DEBUG_ONLY(split_info.verify_clear();) 946 } 947 948 void PSParallelCompact::pre_compact() 949 { 950 // Update the from & to space pointers in space_info, since they are swapped 951 // at each young gen gc. Do the update unconditionally (even though a 952 // promotion failure does not swap spaces) because an unknown number of young 953 // collections will have swapped the spaces an unknown number of times. 954 GCTraceTime(Debug, gc, phases) tm("Pre Compact", &_gc_timer); 955 ParallelScavengeHeap* heap = ParallelScavengeHeap::heap(); 956 _space_info[from_space_id].set_space(heap->young_gen()->from_space()); 957 _space_info[to_space_id].set_space(heap->young_gen()->to_space()); 958 959 DEBUG_ONLY(add_obj_count = add_obj_size = 0;) 960 DEBUG_ONLY(mark_bitmap_count = mark_bitmap_size = 0;) 961 962 // Increment the invocation count 963 heap->increment_total_collections(true); 964 965 // We need to track unique mark sweep invocations as well. 966 _total_invocations++; 967 968 heap->print_heap_before_gc(); 969 heap->trace_heap_before_gc(&_gc_tracer); 970 971 // Fill in TLABs 972 heap->accumulate_statistics_all_tlabs(); 973 heap->ensure_parsability(true); // retire TLABs 974 975 if (VerifyBeforeGC && heap->total_collections() >= VerifyGCStartAt) { 976 HandleMark hm; // Discard invalid handles created during verification 977 Universe::verify("Before GC"); 978 } 979 980 // Verify object start arrays 981 if (VerifyObjectStartArray && 982 VerifyBeforeGC) { 983 heap->old_gen()->verify_object_start_array(); 984 } 985 986 DEBUG_ONLY(mark_bitmap()->verify_clear();) 987 DEBUG_ONLY(summary_data().verify_clear();) 988 989 // Have worker threads release resources the next time they run a task. 990 gc_task_manager()->release_all_resources(); 991 992 ParCompactionManager::reset_all_bitmap_query_caches(); 993 } 994 995 void PSParallelCompact::post_compact() 996 { 997 GCTraceTime(Info, gc, phases) tm("Post Compact", &_gc_timer); 998 999 for (unsigned int id = old_space_id; id < last_space_id; ++id) { 1000 // Clear the marking bitmap, summary data and split info. 1001 clear_data_covering_space(SpaceId(id)); 1002 // Update top(). Must be done after clearing the bitmap and summary data. 1003 _space_info[id].publish_new_top(); 1004 } 1005 1006 MutableSpace* const eden_space = _space_info[eden_space_id].space(); 1007 MutableSpace* const from_space = _space_info[from_space_id].space(); 1008 MutableSpace* const to_space = _space_info[to_space_id].space(); 1009 1010 ParallelScavengeHeap* heap = ParallelScavengeHeap::heap(); 1011 bool eden_empty = eden_space->is_empty(); 1012 if (!eden_empty) { 1013 eden_empty = absorb_live_data_from_eden(heap->size_policy(), 1014 heap->young_gen(), heap->old_gen()); 1015 } 1016 1017 // Update heap occupancy information which is used as input to the soft ref 1018 // clearing policy at the next gc. 1019 Universe::update_heap_info_at_gc(); 1020 1021 bool young_gen_empty = eden_empty && from_space->is_empty() && 1022 to_space->is_empty(); 1023 1024 PSCardTable* ct = heap->card_table(); 1025 MemRegion old_mr = heap->old_gen()->reserved(); 1026 if (young_gen_empty) { 1027 ct->clear(MemRegion(old_mr.start(), old_mr.end())); 1028 } else { 1029 ct->invalidate(MemRegion(old_mr.start(), old_mr.end())); 1030 } 1031 1032 // Delete metaspaces for unloaded class loaders and clean up loader_data graph 1033 ClassLoaderDataGraph::purge(); 1034 MetaspaceUtils::verify_metrics(); 1035 1036 CodeCache::gc_epilogue(); 1037 JvmtiExport::gc_epilogue(); 1038 1039 #if COMPILER2_OR_JVMCI 1040 DerivedPointerTable::update_pointers(); 1041 #endif 1042 1043 if (ZapUnusedHeapArea) { 1044 heap->gen_mangle_unused_area(); 1045 } 1046 1047 // Update time of last GC 1048 reset_millis_since_last_gc(); 1049 } 1050 1051 HeapWord* 1052 PSParallelCompact::compute_dense_prefix_via_density(const SpaceId id, 1053 bool maximum_compaction) 1054 { 1055 const size_t region_size = ParallelCompactData::RegionSize; 1056 const ParallelCompactData& sd = summary_data(); 1057 1058 const MutableSpace* const space = _space_info[id].space(); 1059 HeapWord* const top_aligned_up = sd.region_align_up(space->top()); 1060 const RegionData* const beg_cp = sd.addr_to_region_ptr(space->bottom()); 1061 const RegionData* const end_cp = sd.addr_to_region_ptr(top_aligned_up); 1062 1063 // Skip full regions at the beginning of the space--they are necessarily part 1064 // of the dense prefix. 1065 size_t full_count = 0; 1066 const RegionData* cp; 1067 for (cp = beg_cp; cp < end_cp && cp->data_size() == region_size; ++cp) { 1068 ++full_count; 1069 } 1070 1071 assert(total_invocations() >= _maximum_compaction_gc_num, "sanity"); 1072 const size_t gcs_since_max = total_invocations() - _maximum_compaction_gc_num; 1073 const bool interval_ended = gcs_since_max > HeapMaximumCompactionInterval; 1074 if (maximum_compaction || cp == end_cp || interval_ended) { 1075 _maximum_compaction_gc_num = total_invocations(); 1076 return sd.region_to_addr(cp); 1077 } 1078 1079 HeapWord* const new_top = _space_info[id].new_top(); 1080 const size_t space_live = pointer_delta(new_top, space->bottom()); 1081 const size_t space_used = space->used_in_words(); 1082 const size_t space_capacity = space->capacity_in_words(); 1083 1084 const double cur_density = double(space_live) / space_capacity; 1085 const double deadwood_density = 1086 (1.0 - cur_density) * (1.0 - cur_density) * cur_density * cur_density; 1087 const size_t deadwood_goal = size_t(space_capacity * deadwood_density); 1088 1089 if (TraceParallelOldGCDensePrefix) { 1090 tty->print_cr("cur_dens=%5.3f dw_dens=%5.3f dw_goal=" SIZE_FORMAT, 1091 cur_density, deadwood_density, deadwood_goal); 1092 tty->print_cr("space_live=" SIZE_FORMAT " " "space_used=" SIZE_FORMAT " " 1093 "space_cap=" SIZE_FORMAT, 1094 space_live, space_used, 1095 space_capacity); 1096 } 1097 1098 // XXX - Use binary search? 1099 HeapWord* dense_prefix = sd.region_to_addr(cp); 1100 const RegionData* full_cp = cp; 1101 const RegionData* const top_cp = sd.addr_to_region_ptr(space->top() - 1); 1102 while (cp < end_cp) { 1103 HeapWord* region_destination = cp->destination(); 1104 const size_t cur_deadwood = pointer_delta(dense_prefix, region_destination); 1105 if (TraceParallelOldGCDensePrefix && Verbose) { 1106 tty->print_cr("c#=" SIZE_FORMAT_W(4) " dst=" PTR_FORMAT " " 1107 "dp=" PTR_FORMAT " " "cdw=" SIZE_FORMAT_W(8), 1108 sd.region(cp), p2i(region_destination), 1109 p2i(dense_prefix), cur_deadwood); 1110 } 1111 1112 if (cur_deadwood >= deadwood_goal) { 1113 // Found the region that has the correct amount of deadwood to the left. 1114 // This typically occurs after crossing a fairly sparse set of regions, so 1115 // iterate backwards over those sparse regions, looking for the region 1116 // that has the lowest density of live objects 'to the right.' 1117 size_t space_to_left = sd.region(cp) * region_size; 1118 size_t live_to_left = space_to_left - cur_deadwood; 1119 size_t space_to_right = space_capacity - space_to_left; 1120 size_t live_to_right = space_live - live_to_left; 1121 double density_to_right = double(live_to_right) / space_to_right; 1122 while (cp > full_cp) { 1123 --cp; 1124 const size_t prev_region_live_to_right = live_to_right - 1125 cp->data_size(); 1126 const size_t prev_region_space_to_right = space_to_right + region_size; 1127 double prev_region_density_to_right = 1128 double(prev_region_live_to_right) / prev_region_space_to_right; 1129 if (density_to_right <= prev_region_density_to_right) { 1130 return dense_prefix; 1131 } 1132 if (TraceParallelOldGCDensePrefix && Verbose) { 1133 tty->print_cr("backing up from c=" SIZE_FORMAT_W(4) " d2r=%10.8f " 1134 "pc_d2r=%10.8f", sd.region(cp), density_to_right, 1135 prev_region_density_to_right); 1136 } 1137 dense_prefix -= region_size; 1138 live_to_right = prev_region_live_to_right; 1139 space_to_right = prev_region_space_to_right; 1140 density_to_right = prev_region_density_to_right; 1141 } 1142 return dense_prefix; 1143 } 1144 1145 dense_prefix += region_size; 1146 ++cp; 1147 } 1148 1149 return dense_prefix; 1150 } 1151 1152 #ifndef PRODUCT 1153 void PSParallelCompact::print_dense_prefix_stats(const char* const algorithm, 1154 const SpaceId id, 1155 const bool maximum_compaction, 1156 HeapWord* const addr) 1157 { 1158 const size_t region_idx = summary_data().addr_to_region_idx(addr); 1159 RegionData* const cp = summary_data().region(region_idx); 1160 const MutableSpace* const space = _space_info[id].space(); 1161 HeapWord* const new_top = _space_info[id].new_top(); 1162 1163 const size_t space_live = pointer_delta(new_top, space->bottom()); 1164 const size_t dead_to_left = pointer_delta(addr, cp->destination()); 1165 const size_t space_cap = space->capacity_in_words(); 1166 const double dead_to_left_pct = double(dead_to_left) / space_cap; 1167 const size_t live_to_right = new_top - cp->destination(); 1168 const size_t dead_to_right = space->top() - addr - live_to_right; 1169 1170 tty->print_cr("%s=" PTR_FORMAT " dpc=" SIZE_FORMAT_W(5) " " 1171 "spl=" SIZE_FORMAT " " 1172 "d2l=" SIZE_FORMAT " d2l%%=%6.4f " 1173 "d2r=" SIZE_FORMAT " l2r=" SIZE_FORMAT 1174 " ratio=%10.8f", 1175 algorithm, p2i(addr), region_idx, 1176 space_live, 1177 dead_to_left, dead_to_left_pct, 1178 dead_to_right, live_to_right, 1179 double(dead_to_right) / live_to_right); 1180 } 1181 #endif // #ifndef PRODUCT 1182 1183 // Return a fraction indicating how much of the generation can be treated as 1184 // "dead wood" (i.e., not reclaimed). The function uses a normal distribution 1185 // based on the density of live objects in the generation to determine a limit, 1186 // which is then adjusted so the return value is min_percent when the density is 1187 // 1. 1188 // 1189 // The following table shows some return values for a different values of the 1190 // standard deviation (ParallelOldDeadWoodLimiterStdDev); the mean is 0.5 and 1191 // min_percent is 1. 1192 // 1193 // fraction allowed as dead wood 1194 // ----------------------------------------------------------------- 1195 // density std_dev=70 std_dev=75 std_dev=80 std_dev=85 std_dev=90 std_dev=95 1196 // ------- ---------- ---------- ---------- ---------- ---------- ---------- 1197 // 0.00000 0.01000000 0.01000000 0.01000000 0.01000000 0.01000000 0.01000000 1198 // 0.05000 0.03193096 0.02836880 0.02550828 0.02319280 0.02130337 0.01974941 1199 // 0.10000 0.05247504 0.04547452 0.03988045 0.03537016 0.03170171 0.02869272 1200 // 0.15000 0.07135702 0.06111390 0.05296419 0.04641639 0.04110601 0.03676066 1201 // 0.20000 0.08831616 0.07509618 0.06461766 0.05622444 0.04943437 0.04388975 1202 // 0.25000 0.10311208 0.08724696 0.07471205 0.06469760 0.05661313 0.05002313 1203 // 0.30000 0.11553050 0.09741183 0.08313394 0.07175114 0.06257797 0.05511132 1204 // 0.35000 0.12538832 0.10545958 0.08978741 0.07731366 0.06727491 0.05911289 1205 // 0.40000 0.13253818 0.11128511 0.09459590 0.08132834 0.07066107 0.06199500 1206 // 0.45000 0.13687208 0.11481163 0.09750361 0.08375387 0.07270534 0.06373386 1207 // 0.50000 0.13832410 0.11599237 0.09847664 0.08456518 0.07338887 0.06431510 1208 // 0.55000 0.13687208 0.11481163 0.09750361 0.08375387 0.07270534 0.06373386 1209 // 0.60000 0.13253818 0.11128511 0.09459590 0.08132834 0.07066107 0.06199500 1210 // 0.65000 0.12538832 0.10545958 0.08978741 0.07731366 0.06727491 0.05911289 1211 // 0.70000 0.11553050 0.09741183 0.08313394 0.07175114 0.06257797 0.05511132 1212 // 0.75000 0.10311208 0.08724696 0.07471205 0.06469760 0.05661313 0.05002313 1213 // 0.80000 0.08831616 0.07509618 0.06461766 0.05622444 0.04943437 0.04388975 1214 // 0.85000 0.07135702 0.06111390 0.05296419 0.04641639 0.04110601 0.03676066 1215 // 0.90000 0.05247504 0.04547452 0.03988045 0.03537016 0.03170171 0.02869272 1216 // 0.95000 0.03193096 0.02836880 0.02550828 0.02319280 0.02130337 0.01974941 1217 // 1.00000 0.01000000 0.01000000 0.01000000 0.01000000 0.01000000 0.01000000 1218 1219 double PSParallelCompact::dead_wood_limiter(double density, size_t min_percent) 1220 { 1221 assert(_dwl_initialized, "uninitialized"); 1222 1223 // The raw limit is the value of the normal distribution at x = density. 1224 const double raw_limit = normal_distribution(density); 1225 1226 // Adjust the raw limit so it becomes the minimum when the density is 1. 1227 // 1228 // First subtract the adjustment value (which is simply the precomputed value 1229 // normal_distribution(1.0)); this yields a value of 0 when the density is 1. 1230 // Then add the minimum value, so the minimum is returned when the density is 1231 // 1. Finally, prevent negative values, which occur when the mean is not 0.5. 1232 const double min = double(min_percent) / 100.0; 1233 const double limit = raw_limit - _dwl_adjustment + min; 1234 return MAX2(limit, 0.0); 1235 } 1236 1237 ParallelCompactData::RegionData* 1238 PSParallelCompact::first_dead_space_region(const RegionData* beg, 1239 const RegionData* end) 1240 { 1241 const size_t region_size = ParallelCompactData::RegionSize; 1242 ParallelCompactData& sd = summary_data(); 1243 size_t left = sd.region(beg); 1244 size_t right = end > beg ? sd.region(end) - 1 : left; 1245 1246 // Binary search. 1247 while (left < right) { 1248 // Equivalent to (left + right) / 2, but does not overflow. 1249 const size_t middle = left + (right - left) / 2; 1250 RegionData* const middle_ptr = sd.region(middle); 1251 HeapWord* const dest = middle_ptr->destination(); 1252 HeapWord* const addr = sd.region_to_addr(middle); 1253 assert(dest != NULL, "sanity"); 1254 assert(dest <= addr, "must move left"); 1255 1256 if (middle > left && dest < addr) { 1257 right = middle - 1; 1258 } else if (middle < right && middle_ptr->data_size() == region_size) { 1259 left = middle + 1; 1260 } else { 1261 return middle_ptr; 1262 } 1263 } 1264 return sd.region(left); 1265 } 1266 1267 ParallelCompactData::RegionData* 1268 PSParallelCompact::dead_wood_limit_region(const RegionData* beg, 1269 const RegionData* end, 1270 size_t dead_words) 1271 { 1272 ParallelCompactData& sd = summary_data(); 1273 size_t left = sd.region(beg); 1274 size_t right = end > beg ? sd.region(end) - 1 : left; 1275 1276 // Binary search. 1277 while (left < right) { 1278 // Equivalent to (left + right) / 2, but does not overflow. 1279 const size_t middle = left + (right - left) / 2; 1280 RegionData* const middle_ptr = sd.region(middle); 1281 HeapWord* const dest = middle_ptr->destination(); 1282 HeapWord* const addr = sd.region_to_addr(middle); 1283 assert(dest != NULL, "sanity"); 1284 assert(dest <= addr, "must move left"); 1285 1286 const size_t dead_to_left = pointer_delta(addr, dest); 1287 if (middle > left && dead_to_left > dead_words) { 1288 right = middle - 1; 1289 } else if (middle < right && dead_to_left < dead_words) { 1290 left = middle + 1; 1291 } else { 1292 return middle_ptr; 1293 } 1294 } 1295 return sd.region(left); 1296 } 1297 1298 // The result is valid during the summary phase, after the initial summarization 1299 // of each space into itself, and before final summarization. 1300 inline double 1301 PSParallelCompact::reclaimed_ratio(const RegionData* const cp, 1302 HeapWord* const bottom, 1303 HeapWord* const top, 1304 HeapWord* const new_top) 1305 { 1306 ParallelCompactData& sd = summary_data(); 1307 1308 assert(cp != NULL, "sanity"); 1309 assert(bottom != NULL, "sanity"); 1310 assert(top != NULL, "sanity"); 1311 assert(new_top != NULL, "sanity"); 1312 assert(top >= new_top, "summary data problem?"); 1313 assert(new_top > bottom, "space is empty; should not be here"); 1314 assert(new_top >= cp->destination(), "sanity"); 1315 assert(top >= sd.region_to_addr(cp), "sanity"); 1316 1317 HeapWord* const destination = cp->destination(); 1318 const size_t dense_prefix_live = pointer_delta(destination, bottom); 1319 const size_t compacted_region_live = pointer_delta(new_top, destination); 1320 const size_t compacted_region_used = pointer_delta(top, 1321 sd.region_to_addr(cp)); 1322 const size_t reclaimable = compacted_region_used - compacted_region_live; 1323 1324 const double divisor = dense_prefix_live + 1.25 * compacted_region_live; 1325 return double(reclaimable) / divisor; 1326 } 1327 1328 // Return the address of the end of the dense prefix, a.k.a. the start of the 1329 // compacted region. The address is always on a region boundary. 1330 // 1331 // Completely full regions at the left are skipped, since no compaction can 1332 // occur in those regions. Then the maximum amount of dead wood to allow is 1333 // computed, based on the density (amount live / capacity) of the generation; 1334 // the region with approximately that amount of dead space to the left is 1335 // identified as the limit region. Regions between the last completely full 1336 // region and the limit region are scanned and the one that has the best 1337 // (maximum) reclaimed_ratio() is selected. 1338 HeapWord* 1339 PSParallelCompact::compute_dense_prefix(const SpaceId id, 1340 bool maximum_compaction) 1341 { 1342 const size_t region_size = ParallelCompactData::RegionSize; 1343 const ParallelCompactData& sd = summary_data(); 1344 1345 const MutableSpace* const space = _space_info[id].space(); 1346 HeapWord* const top = space->top(); 1347 HeapWord* const top_aligned_up = sd.region_align_up(top); 1348 HeapWord* const new_top = _space_info[id].new_top(); 1349 HeapWord* const new_top_aligned_up = sd.region_align_up(new_top); 1350 HeapWord* const bottom = space->bottom(); 1351 const RegionData* const beg_cp = sd.addr_to_region_ptr(bottom); 1352 const RegionData* const top_cp = sd.addr_to_region_ptr(top_aligned_up); 1353 const RegionData* const new_top_cp = 1354 sd.addr_to_region_ptr(new_top_aligned_up); 1355 1356 // Skip full regions at the beginning of the space--they are necessarily part 1357 // of the dense prefix. 1358 const RegionData* const full_cp = first_dead_space_region(beg_cp, new_top_cp); 1359 assert(full_cp->destination() == sd.region_to_addr(full_cp) || 1360 space->is_empty(), "no dead space allowed to the left"); 1361 assert(full_cp->data_size() < region_size || full_cp == new_top_cp - 1, 1362 "region must have dead space"); 1363 1364 // The gc number is saved whenever a maximum compaction is done, and used to 1365 // determine when the maximum compaction interval has expired. This avoids 1366 // successive max compactions for different reasons. 1367 assert(total_invocations() >= _maximum_compaction_gc_num, "sanity"); 1368 const size_t gcs_since_max = total_invocations() - _maximum_compaction_gc_num; 1369 const bool interval_ended = gcs_since_max > HeapMaximumCompactionInterval || 1370 total_invocations() == HeapFirstMaximumCompactionCount; 1371 if (maximum_compaction || full_cp == top_cp || interval_ended) { 1372 _maximum_compaction_gc_num = total_invocations(); 1373 return sd.region_to_addr(full_cp); 1374 } 1375 1376 const size_t space_live = pointer_delta(new_top, bottom); 1377 const size_t space_used = space->used_in_words(); 1378 const size_t space_capacity = space->capacity_in_words(); 1379 1380 const double density = double(space_live) / double(space_capacity); 1381 const size_t min_percent_free = MarkSweepDeadRatio; 1382 const double limiter = dead_wood_limiter(density, min_percent_free); 1383 const size_t dead_wood_max = space_used - space_live; 1384 const size_t dead_wood_limit = MIN2(size_t(space_capacity * limiter), 1385 dead_wood_max); 1386 1387 if (TraceParallelOldGCDensePrefix) { 1388 tty->print_cr("space_live=" SIZE_FORMAT " " "space_used=" SIZE_FORMAT " " 1389 "space_cap=" SIZE_FORMAT, 1390 space_live, space_used, 1391 space_capacity); 1392 tty->print_cr("dead_wood_limiter(%6.4f, " SIZE_FORMAT ")=%6.4f " 1393 "dead_wood_max=" SIZE_FORMAT " dead_wood_limit=" SIZE_FORMAT, 1394 density, min_percent_free, limiter, 1395 dead_wood_max, dead_wood_limit); 1396 } 1397 1398 // Locate the region with the desired amount of dead space to the left. 1399 const RegionData* const limit_cp = 1400 dead_wood_limit_region(full_cp, top_cp, dead_wood_limit); 1401 1402 // Scan from the first region with dead space to the limit region and find the 1403 // one with the best (largest) reclaimed ratio. 1404 double best_ratio = 0.0; 1405 const RegionData* best_cp = full_cp; 1406 for (const RegionData* cp = full_cp; cp < limit_cp; ++cp) { 1407 double tmp_ratio = reclaimed_ratio(cp, bottom, top, new_top); 1408 if (tmp_ratio > best_ratio) { 1409 best_cp = cp; 1410 best_ratio = tmp_ratio; 1411 } 1412 } 1413 1414 return sd.region_to_addr(best_cp); 1415 } 1416 1417 void PSParallelCompact::summarize_spaces_quick() 1418 { 1419 for (unsigned int i = 0; i < last_space_id; ++i) { 1420 const MutableSpace* space = _space_info[i].space(); 1421 HeapWord** nta = _space_info[i].new_top_addr(); 1422 bool result = _summary_data.summarize(_space_info[i].split_info(), 1423 space->bottom(), space->top(), NULL, 1424 space->bottom(), space->end(), nta); 1425 assert(result, "space must fit into itself"); 1426 _space_info[i].set_dense_prefix(space->bottom()); 1427 } 1428 } 1429 1430 void PSParallelCompact::fill_dense_prefix_end(SpaceId id) 1431 { 1432 HeapWord* const dense_prefix_end = dense_prefix(id); 1433 const RegionData* region = _summary_data.addr_to_region_ptr(dense_prefix_end); 1434 const idx_t dense_prefix_bit = _mark_bitmap.addr_to_bit(dense_prefix_end); 1435 if (dead_space_crosses_boundary(region, dense_prefix_bit)) { 1436 // Only enough dead space is filled so that any remaining dead space to the 1437 // left is larger than the minimum filler object. (The remainder is filled 1438 // during the copy/update phase.) 1439 // 1440 // The size of the dead space to the right of the boundary is not a 1441 // concern, since compaction will be able to use whatever space is 1442 // available. 1443 // 1444 // Here '||' is the boundary, 'x' represents a don't care bit and a box 1445 // surrounds the space to be filled with an object. 1446 // 1447 // In the 32-bit VM, each bit represents two 32-bit words: 1448 // +---+ 1449 // a) beg_bits: ... x x x | 0 | || 0 x x ... 1450 // end_bits: ... x x x | 0 | || 0 x x ... 1451 // +---+ 1452 // 1453 // In the 64-bit VM, each bit represents one 64-bit word: 1454 // +------------+ 1455 // b) beg_bits: ... x x x | 0 || 0 | x x ... 1456 // end_bits: ... x x 1 | 0 || 0 | x x ... 1457 // +------------+ 1458 // +-------+ 1459 // c) beg_bits: ... x x | 0 0 | || 0 x x ... 1460 // end_bits: ... x 1 | 0 0 | || 0 x x ... 1461 // +-------+ 1462 // +-----------+ 1463 // d) beg_bits: ... x | 0 0 0 | || 0 x x ... 1464 // end_bits: ... 1 | 0 0 0 | || 0 x x ... 1465 // +-----------+ 1466 // +-------+ 1467 // e) beg_bits: ... 0 0 | 0 0 | || 0 x x ... 1468 // end_bits: ... 0 0 | 0 0 | || 0 x x ... 1469 // +-------+ 1470 1471 // Initially assume case a, c or e will apply. 1472 size_t obj_len = CollectedHeap::min_fill_size(); 1473 HeapWord* obj_beg = dense_prefix_end - obj_len; 1474 1475 #ifdef _LP64 1476 if (MinObjAlignment > 1) { // object alignment > heap word size 1477 // Cases a, c or e. 1478 } else if (_mark_bitmap.is_obj_end(dense_prefix_bit - 2)) { 1479 // Case b above. 1480 obj_beg = dense_prefix_end - 1; 1481 } else if (!_mark_bitmap.is_obj_end(dense_prefix_bit - 3) && 1482 _mark_bitmap.is_obj_end(dense_prefix_bit - 4)) { 1483 // Case d above. 1484 obj_beg = dense_prefix_end - 3; 1485 obj_len = 3; 1486 } 1487 #endif // #ifdef _LP64 1488 1489 CollectedHeap::fill_with_object(obj_beg, obj_len); 1490 _mark_bitmap.mark_obj(obj_beg, obj_len); 1491 _summary_data.add_obj(obj_beg, obj_len); 1492 assert(start_array(id) != NULL, "sanity"); 1493 start_array(id)->allocate_block(obj_beg); 1494 } 1495 } 1496 1497 void 1498 PSParallelCompact::summarize_space(SpaceId id, bool maximum_compaction) 1499 { 1500 assert(id < last_space_id, "id out of range"); 1501 assert(_space_info[id].dense_prefix() == _space_info[id].space()->bottom(), 1502 "should have been reset in summarize_spaces_quick()"); 1503 1504 const MutableSpace* space = _space_info[id].space(); 1505 if (_space_info[id].new_top() != space->bottom()) { 1506 HeapWord* dense_prefix_end = compute_dense_prefix(id, maximum_compaction); 1507 _space_info[id].set_dense_prefix(dense_prefix_end); 1508 1509 #ifndef PRODUCT 1510 if (TraceParallelOldGCDensePrefix) { 1511 print_dense_prefix_stats("ratio", id, maximum_compaction, 1512 dense_prefix_end); 1513 HeapWord* addr = compute_dense_prefix_via_density(id, maximum_compaction); 1514 print_dense_prefix_stats("density", id, maximum_compaction, addr); 1515 } 1516 #endif // #ifndef PRODUCT 1517 1518 // Recompute the summary data, taking into account the dense prefix. If 1519 // every last byte will be reclaimed, then the existing summary data which 1520 // compacts everything can be left in place. 1521 if (!maximum_compaction && dense_prefix_end != space->bottom()) { 1522 // If dead space crosses the dense prefix boundary, it is (at least 1523 // partially) filled with a dummy object, marked live and added to the 1524 // summary data. This simplifies the copy/update phase and must be done 1525 // before the final locations of objects are determined, to prevent 1526 // leaving a fragment of dead space that is too small to fill. 1527 fill_dense_prefix_end(id); 1528 1529 // Compute the destination of each Region, and thus each object. 1530 _summary_data.summarize_dense_prefix(space->bottom(), dense_prefix_end); 1531 _summary_data.summarize(_space_info[id].split_info(), 1532 dense_prefix_end, space->top(), NULL, 1533 dense_prefix_end, space->end(), 1534 _space_info[id].new_top_addr()); 1535 } 1536 } 1537 1538 if (log_develop_is_enabled(Trace, gc, compaction)) { 1539 const size_t region_size = ParallelCompactData::RegionSize; 1540 HeapWord* const dense_prefix_end = _space_info[id].dense_prefix(); 1541 const size_t dp_region = _summary_data.addr_to_region_idx(dense_prefix_end); 1542 const size_t dp_words = pointer_delta(dense_prefix_end, space->bottom()); 1543 HeapWord* const new_top = _space_info[id].new_top(); 1544 const HeapWord* nt_aligned_up = _summary_data.region_align_up(new_top); 1545 const size_t cr_words = pointer_delta(nt_aligned_up, dense_prefix_end); 1546 log_develop_trace(gc, compaction)( 1547 "id=%d cap=" SIZE_FORMAT " dp=" PTR_FORMAT " " 1548 "dp_region=" SIZE_FORMAT " " "dp_count=" SIZE_FORMAT " " 1549 "cr_count=" SIZE_FORMAT " " "nt=" PTR_FORMAT, 1550 id, space->capacity_in_words(), p2i(dense_prefix_end), 1551 dp_region, dp_words / region_size, 1552 cr_words / region_size, p2i(new_top)); 1553 } 1554 } 1555 1556 #ifndef PRODUCT 1557 void PSParallelCompact::summary_phase_msg(SpaceId dst_space_id, 1558 HeapWord* dst_beg, HeapWord* dst_end, 1559 SpaceId src_space_id, 1560 HeapWord* src_beg, HeapWord* src_end) 1561 { 1562 log_develop_trace(gc, compaction)( 1563 "Summarizing %d [%s] into %d [%s]: " 1564 "src=" PTR_FORMAT "-" PTR_FORMAT " " 1565 SIZE_FORMAT "-" SIZE_FORMAT " " 1566 "dst=" PTR_FORMAT "-" PTR_FORMAT " " 1567 SIZE_FORMAT "-" SIZE_FORMAT, 1568 src_space_id, space_names[src_space_id], 1569 dst_space_id, space_names[dst_space_id], 1570 p2i(src_beg), p2i(src_end), 1571 _summary_data.addr_to_region_idx(src_beg), 1572 _summary_data.addr_to_region_idx(src_end), 1573 p2i(dst_beg), p2i(dst_end), 1574 _summary_data.addr_to_region_idx(dst_beg), 1575 _summary_data.addr_to_region_idx(dst_end)); 1576 } 1577 #endif // #ifndef PRODUCT 1578 1579 void PSParallelCompact::summary_phase(ParCompactionManager* cm, 1580 bool maximum_compaction) 1581 { 1582 GCTraceTime(Info, gc, phases) tm("Summary Phase", &_gc_timer); 1583 1584 #ifdef ASSERT 1585 if (TraceParallelOldGCMarkingPhase) { 1586 tty->print_cr("add_obj_count=" SIZE_FORMAT " " 1587 "add_obj_bytes=" SIZE_FORMAT, 1588 add_obj_count, add_obj_size * HeapWordSize); 1589 tty->print_cr("mark_bitmap_count=" SIZE_FORMAT " " 1590 "mark_bitmap_bytes=" SIZE_FORMAT, 1591 mark_bitmap_count, mark_bitmap_size * HeapWordSize); 1592 } 1593 #endif // #ifdef ASSERT 1594 1595 // Quick summarization of each space into itself, to see how much is live. 1596 summarize_spaces_quick(); 1597 1598 log_develop_trace(gc, compaction)("summary phase: after summarizing each space to self"); 1599 NOT_PRODUCT(print_region_ranges()); 1600 NOT_PRODUCT(print_initial_summary_data(_summary_data, _space_info)); 1601 1602 // The amount of live data that will end up in old space (assuming it fits). 1603 size_t old_space_total_live = 0; 1604 for (unsigned int id = old_space_id; id < last_space_id; ++id) { 1605 old_space_total_live += pointer_delta(_space_info[id].new_top(), 1606 _space_info[id].space()->bottom()); 1607 } 1608 1609 MutableSpace* const old_space = _space_info[old_space_id].space(); 1610 const size_t old_capacity = old_space->capacity_in_words(); 1611 if (old_space_total_live > old_capacity) { 1612 // XXX - should also try to expand 1613 maximum_compaction = true; 1614 } 1615 1616 // Old generations. 1617 summarize_space(old_space_id, maximum_compaction); 1618 1619 // Summarize the remaining spaces in the young gen. The initial target space 1620 // is the old gen. If a space does not fit entirely into the target, then the 1621 // remainder is compacted into the space itself and that space becomes the new 1622 // target. 1623 SpaceId dst_space_id = old_space_id; 1624 HeapWord* dst_space_end = old_space->end(); 1625 HeapWord** new_top_addr = _space_info[dst_space_id].new_top_addr(); 1626 for (unsigned int id = eden_space_id; id < last_space_id; ++id) { 1627 const MutableSpace* space = _space_info[id].space(); 1628 const size_t live = pointer_delta(_space_info[id].new_top(), 1629 space->bottom()); 1630 const size_t available = pointer_delta(dst_space_end, *new_top_addr); 1631 1632 NOT_PRODUCT(summary_phase_msg(dst_space_id, *new_top_addr, dst_space_end, 1633 SpaceId(id), space->bottom(), space->top());) 1634 if (live > 0 && live <= available) { 1635 // All the live data will fit. 1636 bool done = _summary_data.summarize(_space_info[id].split_info(), 1637 space->bottom(), space->top(), 1638 NULL, 1639 *new_top_addr, dst_space_end, 1640 new_top_addr); 1641 assert(done, "space must fit into old gen"); 1642 1643 // Reset the new_top value for the space. 1644 _space_info[id].set_new_top(space->bottom()); 1645 } else if (live > 0) { 1646 // Attempt to fit part of the source space into the target space. 1647 HeapWord* next_src_addr = NULL; 1648 bool done = _summary_data.summarize(_space_info[id].split_info(), 1649 space->bottom(), space->top(), 1650 &next_src_addr, 1651 *new_top_addr, dst_space_end, 1652 new_top_addr); 1653 assert(!done, "space should not fit into old gen"); 1654 assert(next_src_addr != NULL, "sanity"); 1655 1656 // The source space becomes the new target, so the remainder is compacted 1657 // within the space itself. 1658 dst_space_id = SpaceId(id); 1659 dst_space_end = space->end(); 1660 new_top_addr = _space_info[id].new_top_addr(); 1661 NOT_PRODUCT(summary_phase_msg(dst_space_id, 1662 space->bottom(), dst_space_end, 1663 SpaceId(id), next_src_addr, space->top());) 1664 done = _summary_data.summarize(_space_info[id].split_info(), 1665 next_src_addr, space->top(), 1666 NULL, 1667 space->bottom(), dst_space_end, 1668 new_top_addr); 1669 assert(done, "space must fit when compacted into itself"); 1670 assert(*new_top_addr <= space->top(), "usage should not grow"); 1671 } 1672 } 1673 1674 log_develop_trace(gc, compaction)("Summary_phase: after final summarization"); 1675 NOT_PRODUCT(print_region_ranges()); 1676 NOT_PRODUCT(print_initial_summary_data(_summary_data, _space_info)); 1677 } 1678 1679 // This method should contain all heap-specific policy for invoking a full 1680 // collection. invoke_no_policy() will only attempt to compact the heap; it 1681 // will do nothing further. If we need to bail out for policy reasons, scavenge 1682 // before full gc, or any other specialized behavior, it needs to be added here. 1683 // 1684 // Note that this method should only be called from the vm_thread while at a 1685 // safepoint. 1686 // 1687 // Note that the all_soft_refs_clear flag in the collector policy 1688 // may be true because this method can be called without intervening 1689 // activity. For example when the heap space is tight and full measure 1690 // are being taken to free space. 1691 void PSParallelCompact::invoke(bool maximum_heap_compaction) { 1692 assert(SafepointSynchronize::is_at_safepoint(), "should be at safepoint"); 1693 assert(Thread::current() == (Thread*)VMThread::vm_thread(), 1694 "should be in vm thread"); 1695 1696 ParallelScavengeHeap* heap = ParallelScavengeHeap::heap(); 1697 GCCause::Cause gc_cause = heap->gc_cause(); 1698 assert(!heap->is_gc_active(), "not reentrant"); 1699 1700 PSAdaptiveSizePolicy* policy = heap->size_policy(); 1701 IsGCActiveMark mark; 1702 1703 if (ScavengeBeforeFullGC) { 1704 PSScavenge::invoke_no_policy(); 1705 } 1706 1707 const bool clear_all_soft_refs = 1708 heap->soft_ref_policy()->should_clear_all_soft_refs(); 1709 1710 PSParallelCompact::invoke_no_policy(clear_all_soft_refs || 1711 maximum_heap_compaction); 1712 } 1713 1714 // This method contains no policy. You should probably 1715 // be calling invoke() instead. 1716 bool PSParallelCompact::invoke_no_policy(bool maximum_heap_compaction) { 1717 assert(SafepointSynchronize::is_at_safepoint(), "must be at a safepoint"); 1718 assert(ref_processor() != NULL, "Sanity"); 1719 1720 if (GCLocker::check_active_before_gc()) { 1721 return false; 1722 } 1723 1724 ParallelScavengeHeap* heap = ParallelScavengeHeap::heap(); 1725 1726 GCIdMark gc_id_mark; 1727 _gc_timer.register_gc_start(); 1728 _gc_tracer.report_gc_start(heap->gc_cause(), _gc_timer.gc_start()); 1729 1730 TimeStamp marking_start; 1731 TimeStamp compaction_start; 1732 TimeStamp collection_exit; 1733 1734 GCCause::Cause gc_cause = heap->gc_cause(); 1735 PSYoungGen* young_gen = heap->young_gen(); 1736 PSOldGen* old_gen = heap->old_gen(); 1737 PSAdaptiveSizePolicy* size_policy = heap->size_policy(); 1738 1739 // The scope of casr should end after code that can change 1740 // CollectorPolicy::_should_clear_all_soft_refs. 1741 ClearedAllSoftRefs casr(maximum_heap_compaction, 1742 heap->soft_ref_policy()); 1743 1744 if (ZapUnusedHeapArea) { 1745 // Save information needed to minimize mangling 1746 heap->record_gen_tops_before_GC(); 1747 } 1748 1749 // Make sure data structures are sane, make the heap parsable, and do other 1750 // miscellaneous bookkeeping. 1751 pre_compact(); 1752 1753 PreGCValues pre_gc_values(heap); 1754 1755 // Get the compaction manager reserved for the VM thread. 1756 ParCompactionManager* const vmthread_cm = 1757 ParCompactionManager::manager_array(gc_task_manager()->workers()); 1758 1759 { 1760 ResourceMark rm; 1761 HandleMark hm; 1762 1763 // Set the number of GC threads to be used in this collection 1764 gc_task_manager()->set_active_gang(); 1765 gc_task_manager()->task_idle_workers(); 1766 1767 GCTraceCPUTime tcpu; 1768 GCTraceTime(Info, gc) tm("Pause Full", NULL, gc_cause, true); 1769 1770 heap->pre_full_gc_dump(&_gc_timer); 1771 1772 TraceCollectorStats tcs(counters()); 1773 TraceMemoryManagerStats tms(heap->old_gc_manager(), gc_cause); 1774 1775 if (log_is_enabled(Debug, gc, heap, exit)) { 1776 accumulated_time()->start(); 1777 } 1778 1779 // Let the size policy know we're starting 1780 size_policy->major_collection_begin(); 1781 1782 CodeCache::gc_prologue(); 1783 1784 #if COMPILER2_OR_JVMCI 1785 DerivedPointerTable::clear(); 1786 #endif 1787 1788 ref_processor()->enable_discovery(); 1789 ref_processor()->setup_policy(maximum_heap_compaction); 1790 1791 bool marked_for_unloading = false; 1792 1793 marking_start.update(); 1794 marking_phase(vmthread_cm, maximum_heap_compaction, &_gc_tracer); 1795 1796 bool max_on_system_gc = UseMaximumCompactionOnSystemGC 1797 && GCCause::is_user_requested_gc(gc_cause); 1798 summary_phase(vmthread_cm, maximum_heap_compaction || max_on_system_gc); 1799 1800 #if COMPILER2_OR_JVMCI 1801 assert(DerivedPointerTable::is_active(), "Sanity"); 1802 DerivedPointerTable::set_active(false); 1803 #endif 1804 1805 // adjust_roots() updates Universe::_intArrayKlassObj which is 1806 // needed by the compaction for filling holes in the dense prefix. 1807 adjust_roots(vmthread_cm); 1808 1809 compaction_start.update(); 1810 compact(); 1811 1812 // Reset the mark bitmap, summary data, and do other bookkeeping. Must be 1813 // done before resizing. 1814 post_compact(); 1815 1816 // Let the size policy know we're done 1817 size_policy->major_collection_end(old_gen->used_in_bytes(), gc_cause); 1818 1819 if (UseAdaptiveSizePolicy) { 1820 log_debug(gc, ergo)("AdaptiveSizeStart: collection: %d ", heap->total_collections()); 1821 log_trace(gc, ergo)("old_gen_capacity: " SIZE_FORMAT " young_gen_capacity: " SIZE_FORMAT, 1822 old_gen->capacity_in_bytes(), young_gen->capacity_in_bytes()); 1823 1824 // Don't check if the size_policy is ready here. Let 1825 // the size_policy check that internally. 1826 if (UseAdaptiveGenerationSizePolicyAtMajorCollection && 1827 AdaptiveSizePolicy::should_update_promo_stats(gc_cause)) { 1828 // Swap the survivor spaces if from_space is empty. The 1829 // resize_young_gen() called below is normally used after 1830 // a successful young GC and swapping of survivor spaces; 1831 // otherwise, it will fail to resize the young gen with 1832 // the current implementation. 1833 if (young_gen->from_space()->is_empty()) { 1834 young_gen->from_space()->clear(SpaceDecorator::Mangle); 1835 young_gen->swap_spaces(); 1836 } 1837 1838 // Calculate optimal free space amounts 1839 assert(young_gen->max_size() > 1840 young_gen->from_space()->capacity_in_bytes() + 1841 young_gen->to_space()->capacity_in_bytes(), 1842 "Sizes of space in young gen are out-of-bounds"); 1843 1844 size_t young_live = young_gen->used_in_bytes(); 1845 size_t eden_live = young_gen->eden_space()->used_in_bytes(); 1846 size_t old_live = old_gen->used_in_bytes(); 1847 size_t cur_eden = young_gen->eden_space()->capacity_in_bytes(); 1848 size_t max_old_gen_size = old_gen->max_gen_size(); 1849 size_t max_eden_size = young_gen->max_size() - 1850 young_gen->from_space()->capacity_in_bytes() - 1851 young_gen->to_space()->capacity_in_bytes(); 1852 1853 // Used for diagnostics 1854 size_policy->clear_generation_free_space_flags(); 1855 1856 size_policy->compute_generations_free_space(young_live, 1857 eden_live, 1858 old_live, 1859 cur_eden, 1860 max_old_gen_size, 1861 max_eden_size, 1862 true /* full gc*/); 1863 1864 size_policy->check_gc_overhead_limit(young_live, 1865 eden_live, 1866 max_old_gen_size, 1867 max_eden_size, 1868 true /* full gc*/, 1869 gc_cause, 1870 heap->soft_ref_policy()); 1871 1872 size_policy->decay_supplemental_growth(true /* full gc*/); 1873 1874 heap->resize_old_gen( 1875 size_policy->calculated_old_free_size_in_bytes()); 1876 1877 heap->resize_young_gen(size_policy->calculated_eden_size_in_bytes(), 1878 size_policy->calculated_survivor_size_in_bytes()); 1879 } 1880 1881 log_debug(gc, ergo)("AdaptiveSizeStop: collection: %d ", heap->total_collections()); 1882 } 1883 1884 if (UsePerfData) { 1885 PSGCAdaptivePolicyCounters* const counters = heap->gc_policy_counters(); 1886 counters->update_counters(); 1887 counters->update_old_capacity(old_gen->capacity_in_bytes()); 1888 counters->update_young_capacity(young_gen->capacity_in_bytes()); 1889 } 1890 1891 heap->resize_all_tlabs(); 1892 1893 // Resize the metaspace capacity after a collection 1894 MetaspaceGC::compute_new_size(); 1895 1896 if (log_is_enabled(Debug, gc, heap, exit)) { 1897 accumulated_time()->stop(); 1898 } 1899 1900 young_gen->print_used_change(pre_gc_values.young_gen_used()); 1901 old_gen->print_used_change(pre_gc_values.old_gen_used()); 1902 MetaspaceUtils::print_metaspace_change(pre_gc_values.metadata_used()); 1903 1904 // Track memory usage and detect low memory 1905 MemoryService::track_memory_usage(); 1906 heap->update_counters(); 1907 gc_task_manager()->release_idle_workers(); 1908 1909 heap->post_full_gc_dump(&_gc_timer); 1910 } 1911 1912 #ifdef ASSERT 1913 for (size_t i = 0; i < ParallelGCThreads + 1; ++i) { 1914 ParCompactionManager* const cm = 1915 ParCompactionManager::manager_array(int(i)); 1916 assert(cm->marking_stack()->is_empty(), "should be empty"); 1917 assert(cm->region_stack()->is_empty(), "Region stack " SIZE_FORMAT " is not empty", i); 1918 } 1919 #endif // ASSERT 1920 1921 if (VerifyAfterGC && heap->total_collections() >= VerifyGCStartAt) { 1922 HandleMark hm; // Discard invalid handles created during verification 1923 Universe::verify("After GC"); 1924 } 1925 1926 // Re-verify object start arrays 1927 if (VerifyObjectStartArray && 1928 VerifyAfterGC) { 1929 old_gen->verify_object_start_array(); 1930 } 1931 1932 if (ZapUnusedHeapArea) { 1933 old_gen->object_space()->check_mangled_unused_area_complete(); 1934 } 1935 1936 NOT_PRODUCT(ref_processor()->verify_no_references_recorded()); 1937 1938 collection_exit.update(); 1939 1940 heap->print_heap_after_gc(); 1941 heap->trace_heap_after_gc(&_gc_tracer); 1942 1943 log_debug(gc, task, time)("VM-Thread " JLONG_FORMAT " " JLONG_FORMAT " " JLONG_FORMAT, 1944 marking_start.ticks(), compaction_start.ticks(), 1945 collection_exit.ticks()); 1946 gc_task_manager()->print_task_time_stamps(); 1947 1948 #ifdef TRACESPINNING 1949 ParallelTaskTerminator::print_termination_counts(); 1950 #endif 1951 1952 AdaptiveSizePolicyOutput::print(size_policy, heap->total_collections()); 1953 1954 _gc_timer.register_gc_end(); 1955 1956 _gc_tracer.report_dense_prefix(dense_prefix(old_space_id)); 1957 _gc_tracer.report_gc_end(_gc_timer.gc_end(), _gc_timer.time_partitions()); 1958 1959 return true; 1960 } 1961 1962 bool PSParallelCompact::absorb_live_data_from_eden(PSAdaptiveSizePolicy* size_policy, 1963 PSYoungGen* young_gen, 1964 PSOldGen* old_gen) { 1965 MutableSpace* const eden_space = young_gen->eden_space(); 1966 assert(!eden_space->is_empty(), "eden must be non-empty"); 1967 assert(young_gen->virtual_space()->alignment() == 1968 old_gen->virtual_space()->alignment(), "alignments do not match"); 1969 1970 if (!(UseAdaptiveSizePolicy && UseAdaptiveGCBoundary)) { 1971 return false; 1972 } 1973 1974 // Both generations must be completely committed. 1975 if (young_gen->virtual_space()->uncommitted_size() != 0) { 1976 return false; 1977 } 1978 if (old_gen->virtual_space()->uncommitted_size() != 0) { 1979 return false; 1980 } 1981 1982 // Figure out how much to take from eden. Include the average amount promoted 1983 // in the total; otherwise the next young gen GC will simply bail out to a 1984 // full GC. 1985 const size_t alignment = old_gen->virtual_space()->alignment(); 1986 const size_t eden_used = eden_space->used_in_bytes(); 1987 const size_t promoted = (size_t)size_policy->avg_promoted()->padded_average(); 1988 const size_t absorb_size = align_up(eden_used + promoted, alignment); 1989 const size_t eden_capacity = eden_space->capacity_in_bytes(); 1990 1991 if (absorb_size >= eden_capacity) { 1992 return false; // Must leave some space in eden. 1993 } 1994 1995 const size_t new_young_size = young_gen->capacity_in_bytes() - absorb_size; 1996 if (new_young_size < young_gen->min_gen_size()) { 1997 return false; // Respect young gen minimum size. 1998 } 1999 2000 log_trace(heap, ergo)(" absorbing " SIZE_FORMAT "K: " 2001 "eden " SIZE_FORMAT "K->" SIZE_FORMAT "K " 2002 "from " SIZE_FORMAT "K, to " SIZE_FORMAT "K " 2003 "young_gen " SIZE_FORMAT "K->" SIZE_FORMAT "K ", 2004 absorb_size / K, 2005 eden_capacity / K, (eden_capacity - absorb_size) / K, 2006 young_gen->from_space()->used_in_bytes() / K, 2007 young_gen->to_space()->used_in_bytes() / K, 2008 young_gen->capacity_in_bytes() / K, new_young_size / K); 2009 2010 // Fill the unused part of the old gen. 2011 MutableSpace* const old_space = old_gen->object_space(); 2012 HeapWord* const unused_start = old_space->top(); 2013 size_t const unused_words = pointer_delta(old_space->end(), unused_start); 2014 2015 if (unused_words > 0) { 2016 if (unused_words < CollectedHeap::min_fill_size()) { 2017 return false; // If the old gen cannot be filled, must give up. 2018 } 2019 CollectedHeap::fill_with_objects(unused_start, unused_words); 2020 } 2021 2022 // Take the live data from eden and set both top and end in the old gen to 2023 // eden top. (Need to set end because reset_after_change() mangles the region 2024 // from end to virtual_space->high() in debug builds). 2025 HeapWord* const new_top = eden_space->top(); 2026 old_gen->virtual_space()->expand_into(young_gen->virtual_space(), 2027 absorb_size); 2028 young_gen->reset_after_change(); 2029 old_space->set_top(new_top); 2030 old_space->set_end(new_top); 2031 old_gen->reset_after_change(); 2032 2033 // Update the object start array for the filler object and the data from eden. 2034 ObjectStartArray* const start_array = old_gen->start_array(); 2035 for (HeapWord* p = unused_start; p < new_top; p += oop(p)->size()) { 2036 start_array->allocate_block(p); 2037 } 2038 2039 // Could update the promoted average here, but it is not typically updated at 2040 // full GCs and the value to use is unclear. Something like 2041 // 2042 // cur_promoted_avg + absorb_size / number_of_scavenges_since_last_full_gc. 2043 2044 size_policy->set_bytes_absorbed_from_eden(absorb_size); 2045 return true; 2046 } 2047 2048 GCTaskManager* const PSParallelCompact::gc_task_manager() { 2049 assert(ParallelScavengeHeap::gc_task_manager() != NULL, 2050 "shouldn't return NULL"); 2051 return ParallelScavengeHeap::gc_task_manager(); 2052 } 2053 2054 class PCAddThreadRootsMarkingTaskClosure : public ThreadClosure { 2055 private: 2056 GCTaskQueue* _q; 2057 2058 public: 2059 PCAddThreadRootsMarkingTaskClosure(GCTaskQueue* q) : _q(q) { } 2060 void do_thread(Thread* t) { 2061 _q->enqueue(new ThreadRootsMarkingTask(t)); 2062 } 2063 }; 2064 2065 void PSParallelCompact::marking_phase(ParCompactionManager* cm, 2066 bool maximum_heap_compaction, 2067 ParallelOldTracer *gc_tracer) { 2068 // Recursively traverse all live objects and mark them 2069 GCTraceTime(Info, gc, phases) tm("Marking Phase", &_gc_timer); 2070 2071 ParallelScavengeHeap* heap = ParallelScavengeHeap::heap(); 2072 uint parallel_gc_threads = heap->gc_task_manager()->workers(); 2073 uint active_gc_threads = heap->gc_task_manager()->active_workers(); 2074 TaskQueueSetSuper* qset = ParCompactionManager::stack_array(); 2075 ParallelTaskTerminator terminator(active_gc_threads, qset); 2076 2077 ParCompactionManager::MarkAndPushClosure mark_and_push_closure(cm); 2078 ParCompactionManager::FollowStackClosure follow_stack_closure(cm); 2079 2080 // Need new claim bits before marking starts. 2081 ClassLoaderDataGraph::clear_claimed_marks(); 2082 2083 { 2084 GCTraceTime(Debug, gc, phases) tm("Par Mark", &_gc_timer); 2085 2086 ParallelScavengeHeap::ParStrongRootsScope psrs; 2087 2088 GCTaskQueue* q = GCTaskQueue::create(); 2089 2090 q->enqueue(new MarkFromRootsTask(MarkFromRootsTask::universe)); 2091 q->enqueue(new MarkFromRootsTask(MarkFromRootsTask::jni_handles)); 2092 // We scan the thread roots in parallel 2093 PCAddThreadRootsMarkingTaskClosure cl(q); 2094 Threads::java_threads_and_vm_thread_do(&cl); 2095 q->enqueue(new MarkFromRootsTask(MarkFromRootsTask::object_synchronizer)); 2096 q->enqueue(new MarkFromRootsTask(MarkFromRootsTask::management)); 2097 q->enqueue(new MarkFromRootsTask(MarkFromRootsTask::system_dictionary)); 2098 q->enqueue(new MarkFromRootsTask(MarkFromRootsTask::class_loader_data)); 2099 q->enqueue(new MarkFromRootsTask(MarkFromRootsTask::jvmti)); 2100 q->enqueue(new MarkFromRootsTask(MarkFromRootsTask::code_cache)); 2101 2102 if (active_gc_threads > 1) { 2103 for (uint j = 0; j < active_gc_threads; j++) { 2104 q->enqueue(new StealMarkingTask(&terminator)); 2105 } 2106 } 2107 2108 gc_task_manager()->execute_and_wait(q); 2109 } 2110 2111 // Process reference objects found during marking 2112 { 2113 GCTraceTime(Debug, gc, phases) tm("Reference Processing", &_gc_timer); 2114 2115 ReferenceProcessorStats stats; 2116 ReferenceProcessorPhaseTimes pt(&_gc_timer, ref_processor()->max_num_queues()); 2117 2118 if (ref_processor()->processing_is_mt()) { 2119 ref_processor()->set_active_mt_degree(active_gc_threads); 2120 2121 RefProcTaskExecutor task_executor; 2122 stats = ref_processor()->process_discovered_references( 2123 is_alive_closure(), &mark_and_push_closure, &follow_stack_closure, 2124 &task_executor, &pt); 2125 } else { 2126 stats = ref_processor()->process_discovered_references( 2127 is_alive_closure(), &mark_and_push_closure, &follow_stack_closure, NULL, 2128 &pt); 2129 } 2130 2131 gc_tracer->report_gc_reference_stats(stats); 2132 pt.print_all_references(); 2133 } 2134 2135 // This is the point where the entire marking should have completed. 2136 assert(cm->marking_stacks_empty(), "Marking should have completed"); 2137 2138 { 2139 GCTraceTime(Debug, gc, phases) tm("Weak Processing", &_gc_timer); 2140 WeakProcessor::weak_oops_do(is_alive_closure(), &do_nothing_cl); 2141 } 2142 2143 { 2144 GCTraceTime(Debug, gc, phases) tm_m("Class Unloading", &_gc_timer); 2145 2146 // Follow system dictionary roots and unload classes. 2147 bool purged_class = SystemDictionary::do_unloading(&_gc_timer); 2148 2149 // Unload nmethods. 2150 CodeCache::do_unloading(is_alive_closure(), purged_class); 2151 2152 // Prune dead klasses from subklass/sibling/implementor lists. 2153 Klass::clean_weak_klass_links(purged_class); 2154 } 2155 2156 { 2157 GCTraceTime(Debug, gc, phases) t("Scrub String Table", &_gc_timer); 2158 // Delete entries for dead interned strings. 2159 StringTable::unlink(is_alive_closure()); 2160 } 2161 2162 { 2163 GCTraceTime(Debug, gc, phases) t("Scrub Symbol Table", &_gc_timer); 2164 // Clean up unreferenced symbols in symbol table. 2165 SymbolTable::unlink(); 2166 } 2167 2168 _gc_tracer.report_object_count_after_gc(is_alive_closure()); 2169 } 2170 2171 void PSParallelCompact::adjust_roots(ParCompactionManager* cm) { 2172 // Adjust the pointers to reflect the new locations 2173 GCTraceTime(Info, gc, phases) tm("Adjust Roots", &_gc_timer); 2174 2175 // Need new claim bits when tracing through and adjusting pointers. 2176 ClassLoaderDataGraph::clear_claimed_marks(); 2177 2178 PSParallelCompact::AdjustPointerClosure oop_closure(cm); 2179 2180 // General strong roots. 2181 Universe::oops_do(&oop_closure); 2182 JNIHandles::oops_do(&oop_closure); // Global (strong) JNI handles 2183 Threads::oops_do(&oop_closure, NULL); 2184 ObjectSynchronizer::oops_do(&oop_closure); 2185 Management::oops_do(&oop_closure); 2186 JvmtiExport::oops_do(&oop_closure); 2187 SystemDictionary::oops_do(&oop_closure); 2188 ClassLoaderDataGraph::oops_do(&oop_closure, true); 2189 2190 // Now adjust pointers in remaining weak roots. (All of which should 2191 // have been cleared if they pointed to non-surviving objects.) 2192 WeakProcessor::oops_do(&oop_closure); 2193 2194 CodeBlobToOopClosure adjust_from_blobs(&oop_closure, CodeBlobToOopClosure::FixRelocations); 2195 CodeCache::blobs_do(&adjust_from_blobs); 2196 AOTLoader::oops_do(&oop_closure); 2197 StringTable::oops_do(&oop_closure); 2198 ref_processor()->weak_oops_do(&oop_closure); 2199 // Roots were visited so references into the young gen in roots 2200 // may have been scanned. Process them also. 2201 // Should the reference processor have a span that excludes 2202 // young gen objects? 2203 PSScavenge::reference_processor()->weak_oops_do(&oop_closure); 2204 } 2205 2206 // Helper class to print 8 region numbers per line and then print the total at the end. 2207 class FillableRegionLogger : public StackObj { 2208 private: 2209 Log(gc, compaction) log; 2210 static const int LineLength = 8; 2211 size_t _regions[LineLength]; 2212 int _next_index; 2213 bool _enabled; 2214 size_t _total_regions; 2215 public: 2216 FillableRegionLogger() : _next_index(0), _total_regions(0), _enabled(log_develop_is_enabled(Trace, gc, compaction)) { } 2217 ~FillableRegionLogger() { 2218 log.trace(SIZE_FORMAT " initially fillable regions", _total_regions); 2219 } 2220 2221 void print_line() { 2222 if (!_enabled || _next_index == 0) { 2223 return; 2224 } 2225 FormatBuffer<> line("Fillable: "); 2226 for (int i = 0; i < _next_index; i++) { 2227 line.append(" " SIZE_FORMAT_W(7), _regions[i]); 2228 } 2229 log.trace("%s", line.buffer()); 2230 _next_index = 0; 2231 } 2232 2233 void handle(size_t region) { 2234 if (!_enabled) { 2235 return; 2236 } 2237 _regions[_next_index++] = region; 2238 if (_next_index == LineLength) { 2239 print_line(); 2240 } 2241 _total_regions++; 2242 } 2243 }; 2244 2245 void PSParallelCompact::prepare_region_draining_tasks(GCTaskQueue* q, 2246 uint parallel_gc_threads) 2247 { 2248 GCTraceTime(Trace, gc, phases) tm("Drain Task Setup", &_gc_timer); 2249 2250 // Find the threads that are active 2251 unsigned int which = 0; 2252 2253 // Find all regions that are available (can be filled immediately) and 2254 // distribute them to the thread stacks. The iteration is done in reverse 2255 // order (high to low) so the regions will be removed in ascending order. 2256 2257 const ParallelCompactData& sd = PSParallelCompact::summary_data(); 2258 2259 which = 0; 2260 // id + 1 is used to test termination so unsigned can 2261 // be used with an old_space_id == 0. 2262 FillableRegionLogger region_logger; 2263 for (unsigned int id = to_space_id; id + 1 > old_space_id; --id) { 2264 SpaceInfo* const space_info = _space_info + id; 2265 MutableSpace* const space = space_info->space(); 2266 HeapWord* const new_top = space_info->new_top(); 2267 2268 const size_t beg_region = sd.addr_to_region_idx(space_info->dense_prefix()); 2269 const size_t end_region = 2270 sd.addr_to_region_idx(sd.region_align_up(new_top)); 2271 2272 for (size_t cur = end_region - 1; cur + 1 > beg_region; --cur) { 2273 if (sd.region(cur)->claim_unsafe()) { 2274 ParCompactionManager* cm = ParCompactionManager::manager_array(which); 2275 cm->region_stack()->push(cur); 2276 region_logger.handle(cur); 2277 // Assign regions to tasks in round-robin fashion. 2278 if (++which == parallel_gc_threads) { 2279 which = 0; 2280 } 2281 } 2282 } 2283 region_logger.print_line(); 2284 } 2285 } 2286 2287 #define PAR_OLD_DENSE_PREFIX_OVER_PARTITIONING 4 2288 2289 void PSParallelCompact::enqueue_dense_prefix_tasks(GCTaskQueue* q, 2290 uint parallel_gc_threads) { 2291 GCTraceTime(Trace, gc, phases) tm("Dense Prefix Task Setup", &_gc_timer); 2292 2293 ParallelCompactData& sd = PSParallelCompact::summary_data(); 2294 2295 // Iterate over all the spaces adding tasks for updating 2296 // regions in the dense prefix. Assume that 1 gc thread 2297 // will work on opening the gaps and the remaining gc threads 2298 // will work on the dense prefix. 2299 unsigned int space_id; 2300 for (space_id = old_space_id; space_id < last_space_id; ++ space_id) { 2301 HeapWord* const dense_prefix_end = _space_info[space_id].dense_prefix(); 2302 const MutableSpace* const space = _space_info[space_id].space(); 2303 2304 if (dense_prefix_end == space->bottom()) { 2305 // There is no dense prefix for this space. 2306 continue; 2307 } 2308 2309 // The dense prefix is before this region. 2310 size_t region_index_end_dense_prefix = 2311 sd.addr_to_region_idx(dense_prefix_end); 2312 RegionData* const dense_prefix_cp = 2313 sd.region(region_index_end_dense_prefix); 2314 assert(dense_prefix_end == space->end() || 2315 dense_prefix_cp->available() || 2316 dense_prefix_cp->claimed(), 2317 "The region after the dense prefix should always be ready to fill"); 2318 2319 size_t region_index_start = sd.addr_to_region_idx(space->bottom()); 2320 2321 // Is there dense prefix work? 2322 size_t total_dense_prefix_regions = 2323 region_index_end_dense_prefix - region_index_start; 2324 // How many regions of the dense prefix should be given to 2325 // each thread? 2326 if (total_dense_prefix_regions > 0) { 2327 uint tasks_for_dense_prefix = 1; 2328 if (total_dense_prefix_regions <= 2329 (parallel_gc_threads * PAR_OLD_DENSE_PREFIX_OVER_PARTITIONING)) { 2330 // Don't over partition. This assumes that 2331 // PAR_OLD_DENSE_PREFIX_OVER_PARTITIONING is a small integer value 2332 // so there are not many regions to process. 2333 tasks_for_dense_prefix = parallel_gc_threads; 2334 } else { 2335 // Over partition 2336 tasks_for_dense_prefix = parallel_gc_threads * 2337 PAR_OLD_DENSE_PREFIX_OVER_PARTITIONING; 2338 } 2339 size_t regions_per_thread = total_dense_prefix_regions / 2340 tasks_for_dense_prefix; 2341 // Give each thread at least 1 region. 2342 if (regions_per_thread == 0) { 2343 regions_per_thread = 1; 2344 } 2345 2346 for (uint k = 0; k < tasks_for_dense_prefix; k++) { 2347 if (region_index_start >= region_index_end_dense_prefix) { 2348 break; 2349 } 2350 // region_index_end is not processed 2351 size_t region_index_end = MIN2(region_index_start + regions_per_thread, 2352 region_index_end_dense_prefix); 2353 q->enqueue(new UpdateDensePrefixTask(SpaceId(space_id), 2354 region_index_start, 2355 region_index_end)); 2356 region_index_start = region_index_end; 2357 } 2358 } 2359 // This gets any part of the dense prefix that did not 2360 // fit evenly. 2361 if (region_index_start < region_index_end_dense_prefix) { 2362 q->enqueue(new UpdateDensePrefixTask(SpaceId(space_id), 2363 region_index_start, 2364 region_index_end_dense_prefix)); 2365 } 2366 } 2367 } 2368 2369 void PSParallelCompact::enqueue_region_stealing_tasks( 2370 GCTaskQueue* q, 2371 ParallelTaskTerminator* terminator_ptr, 2372 uint parallel_gc_threads) { 2373 GCTraceTime(Trace, gc, phases) tm("Steal Task Setup", &_gc_timer); 2374 2375 // Once a thread has drained it's stack, it should try to steal regions from 2376 // other threads. 2377 for (uint j = 0; j < parallel_gc_threads; j++) { 2378 q->enqueue(new CompactionWithStealingTask(terminator_ptr)); 2379 } 2380 } 2381 2382 #ifdef ASSERT 2383 // Write a histogram of the number of times the block table was filled for a 2384 // region. 2385 void PSParallelCompact::write_block_fill_histogram() 2386 { 2387 if (!log_develop_is_enabled(Trace, gc, compaction)) { 2388 return; 2389 } 2390 2391 Log(gc, compaction) log; 2392 ResourceMark rm; 2393 LogStream ls(log.trace()); 2394 outputStream* out = &ls; 2395 2396 typedef ParallelCompactData::RegionData rd_t; 2397 ParallelCompactData& sd = summary_data(); 2398 2399 for (unsigned int id = old_space_id; id < last_space_id; ++id) { 2400 MutableSpace* const spc = _space_info[id].space(); 2401 if (spc->bottom() != spc->top()) { 2402 const rd_t* const beg = sd.addr_to_region_ptr(spc->bottom()); 2403 HeapWord* const top_aligned_up = sd.region_align_up(spc->top()); 2404 const rd_t* const end = sd.addr_to_region_ptr(top_aligned_up); 2405 2406 size_t histo[5] = { 0, 0, 0, 0, 0 }; 2407 const size_t histo_len = sizeof(histo) / sizeof(size_t); 2408 const size_t region_cnt = pointer_delta(end, beg, sizeof(rd_t)); 2409 2410 for (const rd_t* cur = beg; cur < end; ++cur) { 2411 ++histo[MIN2(cur->blocks_filled_count(), histo_len - 1)]; 2412 } 2413 out->print("Block fill histogram: %u %-4s" SIZE_FORMAT_W(5), id, space_names[id], region_cnt); 2414 for (size_t i = 0; i < histo_len; ++i) { 2415 out->print(" " SIZE_FORMAT_W(5) " %5.1f%%", 2416 histo[i], 100.0 * histo[i] / region_cnt); 2417 } 2418 out->cr(); 2419 } 2420 } 2421 } 2422 #endif // #ifdef ASSERT 2423 2424 void PSParallelCompact::compact() { 2425 GCTraceTime(Info, gc, phases) tm("Compaction Phase", &_gc_timer); 2426 2427 ParallelScavengeHeap* heap = ParallelScavengeHeap::heap(); 2428 PSOldGen* old_gen = heap->old_gen(); 2429 old_gen->start_array()->reset(); 2430 uint parallel_gc_threads = heap->gc_task_manager()->workers(); 2431 uint active_gc_threads = heap->gc_task_manager()->active_workers(); 2432 TaskQueueSetSuper* qset = ParCompactionManager::region_array(); 2433 ParallelTaskTerminator terminator(active_gc_threads, qset); 2434 2435 GCTaskQueue* q = GCTaskQueue::create(); 2436 prepare_region_draining_tasks(q, active_gc_threads); 2437 enqueue_dense_prefix_tasks(q, active_gc_threads); 2438 enqueue_region_stealing_tasks(q, &terminator, active_gc_threads); 2439 2440 { 2441 GCTraceTime(Trace, gc, phases) tm("Par Compact", &_gc_timer); 2442 2443 gc_task_manager()->execute_and_wait(q); 2444 2445 #ifdef ASSERT 2446 // Verify that all regions have been processed before the deferred updates. 2447 for (unsigned int id = old_space_id; id < last_space_id; ++id) { 2448 verify_complete(SpaceId(id)); 2449 } 2450 #endif 2451 } 2452 2453 { 2454 // Update the deferred objects, if any. Any compaction manager can be used. 2455 GCTraceTime(Trace, gc, phases) tm("Deferred Updates", &_gc_timer); 2456 ParCompactionManager* cm = ParCompactionManager::manager_array(0); 2457 for (unsigned int id = old_space_id; id < last_space_id; ++id) { 2458 update_deferred_objects(cm, SpaceId(id)); 2459 } 2460 } 2461 2462 DEBUG_ONLY(write_block_fill_histogram()); 2463 } 2464 2465 #ifdef ASSERT 2466 void PSParallelCompact::verify_complete(SpaceId space_id) { 2467 // All Regions between space bottom() to new_top() should be marked as filled 2468 // and all Regions between new_top() and top() should be available (i.e., 2469 // should have been emptied). 2470 ParallelCompactData& sd = summary_data(); 2471 SpaceInfo si = _space_info[space_id]; 2472 HeapWord* new_top_addr = sd.region_align_up(si.new_top()); 2473 HeapWord* old_top_addr = sd.region_align_up(si.space()->top()); 2474 const size_t beg_region = sd.addr_to_region_idx(si.space()->bottom()); 2475 const size_t new_top_region = sd.addr_to_region_idx(new_top_addr); 2476 const size_t old_top_region = sd.addr_to_region_idx(old_top_addr); 2477 2478 bool issued_a_warning = false; 2479 2480 size_t cur_region; 2481 for (cur_region = beg_region; cur_region < new_top_region; ++cur_region) { 2482 const RegionData* const c = sd.region(cur_region); 2483 if (!c->completed()) { 2484 log_warning(gc)("region " SIZE_FORMAT " not filled: destination_count=%u", 2485 cur_region, c->destination_count()); 2486 issued_a_warning = true; 2487 } 2488 } 2489 2490 for (cur_region = new_top_region; cur_region < old_top_region; ++cur_region) { 2491 const RegionData* const c = sd.region(cur_region); 2492 if (!c->available()) { 2493 log_warning(gc)("region " SIZE_FORMAT " not empty: destination_count=%u", 2494 cur_region, c->destination_count()); 2495 issued_a_warning = true; 2496 } 2497 } 2498 2499 if (issued_a_warning) { 2500 print_region_ranges(); 2501 } 2502 } 2503 #endif // #ifdef ASSERT 2504 2505 inline void UpdateOnlyClosure::do_addr(HeapWord* addr) { 2506 _start_array->allocate_block(addr); 2507 compaction_manager()->update_contents(oop(addr)); 2508 } 2509 2510 // Update interior oops in the ranges of regions [beg_region, end_region). 2511 void 2512 PSParallelCompact::update_and_deadwood_in_dense_prefix(ParCompactionManager* cm, 2513 SpaceId space_id, 2514 size_t beg_region, 2515 size_t end_region) { 2516 ParallelCompactData& sd = summary_data(); 2517 ParMarkBitMap* const mbm = mark_bitmap(); 2518 2519 HeapWord* beg_addr = sd.region_to_addr(beg_region); 2520 HeapWord* const end_addr = sd.region_to_addr(end_region); 2521 assert(beg_region <= end_region, "bad region range"); 2522 assert(end_addr <= dense_prefix(space_id), "not in the dense prefix"); 2523 2524 #ifdef ASSERT 2525 // Claim the regions to avoid triggering an assert when they are marked as 2526 // filled. 2527 for (size_t claim_region = beg_region; claim_region < end_region; ++claim_region) { 2528 assert(sd.region(claim_region)->claim_unsafe(), "claim() failed"); 2529 } 2530 #endif // #ifdef ASSERT 2531 2532 if (beg_addr != space(space_id)->bottom()) { 2533 // Find the first live object or block of dead space that *starts* in this 2534 // range of regions. If a partial object crosses onto the region, skip it; 2535 // it will be marked for 'deferred update' when the object head is 2536 // processed. If dead space crosses onto the region, it is also skipped; it 2537 // will be filled when the prior region is processed. If neither of those 2538 // apply, the first word in the region is the start of a live object or dead 2539 // space. 2540 assert(beg_addr > space(space_id)->bottom(), "sanity"); 2541 const RegionData* const cp = sd.region(beg_region); 2542 if (cp->partial_obj_size() != 0) { 2543 beg_addr = sd.partial_obj_end(beg_region); 2544 } else if (dead_space_crosses_boundary(cp, mbm->addr_to_bit(beg_addr))) { 2545 beg_addr = mbm->find_obj_beg(beg_addr, end_addr); 2546 } 2547 } 2548 2549 if (beg_addr < end_addr) { 2550 // A live object or block of dead space starts in this range of Regions. 2551 HeapWord* const dense_prefix_end = dense_prefix(space_id); 2552 2553 // Create closures and iterate. 2554 UpdateOnlyClosure update_closure(mbm, cm, space_id); 2555 FillClosure fill_closure(cm, space_id); 2556 ParMarkBitMap::IterationStatus status; 2557 status = mbm->iterate(&update_closure, &fill_closure, beg_addr, end_addr, 2558 dense_prefix_end); 2559 if (status == ParMarkBitMap::incomplete) { 2560 update_closure.do_addr(update_closure.source()); 2561 } 2562 } 2563 2564 // Mark the regions as filled. 2565 RegionData* const beg_cp = sd.region(beg_region); 2566 RegionData* const end_cp = sd.region(end_region); 2567 for (RegionData* cp = beg_cp; cp < end_cp; ++cp) { 2568 cp->set_completed(); 2569 } 2570 } 2571 2572 // Return the SpaceId for the space containing addr. If addr is not in the 2573 // heap, last_space_id is returned. In debug mode it expects the address to be 2574 // in the heap and asserts such. 2575 PSParallelCompact::SpaceId PSParallelCompact::space_id(HeapWord* addr) { 2576 assert(ParallelScavengeHeap::heap()->is_in_reserved(addr), "addr not in the heap"); 2577 2578 for (unsigned int id = old_space_id; id < last_space_id; ++id) { 2579 if (_space_info[id].space()->contains(addr)) { 2580 return SpaceId(id); 2581 } 2582 } 2583 2584 assert(false, "no space contains the addr"); 2585 return last_space_id; 2586 } 2587 2588 void PSParallelCompact::update_deferred_objects(ParCompactionManager* cm, 2589 SpaceId id) { 2590 assert(id < last_space_id, "bad space id"); 2591 2592 ParallelCompactData& sd = summary_data(); 2593 const SpaceInfo* const space_info = _space_info + id; 2594 ObjectStartArray* const start_array = space_info->start_array(); 2595 2596 const MutableSpace* const space = space_info->space(); 2597 assert(space_info->dense_prefix() >= space->bottom(), "dense_prefix not set"); 2598 HeapWord* const beg_addr = space_info->dense_prefix(); 2599 HeapWord* const end_addr = sd.region_align_up(space_info->new_top()); 2600 2601 const RegionData* const beg_region = sd.addr_to_region_ptr(beg_addr); 2602 const RegionData* const end_region = sd.addr_to_region_ptr(end_addr); 2603 const RegionData* cur_region; 2604 for (cur_region = beg_region; cur_region < end_region; ++cur_region) { 2605 HeapWord* const addr = cur_region->deferred_obj_addr(); 2606 if (addr != NULL) { 2607 if (start_array != NULL) { 2608 start_array->allocate_block(addr); 2609 } 2610 cm->update_contents(oop(addr)); 2611 assert(oopDesc::is_oop_or_null(oop(addr)), "Expected an oop or NULL at " PTR_FORMAT, p2i(oop(addr))); 2612 } 2613 } 2614 } 2615 2616 // Skip over count live words starting from beg, and return the address of the 2617 // next live word. Unless marked, the word corresponding to beg is assumed to 2618 // be dead. Callers must either ensure beg does not correspond to the middle of 2619 // an object, or account for those live words in some other way. Callers must 2620 // also ensure that there are enough live words in the range [beg, end) to skip. 2621 HeapWord* 2622 PSParallelCompact::skip_live_words(HeapWord* beg, HeapWord* end, size_t count) 2623 { 2624 assert(count > 0, "sanity"); 2625 2626 ParMarkBitMap* m = mark_bitmap(); 2627 idx_t bits_to_skip = m->words_to_bits(count); 2628 idx_t cur_beg = m->addr_to_bit(beg); 2629 const idx_t search_end = BitMap::word_align_up(m->addr_to_bit(end)); 2630 2631 do { 2632 cur_beg = m->find_obj_beg(cur_beg, search_end); 2633 idx_t cur_end = m->find_obj_end(cur_beg, search_end); 2634 const size_t obj_bits = cur_end - cur_beg + 1; 2635 if (obj_bits > bits_to_skip) { 2636 return m->bit_to_addr(cur_beg + bits_to_skip); 2637 } 2638 bits_to_skip -= obj_bits; 2639 cur_beg = cur_end + 1; 2640 } while (bits_to_skip > 0); 2641 2642 // Skipping the desired number of words landed just past the end of an object. 2643 // Find the start of the next object. 2644 cur_beg = m->find_obj_beg(cur_beg, search_end); 2645 assert(cur_beg < m->addr_to_bit(end), "not enough live words to skip"); 2646 return m->bit_to_addr(cur_beg); 2647 } 2648 2649 HeapWord* PSParallelCompact::first_src_addr(HeapWord* const dest_addr, 2650 SpaceId src_space_id, 2651 size_t src_region_idx) 2652 { 2653 assert(summary_data().is_region_aligned(dest_addr), "not aligned"); 2654 2655 const SplitInfo& split_info = _space_info[src_space_id].split_info(); 2656 if (split_info.dest_region_addr() == dest_addr) { 2657 // The partial object ending at the split point contains the first word to 2658 // be copied to dest_addr. 2659 return split_info.first_src_addr(); 2660 } 2661 2662 const ParallelCompactData& sd = summary_data(); 2663 ParMarkBitMap* const bitmap = mark_bitmap(); 2664 const size_t RegionSize = ParallelCompactData::RegionSize; 2665 2666 assert(sd.is_region_aligned(dest_addr), "not aligned"); 2667 const RegionData* const src_region_ptr = sd.region(src_region_idx); 2668 const size_t partial_obj_size = src_region_ptr->partial_obj_size(); 2669 HeapWord* const src_region_destination = src_region_ptr->destination(); 2670 2671 assert(dest_addr >= src_region_destination, "wrong src region"); 2672 assert(src_region_ptr->data_size() > 0, "src region cannot be empty"); 2673 2674 HeapWord* const src_region_beg = sd.region_to_addr(src_region_idx); 2675 HeapWord* const src_region_end = src_region_beg + RegionSize; 2676 2677 HeapWord* addr = src_region_beg; 2678 if (dest_addr == src_region_destination) { 2679 // Return the first live word in the source region. 2680 if (partial_obj_size == 0) { 2681 addr = bitmap->find_obj_beg(addr, src_region_end); 2682 assert(addr < src_region_end, "no objects start in src region"); 2683 } 2684 return addr; 2685 } 2686 2687 // Must skip some live data. 2688 size_t words_to_skip = dest_addr - src_region_destination; 2689 assert(src_region_ptr->data_size() > words_to_skip, "wrong src region"); 2690 2691 if (partial_obj_size >= words_to_skip) { 2692 // All the live words to skip are part of the partial object. 2693 addr += words_to_skip; 2694 if (partial_obj_size == words_to_skip) { 2695 // Find the first live word past the partial object. 2696 addr = bitmap->find_obj_beg(addr, src_region_end); 2697 assert(addr < src_region_end, "wrong src region"); 2698 } 2699 return addr; 2700 } 2701 2702 // Skip over the partial object (if any). 2703 if (partial_obj_size != 0) { 2704 words_to_skip -= partial_obj_size; 2705 addr += partial_obj_size; 2706 } 2707 2708 // Skip over live words due to objects that start in the region. 2709 addr = skip_live_words(addr, src_region_end, words_to_skip); 2710 assert(addr < src_region_end, "wrong src region"); 2711 return addr; 2712 } 2713 2714 void PSParallelCompact::decrement_destination_counts(ParCompactionManager* cm, 2715 SpaceId src_space_id, 2716 size_t beg_region, 2717 HeapWord* end_addr) 2718 { 2719 ParallelCompactData& sd = summary_data(); 2720 2721 #ifdef ASSERT 2722 MutableSpace* const src_space = _space_info[src_space_id].space(); 2723 HeapWord* const beg_addr = sd.region_to_addr(beg_region); 2724 assert(src_space->contains(beg_addr) || beg_addr == src_space->end(), 2725 "src_space_id does not match beg_addr"); 2726 assert(src_space->contains(end_addr) || end_addr == src_space->end(), 2727 "src_space_id does not match end_addr"); 2728 #endif // #ifdef ASSERT 2729 2730 RegionData* const beg = sd.region(beg_region); 2731 RegionData* const end = sd.addr_to_region_ptr(sd.region_align_up(end_addr)); 2732 2733 // Regions up to new_top() are enqueued if they become available. 2734 HeapWord* const new_top = _space_info[src_space_id].new_top(); 2735 RegionData* const enqueue_end = 2736 sd.addr_to_region_ptr(sd.region_align_up(new_top)); 2737 2738 for (RegionData* cur = beg; cur < end; ++cur) { 2739 assert(cur->data_size() > 0, "region must have live data"); 2740 cur->decrement_destination_count(); 2741 if (cur < enqueue_end && cur->available() && cur->claim()) { 2742 cm->push_region(sd.region(cur)); 2743 } 2744 } 2745 } 2746 2747 size_t PSParallelCompact::next_src_region(MoveAndUpdateClosure& closure, 2748 SpaceId& src_space_id, 2749 HeapWord*& src_space_top, 2750 HeapWord* end_addr) 2751 { 2752 typedef ParallelCompactData::RegionData RegionData; 2753 2754 ParallelCompactData& sd = PSParallelCompact::summary_data(); 2755 const size_t region_size = ParallelCompactData::RegionSize; 2756 2757 size_t src_region_idx = 0; 2758 2759 // Skip empty regions (if any) up to the top of the space. 2760 HeapWord* const src_aligned_up = sd.region_align_up(end_addr); 2761 RegionData* src_region_ptr = sd.addr_to_region_ptr(src_aligned_up); 2762 HeapWord* const top_aligned_up = sd.region_align_up(src_space_top); 2763 const RegionData* const top_region_ptr = 2764 sd.addr_to_region_ptr(top_aligned_up); 2765 while (src_region_ptr < top_region_ptr && src_region_ptr->data_size() == 0) { 2766 ++src_region_ptr; 2767 } 2768 2769 if (src_region_ptr < top_region_ptr) { 2770 // The next source region is in the current space. Update src_region_idx 2771 // and the source address to match src_region_ptr. 2772 src_region_idx = sd.region(src_region_ptr); 2773 HeapWord* const src_region_addr = sd.region_to_addr(src_region_idx); 2774 if (src_region_addr > closure.source()) { 2775 closure.set_source(src_region_addr); 2776 } 2777 return src_region_idx; 2778 } 2779 2780 // Switch to a new source space and find the first non-empty region. 2781 unsigned int space_id = src_space_id + 1; 2782 assert(space_id < last_space_id, "not enough spaces"); 2783 2784 HeapWord* const destination = closure.destination(); 2785 2786 do { 2787 MutableSpace* space = _space_info[space_id].space(); 2788 HeapWord* const bottom = space->bottom(); 2789 const RegionData* const bottom_cp = sd.addr_to_region_ptr(bottom); 2790 2791 // Iterate over the spaces that do not compact into themselves. 2792 if (bottom_cp->destination() != bottom) { 2793 HeapWord* const top_aligned_up = sd.region_align_up(space->top()); 2794 const RegionData* const top_cp = sd.addr_to_region_ptr(top_aligned_up); 2795 2796 for (const RegionData* src_cp = bottom_cp; src_cp < top_cp; ++src_cp) { 2797 if (src_cp->live_obj_size() > 0) { 2798 // Found it. 2799 assert(src_cp->destination() == destination, 2800 "first live obj in the space must match the destination"); 2801 assert(src_cp->partial_obj_size() == 0, 2802 "a space cannot begin with a partial obj"); 2803 2804 src_space_id = SpaceId(space_id); 2805 src_space_top = space->top(); 2806 const size_t src_region_idx = sd.region(src_cp); 2807 closure.set_source(sd.region_to_addr(src_region_idx)); 2808 return src_region_idx; 2809 } else { 2810 assert(src_cp->data_size() == 0, "sanity"); 2811 } 2812 } 2813 } 2814 } while (++space_id < last_space_id); 2815 2816 assert(false, "no source region was found"); 2817 return 0; 2818 } 2819 2820 void PSParallelCompact::fill_region(ParCompactionManager* cm, size_t region_idx) 2821 { 2822 typedef ParMarkBitMap::IterationStatus IterationStatus; 2823 const size_t RegionSize = ParallelCompactData::RegionSize; 2824 ParMarkBitMap* const bitmap = mark_bitmap(); 2825 ParallelCompactData& sd = summary_data(); 2826 RegionData* const region_ptr = sd.region(region_idx); 2827 2828 // Get the items needed to construct the closure. 2829 HeapWord* dest_addr = sd.region_to_addr(region_idx); 2830 SpaceId dest_space_id = space_id(dest_addr); 2831 ObjectStartArray* start_array = _space_info[dest_space_id].start_array(); 2832 HeapWord* new_top = _space_info[dest_space_id].new_top(); 2833 assert(dest_addr < new_top, "sanity"); 2834 const size_t words = MIN2(pointer_delta(new_top, dest_addr), RegionSize); 2835 2836 // Get the source region and related info. 2837 size_t src_region_idx = region_ptr->source_region(); 2838 SpaceId src_space_id = space_id(sd.region_to_addr(src_region_idx)); 2839 HeapWord* src_space_top = _space_info[src_space_id].space()->top(); 2840 2841 MoveAndUpdateClosure closure(bitmap, cm, start_array, dest_addr, words); 2842 closure.set_source(first_src_addr(dest_addr, src_space_id, src_region_idx)); 2843 2844 // Adjust src_region_idx to prepare for decrementing destination counts (the 2845 // destination count is not decremented when a region is copied to itself). 2846 if (src_region_idx == region_idx) { 2847 src_region_idx += 1; 2848 } 2849 2850 if (bitmap->is_unmarked(closure.source())) { 2851 // The first source word is in the middle of an object; copy the remainder 2852 // of the object or as much as will fit. The fact that pointer updates were 2853 // deferred will be noted when the object header is processed. 2854 HeapWord* const old_src_addr = closure.source(); 2855 closure.copy_partial_obj(); 2856 if (closure.is_full()) { 2857 decrement_destination_counts(cm, src_space_id, src_region_idx, 2858 closure.source()); 2859 region_ptr->set_deferred_obj_addr(NULL); 2860 region_ptr->set_completed(); 2861 return; 2862 } 2863 2864 HeapWord* const end_addr = sd.region_align_down(closure.source()); 2865 if (sd.region_align_down(old_src_addr) != end_addr) { 2866 // The partial object was copied from more than one source region. 2867 decrement_destination_counts(cm, src_space_id, src_region_idx, end_addr); 2868 2869 // Move to the next source region, possibly switching spaces as well. All 2870 // args except end_addr may be modified. 2871 src_region_idx = next_src_region(closure, src_space_id, src_space_top, 2872 end_addr); 2873 } 2874 } 2875 2876 do { 2877 HeapWord* const cur_addr = closure.source(); 2878 HeapWord* const end_addr = MIN2(sd.region_align_up(cur_addr + 1), 2879 src_space_top); 2880 IterationStatus status = bitmap->iterate(&closure, cur_addr, end_addr); 2881 2882 if (status == ParMarkBitMap::incomplete) { 2883 // The last obj that starts in the source region does not end in the 2884 // region. 2885 assert(closure.source() < end_addr, "sanity"); 2886 HeapWord* const obj_beg = closure.source(); 2887 HeapWord* const range_end = MIN2(obj_beg + closure.words_remaining(), 2888 src_space_top); 2889 HeapWord* const obj_end = bitmap->find_obj_end(obj_beg, range_end); 2890 if (obj_end < range_end) { 2891 // The end was found; the entire object will fit. 2892 status = closure.do_addr(obj_beg, bitmap->obj_size(obj_beg, obj_end)); 2893 assert(status != ParMarkBitMap::would_overflow, "sanity"); 2894 } else { 2895 // The end was not found; the object will not fit. 2896 assert(range_end < src_space_top, "obj cannot cross space boundary"); 2897 status = ParMarkBitMap::would_overflow; 2898 } 2899 } 2900 2901 if (status == ParMarkBitMap::would_overflow) { 2902 // The last object did not fit. Note that interior oop updates were 2903 // deferred, then copy enough of the object to fill the region. 2904 region_ptr->set_deferred_obj_addr(closure.destination()); 2905 status = closure.copy_until_full(); // copies from closure.source() 2906 2907 decrement_destination_counts(cm, src_space_id, src_region_idx, 2908 closure.source()); 2909 region_ptr->set_completed(); 2910 return; 2911 } 2912 2913 if (status == ParMarkBitMap::full) { 2914 decrement_destination_counts(cm, src_space_id, src_region_idx, 2915 closure.source()); 2916 region_ptr->set_deferred_obj_addr(NULL); 2917 region_ptr->set_completed(); 2918 return; 2919 } 2920 2921 decrement_destination_counts(cm, src_space_id, src_region_idx, end_addr); 2922 2923 // Move to the next source region, possibly switching spaces as well. All 2924 // args except end_addr may be modified. 2925 src_region_idx = next_src_region(closure, src_space_id, src_space_top, 2926 end_addr); 2927 } while (true); 2928 } 2929 2930 void PSParallelCompact::fill_blocks(size_t region_idx) 2931 { 2932 // Fill in the block table elements for the specified region. Each block 2933 // table element holds the number of live words in the region that are to the 2934 // left of the first object that starts in the block. Thus only blocks in 2935 // which an object starts need to be filled. 2936 // 2937 // The algorithm scans the section of the bitmap that corresponds to the 2938 // region, keeping a running total of the live words. When an object start is 2939 // found, if it's the first to start in the block that contains it, the 2940 // current total is written to the block table element. 2941 const size_t Log2BlockSize = ParallelCompactData::Log2BlockSize; 2942 const size_t Log2RegionSize = ParallelCompactData::Log2RegionSize; 2943 const size_t RegionSize = ParallelCompactData::RegionSize; 2944 2945 ParallelCompactData& sd = summary_data(); 2946 const size_t partial_obj_size = sd.region(region_idx)->partial_obj_size(); 2947 if (partial_obj_size >= RegionSize) { 2948 return; // No objects start in this region. 2949 } 2950 2951 // Ensure the first loop iteration decides that the block has changed. 2952 size_t cur_block = sd.block_count(); 2953 2954 const ParMarkBitMap* const bitmap = mark_bitmap(); 2955 2956 const size_t Log2BitsPerBlock = Log2BlockSize - LogMinObjAlignment; 2957 assert((size_t)1 << Log2BitsPerBlock == 2958 bitmap->words_to_bits(ParallelCompactData::BlockSize), "sanity"); 2959 2960 size_t beg_bit = bitmap->words_to_bits(region_idx << Log2RegionSize); 2961 const size_t range_end = beg_bit + bitmap->words_to_bits(RegionSize); 2962 size_t live_bits = bitmap->words_to_bits(partial_obj_size); 2963 beg_bit = bitmap->find_obj_beg(beg_bit + live_bits, range_end); 2964 while (beg_bit < range_end) { 2965 const size_t new_block = beg_bit >> Log2BitsPerBlock; 2966 if (new_block != cur_block) { 2967 cur_block = new_block; 2968 sd.block(cur_block)->set_offset(bitmap->bits_to_words(live_bits)); 2969 } 2970 2971 const size_t end_bit = bitmap->find_obj_end(beg_bit, range_end); 2972 if (end_bit < range_end - 1) { 2973 live_bits += end_bit - beg_bit + 1; 2974 beg_bit = bitmap->find_obj_beg(end_bit + 1, range_end); 2975 } else { 2976 return; 2977 } 2978 } 2979 } 2980 2981 void 2982 PSParallelCompact::move_and_update(ParCompactionManager* cm, SpaceId space_id) { 2983 const MutableSpace* sp = space(space_id); 2984 if (sp->is_empty()) { 2985 return; 2986 } 2987 2988 ParallelCompactData& sd = PSParallelCompact::summary_data(); 2989 ParMarkBitMap* const bitmap = mark_bitmap(); 2990 HeapWord* const dp_addr = dense_prefix(space_id); 2991 HeapWord* beg_addr = sp->bottom(); 2992 HeapWord* end_addr = sp->top(); 2993 2994 assert(beg_addr <= dp_addr && dp_addr <= end_addr, "bad dense prefix"); 2995 2996 const size_t beg_region = sd.addr_to_region_idx(beg_addr); 2997 const size_t dp_region = sd.addr_to_region_idx(dp_addr); 2998 if (beg_region < dp_region) { 2999 update_and_deadwood_in_dense_prefix(cm, space_id, beg_region, dp_region); 3000 } 3001 3002 // The destination of the first live object that starts in the region is one 3003 // past the end of the partial object entering the region (if any). 3004 HeapWord* const dest_addr = sd.partial_obj_end(dp_region); 3005 HeapWord* const new_top = _space_info[space_id].new_top(); 3006 assert(new_top >= dest_addr, "bad new_top value"); 3007 const size_t words = pointer_delta(new_top, dest_addr); 3008 3009 if (words > 0) { 3010 ObjectStartArray* start_array = _space_info[space_id].start_array(); 3011 MoveAndUpdateClosure closure(bitmap, cm, start_array, dest_addr, words); 3012 3013 ParMarkBitMap::IterationStatus status; 3014 status = bitmap->iterate(&closure, dest_addr, end_addr); 3015 assert(status == ParMarkBitMap::full, "iteration not complete"); 3016 assert(bitmap->find_obj_beg(closure.source(), end_addr) == end_addr, 3017 "live objects skipped because closure is full"); 3018 } 3019 } 3020 3021 jlong PSParallelCompact::millis_since_last_gc() { 3022 // We need a monotonically non-decreasing time in ms but 3023 // os::javaTimeMillis() does not guarantee monotonicity. 3024 jlong now = os::javaTimeNanos() / NANOSECS_PER_MILLISEC; 3025 jlong ret_val = now - _time_of_last_gc; 3026 // XXX See note in genCollectedHeap::millis_since_last_gc(). 3027 if (ret_val < 0) { 3028 NOT_PRODUCT(log_warning(gc)("time warp: " JLONG_FORMAT, ret_val);) 3029 return 0; 3030 } 3031 return ret_val; 3032 } 3033 3034 void PSParallelCompact::reset_millis_since_last_gc() { 3035 // We need a monotonically non-decreasing time in ms but 3036 // os::javaTimeMillis() does not guarantee monotonicity. 3037 _time_of_last_gc = os::javaTimeNanos() / NANOSECS_PER_MILLISEC; 3038 } 3039 3040 ParMarkBitMap::IterationStatus MoveAndUpdateClosure::copy_until_full() 3041 { 3042 if (source() != destination()) { 3043 DEBUG_ONLY(PSParallelCompact::check_new_location(source(), destination());) 3044 Copy::aligned_conjoint_words(source(), destination(), words_remaining()); 3045 } 3046 update_state(words_remaining()); 3047 assert(is_full(), "sanity"); 3048 return ParMarkBitMap::full; 3049 } 3050 3051 void MoveAndUpdateClosure::copy_partial_obj() 3052 { 3053 size_t words = words_remaining(); 3054 3055 HeapWord* const range_end = MIN2(source() + words, bitmap()->region_end()); 3056 HeapWord* const end_addr = bitmap()->find_obj_end(source(), range_end); 3057 if (end_addr < range_end) { 3058 words = bitmap()->obj_size(source(), end_addr); 3059 } 3060 3061 // This test is necessary; if omitted, the pointer updates to a partial object 3062 // that crosses the dense prefix boundary could be overwritten. 3063 if (source() != destination()) { 3064 DEBUG_ONLY(PSParallelCompact::check_new_location(source(), destination());) 3065 Copy::aligned_conjoint_words(source(), destination(), words); 3066 } 3067 update_state(words); 3068 } 3069 3070 void InstanceKlass::oop_pc_update_pointers(oop obj, ParCompactionManager* cm) { 3071 PSParallelCompact::AdjustPointerClosure closure(cm); 3072 oop_oop_iterate_oop_maps<true>(obj, &closure); 3073 } 3074 3075 void InstanceMirrorKlass::oop_pc_update_pointers(oop obj, ParCompactionManager* cm) { 3076 InstanceKlass::oop_pc_update_pointers(obj, cm); 3077 3078 PSParallelCompact::AdjustPointerClosure closure(cm); 3079 oop_oop_iterate_statics<true>(obj, &closure); 3080 } 3081 3082 void InstanceClassLoaderKlass::oop_pc_update_pointers(oop obj, ParCompactionManager* cm) { 3083 InstanceKlass::oop_pc_update_pointers(obj, cm); 3084 } 3085 3086 #ifdef ASSERT 3087 template <class T> static void trace_reference_gc(const char *s, oop obj, 3088 T* referent_addr, 3089 T* discovered_addr) { 3090 log_develop_trace(gc, ref)("%s obj " PTR_FORMAT, s, p2i(obj)); 3091 log_develop_trace(gc, ref)(" referent_addr/* " PTR_FORMAT " / " PTR_FORMAT, 3092 p2i(referent_addr), referent_addr ? p2i((oop)RawAccess<>::oop_load(referent_addr)) : NULL); 3093 log_develop_trace(gc, ref)(" discovered_addr/* " PTR_FORMAT " / " PTR_FORMAT, 3094 p2i(discovered_addr), discovered_addr ? p2i((oop)RawAccess<>::oop_load(discovered_addr)) : NULL); 3095 } 3096 #endif 3097 3098 template <class T> 3099 static void oop_pc_update_pointers_specialized(oop obj, ParCompactionManager* cm) { 3100 T* referent_addr = (T*)java_lang_ref_Reference::referent_addr_raw(obj); 3101 PSParallelCompact::adjust_pointer(referent_addr, cm); 3102 T* discovered_addr = (T*)java_lang_ref_Reference::discovered_addr_raw(obj); 3103 PSParallelCompact::adjust_pointer(discovered_addr, cm); 3104 debug_only(trace_reference_gc("InstanceRefKlass::oop_update_ptrs", obj, 3105 referent_addr, discovered_addr);) 3106 } 3107 3108 void InstanceRefKlass::oop_pc_update_pointers(oop obj, ParCompactionManager* cm) { 3109 InstanceKlass::oop_pc_update_pointers(obj, cm); 3110 3111 if (UseCompressedOops) { 3112 oop_pc_update_pointers_specialized<narrowOop>(obj, cm); 3113 } else { 3114 oop_pc_update_pointers_specialized<oop>(obj, cm); 3115 } 3116 } 3117 3118 void ObjArrayKlass::oop_pc_update_pointers(oop obj, ParCompactionManager* cm) { 3119 assert(obj->is_objArray(), "obj must be obj array"); 3120 PSParallelCompact::AdjustPointerClosure closure(cm); 3121 oop_oop_iterate_elements<true>(objArrayOop(obj), &closure); 3122 } 3123 3124 void TypeArrayKlass::oop_pc_update_pointers(oop obj, ParCompactionManager* cm) { 3125 assert(obj->is_typeArray(),"must be a type array"); 3126 } 3127 3128 ParMarkBitMapClosure::IterationStatus 3129 MoveAndUpdateClosure::do_addr(HeapWord* addr, size_t words) { 3130 assert(destination() != NULL, "sanity"); 3131 assert(bitmap()->obj_size(addr) == words, "bad size"); 3132 3133 _source = addr; 3134 assert(PSParallelCompact::summary_data().calc_new_pointer(source(), compaction_manager()) == 3135 destination(), "wrong destination"); 3136 3137 if (words > words_remaining()) { 3138 return ParMarkBitMap::would_overflow; 3139 } 3140 3141 // The start_array must be updated even if the object is not moving. 3142 if (_start_array != NULL) { 3143 _start_array->allocate_block(destination()); 3144 } 3145 3146 if (destination() != source()) { 3147 DEBUG_ONLY(PSParallelCompact::check_new_location(source(), destination());) 3148 Copy::aligned_conjoint_words(source(), destination(), words); 3149 } 3150 3151 oop moved_oop = (oop) destination(); 3152 compaction_manager()->update_contents(moved_oop); 3153 assert(oopDesc::is_oop_or_null(moved_oop), "Expected an oop or NULL at " PTR_FORMAT, p2i(moved_oop)); 3154 3155 update_state(words); 3156 assert(destination() == (HeapWord*)moved_oop + moved_oop->size(), "sanity"); 3157 return is_full() ? ParMarkBitMap::full : ParMarkBitMap::incomplete; 3158 } 3159 3160 UpdateOnlyClosure::UpdateOnlyClosure(ParMarkBitMap* mbm, 3161 ParCompactionManager* cm, 3162 PSParallelCompact::SpaceId space_id) : 3163 ParMarkBitMapClosure(mbm, cm), 3164 _space_id(space_id), 3165 _start_array(PSParallelCompact::start_array(space_id)) 3166 { 3167 } 3168 3169 // Updates the references in the object to their new values. 3170 ParMarkBitMapClosure::IterationStatus 3171 UpdateOnlyClosure::do_addr(HeapWord* addr, size_t words) { 3172 do_addr(addr); 3173 return ParMarkBitMap::incomplete; 3174 } 3175 3176 FillClosure::FillClosure(ParCompactionManager* cm, PSParallelCompact::SpaceId space_id) : 3177 ParMarkBitMapClosure(PSParallelCompact::mark_bitmap(), cm), 3178 _start_array(PSParallelCompact::start_array(space_id)) 3179 { 3180 assert(space_id == PSParallelCompact::old_space_id, 3181 "cannot use FillClosure in the young gen"); 3182 } 3183 3184 ParMarkBitMapClosure::IterationStatus 3185 FillClosure::do_addr(HeapWord* addr, size_t size) { 3186 CollectedHeap::fill_with_objects(addr, size); 3187 HeapWord* const end = addr + size; 3188 do { 3189 _start_array->allocate_block(addr); 3190 addr += oop(addr)->size(); 3191 } while (addr < end); 3192 return ParMarkBitMap::incomplete; 3193 }