< prev index next >

src/hotspot/share/oops/objArrayKlass.cpp

Print this page

 15  * You should have received a copy of the GNU General Public License version
 16  * 2 along with this work; if not, write to the Free Software Foundation,
 17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 18  *
 19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 20  * or visit www.oracle.com if you need additional information or have any
 21  * questions.
 22  *
 23  */
 24 
 25 #include "precompiled.hpp"
 26 #include "classfile/moduleEntry.hpp"
 27 #include "classfile/packageEntry.hpp"
 28 #include "classfile/symbolTable.hpp"
 29 #include "classfile/vmClasses.hpp"
 30 #include "classfile/vmSymbols.hpp"
 31 #include "gc/shared/collectedHeap.inline.hpp"
 32 #include "memory/iterator.inline.hpp"
 33 #include "memory/metadataFactory.hpp"
 34 #include "memory/metaspaceClosure.hpp"

 35 #include "memory/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/objArrayKlass.inline.hpp"
 41 #include "oops/objArrayOop.inline.hpp"
 42 #include "oops/oop.inline.hpp"
 43 #include "oops/symbol.hpp"
 44 #include "runtime/handles.inline.hpp"
 45 #include "runtime/mutexLocker.hpp"
 46 #include "utilities/macros.hpp"
 47 
 48 ObjArrayKlass* ObjArrayKlass::allocate(ClassLoaderData* loader_data, int n, Klass* k, Symbol* name, TRAPS) {


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


 59 
 60   // Eagerly allocate the direct array supertype.
 61   Klass* super_klass = nullptr;
 62   if (!Universe::is_bootstrapping() || vmClasses::Object_klass_loaded()) {
 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       super_klass = element_super->array_klass_or_null();




 67       bool supers_exist = super_klass != nullptr;
 68       // Also, see if the element has secondary supertypes.
 69       // We need an array type for each.
 70       const Array<Klass*>* element_supers = element_klass->secondary_supers();
 71       for( int i = element_supers->length()-1; i >= 0; i-- ) {
 72         Klass* elem_super = element_supers->at(i);
 73         if (elem_super->array_klass_or_null() == nullptr) {
 74           supers_exist = false;
 75           break;
 76         }
 77       }





 78       if (!supers_exist) {
 79         // Oops.  Not allocated yet.  Back out, allocate it, and retry.
 80         Klass* ek = nullptr;
 81         {
 82           MutexUnlocker mu(MultiArray_lock);
 83           super_klass = element_super->array_klass(CHECK_NULL);




 84           for( int i = element_supers->length()-1; i >= 0; i-- ) {
 85             Klass* elem_super = element_supers->at(i);
 86             elem_super->array_klass(CHECK_NULL);
 87           }
 88           // Now retry from the beginning
 89           ek = element_klass->array_klass(n, CHECK_NULL);




 90         }  // re-lock
 91         return ObjArrayKlass::cast(ek);
 92       }
 93     } else {
 94       // The element type is already Object.  Object[] has direct super of Object.
 95       super_klass = vmClasses::Object_klass();
 96     }
 97   }
 98 
 99   // Create type name for klass.
