1 /*
2 * Copyright (c) 1997, 2018, 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_VM_OOPS_OOP_INLINE_HPP
26 #define SHARE_VM_OOPS_OOP_INLINE_HPP
27
28 #include "gc/shared/ageTable.hpp"
29 #include "gc/shared/collectedHeap.inline.hpp"
30 #include "gc/shared/genCollectedHeap.hpp"
31 #include "gc/shared/generation.hpp"
32 #include "memory/vtBuffer.hpp"
33 #include "oops/access.inline.hpp"
34 #include "oops/arrayKlass.hpp"
35 #include "oops/arrayOop.hpp"
36 #include "oops/klass.inline.hpp"
37 #include "oops/markOop.inline.hpp"
38 #include "oops/oop.hpp"
39 #include "runtime/atomic.hpp"
40 #include "runtime/orderAccess.inline.hpp"
41 #include "runtime/os.hpp"
42 #include "utilities/align.hpp"
43 #include "utilities/macros.hpp"
44
45 // Implementation of all inlined member functions defined in oop.hpp
46 // We need a separate file to avoid circular references
47
48 void oopDesc::release_set_mark(markOop m) {
49 OrderAccess::release_store(&_mark, m);
50 }
51
52 markOop oopDesc::cas_set_mark(markOop new_mark, markOop old_mark) {
53 return Atomic::cmpxchg(new_mark, &_mark, old_mark);
54 }
55
56 void oopDesc::init_mark() {
57 set_mark(markOopDesc::prototype_for_object(this));
58 }
59
60 Klass* oopDesc::klass() const {
61 if (UseCompressedClassPointers) {
62 return Klass::decode_klass_not_null(_metadata._compressed_klass);
63 } else {
64 return _metadata._klass;
65 }
66 }
67
68 Klass* oopDesc::klass_or_null() const volatile {
69 if (UseCompressedClassPointers) {
70 return Klass::decode_klass(_metadata._compressed_klass);
71 } else {
72 return _metadata._klass;
73 }
74 }
75
76 Klass* oopDesc::klass_or_null_acquire() const volatile {
77 if (UseCompressedClassPointers) {
78 // Workaround for non-const load_acquire parameter.
79 const volatile narrowKlass* addr = &_metadata._compressed_klass;
80 volatile narrowKlass* xaddr = const_cast<volatile narrowKlass*>(addr);
81 return Klass::decode_klass(OrderAccess::load_acquire(xaddr));
82 } else {
83 return OrderAccess::load_acquire(&_metadata._klass);
84 }
85 }
86
87 Klass** oopDesc::klass_addr() {
88 // Only used internally and with CMS and will not work with
89 // UseCompressedOops
90 assert(!UseCompressedClassPointers, "only supported with uncompressed klass pointers");
91 return (Klass**) &_metadata._klass;
92 }
93
94 narrowKlass* oopDesc::compressed_klass_addr() {
95 assert(UseCompressedClassPointers, "only called by compressed klass pointers");
96 return &_metadata._compressed_klass;
97 }
98
99 #define CHECK_SET_KLASS(k) \
100 do { \
101 assert(Universe::is_bootstrapping() || k != NULL, "NULL Klass"); \
102 assert(Universe::is_bootstrapping() || k->is_klass(), "not a Klass"); \
103 } while (0)
104
105 void oopDesc::set_klass(Klass* k) {
106 CHECK_SET_KLASS(k);
107 if (UseCompressedClassPointers) {
108 *compressed_klass_addr() = Klass::encode_klass_not_null(k);
109 } else {
110 *klass_addr() = k;
111 }
112 }
113
114 void oopDesc::release_set_klass(Klass* k) {
115 CHECK_SET_KLASS(k);
116 if (UseCompressedClassPointers) {
117 OrderAccess::release_store(compressed_klass_addr(),
118 Klass::encode_klass_not_null(k));
119 } else {
120 OrderAccess::release_store(klass_addr(), k);
121 }
122 }
123
124 #undef CHECK_SET_KLASS
125
126 int oopDesc::klass_gap() const {
127 return *(int*)(((intptr_t)this) + klass_gap_offset_in_bytes());
128 }
129
130 void oopDesc::set_klass_gap(int v) {
131 if (UseCompressedClassPointers) {
132 *(int*)(((intptr_t)this) + klass_gap_offset_in_bytes()) = v;
133 }
134 }
135
136 void oopDesc::set_klass_to_list_ptr(oop k) {
137 // This is only to be used during GC, for from-space objects, so no
138 // barrier is needed.
139 if (UseCompressedClassPointers) {
140 _metadata._compressed_klass = (narrowKlass)encode_heap_oop(k); // may be null (parnew overflow handling)
141 } else {
142 _metadata._klass = (Klass*)(address)k;
143 }
144 }
145
146 oop oopDesc::list_ptr_from_klass() {
147 // This is only to be used during GC, for from-space objects.
148 if (UseCompressedClassPointers) {
149 return decode_heap_oop((narrowOop)_metadata._compressed_klass);
150 } else {
151 // Special case for GC
152 return (oop)(address)_metadata._klass;
153 }
154 }
155
156 bool oopDesc::is_a(Klass* k) const {
157 return klass()->is_subtype_of(k);
158 }
159
160 int oopDesc::size() {
161 return size_given_klass(klass());
162 }
163
164 int oopDesc::size_given_klass(Klass* klass) {
165 int lh = klass->layout_helper();
166 int s;
167
168 // lh is now a value computed at class initialization that may hint
169 // at the size. For instances, this is positive and equal to the
170 // size. For arrays, this is negative and provides log2 of the
171 // array element size. For other oops, it is zero and thus requires
172 // a virtual call.
173 //
174 // We go to all this trouble because the size computation is at the
175 // heart of phase 2 of mark-compaction, and called for every object,
176 // alive or dead. So the speed here is equal in importance to the
177 // speed of allocation.
178
179 if (lh > Klass::_lh_neutral_value) {
180 if (!Klass::layout_helper_needs_slow_path(lh)) {
181 s = lh >> LogHeapWordSize; // deliver size scaled by wordSize
182 } else {
183 s = klass->oop_size(this);
184 }
185 } else if (lh <= Klass::_lh_neutral_value) {
186 // The most common case is instances; fall through if so.
187 if (lh < Klass::_lh_neutral_value) {
188 // Second most common case is arrays. We have to fetch the
189 // length of the array, shift (multiply) it appropriately,
190 // up to wordSize, add the header, and align to object size.
191 size_t size_in_bytes;
192 size_t array_length = (size_t) ((arrayOop)this)->length();
193 size_in_bytes = array_length << Klass::layout_helper_log2_element_size(lh);
194 size_in_bytes += Klass::layout_helper_header_size(lh);
195
196 // This code could be simplified, but by keeping array_header_in_bytes
197 // in units of bytes and doing it this way we can round up just once,
198 // skipping the intermediate round to HeapWordSize.
199 s = (int)(align_up(size_in_bytes, MinObjAlignmentInBytes) / HeapWordSize);
200
201 // ParNew (used by CMS), UseParallelGC and UseG1GC can change the length field
202 // of an "old copy" of an object array in the young gen so it indicates
203 // the grey portion of an already copied array. This will cause the first
204 // disjunct below to fail if the two comparands are computed across such
205 // a concurrent change.
206 // ParNew also runs with promotion labs (which look like int
207 // filler arrays) which are subject to changing their declared size
208 // when finally retiring a PLAB; this also can cause the first disjunct
209 // to fail for another worker thread that is concurrently walking the block
210 // offset table. Both these invariant failures are benign for their
211 // current uses; we relax the assertion checking to cover these two cases below:
212 // is_objArray() && is_forwarded() // covers first scenario above
213 // || is_typeArray() // covers second scenario above
214 // If and when UseParallelGC uses the same obj array oop stealing/chunking
215 // technique, we will need to suitably modify the assertion.
216 assert((s == klass->oop_size(this)) ||
217 (Universe::heap()->is_gc_active() &&
218 ((is_typeArray() && UseConcMarkSweepGC) ||
219 (is_objArray() && is_forwarded() && (UseConcMarkSweepGC || UseParallelGC || UseG1GC)))),
220 "wrong array object size");
221 } else {
222 // Must be zero, so bite the bullet and take the virtual call.
223 s = klass->oop_size(this);
224 }
225 }
226
227 assert(s > 0, "Oop size must be greater than zero, not %d", s);
228 assert(is_object_aligned(s), "Oop size is not properly aligned: %d", s);
229 return s;
230 }
231
232 bool oopDesc::is_instance() const { return klass()->is_instance_klass(); }
233 bool oopDesc::is_array() const { return klass()->is_array_klass(); }
234 bool oopDesc::is_objArray() const { return klass()->is_objArray_klass(); }
235 bool oopDesc::is_typeArray() const { return klass()->is_typeArray_klass(); }
236 bool oopDesc::is_value() const { return klass()->is_value(); }
237 bool oopDesc::is_valueArray() const { return klass()->is_valueArray_klass(); }
238
239 void* oopDesc::field_addr_raw(int offset) const { return reinterpret_cast<void*>(cast_from_oop<intptr_t>(as_oop()) + offset); }
240 void* oopDesc::field_addr(int offset) const { return Access<>::resolve(as_oop())->field_addr_raw(offset); }
241
242 template <class T>
243 T* oopDesc::obj_field_addr_raw(int offset) const { return (T*) field_addr_raw(offset); }
244
245 // Functions for getting and setting oops within instance objects.
246 // If the oops are compressed, the type passed to these overloaded functions
247 // is narrowOop. All functions are overloaded so they can be called by
248 // template functions without conditionals (the compiler instantiates via
249 // the right type and inlines the appopriate code).
250
251 // Algorithm for encoding and decoding oops from 64 bit pointers to 32 bit
252 // offset from the heap base. Saving the check for null can save instructions
253 // in inner GC loops so these are separated.
254
255 inline bool check_obj_alignment(oop obj) {
256 return (cast_from_oop<intptr_t>(obj) & MinObjAlignmentInBytesMask) == 0;
257 }
258
259 oop oopDesc::decode_heap_oop_not_null(narrowOop v) {
260 assert(!is_null(v), "narrow oop value can never be zero");
261 address base = Universe::narrow_oop_base();
262 int shift = Universe::narrow_oop_shift();
263 oop result = (oop)(void*)((uintptr_t)base + ((uintptr_t)v << shift));
264 assert(check_obj_alignment(result), "address not aligned: " INTPTR_FORMAT, p2i((void*) result));
265 return result;
266 }
267
268 oop oopDesc::decode_heap_oop(narrowOop v) {
269 return is_null(v) ? (oop)NULL : decode_heap_oop_not_null(v);
270 }
271
272 narrowOop oopDesc::encode_heap_oop_not_null(oop v) {
273 assert(!is_null(v), "oop value can never be zero");
274 assert(check_obj_alignment(v), "Address not aligned");
275 assert(Universe::heap()->is_in_reserved(v), "Address not in heap");
276 address base = Universe::narrow_oop_base();
277 int shift = Universe::narrow_oop_shift();
278 uint64_t pd = (uint64_t)(pointer_delta((void*)v, (void*)base, 1));
279 assert(OopEncodingHeapMax > pd, "change encoding max if new encoding");
280 uint64_t result = pd >> shift;
281 assert((result & CONST64(0xffffffff00000000)) == 0, "narrow oop overflow");
282 assert(decode_heap_oop(result) == v, "reversibility");
283 return (narrowOop)result;
284 }
285
286 narrowOop oopDesc::encode_heap_oop(oop v) {
287 return (is_null(v)) ? (narrowOop)0 : encode_heap_oop_not_null(v);
288 }
289
290 narrowOop oopDesc::load_heap_oop(narrowOop* p) { return *p; }
291 oop oopDesc::load_heap_oop(oop* p) { return *p; }
292
293 void oopDesc::store_heap_oop(narrowOop* p, narrowOop v) { *p = v; }
294 void oopDesc::store_heap_oop(oop* p, oop v) { *p = v; }
295
296 // Load and decode an oop out of the Java heap into a wide oop.
297 oop oopDesc::load_decode_heap_oop_not_null(narrowOop* p) {
298 return decode_heap_oop_not_null(load_heap_oop(p));
299 }
300
301 // Load and decode an oop out of the heap accepting null
302 oop oopDesc::load_decode_heap_oop(narrowOop* p) {
303 return decode_heap_oop(load_heap_oop(p));
304 }
305
306 oop oopDesc::load_decode_heap_oop_not_null(oop* p) { return *p; }
307 oop oopDesc::load_decode_heap_oop(oop* p) { return *p; }
308
309 void oopDesc::encode_store_heap_oop_not_null(oop* p, oop v) { *p = v; }
310 void oopDesc::encode_store_heap_oop(oop* p, oop v) { *p = v; }
311
312 // Encode and store a heap oop.
313 void oopDesc::encode_store_heap_oop_not_null(narrowOop* p, oop v) {
314 *p = encode_heap_oop_not_null(v);
315 }
316
317 // Encode and store a heap oop allowing for null.
318 void oopDesc::encode_store_heap_oop(narrowOop* p, oop v) {
319 *p = encode_heap_oop(v);
320 }
321
322 template <DecoratorSet decorators>
323 inline oop oopDesc::obj_field_access(int offset) const { return HeapAccess<decorators>::oop_load_at(as_oop(), offset); }
324 inline oop oopDesc::obj_field(int offset) const { return HeapAccess<>::oop_load_at(as_oop(), offset); }
325
326 inline void oopDesc::obj_field_put(int offset, oop value) { HeapAccess<>::oop_store_at(as_oop(), offset, value); }
327
328 inline jbyte oopDesc::byte_field(int offset) const { return HeapAccess<>::load_at(as_oop(), offset); }
329 inline void oopDesc::byte_field_put(int offset, jbyte value) { HeapAccess<>::store_at(as_oop(), offset, value); }
330
331 inline jchar oopDesc::char_field(int offset) const { return HeapAccess<>::load_at(as_oop(), offset); }
332 inline void oopDesc::char_field_put(int offset, jchar value) { HeapAccess<>::store_at(as_oop(), offset, value); }
333
334 inline jboolean oopDesc::bool_field(int offset) const { return HeapAccess<>::load_at(as_oop(), offset); }
335 inline void oopDesc::bool_field_put(int offset, jboolean value) { HeapAccess<>::store_at(as_oop(), offset, jboolean(value & 1)); }
336
337 inline jshort oopDesc::short_field(int offset) const { return HeapAccess<>::load_at(as_oop(), offset); }
338 inline void oopDesc::short_field_put(int offset, jshort value) { HeapAccess<>::store_at(as_oop(), offset, value); }
339
340 inline jint oopDesc::int_field(int offset) const { return HeapAccess<>::load_at(as_oop(), offset); }
341 inline void oopDesc::int_field_put(int offset, jint value) { HeapAccess<>::store_at(as_oop(), offset, value); }
342
343 inline jlong oopDesc::long_field(int offset) const { return HeapAccess<>::load_at(as_oop(), offset); }
344 inline void oopDesc::long_field_put(int offset, jlong value) { HeapAccess<>::store_at(as_oop(), offset, value); }
345
346 inline jfloat oopDesc::float_field(int offset) const { return HeapAccess<>::load_at(as_oop(), offset); }
347 inline void oopDesc::float_field_put(int offset, jfloat value) { HeapAccess<>::store_at(as_oop(), offset, value); }
348
349 inline jdouble oopDesc::double_field(int offset) const { return HeapAccess<>::load_at(as_oop(), offset); }
350 inline void oopDesc::double_field_put(int offset, jdouble value) { HeapAccess<>::store_at(as_oop(), offset, value); }
351
352 bool oopDesc::is_locked() const {
353 return mark()->is_locked();
354 }
355
356 bool oopDesc::is_unlocked() const {
357 return mark()->is_unlocked();
358 }
359
360 bool oopDesc::has_bias_pattern() const {
361 return mark()->has_bias_pattern();
362 }
363
364
365 // Used only for markSweep, scavenging
366 bool oopDesc::is_gc_marked() const {
367 return mark()->is_marked();
368 }
369
370 bool oopDesc::is_scavengable() const {
371 return Universe::heap()->is_scavengable(oop(const_cast<oopDesc*>(this)));
372 }
373
374 // Used by scavengers
375 bool oopDesc::is_forwarded() const {
376 // The extra heap check is needed since the obj might be locked, in which case the
377 // mark would point to a stack location and have the sentinel bit cleared
378 return mark()->is_marked();
379 }
380
381 // Used by scavengers
382 void oopDesc::forward_to(oop p) {
383 assert(check_obj_alignment(p),
384 "forwarding to something not aligned");
385 assert(Universe::heap()->is_in_reserved(p),
386 "forwarding to something not in heap");
387 assert(!is_archive_object(oop(this)) &&
388 !is_archive_object(p),
389 "forwarding archive object");
390 markOop m = markOopDesc::encode_pointer_as_mark(p);
391 assert(m->decode_pointer() == p, "encoding must be reversable");
392 set_mark(m);
393 }
394
395 // Used by parallel scavengers
396 bool oopDesc::cas_forward_to(oop p, markOop compare) {
397 assert(check_obj_alignment(p),
398 "forwarding to something not aligned");
399 assert(Universe::heap()->is_in_reserved(p),
400 "forwarding to something not in heap");
401 markOop m = markOopDesc::encode_pointer_as_mark(p);
402 assert(m->decode_pointer() == p, "encoding must be reversable");
403 return cas_set_mark(m, compare) == compare;
404 }
405
406 #if INCLUDE_ALL_GCS
407 oop oopDesc::forward_to_atomic(oop p) {
408 markOop oldMark = mark();
409 markOop forwardPtrMark = markOopDesc::encode_pointer_as_mark(p);
410 markOop curMark;
411
412 assert(forwardPtrMark->decode_pointer() == p, "encoding must be reversable");
413 assert(sizeof(markOop) == sizeof(intptr_t), "CAS below requires this.");
414
415 while (!oldMark->is_marked()) {
416 curMark = Atomic::cmpxchg(forwardPtrMark, &_mark, oldMark);
417 assert(is_forwarded(), "object should have been forwarded");
418 if (curMark == oldMark) {
419 return NULL;
420 }
421 // If the CAS was unsuccessful then curMark->is_marked()
422 // should return true as another thread has CAS'd in another
423 // forwarding pointer.
424 oldMark = curMark;
425 }
426 return forwardee();
427 }
428 #endif
429
430 // Note that the forwardee is not the same thing as the displaced_mark.
431 // The forwardee is used when copying during scavenge and mark-sweep.
432 // It does need to clear the low two locking- and GC-related bits.
433 oop oopDesc::forwardee() const {
434 return (oop) mark()->decode_pointer();
435 }
436
437 // The following method needs to be MT safe.
438 uint oopDesc::age() const {
439 assert(!is_forwarded(), "Attempt to read age from forwarded mark");
440 if (has_displaced_mark()) {
441 return displaced_mark()->age();
442 } else {
443 return mark()->age();
444 }
445 }
446
447 void oopDesc::incr_age() {
448 assert(!is_forwarded(), "Attempt to increment age of forwarded mark");
449 if (has_displaced_mark()) {
450 set_displaced_mark(displaced_mark()->incr_age());
451 } else {
452 set_mark(mark()->incr_age());
453 }
454 }
455
456 #if INCLUDE_ALL_GCS
457 void oopDesc::pc_follow_contents(ParCompactionManager* cm) {
458 klass()->oop_pc_follow_contents(this, cm);
459 }
460
461 void oopDesc::pc_update_contents(ParCompactionManager* cm) {
462 Klass* k = klass();
463 if (!k->is_typeArray_klass()) {
464 // It might contain oops beyond the header, so take the virtual call.
465 k->oop_pc_update_pointers(this, cm);
466 }
467 // Else skip it. The TypeArrayKlass in the header never needs scavenging.
468 }
469
470 void oopDesc::ps_push_contents(PSPromotionManager* pm) {
471 Klass* k = klass();
472 if (!k->is_typeArray_klass()) {
473 // It might contain oops beyond the header, so take the virtual call.
474 k->oop_ps_push_contents(this, pm);
475 }
476 // Else skip it. The TypeArrayKlass in the header never needs scavenging.
477 }
478 #endif // INCLUDE_ALL_GCS
479
480 #define OOP_ITERATE_DEFN(OopClosureType, nv_suffix) \
481 \
482 void oopDesc::oop_iterate(OopClosureType* blk) { \
483 klass()->oop_oop_iterate##nv_suffix(this, blk); \
484 } \
485 \
486 void oopDesc::oop_iterate(OopClosureType* blk, MemRegion mr) { \
487 klass()->oop_oop_iterate_bounded##nv_suffix(this, blk, mr); \
488 }
489
490 #define OOP_ITERATE_SIZE_DEFN(OopClosureType, nv_suffix) \
491 \
492 int oopDesc::oop_iterate_size(OopClosureType* blk) { \
493 Klass* k = klass(); \
494 int size = size_given_klass(k); \
495 k->oop_oop_iterate##nv_suffix(this, blk); \
496 return size; \
497 } \
498 \
499 int oopDesc::oop_iterate_size(OopClosureType* blk, MemRegion mr) { \
500 Klass* k = klass(); \
501 int size = size_given_klass(k); \
502 k->oop_oop_iterate_bounded##nv_suffix(this, blk, mr); \
503 return size; \
504 }
505
506 int oopDesc::oop_iterate_no_header(OopClosure* blk) {
507 // The NoHeaderExtendedOopClosure wraps the OopClosure and proxies all
508 // the do_oop calls, but turns off all other features in ExtendedOopClosure.
509 NoHeaderExtendedOopClosure cl(blk);
510 return oop_iterate_size(&cl);
511 }
512
513 int oopDesc::oop_iterate_no_header(OopClosure* blk, MemRegion mr) {
514 NoHeaderExtendedOopClosure cl(blk);
515 return oop_iterate_size(&cl, mr);
516 }
517
518 #if INCLUDE_ALL_GCS
519 #define OOP_ITERATE_BACKWARDS_DEFN(OopClosureType, nv_suffix) \
520 \
521 inline void oopDesc::oop_iterate_backwards(OopClosureType* blk) { \
522 klass()->oop_oop_iterate_backwards##nv_suffix(this, blk); \
523 }
524 #else
525 #define OOP_ITERATE_BACKWARDS_DEFN(OopClosureType, nv_suffix)
526 #endif // INCLUDE_ALL_GCS
527
528 #define ALL_OOPDESC_OOP_ITERATE(OopClosureType, nv_suffix) \
529 OOP_ITERATE_DEFN(OopClosureType, nv_suffix) \
530 OOP_ITERATE_SIZE_DEFN(OopClosureType, nv_suffix) \
531 OOP_ITERATE_BACKWARDS_DEFN(OopClosureType, nv_suffix)
532
533 ALL_OOP_OOP_ITERATE_CLOSURES_1(ALL_OOPDESC_OOP_ITERATE)
534 ALL_OOP_OOP_ITERATE_CLOSURES_2(ALL_OOPDESC_OOP_ITERATE)
535
536 intptr_t oopDesc::identity_hash() {
537 // Fast case; if the object is unlocked and the hash value is set, no locking is needed
538 // Note: The mark must be read into local variable to avoid concurrent updates.
539 markOop mrk = mark();
540 if (mrk->is_unlocked() && !mrk->has_no_hash()) {
541 return mrk->hash();
542 } else if (mrk->is_marked()) {
543 return mrk->hash();
544 } else {
545 return slow_identity_hash();
546 }
547 }
548
549 bool oopDesc::has_displaced_mark() const {
550 return mark()->has_displaced_mark_helper();
551 }
552
553 markOop oopDesc::displaced_mark() const {
554 return mark()->displaced_mark_helper();
555 }
556
557 void oopDesc::set_displaced_mark(markOop m) {
558 mark()->set_displaced_mark_helper(m);
559 }
560
561 #endif // SHARE_VM_OOPS_OOP_INLINE_HPP