1 /*
2 * Copyright (c) 1997, 2026, 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_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 }
60
61 void oopDesc::set_mark(markWord m) {
62 if (UseCompactObjectHeaders) {
63 AtomicAccess::store(reinterpret_cast<uint32_t volatile*>(&_mark), m.value32());
64 } else {
65 AtomicAccess::store(&_mark, m);
66 }
67 }
68
69 void oopDesc::set_mark_full(markWord m) {
70 AtomicAccess::store(&_mark, m);
71 }
72
73 void oopDesc::set_mark(HeapWord* mem, markWord m) {
74 if (UseCompactObjectHeaders) {
75 *(uint32_t*)(((char*)mem) + mark_offset_in_bytes()) = m.value32();
76 } else {
77 *(markWord*)(((char*)mem) + mark_offset_in_bytes()) = m;
78 }
79 }
80
81 void oopDesc::release_set_mark(HeapWord* mem, markWord m) {
82 if (UseCompactObjectHeaders) {
83 AtomicAccess::release_store((uint32_t*)(((char*)mem) + mark_offset_in_bytes()), m.value32());
84 } else {
85 AtomicAccess::release_store((markWord*)(((char*)mem) + mark_offset_in_bytes()), m);
86 }
87 }
88
89 void oopDesc::release_set_mark(markWord m) {
90 if (UseCompactObjectHeaders) {
91 AtomicAccess::release_store(reinterpret_cast<uint32_t volatile*>(&_mark), m.value32());
92 } else {
93 AtomicAccess::release_store(&_mark, m);
94 }
95 }
96
97 markWord oopDesc::cas_set_mark(markWord new_mark, markWord old_mark) {
98 return AtomicAccess::cmpxchg(&_mark, old_mark, new_mark);
99 }
100
101 markWord oopDesc::cas_set_mark(markWord new_mark, markWord old_mark, atomic_memory_order order) {
102 return AtomicAccess::cmpxchg(&_mark, old_mark, new_mark, order);
103 }
104
105 markWord oopDesc::prototype_mark() const {
106 if (UseCompactObjectHeaders) {
107 return klass()->prototype_header();
108 } else {
109 return markWord::prototype();
110 }
111 }
112
113 void oopDesc::init_mark() {
114 set_mark(prototype_mark());
115 }
116
117 void oopDesc::reinit_mark() {
118 if (UseCompactObjectHeaders) {
119 markWord m = prototype_mark().copy_hashctrl_from(mark());
120 assert(m.is_neutral(), "must be neutral");
121 set_mark(m);
122 } else {
123 set_mark(prototype_mark());
124 }
125 }
126
127 Klass* oopDesc::klass() const {
128 switch (ObjLayout::klass_mode()) {
129 case ObjLayout::Compact:
130 return mark().klass();
131 case ObjLayout::Compressed:
132 return CompressedKlassPointers::decode_not_null(_compressed_klass);
133 default:
134 ShouldNotReachHere();
135 }
136 }
137
138 Klass* oopDesc::klass_or_null() const {
139 switch (ObjLayout::klass_mode()) {
140 case ObjLayout::Compact:
141 return mark().klass_or_null();
142 case ObjLayout::Compressed:
143 return CompressedKlassPointers::decode(_compressed_klass);
144 default:
145 ShouldNotReachHere();
146 }
147 }
148
149 Klass* oopDesc::klass_or_null_acquire() const {
150 switch (ObjLayout::klass_mode()) {
151 case ObjLayout::Compact:
152 return mark_acquire().klass();
153 case ObjLayout::Compressed: {
154 narrowKlass narrow_klass = AtomicAccess::load_acquire(&_compressed_klass);
155 return CompressedKlassPointers::decode(narrow_klass);
156 }
157 default:
158 ShouldNotReachHere();
159 }
160 }
161
162 Klass* oopDesc::klass_without_asserts() const {
163 switch (ObjLayout::klass_mode()) {
164 case ObjLayout::Compact:
165 return mark().klass_without_asserts();
166 case ObjLayout::Compressed:
167 return CompressedKlassPointers::decode_without_asserts(_compressed_klass);
168 default:
169 ShouldNotReachHere();
170 }
171 }
172
173 narrowKlass oopDesc::narrow_klass() const {
174 switch (ObjLayout::klass_mode()) {
175 case ObjLayout::Compact:
176 return mark().narrow_klass();
177 case ObjLayout::Compressed:
178 return _compressed_klass;
179 default:
180 ShouldNotReachHere();
181 }
182 }
183
184 void oopDesc::set_klass(Klass* k) {
185 assert(Universe::is_bootstrapping() || (k != nullptr && k->is_klass()), "incorrect Klass");
186 assert(!UseCompactObjectHeaders, "don't set Klass* with compact headers");
187 _compressed_klass = CompressedKlassPointers::encode_not_null(k);
188 }
189
190 void oopDesc::release_set_klass(HeapWord* mem, Klass* k) {
191 assert(Universe::is_bootstrapping() || (k != nullptr && k->is_klass()), "incorrect Klass");
192 assert(!UseCompactObjectHeaders, "don't set Klass* with compact headers");
193 char* raw_mem = ((char*)mem + klass_offset_in_bytes());
194 AtomicAccess::release_store((narrowKlass*)raw_mem, CompressedKlassPointers::encode_not_null(k));
195 }
196
197 void oopDesc::set_klass_gap(HeapWord* mem, int v) {
198 assert(has_klass_gap(), "precondition");
199 *(int*)(((char*)mem) + klass_gap_offset_in_bytes()) = v;
200 }
201
202 bool oopDesc::is_a(Klass* k) const {
203 return klass()->is_subtype_of(k);
204 }
205
206 size_t oopDesc::size_given_mark_and_klass(markWord mrk, const Klass* kls) {
207 size_t sz = base_size_given_klass(mrk, kls);
208 if (UseCompactObjectHeaders) {
209 assert(!mrk.has_displaced_mark_helper(), "must not be displaced");
210 if (mrk.is_expanded() && kls->expand_for_hash(cast_to_oop(this), mrk)) {
211 sz = align_object_size(sz + 1);
212 }
213 }
214 return sz;
215 }
216
217 size_t oopDesc::size_forwarded() {
218 assert(is_forwarded(), "must be forwarded");
219 markWord m = mark();
220 oop fwd = forwardee(m);
221 if (!UseCompactObjectHeaders) {
222 return fwd->size();
223 }
224 markWord fm = fwd->mark();
225 Klass* klass = fm.klass();
226 if (m.is_forward_expanded()) {
227 // Forwardee was expanded during copy but the original was not.
228 // Original must have base size.
229 return fwd->base_size_given_klass(fm, klass);
230 }
231 // Original and copy have same size (whether expanded or not).
232 return fwd->size_given_mark_and_klass(fm, klass);
233 }
234
235 size_t oopDesc::copy_size(size_t size, markWord mark) const {
236 if (UseCompactObjectHeaders) {
237 assert(!mark.has_displaced_mark_helper(), "must not be displaced");
238 Klass* klass = mark.klass();
239 if (mark.is_hashed_not_expanded() && klass->expand_for_hash(cast_to_oop(this), mark)) {
240 size = align_object_size(size + 1);
241 }
242 }
243 assert(is_object_aligned(size), "Oop size is not properly aligned: %zu", size);
244 return size;
245 }
246
247 size_t oopDesc::copy_size_cds(size_t size, markWord mark) const {
248 if (UseCompactObjectHeaders) {
249 assert(!mark.has_displaced_mark_helper(), "must not be displaced");
250 Klass* klass = mark.klass();
251 if (mark.is_not_hashed_expanded()) {
252 assert(klass->expand_for_hash(cast_to_oop(this), mark), "must be?");
253 }
254 if (mark.is_hashed_not_expanded() && klass->expand_for_hash(cast_to_oop(this), mark)) {
255 size = align_object_size(size + 1);
256 }
257 if (mark.is_not_hashed_expanded() && klass->expand_for_hash(cast_to_oop(this), mark)) {
258 size = align_object_size(size - ObjectAlignmentInBytes / HeapWordSize);
259 }
260 }
261 assert(is_object_aligned(size), "Oop size is not properly aligned: %zu", size);
262 return size;
263 }
264
265 size_t oopDesc::size() {
266 return size_given_mark_and_klass(mark(), klass());
267 }
268
269 size_t oopDesc::base_size_given_klass(markWord mrk, const Klass* klass) {
270 int lh = klass->layout_helper();
271 size_t s;
272
273 // lh is now a value computed at class initialization that may hint
274 // at the size. For instances, this is positive and equal to the
275 // size. For arrays, this is negative and provides log2 of the
276 // array element size. For other oops, it is zero and thus requires
277 // a virtual call.
278 //
279 // We go to all this trouble because the size computation is at the
280 // heart of phase 2 of mark-compaction, and called for every object,
281 // alive or dead. So the speed here is equal in importance to the
282 // speed of allocation.
283
284 if (lh > Klass::_lh_neutral_value) {
285 if (!Klass::layout_helper_needs_slow_path(lh)) {
286 s = lh >> LogHeapWordSize; // deliver size scaled by wordSize
287 } else {
288 s = klass->oop_size(this, mrk);
289 }
290 } else if (lh <= Klass::_lh_neutral_value) {
291 // The most common case is instances; fall through if so.
292 if (lh < Klass::_lh_neutral_value) {
293 // Second most common case is arrays. We have to fetch the
294 // length of the array, shift (multiply) it appropriately,
295 // up to wordSize, add the header, and align to object size.
296 size_t size_in_bytes;
297 size_t array_length;
298 #ifdef _LP64
299 if (UseCompactObjectHeaders) {
300 array_length = (size_t) mrk.array_length();
301 } else
302 #endif
303 array_length = (size_t)((arrayOop)this)->length();
304
305 size_in_bytes = array_length << Klass::layout_helper_log2_element_size(lh);
306 size_in_bytes += Klass::layout_helper_header_size(lh);
307
308 // This code could be simplified, but by keeping array_header_in_bytes
309 // in units of bytes and doing it this way we can round up just once,
310 // skipping the intermediate round to HeapWordSize.
311 s = align_up(size_in_bytes, MinObjAlignmentInBytes) / HeapWordSize;
312 if (s != klass->oop_size(this, mrk)) {
313 tty->print_cr("length: %zu", array_length);
314 tty->print_cr("log element size: %d", Klass::layout_helper_log2_element_size(lh));
315 tty->print_cr("is_objArray: %s", BOOL_TO_STR(klass->is_objArray_klass()));
316 }
317 assert(s == klass->oop_size(this, mrk), "wrong array object size, s: %zu, oop_size: %zu", s, klass->oop_size(this, mrk));
318 } else {
319 // Must be zero, so bite the bullet and take the virtual call.
320 s = klass->oop_size(this, mrk);
321 }
322 }
323
324 assert(s > 0, "Oop size must be greater than zero, not %zu", s);
325 assert(is_object_aligned(s), "Oop size is not properly aligned: %zu", s);
326 return s;
327 }
328
329 bool oopDesc::is_instance() const { return klass()->is_instance_klass(); }
330 bool oopDesc::is_instanceRef() const { return klass()->is_reference_instance_klass(); }
331 bool oopDesc::is_stackChunk() const { return klass()->is_stack_chunk_instance_klass(); }
332 bool oopDesc::is_array() const { return klass()->is_array_klass(); }
333 bool oopDesc::is_objArray() const { return klass()->is_objArray_klass(); }
334 bool oopDesc::is_typeArray() const { return klass()->is_typeArray_klass(); }
335
336 template<typename T>
337 T* oopDesc::field_addr(int offset) const { return reinterpret_cast<T*>(cast_from_oop<intptr_t>(as_oop()) + offset); }
338
339 template <typename T>
340 size_t oopDesc::field_offset(T* p) const { return pointer_delta((void*)p, (void*)this, 1); }
341
342 template <DecoratorSet decorators>
343 inline oop oopDesc::obj_field_access(int offset) const { return HeapAccess<decorators>::oop_load_at(as_oop(), offset); }
344 inline oop oopDesc::obj_field(int offset) const { return HeapAccess<>::oop_load_at(as_oop(), offset); }
345
346 inline void oopDesc::obj_field_put(int offset, oop value) { HeapAccess<>::oop_store_at(as_oop(), offset, value); }
347 template <DecoratorSet decorators>
348 inline void oopDesc::obj_field_put_access(int offset, oop value) { HeapAccess<decorators>::oop_store_at(as_oop(), offset, value); }
349
350 inline jbyte oopDesc::byte_field(int offset) const { return *field_addr<jbyte>(offset); }
351 inline void oopDesc::byte_field_put(int offset, jbyte value) { *field_addr<jbyte>(offset) = value; }
352
353 inline jchar oopDesc::char_field(int offset) const { return *field_addr<jchar>(offset); }
354 inline void oopDesc::char_field_put(int offset, jchar value) { *field_addr<jchar>(offset) = value; }
355
356 inline jboolean oopDesc::bool_field(int offset) const { return *field_addr<jboolean>(offset); }
357 inline void oopDesc::bool_field_put(int offset, jboolean value) { *field_addr<jboolean>(offset) = jboolean(value & 1); }
358 inline jboolean oopDesc::bool_field_volatile(int offset) const { return RawAccess<MO_SEQ_CST>::load(field_addr<jboolean>(offset)); }
359 inline void oopDesc::bool_field_put_volatile(int offset, jboolean value) { RawAccess<MO_SEQ_CST>::store(field_addr<jboolean>(offset), jboolean(value & 1)); }
360 inline jshort oopDesc::short_field(int offset) const { return *field_addr<jshort>(offset); }
361 inline void oopDesc::short_field_put(int offset, jshort value) { *field_addr<jshort>(offset) = value; }
362
363 inline jint oopDesc::int_field(int offset) const { return *field_addr<jint>(offset); }
364 inline void oopDesc::int_field_put(int offset, jint value) { *field_addr<jint>(offset) = value; }
365 inline jint oopDesc::int_field_relaxed(int offset) const { return AtomicAccess::load(field_addr<jint>(offset)); }
366 inline void oopDesc::int_field_put_relaxed(int offset, jint value) { AtomicAccess::store(field_addr<jint>(offset), value); }
367
368 inline jlong oopDesc::long_field(int offset) const { return *field_addr<jlong>(offset); }
369 inline void oopDesc::long_field_put(int offset, jlong value) { *field_addr<jlong>(offset) = value; }
370
371 inline jfloat oopDesc::float_field(int offset) const { return *field_addr<jfloat>(offset); }
372 inline void oopDesc::float_field_put(int offset, jfloat value) { *field_addr<jfloat>(offset) = value; }
373
374 inline jdouble oopDesc::double_field(int offset) const { return *field_addr<jdouble>(offset); }
375 inline void oopDesc::double_field_put(int offset, jdouble value) { *field_addr<jdouble>(offset) = value; }
376
377 bool oopDesc::is_locked() const {
378 return mark().is_locked();
379 }
380
381 bool oopDesc::is_unlocked() const {
382 return mark().is_unlocked();
383 }
384
385 bool oopDesc::is_gc_marked() const {
386 return mark().is_marked();
387 }
388
389 // Used by scavengers
390 bool oopDesc::is_forwarded() const {
391 return mark().is_forwarded();
392 }
393
394 bool oopDesc::is_self_forwarded() const {
395 return mark().is_self_forwarded();
396 }
397
398 // Used by scavengers
399 void oopDesc::forward_to(oop p) {
400 assert(cast_from_oop<oopDesc*>(p) != this,
401 "must not be used for self-forwarding, use forward_to_self() instead");
402 markWord m = markWord::encode_pointer_as_mark(p);
403 if (UseCompactObjectHeaders && p->mark().is_expanded() && !mark().is_expanded()) {
404 m = m.set_forward_expanded();
405 }
406 assert(m.decode_pointer() == p, "encoding must be reversible");
407 set_mark_full(m);
408 }
409
410 void oopDesc::forward_to_self() {
411 set_mark(mark().set_self_forwarded());
412 }
413
414 void oopDesc::reset_forwarded() {
415 markWord m = mark();
416 if (m.is_self_forwarded()) {
417 unset_self_forwarded();
418 } else if (m.is_forwarded()) {
419 // Restore Klass* and hash-bits in the header,
420 // for correct iteration.
421 markWord fwd_mark = forwardee()->mark();
422 if (m.is_forward_expanded()) {
423 // Un-expand original object.
424 fwd_mark = fwd_mark.set_hashed_not_expanded();
425 }
426 set_mark_full(fwd_mark);
427 }
428 }
429
430 oop oopDesc::cas_set_forwardee(markWord new_mark, markWord compare, atomic_memory_order order) {
431 markWord old_mark = cas_set_mark(new_mark, compare, order);
432 if (old_mark == compare) {
433 return nullptr;
434 } else {
435 assert(old_mark.is_forwarded(), "must be forwarded here");
436 return forwardee(old_mark);
437 }
438 }
439
440 oop oopDesc::forward_to_atomic(oop p, markWord compare, atomic_memory_order order) {
441 assert(cast_from_oop<oopDesc*>(p) != this,
442 "must not be used for self-forwarding, use forward_to_self_atomic() instead");
443 markWord m = markWord::encode_pointer_as_mark(p);
444 if (UseCompactObjectHeaders && compare.is_hashed_not_expanded()) {
445 m = m.set_forward_expanded();
446 }
447 assert(forwardee(m) == p, "encoding must be reversible");
448 return cas_set_forwardee(m, compare, order);
449 }
450
451 oop oopDesc::forward_to_self_atomic(markWord old_mark, atomic_memory_order order) {
452 markWord new_mark = old_mark.set_self_forwarded();
453 assert(forwardee(new_mark) == cast_to_oop(this), "encoding must be reversible");
454 return cas_set_forwardee(new_mark, old_mark, order);
455 }
456
457 oop oopDesc::forwardee(markWord mark) const {
458 assert(mark.is_forwarded(), "only decode when actually forwarded");
459 if (mark.is_self_forwarded()) {
460 return cast_to_oop(this);
461 } else {
462 return mark.forwardee();
463 }
464 }
465
466 // Note that the forwardee is not the same thing as the displaced_mark.
467 // The forwardee is used when copying during scavenge and mark-sweep.
468 // It does need to clear the low two locking- and GC-related bits.
469 oop oopDesc::forwardee() const {
470 return forwardee(mark());
471 }
472
473 void oopDesc::unset_self_forwarded() {
474 set_mark(mark().unset_self_forwarded());
475 }
476
477 // The following method needs to be MT safe.
478 uint oopDesc::age() const {
479 markWord m = mark();
480 assert(!m.is_marked(), "Attempt to read age from forwarded mark");
481 if (m.has_displaced_mark_helper()) {
482 return m.displaced_mark_helper().age();
483 } else {
484 return m.age();
485 }
486 }
487
488 void oopDesc::incr_age() {
489 markWord m = mark();
490 assert(!m.is_marked(), "Attempt to increment age of forwarded mark");
491 if (m.has_displaced_mark_helper()) {
492 m.set_displaced_mark_helper(m.displaced_mark_helper().incr_age());
493 } else {
494 set_mark(m.incr_age());
495 }
496 }
497
498 template <typename OopClosureType>
499 void oopDesc::oop_iterate(OopClosureType* cl) {
500 OopIteratorClosureDispatch::oop_oop_iterate(cl, this, klass());
501 }
502
503 template <typename OopClosureType>
504 void oopDesc::oop_iterate(OopClosureType* cl, MemRegion mr) {
505 OopIteratorClosureDispatch::oop_oop_iterate(cl, this, klass(), mr);
506 }
507
508 template <typename OopClosureType>
509 size_t oopDesc::oop_iterate_size(OopClosureType* cl) {
510 Klass* k = klass();
511 size_t size = size_given_mark_and_klass(mark(), k);
512 OopIteratorClosureDispatch::oop_oop_iterate(cl, this, k);
513 return size;
514 }
515
516 template <typename OopClosureType>
517 size_t oopDesc::oop_iterate_size(OopClosureType* cl, MemRegion mr) {
518 Klass* k = klass();
519 size_t size = size_given_mark_and_klass(mark(), k);
520 OopIteratorClosureDispatch::oop_oop_iterate(cl, this, k, mr);
521 return size;
522 }
523
524 template <typename OopClosureType>
525 void oopDesc::oop_iterate_backwards(OopClosureType* cl) {
526 oop_iterate_backwards(cl, klass());
527 }
528
529 template <typename OopClosureType>
530 void oopDesc::oop_iterate_backwards(OopClosureType* cl, Klass* k) {
531 // In this assert, we cannot safely access the Klass* with compact headers.
532 assert(k == klass(), "wrong klass");
533 OopIteratorClosureDispatch::oop_oop_iterate_backwards(cl, this, k);
534 }
535
536 bool oopDesc::is_instanceof_or_null(oop obj, Klass* klass) {
537 return obj == nullptr || obj->klass()->is_subtype_of(klass);
538 }
539
540 intptr_t oopDesc::identity_hash() {
541 // Fast case; if the object is unlocked and the hash value is set, no locking is needed
542 // Note: The mark must be read into local variable to avoid concurrent updates.
543 if (UseCompactObjectHeaders) {
544 markWord mrk = mark();
545 if (mrk.is_hashed_expanded()) {
546 Klass* klass = mrk.klass();
547 return int_field(klass->hash_offset_in_bytes(cast_to_oop(this), mrk));
548 }
549 // Fall-through to slow-case.
550 } else {
551 markWord mrk = mark();
552 if (mrk.is_unlocked() && !mrk.has_no_hash()) {
553 return mrk.hash();
554 } else if (mrk.is_marked()) {
555 return mrk.hash();
556 }
557 // Fall-through to slow-case.
558 }
559 return slow_identity_hash();
560 }
561
562 // This checks fast simple case of whether the oop has_no_hash,
563 // to optimize JVMTI table lookup.
564 bool oopDesc::fast_no_hash_check() {
565 markWord mrk = mark_acquire();
566 assert(!mrk.is_marked(), "should never be marked");
567 return (UseCompactObjectHeaders || mrk.is_unlocked()) && mrk.has_no_hash();
568 }
569
570 bool oopDesc::has_displaced_mark() const {
571 return mark().has_displaced_mark_helper();
572 }
573
574 markWord oopDesc::displaced_mark() const {
575 return mark().displaced_mark_helper();
576 }
577
578 void oopDesc::set_displaced_mark(markWord m) {
579 mark().set_displaced_mark_helper(m);
580 }
581
582 bool oopDesc::mark_must_be_preserved() const {
583 return mark_must_be_preserved(mark());
584 }
585
586 bool oopDesc::mark_must_be_preserved(markWord m) const {
587 return m.must_be_preserved();
588 }
589
590 inline void oopDesc::initialize_hash_if_necessary(oop obj) {
591 if (!UseCompactObjectHeaders) {
592 return;
593 }
594 markWord m = mark();
595 assert(!m.has_displaced_mark_helper(), "must not be displaced header");
596 if (m.is_hashed_not_expanded()) {
597 set_mark(initialize_hash_if_necessary(obj, m.klass(), m));
598 }
599 }
600
601
602 #endif // SHARE_OOPS_OOP_INLINE_HPP