100   Symbol* name = nullptr;
101   {
102     ResourceMark rm(THREAD);
103     char *name_str = element_klass->name()->as_C_string();
104     int len = element_klass->name()->utf8_length();
105     char *new_str = NEW_RESOURCE_ARRAY(char, len + 4);
106     int idx = 0;
107     new_str[idx++] = JVM_SIGNATURE_ARRAY;
108     if (element_klass->is_instance_klass()) { // it could be an array or simple type
109       new_str[idx++] = JVM_SIGNATURE_CLASS;
110     }
111     memcpy(&new_str[idx], name_str, len * sizeof(char));
112     idx += len;
113     if (element_klass->is_instance_klass()) {
114       new_str[idx++] = JVM_SIGNATURE_ENDCLASS;
115     }
116     new_str[idx++] = '\0';
117     name = SymbolTable::new_symbol(new_str);
118   }
119 
120   // Initialize instance variables
121   ObjArrayKlass* oak = ObjArrayKlass::allocate(loader_data, n, element_klass, name, CHECK_NULL);
122 
123   ModuleEntry* module = oak->module();
124   assert(module != nullptr, "No module entry for array");
125 
126   // Call complete_create_array_klass after all instance variables has been initialized.
127   ArrayKlass::complete_create_array_klass(oak, super_klass, module, CHECK_NULL);
128 
129   // Add all classes to our internal class loader list here,
130   // including classes in the bootstrap (null) class loader.
131   // Do this step after creating the mirror so that if the
132   // mirror creation fails, loaded_classes_do() doesn't find
133   // an array class without a mirror.
134   loader_data->add_class(oak);
135 
136   return oak;
137 }
138 
139 ObjArrayKlass::ObjArrayKlass(int n, Klass* element_klass, Symbol* name) : ArrayKlass(name, Kind) {
140   set_dimension(n);
141   set_element_klass(element_klass);
142 


143   Klass* bk;
144   if (element_klass->is_objArray_klass()) {
145     bk = ObjArrayKlass::cast(element_klass)->bottom_klass();


146   } else {
147     bk = element_klass;
148   }
149   assert(bk != nullptr && (bk->is_instance_klass() || bk->is_typeArray_klass()), "invalid bottom klass");
150   set_bottom_klass(bk);
151   set_class_loader_data(bk->class_loader_data());
152 
153   set_layout_helper(array_layout_helper(T_OBJECT));











154   assert(is_array_klass(), "sanity");
155   assert(is_objArray_klass(), "sanity");
156 }
157 
158 size_t ObjArrayKlass::oop_size(oop obj) const {
159   assert(obj->is_objArray(), "must be object array");
160   return objArrayOop(obj)->object_size();
161 }
162 
163 objArrayOop ObjArrayKlass::allocate(int length, TRAPS) {
164   check_array_allocation_length(length, arrayOopDesc::max_array_length(T_OBJECT), CHECK_NULL);
165   size_t size = objArrayOopDesc::object_size(length);
166   return (objArrayOop)Universe::heap()->array_allocate(this, size, length,
167                                                        /* do_zero */ true, THREAD);















168 }
169 
170 oop ObjArrayKlass::multi_allocate(int rank, jint* sizes, TRAPS) {
171   int length = *sizes;










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



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



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







237   if (!d->is_objArray()) {
238     ResourceMark rm(THREAD);
239     stringStream ss;
240     if (d->is_typeArray()) {
241       ss.print("arraycopy: type mismatch: can not copy object array[] into %s[]",
242                type2name_tab[ArrayKlass::cast(d->klass())->element_type()]);
243     } else {
244       ss.print("arraycopy: destination type %s is not an array", d->klass()->external_name());
245     }
246     THROW_MSG(vmSymbols::java_lang_ArrayStoreException(), ss.as_string());
247   }
248 
249   // Check is all offsets and lengths are non negative
250   if (src_pos < 0 || dst_pos < 0 || length < 0) {
251     // Pass specific exception reason.
252     ResourceMark rm(THREAD);
253     stringStream ss;
254     if (src_pos < 0) {
255       ss.print("arraycopy: source index %d out of bounds for object array[%d]",
256                src_pos, s->length());

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

421   st->print("[%d] ", len);
422   if (obj != nullptr) {
423     obj->print_address_on(st);
424   } else {
425     st->print_cr("null");
426   }
427 }
428 
429 const char* ObjArrayKlass::internal_name() const {
430   return external_name();
431 }
432 
433 
434 // Verification
435 
436 void ObjArrayKlass::verify_on(outputStream* st) {
437   ArrayKlass::verify_on(st);
438   guarantee(element_klass()->is_klass(), "should be klass");
439   guarantee(bottom_klass()->is_klass(), "should be klass");
440   Klass* bk = bottom_klass();
441   guarantee(bk->is_instance_klass() || bk->is_typeArray_klass(),  "invalid bottom klass");

442 }
443 
444 void ObjArrayKlass::oop_verify_on(oop obj, outputStream* st) {
445   ArrayKlass::oop_verify_on(obj, st);
446   guarantee(obj->is_objArray(), "must be objArray");

447   objArrayOop oa = objArrayOop(obj);
448   for(int index = 0; index < oa->length(); index++) {
449     guarantee(oopDesc::is_oop_or_null(oa->obj_at(index)), "should be oop");
450   }
451 }

 15  * You should have received a copy of the GNU General Public License version
 16  * 2 along with this work; if not, write to the Free Software Foundation,
 17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 18  *
 19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 20  * or visit www.oracle.com if you need additional information or have any
 21  * questions.
 22  *
 23  */
 24 
 25 #include "precompiled.hpp"
 26 #include "classfile/moduleEntry.hpp"
 27 #include "classfile/packageEntry.hpp"
 28 #include "classfile/symbolTable.hpp"
 29 #include "classfile/vmClasses.hpp"
 30 #include "classfile/vmSymbols.hpp"
 31 #include "gc/shared/collectedHeap.inline.hpp"
 32 #include "memory/iterator.inline.hpp"
 33 #include "memory/metadataFactory.hpp"
 34 #include "memory/metaspaceClosure.hpp"
 35 #include "memory/oopFactory.hpp"
 36 #include "memory/resourceArea.hpp"
 37 #include "memory/universe.hpp"
 38 #include "oops/arrayKlass.hpp"
 39 #include "oops/instanceKlass.hpp"
 40 #include "oops/klass.inline.hpp"
 41 #include "oops/objArrayKlass.inline.hpp"
 42 #include "oops/objArrayOop.inline.hpp"
 43 #include "oops/oop.inline.hpp"
 44 #include "oops/symbol.hpp"
 45 #include "runtime/handles.inline.hpp"
 46 #include "runtime/mutexLocker.hpp"
 47 #include "utilities/macros.hpp"
 48 
 49 ObjArrayKlass* ObjArrayKlass::allocate(ClassLoaderData* loader_data, int n,
 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, bool qdesc, TRAPS) {
 63   assert(!null_free || (n == 1 && element_klass->is_inline_klass() && qdesc), "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     Klass* element_super = element_klass->super();
 69     if (element_super != nullptr) {
 70       // The element type has a direct super.  E.g., String[] has direct super of Object[].
 71       if (null_free) {
 72         super_klass = element_klass->array_klass_or_null();
 73       } else {
 74         super_klass = element_super->array_klass_or_null();
 75       }
 76       bool supers_exist = super_klass != nullptr;
 77       // Also, see if the element has secondary supertypes.
 78       // We need an array type for each.
 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         if (elem_super->array_klass_or_null() == nullptr) {
 83           supers_exist = false;
 84           break;
 85         }
 86       }
 87       if (null_free) {
 88         if (element_klass->array_klass_or_null() == nullptr) {
 89           supers_exist = false;
 90         }
 91       }
 92       if (!supers_exist) {
 93         // Oops.  Not allocated yet.  Back out, allocate it, and retry.
 94         Klass* ek = nullptr;
 95         {
 96           MutexUnlocker mu(MultiArray_lock);
 97           if (null_free) {
 98             element_klass->array_klass(CHECK_NULL);
 99           } else {
100             element_super->array_klass(CHECK_NULL);
101           }
102           for( int i = element_supers->length()-1; i >= 0; i-- ) {
103             Klass* elem_super = element_supers->at(i);
104             elem_super->array_klass(CHECK_NULL);
105           }
106           // Now retry from the beginning
107           if (null_free) {
108             ek = InlineKlass::cast(element_klass)->value_array_klass(CHECK_NULL);
109           } else {
110             ek = element_klass->array_klass(n, CHECK_NULL);
111           }
112         }  // re-lock
113         return ObjArrayKlass::cast(ek);
114       }
115     } else {
116       // The element type is already Object.  Object[] has direct super of Object.
117       super_klass = vmClasses::Object_klass();
118     }
119   }
120 
121   // Create type name for klass.
122   Symbol* name = ArrayKlass::create_element_klass_array_name(element_klass, qdesc, CHECK_NULL);


















123 
124   // Initialize instance variables
125   ObjArrayKlass* oak = ObjArrayKlass::allocate(loader_data, n, element_klass, name, null_free, CHECK_NULL);
126 
127   ModuleEntry* module = oak->module();
128   assert(module != nullptr, "No module entry for array");
129 
130   // Call complete_create_array_klass after all instance variables has been initialized.
131   ArrayKlass::complete_create_array_klass(oak, super_klass, module, CHECK_NULL);
132 
133   // Add all classes to our internal class loader list here,
134   // including classes in the bootstrap (null) class loader.
135   // Do this step after creating the mirror so that if the
136   // mirror creation fails, loaded_classes_do() doesn't find
137   // an array class without a mirror.
138   loader_data->add_class(oak);
139 
140   return oak;
141 }
142 
143 ObjArrayKlass::ObjArrayKlass(int n, Klass* element_klass, Symbol* name, bool null_free) : ArrayKlass(name, Kind) {
144   set_dimension(n);
145   set_element_klass(element_klass);
146 
147   assert(!null_free || name->is_Q_array_signature(), "sanity check");
148 
149   Klass* bk;
150   if (element_klass->is_objArray_klass()) {
151     bk = ObjArrayKlass::cast(element_klass)->bottom_klass();
152   } else if (element_klass->is_flatArray_klass()) {
153     bk = FlatArrayKlass::cast(element_klass)->element_klass();
154   } else {
155     bk = element_klass;
156   }
157   assert(bk != nullptr && (bk->is_instance_klass() || bk->is_typeArray_klass()), "invalid bottom klass");
158   set_bottom_klass(bk);
159   set_class_loader_data(bk->class_loader_data());
160 
161   int lh = array_layout_helper(T_OBJECT);
162   if (null_free) {
163     assert(n == 1, "Bytecode does not support null-free multi-dim");
164     lh = layout_helper_set_null_free(lh);
165 #ifdef _LP64
166     set_prototype_header(markWord::null_free_array_prototype());
167     assert(prototype_header().is_null_free_array(), "sanity");
168 #else
169     set_prototype_header(markWord::inline_type_prototype());
170 #endif
171   }
172   set_layout_helper(lh);
173   assert(is_array_klass(), "sanity");
174   assert(is_objArray_klass(), "sanity");
175 }
176 
177 size_t ObjArrayKlass::oop_size(oop obj) const {
178   assert(obj->is_objArray(), "must be object array");
179   return objArrayOop(obj)->object_size();
180 }
181 
182 objArrayOop ObjArrayKlass::allocate(int length, TRAPS) {
183   check_array_allocation_length(length, arrayOopDesc::max_array_length(T_OBJECT), CHECK_NULL);
184   size_t size = objArrayOopDesc::object_size(length);
185   bool populate_null_free = is_null_free_array_klass();
186   objArrayOop array =  (objArrayOop)Universe::heap()->array_allocate(this, size, length,
187                                                        /* do_zero */ true, CHECK_NULL);
188   objArrayHandle array_h(THREAD, array);
189   if (populate_null_free) {
190     assert(dimension() == 1, "Can only populate the final dimension");
191     assert(element_klass()->is_inline_klass(), "Unexpected");
192     assert(!element_klass()->is_array_klass(), "ArrayKlass unexpected here");
193     assert(!InlineKlass::cast(element_klass())->flat_array(), "Expected flatArrayOop allocation");
194     element_klass()->initialize(CHECK_NULL);
195     // Populate default values...
196     instanceOop value = (instanceOop) InlineKlass::cast(element_klass())->default_value();
197     for (int i = 0; i < length; i++) {
198       array_h->obj_at_put(i, value);
199     }
200   }
201   return array_h();
202 }
203 
204 oop ObjArrayKlass::multi_allocate(int rank, jint* sizes, TRAPS) {
205   int length = *sizes;
206   if (rank == 1) { // last dim may be flatArray, check if we have any special storage requirements
207     if (name()->char_at(1) != JVM_SIGNATURE_ARRAY &&  name()->is_Q_array_signature()) {
208       return oopFactory::new_valueArray(element_klass(), length, CHECK_NULL);
209     } else {
210       return oopFactory::new_objArray(element_klass(), length, CHECK_NULL);
211     }
212   }
213   guarantee(rank > 1, "Rank below 1");
214   // Call to lower_dimension uses this pointer, so most be called before a
215   // possible GC
216   ArrayKlass* ld_klass = lower_dimension();
217   // If length < 0 allocate will throw an exception.
218   objArrayOop array = allocate(length, CHECK_NULL);
219   objArrayHandle h_array (THREAD, array);
220   if (length != 0) {
221     for (int index = 0; index < length; index++) {
222       oop sub_array = ld_klass->multi_allocate(rank-1, &sizes[1], CHECK_NULL);
223       h_array->obj_at_put(index, sub_array);
224     }
225   } else {
226     // Since this array dimension has zero length, nothing will be
227     // allocated, however the lower dimension values must be checked
228     // for illegal values.
229     for (int i = 0; i < rank - 1; ++i) {
230       sizes += 1;
231       if (*sizes < 0) {
232         THROW_MSG_0(vmSymbols::java_lang_NegativeArraySizeException(), err_msg("%d", *sizes));


233       }
234     }
235   }
236   return h_array();
237 }
238 
239 // Either oop or narrowOop depending on UseCompressedOops.
240 void ObjArrayKlass::do_copy(arrayOop s, size_t src_offset,
241                             arrayOop d, size_t dst_offset, int length, TRAPS) {
242   if (s == d) {
243     // since source and destination are equal we do not need conversion checks.
244     assert(length > 0, "sanity check");
245     ArrayAccess<>::oop_arraycopy(s, src_offset, d, dst_offset, length);
246   } else {
247     // We have to make sure all elements conform to the destination array
248     Klass* bound = ObjArrayKlass::cast(d->klass())->element_klass();
249     Klass* stype = ObjArrayKlass::cast(s->klass())->element_klass();
250     // Perform null check if dst is null-free but src has no such guarantee
251     bool null_check = ((!s->klass()->is_null_free_array_klass()) &&
252         d->klass()->is_null_free_array_klass());
253     if (stype == bound || stype->is_subtype_of(bound)) {
254       if (null_check) {
255         ArrayAccess<ARRAYCOPY_DISJOINT | ARRAYCOPY_NOTNULL>::oop_arraycopy(s, src_offset, d, dst_offset, length);
256       } else {
257         ArrayAccess<ARRAYCOPY_DISJOINT>::oop_arraycopy(s, src_offset, d, dst_offset, length);
258       }
259     } else {
260       if (null_check) {
261         ArrayAccess<ARRAYCOPY_DISJOINT | ARRAYCOPY_CHECKCAST | ARRAYCOPY_NOTNULL>::oop_arraycopy(s, src_offset, d, dst_offset, length);
262       } else {
263         ArrayAccess<ARRAYCOPY_DISJOINT | ARRAYCOPY_CHECKCAST>::oop_arraycopy(s, src_offset, d, dst_offset, length);












264       }
265     }
266   }
267 }
268 
269 void ObjArrayKlass::copy_array(arrayOop s, int src_pos, arrayOop d,
270                                int dst_pos, int length, TRAPS) {
271   assert(s->is_objArray(), "must be obj array");
272 
273   if (UseFlatArray) {
274     if (d->is_flatArray()) {
275       FlatArrayKlass::cast(d->klass())->copy_array(s, src_pos, d, dst_pos, length, THREAD);
276       return;
277     }
278   }
279 
280   if (!d->is_objArray()) {
281     ResourceMark rm(THREAD);
282     stringStream ss;
283     if (d->is_typeArray()) {
284       ss.print("arraycopy: type mismatch: can not copy object array[] into %s[]",
285                type2name_tab[ArrayKlass::cast(d->klass())->element_type()]);
286     } else {
287       ss.print("arraycopy: destination type %s is not an array", d->klass()->external_name());
288     }
289     THROW_MSG(vmSymbols::java_lang_ArrayStoreException(), ss.as_string());
290   }
291 
292   // Check is all offsets and lengths are non negative
293   if (src_pos < 0 || dst_pos < 0 || length < 0) {
294     // Pass specific exception reason.
295     ResourceMark rm(THREAD);
296     stringStream ss;
297     if (src_pos < 0) {
298       ss.print("arraycopy: source index %d out of bounds for object array[%d]",
299                src_pos, s->length());

402   return (element_flags & (JVM_ACC_PUBLIC | JVM_ACC_PRIVATE | JVM_ACC_PROTECTED))
403                         | (JVM_ACC_ABSTRACT | JVM_ACC_FINAL);
404 }
405 
406 ModuleEntry* ObjArrayKlass::module() const {
407   assert(bottom_klass() != nullptr, "ObjArrayKlass returned unexpected null bottom_klass");
408   // The array is defined in the module of its bottom class
409   return bottom_klass()->module();
410 }
411 
412 PackageEntry* ObjArrayKlass::package() const {
413   assert(bottom_klass() != nullptr, "ObjArrayKlass returned unexpected null bottom_klass");
414   return bottom_klass()->package();
415 }
416 
417 // Printing
418 
419 void ObjArrayKlass::print_on(outputStream* st) const {
420 #ifndef PRODUCT
421   Klass::print_on(st);
422   st->print(" - element klass: ");
423   element_klass()->print_value_on(st);
424   st->cr();
425 #endif //PRODUCT
426 }
427 
428 void ObjArrayKlass::print_value_on(outputStream* st) const {
429   assert(is_klass(), "must be klass");
430 
431   element_klass()->print_value_on(st);
432   st->print("[]");
433 }
434 
435 #ifndef PRODUCT
436 
437 void ObjArrayKlass::oop_print_on(oop obj, outputStream* st) {
438   ArrayKlass::oop_print_on(obj, st);
439   assert(obj->is_objArray(), "must be objArray");
440   objArrayOop oa = objArrayOop(obj);
441   int print_len = MIN2(oa->length(), MaxElementPrintSize);
442   for(int index = 0; index < print_len; index++) {

464   st->print("[%d] ", len);
465   if (obj != nullptr) {
466     obj->print_address_on(st);
467   } else {
468     st->print_cr("null");
469   }
470 }
471 
472 const char* ObjArrayKlass::internal_name() const {
473   return external_name();
474 }
475 
476 
477 // Verification
478 
479 void ObjArrayKlass::verify_on(outputStream* st) {
480   ArrayKlass::verify_on(st);
481   guarantee(element_klass()->is_klass(), "should be klass");
482   guarantee(bottom_klass()->is_klass(), "should be klass");
483   Klass* bk = bottom_klass();
484   guarantee(bk->is_instance_klass() || bk->is_typeArray_klass() || bk->is_flatArray_klass(),
485             "invalid bottom klass");
486 }
487 
488 void ObjArrayKlass::oop_verify_on(oop obj, outputStream* st) {
489   ArrayKlass::oop_verify_on(obj, st);
490   guarantee(obj->is_objArray(), "must be objArray");
491   guarantee(obj->is_null_free_array() || (!is_null_free_array_klass()), "null-free klass but not object");
492   objArrayOop oa = objArrayOop(obj);
493   for(int index = 0; index < oa->length(); index++) {
494     guarantee(oopDesc::is_oop_or_null(oa->obj_at(index)), "should be oop");
495   }
496 }
< prev index next >