1 /* 2 * Copyright (c) 2001, 2015, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #include "precompiled.hpp" 26 #include "gc/cms/compactibleFreeListSpace.hpp" 27 #include "gc/cms/concurrentMarkSweepGeneration.hpp" 28 #include "gc/cms/parNewGeneration.hpp" 29 #include "gc/cms/parOopClosures.inline.hpp" 30 #include "gc/serial/defNewGeneration.inline.hpp" 31 #include "gc/shared/adaptiveSizePolicy.hpp" 32 #include "gc/shared/ageTable.hpp" 33 #include "gc/shared/copyFailedInfo.hpp" 34 #include "gc/shared/gcHeapSummary.hpp" 35 #include "gc/shared/gcTimer.hpp" 36 #include "gc/shared/gcTrace.hpp" 37 #include "gc/shared/gcTraceTime.hpp" 38 #include "gc/shared/genCollectedHeap.hpp" 39 #include "gc/shared/genOopClosures.inline.hpp" 40 #include "gc/shared/generation.hpp" 41 #include "gc/shared/plab.inline.hpp" 42 #include "gc/shared/referencePolicy.hpp" 43 #include "gc/shared/space.hpp" 44 #include "gc/shared/spaceDecorator.hpp" 45 #include "gc/shared/strongRootsScope.hpp" 46 #include "gc/shared/taskqueue.inline.hpp" 47 #include "gc/shared/workgroup.hpp" 48 #include "memory/resourceArea.hpp" 49 #include "oops/objArrayOop.hpp" 50 #include "oops/oop.inline.hpp" 51 #include "runtime/atomic.inline.hpp" 52 #include "runtime/handles.hpp" 53 #include "runtime/handles.inline.hpp" 54 #include "runtime/java.hpp" 55 #include "runtime/thread.inline.hpp" 56 #include "utilities/copy.hpp" 57 #include "utilities/globalDefinitions.hpp" 58 #include "utilities/stack.inline.hpp" 59 60 #ifdef _MSC_VER 61 #pragma warning( push ) 62 #pragma warning( disable:4355 ) // 'this' : used in base member initializer list 63 #endif 64 ParScanThreadState::ParScanThreadState(Space* to_space_, 65 ParNewGeneration* gen_, 66 Generation* old_gen_, 67 int thread_num_, 68 ObjToScanQueueSet* work_queue_set_, 69 Stack<oop, mtGC>* overflow_stacks_, 70 size_t desired_plab_sz_, 71 ParallelTaskTerminator& term_) : 72 _to_space(to_space_), _old_gen(old_gen_), _young_gen(gen_), _thread_num(thread_num_), 73 _work_queue(work_queue_set_->queue(thread_num_)), _to_space_full(false), 74 _overflow_stack(overflow_stacks_ ? overflow_stacks_ + thread_num_ : NULL), 75 _ageTable(false), // false ==> not the global age table, no perf data. 76 _to_space_alloc_buffer(desired_plab_sz_), 77 _to_space_closure(gen_, this), _old_gen_closure(gen_, this), 78 _to_space_root_closure(gen_, this), _old_gen_root_closure(gen_, this), 79 _older_gen_closure(gen_, this), 80 _evacuate_followers(this, &_to_space_closure, &_old_gen_closure, 81 &_to_space_root_closure, gen_, &_old_gen_root_closure, 82 work_queue_set_, &term_), 83 _is_alive_closure(gen_), _scan_weak_ref_closure(gen_, this), 84 _keep_alive_closure(&_scan_weak_ref_closure), 85 _strong_roots_time(0.0), _term_time(0.0) 86 { 87 #if TASKQUEUE_STATS 88 _term_attempts = 0; 89 _overflow_refills = 0; 90 _overflow_refill_objs = 0; 91 #endif // TASKQUEUE_STATS 92 93 _survivor_chunk_array = 94 (ChunkArray*) old_gen()->get_data_recorder(thread_num()); 95 _hash_seed = 17; // Might want to take time-based random value. 96 _start = os::elapsedTime(); 97 _old_gen_closure.set_generation(old_gen_); 98 _old_gen_root_closure.set_generation(old_gen_); 99 } 100 #ifdef _MSC_VER 101 #pragma warning( pop ) 102 #endif 103 104 void ParScanThreadState::record_survivor_plab(HeapWord* plab_start, 105 size_t plab_word_size) { 106 ChunkArray* sca = survivor_chunk_array(); 107 if (sca != NULL) { 108 // A non-null SCA implies that we want the PLAB data recorded. 109 sca->record_sample(plab_start, plab_word_size); 110 } 111 } 112 113 bool ParScanThreadState::should_be_partially_scanned(oop new_obj, oop old_obj) const { 114 return new_obj->is_objArray() && 115 arrayOop(new_obj)->length() > ParGCArrayScanChunk && 116 new_obj != old_obj; 117 } 118 119 void ParScanThreadState::scan_partial_array_and_push_remainder(oop old) { 120 assert(old->is_objArray(), "must be obj array"); 121 assert(old->is_forwarded(), "must be forwarded"); 122 assert(GenCollectedHeap::heap()->is_in_reserved(old), "must be in heap."); 123 assert(!old_gen()->is_in(old), "must be in young generation."); 124 125 objArrayOop obj = objArrayOop(old->forwardee()); 126 // Process ParGCArrayScanChunk elements now 127 // and push the remainder back onto queue 128 int start = arrayOop(old)->length(); 129 int end = obj->length(); 130 int remainder = end - start; 131 assert(start <= end, "just checking"); 132 if (remainder > 2 * ParGCArrayScanChunk) { 133 // Test above combines last partial chunk with a full chunk 134 end = start + ParGCArrayScanChunk; 135 arrayOop(old)->set_length(end); 136 // Push remainder. 137 bool ok = work_queue()->push(old); 138 assert(ok, "just popped, push must be okay"); 139 } else { 140 // Restore length so that it can be used if there 141 // is a promotion failure and forwarding pointers 142 // must be removed. 143 arrayOop(old)->set_length(end); 144 } 145 146 // process our set of indices (include header in first chunk) 147 // should make sure end is even (aligned to HeapWord in case of compressed oops) 148 if ((HeapWord *)obj < young_old_boundary()) { 149 // object is in to_space 150 obj->oop_iterate_range(&_to_space_closure, start, end); 151 } else { 152 // object is in old generation 153 obj->oop_iterate_range(&_old_gen_closure, start, end); 154 } 155 } 156 157 158 void ParScanThreadState::trim_queues(int max_size) { 159 ObjToScanQueue* queue = work_queue(); 160 do { 161 while (queue->size() > (juint)max_size) { 162 oop obj_to_scan; 163 if (queue->pop_local(obj_to_scan)) { 164 if ((HeapWord *)obj_to_scan < young_old_boundary()) { 165 if (obj_to_scan->is_objArray() && 166 obj_to_scan->is_forwarded() && 167 obj_to_scan->forwardee() != obj_to_scan) { 168 scan_partial_array_and_push_remainder(obj_to_scan); 169 } else { 170 // object is in to_space 171 obj_to_scan->oop_iterate(&_to_space_closure); 172 } 173 } else { 174 // object is in old generation 175 obj_to_scan->oop_iterate(&_old_gen_closure); 176 } 177 } 178 } 179 // For the case of compressed oops, we have a private, non-shared 180 // overflow stack, so we eagerly drain it so as to more evenly 181 // distribute load early. Note: this may be good to do in 182 // general rather than delay for the final stealing phase. 183 // If applicable, we'll transfer a set of objects over to our 184 // work queue, allowing them to be stolen and draining our 185 // private overflow stack. 186 } while (ParGCTrimOverflow && young_gen()->take_from_overflow_list(this)); 187 } 188 189 bool ParScanThreadState::take_from_overflow_stack() { 190 assert(ParGCUseLocalOverflow, "Else should not call"); 191 assert(young_gen()->overflow_list() == NULL, "Error"); 192 ObjToScanQueue* queue = work_queue(); 193 Stack<oop, mtGC>* const of_stack = overflow_stack(); 194 const size_t num_overflow_elems = of_stack->size(); 195 const size_t space_available = queue->max_elems() - queue->size(); 196 const size_t num_take_elems = MIN3(space_available / 4, 197 ParGCDesiredObjsFromOverflowList, 198 num_overflow_elems); 199 // Transfer the most recent num_take_elems from the overflow 200 // stack to our work queue. 201 for (size_t i = 0; i != num_take_elems; i++) { 202 oop cur = of_stack->pop(); 203 oop obj_to_push = cur->forwardee(); 204 assert(GenCollectedHeap::heap()->is_in_reserved(cur), "Should be in heap"); 205 assert(!old_gen()->is_in_reserved(cur), "Should be in young gen"); 206 assert(GenCollectedHeap::heap()->is_in_reserved(obj_to_push), "Should be in heap"); 207 if (should_be_partially_scanned(obj_to_push, cur)) { 208 assert(arrayOop(cur)->length() == 0, "entire array remaining to be scanned"); 209 obj_to_push = cur; 210 } 211 bool ok = queue->push(obj_to_push); 212 assert(ok, "Should have succeeded"); 213 } 214 assert(young_gen()->overflow_list() == NULL, "Error"); 215 return num_take_elems > 0; // was something transferred? 216 } 217 218 void ParScanThreadState::push_on_overflow_stack(oop p) { 219 assert(ParGCUseLocalOverflow, "Else should not call"); 220 overflow_stack()->push(p); 221 assert(young_gen()->overflow_list() == NULL, "Error"); 222 } 223 224 HeapWord* ParScanThreadState::alloc_in_to_space_slow(size_t word_sz) { 225 226 // Otherwise, if the object is small enough, try to reallocate the 227 // buffer. 228 HeapWord* obj = NULL; 229 if (!_to_space_full) { 230 PLAB* const plab = to_space_alloc_buffer(); 231 Space* const sp = to_space(); 232 if (word_sz * 100 < 233 ParallelGCBufferWastePct * plab->word_sz()) { 234 // Is small enough; abandon this buffer and start a new one. 235 plab->retire(); 236 size_t buf_size = plab->word_sz(); 237 HeapWord* buf_space = sp->par_allocate(buf_size); 238 if (buf_space == NULL) { 239 const size_t min_bytes = 240 PLAB::min_size() << LogHeapWordSize; 241 size_t free_bytes = sp->free(); 242 while(buf_space == NULL && free_bytes >= min_bytes) { 243 buf_size = free_bytes >> LogHeapWordSize; 244 assert(buf_size == (size_t)align_object_size(buf_size), 245 "Invariant"); 246 buf_space = sp->par_allocate(buf_size); 247 free_bytes = sp->free(); 248 } 249 } 250 if (buf_space != NULL) { 251 plab->set_word_size(buf_size); 252 plab->set_buf(buf_space); 253 record_survivor_plab(buf_space, buf_size); 254 obj = plab->allocate_aligned(word_sz, SurvivorAlignmentInBytes); 255 // Note that we cannot compare buf_size < word_sz below 256 // because of AlignmentReserve (see PLAB::allocate()). 257 assert(obj != NULL || plab->words_remaining() < word_sz, 258 "Else should have been able to allocate"); 259 // It's conceivable that we may be able to use the 260 // buffer we just grabbed for subsequent small requests 261 // even if not for this one. 262 } else { 263 // We're used up. 264 _to_space_full = true; 265 } 266 267 } else { 268 // Too large; allocate the object individually. 269 obj = sp->par_allocate(word_sz); 270 } 271 } 272 return obj; 273 } 274 275 276 void ParScanThreadState::undo_alloc_in_to_space(HeapWord* obj, size_t word_sz) { 277 to_space_alloc_buffer()->undo_allocation(obj, word_sz); 278 } 279 280 void ParScanThreadState::print_promotion_failure_size() { 281 if (_promotion_failed_info.has_failed() && PrintPromotionFailure) { 282 gclog_or_tty->print(" (%d: promotion failure size = " SIZE_FORMAT ") ", 283 _thread_num, _promotion_failed_info.first_size()); 284 } 285 } 286 287 class ParScanThreadStateSet: private ResourceArray { 288 public: 289 // Initializes states for the specified number of threads; 290 ParScanThreadStateSet(int num_threads, 291 Space& to_space, 292 ParNewGeneration& gen, 293 Generation& old_gen, 294 ObjToScanQueueSet& queue_set, 295 Stack<oop, mtGC>* overflow_stacks_, 296 size_t desired_plab_sz, 297 ParallelTaskTerminator& term); 298 299 ~ParScanThreadStateSet() { TASKQUEUE_STATS_ONLY(reset_stats()); } 300 301 inline ParScanThreadState& thread_state(int i); 302 303 void trace_promotion_failed(const YoungGCTracer* gc_tracer); 304 void reset(uint active_workers, bool promotion_failed); 305 void flush(); 306 307 #if TASKQUEUE_STATS 308 static void 309 print_termination_stats_hdr(outputStream* const st = gclog_or_tty); 310 void print_termination_stats(outputStream* const st = gclog_or_tty); 311 static void 312 print_taskqueue_stats_hdr(outputStream* const st = gclog_or_tty); 313 void print_taskqueue_stats(outputStream* const st = gclog_or_tty); 314 void reset_stats(); 315 #endif // TASKQUEUE_STATS 316 317 private: 318 ParallelTaskTerminator& _term; 319 ParNewGeneration& _gen; 320 Generation& _old_gen; 321 public: 322 bool is_valid(int id) const { return id < length(); } 323 ParallelTaskTerminator* terminator() { return &_term; } 324 }; 325 326 327 ParScanThreadStateSet::ParScanThreadStateSet( 328 int num_threads, Space& to_space, ParNewGeneration& gen, 329 Generation& old_gen, ObjToScanQueueSet& queue_set, 330 Stack<oop, mtGC>* overflow_stacks, 331 size_t desired_plab_sz, ParallelTaskTerminator& term) 332 : ResourceArray(sizeof(ParScanThreadState), num_threads), 333 _gen(gen), _old_gen(old_gen), _term(term) 334 { 335 assert(num_threads > 0, "sanity check!"); 336 assert(ParGCUseLocalOverflow == (overflow_stacks != NULL), 337 "overflow_stack allocation mismatch"); 338 // Initialize states. 339 for (int i = 0; i < num_threads; ++i) { 340 new ((ParScanThreadState*)_data + i) 341 ParScanThreadState(&to_space, &gen, &old_gen, i, &queue_set, 342 overflow_stacks, desired_plab_sz, term); 343 } 344 } 345 346 inline ParScanThreadState& ParScanThreadStateSet::thread_state(int i) 347 { 348 assert(i >= 0 && i < length(), "sanity check!"); 349 return ((ParScanThreadState*)_data)[i]; 350 } 351 352 void ParScanThreadStateSet::trace_promotion_failed(const YoungGCTracer* gc_tracer) { 353 for (int i = 0; i < length(); ++i) { 354 if (thread_state(i).promotion_failed()) { 355 gc_tracer->report_promotion_failed(thread_state(i).promotion_failed_info()); 356 thread_state(i).promotion_failed_info().reset(); 357 } 358 } 359 } 360 361 void ParScanThreadStateSet::reset(uint active_threads, bool promotion_failed) 362 { 363 _term.reset_for_reuse(active_threads); 364 if (promotion_failed) { 365 for (int i = 0; i < length(); ++i) { 366 thread_state(i).print_promotion_failure_size(); 367 } 368 } 369 } 370 371 #if TASKQUEUE_STATS 372 void 373 ParScanThreadState::reset_stats() 374 { 375 taskqueue_stats().reset(); 376 _term_attempts = 0; 377 _overflow_refills = 0; 378 _overflow_refill_objs = 0; 379 } 380 381 void ParScanThreadStateSet::reset_stats() 382 { 383 for (int i = 0; i < length(); ++i) { 384 thread_state(i).reset_stats(); 385 } 386 } 387 388 void 389 ParScanThreadStateSet::print_termination_stats_hdr(outputStream* const st) 390 { 391 st->print_raw_cr("GC Termination Stats"); 392 st->print_raw_cr(" elapsed --strong roots-- " 393 "-------termination-------"); 394 st->print_raw_cr("thr ms ms % " 395 " ms % attempts"); 396 st->print_raw_cr("--- --------- --------- ------ " 397 "--------- ------ --------"); 398 } 399 400 void ParScanThreadStateSet::print_termination_stats(outputStream* const st) 401 { 402 print_termination_stats_hdr(st); 403 404 for (int i = 0; i < length(); ++i) { 405 const ParScanThreadState & pss = thread_state(i); 406 const double elapsed_ms = pss.elapsed_time() * 1000.0; 407 const double s_roots_ms = pss.strong_roots_time() * 1000.0; 408 const double term_ms = pss.term_time() * 1000.0; 409 st->print_cr("%3d %9.2f %9.2f %6.2f " 410 "%9.2f %6.2f " SIZE_FORMAT_W(8), 411 i, elapsed_ms, s_roots_ms, s_roots_ms * 100 / elapsed_ms, 412 term_ms, term_ms * 100 / elapsed_ms, pss.term_attempts()); 413 } 414 } 415 416 // Print stats related to work queue activity. 417 void ParScanThreadStateSet::print_taskqueue_stats_hdr(outputStream* const st) 418 { 419 st->print_raw_cr("GC Task Stats"); 420 st->print_raw("thr "); TaskQueueStats::print_header(1, st); st->cr(); 421 st->print_raw("--- "); TaskQueueStats::print_header(2, st); st->cr(); 422 } 423 424 void ParScanThreadStateSet::print_taskqueue_stats(outputStream* const st) 425 { 426 print_taskqueue_stats_hdr(st); 427 428 TaskQueueStats totals; 429 for (int i = 0; i < length(); ++i) { 430 const ParScanThreadState & pss = thread_state(i); 431 const TaskQueueStats & stats = pss.taskqueue_stats(); 432 st->print("%3d ", i); stats.print(st); st->cr(); 433 totals += stats; 434 435 if (pss.overflow_refills() > 0) { 436 st->print_cr(" " SIZE_FORMAT_W(10) " overflow refills " 437 SIZE_FORMAT_W(10) " overflow objects", 438 pss.overflow_refills(), pss.overflow_refill_objs()); 439 } 440 } 441 st->print("tot "); totals.print(st); st->cr(); 442 443 DEBUG_ONLY(totals.verify()); 444 } 445 #endif // TASKQUEUE_STATS 446 447 void ParScanThreadStateSet::flush() 448 { 449 // Work in this loop should be kept as lightweight as 450 // possible since this might otherwise become a bottleneck 451 // to scaling. Should we add heavy-weight work into this 452 // loop, consider parallelizing the loop into the worker threads. 453 for (int i = 0; i < length(); ++i) { 454 ParScanThreadState& par_scan_state = thread_state(i); 455 456 // Flush stats related to To-space PLAB activity and 457 // retire the last buffer. 458 par_scan_state.to_space_alloc_buffer()->flush_and_retire_stats(_gen.plab_stats()); 459 460 // Every thread has its own age table. We need to merge 461 // them all into one. 462 ageTable *local_table = par_scan_state.age_table(); 463 _gen.age_table()->merge(local_table); 464 465 // Inform old gen that we're done. 466 _old_gen.par_promote_alloc_done(i); 467 _old_gen.par_oop_since_save_marks_iterate_done(i); 468 } 469 470 if (UseConcMarkSweepGC) { 471 // We need to call this even when ResizeOldPLAB is disabled 472 // so as to avoid breaking some asserts. While we may be able 473 // to avoid this by reorganizing the code a bit, I am loathe 474 // to do that unless we find cases where ergo leads to bad 475 // performance. 476 CFLS_LAB::compute_desired_plab_size(); 477 } 478 } 479 480 ParScanClosure::ParScanClosure(ParNewGeneration* g, 481 ParScanThreadState* par_scan_state) : 482 OopsInKlassOrGenClosure(g), _par_scan_state(par_scan_state), _g(g) 483 { 484 assert(_g->level() == 0, "Optimized for youngest generation"); 485 _boundary = _g->reserved().end(); 486 } 487 488 void ParScanWithBarrierClosure::do_oop(oop* p) { ParScanClosure::do_oop_work(p, true, false); } 489 void ParScanWithBarrierClosure::do_oop(narrowOop* p) { ParScanClosure::do_oop_work(p, true, false); } 490 491 void ParScanWithoutBarrierClosure::do_oop(oop* p) { ParScanClosure::do_oop_work(p, false, false); } 492 void ParScanWithoutBarrierClosure::do_oop(narrowOop* p) { ParScanClosure::do_oop_work(p, false, false); } 493 494 void ParRootScanWithBarrierTwoGensClosure::do_oop(oop* p) { ParScanClosure::do_oop_work(p, true, true); } 495 void ParRootScanWithBarrierTwoGensClosure::do_oop(narrowOop* p) { ParScanClosure::do_oop_work(p, true, true); } 496 497 void ParRootScanWithoutBarrierClosure::do_oop(oop* p) { ParScanClosure::do_oop_work(p, false, true); } 498 void ParRootScanWithoutBarrierClosure::do_oop(narrowOop* p) { ParScanClosure::do_oop_work(p, false, true); } 499 500 ParScanWeakRefClosure::ParScanWeakRefClosure(ParNewGeneration* g, 501 ParScanThreadState* par_scan_state) 502 : ScanWeakRefClosure(g), _par_scan_state(par_scan_state) 503 {} 504 505 void ParScanWeakRefClosure::do_oop(oop* p) { ParScanWeakRefClosure::do_oop_work(p); } 506 void ParScanWeakRefClosure::do_oop(narrowOop* p) { ParScanWeakRefClosure::do_oop_work(p); } 507 508 #ifdef WIN32 509 #pragma warning(disable: 4786) /* identifier was truncated to '255' characters in the browser information */ 510 #endif 511 512 ParEvacuateFollowersClosure::ParEvacuateFollowersClosure( 513 ParScanThreadState* par_scan_state_, 514 ParScanWithoutBarrierClosure* to_space_closure_, 515 ParScanWithBarrierClosure* old_gen_closure_, 516 ParRootScanWithoutBarrierClosure* to_space_root_closure_, 517 ParNewGeneration* par_gen_, 518 ParRootScanWithBarrierTwoGensClosure* old_gen_root_closure_, 519 ObjToScanQueueSet* task_queues_, 520 ParallelTaskTerminator* terminator_) : 521 522 _par_scan_state(par_scan_state_), 523 _to_space_closure(to_space_closure_), 524 _old_gen_closure(old_gen_closure_), 525 _to_space_root_closure(to_space_root_closure_), 526 _old_gen_root_closure(old_gen_root_closure_), 527 _par_gen(par_gen_), 528 _task_queues(task_queues_), 529 _terminator(terminator_) 530 {} 531 532 void ParEvacuateFollowersClosure::do_void() { 533 ObjToScanQueue* work_q = par_scan_state()->work_queue(); 534 535 while (true) { 536 537 // Scan to-space and old-gen objs until we run out of both. 538 oop obj_to_scan; 539 par_scan_state()->trim_queues(0); 540 541 // We have no local work, attempt to steal from other threads. 542 543 // attempt to steal work from promoted. 544 if (task_queues()->steal(par_scan_state()->thread_num(), 545 par_scan_state()->hash_seed(), 546 obj_to_scan)) { 547 bool res = work_q->push(obj_to_scan); 548 assert(res, "Empty queue should have room for a push."); 549 550 // if successful, goto Start. 551 continue; 552 553 // try global overflow list. 554 } else if (par_gen()->take_from_overflow_list(par_scan_state())) { 555 continue; 556 } 557 558 // Otherwise, offer termination. 559 par_scan_state()->start_term_time(); 560 if (terminator()->offer_termination()) break; 561 par_scan_state()->end_term_time(); 562 } 563 assert(par_gen()->_overflow_list == NULL && par_gen()->_num_par_pushes == 0, 564 "Broken overflow list?"); 565 // Finish the last termination pause. 566 par_scan_state()->end_term_time(); 567 } 568 569 ParNewGenTask::ParNewGenTask(ParNewGeneration* gen, Generation* old_gen, 570 HeapWord* young_old_boundary, ParScanThreadStateSet* state_set, 571 StrongRootsScope* strong_roots_scope) : 572 AbstractGangTask("ParNewGeneration collection"), 573 _gen(gen), _old_gen(old_gen), 574 _young_old_boundary(young_old_boundary), 575 _state_set(state_set), 576 _strong_roots_scope(strong_roots_scope) 577 {} 578 579 // Reset the terminator for the given number of 580 // active threads. 581 void ParNewGenTask::set_for_termination(uint active_workers) { 582 _state_set->reset(active_workers, _gen->promotion_failed()); 583 } 584 585 void ParNewGenTask::work(uint worker_id) { 586 GenCollectedHeap* gch = GenCollectedHeap::heap(); 587 // Since this is being done in a separate thread, need new resource 588 // and handle marks. 589 ResourceMark rm; 590 HandleMark hm; 591 592 ParScanThreadState& par_scan_state = _state_set->thread_state(worker_id); 593 assert(_state_set->is_valid(worker_id), "Should not have been called"); 594 595 par_scan_state.set_young_old_boundary(_young_old_boundary); 596 597 KlassScanClosure klass_scan_closure(&par_scan_state.to_space_root_closure(), 598 gch->rem_set()->klass_rem_set()); 599 CLDToKlassAndOopClosure cld_scan_closure(&klass_scan_closure, 600 &par_scan_state.to_space_root_closure(), 601 false); 602 603 par_scan_state.start_strong_roots(); 604 gch->gen_process_roots(_strong_roots_scope, 605 _gen->level(), 606 true, // Process younger gens, if any, 607 // as strong roots. 608 GenCollectedHeap::SO_ScavengeCodeCache, 609 GenCollectedHeap::StrongAndWeakRoots, 610 &par_scan_state.to_space_root_closure(), 611 &par_scan_state.older_gen_closure(), 612 &cld_scan_closure); 613 614 par_scan_state.end_strong_roots(); 615 616 // "evacuate followers". 617 par_scan_state.evacuate_followers_closure().do_void(); 618 } 619 620 #ifdef _MSC_VER 621 #pragma warning( push ) 622 #pragma warning( disable:4355 ) // 'this' : used in base member initializer list 623 #endif 624 ParNewGeneration:: 625 ParNewGeneration(ReservedSpace rs, size_t initial_byte_size, int level) 626 : DefNewGeneration(rs, initial_byte_size, level, "PCopy"), 627 _overflow_list(NULL), 628 _is_alive_closure(this), 629 _plab_stats(YoungPLABSize, PLABWeight) 630 { 631 NOT_PRODUCT(_overflow_counter = ParGCWorkQueueOverflowInterval;) 632 NOT_PRODUCT(_num_par_pushes = 0;) 633 _task_queues = new ObjToScanQueueSet(ParallelGCThreads); 634 guarantee(_task_queues != NULL, "task_queues allocation failure."); 635 636 for (uint i1 = 0; i1 < ParallelGCThreads; i1++) { 637 ObjToScanQueue *q = new ObjToScanQueue(); 638 guarantee(q != NULL, "work_queue Allocation failure."); 639 _task_queues->register_queue(i1, q); 640 } 641 642 for (uint i2 = 0; i2 < ParallelGCThreads; i2++) 643 _task_queues->queue(i2)->initialize(); 644 645 _overflow_stacks = NULL; 646 if (ParGCUseLocalOverflow) { 647 648 // typedef to workaround NEW_C_HEAP_ARRAY macro, which can not deal 649 // with ',' 650 typedef Stack<oop, mtGC> GCOopStack; 651 652 _overflow_stacks = NEW_C_HEAP_ARRAY(GCOopStack, ParallelGCThreads, mtGC); 653 for (size_t i = 0; i < ParallelGCThreads; ++i) { 654 new (_overflow_stacks + i) Stack<oop, mtGC>(); 655 } 656 } 657 658 if (UsePerfData) { 659 EXCEPTION_MARK; 660 ResourceMark rm; 661 662 const char* cname = 663 PerfDataManager::counter_name(_gen_counters->name_space(), "threads"); 664 PerfDataManager::create_constant(SUN_GC, cname, PerfData::U_None, 665 ParallelGCThreads, CHECK); 666 } 667 } 668 #ifdef _MSC_VER 669 #pragma warning( pop ) 670 #endif 671 672 // ParNewGeneration:: 673 ParKeepAliveClosure::ParKeepAliveClosure(ParScanWeakRefClosure* cl) : 674 DefNewGeneration::KeepAliveClosure(cl), _par_cl(cl) {} 675 676 template <class T> 677 void /*ParNewGeneration::*/ParKeepAliveClosure::do_oop_work(T* p) { 678 #ifdef ASSERT 679 { 680 assert(!oopDesc::is_null(*p), "expected non-null ref"); 681 oop obj = oopDesc::load_decode_heap_oop_not_null(p); 682 // We never expect to see a null reference being processed 683 // as a weak reference. 684 assert(obj->is_oop(), "expected an oop while scanning weak refs"); 685 } 686 #endif // ASSERT 687 688 _par_cl->do_oop_nv(p); 689 690 if (GenCollectedHeap::heap()->is_in_reserved(p)) { 691 oop obj = oopDesc::load_decode_heap_oop_not_null(p); 692 _rs->write_ref_field_gc_par(p, obj); 693 } 694 } 695 696 void /*ParNewGeneration::*/ParKeepAliveClosure::do_oop(oop* p) { ParKeepAliveClosure::do_oop_work(p); } 697 void /*ParNewGeneration::*/ParKeepAliveClosure::do_oop(narrowOop* p) { ParKeepAliveClosure::do_oop_work(p); } 698 699 // ParNewGeneration:: 700 KeepAliveClosure::KeepAliveClosure(ScanWeakRefClosure* cl) : 701 DefNewGeneration::KeepAliveClosure(cl) {} 702 703 template <class T> 704 void /*ParNewGeneration::*/KeepAliveClosure::do_oop_work(T* p) { 705 #ifdef ASSERT 706 { 707 assert(!oopDesc::is_null(*p), "expected non-null ref"); 708 oop obj = oopDesc::load_decode_heap_oop_not_null(p); 709 // We never expect to see a null reference being processed 710 // as a weak reference. 711 assert(obj->is_oop(), "expected an oop while scanning weak refs"); 712 } 713 #endif // ASSERT 714 715 _cl->do_oop_nv(p); 716 717 if (GenCollectedHeap::heap()->is_in_reserved(p)) { 718 oop obj = oopDesc::load_decode_heap_oop_not_null(p); 719 _rs->write_ref_field_gc_par(p, obj); 720 } 721 } 722 723 void /*ParNewGeneration::*/KeepAliveClosure::do_oop(oop* p) { KeepAliveClosure::do_oop_work(p); } 724 void /*ParNewGeneration::*/KeepAliveClosure::do_oop(narrowOop* p) { KeepAliveClosure::do_oop_work(p); } 725 726 template <class T> void ScanClosureWithParBarrier::do_oop_work(T* p) { 727 T heap_oop = oopDesc::load_heap_oop(p); 728 if (!oopDesc::is_null(heap_oop)) { 729 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop); 730 if ((HeapWord*)obj < _boundary) { 731 assert(!_g->to()->is_in_reserved(obj), "Scanning field twice?"); 732 oop new_obj = obj->is_forwarded() 733 ? obj->forwardee() 734 : _g->DefNewGeneration::copy_to_survivor_space(obj); 735 oopDesc::encode_store_heap_oop_not_null(p, new_obj); 736 } 737 if (_gc_barrier) { 738 // If p points to a younger generation, mark the card. 739 if ((HeapWord*)obj < _gen_boundary) { 740 _rs->write_ref_field_gc_par(p, obj); 741 } 742 } 743 } 744 } 745 746 void ScanClosureWithParBarrier::do_oop(oop* p) { ScanClosureWithParBarrier::do_oop_work(p); } 747 void ScanClosureWithParBarrier::do_oop(narrowOop* p) { ScanClosureWithParBarrier::do_oop_work(p); } 748 749 class ParNewRefProcTaskProxy: public AbstractGangTask { 750 typedef AbstractRefProcTaskExecutor::ProcessTask ProcessTask; 751 public: 752 ParNewRefProcTaskProxy(ProcessTask& task, 753 ParNewGeneration& gen, 754 Generation& old_gen, 755 HeapWord* young_old_boundary, 756 ParScanThreadStateSet& state_set); 757 758 private: 759 virtual void work(uint worker_id); 760 virtual void set_for_termination(uint active_workers) { 761 _state_set.terminator()->reset_for_reuse(active_workers); 762 } 763 private: 764 ParNewGeneration& _gen; 765 ProcessTask& _task; 766 Generation& _old_gen; 767 HeapWord* _young_old_boundary; 768 ParScanThreadStateSet& _state_set; 769 }; 770 771 ParNewRefProcTaskProxy::ParNewRefProcTaskProxy(ProcessTask& task, 772 ParNewGeneration& gen, 773 Generation& old_gen, 774 HeapWord* young_old_boundary, 775 ParScanThreadStateSet& state_set) 776 : AbstractGangTask("ParNewGeneration parallel reference processing"), 777 _gen(gen), 778 _task(task), 779 _old_gen(old_gen), 780 _young_old_boundary(young_old_boundary), 781 _state_set(state_set) 782 { 783 } 784 785 void ParNewRefProcTaskProxy::work(uint worker_id) 786 { 787 ResourceMark rm; 788 HandleMark hm; 789 ParScanThreadState& par_scan_state = _state_set.thread_state(worker_id); 790 par_scan_state.set_young_old_boundary(_young_old_boundary); 791 _task.work(worker_id, par_scan_state.is_alive_closure(), 792 par_scan_state.keep_alive_closure(), 793 par_scan_state.evacuate_followers_closure()); 794 } 795 796 class ParNewRefEnqueueTaskProxy: public AbstractGangTask { 797 typedef AbstractRefProcTaskExecutor::EnqueueTask EnqueueTask; 798 EnqueueTask& _task; 799 800 public: 801 ParNewRefEnqueueTaskProxy(EnqueueTask& task) 802 : AbstractGangTask("ParNewGeneration parallel reference enqueue"), 803 _task(task) 804 { } 805 806 virtual void work(uint worker_id) 807 { 808 _task.work(worker_id); 809 } 810 }; 811 812 813 void ParNewRefProcTaskExecutor::execute(ProcessTask& task) 814 { 815 GenCollectedHeap* gch = GenCollectedHeap::heap(); 816 FlexibleWorkGang* workers = gch->workers(); 817 assert(workers != NULL, "Need parallel worker threads."); 818 _state_set.reset(workers->active_workers(), _generation.promotion_failed()); 819 ParNewRefProcTaskProxy rp_task(task, _generation, *_generation.next_gen(), 820 _generation.reserved().end(), _state_set); 821 workers->run_task(&rp_task); 822 _state_set.reset(0 /* bad value in debug if not reset */, 823 _generation.promotion_failed()); 824 } 825 826 void ParNewRefProcTaskExecutor::execute(EnqueueTask& task) 827 { 828 GenCollectedHeap* gch = GenCollectedHeap::heap(); 829 FlexibleWorkGang* workers = gch->workers(); 830 assert(workers != NULL, "Need parallel worker threads."); 831 ParNewRefEnqueueTaskProxy enq_task(task); 832 workers->run_task(&enq_task); 833 } 834 835 void ParNewRefProcTaskExecutor::set_single_threaded_mode() 836 { 837 _state_set.flush(); 838 GenCollectedHeap* gch = GenCollectedHeap::heap(); 839 gch->save_marks(); 840 } 841 842 ScanClosureWithParBarrier:: 843 ScanClosureWithParBarrier(ParNewGeneration* g, bool gc_barrier) : 844 ScanClosure(g, gc_barrier) {} 845 846 EvacuateFollowersClosureGeneral:: 847 EvacuateFollowersClosureGeneral(GenCollectedHeap* gch, int level, 848 OopsInGenClosure* cur, 849 OopsInGenClosure* older) : 850 _gch(gch), _level(level), 851 _scan_cur_or_nonheap(cur), _scan_older(older) 852 {} 853 854 void EvacuateFollowersClosureGeneral::do_void() { 855 do { 856 // Beware: this call will lead to closure applications via virtual 857 // calls. 858 _gch->oop_since_save_marks_iterate(_level, 859 _scan_cur_or_nonheap, 860 _scan_older); 861 } while (!_gch->no_allocs_since_save_marks(_level)); 862 } 863 864 865 // A Generation that does parallel young-gen collection. 866 867 void ParNewGeneration::handle_promotion_failed(GenCollectedHeap* gch, ParScanThreadStateSet& thread_state_set) { 868 assert(_promo_failure_scan_stack.is_empty(), "post condition"); 869 _promo_failure_scan_stack.clear(true); // Clear cached segments. 870 871 remove_forwarding_pointers(); 872 if (PrintGCDetails) { 873 gclog_or_tty->print(" (promotion failed)"); 874 } 875 // All the spaces are in play for mark-sweep. 876 swap_spaces(); // Make life simpler for CMS || rescan; see 6483690. 877 from()->set_next_compaction_space(to()); 878 gch->set_incremental_collection_failed(); 879 // Inform the next generation that a promotion failure occurred. 880 _old_gen->promotion_failure_occurred(); 881 882 // Trace promotion failure in the parallel GC threads 883 thread_state_set.trace_promotion_failed(gc_tracer()); 884 // Single threaded code may have reported promotion failure to the global state 885 if (_promotion_failed_info.has_failed()) { 886 _gc_tracer.report_promotion_failed(_promotion_failed_info); 887 } 888 // Reset the PromotionFailureALot counters. 889 NOT_PRODUCT(gch->reset_promotion_should_fail();) 890 } 891 892 void ParNewGeneration::collect(bool full, 893 bool clear_all_soft_refs, 894 size_t size, 895 bool is_tlab) { 896 assert(full || size > 0, "otherwise we don't want to collect"); 897 898 GenCollectedHeap* gch = GenCollectedHeap::heap(); 899 900 _gc_timer->register_gc_start(); 901 902 AdaptiveSizePolicy* size_policy = gch->gen_policy()->size_policy(); 903 FlexibleWorkGang* workers = gch->workers(); 904 assert(workers != NULL, "Need workgang for parallel work"); 905 uint active_workers = 906 AdaptiveSizePolicy::calc_active_workers(workers->total_workers(), 907 workers->active_workers(), 908 Threads::number_of_non_daemon_threads()); 909 workers->set_active_workers(active_workers); 910 _old_gen = gch->old_gen(); 911 912 // If the next generation is too full to accommodate worst-case promotion 913 // from this generation, pass on collection; let the next generation 914 // do it. 915 if (!collection_attempt_is_safe()) { 916 gch->set_incremental_collection_failed(); // slight lie, in that we did not even attempt one 917 return; 918 } 919 assert(to()->is_empty(), "Else not collection_attempt_is_safe"); 920 921 _gc_tracer.report_gc_start(gch->gc_cause(), _gc_timer->gc_start()); 922 gch->trace_heap_before_gc(gc_tracer()); 923 924 init_assuming_no_promotion_failure(); 925 926 if (UseAdaptiveSizePolicy) { 927 set_survivor_overflow(false); 928 size_policy->minor_collection_begin(); 929 } 930 931 GCTraceTime t1(GCCauseString("GC", gch->gc_cause()), PrintGC && !PrintGCDetails, true, NULL, _gc_tracer.gc_id()); 932 // Capture heap used before collection (for printing). 933 size_t gch_prev_used = gch->used(); 934 935 age_table()->clear(); 936 to()->clear(SpaceDecorator::Mangle); 937 938 gch->save_marks(); 939 assert(workers != NULL, "Need parallel worker threads."); 940 uint n_workers = active_workers; 941 942 // Set the correct parallelism (number of queues) in the reference processor 943 ref_processor()->set_active_mt_degree(n_workers); 944 945 // Always set the terminator for the active number of workers 946 // because only those workers go through the termination protocol. 947 ParallelTaskTerminator _term(n_workers, task_queues()); 948 ParScanThreadStateSet thread_state_set(workers->active_workers(), 949 *to(), *this, *_old_gen, *task_queues(), 950 _overflow_stacks, desired_plab_sz(), _term); 951 952 { 953 StrongRootsScope srs(n_workers); 954 955 ParNewGenTask tsk(this, _old_gen, reserved().end(), &thread_state_set, &srs); 956 gch->rem_set()->prepare_for_younger_refs_iterate(true); 957 // It turns out that even when we're using 1 thread, doing the work in a 958 // separate thread causes wide variance in run times. We can't help this 959 // in the multi-threaded case, but we special-case n=1 here to get 960 // repeatable measurements of the 1-thread overhead of the parallel code. 961 if (n_workers > 1) { 962 workers->run_task(&tsk); 963 } else { 964 tsk.work(0); 965 } 966 } 967 968 thread_state_set.reset(0 /* Bad value in debug if not reset */, 969 promotion_failed()); 970 971 // Trace and reset failed promotion info. 972 if (promotion_failed()) { 973 thread_state_set.trace_promotion_failed(gc_tracer()); 974 } 975 976 // Process (weak) reference objects found during scavenge. 977 ReferenceProcessor* rp = ref_processor(); 978 IsAliveClosure is_alive(this); 979 ScanWeakRefClosure scan_weak_ref(this); 980 KeepAliveClosure keep_alive(&scan_weak_ref); 981 ScanClosure scan_without_gc_barrier(this, false); 982 ScanClosureWithParBarrier scan_with_gc_barrier(this, true); 983 set_promo_failure_scan_stack_closure(&scan_without_gc_barrier); 984 EvacuateFollowersClosureGeneral evacuate_followers(gch, _level, 985 &scan_without_gc_barrier, &scan_with_gc_barrier); 986 rp->setup_policy(clear_all_soft_refs); 987 // Can the mt_degree be set later (at run_task() time would be best)? 988 rp->set_active_mt_degree(active_workers); 989 ReferenceProcessorStats stats; 990 if (rp->processing_is_mt()) { 991 ParNewRefProcTaskExecutor task_executor(*this, thread_state_set); 992 stats = rp->process_discovered_references(&is_alive, &keep_alive, 993 &evacuate_followers, &task_executor, 994 _gc_timer, _gc_tracer.gc_id()); 995 } else { 996 thread_state_set.flush(); 997 gch->save_marks(); 998 stats = rp->process_discovered_references(&is_alive, &keep_alive, 999 &evacuate_followers, NULL, 1000 _gc_timer, _gc_tracer.gc_id()); 1001 } 1002 _gc_tracer.report_gc_reference_stats(stats); 1003 if (!promotion_failed()) { 1004 // Swap the survivor spaces. 1005 eden()->clear(SpaceDecorator::Mangle); 1006 from()->clear(SpaceDecorator::Mangle); 1007 if (ZapUnusedHeapArea) { 1008 // This is now done here because of the piece-meal mangling which 1009 // can check for valid mangling at intermediate points in the 1010 // collection(s). When a minor collection fails to collect 1011 // sufficient space resizing of the young generation can occur 1012 // an redistribute the spaces in the young generation. Mangle 1013 // here so that unzapped regions don't get distributed to 1014 // other spaces. 1015 to()->mangle_unused_area(); 1016 } 1017 swap_spaces(); 1018 1019 // A successful scavenge should restart the GC time limit count which is 1020 // for full GC's. 1021 size_policy->reset_gc_overhead_limit_count(); 1022 1023 assert(to()->is_empty(), "to space should be empty now"); 1024 1025 adjust_desired_tenuring_threshold(); 1026 } else { 1027 handle_promotion_failed(gch, thread_state_set); 1028 } 1029 // set new iteration safe limit for the survivor spaces 1030 from()->set_concurrent_iteration_safe_limit(from()->top()); 1031 to()->set_concurrent_iteration_safe_limit(to()->top()); 1032 1033 if (ResizePLAB) { 1034 plab_stats()->adjust_desired_plab_sz(n_workers); 1035 } 1036 1037 if (PrintGC && !PrintGCDetails) { 1038 gch->print_heap_change(gch_prev_used); 1039 } 1040 1041 TASKQUEUE_STATS_ONLY(if (PrintTerminationStats) thread_state_set.print_termination_stats()); 1042 TASKQUEUE_STATS_ONLY(if (PrintTaskqueue) thread_state_set.print_taskqueue_stats()); 1043 1044 if (UseAdaptiveSizePolicy) { 1045 size_policy->minor_collection_end(gch->gc_cause()); 1046 size_policy->avg_survived()->sample(from()->used()); 1047 } 1048 1049 // We need to use a monotonically non-decreasing time in ms 1050 // or we will see time-warp warnings and os::javaTimeMillis() 1051 // does not guarantee monotonicity. 1052 jlong now = os::javaTimeNanos() / NANOSECS_PER_MILLISEC; 1053 update_time_of_last_gc(now); 1054 1055 rp->set_enqueuing_is_done(true); 1056 if (rp->processing_is_mt()) { 1057 ParNewRefProcTaskExecutor task_executor(*this, thread_state_set); 1058 rp->enqueue_discovered_references(&task_executor); 1059 } else { 1060 rp->enqueue_discovered_references(NULL); 1061 } 1062 rp->verify_no_references_recorded(); 1063 1064 gch->trace_heap_after_gc(gc_tracer()); 1065 _gc_tracer.report_tenuring_threshold(tenuring_threshold()); 1066 1067 _gc_timer->register_gc_end(); 1068 1069 _gc_tracer.report_gc_end(_gc_timer->gc_end(), _gc_timer->time_partitions()); 1070 } 1071 1072 static int sum; 1073 void ParNewGeneration::waste_some_time() { 1074 for (int i = 0; i < 100; i++) { 1075 sum += i; 1076 } 1077 } 1078 1079 static const oop ClaimedForwardPtr = cast_to_oop<intptr_t>(0x4); 1080 1081 // Because of concurrency, there are times where an object for which 1082 // "is_forwarded()" is true contains an "interim" forwarding pointer 1083 // value. Such a value will soon be overwritten with a real value. 1084 // This method requires "obj" to have a forwarding pointer, and waits, if 1085 // necessary for a real one to be inserted, and returns it. 1086 1087 oop ParNewGeneration::real_forwardee(oop obj) { 1088 oop forward_ptr = obj->forwardee(); 1089 if (forward_ptr != ClaimedForwardPtr) { 1090 return forward_ptr; 1091 } else { 1092 return real_forwardee_slow(obj); 1093 } 1094 } 1095 1096 oop ParNewGeneration::real_forwardee_slow(oop obj) { 1097 // Spin-read if it is claimed but not yet written by another thread. 1098 oop forward_ptr = obj->forwardee(); 1099 while (forward_ptr == ClaimedForwardPtr) { 1100 waste_some_time(); 1101 assert(obj->is_forwarded(), "precondition"); 1102 forward_ptr = obj->forwardee(); 1103 } 1104 return forward_ptr; 1105 } 1106 1107 void ParNewGeneration::preserve_mark_if_necessary(oop obj, markOop m) { 1108 if (m->must_be_preserved_for_promotion_failure(obj)) { 1109 // We should really have separate per-worker stacks, rather 1110 // than use locking of a common pair of stacks. 1111 MutexLocker ml(ParGCRareEvent_lock); 1112 preserve_mark(obj, m); 1113 } 1114 } 1115 1116 // Multiple GC threads may try to promote an object. If the object 1117 // is successfully promoted, a forwarding pointer will be installed in 1118 // the object in the young generation. This method claims the right 1119 // to install the forwarding pointer before it copies the object, 1120 // thus avoiding the need to undo the copy as in 1121 // copy_to_survivor_space_avoiding_with_undo. 1122 1123 oop ParNewGeneration::copy_to_survivor_space( 1124 ParScanThreadState* par_scan_state, oop old, size_t sz, markOop m) { 1125 // In the sequential version, this assert also says that the object is 1126 // not forwarded. That might not be the case here. It is the case that 1127 // the caller observed it to be not forwarded at some time in the past. 1128 assert(is_in_reserved(old), "shouldn't be scavenging this oop"); 1129 1130 // The sequential code read "old->age()" below. That doesn't work here, 1131 // since the age is in the mark word, and that might be overwritten with 1132 // a forwarding pointer by a parallel thread. So we must save the mark 1133 // word in a local and then analyze it. 1134 oopDesc dummyOld; 1135 dummyOld.set_mark(m); 1136 assert(!dummyOld.is_forwarded(), 1137 "should not be called with forwarding pointer mark word."); 1138 1139 oop new_obj = NULL; 1140 oop forward_ptr; 1141 1142 // Try allocating obj in to-space (unless too old) 1143 if (dummyOld.age() < tenuring_threshold()) { 1144 new_obj = (oop)par_scan_state->alloc_in_to_space(sz); 1145 if (new_obj == NULL) { 1146 set_survivor_overflow(true); 1147 } 1148 } 1149 1150 if (new_obj == NULL) { 1151 // Either to-space is full or we decided to promote 1152 // try allocating obj tenured 1153 1154 // Attempt to install a null forwarding pointer (atomically), 1155 // to claim the right to install the real forwarding pointer. 1156 forward_ptr = old->forward_to_atomic(ClaimedForwardPtr); 1157 if (forward_ptr != NULL) { 1158 // someone else beat us to it. 1159 return real_forwardee(old); 1160 } 1161 1162 if (!_promotion_failed) { 1163 new_obj = _old_gen->par_promote(par_scan_state->thread_num(), 1164 old, m, sz); 1165 } 1166 1167 if (new_obj == NULL) { 1168 // promotion failed, forward to self 1169 _promotion_failed = true; 1170 new_obj = old; 1171 1172 preserve_mark_if_necessary(old, m); 1173 par_scan_state->register_promotion_failure(sz); 1174 } 1175 1176 old->forward_to(new_obj); 1177 forward_ptr = NULL; 1178 } else { 1179 // Is in to-space; do copying ourselves. 1180 Copy::aligned_disjoint_words((HeapWord*)old, (HeapWord*)new_obj, sz); 1181 assert(GenCollectedHeap::heap()->is_in_reserved(new_obj), "illegal forwarding pointer value."); 1182 forward_ptr = old->forward_to_atomic(new_obj); 1183 // Restore the mark word copied above. 1184 new_obj->set_mark(m); 1185 // Increment age if obj still in new generation 1186 new_obj->incr_age(); 1187 par_scan_state->age_table()->add(new_obj, sz); 1188 } 1189 assert(new_obj != NULL, "just checking"); 1190 1191 #ifndef PRODUCT 1192 // This code must come after the CAS test, or it will print incorrect 1193 // information. 1194 if (TraceScavenge) { 1195 gclog_or_tty->print_cr("{%s %s " PTR_FORMAT " -> " PTR_FORMAT " (%d)}", 1196 is_in_reserved(new_obj) ? "copying" : "tenuring", 1197 new_obj->klass()->internal_name(), p2i(old), p2i(new_obj), new_obj->size()); 1198 } 1199 #endif 1200 1201 if (forward_ptr == NULL) { 1202 oop obj_to_push = new_obj; 1203 if (par_scan_state->should_be_partially_scanned(obj_to_push, old)) { 1204 // Length field used as index of next element to be scanned. 1205 // Real length can be obtained from real_forwardee() 1206 arrayOop(old)->set_length(0); 1207 obj_to_push = old; 1208 assert(obj_to_push->is_forwarded() && obj_to_push->forwardee() != obj_to_push, 1209 "push forwarded object"); 1210 } 1211 // Push it on one of the queues of to-be-scanned objects. 1212 bool simulate_overflow = false; 1213 NOT_PRODUCT( 1214 if (ParGCWorkQueueOverflowALot && should_simulate_overflow()) { 1215 // simulate a stack overflow 1216 simulate_overflow = true; 1217 } 1218 ) 1219 if (simulate_overflow || !par_scan_state->work_queue()->push(obj_to_push)) { 1220 // Add stats for overflow pushes. 1221 if (Verbose && PrintGCDetails) { 1222 gclog_or_tty->print("queue overflow!\n"); 1223 } 1224 push_on_overflow_list(old, par_scan_state); 1225 TASKQUEUE_STATS_ONLY(par_scan_state->taskqueue_stats().record_overflow(0)); 1226 } 1227 1228 return new_obj; 1229 } 1230 1231 // Oops. Someone beat us to it. Undo the allocation. Where did we 1232 // allocate it? 1233 if (is_in_reserved(new_obj)) { 1234 // Must be in to_space. 1235 assert(to()->is_in_reserved(new_obj), "Checking"); 1236 if (forward_ptr == ClaimedForwardPtr) { 1237 // Wait to get the real forwarding pointer value. 1238 forward_ptr = real_forwardee(old); 1239 } 1240 par_scan_state->undo_alloc_in_to_space((HeapWord*)new_obj, sz); 1241 } 1242 1243 return forward_ptr; 1244 } 1245 1246 #ifndef PRODUCT 1247 // It's OK to call this multi-threaded; the worst thing 1248 // that can happen is that we'll get a bunch of closely 1249 // spaced simulated overflows, but that's OK, in fact 1250 // probably good as it would exercise the overflow code 1251 // under contention. 1252 bool ParNewGeneration::should_simulate_overflow() { 1253 if (_overflow_counter-- <= 0) { // just being defensive 1254 _overflow_counter = ParGCWorkQueueOverflowInterval; 1255 return true; 1256 } else { 1257 return false; 1258 } 1259 } 1260 #endif 1261 1262 // In case we are using compressed oops, we need to be careful. 1263 // If the object being pushed is an object array, then its length 1264 // field keeps track of the "grey boundary" at which the next 1265 // incremental scan will be done (see ParGCArrayScanChunk). 1266 // When using compressed oops, this length field is kept in the 1267 // lower 32 bits of the erstwhile klass word and cannot be used 1268 // for the overflow chaining pointer (OCP below). As such the OCP 1269 // would itself need to be compressed into the top 32-bits in this 1270 // case. Unfortunately, see below, in the event that we have a 1271 // promotion failure, the node to be pushed on the list can be 1272 // outside of the Java heap, so the heap-based pointer compression 1273 // would not work (we would have potential aliasing between C-heap 1274 // and Java-heap pointers). For this reason, when using compressed 1275 // oops, we simply use a worker-thread-local, non-shared overflow 1276 // list in the form of a growable array, with a slightly different 1277 // overflow stack draining strategy. If/when we start using fat 1278 // stacks here, we can go back to using (fat) pointer chains 1279 // (although some performance comparisons would be useful since 1280 // single global lists have their own performance disadvantages 1281 // as we were made painfully aware not long ago, see 6786503). 1282 #define BUSY (cast_to_oop<intptr_t>(0x1aff1aff)) 1283 void ParNewGeneration::push_on_overflow_list(oop from_space_obj, ParScanThreadState* par_scan_state) { 1284 assert(is_in_reserved(from_space_obj), "Should be from this generation"); 1285 if (ParGCUseLocalOverflow) { 1286 // In the case of compressed oops, we use a private, not-shared 1287 // overflow stack. 1288 par_scan_state->push_on_overflow_stack(from_space_obj); 1289 } else { 1290 assert(!UseCompressedOops, "Error"); 1291 // if the object has been forwarded to itself, then we cannot 1292 // use the klass pointer for the linked list. Instead we have 1293 // to allocate an oopDesc in the C-Heap and use that for the linked list. 1294 // XXX This is horribly inefficient when a promotion failure occurs 1295 // and should be fixed. XXX FIX ME !!! 1296 #ifndef PRODUCT 1297 Atomic::inc_ptr(&_num_par_pushes); 1298 assert(_num_par_pushes > 0, "Tautology"); 1299 #endif 1300 if (from_space_obj->forwardee() == from_space_obj) { 1301 oopDesc* listhead = NEW_C_HEAP_ARRAY(oopDesc, 1, mtGC); 1302 listhead->forward_to(from_space_obj); 1303 from_space_obj = listhead; 1304 } 1305 oop observed_overflow_list = _overflow_list; 1306 oop cur_overflow_list; 1307 do { 1308 cur_overflow_list = observed_overflow_list; 1309 if (cur_overflow_list != BUSY) { 1310 from_space_obj->set_klass_to_list_ptr(cur_overflow_list); 1311 } else { 1312 from_space_obj->set_klass_to_list_ptr(NULL); 1313 } 1314 observed_overflow_list = 1315 (oop)Atomic::cmpxchg_ptr(from_space_obj, &_overflow_list, cur_overflow_list); 1316 } while (cur_overflow_list != observed_overflow_list); 1317 } 1318 } 1319 1320 bool ParNewGeneration::take_from_overflow_list(ParScanThreadState* par_scan_state) { 1321 bool res; 1322 1323 if (ParGCUseLocalOverflow) { 1324 res = par_scan_state->take_from_overflow_stack(); 1325 } else { 1326 assert(!UseCompressedOops, "Error"); 1327 res = take_from_overflow_list_work(par_scan_state); 1328 } 1329 return res; 1330 } 1331 1332 1333 // *NOTE*: The overflow list manipulation code here and 1334 // in CMSCollector:: are very similar in shape, 1335 // except that in the CMS case we thread the objects 1336 // directly into the list via their mark word, and do 1337 // not need to deal with special cases below related 1338 // to chunking of object arrays and promotion failure 1339 // handling. 1340 // CR 6797058 has been filed to attempt consolidation of 1341 // the common code. 1342 // Because of the common code, if you make any changes in 1343 // the code below, please check the CMS version to see if 1344 // similar changes might be needed. 1345 // See CMSCollector::par_take_from_overflow_list() for 1346 // more extensive documentation comments. 1347 bool ParNewGeneration::take_from_overflow_list_work(ParScanThreadState* par_scan_state) { 1348 ObjToScanQueue* work_q = par_scan_state->work_queue(); 1349 // How many to take? 1350 size_t objsFromOverflow = MIN2((size_t)(work_q->max_elems() - work_q->size())/4, 1351 (size_t)ParGCDesiredObjsFromOverflowList); 1352 1353 assert(!UseCompressedOops, "Error"); 1354 assert(par_scan_state->overflow_stack() == NULL, "Error"); 1355 if (_overflow_list == NULL) return false; 1356 1357 // Otherwise, there was something there; try claiming the list. 1358 oop prefix = cast_to_oop(Atomic::xchg_ptr(BUSY, &_overflow_list)); 1359 // Trim off a prefix of at most objsFromOverflow items 1360 Thread* tid = Thread::current(); 1361 size_t spin_count = (size_t)ParallelGCThreads; 1362 size_t sleep_time_millis = MAX2((size_t)1, objsFromOverflow/100); 1363 for (size_t spin = 0; prefix == BUSY && spin < spin_count; spin++) { 1364 // someone grabbed it before we did ... 1365 // ... we spin for a short while... 1366 os::sleep(tid, sleep_time_millis, false); 1367 if (_overflow_list == NULL) { 1368 // nothing left to take 1369 return false; 1370 } else if (_overflow_list != BUSY) { 1371 // try and grab the prefix 1372 prefix = cast_to_oop(Atomic::xchg_ptr(BUSY, &_overflow_list)); 1373 } 1374 } 1375 if (prefix == NULL || prefix == BUSY) { 1376 // Nothing to take or waited long enough 1377 if (prefix == NULL) { 1378 // Write back the NULL in case we overwrote it with BUSY above 1379 // and it is still the same value. 1380 (void) Atomic::cmpxchg_ptr(NULL, &_overflow_list, BUSY); 1381 } 1382 return false; 1383 } 1384 assert(prefix != NULL && prefix != BUSY, "Error"); 1385 size_t i = 1; 1386 oop cur = prefix; 1387 while (i < objsFromOverflow && cur->klass_or_null() != NULL) { 1388 i++; cur = cur->list_ptr_from_klass(); 1389 } 1390 1391 // Reattach remaining (suffix) to overflow list 1392 if (cur->klass_or_null() == NULL) { 1393 // Write back the NULL in lieu of the BUSY we wrote 1394 // above and it is still the same value. 1395 if (_overflow_list == BUSY) { 1396 (void) Atomic::cmpxchg_ptr(NULL, &_overflow_list, BUSY); 1397 } 1398 } else { 1399 assert(cur->klass_or_null() != (Klass*)(address)BUSY, "Error"); 1400 oop suffix = cur->list_ptr_from_klass(); // suffix will be put back on global list 1401 cur->set_klass_to_list_ptr(NULL); // break off suffix 1402 // It's possible that the list is still in the empty(busy) state 1403 // we left it in a short while ago; in that case we may be 1404 // able to place back the suffix. 1405 oop observed_overflow_list = _overflow_list; 1406 oop cur_overflow_list = observed_overflow_list; 1407 bool attached = false; 1408 while (observed_overflow_list == BUSY || observed_overflow_list == NULL) { 1409 observed_overflow_list = 1410 (oop) Atomic::cmpxchg_ptr(suffix, &_overflow_list, cur_overflow_list); 1411 if (cur_overflow_list == observed_overflow_list) { 1412 attached = true; 1413 break; 1414 } else cur_overflow_list = observed_overflow_list; 1415 } 1416 if (!attached) { 1417 // Too bad, someone else got in in between; we'll need to do a splice. 1418 // Find the last item of suffix list 1419 oop last = suffix; 1420 while (last->klass_or_null() != NULL) { 1421 last = last->list_ptr_from_klass(); 1422 } 1423 // Atomically prepend suffix to current overflow list 1424 observed_overflow_list = _overflow_list; 1425 do { 1426 cur_overflow_list = observed_overflow_list; 1427 if (cur_overflow_list != BUSY) { 1428 // Do the splice ... 1429 last->set_klass_to_list_ptr(cur_overflow_list); 1430 } else { // cur_overflow_list == BUSY 1431 last->set_klass_to_list_ptr(NULL); 1432 } 1433 observed_overflow_list = 1434 (oop)Atomic::cmpxchg_ptr(suffix, &_overflow_list, cur_overflow_list); 1435 } while (cur_overflow_list != observed_overflow_list); 1436 } 1437 } 1438 1439 // Push objects on prefix list onto this thread's work queue 1440 assert(prefix != NULL && prefix != BUSY, "program logic"); 1441 cur = prefix; 1442 ssize_t n = 0; 1443 while (cur != NULL) { 1444 oop obj_to_push = cur->forwardee(); 1445 oop next = cur->list_ptr_from_klass(); 1446 cur->set_klass(obj_to_push->klass()); 1447 // This may be an array object that is self-forwarded. In that case, the list pointer 1448 // space, cur, is not in the Java heap, but rather in the C-heap and should be freed. 1449 if (!is_in_reserved(cur)) { 1450 // This can become a scaling bottleneck when there is work queue overflow coincident 1451 // with promotion failure. 1452 oopDesc* f = cur; 1453 FREE_C_HEAP_ARRAY(oopDesc, f); 1454 } else if (par_scan_state->should_be_partially_scanned(obj_to_push, cur)) { 1455 assert(arrayOop(cur)->length() == 0, "entire array remaining to be scanned"); 1456 obj_to_push = cur; 1457 } 1458 bool ok = work_q->push(obj_to_push); 1459 assert(ok, "Should have succeeded"); 1460 cur = next; 1461 n++; 1462 } 1463 TASKQUEUE_STATS_ONLY(par_scan_state->note_overflow_refill(n)); 1464 #ifndef PRODUCT 1465 assert(_num_par_pushes >= n, "Too many pops?"); 1466 Atomic::add_ptr(-(intptr_t)n, &_num_par_pushes); 1467 #endif 1468 return true; 1469 } 1470 #undef BUSY 1471 1472 void ParNewGeneration::ref_processor_init() { 1473 if (_ref_processor == NULL) { 1474 // Allocate and initialize a reference processor 1475 _ref_processor = 1476 new ReferenceProcessor(_reserved, // span 1477 ParallelRefProcEnabled && (ParallelGCThreads > 1), // mt processing 1478 (int) ParallelGCThreads, // mt processing degree 1479 refs_discovery_is_mt(), // mt discovery 1480 (int) ParallelGCThreads, // mt discovery degree 1481 refs_discovery_is_atomic(), // atomic_discovery 1482 NULL); // is_alive_non_header 1483 } 1484 } 1485 1486 const char* ParNewGeneration::name() const { 1487 return "par new generation"; 1488 }