1 /*
2 * Copyright (c) 1997, 2023, Oracle and/or its affiliates. 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 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 #include "precompiled.hpp"
26 #include "classfile/moduleEntry.hpp"
27 #include "classfile/packageEntry.hpp"
28 #include "classfile/symbolTable.hpp"
29 #include "classfile/vmSymbols.hpp"
30 #include "gc/shared/collectedHeap.hpp"
31 #include "gc/shared/collectedHeap.inline.hpp"
32 #include "memory/metadataFactory.hpp"
33 #include "memory/resourceArea.hpp"
34 #include "memory/universe.hpp"
35 #include "oops/arrayKlass.hpp"
36 #include "oops/instanceKlass.hpp"
37 #include "oops/klass.inline.hpp"
38 #include "oops/objArrayKlass.hpp"
39 #include "oops/oop.inline.hpp"
40 #include "oops/typeArrayKlass.inline.hpp"
41 #include "oops/typeArrayOop.inline.hpp"
42 #include "runtime/handles.inline.hpp"
43 #include "utilities/macros.hpp"
44
45 TypeArrayKlass* TypeArrayKlass::create_klass(BasicType type,
46 const char* name_str, TRAPS) {
47 Symbol* sym = nullptr;
48 if (name_str != nullptr) {
49 sym = SymbolTable::new_permanent_symbol(name_str);
50 }
51
52 ClassLoaderData* null_loader_data = ClassLoaderData::the_null_class_loader_data();
53
54 TypeArrayKlass* ak = TypeArrayKlass::allocate(null_loader_data, type, sym, CHECK_NULL);
55
56 // Call complete_create_array_klass after all instance variables have been initialized.
57 complete_create_array_klass(ak, ak->super(), ModuleEntryTable::javabase_moduleEntry(), CHECK_NULL);
58
59 // Add all classes to our internal class loader list here,
60 // including classes in the bootstrap (null) class loader.
61 // Do this step after creating the mirror so that if the
62 // mirror creation fails, loaded_classes_do() doesn't find
63 // an array class without a mirror.
64 null_loader_data->add_class(ak);
65 JFR_ONLY(ASSIGN_PRIMITIVE_CLASS_ID(ak);)
66 return ak;
67 }
68
69 TypeArrayKlass* TypeArrayKlass::allocate(ClassLoaderData* loader_data, BasicType type, Symbol* name, TRAPS) {
70 assert(TypeArrayKlass::header_size() <= InstanceKlass::header_size(),
71 "array klasses must be same size as InstanceKlass");
72
73 int size = ArrayKlass::static_size(TypeArrayKlass::header_size());
74
75 return new (loader_data, size, THREAD) TypeArrayKlass(type, name);
76 }
77
78 TypeArrayKlass::TypeArrayKlass(BasicType type, Symbol* name) : ArrayKlass(name, Kind) {
79 set_layout_helper(array_layout_helper(type));
80 assert(is_array_klass(), "sanity");
81 assert(is_typeArray_klass(), "sanity");
82
83 set_max_length(arrayOopDesc::max_array_length(type));
84 assert(size() >= TypeArrayKlass::header_size(), "bad size");
85
86 set_class_loader_data(ClassLoaderData::the_null_class_loader_data());
87 }
88
89 typeArrayOop TypeArrayKlass::allocate_common(int length, bool do_zero, TRAPS) {
90 assert(log2_element_size() >= 0, "bad scale");
91 check_array_allocation_length(length, max_length(), CHECK_NULL);
92 size_t size = typeArrayOopDesc::object_size(layout_helper(), length);
93 return (typeArrayOop)Universe::heap()->array_allocate(this, size, length,
94 do_zero, CHECK_NULL);
95 }
96
97 oop TypeArrayKlass::multi_allocate(int rank, jint* last_size, TRAPS) {
98 // For typeArrays this is only called for the last dimension
99 assert(rank == 1, "just checking");
100 int length = *last_size;
101 return allocate(length, THREAD);
102 }
103
104
105 void TypeArrayKlass::copy_array(arrayOop s, int src_pos, arrayOop d, int dst_pos, int length, TRAPS) {
106 assert(s->is_typeArray(), "must be type array");
107
108 // Check destination type.
109 if (!d->is_typeArray()) {
110 ResourceMark rm(THREAD);
111 stringStream ss;
112 if (d->is_objArray()) {
113 ss.print("arraycopy: type mismatch: can not copy %s[] into object array[]",
114 type2name_tab[ArrayKlass::cast(s->klass())->element_type()]);
115 } else {
116 ss.print("arraycopy: destination type %s is not an array", d->klass()->external_name());
117 }
118 THROW_MSG(vmSymbols::java_lang_ArrayStoreException(), ss.as_string());
119 }
120 if (element_type() != TypeArrayKlass::cast(d->klass())->element_type()) {
121 ResourceMark rm(THREAD);
122 stringStream ss;
123 ss.print("arraycopy: type mismatch: can not copy %s[] into %s[]",
124 type2name_tab[ArrayKlass::cast(s->klass())->element_type()],
125 type2name_tab[ArrayKlass::cast(d->klass())->element_type()]);
126 THROW_MSG(vmSymbols::java_lang_ArrayStoreException(), ss.as_string());
127 }
128
129 // Check if all offsets and lengths are non negative.
130 if (src_pos < 0 || dst_pos < 0 || length < 0) {
131 // Pass specific exception reason.
132 ResourceMark rm(THREAD);
133 stringStream ss;
134 if (src_pos < 0) {
135 ss.print("arraycopy: source index %d out of bounds for %s[%d]",
136 src_pos, type2name_tab[ArrayKlass::cast(s->klass())->element_type()], s->length());
137 } else if (dst_pos < 0) {
138 ss.print("arraycopy: destination index %d out of bounds for %s[%d]",
139 dst_pos, type2name_tab[ArrayKlass::cast(d->klass())->element_type()], d->length());
140 } else {
141 ss.print("arraycopy: length %d is negative", length);
142 }
143 THROW_MSG(vmSymbols::java_lang_ArrayIndexOutOfBoundsException(), ss.as_string());
144 }
145 // Check if the ranges are valid
146 if ((((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length()) ||
147 (((unsigned int) length + (unsigned int) dst_pos) > (unsigned int) d->length())) {
148 // Pass specific exception reason.
149 ResourceMark rm(THREAD);
150 stringStream ss;
151 if (((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length()) {
152 ss.print("arraycopy: last source index %u out of bounds for %s[%d]",
153 (unsigned int) length + (unsigned int) src_pos,
154 type2name_tab[ArrayKlass::cast(s->klass())->element_type()], s->length());
155 } else {
156 ss.print("arraycopy: last destination index %u out of bounds for %s[%d]",
157 (unsigned int) length + (unsigned int) dst_pos,
158 type2name_tab[ArrayKlass::cast(d->klass())->element_type()], d->length());
159 }
160 THROW_MSG(vmSymbols::java_lang_ArrayIndexOutOfBoundsException(), ss.as_string());
161 }
162 // Check zero copy
163 if (length == 0)
164 return;
165
166 // This is an attempt to make the copy_array fast.
167 int l2es = log2_element_size();
168 size_t src_offset = arrayOopDesc::base_offset_in_bytes(element_type()) + ((size_t)src_pos << l2es);
169 size_t dst_offset = arrayOopDesc::base_offset_in_bytes(element_type()) + ((size_t)dst_pos << l2es);
170 ArrayAccess<ARRAYCOPY_ATOMIC>::arraycopy<void>(s, src_offset, d, dst_offset, (size_t)length << l2es);
171 }
172
173 size_t TypeArrayKlass::oop_size(oop obj) const {
174 assert(obj->is_typeArray(),"must be a type array");
175 typeArrayOop t = typeArrayOop(obj);
176 return t->object_size(this);
177 }
178
179 void TypeArrayKlass::initialize(TRAPS) {
180 // Nothing to do. Having this function is handy since objArrayKlasses can be
181 // initialized by calling initialize on their bottom_klass, see ObjArrayKlass::initialize
182 }
183
184 const char* TypeArrayKlass::external_name(BasicType type) {
185 switch (type) {
186 case T_BOOLEAN: return "[Z";
187 case T_CHAR: return "[C";
188 case T_FLOAT: return "[F";
189 case T_DOUBLE: return "[D";
190 case T_BYTE: return "[B";
191 case T_SHORT: return "[S";
192 case T_INT: return "[I";
193 case T_LONG: return "[J";
194 default: ShouldNotReachHere();
195 }
196 return nullptr;
197 }
198
199
200 // Printing
201
202 void TypeArrayKlass::print_on(outputStream* st) const {
203 #ifndef PRODUCT
204 assert(is_klass(), "must be klass");
205 print_value_on(st);
206 Klass::print_on(st);
207 #endif //PRODUCT
208 }
209
210 void TypeArrayKlass::print_value_on(outputStream* st) const {
211 assert(is_klass(), "must be klass");
212 st->print("{type array ");
213 BasicType bt = element_type();
214 if (bt == T_BOOLEAN) {
215 st->print("bool");
216 } else {
217 st->print("%s", type2name_tab[bt]);
218 }
219 st->print("}");
220 }
221
222 static void print_boolean_array(typeArrayOop ta, int print_len, outputStream* st) {
223 for (int index = 0; index < print_len; index++) {
224 st->print_cr(" - %3d: %s", index, (ta->bool_at(index) == 0) ? "false" : "true");
225 }
226 }
227
228
229 static void print_char_array(typeArrayOop ta, int print_len, outputStream* st) {
230 for (int index = 0; index < print_len; index++) {
231 jchar c = ta->char_at(index);
232 st->print_cr(" - %3d: %x %c", index, c, isprint(c) ? c : ' ');
233 }
234 }
235
236
237 static void print_float_array(typeArrayOop ta, int print_len, outputStream* st) {
238 for (int index = 0; index < print_len; index++) {
239 st->print_cr(" - %3d: %g", index, ta->float_at(index));
240 }
241 }
242
243
244 static void print_double_array(typeArrayOop ta, int print_len, outputStream* st) {
245 for (int index = 0; index < print_len; index++) {
246 st->print_cr(" - %3d: %g", index, ta->double_at(index));
247 }
248 }
249
250
251 static void print_byte_array(typeArrayOop ta, int print_len, outputStream* st) {
252 for (int index = 0; index < print_len; index++) {
253 jbyte c = ta->byte_at(index);
254 st->print_cr(" - %3d: %x %c", index, c, isprint(c) ? c : ' ');
255 }
256 }
257
258
259 static void print_short_array(typeArrayOop ta, int print_len, outputStream* st) {
260 for (int index = 0; index < print_len; index++) {
261 int v = ta->ushort_at(index);
262 st->print_cr(" - %3d: 0x%x\t %d", index, v, v);
263 }
264 }
265
266
267 static void print_int_array(typeArrayOop ta, int print_len, outputStream* st) {
268 for (int index = 0; index < print_len; index++) {
269 jint v = ta->int_at(index);
270 st->print_cr(" - %3d: 0x%x %d", index, v, v);
271 }
272 }
273
274
275 static void print_long_array(typeArrayOop ta, int print_len, outputStream* st) {
276 for (int index = 0; index < print_len; index++) {
277 jlong v = ta->long_at(index);
278 st->print_cr(" - %3d: 0x%x 0x%x", index, high(v), low(v));
279 }
280 }
281
282
283 void TypeArrayKlass::oop_print_on(oop obj, outputStream* st) {
284 ArrayKlass::oop_print_on(obj, st);
285 oop_print_elements_on(typeArrayOop(obj), st);
286 }
287
288 void TypeArrayKlass::oop_print_elements_on(typeArrayOop ta, outputStream* st) {
289 int print_len = MIN2(ta->length(), MaxElementPrintSize);
290 switch (element_type()) {
291 case T_BOOLEAN: print_boolean_array(ta, print_len, st); break;
292 case T_CHAR: print_char_array(ta, print_len, st); break;
293 case T_FLOAT: print_float_array(ta, print_len, st); break;
294 case T_DOUBLE: print_double_array(ta, print_len, st); break;
295 case T_BYTE: print_byte_array(ta, print_len, st); break;
296 case T_SHORT: print_short_array(ta, print_len, st); break;
297 case T_INT: print_int_array(ta, print_len, st); break;
298 case T_LONG: print_long_array(ta, print_len, st); break;
299 default: ShouldNotReachHere();
300 }
301 int remaining = ta->length() - print_len;
302 if (remaining > 0) {
303 st->print_cr(" - <%d more elements, increase MaxElementPrintSize to print>", remaining);
304 }
305 }
306
307 const char* TypeArrayKlass::internal_name() const {
308 return Klass::external_name();
309 }
310
311 // A TypeArrayKlass is an array of a primitive type, its defining module is java.base
312 ModuleEntry* TypeArrayKlass::module() const {
313 return ModuleEntryTable::javabase_moduleEntry();
314 }
315
316 PackageEntry* TypeArrayKlass::package() const {
317 return nullptr;
318 }