1
|
1 |
/*
|
|
2 |
* Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved.
|
|
3 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
4 |
*
|
|
5 |
* This code is free software; you can redistribute it and/or modify it
|
|
6 |
* under the terms of the GNU General Public License version 2 only, as
|
|
7 |
* published by the Free Software Foundation.
|
|
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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
|
|
20 |
* CA 95054 USA or visit www.sun.com if you need additional information or
|
|
21 |
* have any questions.
|
|
22 |
*
|
|
23 |
*/
|
|
24 |
|
|
25 |
// A typeArrayOop is an array containing basic types (non oop elements).
|
|
26 |
// It is used for arrays of {characters, singles, doubles, bytes, shorts, integers, longs}
|
|
27 |
#include <limits.h>
|
|
28 |
|
|
29 |
class typeArrayOopDesc : public arrayOopDesc {
|
|
30 |
protected:
|
|
31 |
jchar* char_base() const { return (jchar*) base(T_CHAR); }
|
|
32 |
jboolean* bool_base() const { return (jboolean*)base(T_BOOLEAN); }
|
|
33 |
jbyte* byte_base() const { return (jbyte*) base(T_BYTE); }
|
|
34 |
jint* int_base() const { return (jint*) base(T_INT); }
|
|
35 |
jlong* long_base() const { return (jlong*) base(T_LONG); }
|
|
36 |
jshort* short_base() const { return (jshort*) base(T_SHORT); }
|
|
37 |
jfloat* float_base() const { return (jfloat*) base(T_FLOAT); }
|
|
38 |
jdouble* double_base() const { return (jdouble*) base(T_DOUBLE); }
|
|
39 |
|
|
40 |
friend class typeArrayKlass;
|
|
41 |
|
|
42 |
public:
|
|
43 |
jbyte* byte_at_addr(int which) const {
|
|
44 |
assert(is_within_bounds(which), "index out of bounds");
|
|
45 |
return &byte_base()[which];
|
|
46 |
}
|
|
47 |
|
|
48 |
jboolean* bool_at_addr(int which) const {
|
|
49 |
assert(is_within_bounds(which), "index out of bounds");
|
|
50 |
return &bool_base()[which];
|
|
51 |
}
|
|
52 |
|
|
53 |
jchar* char_at_addr(int which) const {
|
|
54 |
assert(is_within_bounds(which), "index out of bounds");
|
|
55 |
return &char_base()[which];
|
|
56 |
}
|
|
57 |
|
|
58 |
jint* int_at_addr(int which) const {
|
|
59 |
assert(is_within_bounds(which), "index out of bounds");
|
|
60 |
return &int_base()[which];
|
|
61 |
}
|
|
62 |
|
|
63 |
jshort* short_at_addr(int which) const {
|
|
64 |
assert(is_within_bounds(which), "index out of bounds");
|
|
65 |
return &short_base()[which];
|
|
66 |
}
|
|
67 |
|
|
68 |
jushort* ushort_at_addr(int which) const { // for field descriptor arrays
|
|
69 |
assert(is_within_bounds(which), "index out of bounds");
|
|
70 |
return (jushort*) &short_base()[which];
|
|
71 |
}
|
|
72 |
|
|
73 |
jlong* long_at_addr(int which) const {
|
|
74 |
assert(is_within_bounds(which), "index out of bounds");
|
|
75 |
return &long_base()[which];
|
|
76 |
}
|
|
77 |
|
|
78 |
jfloat* float_at_addr(int which) const {
|
|
79 |
assert(is_within_bounds(which), "index out of bounds");
|
|
80 |
return &float_base()[which];
|
|
81 |
}
|
|
82 |
|
|
83 |
jdouble* double_at_addr(int which) const {
|
|
84 |
assert(is_within_bounds(which), "index out of bounds");
|
|
85 |
return &double_base()[which];
|
|
86 |
}
|
|
87 |
|
|
88 |
jbyte byte_at(int which) const { return *byte_at_addr(which); }
|
|
89 |
void byte_at_put(int which, jbyte contents) { *byte_at_addr(which) = contents; }
|
|
90 |
|
|
91 |
jboolean bool_at(int which) const { return *bool_at_addr(which); }
|
|
92 |
void bool_at_put(int which, jboolean contents) { *bool_at_addr(which) = contents; }
|
|
93 |
|
|
94 |
jchar char_at(int which) const { return *char_at_addr(which); }
|
|
95 |
void char_at_put(int which, jchar contents) { *char_at_addr(which) = contents; }
|
|
96 |
|
|
97 |
jint int_at(int which) const { return *int_at_addr(which); }
|
|
98 |
void int_at_put(int which, jint contents) { *int_at_addr(which) = contents; }
|
|
99 |
|
|
100 |
jshort short_at(int which) const { return *short_at_addr(which); }
|
|
101 |
void short_at_put(int which, jshort contents) { *short_at_addr(which) = contents; }
|
|
102 |
|
|
103 |
jushort ushort_at(int which) const { return *ushort_at_addr(which); }
|
|
104 |
void ushort_at_put(int which, jushort contents) { *ushort_at_addr(which) = contents; }
|
|
105 |
|
|
106 |
jlong long_at(int which) const { return *long_at_addr(which); }
|
|
107 |
void long_at_put(int which, jlong contents) { *long_at_addr(which) = contents; }
|
|
108 |
|
|
109 |
jfloat float_at(int which) const { return *float_at_addr(which); }
|
|
110 |
void float_at_put(int which, jfloat contents) { *float_at_addr(which) = contents; }
|
|
111 |
|
|
112 |
jdouble double_at(int which) const { return *double_at_addr(which); }
|
|
113 |
void double_at_put(int which, jdouble contents) { *double_at_addr(which) = contents; }
|
|
114 |
|
|
115 |
jbyte byte_at_acquire(int which) const { return OrderAccess::load_acquire(byte_at_addr(which)); }
|
|
116 |
void release_byte_at_put(int which, jbyte contents) { OrderAccess::release_store(byte_at_addr(which), contents); }
|
|
117 |
|
|
118 |
// Sizing
|
|
119 |
|
|
120 |
// Returns the number of words necessary to hold an array of "len"
|
|
121 |
// elements each of the given "byte_size".
|
|
122 |
private:
|
|
123 |
static int object_size(int lh, int length) {
|
|
124 |
int instance_header_size = Klass::layout_helper_header_size(lh);
|
|
125 |
int element_shift = Klass::layout_helper_log2_element_size(lh);
|
|
126 |
DEBUG_ONLY(BasicType etype = Klass::layout_helper_element_type(lh));
|
|
127 |
assert(length <= arrayOopDesc::max_array_length(etype), "no overflow");
|
|
128 |
|
|
129 |
julong size_in_bytes = length;
|
|
130 |
size_in_bytes <<= element_shift;
|
|
131 |
size_in_bytes += instance_header_size;
|
|
132 |
julong size_in_words = ((size_in_bytes + (HeapWordSize-1)) >> LogHeapWordSize);
|
|
133 |
assert(size_in_words <= (julong)max_jint, "no overflow");
|
|
134 |
|
|
135 |
return align_object_size((intptr_t)size_in_words);
|
|
136 |
}
|
|
137 |
|
|
138 |
public:
|
|
139 |
int object_size() {
|
|
140 |
typeArrayKlass* tk = typeArrayKlass::cast(klass());
|
|
141 |
return object_size(tk->layout_helper(), length());
|
|
142 |
}
|
|
143 |
};
|