< prev index next >

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

Print this page




  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_GC_PARALLEL_PSCOMPACTIONMANAGER_INLINE_HPP
  26 #define SHARE_VM_GC_PARALLEL_PSCOMPACTIONMANAGER_INLINE_HPP
  27 
  28 #include "gc/parallel/parMarkBitMap.hpp"
  29 #include "gc/parallel/psCompactionManager.hpp"
  30 #include "gc/parallel/psParallelCompact.inline.hpp"
  31 #include "gc/shared/taskqueue.inline.hpp"

  32 #include "oops/arrayOop.inline.hpp"

  33 #include "oops/objArrayOop.inline.hpp"
  34 #include "oops/oop.inline.hpp"
  35 #include "utilities/debug.hpp"
  36 #include "utilities/globalDefinitions.hpp"
  37 
  38 inline bool ParCompactionManager::steal(int queue_num, int* seed, oop& t) {
  39   return stack_array()->steal(queue_num, seed, t);
  40 }
  41 
  42 inline bool ParCompactionManager::steal_objarray(int queue_num, int* seed, ObjArrayTask& t) {
  43   return _objarray_queues->steal(queue_num, seed, t);
  44 }
  45 
  46 inline bool ParCompactionManager::steal(int queue_num, int* seed, size_t& region) {
  47   return region_array()->steal(queue_num, seed, region);
  48 }
  49 
  50 inline void ParCompactionManager::push(oop obj) {
  51   _marking_stack.push(obj);
  52 }


  54 void ParCompactionManager::push_objarray(oop obj, size_t index)
  55 {
  56   ObjArrayTask task(obj, index);
  57   assert(task.is_valid(), "bad ObjArrayTask");
  58   _objarray_stack.push(task);
  59 }
  60 
  61 void ParCompactionManager::push_region(size_t index)
  62 {
  63 #ifdef ASSERT
  64   const ParallelCompactData& sd = PSParallelCompact::summary_data();
  65   ParallelCompactData::RegionData* const region_ptr = sd.region(index);
  66   assert(region_ptr->claimed(), "must be claimed");
  67   assert(region_ptr->_pushed++ == 0, "should only be pushed once");
  68 #endif
  69   region_stack()->push(index);
  70 }
  71 
  72 template <typename T>
  73 inline void ParCompactionManager::mark_and_push(T* p) {
  74   T heap_oop = oopDesc::load_heap_oop(p);
  75   if (!oopDesc::is_null(heap_oop)) {
  76     oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
  77     assert(ParallelScavengeHeap::heap()->is_in(obj), "should be in heap");
  78 
  79     if (mark_bitmap()->is_unmarked(obj) && PSParallelCompact::mark_obj(obj)) {
  80       push(obj);
  81     }
  82   }
  83 }
  84 
  85 template <typename T>
  86 inline void ParCompactionManager::MarkAndPushClosure::do_oop_nv(T* p) {
  87   _compaction_manager->mark_and_push(p);
  88 }
  89 
  90 inline void ParCompactionManager::MarkAndPushClosure::do_oop(oop* p)       { do_oop_nv(p); }
  91 inline void ParCompactionManager::MarkAndPushClosure::do_oop(narrowOop* p) { do_oop_nv(p); }
  92 
  93 inline void ParCompactionManager::follow_klass(Klass* klass) {
  94   oop holder = klass->klass_holder();
  95   mark_and_push(&holder);
  96 }




  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_GC_PARALLEL_PSCOMPACTIONMANAGER_INLINE_HPP
  26 #define SHARE_VM_GC_PARALLEL_PSCOMPACTIONMANAGER_INLINE_HPP
  27 
  28 #include "gc/parallel/parMarkBitMap.hpp"
  29 #include "gc/parallel/psCompactionManager.hpp"
  30 #include "gc/parallel/psParallelCompact.inline.hpp"
  31 #include "gc/shared/taskqueue.inline.hpp"
  32 #include "oops/access.inline.hpp"
  33 #include "oops/arrayOop.inline.hpp"
  34 #include "oops/compressedOops.inline.hpp"
  35 #include "oops/objArrayOop.inline.hpp"
  36 #include "oops/oop.inline.hpp"
  37 #include "utilities/debug.hpp"
  38 #include "utilities/globalDefinitions.hpp"
  39 
  40 inline bool ParCompactionManager::steal(int queue_num, int* seed, oop& t) {
  41   return stack_array()->steal(queue_num, seed, t);
  42 }
  43 
  44 inline bool ParCompactionManager::steal_objarray(int queue_num, int* seed, ObjArrayTask& t) {
  45   return _objarray_queues->steal(queue_num, seed, t);
  46 }
  47 
  48 inline bool ParCompactionManager::steal(int queue_num, int* seed, size_t& region) {
  49   return region_array()->steal(queue_num, seed, region);
  50 }
  51 
  52 inline void ParCompactionManager::push(oop obj) {
  53   _marking_stack.push(obj);
  54 }


  56 void ParCompactionManager::push_objarray(oop obj, size_t index)
  57 {
  58   ObjArrayTask task(obj, index);
  59   assert(task.is_valid(), "bad ObjArrayTask");
  60   _objarray_stack.push(task);
  61 }
  62 
  63 void ParCompactionManager::push_region(size_t index)
  64 {
  65 #ifdef ASSERT
  66   const ParallelCompactData& sd = PSParallelCompact::summary_data();
  67   ParallelCompactData::RegionData* const region_ptr = sd.region(index);
  68   assert(region_ptr->claimed(), "must be claimed");
  69   assert(region_ptr->_pushed++ == 0, "should only be pushed once");
  70 #endif
  71   region_stack()->push(index);
  72 }
  73 
  74 template <typename T>
  75 inline void ParCompactionManager::mark_and_push(T* p) {
  76   T heap_oop = RawAccess<>::oop_load(p);
  77   if (!CompressedOops::is_null(heap_oop)) {
  78     oop obj = CompressedOops::decode_not_null(heap_oop);
  79     assert(ParallelScavengeHeap::heap()->is_in(obj), "should be in heap");
  80 
  81     if (mark_bitmap()->is_unmarked(obj) && PSParallelCompact::mark_obj(obj)) {
  82       push(obj);
  83     }
  84   }
  85 }
  86 
  87 template <typename T>
  88 inline void ParCompactionManager::MarkAndPushClosure::do_oop_nv(T* p) {
  89   _compaction_manager->mark_and_push(p);
  90 }
  91 
  92 inline void ParCompactionManager::MarkAndPushClosure::do_oop(oop* p)       { do_oop_nv(p); }
  93 inline void ParCompactionManager::MarkAndPushClosure::do_oop(narrowOop* p) { do_oop_nv(p); }
  94 
  95 inline void ParCompactionManager::follow_klass(Klass* klass) {
  96   oop holder = klass->klass_holder();
  97   mark_and_push(&holder);
  98 }


< prev index next >