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