1 /*
2 * Copyright (c) 1997, 2019, 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/systemDictionary.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.inline.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, Klass* k, Symbol* name, TRAPS) {
50 assert(ObjArrayKlass::header_size() <= InstanceKlass::header_size(),
51 "array klasses must be same size as InstanceKlass");
52
53 int size = ArrayKlass::static_size(ObjArrayKlass::header_size());
54
55 return new (loader_data, size, THREAD) ObjArrayKlass(n, k, name);
56 }
57
58 Klass* ObjArrayKlass::allocate_objArray_klass(ArrayStorageProperties storage_props,
59 int n, Klass* element_klass, TRAPS) {
60 // Eagerly allocate the direct array supertype.
61 Klass* super_klass = NULL;
62 if (storage_props.is_null_free()) {
63 assert(!Universe::is_bootstrapping(), "Need bootstrap");
64 // Arrange null ok as direct super
65 super_klass = element_klass->array_klass_or_null(ArrayStorageProperties::empty, n);
66 if (super_klass == NULL) { // allocate super...need to drop the lock
67 MutexUnlocker mu(MultiArray_lock);
68 element_klass->array_klass(ArrayStorageProperties::empty, n, CHECK_NULL);
69 // retry, start from the beginning since lock dropped...
70 return element_klass->array_klass(storage_props, n, CHECK_NULL);
71 }
72 } else if (!Universe::is_bootstrapping() || SystemDictionary::Object_klass_loaded()) {
73 Klass* element_super = element_klass->super();
74 if (element_super != NULL) {
75 // The element type has a direct super. E.g., String[] has direct super of Object[].
76 super_klass = element_super->array_klass_or_null(ArrayStorageProperties::empty);
77 bool supers_exist = super_klass != NULL;
78 // Also, see if the element has secondary supertypes.
79 // We need an array type for each.
80 const Array<Klass*>* element_supers = element_klass->secondary_supers();
81 for( int i = element_supers->length()-1; i >= 0; i-- ) {
82 Klass* elem_super = element_supers->at(i);
83 if (elem_super->array_klass_or_null(ArrayStorageProperties::empty) == NULL) {
84 supers_exist = false;
85 break;
86 }
87 }
88 if (!supers_exist) {
89 // Oops. Not allocated yet. Back out, allocate it, and retry.
90 Klass* ek = NULL;
91 {
92 MutexUnlocker mu(MultiArray_lock);
93 super_klass = element_super->array_klass(CHECK_0);
94 for( int i = element_supers->length()-1; i >= 0; i-- ) {
95 Klass* elem_super = element_supers->at(i);
96 elem_super->array_klass(CHECK_0);
97 }
98 // Now retry from the beginning
99 ek = element_klass->array_klass(storage_props, n, CHECK_0);
100 } // re-lock
101 return ek;
102 }
103 } else {
104 // The element type is already Object. Object[] has direct super of Object.
105 super_klass = SystemDictionary::Object_klass();
106 }
107 }
108
109 // Create type name for klass.
110 Symbol* name = ArrayKlass::create_element_klass_array_name(storage_props.is_null_free(), element_klass, CHECK_NULL);
111
112 // Initialize instance variables
113 ClassLoaderData* loader_data = element_klass->class_loader_data();
114 ObjArrayKlass* oak = ObjArrayKlass::allocate(loader_data, n, element_klass, name, CHECK_0);
115
116 ModuleEntry* module = oak->module();
117 assert(module != NULL, "No module entry for array");
118
119 // Call complete_create_array_klass after all instance variables has been initialized.
120 ArrayKlass::complete_create_array_klass(oak, super_klass, module, CHECK_0);
121
122 // Add all classes to our internal class loader list here,
123 // including classes in the bootstrap (NULL) class loader.
124 // Do this step after creating the mirror so that if the
125 // mirror creation fails, loaded_classes_do() doesn't find
126 // an array class without a mirror.
127 loader_data->add_class(oak);
128
129 return oak;
130 }
131
132 ObjArrayKlass::ObjArrayKlass(int n, Klass* element_klass, Symbol* name) : ArrayKlass(name, ID) {
133 this->set_dimension(n);
134 this->set_element_klass(element_klass);
135 // decrement refcount because object arrays are not explicitly freed. The
136 // InstanceKlass array_name() keeps the name counted while the klass is
137 // loaded.
138 name->decrement_refcount();
139
140 Klass* bk;
141 if (element_klass->is_objArray_klass()) {
142 bk = ObjArrayKlass::cast(element_klass)->bottom_klass();
143 } else if (element_klass->is_valueArray_klass()) {
144 bk = ValueArrayKlass::cast(element_klass)->element_klass();
145 } else {
146 bk = element_klass;
147 }
148 assert(bk != NULL && (bk->is_instance_klass()
149 || bk->is_typeArray_klass()), "invalid bottom klass");
150 this->set_bottom_klass(bk);
151 this->set_class_loader_data(bk->class_loader_data());
152
153 this->set_layout_helper(array_layout_helper(T_OBJECT));
154 assert(this->is_array_klass(), "sanity");
155 assert(this->is_objArray_klass(), "sanity");
156 }
157
158 int ObjArrayKlass::oop_size(oop obj) const {
159 assert(obj->is_objArray(), "must be object array");
160 return objArrayOop(obj)->object_size();
161 }
162
163 objArrayOop ObjArrayKlass::allocate(int length, TRAPS) {
164 check_array_allocation_length(length, arrayOopDesc::max_array_length(T_OBJECT), CHECK_0);
165 int size = objArrayOopDesc::object_size(length);
166 bool populate_null_free = storage_properties().is_null_free();
167 objArrayOop array = (objArrayOop)Universe::heap()->array_allocate(this, size, length,
168 /* do_zero */ true, THREAD);
169 if (populate_null_free) {
170 assert(dimension() == 1, "Can only populate the final dimension");
171 assert(element_klass()->is_value(), "Unexpected");
172 assert(!element_klass()->is_array_klass(), "ArrayKlass unexpected here");
173 assert(!ValueKlass::cast(element_klass())->flatten_array(), "Expected valueArrayOop allocation");
174 element_klass()->initialize(CHECK_NULL);
175 // Populate default values...
176 objArrayHandle array_h(THREAD, array);
177 instanceOop value = (instanceOop) ValueKlass::cast(element_klass())->default_value();
178 for (int i = 0; i < length; i++) {
179 array_h->obj_at_put(i, value);
180 }
181 }
182 return array;
183 }
184
185 oop ObjArrayKlass::multi_allocate(int rank, jint* sizes, TRAPS) {
186 int length = *sizes;
187 if (rank == 1) { // last dim may be valueArray, check if we have any special storage requirements
188 if ((!element_klass()->is_array_klass()) && storage_properties().is_null_free()) {
189 return oopFactory::new_valueArray(element_klass(), length, CHECK_NULL);
190 } else {
191 return oopFactory::new_objArray(element_klass(), length, CHECK_NULL);
192 }
193 }
194 guarantee(rank > 1, "Rank below 1");
195 // Call to lower_dimension uses this pointer, so most be called before a
196 // possible GC
197 Klass* ld_klass = lower_dimension();
198 // If length < 0 allocate will throw an exception.
199 objArrayOop array = allocate(length, CHECK_NULL);
200 objArrayHandle h_array (THREAD, array);
201 if (length != 0) {
202 for (int index = 0; index < length; index++) {
203 ArrayKlass* ak = ArrayKlass::cast(ld_klass);
204 oop sub_array = ak->multi_allocate(rank-1, &sizes[1], CHECK_NULL);
205 h_array->obj_at_put(index, sub_array);
206 }
207 } else {
208 // Since this array dimension has zero length, nothing will be
209 // allocated, however the lower dimension values must be checked
210 // for illegal values.
211 for (int i = 0; i < rank - 1; ++i) {
212 sizes += 1;
213 if (*sizes < 0) {
214 THROW_MSG_0(vmSymbols::java_lang_NegativeArraySizeException(), err_msg("%d", *sizes));
215 }
216 }
217 }
218 return h_array();
219 }
220
221 ArrayStorageProperties ObjArrayKlass::storage_properties() {
222 return name()->is_Q_singledim_array_signature() ? ArrayStorageProperties::null_free : ArrayStorageProperties::empty;
223 }
224
225 // Either oop or narrowOop depending on UseCompressedOops.
226 void ObjArrayKlass::do_copy(arrayOop s, size_t src_offset,
227 arrayOop d, size_t dst_offset, int length, TRAPS) {
228 if (oopDesc::equals(s, d)) {
229 // since source and destination are equal we do not need conversion checks.
230 assert(length > 0, "sanity check");
231 ArrayAccess<>::oop_arraycopy(s, src_offset, d, dst_offset, length);
232 } else {
233 // We have to make sure all elements conform to the destination array
234 Klass* bound = ObjArrayKlass::cast(d->klass())->element_klass();
235 Klass* stype = ObjArrayKlass::cast(s->klass())->element_klass();
236 if (stype == bound || stype->is_subtype_of(bound)) {
237 // elements are guaranteed to be subtypes, so no check necessary
238 ArrayAccess<ARRAYCOPY_DISJOINT>::oop_arraycopy(s, src_offset, d, dst_offset, length);
239 } else {
240 // slow case: need individual subtype checks
241 // note: don't use obj_at_put below because it includes a redundant store check
242 if (!ArrayAccess<ARRAYCOPY_DISJOINT | ARRAYCOPY_CHECKCAST>::oop_arraycopy(s, src_offset, d, dst_offset, length)) {
243 ResourceMark rm(THREAD);
244 stringStream ss;
245 if (!bound->is_subtype_of(stype)) {
246 ss.print("arraycopy: type mismatch: can not copy %s[] into %s[]",
247 stype->external_name(), bound->external_name());
248 } else {
249 // oop_arraycopy should return the index in the source array that
250 // contains the problematic oop.
251 ss.print("arraycopy: element type mismatch: can not cast one of the elements"
252 " of %s[] to the type of the destination array, %s",
253 stype->external_name(), bound->external_name());
254 }
255 THROW_MSG(vmSymbols::java_lang_ArrayStoreException(), ss.as_string());
256 }
257 }
258 }
259 }
260
261 void ObjArrayKlass::copy_array(arrayOop s, int src_pos, arrayOop d,
262 int dst_pos, int length, TRAPS) {
263 assert(s->is_objArray(), "must be obj array");
264
265 if (EnableValhalla) {
266 if (d->is_valueArray()) {
267 ValueArrayKlass::cast(d->klass())->copy_array(s, src_pos, d, dst_pos, length, THREAD);
268 return;
269 }
270 }
271
272 if (!d->is_objArray()) {
273 ResourceMark rm(THREAD);
274 stringStream ss;
275 if (d->is_typeArray()) {
276 ss.print("arraycopy: type mismatch: can not copy object array[] into %s[]",
277 type2name_tab[ArrayKlass::cast(d->klass())->element_type()]);
278 } else {
279 ss.print("arraycopy: destination type %s is not an array", d->klass()->external_name());
280 }
281 THROW_MSG(vmSymbols::java_lang_ArrayStoreException(), ss.as_string());
282 }
283
284 // Check is all offsets and lengths are non negative
285 if (src_pos < 0 || dst_pos < 0 || length < 0) {
286 // Pass specific exception reason.
287 ResourceMark rm(THREAD);
288 stringStream ss;
289 if (src_pos < 0) {
290 ss.print("arraycopy: source index %d out of bounds for object array[%d]",
291 src_pos, s->length());
292 } else if (dst_pos < 0) {
293 ss.print("arraycopy: destination index %d out of bounds for object array[%d]",
294 dst_pos, d->length());
295 } else {
296 ss.print("arraycopy: length %d is negative", length);
297 }
298 THROW_MSG(vmSymbols::java_lang_ArrayIndexOutOfBoundsException(), ss.as_string());
299 }
300 // Check if the ranges are valid
301 if ((((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length()) ||
302 (((unsigned int) length + (unsigned int) dst_pos) > (unsigned int) d->length())) {
303 // Pass specific exception reason.
304 ResourceMark rm(THREAD);
305 stringStream ss;
306 if (((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length()) {
307 ss.print("arraycopy: last source index %u out of bounds for object array[%d]",
308 (unsigned int) length + (unsigned int) src_pos, s->length());
309 } else {
310 ss.print("arraycopy: last destination index %u out of bounds for object array[%d]",
311 (unsigned int) length + (unsigned int) dst_pos, d->length());
312 }
313 THROW_MSG(vmSymbols::java_lang_ArrayIndexOutOfBoundsException(), ss.as_string());
314 }
315
316 // Special case. Boundary cases must be checked first
317 // This allows the following call: copy_array(s, s.length(), d.length(), 0).
318 // This is correct, since the position is supposed to be an 'in between point', i.e., s.length(),
319 // points to the right of the last element.
320 if (length==0) {
321 return;
322 }
323 if (EnableValhalla && ArrayKlass::cast(d->klass())->element_klass()->is_value()) {
324 assert(d->is_objArray(), "Expected objArray");
325 ValueKlass* d_elem_vklass = ValueKlass::cast(ArrayKlass::cast(d->klass())->element_klass());
326 objArrayOop da = objArrayOop(d);
327 objArrayOop sa = objArrayOop(s);
328 int src_end = src_pos + length;
329 bool null_free = ArrayKlass::cast(s->klass())->storage_properties().is_null_free() ||
330 ArrayKlass::cast(d->klass())->storage_properties().is_null_free();
331 while (src_pos < src_end) {
332 oop se = sa->obj_at(src_pos);
333 if (null_free && se == NULL) {
334 THROW(vmSymbols::java_lang_NullPointerException());
335 }
336 // Check exact type per element
337 if (se != NULL && se->klass() != d_elem_vklass) {
338 THROW(vmSymbols::java_lang_ArrayStoreException());
339 }
340 da->obj_at_put(dst_pos, se); // TODO: review with ValueArrayKlass::copy_array and Access API
341 dst_pos++;
342 src_pos++;
343 }
344 } else if (UseCompressedOops) {
345 size_t src_offset = (size_t) objArrayOopDesc::obj_at_offset<narrowOop>(src_pos);
346 size_t dst_offset = (size_t) objArrayOopDesc::obj_at_offset<narrowOop>(dst_pos);
347 assert(arrayOopDesc::obj_offset_to_raw<narrowOop>(s, src_offset, NULL) ==
348 objArrayOop(s)->obj_at_addr_raw<narrowOop>(src_pos), "sanity");
349 assert(arrayOopDesc::obj_offset_to_raw<narrowOop>(d, dst_offset, NULL) ==
350 objArrayOop(d)->obj_at_addr_raw<narrowOop>(dst_pos), "sanity");
351 do_copy(s, src_offset, d, dst_offset, length, CHECK);
352 } else {
353 size_t src_offset = (size_t) objArrayOopDesc::obj_at_offset<oop>(src_pos);
354 size_t dst_offset = (size_t) objArrayOopDesc::obj_at_offset<oop>(dst_pos);
355 assert(arrayOopDesc::obj_offset_to_raw<oop>(s, src_offset, NULL) ==
356 objArrayOop(s)->obj_at_addr_raw<oop>(src_pos), "sanity");
357 assert(arrayOopDesc::obj_offset_to_raw<oop>(d, dst_offset, NULL) ==
358 objArrayOop(d)->obj_at_addr_raw<oop>(dst_pos), "sanity");
359 do_copy(s, src_offset, d, dst_offset, length, CHECK);
360 }
361 }
362
363
364 Klass* ObjArrayKlass::array_klass_impl(ArrayStorageProperties storage_props, bool or_null, int n, TRAPS) {
365 assert(!storage_props.is_flattened() || n > 1, "Cannot flatten");
366 assert(dimension() <= n, "check order of chain");
367 int dim = dimension();
368 if (dim == n) return this;
369
370 // lock-free read needs acquire semantics
371 if (higher_dimension_acquire() == NULL) {
372 if (or_null) return NULL;
373
374 ResourceMark rm;
375 {
376 // Ensure atomic creation of higher dimensions
377 MutexLocker mu(MultiArray_lock, THREAD);
378
379 // Check if another thread beat us
380 if (higher_dimension() == NULL) {
381
382 // Create multi-dim klass object and link them together
383 Klass* k = ObjArrayKlass::allocate_objArray_klass(storage_props, dim + 1, this, CHECK_NULL);
384 ObjArrayKlass* ak = ObjArrayKlass::cast(k);
385 ak->set_lower_dimension(this);
386 // use 'release' to pair with lock-free load
387 release_set_higher_dimension(ak);
388 assert(ak->is_objArray_klass(), "incorrect initialization of ObjArrayKlass");
389 }
390 }
391 } else {
392 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
393 }
394
395 ObjArrayKlass *ak = ObjArrayKlass::cast(higher_dimension());
396 if (or_null) {
397 return ak->array_klass_or_null(storage_props, n);
398 }
399 return ak->array_klass(storage_props, n, THREAD);
400 }
401
402 Klass* ObjArrayKlass::array_klass_impl(ArrayStorageProperties storage_props, bool or_null, TRAPS) {
403 return array_klass_impl(storage_props, or_null, dimension() + 1, THREAD);
404 }
405
406 bool ObjArrayKlass::can_be_primary_super_slow() const {
407 if (!bottom_klass()->can_be_primary_super())
408 // array of interfaces
409 return false;
410 else
411 return Klass::can_be_primary_super_slow();
412 }
413
414 GrowableArray<Klass*>* ObjArrayKlass::compute_secondary_supers(int num_extra_slots,
415 Array<InstanceKlass*>* transitive_interfaces) {
416 assert(transitive_interfaces == NULL, "sanity");
417 // interfaces = { cloneable_klass, serializable_klass, elemSuper[], ... };
418 const Array<Klass*>* elem_supers = element_klass()->secondary_supers();
419 int num_elem_supers = elem_supers == NULL ? 0 : elem_supers->length();
420 int num_secondaries = num_extra_slots + 2 + num_elem_supers;
421 if (num_secondaries == 2) {
422 // Must share this for correct bootstrapping!
423 set_secondary_supers(Universe::the_array_interfaces_array());
424 return NULL;
425 } else {
426 GrowableArray<Klass*>* secondaries = new GrowableArray<Klass*>(num_elem_supers+2);
427 secondaries->push(SystemDictionary::Cloneable_klass());
428 secondaries->push(SystemDictionary::Serializable_klass());
429 for (int i = 0; i < num_elem_supers; i++) {
430 Klass* elem_super = elem_supers->at(i);
431 Klass* array_super = elem_super->array_klass_or_null(ArrayStorageProperties::empty);
432 assert(array_super != NULL, "must already have been created");
433 secondaries->push(array_super);
434 }
435 return secondaries;
436 }
437 }
438
439 void ObjArrayKlass::initialize(TRAPS) {
440 bottom_klass()->initialize(THREAD); // dispatches to either InstanceKlass or TypeArrayKlass
441 }
442
443 void ObjArrayKlass::metaspace_pointers_do(MetaspaceClosure* it) {
444 ArrayKlass::metaspace_pointers_do(it);
445 it->push(&_element_klass);
446 it->push(&_bottom_klass);
447 }
448
449 // JVM support
450
451 jint ObjArrayKlass::compute_modifier_flags(TRAPS) const {
452 // The modifier for an objectArray is the same as its element
453 if (element_klass() == NULL) {
454 assert(Universe::is_bootstrapping(), "partial objArray only at startup");
455 return JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC;
456 }
457 // Return the flags of the bottom element type.
458 jint element_flags = bottom_klass()->compute_modifier_flags(CHECK_0);
459
460 return (element_flags & (JVM_ACC_PUBLIC | JVM_ACC_PRIVATE | JVM_ACC_PROTECTED))
461 | (JVM_ACC_ABSTRACT | JVM_ACC_FINAL);
462 }
463
464 ModuleEntry* ObjArrayKlass::module() const {
465 assert(bottom_klass() != NULL, "ObjArrayKlass returned unexpected NULL bottom_klass");
466 // The array is defined in the module of its bottom class
467 return bottom_klass()->module();
468 }
469
470 PackageEntry* ObjArrayKlass::package() const {
471 assert(bottom_klass() != NULL, "ObjArrayKlass returned unexpected NULL bottom_klass");
472 return bottom_klass()->package();
473 }
474
475 // Printing
476
477 void ObjArrayKlass::print_on(outputStream* st) const {
478 #ifndef PRODUCT
479 Klass::print_on(st);
480 st->print(" - element klass: ");
481 element_klass()->print_value_on(st);
482 st->cr();
483 #endif //PRODUCT
484 }
485
486 void ObjArrayKlass::print_value_on(outputStream* st) const {
487 assert(is_klass(), "must be klass");
488
489 element_klass()->print_value_on(st);
490 st->print("[]");
491 }
492
493 #ifndef PRODUCT
494
495 void ObjArrayKlass::oop_print_on(oop obj, outputStream* st) {
496 ArrayKlass::oop_print_on(obj, st);
497 assert(obj->is_objArray(), "must be objArray");
498 objArrayOop oa = objArrayOop(obj);
499 int print_len = MIN2((intx) oa->length(), MaxElementPrintSize);
500 for(int index = 0; index < print_len; index++) {
501 st->print(" - %3d : ", index);
502 if (oa->obj_at(index) != NULL) {
503 oa->obj_at(index)->print_value_on(st);
504 st->cr();
505 } else {
506 st->print_cr("NULL");
507 }
508 }
509 int remaining = oa->length() - print_len;
510 if (remaining > 0) {
511 st->print_cr(" - <%d more elements, increase MaxElementPrintSize to print>", remaining);
512 }
513 }
514
515 #endif //PRODUCT
516
517 void ObjArrayKlass::oop_print_value_on(oop obj, outputStream* st) {
518 assert(obj->is_objArray(), "must be objArray");
519 st->print("a ");
520 element_klass()->print_value_on(st);
521 int len = objArrayOop(obj)->length();
522 st->print("[%d] ", len);
523 if (obj != NULL) {
524 obj->print_address_on(st);
525 } else {
526 st->print_cr("NULL");
527 }
528 }
529
530 const char* ObjArrayKlass::internal_name() const {
531 return external_name();
532 }
533
534
535 // Verification
536
537 void ObjArrayKlass::verify_on(outputStream* st) {
538 ArrayKlass::verify_on(st);
539 guarantee(element_klass()->is_klass(), "should be klass");
540 guarantee(bottom_klass()->is_klass(), "should be klass");
541 Klass* bk = bottom_klass();
542 guarantee(bk->is_instance_klass() || bk->is_typeArray_klass() || bk->is_valueArray_klass(),
543 "invalid bottom klass");
544 }
545
546 void ObjArrayKlass::oop_verify_on(oop obj, outputStream* st) {
547 ArrayKlass::oop_verify_on(obj, st);
548 guarantee(obj->is_objArray(), "must be objArray");
549 objArrayOop oa = objArrayOop(obj);
550 for(int index = 0; index < oa->length(); index++) {
551 guarantee(oopDesc::is_oop_or_null(oa->obj_at(index)), "should be oop");
552 }
553 }