Tue, 08 Aug 2017 15:57:29 +0800
merge
aoqi@0 | 1 | /* |
aoqi@0 | 2 | * Copyright (c) 1997, 2014, Oracle and/or its affiliates. All rights reserved. |
aoqi@0 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
aoqi@0 | 4 | * |
aoqi@0 | 5 | * This code is free software; you can redistribute it and/or modify it |
aoqi@0 | 6 | * under the terms of the GNU General Public License version 2 only, as |
aoqi@0 | 7 | * published by the Free Software Foundation. |
aoqi@0 | 8 | * |
aoqi@0 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
aoqi@0 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
aoqi@0 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
aoqi@0 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
aoqi@0 | 13 | * accompanied this code). |
aoqi@0 | 14 | * |
aoqi@0 | 15 | * You should have received a copy of the GNU General Public License version |
aoqi@0 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
aoqi@0 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
aoqi@0 | 18 | * |
aoqi@0 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
aoqi@0 | 20 | * or visit www.oracle.com if you need additional information or have any |
aoqi@0 | 21 | * questions. |
aoqi@0 | 22 | * |
aoqi@0 | 23 | */ |
aoqi@0 | 24 | |
aoqi@0 | 25 | #ifndef SHARE_VM_OOPS_OOP_HPP |
aoqi@0 | 26 | #define SHARE_VM_OOPS_OOP_HPP |
aoqi@0 | 27 | |
aoqi@0 | 28 | #include "memory/iterator.hpp" |
aoqi@0 | 29 | #include "memory/memRegion.hpp" |
aoqi@0 | 30 | #include "memory/specialized_oop_closures.hpp" |
aoqi@0 | 31 | #include "oops/metadata.hpp" |
aoqi@0 | 32 | #include "utilities/macros.hpp" |
aoqi@0 | 33 | #include "utilities/top.hpp" |
aoqi@0 | 34 | |
aoqi@0 | 35 | // oopDesc is the top baseclass for objects classes. The {name}Desc classes describe |
aoqi@0 | 36 | // the format of Java objects so the fields can be accessed from C++. |
aoqi@0 | 37 | // oopDesc is abstract. |
aoqi@0 | 38 | // (see oopHierarchy for complete oop class hierarchy) |
aoqi@0 | 39 | // |
aoqi@0 | 40 | // no virtual functions allowed |
aoqi@0 | 41 | |
aoqi@0 | 42 | // store into oop with store check |
aoqi@0 | 43 | template <class T> void oop_store(T* p, oop v); |
aoqi@0 | 44 | template <class T> void oop_store(volatile T* p, oop v); |
aoqi@0 | 45 | |
aoqi@0 | 46 | extern bool always_do_update_barrier; |
aoqi@0 | 47 | |
aoqi@0 | 48 | // Forward declarations. |
aoqi@0 | 49 | class OopClosure; |
aoqi@0 | 50 | class ScanClosure; |
aoqi@0 | 51 | class FastScanClosure; |
aoqi@0 | 52 | class FilteringClosure; |
aoqi@0 | 53 | class BarrierSet; |
aoqi@0 | 54 | class CMSIsAliveClosure; |
aoqi@0 | 55 | |
aoqi@0 | 56 | class PSPromotionManager; |
aoqi@0 | 57 | class ParCompactionManager; |
aoqi@0 | 58 | |
aoqi@0 | 59 | class oopDesc { |
aoqi@0 | 60 | friend class VMStructs; |
aoqi@0 | 61 | private: |
aoqi@0 | 62 | volatile markOop _mark; |
aoqi@0 | 63 | union _metadata { |
aoqi@0 | 64 | Klass* _klass; |
aoqi@0 | 65 | narrowKlass _compressed_klass; |
aoqi@0 | 66 | } _metadata; |
aoqi@0 | 67 | |
aoqi@0 | 68 | // Fast access to barrier set. Must be initialized. |
aoqi@0 | 69 | static BarrierSet* _bs; |
aoqi@0 | 70 | |
aoqi@0 | 71 | public: |
aoqi@0 | 72 | markOop mark() const { return _mark; } |
aoqi@0 | 73 | markOop* mark_addr() const { return (markOop*) &_mark; } |
aoqi@0 | 74 | |
fujie@122 | 75 | void set_mark(volatile markOop m) { |
fujie@122 | 76 | #ifdef MIPS64 |
fujie@122 | 77 | if (Use3A2000) release_set_mark(m); |
fujie@122 | 78 | else |
fujie@122 | 79 | #endif |
fujie@122 | 80 | _mark = m; |
fujie@122 | 81 | } |
aoqi@0 | 82 | |
aoqi@0 | 83 | void release_set_mark(markOop m); |
aoqi@0 | 84 | markOop cas_set_mark(markOop new_mark, markOop old_mark); |
aoqi@0 | 85 | |
aoqi@0 | 86 | // Used only to re-initialize the mark word (e.g., of promoted |
aoqi@0 | 87 | // objects during a GC) -- requires a valid klass pointer |
aoqi@0 | 88 | void init_mark(); |
aoqi@0 | 89 | |
aoqi@0 | 90 | Klass* klass() const; |
aoqi@0 | 91 | Klass* klass_or_null() const volatile; |
aoqi@0 | 92 | Klass** klass_addr(); |
aoqi@0 | 93 | narrowKlass* compressed_klass_addr(); |
aoqi@0 | 94 | |
aoqi@0 | 95 | void set_klass(Klass* k); |
aoqi@0 | 96 | |
aoqi@0 | 97 | // For klass field compression |
aoqi@0 | 98 | int klass_gap() const; |
aoqi@0 | 99 | void set_klass_gap(int z); |
aoqi@0 | 100 | // For when the klass pointer is being used as a linked list "next" field. |
aoqi@0 | 101 | void set_klass_to_list_ptr(oop k); |
aoqi@0 | 102 | oop list_ptr_from_klass(); |
aoqi@0 | 103 | |
aoqi@0 | 104 | // size of object header, aligned to platform wordSize |
aoqi@0 | 105 | static int header_size() { return sizeof(oopDesc)/HeapWordSize; } |
aoqi@0 | 106 | |
aoqi@0 | 107 | // Returns whether this is an instance of k or an instance of a subclass of k |
aoqi@0 | 108 | bool is_a(Klass* k) const; |
aoqi@0 | 109 | |
aoqi@0 | 110 | // Returns the actual oop size of the object |
aoqi@0 | 111 | int size(); |
aoqi@0 | 112 | |
aoqi@0 | 113 | // Sometimes (for complicated concurrency-related reasons), it is useful |
aoqi@0 | 114 | // to be able to figure out the size of an object knowing its klass. |
aoqi@0 | 115 | int size_given_klass(Klass* klass); |
aoqi@0 | 116 | |
aoqi@0 | 117 | // type test operations (inlined in oop.inline.h) |
aoqi@0 | 118 | bool is_instance() const; |
aoqi@0 | 119 | bool is_instanceMirror() const; |
aoqi@0 | 120 | bool is_instanceRef() const; |
aoqi@0 | 121 | bool is_array() const; |
aoqi@0 | 122 | bool is_objArray() const; |
aoqi@0 | 123 | bool is_typeArray() const; |
aoqi@0 | 124 | |
aoqi@0 | 125 | private: |
aoqi@0 | 126 | // field addresses in oop |
aoqi@0 | 127 | void* field_base(int offset) const; |
aoqi@0 | 128 | |
aoqi@0 | 129 | jbyte* byte_field_addr(int offset) const; |
aoqi@0 | 130 | jchar* char_field_addr(int offset) const; |
aoqi@0 | 131 | jboolean* bool_field_addr(int offset) const; |
aoqi@0 | 132 | jint* int_field_addr(int offset) const; |
aoqi@0 | 133 | jshort* short_field_addr(int offset) const; |
aoqi@0 | 134 | jlong* long_field_addr(int offset) const; |
aoqi@0 | 135 | jfloat* float_field_addr(int offset) const; |
aoqi@0 | 136 | jdouble* double_field_addr(int offset) const; |
aoqi@0 | 137 | Metadata** metadata_field_addr(int offset) const; |
aoqi@0 | 138 | |
aoqi@0 | 139 | public: |
aoqi@0 | 140 | // Need this as public for garbage collection. |
aoqi@0 | 141 | template <class T> T* obj_field_addr(int offset) const; |
aoqi@0 | 142 | |
aoqi@0 | 143 | // Needed for javaClasses |
aoqi@0 | 144 | address* address_field_addr(int offset) const; |
aoqi@0 | 145 | |
aoqi@0 | 146 | static bool is_null(oop obj); |
aoqi@0 | 147 | static bool is_null(narrowOop obj); |
aoqi@0 | 148 | static bool is_null(Klass* obj); |
aoqi@0 | 149 | |
aoqi@0 | 150 | // Decode an oop pointer from a narrowOop if compressed. |
aoqi@0 | 151 | // These are overloaded for oop and narrowOop as are the other functions |
aoqi@0 | 152 | // below so that they can be called in template functions. |
aoqi@0 | 153 | static oop decode_heap_oop_not_null(oop v); |
aoqi@0 | 154 | static oop decode_heap_oop_not_null(narrowOop v); |
aoqi@0 | 155 | static oop decode_heap_oop(oop v); |
aoqi@0 | 156 | static oop decode_heap_oop(narrowOop v); |
aoqi@0 | 157 | |
aoqi@0 | 158 | // Encode an oop pointer to a narrow oop. The or_null versions accept |
aoqi@0 | 159 | // null oop pointer, others do not in order to eliminate the |
aoqi@0 | 160 | // null checking branches. |
aoqi@0 | 161 | static narrowOop encode_heap_oop_not_null(oop v); |
aoqi@0 | 162 | static narrowOop encode_heap_oop(oop v); |
aoqi@0 | 163 | |
aoqi@0 | 164 | // Load an oop out of the Java heap |
aoqi@0 | 165 | static narrowOop load_heap_oop(narrowOop* p); |
aoqi@0 | 166 | static oop load_heap_oop(oop* p); |
aoqi@0 | 167 | |
aoqi@0 | 168 | // Load an oop out of Java heap and decode it to an uncompressed oop. |
aoqi@0 | 169 | static oop load_decode_heap_oop_not_null(narrowOop* p); |
aoqi@0 | 170 | static oop load_decode_heap_oop_not_null(oop* p); |
aoqi@0 | 171 | static oop load_decode_heap_oop(narrowOop* p); |
aoqi@0 | 172 | static oop load_decode_heap_oop(oop* p); |
aoqi@0 | 173 | |
aoqi@0 | 174 | // Store an oop into the heap. |
aoqi@0 | 175 | static void store_heap_oop(narrowOop* p, narrowOop v); |
aoqi@0 | 176 | static void store_heap_oop(oop* p, oop v); |
aoqi@0 | 177 | |
aoqi@0 | 178 | // Encode oop if UseCompressedOops and store into the heap. |
aoqi@0 | 179 | static void encode_store_heap_oop_not_null(narrowOop* p, oop v); |
aoqi@0 | 180 | static void encode_store_heap_oop_not_null(oop* p, oop v); |
aoqi@0 | 181 | static void encode_store_heap_oop(narrowOop* p, oop v); |
aoqi@0 | 182 | static void encode_store_heap_oop(oop* p, oop v); |
aoqi@0 | 183 | |
aoqi@0 | 184 | static void release_store_heap_oop(volatile narrowOop* p, narrowOop v); |
aoqi@0 | 185 | static void release_store_heap_oop(volatile oop* p, oop v); |
aoqi@0 | 186 | |
aoqi@0 | 187 | static void release_encode_store_heap_oop_not_null(volatile narrowOop* p, oop v); |
aoqi@0 | 188 | static void release_encode_store_heap_oop_not_null(volatile oop* p, oop v); |
aoqi@0 | 189 | static void release_encode_store_heap_oop(volatile narrowOop* p, oop v); |
aoqi@0 | 190 | static void release_encode_store_heap_oop(volatile oop* p, oop v); |
aoqi@0 | 191 | |
aoqi@0 | 192 | static oop atomic_exchange_oop(oop exchange_value, volatile HeapWord *dest); |
aoqi@0 | 193 | static oop atomic_compare_exchange_oop(oop exchange_value, |
aoqi@0 | 194 | volatile HeapWord *dest, |
aoqi@0 | 195 | oop compare_value, |
aoqi@0 | 196 | bool prebarrier = false); |
aoqi@0 | 197 | |
aoqi@0 | 198 | // Access to fields in a instanceOop through these methods. |
aoqi@0 | 199 | oop obj_field(int offset) const; |
aoqi@0 | 200 | volatile oop obj_field_volatile(int offset) const; |
aoqi@0 | 201 | void obj_field_put(int offset, oop value); |
aoqi@0 | 202 | void obj_field_put_raw(int offset, oop value); |
aoqi@0 | 203 | void obj_field_put_volatile(int offset, oop value); |
aoqi@0 | 204 | |
aoqi@0 | 205 | Metadata* metadata_field(int offset) const; |
aoqi@0 | 206 | void metadata_field_put(int offset, Metadata* value); |
aoqi@0 | 207 | |
aoqi@0 | 208 | jbyte byte_field(int offset) const; |
aoqi@0 | 209 | void byte_field_put(int offset, jbyte contents); |
aoqi@0 | 210 | |
aoqi@0 | 211 | jchar char_field(int offset) const; |
aoqi@0 | 212 | void char_field_put(int offset, jchar contents); |
aoqi@0 | 213 | |
aoqi@0 | 214 | jboolean bool_field(int offset) const; |
aoqi@0 | 215 | void bool_field_put(int offset, jboolean contents); |
aoqi@0 | 216 | |
aoqi@0 | 217 | jint int_field(int offset) const; |
aoqi@0 | 218 | void int_field_put(int offset, jint contents); |
aoqi@0 | 219 | |
aoqi@0 | 220 | jshort short_field(int offset) const; |
aoqi@0 | 221 | void short_field_put(int offset, jshort contents); |
aoqi@0 | 222 | |
aoqi@0 | 223 | jlong long_field(int offset) const; |
aoqi@0 | 224 | void long_field_put(int offset, jlong contents); |
aoqi@0 | 225 | |
aoqi@0 | 226 | jfloat float_field(int offset) const; |
aoqi@0 | 227 | void float_field_put(int offset, jfloat contents); |
aoqi@0 | 228 | |
aoqi@0 | 229 | jdouble double_field(int offset) const; |
aoqi@0 | 230 | void double_field_put(int offset, jdouble contents); |
aoqi@0 | 231 | |
aoqi@0 | 232 | address address_field(int offset) const; |
aoqi@0 | 233 | void address_field_put(int offset, address contents); |
aoqi@0 | 234 | |
aoqi@0 | 235 | oop obj_field_acquire(int offset) const; |
aoqi@0 | 236 | void release_obj_field_put(int offset, oop value); |
aoqi@0 | 237 | |
aoqi@0 | 238 | jbyte byte_field_acquire(int offset) const; |
aoqi@0 | 239 | void release_byte_field_put(int offset, jbyte contents); |
aoqi@0 | 240 | |
aoqi@0 | 241 | jchar char_field_acquire(int offset) const; |
aoqi@0 | 242 | void release_char_field_put(int offset, jchar contents); |
aoqi@0 | 243 | |
aoqi@0 | 244 | jboolean bool_field_acquire(int offset) const; |
aoqi@0 | 245 | void release_bool_field_put(int offset, jboolean contents); |
aoqi@0 | 246 | |
aoqi@0 | 247 | jint int_field_acquire(int offset) const; |
aoqi@0 | 248 | void release_int_field_put(int offset, jint contents); |
aoqi@0 | 249 | |
aoqi@0 | 250 | jshort short_field_acquire(int offset) const; |
aoqi@0 | 251 | void release_short_field_put(int offset, jshort contents); |
aoqi@0 | 252 | |
aoqi@0 | 253 | jlong long_field_acquire(int offset) const; |
aoqi@0 | 254 | void release_long_field_put(int offset, jlong contents); |
aoqi@0 | 255 | |
aoqi@0 | 256 | jfloat float_field_acquire(int offset) const; |
aoqi@0 | 257 | void release_float_field_put(int offset, jfloat contents); |
aoqi@0 | 258 | |
aoqi@0 | 259 | jdouble double_field_acquire(int offset) const; |
aoqi@0 | 260 | void release_double_field_put(int offset, jdouble contents); |
aoqi@0 | 261 | |
aoqi@0 | 262 | address address_field_acquire(int offset) const; |
aoqi@0 | 263 | void release_address_field_put(int offset, address contents); |
aoqi@0 | 264 | |
aoqi@0 | 265 | // printing functions for VM debugging |
aoqi@0 | 266 | void print_on(outputStream* st) const; // First level print |
aoqi@0 | 267 | void print_value_on(outputStream* st) const; // Second level print. |
aoqi@0 | 268 | void print_address_on(outputStream* st) const; // Address printing |
aoqi@0 | 269 | |
aoqi@0 | 270 | // printing on default output stream |
aoqi@0 | 271 | void print(); |
aoqi@0 | 272 | void print_value(); |
aoqi@0 | 273 | void print_address(); |
aoqi@0 | 274 | |
aoqi@0 | 275 | // return the print strings |
aoqi@0 | 276 | char* print_string(); |
aoqi@0 | 277 | char* print_value_string(); |
aoqi@0 | 278 | |
aoqi@0 | 279 | // verification operations |
aoqi@0 | 280 | void verify_on(outputStream* st); |
aoqi@0 | 281 | void verify(); |
aoqi@0 | 282 | |
aoqi@0 | 283 | // locking operations |
aoqi@0 | 284 | bool is_locked() const; |
aoqi@0 | 285 | bool is_unlocked() const; |
aoqi@0 | 286 | bool has_bias_pattern() const; |
aoqi@0 | 287 | |
aoqi@0 | 288 | // asserts |
aoqi@0 | 289 | bool is_oop(bool ignore_mark_word = false) const; |
aoqi@0 | 290 | bool is_oop_or_null(bool ignore_mark_word = false) const; |
aoqi@0 | 291 | #ifndef PRODUCT |
aoqi@0 | 292 | bool is_unlocked_oop() const; |
aoqi@0 | 293 | #endif |
aoqi@0 | 294 | |
aoqi@0 | 295 | // garbage collection |
aoqi@0 | 296 | bool is_gc_marked() const; |
aoqi@0 | 297 | // Apply "MarkSweep::mark_and_push" to (the address of) every non-NULL |
aoqi@0 | 298 | // reference field in "this". |
aoqi@0 | 299 | void follow_contents(void); |
aoqi@0 | 300 | |
aoqi@0 | 301 | #if INCLUDE_ALL_GCS |
aoqi@0 | 302 | // Parallel Scavenge |
aoqi@0 | 303 | void push_contents(PSPromotionManager* pm); |
aoqi@0 | 304 | |
aoqi@0 | 305 | // Parallel Old |
aoqi@0 | 306 | void update_contents(ParCompactionManager* cm); |
aoqi@0 | 307 | |
aoqi@0 | 308 | void follow_contents(ParCompactionManager* cm); |
aoqi@0 | 309 | #endif // INCLUDE_ALL_GCS |
aoqi@0 | 310 | |
aoqi@0 | 311 | bool is_scavengable() const; |
aoqi@0 | 312 | |
aoqi@0 | 313 | // Forward pointer operations for scavenge |
aoqi@0 | 314 | bool is_forwarded() const; |
aoqi@0 | 315 | |
aoqi@0 | 316 | void forward_to(oop p); |
aoqi@0 | 317 | bool cas_forward_to(oop p, markOop compare); |
aoqi@0 | 318 | |
aoqi@0 | 319 | #if INCLUDE_ALL_GCS |
aoqi@0 | 320 | // Like "forward_to", but inserts the forwarding pointer atomically. |
aoqi@0 | 321 | // Exactly one thread succeeds in inserting the forwarding pointer, and |
aoqi@0 | 322 | // this call returns "NULL" for that thread; any other thread has the |
aoqi@0 | 323 | // value of the forwarding pointer returned and does not modify "this". |
aoqi@0 | 324 | oop forward_to_atomic(oop p); |
aoqi@0 | 325 | #endif // INCLUDE_ALL_GCS |
aoqi@0 | 326 | |
aoqi@0 | 327 | oop forwardee() const; |
aoqi@0 | 328 | |
aoqi@0 | 329 | // Age of object during scavenge |
aoqi@0 | 330 | uint age() const; |
aoqi@0 | 331 | void incr_age(); |
aoqi@0 | 332 | |
aoqi@0 | 333 | // Adjust all pointers in this object to point at it's forwarded location and |
aoqi@0 | 334 | // return the size of this oop. This is used by the MarkSweep collector. |
aoqi@0 | 335 | int adjust_pointers(); |
aoqi@0 | 336 | |
aoqi@0 | 337 | // mark-sweep support |
aoqi@0 | 338 | void follow_body(int begin, int end); |
aoqi@0 | 339 | |
aoqi@0 | 340 | // Fast access to barrier set |
aoqi@0 | 341 | static BarrierSet* bs() { return _bs; } |
aoqi@0 | 342 | static void set_bs(BarrierSet* bs) { _bs = bs; } |
aoqi@0 | 343 | |
aoqi@0 | 344 | // iterators, returns size of object |
aoqi@0 | 345 | #define OOP_ITERATE_DECL(OopClosureType, nv_suffix) \ |
aoqi@0 | 346 | int oop_iterate(OopClosureType* blk); \ |
aoqi@0 | 347 | int oop_iterate(OopClosureType* blk, MemRegion mr); // Only in mr. |
aoqi@0 | 348 | |
aoqi@0 | 349 | ALL_OOP_OOP_ITERATE_CLOSURES_1(OOP_ITERATE_DECL) |
aoqi@0 | 350 | ALL_OOP_OOP_ITERATE_CLOSURES_2(OOP_ITERATE_DECL) |
aoqi@0 | 351 | |
aoqi@0 | 352 | #if INCLUDE_ALL_GCS |
aoqi@0 | 353 | |
aoqi@0 | 354 | #define OOP_ITERATE_BACKWARDS_DECL(OopClosureType, nv_suffix) \ |
aoqi@0 | 355 | int oop_iterate_backwards(OopClosureType* blk); |
aoqi@0 | 356 | |
aoqi@0 | 357 | ALL_OOP_OOP_ITERATE_CLOSURES_1(OOP_ITERATE_BACKWARDS_DECL) |
aoqi@0 | 358 | ALL_OOP_OOP_ITERATE_CLOSURES_2(OOP_ITERATE_BACKWARDS_DECL) |
aoqi@0 | 359 | #endif |
aoqi@0 | 360 | |
aoqi@0 | 361 | int oop_iterate_no_header(OopClosure* bk); |
aoqi@0 | 362 | int oop_iterate_no_header(OopClosure* bk, MemRegion mr); |
aoqi@0 | 363 | |
aoqi@0 | 364 | // identity hash; returns the identity hash key (computes it if necessary) |
aoqi@0 | 365 | // NOTE with the introduction of UseBiasedLocking that identity_hash() might reach a |
aoqi@0 | 366 | // safepoint if called on a biased object. Calling code must be aware of that. |
aoqi@0 | 367 | intptr_t identity_hash(); |
aoqi@0 | 368 | intptr_t slow_identity_hash(); |
aoqi@0 | 369 | |
aoqi@0 | 370 | // Alternate hashing code if string table is rehashed |
aoqi@0 | 371 | unsigned int new_hash(juint seed); |
aoqi@0 | 372 | |
aoqi@0 | 373 | // marks are forwarded to stack when object is locked |
aoqi@0 | 374 | bool has_displaced_mark() const; |
aoqi@0 | 375 | markOop displaced_mark() const; |
aoqi@0 | 376 | void set_displaced_mark(markOop m); |
aoqi@0 | 377 | |
aoqi@0 | 378 | // for code generation |
aoqi@0 | 379 | static int mark_offset_in_bytes() { return offset_of(oopDesc, _mark); } |
aoqi@0 | 380 | static int klass_offset_in_bytes() { return offset_of(oopDesc, _metadata._klass); } |
aoqi@0 | 381 | static int klass_gap_offset_in_bytes(); |
aoqi@0 | 382 | }; |
aoqi@0 | 383 | |
aoqi@0 | 384 | #endif // SHARE_VM_OOPS_OOP_HPP |