Thu, 02 Oct 2008 19:58:19 -0700
6754988: Update copyright year
Summary: Update for files that have been modified starting July 2008
Reviewed-by: ohair, tbell
duke@435 | 1 | /* |
xdono@772 | 2 | * Copyright 2001-2008 Sun Microsystems, Inc. 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 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | #include "incls/_precompiled.incl" |
duke@435 | 26 | #include "incls/_psMarkSweep.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | elapsedTimer PSMarkSweep::_accumulated_time; |
duke@435 | 29 | unsigned int PSMarkSweep::_total_invocations = 0; |
duke@435 | 30 | jlong PSMarkSweep::_time_of_last_gc = 0; |
duke@435 | 31 | CollectorCounters* PSMarkSweep::_counters = NULL; |
duke@435 | 32 | |
duke@435 | 33 | void PSMarkSweep::initialize() { |
duke@435 | 34 | MemRegion mr = Universe::heap()->reserved_region(); |
duke@435 | 35 | _ref_processor = new ReferenceProcessor(mr, |
duke@435 | 36 | true, // atomic_discovery |
duke@435 | 37 | false); // mt_discovery |
duke@435 | 38 | if (!UseParallelOldGC || !VerifyParallelOldWithMarkSweep) { |
duke@435 | 39 | _counters = new CollectorCounters("PSMarkSweep", 1); |
duke@435 | 40 | } |
duke@435 | 41 | } |
duke@435 | 42 | |
duke@435 | 43 | // This method contains all heap specific policy for invoking mark sweep. |
duke@435 | 44 | // PSMarkSweep::invoke_no_policy() will only attempt to mark-sweep-compact |
duke@435 | 45 | // the heap. It will do nothing further. If we need to bail out for policy |
duke@435 | 46 | // reasons, scavenge before full gc, or any other specialized behavior, it |
duke@435 | 47 | // needs to be added here. |
duke@435 | 48 | // |
duke@435 | 49 | // Note that this method should only be called from the vm_thread while |
duke@435 | 50 | // at a safepoint! |
duke@435 | 51 | void PSMarkSweep::invoke(bool maximum_heap_compaction) { |
duke@435 | 52 | assert(SafepointSynchronize::is_at_safepoint(), "should be at safepoint"); |
duke@435 | 53 | assert(Thread::current() == (Thread*)VMThread::vm_thread(), "should be in vm thread"); |
duke@435 | 54 | assert(!Universe::heap()->is_gc_active(), "not reentrant"); |
duke@435 | 55 | |
duke@435 | 56 | ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); |
duke@435 | 57 | GCCause::Cause gc_cause = heap->gc_cause(); |
duke@435 | 58 | PSAdaptiveSizePolicy* policy = heap->size_policy(); |
duke@435 | 59 | |
duke@435 | 60 | // Before each allocation/collection attempt, find out from the |
duke@435 | 61 | // policy object if GCs are, on the whole, taking too long. If so, |
duke@435 | 62 | // bail out without attempting a collection. The exceptions are |
duke@435 | 63 | // for explicitly requested GC's. |
duke@435 | 64 | if (!policy->gc_time_limit_exceeded() || |
duke@435 | 65 | GCCause::is_user_requested_gc(gc_cause) || |
duke@435 | 66 | GCCause::is_serviceability_requested_gc(gc_cause)) { |
duke@435 | 67 | IsGCActiveMark mark; |
duke@435 | 68 | |
duke@435 | 69 | if (ScavengeBeforeFullGC) { |
duke@435 | 70 | PSScavenge::invoke_no_policy(); |
duke@435 | 71 | } |
duke@435 | 72 | |
duke@435 | 73 | int count = (maximum_heap_compaction)?1:MarkSweepAlwaysCompactCount; |
duke@435 | 74 | IntFlagSetting flag_setting(MarkSweepAlwaysCompactCount, count); |
duke@435 | 75 | PSMarkSweep::invoke_no_policy(maximum_heap_compaction); |
duke@435 | 76 | } |
duke@435 | 77 | } |
duke@435 | 78 | |
duke@435 | 79 | // This method contains no policy. You should probably |
duke@435 | 80 | // be calling invoke() instead. |
duke@435 | 81 | void PSMarkSweep::invoke_no_policy(bool clear_all_softrefs) { |
duke@435 | 82 | assert(SafepointSynchronize::is_at_safepoint(), "must be at a safepoint"); |
duke@435 | 83 | assert(ref_processor() != NULL, "Sanity"); |
duke@435 | 84 | |
duke@435 | 85 | if (GC_locker::check_active_before_gc()) { |
duke@435 | 86 | return; |
duke@435 | 87 | } |
duke@435 | 88 | |
duke@435 | 89 | ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); |
duke@435 | 90 | GCCause::Cause gc_cause = heap->gc_cause(); |
duke@435 | 91 | assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); |
duke@435 | 92 | PSAdaptiveSizePolicy* size_policy = heap->size_policy(); |
duke@435 | 93 | |
duke@435 | 94 | PSYoungGen* young_gen = heap->young_gen(); |
duke@435 | 95 | PSOldGen* old_gen = heap->old_gen(); |
duke@435 | 96 | PSPermGen* perm_gen = heap->perm_gen(); |
duke@435 | 97 | |
duke@435 | 98 | // Increment the invocation count |
duke@435 | 99 | heap->increment_total_collections(true /* full */); |
duke@435 | 100 | |
jmasa@698 | 101 | // Save information needed to minimize mangling |
jmasa@698 | 102 | heap->record_gen_tops_before_GC(); |
jmasa@698 | 103 | |
duke@435 | 104 | // We need to track unique mark sweep invocations as well. |
duke@435 | 105 | _total_invocations++; |
duke@435 | 106 | |
duke@435 | 107 | AdaptiveSizePolicyOutput(size_policy, heap->total_collections()); |
duke@435 | 108 | |
duke@435 | 109 | if (PrintHeapAtGC) { |
duke@435 | 110 | Universe::print_heap_before_gc(); |
duke@435 | 111 | } |
duke@435 | 112 | |
duke@435 | 113 | // Fill in TLABs |
duke@435 | 114 | heap->accumulate_statistics_all_tlabs(); |
duke@435 | 115 | heap->ensure_parsability(true); // retire TLABs |
duke@435 | 116 | |
duke@435 | 117 | if (VerifyBeforeGC && heap->total_collections() >= VerifyGCStartAt) { |
duke@435 | 118 | HandleMark hm; // Discard invalid handles created during verification |
duke@435 | 119 | gclog_or_tty->print(" VerifyBeforeGC:"); |
duke@435 | 120 | Universe::verify(true); |
duke@435 | 121 | } |
duke@435 | 122 | |
duke@435 | 123 | // Verify object start arrays |
duke@435 | 124 | if (VerifyObjectStartArray && |
duke@435 | 125 | VerifyBeforeGC) { |
duke@435 | 126 | old_gen->verify_object_start_array(); |
duke@435 | 127 | perm_gen->verify_object_start_array(); |
duke@435 | 128 | } |
duke@435 | 129 | |
duke@435 | 130 | // Filled in below to track the state of the young gen after the collection. |
duke@435 | 131 | bool eden_empty; |
duke@435 | 132 | bool survivors_empty; |
duke@435 | 133 | bool young_gen_empty; |
duke@435 | 134 | |
duke@435 | 135 | { |
duke@435 | 136 | HandleMark hm; |
duke@435 | 137 | const bool is_system_gc = gc_cause == GCCause::_java_lang_system_gc; |
duke@435 | 138 | // This is useful for debugging but don't change the output the |
duke@435 | 139 | // the customer sees. |
duke@435 | 140 | const char* gc_cause_str = "Full GC"; |
duke@435 | 141 | if (is_system_gc && PrintGCDetails) { |
duke@435 | 142 | gc_cause_str = "Full GC (System)"; |
duke@435 | 143 | } |
duke@435 | 144 | gclog_or_tty->date_stamp(PrintGC && PrintGCDateStamps); |
duke@435 | 145 | TraceCPUTime tcpu(PrintGCDetails, true, gclog_or_tty); |
duke@435 | 146 | TraceTime t1(gc_cause_str, PrintGC, !PrintGCDetails, gclog_or_tty); |
duke@435 | 147 | TraceCollectorStats tcs(counters()); |
duke@435 | 148 | TraceMemoryManagerStats tms(true /* Full GC */); |
duke@435 | 149 | |
duke@435 | 150 | if (TraceGen1Time) accumulated_time()->start(); |
duke@435 | 151 | |
duke@435 | 152 | // Let the size policy know we're starting |
duke@435 | 153 | size_policy->major_collection_begin(); |
duke@435 | 154 | |
duke@435 | 155 | // When collecting the permanent generation methodOops may be moving, |
duke@435 | 156 | // so we either have to flush all bcp data or convert it into bci. |
duke@435 | 157 | CodeCache::gc_prologue(); |
duke@435 | 158 | Threads::gc_prologue(); |
duke@435 | 159 | BiasedLocking::preserve_marks(); |
duke@435 | 160 | |
duke@435 | 161 | // Capture heap size before collection for printing. |
duke@435 | 162 | size_t prev_used = heap->used(); |
duke@435 | 163 | |
duke@435 | 164 | // Capture perm gen size before collection for sizing. |
duke@435 | 165 | size_t perm_gen_prev_used = perm_gen->used_in_bytes(); |
duke@435 | 166 | |
duke@435 | 167 | // For PrintGCDetails |
duke@435 | 168 | size_t old_gen_prev_used = old_gen->used_in_bytes(); |
duke@435 | 169 | size_t young_gen_prev_used = young_gen->used_in_bytes(); |
duke@435 | 170 | |
duke@435 | 171 | allocate_stacks(); |
duke@435 | 172 | |
duke@435 | 173 | NOT_PRODUCT(ref_processor()->verify_no_references_recorded()); |
duke@435 | 174 | COMPILER2_PRESENT(DerivedPointerTable::clear()); |
duke@435 | 175 | |
duke@435 | 176 | ref_processor()->enable_discovery(); |
duke@435 | 177 | |
duke@435 | 178 | mark_sweep_phase1(clear_all_softrefs); |
duke@435 | 179 | |
duke@435 | 180 | mark_sweep_phase2(); |
duke@435 | 181 | |
duke@435 | 182 | // Don't add any more derived pointers during phase3 |
duke@435 | 183 | COMPILER2_PRESENT(assert(DerivedPointerTable::is_active(), "Sanity")); |
duke@435 | 184 | COMPILER2_PRESENT(DerivedPointerTable::set_active(false)); |
duke@435 | 185 | |
duke@435 | 186 | mark_sweep_phase3(); |
duke@435 | 187 | |
duke@435 | 188 | mark_sweep_phase4(); |
duke@435 | 189 | |
duke@435 | 190 | restore_marks(); |
duke@435 | 191 | |
duke@435 | 192 | deallocate_stacks(); |
duke@435 | 193 | |
jmasa@698 | 194 | if (ZapUnusedHeapArea) { |
jmasa@698 | 195 | // Do a complete mangle (top to end) because the usage for |
jmasa@698 | 196 | // scratch does not maintain a top pointer. |
jmasa@698 | 197 | young_gen->to_space()->mangle_unused_area_complete(); |
jmasa@698 | 198 | } |
jmasa@698 | 199 | |
duke@435 | 200 | eden_empty = young_gen->eden_space()->is_empty(); |
duke@435 | 201 | if (!eden_empty) { |
duke@435 | 202 | eden_empty = absorb_live_data_from_eden(size_policy, young_gen, old_gen); |
duke@435 | 203 | } |
duke@435 | 204 | |
duke@435 | 205 | // Update heap occupancy information which is used as |
duke@435 | 206 | // input to soft ref clearing policy at the next gc. |
duke@435 | 207 | Universe::update_heap_info_at_gc(); |
duke@435 | 208 | |
duke@435 | 209 | survivors_empty = young_gen->from_space()->is_empty() && |
jmasa@698 | 210 | young_gen->to_space()->is_empty(); |
duke@435 | 211 | young_gen_empty = eden_empty && survivors_empty; |
duke@435 | 212 | |
duke@435 | 213 | BarrierSet* bs = heap->barrier_set(); |
duke@435 | 214 | if (bs->is_a(BarrierSet::ModRef)) { |
duke@435 | 215 | ModRefBarrierSet* modBS = (ModRefBarrierSet*)bs; |
duke@435 | 216 | MemRegion old_mr = heap->old_gen()->reserved(); |
duke@435 | 217 | MemRegion perm_mr = heap->perm_gen()->reserved(); |
duke@435 | 218 | assert(perm_mr.end() <= old_mr.start(), "Generations out of order"); |
duke@435 | 219 | |
duke@435 | 220 | if (young_gen_empty) { |
duke@435 | 221 | modBS->clear(MemRegion(perm_mr.start(), old_mr.end())); |
duke@435 | 222 | } else { |
duke@435 | 223 | modBS->invalidate(MemRegion(perm_mr.start(), old_mr.end())); |
duke@435 | 224 | } |
duke@435 | 225 | } |
duke@435 | 226 | |
duke@435 | 227 | BiasedLocking::restore_marks(); |
duke@435 | 228 | Threads::gc_epilogue(); |
duke@435 | 229 | CodeCache::gc_epilogue(); |
duke@435 | 230 | |
duke@435 | 231 | COMPILER2_PRESENT(DerivedPointerTable::update_pointers()); |
duke@435 | 232 | |
duke@435 | 233 | ref_processor()->enqueue_discovered_references(NULL); |
duke@435 | 234 | |
duke@435 | 235 | // Update time of last GC |
duke@435 | 236 | reset_millis_since_last_gc(); |
duke@435 | 237 | |
duke@435 | 238 | // Let the size policy know we're done |
duke@435 | 239 | size_policy->major_collection_end(old_gen->used_in_bytes(), gc_cause); |
duke@435 | 240 | |
duke@435 | 241 | if (UseAdaptiveSizePolicy) { |
duke@435 | 242 | |
duke@435 | 243 | if (PrintAdaptiveSizePolicy) { |
duke@435 | 244 | gclog_or_tty->print("AdaptiveSizeStart: "); |
duke@435 | 245 | gclog_or_tty->stamp(); |
duke@435 | 246 | gclog_or_tty->print_cr(" collection: %d ", |
duke@435 | 247 | heap->total_collections()); |
duke@435 | 248 | if (Verbose) { |
duke@435 | 249 | gclog_or_tty->print("old_gen_capacity: %d young_gen_capacity: %d" |
duke@435 | 250 | " perm_gen_capacity: %d ", |
duke@435 | 251 | old_gen->capacity_in_bytes(), young_gen->capacity_in_bytes(), |
duke@435 | 252 | perm_gen->capacity_in_bytes()); |
duke@435 | 253 | } |
duke@435 | 254 | } |
duke@435 | 255 | |
duke@435 | 256 | // Don't check if the size_policy is ready here. Let |
duke@435 | 257 | // the size_policy check that internally. |
duke@435 | 258 | if (UseAdaptiveGenerationSizePolicyAtMajorCollection && |
duke@435 | 259 | ((gc_cause != GCCause::_java_lang_system_gc) || |
duke@435 | 260 | UseAdaptiveSizePolicyWithSystemGC)) { |
duke@435 | 261 | // Calculate optimal free space amounts |
duke@435 | 262 | assert(young_gen->max_size() > |
duke@435 | 263 | young_gen->from_space()->capacity_in_bytes() + |
duke@435 | 264 | young_gen->to_space()->capacity_in_bytes(), |
duke@435 | 265 | "Sizes of space in young gen are out-of-bounds"); |
duke@435 | 266 | size_t max_eden_size = young_gen->max_size() - |
duke@435 | 267 | young_gen->from_space()->capacity_in_bytes() - |
duke@435 | 268 | young_gen->to_space()->capacity_in_bytes(); |
duke@435 | 269 | size_policy->compute_generation_free_space(young_gen->used_in_bytes(), |
duke@435 | 270 | young_gen->eden_space()->used_in_bytes(), |
duke@435 | 271 | old_gen->used_in_bytes(), |
duke@435 | 272 | perm_gen->used_in_bytes(), |
duke@435 | 273 | young_gen->eden_space()->capacity_in_bytes(), |
duke@435 | 274 | old_gen->max_gen_size(), |
duke@435 | 275 | max_eden_size, |
duke@435 | 276 | true /* full gc*/, |
duke@435 | 277 | gc_cause); |
duke@435 | 278 | |
duke@435 | 279 | heap->resize_old_gen(size_policy->calculated_old_free_size_in_bytes()); |
duke@435 | 280 | |
duke@435 | 281 | // Don't resize the young generation at an major collection. A |
duke@435 | 282 | // desired young generation size may have been calculated but |
duke@435 | 283 | // resizing the young generation complicates the code because the |
duke@435 | 284 | // resizing of the old generation may have moved the boundary |
duke@435 | 285 | // between the young generation and the old generation. Let the |
duke@435 | 286 | // young generation resizing happen at the minor collections. |
duke@435 | 287 | } |
duke@435 | 288 | if (PrintAdaptiveSizePolicy) { |
duke@435 | 289 | gclog_or_tty->print_cr("AdaptiveSizeStop: collection: %d ", |
duke@435 | 290 | heap->total_collections()); |
duke@435 | 291 | } |
duke@435 | 292 | } |
duke@435 | 293 | |
duke@435 | 294 | if (UsePerfData) { |
duke@435 | 295 | heap->gc_policy_counters()->update_counters(); |
duke@435 | 296 | heap->gc_policy_counters()->update_old_capacity( |
duke@435 | 297 | old_gen->capacity_in_bytes()); |
duke@435 | 298 | heap->gc_policy_counters()->update_young_capacity( |
duke@435 | 299 | young_gen->capacity_in_bytes()); |
duke@435 | 300 | } |
duke@435 | 301 | |
duke@435 | 302 | heap->resize_all_tlabs(); |
duke@435 | 303 | |
duke@435 | 304 | // We collected the perm gen, so we'll resize it here. |
duke@435 | 305 | perm_gen->compute_new_size(perm_gen_prev_used); |
duke@435 | 306 | |
duke@435 | 307 | if (TraceGen1Time) accumulated_time()->stop(); |
duke@435 | 308 | |
duke@435 | 309 | if (PrintGC) { |
duke@435 | 310 | if (PrintGCDetails) { |
duke@435 | 311 | // Don't print a GC timestamp here. This is after the GC so |
duke@435 | 312 | // would be confusing. |
duke@435 | 313 | young_gen->print_used_change(young_gen_prev_used); |
duke@435 | 314 | old_gen->print_used_change(old_gen_prev_used); |
duke@435 | 315 | } |
duke@435 | 316 | heap->print_heap_change(prev_used); |
duke@435 | 317 | // Do perm gen after heap becase prev_used does |
duke@435 | 318 | // not include the perm gen (done this way in the other |
duke@435 | 319 | // collectors). |
duke@435 | 320 | if (PrintGCDetails) { |
duke@435 | 321 | perm_gen->print_used_change(perm_gen_prev_used); |
duke@435 | 322 | } |
duke@435 | 323 | } |
duke@435 | 324 | |
duke@435 | 325 | // Track memory usage and detect low memory |
duke@435 | 326 | MemoryService::track_memory_usage(); |
duke@435 | 327 | heap->update_counters(); |
duke@435 | 328 | |
duke@435 | 329 | if (PrintGCDetails) { |
duke@435 | 330 | if (size_policy->print_gc_time_limit_would_be_exceeded()) { |
duke@435 | 331 | if (size_policy->gc_time_limit_exceeded()) { |
duke@435 | 332 | gclog_or_tty->print_cr(" GC time is exceeding GCTimeLimit " |
duke@435 | 333 | "of %d%%", GCTimeLimit); |
duke@435 | 334 | } else { |
duke@435 | 335 | gclog_or_tty->print_cr(" GC time would exceed GCTimeLimit " |
duke@435 | 336 | "of %d%%", GCTimeLimit); |
duke@435 | 337 | } |
duke@435 | 338 | } |
duke@435 | 339 | size_policy->set_print_gc_time_limit_would_be_exceeded(false); |
duke@435 | 340 | } |
duke@435 | 341 | } |
duke@435 | 342 | |
duke@435 | 343 | if (VerifyAfterGC && heap->total_collections() >= VerifyGCStartAt) { |
duke@435 | 344 | HandleMark hm; // Discard invalid handles created during verification |
duke@435 | 345 | gclog_or_tty->print(" VerifyAfterGC:"); |
duke@435 | 346 | Universe::verify(false); |
duke@435 | 347 | } |
duke@435 | 348 | |
duke@435 | 349 | // Re-verify object start arrays |
duke@435 | 350 | if (VerifyObjectStartArray && |
duke@435 | 351 | VerifyAfterGC) { |
duke@435 | 352 | old_gen->verify_object_start_array(); |
duke@435 | 353 | perm_gen->verify_object_start_array(); |
duke@435 | 354 | } |
duke@435 | 355 | |
jmasa@698 | 356 | if (ZapUnusedHeapArea) { |
jmasa@698 | 357 | old_gen->object_space()->check_mangled_unused_area_complete(); |
jmasa@698 | 358 | perm_gen->object_space()->check_mangled_unused_area_complete(); |
jmasa@698 | 359 | } |
jmasa@698 | 360 | |
duke@435 | 361 | NOT_PRODUCT(ref_processor()->verify_no_references_recorded()); |
duke@435 | 362 | |
duke@435 | 363 | if (PrintHeapAtGC) { |
duke@435 | 364 | Universe::print_heap_after_gc(); |
duke@435 | 365 | } |
duke@435 | 366 | } |
duke@435 | 367 | |
duke@435 | 368 | bool PSMarkSweep::absorb_live_data_from_eden(PSAdaptiveSizePolicy* size_policy, |
duke@435 | 369 | PSYoungGen* young_gen, |
duke@435 | 370 | PSOldGen* old_gen) { |
duke@435 | 371 | MutableSpace* const eden_space = young_gen->eden_space(); |
duke@435 | 372 | assert(!eden_space->is_empty(), "eden must be non-empty"); |
duke@435 | 373 | assert(young_gen->virtual_space()->alignment() == |
duke@435 | 374 | old_gen->virtual_space()->alignment(), "alignments do not match"); |
duke@435 | 375 | |
duke@435 | 376 | if (!(UseAdaptiveSizePolicy && UseAdaptiveGCBoundary)) { |
duke@435 | 377 | return false; |
duke@435 | 378 | } |
duke@435 | 379 | |
duke@435 | 380 | // Both generations must be completely committed. |
duke@435 | 381 | if (young_gen->virtual_space()->uncommitted_size() != 0) { |
duke@435 | 382 | return false; |
duke@435 | 383 | } |
duke@435 | 384 | if (old_gen->virtual_space()->uncommitted_size() != 0) { |
duke@435 | 385 | return false; |
duke@435 | 386 | } |
duke@435 | 387 | |
duke@435 | 388 | // Figure out how much to take from eden. Include the average amount promoted |
duke@435 | 389 | // in the total; otherwise the next young gen GC will simply bail out to a |
duke@435 | 390 | // full GC. |
duke@435 | 391 | const size_t alignment = old_gen->virtual_space()->alignment(); |
duke@435 | 392 | const size_t eden_used = eden_space->used_in_bytes(); |
duke@435 | 393 | const size_t promoted = (size_t)(size_policy->avg_promoted()->padded_average()); |
duke@435 | 394 | const size_t absorb_size = align_size_up(eden_used + promoted, alignment); |
duke@435 | 395 | const size_t eden_capacity = eden_space->capacity_in_bytes(); |
duke@435 | 396 | |
duke@435 | 397 | if (absorb_size >= eden_capacity) { |
duke@435 | 398 | return false; // Must leave some space in eden. |
duke@435 | 399 | } |
duke@435 | 400 | |
duke@435 | 401 | const size_t new_young_size = young_gen->capacity_in_bytes() - absorb_size; |
duke@435 | 402 | if (new_young_size < young_gen->min_gen_size()) { |
duke@435 | 403 | return false; // Respect young gen minimum size. |
duke@435 | 404 | } |
duke@435 | 405 | |
duke@435 | 406 | if (TraceAdaptiveGCBoundary && Verbose) { |
duke@435 | 407 | gclog_or_tty->print(" absorbing " SIZE_FORMAT "K: " |
duke@435 | 408 | "eden " SIZE_FORMAT "K->" SIZE_FORMAT "K " |
duke@435 | 409 | "from " SIZE_FORMAT "K, to " SIZE_FORMAT "K " |
duke@435 | 410 | "young_gen " SIZE_FORMAT "K->" SIZE_FORMAT "K ", |
duke@435 | 411 | absorb_size / K, |
duke@435 | 412 | eden_capacity / K, (eden_capacity - absorb_size) / K, |
duke@435 | 413 | young_gen->from_space()->used_in_bytes() / K, |
duke@435 | 414 | young_gen->to_space()->used_in_bytes() / K, |
duke@435 | 415 | young_gen->capacity_in_bytes() / K, new_young_size / K); |
duke@435 | 416 | } |
duke@435 | 417 | |
duke@435 | 418 | // Fill the unused part of the old gen. |
duke@435 | 419 | MutableSpace* const old_space = old_gen->object_space(); |
duke@435 | 420 | MemRegion old_gen_unused(old_space->top(), old_space->end()); |
duke@435 | 421 | |
duke@435 | 422 | // If the unused part of the old gen cannot be filled, skip |
duke@435 | 423 | // absorbing eden. |
duke@435 | 424 | if (old_gen_unused.word_size() < SharedHeap::min_fill_size()) { |
duke@435 | 425 | return false; |
duke@435 | 426 | } |
duke@435 | 427 | |
duke@435 | 428 | if (!old_gen_unused.is_empty()) { |
duke@435 | 429 | SharedHeap::fill_region_with_object(old_gen_unused); |
duke@435 | 430 | } |
duke@435 | 431 | |
duke@435 | 432 | // Take the live data from eden and set both top and end in the old gen to |
duke@435 | 433 | // eden top. (Need to set end because reset_after_change() mangles the region |
duke@435 | 434 | // from end to virtual_space->high() in debug builds). |
duke@435 | 435 | HeapWord* const new_top = eden_space->top(); |
duke@435 | 436 | old_gen->virtual_space()->expand_into(young_gen->virtual_space(), |
duke@435 | 437 | absorb_size); |
duke@435 | 438 | young_gen->reset_after_change(); |
duke@435 | 439 | old_space->set_top(new_top); |
duke@435 | 440 | old_space->set_end(new_top); |
duke@435 | 441 | old_gen->reset_after_change(); |
duke@435 | 442 | |
duke@435 | 443 | // Update the object start array for the filler object and the data from eden. |
duke@435 | 444 | ObjectStartArray* const start_array = old_gen->start_array(); |
duke@435 | 445 | HeapWord* const start = old_gen_unused.start(); |
duke@435 | 446 | for (HeapWord* addr = start; addr < new_top; addr += oop(addr)->size()) { |
duke@435 | 447 | start_array->allocate_block(addr); |
duke@435 | 448 | } |
duke@435 | 449 | |
duke@435 | 450 | // Could update the promoted average here, but it is not typically updated at |
duke@435 | 451 | // full GCs and the value to use is unclear. Something like |
duke@435 | 452 | // |
duke@435 | 453 | // cur_promoted_avg + absorb_size / number_of_scavenges_since_last_full_gc. |
duke@435 | 454 | |
duke@435 | 455 | size_policy->set_bytes_absorbed_from_eden(absorb_size); |
duke@435 | 456 | return true; |
duke@435 | 457 | } |
duke@435 | 458 | |
duke@435 | 459 | void PSMarkSweep::allocate_stacks() { |
duke@435 | 460 | ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); |
duke@435 | 461 | assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); |
duke@435 | 462 | |
duke@435 | 463 | PSYoungGen* young_gen = heap->young_gen(); |
duke@435 | 464 | |
duke@435 | 465 | MutableSpace* to_space = young_gen->to_space(); |
duke@435 | 466 | _preserved_marks = (PreservedMark*)to_space->top(); |
duke@435 | 467 | _preserved_count = 0; |
duke@435 | 468 | |
duke@435 | 469 | // We want to calculate the size in bytes first. |
duke@435 | 470 | _preserved_count_max = pointer_delta(to_space->end(), to_space->top(), sizeof(jbyte)); |
duke@435 | 471 | // Now divide by the size of a PreservedMark |
duke@435 | 472 | _preserved_count_max /= sizeof(PreservedMark); |
duke@435 | 473 | |
duke@435 | 474 | _preserved_mark_stack = NULL; |
duke@435 | 475 | _preserved_oop_stack = NULL; |
duke@435 | 476 | |
duke@435 | 477 | _marking_stack = new (ResourceObj::C_HEAP) GrowableArray<oop>(4000, true); |
duke@435 | 478 | |
duke@435 | 479 | int size = SystemDictionary::number_of_classes() * 2; |
duke@435 | 480 | _revisit_klass_stack = new (ResourceObj::C_HEAP) GrowableArray<Klass*>(size, true); |
duke@435 | 481 | } |
duke@435 | 482 | |
duke@435 | 483 | |
duke@435 | 484 | void PSMarkSweep::deallocate_stacks() { |
duke@435 | 485 | if (_preserved_oop_stack) { |
duke@435 | 486 | delete _preserved_mark_stack; |
duke@435 | 487 | _preserved_mark_stack = NULL; |
duke@435 | 488 | delete _preserved_oop_stack; |
duke@435 | 489 | _preserved_oop_stack = NULL; |
duke@435 | 490 | } |
duke@435 | 491 | |
duke@435 | 492 | delete _marking_stack; |
duke@435 | 493 | delete _revisit_klass_stack; |
duke@435 | 494 | } |
duke@435 | 495 | |
duke@435 | 496 | void PSMarkSweep::mark_sweep_phase1(bool clear_all_softrefs) { |
duke@435 | 497 | // Recursively traverse all live objects and mark them |
duke@435 | 498 | EventMark m("1 mark object"); |
duke@435 | 499 | TraceTime tm("phase 1", PrintGCDetails && Verbose, true, gclog_or_tty); |
duke@435 | 500 | trace(" 1"); |
duke@435 | 501 | |
duke@435 | 502 | ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); |
duke@435 | 503 | assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); |
duke@435 | 504 | |
duke@435 | 505 | // General strong roots. |
duke@435 | 506 | Universe::oops_do(mark_and_push_closure()); |
duke@435 | 507 | ReferenceProcessor::oops_do(mark_and_push_closure()); |
duke@435 | 508 | JNIHandles::oops_do(mark_and_push_closure()); // Global (strong) JNI handles |
duke@435 | 509 | Threads::oops_do(mark_and_push_closure()); |
duke@435 | 510 | ObjectSynchronizer::oops_do(mark_and_push_closure()); |
duke@435 | 511 | FlatProfiler::oops_do(mark_and_push_closure()); |
duke@435 | 512 | Management::oops_do(mark_and_push_closure()); |
duke@435 | 513 | JvmtiExport::oops_do(mark_and_push_closure()); |
duke@435 | 514 | SystemDictionary::always_strong_oops_do(mark_and_push_closure()); |
duke@435 | 515 | vmSymbols::oops_do(mark_and_push_closure()); |
duke@435 | 516 | |
duke@435 | 517 | // Flush marking stack. |
duke@435 | 518 | follow_stack(); |
duke@435 | 519 | |
duke@435 | 520 | // Process reference objects found during marking |
duke@435 | 521 | |
duke@435 | 522 | // Skipping the reference processing for VerifyParallelOldWithMarkSweep |
duke@435 | 523 | // affects the marking (makes it different). |
duke@435 | 524 | { |
duke@435 | 525 | ReferencePolicy *soft_ref_policy; |
duke@435 | 526 | if (clear_all_softrefs) { |
duke@435 | 527 | soft_ref_policy = new AlwaysClearPolicy(); |
duke@435 | 528 | } else { |
duke@435 | 529 | #ifdef COMPILER2 |
duke@435 | 530 | soft_ref_policy = new LRUMaxHeapPolicy(); |
duke@435 | 531 | #else |
duke@435 | 532 | soft_ref_policy = new LRUCurrentHeapPolicy(); |
duke@435 | 533 | #endif // COMPILER2 |
duke@435 | 534 | } |
duke@435 | 535 | assert(soft_ref_policy != NULL,"No soft reference policy"); |
duke@435 | 536 | ref_processor()->process_discovered_references( |
duke@435 | 537 | soft_ref_policy, is_alive_closure(), mark_and_push_closure(), |
duke@435 | 538 | follow_stack_closure(), NULL); |
duke@435 | 539 | } |
duke@435 | 540 | |
duke@435 | 541 | // Follow system dictionary roots and unload classes |
duke@435 | 542 | bool purged_class = SystemDictionary::do_unloading(is_alive_closure()); |
duke@435 | 543 | |
duke@435 | 544 | // Follow code cache roots |
duke@435 | 545 | CodeCache::do_unloading(is_alive_closure(), mark_and_push_closure(), |
duke@435 | 546 | purged_class); |
duke@435 | 547 | follow_stack(); // Flush marking stack |
duke@435 | 548 | |
duke@435 | 549 | // Update subklass/sibling/implementor links of live klasses |
duke@435 | 550 | follow_weak_klass_links(); |
duke@435 | 551 | assert(_marking_stack->is_empty(), "just drained"); |
duke@435 | 552 | |
duke@435 | 553 | // Visit symbol and interned string tables and delete unmarked oops |
duke@435 | 554 | SymbolTable::unlink(is_alive_closure()); |
duke@435 | 555 | StringTable::unlink(is_alive_closure()); |
duke@435 | 556 | |
duke@435 | 557 | assert(_marking_stack->is_empty(), "stack should be empty by now"); |
duke@435 | 558 | } |
duke@435 | 559 | |
duke@435 | 560 | |
duke@435 | 561 | void PSMarkSweep::mark_sweep_phase2() { |
duke@435 | 562 | EventMark m("2 compute new addresses"); |
duke@435 | 563 | TraceTime tm("phase 2", PrintGCDetails && Verbose, true, gclog_or_tty); |
duke@435 | 564 | trace("2"); |
duke@435 | 565 | |
duke@435 | 566 | // Now all live objects are marked, compute the new object addresses. |
duke@435 | 567 | |
duke@435 | 568 | // It is imperative that we traverse perm_gen LAST. If dead space is |
duke@435 | 569 | // allowed a range of dead object may get overwritten by a dead int |
duke@435 | 570 | // array. If perm_gen is not traversed last a klassOop may get |
duke@435 | 571 | // overwritten. This is fine since it is dead, but if the class has dead |
duke@435 | 572 | // instances we have to skip them, and in order to find their size we |
duke@435 | 573 | // need the klassOop! |
duke@435 | 574 | // |
duke@435 | 575 | // It is not required that we traverse spaces in the same order in |
duke@435 | 576 | // phase2, phase3 and phase4, but the ValidateMarkSweep live oops |
duke@435 | 577 | // tracking expects us to do so. See comment under phase4. |
duke@435 | 578 | |
duke@435 | 579 | ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); |
duke@435 | 580 | assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); |
duke@435 | 581 | |
duke@435 | 582 | PSOldGen* old_gen = heap->old_gen(); |
duke@435 | 583 | PSPermGen* perm_gen = heap->perm_gen(); |
duke@435 | 584 | |
duke@435 | 585 | // Begin compacting into the old gen |
duke@435 | 586 | PSMarkSweepDecorator::set_destination_decorator_tenured(); |
duke@435 | 587 | |
duke@435 | 588 | // This will also compact the young gen spaces. |
duke@435 | 589 | old_gen->precompact(); |
duke@435 | 590 | |
duke@435 | 591 | // Compact the perm gen into the perm gen |
duke@435 | 592 | PSMarkSweepDecorator::set_destination_decorator_perm_gen(); |
duke@435 | 593 | |
duke@435 | 594 | perm_gen->precompact(); |
duke@435 | 595 | } |
duke@435 | 596 | |
duke@435 | 597 | // This should be moved to the shared markSweep code! |
duke@435 | 598 | class PSAlwaysTrueClosure: public BoolObjectClosure { |
duke@435 | 599 | public: |
duke@435 | 600 | void do_object(oop p) { ShouldNotReachHere(); } |
duke@435 | 601 | bool do_object_b(oop p) { return true; } |
duke@435 | 602 | }; |
duke@435 | 603 | static PSAlwaysTrueClosure always_true; |
duke@435 | 604 | |
duke@435 | 605 | void PSMarkSweep::mark_sweep_phase3() { |
duke@435 | 606 | // Adjust the pointers to reflect the new locations |
duke@435 | 607 | EventMark m("3 adjust pointers"); |
duke@435 | 608 | TraceTime tm("phase 3", PrintGCDetails && Verbose, true, gclog_or_tty); |
duke@435 | 609 | trace("3"); |
duke@435 | 610 | |
duke@435 | 611 | ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); |
duke@435 | 612 | assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); |
duke@435 | 613 | |
duke@435 | 614 | PSYoungGen* young_gen = heap->young_gen(); |
duke@435 | 615 | PSOldGen* old_gen = heap->old_gen(); |
duke@435 | 616 | PSPermGen* perm_gen = heap->perm_gen(); |
duke@435 | 617 | |
duke@435 | 618 | // General strong roots. |
duke@435 | 619 | Universe::oops_do(adjust_root_pointer_closure()); |
duke@435 | 620 | ReferenceProcessor::oops_do(adjust_root_pointer_closure()); |
duke@435 | 621 | JNIHandles::oops_do(adjust_root_pointer_closure()); // Global (strong) JNI handles |
duke@435 | 622 | Threads::oops_do(adjust_root_pointer_closure()); |
duke@435 | 623 | ObjectSynchronizer::oops_do(adjust_root_pointer_closure()); |
duke@435 | 624 | FlatProfiler::oops_do(adjust_root_pointer_closure()); |
duke@435 | 625 | Management::oops_do(adjust_root_pointer_closure()); |
duke@435 | 626 | JvmtiExport::oops_do(adjust_root_pointer_closure()); |
duke@435 | 627 | // SO_AllClasses |
duke@435 | 628 | SystemDictionary::oops_do(adjust_root_pointer_closure()); |
duke@435 | 629 | vmSymbols::oops_do(adjust_root_pointer_closure()); |
duke@435 | 630 | |
duke@435 | 631 | // Now adjust pointers in remaining weak roots. (All of which should |
duke@435 | 632 | // have been cleared if they pointed to non-surviving objects.) |
duke@435 | 633 | // Global (weak) JNI handles |
duke@435 | 634 | JNIHandles::weak_oops_do(&always_true, adjust_root_pointer_closure()); |
duke@435 | 635 | |
duke@435 | 636 | CodeCache::oops_do(adjust_pointer_closure()); |
duke@435 | 637 | SymbolTable::oops_do(adjust_root_pointer_closure()); |
duke@435 | 638 | StringTable::oops_do(adjust_root_pointer_closure()); |
duke@435 | 639 | ref_processor()->weak_oops_do(adjust_root_pointer_closure()); |
duke@435 | 640 | PSScavenge::reference_processor()->weak_oops_do(adjust_root_pointer_closure()); |
duke@435 | 641 | |
duke@435 | 642 | adjust_marks(); |
duke@435 | 643 | |
duke@435 | 644 | young_gen->adjust_pointers(); |
duke@435 | 645 | old_gen->adjust_pointers(); |
duke@435 | 646 | perm_gen->adjust_pointers(); |
duke@435 | 647 | } |
duke@435 | 648 | |
duke@435 | 649 | void PSMarkSweep::mark_sweep_phase4() { |
duke@435 | 650 | EventMark m("4 compact heap"); |
duke@435 | 651 | TraceTime tm("phase 4", PrintGCDetails && Verbose, true, gclog_or_tty); |
duke@435 | 652 | trace("4"); |
duke@435 | 653 | |
duke@435 | 654 | // All pointers are now adjusted, move objects accordingly |
duke@435 | 655 | |
duke@435 | 656 | // It is imperative that we traverse perm_gen first in phase4. All |
duke@435 | 657 | // classes must be allocated earlier than their instances, and traversing |
duke@435 | 658 | // perm_gen first makes sure that all klassOops have moved to their new |
duke@435 | 659 | // location before any instance does a dispatch through it's klass! |
duke@435 | 660 | ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); |
duke@435 | 661 | assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); |
duke@435 | 662 | |
duke@435 | 663 | PSYoungGen* young_gen = heap->young_gen(); |
duke@435 | 664 | PSOldGen* old_gen = heap->old_gen(); |
duke@435 | 665 | PSPermGen* perm_gen = heap->perm_gen(); |
duke@435 | 666 | |
duke@435 | 667 | perm_gen->compact(); |
duke@435 | 668 | old_gen->compact(); |
duke@435 | 669 | young_gen->compact(); |
duke@435 | 670 | } |
duke@435 | 671 | |
duke@435 | 672 | jlong PSMarkSweep::millis_since_last_gc() { |
duke@435 | 673 | jlong ret_val = os::javaTimeMillis() - _time_of_last_gc; |
duke@435 | 674 | // XXX See note in genCollectedHeap::millis_since_last_gc(). |
duke@435 | 675 | if (ret_val < 0) { |
duke@435 | 676 | NOT_PRODUCT(warning("time warp: %d", ret_val);) |
duke@435 | 677 | return 0; |
duke@435 | 678 | } |
duke@435 | 679 | return ret_val; |
duke@435 | 680 | } |
duke@435 | 681 | |
duke@435 | 682 | void PSMarkSweep::reset_millis_since_last_gc() { |
duke@435 | 683 | _time_of_last_gc = os::javaTimeMillis(); |
duke@435 | 684 | } |