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