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