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