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