Mon, 04 Aug 2014 10:48:10 -0700
8031323: Optionally align objects copied to survivor spaces
Reviewed-by: brutisso, tschatzl
duke@435 | 1 | /* |
jwilhelm@4554 | 2 | * Copyright (c) 2001, 2013, 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 | #ifndef SHARE_VM_MEMORY_COLLECTORPOLICY_HPP |
stefank@2314 | 26 | #define SHARE_VM_MEMORY_COLLECTORPOLICY_HPP |
stefank@2314 | 27 | |
coleenp@4037 | 28 | #include "memory/allocation.hpp" |
stefank@2314 | 29 | #include "memory/barrierSet.hpp" |
coleenp@4037 | 30 | #include "memory/generationSpec.hpp" |
stefank@2314 | 31 | #include "memory/genRemSet.hpp" |
jprovino@4542 | 32 | #include "utilities/macros.hpp" |
stefank@2314 | 33 | |
duke@435 | 34 | // This class (or more correctly, subtypes of this class) |
duke@435 | 35 | // are used to define global garbage collector attributes. |
duke@435 | 36 | // This includes initialization of generations and any other |
duke@435 | 37 | // shared resources they may need. |
duke@435 | 38 | // |
duke@435 | 39 | // In general, all flag adjustment and validation should be |
duke@435 | 40 | // done in initialize_flags(), which is called prior to |
duke@435 | 41 | // initialize_size_info(). |
duke@435 | 42 | // |
duke@435 | 43 | // This class is not fully developed yet. As more collector(s) |
duke@435 | 44 | // are added, it is expected that we will come across further |
duke@435 | 45 | // behavior that requires global attention. The correct place |
duke@435 | 46 | // to deal with those issues is this class. |
duke@435 | 47 | |
duke@435 | 48 | // Forward declarations. |
duke@435 | 49 | class GenCollectorPolicy; |
duke@435 | 50 | class TwoGenerationCollectorPolicy; |
ysr@777 | 51 | class AdaptiveSizePolicy; |
jprovino@4542 | 52 | #if INCLUDE_ALL_GCS |
duke@435 | 53 | class ConcurrentMarkSweepPolicy; |
ysr@777 | 54 | class G1CollectorPolicy; |
jprovino@4542 | 55 | #endif // INCLUDE_ALL_GCS |
ysr@777 | 56 | |
duke@435 | 57 | class GCPolicyCounters; |
duke@435 | 58 | class MarkSweepPolicy; |
duke@435 | 59 | |
zgu@3900 | 60 | class CollectorPolicy : public CHeapObj<mtGC> { |
duke@435 | 61 | protected: |
duke@435 | 62 | GCPolicyCounters* _gc_policy_counters; |
duke@435 | 63 | |
jwilhelm@6085 | 64 | virtual void initialize_alignments() = 0; |
duke@435 | 65 | virtual void initialize_flags(); |
ysr@777 | 66 | virtual void initialize_size_info(); |
duke@435 | 67 | |
jwilhelm@6085 | 68 | DEBUG_ONLY(virtual void assert_flags();) |
jwilhelm@6085 | 69 | DEBUG_ONLY(virtual void assert_size_info();) |
jwilhelm@6085 | 70 | |
duke@435 | 71 | size_t _initial_heap_byte_size; |
duke@435 | 72 | size_t _max_heap_byte_size; |
duke@435 | 73 | size_t _min_heap_byte_size; |
duke@435 | 74 | |
jwilhelm@6085 | 75 | size_t _space_alignment; |
jwilhelm@6085 | 76 | size_t _heap_alignment; |
jwilhelm@6085 | 77 | |
jwilhelm@6085 | 78 | // Needed to keep information if MaxHeapSize was set on the command line |
jwilhelm@6085 | 79 | // when the flag value is aligned etc by ergonomics |
jwilhelm@6085 | 80 | bool _max_heap_size_cmdline; |
duke@435 | 81 | |
jmasa@1822 | 82 | // The sizing of the heap are controlled by a sizing policy. |
jmasa@1822 | 83 | AdaptiveSizePolicy* _size_policy; |
jmasa@1822 | 84 | |
jmasa@1822 | 85 | // Set to true when policy wants soft refs cleared. |
jmasa@1822 | 86 | // Reset to false by gc after it clears all soft refs. |
jmasa@1822 | 87 | bool _should_clear_all_soft_refs; |
jwilhelm@6084 | 88 | |
jmasa@1822 | 89 | // Set to true by the GC if the just-completed gc cleared all |
jmasa@1822 | 90 | // softrefs. This is set to true whenever a gc clears all softrefs, and |
jmasa@1822 | 91 | // set to false each time gc returns to the mutator. For example, in the |
jmasa@1822 | 92 | // ParallelScavengeHeap case the latter would be done toward the end of |
jmasa@1822 | 93 | // mem_allocate() where it returns op.result() |
jmasa@1822 | 94 | bool _all_soft_refs_clear; |
jmasa@1822 | 95 | |
jwilhelm@6085 | 96 | CollectorPolicy(); |
duke@435 | 97 | |
duke@435 | 98 | public: |
jwilhelm@6085 | 99 | virtual void initialize_all() { |
jwilhelm@6085 | 100 | initialize_alignments(); |
jwilhelm@6085 | 101 | initialize_flags(); |
jwilhelm@6085 | 102 | initialize_size_info(); |
jwilhelm@6085 | 103 | } |
jwilhelm@6085 | 104 | |
tschatzl@5701 | 105 | // Return maximum heap alignment that may be imposed by the policy |
jwilhelm@6085 | 106 | static size_t compute_heap_alignment(); |
tschatzl@5701 | 107 | |
jwilhelm@6085 | 108 | size_t space_alignment() { return _space_alignment; } |
jwilhelm@6085 | 109 | size_t heap_alignment() { return _heap_alignment; } |
duke@435 | 110 | |
duke@435 | 111 | size_t initial_heap_byte_size() { return _initial_heap_byte_size; } |
duke@435 | 112 | size_t max_heap_byte_size() { return _max_heap_byte_size; } |
duke@435 | 113 | size_t min_heap_byte_size() { return _min_heap_byte_size; } |
duke@435 | 114 | |
duke@435 | 115 | enum Name { |
duke@435 | 116 | CollectorPolicyKind, |
duke@435 | 117 | TwoGenerationCollectorPolicyKind, |
duke@435 | 118 | ConcurrentMarkSweepPolicyKind, |
ysr@777 | 119 | ASConcurrentMarkSweepPolicyKind, |
ysr@777 | 120 | G1CollectorPolicyKind |
duke@435 | 121 | }; |
duke@435 | 122 | |
jmasa@1822 | 123 | AdaptiveSizePolicy* size_policy() { return _size_policy; } |
jmasa@1822 | 124 | bool should_clear_all_soft_refs() { return _should_clear_all_soft_refs; } |
jmasa@1822 | 125 | void set_should_clear_all_soft_refs(bool v) { _should_clear_all_soft_refs = v; } |
jmasa@1822 | 126 | // Returns the current value of _should_clear_all_soft_refs. |
jmasa@1822 | 127 | // _should_clear_all_soft_refs is set to false as a side effect. |
jmasa@1822 | 128 | bool use_should_clear_all_soft_refs(bool v); |
jmasa@1822 | 129 | bool all_soft_refs_clear() { return _all_soft_refs_clear; } |
jmasa@1822 | 130 | void set_all_soft_refs_clear(bool v) { _all_soft_refs_clear = v; } |
jmasa@1822 | 131 | |
jmasa@1822 | 132 | // Called by the GC after Soft Refs have been cleared to indicate |
jmasa@1822 | 133 | // that the request in _should_clear_all_soft_refs has been fulfilled. |
jmasa@1822 | 134 | void cleared_all_soft_refs(); |
jmasa@1822 | 135 | |
duke@435 | 136 | // Identification methods. |
ysr@777 | 137 | virtual GenCollectorPolicy* as_generation_policy() { return NULL; } |
duke@435 | 138 | virtual TwoGenerationCollectorPolicy* as_two_generation_policy() { return NULL; } |
duke@435 | 139 | virtual MarkSweepPolicy* as_mark_sweep_policy() { return NULL; } |
jprovino@4542 | 140 | #if INCLUDE_ALL_GCS |
duke@435 | 141 | virtual ConcurrentMarkSweepPolicy* as_concurrent_mark_sweep_policy() { return NULL; } |
ysr@777 | 142 | virtual G1CollectorPolicy* as_g1_policy() { return NULL; } |
jprovino@4542 | 143 | #endif // INCLUDE_ALL_GCS |
duke@435 | 144 | // Note that these are not virtual. |
duke@435 | 145 | bool is_generation_policy() { return as_generation_policy() != NULL; } |
duke@435 | 146 | bool is_two_generation_policy() { return as_two_generation_policy() != NULL; } |
duke@435 | 147 | bool is_mark_sweep_policy() { return as_mark_sweep_policy() != NULL; } |
jprovino@4542 | 148 | #if INCLUDE_ALL_GCS |
duke@435 | 149 | bool is_concurrent_mark_sweep_policy() { return as_concurrent_mark_sweep_policy() != NULL; } |
ysr@777 | 150 | bool is_g1_policy() { return as_g1_policy() != NULL; } |
jprovino@4542 | 151 | #else // INCLUDE_ALL_GCS |
duke@435 | 152 | bool is_concurrent_mark_sweep_policy() { return false; } |
ysr@777 | 153 | bool is_g1_policy() { return false; } |
jprovino@4542 | 154 | #endif // INCLUDE_ALL_GCS |
duke@435 | 155 | |
ysr@777 | 156 | |
duke@435 | 157 | virtual BarrierSet::Name barrier_set_name() = 0; |
duke@435 | 158 | |
duke@435 | 159 | // Create the remembered set (to cover the given reserved region, |
duke@435 | 160 | // allowing breaking up into at most "max_covered_regions"). |
duke@435 | 161 | virtual GenRemSet* create_rem_set(MemRegion reserved, |
duke@435 | 162 | int max_covered_regions); |
duke@435 | 163 | |
duke@435 | 164 | // This method controls how a collector satisfies a request |
duke@435 | 165 | // for a block of memory. "gc_time_limit_was_exceeded" will |
duke@435 | 166 | // be set to true if the adaptive size policy determine that |
duke@435 | 167 | // an excessive amount of time is being spent doing collections |
duke@435 | 168 | // and caused a NULL to be returned. If a NULL is not returned, |
duke@435 | 169 | // "gc_time_limit_was_exceeded" has an undefined meaning. |
duke@435 | 170 | virtual HeapWord* mem_allocate_work(size_t size, |
duke@435 | 171 | bool is_tlab, |
duke@435 | 172 | bool* gc_overhead_limit_was_exceeded) = 0; |
duke@435 | 173 | |
duke@435 | 174 | // This method controls how a collector handles one or more |
duke@435 | 175 | // of its generations being fully allocated. |
duke@435 | 176 | virtual HeapWord *satisfy_failed_allocation(size_t size, bool is_tlab) = 0; |
coleenp@4037 | 177 | // This method controls how a collector handles a metadata allocation |
coleenp@4037 | 178 | // failure. |
coleenp@4037 | 179 | virtual MetaWord* satisfy_failed_metadata_allocation(ClassLoaderData* loader_data, |
coleenp@4037 | 180 | size_t size, |
coleenp@4037 | 181 | Metaspace::MetadataType mdtype); |
coleenp@4037 | 182 | |
duke@435 | 183 | // Performace Counter support |
duke@435 | 184 | GCPolicyCounters* counters() { return _gc_policy_counters; } |
duke@435 | 185 | |
duke@435 | 186 | // Create the jstat counters for the GC policy. By default, policy's |
duke@435 | 187 | // don't have associated counters, and we complain if this is invoked. |
duke@435 | 188 | virtual void initialize_gc_policy_counters() { |
duke@435 | 189 | ShouldNotReachHere(); |
duke@435 | 190 | } |
duke@435 | 191 | |
duke@435 | 192 | virtual CollectorPolicy::Name kind() { |
duke@435 | 193 | return CollectorPolicy::CollectorPolicyKind; |
duke@435 | 194 | } |
duke@435 | 195 | |
duke@435 | 196 | // Returns true if a collector has eden space with soft end. |
duke@435 | 197 | virtual bool has_soft_ended_eden() { |
duke@435 | 198 | return false; |
duke@435 | 199 | } |
duke@435 | 200 | |
jwilhelm@6085 | 201 | // Do any updates required to global flags that are due to heap initialization |
jwilhelm@6085 | 202 | // changes |
jwilhelm@6085 | 203 | virtual void post_heap_initialize() = 0; |
duke@435 | 204 | }; |
duke@435 | 205 | |
jmasa@1822 | 206 | class ClearedAllSoftRefs : public StackObj { |
jmasa@1822 | 207 | bool _clear_all_soft_refs; |
jmasa@1822 | 208 | CollectorPolicy* _collector_policy; |
jmasa@1822 | 209 | public: |
jmasa@1822 | 210 | ClearedAllSoftRefs(bool clear_all_soft_refs, |
jmasa@1822 | 211 | CollectorPolicy* collector_policy) : |
jmasa@1822 | 212 | _clear_all_soft_refs(clear_all_soft_refs), |
jmasa@1822 | 213 | _collector_policy(collector_policy) {} |
jmasa@1822 | 214 | |
jmasa@1822 | 215 | ~ClearedAllSoftRefs() { |
jmasa@1822 | 216 | if (_clear_all_soft_refs) { |
jmasa@1822 | 217 | _collector_policy->cleared_all_soft_refs(); |
jmasa@1822 | 218 | } |
jmasa@1822 | 219 | } |
jmasa@1822 | 220 | }; |
jmasa@1822 | 221 | |
duke@435 | 222 | class GenCollectorPolicy : public CollectorPolicy { |
sjohanss@6641 | 223 | friend class TestGenCollectorPolicy; |
duke@435 | 224 | protected: |
duke@435 | 225 | size_t _min_gen0_size; |
duke@435 | 226 | size_t _initial_gen0_size; |
duke@435 | 227 | size_t _max_gen0_size; |
duke@435 | 228 | |
jwilhelm@6085 | 229 | // _gen_alignment and _space_alignment will have the same value most of the |
jwilhelm@6085 | 230 | // time. When using large pages they can differ. |
jwilhelm@6085 | 231 | size_t _gen_alignment; |
jwilhelm@6085 | 232 | |
duke@435 | 233 | GenerationSpec **_generations; |
duke@435 | 234 | |
duke@435 | 235 | // Return true if an allocation should be attempted in the older |
duke@435 | 236 | // generation if it fails in the younger generation. Return |
duke@435 | 237 | // false, otherwise. |
duke@435 | 238 | virtual bool should_try_older_generation_allocation(size_t word_size) const; |
duke@435 | 239 | |
duke@435 | 240 | void initialize_flags(); |
duke@435 | 241 | void initialize_size_info(); |
duke@435 | 242 | |
jwilhelm@6085 | 243 | DEBUG_ONLY(void assert_flags();) |
jwilhelm@6085 | 244 | DEBUG_ONLY(void assert_size_info();) |
jwilhelm@6085 | 245 | |
duke@435 | 246 | // Try to allocate space by expanding the heap. |
duke@435 | 247 | virtual HeapWord* expand_heap_and_allocate(size_t size, bool is_tlab); |
duke@435 | 248 | |
jwilhelm@6085 | 249 | // Compute max heap alignment |
jwilhelm@6085 | 250 | size_t compute_max_alignment(); |
jwilhelm@6085 | 251 | |
jwilhelm@6085 | 252 | // Scale the base_size by NewRatio according to |
jmasa@448 | 253 | // result = base_size / (NewRatio + 1) |
jmasa@448 | 254 | // and align by min_alignment() |
jmasa@448 | 255 | size_t scale_by_NewRatio_aligned(size_t base_size); |
jmasa@448 | 256 | |
jwilhelm@6085 | 257 | // Bound the value by the given maximum minus the min_alignment |
jmasa@448 | 258 | size_t bound_minus_alignment(size_t desired_size, size_t maximum_size); |
duke@435 | 259 | |
duke@435 | 260 | public: |
jwilhelm@6085 | 261 | GenCollectorPolicy(); |
jwilhelm@6085 | 262 | |
jmasa@448 | 263 | // Accessors |
jwilhelm@5855 | 264 | size_t min_gen0_size() { return _min_gen0_size; } |
jmasa@448 | 265 | size_t initial_gen0_size() { return _initial_gen0_size; } |
jwilhelm@5855 | 266 | size_t max_gen0_size() { return _max_gen0_size; } |
jwilhelm@6085 | 267 | size_t gen_alignment() { return _gen_alignment; } |
jmasa@448 | 268 | |
duke@435 | 269 | virtual int number_of_generations() = 0; |
duke@435 | 270 | |
jwilhelm@6084 | 271 | virtual GenerationSpec **generations() { |
duke@435 | 272 | assert(_generations != NULL, "Sanity check"); |
duke@435 | 273 | return _generations; |
duke@435 | 274 | } |
duke@435 | 275 | |
duke@435 | 276 | virtual GenCollectorPolicy* as_generation_policy() { return this; } |
duke@435 | 277 | |
jwilhelm@6085 | 278 | virtual void initialize_generations() { }; |
duke@435 | 279 | |
duke@435 | 280 | virtual void initialize_all() { |
jwilhelm@6085 | 281 | CollectorPolicy::initialize_all(); |
duke@435 | 282 | initialize_generations(); |
duke@435 | 283 | } |
duke@435 | 284 | |
jwilhelm@6085 | 285 | size_t young_gen_size_lower_bound(); |
jwilhelm@6085 | 286 | |
duke@435 | 287 | HeapWord* mem_allocate_work(size_t size, |
duke@435 | 288 | bool is_tlab, |
duke@435 | 289 | bool* gc_overhead_limit_was_exceeded); |
duke@435 | 290 | |
duke@435 | 291 | HeapWord *satisfy_failed_allocation(size_t size, bool is_tlab); |
duke@435 | 292 | |
duke@435 | 293 | // Adaptive size policy |
duke@435 | 294 | virtual void initialize_size_policy(size_t init_eden_size, |
duke@435 | 295 | size_t init_promo_size, |
duke@435 | 296 | size_t init_survivor_size); |
jwilhelm@6084 | 297 | |
jwilhelm@6085 | 298 | virtual void post_heap_initialize() { |
jwilhelm@6085 | 299 | assert(_max_gen0_size == MaxNewSize, "Should be taken care of by initialize_size_info"); |
jwilhelm@6084 | 300 | } |
duke@435 | 301 | }; |
duke@435 | 302 | |
duke@435 | 303 | // All of hotspot's current collectors are subtypes of this |
duke@435 | 304 | // class. Currently, these collectors all use the same gen[0], |
duke@435 | 305 | // but have different gen[1] types. If we add another subtype |
duke@435 | 306 | // of CollectorPolicy, this class should be broken out into |
duke@435 | 307 | // its own file. |
duke@435 | 308 | |
duke@435 | 309 | class TwoGenerationCollectorPolicy : public GenCollectorPolicy { |
duke@435 | 310 | protected: |
duke@435 | 311 | size_t _min_gen1_size; |
duke@435 | 312 | size_t _initial_gen1_size; |
duke@435 | 313 | size_t _max_gen1_size; |
duke@435 | 314 | |
duke@435 | 315 | void initialize_flags(); |
duke@435 | 316 | void initialize_size_info(); |
jwilhelm@6085 | 317 | |
jwilhelm@6085 | 318 | DEBUG_ONLY(void assert_flags();) |
jwilhelm@6085 | 319 | DEBUG_ONLY(void assert_size_info();) |
duke@435 | 320 | |
duke@435 | 321 | public: |
jwilhelm@6085 | 322 | TwoGenerationCollectorPolicy() : GenCollectorPolicy(), _min_gen1_size(0), |
jwilhelm@6085 | 323 | _initial_gen1_size(0), _max_gen1_size(0) {} |
jwilhelm@6085 | 324 | |
jmasa@448 | 325 | // Accessors |
jwilhelm@5855 | 326 | size_t min_gen1_size() { return _min_gen1_size; } |
jmasa@448 | 327 | size_t initial_gen1_size() { return _initial_gen1_size; } |
jwilhelm@5855 | 328 | size_t max_gen1_size() { return _max_gen1_size; } |
jmasa@448 | 329 | |
duke@435 | 330 | // Inherited methods |
duke@435 | 331 | TwoGenerationCollectorPolicy* as_two_generation_policy() { return this; } |
duke@435 | 332 | |
jwilhelm@6084 | 333 | int number_of_generations() { return 2; } |
jwilhelm@6084 | 334 | BarrierSet::Name barrier_set_name() { return BarrierSet::CardTableModRef; } |
duke@435 | 335 | |
duke@435 | 336 | virtual CollectorPolicy::Name kind() { |
duke@435 | 337 | return CollectorPolicy::TwoGenerationCollectorPolicyKind; |
duke@435 | 338 | } |
jmasa@448 | 339 | |
jwilhelm@6091 | 340 | // Returns true if gen0 sizes were adjusted |
jmasa@448 | 341 | bool adjust_gen0_sizes(size_t* gen0_size_ptr, size_t* gen1_size_ptr, |
jwilhelm@6091 | 342 | const size_t heap_size); |
duke@435 | 343 | }; |
duke@435 | 344 | |
duke@435 | 345 | class MarkSweepPolicy : public TwoGenerationCollectorPolicy { |
duke@435 | 346 | protected: |
jwilhelm@6085 | 347 | void initialize_alignments(); |
duke@435 | 348 | void initialize_generations(); |
duke@435 | 349 | |
duke@435 | 350 | public: |
jwilhelm@6085 | 351 | MarkSweepPolicy() {} |
duke@435 | 352 | |
duke@435 | 353 | MarkSweepPolicy* as_mark_sweep_policy() { return this; } |
duke@435 | 354 | |
duke@435 | 355 | void initialize_gc_policy_counters(); |
duke@435 | 356 | }; |
stefank@2314 | 357 | |
stefank@2314 | 358 | #endif // SHARE_VM_MEMORY_COLLECTORPOLICY_HPP |