duke@435: /*
dholmes@7576:  * Copyright (c) 2001, 2015, Oracle and/or its affiliates. All rights reserved.
duke@435:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435:  *
duke@435:  * This code is free software; you can redistribute it and/or modify it
duke@435:  * under the terms of the GNU General Public License version 2 only, as
duke@435:  * published by the Free Software Foundation.
duke@435:  *
duke@435:  * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
duke@435:  * version 2 for more details (a copy is included in the LICENSE file that
duke@435:  * accompanied this code).
duke@435:  *
duke@435:  * You should have received a copy of the GNU General Public License version
duke@435:  * 2 along with this work; if not, write to the Free Software Foundation,
duke@435:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435:  *
trims@1907:  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907:  * or visit www.oracle.com if you need additional information or have any
trims@1907:  * questions.
duke@435:  *
duke@435:  */
duke@435: 
stefank@2314: #include "precompiled.hpp"
stefank@2314: #include "gc_implementation/shared/collectorCounters.hpp"
stefank@2314: #include "memory/allocation.inline.hpp"
stefank@2314: #include "memory/blockOffsetTable.inline.hpp"
stefank@2314: #include "memory/generation.inline.hpp"
stefank@2314: #include "memory/generationSpec.hpp"
stefank@2314: #include "memory/space.hpp"
stefank@2314: #include "memory/tenuredGeneration.hpp"
stefank@2314: #include "oops/oop.inline.hpp"
stefank@2314: #include "runtime/java.hpp"
jprovino@4542: #include "utilities/macros.hpp"
dholmes@7576: #if INCLUDE_ALL_GCS
dholmes@7576: #include "gc_implementation/shared/parGCAllocBuffer.hpp"
dholmes@7576: #endif
duke@435: 
duke@435: TenuredGeneration::TenuredGeneration(ReservedSpace rs,
duke@435:                                      size_t initial_byte_size, int level,
duke@435:                                      GenRemSet* remset) :
duke@435:   OneContigSpaceCardGeneration(rs, initial_byte_size,
jmasa@4900:                                level, remset, NULL)
duke@435: {
duke@435:   HeapWord* bottom = (HeapWord*) _virtual_space.low();
duke@435:   HeapWord* end    = (HeapWord*) _virtual_space.high();
duke@435:   _the_space  = new TenuredSpace(_bts, MemRegion(bottom, end));
duke@435:   _the_space->reset_saved_mark();
duke@435:   _shrink_factor = 0;
duke@435:   _capacity_at_prologue = 0;
duke@435: 
duke@435:   _gc_stats = new GCStats();
duke@435: 
duke@435:   // initialize performance counters
duke@435: 
duke@435:   const char* gen_name = "old";
duke@435: 
duke@435:   // Generation Counters -- generation 1, 1 subspace
duke@435:   _gen_counters = new GenerationCounters(gen_name, 1, 1, &_virtual_space);
duke@435: 
duke@435:   _gc_counters = new CollectorCounters("MSC", 1);
duke@435: 
duke@435:   _space_counters = new CSpaceCounters(gen_name, 0,
duke@435:                                        _virtual_space.reserved_size(),
duke@435:                                        _the_space, _gen_counters);
jprovino@4542: #if INCLUDE_ALL_GCS
brutisso@4387:   if (UseParNewGC) {
duke@435:     typedef ParGCAllocBufferWithBOT* ParGCAllocBufferWithBOTPtr;
duke@435:     _alloc_buffers = NEW_C_HEAP_ARRAY(ParGCAllocBufferWithBOTPtr,
zgu@3900:                                       ParallelGCThreads, mtGC);
duke@435:     if (_alloc_buffers == NULL)
duke@435:       vm_exit_during_initialization("Could not allocate alloc_buffers");
duke@435:     for (uint i = 0; i < ParallelGCThreads; i++) {
duke@435:       _alloc_buffers[i] =
duke@435:         new ParGCAllocBufferWithBOT(OldPLABSize, _bts);
duke@435:       if (_alloc_buffers[i] == NULL)
duke@435:         vm_exit_during_initialization("Could not allocate alloc_buffers");
duke@435:     }
duke@435:   } else {
duke@435:     _alloc_buffers = NULL;
duke@435:   }
jprovino@4542: #endif // INCLUDE_ALL_GCS
duke@435: }
duke@435: 
duke@435: 
duke@435: const char* TenuredGeneration::name() const {
duke@435:   return "tenured generation";
duke@435: }
duke@435: 
duke@435: void TenuredGeneration::gc_prologue(bool full) {
duke@435:   _capacity_at_prologue = capacity();
duke@435:   _used_at_prologue = used();
duke@435:   if (VerifyBeforeGC) {
duke@435:     verify_alloc_buffers_clean();
duke@435:   }
duke@435: }
duke@435: 
duke@435: void TenuredGeneration::gc_epilogue(bool full) {
duke@435:   if (VerifyAfterGC) {
duke@435:     verify_alloc_buffers_clean();
duke@435:   }
duke@435:   OneContigSpaceCardGeneration::gc_epilogue(full);
duke@435: }
duke@435: 
duke@435: 
duke@435: bool TenuredGeneration::should_collect(bool  full,
duke@435:                                        size_t size,
duke@435:                                        bool   is_tlab) {
duke@435:   // This should be one big conditional or (||), but I want to be able to tell
duke@435:   // why it returns what it returns (without re-evaluating the conditionals
duke@435:   // in case they aren't idempotent), so I'm doing it this way.
duke@435:   // DeMorgan says it's okay.
duke@435:   bool result = false;
duke@435:   if (!result && full) {
duke@435:     result = true;
duke@435:     if (PrintGC && Verbose) {
duke@435:       gclog_or_tty->print_cr("TenuredGeneration::should_collect: because"
duke@435:                     " full");
duke@435:     }
duke@435:   }
duke@435:   if (!result && should_allocate(size, is_tlab)) {
duke@435:     result = true;
duke@435:     if (PrintGC && Verbose) {
duke@435:       gclog_or_tty->print_cr("TenuredGeneration::should_collect: because"
duke@435:                     " should_allocate(" SIZE_FORMAT ")",
duke@435:                     size);
duke@435:     }
duke@435:   }
duke@435:   // If we don't have very much free space.
duke@435:   // XXX: 10000 should be a percentage of the capacity!!!
duke@435:   if (!result && free() < 10000) {
duke@435:     result = true;
duke@435:     if (PrintGC && Verbose) {
duke@435:       gclog_or_tty->print_cr("TenuredGeneration::should_collect: because"
duke@435:                     " free(): " SIZE_FORMAT,
duke@435:                     free());
duke@435:     }
duke@435:   }
duke@435:   // If we had to expand to accomodate promotions from younger generations
duke@435:   if (!result && _capacity_at_prologue < capacity()) {
duke@435:     result = true;
duke@435:     if (PrintGC && Verbose) {
duke@435:       gclog_or_tty->print_cr("TenuredGeneration::should_collect: because"
duke@435:                     "_capacity_at_prologue: " SIZE_FORMAT " < capacity(): " SIZE_FORMAT,
duke@435:                     _capacity_at_prologue, capacity());
duke@435:     }
duke@435:   }
duke@435:   return result;
duke@435: }
duke@435: 
duke@435: void TenuredGeneration::collect(bool   full,
duke@435:                                 bool   clear_all_soft_refs,
duke@435:                                 size_t size,
duke@435:                                 bool   is_tlab) {
duke@435:   retire_alloc_buffers_before_full_gc();
duke@435:   OneContigSpaceCardGeneration::collect(full, clear_all_soft_refs,
duke@435:                                         size, is_tlab);
duke@435: }
duke@435: 
jmasa@4900: void TenuredGeneration::compute_new_size() {
jmasa@4900:   assert_locked_or_safepoint(Heap_lock);
jmasa@4900: 
jmasa@4900:   // Compute some numbers about the state of the heap.
jmasa@4900:   const size_t used_after_gc = used();
jmasa@4900:   const size_t capacity_after_gc = capacity();
jmasa@4900: 
jmasa@4900:   CardGeneration::compute_new_size();
jmasa@4900: 
jmasa@4900:   assert(used() == used_after_gc && used_after_gc <= capacity(),
jmasa@4900:          err_msg("used: " SIZE_FORMAT " used_after_gc: " SIZE_FORMAT
jmasa@4900:          " capacity: " SIZE_FORMAT, used(), used_after_gc, capacity()));
jmasa@4900: }
duke@435: void TenuredGeneration::update_gc_stats(int current_level,
duke@435:                                         bool full) {
duke@435:   // If the next lower level(s) has been collected, gather any statistics
duke@435:   // that are of interest at this point.
duke@435:   if (!full && (current_level + 1) == level()) {
duke@435:     // Calculate size of data promoted from the younger generations
duke@435:     // before doing the collection.
duke@435:     size_t used_before_gc = used();
duke@435: 
duke@435:     // If the younger gen collections were skipped, then the
duke@435:     // number of promoted bytes will be 0 and adding it to the
duke@435:     // average will incorrectly lessen the average.  It is, however,
duke@435:     // also possible that no promotion was needed.
duke@435:     if (used_before_gc >= _used_at_prologue) {
duke@435:       size_t promoted_in_bytes = used_before_gc - _used_at_prologue;
duke@435:       gc_stats()->avg_promoted()->sample(promoted_in_bytes);
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: void TenuredGeneration::update_counters() {
duke@435:   if (UsePerfData) {
duke@435:     _space_counters->update_all();
duke@435:     _gen_counters->update_all();
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
jprovino@4542: #if INCLUDE_ALL_GCS
duke@435: oop TenuredGeneration::par_promote(int thread_num,
duke@435:                                    oop old, markOop m, size_t word_sz) {
duke@435: 
duke@435:   ParGCAllocBufferWithBOT* buf = _alloc_buffers[thread_num];
duke@435:   HeapWord* obj_ptr = buf->allocate(word_sz);
duke@435:   bool is_lab = true;
duke@435:   if (obj_ptr == NULL) {
duke@435: #ifndef PRODUCT
duke@435:     if (Universe::heap()->promotion_should_fail()) {
duke@435:       return NULL;
duke@435:     }
duke@435: #endif  // #ifndef PRODUCT
duke@435: 
duke@435:     // Slow path:
duke@435:     if (word_sz * 100 < ParallelGCBufferWastePct * buf->word_sz()) {
duke@435:       // Is small enough; abandon this buffer and start a new one.
duke@435:       size_t buf_size = buf->word_sz();
duke@435:       HeapWord* buf_space =
duke@435:         TenuredGeneration::par_allocate(buf_size, false);
duke@435:       if (buf_space == NULL) {
duke@435:         buf_space = expand_and_allocate(buf_size, false, true /* parallel*/);
duke@435:       }
duke@435:       if (buf_space != NULL) {
duke@435:         buf->retire(false, false);
duke@435:         buf->set_buf(buf_space);
duke@435:         obj_ptr = buf->allocate(word_sz);
duke@435:         assert(obj_ptr != NULL, "Buffer was definitely big enough...");
duke@435:       }
duke@435:     };
duke@435:     // Otherwise, buffer allocation failed; try allocating object
duke@435:     // individually.
duke@435:     if (obj_ptr == NULL) {
duke@435:       obj_ptr = TenuredGeneration::par_allocate(word_sz, false);
duke@435:       if (obj_ptr == NULL) {
duke@435:         obj_ptr = expand_and_allocate(word_sz, false, true /* parallel */);
duke@435:       }
duke@435:     }
duke@435:     if (obj_ptr == NULL) return NULL;
duke@435:   }
duke@435:   assert(obj_ptr != NULL, "program logic");
duke@435:   Copy::aligned_disjoint_words((HeapWord*)old, obj_ptr, word_sz);
duke@435:   oop obj = oop(obj_ptr);
duke@435:   // Restore the mark word copied above.
duke@435:   obj->set_mark(m);
duke@435:   return obj;
duke@435: }
duke@435: 
duke@435: void TenuredGeneration::par_promote_alloc_undo(int thread_num,
duke@435:                                                HeapWord* obj,
duke@435:                                                size_t word_sz) {
duke@435:   ParGCAllocBufferWithBOT* buf = _alloc_buffers[thread_num];
duke@435:   if (buf->contains(obj)) {
duke@435:     guarantee(buf->contains(obj + word_sz - 1),
duke@435:               "should contain whole object");
duke@435:     buf->undo_allocation(obj, word_sz);
duke@435:   } else {
jcoomes@916:     CollectedHeap::fill_with_object(obj, word_sz);
duke@435:   }
duke@435: }
duke@435: 
duke@435: void TenuredGeneration::par_promote_alloc_done(int thread_num) {
duke@435:   ParGCAllocBufferWithBOT* buf = _alloc_buffers[thread_num];
duke@435:   buf->retire(true, ParallelGCRetainPLAB);
duke@435: }
duke@435: 
duke@435: void TenuredGeneration::retire_alloc_buffers_before_full_gc() {
duke@435:   if (UseParNewGC) {
duke@435:     for (uint i = 0; i < ParallelGCThreads; i++) {
duke@435:       _alloc_buffers[i]->retire(true /*end_of_gc*/, false /*retain*/);
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: // Verify that any retained parallel allocation buffers do not
duke@435: // intersect with dirty cards.
duke@435: void TenuredGeneration::verify_alloc_buffers_clean() {
duke@435:   if (UseParNewGC) {
duke@435:     for (uint i = 0; i < ParallelGCThreads; i++) {
jmasa@441:       _rs->verify_aligned_region_empty(_alloc_buffers[i]->range());
duke@435:     }
duke@435:   }
duke@435: }
jmasa@441: 
jprovino@4542: #else  // INCLUDE_ALL_GCS
duke@435: void TenuredGeneration::retire_alloc_buffers_before_full_gc() {}
duke@435: void TenuredGeneration::verify_alloc_buffers_clean() {}
jprovino@4542: #endif // INCLUDE_ALL_GCS
duke@435: 
ysr@2243: bool TenuredGeneration::promotion_attempt_is_safe(size_t max_promotion_in_bytes) const {
ysr@2243:   size_t available = max_contiguous_available();
ysr@2243:   size_t av_promo  = (size_t)gc_stats()->avg_promoted()->padded_average();
ysr@2243:   bool   res = (available >= av_promo) || (available >= max_promotion_in_bytes);
ysr@2243:   if (PrintGC && Verbose) {
ysr@2243:     gclog_or_tty->print_cr(
ysr@2243:       "Tenured: promo attempt is%s safe: available("SIZE_FORMAT") %s av_promo("SIZE_FORMAT"),"
ysr@2243:       "max_promo("SIZE_FORMAT")",
ysr@2243:       res? "":" not", available, res? ">=":"<",
ysr@2243:       av_promo, max_promotion_in_bytes);
duke@435:   }
ysr@2243:   return res;
duke@435: }