8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
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_VM_OOPS_OBJARRAYOOP_HPP
26 #define SHARE_VM_OOPS_OBJARRAYOOP_HPP
27
28 #include "gc/shared/specialized_oop_closures.hpp"
29 #include "oops/arrayOop.hpp"
30
31 // An objArrayOop is an array containing oops.
32 // Evaluating "String arg[10]" will create an objArrayOop.
33
34 class objArrayOopDesc : public arrayOopDesc {
35 friend class ObjArrayKlass;
36 friend class Runtime1;
37 friend class psPromotionManager;
38 friend class CSetMarkOopClosure;
39 friend class G1ParScanPartialArrayClosure;
40
41 template <class T> T* obj_at_addr(int index) const {
42 assert(is_within_bounds(index), "index out of bounds");
43 return &((T*)base())[index];
44 }
45
46 private:
47 // Give size of objArrayOop in HeapWords minus the header
65 old_res = align_size_up((uint)length, OopsPerHeapWord)/OopsPerHeapWord;
66 }
67 assert(res == old_res, "Inconsistency between old and new.");
68 #endif // ASSERT
69 return res;
70 }
71
72 public:
73 // Returns the offset of the first element.
74 static int base_offset_in_bytes() {
75 return arrayOopDesc::base_offset_in_bytes(T_OBJECT);
76 }
77
78 // base is the address following the header.
79 HeapWord* base() const { return (HeapWord*) arrayOopDesc::base(T_OBJECT); }
80
81 // Accessing
82 oop obj_at(int index) const;
83
84 void obj_at_put(int index, oop value) {
85 if (UseCompressedOops) {
86 oop_store(obj_at_addr<narrowOop>(index), value);
87 } else {
88 oop_store(obj_at_addr<oop>(index), value);
89 }
90 }
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 // special iterators for index ranges, returns size of object
108 #define ObjArrayOop_OOP_ITERATE_DECL(OopClosureType, nv_suffix) \
|
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
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_VM_OOPS_OBJARRAYOOP_HPP
26 #define SHARE_VM_OOPS_OBJARRAYOOP_HPP
27
28 #include "gc/shared/barrierSet.hpp"
29 #include "gc/shared/specialized_oop_closures.hpp"
30 #include "oops/arrayOop.hpp"
31
32 // An objArrayOop is an array containing oops.
33 // Evaluating "String arg[10]" will create an objArrayOop.
34
35 class objArrayOopDesc : public arrayOopDesc {
36 friend class ObjArrayKlass;
37 friend class Runtime1;
38 friend class psPromotionManager;
39 friend class CSetMarkOopClosure;
40 friend class G1ParScanPartialArrayClosure;
41
42 template <class T> T* obj_at_addr(int index) const {
43 assert(is_within_bounds(index), "index out of bounds");
44 return &((T*)base())[index];
45 }
46
47 private:
48 // Give size of objArrayOop in HeapWords minus the header
66 old_res = align_size_up((uint)length, OopsPerHeapWord)/OopsPerHeapWord;
67 }
68 assert(res == old_res, "Inconsistency between old and new.");
69 #endif // ASSERT
70 return res;
71 }
72
73 public:
74 // Returns the offset of the first element.
75 static int base_offset_in_bytes() {
76 return arrayOopDesc::base_offset_in_bytes(T_OBJECT);
77 }
78
79 // base is the address following the header.
80 HeapWord* base() const { return (HeapWord*) arrayOopDesc::base(T_OBJECT); }
81
82 // Accessing
83 oop obj_at(int index) const;
84
85 void obj_at_put(int index, oop value) {
86 objArrayOop p = (objArrayOop) oopDesc::bs()->resolve_and_maybe_copy_oop(this);
87 if (UseCompressedOops) {
88 oop_store(p->obj_at_addr<narrowOop>(index), value);
89 } else {
90 oop_store(p->obj_at_addr<oop>(index), value);
91 }
92 }
93
94 oop atomic_compare_exchange_oop(int index, oop exchange_value, oop compare_value);
95
96 // Sizing
97 static int header_size() { return arrayOopDesc::header_size(T_OBJECT); }
98 int object_size() { return object_size(length()); }
99
100 static int object_size(int length) {
101 // This returns the object size in HeapWords.
102 uint asz = array_size(length);
103 uint osz = align_object_size(header_size() + asz);
104 assert(osz >= asz, "no overflow");
105 assert((int)osz > 0, "no overflow");
106 return (int)osz;
107 }
108
109 // special iterators for index ranges, returns size of object
110 #define ObjArrayOop_OOP_ITERATE_DECL(OopClosureType, nv_suffix) \
|