Mercurial > jdk8-mips64-public > hotspot / annotate
src/share/vm/gc_implementation/concurrentMarkSweep/cmsCollectorPolicy.cpp@833b0f92429a (annotated)
src/share/vm/gc_implementation/concurrentMarkSweep/cmsCollectorPolicy.cpp
Wed, 27 Aug 2014 08:19:12 -0400
- author
- zgu
- date
- Wed, 27 Aug 2014 08:19:12 -0400
- changeset 7074
- 833b0f92429a
- parent 6085
- 8f07aa079343
- child 7535
- 7ae4e26cb1e0
- permissions
- -rw-r--r--
8046598: Scalable Native memory tracking development
Summary: Enhance scalability of native memory tracking
Reviewed-by: coleenp, ctornqvi, gtriantafill
| duke@435 | 1 | /* |
| zgu@7074 | 2 | * Copyright (c) 2007, 2014, Oracle and/or its affiliates. All rights reserved. |
| duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| duke@435 | 4 | * |
| duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
| duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
| duke@435 | 7 | * published by the Free Software Foundation. |
| duke@435 | 8 | * |
| duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
| duke@435 | 13 | * accompanied this code). |
| duke@435 | 14 | * |
| duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
| duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
| duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| duke@435 | 18 | * |
| trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
| trims@1907 | 21 | * questions. |
| duke@435 | 22 | * |
| duke@435 | 23 | */ |
| duke@435 | 24 | |
| stefank@2314 | 25 | #include "precompiled.hpp" |
| stefank@2314 | 26 | #include "gc_implementation/concurrentMarkSweep/cmsAdaptiveSizePolicy.hpp" |
| stefank@2314 | 27 | #include "gc_implementation/concurrentMarkSweep/cmsCollectorPolicy.hpp" |
| stefank@2314 | 28 | #include "gc_implementation/concurrentMarkSweep/cmsGCAdaptivePolicyCounters.hpp" |
| stefank@2314 | 29 | #include "gc_implementation/parNew/parNewGeneration.hpp" |
| stefank@2314 | 30 | #include "gc_implementation/shared/gcPolicyCounters.hpp" |
| stefank@2314 | 31 | #include "gc_implementation/shared/vmGCOperations.hpp" |
| stefank@2314 | 32 | #include "memory/cardTableRS.hpp" |
| stefank@2314 | 33 | #include "memory/collectorPolicy.hpp" |
| stefank@2314 | 34 | #include "memory/gcLocker.inline.hpp" |
| stefank@2314 | 35 | #include "memory/genCollectedHeap.hpp" |
| stefank@2314 | 36 | #include "memory/generationSpec.hpp" |
| stefank@2314 | 37 | #include "memory/space.hpp" |
| stefank@2314 | 38 | #include "memory/universe.hpp" |
| stefank@2314 | 39 | #include "runtime/arguments.hpp" |
| stefank@2314 | 40 | #include "runtime/globals_extension.hpp" |
| stefank@2314 | 41 | #include "runtime/handles.inline.hpp" |
| stefank@2314 | 42 | #include "runtime/java.hpp" |
| stefank@4299 | 43 | #include "runtime/thread.inline.hpp" |
| stefank@2314 | 44 | #include "runtime/vmThread.hpp" |
| duke@435 | 45 | |
| duke@435 | 46 | // |
| duke@435 | 47 | // ConcurrentMarkSweepPolicy methods |
| duke@435 | 48 | // |
| duke@435 | 49 | |
| jwilhelm@6085 | 50 | void ConcurrentMarkSweepPolicy::initialize_alignments() { |
| jwilhelm@6085 | 51 | _space_alignment = _gen_alignment = (uintx)Generation::GenGrain; |
| jwilhelm@6085 | 52 | _heap_alignment = compute_heap_alignment(); |
| duke@435 | 53 | } |
| duke@435 | 54 | |
| duke@435 | 55 | void ConcurrentMarkSweepPolicy::initialize_generations() { |
| zgu@7074 | 56 | _generations = NEW_C_HEAP_ARRAY3(GenerationSpecPtr, number_of_generations(), mtGC, |
| zgu@7074 | 57 | CURRENT_PC, AllocFailStrategy::RETURN_NULL); |
| duke@435 | 58 | if (_generations == NULL) |
| duke@435 | 59 | vm_exit_during_initialization("Unable to allocate gen spec"); |
| duke@435 | 60 | |
| brutisso@4387 | 61 | if (UseParNewGC) { |
| duke@435 | 62 | if (UseAdaptiveSizePolicy) { |
| duke@435 | 63 | _generations[0] = new GenerationSpec(Generation::ASParNew, |
| duke@435 | 64 | _initial_gen0_size, _max_gen0_size); |
| duke@435 | 65 | } else { |
| duke@435 | 66 | _generations[0] = new GenerationSpec(Generation::ParNew, |
| duke@435 | 67 | _initial_gen0_size, _max_gen0_size); |
| duke@435 | 68 | } |
| duke@435 | 69 | } else { |
| duke@435 | 70 | _generations[0] = new GenerationSpec(Generation::DefNew, |
| duke@435 | 71 | _initial_gen0_size, _max_gen0_size); |
| duke@435 | 72 | } |
| duke@435 | 73 | if (UseAdaptiveSizePolicy) { |
| duke@435 | 74 | _generations[1] = new GenerationSpec(Generation::ASConcurrentMarkSweep, |
| duke@435 | 75 | _initial_gen1_size, _max_gen1_size); |
| duke@435 | 76 | } else { |
| duke@435 | 77 | _generations[1] = new GenerationSpec(Generation::ConcurrentMarkSweep, |
| duke@435 | 78 | _initial_gen1_size, _max_gen1_size); |
| duke@435 | 79 | } |
| duke@435 | 80 | |
| duke@435 | 81 | if (_generations[0] == NULL || _generations[1] == NULL) { |
| duke@435 | 82 | vm_exit_during_initialization("Unable to allocate gen spec"); |
| duke@435 | 83 | } |
| duke@435 | 84 | } |
| duke@435 | 85 | |
| duke@435 | 86 | void ConcurrentMarkSweepPolicy::initialize_size_policy(size_t init_eden_size, |
| duke@435 | 87 | size_t init_promo_size, |
| duke@435 | 88 | size_t init_survivor_size) { |
| duke@435 | 89 | double max_gc_minor_pause_sec = ((double) MaxGCMinorPauseMillis)/1000.0; |
| duke@435 | 90 | double max_gc_pause_sec = ((double) MaxGCPauseMillis)/1000.0; |
| duke@435 | 91 | _size_policy = new CMSAdaptiveSizePolicy(init_eden_size, |
| duke@435 | 92 | init_promo_size, |
| duke@435 | 93 | init_survivor_size, |
| duke@435 | 94 | max_gc_minor_pause_sec, |
| duke@435 | 95 | max_gc_pause_sec, |
| duke@435 | 96 | GCTimeRatio); |
| duke@435 | 97 | } |
| duke@435 | 98 | |
| duke@435 | 99 | void ConcurrentMarkSweepPolicy::initialize_gc_policy_counters() { |
| duke@435 | 100 | // initialize the policy counters - 2 collectors, 3 generations |
| brutisso@4387 | 101 | if (UseParNewGC) { |
| duke@435 | 102 | _gc_policy_counters = new GCPolicyCounters("ParNew:CMS", 2, 3); |
| duke@435 | 103 | } |
| duke@435 | 104 | else { |
| duke@435 | 105 | _gc_policy_counters = new GCPolicyCounters("Copy:CMS", 2, 3); |
| duke@435 | 106 | } |
| duke@435 | 107 | } |
| duke@435 | 108 | |
| duke@435 | 109 | // Returns true if the incremental mode is enabled. |
| duke@435 | 110 | bool ConcurrentMarkSweepPolicy::has_soft_ended_eden() |
| duke@435 | 111 | { |
| duke@435 | 112 | return CMSIncrementalMode; |
| duke@435 | 113 | } |
| duke@435 | 114 | |
| duke@435 | 115 | |
| duke@435 | 116 | // |
| duke@435 | 117 | // ASConcurrentMarkSweepPolicy methods |
| duke@435 | 118 | // |
| duke@435 | 119 | |
| duke@435 | 120 | void ASConcurrentMarkSweepPolicy::initialize_gc_policy_counters() { |
| duke@435 | 121 | |
| duke@435 | 122 | assert(size_policy() != NULL, "A size policy is required"); |
| duke@435 | 123 | // initialize the policy counters - 2 collectors, 3 generations |
| brutisso@4387 | 124 | if (UseParNewGC) { |
| duke@435 | 125 | _gc_policy_counters = new CMSGCAdaptivePolicyCounters("ParNew:CMS", 2, 3, |
| duke@435 | 126 | size_policy()); |
| duke@435 | 127 | } |
| duke@435 | 128 | else { |
| duke@435 | 129 | _gc_policy_counters = new CMSGCAdaptivePolicyCounters("Copy:CMS", 2, 3, |
| duke@435 | 130 | size_policy()); |
| duke@435 | 131 | } |
| duke@435 | 132 | } |
