< prev index next >

src/hotspot/share/gc/g1/g1HeterogeneousCollectorPolicy.cpp

Print this page
rev 53923 : [mq]: 8219747-remove-g1-prefix
   1 /*
   2  * Copyright (c) 2018, 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  *


  81   if (NewSize > MaxMemoryForYoung) {
  82     if (FLAG_IS_CMDLINE(NewSize)) {
  83       log_warning(gc, ergo)("Setting NewSize to " SIZE_FORMAT " based on dram available (calculation = align(%s))",
  84                             MaxMemoryForYoung, calc_str.buffer());
  85     }
  86     NewSize = MaxMemoryForYoung;
  87   }
  88 
  89   // After setting new size flags, call base class initialize_flags()
  90   G1CollectorPolicy::initialize_flags();
  91 }
  92 
  93 size_t G1HeterogeneousCollectorPolicy::reasonable_max_memory_for_young() {
  94   return MaxMemoryForYoung;
  95 }
  96 
  97 size_t G1HeterogeneousCollectorPolicy::heap_reserved_size_bytes() const {
  98     return 2 * _max_heap_byte_size;
  99 }
 100 
 101 bool G1HeterogeneousCollectorPolicy::is_hetero_heap() const {
 102   return true;
 103 }
   1 /*
   2  * Copyright (c) 2018, 2019, 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  *


  81   if (NewSize > MaxMemoryForYoung) {
  82     if (FLAG_IS_CMDLINE(NewSize)) {
  83       log_warning(gc, ergo)("Setting NewSize to " SIZE_FORMAT " based on dram available (calculation = align(%s))",
  84                             MaxMemoryForYoung, calc_str.buffer());
  85     }
  86     NewSize = MaxMemoryForYoung;
  87   }
  88 
  89   // After setting new size flags, call base class initialize_flags()
  90   G1CollectorPolicy::initialize_flags();
  91 }
  92 
  93 size_t G1HeterogeneousCollectorPolicy::reasonable_max_memory_for_young() {
  94   return MaxMemoryForYoung;
  95 }
  96 
  97 size_t G1HeterogeneousCollectorPolicy::heap_reserved_size_bytes() const {
  98     return 2 * _max_heap_byte_size;
  99 }
 100 
 101 bool G1HeterogeneousCollectorPolicy::is_heap_heterogeneous() const {
 102   return true;
 103 }
< prev index next >