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 | // oopDesc is the top baseclass for objects classes. The {name}Desc classes describe |
duke@435 | 26 | // the format of Java objects so the fields can be accessed from C++. |
duke@435 | 27 | // oopDesc is abstract. |
duke@435 | 28 | // (see oopHierarchy for complete oop class hierarchy) |
duke@435 | 29 | // |
duke@435 | 30 | // no virtual functions allowed |
duke@435 | 31 | |
duke@435 | 32 | // store into oop with store check |
phh@1558 | 33 | template <class T> inline void oop_store(T* p, oop v); |
phh@1558 | 34 | template <class T> inline void oop_store(volatile T* p, oop v); |
duke@435 | 35 | |
duke@435 | 36 | // store into oop without store check |
phh@1558 | 37 | template <class T> inline void oop_store_without_check(T* p, oop v); |
phh@1558 | 38 | template <class T> inline void oop_store_without_check(volatile T* p, oop v); |
duke@435 | 39 | |
duke@435 | 40 | extern bool always_do_update_barrier; |
duke@435 | 41 | |
duke@435 | 42 | // Forward declarations. |
duke@435 | 43 | class OopClosure; |
duke@435 | 44 | class ScanClosure; |
duke@435 | 45 | class FastScanClosure; |
duke@435 | 46 | class FilteringClosure; |
duke@435 | 47 | class BarrierSet; |
duke@435 | 48 | class CMSIsAliveClosure; |
duke@435 | 49 | |
duke@435 | 50 | class PSPromotionManager; |
duke@435 | 51 | class ParCompactionManager; |
duke@435 | 52 | |
duke@435 | 53 | class oopDesc { |
duke@435 | 54 | friend class VMStructs; |
duke@435 | 55 | private: |
duke@435 | 56 | volatile markOop _mark; |
coleenp@548 | 57 | union _metadata { |
coleenp@548 | 58 | wideKlassOop _klass; |
coleenp@548 | 59 | narrowOop _compressed_klass; |
coleenp@548 | 60 | } _metadata; |
duke@435 | 61 | |
duke@435 | 62 | // Fast access to barrier set. Must be initialized. |
duke@435 | 63 | static BarrierSet* _bs; |
duke@435 | 64 | |
duke@435 | 65 | public: |
duke@435 | 66 | markOop mark() const { return _mark; } |
duke@435 | 67 | markOop* mark_addr() const { return (markOop*) &_mark; } |
duke@435 | 68 | |
duke@435 | 69 | void set_mark(volatile markOop m) { _mark = m; } |
duke@435 | 70 | |
duke@435 | 71 | void release_set_mark(markOop m); |
duke@435 | 72 | markOop cas_set_mark(markOop new_mark, markOop old_mark); |
duke@435 | 73 | |
duke@435 | 74 | // Used only to re-initialize the mark word (e.g., of promoted |
duke@435 | 75 | // objects during a GC) -- requires a valid klass pointer |
duke@435 | 76 | void init_mark(); |
duke@435 | 77 | |
coleenp@548 | 78 | klassOop klass() const; |
coleenp@602 | 79 | klassOop klass_or_null() const volatile; |
coleenp@548 | 80 | oop* klass_addr(); |
coleenp@548 | 81 | narrowOop* compressed_klass_addr(); |
duke@435 | 82 | |
duke@435 | 83 | void set_klass(klassOop k); |
coleenp@602 | 84 | |
coleenp@602 | 85 | // For klass field compression |
coleenp@602 | 86 | int klass_gap() const; |
coleenp@602 | 87 | void set_klass_gap(int z); |
duke@435 | 88 | // For when the klass pointer is being used as a linked list "next" field. |
duke@435 | 89 | void set_klass_to_list_ptr(oop k); |
duke@435 | 90 | |
coleenp@548 | 91 | // size of object header, aligned to platform wordSize |
coleenp@548 | 92 | static int header_size() { return sizeof(oopDesc)/HeapWordSize; } |
duke@435 | 93 | |
duke@435 | 94 | Klass* blueprint() const; |
duke@435 | 95 | |
duke@435 | 96 | // Returns whether this is an instance of k or an instance of a subclass of k |
duke@435 | 97 | bool is_a(klassOop k) const; |
duke@435 | 98 | |
duke@435 | 99 | // Returns the actual oop size of the object |
duke@435 | 100 | int size(); |
duke@435 | 101 | |
duke@435 | 102 | // Sometimes (for complicated concurrency-related reasons), it is useful |
duke@435 | 103 | // to be able to figure out the size of an object knowing its klass. |
duke@435 | 104 | int size_given_klass(Klass* klass); |
duke@435 | 105 | |
duke@435 | 106 | // Some perm gen objects are not parseble immediately after |
duke@435 | 107 | // installation of their klass pointer. |
duke@435 | 108 | bool is_parsable(); |
duke@435 | 109 | |
jmasa@953 | 110 | // Some perm gen objects that have been allocated and initialized |
jmasa@953 | 111 | // can be changed by the VM when not at a safe point (class rededfinition |
jmasa@953 | 112 | // is an example). Such objects should not be examined by the |
jmasa@953 | 113 | // concurrent processing of a garbage collector if is_conc_safe() |
jmasa@953 | 114 | // returns false. |
jmasa@953 | 115 | bool is_conc_safe(); |
jmasa@953 | 116 | |
duke@435 | 117 | // type test operations (inlined in oop.inline.h) |
duke@435 | 118 | bool is_instance() const; |
duke@435 | 119 | bool is_instanceRef() const; |
duke@435 | 120 | bool is_array() const; |
duke@435 | 121 | bool is_objArray() const; |
duke@435 | 122 | bool is_symbol() const; |
duke@435 | 123 | bool is_klass() const; |
duke@435 | 124 | bool is_thread() const; |
duke@435 | 125 | bool is_method() const; |
duke@435 | 126 | bool is_constMethod() const; |
duke@435 | 127 | bool is_methodData() const; |
duke@435 | 128 | bool is_constantPool() const; |
duke@435 | 129 | bool is_constantPoolCache() const; |
duke@435 | 130 | bool is_typeArray() const; |
duke@435 | 131 | bool is_javaArray() const; |
duke@435 | 132 | bool is_compiledICHolder() const; |
duke@435 | 133 | |
duke@435 | 134 | private: |
duke@435 | 135 | // field addresses in oop |
duke@435 | 136 | void* field_base(int offset) const; |
duke@435 | 137 | |
duke@435 | 138 | jbyte* byte_field_addr(int offset) const; |
duke@435 | 139 | jchar* char_field_addr(int offset) const; |
duke@435 | 140 | jboolean* bool_field_addr(int offset) const; |
duke@435 | 141 | jint* int_field_addr(int offset) const; |
duke@435 | 142 | jshort* short_field_addr(int offset) const; |
duke@435 | 143 | jlong* long_field_addr(int offset) const; |
duke@435 | 144 | jfloat* float_field_addr(int offset) const; |
duke@435 | 145 | jdouble* double_field_addr(int offset) const; |
coleenp@548 | 146 | address* address_field_addr(int offset) const; |
duke@435 | 147 | |
duke@435 | 148 | public: |
coleenp@548 | 149 | // Need this as public for garbage collection. |
coleenp@548 | 150 | template <class T> T* obj_field_addr(int offset) const; |
duke@435 | 151 | |
coleenp@570 | 152 | // Oop encoding heap max |
coleenp@570 | 153 | static const uint64_t OopEncodingHeapMax = |
coleenp@570 | 154 | (uint64_t(max_juint) + 1) << LogMinObjAlignmentInBytes; |
coleenp@570 | 155 | |
coleenp@548 | 156 | static bool is_null(oop obj); |
coleenp@548 | 157 | static bool is_null(narrowOop obj); |
coleenp@548 | 158 | |
coleenp@548 | 159 | // Decode an oop pointer from a narrowOop if compressed. |
coleenp@548 | 160 | // These are overloaded for oop and narrowOop as are the other functions |
coleenp@548 | 161 | // below so that they can be called in template functions. |
coleenp@548 | 162 | static oop decode_heap_oop_not_null(oop v); |
coleenp@548 | 163 | static oop decode_heap_oop_not_null(narrowOop v); |
coleenp@548 | 164 | static oop decode_heap_oop(oop v); |
coleenp@548 | 165 | static oop decode_heap_oop(narrowOop v); |
coleenp@548 | 166 | |
coleenp@548 | 167 | // Encode an oop pointer to a narrow oop. The or_null versions accept |
coleenp@548 | 168 | // null oop pointer, others do not in order to eliminate the |
coleenp@548 | 169 | // null checking branches. |
coleenp@548 | 170 | static narrowOop encode_heap_oop_not_null(oop v); |
coleenp@548 | 171 | static narrowOop encode_heap_oop(oop v); |
coleenp@548 | 172 | |
coleenp@548 | 173 | // Load an oop out of the Java heap |
coleenp@548 | 174 | static narrowOop load_heap_oop(narrowOop* p); |
coleenp@548 | 175 | static oop load_heap_oop(oop* p); |
coleenp@548 | 176 | |
coleenp@548 | 177 | // Load an oop out of Java heap and decode it to an uncompressed oop. |
coleenp@548 | 178 | static oop load_decode_heap_oop_not_null(narrowOop* p); |
coleenp@548 | 179 | static oop load_decode_heap_oop_not_null(oop* p); |
coleenp@548 | 180 | static oop load_decode_heap_oop(narrowOop* p); |
coleenp@548 | 181 | static oop load_decode_heap_oop(oop* p); |
coleenp@548 | 182 | |
coleenp@548 | 183 | // Store an oop into the heap. |
coleenp@548 | 184 | static void store_heap_oop(narrowOop* p, narrowOop v); |
coleenp@548 | 185 | static void store_heap_oop(oop* p, oop v); |
coleenp@548 | 186 | |
coleenp@548 | 187 | // Encode oop if UseCompressedOops and store into the heap. |
coleenp@548 | 188 | static void encode_store_heap_oop_not_null(narrowOop* p, oop v); |
coleenp@548 | 189 | static void encode_store_heap_oop_not_null(oop* p, oop v); |
coleenp@548 | 190 | static void encode_store_heap_oop(narrowOop* p, oop v); |
coleenp@548 | 191 | static void encode_store_heap_oop(oop* p, oop v); |
coleenp@548 | 192 | |
coleenp@548 | 193 | static void release_store_heap_oop(volatile narrowOop* p, narrowOop v); |
coleenp@548 | 194 | static void release_store_heap_oop(volatile oop* p, oop v); |
coleenp@548 | 195 | |
coleenp@548 | 196 | static void release_encode_store_heap_oop_not_null(volatile narrowOop* p, oop v); |
coleenp@548 | 197 | static void release_encode_store_heap_oop_not_null(volatile oop* p, oop v); |
coleenp@548 | 198 | static void release_encode_store_heap_oop(volatile narrowOop* p, oop v); |
coleenp@548 | 199 | static void release_encode_store_heap_oop(volatile oop* p, oop v); |
coleenp@548 | 200 | |
coleenp@548 | 201 | static oop atomic_exchange_oop(oop exchange_value, volatile HeapWord *dest); |
coleenp@548 | 202 | static oop atomic_compare_exchange_oop(oop exchange_value, |
coleenp@548 | 203 | volatile HeapWord *dest, |
coleenp@548 | 204 | oop compare_value); |
coleenp@548 | 205 | |
coleenp@548 | 206 | // Access to fields in a instanceOop through these methods. |
duke@435 | 207 | oop obj_field(int offset) const; |
duke@435 | 208 | void obj_field_put(int offset, oop value); |
coleenp@548 | 209 | void obj_field_raw_put(int offset, oop value); |
duke@435 | 210 | |
duke@435 | 211 | jbyte byte_field(int offset) const; |
duke@435 | 212 | void byte_field_put(int offset, jbyte contents); |
duke@435 | 213 | |
duke@435 | 214 | jchar char_field(int offset) const; |
duke@435 | 215 | void char_field_put(int offset, jchar contents); |
duke@435 | 216 | |
duke@435 | 217 | jboolean bool_field(int offset) const; |
duke@435 | 218 | void bool_field_put(int offset, jboolean contents); |
duke@435 | 219 | |
duke@435 | 220 | jint int_field(int offset) const; |
duke@435 | 221 | void int_field_put(int offset, jint contents); |
duke@435 | 222 | |
duke@435 | 223 | jshort short_field(int offset) const; |
duke@435 | 224 | void short_field_put(int offset, jshort contents); |
duke@435 | 225 | |
duke@435 | 226 | jlong long_field(int offset) const; |
duke@435 | 227 | void long_field_put(int offset, jlong contents); |
duke@435 | 228 | |
duke@435 | 229 | jfloat float_field(int offset) const; |
duke@435 | 230 | void float_field_put(int offset, jfloat contents); |
duke@435 | 231 | |
duke@435 | 232 | jdouble double_field(int offset) const; |
duke@435 | 233 | void double_field_put(int offset, jdouble contents); |
duke@435 | 234 | |
coleenp@548 | 235 | address address_field(int offset) const; |
coleenp@548 | 236 | void address_field_put(int offset, address contents); |
coleenp@548 | 237 | |
duke@435 | 238 | oop obj_field_acquire(int offset) const; |
duke@435 | 239 | void release_obj_field_put(int offset, oop value); |
duke@435 | 240 | |
duke@435 | 241 | jbyte byte_field_acquire(int offset) const; |
duke@435 | 242 | void release_byte_field_put(int offset, jbyte contents); |
duke@435 | 243 | |
duke@435 | 244 | jchar char_field_acquire(int offset) const; |
duke@435 | 245 | void release_char_field_put(int offset, jchar contents); |
duke@435 | 246 | |
duke@435 | 247 | jboolean bool_field_acquire(int offset) const; |
duke@435 | 248 | void release_bool_field_put(int offset, jboolean contents); |
duke@435 | 249 | |
duke@435 | 250 | jint int_field_acquire(int offset) const; |
duke@435 | 251 | void release_int_field_put(int offset, jint contents); |
duke@435 | 252 | |
duke@435 | 253 | jshort short_field_acquire(int offset) const; |
duke@435 | 254 | void release_short_field_put(int offset, jshort contents); |
duke@435 | 255 | |
duke@435 | 256 | jlong long_field_acquire(int offset) const; |
duke@435 | 257 | void release_long_field_put(int offset, jlong contents); |
duke@435 | 258 | |
duke@435 | 259 | jfloat float_field_acquire(int offset) const; |
duke@435 | 260 | void release_float_field_put(int offset, jfloat contents); |
duke@435 | 261 | |
duke@435 | 262 | jdouble double_field_acquire(int offset) const; |
duke@435 | 263 | void release_double_field_put(int offset, jdouble contents); |
duke@435 | 264 | |
jrose@1145 | 265 | address address_field_acquire(int offset) const; |
jrose@1145 | 266 | void release_address_field_put(int offset, address contents); |
jrose@1145 | 267 | |
duke@435 | 268 | // printing functions for VM debugging |
duke@435 | 269 | void print_on(outputStream* st) const; // First level print |
duke@435 | 270 | void print_value_on(outputStream* st) const; // Second level print. |
duke@435 | 271 | void print_address_on(outputStream* st) const; // Address printing |
duke@435 | 272 | |
duke@435 | 273 | // printing on default output stream |
duke@435 | 274 | void print(); |
duke@435 | 275 | void print_value(); |
duke@435 | 276 | void print_address(); |
duke@435 | 277 | |
duke@435 | 278 | // return the print strings |
duke@435 | 279 | char* print_string(); |
duke@435 | 280 | char* print_value_string(); |
duke@435 | 281 | |
duke@435 | 282 | // verification operations |
duke@435 | 283 | void verify_on(outputStream* st); |
duke@435 | 284 | void verify(); |
duke@435 | 285 | void verify_old_oop(oop* p, bool allow_dirty); |
coleenp@548 | 286 | void verify_old_oop(narrowOop* p, bool allow_dirty); |
duke@435 | 287 | |
duke@435 | 288 | // tells whether this oop is partially constructed (gc during class loading) |
duke@435 | 289 | bool partially_loaded(); |
duke@435 | 290 | void set_partially_loaded(); |
duke@435 | 291 | |
duke@435 | 292 | // locking operations |
duke@435 | 293 | bool is_locked() const; |
duke@435 | 294 | bool is_unlocked() const; |
duke@435 | 295 | bool has_bias_pattern() const; |
duke@435 | 296 | |
duke@435 | 297 | // asserts |
duke@435 | 298 | bool is_oop(bool ignore_mark_word = false) const; |
duke@435 | 299 | bool is_oop_or_null(bool ignore_mark_word = false) const; |
duke@435 | 300 | #ifndef PRODUCT |
duke@435 | 301 | bool is_unlocked_oop() const; |
duke@435 | 302 | #endif |
duke@435 | 303 | |
duke@435 | 304 | // garbage collection |
duke@435 | 305 | bool is_gc_marked() const; |
duke@435 | 306 | // Apply "MarkSweep::mark_and_push" to (the address of) every non-NULL |
duke@435 | 307 | // reference field in "this". |
coleenp@548 | 308 | void follow_contents(void); |
coleenp@548 | 309 | void follow_header(void); |
duke@435 | 310 | |
duke@435 | 311 | #ifndef SERIALGC |
duke@435 | 312 | // Parallel Scavenge |
duke@435 | 313 | void copy_contents(PSPromotionManager* pm); |
duke@435 | 314 | void push_contents(PSPromotionManager* pm); |
duke@435 | 315 | |
duke@435 | 316 | // Parallel Old |
duke@435 | 317 | void update_contents(ParCompactionManager* cm); |
duke@435 | 318 | void update_contents(ParCompactionManager* cm, |
duke@435 | 319 | HeapWord* begin_limit, |
duke@435 | 320 | HeapWord* end_limit); |
duke@435 | 321 | void update_contents(ParCompactionManager* cm, |
duke@435 | 322 | klassOop old_klass, |
duke@435 | 323 | HeapWord* begin_limit, |
duke@435 | 324 | HeapWord* end_limit); |
duke@435 | 325 | |
duke@435 | 326 | void follow_contents(ParCompactionManager* cm); |
duke@435 | 327 | void follow_header(ParCompactionManager* cm); |
duke@435 | 328 | #endif // SERIALGC |
duke@435 | 329 | |
duke@435 | 330 | bool is_perm() const; |
duke@435 | 331 | bool is_perm_or_null() const; |
jrose@1424 | 332 | bool is_scavengable() const; |
duke@435 | 333 | bool is_shared() const; |
duke@435 | 334 | bool is_shared_readonly() const; |
duke@435 | 335 | bool is_shared_readwrite() const; |
duke@435 | 336 | |
duke@435 | 337 | // Forward pointer operations for scavenge |
duke@435 | 338 | bool is_forwarded() const; |
duke@435 | 339 | |
duke@435 | 340 | void forward_to(oop p); |
duke@435 | 341 | bool cas_forward_to(oop p, markOop compare); |
duke@435 | 342 | |
duke@435 | 343 | #ifndef SERIALGC |
duke@435 | 344 | // Like "forward_to", but inserts the forwarding pointer atomically. |
duke@435 | 345 | // Exactly one thread succeeds in inserting the forwarding pointer, and |
duke@435 | 346 | // this call returns "NULL" for that thread; any other thread has the |
duke@435 | 347 | // value of the forwarding pointer returned and does not modify "this". |
duke@435 | 348 | oop forward_to_atomic(oop p); |
duke@435 | 349 | #endif // SERIALGC |
duke@435 | 350 | |
duke@435 | 351 | oop forwardee() const; |
duke@435 | 352 | |
duke@435 | 353 | // Age of object during scavenge |
duke@435 | 354 | int age() const; |
duke@435 | 355 | void incr_age(); |
duke@435 | 356 | |
duke@435 | 357 | // Adjust all pointers in this object to point at it's forwarded location and |
duke@435 | 358 | // return the size of this oop. This is used by the MarkSweep collector. |
duke@435 | 359 | int adjust_pointers(); |
duke@435 | 360 | void adjust_header(); |
duke@435 | 361 | |
duke@435 | 362 | #ifndef SERIALGC |
duke@435 | 363 | // Parallel old |
duke@435 | 364 | void update_header(); |
duke@435 | 365 | void update_header(HeapWord* beg_addr, HeapWord* end_addr); |
duke@435 | 366 | #endif // SERIALGC |
duke@435 | 367 | |
duke@435 | 368 | // mark-sweep support |
duke@435 | 369 | void follow_body(int begin, int end); |
duke@435 | 370 | |
duke@435 | 371 | // Fast access to barrier set |
duke@435 | 372 | static BarrierSet* bs() { return _bs; } |
duke@435 | 373 | static void set_bs(BarrierSet* bs) { _bs = bs; } |
duke@435 | 374 | |
duke@435 | 375 | // iterators, returns size of object |
ysr@777 | 376 | #define OOP_ITERATE_DECL(OopClosureType, nv_suffix) \ |
duke@435 | 377 | int oop_iterate(OopClosureType* blk); \ |
duke@435 | 378 | int oop_iterate(OopClosureType* blk, MemRegion mr); // Only in mr. |
duke@435 | 379 | |
duke@435 | 380 | ALL_OOP_OOP_ITERATE_CLOSURES_1(OOP_ITERATE_DECL) |
ysr@777 | 381 | ALL_OOP_OOP_ITERATE_CLOSURES_2(OOP_ITERATE_DECL) |
ysr@777 | 382 | |
ysr@777 | 383 | #ifndef SERIALGC |
ysr@777 | 384 | |
ysr@777 | 385 | #define OOP_ITERATE_BACKWARDS_DECL(OopClosureType, nv_suffix) \ |
ysr@777 | 386 | int oop_iterate_backwards(OopClosureType* blk); |
ysr@777 | 387 | |
ysr@777 | 388 | ALL_OOP_OOP_ITERATE_CLOSURES_1(OOP_ITERATE_BACKWARDS_DECL) |
ysr@777 | 389 | ALL_OOP_OOP_ITERATE_CLOSURES_2(OOP_ITERATE_BACKWARDS_DECL) |
ysr@777 | 390 | #endif |
duke@435 | 391 | |
duke@435 | 392 | void oop_iterate_header(OopClosure* blk); |
duke@435 | 393 | void oop_iterate_header(OopClosure* blk, MemRegion mr); |
duke@435 | 394 | |
duke@435 | 395 | // identity hash; returns the identity hash key (computes it if necessary) |
duke@435 | 396 | // NOTE with the introduction of UseBiasedLocking that identity_hash() might reach a |
duke@435 | 397 | // safepoint if called on a biased object. Calling code must be aware of that. |
duke@435 | 398 | intptr_t identity_hash(); |
duke@435 | 399 | intptr_t slow_identity_hash(); |
duke@435 | 400 | |
duke@435 | 401 | // marks are forwarded to stack when object is locked |
duke@435 | 402 | bool has_displaced_mark() const; |
duke@435 | 403 | markOop displaced_mark() const; |
duke@435 | 404 | void set_displaced_mark(markOop m); |
duke@435 | 405 | |
duke@435 | 406 | // for code generation |
duke@435 | 407 | static int mark_offset_in_bytes() { return offset_of(oopDesc, _mark); } |
coleenp@548 | 408 | static int klass_offset_in_bytes() { return offset_of(oopDesc, _metadata._klass); } |
coleenp@548 | 409 | static int klass_gap_offset_in_bytes(); |
duke@435 | 410 | }; |