Tue, 08 Feb 2011 12:33:19 +0100
7014851: Remove unused parallel compaction code
Summary: Removed.
Reviewed-by: jcoomes, brutisso
1 /*
2 * Copyright (c) 1997, 2010, 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 */
25 #ifndef SHARE_VM_OOPS_OOP_INLINE_HPP
26 #define SHARE_VM_OOPS_OOP_INLINE_HPP
28 #include "gc_implementation/shared/ageTable.hpp"
29 #include "gc_implementation/shared/markSweep.inline.hpp"
30 #include "gc_interface/collectedHeap.inline.hpp"
31 #include "memory/barrierSet.inline.hpp"
32 #include "memory/cardTableModRefBS.hpp"
33 #include "memory/compactingPermGenGen.hpp"
34 #include "memory/genCollectedHeap.hpp"
35 #include "memory/generation.hpp"
36 #include "memory/permGen.hpp"
37 #include "memory/specialized_oop_closures.hpp"
38 #include "oops/arrayKlass.hpp"
39 #include "oops/arrayOop.hpp"
40 #include "oops/klass.hpp"
41 #include "oops/klassOop.hpp"
42 #include "oops/markOop.inline.hpp"
43 #include "oops/oop.hpp"
44 #include "runtime/atomic.hpp"
45 #include "runtime/os.hpp"
46 #ifdef TARGET_ARCH_x86
47 # include "bytes_x86.hpp"
48 #endif
49 #ifdef TARGET_ARCH_sparc
50 # include "bytes_sparc.hpp"
51 #endif
52 #ifdef TARGET_ARCH_zero
53 # include "bytes_zero.hpp"
54 #endif
56 // Implementation of all inlined member functions defined in oop.hpp
57 // We need a separate file to avoid circular references
59 inline void oopDesc::release_set_mark(markOop m) {
60 OrderAccess::release_store_ptr(&_mark, m);
61 }
63 inline markOop oopDesc::cas_set_mark(markOop new_mark, markOop old_mark) {
64 return (markOop) Atomic::cmpxchg_ptr(new_mark, &_mark, old_mark);
65 }
67 inline klassOop oopDesc::klass() const {
68 if (UseCompressedOops) {
69 return (klassOop)decode_heap_oop_not_null(_metadata._compressed_klass);
70 } else {
71 return _metadata._klass;
72 }
73 }
75 inline klassOop oopDesc::klass_or_null() const volatile {
76 // can be NULL in CMS
77 if (UseCompressedOops) {
78 return (klassOop)decode_heap_oop(_metadata._compressed_klass);
79 } else {
80 return _metadata._klass;
81 }
82 }
84 inline int oopDesc::klass_gap_offset_in_bytes() {
85 assert(UseCompressedOops, "only applicable to compressed headers");
86 return oopDesc::klass_offset_in_bytes() + sizeof(narrowOop);
87 }
89 inline oop* oopDesc::klass_addr() {
90 // Only used internally and with CMS and will not work with
91 // UseCompressedOops
92 assert(!UseCompressedOops, "only supported with uncompressed oops");
93 return (oop*) &_metadata._klass;
94 }
96 inline narrowOop* oopDesc::compressed_klass_addr() {
97 assert(UseCompressedOops, "only called by compressed oops");
98 return (narrowOop*) &_metadata._compressed_klass;
99 }
101 inline void oopDesc::set_klass(klassOop k) {
102 // since klasses are promoted no store check is needed
103 assert(Universe::is_bootstrapping() || k != NULL, "must be a real klassOop");
104 assert(Universe::is_bootstrapping() || k->is_klass(), "not a klassOop");
105 if (UseCompressedOops) {
106 oop_store_without_check(compressed_klass_addr(), (oop)k);
107 } else {
108 oop_store_without_check(klass_addr(), (oop) k);
109 }
110 }
112 inline int oopDesc::klass_gap() const {
113 return *(int*)(((intptr_t)this) + klass_gap_offset_in_bytes());
114 }
116 inline void oopDesc::set_klass_gap(int v) {
117 if (UseCompressedOops) {
118 *(int*)(((intptr_t)this) + klass_gap_offset_in_bytes()) = v;
119 }
120 }
122 inline void oopDesc::set_klass_to_list_ptr(oop k) {
123 // This is only to be used during GC, for from-space objects, so no
124 // barrier is needed.
125 if (UseCompressedOops) {
126 _metadata._compressed_klass = encode_heap_oop(k); // may be null (parnew overflow handling)
127 } else {
128 _metadata._klass = (klassOop)k;
129 }
130 }
132 inline void oopDesc::init_mark() { set_mark(markOopDesc::prototype_for_object(this)); }
133 inline Klass* oopDesc::blueprint() const { return klass()->klass_part(); }
135 inline bool oopDesc::is_a(klassOop k) const { return blueprint()->is_subtype_of(k); }
137 inline bool oopDesc::is_instance() const { return blueprint()->oop_is_instance(); }
138 inline bool oopDesc::is_instanceRef() const { return blueprint()->oop_is_instanceRef(); }
139 inline bool oopDesc::is_array() const { return blueprint()->oop_is_array(); }
140 inline bool oopDesc::is_objArray() const { return blueprint()->oop_is_objArray(); }
141 inline bool oopDesc::is_typeArray() const { return blueprint()->oop_is_typeArray(); }
142 inline bool oopDesc::is_javaArray() const { return blueprint()->oop_is_javaArray(); }
143 inline bool oopDesc::is_klass() const { return blueprint()->oop_is_klass(); }
144 inline bool oopDesc::is_thread() const { return blueprint()->oop_is_thread(); }
145 inline bool oopDesc::is_method() const { return blueprint()->oop_is_method(); }
146 inline bool oopDesc::is_constMethod() const { return blueprint()->oop_is_constMethod(); }
147 inline bool oopDesc::is_methodData() const { return blueprint()->oop_is_methodData(); }
148 inline bool oopDesc::is_constantPool() const { return blueprint()->oop_is_constantPool(); }
149 inline bool oopDesc::is_constantPoolCache() const { return blueprint()->oop_is_constantPoolCache(); }
150 inline bool oopDesc::is_compiledICHolder() const { return blueprint()->oop_is_compiledICHolder(); }
152 inline void* oopDesc::field_base(int offset) const { return (void*)&((char*)this)[offset]; }
154 template <class T> inline T* oopDesc::obj_field_addr(int offset) const { return (T*)field_base(offset); }
155 inline jbyte* oopDesc::byte_field_addr(int offset) const { return (jbyte*) field_base(offset); }
156 inline jchar* oopDesc::char_field_addr(int offset) const { return (jchar*) field_base(offset); }
157 inline jboolean* oopDesc::bool_field_addr(int offset) const { return (jboolean*)field_base(offset); }
158 inline jint* oopDesc::int_field_addr(int offset) const { return (jint*) field_base(offset); }
159 inline jshort* oopDesc::short_field_addr(int offset) const { return (jshort*) field_base(offset); }
160 inline jlong* oopDesc::long_field_addr(int offset) const { return (jlong*) field_base(offset); }
161 inline jfloat* oopDesc::float_field_addr(int offset) const { return (jfloat*) field_base(offset); }
162 inline jdouble* oopDesc::double_field_addr(int offset) const { return (jdouble*) field_base(offset); }
163 inline address* oopDesc::address_field_addr(int offset) const { return (address*) field_base(offset); }
166 // Functions for getting and setting oops within instance objects.
167 // If the oops are compressed, the type passed to these overloaded functions
168 // is narrowOop. All functions are overloaded so they can be called by
169 // template functions without conditionals (the compiler instantiates via
170 // the right type and inlines the appopriate code).
172 inline bool oopDesc::is_null(oop obj) { return obj == NULL; }
173 inline bool oopDesc::is_null(narrowOop obj) { return obj == 0; }
175 // Algorithm for encoding and decoding oops from 64 bit pointers to 32 bit
176 // offset from the heap base. Saving the check for null can save instructions
177 // in inner GC loops so these are separated.
179 inline bool check_obj_alignment(oop obj) {
180 return (intptr_t)obj % MinObjAlignmentInBytes == 0;
181 }
183 inline narrowOop oopDesc::encode_heap_oop_not_null(oop v) {
184 assert(!is_null(v), "oop value can never be zero");
185 assert(check_obj_alignment(v), "Address not aligned");
186 assert(Universe::heap()->is_in_reserved(v), "Address not in heap");
187 address base = Universe::narrow_oop_base();
188 int shift = Universe::narrow_oop_shift();
189 uint64_t pd = (uint64_t)(pointer_delta((void*)v, (void*)base, 1));
190 assert(OopEncodingHeapMax > pd, "change encoding max if new encoding");
191 uint64_t result = pd >> shift;
192 assert((result & CONST64(0xffffffff00000000)) == 0, "narrow oop overflow");
193 assert(decode_heap_oop(result) == v, "reversibility");
194 return (narrowOop)result;
195 }
197 inline narrowOop oopDesc::encode_heap_oop(oop v) {
198 return (is_null(v)) ? (narrowOop)0 : encode_heap_oop_not_null(v);
199 }
201 inline oop oopDesc::decode_heap_oop_not_null(narrowOop v) {
202 assert(!is_null(v), "narrow oop value can never be zero");
203 address base = Universe::narrow_oop_base();
204 int shift = Universe::narrow_oop_shift();
205 oop result = (oop)(void*)((uintptr_t)base + ((uintptr_t)v << shift));
206 assert(check_obj_alignment(result), err_msg("address not aligned: " PTR_FORMAT, (void*) result));
207 return result;
208 }
210 inline oop oopDesc::decode_heap_oop(narrowOop v) {
211 return is_null(v) ? (oop)NULL : decode_heap_oop_not_null(v);
212 }
214 inline oop oopDesc::decode_heap_oop_not_null(oop v) { return v; }
215 inline oop oopDesc::decode_heap_oop(oop v) { return v; }
217 // Load an oop out of the Java heap as is without decoding.
218 // Called by GC to check for null before decoding.
219 inline oop oopDesc::load_heap_oop(oop* p) { return *p; }
220 inline narrowOop oopDesc::load_heap_oop(narrowOop* p) { return *p; }
222 // Load and decode an oop out of the Java heap into a wide oop.
223 inline oop oopDesc::load_decode_heap_oop_not_null(oop* p) { return *p; }
224 inline oop oopDesc::load_decode_heap_oop_not_null(narrowOop* p) {
225 return decode_heap_oop_not_null(*p);
226 }
228 // Load and decode an oop out of the heap accepting null
229 inline oop oopDesc::load_decode_heap_oop(oop* p) { return *p; }
230 inline oop oopDesc::load_decode_heap_oop(narrowOop* p) {
231 return decode_heap_oop(*p);
232 }
234 // Store already encoded heap oop into the heap.
235 inline void oopDesc::store_heap_oop(oop* p, oop v) { *p = v; }
236 inline void oopDesc::store_heap_oop(narrowOop* p, narrowOop v) { *p = v; }
238 // Encode and store a heap oop.
239 inline void oopDesc::encode_store_heap_oop_not_null(narrowOop* p, oop v) {
240 *p = encode_heap_oop_not_null(v);
241 }
242 inline void oopDesc::encode_store_heap_oop_not_null(oop* p, oop v) { *p = v; }
244 // Encode and store a heap oop allowing for null.
245 inline void oopDesc::encode_store_heap_oop(narrowOop* p, oop v) {
246 *p = encode_heap_oop(v);
247 }
248 inline void oopDesc::encode_store_heap_oop(oop* p, oop v) { *p = v; }
250 // Store heap oop as is for volatile fields.
251 inline void oopDesc::release_store_heap_oop(volatile oop* p, oop v) {
252 OrderAccess::release_store_ptr(p, v);
253 }
254 inline void oopDesc::release_store_heap_oop(volatile narrowOop* p,
255 narrowOop v) {
256 OrderAccess::release_store(p, v);
257 }
259 inline void oopDesc::release_encode_store_heap_oop_not_null(
260 volatile narrowOop* p, oop v) {
261 // heap oop is not pointer sized.
262 OrderAccess::release_store(p, encode_heap_oop_not_null(v));
263 }
265 inline void oopDesc::release_encode_store_heap_oop_not_null(
266 volatile oop* p, oop v) {
267 OrderAccess::release_store_ptr(p, v);
268 }
270 inline void oopDesc::release_encode_store_heap_oop(volatile oop* p,
271 oop v) {
272 OrderAccess::release_store_ptr(p, v);
273 }
274 inline void oopDesc::release_encode_store_heap_oop(
275 volatile narrowOop* p, oop v) {
276 OrderAccess::release_store(p, encode_heap_oop(v));
277 }
280 // These functions are only used to exchange oop fields in instances,
281 // not headers.
282 inline oop oopDesc::atomic_exchange_oop(oop exchange_value, volatile HeapWord *dest) {
283 if (UseCompressedOops) {
284 // encode exchange value from oop to T
285 narrowOop val = encode_heap_oop(exchange_value);
286 narrowOop old = (narrowOop)Atomic::xchg(val, (narrowOop*)dest);
287 // decode old from T to oop
288 return decode_heap_oop(old);
289 } else {
290 return (oop)Atomic::xchg_ptr(exchange_value, (oop*)dest);
291 }
292 }
294 inline oop oopDesc::atomic_compare_exchange_oop(oop exchange_value,
295 volatile HeapWord *dest,
296 oop compare_value) {
297 if (UseCompressedOops) {
298 // encode exchange and compare value from oop to T
299 narrowOop val = encode_heap_oop(exchange_value);
300 narrowOop cmp = encode_heap_oop(compare_value);
302 narrowOop old = (narrowOop) Atomic::cmpxchg(val, (narrowOop*)dest, cmp);
303 // decode old from T to oop
304 return decode_heap_oop(old);
305 } else {
306 return (oop)Atomic::cmpxchg_ptr(exchange_value, (oop*)dest, compare_value);
307 }
308 }
310 // In order to put or get a field out of an instance, must first check
311 // if the field has been compressed and uncompress it.
312 inline oop oopDesc::obj_field(int offset) const {
313 return UseCompressedOops ?
314 load_decode_heap_oop(obj_field_addr<narrowOop>(offset)) :
315 load_decode_heap_oop(obj_field_addr<oop>(offset));
316 }
317 inline void oopDesc::obj_field_put(int offset, oop value) {
318 UseCompressedOops ? oop_store(obj_field_addr<narrowOop>(offset), value) :
319 oop_store(obj_field_addr<oop>(offset), value);
320 }
321 inline void oopDesc::obj_field_raw_put(int offset, oop value) {
322 UseCompressedOops ?
323 encode_store_heap_oop(obj_field_addr<narrowOop>(offset), value) :
324 encode_store_heap_oop(obj_field_addr<oop>(offset), value);
325 }
327 inline jbyte oopDesc::byte_field(int offset) const { return (jbyte) *byte_field_addr(offset); }
328 inline void oopDesc::byte_field_put(int offset, jbyte contents) { *byte_field_addr(offset) = (jint) contents; }
330 inline jboolean oopDesc::bool_field(int offset) const { return (jboolean) *bool_field_addr(offset); }
331 inline void oopDesc::bool_field_put(int offset, jboolean contents) { *bool_field_addr(offset) = (jint) contents; }
333 inline jchar oopDesc::char_field(int offset) const { return (jchar) *char_field_addr(offset); }
334 inline void oopDesc::char_field_put(int offset, jchar contents) { *char_field_addr(offset) = (jint) contents; }
336 inline jint oopDesc::int_field(int offset) const { return *int_field_addr(offset); }
337 inline void oopDesc::int_field_put(int offset, jint contents) { *int_field_addr(offset) = contents; }
339 inline jshort oopDesc::short_field(int offset) const { return (jshort) *short_field_addr(offset); }
340 inline void oopDesc::short_field_put(int offset, jshort contents) { *short_field_addr(offset) = (jint) contents;}
342 inline jlong oopDesc::long_field(int offset) const { return *long_field_addr(offset); }
343 inline void oopDesc::long_field_put(int offset, jlong contents) { *long_field_addr(offset) = contents; }
345 inline jfloat oopDesc::float_field(int offset) const { return *float_field_addr(offset); }
346 inline void oopDesc::float_field_put(int offset, jfloat contents) { *float_field_addr(offset) = contents; }
348 inline jdouble oopDesc::double_field(int offset) const { return *double_field_addr(offset); }
349 inline void oopDesc::double_field_put(int offset, jdouble contents) { *double_field_addr(offset) = contents; }
351 inline address oopDesc::address_field(int offset) const { return *address_field_addr(offset); }
352 inline void oopDesc::address_field_put(int offset, address contents) { *address_field_addr(offset) = contents; }
354 inline oop oopDesc::obj_field_acquire(int offset) const {
355 return UseCompressedOops ?
356 decode_heap_oop((narrowOop)
357 OrderAccess::load_acquire(obj_field_addr<narrowOop>(offset)))
358 : decode_heap_oop((oop)
359 OrderAccess::load_ptr_acquire(obj_field_addr<oop>(offset)));
360 }
361 inline void oopDesc::release_obj_field_put(int offset, oop value) {
362 UseCompressedOops ?
363 oop_store((volatile narrowOop*)obj_field_addr<narrowOop>(offset), value) :
364 oop_store((volatile oop*) obj_field_addr<oop>(offset), value);
365 }
367 inline jbyte oopDesc::byte_field_acquire(int offset) const { return OrderAccess::load_acquire(byte_field_addr(offset)); }
368 inline void oopDesc::release_byte_field_put(int offset, jbyte contents) { OrderAccess::release_store(byte_field_addr(offset), contents); }
370 inline jboolean oopDesc::bool_field_acquire(int offset) const { return OrderAccess::load_acquire(bool_field_addr(offset)); }
371 inline void oopDesc::release_bool_field_put(int offset, jboolean contents) { OrderAccess::release_store(bool_field_addr(offset), contents); }
373 inline jchar oopDesc::char_field_acquire(int offset) const { return OrderAccess::load_acquire(char_field_addr(offset)); }
374 inline void oopDesc::release_char_field_put(int offset, jchar contents) { OrderAccess::release_store(char_field_addr(offset), contents); }
376 inline jint oopDesc::int_field_acquire(int offset) const { return OrderAccess::load_acquire(int_field_addr(offset)); }
377 inline void oopDesc::release_int_field_put(int offset, jint contents) { OrderAccess::release_store(int_field_addr(offset), contents); }
379 inline jshort oopDesc::short_field_acquire(int offset) const { return (jshort)OrderAccess::load_acquire(short_field_addr(offset)); }
380 inline void oopDesc::release_short_field_put(int offset, jshort contents) { OrderAccess::release_store(short_field_addr(offset), contents); }
382 inline jlong oopDesc::long_field_acquire(int offset) const { return OrderAccess::load_acquire(long_field_addr(offset)); }
383 inline void oopDesc::release_long_field_put(int offset, jlong contents) { OrderAccess::release_store(long_field_addr(offset), contents); }
385 inline jfloat oopDesc::float_field_acquire(int offset) const { return OrderAccess::load_acquire(float_field_addr(offset)); }
386 inline void oopDesc::release_float_field_put(int offset, jfloat contents) { OrderAccess::release_store(float_field_addr(offset), contents); }
388 inline jdouble oopDesc::double_field_acquire(int offset) const { return OrderAccess::load_acquire(double_field_addr(offset)); }
389 inline void oopDesc::release_double_field_put(int offset, jdouble contents) { OrderAccess::release_store(double_field_addr(offset), contents); }
391 inline address oopDesc::address_field_acquire(int offset) const { return (address) OrderAccess::load_ptr_acquire(address_field_addr(offset)); }
392 inline void oopDesc::release_address_field_put(int offset, address contents) { OrderAccess::release_store_ptr(address_field_addr(offset), contents); }
394 inline int oopDesc::size_given_klass(Klass* klass) {
395 int lh = klass->layout_helper();
396 int s = lh >> LogHeapWordSize; // deliver size scaled by wordSize
398 // lh is now a value computed at class initialization that may hint
399 // at the size. For instances, this is positive and equal to the
400 // size. For arrays, this is negative and provides log2 of the
401 // array element size. For other oops, it is zero and thus requires
402 // a virtual call.
403 //
404 // We go to all this trouble because the size computation is at the
405 // heart of phase 2 of mark-compaction, and called for every object,
406 // alive or dead. So the speed here is equal in importance to the
407 // speed of allocation.
409 if (lh <= Klass::_lh_neutral_value) {
410 // The most common case is instances; fall through if so.
411 if (lh < Klass::_lh_neutral_value) {
412 // Second most common case is arrays. We have to fetch the
413 // length of the array, shift (multiply) it appropriately,
414 // up to wordSize, add the header, and align to object size.
415 size_t size_in_bytes;
416 #ifdef _M_IA64
417 // The Windows Itanium Aug 2002 SDK hoists this load above
418 // the check for s < 0. An oop at the end of the heap will
419 // cause an access violation if this load is performed on a non
420 // array oop. Making the reference volatile prohibits this.
421 // (%%% please explain by what magic the length is actually fetched!)
422 volatile int *array_length;
423 array_length = (volatile int *)( (intptr_t)this +
424 arrayOopDesc::length_offset_in_bytes() );
425 assert(array_length > 0, "Integer arithmetic problem somewhere");
426 // Put into size_t to avoid overflow.
427 size_in_bytes = (size_t) array_length;
428 size_in_bytes = size_in_bytes << Klass::layout_helper_log2_element_size(lh);
429 #else
430 size_t array_length = (size_t) ((arrayOop)this)->length();
431 size_in_bytes = array_length << Klass::layout_helper_log2_element_size(lh);
432 #endif
433 size_in_bytes += Klass::layout_helper_header_size(lh);
435 // This code could be simplified, but by keeping array_header_in_bytes
436 // in units of bytes and doing it this way we can round up just once,
437 // skipping the intermediate round to HeapWordSize. Cast the result
438 // of round_to to size_t to guarantee unsigned division == right shift.
439 s = (int)((size_t)round_to(size_in_bytes, MinObjAlignmentInBytes) /
440 HeapWordSize);
442 // UseParNewGC, UseParallelGC and UseG1GC can change the length field
443 // of an "old copy" of an object array in the young gen so it indicates
444 // the grey portion of an already copied array. This will cause the first
445 // disjunct below to fail if the two comparands are computed across such
446 // a concurrent change.
447 // UseParNewGC also runs with promotion labs (which look like int
448 // filler arrays) which are subject to changing their declared size
449 // when finally retiring a PLAB; this also can cause the first disjunct
450 // to fail for another worker thread that is concurrently walking the block
451 // offset table. Both these invariant failures are benign for their
452 // current uses; we relax the assertion checking to cover these two cases below:
453 // is_objArray() && is_forwarded() // covers first scenario above
454 // || is_typeArray() // covers second scenario above
455 // If and when UseParallelGC uses the same obj array oop stealing/chunking
456 // technique, we will need to suitably modify the assertion.
457 assert((s == klass->oop_size(this)) ||
458 (Universe::heap()->is_gc_active() &&
459 ((is_typeArray() && UseParNewGC) ||
460 (is_objArray() && is_forwarded() && (UseParNewGC || UseParallelGC || UseG1GC)))),
461 "wrong array object size");
462 } else {
463 // Must be zero, so bite the bullet and take the virtual call.
464 s = klass->oop_size(this);
465 }
466 }
468 assert(s % MinObjAlignment == 0, "alignment check");
469 assert(s > 0, "Bad size calculated");
470 return s;
471 }
474 inline int oopDesc::size() {
475 return size_given_klass(blueprint());
476 }
478 inline bool oopDesc::is_parsable() {
479 return blueprint()->oop_is_parsable(this);
480 }
482 inline bool oopDesc::is_conc_safe() {
483 return blueprint()->oop_is_conc_safe(this);
484 }
486 inline void update_barrier_set(void* p, oop v) {
487 assert(oopDesc::bs() != NULL, "Uninitialized bs in oop!");
488 oopDesc::bs()->write_ref_field(p, v);
489 }
491 template <class T> inline void update_barrier_set_pre(T* p, oop v) {
492 oopDesc::bs()->write_ref_field_pre(p, v);
493 }
495 template <class T> inline void oop_store(T* p, oop v) {
496 if (always_do_update_barrier) {
497 oop_store((volatile T*)p, v);
498 } else {
499 update_barrier_set_pre(p, v);
500 oopDesc::encode_store_heap_oop(p, v);
501 update_barrier_set((void*)p, v); // cast away type
502 }
503 }
505 template <class T> inline void oop_store(volatile T* p, oop v) {
506 update_barrier_set_pre((T*)p, v); // cast away volatile
507 // Used by release_obj_field_put, so use release_store_ptr.
508 oopDesc::release_encode_store_heap_oop(p, v);
509 update_barrier_set((void*)p, v); // cast away type
510 }
512 template <class T> inline void oop_store_without_check(T* p, oop v) {
513 // XXX YSR FIX ME!!!
514 if (always_do_update_barrier) {
515 oop_store(p, v);
516 } else {
517 assert(!Universe::heap()->barrier_set()->write_ref_needs_barrier(p, v),
518 "oop store without store check failed");
519 oopDesc::encode_store_heap_oop(p, v);
520 }
521 }
523 // When it absolutely has to get there.
524 template <class T> inline void oop_store_without_check(volatile T* p, oop v) {
525 // XXX YSR FIX ME!!!
526 if (always_do_update_barrier) {
527 oop_store(p, v);
528 } else {
529 assert(!Universe::heap()->barrier_set()->write_ref_needs_barrier((T*)p, v),
530 "oop store without store check failed");
531 oopDesc::release_encode_store_heap_oop(p, v);
532 }
533 }
535 // Should replace *addr = oop assignments where addr type depends on UseCompressedOops
536 // (without having to remember the function name this calls).
537 inline void oop_store_raw(HeapWord* addr, oop value) {
538 if (UseCompressedOops) {
539 oopDesc::encode_store_heap_oop((narrowOop*)addr, value);
540 } else {
541 oopDesc::encode_store_heap_oop((oop*)addr, value);
542 }
543 }
545 // Used only for markSweep, scavenging
546 inline bool oopDesc::is_gc_marked() const {
547 return mark()->is_marked();
548 }
550 inline bool oopDesc::is_locked() const {
551 return mark()->is_locked();
552 }
554 inline bool oopDesc::is_unlocked() const {
555 return mark()->is_unlocked();
556 }
558 inline bool oopDesc::has_bias_pattern() const {
559 return mark()->has_bias_pattern();
560 }
563 // used only for asserts
564 inline bool oopDesc::is_oop(bool ignore_mark_word) const {
565 oop obj = (oop) this;
566 if (!check_obj_alignment(obj)) return false;
567 if (!Universe::heap()->is_in_reserved(obj)) return false;
568 // obj is aligned and accessible in heap
569 // try to find metaclass cycle safely without seg faulting on bad input
570 // we should reach klassKlassObj by following klass link at most 3 times
571 for (int i = 0; i < 3; i++) {
572 obj = obj->klass_or_null();
573 // klass should be aligned and in permspace
574 if (!check_obj_alignment(obj)) return false;
575 if (!Universe::heap()->is_in_permanent(obj)) return false;
576 }
577 if (obj != Universe::klassKlassObj()) {
578 // During a dump, the _klassKlassObj moved to a shared space.
579 if (DumpSharedSpaces && Universe::klassKlassObj()->is_shared()) {
580 return true;
581 }
582 return false;
583 }
585 // Header verification: the mark is typically non-NULL. If we're
586 // at a safepoint, it must not be null.
587 // Outside of a safepoint, the header could be changing (for example,
588 // another thread could be inflating a lock on this object).
589 if (ignore_mark_word) {
590 return true;
591 }
592 if (mark() != NULL) {
593 return true;
594 }
595 return !SafepointSynchronize::is_at_safepoint();
596 }
599 // used only for asserts
600 inline bool oopDesc::is_oop_or_null(bool ignore_mark_word) const {
601 return this == NULL ? true : is_oop(ignore_mark_word);
602 }
604 #ifndef PRODUCT
605 // used only for asserts
606 inline bool oopDesc::is_unlocked_oop() const {
607 if (!Universe::heap()->is_in_reserved(this)) return false;
608 return mark()->is_unlocked();
609 }
610 #endif // PRODUCT
612 inline void oopDesc::follow_header() {
613 if (UseCompressedOops) {
614 MarkSweep::mark_and_push(compressed_klass_addr());
615 } else {
616 MarkSweep::mark_and_push(klass_addr());
617 }
618 }
620 inline void oopDesc::follow_contents(void) {
621 assert (is_gc_marked(), "should be marked");
622 blueprint()->oop_follow_contents(this);
623 }
626 // Used by scavengers
628 inline bool oopDesc::is_forwarded() const {
629 // The extra heap check is needed since the obj might be locked, in which case the
630 // mark would point to a stack location and have the sentinel bit cleared
631 return mark()->is_marked();
632 }
634 // Used by scavengers
635 inline void oopDesc::forward_to(oop p) {
636 assert(check_obj_alignment(p),
637 "forwarding to something not aligned");
638 assert(Universe::heap()->is_in_reserved(p),
639 "forwarding to something not in heap");
640 markOop m = markOopDesc::encode_pointer_as_mark(p);
641 assert(m->decode_pointer() == p, "encoding must be reversable");
642 set_mark(m);
643 }
645 // Used by parallel scavengers
646 inline bool oopDesc::cas_forward_to(oop p, markOop compare) {
647 assert(check_obj_alignment(p),
648 "forwarding to something not aligned");
649 assert(Universe::heap()->is_in_reserved(p),
650 "forwarding to something not in heap");
651 markOop m = markOopDesc::encode_pointer_as_mark(p);
652 assert(m->decode_pointer() == p, "encoding must be reversable");
653 return cas_set_mark(m, compare) == compare;
654 }
656 // Note that the forwardee is not the same thing as the displaced_mark.
657 // The forwardee is used when copying during scavenge and mark-sweep.
658 // It does need to clear the low two locking- and GC-related bits.
659 inline oop oopDesc::forwardee() const {
660 return (oop) mark()->decode_pointer();
661 }
663 inline bool oopDesc::has_displaced_mark() const {
664 return mark()->has_displaced_mark_helper();
665 }
667 inline markOop oopDesc::displaced_mark() const {
668 return mark()->displaced_mark_helper();
669 }
671 inline void oopDesc::set_displaced_mark(markOop m) {
672 mark()->set_displaced_mark_helper(m);
673 }
675 // The following method needs to be MT safe.
676 inline int oopDesc::age() const {
677 assert(!is_forwarded(), "Attempt to read age from forwarded mark");
678 if (has_displaced_mark()) {
679 return displaced_mark()->age();
680 } else {
681 return mark()->age();
682 }
683 }
685 inline void oopDesc::incr_age() {
686 assert(!is_forwarded(), "Attempt to increment age of forwarded mark");
687 if (has_displaced_mark()) {
688 set_displaced_mark(displaced_mark()->incr_age());
689 } else {
690 set_mark(mark()->incr_age());
691 }
692 }
695 inline intptr_t oopDesc::identity_hash() {
696 // Fast case; if the object is unlocked and the hash value is set, no locking is needed
697 // Note: The mark must be read into local variable to avoid concurrent updates.
698 markOop mrk = mark();
699 if (mrk->is_unlocked() && !mrk->has_no_hash()) {
700 return mrk->hash();
701 } else if (mrk->is_marked()) {
702 return mrk->hash();
703 } else {
704 return slow_identity_hash();
705 }
706 }
708 inline void oopDesc::oop_iterate_header(OopClosure* blk) {
709 if (UseCompressedOops) {
710 blk->do_oop(compressed_klass_addr());
711 } else {
712 blk->do_oop(klass_addr());
713 }
714 }
716 inline void oopDesc::oop_iterate_header(OopClosure* blk, MemRegion mr) {
717 if (UseCompressedOops) {
718 if (mr.contains(compressed_klass_addr())) {
719 blk->do_oop(compressed_klass_addr());
720 }
721 } else {
722 if (mr.contains(klass_addr())) blk->do_oop(klass_addr());
723 }
724 }
726 inline int oopDesc::adjust_pointers() {
727 debug_only(int check_size = size());
728 int s = blueprint()->oop_adjust_pointers(this);
729 assert(s == check_size, "should be the same");
730 return s;
731 }
733 inline void oopDesc::adjust_header() {
734 if (UseCompressedOops) {
735 MarkSweep::adjust_pointer(compressed_klass_addr());
736 } else {
737 MarkSweep::adjust_pointer(klass_addr());
738 }
739 }
741 #define OOP_ITERATE_DEFN(OopClosureType, nv_suffix) \
742 \
743 inline int oopDesc::oop_iterate(OopClosureType* blk) { \
744 SpecializationStats::record_call(); \
745 return blueprint()->oop_oop_iterate##nv_suffix(this, blk); \
746 } \
747 \
748 inline int oopDesc::oop_iterate(OopClosureType* blk, MemRegion mr) { \
749 SpecializationStats::record_call(); \
750 return blueprint()->oop_oop_iterate##nv_suffix##_m(this, blk, mr); \
751 }
753 ALL_OOP_OOP_ITERATE_CLOSURES_1(OOP_ITERATE_DEFN)
754 ALL_OOP_OOP_ITERATE_CLOSURES_2(OOP_ITERATE_DEFN)
756 #ifndef SERIALGC
757 #define OOP_ITERATE_BACKWARDS_DEFN(OopClosureType, nv_suffix) \
758 \
759 inline int oopDesc::oop_iterate_backwards(OopClosureType* blk) { \
760 SpecializationStats::record_call(); \
761 return blueprint()->oop_oop_iterate_backwards##nv_suffix(this, blk); \
762 }
764 ALL_OOP_OOP_ITERATE_CLOSURES_1(OOP_ITERATE_BACKWARDS_DEFN)
765 ALL_OOP_OOP_ITERATE_CLOSURES_2(OOP_ITERATE_BACKWARDS_DEFN)
766 #endif // !SERIALGC
768 inline bool oopDesc::is_shared() const {
769 return CompactingPermGenGen::is_shared(this);
770 }
772 inline bool oopDesc::is_shared_readonly() const {
773 return CompactingPermGenGen::is_shared_readonly(this);
774 }
776 inline bool oopDesc::is_shared_readwrite() const {
777 return CompactingPermGenGen::is_shared_readwrite(this);
778 }
780 #endif // SHARE_VM_OOPS_OOP_INLINE_HPP