1 /* 2 * Copyright (c) 2013, 2019, Red Hat, Inc. All rights reserved. 3 * 4 * This code is free software; you can redistribute it and/or modify it 5 * under the terms of the GNU General Public License version 2 only, as 6 * published by the Free Software Foundation. 7 * 8 * This code is distributed in the hope that it will be useful, but WITHOUT 9 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 10 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 11 * version 2 for more details (a copy is included in the LICENSE file that 12 * accompanied this code). 13 * 14 * You should have received a copy of the GNU General Public License version 15 * 2 along with this work; if not, write to the Free Software Foundation, 16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 17 * 18 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 19 * or visit www.oracle.com if you need additional information or have any 20 * questions. 21 * 22 */ 23 24 #ifndef SHARE_GC_SHENANDOAH_SHENANDOAHBARRIERSET_HPP 25 #define SHARE_GC_SHENANDOAH_SHENANDOAHBARRIERSET_HPP 26 27 #include "gc/shared/accessBarrierSupport.hpp" 28 #include "gc/shared/barrierSet.hpp" 29 #include "gc/shenandoah/shenandoahHeap.hpp" 30 #include "gc/shenandoah/shenandoahSATBMarkQueueSet.hpp" 31 32 class ShenandoahBarrierSetAssembler; 33 34 class ShenandoahBarrierSet: public BarrierSet { 35 public: 36 enum ArrayCopyStoreValMode { 37 NONE, 38 RESOLVE_BARRIER, 39 EVAC_BARRIER 40 }; 41 private: 42 43 ShenandoahHeap* _heap; 44 BufferNode::Allocator _satb_mark_queue_buffer_allocator; 45 ShenandoahSATBMarkQueueSet _satb_mark_queue_set; 46 47 public: 48 ShenandoahBarrierSet(ShenandoahHeap* heap); 49 50 static ShenandoahBarrierSetAssembler* assembler(); 51 52 inline static ShenandoahBarrierSet* barrier_set() { 53 return barrier_set_cast<ShenandoahBarrierSet>(BarrierSet::barrier_set()); 54 } 55 56 static ShenandoahSATBMarkQueueSet& satb_mark_queue_set() { 57 return barrier_set()->_satb_mark_queue_set; 58 } 59 60 void print_on(outputStream* st) const; 61 62 bool is_a(BarrierSet::Name bsn); 63 64 bool is_aligned(HeapWord* hw); 65 66 template <class T> void 67 write_ref_array_pre_work(T* src, T* dst, size_t count, bool dest_uninitialized); 68 69 inline void arraycopy_pre(oop* src, oop* dst, size_t count); 70 inline void arraycopy_pre(narrowOop* src, narrowOop* dst, size_t count); 71 inline void arraycopy_update(oop* src, size_t count); 72 inline void arraycopy_update(narrowOop* src, size_t count); 73 inline void clone_barrier(oop src); 74 void clone_barrier_runtime(oop src); 75 76 // We export this to make it available in cases where the static 77 // type of the barrier set is known. Note that it is non-virtual. 78 template <class T> inline void inline_write_ref_field_pre(T* field, oop new_val); 79 80 // These are the more general virtual versions. 81 void write_ref_field_pre_work(oop* field, oop new_val); 82 void write_ref_field_pre_work(narrowOop* field, oop new_val); 83 void write_ref_field_pre_work(void* field, oop new_val); 84 85 void write_ref_field_work(void* v, oop o, bool release = false); 86 87 virtual void on_thread_create(Thread* thread); 88 virtual void on_thread_destroy(Thread* thread); 89 virtual void on_thread_attach(Thread* thread); 90 virtual void on_thread_detach(Thread* thread); 91 92 static inline oop resolve_forwarded_not_null(oop p); 93 static inline oop resolve_forwarded(oop p); 94 95 void storeval_barrier(oop obj); 96 void keep_alive_barrier(oop obj); 97 98 oop load_reference_barrier(oop obj); 99 oop load_reference_barrier_not_null(oop obj); 100 101 oop load_reference_barrier_mutator(oop obj, oop* load_addr); 102 oop load_reference_barrier_mutator(oop obj, narrowOop* load_addr); 103 104 template <class T> 105 oop load_reference_barrier_mutator_work(oop obj, T* load_addr); 106 107 oop load_reference_barrier_native(oop obj, oop* load_addr); 108 oop load_reference_barrier_native(oop obj, narrowOop* load_addr); 109 110 void enqueue(oop obj); 111 112 private: 113 template <class T> 114 inline void arraycopy_pre_work(T* src, T* dst, size_t count); 115 template <class T, bool HAS_FWD, bool EVAC, bool ENQUEUE> 116 inline void arraycopy_work(T* src, size_t count); 117 template <class T> 118 inline void arraycopy_update_impl(T* src, size_t count); 119 120 oop load_reference_barrier_impl(oop obj); 121 122 template <class T> 123 oop load_reference_barrier_native_impl(oop obj, T* load_addr); 124 125 static void keep_alive_if_weak(DecoratorSet decorators, oop value) { 126 assert((decorators & ON_UNKNOWN_OOP_REF) == 0, "Reference strength must be known"); 127 const bool on_strong_oop_ref = (decorators & ON_STRONG_OOP_REF) != 0; 128 const bool peek = (decorators & AS_NO_KEEPALIVE) != 0; 129 if (!peek && !on_strong_oop_ref && value != NULL) { 130 ShenandoahBarrierSet::barrier_set()->keep_alive_barrier(value); 131 } 132 } 133 134 public: 135 // Callbacks for runtime accesses. 136 template <DecoratorSet decorators, typename BarrierSetT = ShenandoahBarrierSet> 137 class AccessBarrier: public BarrierSet::AccessBarrier<decorators, BarrierSetT> { 138 typedef BarrierSet::AccessBarrier<decorators, BarrierSetT> Raw; 139 140 template <typename T> 141 static oop oop_atomic_cmpxchg_in_heap_impl(oop new_value, T* addr, oop compare_value); 142 143 template <typename T> 144 static oop oop_atomic_xchg_in_heap_impl(oop new_value, T* addr); 145 146 public: 147 // Heap oop accesses. These accessors get resolved when 148 // IN_HEAP is set (e.g. when using the HeapAccess API), it is 149 // an oop_* overload, and the barrier strength is AS_NORMAL. 150 template <typename T> 151 static oop oop_load_in_heap(T* addr); 152 static oop oop_load_in_heap_at(oop base, ptrdiff_t offset); 153 154 template <typename T> 155 static void oop_store_in_heap(T* addr, oop value); 156 static void oop_store_in_heap_at(oop base, ptrdiff_t offset, oop value); 157 158 template <typename T> 159 static oop oop_atomic_cmpxchg_in_heap(oop new_value, T* addr, oop compare_value); 160 static oop oop_atomic_cmpxchg_in_heap_at(oop new_value, oop base, ptrdiff_t offset, oop compare_value); 161 162 template <typename T> 163 static oop oop_atomic_xchg_in_heap(oop new_value, T* addr); 164 static oop oop_atomic_xchg_in_heap_at(oop new_value, oop base, ptrdiff_t offset); 165 166 template <typename T> 167 static bool oop_arraycopy_in_heap(arrayOop src_obj, size_t src_offset_in_bytes, T* src_raw, 168 arrayOop dst_obj, size_t dst_offset_in_bytes, T* dst_raw, 169 size_t length); 170 171 // Clone barrier support 172 static void clone_in_heap(oop src, oop dst, size_t size); 173 174 // Needed for loads on non-heap weak references 175 template <typename T> 176 static oop oop_load_not_in_heap(T* addr); 177 178 // Used for catching bad stores 179 template <typename T> 180 static void oop_store_not_in_heap(T* addr, oop value); 181 182 template <typename T> 183 static oop oop_atomic_cmpxchg_not_in_heap(oop new_value, T* addr, oop compare_value); 184 185 template <typename T> 186 static oop oop_atomic_xchg_not_in_heap(oop new_value, T* addr); 187 188 }; 189 190 }; 191 192 template<> 193 struct BarrierSet::GetName<ShenandoahBarrierSet> { 194 static const BarrierSet::Name value = BarrierSet::ShenandoahBarrierSet; 195 }; 196 197 template<> 198 struct BarrierSet::GetType<BarrierSet::ShenandoahBarrierSet> { 199 typedef ::ShenandoahBarrierSet type; 200 }; 201 202 #endif // SHARE_GC_SHENANDOAH_SHENANDOAHBARRIERSET_HPP