1 /* 2 * Copyright (c) 1997, 2017, 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/barrierSet.inline.hpp" 30 #include "gc/shared/cardTableModRefBS.hpp" 31 #include "gc/shared/collectedHeap.inline.hpp" 32 #include "gc/shared/genCollectedHeap.hpp" 33 #include "gc/shared/generation.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/macros.hpp" 43 44 inline void update_barrier_set(void* p, oop v, bool release = false) { 45 assert(oopDesc::bs() != NULL, "Uninitialized bs in oop!"); 46 oopDesc::bs()->write_ref_field(p, v, release); 47 } 48 49 template <class T> inline void update_barrier_set_pre(T* p, oop v) { 50 oopDesc::bs()->write_ref_field_pre(p, v); 51 } 52 53 template <class T> void oop_store(T* p, oop v) { 54 if (always_do_update_barrier) { 55 oop_store((volatile T*)p, v); 56 } else { 57 update_barrier_set_pre(p, v); 58 oopDesc::encode_store_heap_oop(p, v); 59 // always_do_update_barrier == false => 60 // Either we are at a safepoint (in GC) or CMS is not used. In both 61 // cases it's unnecessary to mark the card as dirty with release sematics. 62 update_barrier_set((void*)p, v, false /* release */); // cast away type 63 } 64 } 65 66 template <class T> void oop_store(volatile T* p, oop v) { 67 update_barrier_set_pre((T*)p, v); // cast away volatile 68 // Used by release_obj_field_put, so use release_store_ptr. 69 oopDesc::release_encode_store_heap_oop(p, v); 70 // When using CMS we must mark the card corresponding to p as dirty 71 // with release sematics to prevent that CMS sees the dirty card but 72 // not the new value v at p due to reordering of the two 73 // stores. Note that CMS has a concurrent precleaning phase, where 74 // it reads the card table while the Java threads are running. 75 update_barrier_set((void*)p, v, true /* release */); // cast away type 76 } 77 78 // Should replace *addr = oop assignments where addr type depends on UseCompressedOops 79 // (without having to remember the function name this calls). 80 inline void oop_store_raw(HeapWord* addr, oop value) { 81 if (UseCompressedOops) { 82 oopDesc::encode_store_heap_oop((narrowOop*)addr, value); 83 } else { 84 oopDesc::encode_store_heap_oop((oop*)addr, value); 85 } 86 } 87 88 // Implementation of all inlined member functions defined in oop.hpp 89 // We need a separate file to avoid circular references 90 91 void oopDesc::release_set_mark(markOop m) { 92 OrderAccess::release_store_ptr(&_mark, m); 93 } 94 95 markOop oopDesc::cas_set_mark(markOop new_mark, markOop old_mark) { 96 return (markOop) Atomic::cmpxchg_ptr(new_mark, &_mark, old_mark); 97 } 98 99 void oopDesc::init_mark() { 100 set_mark(markOopDesc::prototype_for_object(this)); 101 } 102 103 Klass* oopDesc::klass() const { 104 if (UseCompressedClassPointers) { 105 return Klass::decode_klass_not_null(_metadata._compressed_klass); 106 } else { 107 return _metadata._klass; 108 } 109 } 110 111 Klass* oopDesc::klass_or_null() const volatile { 112 if (UseCompressedClassPointers) { 113 return Klass::decode_klass(_metadata._compressed_klass); 114 } else { 115 return _metadata._klass; 116 } 117 } 118 119 Klass* oopDesc::klass_or_null_acquire() const volatile { 120 if (UseCompressedClassPointers) { 121 // Workaround for non-const load_acquire parameter. 122 const volatile narrowKlass* addr = &_metadata._compressed_klass; 123 volatile narrowKlass* xaddr = const_cast<volatile narrowKlass*>(addr); 124 return Klass::decode_klass(OrderAccess::load_acquire(xaddr)); 125 } else { 126 return (Klass*)OrderAccess::load_ptr_acquire(&_metadata._klass); 127 } 128 } 129 130 Klass** oopDesc::klass_addr() { 131 // Only used internally and with CMS and will not work with 132 // UseCompressedOops 133 assert(!UseCompressedClassPointers, "only supported with uncompressed klass pointers"); 134 return (Klass**) &_metadata._klass; 135 } 136 137 narrowKlass* oopDesc::compressed_klass_addr() { 138 assert(UseCompressedClassPointers, "only called by compressed klass pointers"); 139 return &_metadata._compressed_klass; 140 } 141 142 #define CHECK_SET_KLASS(k) \ 143 do { \ 144 assert(Universe::is_bootstrapping() || k != NULL, "NULL Klass"); \ 145 assert(Universe::is_bootstrapping() || k->is_klass(), "not a Klass"); \ 146 } while (0) 147 148 void oopDesc::set_klass(Klass* k) { 149 CHECK_SET_KLASS(k); 150 if (UseCompressedClassPointers) { 151 *compressed_klass_addr() = Klass::encode_klass_not_null(k); 152 } else { 153 *klass_addr() = k; 154 } 155 } 156 157 void oopDesc::release_set_klass(Klass* k) { 158 CHECK_SET_KLASS(k); 159 if (UseCompressedClassPointers) { 160 OrderAccess::release_store(compressed_klass_addr(), 161 Klass::encode_klass_not_null(k)); 162 } else { 163 OrderAccess::release_store_ptr(klass_addr(), k); 164 } 165 } 166 167 #undef CHECK_SET_KLASS 168 169 int oopDesc::klass_gap() const { 170 return *(int*)(((intptr_t)this) + klass_gap_offset_in_bytes()); 171 } 172 173 void oopDesc::set_klass_gap(int v) { 174 if (UseCompressedClassPointers) { 175 *(int*)(((intptr_t)this) + klass_gap_offset_in_bytes()) = v; 176 } 177 } 178 179 void oopDesc::set_klass_to_list_ptr(oop k) { 180 // This is only to be used during GC, for from-space objects, so no 181 // barrier is needed. 182 if (UseCompressedClassPointers) { 183 _metadata._compressed_klass = (narrowKlass)encode_heap_oop(k); // may be null (parnew overflow handling) 184 } else { 185 _metadata._klass = (Klass*)(address)k; 186 } 187 } 188 189 oop oopDesc::list_ptr_from_klass() { 190 // This is only to be used during GC, for from-space objects. 191 if (UseCompressedClassPointers) { 192 return decode_heap_oop((narrowOop)_metadata._compressed_klass); 193 } else { 194 // Special case for GC 195 return (oop)(address)_metadata._klass; 196 } 197 } 198 199 bool oopDesc::is_a(Klass* k) const { 200 return klass()->is_subtype_of(k); 201 } 202 203 int oopDesc::size() { 204 return size_given_klass(klass()); 205 } 206 207 int oopDesc::size_given_klass(Klass* klass) { 208 int lh = klass->layout_helper(); 209 int s; 210 211 // lh is now a value computed at class initialization that may hint 212 // at the size. For instances, this is positive and equal to the 213 // size. For arrays, this is negative and provides log2 of the 214 // array element size. For other oops, it is zero and thus requires 215 // a virtual call. 216 // 217 // We go to all this trouble because the size computation is at the 218 // heart of phase 2 of mark-compaction, and called for every object, 219 // alive or dead. So the speed here is equal in importance to the 220 // speed of allocation. 221 222 if (lh > Klass::_lh_neutral_value) { 223 if (!Klass::layout_helper_needs_slow_path(lh)) { 224 s = lh >> LogHeapWordSize; // deliver size scaled by wordSize 225 } else { 226 s = klass->oop_size(this); 227 } 228 } else if (lh <= Klass::_lh_neutral_value) { 229 // The most common case is instances; fall through if so. 230 if (lh < Klass::_lh_neutral_value) { 231 // Second most common case is arrays. We have to fetch the 232 // length of the array, shift (multiply) it appropriately, 233 // up to wordSize, add the header, and align to object size. 234 size_t size_in_bytes; 235 #ifdef _M_IA64 236 // The Windows Itanium Aug 2002 SDK hoists this load above 237 // the check for s < 0. An oop at the end of the heap will 238 // cause an access violation if this load is performed on a non 239 // array oop. Making the reference volatile prohibits this. 240 // (%%% please explain by what magic the length is actually fetched!) 241 volatile int *array_length; 242 array_length = (volatile int *)( (intptr_t)this + 243 arrayOopDesc::length_offset_in_bytes() ); 244 assert(array_length > 0, "Integer arithmetic problem somewhere"); 245 // Put into size_t to avoid overflow. 246 size_in_bytes = (size_t) array_length; 247 size_in_bytes = size_in_bytes << Klass::layout_helper_log2_element_size(lh); 248 #else 249 size_t array_length = (size_t) ((arrayOop)this)->length(); 250 size_in_bytes = array_length << Klass::layout_helper_log2_element_size(lh); 251 #endif 252 size_in_bytes += Klass::layout_helper_header_size(lh); 253 254 // This code could be simplified, but by keeping array_header_in_bytes 255 // in units of bytes and doing it this way we can round up just once, 256 // skipping the intermediate round to HeapWordSize. Cast the result 257 // of round_to to size_t to guarantee unsigned division == right shift. 258 s = (int)((size_t)round_to(size_in_bytes, MinObjAlignmentInBytes) / 259 HeapWordSize); 260 261 // ParNew (used by CMS), UseParallelGC and UseG1GC can change the length field 262 // of an "old copy" of an object array in the young gen so it indicates 263 // the grey portion of an already copied array. This will cause the first 264 // disjunct below to fail if the two comparands are computed across such 265 // a concurrent change. 266 // ParNew also runs with promotion labs (which look like int 267 // filler arrays) which are subject to changing their declared size 268 // when finally retiring a PLAB; this also can cause the first disjunct 269 // to fail for another worker thread that is concurrently walking the block 270 // offset table. Both these invariant failures are benign for their 271 // current uses; we relax the assertion checking to cover these two cases below: 272 // is_objArray() && is_forwarded() // covers first scenario above 273 // || is_typeArray() // covers second scenario above 274 // If and when UseParallelGC uses the same obj array oop stealing/chunking 275 // technique, we will need to suitably modify the assertion. 276 assert((s == klass->oop_size(this)) || 277 (Universe::heap()->is_gc_active() && 278 ((is_typeArray() && UseConcMarkSweepGC) || 279 (is_objArray() && is_forwarded() && (UseConcMarkSweepGC || UseParallelGC || UseG1GC)))), 280 "wrong array object size"); 281 } else { 282 // Must be zero, so bite the bullet and take the virtual call. 283 s = klass->oop_size(this); 284 } 285 } 286 287 assert(s % MinObjAlignment == 0, "Oop size is not properly aligned: %d", s); 288 assert(s > 0, "Oop size must be greater than zero, not %d", s); 289 return s; 290 } 291 292 bool oopDesc::is_instance() const { return klass()->is_instance_klass(); } 293 bool oopDesc::is_array() const { return klass()->is_array_klass(); } 294 bool oopDesc::is_objArray() const { return klass()->is_objArray_klass(); } 295 bool oopDesc::is_typeArray() const { return klass()->is_typeArray_klass(); } 296 bool oopDesc::is_value() const { return klass()->is_value(); } 297 bool oopDesc::is_valueArray() const { return klass()->is_valueArray_klass(); } 298 299 void* oopDesc::field_base(int offset) const { return (void*)&((char*)this)[offset]; } 300 301 jbyte* oopDesc::byte_field_addr(int offset) const { return (jbyte*) field_base(offset); } 302 jchar* oopDesc::char_field_addr(int offset) const { return (jchar*) field_base(offset); } 303 jboolean* oopDesc::bool_field_addr(int offset) const { return (jboolean*) field_base(offset); } 304 jint* oopDesc::int_field_addr(int offset) const { return (jint*) field_base(offset); } 305 jshort* oopDesc::short_field_addr(int offset) const { return (jshort*) field_base(offset); } 306 jlong* oopDesc::long_field_addr(int offset) const { return (jlong*) field_base(offset); } 307 jfloat* oopDesc::float_field_addr(int offset) const { return (jfloat*) field_base(offset); } 308 jdouble* oopDesc::double_field_addr(int offset) const { return (jdouble*) field_base(offset); } 309 Metadata** oopDesc::metadata_field_addr(int offset) const { return (Metadata**)field_base(offset); } 310 311 template <class T> T* oopDesc::obj_field_addr(int offset) const { return (T*) field_base(offset); } 312 address* oopDesc::address_field_addr(int offset) const { return (address*) field_base(offset); } 313 314 315 // Functions for getting and setting oops within instance objects. 316 // If the oops are compressed, the type passed to these overloaded functions 317 // is narrowOop. All functions are overloaded so they can be called by 318 // template functions without conditionals (the compiler instantiates via 319 // the right type and inlines the appopriate code). 320 321 // Algorithm for encoding and decoding oops from 64 bit pointers to 32 bit 322 // offset from the heap base. Saving the check for null can save instructions 323 // in inner GC loops so these are separated. 324 325 inline bool check_obj_alignment(oop obj) { 326 return (cast_from_oop<intptr_t>(obj) & MinObjAlignmentInBytesMask) == 0; 327 } 328 329 oop oopDesc::decode_heap_oop_not_null(narrowOop v) { 330 assert(!is_null(v), "narrow oop value can never be zero"); 331 address base = Universe::narrow_oop_base(); 332 int shift = Universe::narrow_oop_shift(); 333 oop result = (oop)(void*)((uintptr_t)base + ((uintptr_t)v << shift)); 334 assert(check_obj_alignment(result), "address not aligned: " INTPTR_FORMAT, p2i((void*) result)); 335 return result; 336 } 337 338 oop oopDesc::decode_heap_oop(narrowOop v) { 339 return is_null(v) ? (oop)NULL : decode_heap_oop_not_null(v); 340 } 341 342 narrowOop oopDesc::encode_heap_oop_not_null(oop v) { 343 assert(!is_null(v), "oop value can never be zero"); 344 assert(check_obj_alignment(v), "Address not aligned"); 345 assert(Universe::heap()->is_in_reserved(v), "Address not in heap"); 346 address base = Universe::narrow_oop_base(); 347 int shift = Universe::narrow_oop_shift(); 348 uint64_t pd = (uint64_t)(pointer_delta((void*)v, (void*)base, 1)); 349 assert(OopEncodingHeapMax > pd, "change encoding max if new encoding"); 350 uint64_t result = pd >> shift; 351 assert((result & CONST64(0xffffffff00000000)) == 0, "narrow oop overflow"); 352 assert(decode_heap_oop(result) == v, "reversibility"); 353 return (narrowOop)result; 354 } 355 356 narrowOop oopDesc::encode_heap_oop(oop v) { 357 return (is_null(v)) ? (narrowOop)0 : encode_heap_oop_not_null(v); 358 } 359 360 // Load and decode an oop out of the Java heap into a wide oop. 361 oop oopDesc::load_decode_heap_oop_not_null(narrowOop* p) { 362 return decode_heap_oop_not_null(*p); 363 } 364 365 // Load and decode an oop out of the heap accepting null 366 oop oopDesc::load_decode_heap_oop(narrowOop* p) { 367 return decode_heap_oop(*p); 368 } 369 370 // Encode and store a heap oop. 371 void oopDesc::encode_store_heap_oop_not_null(narrowOop* p, oop v) { 372 *p = encode_heap_oop_not_null(v); 373 } 374 375 // Encode and store a heap oop allowing for null. 376 void oopDesc::encode_store_heap_oop(narrowOop* p, oop v) { 377 *p = encode_heap_oop(v); 378 } 379 380 // Store heap oop as is for volatile fields. 381 void oopDesc::release_store_heap_oop(volatile oop* p, oop v) { 382 OrderAccess::release_store_ptr(p, v); 383 } 384 void oopDesc::release_store_heap_oop(volatile narrowOop* p, narrowOop v) { 385 OrderAccess::release_store(p, v); 386 } 387 388 void oopDesc::release_encode_store_heap_oop_not_null(volatile narrowOop* p, oop v) { 389 // heap oop is not pointer sized. 390 OrderAccess::release_store(p, encode_heap_oop_not_null(v)); 391 } 392 void oopDesc::release_encode_store_heap_oop_not_null(volatile oop* p, oop v) { 393 OrderAccess::release_store_ptr(p, v); 394 } 395 396 void oopDesc::release_encode_store_heap_oop(volatile oop* p, oop v) { 397 OrderAccess::release_store_ptr(p, v); 398 } 399 void oopDesc::release_encode_store_heap_oop(volatile narrowOop* p, oop v) { 400 OrderAccess::release_store(p, encode_heap_oop(v)); 401 } 402 403 // These functions are only used to exchange oop fields in instances, 404 // not headers. 405 oop oopDesc::atomic_exchange_oop(oop exchange_value, volatile HeapWord *dest) { 406 if (UseCompressedOops) { 407 // encode exchange value from oop to T 408 narrowOop val = encode_heap_oop(exchange_value); 409 narrowOop old = (narrowOop)Atomic::xchg(val, (narrowOop*)dest); 410 // decode old from T to oop 411 return decode_heap_oop(old); 412 } else { 413 return (oop)Atomic::xchg_ptr(exchange_value, (oop*)dest); 414 } 415 } 416 417 oop oopDesc::atomic_compare_exchange_oop(oop exchange_value, 418 volatile HeapWord *dest, 419 oop compare_value, 420 bool prebarrier) { 421 if (UseCompressedOops) { 422 if (prebarrier) { 423 update_barrier_set_pre((narrowOop*)dest, exchange_value); 424 } 425 // encode exchange and compare value from oop to T 426 narrowOop val = encode_heap_oop(exchange_value); 427 narrowOop cmp = encode_heap_oop(compare_value); 428 429 narrowOop old = (narrowOop) Atomic::cmpxchg(val, (narrowOop*)dest, cmp); 430 // decode old from T to oop 431 return decode_heap_oop(old); 432 } else { 433 if (prebarrier) { 434 update_barrier_set_pre((oop*)dest, exchange_value); 435 } 436 return (oop)Atomic::cmpxchg_ptr(exchange_value, (oop*)dest, compare_value); 437 } 438 } 439 440 // In order to put or get a field out of an instance, must first check 441 // if the field has been compressed and uncompress it. 442 oop oopDesc::obj_field(int offset) const { 443 return UseCompressedOops ? 444 load_decode_heap_oop(obj_field_addr<narrowOop>(offset)) : 445 load_decode_heap_oop(obj_field_addr<oop>(offset)); 446 } 447 448 void oopDesc::obj_field_put(int offset, oop value) { 449 UseCompressedOops ? oop_store(obj_field_addr<narrowOop>(offset), value) : 450 oop_store(obj_field_addr<oop>(offset), value); 451 } 452 453 void oopDesc::obj_field_put_raw(int offset, oop value) { 454 UseCompressedOops ? 455 encode_store_heap_oop(obj_field_addr<narrowOop>(offset), value) : 456 encode_store_heap_oop(obj_field_addr<oop>(offset), value); 457 } 458 void oopDesc::obj_field_put_volatile(int offset, oop value) { 459 OrderAccess::release(); 460 obj_field_put(offset, value); 461 OrderAccess::fence(); 462 } 463 464 Metadata* oopDesc::metadata_field(int offset) const { return *metadata_field_addr(offset); } 465 void oopDesc::metadata_field_put(int offset, Metadata* value) { *metadata_field_addr(offset) = value; } 466 467 jbyte oopDesc::byte_field(int offset) const { return (jbyte) *byte_field_addr(offset); } 468 void oopDesc::byte_field_put(int offset, jbyte contents) { *byte_field_addr(offset) = (jint) contents; } 469 470 jchar oopDesc::char_field(int offset) const { return (jchar) *char_field_addr(offset); } 471 void oopDesc::char_field_put(int offset, jchar contents) { *char_field_addr(offset) = (jint) contents; } 472 473 jboolean oopDesc::bool_field(int offset) const { return (jboolean) *bool_field_addr(offset); } 474 void oopDesc::bool_field_put(int offset, jboolean contents) { *bool_field_addr(offset) = (((jint) contents) & 1); } 475 476 jint oopDesc::int_field(int offset) const { return *int_field_addr(offset); } 477 void oopDesc::int_field_put(int offset, jint contents) { *int_field_addr(offset) = contents; } 478 479 jshort oopDesc::short_field(int offset) const { return (jshort) *short_field_addr(offset); } 480 void oopDesc::short_field_put(int offset, jshort contents) { *short_field_addr(offset) = (jint) contents;} 481 482 jlong oopDesc::long_field(int offset) const { return *long_field_addr(offset); } 483 void oopDesc::long_field_put(int offset, jlong contents) { *long_field_addr(offset) = contents; } 484 485 jfloat oopDesc::float_field(int offset) const { return *float_field_addr(offset); } 486 void oopDesc::float_field_put(int offset, jfloat contents) { *float_field_addr(offset) = contents; } 487 488 jdouble oopDesc::double_field(int offset) const { return *double_field_addr(offset); } 489 void oopDesc::double_field_put(int offset, jdouble contents) { *double_field_addr(offset) = contents; } 490 491 address oopDesc::address_field(int offset) const { return *address_field_addr(offset); } 492 void oopDesc::address_field_put(int offset, address contents) { *address_field_addr(offset) = contents; } 493 494 oop oopDesc::obj_field_acquire(int offset) const { 495 return UseCompressedOops ? 496 decode_heap_oop((narrowOop) 497 OrderAccess::load_acquire(obj_field_addr<narrowOop>(offset))) 498 : decode_heap_oop((oop) 499 OrderAccess::load_ptr_acquire(obj_field_addr<oop>(offset))); 500 } 501 void oopDesc::release_obj_field_put(int offset, oop value) { 502 UseCompressedOops ? 503 oop_store((volatile narrowOop*)obj_field_addr<narrowOop>(offset), value) : 504 oop_store((volatile oop*) obj_field_addr<oop>(offset), value); 505 } 506 507 jbyte oopDesc::byte_field_acquire(int offset) const { return OrderAccess::load_acquire(byte_field_addr(offset)); } 508 void oopDesc::release_byte_field_put(int offset, jbyte contents) { OrderAccess::release_store(byte_field_addr(offset), contents); } 509 510 jchar oopDesc::char_field_acquire(int offset) const { return OrderAccess::load_acquire(char_field_addr(offset)); } 511 void oopDesc::release_char_field_put(int offset, jchar contents) { OrderAccess::release_store(char_field_addr(offset), contents); } 512 513 jboolean oopDesc::bool_field_acquire(int offset) const { return OrderAccess::load_acquire(bool_field_addr(offset)); } 514 void oopDesc::release_bool_field_put(int offset, jboolean contents) { OrderAccess::release_store(bool_field_addr(offset), (contents & 1)); } 515 516 jint oopDesc::int_field_acquire(int offset) const { return OrderAccess::load_acquire(int_field_addr(offset)); } 517 void oopDesc::release_int_field_put(int offset, jint contents) { OrderAccess::release_store(int_field_addr(offset), contents); } 518 519 jshort oopDesc::short_field_acquire(int offset) const { return (jshort)OrderAccess::load_acquire(short_field_addr(offset)); } 520 void oopDesc::release_short_field_put(int offset, jshort contents) { OrderAccess::release_store(short_field_addr(offset), contents); } 521 522 jlong oopDesc::long_field_acquire(int offset) const { return OrderAccess::load_acquire(long_field_addr(offset)); } 523 void oopDesc::release_long_field_put(int offset, jlong contents) { OrderAccess::release_store(long_field_addr(offset), contents); } 524 525 jfloat oopDesc::float_field_acquire(int offset) const { return OrderAccess::load_acquire(float_field_addr(offset)); } 526 void oopDesc::release_float_field_put(int offset, jfloat contents) { OrderAccess::release_store(float_field_addr(offset), contents); } 527 528 jdouble oopDesc::double_field_acquire(int offset) const { return OrderAccess::load_acquire(double_field_addr(offset)); } 529 void oopDesc::release_double_field_put(int offset, jdouble contents) { OrderAccess::release_store(double_field_addr(offset), contents); } 530 531 address oopDesc::address_field_acquire(int offset) const { return (address) OrderAccess::load_ptr_acquire(address_field_addr(offset)); } 532 void oopDesc::release_address_field_put(int offset, address contents) { OrderAccess::release_store_ptr(address_field_addr(offset), contents); } 533 534 bool oopDesc::is_locked() const { 535 return mark()->is_locked(); 536 } 537 538 bool oopDesc::is_unlocked() const { 539 return mark()->is_unlocked(); 540 } 541 542 bool oopDesc::has_bias_pattern() const { 543 return mark()->has_bias_pattern(); 544 } 545 546 // used only for asserts 547 bool oopDesc::is_oop(bool ignore_mark_word) const { 548 oop obj = (oop) this; 549 if (!check_obj_alignment(obj)) return false; 550 if (!Universe::heap()->is_in_reserved(obj)) return false; 551 // obj is aligned and accessible in heap 552 if (Universe::heap()->is_in_reserved(obj->klass_or_null())) return false; 553 554 // Header verification: the mark is typically non-NULL. If we're 555 // at a safepoint, it must not be null. 556 // Outside of a safepoint, the header could be changing (for example, 557 // another thread could be inflating a lock on this object). 558 if (ignore_mark_word) { 559 return true; 560 } 561 if (mark() != NULL) { 562 return true; 563 } 564 return !SafepointSynchronize::is_at_safepoint(); 565 } 566 567 568 // used only for asserts 569 bool oopDesc::is_oop_or_null(bool ignore_mark_word) const { 570 return this == NULL ? true : is_oop(ignore_mark_word); 571 } 572 573 #ifndef PRODUCT 574 // used only for asserts 575 bool oopDesc::is_unlocked_oop() const { 576 if (!Universe::heap()->is_in_reserved(this)) return false; 577 return mark()->is_unlocked(); 578 } 579 #endif // PRODUCT 580 581 // Used only for markSweep, scavenging 582 bool oopDesc::is_gc_marked() const { 583 return mark()->is_marked(); 584 } 585 586 bool oopDesc::is_scavengable() const { 587 return Universe::heap()->is_scavengable(this); 588 } 589 590 // Used by scavengers 591 bool oopDesc::is_forwarded() const { 592 // The extra heap check is needed since the obj might be locked, in which case the 593 // mark would point to a stack location and have the sentinel bit cleared 594 return mark()->is_marked(); 595 } 596 597 // Used by scavengers 598 void oopDesc::forward_to(oop p) { 599 assert(check_obj_alignment(p), 600 "forwarding to something not aligned"); 601 assert(Universe::heap()->is_in_reserved(p), 602 "forwarding to something not in heap"); 603 markOop m = markOopDesc::encode_pointer_as_mark(p); 604 assert(m->decode_pointer() == p, "encoding must be reversable"); 605 set_mark(m); 606 } 607 608 // Used by parallel scavengers 609 bool oopDesc::cas_forward_to(oop p, markOop compare) { 610 assert(check_obj_alignment(p), 611 "forwarding to something not aligned"); 612 assert(Universe::heap()->is_in_reserved(p), 613 "forwarding to something not in heap"); 614 markOop m = markOopDesc::encode_pointer_as_mark(p); 615 assert(m->decode_pointer() == p, "encoding must be reversable"); 616 return cas_set_mark(m, compare) == compare; 617 } 618 619 #if INCLUDE_ALL_GCS 620 oop oopDesc::forward_to_atomic(oop p) { 621 markOop oldMark = mark(); 622 markOop forwardPtrMark = markOopDesc::encode_pointer_as_mark(p); 623 markOop curMark; 624 625 assert(forwardPtrMark->decode_pointer() == p, "encoding must be reversable"); 626 assert(sizeof(markOop) == sizeof(intptr_t), "CAS below requires this."); 627 628 while (!oldMark->is_marked()) { 629 curMark = (markOop)Atomic::cmpxchg_ptr(forwardPtrMark, &_mark, oldMark); 630 assert(is_forwarded(), "object should have been forwarded"); 631 if (curMark == oldMark) { 632 return NULL; 633 } 634 // If the CAS was unsuccessful then curMark->is_marked() 635 // should return true as another thread has CAS'd in another 636 // forwarding pointer. 637 oldMark = curMark; 638 } 639 return forwardee(); 640 } 641 #endif 642 643 // Note that the forwardee is not the same thing as the displaced_mark. 644 // The forwardee is used when copying during scavenge and mark-sweep. 645 // It does need to clear the low two locking- and GC-related bits. 646 oop oopDesc::forwardee() const { 647 return (oop) mark()->decode_pointer(); 648 } 649 650 // The following method needs to be MT safe. 651 uint oopDesc::age() const { 652 assert(!is_forwarded(), "Attempt to read age from forwarded mark"); 653 if (has_displaced_mark()) { 654 return displaced_mark()->age(); 655 } else { 656 return mark()->age(); 657 } 658 } 659 660 void oopDesc::incr_age() { 661 assert(!is_forwarded(), "Attempt to increment age of forwarded mark"); 662 if (has_displaced_mark()) { 663 set_displaced_mark(displaced_mark()->incr_age()); 664 } else { 665 set_mark(mark()->incr_age()); 666 } 667 } 668 669 #if INCLUDE_ALL_GCS 670 void oopDesc::pc_follow_contents(ParCompactionManager* cm) { 671 klass()->oop_pc_follow_contents(this, cm); 672 } 673 674 void oopDesc::pc_update_contents(ParCompactionManager* cm) { 675 Klass* k = klass(); 676 if (!k->is_typeArray_klass()) { 677 // It might contain oops beyond the header, so take the virtual call. 678 k->oop_pc_update_pointers(this, cm); 679 } 680 // Else skip it. The TypeArrayKlass in the header never needs scavenging. 681 } 682 683 void oopDesc::ps_push_contents(PSPromotionManager* pm) { 684 Klass* k = klass(); 685 if (!k->is_typeArray_klass()) { 686 // It might contain oops beyond the header, so take the virtual call. 687 k->oop_ps_push_contents(this, pm); 688 } 689 // Else skip it. The TypeArrayKlass in the header never needs scavenging. 690 } 691 #endif // INCLUDE_ALL_GCS 692 693 #define OOP_ITERATE_DEFN(OopClosureType, nv_suffix) \ 694 \ 695 void oopDesc::oop_iterate(OopClosureType* blk) { \ 696 klass()->oop_oop_iterate##nv_suffix(this, blk); \ 697 } \ 698 \ 699 void oopDesc::oop_iterate(OopClosureType* blk, MemRegion mr) { \ 700 klass()->oop_oop_iterate_bounded##nv_suffix(this, blk, mr); \ 701 } 702 703 #define OOP_ITERATE_SIZE_DEFN(OopClosureType, nv_suffix) \ 704 \ 705 int oopDesc::oop_iterate_size(OopClosureType* blk) { \ 706 Klass* k = klass(); \ 707 int size = size_given_klass(k); \ 708 k->oop_oop_iterate##nv_suffix(this, blk); \ 709 return size; \ 710 } \ 711 \ 712 int oopDesc::oop_iterate_size(OopClosureType* blk, MemRegion mr) { \ 713 Klass* k = klass(); \ 714 int size = size_given_klass(k); \ 715 k->oop_oop_iterate_bounded##nv_suffix(this, blk, mr); \ 716 return size; \ 717 } 718 719 int oopDesc::oop_iterate_no_header(OopClosure* blk) { 720 // The NoHeaderExtendedOopClosure wraps the OopClosure and proxies all 721 // the do_oop calls, but turns off all other features in ExtendedOopClosure. 722 NoHeaderExtendedOopClosure cl(blk); 723 return oop_iterate_size(&cl); 724 } 725 726 int oopDesc::oop_iterate_no_header(OopClosure* blk, MemRegion mr) { 727 NoHeaderExtendedOopClosure cl(blk); 728 return oop_iterate_size(&cl, mr); 729 } 730 731 #if INCLUDE_ALL_GCS 732 #define OOP_ITERATE_BACKWARDS_DEFN(OopClosureType, nv_suffix) \ 733 \ 734 inline void oopDesc::oop_iterate_backwards(OopClosureType* blk) { \ 735 klass()->oop_oop_iterate_backwards##nv_suffix(this, blk); \ 736 } 737 #else 738 #define OOP_ITERATE_BACKWARDS_DEFN(OopClosureType, nv_suffix) 739 #endif // INCLUDE_ALL_GCS 740 741 #define ALL_OOPDESC_OOP_ITERATE(OopClosureType, nv_suffix) \ 742 OOP_ITERATE_DEFN(OopClosureType, nv_suffix) \ 743 OOP_ITERATE_SIZE_DEFN(OopClosureType, nv_suffix) \ 744 OOP_ITERATE_BACKWARDS_DEFN(OopClosureType, nv_suffix) 745 746 ALL_OOP_OOP_ITERATE_CLOSURES_1(ALL_OOPDESC_OOP_ITERATE) 747 ALL_OOP_OOP_ITERATE_CLOSURES_2(ALL_OOPDESC_OOP_ITERATE) 748 749 intptr_t oopDesc::identity_hash() { 750 // Fast case; if the object is unlocked and the hash value is set, no locking is needed 751 // Note: The mark must be read into local variable to avoid concurrent updates. 752 markOop mrk = mark(); 753 if (mrk->is_unlocked() && !mrk->has_no_hash()) { 754 return mrk->hash(); 755 } else if (mrk->is_marked()) { 756 return mrk->hash(); 757 } else { 758 return slow_identity_hash(); 759 } 760 } 761 762 bool oopDesc::has_displaced_mark() const { 763 return mark()->has_displaced_mark_helper(); 764 } 765 766 markOop oopDesc::displaced_mark() const { 767 return mark()->displaced_mark_helper(); 768 } 769 770 void oopDesc::set_displaced_mark(markOop m) { 771 mark()->set_displaced_mark_helper(m); 772 } 773 774 #endif // SHARE_VM_OOPS_OOP_INLINE_HPP