< prev index next >

src/hotspot/share/gc/parallel/psCompactionManager.hpp

Print this page




  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_GC_PARALLEL_PSCOMPACTIONMANAGER_HPP
  26 #define SHARE_GC_PARALLEL_PSCOMPACTIONMANAGER_HPP
  27 
  28 #include "gc/shared/taskqueue.hpp"
  29 #include "memory/allocation.hpp"
  30 #include "utilities/stack.hpp"

  31 
  32 class MutableSpace;
  33 class PSOldGen;
  34 class ParCompactionManager;
  35 class ObjectStartArray;
  36 class ParallelCompactData;
  37 class ParMarkBitMap;
  38 
  39 class ParCompactionManager : public CHeapObj<mtGC> {
  40   friend class ParallelTaskTerminator;
  41   friend class ParMarkBitMap;
  42   friend class PSParallelCompact;
  43   friend class CompactionWithStealingTask;
  44   friend class UpdateAndFillClosure;
  45   friend class RefProcTaskExecutor;
  46   friend class PCRefProcTask;
  47   friend class MarkFromRootsTask;
  48   friend class UpdateDensePrefixAndCompactionTask;
  49 
  50  public:


  60   };
  61 // ------------------------  End don't putback if not needed
  62 
  63  private:
  64   // 32-bit:  4K * 8 = 32KiB; 64-bit:  8K * 16 = 128KiB
  65   #define QUEUE_SIZE (1 << NOT_LP64(12) LP64_ONLY(13))
  66   typedef OverflowTaskQueue<ObjArrayTask, mtGC, QUEUE_SIZE> ObjArrayTaskQueue;
  67   typedef GenericTaskQueueSet<ObjArrayTaskQueue, mtGC>      ObjArrayTaskQueueSet;
  68   #undef QUEUE_SIZE
  69 
  70   static ParCompactionManager** _manager_array;
  71   static OopTaskQueueSet*       _stack_array;
  72   static ObjArrayTaskQueueSet*  _objarray_queues;
  73   static ObjectStartArray*      _start_array;
  74   static RegionTaskQueueSet*    _region_array;
  75   static PSOldGen*              _old_gen;
  76 
  77 private:
  78   OverflowTaskQueue<oop, mtGC>        _marking_stack;
  79   ObjArrayTaskQueue             _objarray_stack;

  80 
  81   // Is there a way to reuse the _marking_stack for the
  82   // saving empty regions?  For now just create a different
  83   // type of TaskQueue.
  84   RegionTaskQueue              _region_stack;
  85 
  86   static ParMarkBitMap* _mark_bitmap;
  87 








  88   Action _action;
  89 
  90   HeapWord* _last_query_beg;
  91   oop _last_query_obj;
  92   size_t _last_query_ret;
  93 
  94   static PSOldGen* old_gen()             { return _old_gen; }
  95   static ObjectStartArray* start_array() { return _start_array; }
  96   static OopTaskQueueSet* stack_array()  { return _stack_array; }
  97 
  98   static void initialize(ParMarkBitMap* mbm);
  99 
 100  protected:
 101   // Array of tasks.  Needed by the ParallelTaskTerminator.
 102   static RegionTaskQueueSet* region_array()      { return _region_array; }
 103   OverflowTaskQueue<oop, mtGC>*  marking_stack()       { return &_marking_stack; }
 104 
 105   // Pushes onto the marking stack.  If the marking stack is full,
 106   // pushes onto the overflow stack.
 107   void stack_push(oop obj);
 108   // Do not implement an equivalent stack_pop.  Deal with the
 109   // marking stack and overflow stack directly.
 110 
 111  public:








 112   void reset_bitmap_query_cache() {
 113     _last_query_beg = NULL;
 114     _last_query_obj = NULL;
 115     _last_query_ret = 0;
 116   }
 117 
 118   Action action() { return _action; }
 119   void set_action(Action v) { _action = v; }
 120 
 121   // Bitmap query support, cache last query and result
 122   HeapWord* last_query_begin() { return _last_query_beg; }
 123   oop last_query_object() { return _last_query_obj; }
 124   size_t last_query_return() { return _last_query_ret; }
 125 
 126   void set_last_query_begin(HeapWord *new_beg) { _last_query_beg = new_beg; }
 127   void set_last_query_object(oop new_obj) { _last_query_obj = new_obj; }
 128   void set_last_query_return(size_t new_ret) { _last_query_ret = new_ret; }
 129 
 130   static void reset_all_bitmap_query_caches();
 131 




  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_GC_PARALLEL_PSCOMPACTIONMANAGER_HPP
  26 #define SHARE_GC_PARALLEL_PSCOMPACTIONMANAGER_HPP
  27 
  28 #include "gc/shared/taskqueue.hpp"
  29 #include "memory/allocation.hpp"
  30 #include "utilities/stack.hpp"
  31 #include "psParallelCompact.hpp"
  32 
  33 class MutableSpace;
  34 class PSOldGen;
  35 class ParCompactionManager;
  36 class ObjectStartArray;
  37 class ParallelCompactData;
  38 class ParMarkBitMap;
  39 
  40 class ParCompactionManager : public CHeapObj<mtGC> {
  41   friend class ParallelTaskTerminator;
  42   friend class ParMarkBitMap;
  43   friend class PSParallelCompact;
  44   friend class CompactionWithStealingTask;
  45   friend class UpdateAndFillClosure;
  46   friend class RefProcTaskExecutor;
  47   friend class PCRefProcTask;
  48   friend class MarkFromRootsTask;
  49   friend class UpdateDensePrefixAndCompactionTask;
  50 
  51  public:


  61   };
  62 // ------------------------  End don't putback if not needed
  63 
  64  private:
  65   // 32-bit:  4K * 8 = 32KiB; 64-bit:  8K * 16 = 128KiB
  66   #define QUEUE_SIZE (1 << NOT_LP64(12) LP64_ONLY(13))
  67   typedef OverflowTaskQueue<ObjArrayTask, mtGC, QUEUE_SIZE> ObjArrayTaskQueue;
  68   typedef GenericTaskQueueSet<ObjArrayTaskQueue, mtGC>      ObjArrayTaskQueueSet;
  69   #undef QUEUE_SIZE
  70 
  71   static ParCompactionManager** _manager_array;
  72   static OopTaskQueueSet*       _stack_array;
  73   static ObjArrayTaskQueueSet*  _objarray_queues;
  74   static ObjectStartArray*      _start_array;
  75   static RegionTaskQueueSet*    _region_array;
  76   static PSOldGen*              _old_gen;
  77 
  78 private:
  79   OverflowTaskQueue<oop, mtGC>        _marking_stack;
  80   ObjArrayTaskQueue             _objarray_stack;
  81   size_t                        _shadow_record;
  82 
  83   // Is there a way to reuse the _marking_stack for the
  84   // saving empty regions?  For now just create a different
  85   // type of TaskQueue.
  86   RegionTaskQueue              _region_stack;
  87 
  88   static ParMarkBitMap* _mark_bitmap;
  89 
  90   // The shadow region array, we use it in a LIFO fashion, so
  91   // that we can reuse shadow regions for better data locality
  92   // and utilization
  93   static GrowableArray<size_t>* _shadow_region_array;
  94 
  95   // This Monitor provides mutual exclusive access of _shadow_region_array
  96   static Monitor*               _shadow_region_monitor;
  97 
  98   Action _action;
  99 
 100   HeapWord* _last_query_beg;
 101   oop _last_query_obj;
 102   size_t _last_query_ret;
 103 
 104   static PSOldGen* old_gen()             { return _old_gen; }
 105   static ObjectStartArray* start_array() { return _start_array; }
 106   static OopTaskQueueSet* stack_array()  { return _stack_array; }
 107 
 108   static void initialize(ParMarkBitMap* mbm);
 109 
 110  protected:
 111   // Array of tasks.  Needed by the ParallelTaskTerminator.
 112   static RegionTaskQueueSet* region_array()      { return _region_array; }
 113   OverflowTaskQueue<oop, mtGC>*  marking_stack()       { return &_marking_stack; }
 114 
 115   // Pushes onto the marking stack.  If the marking stack is full,
 116   // pushes onto the overflow stack.
 117   void stack_push(oop obj);
 118   // Do not implement an equivalent stack_pop.  Deal with the
 119   // marking stack and overflow stack directly.
 120 
 121  public:
 122   static size_t  acquire_shadow_region(PSParallelCompact::RegionData* region_ptr);
 123   static void    release_shadow_region(size_t shadow_region);
 124   static void    enqueue_shadow_region(size_t shadow_region);
 125   static void    dequeue_shadow_region();
 126   inline size_t  shadow_record() { return _shadow_record; }
 127   inline void    set_shadow_record(size_t record) { _shadow_record = record; }
 128   inline size_t  next_shadow_record(size_t workers) { _shadow_record += workers; return shadow_record(); }
 129 
 130   void reset_bitmap_query_cache() {
 131     _last_query_beg = NULL;
 132     _last_query_obj = NULL;
 133     _last_query_ret = 0;
 134   }
 135 
 136   Action action() { return _action; }
 137   void set_action(Action v) { _action = v; }
 138 
 139   // Bitmap query support, cache last query and result
 140   HeapWord* last_query_begin() { return _last_query_beg; }
 141   oop last_query_object() { return _last_query_obj; }
 142   size_t last_query_return() { return _last_query_ret; }
 143 
 144   void set_last_query_begin(HeapWord *new_beg) { _last_query_beg = new_beg; }
 145   void set_last_query_object(oop new_obj) { _last_query_obj = new_obj; }
 146   void set_last_query_return(size_t new_ret) { _last_query_ret = new_ret; }
 147 
 148   static void reset_all_bitmap_query_caches();
 149 


< prev index next >