1 /*
   2  * Copyright (c) 2017, 2018, 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_G1_G1FULLGCOOPCLOSURES_INLINE_HPP
  26 #define SHARE_VM_GC_G1_G1FULLGCOOPCLOSURES_INLINE_HPP
  27 
  28 #include "gc/g1/g1Allocator.hpp"
  29 #include "gc/g1/g1ConcurrentMarkBitMap.inline.hpp"
  30 #include "gc/g1/g1FullGCMarker.inline.hpp"
  31 #include "gc/g1/g1FullGCOopClosures.hpp"
  32 #include "gc/g1/heapRegionRemSet.hpp"
  33 #include "memory/iterator.inline.hpp"
  34 #include "oops/access.inline.hpp"
  35 #include "oops/compressedOops.inline.hpp"
  36 #include "oops/oop.inline.hpp"
  37 
  38 template <typename T>
  39 inline void G1MarkAndPushClosure::do_oop_work(T* p) {
  40   _marker->mark_and_push(p);
  41 }
  42 
  43 inline void G1MarkAndPushClosure::do_oop(oop* p) {
  44   do_oop_work(p);
  45 }
  46 
  47 inline void G1MarkAndPushClosure::do_oop(narrowOop* p) {
  48   do_oop_work(p);
  49 }
  50 
  51 inline bool G1MarkAndPushClosure::do_metadata() {
  52   return true;
  53 }
  54 
  55 inline void G1MarkAndPushClosure::do_klass(Klass* k) {
  56   _marker->follow_klass(k);
  57 }
  58 
  59 inline void G1MarkAndPushClosure::do_cld(ClassLoaderData* cld) {
  60   _marker->follow_cld(cld);
  61 }
  62 
  63 template <class T> inline void G1AdjustClosure::adjust_pointer(T* p) {
  64   T heap_oop = RawAccess<>::oop_load(p);
  65   if (CompressedOops::is_null(heap_oop)) {
  66     return;
  67   }
  68 
  69   oop obj = CompressedOops::decode_not_null(heap_oop);
  70   assert(Universe::heap()->is_in(obj), "should be in heap");
  71   if (G1ArchiveAllocator::is_archive_object(obj)) {
  72     // We never forward archive objects.
  73     return;
  74   }
  75 
  76   oop forwardee = obj->forwardee();
  77   if (forwardee == NULL) {
  78     // Not forwarded, return current reference.
  79     assert(obj->mark_raw() == markOopDesc::prototype_for_object(obj) || // Correct mark
  80            obj->mark_raw()->must_be_preserved(obj) || // Will be restored by PreservedMarksSet
  81            (UseBiasedLocking && obj->has_bias_pattern_raw()), // Will be restored by BiasedLocking
  82            "Must have correct prototype or be preserved, obj: " PTR_FORMAT ", mark: " PTR_FORMAT ", prototype: " PTR_FORMAT,
  83            p2i(obj), p2i(obj->mark_raw()), p2i(markOopDesc::prototype_for_object(obj)));
  84     return;
  85   }
  86 
  87   // Forwarded, just update.
  88   assert(Universe::heap()->is_in_reserved(forwardee), "should be in object space");
  89   RawAccess<IS_NOT_NULL>::oop_store(p, forwardee);
  90 }
  91 
  92 inline void G1AdjustClosure::do_oop(oop* p)       { do_oop_work(p); }
  93 inline void G1AdjustClosure::do_oop(narrowOop* p) { do_oop_work(p); }
  94 
  95 inline bool G1IsAliveClosure::do_object_b(oop p) {
  96   return _bitmap->is_marked(p) || G1ArchiveAllocator::is_closed_archive_object(p);
  97 }
  98 
  99 template<typename T>
 100 inline void G1FullKeepAliveClosure::do_oop_work(T* p) {
 101   _marker->mark_and_push(p);
 102 }
 103 
 104 #endif