Tue, 22 Mar 2011 13:36:33 -0700
6962931: move interned strings out of the perm gen
Reviewed-by: never, coleenp, ysr, jwilhelm
duke@435 | 1 | /* |
ysr@2651 | 2 | * Copyright (c) 2002, 2011, 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" |
jcoomes@2661 | 26 | #include "classfile/symbolTable.hpp" |
stefank@2314 | 27 | #include "gc_implementation/parallelScavenge/cardTableExtension.hpp" |
stefank@2314 | 28 | #include "gc_implementation/parallelScavenge/gcTaskManager.hpp" |
stefank@2314 | 29 | #include "gc_implementation/parallelScavenge/generationSizer.hpp" |
stefank@2314 | 30 | #include "gc_implementation/parallelScavenge/parallelScavengeHeap.hpp" |
stefank@2314 | 31 | #include "gc_implementation/parallelScavenge/psAdaptiveSizePolicy.hpp" |
stefank@2314 | 32 | #include "gc_implementation/parallelScavenge/psMarkSweep.hpp" |
stefank@2314 | 33 | #include "gc_implementation/parallelScavenge/psParallelCompact.hpp" |
stefank@2314 | 34 | #include "gc_implementation/parallelScavenge/psScavenge.inline.hpp" |
stefank@2314 | 35 | #include "gc_implementation/parallelScavenge/psTasks.hpp" |
stefank@2314 | 36 | #include "gc_implementation/shared/isGCActiveMark.hpp" |
stefank@2314 | 37 | #include "gc_implementation/shared/spaceDecorator.hpp" |
stefank@2314 | 38 | #include "gc_interface/gcCause.hpp" |
stefank@2314 | 39 | #include "memory/collectorPolicy.hpp" |
stefank@2314 | 40 | #include "memory/gcLocker.inline.hpp" |
stefank@2314 | 41 | #include "memory/referencePolicy.hpp" |
stefank@2314 | 42 | #include "memory/referenceProcessor.hpp" |
stefank@2314 | 43 | #include "memory/resourceArea.hpp" |
stefank@2314 | 44 | #include "oops/oop.inline.hpp" |
stefank@2314 | 45 | #include "oops/oop.psgc.inline.hpp" |
stefank@2314 | 46 | #include "runtime/biasedLocking.hpp" |
stefank@2314 | 47 | #include "runtime/fprofiler.hpp" |
stefank@2314 | 48 | #include "runtime/handles.inline.hpp" |
stefank@2314 | 49 | #include "runtime/threadCritical.hpp" |
stefank@2314 | 50 | #include "runtime/vmThread.hpp" |
stefank@2314 | 51 | #include "runtime/vm_operations.hpp" |
stefank@2314 | 52 | #include "services/memoryService.hpp" |
stefank@2314 | 53 | #include "utilities/stack.inline.hpp" |
duke@435 | 54 | |
duke@435 | 55 | |
duke@435 | 56 | HeapWord* PSScavenge::_to_space_top_before_gc = NULL; |
duke@435 | 57 | int PSScavenge::_consecutive_skipped_scavenges = 0; |
duke@435 | 58 | ReferenceProcessor* PSScavenge::_ref_processor = NULL; |
duke@435 | 59 | CardTableExtension* PSScavenge::_card_table = NULL; |
duke@435 | 60 | bool PSScavenge::_survivor_overflow = false; |
duke@435 | 61 | int PSScavenge::_tenuring_threshold = 0; |
duke@435 | 62 | HeapWord* PSScavenge::_young_generation_boundary = NULL; |
duke@435 | 63 | elapsedTimer PSScavenge::_accumulated_time; |
jcoomes@2191 | 64 | Stack<markOop> PSScavenge::_preserved_mark_stack; |
jcoomes@2191 | 65 | Stack<oop> PSScavenge::_preserved_oop_stack; |
duke@435 | 66 | CollectorCounters* PSScavenge::_counters = NULL; |
jcoomes@2191 | 67 | bool PSScavenge::_promotion_failed = false; |
duke@435 | 68 | |
duke@435 | 69 | // Define before use |
duke@435 | 70 | class PSIsAliveClosure: public BoolObjectClosure { |
duke@435 | 71 | public: |
duke@435 | 72 | void do_object(oop p) { |
duke@435 | 73 | assert(false, "Do not call."); |
duke@435 | 74 | } |
duke@435 | 75 | bool do_object_b(oop p) { |
duke@435 | 76 | return (!PSScavenge::is_obj_in_young((HeapWord*) p)) || p->is_forwarded(); |
duke@435 | 77 | } |
duke@435 | 78 | }; |
duke@435 | 79 | |
duke@435 | 80 | PSIsAliveClosure PSScavenge::_is_alive_closure; |
duke@435 | 81 | |
duke@435 | 82 | class PSKeepAliveClosure: public OopClosure { |
duke@435 | 83 | protected: |
duke@435 | 84 | MutableSpace* _to_space; |
duke@435 | 85 | PSPromotionManager* _promotion_manager; |
duke@435 | 86 | |
duke@435 | 87 | public: |
duke@435 | 88 | PSKeepAliveClosure(PSPromotionManager* pm) : _promotion_manager(pm) { |
duke@435 | 89 | ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); |
duke@435 | 90 | assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); |
duke@435 | 91 | _to_space = heap->young_gen()->to_space(); |
duke@435 | 92 | |
duke@435 | 93 | assert(_promotion_manager != NULL, "Sanity"); |
duke@435 | 94 | } |
duke@435 | 95 | |
coleenp@548 | 96 | template <class T> void do_oop_work(T* p) { |
coleenp@548 | 97 | assert (!oopDesc::is_null(*p), "expected non-null ref"); |
coleenp@548 | 98 | assert ((oopDesc::load_decode_heap_oop_not_null(p))->is_oop(), |
coleenp@548 | 99 | "expected an oop while scanning weak refs"); |
duke@435 | 100 | |
duke@435 | 101 | // Weak refs may be visited more than once. |
coleenp@548 | 102 | if (PSScavenge::should_scavenge(p, _to_space)) { |
duke@435 | 103 | PSScavenge::copy_and_push_safe_barrier(_promotion_manager, p); |
duke@435 | 104 | } |
duke@435 | 105 | } |
coleenp@548 | 106 | virtual void do_oop(oop* p) { PSKeepAliveClosure::do_oop_work(p); } |
coleenp@548 | 107 | virtual void do_oop(narrowOop* p) { PSKeepAliveClosure::do_oop_work(p); } |
duke@435 | 108 | }; |
duke@435 | 109 | |
duke@435 | 110 | class PSEvacuateFollowersClosure: public VoidClosure { |
duke@435 | 111 | private: |
duke@435 | 112 | PSPromotionManager* _promotion_manager; |
duke@435 | 113 | public: |
duke@435 | 114 | PSEvacuateFollowersClosure(PSPromotionManager* pm) : _promotion_manager(pm) {} |
duke@435 | 115 | |
coleenp@548 | 116 | virtual void do_void() { |
duke@435 | 117 | assert(_promotion_manager != NULL, "Sanity"); |
duke@435 | 118 | _promotion_manager->drain_stacks(true); |
duke@435 | 119 | guarantee(_promotion_manager->stacks_empty(), |
duke@435 | 120 | "stacks should be empty at this point"); |
duke@435 | 121 | } |
duke@435 | 122 | }; |
duke@435 | 123 | |
duke@435 | 124 | class PSPromotionFailedClosure : public ObjectClosure { |
duke@435 | 125 | virtual void do_object(oop obj) { |
duke@435 | 126 | if (obj->is_forwarded()) { |
duke@435 | 127 | obj->init_mark(); |
duke@435 | 128 | } |
duke@435 | 129 | } |
duke@435 | 130 | }; |
duke@435 | 131 | |
duke@435 | 132 | class PSRefProcTaskProxy: public GCTask { |
duke@435 | 133 | typedef AbstractRefProcTaskExecutor::ProcessTask ProcessTask; |
duke@435 | 134 | ProcessTask & _rp_task; |
duke@435 | 135 | uint _work_id; |
duke@435 | 136 | public: |
duke@435 | 137 | PSRefProcTaskProxy(ProcessTask & rp_task, uint work_id) |
duke@435 | 138 | : _rp_task(rp_task), |
duke@435 | 139 | _work_id(work_id) |
duke@435 | 140 | { } |
duke@435 | 141 | |
duke@435 | 142 | private: |
duke@435 | 143 | virtual char* name() { return (char *)"Process referents by policy in parallel"; } |
duke@435 | 144 | virtual void do_it(GCTaskManager* manager, uint which); |
duke@435 | 145 | }; |
duke@435 | 146 | |
duke@435 | 147 | void PSRefProcTaskProxy::do_it(GCTaskManager* manager, uint which) |
duke@435 | 148 | { |
duke@435 | 149 | PSPromotionManager* promotion_manager = |
duke@435 | 150 | PSPromotionManager::gc_thread_promotion_manager(which); |
duke@435 | 151 | assert(promotion_manager != NULL, "sanity check"); |
duke@435 | 152 | PSKeepAliveClosure keep_alive(promotion_manager); |
duke@435 | 153 | PSEvacuateFollowersClosure evac_followers(promotion_manager); |
duke@435 | 154 | PSIsAliveClosure is_alive; |
duke@435 | 155 | _rp_task.work(_work_id, is_alive, keep_alive, evac_followers); |
duke@435 | 156 | } |
duke@435 | 157 | |
duke@435 | 158 | class PSRefEnqueueTaskProxy: public GCTask { |
duke@435 | 159 | typedef AbstractRefProcTaskExecutor::EnqueueTask EnqueueTask; |
duke@435 | 160 | EnqueueTask& _enq_task; |
duke@435 | 161 | uint _work_id; |
duke@435 | 162 | |
duke@435 | 163 | public: |
duke@435 | 164 | PSRefEnqueueTaskProxy(EnqueueTask& enq_task, uint work_id) |
duke@435 | 165 | : _enq_task(enq_task), |
duke@435 | 166 | _work_id(work_id) |
duke@435 | 167 | { } |
duke@435 | 168 | |
duke@435 | 169 | virtual char* name() { return (char *)"Enqueue reference objects in parallel"; } |
duke@435 | 170 | virtual void do_it(GCTaskManager* manager, uint which) |
duke@435 | 171 | { |
duke@435 | 172 | _enq_task.work(_work_id); |
duke@435 | 173 | } |
duke@435 | 174 | }; |
duke@435 | 175 | |
duke@435 | 176 | class PSRefProcTaskExecutor: public AbstractRefProcTaskExecutor { |
duke@435 | 177 | virtual void execute(ProcessTask& task); |
duke@435 | 178 | virtual void execute(EnqueueTask& task); |
duke@435 | 179 | }; |
duke@435 | 180 | |
duke@435 | 181 | void PSRefProcTaskExecutor::execute(ProcessTask& task) |
duke@435 | 182 | { |
duke@435 | 183 | GCTaskQueue* q = GCTaskQueue::create(); |
duke@435 | 184 | for(uint i=0; i<ParallelGCThreads; i++) { |
duke@435 | 185 | q->enqueue(new PSRefProcTaskProxy(task, i)); |
duke@435 | 186 | } |
duke@435 | 187 | ParallelTaskTerminator terminator( |
tonyp@2061 | 188 | ParallelScavengeHeap::gc_task_manager()->workers(), |
tonyp@2061 | 189 | (TaskQueueSetSuper*) PSPromotionManager::stack_array_depth()); |
duke@435 | 190 | if (task.marks_oops_alive() && ParallelGCThreads > 1) { |
duke@435 | 191 | for (uint j=0; j<ParallelGCThreads; j++) { |
duke@435 | 192 | q->enqueue(new StealTask(&terminator)); |
duke@435 | 193 | } |
duke@435 | 194 | } |
duke@435 | 195 | ParallelScavengeHeap::gc_task_manager()->execute_and_wait(q); |
duke@435 | 196 | } |
duke@435 | 197 | |
duke@435 | 198 | |
duke@435 | 199 | void PSRefProcTaskExecutor::execute(EnqueueTask& task) |
duke@435 | 200 | { |
duke@435 | 201 | GCTaskQueue* q = GCTaskQueue::create(); |
duke@435 | 202 | for(uint i=0; i<ParallelGCThreads; i++) { |
duke@435 | 203 | q->enqueue(new PSRefEnqueueTaskProxy(task, i)); |
duke@435 | 204 | } |
duke@435 | 205 | ParallelScavengeHeap::gc_task_manager()->execute_and_wait(q); |
duke@435 | 206 | } |
duke@435 | 207 | |
duke@435 | 208 | // This method contains all heap specific policy for invoking scavenge. |
duke@435 | 209 | // PSScavenge::invoke_no_policy() will do nothing but attempt to |
duke@435 | 210 | // scavenge. It will not clean up after failed promotions, bail out if |
duke@435 | 211 | // we've exceeded policy time limits, or any other special behavior. |
duke@435 | 212 | // All such policy should be placed here. |
duke@435 | 213 | // |
duke@435 | 214 | // Note that this method should only be called from the vm_thread while |
duke@435 | 215 | // at a safepoint! |
jmasa@1822 | 216 | void PSScavenge::invoke() { |
duke@435 | 217 | assert(SafepointSynchronize::is_at_safepoint(), "should be at safepoint"); |
duke@435 | 218 | assert(Thread::current() == (Thread*)VMThread::vm_thread(), "should be in vm thread"); |
duke@435 | 219 | assert(!Universe::heap()->is_gc_active(), "not reentrant"); |
duke@435 | 220 | |
duke@435 | 221 | ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); |
duke@435 | 222 | assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); |
duke@435 | 223 | |
duke@435 | 224 | PSAdaptiveSizePolicy* policy = heap->size_policy(); |
jmasa@1822 | 225 | IsGCActiveMark mark; |
duke@435 | 226 | |
jmasa@1822 | 227 | bool scavenge_was_done = PSScavenge::invoke_no_policy(); |
duke@435 | 228 | |
jmasa@1822 | 229 | PSGCAdaptivePolicyCounters* counters = heap->gc_policy_counters(); |
jmasa@1822 | 230 | if (UsePerfData) |
jmasa@1822 | 231 | counters->update_full_follows_scavenge(0); |
jmasa@1822 | 232 | if (!scavenge_was_done || |
jmasa@1822 | 233 | policy->should_full_GC(heap->old_gen()->free_in_bytes())) { |
jmasa@1822 | 234 | if (UsePerfData) |
jmasa@1822 | 235 | counters->update_full_follows_scavenge(full_follows_scavenge); |
jmasa@1822 | 236 | GCCauseSetter gccs(heap, GCCause::_adaptive_size_policy); |
jmasa@1822 | 237 | CollectorPolicy* cp = heap->collector_policy(); |
jmasa@1822 | 238 | const bool clear_all_softrefs = cp->should_clear_all_soft_refs(); |
duke@435 | 239 | |
jmasa@1822 | 240 | if (UseParallelOldGC) { |
jmasa@1822 | 241 | PSParallelCompact::invoke_no_policy(clear_all_softrefs); |
jmasa@1822 | 242 | } else { |
jmasa@1822 | 243 | PSMarkSweep::invoke_no_policy(clear_all_softrefs); |
duke@435 | 244 | } |
duke@435 | 245 | } |
duke@435 | 246 | } |
duke@435 | 247 | |
duke@435 | 248 | // This method contains no policy. You should probably |
duke@435 | 249 | // be calling invoke() instead. |
duke@435 | 250 | bool PSScavenge::invoke_no_policy() { |
duke@435 | 251 | assert(SafepointSynchronize::is_at_safepoint(), "should be at safepoint"); |
duke@435 | 252 | assert(Thread::current() == (Thread*)VMThread::vm_thread(), "should be in vm thread"); |
duke@435 | 253 | |
jcoomes@2191 | 254 | assert(_preserved_mark_stack.is_empty(), "should be empty"); |
jcoomes@2191 | 255 | assert(_preserved_oop_stack.is_empty(), "should be empty"); |
jcoomes@2191 | 256 | |
duke@435 | 257 | TimeStamp scavenge_entry; |
duke@435 | 258 | TimeStamp scavenge_midpoint; |
duke@435 | 259 | TimeStamp scavenge_exit; |
duke@435 | 260 | |
duke@435 | 261 | scavenge_entry.update(); |
duke@435 | 262 | |
duke@435 | 263 | if (GC_locker::check_active_before_gc()) { |
duke@435 | 264 | return false; |
duke@435 | 265 | } |
duke@435 | 266 | |
duke@435 | 267 | ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); |
duke@435 | 268 | GCCause::Cause gc_cause = heap->gc_cause(); |
duke@435 | 269 | assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); |
duke@435 | 270 | |
duke@435 | 271 | // Check for potential problems. |
duke@435 | 272 | if (!should_attempt_scavenge()) { |
duke@435 | 273 | return false; |
duke@435 | 274 | } |
duke@435 | 275 | |
duke@435 | 276 | bool promotion_failure_occurred = false; |
duke@435 | 277 | |
duke@435 | 278 | PSYoungGen* young_gen = heap->young_gen(); |
duke@435 | 279 | PSOldGen* old_gen = heap->old_gen(); |
duke@435 | 280 | PSPermGen* perm_gen = heap->perm_gen(); |
duke@435 | 281 | PSAdaptiveSizePolicy* size_policy = heap->size_policy(); |
duke@435 | 282 | heap->increment_total_collections(); |
duke@435 | 283 | |
duke@435 | 284 | AdaptiveSizePolicyOutput(size_policy, heap->total_collections()); |
duke@435 | 285 | |
duke@435 | 286 | if ((gc_cause != GCCause::_java_lang_system_gc) || |
duke@435 | 287 | UseAdaptiveSizePolicyWithSystemGC) { |
duke@435 | 288 | // Gather the feedback data for eden occupancy. |
duke@435 | 289 | young_gen->eden_space()->accumulate_statistics(); |
duke@435 | 290 | } |
duke@435 | 291 | |
jmasa@698 | 292 | if (ZapUnusedHeapArea) { |
jmasa@698 | 293 | // Save information needed to minimize mangling |
jmasa@698 | 294 | heap->record_gen_tops_before_GC(); |
jmasa@698 | 295 | } |
jmasa@698 | 296 | |
duke@435 | 297 | if (PrintHeapAtGC) { |
duke@435 | 298 | Universe::print_heap_before_gc(); |
duke@435 | 299 | } |
duke@435 | 300 | |
duke@435 | 301 | assert(!NeverTenure || _tenuring_threshold == markOopDesc::max_age + 1, "Sanity"); |
duke@435 | 302 | assert(!AlwaysTenure || _tenuring_threshold == 0, "Sanity"); |
duke@435 | 303 | |
duke@435 | 304 | size_t prev_used = heap->used(); |
duke@435 | 305 | assert(promotion_failed() == false, "Sanity"); |
duke@435 | 306 | |
duke@435 | 307 | // Fill in TLABs |
duke@435 | 308 | heap->accumulate_statistics_all_tlabs(); |
duke@435 | 309 | heap->ensure_parsability(true); // retire TLABs |
duke@435 | 310 | |
duke@435 | 311 | if (VerifyBeforeGC && heap->total_collections() >= VerifyGCStartAt) { |
duke@435 | 312 | HandleMark hm; // Discard invalid handles created during verification |
duke@435 | 313 | gclog_or_tty->print(" VerifyBeforeGC:"); |
duke@435 | 314 | Universe::verify(true); |
duke@435 | 315 | } |
duke@435 | 316 | |
duke@435 | 317 | { |
duke@435 | 318 | ResourceMark rm; |
duke@435 | 319 | HandleMark hm; |
duke@435 | 320 | |
duke@435 | 321 | gclog_or_tty->date_stamp(PrintGC && PrintGCDateStamps); |
duke@435 | 322 | TraceCPUTime tcpu(PrintGCDetails, true, gclog_or_tty); |
duke@435 | 323 | TraceTime t1("GC", PrintGC, !PrintGCDetails, gclog_or_tty); |
duke@435 | 324 | TraceCollectorStats tcs(counters()); |
duke@435 | 325 | TraceMemoryManagerStats tms(false /* not full GC */); |
duke@435 | 326 | |
duke@435 | 327 | if (TraceGen0Time) accumulated_time()->start(); |
duke@435 | 328 | |
duke@435 | 329 | // Let the size policy know we're starting |
duke@435 | 330 | size_policy->minor_collection_begin(); |
duke@435 | 331 | |
duke@435 | 332 | // Verify the object start arrays. |
duke@435 | 333 | if (VerifyObjectStartArray && |
duke@435 | 334 | VerifyBeforeGC) { |
duke@435 | 335 | old_gen->verify_object_start_array(); |
duke@435 | 336 | perm_gen->verify_object_start_array(); |
duke@435 | 337 | } |
duke@435 | 338 | |
duke@435 | 339 | // Verify no unmarked old->young roots |
duke@435 | 340 | if (VerifyRememberedSets) { |
duke@435 | 341 | CardTableExtension::verify_all_young_refs_imprecise(); |
duke@435 | 342 | } |
duke@435 | 343 | |
duke@435 | 344 | if (!ScavengeWithObjectsInToSpace) { |
duke@435 | 345 | assert(young_gen->to_space()->is_empty(), |
duke@435 | 346 | "Attempt to scavenge with live objects in to_space"); |
jmasa@698 | 347 | young_gen->to_space()->clear(SpaceDecorator::Mangle); |
duke@435 | 348 | } else if (ZapUnusedHeapArea) { |
duke@435 | 349 | young_gen->to_space()->mangle_unused_area(); |
duke@435 | 350 | } |
duke@435 | 351 | save_to_space_top_before_gc(); |
duke@435 | 352 | |
duke@435 | 353 | NOT_PRODUCT(reference_processor()->verify_no_references_recorded()); |
duke@435 | 354 | COMPILER2_PRESENT(DerivedPointerTable::clear()); |
duke@435 | 355 | |
duke@435 | 356 | reference_processor()->enable_discovery(); |
ysr@892 | 357 | reference_processor()->setup_policy(false); |
duke@435 | 358 | |
duke@435 | 359 | // We track how much was promoted to the next generation for |
duke@435 | 360 | // the AdaptiveSizePolicy. |
duke@435 | 361 | size_t old_gen_used_before = old_gen->used_in_bytes(); |
duke@435 | 362 | |
duke@435 | 363 | // For PrintGCDetails |
duke@435 | 364 | size_t young_gen_used_before = young_gen->used_in_bytes(); |
duke@435 | 365 | |
duke@435 | 366 | // Reset our survivor overflow. |
duke@435 | 367 | set_survivor_overflow(false); |
duke@435 | 368 | |
duke@435 | 369 | // We need to save the old/perm top values before |
duke@435 | 370 | // creating the promotion_manager. We pass the top |
duke@435 | 371 | // values to the card_table, to prevent it from |
duke@435 | 372 | // straying into the promotion labs. |
duke@435 | 373 | HeapWord* old_top = old_gen->object_space()->top(); |
duke@435 | 374 | HeapWord* perm_top = perm_gen->object_space()->top(); |
duke@435 | 375 | |
duke@435 | 376 | // Release all previously held resources |
duke@435 | 377 | gc_task_manager()->release_all_resources(); |
duke@435 | 378 | |
duke@435 | 379 | PSPromotionManager::pre_scavenge(); |
duke@435 | 380 | |
duke@435 | 381 | // We'll use the promotion manager again later. |
duke@435 | 382 | PSPromotionManager* promotion_manager = PSPromotionManager::vm_thread_promotion_manager(); |
duke@435 | 383 | { |
duke@435 | 384 | // TraceTime("Roots"); |
jrose@1424 | 385 | ParallelScavengeHeap::ParStrongRootsScope psrs; |
duke@435 | 386 | |
duke@435 | 387 | GCTaskQueue* q = GCTaskQueue::create(); |
duke@435 | 388 | |
duke@435 | 389 | for(uint i=0; i<ParallelGCThreads; i++) { |
duke@435 | 390 | q->enqueue(new OldToYoungRootsTask(old_gen, old_top, i)); |
duke@435 | 391 | } |
duke@435 | 392 | |
duke@435 | 393 | q->enqueue(new SerialOldToYoungRootsTask(perm_gen, perm_top)); |
duke@435 | 394 | |
duke@435 | 395 | q->enqueue(new ScavengeRootsTask(ScavengeRootsTask::universe)); |
duke@435 | 396 | q->enqueue(new ScavengeRootsTask(ScavengeRootsTask::jni_handles)); |
duke@435 | 397 | // We scan the thread roots in parallel |
duke@435 | 398 | Threads::create_thread_roots_tasks(q); |
duke@435 | 399 | q->enqueue(new ScavengeRootsTask(ScavengeRootsTask::object_synchronizer)); |
duke@435 | 400 | q->enqueue(new ScavengeRootsTask(ScavengeRootsTask::flat_profiler)); |
duke@435 | 401 | q->enqueue(new ScavengeRootsTask(ScavengeRootsTask::management)); |
duke@435 | 402 | q->enqueue(new ScavengeRootsTask(ScavengeRootsTask::system_dictionary)); |
duke@435 | 403 | q->enqueue(new ScavengeRootsTask(ScavengeRootsTask::jvmti)); |
jrose@1424 | 404 | q->enqueue(new ScavengeRootsTask(ScavengeRootsTask::code_cache)); |
duke@435 | 405 | |
duke@435 | 406 | ParallelTaskTerminator terminator( |
tonyp@2061 | 407 | gc_task_manager()->workers(), |
tonyp@2061 | 408 | (TaskQueueSetSuper*) promotion_manager->stack_array_depth()); |
duke@435 | 409 | if (ParallelGCThreads>1) { |
duke@435 | 410 | for (uint j=0; j<ParallelGCThreads; j++) { |
duke@435 | 411 | q->enqueue(new StealTask(&terminator)); |
duke@435 | 412 | } |
duke@435 | 413 | } |
duke@435 | 414 | |
duke@435 | 415 | gc_task_manager()->execute_and_wait(q); |
duke@435 | 416 | } |
duke@435 | 417 | |
duke@435 | 418 | scavenge_midpoint.update(); |
duke@435 | 419 | |
duke@435 | 420 | // Process reference objects discovered during scavenge |
duke@435 | 421 | { |
ysr@892 | 422 | reference_processor()->setup_policy(false); // not always_clear |
duke@435 | 423 | PSKeepAliveClosure keep_alive(promotion_manager); |
duke@435 | 424 | PSEvacuateFollowersClosure evac_followers(promotion_manager); |
duke@435 | 425 | if (reference_processor()->processing_is_mt()) { |
duke@435 | 426 | PSRefProcTaskExecutor task_executor; |
duke@435 | 427 | reference_processor()->process_discovered_references( |
ysr@888 | 428 | &_is_alive_closure, &keep_alive, &evac_followers, &task_executor); |
duke@435 | 429 | } else { |
duke@435 | 430 | reference_processor()->process_discovered_references( |
ysr@888 | 431 | &_is_alive_closure, &keep_alive, &evac_followers, NULL); |
duke@435 | 432 | } |
duke@435 | 433 | } |
duke@435 | 434 | |
duke@435 | 435 | // Enqueue reference objects discovered during scavenge. |
duke@435 | 436 | if (reference_processor()->processing_is_mt()) { |
duke@435 | 437 | PSRefProcTaskExecutor task_executor; |
duke@435 | 438 | reference_processor()->enqueue_discovered_references(&task_executor); |
duke@435 | 439 | } else { |
duke@435 | 440 | reference_processor()->enqueue_discovered_references(NULL); |
duke@435 | 441 | } |
duke@435 | 442 | |
jcoomes@2661 | 443 | if (!JavaObjectsInPerm) { |
jcoomes@2661 | 444 | // Unlink any dead interned Strings |
jcoomes@2661 | 445 | StringTable::unlink(&_is_alive_closure); |
jcoomes@2661 | 446 | // Process the remaining live ones |
jcoomes@2661 | 447 | PSScavengeRootsClosure root_closure(promotion_manager); |
jcoomes@2661 | 448 | StringTable::oops_do(&root_closure); |
jcoomes@2661 | 449 | } |
jcoomes@2661 | 450 | |
duke@435 | 451 | // Finally, flush the promotion_manager's labs, and deallocate its stacks. |
duke@435 | 452 | PSPromotionManager::post_scavenge(); |
duke@435 | 453 | |
duke@435 | 454 | promotion_failure_occurred = promotion_failed(); |
duke@435 | 455 | if (promotion_failure_occurred) { |
duke@435 | 456 | clean_up_failed_promotion(); |
duke@435 | 457 | if (PrintGC) { |
duke@435 | 458 | gclog_or_tty->print("--"); |
duke@435 | 459 | } |
duke@435 | 460 | } |
duke@435 | 461 | |
duke@435 | 462 | // Let the size policy know we're done. Note that we count promotion |
duke@435 | 463 | // failure cleanup time as part of the collection (otherwise, we're |
duke@435 | 464 | // implicitly saying it's mutator time). |
duke@435 | 465 | size_policy->minor_collection_end(gc_cause); |
duke@435 | 466 | |
duke@435 | 467 | if (!promotion_failure_occurred) { |
duke@435 | 468 | // Swap the survivor spaces. |
jmasa@698 | 469 | |
jmasa@698 | 470 | |
jmasa@698 | 471 | young_gen->eden_space()->clear(SpaceDecorator::Mangle); |
jmasa@698 | 472 | young_gen->from_space()->clear(SpaceDecorator::Mangle); |
duke@435 | 473 | young_gen->swap_spaces(); |
duke@435 | 474 | |
duke@435 | 475 | size_t survived = young_gen->from_space()->used_in_bytes(); |
duke@435 | 476 | size_t promoted = old_gen->used_in_bytes() - old_gen_used_before; |
duke@435 | 477 | size_policy->update_averages(_survivor_overflow, survived, promoted); |
duke@435 | 478 | |
jmasa@1822 | 479 | // A successful scavenge should restart the GC time limit count which is |
jmasa@1822 | 480 | // for full GC's. |
jmasa@1822 | 481 | size_policy->reset_gc_overhead_limit_count(); |
duke@435 | 482 | if (UseAdaptiveSizePolicy) { |
duke@435 | 483 | // Calculate the new survivor size and tenuring threshold |
duke@435 | 484 | |
duke@435 | 485 | if (PrintAdaptiveSizePolicy) { |
duke@435 | 486 | gclog_or_tty->print("AdaptiveSizeStart: "); |
duke@435 | 487 | gclog_or_tty->stamp(); |
duke@435 | 488 | gclog_or_tty->print_cr(" collection: %d ", |
duke@435 | 489 | heap->total_collections()); |
duke@435 | 490 | |
duke@435 | 491 | if (Verbose) { |
duke@435 | 492 | gclog_or_tty->print("old_gen_capacity: %d young_gen_capacity: %d" |
duke@435 | 493 | " perm_gen_capacity: %d ", |
duke@435 | 494 | old_gen->capacity_in_bytes(), young_gen->capacity_in_bytes(), |
duke@435 | 495 | perm_gen->capacity_in_bytes()); |
duke@435 | 496 | } |
duke@435 | 497 | } |
duke@435 | 498 | |
duke@435 | 499 | |
duke@435 | 500 | if (UsePerfData) { |
duke@435 | 501 | PSGCAdaptivePolicyCounters* counters = heap->gc_policy_counters(); |
duke@435 | 502 | counters->update_old_eden_size( |
duke@435 | 503 | size_policy->calculated_eden_size_in_bytes()); |
duke@435 | 504 | counters->update_old_promo_size( |
duke@435 | 505 | size_policy->calculated_promo_size_in_bytes()); |
duke@435 | 506 | counters->update_old_capacity(old_gen->capacity_in_bytes()); |
duke@435 | 507 | counters->update_young_capacity(young_gen->capacity_in_bytes()); |
duke@435 | 508 | counters->update_survived(survived); |
duke@435 | 509 | counters->update_promoted(promoted); |
duke@435 | 510 | counters->update_survivor_overflowed(_survivor_overflow); |
duke@435 | 511 | } |
duke@435 | 512 | |
duke@435 | 513 | size_t survivor_limit = |
duke@435 | 514 | size_policy->max_survivor_size(young_gen->max_size()); |
duke@435 | 515 | _tenuring_threshold = |
duke@435 | 516 | size_policy->compute_survivor_space_size_and_threshold( |
duke@435 | 517 | _survivor_overflow, |
duke@435 | 518 | _tenuring_threshold, |
duke@435 | 519 | survivor_limit); |
duke@435 | 520 | |
duke@435 | 521 | if (PrintTenuringDistribution) { |
duke@435 | 522 | gclog_or_tty->cr(); |
duke@435 | 523 | gclog_or_tty->print_cr("Desired survivor size %ld bytes, new threshold %d (max %d)", |
duke@435 | 524 | size_policy->calculated_survivor_size_in_bytes(), |
duke@435 | 525 | _tenuring_threshold, MaxTenuringThreshold); |
duke@435 | 526 | } |
duke@435 | 527 | |
duke@435 | 528 | if (UsePerfData) { |
duke@435 | 529 | PSGCAdaptivePolicyCounters* counters = heap->gc_policy_counters(); |
duke@435 | 530 | counters->update_tenuring_threshold(_tenuring_threshold); |
duke@435 | 531 | counters->update_survivor_size_counters(); |
duke@435 | 532 | } |
duke@435 | 533 | |
duke@435 | 534 | // Do call at minor collections? |
duke@435 | 535 | // Don't check if the size_policy is ready at this |
duke@435 | 536 | // level. Let the size_policy check that internally. |
duke@435 | 537 | if (UseAdaptiveSizePolicy && |
duke@435 | 538 | UseAdaptiveGenerationSizePolicyAtMinorCollection && |
duke@435 | 539 | ((gc_cause != GCCause::_java_lang_system_gc) || |
duke@435 | 540 | UseAdaptiveSizePolicyWithSystemGC)) { |
duke@435 | 541 | |
duke@435 | 542 | // Calculate optimial free space amounts |
duke@435 | 543 | assert(young_gen->max_size() > |
duke@435 | 544 | young_gen->from_space()->capacity_in_bytes() + |
duke@435 | 545 | young_gen->to_space()->capacity_in_bytes(), |
duke@435 | 546 | "Sizes of space in young gen are out-of-bounds"); |
duke@435 | 547 | size_t max_eden_size = young_gen->max_size() - |
duke@435 | 548 | young_gen->from_space()->capacity_in_bytes() - |
duke@435 | 549 | young_gen->to_space()->capacity_in_bytes(); |
duke@435 | 550 | size_policy->compute_generation_free_space(young_gen->used_in_bytes(), |
duke@435 | 551 | young_gen->eden_space()->used_in_bytes(), |
duke@435 | 552 | old_gen->used_in_bytes(), |
duke@435 | 553 | perm_gen->used_in_bytes(), |
duke@435 | 554 | young_gen->eden_space()->capacity_in_bytes(), |
duke@435 | 555 | old_gen->max_gen_size(), |
duke@435 | 556 | max_eden_size, |
duke@435 | 557 | false /* full gc*/, |
jmasa@1822 | 558 | gc_cause, |
jmasa@1822 | 559 | heap->collector_policy()); |
duke@435 | 560 | |
duke@435 | 561 | } |
duke@435 | 562 | // Resize the young generation at every collection |
duke@435 | 563 | // even if new sizes have not been calculated. This is |
duke@435 | 564 | // to allow resizes that may have been inhibited by the |
duke@435 | 565 | // relative location of the "to" and "from" spaces. |
duke@435 | 566 | |
duke@435 | 567 | // Resizing the old gen at minor collects can cause increases |
duke@435 | 568 | // that don't feed back to the generation sizing policy until |
duke@435 | 569 | // a major collection. Don't resize the old gen here. |
duke@435 | 570 | |
duke@435 | 571 | heap->resize_young_gen(size_policy->calculated_eden_size_in_bytes(), |
duke@435 | 572 | size_policy->calculated_survivor_size_in_bytes()); |
duke@435 | 573 | |
duke@435 | 574 | if (PrintAdaptiveSizePolicy) { |
duke@435 | 575 | gclog_or_tty->print_cr("AdaptiveSizeStop: collection: %d ", |
duke@435 | 576 | heap->total_collections()); |
duke@435 | 577 | } |
duke@435 | 578 | } |
duke@435 | 579 | |
duke@435 | 580 | // Update the structure of the eden. With NUMA-eden CPU hotplugging or offlining can |
duke@435 | 581 | // cause the change of the heap layout. Make sure eden is reshaped if that's the case. |
duke@435 | 582 | // Also update() will case adaptive NUMA chunk resizing. |
duke@435 | 583 | assert(young_gen->eden_space()->is_empty(), "eden space should be empty now"); |
duke@435 | 584 | young_gen->eden_space()->update(); |
duke@435 | 585 | |
duke@435 | 586 | heap->gc_policy_counters()->update_counters(); |
duke@435 | 587 | |
duke@435 | 588 | heap->resize_all_tlabs(); |
duke@435 | 589 | |
duke@435 | 590 | assert(young_gen->to_space()->is_empty(), "to space should be empty now"); |
duke@435 | 591 | } |
duke@435 | 592 | |
duke@435 | 593 | COMPILER2_PRESENT(DerivedPointerTable::update_pointers()); |
duke@435 | 594 | |
duke@435 | 595 | NOT_PRODUCT(reference_processor()->verify_no_references_recorded()); |
duke@435 | 596 | |
duke@435 | 597 | // Re-verify object start arrays |
duke@435 | 598 | if (VerifyObjectStartArray && |
duke@435 | 599 | VerifyAfterGC) { |
duke@435 | 600 | old_gen->verify_object_start_array(); |
duke@435 | 601 | perm_gen->verify_object_start_array(); |
duke@435 | 602 | } |
duke@435 | 603 | |
duke@435 | 604 | // Verify all old -> young cards are now precise |
duke@435 | 605 | if (VerifyRememberedSets) { |
duke@435 | 606 | // Precise verification will give false positives. Until this is fixed, |
duke@435 | 607 | // use imprecise verification. |
duke@435 | 608 | // CardTableExtension::verify_all_young_refs_precise(); |
duke@435 | 609 | CardTableExtension::verify_all_young_refs_imprecise(); |
duke@435 | 610 | } |
duke@435 | 611 | |
duke@435 | 612 | if (TraceGen0Time) accumulated_time()->stop(); |
duke@435 | 613 | |
duke@435 | 614 | if (PrintGC) { |
duke@435 | 615 | if (PrintGCDetails) { |
duke@435 | 616 | // Don't print a GC timestamp here. This is after the GC so |
duke@435 | 617 | // would be confusing. |
duke@435 | 618 | young_gen->print_used_change(young_gen_used_before); |
duke@435 | 619 | } |
duke@435 | 620 | heap->print_heap_change(prev_used); |
duke@435 | 621 | } |
duke@435 | 622 | |
duke@435 | 623 | // Track memory usage and detect low memory |
duke@435 | 624 | MemoryService::track_memory_usage(); |
duke@435 | 625 | heap->update_counters(); |
duke@435 | 626 | } |
duke@435 | 627 | |
duke@435 | 628 | if (VerifyAfterGC && heap->total_collections() >= VerifyGCStartAt) { |
duke@435 | 629 | HandleMark hm; // Discard invalid handles created during verification |
duke@435 | 630 | gclog_or_tty->print(" VerifyAfterGC:"); |
duke@435 | 631 | Universe::verify(false); |
duke@435 | 632 | } |
duke@435 | 633 | |
duke@435 | 634 | if (PrintHeapAtGC) { |
duke@435 | 635 | Universe::print_heap_after_gc(); |
duke@435 | 636 | } |
duke@435 | 637 | |
jmasa@698 | 638 | if (ZapUnusedHeapArea) { |
jmasa@698 | 639 | young_gen->eden_space()->check_mangled_unused_area_complete(); |
jmasa@698 | 640 | young_gen->from_space()->check_mangled_unused_area_complete(); |
jmasa@698 | 641 | young_gen->to_space()->check_mangled_unused_area_complete(); |
jmasa@698 | 642 | } |
jmasa@698 | 643 | |
duke@435 | 644 | scavenge_exit.update(); |
duke@435 | 645 | |
duke@435 | 646 | if (PrintGCTaskTimeStamps) { |
duke@435 | 647 | tty->print_cr("VM-Thread " INT64_FORMAT " " INT64_FORMAT " " INT64_FORMAT, |
duke@435 | 648 | scavenge_entry.ticks(), scavenge_midpoint.ticks(), |
duke@435 | 649 | scavenge_exit.ticks()); |
duke@435 | 650 | gc_task_manager()->print_task_time_stamps(); |
duke@435 | 651 | } |
duke@435 | 652 | |
jmasa@981 | 653 | #ifdef TRACESPINNING |
jmasa@981 | 654 | ParallelTaskTerminator::print_termination_counts(); |
jmasa@981 | 655 | #endif |
jmasa@981 | 656 | |
duke@435 | 657 | return !promotion_failure_occurred; |
duke@435 | 658 | } |
duke@435 | 659 | |
duke@435 | 660 | // This method iterates over all objects in the young generation, |
duke@435 | 661 | // unforwarding markOops. It then restores any preserved mark oops, |
duke@435 | 662 | // and clears the _preserved_mark_stack. |
duke@435 | 663 | void PSScavenge::clean_up_failed_promotion() { |
duke@435 | 664 | ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); |
duke@435 | 665 | assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); |
duke@435 | 666 | assert(promotion_failed(), "Sanity"); |
duke@435 | 667 | |
duke@435 | 668 | PSYoungGen* young_gen = heap->young_gen(); |
duke@435 | 669 | |
duke@435 | 670 | { |
duke@435 | 671 | ResourceMark rm; |
duke@435 | 672 | |
duke@435 | 673 | // Unforward all pointers in the young gen. |
duke@435 | 674 | PSPromotionFailedClosure unforward_closure; |
duke@435 | 675 | young_gen->object_iterate(&unforward_closure); |
duke@435 | 676 | |
duke@435 | 677 | if (PrintGC && Verbose) { |
jcoomes@2191 | 678 | gclog_or_tty->print_cr("Restoring %d marks", _preserved_oop_stack.size()); |
duke@435 | 679 | } |
duke@435 | 680 | |
duke@435 | 681 | // Restore any saved marks. |
jcoomes@2191 | 682 | while (!_preserved_oop_stack.is_empty()) { |
jcoomes@2191 | 683 | oop obj = _preserved_oop_stack.pop(); |
jcoomes@2191 | 684 | markOop mark = _preserved_mark_stack.pop(); |
duke@435 | 685 | obj->set_mark(mark); |
duke@435 | 686 | } |
duke@435 | 687 | |
jcoomes@2191 | 688 | // Clear the preserved mark and oop stack caches. |
jcoomes@2191 | 689 | _preserved_mark_stack.clear(true); |
jcoomes@2191 | 690 | _preserved_oop_stack.clear(true); |
jcoomes@2191 | 691 | _promotion_failed = false; |
duke@435 | 692 | } |
duke@435 | 693 | |
duke@435 | 694 | // Reset the PromotionFailureALot counters. |
duke@435 | 695 | NOT_PRODUCT(Universe::heap()->reset_promotion_should_fail();) |
duke@435 | 696 | } |
duke@435 | 697 | |
duke@435 | 698 | // This method is called whenever an attempt to promote an object |
jcoomes@2191 | 699 | // fails. Some markOops will need preservation, some will not. Note |
duke@435 | 700 | // that the entire eden is traversed after a failed promotion, with |
duke@435 | 701 | // all forwarded headers replaced by the default markOop. This means |
duke@435 | 702 | // it is not neccessary to preserve most markOops. |
duke@435 | 703 | void PSScavenge::oop_promotion_failed(oop obj, markOop obj_mark) { |
jcoomes@2191 | 704 | _promotion_failed = true; |
duke@435 | 705 | if (obj_mark->must_be_preserved_for_promotion_failure(obj)) { |
ysr@2380 | 706 | // Should use per-worker private stakcs hetre rather than |
ysr@2380 | 707 | // locking a common pair of stacks. |
duke@435 | 708 | ThreadCritical tc; |
jcoomes@2191 | 709 | _preserved_oop_stack.push(obj); |
jcoomes@2191 | 710 | _preserved_mark_stack.push(obj_mark); |
duke@435 | 711 | } |
duke@435 | 712 | } |
duke@435 | 713 | |
duke@435 | 714 | bool PSScavenge::should_attempt_scavenge() { |
duke@435 | 715 | ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); |
duke@435 | 716 | assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); |
duke@435 | 717 | PSGCAdaptivePolicyCounters* counters = heap->gc_policy_counters(); |
duke@435 | 718 | |
duke@435 | 719 | if (UsePerfData) { |
duke@435 | 720 | counters->update_scavenge_skipped(not_skipped); |
duke@435 | 721 | } |
duke@435 | 722 | |
duke@435 | 723 | PSYoungGen* young_gen = heap->young_gen(); |
duke@435 | 724 | PSOldGen* old_gen = heap->old_gen(); |
duke@435 | 725 | |
duke@435 | 726 | if (!ScavengeWithObjectsInToSpace) { |
duke@435 | 727 | // Do not attempt to promote unless to_space is empty |
duke@435 | 728 | if (!young_gen->to_space()->is_empty()) { |
duke@435 | 729 | _consecutive_skipped_scavenges++; |
duke@435 | 730 | if (UsePerfData) { |
duke@435 | 731 | counters->update_scavenge_skipped(to_space_not_empty); |
duke@435 | 732 | } |
duke@435 | 733 | return false; |
duke@435 | 734 | } |
duke@435 | 735 | } |
duke@435 | 736 | |
duke@435 | 737 | // Test to see if the scavenge will likely fail. |
duke@435 | 738 | PSAdaptiveSizePolicy* policy = heap->size_policy(); |
duke@435 | 739 | |
duke@435 | 740 | // A similar test is done in the policy's should_full_GC(). If this is |
duke@435 | 741 | // changed, decide if that test should also be changed. |
duke@435 | 742 | size_t avg_promoted = (size_t) policy->padded_average_promoted_in_bytes(); |
duke@435 | 743 | size_t promotion_estimate = MIN2(avg_promoted, young_gen->used_in_bytes()); |
duke@435 | 744 | bool result = promotion_estimate < old_gen->free_in_bytes(); |
duke@435 | 745 | |
duke@435 | 746 | if (PrintGCDetails && Verbose) { |
duke@435 | 747 | gclog_or_tty->print(result ? " do scavenge: " : " skip scavenge: "); |
duke@435 | 748 | gclog_or_tty->print_cr(" average_promoted " SIZE_FORMAT |
duke@435 | 749 | " padded_average_promoted " SIZE_FORMAT |
duke@435 | 750 | " free in old gen " SIZE_FORMAT, |
duke@435 | 751 | (size_t) policy->average_promoted_in_bytes(), |
duke@435 | 752 | (size_t) policy->padded_average_promoted_in_bytes(), |
duke@435 | 753 | old_gen->free_in_bytes()); |
duke@435 | 754 | if (young_gen->used_in_bytes() < |
duke@435 | 755 | (size_t) policy->padded_average_promoted_in_bytes()) { |
duke@435 | 756 | gclog_or_tty->print_cr(" padded_promoted_average is greater" |
duke@435 | 757 | " than maximum promotion = " SIZE_FORMAT, young_gen->used_in_bytes()); |
duke@435 | 758 | } |
duke@435 | 759 | } |
duke@435 | 760 | |
duke@435 | 761 | if (result) { |
duke@435 | 762 | _consecutive_skipped_scavenges = 0; |
duke@435 | 763 | } else { |
duke@435 | 764 | _consecutive_skipped_scavenges++; |
duke@435 | 765 | if (UsePerfData) { |
duke@435 | 766 | counters->update_scavenge_skipped(promoted_too_large); |
duke@435 | 767 | } |
duke@435 | 768 | } |
duke@435 | 769 | return result; |
duke@435 | 770 | } |
duke@435 | 771 | |
duke@435 | 772 | // Used to add tasks |
duke@435 | 773 | GCTaskManager* const PSScavenge::gc_task_manager() { |
duke@435 | 774 | assert(ParallelScavengeHeap::gc_task_manager() != NULL, |
duke@435 | 775 | "shouldn't return NULL"); |
duke@435 | 776 | return ParallelScavengeHeap::gc_task_manager(); |
duke@435 | 777 | } |
duke@435 | 778 | |
duke@435 | 779 | void PSScavenge::initialize() { |
duke@435 | 780 | // Arguments must have been parsed |
duke@435 | 781 | |
duke@435 | 782 | if (AlwaysTenure) { |
duke@435 | 783 | _tenuring_threshold = 0; |
duke@435 | 784 | } else if (NeverTenure) { |
duke@435 | 785 | _tenuring_threshold = markOopDesc::max_age + 1; |
duke@435 | 786 | } else { |
duke@435 | 787 | // We want to smooth out our startup times for the AdaptiveSizePolicy |
duke@435 | 788 | _tenuring_threshold = (UseAdaptiveSizePolicy) ? InitialTenuringThreshold : |
duke@435 | 789 | MaxTenuringThreshold; |
duke@435 | 790 | } |
duke@435 | 791 | |
duke@435 | 792 | ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); |
duke@435 | 793 | assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); |
duke@435 | 794 | |
duke@435 | 795 | PSYoungGen* young_gen = heap->young_gen(); |
duke@435 | 796 | PSOldGen* old_gen = heap->old_gen(); |
duke@435 | 797 | PSPermGen* perm_gen = heap->perm_gen(); |
duke@435 | 798 | |
duke@435 | 799 | // Set boundary between young_gen and old_gen |
duke@435 | 800 | assert(perm_gen->reserved().end() <= old_gen->object_space()->bottom(), |
duke@435 | 801 | "perm above old"); |
duke@435 | 802 | assert(old_gen->reserved().end() <= young_gen->eden_space()->bottom(), |
duke@435 | 803 | "old above young"); |
duke@435 | 804 | _young_generation_boundary = young_gen->eden_space()->bottom(); |
duke@435 | 805 | |
duke@435 | 806 | // Initialize ref handling object for scavenging. |
duke@435 | 807 | MemRegion mr = young_gen->reserved(); |
ysr@2651 | 808 | _ref_processor = |
ysr@2651 | 809 | new ReferenceProcessor(mr, // span |
ysr@2651 | 810 | ParallelRefProcEnabled && (ParallelGCThreads > 1), // mt processing |
ysr@2651 | 811 | (int) ParallelGCThreads, // mt processing degree |
ysr@2651 | 812 | true, // mt discovery |
ysr@2651 | 813 | (int) ParallelGCThreads, // mt discovery degree |
ysr@2651 | 814 | true, // atomic_discovery |
ysr@2651 | 815 | NULL, // header provides liveness info |
ysr@2651 | 816 | false); // next field updates do not need write barrier |
duke@435 | 817 | |
duke@435 | 818 | // Cache the cardtable |
duke@435 | 819 | BarrierSet* bs = Universe::heap()->barrier_set(); |
duke@435 | 820 | assert(bs->kind() == BarrierSet::CardTableModRef, "Wrong barrier set kind"); |
duke@435 | 821 | _card_table = (CardTableExtension*)bs; |
duke@435 | 822 | |
duke@435 | 823 | _counters = new CollectorCounters("PSScavenge", 0); |
duke@435 | 824 | } |