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_OOP_INLINE_HPP
26 #define SHARE_OOPS_OOP_INLINE_HPP
27
28 #include "oops/oop.hpp"
29
30 #include "memory/iterator.inline.hpp"
31 #include "memory/universe.hpp"
32 #include "oops/access.inline.hpp"
33 #include "oops/arrayKlass.hpp"
34 #include "oops/arrayOop.hpp"
35 #include "oops/compressedKlass.inline.hpp"
36 #include "oops/instanceKlass.hpp"
37 #include "oops/markWord.inline.hpp"
38 #include "oops/objLayout.inline.hpp"
39 #include "oops/oopsHierarchy.hpp"
40 #include "runtime/atomicAccess.hpp"
41 #include "runtime/globals.hpp"
42 #include "utilities/align.hpp"
43 #include "utilities/debug.hpp"
44 #include "utilities/globalDefinitions.hpp"
45 #include "utilities/macros.hpp"
46
47 // Implementation of all inlined member functions defined in oop.hpp
48 // We need a separate file to avoid circular references
49
50 void* oopDesc::base_addr() { return this; }
51 const void* oopDesc::base_addr() const { return this; }
52
53 markWord oopDesc::mark() const {
54 return AtomicAccess::load(&_mark);
55 }
56
57 markWord oopDesc::mark_acquire() const {
58 return AtomicAccess::load_acquire(&_mark);
59 }
66 *(markWord*)(((char*)mem) + mark_offset_in_bytes()) = m;
67 }
68
69 void oopDesc::release_set_mark(HeapWord* mem, markWord m) {
70 AtomicAccess::release_store((markWord*)(((char*)mem) + mark_offset_in_bytes()), m);
71 }
72
73 void oopDesc::release_set_mark(markWord m) {
74 AtomicAccess::release_store(&_mark, m);
75 }
76
77 markWord oopDesc::cas_set_mark(markWord new_mark, markWord old_mark) {
78 return AtomicAccess::cmpxchg(&_mark, old_mark, new_mark);
79 }
80
81 markWord oopDesc::cas_set_mark(markWord new_mark, markWord old_mark, atomic_memory_order order) {
82 return AtomicAccess::cmpxchg(&_mark, old_mark, new_mark, order);
83 }
84
85 markWord oopDesc::prototype_mark() const {
86 if (UseCompactObjectHeaders) {
87 return klass()->prototype_header();
88 } else {
89 return markWord::prototype();
90 }
91 }
92
93 void oopDesc::init_mark() {
94 set_mark(prototype_mark());
95 }
96
97 Klass* oopDesc::klass() const {
98 switch (ObjLayout::klass_mode()) {
99 case ObjLayout::Compact:
100 return mark().klass();
101 case ObjLayout::Compressed:
102 return CompressedKlassPointers::decode_not_null(_metadata._compressed_klass);
103 default:
104 return _metadata._klass;
105 }
106 }
218 size_in_bytes = array_length << Klass::layout_helper_log2_element_size(lh);
219 size_in_bytes += Klass::layout_helper_header_size(lh);
220
221 // This code could be simplified, but by keeping array_header_in_bytes
222 // in units of bytes and doing it this way we can round up just once,
223 // skipping the intermediate round to HeapWordSize.
224 s = align_up(size_in_bytes, MinObjAlignmentInBytes) / HeapWordSize;
225
226 assert(s == klass->oop_size(this), "wrong array object size");
227 } else {
228 // Must be zero, so bite the bullet and take the virtual call.
229 s = klass->oop_size(this);
230 }
231 }
232
233 assert(s > 0, "Oop size must be greater than zero, not %zu", s);
234 assert(is_object_aligned(s), "Oop size is not properly aligned: %zu", s);
235 return s;
236 }
237
238 bool oopDesc::is_instance() const { return klass()->is_instance_klass(); }
239 bool oopDesc::is_instanceRef() const { return klass()->is_reference_instance_klass(); }
240 bool oopDesc::is_stackChunk() const { return klass()->is_stack_chunk_instance_klass(); }
241 bool oopDesc::is_array() const { return klass()->is_array_klass(); }
242 bool oopDesc::is_objArray() const { return klass()->is_objArray_klass(); }
243 bool oopDesc::is_typeArray() const { return klass()->is_typeArray_klass(); }
244
245 template<typename T>
246 T* oopDesc::field_addr(int offset) const { return reinterpret_cast<T*>(cast_from_oop<intptr_t>(as_oop()) + offset); }
247
248 template <typename T>
249 size_t oopDesc::field_offset(T* p) const { return pointer_delta((void*)p, (void*)this, 1); }
250
251 template <DecoratorSet decorators>
252 inline oop oopDesc::obj_field_access(int offset) const { return HeapAccess<decorators>::oop_load_at(as_oop(), offset); }
253 inline oop oopDesc::obj_field(int offset) const { return HeapAccess<>::oop_load_at(as_oop(), offset); }
254
255 inline void oopDesc::obj_field_put(int offset, oop value) { HeapAccess<>::oop_store_at(as_oop(), offset, value); }
256 template <DecoratorSet decorators>
257 inline void oopDesc::obj_field_put_access(int offset, oop value) { HeapAccess<decorators>::oop_store_at(as_oop(), offset, value); }
258
259 inline jbyte oopDesc::byte_field(int offset) const { return *field_addr<jbyte>(offset); }
260 inline void oopDesc::byte_field_put(int offset, jbyte value) { *field_addr<jbyte>(offset) = value; }
261
262 inline jchar oopDesc::char_field(int offset) const { return *field_addr<jchar>(offset); }
263 inline void oopDesc::char_field_put(int offset, jchar value) { *field_addr<jchar>(offset) = value; }
|
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_OOP_INLINE_HPP
26 #define SHARE_OOPS_OOP_INLINE_HPP
27
28 #include "oops/oop.hpp"
29
30 #include "memory/iterator.inline.hpp"
31 #include "memory/universe.hpp"
32 #include "oops/access.inline.hpp"
33 #include "oops/arrayKlass.hpp"
34 #include "oops/arrayOop.hpp"
35 #include "oops/compressedKlass.inline.hpp"
36 #include "oops/flatArrayKlass.hpp"
37 #include "oops/instanceKlass.hpp"
38 #include "oops/markWord.inline.hpp"
39 #include "oops/objLayout.inline.hpp"
40 #include "oops/oopsHierarchy.hpp"
41 #include "runtime/arguments.hpp"
42 #include "runtime/atomicAccess.hpp"
43 #include "runtime/globals.hpp"
44 #include "utilities/align.hpp"
45 #include "utilities/debug.hpp"
46 #include "utilities/globalDefinitions.hpp"
47 #include "utilities/macros.hpp"
48
49 // Implementation of all inlined member functions defined in oop.hpp
50 // We need a separate file to avoid circular references
51
52 void* oopDesc::base_addr() { return this; }
53 const void* oopDesc::base_addr() const { return this; }
54
55 markWord oopDesc::mark() const {
56 return AtomicAccess::load(&_mark);
57 }
58
59 markWord oopDesc::mark_acquire() const {
60 return AtomicAccess::load_acquire(&_mark);
61 }
68 *(markWord*)(((char*)mem) + mark_offset_in_bytes()) = m;
69 }
70
71 void oopDesc::release_set_mark(HeapWord* mem, markWord m) {
72 AtomicAccess::release_store((markWord*)(((char*)mem) + mark_offset_in_bytes()), m);
73 }
74
75 void oopDesc::release_set_mark(markWord m) {
76 AtomicAccess::release_store(&_mark, m);
77 }
78
79 markWord oopDesc::cas_set_mark(markWord new_mark, markWord old_mark) {
80 return AtomicAccess::cmpxchg(&_mark, old_mark, new_mark);
81 }
82
83 markWord oopDesc::cas_set_mark(markWord new_mark, markWord old_mark, atomic_memory_order order) {
84 return AtomicAccess::cmpxchg(&_mark, old_mark, new_mark, order);
85 }
86
87 markWord oopDesc::prototype_mark() const {
88 if (UseCompactObjectHeaders || Arguments::is_valhalla_enabled()) {
89 return klass()->prototype_header();
90 } else {
91 return markWord::prototype();
92 }
93 }
94
95 void oopDesc::init_mark() {
96 set_mark(prototype_mark());
97 }
98
99 Klass* oopDesc::klass() const {
100 switch (ObjLayout::klass_mode()) {
101 case ObjLayout::Compact:
102 return mark().klass();
103 case ObjLayout::Compressed:
104 return CompressedKlassPointers::decode_not_null(_metadata._compressed_klass);
105 default:
106 return _metadata._klass;
107 }
108 }
220 size_in_bytes = array_length << Klass::layout_helper_log2_element_size(lh);
221 size_in_bytes += Klass::layout_helper_header_size(lh);
222
223 // This code could be simplified, but by keeping array_header_in_bytes
224 // in units of bytes and doing it this way we can round up just once,
225 // skipping the intermediate round to HeapWordSize.
226 s = align_up(size_in_bytes, MinObjAlignmentInBytes) / HeapWordSize;
227
228 assert(s == klass->oop_size(this), "wrong array object size");
229 } else {
230 // Must be zero, so bite the bullet and take the virtual call.
231 s = klass->oop_size(this);
232 }
233 }
234
235 assert(s > 0, "Oop size must be greater than zero, not %zu", s);
236 assert(is_object_aligned(s), "Oop size is not properly aligned: %zu", s);
237 return s;
238 }
239
240 bool oopDesc::is_instance() const { return klass()->is_instance_klass(); }
241 bool oopDesc::is_inline() const { return klass()->is_inline_klass(); }
242 bool oopDesc::is_instanceRef() const { return klass()->is_reference_instance_klass(); }
243 bool oopDesc::is_stackChunk() const { return klass()->is_stack_chunk_instance_klass(); }
244 bool oopDesc::is_array() const { return klass()->is_array_klass(); }
245 bool oopDesc::is_objArray() const { return klass()->is_objArray_klass(); }
246 bool oopDesc::is_refArray() const { return klass()->is_refArray_klass(); }
247 bool oopDesc::is_typeArray() const { return klass()->is_typeArray_klass(); }
248 bool oopDesc::is_refined_objArray() const { return klass()->is_refined_objArray_klass(); }
249
250 bool oopDesc::is_array_with_oops() const {
251 if (!is_objArray()) {
252 return false;
253 }
254
255 assert(is_refined_objArray(), "Must be");
256 return is_refArray() || FlatArrayKlass::cast(klass())->contains_oops();
257 }
258
259 bool oopDesc::is_inline_type() const { return mark().is_inline_type(); }
260 #ifdef _LP64
261 bool oopDesc::is_flatArray() const {
262 markWord mrk = mark();
263 return (mrk.is_unlocked()) ? mrk.is_flat_array() : klass()->is_flatArray_klass();
264 }
265 bool oopDesc::is_null_free_array() const {
266 markWord mrk = mark();
267 return (mrk.is_unlocked()) ? mrk.is_null_free_array() : klass()->is_null_free_array_klass();
268 }
269 #else
270 bool oopDesc::is_flatArray() const { return klass()->is_flatArray_klass(); }
271 bool oopDesc::is_null_free_array() const { return klass()->is_null_free_array_klass(); }
272 #endif
273
274 template<typename T>
275 T* oopDesc::field_addr(int offset) const { return reinterpret_cast<T*>(cast_from_oop<intptr_t>(as_oop()) + offset); }
276
277 template <typename T>
278 size_t oopDesc::field_offset(T* p) const { return pointer_delta((void*)p, (void*)this, 1); }
279
280 template <DecoratorSet decorators>
281 inline oop oopDesc::obj_field_access(int offset) const { return HeapAccess<decorators>::oop_load_at(as_oop(), offset); }
282 inline oop oopDesc::obj_field(int offset) const { return HeapAccess<>::oop_load_at(as_oop(), offset); }
283
284 inline void oopDesc::obj_field_put(int offset, oop value) { HeapAccess<>::oop_store_at(as_oop(), offset, value); }
285 template <DecoratorSet decorators>
286 inline void oopDesc::obj_field_put_access(int offset, oop value) { HeapAccess<decorators>::oop_store_at(as_oop(), offset, value); }
287
288 inline jbyte oopDesc::byte_field(int offset) const { return *field_addr<jbyte>(offset); }
289 inline void oopDesc::byte_field_put(int offset, jbyte value) { *field_addr<jbyte>(offset) = value; }
290
291 inline jchar oopDesc::char_field(int offset) const { return *field_addr<jchar>(offset); }
292 inline void oopDesc::char_field_put(int offset, jchar value) { *field_addr<jchar>(offset) = value; }
|