58  public:
  59   AdjoiningGenerations(ReservedSpace rs,
  60                        size_t init_low_byte_size,
  61                        size_t min_low_byte_size,
  62                        size_t max_low_byte_size,
  63                        size_t init_high_byte_size,
  64                        size_t min_high_byte_size,
  65                        size_t max_high_bytes_size,
  66                        size_t alignment);
  67 
  68   // Accessors
  69   PSYoungGen* young_gen() { return _young_gen; }
  70   PSOldGen* old_gen() { return _old_gen; }
  71 
  72   AdjoiningVirtualSpaces* virtual_spaces() { return &_virtual_spaces; }
  73 
  74   // Additional space is needed in the old generation.  Check
  75   // the available space and attempt to move the boundary if more space
  76   // is needed.  The growth is not guaranteed to occur.
  77   void adjust_boundary_for_old_gen_needs(size_t desired_change_in_bytes);
  78   // Similary for a growth of the young generation.
  79   void adjust_boundary_for_young_gen_needs(size_t eden_size, size_t survivor_size);
  80 
  81   // Return the total byte size of the reserved space
  82   // for the adjoining generations.
  83   size_t reserved_byte_size();
  84 };
  85 
  86 #endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_ADJOININGGENERATIONS_HPP

  58  public:
  59   AdjoiningGenerations(ReservedSpace rs,
  60                        size_t init_low_byte_size,
  61                        size_t min_low_byte_size,
  62                        size_t max_low_byte_size,
  63                        size_t init_high_byte_size,
  64                        size_t min_high_byte_size,
  65                        size_t max_high_bytes_size,
  66                        size_t alignment);
  67 
  68   // Accessors
  69   PSYoungGen* young_gen() { return _young_gen; }
  70   PSOldGen* old_gen() { return _old_gen; }
  71 
  72   AdjoiningVirtualSpaces* virtual_spaces() { return &_virtual_spaces; }
  73 
  74   // Additional space is needed in the old generation.  Check
  75   // the available space and attempt to move the boundary if more space
  76   // is needed.  The growth is not guaranteed to occur.
  77   void adjust_boundary_for_old_gen_needs(size_t desired_change_in_bytes);
  78   // Similarly for a growth of the young generation.
  79   void adjust_boundary_for_young_gen_needs(size_t eden_size, size_t survivor_size);
  80 
  81   // Return the total byte size of the reserved space
  82   // for the adjoining generations.
  83   size_t reserved_byte_size();
  84 };
  85 
  86 #endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_ADJOININGGENERATIONS_HPP