< prev index next >

src/hotspot/share/oops/objArrayKlass.cpp

Print this page

 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 "classfile/moduleEntry.hpp"
 26 #include "classfile/packageEntry.hpp"
 27 #include "classfile/symbolTable.hpp"
 28 #include "classfile/vmClasses.hpp"
 29 #include "classfile/vmSymbols.hpp"
 30 #include "gc/shared/collectedHeap.inline.hpp"
 31 #include "memory/iterator.inline.hpp"
 32 #include "memory/metadataFactory.hpp"
 33 #include "memory/metaspaceClosure.hpp"

 34 #include "memory/resourceArea.hpp"
 35 #include "memory/universe.hpp"
 36 #include "oops/arrayKlass.hpp"
 37 #include "oops/instanceKlass.hpp"
 38 #include "oops/klass.inline.hpp"

 39 #include "oops/objArrayKlass.inline.hpp"
 40 #include "oops/objArrayOop.inline.hpp"
 41 #include "oops/oop.inline.hpp"
 42 #include "oops/symbol.hpp"
 43 #include "runtime/handles.inline.hpp"
 44 #include "runtime/mutexLocker.hpp"
 45 #include "utilities/macros.hpp"
 46 
 47 ObjArrayKlass* ObjArrayKlass::allocate(ClassLoaderData* loader_data, int n, Klass* k, Symbol* name, TRAPS) {


 48   assert(ObjArrayKlass::header_size() <= InstanceKlass::header_size(),
 49       "array klasses must be same size as InstanceKlass");
 50 
 51   int size = ArrayKlass::static_size(ObjArrayKlass::header_size());
 52 
 53   return new (loader_data, size, THREAD) ObjArrayKlass(n, k, name);
 54 }
 55 
 56 ObjArrayKlass* ObjArrayKlass::allocate_objArray_klass(ClassLoaderData* loader_data,
 57                                                       int n, Klass* element_klass, TRAPS) {


 58 
 59   // Eagerly allocate the direct array supertype.
 60   Klass* super_klass = nullptr;
 61   if (!Universe::is_bootstrapping() || vmClasses::Object_klass_loaded()) {
 62     assert(MultiArray_lock->holds_lock(THREAD), "must hold lock after bootstrapping");
 63     Klass* element_super = element_klass->super();
 64     if (element_super != nullptr) {
 65       // The element type has a direct super.  E.g., String[] has direct super of Object[].
 66       // Also, see if the element has secondary supertypes.
 67       // We need an array type for each before creating this array type.
 68       super_klass = element_super->array_klass(CHECK_NULL);




 69       const Array<Klass*>* element_supers = element_klass->secondary_supers();
 70       for (int i = element_supers->length() - 1; i >= 0; i--) {
 71         Klass* elem_super = element_supers->at(i);
 72         elem_super->array_klass(CHECK_NULL);
 73       }
 74       // Fall through because inheritance is acyclic and we hold the global recursive lock to allocate all the arrays.
 75     } else {
 76       // The element type is already Object.  Object[] has direct super of Object.
 77       super_klass = vmClasses::Object_klass();
 78     }
 79   }
 80 
 81   // Create type name for klass.
 82   Symbol* name = nullptr;
 83   {
 84     ResourceMark rm(THREAD);
 85     char *name_str = element_klass->name()->as_C_string();
 86     int len = element_klass->name()->utf8_length();
 87     char *new_str = NEW_RESOURCE_ARRAY(char, len + 4);
 88     int idx = 0;
 89     new_str[idx++] = JVM_SIGNATURE_ARRAY;
 90     if (element_klass->is_instance_klass()) { // it could be an array or simple type
 91       new_str[idx++] = JVM_SIGNATURE_CLASS;
 92     }
 93     memcpy(&new_str[idx], name_str, len * sizeof(char));
 94     idx += len;
 95     if (element_klass->is_instance_klass()) {
 96       new_str[idx++] = JVM_SIGNATURE_ENDCLASS;
 97     }
 98     new_str[idx++] = '\0';
 99     name = SymbolTable::new_symbol(new_str);
100   }
101 
102   // Initialize instance variables
103   ObjArrayKlass* oak = ObjArrayKlass::allocate(loader_data, n, element_klass, name, CHECK_NULL);
104 
105   ModuleEntry* module = oak->module();
106   assert(module != nullptr, "No module entry for array");
107 
108   // Call complete_create_array_klass after all instance variables has been initialized.
109   ArrayKlass::complete_create_array_klass(oak, super_klass, module, CHECK_NULL);
110 
111   // Add all classes to our internal class loader list here,
112   // including classes in the bootstrap (null) class loader.
113   // Do this step after creating the mirror so that if the
114   // mirror creation fails, loaded_classes_do() doesn't find
115   // an array class without a mirror.
116   loader_data->add_class(oak);
117 
118   return oak;
119 }
120 
121 ObjArrayKlass::ObjArrayKlass(int n, Klass* element_klass, Symbol* name) : ArrayKlass(name, Kind) {

122   set_dimension(n);
123   set_element_klass(element_klass);
124 
125   Klass* bk;
126   if (element_klass->is_objArray_klass()) {
127     bk = ObjArrayKlass::cast(element_klass)->bottom_klass();


128   } else {
129     bk = element_klass;
130   }
131   assert(bk != nullptr && (bk->is_instance_klass() || bk->is_typeArray_klass()), "invalid bottom klass");
132   set_bottom_klass(bk);
133   set_class_loader_data(bk->class_loader_data());
134 
135   if (element_klass->is_array_klass()) {
136     set_lower_dimension(ArrayKlass::cast(element_klass));
137   }
138 
139   set_layout_helper(array_layout_helper(T_OBJECT));








140   assert(is_array_klass(), "sanity");
141   assert(is_objArray_klass(), "sanity");
142 }
143 
144 size_t ObjArrayKlass::oop_size(oop obj) const {
145   // In this assert, we cannot safely access the Klass* with compact headers,
146   // because size_given_klass() calls oop_size() on objects that might be
147   // concurrently forwarded, which would overwrite the Klass*.
148   assert(UseCompactObjectHeaders || obj->is_objArray(), "must be object array");
149   return objArrayOop(obj)->object_size();
150 }
151 
152 objArrayOop ObjArrayKlass::allocate(int length, TRAPS) {
153   check_array_allocation_length(length, arrayOopDesc::max_array_length(T_OBJECT), CHECK_NULL);
154   size_t size = objArrayOopDesc::object_size(length);
155   return (objArrayOop)Universe::heap()->array_allocate(this, size, length,
156                                                        /* do_zero */ true, THREAD);


157 }
158 
159 oop ObjArrayKlass::multi_allocate(int rank, jint* sizes, TRAPS) {
160   int length = *sizes;
161   ArrayKlass* ld_klass = lower_dimension();
162   // If length < 0 allocate will throw an exception.
163   objArrayOop array = allocate(length, CHECK_NULL);
164   objArrayHandle h_array (THREAD, array);
165   if (rank > 1) {
166     if (length != 0) {
167       for (int index = 0; index < length; index++) {
168         oop sub_array = ld_klass->multi_allocate(rank - 1, &sizes[1], CHECK_NULL);
169         h_array->obj_at_put(index, sub_array);
170       }
171     } else {
172       // Since this array dimension has zero length, nothing will be
173       // allocated, however the lower dimension values must be checked
174       // for illegal values.
175       for (int i = 0; i < rank - 1; ++i) {
176         sizes += 1;
177         if (*sizes < 0) {
178           THROW_MSG_NULL(vmSymbols::java_lang_NegativeArraySizeException(), err_msg("%d", *sizes));
179         }
180       }
181     }
182   }
183   return h_array();
184 }
185 
186 // Either oop or narrowOop depending on UseCompressedOops.
187 void ObjArrayKlass::do_copy(arrayOop s, size_t src_offset,
188                             arrayOop d, size_t dst_offset, int length, TRAPS) {
189   if (s == d) {
190     // since source and destination are equal we do not need conversion checks.
191     assert(length > 0, "sanity check");
192     ArrayAccess<>::oop_arraycopy(s, src_offset, d, dst_offset, length);
193   } else {
194     // We have to make sure all elements conform to the destination array
195     Klass* bound = ObjArrayKlass::cast(d->klass())->element_klass();
196     Klass* stype = ObjArrayKlass::cast(s->klass())->element_klass();



197     if (stype == bound || stype->is_subtype_of(bound)) {
198       // elements are guaranteed to be subtypes, so no check necessary
199       ArrayAccess<ARRAYCOPY_DISJOINT>::oop_arraycopy(s, src_offset, d, dst_offset, length);



200     } else {
201       // slow case: need individual subtype checks
202       // note: don't use obj_at_put below because it includes a redundant store check
203       if (!ArrayAccess<ARRAYCOPY_DISJOINT | ARRAYCOPY_CHECKCAST>::oop_arraycopy(s, src_offset, d, dst_offset, length)) {
204         ResourceMark rm(THREAD);
205         stringStream ss;
206         if (!bound->is_subtype_of(stype)) {
207           ss.print("arraycopy: type mismatch: can not copy %s[] into %s[]",
208                    stype->external_name(), bound->external_name());
209         } else {
210           // oop_arraycopy should return the index in the source array that
211           // contains the problematic oop.
212           ss.print("arraycopy: element type mismatch: can not cast one of the elements"
213                    " of %s[] to the type of the destination array, %s",
214                    stype->external_name(), bound->external_name());
215         }
216         THROW_MSG(vmSymbols::java_lang_ArrayStoreException(), ss.as_string());
217       }
218     }
219   }
220 }
221 
222 void ObjArrayKlass::copy_array(arrayOop s, int src_pos, arrayOop d,
223                                int dst_pos, int length, TRAPS) {
224   assert(s->is_objArray(), "must be obj array");
225 







226   if (!d->is_objArray()) {
227     ResourceMark rm(THREAD);
228     stringStream ss;
229     if (d->is_typeArray()) {
230       ss.print("arraycopy: type mismatch: can not copy object array[] into %s[]",
231                type2name_tab[ArrayKlass::cast(d->klass())->element_type()]);
232     } else {
233       ss.print("arraycopy: destination type %s is not an array", d->klass()->external_name());
234     }
235     THROW_MSG(vmSymbols::java_lang_ArrayStoreException(), ss.as_string());
236   }
237 
238   // Check is all offsets and lengths are non negative
239   if (src_pos < 0 || dst_pos < 0 || length < 0) {
240     // Pass specific exception reason.
241     ResourceMark rm(THREAD);
242     stringStream ss;
243     if (src_pos < 0) {
244       ss.print("arraycopy: source index %d out of bounds for object array[%d]",
245                src_pos, s->length());

327   }
328 }
329 
330 void ObjArrayKlass::initialize(TRAPS) {
331   bottom_klass()->initialize(THREAD);  // dispatches to either InstanceKlass or TypeArrayKlass
332 }
333 
334 void ObjArrayKlass::metaspace_pointers_do(MetaspaceClosure* it) {
335   ArrayKlass::metaspace_pointers_do(it);
336   it->push(&_element_klass);
337   it->push(&_bottom_klass);
338 }
339 
340 u2 ObjArrayKlass::compute_modifier_flags() const {
341   // The modifier for an objectArray is the same as its element
342   assert (element_klass() != nullptr, "should be initialized");
343 
344   // Return the flags of the bottom element type.
345   u2 element_flags = bottom_klass()->compute_modifier_flags();
346 


347   return (element_flags & (JVM_ACC_PUBLIC | JVM_ACC_PRIVATE | JVM_ACC_PROTECTED))
348                         | (JVM_ACC_ABSTRACT | JVM_ACC_FINAL);
349 }
350 
351 ModuleEntry* ObjArrayKlass::module() const {
352   assert(bottom_klass() != nullptr, "ObjArrayKlass returned unexpected null bottom_klass");
353   // The array is defined in the module of its bottom class
354   return bottom_klass()->module();
355 }
356 
357 PackageEntry* ObjArrayKlass::package() const {
358   assert(bottom_klass() != nullptr, "ObjArrayKlass returned unexpected null bottom_klass");
359   return bottom_klass()->package();
360 }
361 
362 // Printing
363 
364 void ObjArrayKlass::print_on(outputStream* st) const {
365 #ifndef PRODUCT
366   Klass::print_on(st);
367   st->print(" - instance klass: ");
368   element_klass()->print_value_on(st);
369   st->cr();
370 #endif //PRODUCT
371 }
372 
373 void ObjArrayKlass::print_value_on(outputStream* st) const {
374   assert(is_klass(), "must be klass");
375 
376   element_klass()->print_value_on(st);
377   st->print("[]");
378 }
379 
380 #ifndef PRODUCT
381 
382 void ObjArrayKlass::oop_print_on(oop obj, outputStream* st) {
383   ArrayKlass::oop_print_on(obj, st);
384   assert(obj->is_objArray(), "must be objArray");
385   objArrayOop oa = objArrayOop(obj);
386   int print_len = MIN2(oa->length(), MaxElementPrintSize);
387   for(int index = 0; index < print_len; index++) {

409   st->print("[%d] ", len);
410   if (obj != nullptr) {
411     obj->print_address_on(st);
412   } else {
413     st->print_cr("null");
414   }
415 }
416 
417 const char* ObjArrayKlass::internal_name() const {
418   return external_name();
419 }
420 
421 
422 // Verification
423 
424 void ObjArrayKlass::verify_on(outputStream* st) {
425   ArrayKlass::verify_on(st);
426   guarantee(element_klass()->is_klass(), "should be klass");
427   guarantee(bottom_klass()->is_klass(), "should be klass");
428   Klass* bk = bottom_klass();
429   guarantee(bk->is_instance_klass() || bk->is_typeArray_klass(),  "invalid bottom klass");

430 }
431 
432 void ObjArrayKlass::oop_verify_on(oop obj, outputStream* st) {
433   ArrayKlass::oop_verify_on(obj, st);
434   guarantee(obj->is_objArray(), "must be objArray");

435   objArrayOop oa = objArrayOop(obj);
436   for(int index = 0; index < oa->length(); index++) {
437     guarantee(oopDesc::is_oop_or_null(oa->obj_at(index)), "should be oop");
438   }
439 }

 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 "classfile/moduleEntry.hpp"
 26 #include "classfile/packageEntry.hpp"
 27 #include "classfile/symbolTable.hpp"
 28 #include "classfile/vmClasses.hpp"
 29 #include "classfile/vmSymbols.hpp"
 30 #include "gc/shared/collectedHeap.inline.hpp"
 31 #include "memory/iterator.inline.hpp"
 32 #include "memory/metadataFactory.hpp"
 33 #include "memory/metaspaceClosure.hpp"
 34 #include "memory/oopFactory.hpp"
 35 #include "memory/resourceArea.hpp"
 36 #include "memory/universe.hpp"
 37 #include "oops/arrayKlass.hpp"
 38 #include "oops/instanceKlass.hpp"
 39 #include "oops/klass.inline.hpp"
 40 #include "oops/markWord.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,
 50                                        Klass* k, Symbol* name, bool null_free,
 51                                        TRAPS) {
 52   assert(ObjArrayKlass::header_size() <= InstanceKlass::header_size(),
 53       "array klasses must be same size as InstanceKlass");
 54 
 55   int size = ArrayKlass::static_size(ObjArrayKlass::header_size());
 56 
 57   return new (loader_data, size, THREAD) ObjArrayKlass(n, k, name, null_free);
 58 }
 59 
 60 ObjArrayKlass* ObjArrayKlass::allocate_objArray_klass(ClassLoaderData* loader_data,
 61                                                       int n, Klass* element_klass,
 62                                                       bool null_free, TRAPS) {
 63   assert(!null_free || (n == 1 && element_klass->is_inline_klass()), "null-free unsupported");
 64 
 65   // Eagerly allocate the direct array supertype.
 66   Klass* super_klass = nullptr;
 67   if (!Universe::is_bootstrapping() || vmClasses::Object_klass_loaded()) {
 68     assert(MultiArray_lock->holds_lock(THREAD), "must hold lock after bootstrapping");
 69     Klass* element_super = element_klass->super();
 70     if (element_super != nullptr) {
 71       // The element type has a direct super.  E.g., String[] has direct super of Object[].
 72       // Also, see if the element has secondary supertypes.
 73       // We need an array type for each before creating this array type.
 74       if (null_free) {
 75         super_klass = element_klass->array_klass(CHECK_NULL);
 76       } else {
 77         super_klass = element_super->array_klass(CHECK_NULL);
 78       }
 79       const Array<Klass*>* element_supers = element_klass->secondary_supers();
 80       for (int i = element_supers->length() - 1; i >= 0; i--) {
 81         Klass* elem_super = element_supers->at(i);
 82         elem_super->array_klass(CHECK_NULL);
 83       }
 84       // Fall through because inheritance is acyclic and we hold the global recursive lock to allocate all the arrays.
 85     } else {
 86       // The element type is already Object.  Object[] has direct super of Object.
 87       super_klass = vmClasses::Object_klass();
 88     }
 89   }
 90 
 91   // Create type name for klass.
 92   Symbol* name = ArrayKlass::create_element_klass_array_name(element_klass, CHECK_NULL);


















 93 
 94   // Initialize instance variables
 95   ObjArrayKlass* oak = ObjArrayKlass::allocate(loader_data, n, element_klass, name, null_free, CHECK_NULL);
 96 
 97   ModuleEntry* module = oak->module();
 98   assert(module != nullptr, "No module entry for array");
 99 
100   // Call complete_create_array_klass after all instance variables has been initialized.
101   ArrayKlass::complete_create_array_klass(oak, super_klass, module, CHECK_NULL);
102 
103   // Add all classes to our internal class loader list here,
104   // including classes in the bootstrap (null) class loader.
105   // Do this step after creating the mirror so that if the
106   // mirror creation fails, loaded_classes_do() doesn't find
107   // an array class without a mirror.
108   loader_data->add_class(oak);
109 
110   return oak;
111 }
112 
113 ObjArrayKlass::ObjArrayKlass(int n, Klass* element_klass, Symbol* name, bool null_free) :
114 ArrayKlass(name, Kind, null_free ? markWord::null_free_array_prototype() : markWord::prototype()) {
115   set_dimension(n);
116   set_element_klass(element_klass);
117 
118   Klass* bk;
119   if (element_klass->is_objArray_klass()) {
120     bk = ObjArrayKlass::cast(element_klass)->bottom_klass();
121   } else if (element_klass->is_flatArray_klass()) {
122     bk = FlatArrayKlass::cast(element_klass)->element_klass();
123   } else {
124     bk = element_klass;
125   }
126   assert(bk != nullptr && (bk->is_instance_klass() || bk->is_typeArray_klass()), "invalid bottom klass");
127   set_bottom_klass(bk);
128   set_class_loader_data(bk->class_loader_data());
129 
130   if (element_klass->is_array_klass()) {
131     set_lower_dimension(ArrayKlass::cast(element_klass));
132   }
133 
134   int lh = array_layout_helper(T_OBJECT);
135   if (null_free) {
136     assert(n == 1, "Bytecode does not support null-free multi-dim");
137     lh = layout_helper_set_null_free(lh);
138 #ifdef _LP64
139     assert(prototype_header().is_null_free_array(), "sanity");
140 #endif
141   }
142   set_layout_helper(lh);
143   assert(is_array_klass(), "sanity");
144   assert(is_objArray_klass(), "sanity");
145 }
146 
147 size_t ObjArrayKlass::oop_size(oop obj) const {
148   // In this assert, we cannot safely access the Klass* with compact headers,
149   // because size_given_klass() calls oop_size() on objects that might be
150   // concurrently forwarded, which would overwrite the Klass*.
151   assert(UseCompactObjectHeaders || obj->is_objArray(), "must be object array");
152   return objArrayOop(obj)->object_size();
153 }
154 
155 objArrayOop ObjArrayKlass::allocate(int length, TRAPS) {
156   check_array_allocation_length(length, arrayOopDesc::max_array_length(T_OBJECT), CHECK_NULL);
157   size_t size = objArrayOopDesc::object_size(length);
158   objArrayOop array =  (objArrayOop)Universe::heap()->array_allocate(this, size, length,
159                                                        /* do_zero */ true, CHECK_NULL);
160   objArrayHandle array_h(THREAD, array);
161   return array_h();
162 }
163 
164 oop ObjArrayKlass::multi_allocate(int rank, jint* sizes, TRAPS) {
165   int length = *sizes;
166   ArrayKlass* ld_klass = lower_dimension();
167   // If length < 0 allocate will throw an exception.
168   objArrayOop array = allocate(length, CHECK_NULL);
169   objArrayHandle h_array (THREAD, array);
170   if (rank > 1) {
171     if (length != 0) {
172       for (int index = 0; index < length; index++) {
173         oop sub_array = ld_klass->multi_allocate(rank-1, &sizes[1], CHECK_NULL);
174         h_array->obj_at_put(index, sub_array);
175       }
176     } else {
177       // Since this array dimension has zero length, nothing will be
178       // allocated, however the lower dimension values must be checked
179       // for illegal values.
180       for (int i = 0; i < rank - 1; ++i) {
181         sizes += 1;
182         if (*sizes < 0) {
183           THROW_MSG_NULL(vmSymbols::java_lang_NegativeArraySizeException(), err_msg("%d", *sizes));
184         }
185       }
186     }
187   }
188   return h_array();
189 }
190 
191 // Either oop or narrowOop depending on UseCompressedOops.
192 void ObjArrayKlass::do_copy(arrayOop s, size_t src_offset,
193                             arrayOop d, size_t dst_offset, int length, TRAPS) {
194   if (s == d) {
195     // since source and destination are equal we do not need conversion checks.
196     assert(length > 0, "sanity check");
197     ArrayAccess<>::oop_arraycopy(s, src_offset, d, dst_offset, length);
198   } else {
199     // We have to make sure all elements conform to the destination array
200     Klass* bound = ObjArrayKlass::cast(d->klass())->element_klass();
201     Klass* stype = ObjArrayKlass::cast(s->klass())->element_klass();
202     // Perform null check if dst is null-free but src has no such guarantee
203     bool null_check = ((!s->klass()->is_null_free_array_klass()) &&
204         d->klass()->is_null_free_array_klass());
205     if (stype == bound || stype->is_subtype_of(bound)) {
206       if (null_check) {
207         ArrayAccess<ARRAYCOPY_DISJOINT | ARRAYCOPY_NOTNULL>::oop_arraycopy(s, src_offset, d, dst_offset, length);
208       } else {
209         ArrayAccess<ARRAYCOPY_DISJOINT>::oop_arraycopy(s, src_offset, d, dst_offset, length);
210       }
211     } else {
212       if (null_check) {
213         ArrayAccess<ARRAYCOPY_DISJOINT | ARRAYCOPY_CHECKCAST | ARRAYCOPY_NOTNULL>::oop_arraycopy(s, src_offset, d, dst_offset, length);
214       } else {
215         ArrayAccess<ARRAYCOPY_DISJOINT | ARRAYCOPY_CHECKCAST>::oop_arraycopy(s, src_offset, d, dst_offset, length);












216       }
217     }
218   }
219 }
220 
221 void ObjArrayKlass::copy_array(arrayOop s, int src_pos, arrayOop d,
222                                int dst_pos, int length, TRAPS) {
223   assert(s->is_objArray(), "must be obj array");
224 
225   if (UseArrayFlattening) {
226     if (d->is_flatArray()) {
227       FlatArrayKlass::cast(d->klass())->copy_array(s, src_pos, d, dst_pos, length, THREAD);
228       return;
229     }
230   }
231 
232   if (!d->is_objArray()) {
233     ResourceMark rm(THREAD);
234     stringStream ss;
235     if (d->is_typeArray()) {
236       ss.print("arraycopy: type mismatch: can not copy object array[] into %s[]",
237                type2name_tab[ArrayKlass::cast(d->klass())->element_type()]);
238     } else {
239       ss.print("arraycopy: destination type %s is not an array", d->klass()->external_name());
240     }
241     THROW_MSG(vmSymbols::java_lang_ArrayStoreException(), ss.as_string());
242   }
243 
244   // Check is all offsets and lengths are non negative
245   if (src_pos < 0 || dst_pos < 0 || length < 0) {
246     // Pass specific exception reason.
247     ResourceMark rm(THREAD);
248     stringStream ss;
249     if (src_pos < 0) {
250       ss.print("arraycopy: source index %d out of bounds for object array[%d]",
251                src_pos, s->length());

333   }
334 }
335 
336 void ObjArrayKlass::initialize(TRAPS) {
337   bottom_klass()->initialize(THREAD);  // dispatches to either InstanceKlass or TypeArrayKlass
338 }
339 
340 void ObjArrayKlass::metaspace_pointers_do(MetaspaceClosure* it) {
341   ArrayKlass::metaspace_pointers_do(it);
342   it->push(&_element_klass);
343   it->push(&_bottom_klass);
344 }
345 
346 u2 ObjArrayKlass::compute_modifier_flags() const {
347   // The modifier for an objectArray is the same as its element
348   assert (element_klass() != nullptr, "should be initialized");
349 
350   // Return the flags of the bottom element type.
351   u2 element_flags = bottom_klass()->compute_modifier_flags();
352 
353   int identity_flag = (Arguments::enable_preview()) ? JVM_ACC_IDENTITY : 0;
354 
355   return (element_flags & (JVM_ACC_PUBLIC | JVM_ACC_PRIVATE | JVM_ACC_PROTECTED))
356                         | (identity_flag | JVM_ACC_ABSTRACT | JVM_ACC_FINAL);
357 }
358 
359 ModuleEntry* ObjArrayKlass::module() const {
360   assert(bottom_klass() != nullptr, "ObjArrayKlass returned unexpected null bottom_klass");
361   // The array is defined in the module of its bottom class
362   return bottom_klass()->module();
363 }
364 
365 PackageEntry* ObjArrayKlass::package() const {
366   assert(bottom_klass() != nullptr, "ObjArrayKlass returned unexpected null bottom_klass");
367   return bottom_klass()->package();
368 }
369 
370 // Printing
371 
372 void ObjArrayKlass::print_on(outputStream* st) const {
373 #ifndef PRODUCT
374   Klass::print_on(st);
375   st->print(" - element klass: ");
376   element_klass()->print_value_on(st);
377   st->cr();
378 #endif //PRODUCT
379 }
380 
381 void ObjArrayKlass::print_value_on(outputStream* st) const {
382   assert(is_klass(), "must be klass");
383 
384   element_klass()->print_value_on(st);
385   st->print("[]");
386 }
387 
388 #ifndef PRODUCT
389 
390 void ObjArrayKlass::oop_print_on(oop obj, outputStream* st) {
391   ArrayKlass::oop_print_on(obj, st);
392   assert(obj->is_objArray(), "must be objArray");
393   objArrayOop oa = objArrayOop(obj);
394   int print_len = MIN2(oa->length(), MaxElementPrintSize);
395   for(int index = 0; index < print_len; index++) {

417   st->print("[%d] ", len);
418   if (obj != nullptr) {
419     obj->print_address_on(st);
420   } else {
421     st->print_cr("null");
422   }
423 }
424 
425 const char* ObjArrayKlass::internal_name() const {
426   return external_name();
427 }
428 
429 
430 // Verification
431 
432 void ObjArrayKlass::verify_on(outputStream* st) {
433   ArrayKlass::verify_on(st);
434   guarantee(element_klass()->is_klass(), "should be klass");
435   guarantee(bottom_klass()->is_klass(), "should be klass");
436   Klass* bk = bottom_klass();
437   guarantee(bk->is_instance_klass() || bk->is_typeArray_klass() || bk->is_flatArray_klass(),
438             "invalid bottom klass");
439 }
440 
441 void ObjArrayKlass::oop_verify_on(oop obj, outputStream* st) {
442   ArrayKlass::oop_verify_on(obj, st);
443   guarantee(obj->is_objArray(), "must be objArray");
444   guarantee(obj->is_null_free_array() || (!is_null_free_array_klass()), "null-free klass but not object");
445   objArrayOop oa = objArrayOop(obj);
446   for(int index = 0; index < oa->length(); index++) {
447     guarantee(oopDesc::is_oop_or_null(oa->obj_at(index)), "should be oop");
448   }
449 }
< prev index next >