< prev index next >

src/hotspot/share/oops/objArrayKlass.cpp

Print this page

  5  * This code is free software; you can redistribute it and/or modify it
  6  * under the terms of the GNU General Public License version 2 only, as
  7  * published by the Free Software Foundation.
  8  *
  9  * This code is distributed in the hope that it will be useful, but WITHOUT
 10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 12  * version 2 for more details (a copy is included in the LICENSE file that
 13  * accompanied this code).
 14  *
 15  * You should have received a copy of the GNU General Public License version
 16  * 2 along with this work; if not, write to the Free Software Foundation,
 17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 18  *
 19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 20  * or visit www.oracle.com if you need additional information or have any
 21  * questions.
 22  *
 23  */
 24 

 25 #include "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_klass(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_klass(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_instance(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_instance(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());
246     } else if (dst_pos < 0) {
247       ss.print("arraycopy: destination index %d out of bounds for object array[%d]",
248                dst_pos, d->length());
249     } else {
250       ss.print("arraycopy: length %d is negative", length);
251     }
252     THROW_MSG(vmSymbols::java_lang_ArrayIndexOutOfBoundsException(), ss.as_string());
253   }
254   // Check if the ranges are valid
255   if ((((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length()) ||
256       (((unsigned int) length + (unsigned int) dst_pos) > (unsigned int) d->length())) {
257     // Pass specific exception reason.
258     ResourceMark rm(THREAD);
259     stringStream ss;
260     if (((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length()) {
261       ss.print("arraycopy: last source index %u out of bounds for object array[%d]",
262                (unsigned int) length + (unsigned int) src_pos, s->length());
263     } else {
264       ss.print("arraycopy: last destination index %u out of bounds for object array[%d]",
265                (unsigned int) length + (unsigned int) dst_pos, d->length());
266     }
267     THROW_MSG(vmSymbols::java_lang_ArrayIndexOutOfBoundsException(), ss.as_string());
268   }
269 
270   // Special case. Boundary cases must be checked first
271   // This allows the following call: copy_array(s, s.length(), d.length(), 0).
272   // This is correct, since the position is supposed to be an 'in between point', i.e., s.length(),
273   // points to the right of the last element.
274   if (length==0) {
275     return;
276   }
277   if (UseCompressedOops) {
278     size_t src_offset = (size_t) objArrayOopDesc::obj_at_offset<narrowOop>(src_pos);
279     size_t dst_offset = (size_t) objArrayOopDesc::obj_at_offset<narrowOop>(dst_pos);
280     assert(arrayOopDesc::obj_offset_to_raw<narrowOop>(s, src_offset, nullptr) ==
281            objArrayOop(s)->obj_at_addr<narrowOop>(src_pos), "sanity");
282     assert(arrayOopDesc::obj_offset_to_raw<narrowOop>(d, dst_offset, nullptr) ==
283            objArrayOop(d)->obj_at_addr<narrowOop>(dst_pos), "sanity");
284     do_copy(s, src_offset, d, dst_offset, length, CHECK);
285   } else {
286     size_t src_offset = (size_t) objArrayOopDesc::obj_at_offset<oop>(src_pos);
287     size_t dst_offset = (size_t) objArrayOopDesc::obj_at_offset<oop>(dst_pos);
288     assert(arrayOopDesc::obj_offset_to_raw<oop>(s, src_offset, nullptr) ==
289            objArrayOop(s)->obj_at_addr<oop>(src_pos), "sanity");
290     assert(arrayOopDesc::obj_offset_to_raw<oop>(d, dst_offset, nullptr) ==
291            objArrayOop(d)->obj_at_addr<oop>(dst_pos), "sanity");
292     do_copy(s, src_offset, d, dst_offset, length, CHECK);
293   }
294 }
295 
296 bool ObjArrayKlass::can_be_primary_super_slow() const {
297   if (!bottom_klass()->can_be_primary_super())
298     // array of interfaces
299     return false;
300   else
301     return Klass::can_be_primary_super_slow();
302 }
303 
304 GrowableArray<Klass*>* ObjArrayKlass::compute_secondary_supers(int num_extra_slots,
305                                                                Array<InstanceKlass*>* transitive_interfaces) {
306   assert(transitive_interfaces == nullptr, "sanity");
307   // interfaces = { cloneable_klass, serializable_klass, elemSuper[], ... };
308   const Array<Klass*>* elem_supers = element_klass()->secondary_supers();
309   int num_elem_supers = elem_supers == nullptr ? 0 : elem_supers->length();
310   int num_secondaries = num_extra_slots + 2 + num_elem_supers;
311   if (num_secondaries == 2) {
312     // Must share this for correct bootstrapping!
313     set_secondary_supers(Universe::the_array_interfaces_array(),

318     secondaries->push(vmClasses::Cloneable_klass());
319     secondaries->push(vmClasses::Serializable_klass());
320     for (int i = 0; i < num_elem_supers; i++) {
321       Klass* elem_super = elem_supers->at(i);
322       Klass* array_super = elem_super->array_klass_or_null();
323       assert(array_super != nullptr, "must already have been created");
324       secondaries->push(array_super);
325     }
326     return secondaries;
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++) {
388     st->print(" - %3d : ", index);
389     if (oa->obj_at(index) != nullptr) {
390       oa->obj_at(index)->print_value_on(st);
391       st->cr();
392     } else {
393       st->print_cr("null");
394     }
395   }
396   int remaining = oa->length() - print_len;
397   if (remaining > 0) {
398     st->print_cr(" - <%d more elements, increase MaxElementPrintSize to print>", remaining);
399   }
400 }
401 
402 #endif //PRODUCT
403 
404 void ObjArrayKlass::oop_print_value_on(oop obj, outputStream* st) {
405   assert(obj->is_objArray(), "must be objArray");
406   st->print("a ");
407   element_klass()->print_value_on(st);
408   int len = objArrayOop(obj)->length();
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 }

  5  * This code is free software; you can redistribute it and/or modify it
  6  * under the terms of the GNU General Public License version 2 only, as
  7  * published by the Free Software Foundation.
  8  *
  9  * This code is distributed in the hope that it will be useful, but WITHOUT
 10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 12  * version 2 for more details (a copy is included in the LICENSE file that
 13  * accompanied this code).
 14  *
 15  * You should have received a copy of the GNU General Public License version
 16  * 2 along with this work; if not, write to the Free Software Foundation,
 17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 18  *
 19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 20  * or visit www.oracle.com if you need additional information or have any
 21  * questions.
 22  *
 23  */
 24 
 25 #include "cds/cdsConfig.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/flatArrayKlass.hpp"
 40 #include "oops/instanceKlass.hpp"
 41 #include "oops/klass.inline.hpp"
 42 #include "oops/markWord.hpp"
 43 #include "oops/objArrayKlass.inline.hpp"
 44 #include "oops/objArrayOop.inline.hpp"
 45 #include "oops/oop.inline.hpp"
 46 #include "oops/refArrayKlass.hpp"
 47 #include "oops/symbol.hpp"
 48 #include "runtime/arguments.hpp"
 49 #include "runtime/handles.inline.hpp"
 50 #include "runtime/mutexLocker.hpp"
 51 #include "utilities/macros.hpp"
 52 
 53 ObjArrayKlass* ObjArrayKlass::allocate_klass(ClassLoaderData* loader_data, int n,
 54                                        Klass* k, Symbol* name, ArrayKlass::ArrayProperties props,
 55                                        TRAPS) {
 56   assert(ObjArrayKlass::header_size() <= InstanceKlass::header_size(),
 57       "array klasses must be same size as InstanceKlass");
 58 
 59   int size = ArrayKlass::static_size(ObjArrayKlass::header_size());
 60 
 61   return new (loader_data, size, THREAD) ObjArrayKlass(n, k, name, Kind, props, ArrayKlass::is_null_restricted(props) ? markWord::null_free_array_prototype() : markWord::prototype());
 62 }
 63 
 64 ObjArrayKlass* ObjArrayKlass::allocate_objArray_klass(ClassLoaderData* loader_data,
 65                                                       int n, Klass* element_klass,  TRAPS) {
 66 
 67   // Eagerly allocate the direct array supertype.
 68   Klass* super_klass = nullptr;
 69   if (!Universe::is_bootstrapping() || vmClasses::Object_klass_loaded()) {
 70     assert(MultiArray_lock->holds_lock(THREAD), "must hold lock after bootstrapping");
 71     Klass* element_super = element_klass->super();
 72     if (element_super != nullptr) {
 73       // The element type has a direct super.  E.g., String[] has direct super of Object[].
 74       // Also, see if the element has secondary supertypes.
 75       // We need an array type for each before creating this array type.
 76       super_klass = element_super->array_klass(CHECK_NULL);
 77       const Array<Klass*>* element_supers = element_klass->secondary_supers();
 78       for (int i = element_supers->length() - 1; i >= 0; i--) {
 79         Klass* elem_super = element_supers->at(i);
 80         elem_super->array_klass(CHECK_NULL);
 81       }
 82       // Fall through because inheritance is acyclic and we hold the global recursive lock to allocate all the arrays.
 83     } else {
 84       // The element type is already Object.  Object[] has direct super of Object.
 85       super_klass = vmClasses::Object_klass();
 86     }
 87   }
 88 
 89   // Create type name for klass.
 90   Symbol* name = ArrayKlass::create_element_klass_array_name(element_klass, CHECK_NULL);


















 91 
 92   // Initialize instance variables
 93   ObjArrayKlass* oak = ObjArrayKlass::allocate_klass(loader_data, n, element_klass, name, ArrayProperties::INVALID, CHECK_NULL);
 94 
 95   ModuleEntry* module = oak->module();
 96   assert(module != nullptr, "No module entry for array");
 97 
 98   // Call complete_create_array_klass after all instance variables has been initialized.
 99   ArrayKlass::complete_create_array_klass(oak, super_klass, module, CHECK_NULL);
100 
101   // Add all classes to our internal class loader list here,
102   // including classes in the bootstrap (null) class loader.
103   // Do this step after creating the mirror so that if the
104   // mirror creation fails, loaded_classes_do() doesn't find
105   // an array class without a mirror.
106   loader_data->add_class(oak);
107 
108   return oak;
109 }
110 
111 ObjArrayKlass::ObjArrayKlass(int n, Klass* element_klass, Symbol* name, KlassKind kind, ArrayKlass::ArrayProperties props, markWord mk) :
112 ArrayKlass(name, kind, props, mk) {
113   set_dimension(n);
114   set_element_klass(element_klass);
115   set_next_refined_klass_klass(nullptr);
116   set_properties(props);
117 
118   Klass* bk;
119   if (element_klass->is_objArray_klass()) {
120     bk = ObjArrayKlass::cast(element_klass)->bottom_klass();
121   } else {
122     assert(!element_klass->is_refArray_klass(), "Sanity");
123     bk = element_klass;
124   }
125   assert(bk != nullptr && (bk->is_instance_klass() || bk->is_typeArray_klass()), "invalid bottom klass");
126   set_bottom_klass(bk);
127   set_class_loader_data(bk->class_loader_data());
128 
129   if (element_klass->is_array_klass()) {
130     set_lower_dimension(ArrayKlass::cast(element_klass));
131   }
132 
133   int lh = array_layout_helper(T_OBJECT);
134   if (ArrayKlass::is_null_restricted(props)) {
135     assert(n == 1, "Bytecode does not support null-free multi-dim");
136     lh = layout_helper_set_null_free(lh);
137 #ifdef _LP64
138     assert(prototype_header().is_null_free_array(), "sanity");
139 #endif
140   }
141   set_layout_helper(lh);
142   assert(is_array_klass(), "sanity");
143   assert(is_objArray_klass(), "sanity");
144 }
145 
146 size_t ObjArrayKlass::oop_size(oop obj) const {
147   // In this assert, we cannot safely access the Klass* with compact headers,
148   // because size_given_klass() calls oop_size() on objects that might be
149   // concurrently forwarded, which would overwrite the Klass*.
150   assert(UseCompactObjectHeaders || obj->is_objArray(), "must be object array");
151   // return objArrayOop(obj)->object_size();
152   return obj->is_flatArray() ? flatArrayOop(obj)->object_size(layout_helper()) : refArrayOop(obj)->object_size();
153 }
154 
155 ArrayDescription ObjArrayKlass::array_layout_selection(Klass* element, ArrayProperties properties) {
156   // TODO FIXME: the layout selection should take the array size in consideration
157   // to avoid creation of arrays too big to be handled by the VM. See JDK-8233189
158   if (!UseArrayFlattening || element->is_array_klass() || element->is_identity_class() || element->is_abstract()) {
159     return ArrayDescription(RefArrayKlassKind, properties, LayoutKind::REFERENCE);
160   }
161   assert(element->is_final(), "Flat layouts below require monomorphic elements");
162   InlineKlass* vk = InlineKlass::cast(element);
163   if (is_null_restricted(properties)) {
164     if (is_non_atomic(properties)) {
165       // Null-restricted + non-atomic
166       if (vk->maybe_flat_in_array() && vk->has_non_atomic_layout()) {
167         return ArrayDescription(FlatArrayKlassKind, properties, LayoutKind::NON_ATOMIC_FLAT);
168       } else {
169         return ArrayDescription(RefArrayKlassKind, properties, LayoutKind::REFERENCE);
170       }
171     } else {
172       // Null-restricted + atomic
173       if (vk->maybe_flat_in_array() && vk->is_naturally_atomic() && vk->has_non_atomic_layout()) {
174         return ArrayDescription(FlatArrayKlassKind, properties, LayoutKind::NON_ATOMIC_FLAT);
175       } else if (vk->maybe_flat_in_array() && vk->has_atomic_layout()) {
176         return ArrayDescription(FlatArrayKlassKind, properties, LayoutKind::ATOMIC_FLAT);
177       } else {
178         return ArrayDescription(RefArrayKlassKind, properties, LayoutKind::REFERENCE);
179       }
180     }
181   } else {
182     // nullable implies atomic, so the non-atomic property is ignored
183     if (vk->maybe_flat_in_array() && vk->has_nullable_atomic_layout()) {
184       return ArrayDescription(FlatArrayKlassKind, properties, LayoutKind::NULLABLE_ATOMIC_FLAT);
185     } else {
186       return ArrayDescription(RefArrayKlassKind, properties, LayoutKind::REFERENCE);
187     }
188   }
189 }
190 
191 objArrayOop ObjArrayKlass::allocate_instance(int length, ArrayProperties props, TRAPS) {
192   check_array_allocation_length(length, arrayOopDesc::max_array_length(T_OBJECT), CHECK_NULL);
193   ObjArrayKlass* ak = klass_with_properties(props, THREAD);
194   size_t size = 0;
195   switch(ak->kind()) {
196     case Klass::RefArrayKlassKind:
197       size = refArrayOopDesc::object_size(length);
198       break;
199     case Klass::FlatArrayKlassKind:
200       size = flatArrayOopDesc::object_size(ak->layout_helper(), length);
201       break;
202     default:
203       ShouldNotReachHere();
204   }
205   assert(size != 0, "Sanity check");
206   objArrayOop array = (objArrayOop)Universe::heap()->array_allocate(
207     ak, size, length,
208     /* do_zero */ true, CHECK_NULL);
209   assert(array->is_refArray() || array->is_flatArray(), "Must be");
210   objArrayHandle array_h(THREAD, array);
211   return array_h();
212 }
213 
214 oop ObjArrayKlass::multi_allocate(int rank, jint* sizes, TRAPS) {
215   int length = *sizes;
216   ArrayKlass* ld_klass = lower_dimension();
217   // If length < 0 allocate will throw an exception.
218   ObjArrayKlass* oak = klass_with_properties(ArrayProperties::DEFAULT, CHECK_NULL);
219   assert(oak->is_refArray_klass() || oak->is_flatArray_klass(), "Must be");
220   objArrayOop array = oak->allocate_instance(length, ArrayProperties::DEFAULT, CHECK_NULL);
221   objArrayHandle h_array (THREAD, array);
222   if (rank > 1) {
223     if (length != 0) {
224       for (int index = 0; index < length; index++) {
225         oop sub_array = ld_klass->multi_allocate(rank-1, &sizes[1], CHECK_NULL);
226         h_array->obj_at_put(index, sub_array);
227       }
228     } else {
229       // Since this array dimension has zero length, nothing will be
230       // allocated, however the lower dimension values must be checked
231       // for illegal values.
232       for (int i = 0; i < rank - 1; ++i) {
233         sizes += 1;
234         if (*sizes < 0) {
235           THROW_MSG_NULL(vmSymbols::java_lang_NegativeArraySizeException(), err_msg("%d", *sizes));
236         }
237       }
238     }
239   }
240   return h_array();
241 }
242 




































243 void ObjArrayKlass::copy_array(arrayOop s, int src_pos, arrayOop d,
244                                int dst_pos, int length, TRAPS) {
245   assert(s->is_objArray(), "must be obj array");
246 
247   if (UseArrayFlattening) {
248     if (d->is_flatArray()) {
249       FlatArrayKlass::cast(d->klass())->copy_array(s, src_pos, d, dst_pos, length, THREAD);
250       return;





















251     }
252     if (s->is_flatArray()) {
253       FlatArrayKlass::cast(s->klass())->copy_array(s, src_pos, d, dst_pos, length, THREAD);
254       return;











255     }

256   }
257 
258   assert(s->is_refArray() && d->is_refArray(), "Must be");
259   RefArrayKlass::cast(s->klass())->copy_array(s, src_pos, d, dst_pos, length, THREAD);






















260 }
261 
262 bool ObjArrayKlass::can_be_primary_super_slow() const {
263   if (!bottom_klass()->can_be_primary_super())
264     // array of interfaces
265     return false;
266   else
267     return Klass::can_be_primary_super_slow();
268 }
269 
270 GrowableArray<Klass*>* ObjArrayKlass::compute_secondary_supers(int num_extra_slots,
271                                                                Array<InstanceKlass*>* transitive_interfaces) {
272   assert(transitive_interfaces == nullptr, "sanity");
273   // interfaces = { cloneable_klass, serializable_klass, elemSuper[], ... };
274   const Array<Klass*>* elem_supers = element_klass()->secondary_supers();
275   int num_elem_supers = elem_supers == nullptr ? 0 : elem_supers->length();
276   int num_secondaries = num_extra_slots + 2 + num_elem_supers;
277   if (num_secondaries == 2) {
278     // Must share this for correct bootstrapping!
279     set_secondary_supers(Universe::the_array_interfaces_array(),

284     secondaries->push(vmClasses::Cloneable_klass());
285     secondaries->push(vmClasses::Serializable_klass());
286     for (int i = 0; i < num_elem_supers; i++) {
287       Klass* elem_super = elem_supers->at(i);
288       Klass* array_super = elem_super->array_klass_or_null();
289       assert(array_super != nullptr, "must already have been created");
290       secondaries->push(array_super);
291     }
292     return secondaries;
293   }
294 }
295 
296 void ObjArrayKlass::initialize(TRAPS) {
297   bottom_klass()->initialize(THREAD);  // dispatches to either InstanceKlass or TypeArrayKlass
298 }
299 
300 void ObjArrayKlass::metaspace_pointers_do(MetaspaceClosure* it) {
301   ArrayKlass::metaspace_pointers_do(it);
302   it->push(&_element_klass);
303   it->push(&_bottom_klass);
304   if (_next_refined_array_klass != nullptr && !CDSConfig::is_dumping_dynamic_archive()) {
305     it->push(&_next_refined_array_klass);
306   }
307 }
308 
309 void ObjArrayKlass::restore_unshareable_info(ClassLoaderData* loader_data, Handle protection_domain, TRAPS) {
310   ArrayKlass::restore_unshareable_info(loader_data, protection_domain, CHECK);
311   if (_next_refined_array_klass != nullptr) {
312     _next_refined_array_klass->restore_unshareable_info(loader_data, protection_domain, CHECK);
313   }
314 }
315 
316 void ObjArrayKlass::remove_unshareable_info() {
317   ArrayKlass::remove_unshareable_info();
318   if (_next_refined_array_klass != nullptr && !CDSConfig::is_dumping_dynamic_archive()) {
319     _next_refined_array_klass->remove_unshareable_info();
320   } else {
321     _next_refined_array_klass = nullptr;
322   }
323 }
324 
325 void ObjArrayKlass::remove_java_mirror() {
326   ArrayKlass::remove_java_mirror();
327   if (_next_refined_array_klass != nullptr) {
328     _next_refined_array_klass->remove_java_mirror();
329   }
330 }
331 
332 u2 ObjArrayKlass::compute_modifier_flags() const {
333   // The modifier for an objectArray is the same as its element
334   assert (element_klass() != nullptr, "should be initialized");
335 
336   // Return the flags of the bottom element type.
337   u2 element_flags = bottom_klass()->compute_modifier_flags();
338 
339   int identity_flag = (Arguments::enable_preview()) ? JVM_ACC_IDENTITY : 0;
340 
341   return (element_flags & (JVM_ACC_PUBLIC | JVM_ACC_PRIVATE | JVM_ACC_PROTECTED))
342                         | (identity_flag | JVM_ACC_ABSTRACT | JVM_ACC_FINAL);
343 }
344 
345 ModuleEntry* ObjArrayKlass::module() const {
346   assert(bottom_klass() != nullptr, "ObjArrayKlass returned unexpected null bottom_klass");
347   // The array is defined in the module of its bottom class
348   return bottom_klass()->module();
349 }
350 
351 PackageEntry* ObjArrayKlass::package() const {
352   assert(bottom_klass() != nullptr, "ObjArrayKlass returned unexpected null bottom_klass");
353   return bottom_klass()->package();
354 }
355 
356 ObjArrayKlass* ObjArrayKlass::klass_with_properties(ArrayKlass::ArrayProperties props, TRAPS) {
357   assert(props != ArrayProperties::INVALID, "Sanity check");
358 
359   if (properties() == props) {
360     assert(is_refArray_klass() || is_flatArray_klass(), "Must be a concrete array klass");
361     return this;
362   }
363 
364   ObjArrayKlass* ak = next_refined_array_klass_acquire();
365   if (ak == nullptr) {
366     // Ensure atomic creation of refined array klasses
367     RecursiveLocker rl(MultiArray_lock, THREAD);
368 
369     if (next_refined_array_klass() ==  nullptr) {
370       ArrayDescription ad = ObjArrayKlass::array_layout_selection(element_klass(), props);
371       switch (ad._kind) {
372         case Klass::RefArrayKlassKind: {
373           ak = RefArrayKlass::allocate_refArray_klass(class_loader_data(), dimension(), element_klass(), props, CHECK_NULL);
374           break;
375         }
376         case Klass::FlatArrayKlassKind: {
377           assert(dimension() == 1, "Flat arrays can only be dimension 1 arrays");
378           ak = FlatArrayKlass::allocate_klass(element_klass(), props, ad._layout_kind, CHECK_NULL);
379           break;
380         }
381         default:
382           ShouldNotReachHere();
383       }
384       release_set_next_refined_klass(ak);
385     }
386   }
387 
388   ak = next_refined_array_klass();
389   assert(ak != nullptr, "should be set");
390   THREAD->check_possible_safepoint();
391   return ak->klass_with_properties(props, THREAD); // why not CHECK_NULL ?
392 }
393 
394 
395 // Printing
396 
397 void ObjArrayKlass::print_on(outputStream* st) const {
398 #ifndef PRODUCT
399   Klass::print_on(st);
400   st->print(" - element klass: ");
401   element_klass()->print_value_on(st);
402   st->cr();
403 #endif //PRODUCT
404 }
405 
406 void ObjArrayKlass::print_value_on(outputStream* st) const {
407   assert(is_klass(), "must be klass");
408 
409   element_klass()->print_value_on(st);
410   st->print("[]");
411 }
412 
413 #ifndef PRODUCT
414 
415 void ObjArrayKlass::oop_print_on(oop obj, outputStream* st) {
416   ShouldNotReachHere();
















417 }
418 
419 #endif //PRODUCT
420 
421 void ObjArrayKlass::oop_print_value_on(oop obj, outputStream* st) {
422   ShouldNotReachHere();









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 >