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