1 /*
2 * Copyright (c) 1997, 2025, 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 "classfile/moduleEntry.hpp"
26 #include "classfile/packageEntry.hpp"
27 #include "classfile/symbolTable.hpp"
28 #include "classfile/vmClasses.hpp"
29 #include "classfile/vmSymbols.hpp"
30 #include "gc/shared/collectedHeap.inline.hpp"
31 #include "memory/iterator.inline.hpp"
32 #include "memory/metadataFactory.hpp"
33 #include "memory/metaspaceClosure.hpp"
34 #include "memory/resourceArea.hpp"
35 #include "memory/universe.hpp"
36 #include "oops/arrayKlass.hpp"
37 #include "oops/instanceKlass.hpp"
38 #include "oops/klass.inline.hpp"
39 #include "oops/objArrayKlass.inline.hpp"
40 #include "oops/objArrayOop.inline.hpp"
41 #include "oops/oop.inline.hpp"
42 #include "oops/symbol.hpp"
43 #include "runtime/handles.inline.hpp"
44 #include "runtime/mutexLocker.hpp"
45 #include "utilities/macros.hpp"
46
47 ObjArrayKlass* ObjArrayKlass::allocate(ClassLoaderData* loader_data, int n, Klass* k, Symbol* name, TRAPS) {
48 assert(ObjArrayKlass::header_size() <= InstanceKlass::header_size(),
49 "array klasses must be same size as InstanceKlass");
50
51 int size = ArrayKlass::static_size(ObjArrayKlass::header_size());
52
53 return new (loader_data, size, THREAD) ObjArrayKlass(n, k, name);
54 }
55
56 ObjArrayKlass* ObjArrayKlass::allocate_objArray_klass(ClassLoaderData* loader_data,
57 int n, Klass* element_klass, TRAPS) {
58
59 // Eagerly allocate the direct array supertype.
60 Klass* super_klass = nullptr;
61 if (!Universe::is_bootstrapping() || vmClasses::Object_klass_loaded()) {
62 assert(MultiArray_lock->holds_lock(THREAD), "must hold lock after bootstrapping");
63 Klass* element_super = element_klass->super();
64 if (element_super != nullptr) {
65 // The element type has a direct super. E.g., String[] has direct super of Object[].
66 // Also, see if the element has secondary supertypes.
67 // We need an array type for each before creating this array type.
68 super_klass = element_super->array_klass(CHECK_NULL);
69 const Array<Klass*>* element_supers = element_klass->secondary_supers();
70 for (int i = element_supers->length() - 1; i >= 0; i--) {
71 Klass* elem_super = element_supers->at(i);
72 elem_super->array_klass(CHECK_NULL);
73 }
74 // Fall through because inheritance is acyclic and we hold the global recursive lock to allocate all the arrays.
75 } else {
76 // The element type is already Object. Object[] has direct super of Object.
77 super_klass = vmClasses::Object_klass();
78 }
79 }
80
81 // Create type name for klass.
82 Symbol* name = nullptr;
83 {
84 ResourceMark rm(THREAD);
85 char *name_str = element_klass->name()->as_C_string();
86 int len = element_klass->name()->utf8_length();
87 char *new_str = NEW_RESOURCE_ARRAY(char, len + 4);
88 int idx = 0;
89 new_str[idx++] = JVM_SIGNATURE_ARRAY;
90 if (element_klass->is_instance_klass()) { // it could be an array or simple type
91 new_str[idx++] = JVM_SIGNATURE_CLASS;
92 }
93 memcpy(&new_str[idx], name_str, len * sizeof(char));
94 idx += len;
95 if (element_klass->is_instance_klass()) {
96 new_str[idx++] = JVM_SIGNATURE_ENDCLASS;
97 }
98 new_str[idx++] = '\0';
99 name = SymbolTable::new_symbol(new_str);
100 }
101
102 // Initialize instance variables
103 ObjArrayKlass* oak = ObjArrayKlass::allocate(loader_data, n, element_klass, name, CHECK_NULL);
104
105 ModuleEntry* module = oak->module();
106 assert(module != nullptr, "No module entry for array");
107
108 // Call complete_create_array_klass after all instance variables has been initialized.
109 ArrayKlass::complete_create_array_klass(oak, super_klass, module, CHECK_NULL);
110
111 // Add all classes to our internal class loader list here,
112 // including classes in the bootstrap (null) class loader.
113 // Do this step after creating the mirror so that if the
114 // mirror creation fails, loaded_classes_do() doesn't find
115 // an array class without a mirror.
116 loader_data->add_class(oak);
117
118 return oak;
119 }
120
121 ObjArrayKlass::ObjArrayKlass(int n, Klass* element_klass, Symbol* name) : ArrayKlass(name, Kind) {
122 set_dimension(n);
123 set_element_klass(element_klass);
124
125 Klass* bk;
126 if (element_klass->is_objArray_klass()) {
127 bk = ObjArrayKlass::cast(element_klass)->bottom_klass();
128 } else {
129 bk = element_klass;
130 }
131 assert(bk != nullptr && (bk->is_instance_klass() || bk->is_typeArray_klass()), "invalid bottom klass");
132 set_bottom_klass(bk);
133 set_class_loader_data(bk->class_loader_data());
134
135 if (element_klass->is_array_klass()) {
136 set_lower_dimension(ArrayKlass::cast(element_klass));
137 }
138
139 set_layout_helper(array_layout_helper(T_OBJECT));
140 assert(is_array_klass(), "sanity");
141 assert(is_objArray_klass(), "sanity");
142 }
143
144 size_t ObjArrayKlass::oop_size(oop obj, markWord mark) const {
145 // In this assert, we cannot safely access the Klass* with compact headers,
146 // because size_given_klass() calls oop_size() on objects that might be
147 // concurrently forwarded, which would overwrite the Klass*.
148 assert(UseCompactObjectHeaders || obj->is_objArray(), "must be object array");
149 int length = LP64_ONLY(UseCompactObjectHeaders ? mark.array_length() :) objArrayOop(obj)->length();
150 return objArrayOop(obj)->object_size(length);
151 }
152
153 objArrayOop ObjArrayKlass::allocate(int length, TRAPS) {
154 check_array_allocation_length(length, arrayOopDesc::max_array_length(T_OBJECT), CHECK_NULL);
155 size_t size = objArrayOopDesc::object_size(length);
156 return (objArrayOop)Universe::heap()->array_allocate(this, size, length,
157 /* do_zero */ true, THREAD);
158 }
159
160 oop ObjArrayKlass::multi_allocate(int rank, jint* sizes, TRAPS) {
161 int length = *sizes;
162 ArrayKlass* ld_klass = lower_dimension();
163 // If length < 0 allocate will throw an exception.
164 objArrayOop array = allocate(length, CHECK_NULL);
165 objArrayHandle h_array (THREAD, array);
166 if (rank > 1) {
167 if (length != 0) {
168 for (int index = 0; index < length; index++) {
169 oop sub_array = ld_klass->multi_allocate(rank - 1, &sizes[1], CHECK_NULL);
170 h_array->obj_at_put(index, sub_array);
171 }
172 } else {
173 // Since this array dimension has zero length, nothing will be
174 // allocated, however the lower dimension values must be checked
175 // for illegal values.
176 for (int i = 0; i < rank - 1; ++i) {
177 sizes += 1;
178 if (*sizes < 0) {
179 THROW_MSG_NULL(vmSymbols::java_lang_NegativeArraySizeException(), err_msg("%d", *sizes));
180 }
181 }
182 }
183 }
184 return h_array();
185 }
186
187 // Either oop or narrowOop depending on UseCompressedOops.
188 void ObjArrayKlass::do_copy(arrayOop s, size_t src_offset,
189 arrayOop d, size_t dst_offset, int length, TRAPS) {
190 if (s == d) {
191 // since source and destination are equal we do not need conversion checks.
192 assert(length > 0, "sanity check");
193 ArrayAccess<>::oop_arraycopy(s, src_offset, d, dst_offset, length);
194 } else {
195 // We have to make sure all elements conform to the destination array
196 Klass* bound = ObjArrayKlass::cast(d->klass())->element_klass();
197 Klass* stype = ObjArrayKlass::cast(s->klass())->element_klass();
198 if (stype == bound || stype->is_subtype_of(bound)) {
199 // elements are guaranteed to be subtypes, so no check necessary
200 ArrayAccess<ARRAYCOPY_DISJOINT>::oop_arraycopy(s, src_offset, d, dst_offset, length);
201 } else {
202 // slow case: need individual subtype checks
203 // note: don't use obj_at_put below because it includes a redundant store check
204 if (!ArrayAccess<ARRAYCOPY_DISJOINT | ARRAYCOPY_CHECKCAST>::oop_arraycopy(s, src_offset, d, dst_offset, length)) {
205 ResourceMark rm(THREAD);
206 stringStream ss;
207 if (!bound->is_subtype_of(stype)) {
208 ss.print("arraycopy: type mismatch: can not copy %s[] into %s[]",
209 stype->external_name(), bound->external_name());
210 } else {
211 // oop_arraycopy should return the index in the source array that
212 // contains the problematic oop.
213 ss.print("arraycopy: element type mismatch: can not cast one of the elements"
214 " of %s[] to the type of the destination array, %s",
215 stype->external_name(), bound->external_name());
216 }
217 THROW_MSG(vmSymbols::java_lang_ArrayStoreException(), ss.as_string());
218 }
219 }
220 }
221 }
222
223 void ObjArrayKlass::copy_array(arrayOop s, int src_pos, arrayOop d,
224 int dst_pos, int length, TRAPS) {
225 assert(s->is_objArray(), "must be obj array");
226
227 if (!d->is_objArray()) {
228 ResourceMark rm(THREAD);
229 stringStream ss;
230 if (d->is_typeArray()) {
231 ss.print("arraycopy: type mismatch: can not copy object array[] into %s[]",
232 type2name_tab[ArrayKlass::cast(d->klass())->element_type()]);
233 } else {
234 ss.print("arraycopy: destination type %s is not an array", d->klass()->external_name());
235 }
236 THROW_MSG(vmSymbols::java_lang_ArrayStoreException(), ss.as_string());
237 }
238
239 // Check is all offsets and lengths are non negative
240 if (src_pos < 0 || dst_pos < 0 || length < 0) {
241 // Pass specific exception reason.
242 ResourceMark rm(THREAD);
243 stringStream ss;
244 if (src_pos < 0) {
245 ss.print("arraycopy: source index %d out of bounds for object array[%d]",
246 src_pos, s->length());
247 } else if (dst_pos < 0) {
248 ss.print("arraycopy: destination index %d out of bounds for object array[%d]",
249 dst_pos, d->length());
250 } else {
251 ss.print("arraycopy: length %d is negative", length);
252 }
253 THROW_MSG(vmSymbols::java_lang_ArrayIndexOutOfBoundsException(), ss.as_string());
254 }
255 // Check if the ranges are valid
256 if ((((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length()) ||
257 (((unsigned int) length + (unsigned int) dst_pos) > (unsigned int) d->length())) {
258 // Pass specific exception reason.
259 ResourceMark rm(THREAD);
260 stringStream ss;
261 if (((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length()) {
262 ss.print("arraycopy: last source index %u out of bounds for object array[%d]",
263 (unsigned int) length + (unsigned int) src_pos, s->length());
264 } else {
265 ss.print("arraycopy: last destination index %u out of bounds for object array[%d]",
266 (unsigned int) length + (unsigned int) dst_pos, d->length());
267 }
268 THROW_MSG(vmSymbols::java_lang_ArrayIndexOutOfBoundsException(), ss.as_string());
269 }
270
271 // Special case. Boundary cases must be checked first
272 // This allows the following call: copy_array(s, s.length(), d.length(), 0).
273 // This is correct, since the position is supposed to be an 'in between point', i.e., s.length(),
274 // points to the right of the last element.
275 if (length==0) {
276 return;
277 }
278 if (UseCompressedOops) {
279 size_t src_offset = (size_t) objArrayOopDesc::obj_at_offset<narrowOop>(src_pos);
280 size_t dst_offset = (size_t) objArrayOopDesc::obj_at_offset<narrowOop>(dst_pos);
281 assert(arrayOopDesc::obj_offset_to_raw<narrowOop>(s, src_offset, nullptr) ==
282 objArrayOop(s)->obj_at_addr<narrowOop>(src_pos), "sanity");
283 assert(arrayOopDesc::obj_offset_to_raw<narrowOop>(d, dst_offset, nullptr) ==
284 objArrayOop(d)->obj_at_addr<narrowOop>(dst_pos), "sanity");
285 do_copy(s, src_offset, d, dst_offset, length, CHECK);
286 } else {
287 size_t src_offset = (size_t) objArrayOopDesc::obj_at_offset<oop>(src_pos);
288 size_t dst_offset = (size_t) objArrayOopDesc::obj_at_offset<oop>(dst_pos);
289 assert(arrayOopDesc::obj_offset_to_raw<oop>(s, src_offset, nullptr) ==
290 objArrayOop(s)->obj_at_addr<oop>(src_pos), "sanity");
291 assert(arrayOopDesc::obj_offset_to_raw<oop>(d, dst_offset, nullptr) ==
292 objArrayOop(d)->obj_at_addr<oop>(dst_pos), "sanity");
293 do_copy(s, src_offset, d, dst_offset, length, CHECK);
294 }
295 }
296
297 bool ObjArrayKlass::can_be_primary_super_slow() const {
298 if (!bottom_klass()->can_be_primary_super())
299 // array of interfaces
300 return false;
301 else
302 return Klass::can_be_primary_super_slow();
303 }
304
305 GrowableArray<Klass*>* ObjArrayKlass::compute_secondary_supers(int num_extra_slots,
306 Array<InstanceKlass*>* transitive_interfaces) {
307 assert(transitive_interfaces == nullptr, "sanity");
308 // interfaces = { cloneable_klass, serializable_klass, elemSuper[], ... };
309 const Array<Klass*>* elem_supers = element_klass()->secondary_supers();
310 int num_elem_supers = elem_supers == nullptr ? 0 : elem_supers->length();
311 int num_secondaries = num_extra_slots + 2 + num_elem_supers;
312 if (num_secondaries == 2) {
313 // Must share this for correct bootstrapping!
314 set_secondary_supers(Universe::the_array_interfaces_array(),
315 Universe::the_array_interfaces_bitmap());
316 return nullptr;
317 } else {
318 GrowableArray<Klass*>* secondaries = new GrowableArray<Klass*>(num_elem_supers+2);
319 secondaries->push(vmClasses::Cloneable_klass());
320 secondaries->push(vmClasses::Serializable_klass());
321 for (int i = 0; i < num_elem_supers; i++) {
322 Klass* elem_super = elem_supers->at(i);
323 Klass* array_super = elem_super->array_klass_or_null();
324 assert(array_super != nullptr, "must already have been created");
325 secondaries->push(array_super);
326 }
327 return secondaries;
328 }
329 }
330
331 void ObjArrayKlass::initialize(TRAPS) {
332 bottom_klass()->initialize(THREAD); // dispatches to either InstanceKlass or TypeArrayKlass
333 }
334
335 void ObjArrayKlass::metaspace_pointers_do(MetaspaceClosure* it) {
336 ArrayKlass::metaspace_pointers_do(it);
337 it->push(&_element_klass);
338 it->push(&_bottom_klass);
339 }
340
341 u2 ObjArrayKlass::compute_modifier_flags() const {
342 // The modifier for an objectArray is the same as its element
343 assert (element_klass() != nullptr, "should be initialized");
344
345 // Return the flags of the bottom element type.
346 u2 element_flags = bottom_klass()->compute_modifier_flags();
347
348 return (element_flags & (JVM_ACC_PUBLIC | JVM_ACC_PRIVATE | JVM_ACC_PROTECTED))
349 | (JVM_ACC_ABSTRACT | JVM_ACC_FINAL);
350 }
351
352 ModuleEntry* ObjArrayKlass::module() const {
353 assert(bottom_klass() != nullptr, "ObjArrayKlass returned unexpected null bottom_klass");
354 // The array is defined in the module of its bottom class
355 return bottom_klass()->module();
356 }
357
358 PackageEntry* ObjArrayKlass::package() const {
359 assert(bottom_klass() != nullptr, "ObjArrayKlass returned unexpected null bottom_klass");
360 return bottom_klass()->package();
361 }
362
363 // Printing
364
365 void ObjArrayKlass::print_on(outputStream* st) const {
366 #ifndef PRODUCT
367 Klass::print_on(st);
368 st->print(" - instance klass: ");
369 element_klass()->print_value_on(st);
370 st->cr();
371 #endif //PRODUCT
372 }
373
374 void ObjArrayKlass::print_value_on(outputStream* st) const {
375 assert(is_klass(), "must be klass");
376
377 element_klass()->print_value_on(st);
378 st->print("[]");
379 }
380
381 #ifndef PRODUCT
382
383 void ObjArrayKlass::oop_print_on(oop obj, outputStream* st) {
384 ArrayKlass::oop_print_on(obj, st);
385 assert(obj->is_objArray(), "must be objArray");
386 objArrayOop oa = objArrayOop(obj);
387 int print_len = MIN2(oa->length(), MaxElementPrintSize);
388 for(int index = 0; index < print_len; index++) {
389 st->print(" - %3d : ", index);
390 if (oa->obj_at(index) != nullptr) {
391 oa->obj_at(index)->print_value_on(st);
392 st->cr();
393 } else {
394 st->print_cr("null");
395 }
396 }
397 int remaining = oa->length() - print_len;
398 if (remaining > 0) {
399 st->print_cr(" - <%d more elements, increase MaxElementPrintSize to print>", remaining);
400 }
401 }
402
403 #endif //PRODUCT
404
405 void ObjArrayKlass::oop_print_value_on(oop obj, outputStream* st) {
406 assert(obj->is_objArray(), "must be objArray");
407 st->print("a ");
408 element_klass()->print_value_on(st);
409 int len = objArrayOop(obj)->length();
410 st->print("[%d] ", len);
411 if (obj != nullptr) {
412 obj->print_address_on(st);
413 } else {
414 st->print_cr("null");
415 }
416 }
417
418 const char* ObjArrayKlass::internal_name() const {
419 return external_name();
420 }
421
422
423 // Verification
424
425 void ObjArrayKlass::verify_on(outputStream* st) {
426 ArrayKlass::verify_on(st);
427 guarantee(element_klass()->is_klass(), "should be klass");
428 guarantee(bottom_klass()->is_klass(), "should be klass");
429 Klass* bk = bottom_klass();
430 guarantee(bk->is_instance_klass() || bk->is_typeArray_klass(), "invalid bottom klass");
431 }
432
433 void ObjArrayKlass::oop_verify_on(oop obj, outputStream* st) {
434 ArrayKlass::oop_verify_on(obj, st);
435 guarantee(obj->is_objArray(), "must be objArray");
436 objArrayOop oa = objArrayOop(obj);
437 for(int index = 0; index < oa->length(); index++) {
438 guarantee(oopDesc::is_oop_or_null(oa->obj_at(index)), "should be oop");
439 }
440 }