1 | /* |
2 | * Copyright (c) 2003, 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 | * |
23 | */ |
24 | |
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.hpp" |
33 | #include "services/lowMemoryDetector.hpp" |
34 | #include "services/management.hpp" |
35 | #include "services/memoryManager.hpp" |
36 | #include "services/memoryPool.hpp" |
37 | #include "utilities/globalDefinitions.hpp" |
38 | #include "utilities/macros.hpp" |
39 | |
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; |
53 | |
54 | // initialize the max and init size of collection usage |
55 | _after_gc_usage = MemoryUsage(_initial_size, 0, 0, _max_size); |
56 | |
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 | } |
64 | |
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 | } |
72 | |
73 | |
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 = OrderAccess::load_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 | InstanceKlass* ik = Management::sun_management_ManagementFactoryHelper_klass(CHECK_NULL); |
85 | |
86 | Handle pool_name = java_lang_String::create_from_str(_name, CHECK_NULL); |
87 | jlong usage_threshold_value = (_usage_threshold->is_high_threshold_supported() ? 0 : -1L); |
88 | jlong gc_usage_threshold_value = (_gc_usage_threshold->is_high_threshold_supported() ? 0 : -1L); |
89 | |
90 | JavaValue result(T_OBJECT); |
91 | JavaCallArguments args; |
92 | args.push_oop(pool_name); // Argument 1 |
93 | args.push_int((int) is_heap()); // Argument 2 |
94 | |
95 | Symbol* method_name = vmSymbols::createMemoryPool_name(); |
96 | Symbol* signature = vmSymbols::createMemoryPool_signature(); |
97 | |
98 | args.push_long(usage_threshold_value); // Argument 3 |
99 | args.push_long(gc_usage_threshold_value); // Argument 4 |
100 | |
101 | JavaCalls::call_static(&result, |
102 | ik, |
103 | method_name, |
104 | signature, |
105 | &args, |
106 | CHECK_NULL); |
107 | |
108 | instanceOop p = (instanceOop) result.get_jobject(); |
109 | instanceHandle pool(THREAD, p); |
110 | |
111 | { |
112 | // Get lock since another thread may have create the instance |
113 | MutexLocker ml(Management_lock); |
114 | |
115 | // Check if another thread has created the pool. We reload |
116 | // _memory_pool_obj here because some other thread may have |
117 | // initialized it while we were executing the code before the lock. |
118 | // |
119 | // The lock has done an acquire, so the load can't float above it, |
120 | // but we need to do a load_acquire as above. |
121 | pool_obj = OrderAccess::load_acquire(&_memory_pool_obj); |
122 | if (pool_obj != NULL) { |
123 | return pool_obj; |
124 | } |
125 | |
126 | // Get the address of the object we created via call_special. |
127 | pool_obj = pool(); |
128 | |
129 | // Use store barrier to make sure the memory accesses associated |
130 | // with creating the pool are visible before publishing its address. |
131 | // The unlock will publish the store to _memory_pool_obj because |
132 | // it does a release first. |
133 | OrderAccess::release_store(&_memory_pool_obj, pool_obj); |
134 | } |
135 | } |
136 | |
137 | return pool_obj; |
138 | } |
139 | |
140 | inline static size_t get_max_value(size_t val1, size_t val2) { |
141 | return (val1 > val2 ? val1 : val2); |
142 | } |
143 | |
144 | void MemoryPool::record_peak_memory_usage() { |
145 | // Caller in JDK is responsible for synchronization - |
146 | // acquire the lock for this memory pool before calling VM |
147 | MemoryUsage usage = get_memory_usage(); |
148 | size_t peak_used = get_max_value(usage.used(), _peak_usage.used()); |
149 | size_t peak_committed = get_max_value(usage.committed(), _peak_usage.committed()); |
150 | size_t peak_max_size = get_max_value(usage.max_size(), _peak_usage.max_size()); |
151 | |
152 | _peak_usage = MemoryUsage(initial_size(), peak_used, peak_committed, peak_max_size); |
153 | } |
154 | |
155 | static void set_sensor_obj_at(SensorInfo** sensor_ptr, instanceHandle sh) { |
156 | assert(*sensor_ptr == NULL, "Should be called only once" ); |
157 | SensorInfo* sensor = new SensorInfo(); |
158 | sensor->set_sensor(sh()); |
159 | *sensor_ptr = sensor; |
160 | } |
161 | |
162 | void MemoryPool::set_usage_sensor_obj(instanceHandle sh) { |
163 | set_sensor_obj_at(&_usage_sensor, sh); |
164 | } |
165 | |
166 | void MemoryPool::set_gc_usage_sensor_obj(instanceHandle sh) { |
167 | set_sensor_obj_at(&_gc_usage_sensor, sh); |
168 | } |
169 | |
170 | void MemoryPool::oops_do(OopClosure* f) { |
171 | f->do_oop((oop*) &_memory_pool_obj); |
172 | if (_usage_sensor != NULL) { |
173 | _usage_sensor->oops_do(f); |
174 | } |
175 | if (_gc_usage_sensor != NULL) { |
176 | _gc_usage_sensor->oops_do(f); |
177 | } |
178 | } |
179 | |
180 | CodeHeapPool::CodeHeapPool(CodeHeap* codeHeap, const char* name, bool support_usage_threshold) : |
181 | MemoryPool(name, NonHeap, codeHeap->capacity(), codeHeap->max_capacity(), |
182 | support_usage_threshold, false), _codeHeap(codeHeap) { |
183 | } |
184 | |
185 | MemoryUsage CodeHeapPool::get_memory_usage() { |
186 | size_t used = used_in_bytes(); |
187 | size_t committed = _codeHeap->capacity(); |
188 | size_t maxSize = (available_for_allocation() ? max_size() : 0); |
189 | |
190 | return MemoryUsage(initial_size(), used, committed, maxSize); |
191 | } |
192 | |
193 | MetaspacePool::MetaspacePool() : |
194 | MemoryPool("Metaspace" , NonHeap, 0, calculate_max_size(), true, false) { } |
195 | |
196 | MemoryUsage MetaspacePool::get_memory_usage() { |
197 | size_t committed = MetaspaceUtils::committed_bytes(); |
198 | return MemoryUsage(initial_size(), used_in_bytes(), committed, max_size()); |
199 | } |
200 | |
201 | size_t MetaspacePool::used_in_bytes() { |
202 | return MetaspaceUtils::used_bytes(); |
203 | } |
204 | |
205 | size_t MetaspacePool::calculate_max_size() const { |
206 | return FLAG_IS_CMDLINE(MaxMetaspaceSize) ? MaxMetaspaceSize : |
207 | MemoryUsage::undefined_size(); |
208 | } |
209 | |
210 | CompressedKlassSpacePool::CompressedKlassSpacePool() : |
211 | MemoryPool("Compressed Class Space" , NonHeap, 0, CompressedClassSpaceSize, true, false) { } |
212 | |
213 | size_t CompressedKlassSpacePool::used_in_bytes() { |
214 | return MetaspaceUtils::used_bytes(Metaspace::ClassType); |
215 | } |
216 | |
217 | MemoryUsage CompressedKlassSpacePool::get_memory_usage() { |
218 | size_t committed = MetaspaceUtils::committed_bytes(Metaspace::ClassType); |
219 | return MemoryUsage(initial_size(), used_in_bytes(), committed, max_size()); |
220 | } |
221 | |