< prev index next >

src/hotspot/share/oops/oop.inline.hpp

Print this page

 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  */
 24 
 25 #ifndef SHARE_OOPS_OOP_INLINE_HPP
 26 #define SHARE_OOPS_OOP_INLINE_HPP
 27 
 28 #include "oops/oop.hpp"
 29 
 30 #include "memory/iterator.inline.hpp"
 31 #include "memory/universe.hpp"
 32 #include "oops/access.inline.hpp"
 33 #include "oops/arrayKlass.hpp"
 34 #include "oops/arrayOop.hpp"
 35 #include "oops/compressedKlass.inline.hpp"

 36 #include "oops/instanceKlass.hpp"
 37 #include "oops/markWord.inline.hpp"
 38 #include "oops/objLayout.inline.hpp"
 39 #include "oops/oopsHierarchy.hpp"

 40 #include "runtime/atomicAccess.hpp"
 41 #include "runtime/globals.hpp"
 42 #include "utilities/align.hpp"
 43 #include "utilities/debug.hpp"
 44 #include "utilities/globalDefinitions.hpp"
 45 #include "utilities/macros.hpp"
 46 
 47 // Implementation of all inlined member functions defined in oop.hpp
 48 // We need a separate file to avoid circular references
 49 
 50 void* oopDesc::base_addr() { return this; }
 51 const void* oopDesc::base_addr() const { return this; }
 52 
 53 markWord oopDesc::mark() const {
 54   return AtomicAccess::load(&_mark);
 55 }
 56 
 57 markWord oopDesc::mark_acquire() const {
 58   return AtomicAccess::load_acquire(&_mark);
 59 }

 66   *(markWord*)(((char*)mem) + mark_offset_in_bytes()) = m;
 67 }
 68 
 69 void oopDesc::release_set_mark(HeapWord* mem, markWord m) {
 70   AtomicAccess::release_store((markWord*)(((char*)mem) + mark_offset_in_bytes()), m);
 71 }
 72 
 73 void oopDesc::release_set_mark(markWord m) {
 74   AtomicAccess::release_store(&_mark, m);
 75 }
 76 
 77 markWord oopDesc::cas_set_mark(markWord new_mark, markWord old_mark) {
 78   return AtomicAccess::cmpxchg(&_mark, old_mark, new_mark);
 79 }
 80 
 81 markWord oopDesc::cas_set_mark(markWord new_mark, markWord old_mark, atomic_memory_order order) {
 82   return AtomicAccess::cmpxchg(&_mark, old_mark, new_mark, order);
 83 }
 84 
 85 markWord oopDesc::prototype_mark() const {
 86   if (UseCompactObjectHeaders) {
 87     return klass()->prototype_header();
 88   } else {
 89     return markWord::prototype();
 90   }
 91 }
 92 
 93 void oopDesc::init_mark() {
 94   set_mark(prototype_mark());
 95 }
 96 
 97 Klass* oopDesc::klass() const {
 98   switch (ObjLayout::klass_mode()) {
 99     case ObjLayout::Compact:
100       return mark().klass();
101     case ObjLayout::Compressed:
102       return CompressedKlassPointers::decode_not_null(_compressed_klass);
103     default:
104       ShouldNotReachHere();
105   }
106 }

209       size_in_bytes = array_length << Klass::layout_helper_log2_element_size(lh);
210       size_in_bytes += Klass::layout_helper_header_size(lh);
211 
212       // This code could be simplified, but by keeping array_header_in_bytes
213       // in units of bytes and doing it this way we can round up just once,
214       // skipping the intermediate round to HeapWordSize.
215       s = align_up(size_in_bytes, MinObjAlignmentInBytes) / HeapWordSize;
216 
217       assert(s == klass->oop_size(this), "wrong array object size");
218     } else {
219       // Must be zero, so bite the bullet and take the virtual call.
220       s = klass->oop_size(this);
221     }
222   }
223 
224   assert(s > 0, "Oop size must be greater than zero, not %zu", s);
225   assert(is_object_aligned(s), "Oop size is not properly aligned: %zu", s);
226   return s;
227 }
228 
229 bool oopDesc::is_instance()    const { return klass()->is_instance_klass();             }
230 bool oopDesc::is_instanceRef() const { return klass()->is_reference_instance_klass();   }
231 bool oopDesc::is_stackChunk()  const { return klass()->is_stack_chunk_instance_klass(); }
232 bool oopDesc::is_array()       const { return klass()->is_array_klass();                }
233 bool oopDesc::is_objArray()    const { return klass()->is_objArray_klass();             }
234 bool oopDesc::is_typeArray()   const { return klass()->is_typeArray_klass();            }















