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