1 /* 2 * Copyright (c) 2007, 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 */ 24 25 #include "precompiled.hpp" 26 #include "gc_implementation/shared/adaptiveSizePolicy.hpp" 27 #include "gc_implementation/concurrentMarkSweep/cmsCollectorPolicy.hpp" 28 #include "gc_implementation/parNew/parNewGeneration.hpp" 29 #include "gc_implementation/shared/gcPolicyCounters.hpp" 30 #include "gc_implementation/shared/vmGCOperations.hpp" 31 #include "memory/cardTableRS.hpp" 32 #include "memory/collectorPolicy.hpp" 33 #include "memory/gcLocker.inline.hpp" 34 #include "memory/genCollectedHeap.hpp" 35 #include "memory/generationSpec.hpp" 36 #include "memory/space.hpp" 37 #include "memory/universe.hpp" 38 #include "runtime/arguments.hpp" 39 #include "runtime/globals_extension.hpp" 40 #include "runtime/handles.inline.hpp" 41 #include "runtime/java.hpp" 42 #include "runtime/thread.inline.hpp" 43 #include "runtime/vmThread.hpp" 44 45 // 46 // ConcurrentMarkSweepPolicy methods 47 // 48 49 void ConcurrentMarkSweepPolicy::initialize_alignments() { 50 _space_alignment = _gen_alignment = (uintx)Generation::GenGrain; 51 _heap_alignment = compute_heap_alignment(); 52 } 53 54 void ConcurrentMarkSweepPolicy::initialize_generations() { 55 _generations = NEW_C_HEAP_ARRAY3(GenerationSpecPtr, number_of_generations(), mtGC, 56 CURRENT_PC, AllocFailStrategy::RETURN_NULL); 57 if (_generations == NULL) 58 vm_exit_during_initialization("Unable to allocate gen spec"); 59 60 Generation::Name yg_name = 61 UseParNewGC ? Generation::ParNew : Generation::DefNew; 62 _generations[0] = new GenerationSpec(yg_name, _initial_young_size, 63 _max_young_size); 64 _generations[1] = new GenerationSpec(Generation::ConcurrentMarkSweep, 65 _initial_old_size, _max_old_size); 66 67 if (_generations[0] == NULL || _generations[1] == NULL) { 68 vm_exit_during_initialization("Unable to allocate gen spec"); 69 } 70 } 71 72 void ConcurrentMarkSweepPolicy::initialize_size_policy(size_t init_eden_size, 73 size_t init_promo_size, 74 size_t init_survivor_size) { 75 double max_gc_pause_sec = ((double) MaxGCPauseMillis)/1000.0; 76 _size_policy = new AdaptiveSizePolicy(init_eden_size, 77 init_promo_size, 78 init_survivor_size, 79 max_gc_pause_sec, 80 GCTimeRatio); 81 } 82 83 void ConcurrentMarkSweepPolicy::initialize_gc_policy_counters() { 84 // initialize the policy counters - 2 collectors, 3 generations 85 if (UseParNewGC) { 86 _gc_policy_counters = new GCPolicyCounters("ParNew:CMS", 2, 3); 87 } 88 else { 89 _gc_policy_counters = new GCPolicyCounters("Copy:CMS", 2, 3); 90 } 91 } 92 93 // Returns true if the incremental mode is enabled. 94 bool ConcurrentMarkSweepPolicy::has_soft_ended_eden() 95 { 96 return CMSIncrementalMode; 97 }