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