rev 48000 : [mq]: open.patch

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