Mercurial > hg > truffle
annotate src/share/vm/memory/generation.hpp @ 11096:71180a6e5080
7133260: AllocationProfiler uses space in metadata and doesn't seem to do anything useful.
Summary: Remove -Xaprof and Klass::_alloc_count & ArrayKlass::_alloc_size.
Reviewed-by: stefank, coleenp
| author | jiangli |
|---|---|
| date | Wed, 03 Jul 2013 17:26:59 -0400 |
| parents | 8617e38bb4cb |
| children | 7b06ae405d7b |
| rev | line source |
|---|---|
| 0 | 1 /* |
| 6008 | 2 * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved. |
| 0 | 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 * | |
|
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1145
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1145
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1145
diff
changeset
|
21 * questions. |
| 0 | 22 * |
| 23 */ | |
| 24 | |
| 1972 | 25 #ifndef SHARE_VM_MEMORY_GENERATION_HPP |
| 26 #define SHARE_VM_MEMORY_GENERATION_HPP | |
| 27 | |
| 28 #include "gc_implementation/shared/collectorCounters.hpp" | |
| 29 #include "memory/allocation.hpp" | |
| 30 #include "memory/memRegion.hpp" | |
| 31 #include "memory/referenceProcessor.hpp" | |
| 32 #include "memory/universe.hpp" | |
| 33 #include "memory/watermark.hpp" | |
| 34 #include "runtime/mutex.hpp" | |
| 35 #include "runtime/perfData.hpp" | |
| 36 #include "runtime/virtualspace.hpp" | |
| 37 | |
| 0 | 38 // A Generation models a heap area for similarly-aged objects. |
| 39 // It will contain one ore more spaces holding the actual objects. | |
| 40 // | |
| 41 // The Generation class hierarchy: | |
| 42 // | |
| 43 // Generation - abstract base class | |
| 44 // - DefNewGeneration - allocation area (copy collected) | |
| 45 // - ParNewGeneration - a DefNewGeneration that is collected by | |
| 46 // several threads | |
| 47 // - CardGeneration - abstract class adding offset array behavior | |
| 48 // - OneContigSpaceCardGeneration - abstract class holding a single | |
| 49 // contiguous space with card marking | |
| 50 // - TenuredGeneration - tenured (old object) space (markSweepCompact) | |
| 51 // - ConcurrentMarkSweepGeneration - Mostly Concurrent Mark Sweep Generation | |
| 52 // (Detlefs-Printezis refinement of | |
| 53 // Boehm-Demers-Schenker) | |
| 54 // | |
| 55 // The system configurations currently allowed are: | |
| 56 // | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
57 // DefNewGeneration + TenuredGeneration |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
58 // DefNewGeneration + ConcurrentMarkSweepGeneration |
| 0 | 59 // |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
60 // ParNewGeneration + TenuredGeneration |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
61 // ParNewGeneration + ConcurrentMarkSweepGeneration |
| 0 | 62 // |
| 63 | |
| 64 class DefNewGeneration; | |
| 65 class GenerationSpec; | |
| 66 class CompactibleSpace; | |
| 67 class ContiguousSpace; | |
| 68 class CompactPoint; | |
| 69 class OopsInGenClosure; | |
| 70 class OopClosure; | |
| 71 class ScanClosure; | |
| 72 class FastScanClosure; | |
| 73 class GenCollectedHeap; | |
| 74 class GenRemSet; | |
| 75 class GCStats; | |
| 76 | |
| 77 // A "ScratchBlock" represents a block of memory in one generation usable by | |
| 78 // another. It represents "num_words" free words, starting at and including | |
| 79 // the address of "this". | |
| 80 struct ScratchBlock { | |
| 81 ScratchBlock* next; | |
| 82 size_t num_words; | |
| 83 HeapWord scratch_space[1]; // Actually, of size "num_words-2" (assuming | |
| 84 // first two fields are word-sized.) | |
| 85 }; | |
| 86 | |
| 87 | |
| 6197 | 88 class Generation: public CHeapObj<mtGC> { |
| 0 | 89 friend class VMStructs; |
| 90 private: | |
| 91 jlong _time_of_last_gc; // time when last gc on this generation happened (ms) | |
| 92 MemRegion _prev_used_region; // for collectors that want to "remember" a value for | |
| 93 // used region at some specific point during collection. | |
| 94 | |
| 95 protected: | |
| 96 // Minimum and maximum addresses for memory reserved (not necessarily | |
| 97 // committed) for generation. | |
| 98 // Used by card marking code. Must not overlap with address ranges of | |
| 99 // other generations. | |
| 100 MemRegion _reserved; | |
| 101 | |
| 102 // Memory area reserved for generation | |
| 103 VirtualSpace _virtual_space; | |
| 104 | |
| 105 // Level in the generation hierarchy. | |
| 106 int _level; | |
| 107 | |
| 108 // ("Weak") Reference processing support | |
| 109 ReferenceProcessor* _ref_processor; | |
| 110 | |
| 111 // Performance Counters | |
| 112 CollectorCounters* _gc_counters; | |
| 113 | |
| 114 // Statistics for garbage collection | |
| 115 GCStats* _gc_stats; | |
| 116 | |
| 117 // Returns the next generation in the configuration, or else NULL if this | |
| 118 // is the highest generation. | |
| 119 Generation* next_gen() const; | |
| 120 | |
| 121 // Initialize the generation. | |
| 122 Generation(ReservedSpace rs, size_t initial_byte_size, int level); | |
| 123 | |
| 124 // Apply "cl->do_oop" to (the address of) (exactly) all the ref fields in | |
| 125 // "sp" that point into younger generations. | |
| 126 // The iteration is only over objects allocated at the start of the | |
| 127 // iterations; objects allocated as a result of applying the closure are | |
| 128 // not included. | |
| 129 void younger_refs_in_space_iterate(Space* sp, OopsInGenClosure* cl); | |
| 130 | |
| 131 public: | |
| 132 // The set of possible generation kinds. | |
| 133 enum Name { | |
| 134 ASParNew, | |
| 135 ASConcurrentMarkSweep, | |
| 136 DefNew, | |
| 137 ParNew, | |
| 138 MarkSweepCompact, | |
| 139 ConcurrentMarkSweep, | |
| 140 Other | |
| 141 }; | |
| 142 | |
| 143 enum SomePublicConstants { | |
| 144 // Generations are GenGrain-aligned and have size that are multiples of | |
| 145 // GenGrain. | |
|
1681
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1552
diff
changeset
|
146 // Note: on ARM we add 1 bit for card_table_base to be properly aligned |
|
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1552
diff
changeset
|
147 // (we expect its low byte to be zero - see implementation of post_barrier) |
|
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1552
diff
changeset
|
148 LogOfGenGrain = 16 ARM_ONLY(+1), |
| 0 | 149 GenGrain = 1 << LogOfGenGrain |
| 150 }; | |
| 151 | |
| 152 // allocate and initialize ("weak") refs processing support | |
| 153 virtual void ref_processor_init(); | |
| 154 void set_ref_processor(ReferenceProcessor* rp) { | |
| 155 assert(_ref_processor == NULL, "clobbering existing _ref_processor"); | |
| 156 _ref_processor = rp; | |
| 157 } | |
| 158 | |
| 159 virtual Generation::Name kind() { return Generation::Other; } | |
| 160 GenerationSpec* spec(); | |
| 161 | |
| 162 // This properly belongs in the collector, but for now this | |
| 163 // will do. | |
| 164 virtual bool refs_discovery_is_atomic() const { return true; } | |
| 165 virtual bool refs_discovery_is_mt() const { return false; } | |
| 166 | |
| 167 // Space enquiries (results in bytes) | |
| 168 virtual size_t capacity() const = 0; // The maximum number of object bytes the | |
| 169 // generation can currently hold. | |
| 170 virtual size_t used() const = 0; // The number of used bytes in the gen. | |
| 171 virtual size_t free() const = 0; // The number of free bytes in the gen. | |
| 172 | |
| 173 // Support for java.lang.Runtime.maxMemory(); see CollectedHeap. | |
| 174 // Returns the total number of bytes available in a generation | |
| 175 // for the allocation of objects. | |
| 176 virtual size_t max_capacity() const; | |
| 177 | |
| 178 // If this is a young generation, the maximum number of bytes that can be | |
| 179 // allocated in this generation before a GC is triggered. | |
| 180 virtual size_t capacity_before_gc() const { return 0; } | |
| 181 | |
| 182 // The largest number of contiguous free bytes in the generation, | |
| 183 // including expansion (Assumes called at a safepoint.) | |
| 184 virtual size_t contiguous_available() const = 0; | |
| 185 // The largest number of contiguous free bytes in this or any higher generation. | |
| 186 virtual size_t max_contiguous_available() const; | |
| 187 | |
|
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1681
diff
changeset
|
188 // Returns true if promotions of the specified amount are |
|
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1681
diff
changeset
|
189 // likely to succeed without a promotion failure. |
| 0 | 190 // Promotion of the full amount is not guaranteed but |
|
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1681
diff
changeset
|
191 // might be attempted in the worst case. |
|
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1681
diff
changeset
|
192 virtual bool promotion_attempt_is_safe(size_t max_promotion_in_bytes) const; |
| 0 | 193 |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
194 // For a non-young generation, this interface can be used to inform a |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
195 // generation that a promotion attempt into that generation failed. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
196 // Typically used to enable diagnostic output for post-mortem analysis, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
197 // but other uses of the interface are not ruled out. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
198 virtual void promotion_failure_occurred() { /* does nothing */ } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
199 |
| 0 | 200 // Return an estimate of the maximum allocation that could be performed |
| 201 // in the generation without triggering any collection or expansion | |
| 202 // activity. It is "unsafe" because no locks are taken; the result | |
| 203 // should be treated as an approximation, not a guarantee, for use in | |
| 204 // heuristic resizing decisions. | |
| 205 virtual size_t unsafe_max_alloc_nogc() const = 0; | |
| 206 | |
| 207 // Returns true if this generation cannot be expanded further | |
| 208 // without a GC. Override as appropriate. | |
| 209 virtual bool is_maximal_no_gc() const { | |
| 210 return _virtual_space.uncommitted_size() == 0; | |
| 211 } | |
| 212 | |
| 213 MemRegion reserved() const { return _reserved; } | |
| 214 | |
| 215 // Returns a region guaranteed to contain all the objects in the | |
| 216 // generation. | |
| 217 virtual MemRegion used_region() const { return _reserved; } | |
| 218 | |
| 219 MemRegion prev_used_region() const { return _prev_used_region; } | |
| 220 virtual void save_used_region() { _prev_used_region = used_region(); } | |
| 221 | |
| 4708 | 222 // Returns "TRUE" iff "p" points into the committed areas in the generation. |
| 0 | 223 // For some kinds of generations, this may be an expensive operation. |
| 224 // To avoid performance problems stemming from its inadvertent use in | |
| 225 // product jvm's, we restrict its use to assertion checking or | |
| 226 // verification only. | |
| 227 virtual bool is_in(const void* p) const; | |
| 228 | |
| 229 /* Returns "TRUE" iff "p" points into the reserved area of the generation. */ | |
| 230 bool is_in_reserved(const void* p) const { | |
| 231 return _reserved.contains(p); | |
| 232 } | |
| 233 | |
| 234 // Check that the generation kind is DefNewGeneration or a sub | |
| 235 // class of DefNewGeneration and return a DefNewGeneration* | |
| 236 DefNewGeneration* as_DefNewGeneration(); | |
| 237 | |
| 238 // If some space in the generation contains the given "addr", return a | |
| 239 // pointer to that space, else return "NULL". | |
| 240 virtual Space* space_containing(const void* addr) const; | |
| 241 | |
| 242 // Iteration - do not use for time critical operations | |
| 243 virtual void space_iterate(SpaceClosure* blk, bool usedOnly = false) = 0; | |
| 244 | |
| 245 // Returns the first space, if any, in the generation that can participate | |
| 246 // in compaction, or else "NULL". | |
| 247 virtual CompactibleSpace* first_compaction_space() const = 0; | |
| 248 | |
| 249 // Returns "true" iff this generation should be used to allocate an | |
| 250 // object of the given size. Young generations might | |
| 251 // wish to exclude very large objects, for example, since, if allocated | |
| 252 // often, they would greatly increase the frequency of young-gen | |
| 253 // collection. | |
| 254 virtual bool should_allocate(size_t word_size, bool is_tlab) { | |
| 255 bool result = false; | |
| 256 size_t overflow_limit = (size_t)1 << (BitsPerSize_t - LogHeapWordSize); | |
| 257 if (!is_tlab || supports_tlab_allocation()) { | |
| 258 result = (word_size > 0) && (word_size < overflow_limit); | |
| 259 } | |
| 260 return result; | |
| 261 } | |
| 262 | |
| 263 // Allocate and returns a block of the requested size, or returns "NULL". | |
| 264 // Assumes the caller has done any necessary locking. | |
| 265 virtual HeapWord* allocate(size_t word_size, bool is_tlab) = 0; | |
| 266 | |
| 267 // Like "allocate", but performs any necessary locking internally. | |
| 268 virtual HeapWord* par_allocate(size_t word_size, bool is_tlab) = 0; | |
| 269 | |
| 270 // A 'younger' gen has reached an allocation limit, and uses this to notify | |
| 271 // the next older gen. The return value is a new limit, or NULL if none. The | |
| 272 // caller must do the necessary locking. | |
| 273 virtual HeapWord* allocation_limit_reached(Space* space, HeapWord* top, | |
| 274 size_t word_size) { | |
| 275 return NULL; | |
| 276 } | |
| 277 | |
| 278 // Some generation may offer a region for shared, contiguous allocation, | |
| 279 // via inlined code (by exporting the address of the top and end fields | |
| 280 // defining the extent of the contiguous allocation region.) | |
| 281 | |
| 282 // This function returns "true" iff the heap supports this kind of | |
| 283 // allocation. (More precisely, this means the style of allocation that | |
| 284 // increments *top_addr()" with a CAS.) (Default is "no".) | |
| 285 // A generation that supports this allocation style must use lock-free | |
| 286 // allocation for *all* allocation, since there are times when lock free | |
| 287 // allocation will be concurrent with plain "allocate" calls. | |
| 288 virtual bool supports_inline_contig_alloc() const { return false; } | |
| 289 | |
| 290 // These functions return the addresses of the fields that define the | |
| 291 // boundaries of the contiguous allocation area. (These fields should be | |
| 292 // physicall near to one another.) | |
| 293 virtual HeapWord** top_addr() const { return NULL; } | |
| 294 virtual HeapWord** end_addr() const { return NULL; } | |
| 295 | |
| 296 // Thread-local allocation buffers | |
| 297 virtual bool supports_tlab_allocation() const { return false; } | |
| 298 virtual size_t tlab_capacity() const { | |
| 299 guarantee(false, "Generation doesn't support thread local allocation buffers"); | |
| 300 return 0; | |
| 301 } | |
| 302 virtual size_t unsafe_max_tlab_alloc() const { | |
| 303 guarantee(false, "Generation doesn't support thread local allocation buffers"); | |
| 304 return 0; | |
| 305 } | |
| 306 | |
| 307 // "obj" is the address of an object in a younger generation. Allocate space | |
| 308 // for "obj" in the current (or some higher) generation, and copy "obj" into | |
| 309 // the newly allocated space, if possible, returning the result (or NULL if | |
| 310 // the allocation failed). | |
| 311 // | |
| 312 // The "obj_size" argument is just obj->size(), passed along so the caller can | |
| 313 // avoid repeating the virtual call to retrieve it. | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
314 virtual oop promote(oop obj, size_t obj_size); |
| 0 | 315 |
| 316 // Thread "thread_num" (0 <= i < ParalleGCThreads) wants to promote | |
| 317 // object "obj", whose original mark word was "m", and whose size is | |
| 318 // "word_sz". If possible, allocate space for "obj", copy obj into it | |
| 319 // (taking care to copy "m" into the mark word when done, since the mark | |
| 320 // word of "obj" may have been overwritten with a forwarding pointer, and | |
| 321 // also taking care to copy the klass pointer *last*. Returns the new | |
| 322 // object if successful, or else NULL. | |
| 323 virtual oop par_promote(int thread_num, | |
| 324 oop obj, markOop m, size_t word_sz); | |
| 325 | |
| 326 // Undo, if possible, the most recent par_promote_alloc allocation by | |
| 327 // "thread_num" ("obj", of "word_sz"). | |
| 328 virtual void par_promote_alloc_undo(int thread_num, | |
| 329 HeapWord* obj, size_t word_sz); | |
| 330 | |
| 331 // Informs the current generation that all par_promote_alloc's in the | |
| 332 // collection have been completed; any supporting data structures can be | |
| 333 // reset. Default is to do nothing. | |
| 334 virtual void par_promote_alloc_done(int thread_num) {} | |
| 335 | |
| 336 // Informs the current generation that all oop_since_save_marks_iterates | |
| 337 // performed by "thread_num" in the current collection, if any, have been | |
| 338 // completed; any supporting data structures can be reset. Default is to | |
| 339 // do nothing. | |
| 340 virtual void par_oop_since_save_marks_iterate_done(int thread_num) {} | |
| 341 | |
| 342 // This generation will collect all younger generations | |
| 343 // during a full collection. | |
| 344 virtual bool full_collects_younger_generations() const { return false; } | |
| 345 | |
| 346 // This generation does in-place marking, meaning that mark words | |
| 347 // are mutated during the marking phase and presumably reinitialized | |
| 348 // to a canonical value after the GC. This is currently used by the | |
| 349 // biased locking implementation to determine whether additional | |
| 350 // work is required during the GC prologue and epilogue. | |
| 351 virtual bool performs_in_place_marking() const { return true; } | |
| 352 | |
| 353 // Returns "true" iff collect() should subsequently be called on this | |
| 354 // this generation. See comment below. | |
| 355 // This is a generic implementation which can be overridden. | |
| 356 // | |
| 357 // Note: in the current (1.4) implementation, when genCollectedHeap's | |
| 358 // incremental_collection_will_fail flag is set, all allocations are | |
| 359 // slow path (the only fast-path place to allocate is DefNew, which | |
| 360 // will be full if the flag is set). | |
| 361 // Thus, older generations which collect younger generations should | |
| 362 // test this flag and collect if it is set. | |
| 363 virtual bool should_collect(bool full, | |
| 364 size_t word_size, | |
| 365 bool is_tlab) { | |
| 366 return (full || should_allocate(word_size, is_tlab)); | |
| 367 } | |
| 368 | |
|
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1681
diff
changeset
|
369 // Returns true if the collection is likely to be safely |
|
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1681
diff
changeset
|
370 // completed. Even if this method returns true, a collection |
|
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1681
diff
changeset
|
371 // may not be guaranteed to succeed, and the system should be |
|
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1681
diff
changeset
|
372 // able to safely unwind and recover from that failure, albeit |
|
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1681
diff
changeset
|
373 // at some additional cost. |
|
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1681
diff
changeset
|
374 virtual bool collection_attempt_is_safe() { |
|
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1681
diff
changeset
|
375 guarantee(false, "Are you sure you want to call this method?"); |
|
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1681
diff
changeset
|
376 return true; |
|
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1681
diff
changeset
|
377 } |
|
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1681
diff
changeset
|
378 |
| 0 | 379 // Perform a garbage collection. |
| 380 // If full is true attempt a full garbage collection of this generation. | |
| 381 // Otherwise, attempting to (at least) free enough space to support an | |
| 382 // allocation of the given "word_size". | |
| 383 virtual void collect(bool full, | |
| 384 bool clear_all_soft_refs, | |
| 385 size_t word_size, | |
| 386 bool is_tlab) = 0; | |
| 387 | |
| 388 // Perform a heap collection, attempting to create (at least) enough | |
| 389 // space to support an allocation of the given "word_size". If | |
| 390 // successful, perform the allocation and return the resulting | |
| 391 // "oop" (initializing the allocated block). If the allocation is | |
| 392 // still unsuccessful, return "NULL". | |
| 393 virtual HeapWord* expand_and_allocate(size_t word_size, | |
| 394 bool is_tlab, | |
| 395 bool parallel = false) = 0; | |
| 396 | |
| 397 // Some generations may require some cleanup or preparation actions before | |
| 398 // allowing a collection. The default is to do nothing. | |
| 399 virtual void gc_prologue(bool full) {}; | |
| 400 | |
| 401 // Some generations may require some cleanup actions after a collection. | |
| 402 // The default is to do nothing. | |
| 403 virtual void gc_epilogue(bool full) {}; | |
| 404 | |
|
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
405 // Save the high water marks for the used space in a generation. |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
406 virtual void record_spaces_top() {}; |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
407 |
| 0 | 408 // Some generations may need to be "fixed-up" after some allocation |
| 409 // activity to make them parsable again. The default is to do nothing. | |
| 410 virtual void ensure_parsability() {}; | |
| 411 | |
| 412 // Time (in ms) when we were last collected or now if a collection is | |
| 413 // in progress. | |
| 414 virtual jlong time_of_last_gc(jlong now) { | |
|
4712
e7dead7e90af
7117303: VM uses non-monotonic time source and complains that it is non-monotonic
johnc
parents:
4708
diff
changeset
|
415 // Both _time_of_last_gc and now are set using a time source |
|
e7dead7e90af
7117303: VM uses non-monotonic time source and complains that it is non-monotonic
johnc
parents:
4708
diff
changeset
|
416 // that guarantees monotonically non-decreasing values provided |
|
e7dead7e90af
7117303: VM uses non-monotonic time source and complains that it is non-monotonic
johnc
parents:
4708
diff
changeset
|
417 // the underlying platform provides such a source. So we still |
|
e7dead7e90af
7117303: VM uses non-monotonic time source and complains that it is non-monotonic
johnc
parents:
4708
diff
changeset
|
418 // have to guard against non-monotonicity. |
| 0 | 419 NOT_PRODUCT( |
| 420 if (now < _time_of_last_gc) { | |
|
4712
e7dead7e90af
7117303: VM uses non-monotonic time source and complains that it is non-monotonic
johnc
parents:
4708
diff
changeset
|
421 warning("time warp: "INT64_FORMAT" to "INT64_FORMAT, _time_of_last_gc, now); |
| 0 | 422 } |
| 423 ) | |
| 424 return _time_of_last_gc; | |
| 425 } | |
| 426 | |
| 427 virtual void update_time_of_last_gc(jlong now) { | |
| 428 _time_of_last_gc = now; | |
| 429 } | |
| 430 | |
| 431 // Generations may keep statistics about collection. This | |
| 432 // method updates those statistics. current_level is | |
| 433 // the level of the collection that has most recently | |
| 434 // occurred. This allows the generation to decide what | |
| 435 // statistics are valid to collect. For example, the | |
| 436 // generation can decide to gather the amount of promoted data | |
| 437 // if the collection of the younger generations has completed. | |
| 438 GCStats* gc_stats() const { return _gc_stats; } | |
| 439 virtual void update_gc_stats(int current_level, bool full) {} | |
| 440 | |
| 441 // Mark sweep support phase2 | |
| 442 virtual void prepare_for_compaction(CompactPoint* cp); | |
| 443 // Mark sweep support phase3 | |
| 444 virtual void adjust_pointers(); | |
| 445 // Mark sweep support phase4 | |
| 446 virtual void compact(); | |
| 447 virtual void post_compact() {ShouldNotReachHere();} | |
| 448 | |
| 449 // Support for CMS's rescan. In this general form we return a pointer | |
| 450 // to an abstract object that can be used, based on specific previously | |
| 451 // decided protocols, to exchange information between generations, | |
| 452 // information that may be useful for speeding up certain types of | |
| 453 // garbage collectors. A NULL value indicates to the client that | |
| 454 // no data recording is expected by the provider. The data-recorder is | |
| 455 // expected to be GC worker thread-local, with the worker index | |
| 456 // indicated by "thr_num". | |
| 457 virtual void* get_data_recorder(int thr_num) { return NULL; } | |
| 458 | |
| 459 // Some generations may require some cleanup actions before allowing | |
| 460 // a verification. | |
| 461 virtual void prepare_for_verify() {}; | |
| 462 | |
| 463 // Accessing "marks". | |
| 464 | |
| 465 // This function gives a generation a chance to note a point between | |
| 466 // collections. For example, a contiguous generation might note the | |
| 467 // beginning allocation point post-collection, which might allow some later | |
| 468 // operations to be optimized. | |
| 469 virtual void save_marks() {} | |
| 470 | |
| 471 // This function allows generations to initialize any "saved marks". That | |
| 472 // is, should only be called when the generation is empty. | |
| 473 virtual void reset_saved_marks() {} | |
| 474 | |
| 475 // This function is "true" iff any no allocations have occurred in the | |
| 476 // generation since the last call to "save_marks". | |
| 477 virtual bool no_allocs_since_save_marks() = 0; | |
| 478 | |
| 479 // Apply "cl->apply" to (the addresses of) all reference fields in objects | |
| 480 // allocated in the current generation since the last call to "save_marks". | |
| 481 // If more objects are allocated in this generation as a result of applying | |
| 482 // the closure, iterates over reference fields in those objects as well. | |
| 483 // Calls "save_marks" at the end of the iteration. | |
| 484 // General signature... | |
| 485 virtual void oop_since_save_marks_iterate_v(OopsInGenClosure* cl) = 0; | |
| 486 // ...and specializations for de-virtualization. (The general | |
| 487 // implemention of the _nv versions call the virtual version. | |
| 488 // Note that the _nv suffix is not really semantically necessary, | |
| 489 // but it avoids some not-so-useful warnings on Solaris.) | |
| 490 #define Generation_SINCE_SAVE_MARKS_DECL(OopClosureType, nv_suffix) \ | |
| 491 virtual void oop_since_save_marks_iterate##nv_suffix(OopClosureType* cl) { \ | |
| 492 oop_since_save_marks_iterate_v((OopsInGenClosure*)cl); \ | |
| 493 } | |
| 494 SPECIALIZED_SINCE_SAVE_MARKS_CLOSURES(Generation_SINCE_SAVE_MARKS_DECL) | |
| 495 | |
| 496 #undef Generation_SINCE_SAVE_MARKS_DECL | |
| 497 | |
| 498 // The "requestor" generation is performing some garbage collection | |
| 499 // action for which it would be useful to have scratch space. If | |
| 500 // the target is not the requestor, no gc actions will be required | |
| 501 // of the target. The requestor promises to allocate no more than | |
| 502 // "max_alloc_words" in the target generation (via promotion say, | |
| 503 // if the requestor is a young generation and the target is older). | |
| 504 // If the target generation can provide any scratch space, it adds | |
| 505 // it to "list", leaving "list" pointing to the head of the | |
| 506 // augmented list. The default is to offer no space. | |
| 507 virtual void contribute_scratch(ScratchBlock*& list, Generation* requestor, | |
| 508 size_t max_alloc_words) {} | |
| 509 | |
|
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
510 // Give each generation an opportunity to do clean up for any |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
511 // contributed scratch. |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
512 virtual void reset_scratch() {}; |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
513 |
| 0 | 514 // When an older generation has been collected, and perhaps resized, |
| 515 // this method will be invoked on all younger generations (from older to | |
| 516 // younger), allowing them to resize themselves as appropriate. | |
| 517 virtual void compute_new_size() = 0; | |
| 518 | |
| 519 // Printing | |
| 520 virtual const char* name() const = 0; | |
| 521 virtual const char* short_name() const = 0; | |
| 522 | |
| 523 int level() const { return _level; } | |
| 524 | |
| 525 // Attributes | |
| 526 | |
| 527 // True iff the given generation may only be the youngest generation. | |
| 528 virtual bool must_be_youngest() const = 0; | |
| 529 // True iff the given generation may only be the oldest generation. | |
| 530 virtual bool must_be_oldest() const = 0; | |
| 531 | |
| 532 // Reference Processing accessor | |
| 533 ReferenceProcessor* const ref_processor() { return _ref_processor; } | |
| 534 | |
| 535 // Iteration. | |
| 536 | |
| 537 // Iterate over all the ref-containing fields of all objects in the | |
| 538 // generation, calling "cl.do_oop" on each. | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
539 virtual void oop_iterate(ExtendedOopClosure* cl); |
| 0 | 540 |
| 541 // Same as above, restricted to the intersection of a memory region and | |
| 542 // the generation. | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
543 virtual void oop_iterate(MemRegion mr, ExtendedOopClosure* cl); |
| 0 | 544 |
| 545 // Iterate over all objects in the generation, calling "cl.do_object" on | |
| 546 // each. | |
| 547 virtual void object_iterate(ObjectClosure* cl); | |
| 548 | |
|
517
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
271
diff
changeset
|
549 // Iterate over all safe objects in the generation, calling "cl.do_object" on |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
271
diff
changeset
|
550 // each. An object is safe if its references point to other objects in |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
271
diff
changeset
|
551 // the heap. This defaults to object_iterate() unless overridden. |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
271
diff
changeset
|
552 virtual void safe_object_iterate(ObjectClosure* cl); |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
271
diff
changeset
|
553 |
| 0 | 554 // Apply "cl->do_oop" to (the address of) all and only all the ref fields |
| 555 // in the current generation that contain pointers to objects in younger | |
| 556 // generations. Objects allocated since the last "save_marks" call are | |
| 557 // excluded. | |
| 558 virtual void younger_refs_iterate(OopsInGenClosure* cl) = 0; | |
| 559 | |
| 560 // Inform a generation that it longer contains references to objects | |
| 561 // in any younger generation. [e.g. Because younger gens are empty, | |
| 562 // clear the card table.] | |
| 563 virtual void clear_remembered_set() { } | |
| 564 | |
| 565 // Inform a generation that some of its objects have moved. [e.g. The | |
| 566 // generation's spaces were compacted, invalidating the card table.] | |
| 567 virtual void invalidate_remembered_set() { } | |
| 568 | |
| 569 // Block abstraction. | |
| 570 | |
| 571 // Returns the address of the start of the "block" that contains the | |
| 572 // address "addr". We say "blocks" instead of "object" since some heaps | |
| 573 // may not pack objects densely; a chunk may either be an object or a | |
| 574 // non-object. | |
| 575 virtual HeapWord* block_start(const void* addr) const; | |
| 576 | |
| 577 // Requires "addr" to be the start of a chunk, and returns its size. | |
| 578 // "addr + size" is required to be the start of a new chunk, or the end | |
| 579 // of the active area of the heap. | |
| 580 virtual size_t block_size(const HeapWord* addr) const ; | |
| 581 | |
| 582 // Requires "addr" to be the start of a block, and returns "TRUE" iff | |
| 583 // the block is an object. | |
| 584 virtual bool block_is_obj(const HeapWord* addr) const; | |
| 585 | |
| 586 | |
| 587 // PrintGC, PrintGCDetails support | |
| 588 void print_heap_change(size_t prev_used) const; | |
| 589 | |
| 590 // PrintHeapAtGC support | |
| 591 virtual void print() const; | |
| 592 virtual void print_on(outputStream* st) const; | |
| 593 | |
| 6008 | 594 virtual void verify() = 0; |
| 0 | 595 |
| 596 struct StatRecord { | |
| 597 int invocations; | |
| 598 elapsedTimer accumulated_time; | |
| 599 StatRecord() : | |
| 600 invocations(0), | |
| 601 accumulated_time(elapsedTimer()) {} | |
| 602 }; | |
| 603 private: | |
| 604 StatRecord _stat_record; | |
| 605 public: | |
| 606 StatRecord* stat_record() { return &_stat_record; } | |
| 607 | |
| 608 virtual void print_summary_info(); | |
| 609 virtual void print_summary_info_on(outputStream* st); | |
| 610 | |
| 611 // Performance Counter support | |
| 612 virtual void update_counters() = 0; | |
| 613 virtual CollectorCounters* counters() { return _gc_counters; } | |
| 614 }; | |
| 615 | |
| 616 // Class CardGeneration is a generation that is covered by a card table, | |
| 617 // and uses a card-size block-offset array to implement block_start. | |
| 618 | |
| 619 // class BlockOffsetArray; | |
| 620 // class BlockOffsetArrayContigSpace; | |
| 621 class BlockOffsetSharedArray; | |
| 622 | |
| 623 class CardGeneration: public Generation { | |
| 624 friend class VMStructs; | |
| 625 protected: | |
| 626 // This is shared with other generations. | |
| 627 GenRemSet* _rs; | |
| 628 // This is local to this generation. | |
| 629 BlockOffsetSharedArray* _bts; | |
| 630 | |
|
9072
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
6725
diff
changeset
|
631 // current shrinking effect: this damps shrinking when the heap gets empty. |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
6725
diff
changeset
|
632 size_t _shrink_factor; |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
6725
diff
changeset
|
633 |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
6725
diff
changeset
|
634 size_t _min_heap_delta_bytes; // Minimum amount to expand. |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
6725
diff
changeset
|
635 |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
6725
diff
changeset
|
636 // Some statistics from before gc started. |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
6725
diff
changeset
|
637 // These are gathered in the gc_prologue (and should_collect) |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
6725
diff
changeset
|
638 // to control growing/shrinking policy in spite of promotions. |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
6725
diff
changeset
|
639 size_t _capacity_at_prologue; |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
6725
diff
changeset
|
640 size_t _used_at_prologue; |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
6725
diff
changeset
|
641 |
| 0 | 642 CardGeneration(ReservedSpace rs, size_t initial_byte_size, int level, |
| 643 GenRemSet* remset); | |
| 644 | |
| 645 public: | |
| 646 | |
|
271
818a18cd69a8
6730514: assertion failure in mangling code when expanding by 0 bytes
jmasa
parents:
269
diff
changeset
|
647 // Attempt to expand the generation by "bytes". Expand by at a |
|
818a18cd69a8
6730514: assertion failure in mangling code when expanding by 0 bytes
jmasa
parents:
269
diff
changeset
|
648 // minimum "expand_bytes". Return true if some amount (not |
|
818a18cd69a8
6730514: assertion failure in mangling code when expanding by 0 bytes
jmasa
parents:
269
diff
changeset
|
649 // necessarily the full "bytes") was done. |
|
818a18cd69a8
6730514: assertion failure in mangling code when expanding by 0 bytes
jmasa
parents:
269
diff
changeset
|
650 virtual bool expand(size_t bytes, size_t expand_bytes); |
|
818a18cd69a8
6730514: assertion failure in mangling code when expanding by 0 bytes
jmasa
parents:
269
diff
changeset
|
651 |
|
9072
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
6725
diff
changeset
|
652 // Shrink generation with specified size (returns false if unable to shrink) |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
6725
diff
changeset
|
653 virtual void shrink(size_t bytes) = 0; |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
6725
diff
changeset
|
654 |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
6725
diff
changeset
|
655 virtual void compute_new_size(); |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
6725
diff
changeset
|
656 |
| 0 | 657 virtual void clear_remembered_set(); |
| 658 | |
| 659 virtual void invalidate_remembered_set(); | |
| 660 | |
| 661 virtual void prepare_for_verify(); | |
|
271
818a18cd69a8
6730514: assertion failure in mangling code when expanding by 0 bytes
jmasa
parents:
269
diff
changeset
|
662 |
|
818a18cd69a8
6730514: assertion failure in mangling code when expanding by 0 bytes
jmasa
parents:
269
diff
changeset
|
663 // Grow generation with specified size (returns false if unable to grow) |
|
818a18cd69a8
6730514: assertion failure in mangling code when expanding by 0 bytes
jmasa
parents:
269
diff
changeset
|
664 virtual bool grow_by(size_t bytes) = 0; |
|
818a18cd69a8
6730514: assertion failure in mangling code when expanding by 0 bytes
jmasa
parents:
269
diff
changeset
|
665 // Grow generation to reserved size. |
|
818a18cd69a8
6730514: assertion failure in mangling code when expanding by 0 bytes
jmasa
parents:
269
diff
changeset
|
666 virtual bool grow_to_reserved() = 0; |
| 0 | 667 }; |
| 668 | |
| 669 // OneContigSpaceCardGeneration models a heap of old objects contained in a single | |
| 670 // contiguous space. | |
| 671 // | |
| 672 // Garbage collection is performed using mark-compact. | |
| 673 | |
| 674 class OneContigSpaceCardGeneration: public CardGeneration { | |
| 675 friend class VMStructs; | |
| 676 // Abstractly, this is a subtype that gets access to protected fields. | |
| 677 friend class VM_PopulateDumpSharedSpace; | |
| 678 | |
| 679 protected: | |
| 680 ContiguousSpace* _the_space; // actual space holding objects | |
| 681 WaterMark _last_gc; // watermark between objects allocated before | |
| 682 // and after last GC. | |
| 683 | |
| 684 // Grow generation with specified size (returns false if unable to grow) | |
|
271
818a18cd69a8
6730514: assertion failure in mangling code when expanding by 0 bytes
jmasa
parents:
269
diff
changeset
|
685 virtual bool grow_by(size_t bytes); |
| 0 | 686 // Grow generation to reserved size. |
|
271
818a18cd69a8
6730514: assertion failure in mangling code when expanding by 0 bytes
jmasa
parents:
269
diff
changeset
|
687 virtual bool grow_to_reserved(); |
| 0 | 688 // Shrink generation with specified size (returns false if unable to shrink) |
| 689 void shrink_by(size_t bytes); | |
| 690 | |
| 691 // Allocation failure | |
|
271
818a18cd69a8
6730514: assertion failure in mangling code when expanding by 0 bytes
jmasa
parents:
269
diff
changeset
|
692 virtual bool expand(size_t bytes, size_t expand_bytes); |
| 0 | 693 void shrink(size_t bytes); |
| 694 | |
| 695 // Accessing spaces | |
| 696 ContiguousSpace* the_space() const { return _the_space; } | |
| 697 | |
| 698 public: | |
| 699 OneContigSpaceCardGeneration(ReservedSpace rs, size_t initial_byte_size, | |
| 700 int level, GenRemSet* remset, | |
| 701 ContiguousSpace* space) : | |
| 702 CardGeneration(rs, initial_byte_size, level, remset), | |
|
9072
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
6725
diff
changeset
|
703 _the_space(space) |
| 0 | 704 {} |
| 705 | |
| 706 inline bool is_in(const void* p) const; | |
| 707 | |
| 708 // Space enquiries | |
| 709 size_t capacity() const; | |
| 710 size_t used() const; | |
| 711 size_t free() const; | |
| 712 | |
| 713 MemRegion used_region() const; | |
| 714 | |
| 715 size_t unsafe_max_alloc_nogc() const; | |
| 716 size_t contiguous_available() const; | |
| 717 | |
| 718 // Iteration | |
| 719 void object_iterate(ObjectClosure* blk); | |
| 720 void space_iterate(SpaceClosure* blk, bool usedOnly = false); | |
| 721 | |
| 722 void younger_refs_iterate(OopsInGenClosure* blk); | |
| 723 | |
| 724 inline CompactibleSpace* first_compaction_space() const; | |
| 725 | |
| 726 virtual inline HeapWord* allocate(size_t word_size, bool is_tlab); | |
| 727 virtual inline HeapWord* par_allocate(size_t word_size, bool is_tlab); | |
| 728 | |
| 729 // Accessing marks | |
| 730 inline WaterMark top_mark(); | |
| 731 inline WaterMark bottom_mark(); | |
| 732 | |
| 733 #define OneContig_SINCE_SAVE_MARKS_DECL(OopClosureType, nv_suffix) \ | |
| 734 void oop_since_save_marks_iterate##nv_suffix(OopClosureType* cl); | |
| 735 OneContig_SINCE_SAVE_MARKS_DECL(OopsInGenClosure,_v) | |
| 736 SPECIALIZED_SINCE_SAVE_MARKS_CLOSURES(OneContig_SINCE_SAVE_MARKS_DECL) | |
| 737 | |
| 738 void save_marks(); | |
| 739 void reset_saved_marks(); | |
| 740 bool no_allocs_since_save_marks(); | |
| 741 | |
| 742 inline size_t block_size(const HeapWord* addr) const; | |
| 743 | |
| 744 inline bool block_is_obj(const HeapWord* addr) const; | |
| 745 | |
| 746 virtual void collect(bool full, | |
| 747 bool clear_all_soft_refs, | |
| 748 size_t size, | |
| 749 bool is_tlab); | |
| 750 HeapWord* expand_and_allocate(size_t size, | |
| 751 bool is_tlab, | |
| 752 bool parallel = false); | |
| 753 | |
| 754 virtual void prepare_for_verify(); | |
| 755 | |
| 756 virtual void gc_epilogue(bool full); | |
| 757 | |
|
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
758 virtual void record_spaces_top(); |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
759 |
| 6008 | 760 virtual void verify(); |
| 0 | 761 virtual void print_on(outputStream* st) const; |
| 762 }; | |
| 1972 | 763 |
| 764 #endif // SHARE_VM_MEMORY_GENERATION_HPP |