annotate src/share/vm/oops/objArrayKlass.cpp @ 4872:e0c9a1d29eb4

8016325: JVM hangs verifying system dictionary Summary: Minimize redundant verifications of Klasses. Reviewed-by: hseigel, jmasa
author coleenp
date Mon, 24 Jun 2013 18:55:46 -0400
parents db9981fd3124
children 55a0da3d420b
rev   line source
duke@0 1 /*
sspitsyn@3203 2 * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved.
duke@0 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@0 4 *
duke@0 5 * This code is free software; you can redistribute it and/or modify it
duke@0 6 * under the terms of the GNU General Public License version 2 only, as
duke@0 7 * published by the Free Software Foundation.
duke@0 8 *
duke@0 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@0 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@0 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@0 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@0 13 * accompanied this code).
duke@0 14 *
duke@0 15 * You should have received a copy of the GNU General Public License version
duke@0 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@0 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@0 18 *
trims@1472 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1472 20 * or visit www.oracle.com if you need additional information or have any
trims@1472 21 * questions.
duke@0 22 *
duke@0 23 */
duke@0 24
stefank@1879 25 #include "precompiled.hpp"
coleenp@3602 26 #include "classfile/symbolTable.hpp"
stefank@1879 27 #include "classfile/systemDictionary.hpp"
stefank@1879 28 #include "classfile/vmSymbols.hpp"
stefank@1879 29 #include "gc_implementation/shared/markSweep.inline.hpp"
stefank@1879 30 #include "gc_interface/collectedHeap.inline.hpp"
stefank@1879 31 #include "memory/genOopClosures.inline.hpp"
coleenp@3602 32 #include "memory/metadataFactory.hpp"
stefank@1879 33 #include "memory/resourceArea.hpp"
stefank@1879 34 #include "memory/universe.inline.hpp"
stefank@1879 35 #include "oops/instanceKlass.hpp"
coleenp@3602 36 #include "oops/klass.inline.hpp"
stefank@1879 37 #include "oops/objArrayKlass.hpp"
stefank@1879 38 #include "oops/objArrayKlass.inline.hpp"
stefank@1879 39 #include "oops/objArrayOop.hpp"
stefank@1879 40 #include "oops/oop.inline.hpp"
stefank@1879 41 #include "oops/oop.inline2.hpp"
coleenp@2062 42 #include "oops/symbol.hpp"
stefank@1879 43 #include "runtime/handles.inline.hpp"
stefank@1879 44 #include "runtime/mutexLocker.hpp"
stefank@1879 45 #include "utilities/copy.hpp"
jprovino@4107 46 #include "utilities/macros.hpp"
jprovino@4107 47 #if INCLUDE_ALL_GCS
coleenp@3602 48 #include "gc_implementation/concurrentMarkSweep/cmsOopClosures.inline.hpp"
stefank@1879 49 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
stefank@1879 50 #include "gc_implementation/g1/g1OopClosures.inline.hpp"
stefank@1879 51 #include "gc_implementation/g1/g1RemSet.inline.hpp"
stefank@1879 52 #include "gc_implementation/g1/heapRegionSeq.inline.hpp"
stefank@1879 53 #include "gc_implementation/parNew/parOopClosures.inline.hpp"
stefank@1879 54 #include "gc_implementation/parallelScavenge/psCompactionManager.hpp"
stefank@1879 55 #include "gc_implementation/parallelScavenge/psPromotionManager.inline.hpp"
stefank@1879 56 #include "gc_implementation/parallelScavenge/psScavenge.inline.hpp"
stefank@1879 57 #include "oops/oop.pcgc.inline.hpp"
jprovino@4107 58 #endif // INCLUDE_ALL_GCS
duke@0 59
coleenp@3707 60 ObjArrayKlass* ObjArrayKlass::allocate(ClassLoaderData* loader_data, int n, KlassHandle klass_handle, Symbol* name, TRAPS) {
coleenp@3707 61 assert(ObjArrayKlass::header_size() <= InstanceKlass::header_size(),
coleenp@3602 62 "array klasses must be same size as InstanceKlass");
coleenp@3602 63
coleenp@3707 64 int size = ArrayKlass::static_size(ObjArrayKlass::header_size());
coleenp@3602 65
coleenp@3707 66 return new (loader_data, size, THREAD) ObjArrayKlass(n, klass_handle, name);
coleenp@3602 67 }
coleenp@3602 68
coleenp@3707 69 Klass* ObjArrayKlass::allocate_objArray_klass(ClassLoaderData* loader_data,
coleenp@3602 70 int n, KlassHandle element_klass, TRAPS) {
coleenp@3602 71
coleenp@3602 72 // Eagerly allocate the direct array supertype.
coleenp@3602 73 KlassHandle super_klass = KlassHandle();
coleenp@3602 74 if (!Universe::is_bootstrapping() || SystemDictionary::Object_klass_loaded()) {
coleenp@3602 75 KlassHandle element_super (THREAD, element_klass->super());
coleenp@3602 76 if (element_super.not_null()) {
coleenp@3602 77 // The element type has a direct super. E.g., String[] has direct super of Object[].
coleenp@3602 78 super_klass = KlassHandle(THREAD, element_super->array_klass_or_null());
coleenp@3602 79 bool supers_exist = super_klass.not_null();
coleenp@3602 80 // Also, see if the element has secondary supertypes.
coleenp@3602 81 // We need an array type for each.
coleenp@3602 82 Array<Klass*>* element_supers = element_klass->secondary_supers();
coleenp@3602 83 for( int i = element_supers->length()-1; i >= 0; i-- ) {
coleenp@3602 84 Klass* elem_super = element_supers->at(i);
hseigel@3843 85 if (elem_super->array_klass_or_null() == NULL) {
coleenp@3602 86 supers_exist = false;
coleenp@3602 87 break;
coleenp@3602 88 }
coleenp@3602 89 }
coleenp@3602 90 if (!supers_exist) {
coleenp@3602 91 // Oops. Not allocated yet. Back out, allocate it, and retry.
coleenp@3602 92 KlassHandle ek;
coleenp@3602 93 {
coleenp@3602 94 MutexUnlocker mu(MultiArray_lock);
coleenp@3602 95 MutexUnlocker mc(Compile_lock); // for vtables
coleenp@3602 96 Klass* sk = element_super->array_klass(CHECK_0);
coleenp@3602 97 super_klass = KlassHandle(THREAD, sk);
coleenp@3602 98 for( int i = element_supers->length()-1; i >= 0; i-- ) {
coleenp@3602 99 KlassHandle elem_super (THREAD, element_supers->at(i));
coleenp@3602 100 elem_super->array_klass(CHECK_0);
coleenp@3602 101 }
coleenp@3602 102 // Now retry from the beginning
coleenp@3602 103 Klass* klass_oop = element_klass->array_klass(n, CHECK_0);
coleenp@3602 104 // Create a handle because the enclosing brace, when locking
coleenp@3602 105 // can cause a gc. Better to have this function return a Handle.
coleenp@3602 106 ek = KlassHandle(THREAD, klass_oop);
coleenp@3602 107 } // re-lock
coleenp@3602 108 return ek();
coleenp@3602 109 }
coleenp@3602 110 } else {
coleenp@3602 111 // The element type is already Object. Object[] has direct super of Object.
coleenp@3602 112 super_klass = KlassHandle(THREAD, SystemDictionary::Object_klass());
coleenp@3602 113 }
coleenp@3602 114 }
coleenp@3602 115
coleenp@3602 116 // Create type name for klass.
coleenp@3602 117 Symbol* name = NULL;
coleenp@3602 118 if (!element_klass->oop_is_instance() ||
coleenp@3602 119 (name = InstanceKlass::cast(element_klass())->array_name()) == NULL) {
coleenp@3602 120
coleenp@3602 121 ResourceMark rm(THREAD);
coleenp@3602 122 char *name_str = element_klass->name()->as_C_string();
coleenp@3602 123 int len = element_klass->name()->utf8_length();
coleenp@3602 124 char *new_str = NEW_RESOURCE_ARRAY(char, len + 4);
coleenp@3602 125 int idx = 0;
coleenp@3602 126 new_str[idx++] = '[';
coleenp@3602 127 if (element_klass->oop_is_instance()) { // it could be an array or simple type
coleenp@3602 128 new_str[idx++] = 'L';
coleenp@3602 129 }
coleenp@3602 130 memcpy(&new_str[idx], name_str, len * sizeof(char));
coleenp@3602 131 idx += len;
coleenp@3602 132 if (element_klass->oop_is_instance()) {
coleenp@3602 133 new_str[idx++] = ';';
coleenp@3602 134 }
coleenp@3602 135 new_str[idx++] = '\0';
coleenp@3602 136 name = SymbolTable::new_permanent_symbol(new_str, CHECK_0);
coleenp@3602 137 if (element_klass->oop_is_instance()) {
coleenp@3602 138 InstanceKlass* ik = InstanceKlass::cast(element_klass());
coleenp@3602 139 ik->set_array_name(name);
coleenp@3602 140 }
coleenp@3602 141 }
coleenp@3602 142
coleenp@3602 143 // Initialize instance variables
coleenp@3707 144 ObjArrayKlass* oak = ObjArrayKlass::allocate(loader_data, n, element_klass, name, CHECK_0);
coleenp@3602 145
coleenp@3602 146 // Add all classes to our internal class loader list here,
coleenp@3602 147 // including classes in the bootstrap (NULL) class loader.
coleenp@3602 148 // GC walks these as strong roots.
coleenp@3602 149 loader_data->add_class(oak);
coleenp@3602 150
coleenp@3602 151 // Call complete_create_array_klass after all instance variables has been initialized.
coleenp@3707 152 ArrayKlass::complete_create_array_klass(oak, super_klass, CHECK_0);
coleenp@3602 153
coleenp@3602 154 return oak;
coleenp@3602 155 }
coleenp@3602 156
coleenp@3707 157 ObjArrayKlass::ObjArrayKlass(int n, KlassHandle element_klass, Symbol* name) : ArrayKlass(name) {
coleenp@3602 158 this->set_dimension(n);
coleenp@3602 159 this->set_element_klass(element_klass());
coleenp@3602 160 // decrement refcount because object arrays are not explicitly freed. The
coleenp@3602 161 // InstanceKlass array_name() keeps the name counted while the klass is
coleenp@3602 162 // loaded.
coleenp@3602 163 name->decrement_refcount();
coleenp@3602 164
coleenp@3602 165 Klass* bk;
coleenp@3602 166 if (element_klass->oop_is_objArray()) {
coleenp@3707 167 bk = ObjArrayKlass::cast(element_klass())->bottom_klass();
coleenp@3602 168 } else {
coleenp@3602 169 bk = element_klass();
coleenp@3602 170 }
hseigel@3843 171 assert(bk != NULL && (bk->oop_is_instance() || bk->oop_is_typeArray()), "invalid bottom klass");
coleenp@3602 172 this->set_bottom_klass(bk);
coleenp@3602 173 this->set_class_loader_data(bk->class_loader_data());
coleenp@3602 174
coleenp@3602 175 this->set_layout_helper(array_layout_helper(T_OBJECT));
coleenp@3602 176 assert(this->oop_is_array(), "sanity");
coleenp@3602 177 assert(this->oop_is_objArray(), "sanity");
coleenp@3602 178 }
coleenp@3602 179
coleenp@3707 180 int ObjArrayKlass::oop_size(oop obj) const {
duke@0 181 assert(obj->is_objArray(), "must be object array");
duke@0 182 return objArrayOop(obj)->object_size();
duke@0 183 }
duke@0 184
coleenp@3707 185 objArrayOop ObjArrayKlass::allocate(int length, TRAPS) {
duke@0 186 if (length >= 0) {
duke@0 187 if (length <= arrayOopDesc::max_array_length(T_OBJECT)) {
duke@0 188 int size = objArrayOopDesc::object_size(length);
coleenp@3602 189 KlassHandle h_k(THREAD, this);
coleenp@3602 190 return (objArrayOop)CollectedHeap::array_allocate(h_k, size, length, CHECK_NULL);
duke@0 191 } else {
martin@876 192 report_java_out_of_memory("Requested array size exceeds VM limit");
sspitsyn@3203 193 JvmtiExport::post_array_size_exhausted();
duke@0 194 THROW_OOP_0(Universe::out_of_memory_error_array_size());
duke@0 195 }
duke@0 196 } else {
duke@0 197 THROW_0(vmSymbols::java_lang_NegativeArraySizeException());
duke@0 198 }
duke@0 199 }
duke@0 200
duke@0 201 static int multi_alloc_counter = 0;
duke@0 202
coleenp@3707 203 oop ObjArrayKlass::multi_allocate(int rank, jint* sizes, TRAPS) {
duke@0 204 int length = *sizes;
duke@0 205 // Call to lower_dimension uses this pointer, so most be called before a
duke@0 206 // possible GC
duke@0 207 KlassHandle h_lower_dimension(THREAD, lower_dimension());
duke@0 208 // If length < 0 allocate will throw an exception.
duke@0 209 objArrayOop array = allocate(length, CHECK_NULL);
duke@0 210 objArrayHandle h_array (THREAD, array);
duke@0 211 if (rank > 1) {
duke@0 212 if (length != 0) {
duke@0 213 for (int index = 0; index < length; index++) {
coleenp@3707 214 ArrayKlass* ak = ArrayKlass::cast(h_lower_dimension());
duke@0 215 oop sub_array = ak->multi_allocate(rank-1, &sizes[1], CHECK_NULL);
duke@0 216 h_array->obj_at_put(index, sub_array);
duke@0 217 }
duke@0 218 } else {
duke@0 219 // Since this array dimension has zero length, nothing will be
duke@0 220 // allocated, however the lower dimension values must be checked
duke@0 221 // for illegal values.
duke@0 222 for (int i = 0; i < rank - 1; ++i) {
duke@0 223 sizes += 1;
duke@0 224 if (*sizes < 0) {
duke@0 225 THROW_0(vmSymbols::java_lang_NegativeArraySizeException());
duke@0 226 }
duke@0 227 }
duke@0 228 }
duke@0 229 }
duke@0 230 return h_array();
duke@0 231 }
duke@0 232
coleenp@113 233 // Either oop or narrowOop depending on UseCompressedOops.
coleenp@3707 234 template <class T> void ObjArrayKlass::do_copy(arrayOop s, T* src,
coleenp@113 235 arrayOop d, T* dst, int length, TRAPS) {
coleenp@113 236
coleenp@113 237 BarrierSet* bs = Universe::heap()->barrier_set();
ysr@342 238 // For performance reasons, we assume we are that the write barrier we
ysr@342 239 // are using has optimized modes for arrays of references. At least one
ysr@342 240 // of the asserts below will fail if this is not the case.
coleenp@113 241 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt");
ysr@342 242 assert(bs->has_write_ref_array_pre_opt(), "For pre-barrier as well.");
coleenp@113 243
coleenp@113 244 if (s == d) {
coleenp@113 245 // since source and destination are equal we do not need conversion checks.
coleenp@113 246 assert(length > 0, "sanity check");
ysr@845 247 bs->write_ref_array_pre(dst, length);
coleenp@113 248 Copy::conjoint_oops_atomic(src, dst, length);
coleenp@113 249 } else {
coleenp@113 250 // We have to make sure all elements conform to the destination array
coleenp@3707 251 Klass* bound = ObjArrayKlass::cast(d->klass())->element_klass();
coleenp@3707 252 Klass* stype = ObjArrayKlass::cast(s->klass())->element_klass();
hseigel@3843 253 if (stype == bound || stype->is_subtype_of(bound)) {
coleenp@113 254 // elements are guaranteed to be subtypes, so no check necessary
ysr@845 255 bs->write_ref_array_pre(dst, length);
coleenp@113 256 Copy::conjoint_oops_atomic(src, dst, length);
coleenp@113 257 } else {
coleenp@113 258 // slow case: need individual subtype checks
coleenp@113 259 // note: don't use obj_at_put below because it includes a redundant store check
coleenp@113 260 T* from = src;
coleenp@113 261 T* end = from + length;
coleenp@113 262 for (T* p = dst; from < end; from++, p++) {
coleenp@113 263 // XXX this is going to be slow.
coleenp@113 264 T element = *from;
ysr@342 265 // even slower now
ysr@342 266 bool element_is_null = oopDesc::is_null(element);
ysr@342 267 oop new_val = element_is_null ? oop(NULL)
ysr@342 268 : oopDesc::decode_heap_oop_not_null(element);
ysr@342 269 if (element_is_null ||
hseigel@3843 270 (new_val->klass())->is_subtype_of(bound)) {
ysr@342 271 bs->write_ref_field_pre(p, new_val);
coleenp@113 272 *p = *from;
coleenp@113 273 } else {
coleenp@113 274 // We must do a barrier to cover the partial copy.
coleenp@113 275 const size_t pd = pointer_delta(p, dst, (size_t)heapOopSize);
coleenp@113 276 // pointer delta is scaled to number of elements (length field in
coleenp@113 277 // objArrayOop) which we assume is 32 bit.
coleenp@113 278 assert(pd == (size_t)(int)pd, "length field overflow");
ysr@1091 279 bs->write_ref_array((HeapWord*)dst, pd);
coleenp@113 280 THROW(vmSymbols::java_lang_ArrayStoreException());
coleenp@113 281 return;
coleenp@113 282 }
coleenp@113 283 }
coleenp@113 284 }
coleenp@113 285 }
ysr@1091 286 bs->write_ref_array((HeapWord*)dst, length);
coleenp@113 287 }
coleenp@113 288
coleenp@3707 289 void ObjArrayKlass::copy_array(arrayOop s, int src_pos, arrayOop d,
duke@0 290 int dst_pos, int length, TRAPS) {
duke@0 291 assert(s->is_objArray(), "must be obj array");
duke@0 292
duke@0 293 if (!d->is_objArray()) {
duke@0 294 THROW(vmSymbols::java_lang_ArrayStoreException());
duke@0 295 }
duke@0 296
duke@0 297 // Check is all offsets and lengths are non negative
duke@0 298 if (src_pos < 0 || dst_pos < 0 || length < 0) {
duke@0 299 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());
duke@0 300 }
duke@0 301 // Check if the ranges are valid
duke@0 302 if ( (((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length())
duke@0 303 || (((unsigned int) length + (unsigned int) dst_pos) > (unsigned int) d->length()) ) {
duke@0 304 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());
duke@0 305 }
duke@0 306
duke@0 307 // Special case. Boundary cases must be checked first
duke@0 308 // This allows the following call: copy_array(s, s.length(), d.length(), 0).
duke@0 309 // This is correct, since the position is supposed to be an 'in between point', i.e., s.length(),
duke@0 310 // points to the right of the last element.
duke@0 311 if (length==0) {
duke@0 312 return;
duke@0 313 }
coleenp@113 314 if (UseCompressedOops) {
coleenp@113 315 narrowOop* const src = objArrayOop(s)->obj_at_addr<narrowOop>(src_pos);
coleenp@113 316 narrowOop* const dst = objArrayOop(d)->obj_at_addr<narrowOop>(dst_pos);
coleenp@113 317 do_copy<narrowOop>(s, src, d, dst, length, CHECK);
duke@0 318 } else {
coleenp@113 319 oop* const src = objArrayOop(s)->obj_at_addr<oop>(src_pos);
coleenp@113 320 oop* const dst = objArrayOop(d)->obj_at_addr<oop>(dst_pos);
coleenp@113 321 do_copy<oop> (s, src, d, dst, length, CHECK);
duke@0 322 }
duke@0 323 }
duke@0 324
duke@0 325
coleenp@3707 326 Klass* ObjArrayKlass::array_klass_impl(bool or_null, int n, TRAPS) {
duke@0 327
coleenp@3602 328 assert(dimension() <= n, "check order of chain");
coleenp@3602 329 int dim = dimension();
coleenp@3602 330 if (dim == n) return this;
duke@0 331
coleenp@3602 332 if (higher_dimension() == NULL) {
duke@0 333 if (or_null) return NULL;
duke@0 334
duke@0 335 ResourceMark rm;
duke@0 336 JavaThread *jt = (JavaThread *)THREAD;
duke@0 337 {
duke@0 338 MutexLocker mc(Compile_lock, THREAD); // for vtables
duke@0 339 // Ensure atomic creation of higher dimensions
duke@0 340 MutexLocker mu(MultiArray_lock, THREAD);
duke@0 341
duke@0 342 // Check if another thread beat us
coleenp@3602 343 if (higher_dimension() == NULL) {
duke@0 344
duke@0 345 // Create multi-dim klass object and link them together
coleenp@3602 346 Klass* k =
coleenp@3707 347 ObjArrayKlass::allocate_objArray_klass(class_loader_data(), dim + 1, this, CHECK_NULL);
coleenp@3707 348 ObjArrayKlass* ak = ObjArrayKlass::cast(k);
coleenp@3602 349 ak->set_lower_dimension(this);
kvn@2004 350 OrderAccess::storestore();
coleenp@3602 351 set_higher_dimension(ak);
coleenp@3707 352 assert(ak->oop_is_objArray(), "incorrect initialization of ObjArrayKlass");
duke@0 353 }
duke@0 354 }
duke@0 355 } else {
duke@0 356 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
duke@0 357 }
duke@0 358
coleenp@3707 359 ObjArrayKlass *ak = ObjArrayKlass::cast(higher_dimension());
duke@0 360 if (or_null) {
duke@0 361 return ak->array_klass_or_null(n);
duke@0 362 }
duke@0 363 return ak->array_klass(n, CHECK_NULL);
duke@0 364 }
duke@0 365
coleenp@3707 366 Klass* ObjArrayKlass::array_klass_impl(bool or_null, TRAPS) {
duke@0 367 return array_klass_impl(or_null, dimension() + 1, CHECK_NULL);
duke@0 368 }
duke@0 369
coleenp@3707 370 bool ObjArrayKlass::can_be_primary_super_slow() const {
coleenp@3602 371 if (!bottom_klass()->can_be_primary_super())
duke@0 372 // array of interfaces
duke@0 373 return false;
duke@0 374 else
duke@0 375 return Klass::can_be_primary_super_slow();
duke@0 376 }
duke@0 377
coleenp@3707 378 GrowableArray<Klass*>* ObjArrayKlass::compute_secondary_supers(int num_extra_slots) {
duke@0 379 // interfaces = { cloneable_klass, serializable_klass, elemSuper[], ... };
hseigel@3843 380 Array<Klass*>* elem_supers = element_klass()->secondary_supers();
coleenp@3602 381 int num_elem_supers = elem_supers == NULL ? 0 : elem_supers->length();
duke@0 382 int num_secondaries = num_extra_slots + 2 + num_elem_supers;
duke@0 383 if (num_secondaries == 2) {
duke@0 384 // Must share this for correct bootstrapping!
coleenp@3602 385 set_secondary_supers(Universe::the_array_interfaces_array());
coleenp@3602 386 return NULL;
duke@0 387 } else {
coleenp@3602 388 GrowableArray<Klass*>* secondaries = new GrowableArray<Klass*>(num_elem_supers+2);
coleenp@3602 389 secondaries->push(SystemDictionary::Cloneable_klass());
coleenp@3602 390 secondaries->push(SystemDictionary::Serializable_klass());
duke@0 391 for (int i = 0; i < num_elem_supers; i++) {
coleenp@3602 392 Klass* elem_super = (Klass*) elem_supers->at(i);
coleenp@3602 393 Klass* array_super = elem_super->array_klass_or_null();
duke@0 394 assert(array_super != NULL, "must already have been created");
coleenp@3602 395 secondaries->push(array_super);
duke@0 396 }
coleenp@3602 397 return secondaries;
duke@0 398 }
duke@0 399 }
duke@0 400
coleenp@3707 401 bool ObjArrayKlass::compute_is_subtype_of(Klass* k) {
coleenp@3602 402 if (!k->oop_is_objArray())
coleenp@3707 403 return ArrayKlass::compute_is_subtype_of(k);
duke@0 404
coleenp@3707 405 ObjArrayKlass* oak = ObjArrayKlass::cast(k);
coleenp@3602 406 return element_klass()->is_subtype_of(oak->element_klass());
duke@0 407 }
duke@0 408
coleenp@3707 409 void ObjArrayKlass::initialize(TRAPS) {
hseigel@3843 410 bottom_klass()->initialize(THREAD); // dispatches to either InstanceKlass or TypeArrayKlass
duke@0 411 }
duke@0 412
coleenp@113 413 #define ObjArrayKlass_SPECIALIZED_OOP_ITERATE(T, a, p, do_oop) \
coleenp@113 414 { \
coleenp@113 415 T* p = (T*)(a)->base(); \
coleenp@113 416 T* const end = p + (a)->length(); \
coleenp@113 417 while (p < end) { \
coleenp@113 418 do_oop; \
coleenp@113 419 p++; \
coleenp@113 420 } \
coleenp@113 421 }
coleenp@113 422
coleenp@113 423 #define ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(T, a, p, low, high, do_oop) \
coleenp@113 424 { \
coleenp@113 425 T* const l = (T*)(low); \
coleenp@113 426 T* const h = (T*)(high); \
coleenp@113 427 T* p = (T*)(a)->base(); \
coleenp@113 428 T* end = p + (a)->length(); \
coleenp@113 429 if (p < l) p = l; \
coleenp@113 430 if (end > h) end = h; \
coleenp@113 431 while (p < end) { \
coleenp@113 432 do_oop; \
coleenp@113 433 ++p; \
coleenp@113 434 } \
coleenp@113 435 }
coleenp@113 436
coleenp@113 437 #define ObjArrayKlass_OOP_ITERATE(a, p, do_oop) \
coleenp@113 438 if (UseCompressedOops) { \
coleenp@113 439 ObjArrayKlass_SPECIALIZED_OOP_ITERATE(narrowOop, \
coleenp@113 440 a, p, do_oop) \
coleenp@113 441 } else { \
coleenp@113 442 ObjArrayKlass_SPECIALIZED_OOP_ITERATE(oop, \
coleenp@113 443 a, p, do_oop) \
coleenp@113 444 }
coleenp@113 445
coleenp@113 446 #define ObjArrayKlass_BOUNDED_OOP_ITERATE(a, p, low, high, do_oop) \
coleenp@113 447 if (UseCompressedOops) { \
coleenp@113 448 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \
coleenp@113 449 a, p, low, high, do_oop) \
coleenp@113 450 } else { \
coleenp@113 451 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop, \
coleenp@113 452 a, p, low, high, do_oop) \
coleenp@113 453 }
duke@0 454
coleenp@3707 455 void ObjArrayKlass::oop_follow_contents(oop obj) {
duke@0 456 assert (obj->is_array(), "obj must be array");
coleenp@3602 457 MarkSweep::follow_klass(obj->klass());
jcoomes@1311 458 if (UseCompressedOops) {
jcoomes@1311 459 objarray_follow_contents<narrowOop>(obj, 0);
jcoomes@1311 460 } else {
jcoomes@1311 461 objarray_follow_contents<oop>(obj, 0);
jcoomes@1311 462 }
duke@0 463 }
duke@0 464
jprovino@4107 465 #if INCLUDE_ALL_GCS
coleenp@3707 466 void ObjArrayKlass::oop_follow_contents(ParCompactionManager* cm,
duke@0 467 oop obj) {
jcoomes@1311 468 assert(obj->is_array(), "obj must be array");
coleenp@3602 469 PSParallelCompact::follow_klass(cm, obj->klass());
jcoomes@1311 470 if (UseCompressedOops) {
jcoomes@1311 471 objarray_follow_contents<narrowOop>(cm, obj, 0);
jcoomes@1311 472 } else {
jcoomes@1311 473 objarray_follow_contents<oop>(cm, obj, 0);
jcoomes@1311 474 }
duke@0 475 }
jprovino@4107 476 #endif // INCLUDE_ALL_GCS
duke@0 477
coleenp@3602 478 #define if_do_metadata_checked(closure, nv_suffix) \
coleenp@3602 479 /* Make sure the non-virtual and the virtual versions match. */ \
coleenp@3602 480 assert(closure->do_metadata##nv_suffix() == closure->do_metadata(), \
coleenp@3602 481 "Inconsistency in do_metadata"); \
coleenp@3602 482 if (closure->do_metadata##nv_suffix())
coleenp@3602 483
duke@0 484 #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN(OopClosureType, nv_suffix) \
duke@0 485 \
coleenp@3707 486 int ObjArrayKlass::oop_oop_iterate##nv_suffix(oop obj, \
duke@0 487 OopClosureType* closure) { \
duke@0 488 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \
duke@0 489 assert (obj->is_array(), "obj must be array"); \
duke@0 490 objArrayOop a = objArrayOop(obj); \
duke@0 491 /* Get size before changing pointers. */ \
duke@0 492 /* Don't call size() or oop_size() since that is a virtual call. */ \
duke@0 493 int size = a->object_size(); \
coleenp@3602 494 if_do_metadata_checked(closure, nv_suffix) { \
coleenp@3602 495 closure->do_klass##nv_suffix(obj->klass()); \
duke@0 496 } \
coleenp@113 497 ObjArrayKlass_OOP_ITERATE(a, p, (closure)->do_oop##nv_suffix(p)) \
duke@0 498 return size; \
duke@0 499 }
duke@0 500
duke@0 501 #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m(OopClosureType, nv_suffix) \
duke@0 502 \
coleenp@3707 503 int ObjArrayKlass::oop_oop_iterate##nv_suffix##_m(oop obj, \
duke@0 504 OopClosureType* closure, \
duke@0 505 MemRegion mr) { \
duke@0 506 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \
duke@0 507 assert(obj->is_array(), "obj must be array"); \
duke@0 508 objArrayOop a = objArrayOop(obj); \
duke@0 509 /* Get size before changing pointers. */ \
duke@0 510 /* Don't call size() or oop_size() since that is a virtual call */ \
duke@0 511 int size = a->object_size(); \
coleenp@3602 512 if_do_metadata_checked(closure, nv_suffix) { \
coleenp@3602 513 /* SSS: Do we need to pass down mr here? */ \
coleenp@3602 514 closure->do_klass##nv_suffix(a->klass()); \
duke@0 515 } \
coleenp@113 516 ObjArrayKlass_BOUNDED_OOP_ITERATE( \
coleenp@113 517 a, p, mr.start(), mr.end(), (closure)->do_oop##nv_suffix(p)) \
coleenp@113 518 return size; \
coleenp@113 519 }
coleenp@113 520
coleenp@113 521 // Like oop_oop_iterate but only iterates over a specified range and only used
coleenp@113 522 // for objArrayOops.
coleenp@113 523 #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN_r(OopClosureType, nv_suffix) \
coleenp@113 524 \
coleenp@3707 525 int ObjArrayKlass::oop_oop_iterate_range##nv_suffix(oop obj, \
coleenp@113 526 OopClosureType* closure, \
coleenp@113 527 int start, int end) { \
coleenp@113 528 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \
coleenp@113 529 assert(obj->is_array(), "obj must be array"); \
coleenp@113 530 objArrayOop a = objArrayOop(obj); \
coleenp@113 531 /* Get size before changing pointers. */ \
coleenp@113 532 /* Don't call size() or oop_size() since that is a virtual call */ \
coleenp@113 533 int size = a->object_size(); \
coleenp@113 534 if (UseCompressedOops) { \
coleenp@113 535 HeapWord* low = start == 0 ? (HeapWord*)a : (HeapWord*)a->obj_at_addr<narrowOop>(start);\
coleenp@113 536 /* this might be wierd if end needs to be aligned on HeapWord boundary */ \
coleenp@113 537 HeapWord* high = (HeapWord*)((narrowOop*)a->base() + end); \
coleenp@113 538 MemRegion mr(low, high); \
coleenp@3602 539 if_do_metadata_checked(closure, nv_suffix) { \
coleenp@3602 540 /* SSS: Do we need to pass down mr here? */ \
coleenp@3602 541 closure->do_klass##nv_suffix(a->klass()); \
duke@0 542 } \
coleenp@113 543 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \
coleenp@113 544 a, p, low, high, (closure)->do_oop##nv_suffix(p)) \
duke@0 545 } else { \
coleenp@113 546 HeapWord* low = start == 0 ? (HeapWord*)a : (HeapWord*)a->obj_at_addr<oop>(start); \
coleenp@113 547 HeapWord* high = (HeapWord*)((oop*)a->base() + end); \
coleenp@113 548 MemRegion mr(low, high); \
coleenp@3602 549 if_do_metadata_checked(closure, nv_suffix) { \
coleenp@3602 550 /* SSS: Do we need to pass down mr here? */ \
coleenp@3602 551 closure->do_klass##nv_suffix(a->klass()); \
duke@0 552 } \
coleenp@113 553 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop, \
coleenp@113 554 a, p, low, high, (closure)->do_oop##nv_suffix(p)) \
duke@0 555 } \
duke@0 556 return size; \
duke@0 557 }
duke@0 558
duke@0 559 ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN)
ysr@342 560 ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayKlass_OOP_OOP_ITERATE_DEFN)
duke@0 561 ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m)
ysr@342 562 ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m)
coleenp@113 563 ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_r)
ysr@342 564 ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_r)
duke@0 565
coleenp@3707 566 int ObjArrayKlass::oop_adjust_pointers(oop obj) {
duke@0 567 assert(obj->is_objArray(), "obj must be obj array");
duke@0 568 objArrayOop a = objArrayOop(obj);
duke@0 569 // Get size before changing pointers.
duke@0 570 // Don't call size() or oop_size() since that is a virtual call.
duke@0 571 int size = a->object_size();
coleenp@3602 572 MarkSweep::adjust_klass(a->klass());
coleenp@113 573 ObjArrayKlass_OOP_ITERATE(a, p, MarkSweep::adjust_pointer(p))
duke@0 574 return size;
duke@0 575 }
duke@0 576
jprovino@4107 577 #if INCLUDE_ALL_GCS
coleenp@3707 578 void ObjArrayKlass::oop_push_contents(PSPromotionManager* pm, oop obj) {
duke@0 579 assert(obj->is_objArray(), "obj must be obj array");
coleenp@113 580 ObjArrayKlass_OOP_ITERATE( \
coleenp@113 581 objArrayOop(obj), p, \
coleenp@113 582 if (PSScavenge::should_scavenge(p)) { \
coleenp@113 583 pm->claim_or_forward_depth(p); \
coleenp@113 584 })
duke@0 585 }
duke@0 586
coleenp@3707 587 int ObjArrayKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) {
duke@0 588 assert (obj->is_objArray(), "obj must be obj array");
duke@0 589 objArrayOop a = objArrayOop(obj);
coleenp@3602 590 int size = a->object_size();
coleenp@3602 591 a->update_header(cm);
coleenp@113 592 ObjArrayKlass_OOP_ITERATE(a, p, PSParallelCompact::adjust_pointer(p))
coleenp@3602 593 return size;
duke@0 594 }
jprovino@4107 595 #endif // INCLUDE_ALL_GCS
duke@0 596
duke@0 597 // JVM support
duke@0 598
coleenp@3707 599 jint ObjArrayKlass::compute_modifier_flags(TRAPS) const {
duke@0 600 // The modifier for an objectArray is the same as its element
duke@0 601 if (element_klass() == NULL) {
duke@0 602 assert(Universe::is_bootstrapping(), "partial objArray only at startup");
duke@0 603 return JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC;
duke@0 604 }
coleenp@398 605 // Return the flags of the bottom element type.
hseigel@3843 606 jint element_flags = bottom_klass()->compute_modifier_flags(CHECK_0);
duke@0 607
duke@0 608 return (element_flags & (JVM_ACC_PUBLIC | JVM_ACC_PRIVATE | JVM_ACC_PROTECTED))
duke@0 609 | (JVM_ACC_ABSTRACT | JVM_ACC_FINAL);
duke@0 610 }
duke@0 611
duke@0 612
coleenp@3602 613 // Printing
coleenp@3602 614
coleenp@3707 615 void ObjArrayKlass::print_on(outputStream* st) const {
duke@0 616 #ifndef PRODUCT
coleenp@3602 617 Klass::print_on(st);
coleenp@3602 618 st->print(" - instance klass: ");
coleenp@3602 619 element_klass()->print_value_on(st);
coleenp@3602 620 st->cr();
coleenp@3602 621 #endif //PRODUCT
coleenp@3602 622 }
coleenp@3602 623
coleenp@3707 624 void ObjArrayKlass::print_value_on(outputStream* st) const {
coleenp@3602 625 assert(is_klass(), "must be klass");
coleenp@3602 626
coleenp@3602 627 element_klass()->print_value_on(st);
coleenp@3602 628 st->print("[]");
coleenp@3602 629 }
coleenp@3602 630
coleenp@3602 631 #ifndef PRODUCT
duke@0 632
coleenp@3707 633 void ObjArrayKlass::oop_print_on(oop obj, outputStream* st) {
coleenp@3707 634 ArrayKlass::oop_print_on(obj, st);
duke@0 635 assert(obj->is_objArray(), "must be objArray");
duke@0 636 objArrayOop oa = objArrayOop(obj);
duke@0 637 int print_len = MIN2((intx) oa->length(), MaxElementPrintSize);
duke@0 638 for(int index = 0; index < print_len; index++) {
duke@0 639 st->print(" - %3d : ", index);
duke@0 640 oa->obj_at(index)->print_value_on(st);
duke@0 641 st->cr();
duke@0 642 }
duke@0 643 int remaining = oa->length() - print_len;
duke@0 644 if (remaining > 0) {
stefank@3691 645 st->print_cr(" - <%d more elements, increase MaxElementPrintSize to print>", remaining);
duke@0 646 }
duke@0 647 }
duke@0 648
jrose@1155 649 #endif //PRODUCT
jrose@1155 650
jrose@665 651 static int max_objArray_print_length = 4;
duke@0 652
coleenp@3707 653 void ObjArrayKlass::oop_print_value_on(oop obj, outputStream* st) {
duke@0 654 assert(obj->is_objArray(), "must be objArray");
jrose@665 655 st->print("a ");
duke@0 656 element_klass()->print_value_on(st);
jrose@665 657 int len = objArrayOop(obj)->length();
jrose@665 658 st->print("[%d] ", len);
jrose@665 659 obj->print_address_on(st);
jrose@1155 660 if (NOT_PRODUCT(PrintOopAddress ||) PrintMiscellaneous && (WizardMode || Verbose)) {
jrose@665 661 st->print("{");
jrose@665 662 for (int i = 0; i < len; i++) {
jrose@665 663 if (i > max_objArray_print_length) {
jrose@665 664 st->print("..."); break;
jrose@665 665 }
jrose@665 666 st->print(" "INTPTR_FORMAT, (intptr_t)(void*)objArrayOop(obj)->obj_at(i));
jrose@665 667 }
jrose@665 668 st->print(" }");
jrose@665 669 }
duke@0 670 }
duke@0 671
coleenp@3707 672 const char* ObjArrayKlass::internal_name() const {
duke@0 673 return external_name();
duke@0 674 }
duke@0 675
coleenp@3602 676
duke@0 677 // Verification
duke@0 678
coleenp@4872 679 void ObjArrayKlass::verify_on(outputStream* st, bool check_dictionary) {
coleenp@4872 680 ArrayKlass::verify_on(st, check_dictionary);
coleenp@3602 681 guarantee(element_klass()->is_klass(), "should be klass");
coleenp@3602 682 guarantee(bottom_klass()->is_klass(), "should be klass");
hseigel@3843 683 Klass* bk = bottom_klass();
coleenp@3602 684 guarantee(bk->oop_is_instance() || bk->oop_is_typeArray(), "invalid bottom klass");
coleenp@3602 685 }
coleenp@3602 686
coleenp@3707 687 void ObjArrayKlass::oop_verify_on(oop obj, outputStream* st) {
coleenp@3707 688 ArrayKlass::oop_verify_on(obj, st);
duke@0 689 guarantee(obj->is_objArray(), "must be objArray");
duke@0 690 objArrayOop oa = objArrayOop(obj);
duke@0 691 for(int index = 0; index < oa->length(); index++) {
duke@0 692 guarantee(oa->obj_at(index)->is_oop_or_null(), "should be oop");
duke@0 693 }
duke@0 694 }