1 /* 2 * Copyright (c) 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_IMPLEMENTATION_PARALLELSCAVENGE_PSPARALLELCOMPACT_INLINE_HPP 26 #define SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSPARALLELCOMPACT_INLINE_HPP 27 28 #include "gc_implementation/parallelScavenge/parallelScavengeHeap.hpp" 29 #include "gc_implementation/parallelScavenge/psCompactionManager.hpp" 30 #include "gc_implementation/parallelScavenge/psParallelCompact.hpp" 31 #include "gc_interface/collectedHeap.hpp" 32 #include "oops/klass.hpp" 33 #include "oops/oop.inline.hpp" 34 35 template <typename T> 36 inline void PSParallelCompact::mark_and_push(ParCompactionManager* cm, T* p) { 37 T heap_oop = oopDesc::load_heap_oop(p); 38 if (!oopDesc::is_null(heap_oop)) { 39 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop); 40 assert(ParallelScavengeHeap::heap()->is_in(obj), "should be in heap"); 41 42 if (mark_bitmap()->is_unmarked(obj) && mark_obj(obj)) { 43 cm->push(obj); 44 } 45 } 46 } 47 48 template <typename T> 49 inline void PSParallelCompact::MarkAndPushClosure::do_oop_nv(T* p) { 50 mark_and_push(_compaction_manager, p); 51 } 52 53 inline void PSParallelCompact::MarkAndPushClosure::do_oop(oop* p) { do_oop_nv(p); } 54 inline void PSParallelCompact::MarkAndPushClosure::do_oop(narrowOop* p) { do_oop_nv(p); } 55 56 inline void PSParallelCompact::follow_klass(ParCompactionManager* cm, Klass* klass) { 57 oop holder = klass->klass_holder(); 58 mark_and_push(cm, &holder); 59 } 60 61 template <class T> 62 inline void PSParallelCompact::adjust_pointer(T* p) { 63 T heap_oop = oopDesc::load_heap_oop(p); 64 if (!oopDesc::is_null(heap_oop)) { 65 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop); 66 assert(ParallelScavengeHeap::heap()->is_in(obj), "should be in heap"); 67 68 oop new_obj = (oop)summary_data().calc_new_pointer(obj); 69 assert(new_obj != NULL, // is forwarding ptr? 70 "should be forwarded"); 71 // Just always do the update unconditionally? 72 if (new_obj != NULL) { 73 assert(ParallelScavengeHeap::heap()->is_in_reserved(new_obj), 74 "should be in object space"); 75 oopDesc::encode_store_heap_oop_not_null(p, new_obj); 76 } 77 } 78 } 79 80 template <typename T> 81 void PSParallelCompact::AdjustPointerClosure::do_oop_nv(T* p) { 82 adjust_pointer(p); 83 } 84 85 inline void PSParallelCompact::AdjustPointerClosure::do_oop(oop* p) { do_oop_nv(p); } 86 inline void PSParallelCompact::AdjustPointerClosure::do_oop(narrowOop* p) { do_oop_nv(p); } 87 88 #endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSPARALLELCOMPACT_INLINE_HPP