< prev index next >

src/share/vm/gc/g1/g1ParScanThreadState.hpp

Print this page




  33 #include "gc/g1/g1SATBCardTableModRefBS.hpp"
  34 #include "gc/shared/ageTable.hpp"
  35 #include "memory/allocation.hpp"
  36 #include "oops/oop.hpp"
  37 
  38 class G1PLABAllocator;
  39 class G1EvacuationRootClosures;
  40 class HeapRegion;
  41 class outputStream;
  42 
  43 class G1ParScanThreadState : public CHeapObj<mtGC> {
  44  private:
  45   G1CollectedHeap* _g1h;
  46   RefToScanQueue*  _refs;
  47   DirtyCardQueue   _dcq;
  48   G1SATBCardTableModRefBS* _ct_bs;
  49   G1EvacuationRootClosures* _closures;
  50 
  51   G1PLABAllocator*  _plab_allocator;
  52 
  53   ageTable          _age_table;
  54   InCSetState       _dest[InCSetState::Num];
  55   // Local tenuring threshold.
  56   uint              _tenuring_threshold;
  57   G1ParScanClosure  _scanner;
  58 
  59   int  _hash_seed;
  60   uint _worker_id;
  61 
  62   // Map from young-age-index (0 == not young, 1 is youngest) to
  63   // surviving words. base is what we get back from the malloc call
  64   size_t* _surviving_young_words_base;
  65   // this points into the array, as we use the first few entries for padding
  66   size_t* _surviving_young_words;
  67 
  68   // Indicates whether in the last generation (old) there is no more space
  69   // available for allocation.
  70   bool _old_gen_is_full;
  71 
  72 #define PADDING_ELEM_NUM (DEFAULT_CACHE_LINE_SIZE / sizeof(size_t))
  73 




  33 #include "gc/g1/g1SATBCardTableModRefBS.hpp"
  34 #include "gc/shared/ageTable.hpp"
  35 #include "memory/allocation.hpp"
  36 #include "oops/oop.hpp"
  37 
  38 class G1PLABAllocator;
  39 class G1EvacuationRootClosures;
  40 class HeapRegion;
  41 class outputStream;
  42 
  43 class G1ParScanThreadState : public CHeapObj<mtGC> {
  44  private:
  45   G1CollectedHeap* _g1h;
  46   RefToScanQueue*  _refs;
  47   DirtyCardQueue   _dcq;
  48   G1SATBCardTableModRefBS* _ct_bs;
  49   G1EvacuationRootClosures* _closures;
  50 
  51   G1PLABAllocator*  _plab_allocator;
  52 
  53   AgeTable          _age_table;
  54   InCSetState       _dest[InCSetState::Num];
  55   // Local tenuring threshold.
  56   uint              _tenuring_threshold;
  57   G1ParScanClosure  _scanner;
  58 
  59   int  _hash_seed;
  60   uint _worker_id;
  61 
  62   // Map from young-age-index (0 == not young, 1 is youngest) to
  63   // surviving words. base is what we get back from the malloc call
  64   size_t* _surviving_young_words_base;
  65   // this points into the array, as we use the first few entries for padding
  66   size_t* _surviving_young_words;
  67 
  68   // Indicates whether in the last generation (old) there is no more space
  69   // available for allocation.
  70   bool _old_gen_is_full;
  71 
  72 #define PADDING_ELEM_NUM (DEFAULT_CACHE_LINE_SIZE / sizeof(size_t))
  73 


< prev index next >