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 "gc/cms/concurrentMarkSweepThread.hpp"
27 #include "gc/cms/cmsHeap.hpp"
28 #include "gc/cms/vmCMSOperations.hpp"
29 #include "gc/shared/genOopClosures.inline.hpp"
30 #include "gc/shared/strongRootsScope.hpp"
31 #include "gc/shared/workgroup.hpp"
32 #include "oops/oop.inline.hpp"
33 #include "runtime/vmThread.hpp"
34 #include "utilities/stack.inline.hpp"
35
36 CMSHeap::CMSHeap(GenCollectorPolicy *policy) : GenCollectedHeap(policy) {
37 _workers = new WorkGang("GC Thread", ParallelGCThreads,
38 /* are_GC_task_threads */true,
39 /* are_ConcurrentGC_threads */false);
40 _workers->initialize_workers();
41 }
42
43 jint CMSHeap::initialize() {
44 jint status = GenCollectedHeap::initialize();
45 if (status != JNI_OK) return status;
46
47 // If we are running CMS, create the collector responsible
48 // for collecting the CMS generations.
49 assert(collector_policy()->is_concurrent_mark_sweep_policy(), "must be CMS policy");
50 if (!create_cms_collector()) {
51 return JNI_ENOMEM;
52 }
53
166
167 if (young_gen_as_roots &&
168 !_process_strong_tasks->is_task_claimed(GCH_PS_younger_gens)) {
169 root_closure->set_generation(young_gen());
170 young_gen()->oop_iterate(root_closure);
171 root_closure->reset_generation();
172 }
173
174 _process_strong_tasks->all_tasks_completed(scope->n_threads());
175 }
176
177 void CMSHeap::gc_prologue(bool full) {
178 always_do_update_barrier = false;
179 GenCollectedHeap::gc_prologue(full);
180 };
181
182 void CMSHeap::gc_epilogue(bool full) {
183 GenCollectedHeap::gc_epilogue(full);
184 always_do_update_barrier = true;
185 };
|
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 "gc/cms/compactibleFreeListSpace.hpp"
27 #include "gc/cms/concurrentMarkSweepGeneration.hpp"
28 #include "gc/cms/concurrentMarkSweepThread.hpp"
29 #include "gc/cms/cmsHeap.hpp"
30 #include "gc/cms/parNewGeneration.hpp"
31 #include "gc/cms/vmCMSOperations.hpp"
32 #include "gc/shared/genOopClosures.inline.hpp"
33 #include "gc/shared/strongRootsScope.hpp"
34 #include "gc/shared/workgroup.hpp"
35 #include "oops/oop.inline.hpp"
36 #include "runtime/vmThread.hpp"
37 #include "services/memoryManager.hpp"
38 #include "services/memoryPool.hpp"
39 #include "utilities/stack.inline.hpp"
40
41 CMSHeap::CMSHeap(GenCollectorPolicy *policy) : GenCollectedHeap(policy) {
42 _workers = new WorkGang("GC Thread", ParallelGCThreads,
43 /* are_GC_task_threads */true,
44 /* are_ConcurrentGC_threads */false);
45 _workers->initialize_workers();
46 }
47
48 jint CMSHeap::initialize() {
49 jint status = GenCollectedHeap::initialize();
50 if (status != JNI_OK) return status;
51
52 // If we are running CMS, create the collector responsible
53 // for collecting the CMS generations.
54 assert(collector_policy()->is_concurrent_mark_sweep_policy(), "must be CMS policy");
55 if (!create_cms_collector()) {
56 return JNI_ENOMEM;
57 }
58
171
172 if (young_gen_as_roots &&
173 !_process_strong_tasks->is_task_claimed(GCH_PS_younger_gens)) {
174 root_closure->set_generation(young_gen());
175 young_gen()->oop_iterate(root_closure);
176 root_closure->reset_generation();
177 }
178
179 _process_strong_tasks->all_tasks_completed(scope->n_threads());
180 }
181
182 void CMSHeap::gc_prologue(bool full) {
183 always_do_update_barrier = false;
184 GenCollectedHeap::gc_prologue(full);
185 };
186
187 void CMSHeap::gc_epilogue(bool full) {
188 GenCollectedHeap::gc_epilogue(full);
189 always_do_update_barrier = true;
190 };
191
192 class ParNewMemoryManager : public GCMemoryManager {
193 private:
194 public:
195 ParNewMemoryManager() : GCMemoryManager() {}
196
197 const char* name() { return "ParNew"; }
198 virtual const char* gc_end_message() { return "end of major GC"; }
199 };
200
201 class CMSMemoryManager : public GCMemoryManager {
202 private:
203 public:
204 CMSMemoryManager() : GCMemoryManager() {}
205
206 const char* name() { return "ConcurrentMarkSweep";}
207 virtual const char* gc_end_message() { return "end of minor GC"; }
208 };
209
210 class CompactibleFreeListSpacePool : public CollectedMemoryPool {
211 private:
212 CompactibleFreeListSpace* _space;
213 public:
214 CompactibleFreeListSpacePool(CompactibleFreeListSpace* space,
215 const char* name,
216 PoolType type,
217 size_t max_size,
218 bool support_usage_threshold) :
219 CollectedMemoryPool(name, type, space->capacity(), max_size,
220 support_usage_threshold), _space(space) {
221 }
222
223 MemoryUsage get_memory_usage() {
224 size_t maxSize = (available_for_allocation() ? max_size() : 0);
225 size_t used = used_in_bytes();
226 size_t committed = _space->capacity();
227
228 return MemoryUsage(initial_size(), used, committed, maxSize);
229 }
230
231 size_t used_in_bytes() {
232 return _space->used();
233 }
234 };
235
236 void CMSHeap::init_memory_managers() {
237 _minor_mgr = new ParNewMemoryManager();
238 _major_mgr = new CMSMemoryManager();
239 }
240
241 GrowableArray<MemoryManager*> CMSHeap::memory_managers() {
242 GrowableArray<MemoryManager*> cms_memory_managers;
243 cms_memory_managers.append(_minor_mgr);
244 cms_memory_managers.append(_major_mgr);
245 return cms_memory_managers;
246 }
247
248 GrowableArray<MemoryPool*> CMSHeap::memory_pools() {
249 GrowableArray<MemoryPool*> cms_memory_pools;
250
251 ParNewGeneration* young = (ParNewGeneration*) young_gen();
252 ContiguousSpacePool* eden = new ContiguousSpacePool(young->eden(), "Par Eden Space", MemoryPool::Heap, young->max_eden_size(), false);
253 SurvivorContiguousSpacePool* survivor = new SurvivorContiguousSpacePool(young, "Par Survivor Space", MemoryPool::Heap, young->max_survivor_size(), false);
254
255 ConcurrentMarkSweepGeneration* cms = (ConcurrentMarkSweepGeneration*) old_gen();
256 CompactibleFreeListSpacePool* old = new CompactibleFreeListSpacePool(cms->cmsSpace(), "CMS Old Gen", MemoryPool::Heap, cms->reserved().byte_size(), true);
257
258 cms_memory_pools.append(eden);
259 cms_memory_pools.append(survivor);
260 cms_memory_pools.append(old);
261
262 _minor_mgr->add_pool(eden);
263 _major_mgr->add_pool(eden);
264 _minor_mgr->add_pool(survivor);
265 _major_mgr->add_pool(survivor);
266 _major_mgr->add_pool(old);
267
268 return cms_memory_pools;
269 }
|