Tue, 11 May 2010 14:35:43 -0700
6931180: Migration to recent versions of MS Platform SDK
6951582: Build problems on win64
Summary: Changes to enable building JDK7 with Microsoft Visual Studio 2010
Reviewed-by: ohair, art, ccheung, dcubed
duke@435 | 1 | /* |
jmasa@1822 | 2 | * Copyright 2001-2010 Sun Microsystems, Inc. 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 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | // This class (or more correctly, subtypes of this class) |
duke@435 | 26 | // are used to define global garbage collector attributes. |
duke@435 | 27 | // This includes initialization of generations and any other |
duke@435 | 28 | // shared resources they may need. |
duke@435 | 29 | // |
duke@435 | 30 | // In general, all flag adjustment and validation should be |
duke@435 | 31 | // done in initialize_flags(), which is called prior to |
duke@435 | 32 | // initialize_size_info(). |
duke@435 | 33 | // |
duke@435 | 34 | // This class is not fully developed yet. As more collector(s) |
duke@435 | 35 | // are added, it is expected that we will come across further |
duke@435 | 36 | // behavior that requires global attention. The correct place |
duke@435 | 37 | // to deal with those issues is this class. |
duke@435 | 38 | |
duke@435 | 39 | // Forward declarations. |
duke@435 | 40 | class GenCollectorPolicy; |
duke@435 | 41 | class TwoGenerationCollectorPolicy; |
ysr@777 | 42 | class AdaptiveSizePolicy; |
duke@435 | 43 | #ifndef SERIALGC |
duke@435 | 44 | class ConcurrentMarkSweepPolicy; |
ysr@777 | 45 | class G1CollectorPolicy; |
duke@435 | 46 | #endif // SERIALGC |
ysr@777 | 47 | |
duke@435 | 48 | class GCPolicyCounters; |
duke@435 | 49 | class PermanentGenerationSpec; |
duke@435 | 50 | class MarkSweepPolicy; |
duke@435 | 51 | |
duke@435 | 52 | class CollectorPolicy : public CHeapObj { |
duke@435 | 53 | protected: |
duke@435 | 54 | PermanentGenerationSpec *_permanent_generation; |
duke@435 | 55 | GCPolicyCounters* _gc_policy_counters; |
duke@435 | 56 | |
duke@435 | 57 | // Requires that the concrete subclass sets the alignment constraints |
duke@435 | 58 | // before calling. |
duke@435 | 59 | virtual void initialize_flags(); |
ysr@777 | 60 | virtual void initialize_size_info(); |
duke@435 | 61 | // Initialize "_permanent_generation" to a spec for the given kind of |
duke@435 | 62 | // Perm Gen. |
duke@435 | 63 | void initialize_perm_generation(PermGen::Name pgnm); |
duke@435 | 64 | |
duke@435 | 65 | size_t _initial_heap_byte_size; |
duke@435 | 66 | size_t _max_heap_byte_size; |
duke@435 | 67 | size_t _min_heap_byte_size; |
duke@435 | 68 | |
duke@435 | 69 | size_t _min_alignment; |
duke@435 | 70 | size_t _max_alignment; |
duke@435 | 71 | |
jmasa@1822 | 72 | // The sizing of the heap are controlled by a sizing policy. |
jmasa@1822 | 73 | AdaptiveSizePolicy* _size_policy; |
jmasa@1822 | 74 | |
jmasa@1822 | 75 | // Set to true when policy wants soft refs cleared. |
jmasa@1822 | 76 | // Reset to false by gc after it clears all soft refs. |
jmasa@1822 | 77 | bool _should_clear_all_soft_refs; |
jmasa@1822 | 78 | // Set to true by the GC if the just-completed gc cleared all |
jmasa@1822 | 79 | // softrefs. This is set to true whenever a gc clears all softrefs, and |
jmasa@1822 | 80 | // set to false each time gc returns to the mutator. For example, in the |
jmasa@1822 | 81 | // ParallelScavengeHeap case the latter would be done toward the end of |
jmasa@1822 | 82 | // mem_allocate() where it returns op.result() |
jmasa@1822 | 83 | bool _all_soft_refs_clear; |
jmasa@1822 | 84 | |
duke@435 | 85 | CollectorPolicy() : |
duke@435 | 86 | _min_alignment(1), |
duke@435 | 87 | _max_alignment(1), |
duke@435 | 88 | _initial_heap_byte_size(0), |
duke@435 | 89 | _max_heap_byte_size(0), |
jmasa@1822 | 90 | _min_heap_byte_size(0), |
jmasa@1822 | 91 | _size_policy(NULL), |
jmasa@1822 | 92 | _should_clear_all_soft_refs(false), |
jmasa@1822 | 93 | _all_soft_refs_clear(false) |
duke@435 | 94 | {} |
duke@435 | 95 | |
duke@435 | 96 | public: |
duke@435 | 97 | void set_min_alignment(size_t align) { _min_alignment = align; } |
duke@435 | 98 | size_t min_alignment() { return _min_alignment; } |
duke@435 | 99 | void set_max_alignment(size_t align) { _max_alignment = align; } |
duke@435 | 100 | size_t max_alignment() { return _max_alignment; } |
duke@435 | 101 | |
duke@435 | 102 | size_t initial_heap_byte_size() { return _initial_heap_byte_size; } |
jmasa@448 | 103 | void set_initial_heap_byte_size(size_t v) { _initial_heap_byte_size = v; } |
duke@435 | 104 | size_t max_heap_byte_size() { return _max_heap_byte_size; } |
jmasa@448 | 105 | void set_max_heap_byte_size(size_t v) { _max_heap_byte_size = v; } |
duke@435 | 106 | size_t min_heap_byte_size() { return _min_heap_byte_size; } |
jmasa@448 | 107 | void set_min_heap_byte_size(size_t v) { _min_heap_byte_size = v; } |
duke@435 | 108 | |
duke@435 | 109 | enum Name { |
duke@435 | 110 | CollectorPolicyKind, |
duke@435 | 111 | TwoGenerationCollectorPolicyKind, |
duke@435 | 112 | ConcurrentMarkSweepPolicyKind, |
ysr@777 | 113 | ASConcurrentMarkSweepPolicyKind, |
ysr@777 | 114 | G1CollectorPolicyKind |
duke@435 | 115 | }; |
duke@435 | 116 | |
jmasa@1822 | 117 | AdaptiveSizePolicy* size_policy() { return _size_policy; } |
jmasa@1822 | 118 | bool should_clear_all_soft_refs() { return _should_clear_all_soft_refs; } |
jmasa@1822 | 119 | void set_should_clear_all_soft_refs(bool v) { _should_clear_all_soft_refs = v; } |
jmasa@1822 | 120 | // Returns the current value of _should_clear_all_soft_refs. |
jmasa@1822 | 121 | // _should_clear_all_soft_refs is set to false as a side effect. |
jmasa@1822 | 122 | bool use_should_clear_all_soft_refs(bool v); |
jmasa@1822 | 123 | bool all_soft_refs_clear() { return _all_soft_refs_clear; } |
jmasa@1822 | 124 | void set_all_soft_refs_clear(bool v) { _all_soft_refs_clear = v; } |
jmasa@1822 | 125 | |
jmasa@1822 | 126 | // Called by the GC after Soft Refs have been cleared to indicate |
jmasa@1822 | 127 | // that the request in _should_clear_all_soft_refs has been fulfilled. |
jmasa@1822 | 128 | void cleared_all_soft_refs(); |
jmasa@1822 | 129 | |
duke@435 | 130 | // Identification methods. |
ysr@777 | 131 | virtual GenCollectorPolicy* as_generation_policy() { return NULL; } |
duke@435 | 132 | virtual TwoGenerationCollectorPolicy* as_two_generation_policy() { return NULL; } |
duke@435 | 133 | virtual MarkSweepPolicy* as_mark_sweep_policy() { return NULL; } |
duke@435 | 134 | #ifndef SERIALGC |
duke@435 | 135 | virtual ConcurrentMarkSweepPolicy* as_concurrent_mark_sweep_policy() { return NULL; } |
ysr@777 | 136 | virtual G1CollectorPolicy* as_g1_policy() { return NULL; } |
duke@435 | 137 | #endif // SERIALGC |
duke@435 | 138 | // Note that these are not virtual. |
duke@435 | 139 | bool is_generation_policy() { return as_generation_policy() != NULL; } |
duke@435 | 140 | bool is_two_generation_policy() { return as_two_generation_policy() != NULL; } |
duke@435 | 141 | bool is_mark_sweep_policy() { return as_mark_sweep_policy() != NULL; } |
duke@435 | 142 | #ifndef SERIALGC |
duke@435 | 143 | bool is_concurrent_mark_sweep_policy() { return as_concurrent_mark_sweep_policy() != NULL; } |
ysr@777 | 144 | bool is_g1_policy() { return as_g1_policy() != NULL; } |
duke@435 | 145 | #else // SERIALGC |
duke@435 | 146 | bool is_concurrent_mark_sweep_policy() { return false; } |
ysr@777 | 147 | bool is_g1_policy() { return false; } |
duke@435 | 148 | #endif // SERIALGC |
duke@435 | 149 | |
ysr@777 | 150 | |
duke@435 | 151 | virtual PermanentGenerationSpec *permanent_generation() { |
duke@435 | 152 | assert(_permanent_generation != NULL, "Sanity check"); |
duke@435 | 153 | return _permanent_generation; |
duke@435 | 154 | } |
duke@435 | 155 | |
duke@435 | 156 | virtual BarrierSet::Name barrier_set_name() = 0; |
duke@435 | 157 | virtual GenRemSet::Name rem_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; |
duke@435 | 177 | // Performace Counter support |
duke@435 | 178 | GCPolicyCounters* counters() { return _gc_policy_counters; } |
duke@435 | 179 | |
duke@435 | 180 | // Create the jstat counters for the GC policy. By default, policy's |
duke@435 | 181 | // don't have associated counters, and we complain if this is invoked. |
duke@435 | 182 | virtual void initialize_gc_policy_counters() { |
duke@435 | 183 | ShouldNotReachHere(); |
duke@435 | 184 | } |
duke@435 | 185 | |
duke@435 | 186 | virtual CollectorPolicy::Name kind() { |
duke@435 | 187 | return CollectorPolicy::CollectorPolicyKind; |
duke@435 | 188 | } |
duke@435 | 189 | |
duke@435 | 190 | // Returns true if a collector has eden space with soft end. |
duke@435 | 191 | virtual bool has_soft_ended_eden() { |
duke@435 | 192 | return false; |
duke@435 | 193 | } |
duke@435 | 194 | |
duke@435 | 195 | }; |
duke@435 | 196 | |
jmasa@1822 | 197 | class ClearedAllSoftRefs : public StackObj { |
jmasa@1822 | 198 | bool _clear_all_soft_refs; |
jmasa@1822 | 199 | CollectorPolicy* _collector_policy; |
jmasa@1822 | 200 | public: |
jmasa@1822 | 201 | ClearedAllSoftRefs(bool clear_all_soft_refs, |
jmasa@1822 | 202 | CollectorPolicy* collector_policy) : |
jmasa@1822 | 203 | _clear_all_soft_refs(clear_all_soft_refs), |
jmasa@1822 | 204 | _collector_policy(collector_policy) {} |
jmasa@1822 | 205 | |
jmasa@1822 | 206 | ~ClearedAllSoftRefs() { |
jmasa@1822 | 207 | if (_clear_all_soft_refs) { |
jmasa@1822 | 208 | _collector_policy->cleared_all_soft_refs(); |
jmasa@1822 | 209 | } |
jmasa@1822 | 210 | } |
jmasa@1822 | 211 | }; |
jmasa@1822 | 212 | |
duke@435 | 213 | class GenCollectorPolicy : public CollectorPolicy { |
duke@435 | 214 | protected: |
duke@435 | 215 | size_t _min_gen0_size; |
duke@435 | 216 | size_t _initial_gen0_size; |
duke@435 | 217 | size_t _max_gen0_size; |
duke@435 | 218 | |
duke@435 | 219 | GenerationSpec **_generations; |
duke@435 | 220 | |
duke@435 | 221 | // Return true if an allocation should be attempted in the older |
duke@435 | 222 | // generation if it fails in the younger generation. Return |
duke@435 | 223 | // false, otherwise. |
duke@435 | 224 | virtual bool should_try_older_generation_allocation(size_t word_size) const; |
duke@435 | 225 | |
duke@435 | 226 | void initialize_flags(); |
duke@435 | 227 | void initialize_size_info(); |
duke@435 | 228 | |
duke@435 | 229 | // Try to allocate space by expanding the heap. |
duke@435 | 230 | virtual HeapWord* expand_heap_and_allocate(size_t size, bool is_tlab); |
duke@435 | 231 | |
duke@435 | 232 | // compute max heap alignment |
duke@435 | 233 | size_t compute_max_alignment(); |
duke@435 | 234 | |
jmasa@448 | 235 | // Scale the base_size by NewRation according to |
jmasa@448 | 236 | // result = base_size / (NewRatio + 1) |
jmasa@448 | 237 | // and align by min_alignment() |
jmasa@448 | 238 | size_t scale_by_NewRatio_aligned(size_t base_size); |
jmasa@448 | 239 | |
jmasa@448 | 240 | // Bound the value by the given maximum minus the |
jmasa@448 | 241 | // min_alignment. |
jmasa@448 | 242 | size_t bound_minus_alignment(size_t desired_size, size_t maximum_size); |
duke@435 | 243 | |
duke@435 | 244 | public: |
jmasa@448 | 245 | // Accessors |
jmasa@448 | 246 | size_t min_gen0_size() { return _min_gen0_size; } |
jmasa@448 | 247 | void set_min_gen0_size(size_t v) { _min_gen0_size = v; } |
jmasa@448 | 248 | size_t initial_gen0_size() { return _initial_gen0_size; } |
jmasa@448 | 249 | void set_initial_gen0_size(size_t v) { _initial_gen0_size = v; } |
jmasa@448 | 250 | size_t max_gen0_size() { return _max_gen0_size; } |
jmasa@448 | 251 | void set_max_gen0_size(size_t v) { _max_gen0_size = v; } |
jmasa@448 | 252 | |
duke@435 | 253 | virtual int number_of_generations() = 0; |
duke@435 | 254 | |
duke@435 | 255 | virtual GenerationSpec **generations() { |
duke@435 | 256 | assert(_generations != NULL, "Sanity check"); |
duke@435 | 257 | return _generations; |
duke@435 | 258 | } |
duke@435 | 259 | |
duke@435 | 260 | virtual GenCollectorPolicy* as_generation_policy() { return this; } |
duke@435 | 261 | |
duke@435 | 262 | virtual void initialize_generations() = 0; |
duke@435 | 263 | |
duke@435 | 264 | virtual void initialize_all() { |
duke@435 | 265 | initialize_flags(); |
duke@435 | 266 | initialize_size_info(); |
duke@435 | 267 | initialize_generations(); |
duke@435 | 268 | } |
duke@435 | 269 | |
duke@435 | 270 | HeapWord* mem_allocate_work(size_t size, |
duke@435 | 271 | bool is_tlab, |
duke@435 | 272 | bool* gc_overhead_limit_was_exceeded); |
duke@435 | 273 | |
duke@435 | 274 | HeapWord *satisfy_failed_allocation(size_t size, bool is_tlab); |
duke@435 | 275 | |
duke@435 | 276 | // The size that defines a "large array". |
duke@435 | 277 | virtual size_t large_typearray_limit(); |
duke@435 | 278 | |
duke@435 | 279 | // Adaptive size policy |
duke@435 | 280 | virtual void initialize_size_policy(size_t init_eden_size, |
duke@435 | 281 | size_t init_promo_size, |
duke@435 | 282 | size_t init_survivor_size); |
duke@435 | 283 | }; |
duke@435 | 284 | |
duke@435 | 285 | // All of hotspot's current collectors are subtypes of this |
duke@435 | 286 | // class. Currently, these collectors all use the same gen[0], |
duke@435 | 287 | // but have different gen[1] types. If we add another subtype |
duke@435 | 288 | // of CollectorPolicy, this class should be broken out into |
duke@435 | 289 | // its own file. |
duke@435 | 290 | |
duke@435 | 291 | class TwoGenerationCollectorPolicy : public GenCollectorPolicy { |
duke@435 | 292 | protected: |
duke@435 | 293 | size_t _min_gen1_size; |
duke@435 | 294 | size_t _initial_gen1_size; |
duke@435 | 295 | size_t _max_gen1_size; |
duke@435 | 296 | |
duke@435 | 297 | void initialize_flags(); |
duke@435 | 298 | void initialize_size_info(); |
duke@435 | 299 | void initialize_generations() { ShouldNotReachHere(); } |
duke@435 | 300 | |
duke@435 | 301 | public: |
jmasa@448 | 302 | // Accessors |
jmasa@448 | 303 | size_t min_gen1_size() { return _min_gen1_size; } |
jmasa@448 | 304 | void set_min_gen1_size(size_t v) { _min_gen1_size = v; } |
jmasa@448 | 305 | size_t initial_gen1_size() { return _initial_gen1_size; } |
jmasa@448 | 306 | void set_initial_gen1_size(size_t v) { _initial_gen1_size = v; } |
jmasa@448 | 307 | size_t max_gen1_size() { return _max_gen1_size; } |
jmasa@448 | 308 | void set_max_gen1_size(size_t v) { _max_gen1_size = v; } |
jmasa@448 | 309 | |
duke@435 | 310 | // Inherited methods |
duke@435 | 311 | TwoGenerationCollectorPolicy* as_two_generation_policy() { return this; } |
duke@435 | 312 | |
duke@435 | 313 | int number_of_generations() { return 2; } |
duke@435 | 314 | BarrierSet::Name barrier_set_name() { return BarrierSet::CardTableModRef; } |
duke@435 | 315 | GenRemSet::Name rem_set_name() { return GenRemSet::CardTable; } |
duke@435 | 316 | |
duke@435 | 317 | virtual CollectorPolicy::Name kind() { |
duke@435 | 318 | return CollectorPolicy::TwoGenerationCollectorPolicyKind; |
duke@435 | 319 | } |
jmasa@448 | 320 | |
jmasa@448 | 321 | // Returns true is gen0 sizes were adjusted |
jmasa@448 | 322 | bool adjust_gen0_sizes(size_t* gen0_size_ptr, size_t* gen1_size_ptr, |
jmasa@448 | 323 | size_t heap_size, size_t min_gen1_size); |
duke@435 | 324 | }; |
duke@435 | 325 | |
duke@435 | 326 | class MarkSweepPolicy : public TwoGenerationCollectorPolicy { |
duke@435 | 327 | protected: |
duke@435 | 328 | void initialize_generations(); |
duke@435 | 329 | |
duke@435 | 330 | public: |
duke@435 | 331 | MarkSweepPolicy(); |
duke@435 | 332 | |
duke@435 | 333 | MarkSweepPolicy* as_mark_sweep_policy() { return this; } |
duke@435 | 334 | |
duke@435 | 335 | void initialize_gc_policy_counters(); |
duke@435 | 336 | }; |