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