235 
236 template<typename T>
237 T*       oopDesc::field_addr(int offset)     const { return reinterpret_cast<T*>(cast_from_oop<intptr_t>(as_oop()) + offset); }
238 
239 template <typename T>
240 size_t   oopDesc::field_offset(T* p) const { return pointer_delta((void*)p, (void*)this, 1); }
241 
242 template <DecoratorSet decorators>
243 inline oop  oopDesc::obj_field_access(int offset) const             { return HeapAccess<decorators>::oop_load_at(as_oop(), offset); }
244 inline oop  oopDesc::obj_field(int offset) const                    { return HeapAccess<>::oop_load_at(as_oop(), offset);  }
245 
246 inline void oopDesc::obj_field_put(int offset, oop value)           { HeapAccess<>::oop_store_at(as_oop(), offset, value); }
247 template <DecoratorSet decorators>
248 inline void oopDesc::obj_field_put_access(int offset, oop value)    { HeapAccess<decorators>::oop_store_at(as_oop(), offset, value); }
249 
250 inline jbyte oopDesc::byte_field(int offset) const                  { return *field_addr<jbyte>(offset);  }
251 inline void  oopDesc::byte_field_put(int offset, jbyte value)       { *field_addr<jbyte>(offset) = value; }
252 
253 inline jchar oopDesc::char_field(int offset) const                  { return *field_addr<jchar>(offset);  }
254 inline void  oopDesc::char_field_put(int offset, jchar value)       { *field_addr<jchar>(offset) = value; }

 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  */
 24 
 25 #ifndef SHARE_OOPS_OOP_INLINE_HPP
 26 #define SHARE_OOPS_OOP_INLINE_HPP
 27 
 28 #include "oops/oop.hpp"
 29 
 30 #include "memory/iterator.inline.hpp"
 31 #include "memory/universe.hpp"
 32 #include "oops/access.inline.hpp"
 33 #include "oops/arrayKlass.hpp"
 34 #include "oops/arrayOop.hpp"
 35 #include "oops/compressedKlass.inline.hpp"
 36 #include "oops/flatArrayKlass.hpp"
 37 #include "oops/instanceKlass.hpp"
 38 #include "oops/markWord.inline.hpp"
 39 #include "oops/objLayout.inline.hpp"
 40 #include "oops/oopsHierarchy.hpp"
 41 #include "runtime/arguments.hpp"
 42 #include "runtime/atomicAccess.hpp"
 43 #include "runtime/globals.hpp"
 44 #include "utilities/align.hpp"
 45 #include "utilities/debug.hpp"
 46 #include "utilities/globalDefinitions.hpp"
 47 #include "utilities/macros.hpp"
 48 
 49 // Implementation of all inlined member functions defined in oop.hpp
 50 // We need a separate file to avoid circular references
 51 
 52 void* oopDesc::base_addr() { return this; }
 53 const void* oopDesc::base_addr() const { return this; }
 54 
 55 markWord oopDesc::mark() const {
 56   return AtomicAccess::load(&_mark);
 57 }
 58 
 59 markWord oopDesc::mark_acquire() const {
 60   return AtomicAccess::load_acquire(&_mark);
 61 }

 68   *(markWord*)(((char*)mem) + mark_offset_in_bytes()) = m;
 69 }
 70 
 71 void oopDesc::release_set_mark(HeapWord* mem, markWord m) {
 72   AtomicAccess::release_store((markWord*)(((char*)mem) + mark_offset_in_bytes()), m);
 73 }
 74 
 75 void oopDesc::release_set_mark(markWord m) {
 76   AtomicAccess::release_store(&_mark, m);
 77 }
 78 
 79 markWord oopDesc::cas_set_mark(markWord new_mark, markWord old_mark) {
 80   return AtomicAccess::cmpxchg(&_mark, old_mark, new_mark);
 81 }
 82 
 83 markWord oopDesc::cas_set_mark(markWord new_mark, markWord old_mark, atomic_memory_order order) {
 84   return AtomicAccess::cmpxchg(&_mark, old_mark, new_mark, order);
 85 }
 86 
 87 markWord oopDesc::prototype_mark() const {
 88   if (UseCompactObjectHeaders || Arguments::is_valhalla_enabled()) {
 89     return klass()->prototype_header();
 90   } else {
 91     return markWord::prototype();
 92   }
 93 }
 94 
 95 void oopDesc::init_mark() {
 96   set_mark(prototype_mark());
 97 }
 98 
 99 Klass* oopDesc::klass() const {
100   switch (ObjLayout::klass_mode()) {
101     case ObjLayout::Compact:
102       return mark().klass();
103     case ObjLayout::Compressed:
104       return CompressedKlassPointers::decode_not_null(_compressed_klass);
105     default:
106       ShouldNotReachHere();
107   }
108 }

