1 /*
   2  * Copyright (c) 2000, 2015, 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_GC_SERIAL_MARKSWEEP_INLINE_HPP
  26 #define SHARE_VM_GC_SERIAL_MARKSWEEP_INLINE_HPP
  27 
  28 #include "gc/serial/markSweep.hpp"
  29 #include "gc/shared/collectedHeap.hpp"
  30 #include "oops/instanceClassLoaderKlass.inline.hpp"
  31 #include "oops/instanceKlass.inline.hpp"
  32 #include "oops/instanceMirrorKlass.inline.hpp"
  33 #include "oops/instanceRefKlass.inline.hpp"
  34 #include "oops/markOop.inline.hpp"
  35 #include "oops/objArrayKlass.inline.hpp"
  36 #include "utilities/macros.hpp"
  37 #include "utilities/stack.inline.hpp"
  38 #if INCLUDE_ALL_GCS
  39 #include "gc/g1/g1StringDedup.hpp"
  40 #include "gc/g1/g1MarkSweep.hpp"
  41 #endif // INCLUDE_ALL_GCS
  42 
  43 inline void MarkSweep::mark_object(oop obj) {
  44 #if INCLUDE_ALL_GCS
  45   if (G1StringDedup::is_enabled()) {
  46     // We must enqueue the object before it is marked
  47     // as we otherwise can't read the object's age.
  48     G1StringDedup::enqueue_from_mark(obj);
  49   }
  50 #endif
  51   // some marks may contain information we need to preserve so we store them away
  52   // and overwrite the mark.  We'll restore it at the end of markSweep.
  53   markOop mark = obj->mark();
  54   obj->set_mark(markOopDesc::prototype()->set_marked());
  55 
  56   if (mark->must_be_preserved(obj)) {
  57     preserve_mark(obj, mark);
  58   }
  59 }
  60 
  61 inline bool MarkSweep::is_archive_object(oop object) {
  62 #if INCLUDE_ALL_GCS
  63   return (G1MarkSweep::archive_check_enabled() &&
  64           G1MarkSweep::in_archive_range(object));
  65 #else
  66   return false;
  67 #endif
  68 }
  69 
  70 inline void MarkSweep::follow_klass(Klass* klass) {
  71   oop op = klass->klass_holder();
  72   MarkSweep::mark_and_push(&op);
  73 }
  74 
  75 inline void MarkSweep::follow_object(oop obj) {
  76   assert(obj->is_gc_marked(), "should be marked");
  77 
  78   obj->ms_follow_contents();
  79 }
  80 
  81 template <class T> inline void MarkSweep::follow_root(T* p) {
  82   assert(!Universe::heap()->is_in_reserved(p),
  83          "roots shouldn't be things within the heap");
  84   T heap_oop = oopDesc::load_heap_oop(p);
  85   if (!oopDesc::is_null(heap_oop)) {
  86     oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
  87     if (!obj->mark()->is_marked() &&
  88         !is_archive_object(obj)) {
  89       mark_object(obj);
  90       follow_object(obj);
  91     }
  92   }
  93   follow_stack();
  94 }
  95 
  96 template <class T> inline void MarkSweep::mark_and_push(T* p) {
  97 //  assert(Universe::heap()->is_in_reserved(p), "should be in object space");
  98   T heap_oop = oopDesc::load_heap_oop(p);
  99   if (!oopDesc::is_null(heap_oop)) {
 100     oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
 101     if (!obj->mark()->is_marked() &&
 102         !is_archive_object(obj)) {
 103       mark_object(obj);
 104       _marking_stack.push(obj);
 105     }
 106   }
 107 }
 108 
 109 void MarkSweep::push_objarray(oop obj, size_t index) {
 110   ObjArrayTask task(obj, index);
 111   assert(task.is_valid(), "bad ObjArrayTask");
 112   _objarray_stack.push(task);
 113 }
 114 
 115 inline int MarkSweep::adjust_pointers(oop obj) {
 116   return obj->ms_adjust_pointers();
 117 }
 118 
 119 template <class T> inline void MarkSweep::adjust_pointer(T* p) {
 120   T heap_oop = oopDesc::load_heap_oop(p);
 121   if (!oopDesc::is_null(heap_oop)) {
 122     oop obj     = oopDesc::decode_heap_oop_not_null(heap_oop);
 123     assert(Universe::heap()->is_in(obj), "should be in heap");
 124 
 125     oop new_obj = oop(obj->mark()->decode_pointer());
 126     assert(is_archive_object(obj) ||                  // no forwarding of archive objects
 127            new_obj != NULL ||                         // is forwarding ptr?
 128            obj->mark() == markOopDesc::prototype() || // not gc marked?
 129            (UseBiasedLocking && obj->mark()->has_bias_pattern()),
 130            // not gc marked?
 131            "should be forwarded");
 132     if (new_obj != NULL) {
 133       if (!is_archive_object(obj)) {
 134         assert(Universe::heap()->is_in_reserved(new_obj),
 135                "should be in object space");
 136         oopDesc::encode_store_heap_oop_not_null(p, new_obj);
 137       }
 138     }
 139   }
 140 }
 141 
 142 template <class T> inline void MarkSweep::KeepAliveClosure::do_oop_work(T* p) {
 143   mark_and_push(p);
 144 }
 145 
 146 #endif // SHARE_VM_GC_SERIAL_MARKSWEEP_INLINE_HPP