1 /*
   2  * Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   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_OOPS_OOP_PCGC_INLINE_HPP
  26 #define SHARE_VM_OOPS_OOP_PCGC_INLINE_HPP
  27 
  28 #ifndef SERIALGC
  29 #include "gc_implementation/parNew/parNewGeneration.hpp"
  30 #include "gc_implementation/parallelScavenge/parallelScavengeHeap.hpp"
  31 #include "gc_implementation/parallelScavenge/psCompactionManager.hpp"
  32 #include "gc_implementation/parallelScavenge/psParallelCompact.hpp"
  33 #include "gc_implementation/parallelScavenge/psScavenge.hpp"
  34 #include "gc_implementation/parallelScavenge/psScavenge.inline.hpp"
  35 #endif
  36 
  37 inline void oopDesc::update_contents(ParCompactionManager* cm) {
  38   // The klass field must be updated before anything else
  39   // can be done.
  40   DEBUG_ONLY(klassOopDesc* original_klass = klass());
  41 
  42   // Can the option to update and/or copy be moved up in the
  43   // call chain to avoid calling into here?
  44 
  45   if (PSParallelCompact::should_update_klass(klass())) {
  46     update_header();
  47     assert(klass()->is_klass(), "Not updated correctly");
  48   } else {
  49     assert(klass()->is_klass(), "Not updated");
  50   }
  51 
  52   Klass* new_klass = blueprint();
  53   if (!new_klass->oop_is_typeArray()) {
  54     // It might contain oops beyond the header, so take the virtual call.
  55     new_klass->oop_update_pointers(cm, this);
  56   }
  57   // Else skip it.  The typeArrayKlass in the header never needs scavenging.
  58 }
  59 
  60 inline void oopDesc::update_contents(ParCompactionManager* cm,
  61                                      HeapWord* begin_limit,
  62                                      HeapWord* end_limit) {
  63   // The klass field must be updated before anything else
  64   // can be done.
  65   debug_only(klassOopDesc* original_klass = klass());
  66 
  67   update_contents(cm, klass(), begin_limit, end_limit);
  68 }
  69 
  70 inline void oopDesc::update_contents(ParCompactionManager* cm,
  71                                      klassOop old_klass,
  72                                      HeapWord* begin_limit,
  73                                      HeapWord* end_limit) {
  74 
  75   klassOop updated_klass =
  76     PSParallelCompact::summary_data().calc_new_klass(old_klass);
  77 
  78   // Needs to be boundary aware for the 64 bit case
  79   // update_header();
  80   // The klass has moved.  Is the location of the klass
  81   // within the limits?
  82   if ((((HeapWord*)&_metadata._klass) >= begin_limit) &&
  83       (((HeapWord*)&_metadata._klass) < end_limit)) {
  84     set_klass(updated_klass);
  85   }
  86 
  87   Klass* klass = updated_klass->klass_part();
  88   if (!klass->oop_is_typeArray()) {
  89     // It might contain oops beyond the header, so take the virtual call.
  90     klass->oop_update_pointers(cm, this, begin_limit, end_limit);
  91   }
  92   // Else skip it.  The typeArrayKlass in the header never needs scavenging.
  93 }
  94 
  95 inline void oopDesc::follow_contents(ParCompactionManager* cm) {
  96   assert (PSParallelCompact::mark_bitmap()->is_marked(this),
  97     "should be marked");
  98   blueprint()->oop_follow_contents(cm, this);
  99 }
 100 
 101 // Used by parallel old GC.
 102 
 103 inline void oopDesc::follow_header(ParCompactionManager* cm) {
 104   if (UseCompressedOops) {
 105     PSParallelCompact::mark_and_push(cm, compressed_klass_addr());
 106   } else {
 107     PSParallelCompact::mark_and_push(cm, klass_addr());
 108   }
 109 }
 110 
 111 inline oop oopDesc::forward_to_atomic(oop p) {
 112   assert(ParNewGeneration::is_legal_forward_ptr(p),
 113          "illegal forwarding pointer value.");
 114   markOop oldMark = mark();
 115   markOop forwardPtrMark = markOopDesc::encode_pointer_as_mark(p);
 116   markOop curMark;
 117 
 118   assert(forwardPtrMark->decode_pointer() == p, "encoding must be reversable");
 119   assert(sizeof(markOop) == sizeof(intptr_t), "CAS below requires this.");
 120 
 121   while (!is_forwarded()) {
 122     curMark = (markOop)Atomic::cmpxchg_ptr(forwardPtrMark, &_mark, oldMark);
 123     if (curMark == oldMark) {
 124       assert(is_forwarded(), "the CAS should have succeeded.");
 125       return NULL;
 126     }
 127     oldMark = curMark;
 128   }
 129   return forwardee();
 130 }
 131 
 132 inline void oopDesc::update_header() {
 133   if (UseCompressedOops) {
 134     PSParallelCompact::adjust_pointer(compressed_klass_addr());
 135   } else {
 136     PSParallelCompact::adjust_pointer(klass_addr());
 137   }
 138 }
 139 
 140 inline void oopDesc::update_header(HeapWord* beg_addr, HeapWord* end_addr) {
 141   if (UseCompressedOops) {
 142     PSParallelCompact::adjust_pointer(compressed_klass_addr(),
 143                                       beg_addr, end_addr);
 144   } else {
 145     PSParallelCompact::adjust_pointer(klass_addr(), beg_addr, end_addr);
 146   }
 147 }
 148 
 149 #endif // SHARE_VM_OOPS_OOP_PCGC_INLINE_HPP