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