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