< prev index next >

src/hotspot/share/oops/objArrayOop.hpp

Print this page




  22  *
  23  */
  24 
  25 #ifndef SHARE_OOPS_OBJARRAYOOP_HPP
  26 #define SHARE_OOPS_OBJARRAYOOP_HPP
  27 
  28 #include "oops/arrayOop.hpp"
  29 #include "utilities/align.hpp"
  30 
  31 class Klass;
  32 
  33 // An objArrayOop is an array containing oops.
  34 // Evaluating "String arg[10]" will create an objArrayOop.
  35 
  36 class objArrayOopDesc : public arrayOopDesc {
  37   friend class ObjArrayKlass;
  38   friend class Runtime1;
  39   friend class psPromotionManager;
  40   friend class CSetMarkOopClosure;
  41   friend class G1ParScanPartialArrayClosure;



  42 
  43   template <class T> T* obj_at_addr(int index) const;
  44   template <class T> T* obj_at_addr_raw(int index) const;
  45 





  46   template <class T>
  47   static ptrdiff_t obj_at_offset(int index) {
  48     return base_offset_in_bytes() + sizeof(T) * index;
  49   }
  50 
  51 private:
  52   // Give size of objArrayOop in HeapWords minus the header
  53   static int array_size(int length) {
  54     const uint OopsPerHeapWord = HeapWordSize/heapOopSize;
  55     assert(OopsPerHeapWord >= 1 && (HeapWordSize % heapOopSize == 0),
  56            "Else the following (new) computation would be in error");
  57     uint res = ((uint)length + OopsPerHeapWord - 1)/OopsPerHeapWord;
  58 #ifdef ASSERT
  59     // The old code is left in for sanity-checking; it'll
  60     // go away pretty soon. XXX
  61     // Without UseCompressedOops, this is simply:
  62     // oop->length() * HeapWordsPerOop;
  63     // With narrowOops, HeapWordsPerOop is 1/2 or equal 0 as an integer.
  64     // The oop elements are aligned up to wordSize
  65     const uint HeapWordsPerOop = heapOopSize/HeapWordSize;


  71     }
  72     assert(res == old_res, "Inconsistency between old and new.");
  73 #endif  // ASSERT
  74     return res;
  75   }
  76 
  77  public:
  78   // Returns the offset of the first element.
  79   static int base_offset_in_bytes() {
  80     return arrayOopDesc::base_offset_in_bytes(T_OBJECT);
  81   }
  82 
  83   // base is the address following the header.
  84   HeapWord* base() const;
  85   HeapWord* base_raw() const;
  86 
  87   // Accessing
  88   oop obj_at(int index) const;
  89 
  90   void obj_at_put(int index, oop value);


  91 
  92   oop atomic_compare_exchange_oop(int index, oop exchange_value, oop compare_value);
  93 
  94   // Sizing
  95   static int header_size()    { return arrayOopDesc::header_size(T_OBJECT); }
  96   int object_size()           { return object_size(length()); }
  97 
  98   static int object_size(int length) {
  99     // This returns the object size in HeapWords.
 100     uint asz = array_size(length);
 101     uint osz = align_object_size(header_size() + asz);
 102     assert(osz >= asz,   "no overflow");
 103     assert((int)osz > 0, "no overflow");
 104     return (int)osz;
 105   }
 106 
 107   Klass* element_klass();
 108 
 109 public:
 110   // special iterators for index ranges, returns size of object


  22  *
  23  */
  24 
  25 #ifndef SHARE_OOPS_OBJARRAYOOP_HPP
  26 #define SHARE_OOPS_OBJARRAYOOP_HPP
  27 
  28 #include "oops/arrayOop.hpp"
  29 #include "utilities/align.hpp"
  30 
  31 class Klass;
  32 
  33 // An objArrayOop is an array containing oops.
  34 // Evaluating "String arg[10]" will create an objArrayOop.
  35 
  36 class objArrayOopDesc : public arrayOopDesc {
  37   friend class ObjArrayKlass;
  38   friend class Runtime1;
  39   friend class psPromotionManager;
  40   friend class CSetMarkOopClosure;
  41   friend class G1ParScanPartialArrayClosure;
  42   friend class Continuation;
  43   template <typename T>
  44   friend class RawOopWriter;
  45 
  46   template <class T> T* obj_at_addr(int index) const;
  47   template <class T> T* obj_at_addr_raw(int index) const;
  48 
  49 public:
  50   template <class T> T* obj_at_address(int index) const {
  51     return obj_at_addr<T>(index);
  52   }
  53 
  54   template <class T>
  55   static ptrdiff_t obj_at_offset(int index) {
  56     return base_offset_in_bytes() + sizeof(T) * index;
  57   }
  58 
  59 private:
  60   // Give size of objArrayOop in HeapWords minus the header
  61   static int array_size(int length) {
  62     const uint OopsPerHeapWord = HeapWordSize/heapOopSize;
  63     assert(OopsPerHeapWord >= 1 && (HeapWordSize % heapOopSize == 0),
  64            "Else the following (new) computation would be in error");
  65     uint res = ((uint)length + OopsPerHeapWord - 1)/OopsPerHeapWord;
  66 #ifdef ASSERT
  67     // The old code is left in for sanity-checking; it'll
  68     // go away pretty soon. XXX
  69     // Without UseCompressedOops, this is simply:
  70     // oop->length() * HeapWordsPerOop;
  71     // With narrowOops, HeapWordsPerOop is 1/2 or equal 0 as an integer.
  72     // The oop elements are aligned up to wordSize
  73     const uint HeapWordsPerOop = heapOopSize/HeapWordSize;


  79     }
  80     assert(res == old_res, "Inconsistency between old and new.");
  81 #endif  // ASSERT
  82     return res;
  83   }
  84 
  85  public:
  86   // Returns the offset of the first element.
  87   static int base_offset_in_bytes() {
  88     return arrayOopDesc::base_offset_in_bytes(T_OBJECT);
  89   }
  90 
  91   // base is the address following the header.
  92   HeapWord* base() const;
  93   HeapWord* base_raw() const;
  94 
  95   // Accessing
  96   oop obj_at(int index) const;
  97 
  98   void obj_at_put(int index, oop value);
  99   template <DecoratorSet ds>
 100   void obj_at_put_access(int index, oop value);
 101 
 102   oop atomic_compare_exchange_oop(int index, oop exchange_value, oop compare_value);
 103 
 104   // Sizing
 105   static int header_size()    { return arrayOopDesc::header_size(T_OBJECT); }
 106   int object_size()           { return object_size(length()); }
 107 
 108   static int object_size(int length) {
 109     // This returns the object size in HeapWords.
 110     uint asz = array_size(length);
 111     uint osz = align_object_size(header_size() + asz);
 112     assert(osz >= asz,   "no overflow");
 113     assert((int)osz > 0, "no overflow");
 114     return (int)osz;
 115   }
 116 
 117   Klass* element_klass();
 118 
 119 public:
 120   // special iterators for index ranges, returns size of object
< prev index next >