1 /*
2 * Copyright (c) 2017, 2023, 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_OOPS_ACCESS_HPP
26 #define SHARE_OOPS_ACCESS_HPP
27
28 #include "memory/allStatic.hpp"
29 #include "oops/accessBackend.hpp"
30 #include "oops/accessDecorators.hpp"
31 #include "oops/inlineKlass.hpp"
32 #include "oops/oopsHierarchy.hpp"
33 #include "utilities/debug.hpp"
34 #include "utilities/globalDefinitions.hpp"
35
36
37 // = GENERAL =
38 // Access is an API for performing accesses with declarative semantics. Each access can have a number of "decorators".
39 // A decorator is an attribute or property that affects the way a memory access is performed in some way.
40 // There are different groups of decorators. Some have to do with memory ordering, others to do with,
41 // e.g. strength of references, strength of GC barriers, or whether compression should be applied or not.
42 // Some decorators are set at buildtime, such as whether primitives require GC barriers or not, others
43 // at callsites such as whether an access is in the heap or not, and others are resolved at runtime
44 // such as GC-specific barriers and encoding/decoding compressed oops. For more information about what
45 // decorators are available, cf. oops/accessDecorators.hpp.
46 // By pipelining handling of these decorators, the design of the Access API allows separation of concern
47 // over the different orthogonal concerns of decorators, while providing a powerful way of
48 // expressing these orthogonal semantic properties in a unified way.
49 //
50 // == OPERATIONS ==
51 // * load: Load a value from an address.
52 // * load_at: Load a value from an internal pointer relative to a base object.
53 // * store: Store a value at an address.
54 // * store_at: Store a value in an internal pointer relative to a base object.
55 // * atomic_cmpxchg: Atomically compare-and-swap a new value at an address if previous value matched the compared value.
56 // * atomic_cmpxchg_at: Atomically compare-and-swap a new value at an internal pointer address if previous value matched the compared value.
57 // * atomic_xchg: Atomically swap a new value at an address without checking the previous value.
58 // * atomic_xchg_at: Atomically swap a new value at an internal pointer address without checking the previous value.
59 // * arraycopy: Copy data from one heap array to another heap array. The ArrayAccess class has convenience functions for this.
60 // * clone: Clone the contents of an object to a newly allocated object.
61 // * value_copy: Copy the contents of a value type from one heap address to another
62 //
63 // == IMPLEMENTATION ==
64 // Each access goes through the following steps in a template pipeline.
65 // There are essentially 5 steps for each access:
66 // * Step 1: Set default decorators and decay types. This step gets rid of CV qualifiers
67 // and sets default decorators to sensible values.
68 // * Step 2: Reduce types. This step makes sure there is only a single T type and not
69 // multiple types. The P type of the address and T type of the value must
70 // match.
71 // * Step 3: Pre-runtime dispatch. This step checks whether a runtime call can be
72 // avoided, and in that case avoids it (calling raw accesses or
73 // primitive accesses in a build that does not require primitive GC barriers)
74 // * Step 4: Runtime-dispatch. This step performs a runtime dispatch to the corresponding
75 // BarrierSet::AccessBarrier accessor that attaches GC-required barriers
76 // to the access.
77 // * Step 5.a: Barrier resolution. This step is invoked the first time a runtime-dispatch
78 // happens for an access. The appropriate BarrierSet::AccessBarrier accessor
79 // is resolved, then the function pointer is updated to that accessor for
80 // future invocations.
81 // * Step 5.b: Post-runtime dispatch. This step now casts previously unknown types such
82 // as the address type of an oop on the heap (is it oop* or narrowOop*) to
83 // the appropriate type. It also splits sufficiently orthogonal accesses into
84 // different functions, such as whether the access involves oops or primitives
85 // and whether the access is performed on the heap or outside. Then the
86 // appropriate BarrierSet::AccessBarrier is called to perform the access.
87 //
88 // The implementation of step 1-4 resides in accessBackend.hpp, to allow selected
89 // accesses to be accessible from only access.hpp, as opposed to access.inline.hpp.
90 // Steps 5.a and 5.b require knowledge about the GC backends, and therefore needs to
91 // include the various GC backend .inline.hpp headers. Their implementation resides in
92 // access.inline.hpp.
93
94 template <DecoratorSet decorators = DECORATORS_NONE>
95 class Access: public AllStatic {
96 // This function asserts that if an access gets passed in a decorator outside
97 // of the expected_decorators, then something is wrong. It additionally checks
98 // the consistency of the decorators so that supposedly disjoint decorators are indeed
99 // disjoint. For example, an access can not be both in heap and on root at the
100 // same time.
101 template <DecoratorSet expected_decorators>
102 static void verify_decorators();
103
104 template <DecoratorSet expected_mo_decorators>
105 static void verify_primitive_decorators() {
106 const DecoratorSet primitive_decorators = (AS_DECORATOR_MASK ^ AS_NO_KEEPALIVE) |
107 IN_HEAP | IS_ARRAY;
108 verify_decorators<expected_mo_decorators | primitive_decorators>();
109 }
110
111 template <DecoratorSet expected_mo_decorators>
112 static void verify_oop_decorators() {
113 const DecoratorSet oop_decorators = AS_DECORATOR_MASK | IN_DECORATOR_MASK |
114 (ON_DECORATOR_MASK ^ ON_UNKNOWN_OOP_REF) | // no unknown oop refs outside of the heap
115 IS_ARRAY | IS_NOT_NULL | IS_DEST_UNINITIALIZED;
116 verify_decorators<expected_mo_decorators | oop_decorators>();
117 }
118
119 template <DecoratorSet expected_mo_decorators>
120 static void verify_heap_oop_decorators() {
121 const DecoratorSet heap_oop_decorators = AS_DECORATOR_MASK | ON_DECORATOR_MASK |
122 IN_HEAP | IS_ARRAY | IS_NOT_NULL | IS_DEST_UNINITIALIZED;
123 verify_decorators<expected_mo_decorators | heap_oop_decorators>();
124 }
125
126 template <DecoratorSet expected_mo_decorators>
127 static void verify_heap_value_decorators() {
128 const DecoratorSet heap_value_decorators = IN_HEAP | IS_DEST_UNINITIALIZED;
129 verify_decorators<expected_mo_decorators | heap_value_decorators>();
130 }
131
132 static const DecoratorSet load_mo_decorators = MO_UNORDERED | MO_RELAXED | MO_ACQUIRE | MO_SEQ_CST;
133 static const DecoratorSet store_mo_decorators = MO_UNORDERED | MO_RELAXED | MO_RELEASE | MO_SEQ_CST;
134 static const DecoratorSet atomic_xchg_mo_decorators = MO_SEQ_CST;
135 static const DecoratorSet atomic_cmpxchg_mo_decorators = MO_RELAXED | MO_SEQ_CST;
136
137 protected:
138 template <typename T>
139 static inline void oop_arraycopy(arrayOop src_obj, size_t src_offset_in_bytes, const T* src_raw,
140 arrayOop dst_obj, size_t dst_offset_in_bytes, T* dst_raw,
141 size_t length) {
142 verify_decorators<ARRAYCOPY_DECORATOR_MASK | IN_HEAP |
143 AS_DECORATOR_MASK | IS_ARRAY | IS_DEST_UNINITIALIZED>();
144 AccessInternal::arraycopy<decorators | INTERNAL_VALUE_IS_OOP>(src_obj, src_offset_in_bytes, src_raw,
145 dst_obj, dst_offset_in_bytes, dst_raw,
146 length);
147 }
148
149 template <typename T>
150 static inline void arraycopy(arrayOop src_obj, size_t src_offset_in_bytes, const T* src_raw,
151 arrayOop dst_obj, size_t dst_offset_in_bytes, T* dst_raw,
152 size_t length) {
153 verify_decorators<ARRAYCOPY_DECORATOR_MASK | IN_HEAP |
154 AS_DECORATOR_MASK | IS_ARRAY>();
155 AccessInternal::arraycopy<decorators>(src_obj, src_offset_in_bytes, src_raw,
156 dst_obj, dst_offset_in_bytes, dst_raw,
157 length);
158 }
159
160 public:
161 // Primitive heap accesses
162 static inline AccessInternal::LoadAtProxy<decorators> load_at(oop base, ptrdiff_t offset) {
163 verify_primitive_decorators<load_mo_decorators>();
164 return AccessInternal::LoadAtProxy<decorators>(base, offset);
165 }
166
167 template <typename T>
168 static inline void store_at(oop base, ptrdiff_t offset, T value) {
169 verify_primitive_decorators<store_mo_decorators>();
170 AccessInternal::store_at<decorators>(base, offset, value);
171 }
172
173 template <typename T>
174 static inline T atomic_cmpxchg_at(oop base, ptrdiff_t offset, T compare_value, T new_value) {
175 verify_primitive_decorators<atomic_cmpxchg_mo_decorators>();
176 return AccessInternal::atomic_cmpxchg_at<decorators>(base, offset, compare_value, new_value);
177 }
178
179 template <typename T>
180 static inline T atomic_xchg_at(oop base, ptrdiff_t offset, T new_value) {
181 verify_primitive_decorators<atomic_xchg_mo_decorators>();
182 return AccessInternal::atomic_xchg_at<decorators>(base, offset, new_value);
183 }
184
185 // Oop heap accesses
186 static inline AccessInternal::OopLoadAtProxy<decorators> oop_load_at(oop base, ptrdiff_t offset) {
187 verify_heap_oop_decorators<load_mo_decorators>();
188 return AccessInternal::OopLoadAtProxy<decorators>(base, offset);
189 }
190
191 template <typename T>
192 static inline void oop_store_at(oop base, ptrdiff_t offset, T value) {
193 verify_heap_oop_decorators<store_mo_decorators>();
194 typedef typename AccessInternal::OopOrNarrowOop<T>::type OopType;
195 OopType oop_value = value;
196 AccessInternal::store_at<decorators | INTERNAL_VALUE_IS_OOP>(base, offset, oop_value);
197 }
198
199 template <typename T>
200 static inline T oop_atomic_cmpxchg_at(oop base, ptrdiff_t offset, T compare_value, T new_value) {
201 verify_heap_oop_decorators<atomic_cmpxchg_mo_decorators>();
202 typedef typename AccessInternal::OopOrNarrowOop<T>::type OopType;
203 OopType new_oop_value = new_value;
204 OopType compare_oop_value = compare_value;
205 return AccessInternal::atomic_cmpxchg_at<decorators | INTERNAL_VALUE_IS_OOP>(base, offset, compare_oop_value, new_oop_value);
206 }
207
208 template <typename T>
209 static inline T oop_atomic_xchg_at(oop base, ptrdiff_t offset, T new_value) {
210 verify_heap_oop_decorators<atomic_xchg_mo_decorators>();
211 typedef typename AccessInternal::OopOrNarrowOop<T>::type OopType;
212 OopType new_oop_value = new_value;
213 return AccessInternal::atomic_xchg_at<decorators | INTERNAL_VALUE_IS_OOP>(base, offset, new_oop_value);
214 }
215
216 // Clone an object from src to dst
217 static inline void clone(oop src, oop dst, size_t size) {
218 verify_decorators<IN_HEAP>();
219 AccessInternal::clone<decorators>(src, dst, size);
220 }
221
222 // inline type heap access (when flat)...
223
224 // Copy value type data from src to dst
225 static inline void value_copy(void* src, void* dst, InlineKlass* md, LayoutKind lk) {
226 verify_heap_value_decorators<IN_HEAP>();
227 AccessInternal::value_copy<decorators>(src, dst, md, lk);
228 }
229
230 // Primitive accesses
231 template <typename P>
232 static inline P load(P* addr) {
233 verify_primitive_decorators<load_mo_decorators>();
234 return AccessInternal::load<decorators, P, P>(addr);
235 }
236
237 template <typename P, typename T>
238 static inline void store(P* addr, T value) {
239 verify_primitive_decorators<store_mo_decorators>();
240 AccessInternal::store<decorators>(addr, value);
241 }
242
243 template <typename P, typename T>
244 static inline T atomic_cmpxchg(P* addr, T compare_value, T new_value) {
245 verify_primitive_decorators<atomic_cmpxchg_mo_decorators>();
246 return AccessInternal::atomic_cmpxchg<decorators>(addr, compare_value, new_value);
247 }
248
249 template <typename P, typename T>
250 static inline T atomic_xchg(P* addr, T new_value) {
251 verify_primitive_decorators<atomic_xchg_mo_decorators>();
252 return AccessInternal::atomic_xchg<decorators>(addr, new_value);
253 }
254
255 // Oop accesses
256 template <typename P>
257 static inline AccessInternal::OopLoadProxy<P, decorators> oop_load(P* addr) {
258 verify_oop_decorators<load_mo_decorators>();
259 return AccessInternal::OopLoadProxy<P, decorators>(addr);
260 }
261
262 template <typename P, typename T>
263 static inline void oop_store(P* addr, T value) {
264 verify_oop_decorators<store_mo_decorators>();
265 typedef typename AccessInternal::OopOrNarrowOop<T>::type OopType;
266 OopType oop_value = value;
267 AccessInternal::store<decorators | INTERNAL_VALUE_IS_OOP>(addr, oop_value);
268 }
269
270 template <typename P, typename T>
271 static inline T oop_atomic_cmpxchg(P* addr, T compare_value, T new_value) {
272 verify_oop_decorators<atomic_cmpxchg_mo_decorators>();
273 typedef typename AccessInternal::OopOrNarrowOop<T>::type OopType;
274 OopType new_oop_value = new_value;
275 OopType compare_oop_value = compare_value;
276 return AccessInternal::atomic_cmpxchg<decorators | INTERNAL_VALUE_IS_OOP>(addr, compare_oop_value, new_oop_value);
277 }
278
279 template <typename P, typename T>
280 static inline T oop_atomic_xchg(P* addr, T new_value) {
281 verify_oop_decorators<atomic_xchg_mo_decorators>();
282 typedef typename AccessInternal::OopOrNarrowOop<T>::type OopType;
283 OopType new_oop_value = new_value;
284 return AccessInternal::atomic_xchg<decorators | INTERNAL_VALUE_IS_OOP>(addr, new_oop_value);
285 }
286 };
287
288 // Helper for performing raw accesses (knows only of memory ordering
289 // atomicity decorators as well as compressed oops).
290 template <DecoratorSet decorators = DECORATORS_NONE>
291 class RawAccess: public Access<AS_RAW | decorators> {};
292
293 // Helper for performing normal accesses on the heap. These accesses
294 // may resolve an accessor on a GC barrier set.
295 template <DecoratorSet decorators = DECORATORS_NONE>
296 class HeapAccess: public Access<IN_HEAP | decorators> {};
297
298 // Helper for performing normal accesses in roots. These accesses
299 // may resolve an accessor on a GC barrier set.
300 template <DecoratorSet decorators = DECORATORS_NONE>
301 class NativeAccess: public Access<IN_NATIVE | decorators> {};
302
303 // Helper for array access.
304 template <DecoratorSet decorators = DECORATORS_NONE>
305 class ArrayAccess: public HeapAccess<IS_ARRAY | decorators> {
306 typedef HeapAccess<IS_ARRAY | decorators> AccessT;
307 public:
308 template <typename T>
309 static inline void arraycopy(arrayOop src_obj, size_t src_offset_in_bytes,
310 arrayOop dst_obj, size_t dst_offset_in_bytes,
311 size_t length) {
312 AccessT::arraycopy(src_obj, src_offset_in_bytes, static_cast<const T*>(nullptr),
313 dst_obj, dst_offset_in_bytes, static_cast<T*>(nullptr),
314 length);
315 }
316
317 template <typename T>
318 static inline void arraycopy_to_native(arrayOop src_obj, size_t src_offset_in_bytes,
319 T* dst,
320 size_t length) {
321 AccessT::arraycopy(src_obj, src_offset_in_bytes, static_cast<const T*>(nullptr),
322 nullptr, 0, dst,
323 length);
324 }
325
326 template <typename T>
327 static inline void arraycopy_from_native(const T* src,
328 arrayOop dst_obj, size_t dst_offset_in_bytes,
329 size_t length) {
330 AccessT::arraycopy(nullptr, 0, src,
331 dst_obj, dst_offset_in_bytes, static_cast<T*>(nullptr),
332 length);
333 }
334
335 static inline void oop_arraycopy(arrayOop src_obj, size_t src_offset_in_bytes,
336 arrayOop dst_obj, size_t dst_offset_in_bytes,
337 size_t length) {
338 AccessT::oop_arraycopy(src_obj, src_offset_in_bytes, static_cast<const HeapWord*>(nullptr),
339 dst_obj, dst_offset_in_bytes, static_cast<HeapWord*>(nullptr),
340 length);
341 }
342
343 template <typename T>
344 static inline void oop_arraycopy_raw(T* src, T* dst, size_t length) {
345 AccessT::oop_arraycopy(nullptr, 0, src,
346 nullptr, 0, dst,
347 length);
348 }
349
350 };
351
352 template <DecoratorSet decorators>
353 template <DecoratorSet expected_decorators>
354 void Access<decorators>::verify_decorators() {
355 STATIC_ASSERT((~expected_decorators & decorators) == 0); // unexpected decorator used
356 const DecoratorSet barrier_strength_decorators = decorators & AS_DECORATOR_MASK;
357 STATIC_ASSERT(barrier_strength_decorators == 0 || ( // make sure barrier strength decorators are disjoint if set
358 (barrier_strength_decorators ^ AS_NO_KEEPALIVE) == 0 ||
359 (barrier_strength_decorators ^ AS_RAW) == 0 ||
360 (barrier_strength_decorators ^ AS_NORMAL) == 0
361 ));
362 const DecoratorSet ref_strength_decorators = decorators & ON_DECORATOR_MASK;
363 STATIC_ASSERT(ref_strength_decorators == 0 || ( // make sure ref strength decorators are disjoint if set
364 (ref_strength_decorators ^ ON_STRONG_OOP_REF) == 0 ||
365 (ref_strength_decorators ^ ON_WEAK_OOP_REF) == 0 ||
366 (ref_strength_decorators ^ ON_PHANTOM_OOP_REF) == 0 ||
367 (ref_strength_decorators ^ ON_UNKNOWN_OOP_REF) == 0
368 ));
369 const DecoratorSet memory_ordering_decorators = decorators & MO_DECORATOR_MASK;
370 STATIC_ASSERT(memory_ordering_decorators == 0 || ( // make sure memory ordering decorators are disjoint if set
371 (memory_ordering_decorators ^ MO_UNORDERED) == 0 ||
372 (memory_ordering_decorators ^ MO_RELAXED) == 0 ||
373 (memory_ordering_decorators ^ MO_ACQUIRE) == 0 ||
374 (memory_ordering_decorators ^ MO_RELEASE) == 0 ||
375 (memory_ordering_decorators ^ MO_SEQ_CST) == 0
376 ));
377 const DecoratorSet location_decorators = decorators & IN_DECORATOR_MASK;
378 STATIC_ASSERT(location_decorators == 0 || ( // make sure location decorators are disjoint if set
379 (location_decorators ^ IN_NATIVE) == 0 ||
380 (location_decorators ^ IN_HEAP) == 0
381 ));
382 }
383
384 #endif // SHARE_OOPS_ACCESS_HPP