211       size_in_bytes = array_length << Klass::layout_helper_log2_element_size(lh);
212       size_in_bytes += Klass::layout_helper_header_size(lh);
213 
214       // This code could be simplified, but by keeping array_header_in_bytes
215       // in units of bytes and doing it this way we can round up just once,
216       // skipping the intermediate round to HeapWordSize.
217       s = align_up(size_in_bytes, MinObjAlignmentInBytes) / HeapWordSize;
218 
219       assert(s == klass->oop_size(this), "wrong array object size");
220     } else {
221       // Must be zero, so bite the bullet and take the virtual call.
222       s = klass->oop_size(this);
223     }
224   }
225 
226   assert(s > 0, "Oop size must be greater than zero, not %zu", s);
227   assert(is_object_aligned(s), "Oop size is not properly aligned: %zu", s);
228   return s;
229 }
230 
231 bool oopDesc::is_instance()         const { return klass()->is_instance_klass();             }
232 bool oopDesc::is_inline()           const { return klass()->is_inline_klass();               }
233 bool oopDesc::is_instanceRef()      const { return klass()->is_reference_instance_klass();   }
234 bool oopDesc::is_stackChunk()       const { return klass()->is_stack_chunk_instance_klass(); }
235 bool oopDesc::is_array()            const { return klass()->is_array_klass();                }
236 bool oopDesc::is_objArray()         const { return klass()->is_objArray_klass();             }
237 bool oopDesc::is_refArray()         const { return klass()->is_refArray_klass();             }
238 bool oopDesc::is_typeArray()        const { return klass()->is_typeArray_klass();            }
239 bool oopDesc::is_refined_objArray() const { return klass()->is_refined_objArray_klass();     }
240 bool oopDesc::is_flatArray()        const { return klass()->is_flatArray_klass();            }
241 
242 bool oopDesc::is_array_with_oops() const {
243   if (!is_objArray()) {
244     return false;
245   }
246 
247   assert(is_refined_objArray(), "Must be");
248   return is_refArray() || FlatArrayKlass::cast(klass())->contains_oops();
249 }
250 
251 bool oopDesc::is_inline_type() const { return mark().is_inline_type(); }
252 
253 template<typename T>
254 T*       oopDesc::field_addr(int offset)     const { return reinterpret_cast<T*>(cast_from_oop<intptr_t>(as_oop()) + offset); }
255 
256 template <typename T>
257 size_t   oopDesc::field_offset(T* p) const { return pointer_delta((void*)p, (void*)this, 1); }
258 
259 template <DecoratorSet decorators>
260 inline oop  oopDesc::obj_field_access(int offset) const             { return HeapAccess<decorators>::oop_load_at(as_oop(), offset); }
261 inline oop  oopDesc::obj_field(int offset) const                    { return HeapAccess<>::oop_load_at(as_oop(), offset);  }
262 
263 inline void oopDesc::obj_field_put(int offset, oop value)           { HeapAccess<>::oop_store_at(as_oop(), offset, value); }
264 template <DecoratorSet decorators>
265 inline void oopDesc::obj_field_put_access(int offset, oop value)    { HeapAccess<decorators>::oop_store_at(as_oop(), offset, value); }
266 
267 inline jbyte oopDesc::byte_field(int offset) const                  { return *field_addr<jbyte>(offset);  }
268 inline void  oopDesc::byte_field_put(int offset, jbyte value)       { *field_addr<jbyte>(offset) = value; }
269 
270 inline jchar oopDesc::char_field(int offset) const                  { return *field_addr<jchar>(offset);  }
271 inline void  oopDesc::char_field_put(int offset, jchar value)       { *field_addr<jchar>(offset) = value; }
< prev index next >