< prev index next >

src/share/vm/gc_implementation/parallelScavenge/psCompactionManager.inline.hpp

Print this page




   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_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSCOMPACTIONMANAGER_INLINE_HPP
  26 #define SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSCOMPACTIONMANAGER_INLINE_HPP
  27 
  28 #include "gc_implementation/parallelScavenge/psCompactionManager.hpp"
  29 #include "gc_implementation/parallelScavenge/psParallelCompact.hpp"
  30 #include "oops/objArrayKlass.inline.hpp"
  31 #include "oops/oop.pcgc.inline.hpp"


  32 
  33 void ParCompactionManager::push_objarray(oop obj, size_t index)
  34 {
  35   ObjArrayTask task(obj, index);
  36   assert(task.is_valid(), "bad ObjArrayTask");
  37   _objarray_stack.push(task);
  38 }
  39 
  40 void ParCompactionManager::push_region(size_t index)
  41 {
  42 #ifdef ASSERT
  43   const ParallelCompactData& sd = PSParallelCompact::summary_data();
  44   ParallelCompactData::RegionData* const region_ptr = sd.region(index);
  45   assert(region_ptr->claimed(), "must be claimed");
  46   assert(region_ptr->_pushed++ == 0, "should only be pushed once");
  47 #endif
  48   region_stack()->push(index);
  49 }
  50 
  51 inline void ParCompactionManager::follow_contents(oop obj) {
  52   obj->follow_contents(this);
























  53 }
  54 
  55 inline void ParCompactionManager::follow_contents(objArrayOop obj, int index) {
  56   ObjArrayKlass* k = (ObjArrayKlass*)obj->klass();
  57   k->oop_follow_contents(this, obj, index);



  58 }
  59 
  60 inline void ParCompactionManager::update_contents(oop obj) {
  61   obj->update_contents(this);
  62 }
  63 
  64 #endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSCOMPACTIONMANAGER_INLINE_HPP


   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_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSCOMPACTIONMANAGER_INLINE_HPP
  26 #define SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSCOMPACTIONMANAGER_INLINE_HPP
  27 
  28 #include "gc_implementation/parallelScavenge/psCompactionManager.hpp"
  29 #include "gc_implementation/parallelScavenge/psParallelCompact.inline.hpp"
  30 #include "oops/objArrayOop.hpp"
  31 #include "oops/oop.inline.hpp"
  32 #include "utilities/debug.hpp"
  33 #include "utilities/globalDefinitions.hpp"
  34 
  35 void ParCompactionManager::push_objarray(oop obj, size_t index)
  36 {
  37   ObjArrayTask task(obj, index);
  38   assert(task.is_valid(), "bad ObjArrayTask");
  39   _objarray_stack.push(task);
  40 }
  41 
  42 void ParCompactionManager::push_region(size_t index)
  43 {
  44 #ifdef ASSERT
  45   const ParallelCompactData& sd = PSParallelCompact::summary_data();
  46   ParallelCompactData::RegionData* const region_ptr = sd.region(index);
  47   assert(region_ptr->claimed(), "must be claimed");
  48   assert(region_ptr->_pushed++ == 0, "should only be pushed once");
  49 #endif
  50   region_stack()->push(index);
  51 }
  52 
  53 inline void ParCompactionManager::follow_contents(oop obj) {
  54   assert(PSParallelCompact::mark_bitmap()->is_marked(obj), "should be marked");
  55   obj->pc_follow_contents(this);
  56 }
  57 
  58 template <class T>
  59 inline void oop_pc_follow_contents_specialized(ObjArrayKlass* klass, oop obj, int index, ParCompactionManager* cm) {
  60   objArrayOop a = objArrayOop(obj);
  61   const size_t len = size_t(a->length());
  62   const size_t beg_index = size_t(index);
  63   assert(beg_index < len || len == 0, "index too large");
  64 
  65   const size_t stride = MIN2(len - beg_index, ObjArrayMarkingStride);
  66   const size_t end_index = beg_index + stride;
  67   T* const base = (T*)a->base();
  68   T* const beg = base + beg_index;
  69   T* const end = base + end_index;
  70 
  71   // Push the non-NULL elements of the next stride on the marking stack.
  72   for (T* e = beg; e < end; e++) {
  73     PSParallelCompact::mark_and_push<T>(cm, e);
  74   }
  75 
  76   if (end_index < len) {
  77     cm->push_objarray(a, end_index); // Push the continuation.
  78   }
  79 }
  80 
  81 inline void ParCompactionManager::follow_contents(objArrayOop obj, int index) {
  82   if (UseCompressedOops) {
  83     oop_pc_follow_contents_specialized<narrowOop>((ObjArrayKlass*)obj->klass(), obj, index, this);
  84   } else {
  85     oop_pc_follow_contents_specialized<oop>((ObjArrayKlass*)obj->klass(), obj, index, this);
  86   }
  87 }
  88 
  89 inline void ParCompactionManager::update_contents(oop obj) {
  90   obj->pc_update_contents();
  91 }
  92 
  93 #endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSCOMPACTIONMANAGER_INLINE_HPP
< prev index next >