1 /*
   2  * Copyright (c) 2018, Red Hat, Inc. All rights reserved.
   3  *
   4  * This code is free software; you can redistribute it and/or modify it
   5  * under the terms of the GNU General Public License version 2 only, as
   6  * published by the Free Software Foundation.
   7  *
   8  * This code is distributed in the hope that it will be useful, but WITHOUT
   9  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  10  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  11  * version 2 for more details (a copy is included in the LICENSE file that
  12  * accompanied this code).
  13  *
  14  * You should have received a copy of the GNU General Public License version
  15  * 2 along with this work; if not, write to the Free Software Foundation,
  16  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  17  *
  18  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  19  * or visit www.oracle.com if you need additional information or have any
  20  * questions.
  21  *
  22  */
  23 
  24 #include "precompiled.hpp"
  25 
  26 #include "gc_implementation/shenandoah/heuristics/shenandoahPassiveHeuristics.hpp"
  27 #include "gc_implementation/shenandoah/shenandoahCollectionSet.hpp"
  28 #include "gc_implementation/shenandoah/shenandoahHeapRegion.hpp"
  29 #include "gc_implementation/shenandoah/shenandoahLogging.hpp"
  30 
  31 bool ShenandoahPassiveHeuristics::should_start_gc() const {
  32   // Never do concurrent GCs.
  33   return false;
  34 }
  35 
  36 bool ShenandoahPassiveHeuristics::should_process_references() {
  37   // Always process references, if we can.
  38   return can_process_references();
  39 }
  40 
  41 bool ShenandoahPassiveHeuristics::should_unload_classes() {
  42   // Always unload classes, if we can.
  43   return can_unload_classes();
  44 }
  45 
  46 bool ShenandoahPassiveHeuristics::should_degenerate_cycle() {
  47   // Always fail to Degenerated GC, if enabled
  48   return ShenandoahDegeneratedGC;
  49 }
  50 
  51 void ShenandoahPassiveHeuristics::choose_collection_set_from_regiondata(ShenandoahCollectionSet* cset,
  52                                                                         RegionData* data, size_t size,
  53                                                                         size_t actual_free) {
  54   assert(ShenandoahDegeneratedGC, "This path is only taken for Degenerated GC");
  55 
  56   // Do not select too large CSet that would overflow the available free space.
  57   // Take at least the entire evacuation reserve, and be free to overflow to free space.
  58   size_t capacity  = ShenandoahHeap::heap()->max_capacity();
  59   size_t available = MAX2(capacity / 100 * ShenandoahEvacReserve, actual_free);
  60   size_t max_cset  = (size_t)(available / ShenandoahEvacWaste);
  61 
  62   log_info(gc, ergo)("CSet Selection. Actual Free: " SIZE_FORMAT "%s, Max CSet: " SIZE_FORMAT "%s",
  63                      byte_size_in_proper_unit(actual_free), proper_unit_for_byte_size(actual_free),
  64                      byte_size_in_proper_unit(max_cset),    proper_unit_for_byte_size(max_cset));
  65 
  66   size_t threshold = ShenandoahHeapRegion::region_size_bytes() * ShenandoahGarbageThreshold / 100;
  67 
  68   size_t live_cset = 0;
  69   for (size_t idx = 0; idx < size; idx++) {
  70     ShenandoahHeapRegion* r = data[idx]._region;
  71     size_t new_cset = live_cset + r->get_live_data_bytes();
  72     if (new_cset < max_cset && r->garbage() > threshold) {
  73       live_cset = new_cset;
  74       cset->add_region(r);
  75     }
  76   }
  77 }
  78 
  79 const char* ShenandoahPassiveHeuristics::name() {
  80   return "passive";
  81 }
  82 
  83 bool ShenandoahPassiveHeuristics::is_diagnostic() {
  84   return true;
  85 }
  86 
  87 bool ShenandoahPassiveHeuristics::is_experimental() {
  88   return false;
  89 }