src/share/vm/services/memoryPool.cpp

Thu, 27 Dec 2018 11:43:33 +0800

author
aoqi
date
Thu, 27 Dec 2018 11:43:33 +0800
changeset 9448
73d689add964
parent 9314
46ab61b0758b
parent 7535
7ae4e26cb1e0
permissions
-rw-r--r--

Merge

     1 /*
     2  * Copyright (c) 2003, 2014, 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  */
    25 #include "precompiled.hpp"
    26 #include "classfile/systemDictionary.hpp"
    27 #include "classfile/vmSymbols.hpp"
    28 #include "memory/metaspace.hpp"
    29 #include "oops/oop.inline.hpp"
    30 #include "runtime/handles.inline.hpp"
    31 #include "runtime/javaCalls.hpp"
    32 #include "runtime/orderAccess.inline.hpp"
    33 #include "services/lowMemoryDetector.hpp"
    34 #include "services/management.hpp"
    35 #include "services/memoryManager.hpp"
    36 #include "services/memoryPool.hpp"
    37 #include "utilities/macros.hpp"
    38 #include "utilities/globalDefinitions.hpp"
    40 MemoryPool::MemoryPool(const char* name,
    41                        PoolType type,
    42                        size_t init_size,
    43                        size_t max_size,
    44                        bool support_usage_threshold,
    45                        bool support_gc_threshold) {
    46   _name = name;
    47   _initial_size = init_size;
    48   _max_size = max_size;
    49   (void)const_cast<instanceOop&>(_memory_pool_obj = instanceOop(NULL));
    50   _available_for_allocation = true;
    51   _num_managers = 0;
    52   _type = type;
    54   // initialize the max and init size of collection usage
    55   _after_gc_usage = MemoryUsage(_initial_size, 0, 0, _max_size);
    57   _usage_sensor = NULL;
    58   _gc_usage_sensor = NULL;
    59   // usage threshold supports both high and low threshold
    60   _usage_threshold = new ThresholdSupport(support_usage_threshold, support_usage_threshold);
    61   // gc usage threshold supports only high threshold
    62   _gc_usage_threshold = new ThresholdSupport(support_gc_threshold, support_gc_threshold);
    63 }
    65 void MemoryPool::add_manager(MemoryManager* mgr) {
    66   assert(_num_managers < MemoryPool::max_num_managers, "_num_managers exceeds the max");
    67   if (_num_managers < MemoryPool::max_num_managers) {
    68     _managers[_num_managers] = mgr;
    69     _num_managers++;
    70   }
    71 }
    74 // Returns an instanceHandle of a MemoryPool object.
    75 // It creates a MemoryPool instance when the first time
    76 // this function is called.
    77 instanceOop MemoryPool::get_memory_pool_instance(TRAPS) {
    78   // Must do an acquire so as to force ordering of subsequent
    79   // loads from anything _memory_pool_obj points to or implies.
    80   instanceOop pool_obj = (instanceOop)OrderAccess::load_ptr_acquire(&_memory_pool_obj);
    81   if (pool_obj == NULL) {
    82     // It's ok for more than one thread to execute the code up to the locked region.
    83     // Extra pool instances will just be gc'ed.
    84     Klass* k = Management::sun_management_ManagementFactory_klass(CHECK_NULL);
    85     instanceKlassHandle ik(THREAD, k);
    87     Handle pool_name = java_lang_String::create_from_str(_name, CHECK_NULL);
    88     jlong usage_threshold_value = (_usage_threshold->is_high_threshold_supported() ? 0 : -1L);
    89     jlong gc_usage_threshold_value = (_gc_usage_threshold->is_high_threshold_supported() ? 0 : -1L);
    91     JavaValue result(T_OBJECT);
    92     JavaCallArguments args;
    93     args.push_oop(pool_name);           // Argument 1
    94     args.push_int((int) is_heap());     // Argument 2
    96     Symbol* method_name = vmSymbols::createMemoryPool_name();
    97     Symbol* signature = vmSymbols::createMemoryPool_signature();
    99     args.push_long(usage_threshold_value);    // Argument 3
   100     args.push_long(gc_usage_threshold_value); // Argument 4
   102     JavaCalls::call_static(&result,
   103                            ik,
   104                            method_name,
   105                            signature,
   106                            &args,
   107                            CHECK_NULL);
   109     instanceOop p = (instanceOop) result.get_jobject();
   110     instanceHandle pool(THREAD, p);
   112     {
   113       // Get lock since another thread may have create the instance
   114       MutexLocker ml(Management_lock);
   116       // Check if another thread has created the pool.  We reload
   117       // _memory_pool_obj here because some other thread may have
   118       // initialized it while we were executing the code before the lock.
   119       //
   120       // The lock has done an acquire, so the load can't float above it,
   121       // but we need to do a load_acquire as above.
   122       pool_obj = (instanceOop)OrderAccess::load_ptr_acquire(&_memory_pool_obj);
   123       if (pool_obj != NULL) {
   124          return pool_obj;
   125       }
   127       // Get the address of the object we created via call_special.
   128       pool_obj = pool();
   130       // Use store barrier to make sure the memory accesses associated
   131       // with creating the pool are visible before publishing its address.
   132       // The unlock will publish the store to _memory_pool_obj because
   133       // it does a release first.
   134       OrderAccess::release_store_ptr(&_memory_pool_obj, pool_obj);
   135     }
   136   }
   138   return pool_obj;
   139 }
   141 inline static size_t get_max_value(size_t val1, size_t val2) {
   142     return (val1 > val2 ? val1 : val2);
   143 }
   145 void MemoryPool::record_peak_memory_usage() {
   146   // Caller in JDK is responsible for synchronization -
   147   // acquire the lock for this memory pool before calling VM
   148   MemoryUsage usage = get_memory_usage();
   149   size_t peak_used = get_max_value(usage.used(), _peak_usage.used());
   150   size_t peak_committed = get_max_value(usage.committed(), _peak_usage.committed());
   151   size_t peak_max_size = get_max_value(usage.max_size(), _peak_usage.max_size());
   153   _peak_usage = MemoryUsage(initial_size(), peak_used, peak_committed, peak_max_size);
   154 }
   156 static void set_sensor_obj_at(SensorInfo** sensor_ptr, instanceHandle sh) {
   157   assert(*sensor_ptr == NULL, "Should be called only once");
   158   SensorInfo* sensor = new SensorInfo();
   159   sensor->set_sensor(sh());
   160   *sensor_ptr = sensor;
   161 }
   163 void MemoryPool::set_usage_sensor_obj(instanceHandle sh) {
   164   set_sensor_obj_at(&_usage_sensor, sh);
   165 }
   167 void MemoryPool::set_gc_usage_sensor_obj(instanceHandle sh) {
   168   set_sensor_obj_at(&_gc_usage_sensor, sh);
   169 }
   171 void MemoryPool::oops_do(OopClosure* f) {
   172   f->do_oop((oop*) &_memory_pool_obj);
   173   if (_usage_sensor != NULL) {
   174     _usage_sensor->oops_do(f);
   175   }
   176   if (_gc_usage_sensor != NULL) {
   177     _gc_usage_sensor->oops_do(f);
   178   }
   179 }
   181 ContiguousSpacePool::ContiguousSpacePool(ContiguousSpace* space,
   182                                          const char* name,
   183                                          PoolType type,
   184                                          size_t max_size,
   185                                          bool support_usage_threshold) :
   186   CollectedMemoryPool(name, type, space->capacity(), max_size,
   187                       support_usage_threshold), _space(space) {
   188 }
   190 MemoryUsage ContiguousSpacePool::get_memory_usage() {
   191   size_t maxSize   = (available_for_allocation() ? max_size() : 0);
   192   size_t used      = used_in_bytes();
   193   size_t committed = _space->capacity();
   195   return MemoryUsage(initial_size(), used, committed, maxSize);
   196 }
   198 SurvivorContiguousSpacePool::SurvivorContiguousSpacePool(DefNewGeneration* gen,
   199                                                          const char* name,
   200                                                          PoolType type,
   201                                                          size_t max_size,
   202                                                          bool support_usage_threshold) :
   203   CollectedMemoryPool(name, type, gen->from()->capacity(), max_size,
   204                       support_usage_threshold), _gen(gen) {
   205 }
   207 MemoryUsage SurvivorContiguousSpacePool::get_memory_usage() {
   208   size_t maxSize = (available_for_allocation() ? max_size() : 0);
   209   size_t used    = used_in_bytes();
   210   size_t committed = committed_in_bytes();
   212   return MemoryUsage(initial_size(), used, committed, maxSize);
   213 }
   215 #if INCLUDE_ALL_GCS
   216 CompactibleFreeListSpacePool::CompactibleFreeListSpacePool(CompactibleFreeListSpace* space,
   217                                                            const char* name,
   218                                                            PoolType type,
   219                                                            size_t max_size,
   220                                                            bool support_usage_threshold) :
   221   CollectedMemoryPool(name, type, space->capacity(), max_size,
   222                       support_usage_threshold), _space(space) {
   223 }
   225 MemoryUsage CompactibleFreeListSpacePool::get_memory_usage() {
   226   size_t maxSize   = (available_for_allocation() ? max_size() : 0);
   227   size_t used      = used_in_bytes();
   228   size_t committed = _space->capacity();
   230   return MemoryUsage(initial_size(), used, committed, maxSize);
   231 }
   232 #endif // INCLUDE_ALL_GCS
   234 GenerationPool::GenerationPool(Generation* gen,
   235                                const char* name,
   236                                PoolType type,
   237                                bool support_usage_threshold) :
   238   CollectedMemoryPool(name, type, gen->capacity(), gen->max_capacity(),
   239                       support_usage_threshold), _gen(gen) {
   240 }
   242 MemoryUsage GenerationPool::get_memory_usage() {
   243   size_t used      = used_in_bytes();
   244   size_t committed = _gen->capacity();
   245   size_t maxSize   = (available_for_allocation() ? max_size() : 0);
   247   return MemoryUsage(initial_size(), used, committed, maxSize);
   248 }
   250 CodeHeapPool::CodeHeapPool(CodeHeap* codeHeap, const char* name, bool support_usage_threshold) :
   251   MemoryPool(name, NonHeap, codeHeap->capacity(), codeHeap->max_capacity(),
   252              support_usage_threshold, false), _codeHeap(codeHeap) {
   253 }
   255 MemoryUsage CodeHeapPool::get_memory_usage() {
   256   size_t used      = used_in_bytes();
   257   size_t committed = _codeHeap->capacity();
   258   size_t maxSize   = (available_for_allocation() ? max_size() : 0);
   260   return MemoryUsage(initial_size(), used, committed, maxSize);
   261 }
   263 MetaspacePool::MetaspacePool() :
   264   MemoryPool("Metaspace", NonHeap, 0, calculate_max_size(), true, false) { }
   266 MemoryUsage MetaspacePool::get_memory_usage() {
   267   size_t committed = MetaspaceAux::committed_bytes();
   268   return MemoryUsage(initial_size(), used_in_bytes(), committed, max_size());
   269 }
   271 size_t MetaspacePool::used_in_bytes() {
   272   return MetaspaceAux::used_bytes();
   273 }
   275 size_t MetaspacePool::calculate_max_size() const {
   276   return FLAG_IS_CMDLINE(MaxMetaspaceSize) ? MaxMetaspaceSize :
   277                                              MemoryUsage::undefined_size();
   278 }
   280 CompressedKlassSpacePool::CompressedKlassSpacePool() :
   281   MemoryPool("Compressed Class Space", NonHeap, 0, CompressedClassSpaceSize, true, false) { }
   283 size_t CompressedKlassSpacePool::used_in_bytes() {
   284   return MetaspaceAux::used_bytes(Metaspace::ClassType);
   285 }
   287 MemoryUsage CompressedKlassSpacePool::get_memory_usage() {
   288   size_t committed = MetaspaceAux::committed_bytes(Metaspace::ClassType);
   289   return MemoryUsage(initial_size(), used_in_bytes(), committed, max_size());
   290 }

mercurial