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 ShenandoahSATBMarkQueueSet _satb_mark_queue_set; 45 46 public: 47 ShenandoahBarrierSet(ShenandoahHeap* heap); 48 49 static ShenandoahBarrierSetAssembler* assembler(); 50 51 inline static ShenandoahBarrierSet* barrier_set() { 52 return barrier_set_cast<ShenandoahBarrierSet>(BarrierSet::barrier_set()); 53 } 54 55 static ShenandoahSATBMarkQueueSet& satb_mark_queue_set() { 56 return barrier_set()->_satb_mark_queue_set; 57 } 58 59 void print_on(outputStream* st) const; 60 61 bool is_a(BarrierSet::Name bsn); 62 63 bool is_aligned(HeapWord* hw); 64 65 void write_ref_array(HeapWord* start, size_t count); 66 67 template <class T> void 68 write_ref_array_pre_work(T* dst, size_t count); 69 70 void write_ref_array_pre(oop* dst, size_t count, bool dest_uninitialized); 71 72 void write_ref_array_pre(narrowOop* dst, size_t count, bool dest_uninitialized); 73 74 // We export this to make it available in cases where the static 75 // type of the barrier set is known. Note that it is non-virtual. 76 template <class T> inline void inline_write_ref_field_pre(T* field, oop new_val); 77 78 // These are the more general virtual versions. 79 void write_ref_field_pre_work(oop* field, oop new_val); 80 void write_ref_field_pre_work(narrowOop* field, oop new_val); 81 void write_ref_field_pre_work(void* field, oop new_val); 82 83 void write_ref_field_work(void* v, oop o, bool release = false); 84 void write_region(MemRegion mr); 85 86 virtual void on_thread_create(Thread* thread); 87 virtual void on_thread_destroy(Thread* thread); 88 virtual void on_thread_attach(Thread* thread); 89 virtual void on_thread_detach(Thread* thread); 90 91 static inline oop resolve_forwarded_not_null(oop p); 92 static inline oop resolve_forwarded(oop p); 93 94 void storeval_barrier(oop obj); 95 void keep_alive_barrier(oop obj); 96 97 oop load_reference_barrier(oop obj); 98 oop load_reference_barrier_mutator(oop obj); 99 oop load_reference_barrier_not_null(oop obj); 100 101 void enqueue(oop obj); 102 103 private: 104 template <class T, bool STOREVAL_WRITE_BARRIER> 105 void write_ref_array_loop(HeapWord* start, size_t count); 106 107 oop load_reference_barrier_impl(oop obj); 108 109 static void keep_alive_if_weak(DecoratorSet decorators, oop value) { 110 assert((decorators & ON_UNKNOWN_OOP_REF) == 0, "Reference strength must be known"); 111 const bool on_strong_oop_ref = (decorators & ON_STRONG_OOP_REF) != 0; 112 const bool peek = (decorators & AS_NO_KEEPALIVE) != 0; 113 if (!peek && !on_strong_oop_ref && value != NULL) { 114 ShenandoahBarrierSet::barrier_set()->keep_alive_barrier(value); 115 } 116 } 117 118 template <typename T> 119 bool arraycopy_loop_1(T* src, T* dst, size_t length, Klass* bound, 120 bool checkcast, bool satb, bool disjoint, ShenandoahBarrierSet::ArrayCopyStoreValMode storeval_mode); 121 122 template <typename T, bool CHECKCAST> 123 bool arraycopy_loop_2(T* src, T* dst, size_t length, Klass* bound, 124 bool satb, bool disjoint, ShenandoahBarrierSet::ArrayCopyStoreValMode storeval_mode); 125 126 template <typename T, bool CHECKCAST, bool SATB> 127 bool arraycopy_loop_3(T* src, T* dst, size_t length, Klass* bound, 128 bool disjoint, ShenandoahBarrierSet::ArrayCopyStoreValMode storeval_mode); 129 130 template <typename T, bool CHECKCAST, bool SATB, ShenandoahBarrierSet::ArrayCopyStoreValMode STOREVAL_MODE> 131 bool arraycopy_loop(T* src, T* dst, size_t length, Klass* bound, bool disjoint); 132 133 template <typename T, bool CHECKCAST, bool SATB, ShenandoahBarrierSet::ArrayCopyStoreValMode STOREVAL_MODE> 134 bool arraycopy_element(T* cur_src, T* cur_dst, Klass* bound, Thread* const thread, ShenandoahMarkingContext* const ctx); 135 136 public: 137 // Callbacks for runtime accesses. 138 template <DecoratorSet decorators, typename BarrierSetT = ShenandoahBarrierSet> 139 class AccessBarrier: public BarrierSet::AccessBarrier<decorators, BarrierSetT> { 140 typedef BarrierSet::AccessBarrier<decorators, BarrierSetT> Raw; 141 142 template <typename T> 143 static oop oop_atomic_cmpxchg_in_heap_impl(oop new_value, T* addr, oop compare_value); 144 145 template <typename T> 146 static oop oop_atomic_xchg_in_heap_impl(oop new_value, T* addr); 147 148 public: 149 // Heap oop accesses. These accessors get resolved when 150 // IN_HEAP is set (e.g. when using the HeapAccess API), it is 151 // an oop_* overload, and the barrier strength is AS_NORMAL. 152 template <typename T> 153 static oop oop_load_in_heap(T* addr); 154 static oop oop_load_in_heap_at(oop base, ptrdiff_t offset); 155 156 template <typename T> 157 static void oop_store_in_heap(T* addr, oop value); 158 static void oop_store_in_heap_at(oop base, ptrdiff_t offset, oop value); 159 160 template <typename T> 161 static oop oop_atomic_cmpxchg_in_heap(oop new_value, T* addr, oop compare_value); 162 static oop oop_atomic_cmpxchg_in_heap_at(oop new_value, oop base, ptrdiff_t offset, oop compare_value); 163 164 template <typename T> 165 static oop oop_atomic_xchg_in_heap(oop new_value, T* addr); 166 static oop oop_atomic_xchg_in_heap_at(oop new_value, oop base, ptrdiff_t offset); 167 168 template <typename T> 169 static bool oop_arraycopy_in_heap(arrayOop src_obj, size_t src_offset_in_bytes, T* src_raw, 170 arrayOop dst_obj, size_t dst_offset_in_bytes, T* dst_raw, 171 size_t length); 172 173 // Clone barrier support 174 static void clone_in_heap(oop src, oop dst, size_t size); 175 176 // Needed for loads on non-heap weak references 177 template <typename T> 178 static oop oop_load_not_in_heap(T* addr); 179 180 template <typename T> 181 static oop oop_atomic_cmpxchg_not_in_heap(oop new_value, T* addr, oop compare_value); 182 183 template <typename T> 184 static oop oop_atomic_xchg_not_in_heap(oop new_value, T* addr); 185 186 }; 187 188 }; 189 190 template<> 191 struct BarrierSet::GetName<ShenandoahBarrierSet> { 192 static const BarrierSet::Name value = BarrierSet::ShenandoahBarrierSet; 193 }; 194 195 template<> 196 struct BarrierSet::GetType<BarrierSet::ShenandoahBarrierSet> { 197 typedef ::ShenandoahBarrierSet type; 198 }; 199 200 #endif // SHARE_GC_SHENANDOAH_SHENANDOAHBARRIERSET_HPP