1 /*
2 * Copyright (c) 2001, 2021, 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/serial/defNewGeneration.inline.hpp"
27 #include "gc/serial/serialGcRefProcProxyTask.hpp"
28 #include "gc/serial/serialHeap.inline.hpp"
29 #include "gc/serial/serialStringDedup.inline.hpp"
30 #include "gc/serial/tenuredGeneration.hpp"
31 #include "gc/shared/adaptiveSizePolicy.hpp"
32 #include "gc/shared/ageTable.inline.hpp"
33 #include "gc/shared/cardTableRS.hpp"
34 #include "gc/shared/collectorCounters.hpp"
35 #include "gc/shared/gcArguments.hpp"
36 #include "gc/shared/gcHeapSummary.hpp"
37 #include "gc/shared/gcLocker.hpp"
38 #include "gc/shared/gcPolicyCounters.hpp"
39 #include "gc/shared/gcTimer.hpp"
40 #include "gc/shared/gcTrace.hpp"
41 #include "gc/shared/gcTraceTime.inline.hpp"
42 #include "gc/shared/generationSpec.hpp"
43 #include "gc/shared/genOopClosures.inline.hpp"
44 #include "gc/shared/preservedMarks.inline.hpp"
45 #include "gc/shared/referencePolicy.hpp"
46 #include "gc/shared/referenceProcessorPhaseTimes.hpp"
47 #include "gc/shared/space.inline.hpp"
48 #include "gc/shared/spaceDecorator.inline.hpp"
49 #include "gc/shared/strongRootsScope.hpp"
50 #include "gc/shared/weakProcessor.hpp"
51 #include "logging/log.hpp"
52 #include "memory/iterator.inline.hpp"
53 #include "memory/resourceArea.hpp"
54 #include "oops/instanceRefKlass.hpp"
55 #include "oops/oop.inline.hpp"
56 #include "runtime/java.hpp"
57 #include "runtime/prefetch.inline.hpp"
58 #include "runtime/thread.inline.hpp"
59 #include "utilities/align.hpp"
60 #include "utilities/copy.hpp"
61 #include "utilities/globalDefinitions.hpp"
62 #include "utilities/stack.inline.hpp"
63
64 //
65 // DefNewGeneration functions.
66
67 // Methods of protected closure types.
68
69 DefNewGeneration::IsAliveClosure::IsAliveClosure(Generation* young_gen) : _young_gen(young_gen) {
70 assert(_young_gen->kind() == Generation::DefNew, "Expected the young generation here");
71 }
72
73 bool DefNewGeneration::IsAliveClosure::do_object_b(oop p) {
74 return cast_from_oop<HeapWord*>(p) >= _young_gen->reserved().end() || p->is_forwarded();
75 }
76
77 DefNewGeneration::KeepAliveClosure::
78 KeepAliveClosure(ScanWeakRefClosure* cl) : _cl(cl) {
79 _rs = GenCollectedHeap::heap()->rem_set();
80 }
81
82 void DefNewGeneration::KeepAliveClosure::do_oop(oop* p) { DefNewGeneration::KeepAliveClosure::do_oop_work(p); }
83 void DefNewGeneration::KeepAliveClosure::do_oop(narrowOop* p) { DefNewGeneration::KeepAliveClosure::do_oop_work(p); }
84
85
86 DefNewGeneration::FastKeepAliveClosure::
87 FastKeepAliveClosure(DefNewGeneration* g, ScanWeakRefClosure* cl) :
88 DefNewGeneration::KeepAliveClosure(cl) {
89 _boundary = g->reserved().end();
90 }
91
92 void DefNewGeneration::FastKeepAliveClosure::do_oop(oop* p) { DefNewGeneration::FastKeepAliveClosure::do_oop_work(p); }
93 void DefNewGeneration::FastKeepAliveClosure::do_oop(narrowOop* p) { DefNewGeneration::FastKeepAliveClosure::do_oop_work(p); }
94
95 DefNewGeneration::FastEvacuateFollowersClosure::
96 FastEvacuateFollowersClosure(SerialHeap* heap,
97 DefNewScanClosure* cur,
98 DefNewYoungerGenClosure* older) :
99 _heap(heap), _scan_cur_or_nonheap(cur), _scan_older(older)
100 {
101 }
102
103 void DefNewGeneration::FastEvacuateFollowersClosure::do_void() {
104 do {
105 _heap->oop_since_save_marks_iterate(_scan_cur_or_nonheap, _scan_older);
106 } while (!_heap->no_allocs_since_save_marks());
107 guarantee(_heap->young_gen()->promo_failure_scan_is_complete(), "Failed to finish scan");
108 }
109
110 void CLDScanClosure::do_cld(ClassLoaderData* cld) {
111 NOT_PRODUCT(ResourceMark rm);
112 log_develop_trace(gc, scavenge)("CLDScanClosure::do_cld " PTR_FORMAT ", %s, dirty: %s",
113 p2i(cld),
114 cld->loader_name_and_id(),
115 cld->has_modified_oops() ? "true" : "false");
116
117 // If the cld has not been dirtied we know that there's
118 // no references into the young gen and we can skip it.
119 if (cld->has_modified_oops()) {
120
121 // Tell the closure which CLD is being scanned so that it can be dirtied
122 // if oops are left pointing into the young gen.
123 _scavenge_closure->set_scanned_cld(cld);
124
125 // Clean the cld since we're going to scavenge all the metadata.
126 cld->oops_do(_scavenge_closure, ClassLoaderData::_claim_none, /*clear_modified_oops*/true);
127
128 _scavenge_closure->set_scanned_cld(NULL);
129 }
130 }
131
132 ScanWeakRefClosure::ScanWeakRefClosure(DefNewGeneration* g) :
133 _g(g)
134 {
135 _boundary = _g->reserved().end();
136 }
137
138 DefNewGeneration::DefNewGeneration(ReservedSpace rs,
139 size_t initial_size,
140 size_t min_size,
141 size_t max_size,
142 const char* policy)
143 : Generation(rs, initial_size),
144 _preserved_marks_set(false /* in_c_heap */),
145 _promo_failure_drain_in_progress(false),
146 _should_allocate_from_space(false),
147 _string_dedup_requests()
148 {
149 MemRegion cmr((HeapWord*)_virtual_space.low(),
150 (HeapWord*)_virtual_space.high());
151 GenCollectedHeap* gch = GenCollectedHeap::heap();
152
153 gch->rem_set()->resize_covered_region(cmr);
154
155 _eden_space = new ContiguousSpace();
156 _from_space = new ContiguousSpace();
157 _to_space = new ContiguousSpace();
158
159 // Compute the maximum eden and survivor space sizes. These sizes
160 // are computed assuming the entire reserved space is committed.
161 // These values are exported as performance counters.
162 uintx size = _virtual_space.reserved_size();
163 _max_survivor_size = compute_survivor_size(size, SpaceAlignment);
164 _max_eden_size = size - (2*_max_survivor_size);
165
166 // allocate the performance counters
167
168 // Generation counters -- generation 0, 3 subspaces
169 _gen_counters = new GenerationCounters("new", 0, 3,
170 min_size, max_size, &_virtual_space);
171 _gc_counters = new CollectorCounters(policy, 0);
172
173 _eden_counters = new CSpaceCounters("eden", 0, _max_eden_size, _eden_space,
174 _gen_counters);
175 _from_counters = new CSpaceCounters("s0", 1, _max_survivor_size, _from_space,
176 _gen_counters);
177 _to_counters = new CSpaceCounters("s1", 2, _max_survivor_size, _to_space,
178 _gen_counters);
179
180 compute_space_boundaries(0, SpaceDecorator::Clear, SpaceDecorator::Mangle);
181 update_counters();
182 _old_gen = NULL;
183 _tenuring_threshold = MaxTenuringThreshold;
184 _pretenure_size_threshold_words = PretenureSizeThreshold >> LogHeapWordSize;
185
186 _gc_timer = new (ResourceObj::C_HEAP, mtGC) STWGCTimer();
187 }
188
189 void DefNewGeneration::compute_space_boundaries(uintx minimum_eden_size,
190 bool clear_space,
191 bool mangle_space) {
192 // If the spaces are being cleared (only done at heap initialization
193 // currently), the survivor spaces need not be empty.
194 // Otherwise, no care is taken for used areas in the survivor spaces
195 // so check.
196 assert(clear_space || (to()->is_empty() && from()->is_empty()),
197 "Initialization of the survivor spaces assumes these are empty");
198
199 // Compute sizes
200 uintx size = _virtual_space.committed_size();
201 uintx survivor_size = compute_survivor_size(size, SpaceAlignment);
202 uintx eden_size = size - (2*survivor_size);
203 assert(eden_size > 0 && survivor_size <= eden_size, "just checking");
204
205 if (eden_size < minimum_eden_size) {
206 // May happen due to 64Kb rounding, if so adjust eden size back up
207 minimum_eden_size = align_up(minimum_eden_size, SpaceAlignment);
208 uintx maximum_survivor_size = (size - minimum_eden_size) / 2;
209 uintx unaligned_survivor_size =
210 align_down(maximum_survivor_size, SpaceAlignment);
211 survivor_size = MAX2(unaligned_survivor_size, SpaceAlignment);
212 eden_size = size - (2*survivor_size);
213 assert(eden_size > 0 && survivor_size <= eden_size, "just checking");
214 assert(eden_size >= minimum_eden_size, "just checking");
215 }
216
217 char *eden_start = _virtual_space.low();
218 char *from_start = eden_start + eden_size;
219 char *to_start = from_start + survivor_size;
220 char *to_end = to_start + survivor_size;
221
222 assert(to_end == _virtual_space.high(), "just checking");
223 assert(Space::is_aligned(eden_start), "checking alignment");
224 assert(Space::is_aligned(from_start), "checking alignment");
225 assert(Space::is_aligned(to_start), "checking alignment");
226
227 MemRegion edenMR((HeapWord*)eden_start, (HeapWord*)from_start);
228 MemRegion fromMR((HeapWord*)from_start, (HeapWord*)to_start);
229 MemRegion toMR ((HeapWord*)to_start, (HeapWord*)to_end);
230
231 // A minimum eden size implies that there is a part of eden that
232 // is being used and that affects the initialization of any
233 // newly formed eden.
234 bool live_in_eden = minimum_eden_size > 0;
235
236 // If not clearing the spaces, do some checking to verify that
237 // the space are already mangled.
238 if (!clear_space) {
239 // Must check mangling before the spaces are reshaped. Otherwise,
240 // the bottom or end of one space may have moved into another
241 // a failure of the check may not correctly indicate which space
242 // is not properly mangled.
243 if (ZapUnusedHeapArea) {
244 HeapWord* limit = (HeapWord*) _virtual_space.high();
245 eden()->check_mangled_unused_area(limit);
246 from()->check_mangled_unused_area(limit);
247 to()->check_mangled_unused_area(limit);
248 }
249 }
250
251 // Reset the spaces for their new regions.
252 eden()->initialize(edenMR,
253 clear_space && !live_in_eden,
254 SpaceDecorator::Mangle);
255 // If clear_space and live_in_eden, we will not have cleared any
256 // portion of eden above its top. This can cause newly
257 // expanded space not to be mangled if using ZapUnusedHeapArea.
258 // We explicitly do such mangling here.
259 if (ZapUnusedHeapArea && clear_space && live_in_eden && mangle_space) {
260 eden()->mangle_unused_area();
261 }
262 from()->initialize(fromMR, clear_space, mangle_space);
263 to()->initialize(toMR, clear_space, mangle_space);
264
265 // Set next compaction spaces.
266 eden()->set_next_compaction_space(from());
267 // The to-space is normally empty before a compaction so need
268 // not be considered. The exception is during promotion
269 // failure handling when to-space can contain live objects.
270 from()->set_next_compaction_space(NULL);
271 }
272
273 void DefNewGeneration::swap_spaces() {
274 ContiguousSpace* s = from();
275 _from_space = to();
276 _to_space = s;
277 eden()->set_next_compaction_space(from());
278 // The to-space is normally empty before a compaction so need
279 // not be considered. The exception is during promotion
280 // failure handling when to-space can contain live objects.
281 from()->set_next_compaction_space(NULL);
282
283 if (UsePerfData) {
284 CSpaceCounters* c = _from_counters;
285 _from_counters = _to_counters;
286 _to_counters = c;
287 }
288 }
289
290 bool DefNewGeneration::expand(size_t bytes) {
291 MutexLocker x(ExpandHeap_lock);
292 HeapWord* prev_high = (HeapWord*) _virtual_space.high();
293 bool success = _virtual_space.expand_by(bytes);
294 if (success && ZapUnusedHeapArea) {
295 // Mangle newly committed space immediately because it
296 // can be done here more simply that after the new
297 // spaces have been computed.
298 HeapWord* new_high = (HeapWord*) _virtual_space.high();
299 MemRegion mangle_region(prev_high, new_high);
300 SpaceMangler::mangle_region(mangle_region);
301 }
302
303 // Do not attempt an expand-to-the reserve size. The
304 // request should properly observe the maximum size of
305 // the generation so an expand-to-reserve should be
306 // unnecessary. Also a second call to expand-to-reserve
307 // value potentially can cause an undue expansion.
308 // For example if the first expand fail for unknown reasons,
309 // but the second succeeds and expands the heap to its maximum
310 // value.
311 if (GCLocker::is_active()) {
312 log_debug(gc)("Garbage collection disabled, expanded heap instead");
313 }
314
315 return success;
316 }
317
318 size_t DefNewGeneration::calculate_thread_increase_size(int threads_count) const {
319 size_t thread_increase_size = 0;
320 // Check an overflow at 'threads_count * NewSizeThreadIncrease'.
321 if (threads_count > 0 && NewSizeThreadIncrease <= max_uintx / threads_count) {
322 thread_increase_size = threads_count * NewSizeThreadIncrease;
323 }
324 return thread_increase_size;
325 }
326
327 size_t DefNewGeneration::adjust_for_thread_increase(size_t new_size_candidate,
328 size_t new_size_before,
329 size_t alignment,
330 size_t thread_increase_size) const {
331 size_t desired_new_size = new_size_before;
332
333 if (NewSizeThreadIncrease > 0 && thread_increase_size > 0) {
334
335 // 1. Check an overflow at 'new_size_candidate + thread_increase_size'.
336 if (new_size_candidate <= max_uintx - thread_increase_size) {
337 new_size_candidate += thread_increase_size;
338
339 // 2. Check an overflow at 'align_up'.
340 size_t aligned_max = ((max_uintx - alignment) & ~(alignment-1));
341 if (new_size_candidate <= aligned_max) {
342 desired_new_size = align_up(new_size_candidate, alignment);
343 }
344 }
345 }
346
347 return desired_new_size;
348 }
349
350 void DefNewGeneration::compute_new_size() {
351 // This is called after a GC that includes the old generation, so from-space
352 // will normally be empty.
353 // Note that we check both spaces, since if scavenge failed they revert roles.
354 // If not we bail out (otherwise we would have to relocate the objects).
355 if (!from()->is_empty() || !to()->is_empty()) {
356 return;
357 }
358
359 GenCollectedHeap* gch = GenCollectedHeap::heap();
360
361 size_t old_size = gch->old_gen()->capacity();
362 size_t new_size_before = _virtual_space.committed_size();
363 size_t min_new_size = initial_size();
364 size_t max_new_size = reserved().byte_size();
365 assert(min_new_size <= new_size_before &&
366 new_size_before <= max_new_size,
367 "just checking");
368 // All space sizes must be multiples of Generation::GenGrain.
369 size_t alignment = Generation::GenGrain;
370
371 int threads_count = Threads::number_of_non_daemon_threads();
372 size_t thread_increase_size = calculate_thread_increase_size(threads_count);
373
374 size_t new_size_candidate = old_size / NewRatio;
375 // Compute desired new generation size based on NewRatio and NewSizeThreadIncrease
376 // and reverts to previous value if any overflow happens
377 size_t desired_new_size = adjust_for_thread_increase(new_size_candidate, new_size_before,
378 alignment, thread_increase_size);
379
380 // Adjust new generation size
381 desired_new_size = clamp(desired_new_size, min_new_size, max_new_size);
382 assert(desired_new_size <= max_new_size, "just checking");
383
384 bool changed = false;
385 if (desired_new_size > new_size_before) {
386 size_t change = desired_new_size - new_size_before;
387 assert(change % alignment == 0, "just checking");
388 if (expand(change)) {
389 changed = true;
390 }
391 // If the heap failed to expand to the desired size,
392 // "changed" will be false. If the expansion failed
393 // (and at this point it was expected to succeed),
394 // ignore the failure (leaving "changed" as false).
395 }
396 if (desired_new_size < new_size_before && eden()->is_empty()) {
397 // bail out of shrinking if objects in eden
398 size_t change = new_size_before - desired_new_size;
399 assert(change % alignment == 0, "just checking");
400 _virtual_space.shrink_by(change);
401 changed = true;
402 }
403 if (changed) {
404 // The spaces have already been mangled at this point but
405 // may not have been cleared (set top = bottom) and should be.
406 // Mangling was done when the heap was being expanded.
407 compute_space_boundaries(eden()->used(),
408 SpaceDecorator::Clear,
409 SpaceDecorator::DontMangle);
410 MemRegion cmr((HeapWord*)_virtual_space.low(),
411 (HeapWord*)_virtual_space.high());
412 gch->rem_set()->resize_covered_region(cmr);
413
414 log_debug(gc, ergo, heap)(
415 "New generation size " SIZE_FORMAT "K->" SIZE_FORMAT "K [eden=" SIZE_FORMAT "K,survivor=" SIZE_FORMAT "K]",
416 new_size_before/K, _virtual_space.committed_size()/K,
417 eden()->capacity()/K, from()->capacity()/K);
418 log_trace(gc, ergo, heap)(
419 " [allowed " SIZE_FORMAT "K extra for %d threads]",
420 thread_increase_size/K, threads_count);
421 }
422 }
423
424
425 size_t DefNewGeneration::capacity() const {
426 return eden()->capacity()
427 + from()->capacity(); // to() is only used during scavenge
428 }
429
430
431 size_t DefNewGeneration::used() const {
432 return eden()->used()
433 + from()->used(); // to() is only used during scavenge
434 }
435
436
437 size_t DefNewGeneration::free() const {
438 return eden()->free()
439 + from()->free(); // to() is only used during scavenge
440 }
441
442 size_t DefNewGeneration::max_capacity() const {
443 const size_t reserved_bytes = reserved().byte_size();
444 return reserved_bytes - compute_survivor_size(reserved_bytes, SpaceAlignment);
445 }
446
447 size_t DefNewGeneration::unsafe_max_alloc_nogc() const {
448 return eden()->free();
449 }
450
451 size_t DefNewGeneration::capacity_before_gc() const {
452 return eden()->capacity();
453 }
454
455 size_t DefNewGeneration::contiguous_available() const {
456 return eden()->free();
457 }
458
459
460 HeapWord* volatile* DefNewGeneration::top_addr() const { return eden()->top_addr(); }
461 HeapWord** DefNewGeneration::end_addr() const { return eden()->end_addr(); }
462
463 void DefNewGeneration::object_iterate(ObjectClosure* blk) {
464 eden()->object_iterate(blk);
465 from()->object_iterate(blk);
466 }
467
468
469 void DefNewGeneration::space_iterate(SpaceClosure* blk,
470 bool usedOnly) {
471 blk->do_space(eden());
472 blk->do_space(from());
473 blk->do_space(to());
474 }
475
476 // The last collection bailed out, we are running out of heap space,
477 // so we try to allocate the from-space, too.
478 HeapWord* DefNewGeneration::allocate_from_space(size_t size) {
479 bool should_try_alloc = should_allocate_from_space() || GCLocker::is_active_and_needs_gc();
480
481 // If the Heap_lock is not locked by this thread, this will be called
482 // again later with the Heap_lock held.
483 bool do_alloc = should_try_alloc && (Heap_lock->owned_by_self() || (SafepointSynchronize::is_at_safepoint() && Thread::current()->is_VM_thread()));
484
485 HeapWord* result = NULL;
486 if (do_alloc) {
487 result = from()->allocate(size);
488 }
489
490 log_trace(gc, alloc)("DefNewGeneration::allocate_from_space(" SIZE_FORMAT "): will_fail: %s heap_lock: %s free: " SIZE_FORMAT "%s%s returns %s",
491 size,
492 GenCollectedHeap::heap()->incremental_collection_will_fail(false /* don't consult_young */) ?
493 "true" : "false",
494 Heap_lock->is_locked() ? "locked" : "unlocked",
495 from()->free(),
496 should_try_alloc ? "" : " should_allocate_from_space: NOT",
497 do_alloc ? " Heap_lock is not owned by self" : "",
498 result == NULL ? "NULL" : "object");
499
500 return result;
501 }
502
503 HeapWord* DefNewGeneration::expand_and_allocate(size_t size, bool is_tlab) {
504 // We don't attempt to expand the young generation (but perhaps we should.)
505 return allocate(size, is_tlab);
506 }
507
508 void DefNewGeneration::adjust_desired_tenuring_threshold() {
509 // Set the desired survivor size to half the real survivor space
510 size_t const survivor_capacity = to()->capacity() / HeapWordSize;
511 size_t const desired_survivor_size = (size_t)((((double)survivor_capacity) * TargetSurvivorRatio) / 100);
512
513 _tenuring_threshold = age_table()->compute_tenuring_threshold(desired_survivor_size);
514
515 if (UsePerfData) {
516 GCPolicyCounters* gc_counters = GenCollectedHeap::heap()->counters();
517 gc_counters->tenuring_threshold()->set_value(_tenuring_threshold);
518 gc_counters->desired_survivor_size()->set_value(desired_survivor_size * oopSize);
519 }
520
521 age_table()->print_age_table(_tenuring_threshold);
522 }
523
524 void DefNewGeneration::collect(bool full,
525 bool clear_all_soft_refs,
526 size_t size,
527 bool is_tlab) {
528 assert(full || size > 0, "otherwise we don't want to collect");
529
530 SerialHeap* heap = SerialHeap::heap();
531
532 _gc_timer->register_gc_start();
533 DefNewTracer gc_tracer;
534 gc_tracer.report_gc_start(heap->gc_cause(), _gc_timer->gc_start());
535
536 _old_gen = heap->old_gen();
537
538 // If the next generation is too full to accommodate promotion
539 // from this generation, pass on collection; let the next generation
540 // do it.
541 if (!collection_attempt_is_safe()) {
542 log_trace(gc)(":: Collection attempt not safe ::");
543 heap->set_incremental_collection_failed(); // Slight lie: we did not even attempt one
544 return;
545 }
546 assert(to()->is_empty(), "Else not collection_attempt_is_safe");
547
548 init_assuming_no_promotion_failure();
549
550 GCTraceTime(Trace, gc, phases) tm("DefNew", NULL, heap->gc_cause());
551
552 heap->trace_heap_before_gc(&gc_tracer);
553
554 // These can be shared for all code paths
555 IsAliveClosure is_alive(this);
556 ScanWeakRefClosure scan_weak_ref(this);
557
558 age_table()->clear();
559 to()->clear(SpaceDecorator::Mangle);
560 // The preserved marks should be empty at the start of the GC.
561 _preserved_marks_set.init(1);
562
563 assert(heap->no_allocs_since_save_marks(),
564 "save marks have not been newly set.");
565
566 DefNewScanClosure scan_closure(this);
567 DefNewYoungerGenClosure younger_gen_closure(this, _old_gen);
568
569 CLDScanClosure cld_scan_closure(&scan_closure);
570
571 set_promo_failure_scan_stack_closure(&scan_closure);
572 FastEvacuateFollowersClosure evacuate_followers(heap,
573 &scan_closure,
574 &younger_gen_closure);
575
576 assert(heap->no_allocs_since_save_marks(),
577 "save marks have not been newly set.");
578
579 {
580 StrongRootsScope srs(0);
581
582 heap->young_process_roots(&scan_closure,
583 &younger_gen_closure,
584 &cld_scan_closure);
585 }
586
587 // "evacuate followers".
588 evacuate_followers.do_void();
589
590 FastKeepAliveClosure keep_alive(this, &scan_weak_ref);
591 ReferenceProcessor* rp = ref_processor();
592 ReferenceProcessorPhaseTimes pt(_gc_timer, rp->max_num_queues());
593 SerialGCRefProcProxyTask task(is_alive, keep_alive, evacuate_followers);
594 const ReferenceProcessorStats& stats = rp->process_discovered_references(task, pt);
595 gc_tracer.report_gc_reference_stats(stats);
596 gc_tracer.report_tenuring_threshold(tenuring_threshold());
597 pt.print_all_references();
598
599 assert(heap->no_allocs_since_save_marks(), "save marks have not been newly set.");
600
601 WeakProcessor::weak_oops_do(&is_alive, &keep_alive);
602
603 // Verify that the usage of keep_alive didn't copy any objects.
604 assert(heap->no_allocs_since_save_marks(), "save marks have not been newly set.");
605
606 _string_dedup_requests.flush();
607
608 if (!_promotion_failed) {
609 // Swap the survivor spaces.
610 eden()->clear(SpaceDecorator::Mangle);
611 from()->clear(SpaceDecorator::Mangle);
612 if (ZapUnusedHeapArea) {
613 // This is now done here because of the piece-meal mangling which
614 // can check for valid mangling at intermediate points in the
615 // collection(s). When a young collection fails to collect
616 // sufficient space resizing of the young generation can occur
617 // an redistribute the spaces in the young generation. Mangle
618 // here so that unzapped regions don't get distributed to
619 // other spaces.
620 to()->mangle_unused_area();
621 }
622 swap_spaces();
623
624 assert(to()->is_empty(), "to space should be empty now");
625
626 adjust_desired_tenuring_threshold();
627
628 // A successful scavenge should restart the GC time limit count which is
629 // for full GC's.
630 AdaptiveSizePolicy* size_policy = heap->size_policy();
631 size_policy->reset_gc_overhead_limit_count();
632 assert(!heap->incremental_collection_failed(), "Should be clear");
633 } else {
634 assert(_promo_failure_scan_stack.is_empty(), "post condition");
635 _promo_failure_scan_stack.clear(true); // Clear cached segments.
636
637 remove_forwarding_pointers();
638 log_info(gc, promotion)("Promotion failed");
639 // Add to-space to the list of space to compact
640 // when a promotion failure has occurred. In that
641 // case there can be live objects in to-space
642 // as a result of a partial evacuation of eden
643 // and from-space.
644 swap_spaces(); // For uniformity wrt ParNewGeneration.
645 from()->set_next_compaction_space(to());
646 heap->set_incremental_collection_failed();
647
648 // Inform the next generation that a promotion failure occurred.
649 _old_gen->promotion_failure_occurred();
650 gc_tracer.report_promotion_failed(_promotion_failed_info);
651
652 // Reset the PromotionFailureALot counters.
653 NOT_PRODUCT(heap->reset_promotion_should_fail();)
654 }
655 // We should have processed and cleared all the preserved marks.
656 _preserved_marks_set.reclaim();
657
658 heap->trace_heap_after_gc(&gc_tracer);
659
660 _gc_timer->register_gc_end();
661
662 gc_tracer.report_gc_end(_gc_timer->gc_end(), _gc_timer->time_partitions());
663 }
664
665 void DefNewGeneration::init_assuming_no_promotion_failure() {
666 _promotion_failed = false;
667 _promotion_failed_info.reset();
668 from()->set_next_compaction_space(NULL);
669 }
670
671 void DefNewGeneration::remove_forwarding_pointers() {
672 RemoveForwardedPointerClosure rspc;
673 eden()->object_iterate(&rspc);
674 from()->object_iterate(&rspc);
675 restore_preserved_marks();
676 }
677
678 void DefNewGeneration::restore_preserved_marks() {
679 _preserved_marks_set.restore(NULL);
680 }
681
682 void DefNewGeneration::handle_promotion_failure(oop old) {
683 log_debug(gc, promotion)("Promotion failure size = " SIZE_FORMAT ") ", old->size());
684
685 _promotion_failed = true;
686 _promotion_failed_info.register_copy_failure(old->size());
687 _preserved_marks_set.get()->push_if_necessary(old, old->mark());
688 // forward to self
689 old->forward_to_self();
690
691 _promo_failure_scan_stack.push(old);
692
693 if (!_promo_failure_drain_in_progress) {
694 // prevent recursion in copy_to_survivor_space()
695 _promo_failure_drain_in_progress = true;
696 drain_promo_failure_scan_stack();
697 _promo_failure_drain_in_progress = false;
698 }
699 }
700
701 oop DefNewGeneration::copy_to_survivor_space(oop old) {
702 assert(is_in_reserved(old) && !old->is_forwarded(),
703 "shouldn't be scavenging this oop");
704 size_t s = old->size();
705 oop obj = NULL;
706
707 // Try allocating obj in to-space (unless too old)
708 if (old->age() < tenuring_threshold()) {
709 obj = cast_to_oop(to()->allocate(s));
710 }
711
712 bool new_obj_is_tenured = false;
713 // Otherwise try allocating obj tenured
714 if (obj == NULL) {
715 obj = _old_gen->promote(old, s);
716 if (obj == NULL) {
717 handle_promotion_failure(old);
718 return old;
719 }
720 new_obj_is_tenured = true;
721 } else {
722 // Prefetch beyond obj
723 const intx interval = PrefetchCopyIntervalInBytes;
724 Prefetch::write(obj, interval);
725
726 // Copy obj
727 Copy::aligned_disjoint_words(cast_from_oop<HeapWord*>(old), cast_from_oop<HeapWord*>(obj), s);
728
729 // Increment age if obj still in new generation
730 obj->incr_age();
731 age_table()->add(obj, s);
732 }
733
734 // Done, insert forward pointer to obj in this header
735 old->forward_to(obj);
736
737 if (SerialStringDedup::is_candidate_from_evacuation(obj, new_obj_is_tenured)) {
738 // Record old; request adds a new weak reference, which reference
739 // processing expects to refer to a from-space object.
740 _string_dedup_requests.add(old);
741 }
742 return obj;
743 }
744
745 void DefNewGeneration::drain_promo_failure_scan_stack() {
746 while (!_promo_failure_scan_stack.is_empty()) {
747 oop obj = _promo_failure_scan_stack.pop();
748 obj->oop_iterate(_promo_failure_scan_stack_closure);
749 }
750 }
751
752 void DefNewGeneration::save_marks() {
753 eden()->set_saved_mark();
754 to()->set_saved_mark();
755 from()->set_saved_mark();
756 }
757
758
759 void DefNewGeneration::reset_saved_marks() {
760 eden()->reset_saved_mark();
761 to()->reset_saved_mark();
762 from()->reset_saved_mark();
763 }
764
765
766 bool DefNewGeneration::no_allocs_since_save_marks() {
767 assert(eden()->saved_mark_at_top(), "Violated spec - alloc in eden");
768 assert(from()->saved_mark_at_top(), "Violated spec - alloc in from");
769 return to()->saved_mark_at_top();
770 }
771
772 void DefNewGeneration::contribute_scratch(ScratchBlock*& list, Generation* requestor,
773 size_t max_alloc_words) {
774 if (requestor == this || _promotion_failed) {
775 return;
776 }
777 assert(GenCollectedHeap::heap()->is_old_gen(requestor), "We should not call our own generation");
778
779 /* $$$ Assert this? "trace" is a "MarkSweep" function so that's not appropriate.
780 if (to_space->top() > to_space->bottom()) {
781 trace("to_space not empty when contribute_scratch called");
782 }
783 */
784
785 ContiguousSpace* to_space = to();
786 assert(to_space->end() >= to_space->top(), "pointers out of order");
787 size_t free_words = pointer_delta(to_space->end(), to_space->top());
788 if (free_words >= MinFreeScratchWords) {
789 ScratchBlock* sb = (ScratchBlock*)to_space->top();
790 sb->num_words = free_words;
791 sb->next = list;
792 list = sb;
793 }
794 }
795
796 void DefNewGeneration::reset_scratch() {
797 // If contributing scratch in to_space, mangle all of
798 // to_space if ZapUnusedHeapArea. This is needed because
799 // top is not maintained while using to-space as scratch.
800 if (ZapUnusedHeapArea) {
801 to()->mangle_unused_area_complete();
802 }
803 }
804
805 bool DefNewGeneration::collection_attempt_is_safe() {
806 if (!to()->is_empty()) {
807 log_trace(gc)(":: to is not empty ::");
808 return false;
809 }
810 if (_old_gen == NULL) {
811 GenCollectedHeap* gch = GenCollectedHeap::heap();
812 _old_gen = gch->old_gen();
813 }
814 return _old_gen->promotion_attempt_is_safe(used());
815 }
816
817 void DefNewGeneration::gc_epilogue(bool full) {
818 DEBUG_ONLY(static bool seen_incremental_collection_failed = false;)
819
820 assert(!GCLocker::is_active(), "We should not be executing here");
821 // Check if the heap is approaching full after a collection has
822 // been done. Generally the young generation is empty at
823 // a minimum at the end of a collection. If it is not, then
824 // the heap is approaching full.
825 GenCollectedHeap* gch = GenCollectedHeap::heap();
826 if (full) {
827 DEBUG_ONLY(seen_incremental_collection_failed = false;)
828 if (!collection_attempt_is_safe() && !_eden_space->is_empty()) {
829 log_trace(gc)("DefNewEpilogue: cause(%s), full, not safe, set_failed, set_alloc_from, clear_seen",
830 GCCause::to_string(gch->gc_cause()));
831 gch->set_incremental_collection_failed(); // Slight lie: a full gc left us in that state
832 set_should_allocate_from_space(); // we seem to be running out of space
833 } else {
834 log_trace(gc)("DefNewEpilogue: cause(%s), full, safe, clear_failed, clear_alloc_from, clear_seen",
835 GCCause::to_string(gch->gc_cause()));
836 gch->clear_incremental_collection_failed(); // We just did a full collection
837 clear_should_allocate_from_space(); // if set
838 }
839 } else {
840 #ifdef ASSERT
841 // It is possible that incremental_collection_failed() == true
842 // here, because an attempted scavenge did not succeed. The policy
843 // is normally expected to cause a full collection which should
844 // clear that condition, so we should not be here twice in a row
845 // with incremental_collection_failed() == true without having done
846 // a full collection in between.
847 if (!seen_incremental_collection_failed &&
848 gch->incremental_collection_failed()) {
849 log_trace(gc)("DefNewEpilogue: cause(%s), not full, not_seen_failed, failed, set_seen_failed",
850 GCCause::to_string(gch->gc_cause()));
851 seen_incremental_collection_failed = true;
852 } else if (seen_incremental_collection_failed) {
853 log_trace(gc)("DefNewEpilogue: cause(%s), not full, seen_failed, will_clear_seen_failed",
854 GCCause::to_string(gch->gc_cause()));
855 assert(gch->gc_cause() == GCCause::_scavenge_alot ||
856 !gch->incremental_collection_failed(),
857 "Twice in a row");
858 seen_incremental_collection_failed = false;
859 }
860 #endif // ASSERT
861 }
862
863 if (ZapUnusedHeapArea) {
864 eden()->check_mangled_unused_area_complete();
865 from()->check_mangled_unused_area_complete();
866 to()->check_mangled_unused_area_complete();
867 }
868
869 // update the generation and space performance counters
870 update_counters();
871 gch->counters()->update_counters();
872 }
873
874 void DefNewGeneration::record_spaces_top() {
875 assert(ZapUnusedHeapArea, "Not mangling unused space");
876 eden()->set_top_for_allocations();
877 to()->set_top_for_allocations();
878 from()->set_top_for_allocations();
879 }
880
881 void DefNewGeneration::ref_processor_init() {
882 Generation::ref_processor_init();
883 }
884
885
886 void DefNewGeneration::update_counters() {
887 if (UsePerfData) {
888 _eden_counters->update_all();
889 _from_counters->update_all();
890 _to_counters->update_all();
891 _gen_counters->update_all();
892 }
893 }
894
895 void DefNewGeneration::verify() {
896 eden()->verify();
897 from()->verify();
898 to()->verify();
899 }
900
901 void DefNewGeneration::print_on(outputStream* st) const {
902 Generation::print_on(st);
903 st->print(" eden");
904 eden()->print_on(st);
905 st->print(" from");
906 from()->print_on(st);
907 st->print(" to ");
908 to()->print_on(st);
909 }
910
911
912 const char* DefNewGeneration::name() const {
913 return "def new generation";
914 }
915
916 // Moved from inline file as they are not called inline
917 CompactibleSpace* DefNewGeneration::first_compaction_space() const {
918 return eden();
919 }
920
921 HeapWord* DefNewGeneration::allocate(size_t word_size, bool is_tlab) {
922 // This is the slow-path allocation for the DefNewGeneration.
923 // Most allocations are fast-path in compiled code.
924 // We try to allocate from the eden. If that works, we are happy.
925 // Note that since DefNewGeneration supports lock-free allocation, we
926 // have to use it here, as well.
927 HeapWord* result = eden()->par_allocate(word_size);
928 if (result == NULL) {
929 // If the eden is full and the last collection bailed out, we are running
930 // out of heap space, and we try to allocate the from-space, too.
931 // allocate_from_space can't be inlined because that would introduce a
932 // circular dependency at compile time.
933 result = allocate_from_space(word_size);
934 }
935 return result;
936 }
937
938 HeapWord* DefNewGeneration::par_allocate(size_t word_size,
939 bool is_tlab) {
940 return eden()->par_allocate(word_size);
941 }
942
943 size_t DefNewGeneration::tlab_capacity() const {
944 return eden()->capacity();
945 }
946
947 size_t DefNewGeneration::tlab_used() const {
948 return eden()->used();
949 }
950
951 size_t DefNewGeneration::unsafe_max_tlab_alloc() const {
952 return unsafe_max_alloc_nogc();
953 }